Cod sursa(job #2857035)

Utilizator Tudor_PascaTudor Pasca Tudor_Pasca Data 24 februarie 2022 19:53:34
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.69 kb
#include <iostream>
#include <fstream>
#include <cstring>

using namespace std;

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

const int INF = 1e9;
int n;
int v[101][101];

int main() {
    in >> n;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            in >> v[i][j];
            if (i != j)
                v[i][j] = INF;
        }
    }

    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                v[i][j] = min(v[i][j], v[i][k] + v[k][j]);

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

    return 0;
}