hdu1048
来源:互联网 发布:工业网络交换机 编辑:程序博客网 时间:2024/05/22 20:59
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
Source
South Central USA 2002
水题,不多说了
import java.io.BufferedInputStream;
import java.util.Scanner;
public class p1048 {
public static void main(String[] args) { Scanner in = new Scanner(new BufferedInputStream(System.in)); char cipher[] = { '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 plain[] = { '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' }; while (true) { String s = in.nextLine();// 接受"START"或"ENDOFINPUT" if (s.equals("START")) { String ss = in.nextLine();// 接受密文 /*********** 密文转换为明文 **************/ char c[] = ss.toCharArray(); for (int i = 0; i < c.length; i++) { if (c[i] >= 65 && c[i] <= 90) { c[i] = (char) plain[c[i] - 65]; } System.out.print(c[i]);// 输出明文-------1 } /*********************************/ System.out.println();// 没有此句会出现Presentation Error--------2 in.nextLine();// 接受"END"语句--------3 // 123、132、312的顺序均可 } if (s.equals("ENDOFINPUT")) break; }}
}
- hdu1048
- hdu1048
- hdu1048
- hdu1048
- HDU1048
- HDU1048
- HDU1048
- HDU1048
- HDU1048(解题报告)
- HDU1048 凯撒加密
- HDU1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- HDU1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- HDU1048 The Hardest Problem Ever
- hdu1048-密码问题 字符串转换
- hdu1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- uart test
- WebServer
- 详解MySql的event事件
- git 更新遇到冲突
- 程序设计模式之设计模式的重大意义
- hdu1048
- java复习-泛型
- CodeForces 429B Working out // 递推dp
- 【杂题】CodeforcesRound #315 (Div. 2)569C Primes or Palindromes?
- makefile中的patsubst
- 结构体字节对齐
- redo和undo的区别
- spring版本区别
- Interesting Integers(CF---BAPC 14 + hnoj11589)扩展欧几里得