Cod sursa(job #2300845)

Utilizator tiberiu392Tiberiu Ungurianu tiberiu392 Data 12 decembrie 2018 10:35:19
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include <fstream>

using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int a[105][105], n, i, j;
int k;
int main()
{
    f >> n;
    for ( i = 1 ; i <= n ; i++ )
    for ( j = 1 ; j <= n ; j++ )
        f >> a[i][j];
 //r-f
    for ( int k = 1 ; k <= n ; k++ )
    {
        for ( i = 1 ; i <= n ; i++)
    {
        for ( j = 1 ; j <= n ; j++)
        {
            if( a[k][j] && a[i][k] && ( a[i][j] > a[i][k]+a[k][j] || !a[i][j] ) && i != j )
            a[i][j] = a[i][k]+a[k][j];
        }
    }
    }
    for ( i = 1 ; i <= n ; i++ )
    {
        for ( j = 1 ;  j <= n ; j++ )
        g  << a[i][j] << " ";
        g << "\n";
    }

    return 0;
}