Cod sursa(job #2158369)

Utilizator BourucLiviuBouruc Petru Liviu BourucLiviu Data 10 martie 2018 12:19:57
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>

#define N 105

using namespace std;

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

int a[N][N];

int main()
{
    int n;
    fin >> n;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j) fin >> a[i][j];
    fin.close();

    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                if(a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];

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