Cod sursa(job #1170363)

Utilizator stef93Stefan Gilca stef93 Data 13 aprilie 2014 13:21:36
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>

using namespace std;

inline int minim(int a, int b)
{
	return a > b ? b : a;
}

int main()
{
	ifstream in("royfloyd.in");
	ofstream out("royfloyd.out");
	int n, i, j, k;
	int g[101][101];

	in >> n;

	for (i = 0; i < n; i++)
	{
		for (j = 0; j < n; j++)
		{
			in >> g[i][j];
		}
	}
	in.close();

	for (i = 0; i < n; i++)
	{
		for (j = 0; j < n; j++)
		{
			for (k = 0; k < n; k++)
			{
				if (i != j && g[i][k] != 0 && g[k][j] != 0)
				g[i][j] = minim(g[i][j], g[i][k] + g[k][j]);
			}
		}
	}

	for (i = 0; i < n; i++)
	{
		for (j = 0; j < n; j++)
		{
			out << g[i][j] << ' ';
		}
		out << '\n';
	}

	out.close();
	return 0;
}