Cod sursa(job #156229)

Utilizator alextheroTandrau Alexandru alexthero Data 12 martie 2008 13:50:14
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <stdio.h>

#define nmax 105

int n, i, j, k;
int a[nmax][nmax];

inline int min(int a, int b)
{
	if(a > b) return b;
	else return a;
}

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", &a[i][j]);
			if(a[i][j] == 0) a[i][j] = 10000;
		}

	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++)
		{
			if(a[i][j] == 10000) a[i][j] = 0;
			printf("%d ", a[i][j]);
		}
		printf("\n");
	}

	return 0;
}