Pagini recente » Cod sursa (job #243790) | Cod sursa (job #454033) | Cod sursa (job #2532336) | Cod sursa (job #2574264) | Cod sursa (job #543062)
Cod sursa(job #543062)
#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;
}