Cod sursa(job #2126276)

Utilizator AndreiBaraianAndrei Baraian AndreiBaraian Data 9 februarie 2018 14:21:06
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include<iostream>
#include<fstream>
using namespace std;

int d[101][101];

int main()
{
	ifstream f("royfloyd.in");
	ofstream g("royfloyd.out");
	int n = 0;
	f >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			f >> d[i][j];
	f.close();
	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if ((d[i][j] > d[i][k] + d[k][j]) || (d[i][j] == 0 && i!=j))
					d[i][j] = d[i][k] + d[k][j];
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
			g << d[i][j] << " ";
		g << endl;
	}
	g.close();
	return 0;
}