Cod sursa(job #1989500)

Utilizator leraValeria lera Data 7 iunie 2017 17:52:14
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include <iostream>
#include <fstream>
#define Nmax 105
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[Nmax][Nmax];
int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            fin>>a[i][j];
    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][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j)a[i][j]=a[i][k]+a[k][j];
    for(int i=1;i<=n;i++,fout<<'\n')
        for(int j=1;j<=n;j++)
        fout<<a[i][j]<<" ";
    return 0;
}