The Hardest Problem Ever(字符串)
2015-09-22 19:18
260 查看
The Hardest Problem Ever
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.
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".
Output
For each data set, there will be exactly one line of output. This is the original message by Caesar.
Sample Input
Sample Output
Source
题解:字符串替换;
代码:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 24039 | Accepted: 13143 |
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.
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".
Output
For each data set, there will be exactly one line of output. This is the original message by Caesar.
Sample Input
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
Sample Output
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
Source
题解:字符串替换;
代码:
#include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> using namespace std; const int MAXN=110; char plain[MAXN],str[MAXN]; int main(){ strcpy(plain,"VWXYZABCDEFGHIJKLMNOPQRSTU"); while(true){ cin.getline(str,MAXN); if(!strcmp(str,"ENDOFINPUT"))break; else if(!strcmp(str,"START")||!strcmp(str,"END"))continue; else for(int i=0;str[i];i++){ if(isalpha(str[i]))str[i]=plain[str[i]-'A']; } printf("%s\n",str); } return 0; }
相关文章推荐
- 黑马程序员——Swift学习笔记:简介与交互环境
- 黑马程序员——Swift学习笔记:简介与交互环境
- 内核管理-之进程虚拟内存-基于linux3.10
- Ubuntu14 32位系统下安装Matlab2012a步骤
- BitmapFactory.decodeStream返回null
- 阅读笔记:TCP/IP详解卷1
- unity3D剪裁
- XSD笔记
- OC常见面试题三
- 内存管理-之启动-基于linux3.10
- 【本博客搬家到www.cdxy.me】
- VS2013 配置全局 VC++ 目录
- mysql存在则更新,不存在则插入
- nginx之平滑升级详解
- XCL-Charts强大的仪表盘,xcl-charts仪表盘
- jedis中的blpop
- 作业二——结对项目之需求分析与原型模型设计
- 指南针
- ListView以及自定义适配器
- BZOJ 1370 [Baltic2003]Gang团伙 并查集