Cod sursa(job #2603317)

Utilizator matthriscuMatt . matthriscu Data 19 aprilie 2020 11:14:01
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.59 kb
#include <cstdio>

int main() {
    int n, M[105][105], i, j, k;
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    scanf("%d", &n);
    for(i = 1; i <= n; ++i)
        for(j = 1; j <= n; ++j)
            scanf("%d", &M[i][j]);

    for(k = 1; k <= n; ++k)
        for(i = 1; i <= n; ++i)
            for(j = 1; j <= n; ++j)
                if(M[i][j] > M[i][k] + M[k][j])
                    M[i][j] = M[i][k] + M[k][j];

    for(i = 1; i <= n; ++i) {
        for(j = 1; j <= n; ++j)
            printf("%d ", M[i][j]);
        printf("\n");
    }
}