Cod sursa(job #529163)

Utilizator elfusFlorin Chirica elfus Data 4 februarie 2011 13:56:41
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include<stdio.h>
#define LMAX 112 //politia in actiune
#define INF (1<<30)-1
int a[LMAX][LMAX];

int main()
{
	int n,i,j,k;
	
	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] && i!=j)
				a[i][j]=INF;
		}
	for(k=1;k<=n;k++)
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
				if(a[i][k]+a[k][j]<a[i][j])
					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]==INF)
				printf("0 ");
			else
				printf("%d ",a[i][j]);
		}
	printf("\n");
	}
	return 0;
}