Cod sursa(job #504803)

Utilizator BitOneSAlexandru BitOne Data 28 noiembrie 2010 19:07:02
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <cstdlib>
#include <fstream>
#define MAX_N 111
#define oo 1<<29

using namespace std;

/*
 *
 */
int C[MAX_N][MAX_N];
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>>C[i][j];
			C[i][j]=( 0 == C[i][j] ? oo : C[i][j] );
		}
	for( k=1; k <= N; ++k )
		for( i=1; i <= N; ++i )
			if( k != i )
				for( j=1; j <= N; ++j )
					if( i != j && k != j && C[i][j] > C[i][k]+C[k][j] )
						C[i][j]=C[i][k]+C[k][j];
	ofstream out( "royfloyd.out" );
	for( i=1; i <= N; ++i )
	{
		for( j=1; j <= N; ++j )
			out<<( oo == C[i][j] ? 0 : C[i][j] )<<' ';
		out<<'\n';
	}
	return EXIT_SUCCESS;
}