Merge pull request #550 from gmlrude/main

[박희경] 69차 라이브 코테 제출

Author: github-actions[bot]

live6/test69/문제1/박희경.py

@@ -0,0 +1,28 @@
+import sys
+
+input = sys.stdin.readline
+
+n, m = map(int, input().split())
+chess = [list(map(str, input().rstrip())) for _ in range(n)]
+
+cnt = []
+for a in range(n - 7):
+    for b in range(m - 7):
+        white = 0
+        black = 0
+        for i in range(a, a + 8):
+            for j in range(b, b + 8):
+                # (0, 0), (0, 2), (2, 0) 이 같은 색이어야 함
+                if (i + j) % 2 == 0:
+                    if chess[i][j] != 'W':
+                        white += 1
+                    else:
+                        black += 1
+                else:
+                    if chess[i][j] != 'W':
+                        black += 1
+                    else:
+                        white += 1
+        cnt.append(white)
+        cnt.append(black)
+print(min(cnt))

live6/test69/문제2/박희경.py

@@ -0,0 +1,10 @@
+import sys
+from itertools import *
+
+input = sys.stdin.readline
+
+n = int(input())
+arr = [i for i in range(1, n + 1)]
+
+for perm in permutations(arr, n):
+    print(*perm)

live6/test69/문제3/박희경.py

@@ -0,0 +1,21 @@
+import copy
+
+
+def solution(want, number, discount):
+    answer = 0
+
+    product = {}
+    for i in range(len(want)):
+        product[want[i]] = number[i]
+
+    for a in range(len(discount) - 9):
+        tmp_product = copy.deepcopy(product)
+        for i in range(a, a + 10):
+            if discount[i] in want:
+                tmp_product[discount[i]] -= 1
+
+        # 모두 0일 때 카운팅
+        if all(value <= 0 for value in tmp_product.values()):
+            answer += 1
+
+    return answer