Cod sursa(job #2726146)

Utilizator iancupoppPopp Iancu Alexandru iancupopp Data 20 martie 2021 14:03:35
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>

using namespace std;

const int N = 100;

int dp[N + 1][N + 1];

int main() {
    ifstream in("royfloyd.in");
    ofstream out("royfloyd.out");

    int n;
    in >> n;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            in >> dp[i][j];
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                if (dp[i][k] && dp[k][j] && dp[i][j] > dp[i][k] + dp[k][j])
                    dp[i][j] = dp[i][k] + dp[k][j];
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j)
            out << dp[i][j] << ' ';
        out << '\n';
    }

    in.close();
    out.close();
}