From 67132f3a30886487f7e2b0eebc5b478de99596f1 Mon Sep 17 00:00:00 2001
From: monsileI <hansaem900d@kakao.com>
Date: Sun, 29 May 2022 22:58:51 +0900
Subject: [PATCH] q

---
 .../src/Today22_05_27/quate.java              | 55 +++++++++++++++++++
 1 file changed, 55 insertions(+)
 create mode 100644 Basic_Of_Algorithm/src/Today22_05_27/quate.java

diff --git a/Basic_Of_Algorithm/src/Today22_05_27/quate.java b/Basic_Of_Algorithm/src/Today22_05_27/quate.java
new file mode 100644
index 0000000..756557c
--- /dev/null
+++ b/Basic_Of_Algorithm/src/Today22_05_27/quate.java
@@ -0,0 +1,55 @@
+package Today22_05_27;
+
+public class quate {
+
+	static int [] answer = new int[2];
+
+	public static void main(String[] args) {
+		
+		
+		int [][] arr = {{1,1,1,1,1,1,1,1},{0,1,1,1,1,1,1,1},{0,0,0,0,1,1,1,1},{0,1,0,0,1,1,1,1},{0,0,0,0,0,0,1,1},{0,0,0,0,0,0,0,1},{0,0,0,0,1,0,0,1},{0,0,0,0,1,1,1,1}};
+		
+		
+		
+		dfs(arr,arr.length,0,0);
+		
+		
+		System.out.println(answer[0]+" : "+answer[1]);
+		
+	}
+	
+	static boolean check(int[][]arr,int size,int x, int y) {
+		
+		for(int i=x;i<x+size;i++) {
+			for(int j=y;j<y+size;j++) {
+				if(arr[i][j]!=arr[x][y]) return false;
+			}
+		}
+		
+		
+		
+		return true;
+		
+		
+	}
+	
+	static void dfs(int[][]arr,int size,int x, int y) {
+		
+		
+		if(check(arr,size,x,y)) {
+			
+			answer[arr[x][y]]++;
+			
+			return;
+		}
+		
+		
+		dfs(arr,size/2,x,y);
+		dfs(arr,size/2,x,y+size/2);
+		dfs(arr,size/2,x+size/2,y+size/2);
+		dfs(arr,size/2,x+size/2,y);
+		
+		
+		
+	}
+}