Submission #2516188

---

Source Code Expand

import sys
sys.setrecursionlimit(10**9)

n, m = map(int, input().split())
a = [[0] * n for i in range(n)]
for i in range(m):
    b = list(map(int, input().split()))
    a[b[0]-1][b[1]-1] = 1
    a[b[1]-1][b[0]-1] = 1

road = [[0] * n for i in range(n)]
count = 0
node = [0 for i in range(n)]


def dfs(v):
    for i in range(n):
        if a[v][i] == 1 and (road[v][i] == 0 and road[i][v] == 0):
            if node[i] == 1:
                global ans
                ans = 0
            road[v][i] = 1
            node[i] = 1
            dfs(i)

for i in range(n):
    if node[i] == 0:
        node[i] = 1
        ans = 1
        dfs(i)
        count += ans

print(count)

Submission Info

Judge Result