Cod sursa(job #699230)

Utilizator arch_enemyAngela Gossow arch_enemy Data 29 februarie 2012 18:20:19
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <cstdio>
#include <cstring>

#define NMAX 101

int N, i, j, k;
int D[NMAX][NMAX];

int main()
{
	freopen("royfloyd.in", "r", stdin);
	freopen("royfloyd.out", "w", stdout);
	
	memset( D, 0, sizeof(D) );
	scanf("%d", &N );
	for( i = 1; i <= N; ++i )
		for( j = 1; j <= N; ++j )
			scanf("%d", &D[i][j] );
	
	for( k = 1; k <= N; ++k )
		for( i = 1; i <= N; ++i )
			if( D[i][k] )
				for( j = 1; j <= N; ++j )
					if( k != j && D[k][j] && ( D[i][j] > D[i][k] + D[k][j] || ( !D[i][j] && i != j ) ) )
						D[i][j] = D[i][k] + D[k][j];
	
	for( i = 1; i <= N; ++i )
	{
		for( j = 1; j <= N; ++j )
			printf("%d ", D[i][j] );
		printf("\n");
	}
	
	return 0;
}