Cod sursa(job #1736606)

Utilizator AplayLazar Laurentiu Aplay Data 2 august 2016 11:46:09
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <stdio.h>

#define NMAX 100
#define INF 200000000

int n, graph[NMAX][NMAX];

int main() {
	freopen("royfloyd.in", "r", stdin);
	freopen("royfloyd.out", "w", stdout); 
	
	scanf("%d", &n);
	
	for (int it = 0; it < n; ++it)
		for (int jt = 0; jt < n; ++jt) {
			scanf("%d", &graph[it][jt]);
			if (graph[it][jt] == 0) graph[it][jt] = INF;
	}
			
	for (int k = 0; k < n; ++k) {
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				if (k != i && k != j && i != j && graph[i][j] > graph[i][k] + graph[k][j]) {
					graph[i][j] = graph[i][k] + graph[k][j];
				}
			}
		}
	}
	
	for (int it = 0; it < n; ++it) {
		for (int jt = 0; jt < n; ++jt)
			printf("%d ", graph[it][jt]);
		printf("\n");
	}
	
	return 0;
}