Cod sursa(job #3202836)

Utilizator laurentiu.maticaMatica Laurentiu-Andrei laurentiu.matica Data 12 februarie 2024 12:55:02
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.65 kb
// #include <iostream>
#define NMAX 100
#define INF 1000000000
#include <fstream>

using namespace std;

 ifstream cin("royfloyd.in");
 ofstream cout("royfloyd.out");

int a[NMAX + 1][NMAX + 1];


int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			cin >> a[i][j];
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			for (int k = 1; k <= n; k++)
				if (a[i][k] && a[k][j] && i!=j && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
					a[i][j] = a[i][k] + a[k][j];

	for (int i = 1; i <= n; i++, cout << '\n')
		for (int j = 1; j <= n; j++, cout << ' ')
			cout << a[i][j];
	return 0;
}