Cod sursa(job #2083100)

Utilizator EuAlexOtaku Hikikomori EuAlex Data 7 decembrie 2017 02:20:24
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <cstdio>
#include <algorithm>

using namespace std;

int dp[101][101];

int main() {
	freopen("royfloyd.in", "r", stdin);
	freopen("royfloyd.out", "w", stdout);
	
	int n;
	scanf("%d", &n);

	for(int i = 1; i <= n; ++ i) {
		for(int j = 1; j <= n; ++ j) {
			scanf("%d", &dp[i][j]);
			if(dp[i][j] == 0 && i != j) {
				dp[i][j] = 1000000000;
			}
		}
	}
	
	for(int k = 1; k <= n; ++ k) {
		for(int i = 1; i <= n; ++ i) {
			for(int j = 1; j <= n; ++ j) {
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);	
			}
		}
	}
	
	for(int i = 1; i <= n; ++ i) {
		for(int j = 1; j <= n; ++ j) {
			printf("%d ", dp[i][j]);
		}
		printf("\n");
	}

	return 0;
}