Cod sursa(job #2295106)

Utilizator tiberiu392Tiberiu Ungurianu tiberiu392 Data 3 decembrie 2018 08:54:02
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
#include <fstream>
#include <bits/stdc++.h>
#define dim 110
using namespace std;
ifstream f ( "royfloyd.in" );
ofstream g ( "royfloyd.out") ;
int n , a[dim][dim], j, i, 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[k][j]+a[i][k])
        return 1;
    return 0;
}

void roy_floyd_or_floyd_warshall()
{
    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_warshall();
    write();
}

int main()
{
    solve();
    return 0;
}