hdu 1048 The Hardest Problem Ever
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 | import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); char [] s = "VWXYZABCDEFGHIJKLMNOPQRSTU" .toCharArray(); while (sc.hasNext()) { String st = sc.nextLine(); if (st.compareTo( "ENDOFINPUT" ) == 0 ) break ; String str = sc.nextLine(); String en = sc.nextLine(); char [] a = str.toCharArray(); for ( int i = 0 ; i < a.length; i++) { if (a[i] >= 'A' && a[i] <= 'Z' ) System.out.print(s[a[i] - 'A' ]); else System.out.print(a[i]); } System.out.println(); } } } |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步