Cod sursa(job #613188)

Utilizator BitOneSAlexandru BitOne Data 17 septembrie 2011 20:58:55
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>
#include <cstdlib>
#define N_MAX 101
#define oo 1<<29

using namespace std;
int C[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>>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( k != i )
                for( j=1; j <= N; ++j )
                    if( k != j && i != 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;
}