POJ1298 The Hardest Problem Ever
来源:互联网 发布:富二代体验知乎 编辑:程序博客网 时间:2024/06/07 06:52
题目链接:http://poj.org/problem?id=1298
解题思路:
水题,直接上代码。
AC代码:
#include<iostream>#include<cstdio>#include<cctype>#include<string>using namespace std;int main(){ string a,b,c; while(getline(cin,a)) { if(a=="ENDOFINPUT") break; getline(cin,b); int l=b.size(); for(int i=0;i<l;i++) if(isalpha(b[i])) b[i]=(b[i]-'A'+26-5)%26+'A'; printf("%s\n",b.c_str()); getline(cin,c); } return 0;}
0 0
- POJ1298 The Hardest Problem Ever
- POJ1298 The Hardest Problem Ever
- POJ1298 The Hardest Problem Ever
- 字符处理题poj1298-The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- HDU1048 The Hardest Problem Ever
- 1048 The Hardest Problem Ever
- POJ1218 THE DRUNK JAILER
- POJ2590 Steps
- POJ2105 IP Address
- POJ2365 Rope
- [转]Android蓝牙开发浅谈
- POJ1298 The Hardest Problem Ever
- Flume+kafka+storm整合
- systemctl替代service与chkconfig
- HDU1028 Ignatius and the Princess III(母函数模板)
- POJ 2328 解题报告
- UVA12627 Erratic Expansion
- IT小李传--药店里的装饰模式
- Apache Hadoop 2.6.0 新特性
- 第12 章 索引