HDOJ The Hardest Problem Ever
来源:互联网 发布:修改数据库系统时间 编辑:程序博客网 时间:2024/06/05 08:51
The Hardest Problem Ever
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 12 Accepted Submission(s) : 7
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
#include<cstdio>#include<cstdlib>#include<cstring>using namespace std;int main(){//freopen("stdin.txt","r",stdin);int i,t,l;char s[1000],c[1000];while(scanf("%s",s)!=EOF){if(strcmp(s,"ENDOFINPUT")==0)break;getchar();while(1){gets(c);l=strlen(c);if(strcmp(c,"END")==0)break;for(i=0;i<l;++i){if(c[i]>='A'&&c[i]<='Z'){if(c[i]>='F')c[i]=c[i]-'F'+'A';elsec[i]=c[i]-'A'+'V';}}printf("%s\n",c);}}return 0;}
0 0
- HDOJ 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 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 (水题)
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- android平台下的aes加密和java平台下的运行结果不同的解决办法
- Could not inspect the application package.错误解决
- IntelliJ IDEA 14 配置Tomcat8
- handler知识整理
- C/S客户端的响应处理流程
- HDOJ The Hardest Problem Ever
- Android - 线程同步
- Win7系统安装虚拟机virtualbox,系统Ubuntu Kylin 14.04.1
- 判断特殊字符
- 使用apt-mirror建立本地debian仓库源
- IOS GCD 常用
- java日期格式化输出
- App调试内存泄露之Context篇(下)
- 15周(指针分布)