Cod sursa(job #3141653)

Utilizator picalexPicioroaga Alexandru picalex Data 15 iulie 2023 11:57:16
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.68 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105];
void roy_floyd()
{
	for (int k = 1; k <= n; k++)//cautam un drum mai scurt avand k intermediar: i->k->j
		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];
}

int main()
{
	fin >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			fin >> a[i][j];
	roy_floyd();
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
			fout << a[i][j] << " ";
		fout << endl;
	}
	return 0;
}