Cod sursa(job #1420631)

Utilizator GodstormBotarleanu Robert Godstorm Data 18 aprilie 2015 19:43:02
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <iostream>
#include <fstream>

#define NMAX 101
#define min(a,b) (a<b)?a:b
using namespace std;
int A[NMAX][NMAX];
int n;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

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

inline void royfloyd() {
	for (int k = 1; k <= n; k++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++)
				A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
		}
	}
}

inline void write() {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			fout << A[i][j] << ' ';
		}
		fout << endl;
	}
}

int main() {
	read();
	royfloyd();
	write();
	return 0;
}