http://acm.hdu.edu.cn/showproblem.php?pid=5082
字符串水题
#pragma comment(linker, "/STACK:36777216") #pragma GCC optimize ("O2") #include <cstdio> #include <cstdlib> #include <cmath> #include <cstring> #include <string> #include <queue> #include <map> #include <iostream> #include <algorithm> using namespace std; #define RD(x) scanf("%d",&x) #define RD2(x,y) scanf("%d%d",&x,&y) #define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z) #define clr0(x) memset(x,0,sizeof(x)) #define eps 1e-9 const double pi = acos(-1.0); typedef long long LL; const int modo = 1e9 + 7; const int INF = 0x3f3f3f3f; const int maxn = 55,maxm = 1e4 + 5; char r[100],s[100]; int main(){ //freopen("in.txt", "r", stdin); while(~scanf("%s",r)){ int rr = 0,ss = 0; while(r[rr++] != '_'); if(!~scanf("%s",s)) break; while(s[ss++] != '_'); printf("%s_small_%s ",r+rr,s+ss); } return 0; }