#include "Anna.h"
#include <iostream>
#include <cstring>
#include <random>
#include <algorithm>

typedef long long ll;

using namespace std;

namespace
{
	const int val[72] = {160, 128, 76, 204, 64, 144, 176, 246, 38, 12, 2, 130, 168, 166, 42, 10, 45, 61, 81, 89, 181, 48, 140, 4, 192, 25, 157, 132, 72, 109, 17, 97, 115, 178, 225, 193, 1, 67, 49, 146, 121, 106, 208, 240, 0, 7, 133, 80, 18, 32, 114, 84, 14, 136, 70, 195, 135, 137, 108, 44, 143, 66, 155, 9, 19, 75, 154, 62, 36, 52, 94, 46};
	int n, pat[8][9];
	bool FST;
	inline void Init()
	{
		FST = 1;
		for (int i = 0, k = 0; i < 8; i++)
			for (int j = i; j < 8; j++)
			{
				pat[i][j] = val[k++];
				if (i != j) pat[j][i] = val[k++];
				else pat[i][8] = val[k++];
			}
	}
}

void Anna(int X, int Y, int N, string S)
{
	if (!FST) Init();
	while (S.size() < 43) S.push_back('A');
	int s = (X == Y && S.back() == 'B' ? pat[X][8] : pat[X][Y]);
	for (int i = 0, k = 0; i < 8; i++)
		for (int j = 0; j < 8; j++)
			if (i != j && i != X && j != Y) Paint(i, j, S[k] - 'A'), k++;
	for (int i = 0; i < 8; i++)
		if (i != X && i != Y) Paint(i, i, (s >> i) & 1);
}

#include "Bruno.h"
#include <iostream>
#include <vector>
#include <cstring>
#include <random>
#include <algorithm>

using namespace std;

namespace
{
	const int val[72] = {160, 128, 76, 204, 64, 144, 176, 246, 38, 12, 2, 130, 168, 166, 42, 10, 45, 61, 81, 89, 181, 48, 140, 4, 192, 25, 157, 132, 72, 109, 17, 97, 115, 178, 225, 193, 1, 67, 49, 146, 121, 106, 208, 240, 0, 7, 133, 80, 18, 32, 114, 84, 14, 136, 70, 195, 135, 137, 108, 44, 143, 66, 155, 9, 19, 75, 154, 62, 36, 52, 94, 46};
	int n, pat[8][9], idx[260][2];
	bool FST;
	inline void Init()
	{
		FST = 1;
		for (int i = 0, k = 0; i < 8; i++)
			for (int j = i; j < 8; j++)
			{
				pat[i][j] = val[k++];
				if (i != j) pat[j][i] = val[k++];
				else pat[i][8] = val[k++];
			}
		for (int i = 0; i < 8; i++)
			for (int j = 0; j < 9; j++)
				for (int u = 0, cur; u < 2; u++)
					for (int v = 0; v < 2; v++)
					{
						cur = pat[i][j] | (u << i) | (v << (j == 8 ? i : j));
						idx[cur][0] = i, idx[cur][1] = j;
					}
	}
}

string Bruno(int N, vector <vector <int>> T)
{
	if (!FST) Init();
	int s = 0;
	for (int i = 0; i < 8; i++) s |= T[i][i] << i;
	int X = idx[s][0], Y = idx[s][1]; bool fl = 0;
	string S = "";
	if (Y == 8) Y = X, fl = 1;
	for (int i = 0; i < 8; i++)
		for (int j = 0; j < 8; j++)
			if (i != j && i != X && j != Y)
				S.push_back(T[i][j] + 'A');
	if (S.size() != 43) S.push_back(fl + 'A');
	return S.substr(0, N);
}