UVA 10361 Automatic Poetry

简单的字符串处理问题， 代码如下：

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>

#define MAXN 100
int n;
char l1[MAXN];
char l2[MAXN];
char c1[MAXN];
char c2[MAXN];
char ss[MAXN][MAXN];

int main()
{
    int i,j, ps;
    char ch;
    //freopen("input.txt", "r", stdin);
    scanf("%d", &n);
    getchar();
    while(n--) {
        memset(l1, 0, sizeof(l1));
        memset(l2, 0, sizeof(l2));
        memset(ss, 0, sizeof(ss));
        i = j = ps = 0;
        while((ch = getchar()) != '\n') {
            if(ch == '<') {
                ps++;
                j = 0;
            } else if(ch == '>') {
                ss[ps][j] = '\0';
                ps++;
                j = 0;
            } else if(ch != '<' && ch != '>') {
                l1[i++] = ch;
                ss[ps][j++] = ch;
            }
        }
        i = 0;
        while((ch = getchar()) != '\n') {
            if(ch != '.') l2[i++] = ch;
        }
        strcat(l2, ss[3]);
        strcat(l2, ss[2]);
        strcat(l2, ss[1]);
        strcat(l2, ss[4]);

        printf("%s\n", l1);
        printf("%s\n", l2);

    }

    return 0;
}