ZOJ_1240_IBM Minus One
来源:互联网 发布:mysql批量insert限制 编辑:程序博客网 时间:2024/06/05 21:22
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
/********************************************** Author: Wan KaiMing** Date: 2012-10-31-19.40*********************************************/#include<iostream>#include<string>#include<iomanip>using namespace std;int main(){ int n;//表示牌的数量 double s=0;//表示超出桌沿的距离 cout<<"# Cards Overhang\n"; while(cin>>n){ s=0; for(int i=1;i<=n;i++) s+=1.0/(2*i); cout<<setw(5)<<n <<setw(10)<<fixed<<setprecision(3)<<s<<endl; } return 0;}
- ZOJ_1240_IBM Minus One
- IBM Minus One
- HDU IBM Minus One
- (3)IBM Minus One
- 1240_IBM Minus One
- Two minus one 游戏规则
- Two minus one Rules
- IBM Minus One
- HDU_1328IBM 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
- zoj 1240 IBM Minus One
- 遍历WPF窗体元件的两种方法
- <转载>基础篇、AlarmManager类的作用
- Eclipse中添加MyEclipse插件
- 笔记本创建wifi
- V$SESSION 较详细解释
- ZOJ_1240_IBM Minus One
- 用C语言数组实现位操作(位数组)
- uva 103 - Stacking Boxes
- 从m个数中任意去n个数的组合
- 关于 C++ 默认构造函数 的几个误区
- 用递归方法对二叉树进行先序、中序和后序遍历
- 没有logo不要紧,手动为你的BIOS添加开机logo[AMI]
- 错误处理
- SNMP之MIB管理信息库