关闭

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

标签: javaacm
8826人阅读 评论(0) 收藏 举报
分类:

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();
        }
    }
}
1
0
查看评论

HDU 1328 IBM Minus One (水)

IBM Minus One Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4036...
  • u013446688
  • u013446688
  • 2014-11-14 21:10
  • 1002

(HDUStep 1.2.7)IBM Minus One(字符串运算)

题目:      IBM Minus OneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3943 Ac...
  • caihongshijie6
  • caihongshijie6
  • 2015-01-28 11:25
  • 907

HDU—— 1328 IBM Minus One

题意:将字符串中的每个字符变为它的下一位zufu
  • u014086857
  • u014086857
  • 2014-11-05 19:14
  • 239

hdu 1328 IBM Minus One

晚上睡不着,只好起来A几道水题,压压惊。
  • hncu1306602liuqiang
  • hncu1306602liuqiang
  • 2015-07-28 06:58
  • 422

HDU 1328 IBM Minus One

IBM Minus One Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5354 ...
  • xu_fish
  • xu_fish
  • 2016-04-03 10:50
  • 143

HDU 水题(基础题)附各大OJ题目分类

入门必备~~HDU1000 HDU1001 HDU1004 HDU1005 HDU1008 HDU1012 HDU1013 HDU1014 HDU1017 HDU1019 HDU1021 HDU1028 HDU1029 HDU1032 HDU1037 HDU1040 HDU1048 HDU1056 ...
  • secretbase_
  • secretbase_
  • 2015-02-06 15:00
  • 4175

杭电1328 IBM Minus One

IBM Minus One Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3653 Accepted Submission(s): 191...
  • u014280259
  • u014280259
  • 2014-04-02 14:31
  • 466

「HD_ACM」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 Ku...
  • Simple_Bottle
  • Simple_Bottle
  • 2015-05-05 21:31
  • 655

hdu 1328 IBM Minus One(模拟)

IBM Minus One Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4343 ...
  • qq_24451605
  • qq_24451605
  • 2015-03-24 14:31
  • 331

HDU IBM Minus One

#include #include #include #include using namespace std; int main() {     int n,i,j;     while(scanf(...
  • chenminghe271
  • chenminghe271
  • 2011-09-15 01:28
  • 231
    个人资料
    • 访问:2062337次
    • 积分:26909
    • 等级:
    • 排名:第250名
    • 原创:680篇
    • 转载:26篇
    • 译文:0篇
    • 评论:570条
    个人信息:
    博客专栏
    友情链接:
    文章分类
    最新评论