Merge pull request #641 from baekhangyeol/main

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

Author: gmlrude

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

@@ -0,0 +1,30 @@
+import itertools
+
+
+def solution(k, dungeons):
+    answer = -1
+
+    counts = []
+
+    p = itertools.permutations(dungeons, len(dungeons))
+
+    for i in p:
+        counts.append(maxDungeons(k, i))
+
+    counts.sort()
+
+    return counts[-1]
+
+
+def maxDungeons(k, dungeons):
+    count = 0
+    health = k
+
+    for dungeon in dungeons:
+        if dungeon[0] > health:
+            break
+        else:
+            count += 1
+            health -= dungeon[1]
+
+    return count

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

@@ -0,0 +1,31 @@
+def solution(n, wires):
+
+    min_difference = float('inf')
+
+    for i in range(len(wires)):
+        graph = {j: [] for j in range(1, n+1)}
+
+        for j, (v1, v2) in enumerate(wires):
+            if i != j:
+                graph[v1].append(v2)
+                graph[v2].append(v1)
+
+        visited = [False] * (n+1)
+        count = dfs(1, graph, visited)
+
+        min_difference = min(min_difference, abs(count-(n-count)))
+
+    return min_difference
+
+
+def dfs(start, graph, visited):
+    visited[start] = True
+    count = 1
+
+    for neighbor in graph[start]:
+        if not visited[neighbor]:
+            count += dfs(neighbor, graph, visited)
+
+    return count
+
+print(solution(9, [[1,3],[2,3],[3,4],[4,5],[4,6],[4,7],[7,8],[7,9]]))

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

@@ -0,0 +1,31 @@
+import itertools
+
+
+def solution(brown, yellow):
+    answer = []
+    pair = []
+
+    total = brown + yellow
+
+    divisors = getDivisor(total)
+
+    for comb in itertools.product(divisors, repeat=2):
+        if (comb[0] - 2) * (comb[1] - 2) == yellow and comb[0] >= comb[1]:
+            pair.append(comb)
+
+    pair.sort(reverse=True)
+
+    answer.append(pair[0][0])
+    answer.append(pair[0][1])
+
+    return answer
+
+
+def getDivisor(num):
+    divisors = []
+
+    for i in range(1, num + 1):
+        if num % i == 0:
+            divisors.append(i)
+
+    return divisors