HDU1048(解题报告)

                                                                                                           The Hardest Problem Ever

                                                            Time Limit:1000MS    Memory Limit:32768KB    64bit IO Format:%I64d & %I64u

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 descri_ption, 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






   
   思想：总结起来这题是一道极坑的题，大意就是用户输入一串字符，通过特定的转换方式，把它转换成普通文本
     （类似于搞谍报工作的！！）。它很容易会让你想到开两个字符串数组，再通过循环扫描进行替换，但是
     提交后你会发现系统报PE。第一次我误以为文本要循环输入，第二次我误以为PE是因为END后面的换行符，
     第三次我觉得是文本输入最后时的换行符，最后···我把scanf、printf改成了gets和puts,解决了换
     行符的问题。再者，本题需注意开文本数组时不要忘记加”，”（样例里面有，所以必须要有）；还有就是
     主函数要开三个字符串数组，我刚开始开两个，弄得文本输入完，还没输入END，就显示出对应文本来了。









解题代码：
#include <stdio.h>
#include <string.h>
char p1[28]={'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',','};
char p2[28]={'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',','};
void f(char s[])
{
    int i,j;
    for(i=0;s[i];i++)
    {
        for(j=0;p1[j];j++)
        {
            if(s[i]==p1[j])
            {
                s[i]=p2[j];
                break;
            }
        }
    }
}

int main()
{
    char ch1[100000],ch2[100000],ch3[100000];
    while(gets(ch1)&&strcmp(ch1,"ENDOFINPUT"))
    {
        gets(ch2);
        f(ch2);
        gets(ch3);
        if(!strcmp(ch3,"END"))
        {
            puts(ch2);
        }
    }
    return 0;
}