Cod sursa(job #241770)

Utilizator AndreyPAndrei Poenaru AndreyP Data 10 ianuarie 2009 22:50:05
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include<stdio.h>
#define N 110
int n,a[N][N];
inline void roy_floyd()
{
	int i,j,k;
	for(k=1; k<=n; k++)
	{
		for(i=1; i<=n; i++)
		{
			if(i==k)
				continue;
			for(j=1; j<=n; j++)
			{
				if(j==i || j==k)
					continue;
				if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]))
					a[i][j]=a[i][k]+a[k][j];
			}
		}
	}
}
void scrie()
{
	for(int i=1; i<=n; i++)
	{
		for(int j=1; j<n; j++)
			printf("%d ",a[i][j]);
		printf("%d\n",a[i][n]);
	}
}
int main()
{
	freopen("royfloyd.in","r",stdin);
	freopen("royfloyd.out","w",stdout);
	scanf("%d",&n);
	for(int i=1; i<=n; i++)
	{
		for(int j=1; j<=n; j++)
			scanf("%d",&a[i][j]);
	}
	roy_floyd();
	scrie();
	return 0;
}