코드 import sys input = sys.stdin.readline n,m = map(int, input().split()) graph = [[*map(int, input().split())] for _ in range(n)] def floyd(): # 함수화 했을 때 더 빨리 실행된다. for i in range(n): for j in range(n): for k in range(n): if j == k: continue graph[j][k] = min(graph[j][k], graph[j][i]+graph[i][k]) floyd() for _ in range(m): a,b,c = map(int,input().split()) if graph[a-1][b-1]
