Cod sursa(job #2255723)

Utilizator flibiaVisanu Cristian flibia Data 7 octombrie 2018 14:46:40
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include <bits/stdc++.h>
#define ll long long

using namespace std;

//ifstream in("tst.in");
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

int n, dp[101][101];

int main(){
	in >> n;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			in >> dp[i][j];
	for(int k = 1; k <= n; k++)
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				if((dp[i][k] && dp[k][j] && i != j) && (!dp[i][j] || dp[i][k] + dp[k][j] < dp[i][j]))
					dp[i][j] = dp[i][k] + dp[k][j];
	for(int i = 1; i <= n; i++, out << '\n')
		for(int j = 1; j <= n; j++)
			out << dp[i][j] << ' ';
	return 0; 
}