Merge pull request #140 from upsk1/Minjo

skydreamer21 · web-flow · commit a3aa885fee8a · 2022-10-24T23:16:46.000+09:00
insert 14601 code
diff --git a/2022/[Week27 - Mix]/김민조/14601.cpp b/2022/[Week27 - Mix]/김민조/14601.cpp
@@ -0,0 +1,42 @@
+﻿#include <bits/stdc++.h>
+using namespace std;
+int a[1 << 7][1 << 7];
+int num;
+bool check(int n, int x, int y) {
+	for (int i = x; i < x + n; i++) {
+		for (int j = y; j < y + n; j++) {
+			if (a[i][j])return false;
+		}
+	}
+	return true;
+}
+void solve(int n, int x, int y) {
+	num++;
+	int n2 = n / 2;
+	if (check(n2, x, y))a[x + n2 - 1][y + n2 - 1] = num;
+	if (check(n2, x, y + n2))a[x + n2 - 1][y + n2] = num;
+	if (check(n2, x + n2, y))a[x + n2][y + n2 - 1] = num;
+	if (check(n2, x + n2, y + n2))a[x + n2][y + n2] = num;
+	if (n == 2)return;
+	solve(n2, x, y);
+	solve(n2, x + n2, y);
+	solve(n2, x, y + n2);
+	solve(n2, x + n2, y + n2);
+}
+int main() {
+	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+	int n;
+	cin >> n;
+	n = (1 << n);
+	int x, y;
+	cin >> x >> y;
+	a[n - y][x - 1] = -1;
+	solve(n, 0, 0);
+	for (int i = 0; i < n; i++) {
+		for (int j = 0; j < n; j++) {
+			cout << a[i][j] << ' ';
+		}
+		cout << '\n';
+	}
+
+}
