Cod sursa(job #2302916)

Utilizator MarianConstantinMarian Constantin MarianConstantin Data 15 decembrie 2018 11:35:00
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <iostream>
#include <fstream>
#include <climits>
#define NMAX 110
#define MIN(a, b) ( (a) < (b) ? (a) : (b) )

using namespace std;

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

int matrix[NMAX][NMAX], n;

void solve() {
    for (int k=1; k<=n; k++) {
        for (int i=1; i<=n; i++)
            for (int j=1; j<=n; j++)
                if (i!=k && j!=k)
                    matrix[i][j] = MIN(matrix[i][j], matrix[i][k] + matrix[k][j]);
    }
}

void print() {
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
            fout << matrix[i][j] << " \n"[j==n];
}

void read() {
    fin >> n;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++) {
            fin >> matrix[i][j];
                if (!matrix[i][j] && i!=j)
                    matrix[i][j] = 1<<28;
        }
}

int main() {
    read();
    solve();
    print();
    return 0;
}