Pagini recente » Cod sursa (job #2171685) | Cod sursa (job #438318) | Cod sursa (job #1694507) | Cod sursa (job #459699)
Cod sursa(job #459699)
#include <cstdlib>
#include <fstream>
#define Nmax 111
#define oo 999999
/*
*
*/
int C[Nmax][Nmax];
int main( void )
{
int N, i, j, k;
std::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];
std::ofstream out( "royfloyd.out" );
for( i=1; i <= N; ++i )
{
for( j=1; j <= N; ++j )
out<<( C[i][j] ? C[i][j] : oo )<<' ';
out<<'\n';
}
return EXIT_SUCCESS;
}