Cod sursa(job #144353)

Utilizator devilkindSavin Tiberiu devilkind Data 27 februarie 2008 14:29:40
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <stdio.h>
#include <vector>

using namespace std;

#define NMAX 128

long int i,j,k,n;
long int a[NMAX][NMAX],sol[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",&a[i][j]);
				sol[i][j]=a[i][j];
			}

	for (k=1;k<=n;k++)
		for (i=1;i<=n;i++)
			for (j=1;j<=n;j++)
				{
					if (i==j) continue;
					if (!sol[i][k]) continue;
					if (!sol[k][j]) continue;
					if (!sol[i][j]) sol[i][j]=sol[i][k]+sol[k][j];
					sol[i][j]=min(sol[i][j],sol[i][k]+sol[k][j]);
				}

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