Cod sursa(job #2188186)

Utilizator flaviu_2001Craciun Ioan-Flaviu flaviu_2001 Data 26 martie 2018 23:32:39
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <bits/stdc++.h>

using namespace std;

int n, d[105][105];

int main()
{
    ifstream fin ("royfloyd.in");
    ofstream fout ("royfloyd.out");
    fin >> n;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            fin >> d[i][j];
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                if(i != j && d[i][k] && d[k][j] && (d[i][j] == 0 || d[i][j] > d[i][k]+d[k][j]))
                    d[i][j] = d[i][k]+d[k][j];
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j)
            fout << d[i][j] << " ";
        fout << "\n";
    }
    return 0;
}