例题7-5(uva-129)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
int l, n,cnt = 0;
char arr[100];

int dfs(int cur) {
	if (cnt++ == n) {
		for (int i = 0; i < cur; i++) {
			if (i % 64 == 0 && i) cout << endl;
			else if (i % 4 == 0 && i) cout << " ";
			cout << arr[i];
		}
		cout <<endl<< cur << endl;
		return 0;
	}
	else {
		for (int i = 0; i < l; i++) {
			arr[cur] = 'A' + i;
			int isok = 1;
			for (int j = 1; j * 2 <= cur+1; j++) {
				int issame = 1;
				for (int k = 0; k < j; k++) {
					if (arr[cur - k] != arr[cur - j - k]) {
						issame = 0;
						break;
					}
				}
				if (issame) { isok = 0; break; }
			}
			if (isok) {
				if (!dfs(cur + 1)) return 0;
			}
		}
	}
	return 1;
}
int main()
{
	while (cin >> n >> l && (n | l) ) {
		cnt = 0;
		dfs(0);
	}
	return 0;
}