杭电1328 IBM Minus One
来源:互联网 发布:超人软件下载中心 编辑:程序博客网 时间:2024/05/21 18:43
IBM Minus One
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3653 Accepted Submission(s): 1912
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.
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
2
HAL
SWERC
Sample Output
String #1IBMString #2TXFSD代码:#include<stdio.h>#include<string.h>int main(){char sz[100];int c,n;scanf("%d\n",&n);for(int j=1;j<=n;j++){//scanf("%s",sz);gets(sz);c=strlen(sz);printf("String #%d\n",j);for(int i=0;i<c;i++){if(sz[i]=='Z')sz[i]=sz[i]-25;elsesz[i]=sz[i]+1;printf("%c",sz[i]);}printf("\n\n");//最后一行也要空行}return 0;}题意:将输入的每个字母按照字母表+1,如果是Z,就跳回A。因此思路只要按照ACSII码的转换方法就ok了。
感想:这道题其实思路很简单,就是那些格式把我弄晕了,要注意的几点在代码中用红色标记,另外这道题还有一个最大的问题就是只能用c++语言才能编译通过。
0 0
- 杭电1328 IBM Minus One
- 杭电 IBM Minus One
- 杭电oj-IBM Minus One
- 杭电ACM 1.2.6 IBM Minus One
- hdu 1328 IBM Minus One
- HDU 1328 IBM Minus One
- hdu 1328 IBM Minus One
- HDU—— 1328 IBM Minus One
- HDU 1328 IBM Minus One (水)
- hdu 1328 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
- Git撤销git commit 但是未git push的修改
- 开源DLP:OpenDLP
- spring3集成测试
- 2014年4月2日MySQL学习记录--存储过程生成模拟数据
- linux环境apache配置问题
- 杭电1328 IBM Minus One
- 最长回文子串
- 安全性测试考虑点整理
- 记一次网站备案
- 云操作系统
- 关于SqlServer服务无法启动的症状分析和解决方法
- 存储器--程序的链接方式
- 百度语言翻译机
- JSONP--解决ajax跨域问题