Cod sursa(job #1401283)

Utilizator andrei.arnautuAndi Arnautu andrei.arnautu Data 25 martie 2015 19:14:10
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
// How about a coding trick?
#include <cstdio>
#define DIM 110
using namespace std;
FILE *fin=freopen("royfloyd.in","r",stdin);
FILE *fout=freopen("royfloyd.out","w",stdout);

int A[DIM][DIM];
int n;

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

    for(l = 1; l <= n; ++l)
        for(i = 1; i <= n; ++i)
            for(j = 1; j <= n; ++j)
                if( A[i][l] && A[l][j] && i != j && (!A[i][j] || A[i][j] > A[i][l] + A[l][j]))
                    A[i][j] = A[i][l] + A[l][j];

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