[BOJ] 1992 : 쿼드트리

#include <stdio.h>

int n;
char a[65][65];

void gogo(int x1, int y1, int x2, int y2) {
	char now = a[x1][y1];
	if (x1 == x2 && y1 == y2) {
		printf("%c", now);
		return;
	}
	for (int i = x1; i < x2; ++i) {
		for (int j = y1; j < y2; ++j) {
			if (now != a[i][j]) {
				printf("(");
				gogo(x1, y1, (x1 + x2) / 2, (y1 + y2) / 2);
				gogo(x1, (y1 + y2) / 2, (x1 + x2) / 2, y2);
				gogo((x1 + x2) / 2, y1, x2, (y1 + y2) / 2);
				gogo((x1 + x2) / 2, (y1 + y2) / 2, x2, y2);
				printf(")");
				return;
			}
		}
	}
	printf("%c", now);
}

int main() {
	scanf("%d\n", &n);
	for (int i = 0; i < n; ++i)
		scanf("%s", a[i]);
	gogo(0, 0, n, n);

	return 0;
}