clohi 님의 블로그

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..

https://www.acmicpc.net/problem/14248 문제코드 import sysinput = sys.stdin.readlinen = int(input())arr = list(map(int, input().split()))arr.insert(0, 0)s = int(input())visited = [False] * (n+1)def dfs(arr, s, visited): if(not visited[s]): visited[s] = True if(s + arr[s] 0): dfs(arr, s-arr[s], visited)dfs(arr, s, visited)print(sum(visited)) 풀이 - DFS 사용 DFS를 사용하면 쉽게 풀리는 문제이다. 물론 B..