Cod sursa(job #1882721)

Utilizator savigunFeleaga Dragos-George savigun Data 17 februarie 2017 13:59:11
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <iostream>
#include <fstream>
using namespace std;

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

int main() {
    int n, a[101][101], dp[101][101];

    in >> n;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            in >> a[i][j];
            dp[i][j] = a[i][j] ? a[i][j] : 1001;
        }
    }

    for (int i = 1; i <= n; ++i)
        dp[i][i] = 0;

    for (int k = 1; k <= n; ++k) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                dp[i][j] = min(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();
    return 0;
}