BOJ2422 한윤정이...

randi65535·2020년 11월 25일
0
N, M = map(int, input().split())

cant = [[0]*201 for _ in range(201)]
for i in range(M):
	a, b = map(int, input().split())
	cant[a][b] = 1
	cant[b][a] = 1

ans = 0
for i in range(1,N+1):
	for j in range(i+1, N+1):
		for k in range(j+1, N+1):
			if cant[i][j] or cant[j][k] or cant[i][k]:
				continue
			ans += 1
print(ans)
profile
unsinged int 8byte-1

0개의 댓글

관련 채용 정보

Powered by GraphCDN, the GraphQL CDN