Cod sursa(job #3202841)

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

using namespace std;

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

int a[NMAX + 1][NMAX + 1];
const int INF = INT_MAX;

int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
		{
			int x;
			cin >> x;
			if (i == j && !x)
				a[i][j] = 0;
			else if (x)
				a[i][j] = x;
			else
				a[i][j] = INF;
		}
	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]!=INF && a[k][j] != INF && 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++, cout << '\n')
		for (int j = 1; j <= n; j++, cout << ' ')
		{
			if (a[i][j] != INF)
				cout << a[i][j];
			else
				cout << 0;
		}
	return 0;
}