Cod sursa(job #1291534)

Utilizator CosminRusuCosmin Rusu CosminRusu Data 12 decembrie 2014 21:48:40
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <fstream>
#include <vector>
#include <string.h>

using namespace std;

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

const int maxn = 105;

int a[maxn][maxn], rf[maxn][maxn], n;

int main() {
	fin >> n;
	for(int i = 1 ; i <= n ; ++ i)
		for(int j = 1 ; j <= n ; ++ j) {
			fin >> a[i][j];
			rf[i][j] = a[i][j];
			if(a[i][j] == 0 && i != j)
				rf[i][j] = 0x3f3f3f3f;
		}
	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) {
			if(rf[i][j] == 0x3f3f3f3f)
				rf[i][j] = 0;
			fout << rf[i][j] << ' ';
		}
	
}