# 행렬을 분할하여 함수를 짜면 쉽게 해결할 수 있는 문제, 편리하게 진행하기 위해 check 함수로 분할 여부 체크




package bj;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class p1780 {
	static int arr[][];
	static int result[];
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(br.readLine());
		arr = new int[N][N];
		result = new int[3];
		StringTokenizer st;
		
		for(int i=0; i<N; i++) {
			st = new StringTokenizer(br.readLine());
			for(int j=0; j<N; j++) {
				arr[i][j] = Integer.parseInt(st.nextToken());
			}
		}
		
		//종이가 모두 같은 수로 되어 있는지 체크
		solve(N,0,0);
		for(int i:result)
			System.out.println(i);
	}
	
	public static void solve(int n,int x, int y) {
		if(n==1) {
			int val = arr[y][x]+1;
			result[val]++;
			return;
		}
		
		if(check(n, x ,y)) {
			int val = arr[y][x]+1;
			result[val]++;
		}else {
			int next = n/3;
			
			solve(next, x, y);
			solve(next, x + next, y);
			solve(next, x + 2*next, y);
			
			solve(next, x, y + next);
			solve(next, x + next, y+next);
			solve(next, x + 2*next, y+next);
			
			solve(next, x, y + 2 * next);
			solve(next, x + next, y + 2 * next);
			solve(next, x + 2 * next, y + 2 * next);
			
		}
	}
	
	public static boolean check(int n, int x, int y) {
		int val = arr[y][x];
		boolean rs = true;
		for(int i=y; i<y+n; i++) {
			for(int j=x; j<x+n; j++) {
				if(val != arr[i][j]) {
					rs = false;
					return rs;
				}
			}
		}
		return rs;
	}
}

+ Recent posts