UVA - 10361 Automatic Poetry

http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=25129

水题，直接按照题意搞就行。

输出第一行是把<>去掉然后输出，只有两个<>, 第二行是把 ... 用两个<>的内容交换，然后<>后面的内容不变去代替。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <string>
#include <set>
#include <functional>
#include <numeric>
#include <sstream>
#include <stack>
#include <map>
#include <queue>

#define CL(arr, val)    memset(arr, val, sizeof(arr))

#define ll long long
#define inf 0x7f7f7f7f
#define lc l,m,rt<<1
#define rc m + 1,r,rt<<1|1
#define pi acos(-1.0)

#define L(x)    (x) << 1
#define R(x)    (x) << 1 | 1
#define MID(l, r)   (l + r) >> 1
#define Min(x, y)   (x) < (y) ? (x) : (y)
#define Max(x, y)   (x) < (y) ? (y) : (x)
#define E(x)        (1 << (x))
#define iabs(x)     (x) < 0 ? -(x) : (x)
#define OUT(x)  printf("%I64d\n", x)
#define lowbit(x)   (x)&(-x)
#define Read()  freopen("a.txt", "r", stdin)
#define Write() freopen("dout.txt", "w", stdout);
#define N 100005
using namespace std;

int main()
{
//Read();
int n,i,j,l1,l2;
char s1[105],s2[105];
while(scanf("%d",&n)!=EOF)
{
getchar();
while(n--)
{
gets(s1);
gets(s2);
int a1=-1,a2=-1,a3=-1,a4=-1;
l1=strlen(s1);
l2=strlen(s2);
//printf("%s %s\n",s1,s2);
for(i=0;i<l1;i++)
{
if(s1[i]!='<'&&s1[i]!='>')
printf("%c",s1[i]);
else if(s1[i]=='<')
{
if(a1==-1)
a1=i;
else a3=i;
}
else if(s1[i]='>')
{
if(a2==-1)
a2=i;
else a4=i;
}
}
printf("\n");
for(i=0;i<l2;i++)
{
if(s2[i]=='.')
{
for(j=a3+1;j<a4;j++)
printf("%c",s1[j]);
for(j=a2+1;j<a3;j++)
printf("%c",s1[j]);
for(j=a1+1;j<a2;j++)
printf("%c",s1[j]);
for(j=a4+1;j<l1;j++)
printf("%c",s1[j]);
break;
}
else printf("%c",s2[i]);
}
printf("\n");
}
}
return 0;
}