Cod sursa(job #1077782)

Utilizator PlatonPlaton Vlad Platon Data 11 ianuarie 2014 17:32:07
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <stdio.h>

#define maxn 105

int n,a[maxn][maxn];

void RF()
{
    for(int k=1;k<=n;++k)
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j)
                if (a[i][k]&&a[k][j]&&((a[i][k]+a[k][j]<a[i][j])||(!a[i][j]))&&(i!=j)) a[i][j]=a[i][k]+a[k][j];
}



int main()
{
    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]);
    RF();

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

    return 0;
}