Merge pull request #63 from YoonYn9915/main

YoonYn9915 / 9월 4주차 / 2문제

Author: zaqquum

YoonYn9915/Graph/2024-09-30-[백준]-#2644-촌수계산.py

@@ -0,0 +1,30 @@
+
+N = int(input())
+A, B = map(int, input().split())
+M = int(input())
+graph = [[] for _ in range(N+1)]
+visited = [False] * (N+1)
+result = []
+
+for _ in range(M):
+  x, y = map(int, input().split())
+  graph[x].append(y)
+  graph[y].append(x)
+
+# dfs
+def dfs(v, num):
+  num += 1
+  visited[v] = True
+
+  if v == B:
+    result.append(num)
+
+  for i in graph[v]:
+    if not visited[i]:
+      dfs(i, num)
+
+dfs(A, 0)
+if len(result) == 0:
+  print(-1)
+else:
+  print(result[0]-1)

YoonYn9915/Graph/2024-09-30[백준]-#14888-연산자 끼워넣기.py

@@ -0,0 +1,31 @@
+
+def dfs(level, total, plus, minus, mul, div):
+    global max_result
+    global min_result
+    global n
+
+    #종료 조건
+    if level == n:
+        max_result = max(total, max_result)
+        min_result = min(total, min_result)
+
+    if plus != 0:
+        dfs(level + 1, total + nums[level], plus - 1, minus, mul, div)
+    if minus != 0:
+        dfs(level + 1, total - nums[level], plus, minus - 1, mul, div)
+    if mul != 0:
+        dfs(level + 1, total * nums[level], plus, minus, mul - 1, div)
+    if div != 0:
+        dfs(level + 1, int(total / nums[level]), plus, minus, mul, div - 1)
+
+
+n = int(input())
+nums = list(map(int, input().split()))
+op = list(map(int, input().split()))
+
+max_result = -int(1e9)
+min_result = int(1e9)
+dfs(1, nums[0], op[0], op[1], op[2], op[3])
+
+print(max_result)
+print(min_result)