Cod sursa(job #2426044)

Utilizator ciprian.perju.fmiCiprian Perju ciprian.perju.fmi Data 25 mai 2019 20:26:14
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.59 kb
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
long long n, a[105][105];
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 (i != j && (a[i][k] + a[k][j] < a[i][j] || !a[i][j]) && a[i][k] && a[k][j])
					a[i][j] = a[i][k] + a[k][j];
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
			fout << a[i][j] << ' ';
		fout << '\n';
	}
	return 0;
}