UVA 10361 - Automatic Poetry(二)
continue;
}
//第二次找到>
if(leftB1 && rightB1 && leftB2 && !rightB2 && l1[i]=='>'){
rightB2 = true;
continue;
}
//找到第二个<>中间的字符
if(leftB1 && rightB1 && leftB2 && !rightB2){
s4 += l1[i];
continue;
}
//找到第二个<>后面的字符
if(leftB1 && rightB1 && leftB2 && rightB2){
s5 += l1[i];
continue;
}
}
int l1start = l1.find('<');
string s1 = l1.substr(0, l1start);
//cout << "s2:" << s2 << endl;
//cout << "s3:" << s3 << endl;
//cout << "s4:" << s4 << endl;
//cout << "s5:" << s5 << endl;
cout << (s1+s2+s3+s4+s5) << endl;
string combine = s4+s3+s2+s5;
cout << l2.replace(l2start,3,combine) << endl;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("10361.in", "r", stdin);
freopen("10361.out", "w", stdout);
#endif
int n;
scanf("%d", &n);
getchar();
for(int i=0; i
l1.clear();
l2.clear();
//memset(l1, '\0', sizeof(l1));
//memset(l2, '\0', sizeof(l2));
//fgets(l1, MAXN, stdin);
//fgets(l2, MAXN, stdin);
www.2cto.com
getline(cin, l1);
getline(cin, l2);
//cout << l1 << endl;
//cout << l2 << endl;
play();
}
}
#endif