hdu 1048 字符串水题
来源:互联网 发布:mac安装flash 编辑:程序博客网 时间:2024/06/07 01:32
水题,就是输入输出格式有点恶心。。。题目:
The Hardest Problem Ever
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9175 Accepted Submission(s): 4142
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 <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;}
- hdu 1048 字符串水题
- hdu 1062字符串水题
- hdu 5773 字符串水题
- HDU 1048 字符串
- hdu 1048 字符串处理
- hdu 1048 字符串
- 字符串处理 hdu 1048
- HDU 1048 字符串处理
- HDU 1228 A + B 字符串水题
- hdu 5007(字符串水题)
- 字符串水题 hdu 5007 Post Robot
- hdu 1039 (字符串水题)
- hdu 6208 hash字符串水题
- hdu 5007 水 字符串
- HDU 1062 字符串翻转(字符串,水)
- hdu 1048 字符串加周期
- HDU 1048字符串格式控制
- HDU 2734 Quicksum【水 字符串】
- 线程的学习
- 使用handler来实现异步处理
- Spring 核心思想(面试专用)
- Java新手进阶:细说引用类型
- 常用sql语句—定义、删除与修改基本表
- hdu 1048 字符串水题
- 继承,多态小记
- Java的直线的点判断
- WINCE基于hive注册表的实现
- AndEngine引擎的学习笔记(三)
- SqlDataReader引发的异常
- c 中printf计算参数时是从右到左压入栈的
- android双击事件
- IE 里面使用脚本添加的radio无法使用