11404번: 플로이드

#include <cstdio>
#include <algorithm>
using namespace std;
#define inf 1000000000
int main()
{
    int n, m, a, b, c, route[101][101];
    scanf("%d %d", &n, &m);
    fill_n(&route[0][0], 10201, inf);
    for (int i = 1; i <= n; ++i)
        route[i][i] = 0;
    for (int i = m; i--; route[a][b] = min(route[a][b], c))
        scanf("%d %d %d", &a, &b, &c);
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                route[i][j] = min(route[i][j], route[i][k] + route[k][j]);
    for (int i = 1; i <= n; ++i, printf("\n"))
        for (int j = 1; j <= n; ++j)
            printf("%d ", route[i][j]);
}