Pagini recente » Cod sursa (job #2024769) | Cod sursa (job #442690) | Cod sursa (job #1181628) | Cod sursa (job #1805246) | Cod sursa (job #494764)
Cod sursa(job #494764)
#include <fstream>
#include <cstdlib>
#define MAX_N 101
#define oo 1000000000
using namespace std;
/*
*
*/
int C[MAX_N][MAX_N];
int main( void )
{
int N, x, i, j, k;
ifstream in( "royfloyd.in" );
in>>N;
for( i=1; i <= N; ++i )
for( j=1; j <= N; ++j )
{
in>>x;
C[i][j]=( 0 == x ? oo : x );
}
for( k=1; k <= N; ++k )
for( i=1; i <= N; ++i )
if( i != k )
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;
}