Cod sursa(job #1266122)

Utilizator AlexNiuclaeNiculae Alexandru Vlad AlexNiuclae Data 18 noiembrie 2014 12:41:44
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <cstdio>
#define Nmax 110

using namespace std;

int n,i,j;
int a[Nmax][Nmax];

inline void royfloyd()
{
    int i,j,k;
    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] && i!=j && (a[i][j]>a[i][k]+a[k][j] || !a[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 (i=1;i<=n;++i)
     for (j=1;j<=n;++j)
      scanf("%d", &a[i][j]);

    royfloyd();

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

        printf("\n");
    }

    return 0;
}