Cod sursa(job #3336554)

Utilizator Bogdan222Bogdan Caraeane Bogdan222 Data 24 ianuarie 2026 21:42:20
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <fstream>
using namespace std;

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

const char nl = '\n';
const int inf = 1e9 + 5;
const int NMAX = 105;
int a[NMAX][NMAX];

int main () {
    int n;
    fin >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            fin >> a[i][j];
        }
    }

    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <=n; j++) {
                if (a[i][k] && a[j][k] && (a[i][j] > a[i][k] + a[k][j]) && i != j) {
                    a[i][j] = a[i][k] + a[k][j];
                }
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            fout << a[i][j] << " ";
        }
        fout << nl;
    }

}