字符串处理 BestCoder Round #43 1001 pog loves szh I

题目传送门

/*
    字符串处理：是一道水题，但是WA了3次，要注意是没有加''的字符串不要用%s输出，否则在多组测试时输出多余的字符
*/
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;

typedef long long ll;
const int MAXN = 1e2 + 10;
const int INF = 0x3f3f3f3f;
char ss[MAXN];
char s[MAXN], t[MAXN];

int main(void)        //BestCoder Round #43 1001 pog loves szh I
{
//    freopen ("A.in", "r", stdin);

    int tt;    scanf ("%d", &tt);
    while (tt--)
    {
        scanf ("%s", ss + 1);
//        printf ("%s
", ss + 1);
        int len = strlen (ss + 1);
//        printf ("%s
", ss + 1);    continue;
        int p1 = 0, p2 = 0;
        for (int i=1; i<=len; ++i)
        {
            if (i & 1)    s[++p1] = ss[i];
            else    t[++p2] = ss[i];
        }

        for (int i=1; i<=p1; ++i)    printf ("%c", s[i]);
        puts ("");
        for (int i=p2; i>=1; --i)    printf ("%c", t[i]);
        puts ("");

//        if (tt)    puts ("");
    }

    return 0;
}