hdu1048 The Hardest Problem Ever
来源:互联网 发布:芸豆会计软件免费版 编辑:程序博客网 时间:2024/05/16 02:18
The Hardest Problem Ever
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26151 Accepted Submission(s): 12230
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
//// Created by Admin on 2017/4/4.//#include <cstdio>#include <cstring>using namespace std;int main(){ char a[20],b[210]; while (scanf("%s",a)){ if(strcmp(a,"ENDOFINPUT")==0)break; getchar(); gets(b); for (int i = 0; i < strlen(b); ++i) { if(b[i]>='A'&&b[i]<='Z')b[i]=(26-5+b[i]-65)%26+65; //实现"A-Z"序列循环 } scanf("%s",a); puts(b); } return 0;}
0 0
- HDU1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- HDU1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- HDU1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- HDU1048——The Hardest Problem Ever
- The Hardest Problem Ever(hdu1048字符串水题)
- HDU1048 - The Hardest Problem Ever (简单题)
- hdu1048 The Hardest Problem Ever(C语言)
- 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
- lab6
- Android Studio常用快捷键
- python文件IO相关
- windows卸载程序需要密码/防卸载功能
- 八皇后问题(dfs常规解法)
- hdu1048 The Hardest Problem Ever
- VS2013解决rror C4996: 'fopen': This function or variable may be unsafe. Consider using fopen_s instead
- 【网络】HTTP2.0新特性
- 关于解决Eclipse报错显示Unable to build: the file dx.jar was not loaded from the SDK folder
- Android自定义View中的常用方法(距离、位置、点击事件)
- python 时间 gmtime
- 移动端弹出阴影遮罩的几点问题和解决方法
- Qt QQuickImageProvider备注
- SVN的配置详解