HDOJ 1048-The Hardest Problem Ever
来源:互联网 发布:南京二手房数据 编辑:程序博客网 时间:2024/05/16 11:55
The Hardest Problem Ever
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21936 Accepted Submission(s): 10342
Problem Description
Julius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to survive, he decided to create one of the first ciphers. This cipher was so incredibly sound, that no one could figure it out without knowing how it worked.
You are a sub captain of Caesar's army. It is your job to decipher the messages sent by Caesar and provide to your general. The code is simple. For each letter in a plaintext message, you shift it five places to the right to create the secure message (i.e., if the letter is 'A', the cipher text would be 'F'). Since you are creating plain text out of Caesar's messages, you will do the opposite:
Cipher text
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Plain text
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
Only letters are shifted in this cipher. Any non-alphabetical character should remain the same, and all alphabetical characters will be upper case.
You are a sub captain of Caesar's army. It is your job to decipher the messages sent by Caesar and provide to your general. The code is simple. For each letter in a plaintext message, you shift it five places to the right to create the secure message (i.e., if the letter is 'A', the cipher text would be 'F'). Since you are creating plain text out of Caesar's messages, you will do the opposite:
Cipher text
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Plain text
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
Only letters are shifted in this cipher. Any non-alphabetical character should remain the same, and all alphabetical characters will be upper case.
Input
Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets. All characters will be uppercase.
A single data set has 3 components:
Start line - A single line, "START"
Cipher message - A single line containing from one to two hundred characters, inclusive, comprising a single message from Caesar
End line - A single line, "END"
Following the final data set will be a single line, "ENDOFINPUT".
A single data set has 3 components:
Start line - A single line, "START"
Cipher message - A single line containing from one to two hundred characters, inclusive, comprising a single message from Caesar
End line - A single line, "END"
Following the final data set will be a single line, "ENDOFINPUT".
Output
For each data set, there will be exactly one line of output. This is the original message by Caesar.
Sample Input
STARTNS BFW, JAJSYX TK NRUTWYFSHJ FWJ YMJ WJXZQY TK YWNANFQ HFZXJXENDSTARTN BTZQI WFYMJW GJ KNWXY NS F QNYYQJ NGJWNFS ANQQFLJ YMFS XJHTSI NS WTRJENDSTARTIFSLJW PSTBX KZQQ BJQQ YMFY HFJXFW NX RTWJ IFSLJWTZX YMFS MJENDENDOFINPUT
Sample Output
IN WAR, EVENTS OF IMPORTANCE ARE THE RESULT OF TRIVIAL CAUSESI WOULD RATHER BE FIRST IN A LITTLE IBERIAN VILLAGE THAN SECOND IN ROMEDANGER KNOWS FULL WELL THAT CAESAR IS MORE DANGEROUS THAN HE
Source
South Central USA 2002
#include <iostream>#include <cstdio>#include <cstring>using namespace std;char s1[105],s2[105],s3[105];int main(){ while(gets(s1)&&strcmp(s1,"START")==0) { memset(s2,0,sizeof(s2)); gets(s2); int l=strlen(s2); for(int i=0;i<l;i++) if(s2[i]>='A'&&s2[i]<='Z') s2[i]=(s2[i]-'A'+21)%26+'A'; gets(s3); puts(s2); } return 0;}
1 0
- HDOJ 1048 The Hardest Problem Ever
- 【HDOJ】1048 -> The Hardest Problem Ever
- hdoj 1048 The Hardest Problem Ever
- hdoj.1048 The Hardest Problem Ever 20140728
- HDOJ 1048 The Hardest Problem Ever
- HDOJ 1048 The Hardest Problem Ever
- hdoj 1048 The Hardest Problem Ever【基础】
- HDOJ 1048-The Hardest Problem Ever
- hdoj-1048-The Hardest Problem Ever
- HDOJ 1048 The Hardest Problem Ever
- HDOJ HDU 1048 The Hardest Problem Ever
- HDOJ 1048 The Hardest Problem Ever
- hdoj 1048 the hardest problem ever (水题)
- HDOJ The Hardest Problem Ever
- 1048 The Hardest Problem Ever
- 1048 The Hardest Problem Ever
- 1048:The Hardest Problem Ever
- 【算法】HDOJ-1048 The Hardest Problem Ever
- Windows7 安装.net framework 4.0 失败,错误HRESULT 0xc8000222解决办法
- bzoj1050
- SmartSvn的使用
- shiro中多用户的登陆页面(multiple login pages)配置
- 归并排序
- HDOJ 1048-The Hardest Problem Ever
- 【cocos2d 3.x】粒子plist的简单使用
- chrome显示ue-editor上传的视频问题
- tiny4412 uboot分析(2)
- 自定义图谱控件
- 设计模式六大原则(1):单一职责原则
- ANDROID L - Material Design详解(动画篇)
- spring boot环境下使用quartz设置定时任务
- IOS开发 ☞ 禁用UIWebView的默认交互行为