Cod sursa(job #2302747)

Utilizator MarianConstantinMarian Constantin MarianConstantin Data 15 decembrie 2018 09:51:39
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <iostream>
#include <fstream>
#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 (!matrix[i][j])
                    matrix[i][j] = matrix[i][k] + matrix[k][j];
                else
                    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];
}

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