Cod sursa(job #256801)

Utilizator ZillaMathe Bogdan Zilla Data 12 februarie 2009 11:03:33
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <stdio.h>

#define Nmax 101

int a[Nmax][Nmax],n;

int main()
{
    int 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",&a[i][j]);
    for(k=1;k<=n;++k)
        for(i=1;i<=n;++i)
            for(j=1;j<=n;++j)
                if(a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || a[i][j]==0) && i!=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;    
}