백준 1780번 종이의 개수 C/C++

www.acmicpc.net/problem/1780

1780번: 종이의 개수

#include <stdio.h>

using namespace std;

short paper[2190][2190];
int arr[5];

short cutting(int x, int y, int num) {
	if (num == 1) {
		return paper[y][x];
	}
	bool different = false;
	int cur, saved, t_arr[5] = { 0, };

	num /= 3;
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			cur = cutting(x + j * num, y + i * num, num);
			t_arr[cur + 1]++;

			if (different) continue;
			if ((i != 0 || j != 0) && saved != cur) {
				different = true;
			}
			saved = cur;
		}
	}

	if (different || cur == 2) {
		for (int i = 0; i < 3; i++) {
			arr[i] += t_arr[i];
		}
		return 2;
	}
	else return cur;
}

int main() {
	int n; scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			scanf("%d", &paper[i][j]);
		}
	}

	cutting(0, 0, n);
	if (!arr[0] && !arr[1] && !arr[2]) arr[paper[0][0] + 1]++;
	printf("%d\n%d\n%d\n", arr[0], arr[1], arr[2]);
	return 0;
}