Cod sursa(job #2182310)

Utilizator Anastasia11Susciuc Anastasia Anastasia11 Data 22 martie 2018 12:03:30
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include <fstream>
#define Nmax 105
using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[Nmax][Nmax];
void read()
{
    f >> n ;
     for ( int i = 1 ; i <= n ; i ++ )
        for ( int j = 1 ; j <= n ; j ++ )
         f >> a[i][j];
}
bool ok(int k, int i, int j)
{
    if ( a[i][k] == 0 || a[k][j] == 0 || i == j )
       return false;
    if ( a[i][j] == 0 || a[i][k] + a[k][j] < a[i][j] )
        return true;
    return false;
}
void RoyFloyd()
{
    for ( int k = 1 ; k <= n ; k ++ )
     for ( int i = 1 ; i <= n ; i ++ )
      for ( int j = 1 ; j <= n ; j ++ )
        if (ok(k,i,j))
           a[i][j]=a[i][k]+a[k][j];

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