Notice
Recent Posts
Recent Comments
Link
목록24480 (1)
clohi 님의 블로그
[BOJ / Python] 24480 : 알고리즘 수업 - 깊이 우선 탐색 2
https://www.acmicpc.net/problem/24480 문제 코드import syssys.setrecursionlimit(100000)input = sys.stdin.readlinen, m, r = map(int, input().split())graph = [[] for _ in range(n+1)]visited = [False] * (n+1)for i in range(m): u, v = map(int, input().split()) graph[u].append(v) graph[v].append(u)for j in graph: j.sort(reverse=True)idx = 1def dfs(graph, visited, n): global idx visited[n..
Algorithm/BOJ
2025. 8. 17. 23:44