Cod sursa(job #656244)

Utilizator lianaliana tucar liana Data 4 ianuarie 2012 13:10:49
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.55 kb
#include <stdio.h>
#define nmax 105
long i, j, k, n, lg[nmax][nmax];

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",&lg[i][j]);
	for (k=1;k<=n;k++)	
		for (i=1;i<=n;i++)
			for (j=1;j<=n;j++)
				if (  (i!=j)  &&  ( ((lg[i][k]+lg[k][j]<lg[i][j])||(!lg[i][j])) && (lg[i][k]*lg[k][j]) )  )
					lg[i][j]=lg[i][k]+lg[k][j];
	for (i=1;i<=n;i++)
	{
		for (j=1;j<=n;j++)
			printf("%ld ",lg[i][j]);
		printf("\n");
	}
	return 0;
}