Cod sursa(job #148581)

Utilizator wefgefAndrei Grigorean wefgef Data 4 martie 2008 15:56:43
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include <iostream>
using namespace std;

#define INF 1000000000
#define MAXN 128

int N;
int C[MAXN][MAXN];

int main() {
	freopen("royfloyd.in", "r", stdin);
	freopen("royfloyd.out", "w", stdout);

	cin >> N;
	for (int i = 0; i < N; ++i)
		for (int j = 0; j < N; ++j) {
			cin >> C[i][j];
			C[i][j] = C[i][j] || i == j ? C[i][j] : INF;
		}

	for (int k = 0; k < N; ++k)
		for (int i = 0; i < N; ++i)
			for (int j = 0; j < N; ++j)
				C[i][j] = min(C[i][j], C[i][k] + C[k][j]);

	for (int i = 0; i < N; ++i)
		for (int j = 0; j < N; ++j)
			cout << C[i][j] << ' ';
}