poj3087

点击打开链接

#include<iostream>#include<cstring>using namespace std;char a[105], b[105], c[210], d[210], s1[105], s2[105];int n, l, num, flag;int deal2(){char *p;p = d;strncpy(s1, p, l);s1[l] = 0;p = &d[l];strncpy(s2, p, l);s2[2*l] = 0;return(0);}int deal(){int i, k = 0;for(i = 0; i < l; i ++){d[k ++] = s2[i];d[k ++] = s1[i];}d[k] = 0;return(0);}int main(){int i;cin >> n;for(i = 1; i <= n; i ++){cin >> l >> a >> b >> c;flag = 1;strcpy(s1, a);strcpy(s2, b);deal();while(1){if(strcmp(c, d) == 0){break;}deal2();flag ++;if(strcmp(a, s1) == 0){flag = -1;break;}deal();}cout << i << ' ' << flag << endl;}return(0);}