Uva-129 Krypton Factor

#include <bits/stdc++.h>
#define _for(i,a,b) for(int i = (a);i < (b);i ++)
using namespace std;


const char a[27] = {'A','B','C','D','E','F','G','H','I','J',
                    'K','L','M','N','O','P','Q','R','S','T',
                    'U','V','W','X','Y','Z'
                   };

int n,L;
int cnt;
int s[82];

int judge(int cur)
{
    for(int j = 1; j * 2 <= cur + 1; j ++)
    {
        int equal = 1;
        _for(k,0,j)
        if(s[cur-k]!=s[cur-k-j])
        {
            equal = 0;
            break;
        }
        if(equal) return 0;
    }
    return 1;
}
int dfs(int cur)
{
    if(cnt++ == n)
    {
        _for(i,0,cur)
        {
            if(i && (i%64!=0) && (i%4==0)) printf(" ");
            if(i && (i%64==0)) printf("
");
            printf("%c",a[s[i]]);
        }
        printf("
%d
",cur);
        return 0;
    }
    _for(i,0,L)
    {
        s[cur] = i;
        if(judge(cur))
            if(!dfs(cur+1))    return 0;
    }
    return 1;
}

int main()
{
    while(cin >> n >> L && (n || L))
    {
        memset(s,0,sizeof(s));
        cnt = 0;
        dfs(0);
    }
    return 0;
}