clohi 님의 블로그

https://www.acmicpc.net/problem/15900 문제 코드import sysfrom collections import dequeinput = sys.stdin.readlinen = int(input())graph = [[] for _ in range(n+1)]for i in range(n-1): a, b = map(int, input().split()) graph[a].append(b) graph[b].append(a)visited = [False] * (n+1)dist = [0] * (n+1)leafnode = []sum_dist = 0q = deque([1])visited[1] = Truewhile q: is_leafnode = True u = q.po..

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