Merge pull request #642 from Yujin-Baek/main

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

Author: gmlrude

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

@@ -0,0 +1,15 @@
+from itertools import permutations
+
+def solution(k, dungeons):
+    answer = float("-inf")
+    
+    for dungeon in permutations(dungeons, len(dungeons)):
+        temp_k = k
+        max = 0
+        for min_p, minus_p in dungeon:
+            if temp_k >= min_p:
+                temp_k -= minus_p
+                max += 1
+        if max > answer:
+            answer = max
+    return answer

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

@@ -0,0 +1,32 @@
+def dfs(node, graph, visited):
+    visited[node] = True
+    size = 1
+    
+    for neighbor in graph[node]:
+        if not visited[neighbor]:
+            size += dfs(neighbor, graph, visited)
+    
+    return size
+
+def solution(n, wires):
+    answer = float('inf')
+    
+    for i in range(len(wires)):
+        count = 0
+        w_copy = wires[:]
+        w_copy.pop(i)
+        print(w_copy)
+        graph = [[] for _ in range(n+1)]
+    
+        for wire in w_copy:
+            graph[wire[0]].append(wire[1])
+            graph[wire[1]].append(wire[0])
+    
+        visited = [False] * (n + 1)
+        size_one = dfs(w_copy[0][0], graph, visited)
+        size_two = n - size_one
+        
+        answer = min(answer, abs(size_one - size_two))
+        
+    print(count)
+    return answer

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

@@ -0,0 +1,12 @@
+def solution(brown, yellow):
+    answer = []
+    
+    total = brown + yellow
+    
+    for h in range(1, total+1):
+        if total%h == 0:
+            w = total//h
+            if (w-2)*(h-2) == yellow:
+                return [w, h]
+    
+    return answer