Merge pull request #45 from YoonYn9915/main

YoonYn9915 / 7월 3주차 / 2문제

Author: Mingguriguri

YoonYn9915/Graph/2024-07-22-[백준]-#18352-특정 거리의 도시 찾기.py

@@ -0,0 +1,39 @@
+from collections import deque
+import sys
+
+f = sys.stdin.readline
+
+def bfs(visited, graph,k,x):
+        visited[x] = 0
+        queue = deque([x])
+        answer = []
+
+        while queue:
+            current_city = queue.popleft()
+            for next_city in graph[current_city]:
+                if visited[next_city] == -1:
+                    queue.append(next_city)
+                    visited[next_city] = visited[current_city] + 1
+                    if visited[next_city] == k:
+                        answer.append(next_city)
+
+        if not answer:
+            print(-1)
+        else:
+            answer.sort()
+            for ans in answer:
+                print(ans)
+
+
+n,m,k,x = map(int, f().split())
+
+graph = [[] for _ in range(n+1)]
+
+
+for i in range(m):
+    a,b = map(int, f().split())
+    graph[a].append(b)
+
+visited = [-1] * (n+1)
+
+bfs(visited, graph,k,x)

YoonYn9915/brute force/2024-07-16-[백준]-#2798-블랙잭.py

@@ -0,0 +1,19 @@
+
+n,m = map(int,input().split())
+
+arr = list(map(int,input().split()))
+
+arr.sort(reverse=True)
+num = 3
+
+result = m
+answer = 0
+
+for i in range(n):
+    for j in range(i+1,n):
+        for k in range(j+1,n):
+            if arr[i]+arr[j]+arr[k] <= m:
+                answer = max(answer,arr[i]+arr[j]+arr[k])
+                break
+
+print(answer)