Cod sursa(job #3325352)

Utilizator alecsandru121Anghel Alexandru-Mihai alecsandru121 Data 25 noiembrie 2025 12:53:33
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <fstream>
#include <list>
using namespace std;

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

int main()
{
    int d[101][101], n;
    fin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            fin >> d[i][j];

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

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

    fin.close();
    fout.close();
    return 0;
}