Cod sursa(job #543062)

Utilizator BitOneSAlexandru BitOne Data 27 februarie 2011 15:02:41
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>
#include <cstdlib>
#define N_MAX 101
#define oo 1<<20

using namespace std;
int v[N_MAX][N_MAX];
int main( void )
{
	int N, i, j, k;
	ifstream in( "royfloyd.in" );
	in>>N;
	for( i=1; i <= N; ++i )
		for( j=1; j <= N; ++j )
		{
			in>>v[i][j];
			v[i][j]=( 0 == v[i][j] ? oo : v[i][j] );
		}
	for( k=1; k <= N; ++k )
		for( i=1; i <= N; ++i )
			if( i != k )
				for( j=1; j <= N; ++j )
					if( k != j && i != j && v[i][j] > v[i][k]+v[k][j] )
						v[i][j]=v[i][k]+v[k][j];
	ofstream out( "royfloyd.out" );
	for( i=1; i <= N; ++i )
	{
		for( j=1; j <= N; ++j )
			out<<( oo == v[i][j] ? 0 : v[i][j] )<<' ';
		out<<'\n';
	}
	return EXIT_SUCCESS;
}