下面的解法是最简单的但不是最精简的(可以用正则表达式最简化),像我这种有代码洁癖的人总喜欢把简单的问题复杂化啊啊啊啊啊。
题目链接:点击打开链接
#include<stdio.h>
#include<string.h>
#define N 110
int main (){
int i,j,Case,lena,lenb;
char a[N],b[N],s[N],s1[N],s2[N],s3[N],s4[N],s5[N];
while(scanf("%d\n",&Case) != EOF){
while(Case--){
gets(a);
gets(b);
lena = strlen(a);
for(j = 0,i = 0;a[i] != '<';i++,j++){
s1[j] = a[i];
}
s1[j] = '\0';
for(i = i+1,j = 0;a[i] != '>';i++,j++){
s2[j] = a[i];
}
s2[j] = '\0';
for(i = i+1,j = 0;a[i] != '<';i++,j++){
s3[j] = a[i];
}
s3[j] = '\0';for(i = i+1,j = 0;a[i] != '>';i++,j++){
s4[j] = a[i];
}
s4[j] = '\0';
for(i = i+1,j = 0;i < lena;i++,j++){
s5[j] = a[i];
}
s5[j] = '\0';
for(i = 0,j = 0;b[i] != '.';i++,j++){
s[j] = b[i];
}
s[j] = '\0';
printf("%s%s%s%s%s\n",s1,s2,s3,s4,s5);
printf("%s%s%s%s%s\n",s,s4,s3,s2,s5);
}
}
return 0;
}