백준 1780번 종이의 개수

#include <iostream>

using namespace std;

int minus1 = 0;
int zero = 0;
int one = 0;

bool is_same1(int **paper, int N, int x, int y) {
	int first_num = paper[x][y];
	for (int i = x; i < x+N; i++) {
		for (int j = y; j < y+N; j++) {
			if (first_num != paper[i][j])	return false;
		}
	}
	return true;
}

int divide_N_count(int **paper, int N, int x, int y) {
	if (is_same1(paper, N, x, y)) {
		if (paper[x][y] == -1)	minus1++;
		else if (paper[x][y] == 0) zero++;
		else one++;
		return 0;
	}
	for (int i = x; i < x+N; i = i+(N/3)) {
		for (int j = y; j < y+N; j = j + (N / 3)) {
			divide_N_count(paper, N / 3, i, j);
		}
	}
}

int main() {
	//입력
	int N;
	cin >> N;

	int **paper = new int*[N];
	for (int i = 0; i < N; i++) {
		paper[i] = new int[N];
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			cin >> paper[i][j];
		}
	}

	//실행
	divide_N_count(paper, N, 0, 0);

	//출력
	cout << minus1 << endl;
	cout << zero << endl;
	cout << one << endl;
}