HDU 4730 We Love MOE Girls
来源:互联网 发布:mac打不开winrar 编辑:程序博客网 时间:2024/05/03 00:38
Problem Description
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?
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?
Input
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.
Output
For every case, you should output "Case #t: " at first, without quotes. The [I]t[/I] is the case number starting from 1. Then output which Nanako will say.
Sample Input
2ohayougozaimasudaijyoubudesu
Sample Output
Case #1: ohayougozaimasunanodesuCase #2: daijyoubunanodesu
Source
2013 ACM/ICPC Asia Regional Chengdu Online
解题:
这尼玛水的题,我还WA了两次,一次没带case,急忙就艹上去了,第二次则更为SB,多输出了中间的某一位。
代码:
# include<cstdio># include<iostream># include<cstring>using namespace std;# define MAX 123char s[100];int main(void){ int t;cin>>t; getchar(); for ( int j = 1;j <= t;j++ ) { int flag = 0; gets(s); int n = strlen(s); for ( int i = n-4;i < n;i++ ) { if ( s[i] == 'd'&&s[i+1] =='e'&&s[i+2] == 's'&&s[i+3] == 'u' ) { flag = 1; break; } } if ( flag ) { printf("Case #%d: ",j); for ( int i = 0;i < n-4;i++ ) cout<<s[i]; cout<<"nanodesu"<<endl; } else { printf("Case #%d: ",j); for ( int i = 0;i < n;i++ ) { cout<<s[i]; } cout<<"nanodesu"<<endl; } } return 0;}
0 0
- Hdu 4730 We Love MOE Girls
- HDU 4730 We Love MOE Girls
- HDU 4730 We Love MOE Girls
- hdu 4730 We Love MOE Girls
- hdu 4730 We Love MOE Girls
- hdu 4730 We Love MOE Girls(水题)
- HDU 4730 We Love MOE Girls
- HDU - 4730 We Love MOE Girls 水题
- HDU 4730 We Love MOE Girls
- HDU 4730 We Love MOE Girls
- HDU 4730 We Love MOE Girls
- HDU - 4730 We Love MOE Girls
- HDU-4730 We Love MOE Girls
- HDU 4730-We Love MOE Girls
- HDU - 4730 We Love MOE Girls
- HDU 4730 We Love MOE Girls
- hdu--We Love MOE Girls
- [4730]:We Love MOE Girls
- 一维数据旋转
- 折腾二维数组
- 第十四周项目2带姓名的成绩单
- 黑马程序员——JAVA基础之基本数据类型包装类和1.5JDK新特性装箱
- 第14周项目2-带姓名的成绩单(文件版)
- HDU 4730 We Love MOE Girls
- 第十四周项目一折腾二维数组
- Hack Like a Pro: How to Hack a Computer & Spy on Anyone, Part 1
- 带姓名的成绩单
- armeabi armeabi-v7a mips x86 理解
- C#实验十三1234合集
- 黑马程序员——Java高新技术---反射
- 从B树、B+树、B*树谈到R 树
- HDU1393_Weird Clock【水题】