n = int(input())
k = int(input())
map = []
backup = []
checkMap = []
def adventure(p, x): # define call X
for i in range(n+1):
if map[x][i] == 1:
checkMap[p][i] = 1
map[x][i] = 0
adventure(p, i)
def generate():
data = []
for i in range(n + 1):
v = []
for j in range(n + 1):
v.append(0)
data.append(v)
return data
map = generate()
backup = generate()
checkMap = generate()
for i in range(k):
x, y = input().split()
map[int(x)][int(y)] = 1
backup[int(x)][int(y)] = 1
for i in range(1, n+1):
for p1 in range(1, n+1):
for p2 in range(1, n+1):
map[p1][p2] = backup[p1][p2]
adventure(i, i)
v1 = 0
for i in range(1, n+1):
s1 = 0
s2 = 0
for p in range(1, n+1):
s1 += checkMap[i][p]
s2 += checkMap[p][i]
if n-1 == s1+s2:
v1 += 1
print(v1)
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
220210(2)
220210(2)
댓글 0개
좋아요
댓글(0)
bottom of page