POJ 3087 Shuffle'm Up(模拟题)

#include <stdio.h>
#include <string.h>

void Solve()
{
    int n, m;
    char s1[110], s2[110], s3[210], s4[210], s[210];
    scanf("%d", &n);
    for(int p = 1; p <= n; p++)
    {
        memset(s, 'a', sizeof(s));
        scanf("%d%*c", &m);
        scanf("%s%s%s", s1, s2, s3);
        printf("%d ", p);
        strcpy(s, s1);
        strcat(s, s2);
        strcpy(s4, s);
        int t;
        for(t = 0; strcmp(s, s3); t++)
        {
            for(int j = 0; j < m; j++)
            {
                s1[j] = s[j];
                s2[j] = s[j+m];
            }
            int i, j;
            for(i = 0, j = 0; i < m; i++, j+=2)
            {
                s[j] = s2[i];
                s[j+1] = s1[i];
            }
            if(strcmp(s4, s) == 0)
            {
                t = -1;
                break;
            }
        }
        printf("%d\n", t);
    }
}

int main(void)
{
    //freopen("data.in", "r", stdin);
    Solve();

    return 0;
}