(HDUStep 1.2.7)IBM Minus One(字符串运算)
来源:互联网 发布:微信发淘宝优惠券软件 编辑:程序博客网 时间:2024/06/05 00:47
题目:
IBM Minus One
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3943 Accepted Submission(s): 1519Problem 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.
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.
Print a blank line after each test case.
Sample Input
2HALSWERC
Sample Output
String #1IBMString #2TXFSD
Source
Southwestern Europe 1997, Practice
Recommend
Ignatius.L
题目分析:
简单的字符串运算。例如: 'B' = 'A'+1 .....将给出的字符串中的每个字符加1后输出即可。
代码如下:
/* * h.cpp * * Created on: 2015年1月28日 * Author: Administrator */#include <iostream>#include <cstdio>using namespace std;int main(){int n;scanf("%d",&n);int i;for(i = 0 ; i < n ; ++i){string str;cin >> str;int length = str.length();int j;for(j = 0 ; j < length ; ++j){if(str[j] == 'Z'){str[j] = 'A';}else{str[j] += 1;}}cout << "String #" << (i+1) <<endl;cout<<str<<endl<<endl;}return 0;}
1 0
- (HDUStep 1.2.7)IBM Minus One(字符串运算)
- HDU 1.2.5 IBM Minus One
- HDU 1.2.5 IBM Minus One
- IBM Minus One
- HDU IBM Minus One
- (3)IBM Minus One
- IBM Minus One
- IBM Minus One
- IBM Minus One
- ACM002 IBM Minus One
- 六、IBM Minus One
- IBM Minus One
- IBM Minus One
- IBM Minus One
- IBM Minus One
- ACM--字母增加--HDOJ 1328--IBM Minus One--字符串
- zoj 1240 IBM Minus One
- 杭电 IBM Minus One
- 访问需要HTTP Basic Authentication认证的资源的各种语言的实现
- AppDomain详解
- 什么是A类、B类、C类地址?
- CentOS下快速搭建LAMP环境
- Disjoint sets(并查集)
- (HDUStep 1.2.7)IBM Minus One(字符串运算)
- Mybatis学习笔记
- memcached 学习
- Yii中ajax提交注意事项
- 通识基础_正负数二进制的表示
- 编程规范的笔记
- Hibernate主键生成策略
- 用MySQL创建数据库和数据库表
- adb命令执行过程解析