Cod sursa(job #2119344)

Utilizator AndreiBaraianAndrei Baraian AndreiBaraian Data 31 ianuarie 2018 23:19:57
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include<iostream>
#include<fstream>
using namespace std;

int w[101][101];
int d1[101][101], d2[101][101];

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

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 >> w[i][j];
			d1[i][j] = w[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++)
				d2[i][j] = min(d1[i][j], d1[i][k] + d1[k][j]);
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				d1[i][j] = d2[i][j];
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
			g << d2[i][j] << " ";
		g << endl;
	}
	g.close();
	return 0;
}