황소개발자

개떡같은 문제 import sys sys.setrecursionlimit(10000000) n, m = map(int, sys.stdin.readline().split()) adj = [[] for i in range(n + 1)] visited = [False] * (n + 1) for i in range(m): a, b = map(int, sys.stdin.readline().split()) adj[a].append(b) adj[b].append(a) def fake_dfs(v): visited[v] = True for i in adj[v]: if not(visited[i]): fake_dfs(i) count = 0 for i in range(1, n + 1): if not(visited[i]): c..