Pagini recente » Sedinta 2008-11-25 | Cod sursa (job #157413) | Cod sursa (job #2076196) | Cod sursa (job #202671) | Cod sursa (job #701412)
Cod sursa(job #701412)
#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;
}