Cod sursa(job #840221)

Utilizator GodiesVlad Voicu Godies Data 22 decembrie 2012 14:08:56
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <cstdlib>
#include <cstdio>
#include <limits>
#include <iostream>
  
using namespace std;
int maxim = 1000*100*100;

int main()
{
	int n;
	freopen("royfloyd.in", "rt", stdin);
	freopen("royfloyd.out", "w", stdout);
	cin >> n;
	int a[n + 1][n + 1];
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			cin >> a[i][j];
			if (a[i][j] == 0) {
				a[i][j] = maxim;
			}
		}
	}

	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] < a[i][j] && i != j) {
					a[i][j] = a[i][k] + a[k][j];
				}
			}
		}
	}

	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (a[i][j] == maxim) {
				a[i][j] = 0;
			}
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
	return 0;
}