๐ฅ Silver1https://www.acmicpc.net/problem/21937 โ
์ ๋ต์ฝ๋import sysinput = sys.stdin.readlinedef dfs(idx): stack.append(idx) visited[idx] = True while stack: cur = stack.pop() for i in graph[cur]: if not visited[i]: stack.append(i) visited[i] = True answer.add(i)n, m = map(int, input().strip().split())graph = [[] fo..
