Cod sursa(job #2695874)

Utilizator @stefansevastre@Stefan Sevastre @stefansevastre@ Data 14 ianuarie 2021 19:14:02
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb
#include <iostream>
#include <fstream>
#include <limits>

#define intMax std::numeric_limits<int>::max()

using namespace std;

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

const int NMAX = 101;

int dist[NMAX][NMAX];

int main() {
    int n;

    fin >> n;

    for(int i = 1; i <= n; ++i) {
        for(int j = 1, c; j <= n; ++j) {
            fin >> c;
            dist[i][j] = c;
        }
    }

    for(int k = 1; k <= n; ++k) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                if(i == j || dist[i][k] == 0 || dist[k][j] == 0)
                    continue;
                if(dist[i][j] > dist[i][k] + dist[k][j] || dist[i][j] == 0) {
                    dist[i][j] = dist[i][k] + dist[k][j];
                }
            }
        }
    }

    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j) {
            fout << dist[i][j] << ' ';
        }
        fout << '\n';
    }

    return 0;
}