Cod sursa(job #2247103)

Utilizator akumariaPatrascanu Andra-Maria akumaria Data 27 septembrie 2018 21:37:10
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <cstdio>

using namespace std;

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

    int n, i, j, k;
    scanf("%d", &n);
    int a[n+1][n+1];

    for(i=0; i<n; ++i)
        for(j=0; j<n; ++j)
            scanf("%d", &a[i][j]);

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

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

    return 0;
}