Merge pull request encrypted-def#55 from cpprhtn/boj-1780

encrypted-def · web-flow · commit dcdf53302cdf · 2021-06-15T14:26:41.000+09:00
Update 1780.cpp
diff --git a/0x0B/solutions/1780.cpp b/0x0B/solutions/1780.cpp
@@ -1,11 +1,39 @@
-// Authored by : BaaaaaaaaaaarkingDog
+// Authored by : cpprhtn
 // Co-authored by : -
-// http://boj.kr/****************
+// http://boj.kr/8882cceb247049b18599a0b2847540b8
 #include <bits/stdc++.h>
 using namespace std;
 
-int main(void){
+int N;
+int paper[2200][2200];
+int cnt[3]; //-1, 0, 1로 채워진 종이 갯수
+
+//해당 종이 내부에 같은 숫자로만 채워졌는지 확인하는 함수
+bool check(int x, int y, int n) {
+  for (int i = x; i < x + n; i++)
+  for (int j = y; j < y + n; j++)
+    if (paper[x][y] != paper[i][j])
+    return false;
+  return true;
+}
+void solve(int x, int y, int z)
+{
+  if (check(x, y, z)) {
+    cnt[paper[x][y] + 1] += 1;
+    return;
+  }
+  int n = z / 3;
+  for (int i = 0; i < 3; i++)
+  for (int j = 0; j < 3; j++)
+    solve(x + i * n, y + j * n, n);
+}
+int main(void) {
   ios::sync_with_stdio(0);
   cin.tie(0);
-  
-}
+  cin >> N;
+  for (int i = 0; i < N; i++)
+  for (int j = 0; j < N; j++)
+    cin >> paper[i][j];
+  solve(0, 0, N);
+  for (int i = 0; i < 3; i++) cout << cnt[i] << "\n";
+}
