Cod sursa(job #1349594)

Utilizator CosminRusuCosmin Rusu CosminRusu Data 20 februarie 2015 12:33:19
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <fstream>
#include <iostream>

using namespace std;

const int maxn = 105;
const int oo = 0x3f3f3f3f;

int rf[maxn][maxn], n;

int main() {
	ifstream fin("royfloyd.in");
	ofstream fout("royfloyd.out");
	fin >> n;
	for(int i = 1 ; i <= n ; ++ i)
		for(int j = 1 ; j <= n ; ++ j) {
			fin >> rf[i][j];
			if(i != j && rf[i][j] == 0)
				rf[i][j] = oo;
		}
	for(int k = 1 ; k <= n ; ++ k)
		for(int i = 1 ; i <= n ; ++ i)
			for(int j = 1 ; j <= n ; ++ j)
				rf[i][j] = min(rf[i][j], rf[i][k] + rf[k][j]);
	for(int i = 1 ; i <= n ; ++ i, fout << '\n')
		for(int j = 1 ; j <= n ; ++ j)
			fout << rf[i][j] << ' ';
}