99클럽 코테 스터디 TIL

https://www.acmicpc.net/problem/11404

 

 

import sys
INF = int(1e9)

n = int(sys.stdin.readline())  
m = int(sys.stdin.readline())  

graph = [[INF] * (n + 1) for _ in range(n + 1)]    
for i in range(1, n + 1):
    for j in range(1, n + 1):
        if i == j:
            graph[i][j] = 0

for _ in range(m):
    a, b, c = map(int, sys.stdin.readline().split())
    graph[a][b] = min(c, graph[a][b]) 


for k in range(1, n + 1):
    for a in range(1, n + 1):
        for b in range(1, n + 1):
            graph[a][b] = min(graph[a][b], graph[a][k] + graph[k][b])

for a in range(1, n + 1):
    for b in range(1, n + 1):
        if graph[a][b] == INF:
            print("0",  end=" ")
        else:
            print(graph[a][b], end=" ")
    print()