Cod sursa(job #581624)

Utilizator BitOneSAlexandru BitOne Data 14 aprilie 2011 13:42:57
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <fstream>
#include <cstdlib>
#define N_MAX 111
#define oo 1<<29

using namespace std;
int C[N_MAX][N_MAX];
inline int _min( int x, int y ) { return ( x <= y ? x : y ); }
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>>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( i != k )
                for( j=1; j <= N; ++j )
                    if( i != j && j != k )
                        C[i][j]=_min( 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;
}