[BOJ] 2630 색종이 만들기

문제

www.acmicpc.net/problem/2630

2630번: 색종이 만들기

풀이

import java.io.*;
import java.util.*;

public class Main {
	
	static int[][] paper;
	static int N;
	static int[] cnt;
	
	static void get_paper_num(int rs, int cs, int N) {
		boolean chk = true;
		int color = paper[rs][cs];
		for(int i=0;i<N;i++) {
			if(chk) {
				for(int j=0;j<N;j++) {
					if(paper[rs+i][cs+j]!=color) {
						chk = false;
						break;
					}
				}	
			}
			else
				break;
		}
		if(chk) {
			cnt[paper[rs][cs]]++;
			return;
		}
			
		get_paper_num(rs,cs,N/2);
		get_paper_num(rs,cs+N/2,N/2);
		get_paper_num(rs+N/2,cs,N/2);
		get_paper_num(rs+N/2,cs+N/2,N/2);
	}
	public static void main(String[] args) throws IOException {
        //선언 및 입력
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    	StringTokenizer st;
    	StringBuilder sb = new StringBuilder();
    	N = Integer.parseInt(br.readLine());
    	paper = new int[N][N];
    	cnt = new int[2];
    	Arrays.fill(cnt, 0);
    	for(int i=0;i<N;i++) {
    		st = new StringTokenizer(br.readLine());
    		for(int j=0;j<N;j++) {
    			paper[i][j] = Integer.parseInt(st.nextToken());
    		}
    	}
    	
    	//계산
    	get_paper_num(0,0,N);
    	for(int c:cnt)
    		System.out.println(c);
	}
}