Cod sursa(job #2860689)

Utilizator AdrianDiaconitaAdrian Diaconita AdrianDiaconita Data 2 martie 2022 22:36:52
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 101;
int a[NMAX][NMAX], n;

void roy_floyd()
{
    for (int k = 1; k <= n; ++k)
    {
        for (int i = 1; i <= n; ++i)
        {
            for (int j = 1; j <= n; ++j)
            {
                if (a[i][k] && a[k][j]) a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
            }
        }
    }
}

int main()
{
    fin >> n;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
        {
            fin >> a[i][j];
        }
    }
    roy_floyd();
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
        {
            fout << a[i][j] << ' ';
        }
        fout << '\n';
    }
}