POJ 1298 The Hardest Problem Ever
2012-08-03 14:56
405 查看
#include<stdio.h> #include<string.h> #include<stdlib.h> int main() { char s1[110]; char s2[15]; int i,n; while(1) { gets(s2); if(strcmp(s2,"ENDOFINPUT")==0) break; else if(strcmp(s2,"START")==0) { gets(s1); n=strlen(s1); for(i=0;i<n;i++) { if(s1[i]>='A'&&s1[i]<='Z') { s1[i]='A'+(s1[i]-'A'-5+26)%26; } } } else if(strcmp(s2,"END")==0) printf("%s\n",s1); } system("pause"); return 0; }
相关文章推荐
- POJ 1298 The Hardest Problem Ever(我的水题之路——解密,水题)
- POJ 1298 The Hardest Problem Ever
- poj 1298 The Hardest Problem Ever
- poj 1298 The Hardest Problem Ever
- POJ 1298 The Hardest Problem Ever 简单暴力
- poj 1298 The Hardest Problem Ever
- POJ 1298 The Hardest Problem Ever
- poj 1298- The Hardest Problem Ever
- POJ 1298 The Hardest Problem Ever (字符串)
- POJ 1298 The Hardest Problem Ever
- poj 1298 The Hardest Problem Ever
- poj 1298(The Hardest Problem Ever)
- poj 1298 The Hardest Problem Ever
- The Hardest Problem Ever - POJ 1298 水题
- poj 1298 The Hardest Problem Ever
- Poj_1298 The Hardest Problem Ever
- poj 1298 The Hardest Problem Ever
- Poj1298_The Hardest Problem Ever(水题)
- POJ1298 The Hardest Problem Ever
- Poj1298_The Hardest Problem Ever(水题)