sdut 2413:n a^o7 !（第三届山东省省赛原题，水题，字符串处理）
n a^o7 !
Time Limit: 1000MS Memory limit: 65536K
题目描述
All brave and intelligent fighters, next you will step into a
distinctive battleground which is full of sweet and happiness. If you want to
win the battle, you must do warm-up according to my instructions, which can make
you in the best state preparing to fight. Now please relax yourself and enjoy
the good moment. Before you raise your sharp sword to the enemy who guards the
battleground, please allow me to tell you a true and romantic story about a
samurai like you.
Samurai hh fell in love with girl ss, who is charming
and demure. He realized the truth that he must spend his remaining life with ss,
and resolved to pursue the hard-won affection. One day hh wrote a letter to ss,
when she opens the letter with excitement her mind was in tangle. She found
herself completely not to figure out the meaning about the letter, which said
that "n 55!w ! pue n a^o7 ! n paau !". ss also immersed herself in guessing the
meaning of that letter for a long time because of her adore to hh. Finally she
called hh to ask the meaning of the letter. On the other side of the phone, hh
was too nervous to say. Gradually he calmed down himself and told ss to reverse
the letter and read it. Then on both ends of the phone comes the voice at the
same time "i need u i love u and i miss u".
ss wants to tell each of you
however you are Brave And Skilled, you shouldn‘t forget to express your loyal
love and romantic feelings to your prince or princess.
Now the horn sounds
for battle，do it by the following input and output. I think each of you will get
an "Accepted" in this battle with pleasant mood.
输入
Input contains an integer T in the first line, and then T lines
follow .Each line contains a message (only contain ‘n5!wpuea^o7!‘ and
‘
‘(space)), the message‘s length is no more than 100.
输出
Output the case number and the message. (As shown in the sample output)
示例输入
2 n 55!w ! pue n a^o7 ! n paau ! n5!wpuea^o7
示例输出
Case 1: i need u i love u and i miss u Case 2: loveandmisu
提示
来源
1 #include <iostream>
2 #include <stdio.h>
3 #include <string.h>
4 using namespace std;
5 void work(char a[])
6 {
7 int i;
8 for(i=0;a[i];i++){
9 switch(a[i]){
10 case ‘n‘:a[i]=‘u‘;break;
11 case ‘5‘:a[i]=‘s‘;break;
12 case ‘w‘:a[i]=‘m‘;break;
13 case ‘p‘:a[i]=‘d‘;break;
14 case ‘u‘:a[i]=‘n‘;break;
15 case ‘e‘:a[i]=‘a‘;break;
16 case ‘a‘:a[i]=‘e‘;break;
17 case ‘^‘:a[i]=‘v‘;break;
18 case ‘o‘:a[i]=‘o‘;break;
19 case ‘7‘:a[i]=‘l‘;break;
20 case ‘!‘:a[i]=‘i‘;break;
21 default:break;
22 }
23 }
24 }
25 int main()
26 {
27 int n,cnt = 1;
28 cin>>n;
29 getchar();
30 while(n--){
31 char a[110];
32 cin.getline(a,120,‘\n‘);
33 work(a);
34 cout<<"Case "<<cnt++<<": ";
35 int len = strlen(a)-1;
36 for(;len>=0;len--)
37 cout<<a[len];
38 cout<<endl;
39 }
40 return 0;
41 }
42
43
44 /**************************************
45 Problem id : SDUT OJ D
46 User name : Miracle
47 Result : Accepted
48 Take Memory : 472K
49 Take Time : 0MS
50 Submit Time : 2014-04-27 09:16:04
51 **************************************/
Freecode : www.cnblogs.com/yym2013