Cod sursa(job #165208)

Utilizator alex_mircescuAlex Mircescu alex_mircescu Data 25 martie 2008 18:07:45
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include <stdio.h>
#include <math.h>

long i, n, j, k, c[121][121];

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