思路：
1003是大水题
#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio> #include<vector> #include<string> #include<cstdlib> #include<cstring> #include<iostream> #include<algorithm> #define pb push_back #define mp make_pair #define Maxn 100010 #define Maxm 200010 #define LL __int64 #define Abs(x) ((x)>0?(x):(-x)) #define lson(x) (x<<1) #define rson(x) (x<<1|1) #define inf 100000 #define lowbit(x) (x&(-x)) #define clr(x,y) memset(x,y,sizeof(x)) #define Mod 1000000007 using namespace std; char ss[20]="nanodesu"; int main() { int t,i,j,l; int Case=0; char str[110]; scanf("%d",&t); while(t--){ scanf("%s",&str); l=strlen(str); printf("Case #%d: ",++Case); if(l>=4&&str[l-1]=='u'&&str[l-2]=='s'&&str[l-3]=='e'&&str[l-4]=='d'){ str[l-4]='\0'; printf("%s",str); printf("%s\n",ss); continue; } printf("%s",str); printf("%s\n",ss); } return 0; }