落絮飞雁

顺流而下,把梦做完

HDOJ1048:The Hardest Problem Ever——字符串处理

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

简单的字符串处理问题,好久没有A题目了,热热身。
注意字符串的判断方式。要在赋值给char后再通过strcmp()函数比较。
读题目,搞清楚到底哪一行是明文,哪一行是密文。
没什么好说的,一次水过。
代码:

#include
#include
#include
int main()
{
	char passwd[201];
	int i, l, cache;
	while (gets(passwd))
	{
		if (strcmp(passwd, "START") == 0)
			continue;
		if (strcmp(passwd, "END") == 0)
			continue;
		if (strcmp(passwd, "ENDOFINPUT") == 0)
			break;
		l = strlen(passwd);
		for (i = 0; i = 70 && passwd[i] = 65)
			{
				passwd[i] += 21;
			}
		}
		for (i = 0; i 

原文标题:HDOJ1048:The Hardest Problem Ever——字符串处理|落絮飞雁的个人网站
原文链接:https://www.luoxufeiyan.com/2015/03/12/hdoj1048/
授权协议:创作共用 署名-非商业性使用 2.5 中国大陆
除注明外,本站文章均为原创;转载时请保留上述链接。