hunnu 11120 hidden code 暴力

http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=11128&courseid=91

暴力

#include<stdio.h>

#define N 111

int n;
int key[N],len[N];
char let[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";

bool imposible(int *a,int *b,int lkey,int le)
{
    int i;
    if(lkey>=le)
    {
        for(i=0;i<le;++i)
            if((a[i]+key[i])%26!=b[i])
                return 1;
    }
    else
    {
        for(i=0;i<lkey;++i)
            if((a[i]+key[i])%26 != b[i])
                return 1;
        for(;i<le;++i)
            if((a[i]+b[i-lkey])%26 != b[i])
                return 1;
    }

    return 0;
}
int main()
{
    int plain[N][N],ciph[N][N];
    while(scanf("%d",&n)!=