ZOJ Problem Set - 1240 IBM Minus One
2015-01-20 17:07
302 查看
IBM Minus One
Time Limit: 2 Seconds Memory Limit: 65536 KB
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
Source: Southwestern Europe 1997, Practice
分析:
水题,注意输出格式就行。
ac代码:
#include <iostream>
#include<cstdio>
#include<string>
using namespace std;
int main()
{
int n,i,j;
string s;
char ss[55];
scanf("%d",&n);
for(i=0;i<n;i++)
{
cin>>s;
printf("String #%d\n",i+1);
for(j=0;j<s.length();j++)
{
if(s[j]=='Z')
//cout<<'A';
printf("A");
// printf('A');//错误
else
printf("%c",s[j]+1);
}
//if(i<n-1)
printf("\n\n");
}
return 0;
}
Time Limit: 2 Seconds Memory Limit: 65536 KB
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
Source: Southwestern Europe 1997, Practice
分析:
水题,注意输出格式就行。
ac代码:
#include <iostream>
#include<cstdio>
#include<string>
using namespace std;
int main()
{
int n,i,j;
string s;
char ss[55];
scanf("%d",&n);
for(i=0;i<n;i++)
{
cin>>s;
printf("String #%d\n",i+1);
for(j=0;j<s.length();j++)
{
if(s[j]=='Z')
//cout<<'A';
printf("A");
// printf('A');//错误
else
printf("%c",s[j]+1);
}
//if(i<n-1)
printf("\n\n");
}
return 0;
}
相关文章推荐
- ZOJ Problem Set - 1240 IBM Minus One
- ZOJ Problem Set - 1240 IBM Minus One
- ZOJ 1240 IBM Minus One
- zoj 1240.IBM Minus One
- zoj 1240 IBM Minus One
- ZOJ 1240 IBM Minus One
- ZOJ 1240: IBM Minus One
- zoj 1240 IBM Minus One
- ZOJ_1240_IBM Minus One
- zoj 1240 IBM Minus One
- zoj 1240 IBM Minus One
- ZOJ 1240 IBM Minus One
- zoj 1240 IBM Minus One
- Problem j-10 IBM Minus One
- zju1240 IBM减一 IBM Minus One
- One Person Game ZOJ Problem Set - 3329
- 1240_IBM Minus One
- ZOJ Problem Set - 1078(Palindrom Numbers)
- ZOJ Problem Set - 3956 Course Selection System
- ZOJ Problem Set - 3778 Talented Chef Python Non-zero Exit Code