Cod sursa(job #3135084)

Utilizator Mihai_PopescuMihai Popescu Mihai_Popescu Data 1 iunie 2023 19:36:12
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>

using namespace std;

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

#define 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 (i != j && i != k && j != k)
                    if (a[i][k] && a[k][j])
                        if (a[i][j] == 0)
                            a[i][j] = a[i][k] + a[k][j];
                        else
                            a[i][j] = min(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 << '\n';
    }
    return 0;
}