Cod sursa(job #803653)

Utilizator ucnahHancu Andrei ucnah Data 27 octombrie 2012 23:08:16
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <cstdio>
#define N 101
using namespace std;
int a[N][N];
int n;
void citire()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            scanf("%d",&a[i][j]);
}
void royfloyd()
{
    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][k]+a[k][j]<a[i][j] || a[i][j]==0) && a[i][k]!=0 && a[k][j]!=0)
                    a[i][j]=a[i][k]+a[k][j];
}
void afisare()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            printf("%d ",a[i][j]);
        printf("\n");
    }
}
int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    citire();
    royfloyd();
    afisare();
    return 0;
}