Cod sursa(job #2488612)

Utilizator Dragos1226Dragos Chileban Dragos1226 Data 7 noiembrie 2019 10:58:46
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int NMax = 100, oo = 1e9;

int Min[NMax+5][NMax+5], N;
void Read() {
    in >> N;
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++) {
            in >> Min[i][j];
            if(Min[i][j] == 0)
                Min[i][j] = oo;
        }
}

void Solve() {
    for (int k = 0; k < N; k++)
        for (int i = 0; i < N; i++)
            for (int j = 0; j < N; j++) {
                if(i != j && (Min[i][k] + Min[k][j] < Min[i][j]))
                    Min[i][j] = Min[i][k] + Min[k][j];
    }
}

void Print() {
    for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++)
                if(Min[i][j]>=oo)out << "0 ";
                    else out << Min[i][j] << " ";
            out << '\n';
    }
}

int main() {
    Read();
    Solve();
    Print();

    return 0;
}