HDOJ 1048 The Hardest Problem Ever
来源:互联网 发布:java web日志模块设计 编辑:程序博客网 时间:2024/05/17 23:29
The Hardest Problem Ever
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19699 Accepted Submission(s): 9251
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
注-此题为:HDOJ 1048 The Hardest Problem Ever
题意:字符对应转换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
思路:定于数组 char s[]="VWXYZABCDEFGHIJKLMNOPQRSTU";
用 ch[i]-'A' 作为 s 的下标 。例如:ch[i] 为 B 时 B-A=1 ,下标为 1,s[1]=W , 题中 B 对 W 。
注意: 读取字符串因为有空格要用 gets,还要吸收回车。
已AC代码:
#include<cstdio>#include<cstring>char ch[1010],str[1010],c[50];char s[]="VWXYZABCDEFGHIJKLMNOPQRSTU";int main(){int len,i;while(scanf("%s",c)!=EOF){if(strcmp(c,"ENDOFINPUT")==0)break;memset(ch,'\0',sizeof(ch));memset(str,'\0',sizeof(str));memset(c,'\0',sizeof(c));getchar(); //吸收回车 gets(ch);getchar(); scanf("%s",c);getchar();len=strlen(ch);for(i=0;i<len;++i){if(ch[i]>='A'&&ch[i]<='Z')str[i]=s[ch[i]-'A']; //ch[i]-'A'作为 s 的下标 elsestr[i]=ch[i];}puts(str);}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
- 卫星导航同步时的环路更新时间架构
- BOOKSTORE OPENCART 自适应主题模板 ABC-0110
- c风格字符串
- Android Api Demos登顶之路(二十八)Setting Action Provider
- nginx高级数据结构源码分析(一)-----双向链表
- HDOJ 1048 The Hardest Problem Ever
- I/O多路复用详解(二)
- VS使用Xamarin连接不上Genymotion的Android模拟器的原因
- 一维的树状数组
- LeetCode 21 Merge Two Sorted Lists
- 剑指Offer面试题42(Java版):反转单词顺序VS左旋转字符串
- 二维树状数组
- JAVA 基础 (数组)
- 《机器学习系统设计》之k-近邻分类算法