Cod sursa(job #492079)

Utilizator BitOneSAlexandru BitOne Data 13 octombrie 2010 13:20:06
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
/* 
 * File:   main.cpp
 * Author: bitone
 *
 * Created on October 12, 2010, 2:55 PM
 */
#include <fstream>
#include <cstdlib>
#define MAX_N 101
#define oo 1000000000

using namespace std;

/*
 * 
 */
int C[MAX_N][MAX_N];
int main(int argc, char** argv)
{
    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] > 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;
}