Cod sursa(job #2982937)

Utilizator BeneIonut2208Bene Ionut-Matei BeneIonut2208 Data 21 februarie 2023 10:27:18
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.77 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int n, a[105][105];

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

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

void afisare()
{
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
            fout << a[i][j] << ' ';
        fout << '\n';
    }
}

int main()
{
    citire();
    rf();
    afisare();
    return 0;
}