HDU 1048
来源:互联网 发布:枪火兄弟连2 mac 存档 编辑:程序博客网 时间:2024/05/20 20:04
java
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
import java.util.ArrayList;import java.util.List;import java.util.Scanner;/*1048 * ABCDEFGHIJKLMNOPQRSTUVWXYZ * VWXYZABCDEFGHIJKLMNOPQRSTU * 主要是格式问题 * */public class Cipher { public static void main(String[] args) { Scanner input = new Scanner(System.in); List<String> list = new ArrayList<String>(); String endofInput = input.nextLine(); while(!endofInput.equals("ENDOFINPUT")){ if (endofInput .equals("START")) { String string = input.nextLine(); char [] a = string.toCharArray(); for (int i = 0; i < a.length; i++) { if (a[i] >= 'A' && a[i] <= 'E' ) { a[i] = (char) (a[i] + 21); } else if (a[i] >= 'F' && a[i] <= 'Z') { a[i] = (char) (a[i] - 5); } } String cs = new String(a); list.add(cs); } String END = input.nextLine(); endofInput = input.nextLine(); } for (int i = 0; i < list.size(); i++) { System.out.println(list.get(i)); } }}
0 0
- HDU 1048
- hdu 1048
- hdu 1048
- hdu 1048
- hdu 1048
- hdu 1048
- HDU 1048
- HDU 1048
- HDU 1048 字符串
- HDU 1048 map
- hdu 1048 字符串处理
- HDU 1048(水题)
- hdu 1048 字符串
- HDU-1048-密码
- hdu - 1048 ACM
- 字符串处理 hdu 1048
- HDU 1048 字符串处理
- HDU 1048 凯撒密码
- HDU 1015
- Android Ksoap wcf
- ACM266字符串逆序输出
- Jetty
- HDU 4901 The Romantic Hero
- HDU 1048
- Android 基于高德地图路径规划
- hdu 1452 Happy 2004 找循环节
- 【DEV GridControl】怎样使GridView中满足某个条件的行可编辑,其余行不可编辑?
- Codeforce 612C
- [KMP][后缀数组] poj2406 Power Strings
- 【思想感悟】语言的艺术——记与米老师的一次谈话后所感
- response letter模板
- rep stos 指令(Intel汇编)