Cod sursa(job #2182880)

Utilizator tiberiu392Tiberiu Ungurianu tiberiu392 Data 22 martie 2018 18:02:55
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.03 kb
#include <fstream>

using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[110][110], n, m, i, j, k;
void read()
{
    f >> n;
    for( i = 1 ; i <= n  ; i++ )
        for( j = 1 ; j <= n ; j++ )
        f >> a[i][j];
}
bool verif( int k, int i, int j)
{
    if( a[i][k] == 0 || a[k][j] == 0 ||  i == j )
        return 0;
    if ( a[i][j] == 0 || a[i][j] > a[i][k]+a[k][j] )
        return 1;
    return 0;
}
void roy_floyd_or_floyd_warshell()
{
    for ( k = 1 ; k <= n ; k++ )
    {
        for ( i = 1 ; i <= n; i++ )
        {
            for ( j = 1 ;  j <= n ; j++ )
            {
                if( verif( k, i, j ) )
                    a[i][j] = a[i][k]+a[k][j];
            }
        }
    }

}
void write()
{
    for( i = 1 ; i <= n ; i++ )
    {
        for( j = 1 ;  j <= n ; j++ )
        g << a[i][j] << " ";
        g <<"\n";
    }
}
void solve()
{
    read();
    roy_floyd_or_floyd_warshell();
    write();
}
int main()
{
   solve();
    return 0;
}