코드 import sys INF = 987654321 input =sys.stdin.readline n = int(input()) m = int(input()) graph = [[INF]*(n+1) for _ in range(n+1)] for _ in range(m): x,y = map(int, input().split()) graph[x][y] = y def floyd(): # 모든 경로를 찾아주기 위해 플로이드 워셜 알고리즘 사용 for i in range(1, n+1): for j in range(1, n+1): for k in range(1, n+1): if j == k: continue graph[j][k] = min(graph[j][k], graph[j][i]+graph[i][k]) floyd..
