Cod sursa(job #1614941)

Utilizator bciobanuBogdan Ciobanu bciobanu Data 26 februarie 2016 12:10:14
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <fstream>
#include <limits>

using namespace std;

const int MAX_N = 100;
const int INF = 1000000000;

int D[MAX_N][MAX_N];

int main() {
    ifstream fin("royfloyd.in");
    ofstream fout("royfloyd.out");
    fin.tie(0);
    ios_base::sync_with_stdio(false);

    int N; fin >> N;

    for (int i = 0; i < N; ++ i)
        for (int j = 0; j < N; ++ j) {
            fin >> D[i][j];
            if (i != j && !D[i][j]) {
                D[i][j] = INF;
            }
        }

    for (int k = 0; k < N; ++ k) {
        for (int i = 0; i < N; ++ i) {
            for (int j = 0; j < N; ++ j) {
                D[i][j] = min(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] == INF) ? 0 : D[i][j]) << " \n"[j == N - 1];

    fout.close();


    return 0;
}