Cod sursa(job #145762)

Utilizator igorPirnau Igor igor Data 29 februarie 2008 13:50:28
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include<stdio.h>

#define nmax 150
#define inf 2000000

int a[nmax][nmax], n, i, j, k;

int main()
{
    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", &a[i][j]);

    for(i=1; i<=n; i++) 
        for(j=1; j<=n; j++) if( i!=j && !a[i][j] ) a[i][j]=inf;

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

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

    return 0;
}