poj3087Shuffle'm Up

http://poj.org/problem?id=3087

一道模拟题折腾了好久

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
map<string,int>ff;
int main()
{
    int i,j,k,n;
    char s1[110],s2[110],s[300],ss[300];
    cin>>n;
    for(i = 1; i <= n ; i++)
    {
        cin>>k;
        getchar();
        gets(s1);
        gets(s2);
        gets(s);
        int k1 = 0,k2=0,num=0;
        cout<<i<<" ";
        while(1)
        {
            k1 = 0;
            k2 = 0;
            num++;
            for(j = 0 ; j < 2*k ;j++)
            {
                if(j%2==0)
                ss[j] = s2[k1++];
                else
                ss[j] = s1[k2++];
            }
            ss[2*k] = '\0';
            if(strcmp(ss,s)==0)
            {
                cout<<num<<endl;
                break;
            }
            if(ff[ss])
            {
                cout<<"-1"<<endl;
                break;
            }
            ff[ss] = 1;
            for(j = 0 ; j < k ; j++)
            s1[j] = ss[j];
            for(j = k ; j < 2*k ; j++)
            s2[j-k] = ss[j];
        }
    }
    return 0;
}