Cod sursa(job #936432)

Utilizator forgetHow Si Yu forget Data 7 aprilie 2013 05:36:24
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.48 kb
#include <fstream>
using namespace std;

int main() {
	ifstream fin("royfloyd.in");
	ofstream fout("royfloyd.out");
	int n;
	fin >> n;
	int a[n][n];
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < n; ++j)
			fin >> a[i][j];

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

   for (int	i = 0; i < n; ++i) {
	   for (int j = 0; j < n; ++j)
		   fout << a[i][j] << ' ';
	   fout << '\n';
	}
	return 0;
}