POJ1298_The Hardest Problem Ever_最难的问题_Caesar 密码_C++
2016-10-13 15:20
627 查看
题目:http://poj.org/problem?id=1298
好吧,给了题目也看不懂……给出翻译(题目名翻译是:最难的问题,233333)
这一看就是老师给出题解:
然而没有什么用哈
最快的办法是,把下面的密文直接拷过来,建个字符数组
然后读入,判断是否是 ENDOFINPUT
不是就读入原文,把大写字母翻译出来
记得换行
最后读掉 END
版权所有,转载请联系作者,违者必究
联系方式:http://www.cnblogs.com/hadilo/p/5932395.html
好吧,给了题目也看不懂……给出翻译(题目名翻译是:最难的问题,233333)
这一看就是老师给出题解:
然而没有什么用哈
最快的办法是,把下面的密文直接拷过来,建个字符数组
然后读入,判断是否是 ENDOFINPUT
不是就读入原文,把大写字母翻译出来
记得换行
最后读掉 END
#include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<iostream> #include<algorithm> using namespace std; const char hs[26]={'V','W','X','Y','Z','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U'}; char s[101]; int main() { int i,len; while (1) { gets(s); if (s[0]=='E'&&s[1]=='N'&&s[2]=='D'&&s[3]=='O'&&s[4]=='F'&&s[5]=='I'&&s[6]=='N'&&s[7]=='P'&&s[8]=='U'&&s[9]=='T'&&s[10]=='\0') return 0; gets(s); len=strlen(s); for (i=0;i<len;i++) { if (s[i]>='A'&&s[i]<='Z') putchar(hs[s[i]-'A']); else putchar(s[i]); } putchar('\n'); gets(s); } }
版权所有,转载请联系作者,违者必究
联系方式:http://www.cnblogs.com/hadilo/p/5932395.html
相关文章推荐
- poj1298 The Hardest Problem Ever
- poj1298 The Hardest Problem Ever ——水题
- HDU-1048-The Hardest Problem Ever(C++ && 偶尔一水......)
- zju1392曾经最难的问题The Hardest Problem Ever
- 破解密码(原题目:The Hardest Problem Ever)
- hdu_1048_The Hardest Problem Ever_字符输入输出问题水题一道
- POJ1298 The Hardest Problem Ever
- poj 1298(The Hardest Problem Ever)
- poj 1298 The Hardest Problem Ever
- HDOJ The Hardest Problem Ever 运行时错误Runtime Error (ACCESS_VIOLATION)可能是数组越界
- 1048 The Hardest Problem Ever
- The Hardest Problem Ever(字符串处理,易)
- poj 1298 The Hardest Problem Ever
- 1298 The Hardest Problem Ever
- POJ 1298 The Hardest Problem Ever
- The Hardest Problem Ever(字符串处理,易)
- 1048 The Hardest Problem Ever
- zoj 1392 The Hardest Problem Ever
- The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever