플로이드워셜

import sys input = sys.stdin.readline INF = int(1e9) # 무한을 의미하는 10억 값 설정 n = int(input()) graph = [] for _ in range(n): path = list(map(int, input().split())) for j in range(len(path)): # 0 이라면 INF로 변경하여 넣어주기 if path[j] == 0: path[j] = INF graph.append(path) for k in range(n): for a in range(n): for b in range(n): graph[a][b] = min(graph[a][b], graph[a][k] + graph[k][b]) for a in graph: for b in..