HDU 4730 We Love MOE Girls

这是一个简单的编程问题,要求根据特定规则修改字符串。当输入的句子以'desu'结尾时,将其替换为'nanodesu';否则,在句子末尾添加'nanodesu'。通过这个练习可以熟悉字符串操作和条件判断。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=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 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  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
 

题意:

            超水题,如果末尾是desu结尾就改成nanodesu

          否则直接加nanodesu,嘿嘿,这其实是日语的语气词啊,这题目真可爱!!!大笑大笑大笑


#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
char a[105];
int main()
{
     int t,k=1;
     scanf("%d",&t);
     while(t--)
     {
         scanf("%s",a);
         int len=strlen(a);
         printf("Case #%d: ",k++);
         if(a[len-4]=='d' && a[len-3]=='e' && a[len-2]=='s' && a[len-1]=='u')
         {
             for(int i=0;i<len-4;i++)
                printf("%c",a[i]);
             printf("nanodesu\n");
             continue;
         }
         printf("%snanodesu\n",a);
     }
     return 0;
}


























评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值