SWEA 7465 문제 바로가기
문제의 저작권은 SW Expert Academy에 있습니다.

문제

나의 코드

def DFS(now):
    if False not in visited:
        return
    else:
        for p in people[now]:
            if not visited[p]:
                visited[p]=True
                DFS(p)

for tc in range(int(input())):
    N,M=map(int, input().split())
    people=[[] for _ in range(N+1)]
    visited=[False]*(N+1)
    visited[0]=True
    answer=0
    for m in range(M):
        f,s=map(int, input().split())
        people[f].append(s)
        people[s].append(f)
    for i in range(1,N+1):
        if not visited[i]:
            answer += 1
            visited[i]=True
            DFS(i)
    print('#{} {}'.format(tc+1, answer))