Merge pull request #661 from gmlrude/main

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

Author: github-actions[bot]

live9/test99/문제1/박희경.py

@@ -0,0 +1,43 @@
+import sys
+from itertools import *
+
+input = sys.stdin.readline
+
+n = int(input())
+a = list(map(int, input().split()))
+
+operator_cnt = list(map(int, input().split()))
+
+max_value = float('-inf')
+min_value = float('inf')
+
+
+def bf(value, idx):
+    global max_value, min_value
+    if idx == n:
+        max_value = max(max_value, value)
+        min_value = min(min_value, value)
+        return
+    if operator_cnt[0] > 0: 
+        operator_cnt[0] -= 1
+        bf(value + a[idx], idx + 1)
+        operator_cnt[0] += 1        # 놓친 부분
+
+    if operator_cnt[1] > 0:
+        operator_cnt[1] -= 1
+        bf(value - a[idx], idx + 1)
+        operator_cnt[1] += 1
+
+    if operator_cnt[2] > 0:
+        operator_cnt[2] -= 1
+        bf(value * a[idx], idx + 1)
+        operator_cnt[2] += 1
+
+    if operator_cnt[3] > 0:
+        operator_cnt[3] -= 1
+        bf(int(value / a[idx]), idx + 1)    # 놓친 부분
+        operator_cnt[3] += 1
+
+bf(a[0], 1)
+print(max_value)
+print(min_value)

live9/test99/문제2/박희경.py

@@ -0,0 +1,10 @@
+import sys
+from itertools import *
+
+input = sys.stdin.readline
+
+n, m = map(int, input().split())
+arr = sorted(list(map(int, input().split())))
+
+for perm in permutations(arr, m):
+    print(*perm)

live9/test99/문제3/박희경.py

@@ -0,0 +1,31 @@
+from collections import *
+
+def is_correct(arr):
+    stack = []
+    for a in arr:
+        if a in '([{':
+            stack.append(a)
+        elif a == ')':
+            if not stack or stack[-1] != '(':
+                return False
+            stack.pop()
+        elif a == ']':
+            if not stack or stack[-1] != '[':
+                return False
+            stack.pop()
+        elif a == '}':
+            if not stack or stack[-1] != '{':
+                return False
+            stack.pop()
+
+    return not stack
+
+def solution(s):
+    answer = 0
+    queue = deque(s)
+    
+    for _ in range(len(queue)):
+        if is_correct(queue):
+            answer += 1
+        queue.rotate(-1)     
+    return answer