SDUT OJ 2413 n a^o7 !
来源:互联网 发布:知乎js游戏引擎 编辑:程序博客网 时间:2024/04/27 23:52
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)
示例输入
2n 55!w ! pue n a^o7 ! n paau !n5!wpuea^o7
示例输出
Case 1: i need u i love u and i miss uCase 2: loveandmisu
题目真长。。。。这题的意思就是给你一串字符,你输出反转180度的样子,就11个字符,暴力枚举
#include<bits/stdc++.h>using namespace std;string a="n5!wpuea^o7";string b="usimdnaevol";char c[110];int n;int main(){ cin>>n; getchar(); for(int k=1;k<=n;k++) { gets(c); int len=strlen(c); for(int i=0;i<len;i++) { for(int j=0;j<11;j++) { if(c[i]==a[j]) { c[i]=b[j]; break; } } } printf("Case %d: ",k); for(int i=len-1;i>=0;i--) { cout<<c[i]; } cout<<endl; } return 0;}
- SDUT OJ 2413 n a^o7 !
- SDUT 2413:n a^o7 !
- SDUT 2413-n a^o7 !
- [2413]n a^o7 !
- 2413 n a^o7 !(水题)
- 大家快来a水题 n 55!w ! pue n a^o7 ! n paau ! (sdut oj2413)
- 省赛 n a^o7 !
- [ACM]n a^o7 !
- n a^o7 !
- n a^o7 !
- n a^o7 !
- n a^o7 !
- n a^o7 !
- n a^o7 !
- n a^o7 !
- n a^o7 !
- n a^o7 !
- SDUTACM n a^o7 !
- Flex中HashTable和ArrayCollection数据传递的小问题
- 火狐浏览器中的flex-box与position冲突的解决
- eclipse默认指向WebContent目录修改为webRoot 设置说明
- 机器学习实战——方差和偏差
- Kotlin开发Android笔记12:集合和函数操作符
- SDUT OJ 2413 n a^o7 !
- 关于RHEL 5 下scsi_id 无返回值的问题解决(2) 完全解析
- 一台电脑控制百台手机批量操作
- Xcode做ios开发时 message sent to deallocated instance问题的解决方法(gdb和lldb)
- UESTC 93 King's Sanctuary 基础
- Android 内存泄漏
- POJ 2236 Wireless Network
- 分布式服务弹性框架“Hystrix”实践与源码研究(一)
- POJ Channel Allocation 1129(dfs+四色定理)