码迷,mamicode.com
首页 > 其他好文 > 详细

hdu 1048 The Hardest Problem Ever

时间:2016-07-20 21:08:41      阅读:126      评论:0      收藏:0      [点我收藏+]

标签:

技术分享

 

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();

        }
    }
}

  

hdu 1048 The Hardest Problem Ever

标签:

原文地址:http://www.cnblogs.com/A--Q/p/5689608.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!