hdoj-1048-The Hardest Problem Ever
2016-03-27 09:41
323 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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".
[align=left]Output[/align]
For each data set, there will be exactly one line of output. This is the original message by Caesar.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
[align=left]Source[/align]
South Central USA 2002
题目好像原来做过,叫什么凯撒的密码吧。很水的一道题,就不多说了,就是字符串转化,你%一下就好了,不过也可以像我这样sabi枚举。
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.
[align=left]Input[/align]
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".
[align=left]Output[/align]
For each data set, there will be exactly one line of output. This is the original message by Caesar.
[align=left]Sample Input[/align]
START NS BFW, JAJSYX TK NRUTWYFSHJ FWJ YMJ WJXZQY TK YWNANFQ HFZXJX END START N BTZQI WFYMJW GJ KNWXY NS F QNYYQJ NGJWNFS ANQQFLJ YMFS XJHTSI NS WTRJ END START IFSLJW PSTBX KZQQ BJQQ YMFY HFJXFW NX RTWJ IFSLJWTZX YMFS MJ END ENDOFINPUT
[align=left]Sample Output[/align]
IN WAR, EVENTS OF IMPORTANCE ARE THE RESULT OF TRIVIAL CAUSES I WOULD RATHER BE FIRST IN A LITTLE IBERIAN VILLAGE THAN SECOND IN ROME DANGER KNOWS FULL WELL THAT CAESAR IS MORE DANGEROUS THAN HE
[align=left]Source[/align]
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; }
相关文章推荐
- 扣丁学堂笔记第11天广播接收器、短信与闹钟服务
- 【phpcms-v9】content_form.calss.php文件分析-内容添加页面动态表单的生成原理
- go语言捕获panic异常并转化为error
- 栈的链式存储结构及其基本运算的实现
- google在线測试练习题1
- 让loadrunner走下神坛(全)
- 企业网络中广域网出口介绍及业务办理 推荐
- 【phpcms-v9】前台模板文件中{pc}标签的执行流程
- linux 下的策略路由
- The effect of opinion clustering on disease outbreaeks
- python得到所有在leetcode上Accepted的代码(一)
- 出差(三十二)
- 点击两次,才退出应用的程序代码
- MinerThreadPool.java 线程池
- 排序——堆排序(C++)
- (p241)活动选择
- 熵权法简介
- MinerThreadPool.java 线程池
- Gym 100917F Find the Length
- Android-Intent两种启动方式