Cod sursa(job #145480)

Utilizator andrei.12Andrei Parvu andrei.12 Data 28 februarie 2008 20:51:09
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include<stdio.h>

#define infinit 0x3f3f3f3f

int n, a[101][101], i, j, k;
inline int min(int a, int b){
	if (a < b)
		return a;
	return b;
}
int main()
{
	freopen("royfloyd.in", "rt", stdin);
	freopen("royfloyd.out", "wt", stdout);
	
	scanf("%d", &n);
	for (i = 1; i <= n; i ++)
		for (j = 1; j <= n; j ++){
			scanf("%d", &a[i][j]);
			if (a[i][j] == 0 && i != j)
				a[i][j] = infinit;
		}
	
	for (k = 1; k <= n; k ++)
		for (i = 1; i <= n; i ++)
			for (j = 1; j <= n; j ++)
				a[i][j] = min(a[i][j], a[i][k] + a[k][j]);

	for (i = 1; i <= n; i ++){
		for (j = 1; j <= n; j ++)
			printf("%d ", a[i][j]);
		printf("\n");
	}
	
	return 0;
}