Cod sursa(job #1316229)

Utilizator catalincraciunCraciun Catalin catalincraciun Data 13 ianuarie 2015 17:31:20
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
// royfloyd
#include <iostream>
#include <fstream>

#define NMax 105

using namespace std;

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

int n, A[NMax][NMax];

void output() {

	for (int i=1;i<=n;i++) {
		for (int j=1;j<=n;j++)
			g<<A[i][j]<<' ';
		g<<'\n';
	}
}

void royfloyd() {

	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][j] > A[i][k] + A[k][j]))
					A[i][j] = A[i][k] + A[k][j];
}

void read() {
	f>>n;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			f>>A[i][j];
}

int main() {
	
	read();
	royfloyd();
	output();

	f.close(); g.close();
	return 0;
}