简单字符串处理
代码:
#include<iostream> #include<string> using namespace std; #define MAXN 102 string a1, a2; void solve() { int p1 = a1.find('<', 0); int p2 = a1.find('>', 0); int p3 = a1.find('<', p2+1); int p4 = a1.find('>', p2+1); string s1 = a1.substr(0, p1); string s2 = a1.substr(p1+1, p2-p1-1); string s3 = a1.substr(p2+1, p3-p2-1); string s4 = a1.substr(p3+1, p4-p3-1); string s5 = a1.substr(p4+1); cout<<s1<<s2<<s3<<s4<<s5<<endl; a2.replace(a2.length()-3, 3, s4+s3+s2+s5); cout<<a2<<endl; } int main() { int t; cin>>t; cin.get(); while(t--) { getline(cin, a1); getline(cin, a2); solve(); } }