Cod sursa(job #2185876)

Utilizator petrea1551Petrea Calin petrea1551 Data 24 martie 2018 23:48:10
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <bits/stdc++.h>
using namespace std;

int n, m, t, a[101][101], w[101][101];

int main()
{
	ifstream cin("royfloyd.in");
	ofstream cout("royfloyd.out");
	cin >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
		{
			cin >> a[i][j];
			if (i != j)
				w[i][j] = 1;
		}
	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if (a[i][k] && a[k][j] && i != j && (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0 || (a[i][j] == a[i][k] + a[k][j] && w[i][j] < w[i][k] + w[k][j])))
				{
					a[i][j] = a[i][k] + a[k][j];
					w[i][j] = w[i][k] + w[k][j];
				}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
			cout << a[i][j] << ' ';
		cout << endl;
	}
	//for (int i = 1; i <= n; i++)
	//{
	//	for (int j = 1; j <= n; j++)
	//		cout << w[i][j] << ' ';
	//	cout << endl;
	//}
	return 0;
}