Cod sursa(job #1344370)

Utilizator tudorv96Tudor Varan tudorv96 Data 16 februarie 2015 17:57:38
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <fstream>
using namespace std;

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

const int oo = 1e9;

const int N = 105;

int a[N][N], n, d[N][N];

int main() {
    fin >> n;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j) {
            fin >> a[i][j];
            d[i][j] = (a[i][j] != 0) ? a[i][j] : oo;
        }
    for (int k = 0; k < n; ++k)
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < n; ++j)
                if (i != j && i != k && k != j && d[i][k] + d[k][j] < d[i][j])
                    d[i][j] = d[i][k] + d[k][j];
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j)
            fout << ((d[i][j] != oo) ? d[i][j] : 0) << " ";
        fout << "\n";
    }
}