BOJ 1780 : 종이의 개수

 

---

[BOJ 1780(S2) 리뷰]

 

SIZE와 x,y좌표를 이용해 풀었다.

같은 값이 아닐경우 크기를 계속 줄어나가며 재귀함수를 호출했다.

---

 

#include <iostream>
#include <queue>
#include <string>
#include <string.h>
#include <math.h>
using namespace std;
int table[2300][2300];
int n;
int a=0, b=0, c=0;
int check(int size,int x, int y)
{
	int Cur = table[x][y];
	for (int i = x; i < x+size; i++)
	{
		for (int j = y; j < y+size; j++)
		{
			if (table[i][j] != Cur) //같은모양이 아님
				return -100;
		}
	}

	return Cur; //같은모양임
}


void func(int size,int x,int y)
{
	int cur = check(size, x, y);
	if (cur != -100) 
	{
		if (cur == -1) a++;
		else if (cur == 0) b++;
		else if (cur == 1) c++;
		return;
	}

	func(size / 3, x, y);
	func(size / 3, x + size / 3, y);
	func(size / 3, x + size / 3*2, y);
	func(size / 3, x , y+size/3);
	func(size / 3, x , y+size/3*2);
	func(size / 3, x + size / 3, y+size/3);
	func(size / 3, x + size / 3, y + size / 3*2);
	func(size / 3, x + size / 3*2, y + size / 3 );
	func(size / 3, x + size / 3 * 2, y + size / 3 * 2);


}


int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(0);
	memset(table, ' ', sizeof(table));
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> table[i][j];
		}
	}
	func(n, 0, 0);
	cout << a << '\n';
	cout << b << '\n';
	cout << c << '\n';
	
}