Cod sursa(job #701412)

Utilizator BitOneSAlexandru BitOne Data 1 martie 2012 15:45:21
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>
#include <cstdlib>
#define N_MAX 111
#define oo 1<<30

using namespace std;
typedef unsigned int uint;

uint C[N_MAX][N_MAX];
int main()
{
	uint N, i, j, k;
	ifstream in( "royfloyd.in" );
	ofstream out( "royfloyd.out" );

	in>>N;
	for( i=1; i <= N; ++i )
	{
		for( j=1; j <= N; ++j )
		{
			in>>C[i][j];
			C[i][j]= C[i][j] ? C[i][j] : oo;
		}
	}
	for( k=1; k <= N; ++k )
		for( i=1; i <= N; ++i )
			if( i != k )
				for( j=1; j <= N; ++j )
					if( j != k && j != i && C[i][j] > C[i][k] + C[k][j] )
						C[i][j]=C[i][k]+C[k][j];
	
	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;
}