HDU 1048 The Hardest Problem Ever【水】
2016-01-08 09:35
399 查看
The Hardest Problem Ever
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21353 Accepted Submission(s): 10041
[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]
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
算是一道水题,恶心的输入输出控制,感觉没什么意思,不说了.....唉
#include<stdio.h>
#include<string.h>
int main()
{
char s[1005];
//freopen("shuju.txt","r",stdin);
while(gets(s),strcmp(s,"ENDOFINPUT"))
{
if(!strcmp(s,"START")||!strcmp(s,"END"))
{
continue;
}
int len=strlen(s);
for(int i=0;i<len;++i)
{
if(s[i]>='A'&&s[i]<='Z')
{
s[i]=(s[i]-'A'+'V'-'A')%26+'A';
}
}
printf("%s\n",s);
}
return 0;
}
相关文章推荐
- Centos7下Hive-1.2.1安装部署
- 赞扬和批评的黄金比例
- 手机触摸屏有电阻屏和电容屏,有什么区别?
- iOS自定义tableViewCell中的按钮无法点击的解决方法
- Centos7下Python3的安装
- Suruts2的工作原理
- 秒杀系统架构分析与实战
- 防误删虚拟机网卡
- Python Web-第三周-Networks and Sockets(Using Python to Access Web Data)
- Godef 插件无法跳转问题
- VC6神迹外挂的DIY
- 命令模式
- Eclipse中 搭建 Spring+SpringMVC+Mybatis整合(下)
- 如何有效地描述软件缺陷(Defect)?
- Java用String 截取方式解析xml文件、处理大xml文件
- H264编码 封装成MP4格式 视频流 RTP封包
- springmvc jquery 使用时,format中使用fmt的实现
- iOS屏幕横竖屏旋转相关
- 平安阿里数据库技术交流日总结
- android:NinePatch图片制作