Cod sursa(job #1896208)

Utilizator andrei_diaconuAndrei Diaconu andrei_diaconu Data 28 februarie 2017 15:49:08
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <fstream>

#define NMax 101
#define INF 1000000000

using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int n, adj[NMax][NMax];

int get_min(int a, int b)
{
	if (a < b)
		return a;
	return b;
}

int main()
{
	f >> n;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			f >> adj[i][j];

			if (adj[i][j] == 0)
				adj[i][j] = INF;
		}
	}

	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if (i != j)
					adj[i][j] = get_min(adj[i][j], adj[i][k] + adj[k][j]);

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if (adj[i][j] == INF)
				adj[i][j] = 0;

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++)
			g << adj[i][j] << ' ';
		g << '\n';
	}
}