[4730]:We Love MOE Girls

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 a**dd “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 t is the case number starting from 1. Then output which Nanako will say.

Sample Input
2
ohayougozaimasu
daijyoubudesu

Sample Output
Case #1: ohayougozaimasunanodesu
Case #2: daijyoubunanodesu

Source
2013 ACM/ICPC Asia Regional Chengdu Online

解题思路：只要看懂了上面标黑的部分，题目就可以做了
如果句子以“desu”结尾，那么输出前面部分再加”nanodesu”,如果最后四个不是，那么输出原句，再加上“nanodesu”

#include<stdio.h>
#include<string.h>
#define N 120

char str[N];

int main()
{
    int n, num = 1;
    scanf("%d", &n);
    while(n--){
        scanf("%s", str);
        int len = strlen(str);
        printf("Case #%d: ", num++);
        if(str[len-4] == 'd' && str[len-3] == 'e' && str[len-2] == 's' && str[len-1] == 'u'){
            int i;
            for(i=0; i<len-4; i++){
                printf("%c", str[i]);
            }
        } else {
            printf("%s", str);
        }
        printf("nanodesu\n");
    }
    return 0;
}