Cod sursa(job #2519699)

Utilizator Yato2Denis Scutariu Yato2 Data 8 ianuarie 2020 12:13:01
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
#include <climits>
using namespace std;

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

int n, mat[101][101];

void Roy_floyd() {
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                if(i != j && k != i) {
                    int mix = mat[i][k] + mat[k][j];
                    if(mix < mat[i][j]) {
                        mat[i][j] = mix;
                    }
                }
}

int main() {

    in >> n;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j) {
            in >> mat[i][j];
            if(!mat[i][j] && i != j)
                mat[i][j] = INT_MAX;
        }
    Roy_floyd();
    for(int i = 1; i <= n; ++i, out << '\n')
        for(int j = 1; j <= n; ++j)
            out << mat[i][j] << ' ';
    return 0;
}