hdoj-1048-The Hardest Problem Ever
来源:互联网 发布:中国核潜艇打海盗知乎 编辑:程序博客网 时间:2024/05/16 06:42
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
题目好像原来做过,叫什么凯撒的密码吧。很水的一道题,就不多说了,就是字符串转化,你%一下就好了,不过也可以像我这样sabi枚举。
#include <iostream> #include <string> #include <string.h> #include <map> #include <cstdio> using namespace std; map<char,char> mp; void init(){ mp['A']='V';mp['B']='W';mp['C']='X';mp['D']='Y';mp['E']='Z';mp['F']='A';mp['G']='B';mp['H']='C';mp['I']='D';mp['J']='E'; mp['K']='F';mp['L']='G';mp['M']='H';mp['N']='I';mp['O']='J';mp['P']='K';mp['Q']='L';mp['R']='M';mp['S']='N';mp['T']='O'; mp['U']='P';mp['V']='Q';mp['W']='R';mp['X']='S';mp['Y']='T';mp['Z']='U'; } int main(){ // freopen("1.txt","r",stdin); init(); char ss[1005]; string s1,s2,s3; while(gets(ss)){ if(strcmp("START",ss)==0); else if(strcmp("END",ss)==0)puts(""); else if(strcmp("ENDOFINPUT",ss)==0)return 0; else{ int len=strlen(ss); for(int i=0;i<len;++i){ if(ss[i]>='A'&&ss[i]<='Z') printf("%c",mp[ss[i]]); else printf("%c",ss[i]); } } } return 0; }
0 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
- go语言捕获panic异常并转化为error
- Nginx
- MIME数据类型之初体验
- 【phpcms-v9】content_form.calss.php文件分析-内容添加页面动态表单的生成原理
- Mybatis多参数传递三种解决方案
- hdoj-1048-The Hardest Problem Ever
- 【phpcms-v9】category.php文件分析-添加栏目
- 扣丁学堂笔记第11天广播接收器、短信与闹钟服务
- Java 回顾笔记_set集合
- 【phpcms-v9】cache_all.php文件分析-更新缓存
- android中无法在华为手机输出Log.v和Log.d级别的日志问题总结
- 集合框架--List和Set的特点
- android adb 命令
- 小应用--如何从一堆数字中选择出与10的倍数最接近的一些数