Merge pull request #41 from YoonYn9915/main

YoonYn9915 / 7월 2주차 2문제

Author: Mingguriguri

YoonYn9915/Graph/2024-07-15-[백준]-#2606-바이러스.py

@@ -0,0 +1,34 @@
+from collections import defaultdict
+from collections import deque
+
+
+def bfs(graph, visited):
+    queue = deque()
+
+    queue.append(1)
+    visited[1] = 1
+    answer = 0
+
+    while queue:
+        num = queue.popleft()
+        for neighbor in graph[num]:
+            if visited[neighbor] == 0:
+                queue.append(neighbor)
+                visited[neighbor] = 1
+                answer += 1
+
+    print(answer)
+
+
+numOfComputer = int(input())
+numOfConnection = int(input())
+
+graph = defaultdict(list)
+visited = [0] * (numOfComputer + 1)
+
+for _ in range(numOfConnection):
+    n1, n2 = map(int, input().split())
+    graph[n1].append(n2)
+    graph[n2].append(n1)
+
+bfs(graph, visited)

YoonYn9915/dp/2024-07-15-[백준]-#1463-1로 만들기.py

@@ -0,0 +1,23 @@
+
+
+n = int(input())
+
+arr = [-1] * 1000001
+
+arr[1] = 0
+arr[2] = 1
+arr[3] = 1
+
+for i in range(4, n + 1):
+
+    arr[i] = arr[i - 1] + 1
+
+    if i % 3 == 0:
+        if arr[i//3] + 1 < arr[i]:
+            arr[i] = arr[i//3] + 1
+    if i % 2 == 0:
+        if arr[i//2] + 1 < arr[i]:
+            arr[i] = arr[i//2] + 1
+
+
+print(arr[n])