Cod sursa(job #1280255)

Utilizator RazecBotez Cezar Razec Data 1 decembrie 2014 17:43:16
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include<stdio.h>
int n,i,j,k,a[101][101],oo=10000000;
void read(),solve();
int main()
{
    read();
    solve();
    return 0;
}
void read()
{
    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]);
            if(!a[i][j])a[i][j]=oo;
        }
        for(i=1;i<=n;i++)a[i][i]=0;
}
void solve()
{
    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];
                    else a[i][j]=a[i][j];
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            if(a[i][j]==oo) printf("0 ");
            else printf("%d ",a[i][j]);
        printf("\n");
    }
}