Cod sursa(job #1871292)

Utilizator Rocamadour1497Alexandru Martiniuc Rocamadour1497 Data 7 februarie 2017 11:29:44
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <iostream>
#include <fstream>

using namespace std;

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

const int inf = 1e9;

long long  dp[102][102];

int n;

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

void roy_floyd()
{
	int i, j, k;
	for (k = 1; k <= n; k++)
		for (i = 1; i <= n; i++)
			for (j = 1; j <= n; j++)
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}

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

	//cout << endl;
	roy_floyd();
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= n; j++)
			g << dp[i][j] << " ";
		g << endl;
	}

}