Merge pull request #662 from baekhangyeol/main

[백한결] 99차 라이브 코테 제출

Author: github-actions[bot]

live9/test99/문제1/백한결.py

@@ -0,0 +1,42 @@
+min_value = float('inf')
+max_value = float('-inf')
+
+def main():
+    N = int(input())
+    A = list(map(int, input().split()))[:N]
+    operator = list(map(int, input().split()))[:4]
+
+    def dfs(i, now):
+        global min_value, max_value
+
+        if i == N:
+            min_value = min(min_value, now)
+            max_value = max(max_value, now)
+        else:
+            if operator[0] > 0:
+                operator[0] -= 1
+                dfs(i + 1, now + A[i])
+                operator[0] += 1
+            if operator[1] > 0:
+                operator[1] -= 1
+                dfs(i + 1, now - A[i])
+                operator[1] += 1
+            if operator[2] > 0:
+                operator[2] -= 1
+                dfs(i + 1, now * A[i])
+                operator[2] += 1
+            if operator[3] > 0:
+                operator[3] -= 1
+                if now < 0:
+                    dfs(i + 1, -(-now // A[i]))
+                else:
+                    dfs(i + 1, now // A[i])
+                operator[3] += 1
+
+    dfs(1, A[0])
+
+    print(max_value)
+    print(min_value)
+
+if __name__ == "__main__":
+    main()

live9/test99/문제2/백한결.py

@@ -0,0 +1,13 @@
+import itertools
+
+def main():
+    N, M = map(int, input().split())
+    A = list(map(int, input().split()))[:N]
+
+    A.sort()
+
+    for i in itertools.permutations(A, M):
+        print(*i)
+
+if __name__ == "__main__":
+    main()

live9/test99/문제3/백한결.py

@@ -0,0 +1,34 @@
+def solution(s):
+    count = 0
+
+    rightGaulHoList = ["()", "[]", "{}"]
+
+    for i in range(len(s)):
+        stack = []
+        rotated = s[i:] + s[:i]
+
+        isPerfect = False
+
+        for j in rotated:
+            if j == "(" or j == "[" or j == "{":
+                stack.append(j)
+
+            elif j == ")" or j == "]" or j == "}":
+                if stack:
+                    total = stack[-1] + j
+
+                    if total in rightGaulHoList:
+                        stack.pop()
+                        isPerfect = True
+                    else:
+                        isPerfect = False
+                        break
+
+                else:
+                    isPerfect = False
+                    break
+
+        if isPerfect and not stack:
+            count += 1
+
+    return count