[2012山东省第三届ACM大学生程序设计竞赛]——n a^o7 !
n a^o7 !
题目:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2413
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
来源
2012年"浪潮杯"山东省第三届ACM大学生程序设计竞赛
今天,做第三届的省赛题目。
唉,又是不开心呐。。
我们小组分了几个模块,我负责的两个基本的就是 搜索和计算几何。
恩,前两次搜索少,这一次来搜索了,
可是,这个难度。。。⊙﹏⊙b汗。。。
浪费了好多时间也没做出来,让简单的题A的完了。
这道题就是倒过来看。。。
原图:
倒过来看:
那详细怎么实现呢?由于所输入的字符个数有限:only contain 'n5!wpuea^o7!' and
' '(space)
这有这几个,打个表就能够了,是在不行用个switch也行。
对了,输出的时候别忘了是从后往前输出,
读入的时候要读入一整行(包含空格)。。
简单题,非常快AC
#include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
char arr[310];
int main()
{
char s[105];
int i,j,t;
arr[ int('n') ]='u';
arr[ int('5') ]='s';
arr[ int('!') ]='i';
arr[ int('w') ]='m';
arr[ int('p') ]='d';
arr[ int('e') ]='a';
arr[ int('a') ]='e';
arr[ int('^') ]='v';
arr[ int('o') ]='o';
arr[ int('7') ]='l';
arr[ int(' ') ]=' ';
arr[ int('u') ]='n';
cin>>t;
cin.getline(s,101,'\n');
for(j=1;j<=t;++j)
{
cin.getline(s,101,'\n');
cout<<"Case "<<j<<": ";
for(i=strlen(s)-1;i>=0;--i)
cout<<arr[ int(s[i]) ];
cout<<endl;
}
return 0;
}
[2012山东省第三届ACM大学生程序设计竞赛]——n a^o7 !的更多相关文章
- [2012山东省第三届ACM大学生程序设计竞赛]——Mine Number
Mine Number 题目:http://acm.sdut.edu.cn/sdutoj/problem.php? action=showproblem&problemid=2410 Time ...
- 2012年"浪潮杯"山东省第三届ACM大学生程序设计竞赛--n a^o7 ! 分类: 比赛 2015-06-09 17:16 14人阅读 评论(0) 收藏
n a^o7 ! Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述 All brave and intelligent fighte ...
- Alice and Bob(2013年山东省第四届ACM大学生程序设计竞赛)
Alice and Bob Time Limit: 1000ms Memory limit: 65536K 题目描述 Alice and Bob like playing games very m ...
- sdut Mountain Subsequences 2013年山东省第四届ACM大学生程序设计竞赛
Mountain Subsequences 题目描述 Coco is a beautiful ACMer girl living in a very beautiful mountain. There ...
- 2013年山东省第四届ACM大学生程序设计竞赛-最后一道大水题:Contest Print Server
点击打开链接 2226: Contest Print Server Time Limit: 1 Sec Memory Limit: 128 MB Submit: 53 Solved: 18 [Su ...
- 山东省第四届ACM大学生程序设计竞赛解题报告(部分)
2013年"浪潮杯"山东省第四届ACM大学生程序设计竞赛排名:http://acm.upc.edu.cn/ranklist/ 一.第J题坑爹大水题,模拟一下就行了 J:Contes ...
- angry_birds_again_and_again(2014年山东省第五届ACM大学生程序设计竞赛A题)
http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2877 题目描述 The problems ca ...
- 2013年山东省第四届ACM大学生程序设计竞赛 Alice and Bob
Alice and Bob Time Limit: 1000ms Memory limit: 65536K 题目描述 Alice and Bob like playing games very ...
- 2013年山东省第四届ACM大学生程序设计竞赛J题:Contest Print Server
题目描述 In ACM/ICPC on-site contests ,3 students share 1 computer,so you can print your source code ...
随机推荐
- 关键字throw(something)限制
C++函数后加关键字throw(something)限制,是对这个函数的异常安全性作出限制.void f() throw() 表示f不允许抛出任何异常,即f是异常安全的.void f() throw( ...
- 用连接池提高Servlet访问数据库的效率
Java Servlet作为首选的服务器端数据处理技术,正在迅速取代CGI脚本.Servlet超越CGI的优势之一在于,不仅多个请求可以共享公用资源,而且还可以在不同用户请求之间保留持续数据.本文介绍 ...
- PHP替换中文字符
mb_regex_encoding('utf-8');$htmlNavSubmenu2 = str_replace('<li id="w-menu-food-334"> ...
- Tenth Line
How would you print just the 10th line of a file? For example, assume that file.txt has the followin ...
- iPhone、iPad默认按钮样式问题
iPhone.iPad默认按钮样式问题 解决方法给按钮元素添加一个-webkit-appearance: none;具体代码 input[type="button"], input ...
- ZOJ 3872 Beauty of Array
/** Author: Oliver ProblemId: ZOJ 3872 Beauty of Array */ /* 需求: 求beauty sum,所谓的beauty要求如下: 1·给你一个集合 ...
- access_token的获取方式
获取Access Token $appid = ""; $appsecret = ""; $url = "https://api.weixin.q ...
- opencv之图像膨胀
#include <cv.h> #include <highgui.h> void main() { IplImage* src; IplImage*dst; src=cvLo ...
- 架设wordpress再vps上的 一些感想总结
日本vps.樱花系列 配置: 2cpu+1G内存+100G硬盘 系统 第一次我把默认的centos 给换了..原因就是,不会linux.而且我主要用.net 感觉 mono也行.但是linux不会. ...
- 【Java】如何访问服务器
HTTP协议---------->GET.POST.XMLHttpRequest TCP/IP协议 SOAP协议---------->Web Service Server的作用是处理HTT ...