Cod sursa(job #1243004)

Utilizator gerd13David Gergely gerd13 Data 15 octombrie 2014 14:23:18
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>

using namespace std ;

const int NMAX = 105 ;

ifstream cin("royfloyd.in") ;
ofstream cout("royfloyd.out") ;


int A[NMAX][NMAX], N;


inline void Floyd()
{
    for(int k = 1 ; k <= N ; ++ k)
        for(int i = 1 ; i <= N ; ++ i)
            for(int j = 1 ; j <= N ; ++ j)
                if(A[i][k] && A[k][j] && (A[i][j] > A[i][k] + A[k][j] || !A[i][j]) && i != j)
                    A[i][j] = A[i][k] + A[k][j] ;
}

inline void OUT()
{
    for(int i = 1 ; i <= N ; ++ i)
        {for(int j = 1 ; j <= N ; ++ j)
            cout << A[i][j] << ' ' ;
            cout << '\n' ;
    }

}

int main()
{

    cin >> N  ;

    for(int i = 1 ; i <= N ; ++ i)
        for(int j = 1 ; j <= N ; ++ j)
            cin >> A[i][j] ;

    Floyd() ;


    OUT() ;

    cin.close() ;
    cout.close() ;
    return  0 ;
}