Cod sursa(job #2380133)

Utilizator GabyD002Dobrita Gabriel GabyD002 Data 14 martie 2019 16:30:55
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.54 kb
#include <bits/stdc++.h>
#define NM 105
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[NM][NM];
int main()
{	int n;
    f>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++) f>>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((i!=j && a[i][j] && a[k][j]+a[i][k]<a[i][j]) || !a[i][j]) a[i][j]=a[k][j]+a[i][k];
	for(int i=1; i<=n; i++)
	{   for(int j=1; j<=n; j++) g<<a[i][j]<<' ';
	    g<<'\n';
	}
	return 0;
}