【聲明：本文為原創(chuàng)文章,未經(jīng)同意,嚴(yán)禁轉(zhuǎn)載和抄襲,違者將追究其法律責(zé)任】

蘇世機(jī)試小課堂，考研機(jī)試不再慌！

公主號：蘇世學(xué)社考研? 蘇世計算機(jī)考研

The Hardest Problem Ever

Time?Limit: 2000/1000 MS (Java/Others)?

Memory Limit: 65536/32768 K (Java/Others)

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

答案

①讀題:

這是一個英文題，直接讀就行，讀完發(fā)現(xiàn)是字符串替換問題。

②想出思路：

用一個字符數(shù)組存儲“Plain text”，循環(huán)遍歷原字符串中的每個字符，替換即可。

③動手編程：

④測試樣例：

⑤提交代碼：

進(jìn)入下面的鏈接提交代碼：

http://acm.hdu.edu.cn/showproblem.php?pid=1048

⑥返回評測結(jié)果：

至此，這道題我們就已經(jīng)完成了。

本題總結(jié)

碰到英文題直接讀，沒必要每個單詞都必須認(rèn)識，可能和題目無關(guān)或者對做題沒影響，有時候題目描述看著不少，但題目的意思也就一句話，比如本題就是給出替換方式，把輸入的字符串挨個字符替換。這里也用到了一些字符串函數(shù)，比如strcpy()、gets()、strcmp()，判斷字符的函數(shù)isalpha()，平時邊做題邊積累，不懂的用法就上網(wǎng)查，多做英文題，提高讀題熟練度，也能摸索出訣竅。

未完待續(xù)

蘇世學(xué)社旗下品牌，專注于計算機(jī)考研

計算機(jī)考研一手資訊，原創(chuàng)高質(zhì)量干貨

深度的學(xué)習(xí)分享丨咨詢前輩丨個性化指導(dǎo)