首页 > ACM题库 > HDU-杭电 > HDU 1328 IBM Minus One-字符串-[解题报告] C++
2013
12-09

HDU 1328 IBM Minus One-字符串-[解题报告] C++

IBM Minus One

问题描述 :

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.

输入:

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.

输出:

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.

样例输入:

2
HAL
SWERC

样例输出:

String #1
IBM

String #2
TXFSD

地址:http://acm.hdu.edu.cn/showproblem.php?pid=1328

题意:输入一个字符串,没个字符后移1位后输出。

代码:

# include <stdio.h>


int main ()
{
    int T, i, nCase = 1 ;
    char str[55] ;
    scanf ("%d", &T) ;
    while (T--)
    {
        scanf ("%s", str) ;
        for(i = 0 ; str[i] ; i++)
            str[i] = (str[i]-'A'+1)%26+'A' ;
        printf ("String #%d\n", nCase++) ;
        puts (str) ;
        putchar ('\n') ;
    }
    return 0 ;
}

解题报告转自:http://www.cnblogs.com/lzsz1212/archive/2012/02/16/2353650.html


  1. Good task for the group. Hold it up for every yeara??s winner. This is a excellent oppotunity for a lot more enhancement. Indeed, obtaining far better and much better is constantly the crucial. Just like my pal suggests on the truth about ab muscles, he just keeps obtaining much better.

  2. 站长,你好!
    你创办的的网站非常好,为我们学习算法练习编程提供了一个很好的平台,我想给你提个小建议,就是要能把每道题目的难度标出来就好了,这样我们学习起来会有一个循序渐进的过程!