求做一个简单C++题目
求做一个简单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要有具体代码
最佳回答
假设字符串存放在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
热门文章
- 康达学院专转本五年制
- 高考一个考场分ab卷吗
- not only but also用法
- 某物体做自由落体运动,从释放开始计时,则物体在前2s内的平均速度为______m/s,物体下落2m时的速度大小为______m/s.
- 三角函数公式大全表格
- 地理中考必背知识点2022
- 2013-2014学年小学六年级科学上学期期末考试试卷及答案
- 人教版2014-2015学年小学五年级英语第二学期期中教学质量检测试卷及答案
- 【Linux驱动开发】设备树详解(二)设备树语法详解
- 别跟客户扯细节
- 在别的城市买房子能落户吗
- 卖房前要把装修贷还完吗
- 高中政治教学提高教学效果的方法探究
- “互联网+”背景下的初中英语课堂教学改革与创新策略研究
- 2022年终止合同范本
- 租房合同范本范文
- 如何挑选土豆
- 如何挑选土鸡
