谙忆-陈浩翔

学不止步,梦不停歇(learning nonstop, dream nonstop)

HDOJ/HDU 1328 IBM Minus One(水题一个,试试手)

Problem Description
You may have heard of the book ‘2001 - A Space Odyssey’ by Arthur C. Clarke, or the film of the same name by Stanley Kubrick. In it a spaceship is sent from Earth to Saturn. The crew is put into stasis for the long flight, only two men are awake, and the ship is controlled by the intelligent computer HAL. But during the flight HAL is acting more and more strangely, and even starts to kill the crew on board. We don’t tell you how the story ends, in case you want to read the book for yourself :-)

After the movie was released and became very popular, there was some discussion as to what the name ‘HAL’ actually meant. Some thought that it might be an abbreviation for ‘Heuristic ALgorithm’. But the most popular explanation is the following: if you replace every letter in the word HAL by its successor in the alphabet, you get … IBM.

Perhaps there are even more acronyms related in this strange way! You are to write a program that may help to find this out.

Input
The input starts with the integer n on a line by itself - this is the number of strings to follow. The following n lines each contain one string of at most 50 upper-case letters.

Output
For each string in the input, first output the number of the string, as shown in the sample output. The print the string start is derived from the input string by replacing every time by the following letter in the alphabet, and replacing ‘Z’ by ‘A’.

Print a blank line after each test case.

Sample Input
2
HAL
SWERC

Sample Output
String #1
IBM

String #2
TXFSD

题意就是:输入一个大写的字符串,输出每一个大写字母后的一个大写字母。
如果遇到Z就输出A。
注意每一个测试后都有一个空行。

水题一个!

import java.util.Scanner;

public class Main{

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t =sc.nextInt();
        int ti=0;
        while(t-->0){
            String str = sc.next();
            System.out.println("String #"+(++ti));
            for(int i=0;i<str.length();i++){
                if(str.charAt(i)=='Z'){
                    System.out.print("A");
                }else{
                    System.out.print((char)(str.charAt(i)+1));
                }
            }
            System.out.println();
            System.out.println();
        }
    }
}
阅读更多

扫码向博主提问

去开通我的Chat快问

qq_26525215

博客专家

六一六一,童言无忌
版权声明:本文为谙忆原创文章,转载请附上本文链接,谢谢。 https://blog.csdn.net/qq_26525215/article/details/51557062
文章标签: java acm
所属专栏: ACM大学之旅
上一篇JavaScript---网络编程(1)-介绍、变量、运算符与语句
下一篇JavaScript---网络编程(2)-函数与数组
想对作者说点什么? 我来说一句

hdu1686 KMP水题

简单KMP题

zxf654073270 zxf654073270

2014-10-28 19:04:13

阅读数:659

没有更多推荐了,返回首页

关闭
关闭