Cod sursa(job #2421684)

Utilizator qusyNastase Alexandru qusy Data 15 mai 2019 19:20:17
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.58 kb
#if 1
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int m[10005][10005];
int n;

void roy()
{
	int k, i, j;
	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if (m[i][j] > (m[i][k] + m[k][j]))
					m[i][j] = m[i][k] + m[k][j];

}
int main()
{
	
	f >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			f >> m[i][j];
	roy();
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++)
			g << m[i][j] << ' ';
		g << '\n';
	}



	return 0;
}
#endif