Cod sursa(job #3250943)

Utilizator stefan_dore_Stefan Dore stefan_dore_ Data 24 octombrie 2024 11:32:54
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <iostream>
#include <fstream>
using namespace std;

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

const int NMAX = 100,
          INF = 1e9;
int n, C[NMAX+1][NMAX+1];

void citire() {
    f >> n;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
            f >> C[i][j];
}

void init() {
    for (int i=1; i<=n; i++)
        for (int j=1; j<i; j++)
            C[i][j] = C[j][i] = INF;
}

void Roy_Floyd() {
    for (int k=1; k<=n; k++)
        for (int i=1; i<=n; i++)
            for (int j=1; j<=n; j++)
                C[i][j] = min(C[i][j], C[i][k] + C[k][j]);
}

void afisare() {
    for(int i=1; i<=n; i++) {
        for(int j=1; j<=n; j++)
            if (C[i][j] == INF)
                g <<  0 << ' ';
            else
                g << C[i][j] << ' ';
        g << '\n';
    }

}

int main()
{
    init();
    citire();
    Roy_Floyd();
    afisare();
    f.close();
    g.close();
    return 0;
}