Merge pull request #659 from Yujin-Baek/main

[백유진] 99차 라이브 코테 제출

Author: github-actions[bot]

live9/test99/문제1/백유진.py

@@ -0,0 +1,36 @@
+n = int(input())
+arr = list(map(int, input().split()))
+op = list(map(int, input().split()))
+
+def dfs(start_index, start_val, plus, minus, mul, div):
+  stack = [(start_index, start_val, plus, minus, mul, div)]
+  max_result = -float('inf')
+  min_result = float('inf')
+
+  while stack:
+    index, current, p, m, mu, d = stack.pop()
+    if index == n:
+      max_result = max(max_result, current)
+      min_result = min(min_result, current)
+      continue
+
+    num = arr[index]
+
+    if p:
+      stack.append((index + 1, current + num, p - 1, m, mu, d))
+    if m:
+      stack.append((index + 1, current - num, p, m - 1, mu, d))
+    if mu:
+      stack.append((index + 1, current * num, p, m, mu - 1, d))
+    if d:
+      if current < 0:
+        next_val = -(-current // num)
+      else:
+        next_val = current // num
+      stack.append((index + 1, next_val, p, m, mu, d - 1))
+
+  return max_result, min_result
+
+max_val, min_val = dfs(1, arr[0], *op)
+print(max_val)
+print(min_val)

live9/test99/문제2/백유진.py

@@ -0,0 +1,12 @@
+from itertools import permutations
+n, m = map(int, input().split())
+arr = list(map(int, input().split()))
+
+result = []
+for p in permutations(arr, m):
+  result.append(p)
+
+result.sort()
+
+for r in result:
+  print(*r)

live9/test99/문제3/백유진.py

@@ -0,0 +1,26 @@
+def solution(s):
+    answer = 0
+    
+    for i in range(len(s)):
+        ns = s[i:] + s[:i]
+        
+        stack = []
+        isValid = True
+        
+        for n in ns:
+            if n == '(' or n == '{' or n == '[':
+                stack.append(n)
+            else:
+                if not stack:
+                    isValid = False
+                    break
+                top = stack[-1]
+                if n == ')' and top == '(' or n == '}' and top == '{' or n == ']' and top == '[':
+                    stack.pop()
+                else:
+                    isValid = False
+                    break
+        if isValid and not stack:
+            answer += 1
+                
+    return answer