UVA 10361 Automatic Poetry

每组两行输入，第一行中有形如<a>b<c>d的串，第二行中有“...”。输出时把第一行中的<>去掉，在第二行中用cbad来代替"..."。

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", n)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 100000000;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int N = 111;
const int M = 33;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

char s1[N], s2[N], sa[N], sb[N], sc[N], sd[N];

int main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int n, l1, l2, la, lb, lc, ld;
    RI(n);
    getchar();
    while(n--)
    {
        gets(s1);
        gets(s2);
        l1 = strlen(s1);
        l2 = strlen(s2);
        la = lb = lc = ld = 0;
        CLR(sa, 0);CLR(sb, 0);CLR(sc, 0);CLR(sd, 0);
        REP(i, l1)
        {
            if(s1[i] == '<')
            {
                i++;
                while(s1[i] != '>')sa[la++] = s1[i++];
                i++;
                while(s1[i] != '<')sb[lb++] = s1[i++];
                i++;
                while(s1[i] != '>')sc[lc++] = s1[i++];
                i++;
                while(i < l1)sd[ld++] = s1[i++];
                printf("%s%s%s%s\n", sa, sb, sc, sd);
                break;
            }
            putchar(s1[i]);
        }
        REP(i, l2)
        {
            if(s2[i] == '.')
            {
                printf("%s%s%s%s\n", sc, sb, sa, sd);
                break;
            }
            putchar(s2[i]);
        }
    }
    return 0;
}