Poj_1298 The Hardest Problem Ever
2014-07-13 23:04
274 查看
用codeblocks一開始未設定字符數組endin的大小,char endin[]={'E','N','D','O','F','I','N','P','U','T'};但是用strcmp比較的時候一直出問題,才發現沒設定大小,在后面可能有其他亂字符。改成char endin[11]={'E','N','D','O','F','I','N','P','U','T'};就正常了。
在環狀循環數組中,有固定前後關係的位置可以用取餘數來得到固定關係的位置,這題是原文是密碼文的後5個,所以原文要減5,這題就是(c[i]-'A'-5+26)%26+'A'。
========
在環狀循環數組中,有固定前後關係的位置可以用取餘數來得到固定關係的位置,這題是原文是密碼文的後5個,所以原文要減5,這題就是(c[i]-'A'-5+26)%26+'A'。
========
1298 | Accepted | 128K | 0MS | C++ | 933B | 2014-07-13 23:29:01 |
#include<cstdio> #include<cstdlib> #include<cstring> using namespace std; #define range 210 int main() { freopen("in.txt","r",stdin); char start[20],endd[20],c[range],cc[range]; char endin[11]={'E','N','D','O','F','I','N','P','U','T'}; int i,j,n,m; while(1) { gets(start); int k=strcmp(start,endin); // printf("k=%d\n",k); // printf("endin=%s len=%d\n",endin,strlen(endin)); if(k==0) break; gets(c); gets(endd); // printf("%s\n%s\n",start,c); int len=strlen(c); memset(cc,'\0',sizeof(cc)); for(i=0;i<len;i++) { if(c[i]>='A' && c[i]<='Z') { char temp; temp=(c[i]-'A'-5+26)%26+'A'; cc[i]=temp; } else cc[i]=c[i]; } for(i=0;i<len;i++) printf("%c",cc[i]); printf("\n"); } return 0; }
相关文章推荐
- POJ 1298 The Hardest Problem Ever
- POJ 1298 The Hardest Problem Ever
- Poj1298_The Hardest Problem Ever(水题)
- poj 1298 The Hardest Problem Ever
- 字符处理题poj1298-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
- Poj1298_The Hardest Problem Ever(水题)
- POJ1298 The Hardest Problem Ever
- poj 1298 The Hardest Problem Ever
- POJ 1298 && HDU 1048 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(我的水题之路——解密,水题)