The Hardest Problem Ever(有史以来最难的题)
来源:互联网 发布:农村淘宝快递加盟 编辑:程序博客网 时间:2024/04/28 22:18
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19083 Accepted Submission(s): 8885
Total Submission(s): 19083 Accepted Submission(s): 8885
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<stdio.h>#include<string.h>main(){ int i,j; char x[202],b[202],str[12],d[3]; //char d[3]; while(1) { scanf("%s",&str); if(strcmp(str,"ENDOFINPUT")==0) break; getchar(); gets(x);//getchar(); scanf("%s",&d); getchar(); { j=strlen(x); for(i=0;i<j;i++ ) { if(x[i]>='A'&&x[i]<='Z') { if(x[i]+21>90) b[i]=(x[i]-5); else b[i]=(x[i]+21); } else b[i]=x[i]; } for(i=0;i<j;i++) printf("%c",b[i]); printf("\n"); } } return 0; }
0 0
- The Hardest Problem Ever(有史以来最难的题)
- zju1392曾经最难的问题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
- POJ1298 The Hardest Problem Ever
- 1048 The Hardest Problem Ever
- 字符串全排列与全组合的递归实现-Java版
- java反射笔记
- 设计模式C++实现四:代理模式
- 14个Xcode中常用的快捷键操作
- codeforces 278B New Problem
- The Hardest Problem Ever(有史以来最难的题)
- myeclipse导出jar文件
- cadence 16.5 激活
- 第四次作业
- 轻松搞定面试中的二叉树题目
- 河南省第八届程序设计大赛有感
- arcgis api for js中使用d3.js标注点的属性值代替textsymbol方式
- 从终端读取一行数据,fgets,gets,c++ string类定义的getline
- c++枚举类型