Cod sursa(job #1816186)

Utilizator antanaAntonia Boca antana Data 26 noiembrie 2016 10:50:26
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <cstdio>
#define MAXN 100

int n, d[MAXN+1][MAXN+1];

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);

    int i, j, k;

    scanf("%d", &n);

    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j){
            scanf("%d", &d[i][j]);
        }

    for(k=1; k<=n; ++k)
        for(i=1; i<=n; ++i)
            for(j=1; j<=n; ++j)
                if(i!=j && d[i][k] != 0 && d[k][j] != 0 && (d[i][j] == 0 || d[i][j] > d[i][k] + d[k][j]))
                    d[i][j] = d[i][k] + d[k][j];

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

    return 0;
}