HDUOJ-------The Hardest Problem Ever

The Hardest Problem Ever

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13035    Accepted Submission(s): 5905

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.

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

South Central USA 2002

此题为简单的字符串处理问题....

但是要注意数组开大点....1000足矣;

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdlib>
 4 char str[27]="VWXYZABCDEFGHIJKLMNOPQRSTU";
 5 char a[120];
 6 int main()
 7 {
 8     int i;
 9 //    freopen("test.in","r",stdin);
10 //    freopen("test.out","w",stdout);
11   while(scanf("%[^\n]",a)!=EOF)
12   {
13      if(strcmp("ENDOFINPUT",a)==0)
14            break;
15      if(strcmp("START",a)!=0&&strcmp("END",a)!=0)
16      {
17        for(i=0;i<strlen(a);i++)
18        {
19            if(a[i]>='A'&&a[i]<='Z')
20                  printf("%c",str[a[i]-'A']);         
21            else
22                  printf("%c",a[i]);
23        }
24        puts("");
25      }
26      a[0]=0;
27      getchar();
28   }
29   return 0;
30 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏ml

HDUOJ----(4706)Children's Day

Children's Day Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/327...

39880
来自专栏算法修养

POJ-2777 Count Color(线段树,区间染色问题)

Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: ...

35540
来自专栏闻道于事

JavaWeb之ssm框架整合,用户角色权限管理

SSM框架整合 Spring SpringMVC MyBatis 导包: 1, spring 2, MyBatis 3, mybatis-spring ...

2.6K40
来自专栏Hongten

Hibernate二级缓存存集合对象

<?xml version='1.0' encoding='UTF-8'?> <!DOCTYPE hibernate-configuration PUBLIC ...

13720
来自专栏ml

HDUOJ---(4708)Rotation Lock Puzzle

Rotation Lock Puzzle Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 327...

24940
来自专栏Hongten

Hibernate EntityManager

Java Persistence API(JPA)是EJB3.0规范之一,定义了对数据库数据进行持久化操作的接口。HIbernate

14440
来自专栏算法修养

POJ-1953 World Cup Noise(线性动规)

World Cup Noise Time Limit: 1000MS Memory Limit: 30000K Total Submissio...

35660
来自专栏码匠的流水账

reactor-netty的TcpClient如何往eventLoop提交task

本文主要研究一下reactor-netty的TcpClient如何往eventLoop提交task

49520
来自专栏算法修养

FZU 2144 Shooting Game (贪心区域划分)

Problem 2144 Shooting Game Accept: 370 Submit: 1902 Time Limit: 1000 mSec...

30770
来自专栏杂烩

hadoop MapReduce编写一个分组统计并排序查询-排序

执行命令时注意参数位置,正确的执行命令应该是如下(假如打包的jar放在hadoop根目录下的mylib,jar名称为groutcount):

31340

扫码关注云+社区

领取腾讯云代金券