HDU 1048字符串格式控制

来源:互联网 发布:组成数据的基本单位 编辑:程序博客网 时间:2024/06/01 07:56

The Hardest Problem Ever

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

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


思路

1、这题目题意不难理解,输入字母与输出字母ascll码相差5就可以。

2、这个题目主要考点还是在字符串的控制格式上,因为输入的时候会有空格,所以需要gets等一些函数来进行输入,但是我只用gets的话是不能输入的,因为之前已经使用过cin,会在缓冲区留下字符’\n’。所以一般需要fflush(stdin)或者getchar().但是我刚开始用fflush(stdin)的时候一直WA,一直没找到问题,后来试了getchar(),AC了。fflush(stdin)一般不用!!!!!!


代码

#include <iostream>#include <stdio.h>#include <string>#include <string.h>#include <stdlib.h>using namespace std;char s2[201];string s1;int main(){    while(cin>>s1)    {        if(s1=="ENDOFINPUT")            break;         else if(s1=="START")         {            getchar();            gets(s2);            int len1=0;            len1=strlen(s2);            for(int i=0;i<len1;i++)            {                if(s2[i]=='A')                    s2[i]='V';                else if(s2[i]=='B')                    s2[i]='W';                else if(s2[i]=='C')                    s2[i]='X';                else if(s2[i]=='D')                    s2[i]='Y';                else if(s2[i]=='E')                    s2[i]='Z';                else if(s2[i]=='\0')                    s2[i]='\0';                else if(s2[i]<=90&&s2[i]>=70)                    s2[i]=s2[i]-5;                else                    s2[i]=s2[i];            }                for(int i=0;i<len1;i++)                {                    cout<<s2[i];                }                cout<<endl;         }         else            continue;    }    return 0;}