uva_10361_Automatic Poetry

最新推荐文章于 2021-07-28 10:20:53 发布

原创最新推荐文章于 2021-07-28 10:20:53 发布 · 257 阅读

0 ·

CC 4.0 BY-SA版权

String 专栏收录该内容

7 篇文章

订阅专栏

water
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define MAXN    5
#define MAXV    101

char str[MAXN][MAXV], second[MAXV];

void deal_first(void)
{
        gets(second);
        int idx(0), pos(0);
        for(int i = 0; '\0' != second[i]; i ++, pos ++) {
                if( '<' == second[i] || '>' == second[i] ) {
                        str[idx][pos] = '\0'; idx ++; pos = -1; continue;
                }
                str[idx][pos] = second[i];
        }
        str[idx][pos] = '\0';
}

void deal_second(void)
{
        gets(second); int pos;
        for(pos = 0; '.' != second[pos]; pos ++) {
                ;
        }
        second[pos] = '\0';
}

int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
        freopen("test.in", "r", stdin);
#endif
        char v;
        int  n;
        while( ~scanf("%d", &n) ) { getchar();
                for( ; n; n --) {
                        deal_first(); deal_second();

                        //first output
                        for(int i = 0; i < MAXN; i ++) {
                                printf("%s", str[i]);
                        }
                        printf("\n");

                        //second output
                        printf("%s%s%s%s%s\n", second, str[3], str[2], str[1], str[4]);
                }
        }
        return 0;
}