2013 ACM/ICPC Asia Regional Chengdu Online---1003
哈哈哈
#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <cmath>#include <algorithm>#include <vector>#include <queue>#include <map>#define inf 0x3f3f3f3fusing namespace std;int main(){ char s[110]; int T,len,i,cnt; scanf("%d",&T); getchar(); cnt=1; while(T--) { gets(s); printf("Case #%d: ",cnt++); len=strlen(s); if(s[len-1]=='u'&&s[len-2]=='s'&&s[len-3]=='e'&&s[len-4]=='d') { s[len-4]='\0'; } printf("%s",s); printf("nanodesu\n"); } return 0;}