Cod sursa(job #425315)

Utilizator Addy.Adrian Draghici Addy. Data 25 martie 2010 17:29:12
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <cstdio>
#define NMAX 128

int D[NMAX][NMAX], n, k, i, j;

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