Cod sursa(job #1500195)

Utilizator Julian.FMI Caluian Iulian Julian. Data 11 octombrie 2015 16:50:32
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.56 kb
#include <iostream>
#include <fstream>

using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[106][106];

int main()
{int i,j,k;
    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(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && 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';
        }
}