Cod sursa(job #407188)

Utilizator hasegandaniHasegan Daniel hasegandani Data 2 martie 2010 09:42:37
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include<stdio.h>

#define Nmax 105

int N,a[Nmax][Nmax];

void solve()
{
    for(int k=1;k<=N;++k)
        for(int i=1;i<=N;++i)
            for(int j=1;j<=N;++j)
                if (i!=j && (!a[i][j] || a[i][j] > a[i][k]+a[k][j]) && a[i][k] && a[k][j])
                    a[i][j] = a[i][k] + a[k][j];

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

void cit();

int main()
{
    cit();
    solve();
    return 0;
}

void cit()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    scanf("%d",&N);
    for(int i=1;i<=N;++i)
        for(int j=1;j<=N;++j)
            scanf("%d",&a[i][j]);
}