Cod sursa(job #2166099)

Utilizator ionutmargineanMarginean Ionut ionutmarginean Data 13 martie 2018 15:33:30
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include<fstream>

using namespace std;

ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");

int n,a[105][105];

void solve()
{int i, j, k;

    for( k = 0; k < n; k++)
        for(i = 0; i < n; i++)
            for(j = 0; j < n; j++) //daca putem actualiza
                if(a[i][k] && a[k][j] && i != j && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
                    a[i][j] = a[i][k] + a[k][j];
}

int main()
{int i, j;
    fin>> n;

    for(  i = 0 ; i < n ; i++ )
        for( j = 0 ; j < n ;j++ )
            fin>>a[i][j];

    solve();

    for(  i = 0 ; i < n ; i++ )
    {
        for( j = 0 ; j < n ;j++ )
            fout<<a[i][j]<<" ";
        fout<<'\n';
    }


    return 0;
}