J题
来源:互联网 发布:美团抢单送外卖的软件 编辑:程序博客网 时间:2024/05/10 10:51
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
2HALSWERC
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;int main(){ int n,m; cin>>n; struct wang {char a[100]; }stu[1000]; for(int i=0;i<n;i++) {cin>>stu[i].a; m=strlen(stu[i].a); for(int j=0;j<m;j++) {if(stu[i].a[j]=='Z')stu[i].a[j]='A'; else stu[i].a[j]++;}} for(int i=0;i<n;i++) {cout<<"String #"<<i+1<<endl; cout<<stu[i].a<<endl; cout<<endl; }}Sample Output
String #1IBM
String #2TXFSD
构建结构体,这样既可以储存字符串,又可以精确到字符的每一个位置。
然后用各个字符的ASCLL码加一,z字符特殊处理。
最后用for循环输出。
- J题
- 资格赛j题
- NOJ J题 FootBall
- J题 游戏模拟
- 《ACM程序设计》 J题
- 搜索 J题
- J
- j
- j
- J#
- J
- J
- J
- J
- j
- J
- J
- J
- 【学习】Hadoop大数据平台架构与实践--基础篇下
- Android架构设计---MVP模式第(二)篇,如何减少类爆炸
- collectionView代理方法快速设置cell大小上下左右间隔
- 字母统计(acm练习)
- 面试被虐系列_设计模式篇_单例模式
- J题
- macOS
- finally 是执行try return之前还是之后之争
- Android架构设计---关于MVVM模式的探讨
- phpstorm安装破解及汉化
- Rdd没法调用toDF原因
- 进程与线程的区别与联系
- 进程/线程同步、互斥、通信的问题:
- Java ServerSocket用法深入分析