Cod sursa(job #1988399)

Utilizator SlevySlevoaca Stefan-Gabriel Slevy Data 2 iunie 2017 21:33:28
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <iostream>
#include <fstream>
#define oo (1 << 20)
#define NMAX 105

using namespace std;

ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[NMAX][NMAX], n;

int main(int argc, char* argv[]) {

	in >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++) {
	
			in >> a[i][j];
			if (i != j && a[i][j] == 0)
				a[i][j] = oo;
		}
	in.close();

	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if (a[i][j] > a[i][k] + a[k][j])
					a[i][j] = a[i][k] + a[k][j];

	for (int i = 1; i <= n; i++) {

		for (int j = 1; j <= n; j++)
			out << a[i][j] << " ";
		out << "\n";
	}
	out.close();
	return 0;
}