Submission #9187059

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int N = 1010;

int n;
char c[N][N];

void NO() {
	cout << -1;
	exit(0);
}

void color(int x, int y) {
	c[x][y] = c[x][y + 1] = char('a');
	c[x][y + 2] = c[x + 1][y + 2] = char('b');
	c[x + 2][y + 1] = c[x + 2][y + 2] = char('c');
	c[x + 1][y] = c[x + 2][y] = char('d');
}

int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	if (n == 2)
		NO();
	for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)
				c[i][j] = '.';
	if (n % 3 == 0) {
		for (int i = 0; i * 3 < n; i++)
			color(i * 3, i * 3);
		for (int i = 0; i < n; i++, cout << '\n')
			for (int j = 0; j < n; j++)
				cout << c[i][j];
		return 0;
	}
	for (int i = 0; i <= n; i++)
		for (int j = 0; j <= n; j++)
			for (int k = 0; k <= 1; k++)
				if ((i * 4 + j * 5 + k * 7) == n) {
					int now = 0;
					for (int x = 0; x < i; x++) {
						c[now][now] = c[now + 1][now] = 'a';
						c[now][now + 1] = c[now + 1][now + 1] = 'b';
						c[now][now + 2] = c[now][now + 3] = 'c';
						c[now + 1][now + 2] = c[now + 1][now + 3] = 'd';
						c[now + 2][now] = c[now + 2][now + 1] = 'e';
						c[now + 2][now + 2] = c[now + 3][now + 2] = 'f';
						c[now + 2][now + 3] = c[now + 3][now + 3] = 'g';
						c[now + 3][now] = c[now + 3][now + 1] = 'h';
						now += 4;
					}
					for (int x = 0; x < j; x++) {
						c[now][now] = c[now + 1][now] = 'a';
						c[now][now + 1] = c[now + 1][now + 1] = 'b';
						c[now][now + 2] = c[now + 1][now + 2] = 'c';
						c[now + 2][now] = c[now + 3][now] = 'd';
						c[now + 2][now + 1] = c[now + 2][now + 2] = 'e';
						c[now + 2][now + 3] = c[now + 2][now + 4] = 'f';
						c[now + 3][now + 2] = c[now + 4][now + 2] = 'g';
						c[now + 3][now + 3] = c[now + 3][now + 4] = 'h';
						c[now + 4][now] = c[now + 4][now + 1] = 'i';
						c[now + 4][now + 3] = c[now + 4][now + 4] = 'j';
						now += 5;
					}
					for (int x = 0; x < k; x++) {
						c[now][now] = c[now + 1][now] = 'a';
						c[now][now + 1] = c[now + 1][now + 1] = 'b';
						c[now][now + 2] = c[now + 1][now + 2] = 'c';
						
						c[now + 2][now] = c[now + 3][now] = 'd';
						c[now + 2][now + 1] = c[now + 3][now + 1] = 'e';
						c[now + 2][now + 2] = c[now + 3][now + 2] = 'f';

						c[now + 4][now] = c[now + 5][now] = 'g';

						c[now + 4][now + 3] = c[now + 4][now + 4] = 'h';
						c[now + 4][now + 5] = c[now + 4][now + 6] = 'i';

						c[now + 5][now + 3] = c[now + 5][now + 4] = 'j';
						c[now + 5][now + 5] = c[now + 5][now + 6] = 'k';

						c[now + 6][now + 1] = c[now + 6][now + 2] = 'l';
						c[now + 6][now + 3] = c[now + 6][now + 4] = 'm';
						c[now + 6][now + 5] = c[now + 6][now + 6] = 'n';
						
						now += 7;
					}
						
					for (int x = 0; x < n; x++, cout << '\n')
						for (int y = 0; y < n; y++)
							cout << c[x][y];
					return 0;
				}
}

Submission Info

Judge Result