C - We Love MOE Girls-----(2015 summer training #9)
2015-08-14 13:15
411 查看
C - We Love MOE Girls
时限:500MS 内存:32768KB 64位IO格式:%I64d
& %I64u
问题描述
Chikami Nanako is a girl living in many different parallel worlds. In this problem we talk about one of them.
In this world, Nanako has a special habit. When talking with others, she always ends each sentence with "nanodesu".
There are two situations:
If a sentence ends with "desu", she changes "desu" into "nanodesu", e.g. for "iloveyoudesu", she will say "iloveyounanodesu". Otherwise, she just add "nanodesu" to the end of the original sentence.
Given an original sentence, what will it sound like aften spoken by Nanako?
输入
The first line has a number T (T <= 1000) , indicating the number of test cases.
For each test case, the only line contains a string s, which is the original sentence.
The length of sentence s will not exceed 100, and the sentence contains lowercase letters from a to z only.
输出
For every case, you should output "Case #t: " at first, without quotes. The t is the case number starting from 1. Then output which Nanako will say.
样例输入
样例输出
分析:水题。
CODE:
时限:500MS 内存:32768KB 64位IO格式:%I64d
& %I64u
问题描述
Chikami Nanako is a girl living in many different parallel worlds. In this problem we talk about one of them.
In this world, Nanako has a special habit. When talking with others, she always ends each sentence with "nanodesu".
There are two situations:
If a sentence ends with "desu", she changes "desu" into "nanodesu", e.g. for "iloveyoudesu", she will say "iloveyounanodesu". Otherwise, she just add "nanodesu" to the end of the original sentence.
Given an original sentence, what will it sound like aften spoken by Nanako?
输入
The first line has a number T (T <= 1000) , indicating the number of test cases.
For each test case, the only line contains a string s, which is the original sentence.
The length of sentence s will not exceed 100, and the sentence contains lowercase letters from a to z only.
输出
For every case, you should output "Case #t: " at first, without quotes. The t is the case number starting from 1. Then output which Nanako will say.
样例输入
2 ohayougozaimasu daijyoubudesu
样例输出
Case #1: ohayougozaimasunanodesu Case #2: daijyoubunanodesu
分析:水题。
CODE:
#include <iostream> #include <string.h> #include <algorithm> #include <cmath> using namespace std; int main() { int t,cas=0; cin>>t; while(t--){ cas++; char c[105]; memset(c,0,sizeof(c)); cin>>c; cout<<"Case #"<<cas<<": "; int len=strlen(c); if(len<4){ cout<<c; } else{ string s; for(int i=len-4;i<len;i++) s+=c[i]; if(s=="desu"){ for(int i=0;i<len-4;i++) cout<<c[i]; s.erase(); } else cout<<c; } cout<<"nanodesu"<<endl; } return 0; }
相关文章推荐
- B - Median-----(2015 summer training #8(Qualifying))
- Could not connect to '10.7.100.182' (port 22): Connection failed
- HIT 2060 Fibonacci Problem Again
- LeetCode Factorial Trailing Zeroes
- LeetCode Factorial Trailing Zeroes
- epoll_create, epoll_ctl和epoll_wait
- 2015 Multi-University Training Contest 2(hdu 5300 - hdu 5309)
- Clock Skew , Clock Uncertainty和 Period
- libvirtError: no connection driver available for qemu:///system 解决办法
- 2015 Multi-University Training Contest 8 hdu 5384 Danganronpa
- tools:context=".MainActivity的作用
- 使用Grails快速开发Web应用程序
- 构建您的第一个Grails 应用程序
- 2015 Multi-University Training Contest 1(hdu 5288 - hdu 5299)
- hdu1021Fibonacci Again找规律
- PS和AI软件区别
- HDU - 3394 Railway(连通分量+环)
- qmail 相关问题
- 智能改变未来TurboMail邮件系统招商新计划
- UVA 10986 Sending email 【dijkstra + 堆优化】