Cod sursa(job #562027)

Utilizator costin22Muraru Costin costin22 Data 22 martie 2011 10:00:17
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include<stdio.h>
#define N 101
int n;
int a[N][N];

void citire()
{
	int i,j;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			scanf("%d",&a[i][j]);
}	

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

int main()
{
	freopen("rf.in","r",stdin);
	freopen("rf.out","w",stdout);
	
	citire();
	
	rfw();
	
	afisare();
	
	return 0;
}