Update 1780.cpp

encrypted-def · web-flow · commit fbaec2d606f0 · 2021-06-15T14:26:10.000+09:00
diff --git a/0x0B/solutions/1780.cpp b/0x0B/solutions/1780.cpp
@@ -6,34 +6,34 @@ using namespace std;
 
 int N;
 int paper[2200][2200];
-int cnt[3]; //-1, 0, 1�� ä���� ���� ����
+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;
+  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;
-}
+    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);
+  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];
+  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";
-}
+}
