求做一个简单C++题目

学习 时间:2026-04-09 01:02:35 阅读:8972
求做一个简单C++题目For most fonts, the lowercase letters b and d are mirror images of each other, as are the letters p and q.Furthermore, letters i, o, v, w, and x are naturally mirror images of themselves. Although othersymmetries exists for certain fonts, we consider only those specifically mentioned thus far for theremainder of this problem.Because of these symmetries, it is possible to encode certain words based upon how those words wouldappear in the mirror. For example the word boxwood would appear as boowxod, and the word ibid asbidi. Given a particular sequence of letters, you are to determine its mirror image or to note that it isinvalid.Input: The input contains a series of letter sequences, one per line, followed by a single line with the #character. Each letter sequence consists entirely of lowercase letters.Output: For each letter sequence in the input, if its mirror image is a legitimate letter sequence basedupon the given symmetries, then output that mirror image. If the mirror image does not form a legitimatesequence of characters, then output the word INVALID.Example Input: boowxodbidibedbbb#Example Output:boxwoodibidINVALIDddd要有具体代码

最佳回答

清脆的向日葵

虚拟的曲奇

2026-04-09 01:02:35

假设字符串存放在input。txt中,程序从文件中读入数据。#include#include#include#includeusing namespace std;int main( void ){ ifstream ifs( "input。txt" ); string strSource( "bdiovwx" ); string str; while( ifs>> str ) { if( str == "#" ) { break; } unsigned int n = str。find_first_not_of( strSource, 0 ); if( n == string::npos ) //没找到,说明输入的字符串中的字符都是“mirror"的。 { string::reverse_iterator rEnd = str。rend(), rIter; for( rIter = str。rbegin(); rIter != rEnd; ++rIter ) //反向输出 { if( *rIter == 'b' ) //很抱歉,我实在是想不到高级而且简单的方法了。 { *rIter = 'd'; } else if( *rIter == 'd' ) { *rIter = 'b'; } cout

最新回答共有2条回答

  • 爱撒娇的冥王星
    回复
    2026-04-09 01:02:35

    假设字符串存放在input。txt中,程序从文件中读入数据。#include#include#include#includeusing namespace std;int main( void ){ ifstream ifs( "input。txt" ); string strSource( "bdiovwx" ); string str; while( ifs>> str ) { if( str == "#" ) { break; } unsigned int n = str。find_first_not_of( strSource, 0 ); if( n == string::npos ) //没找到,说明输入的字符串中的字符都是“mirror"的。 { string::reverse_iterator rEnd = str。rend(), rIter; for( rIter = str。rbegin(); rIter != rEnd; ++rIter ) //反向输出 { if( *rIter == 'b' ) //很抱歉,我实在是想不到高级而且简单的方法了。 { *rIter = 'd'; } else if( *rIter == 'd' ) { *rIter = 'b'; } cout

上一篇 加什偏旁 

下一篇 求一些描写孤儿外貌的句子