Cod sursa(job #2194046)

Utilizator benjamin2205Zeic Beniamin benjamin2205 Data 12 aprilie 2018 00:05:08
Problema Floyd-Warshall/Roy-Floyd Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <bits/stdc++.h>

using namespace std;

ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");

int n;
int a[1005][1005];

void citire() {
    f >> n;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j)
            f >> a[i][j];
    }
}

void algoritm() {
    int i, j, k;
    for (k = 1; k <= n; ++k) {
        for (i = 1; i <= n; ++i) {
            for (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];
                    cout << j;
            }
        }
    }
}

void afisare() {
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            g << a[i][j] << ' ';
        }
        g << '\n';
    }
}

int main()
{
    citire();
    algoritm();
    afisare();
    return 0;
}