Cod sursa(job #652959)

Utilizator BarracudaFMI-Alex Dobrin Barracuda Data 26 decembrie 2011 22:05:25
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include<cstdio>
#define lim 101
int n,i,j,k,A[lim][lim];
void citire (){
	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]);
}
void roy(){
	for(k=1;k<=n;k++)
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++){1
				if(A[k][j]!=0 && A[i][k]!=0  && i!=j)
					if(A[i][j]>A[i][k]+A[k][j] || A[i][j]==0)
						A[i][j]=A[i][k]+A[k][j];
			}
}
void afisare (){
	for(i=1;i<=n;i++){
		for(j=1;j<=n;j++)
			printf("%d ",A[i][j]);
		printf("\n");
	}
}
int main (){
	citire();
	roy();
	afisare();
	return 0;
}