Cod sursa(job #1116096)

Utilizator FasinedJohnny Bravo Fasined Data 22 februarie 2014 12:35:56
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.54 kb
#include<fstream>
#define nx 107
using namespace std;
int a[nx][nx],n,i,j,k;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
       for(j=1;j<=n;j++)fin>>a[i][j];

    for(k=1;k<=n;k++)
       for(j=1;j<=n;j++)
          for(i=1;i<=n;i++)
             if(i!=j && a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j]  || !a[i][j]))a[i][j]=a[i][k]+a[k][j];

    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)fout<<a[i][j]<<' ';
        fout<<'\n';
    }

    return 0;
}