Cod sursa(job #3326899)

Utilizator zionlyismAdobroaiei David zionlyism Data 1 decembrie 2025 10:20:30
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include <fstream>

#define NMAX 102
using namespace std;

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

int n, A[NMAX][NMAX];

void citire();
void royfloyd();
void afisare();

int main()
{
    citire();
    //roy-floyd ---> matricea costurilor
    royfloyd();
    afisare();
    return 0;
}

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

void royfloyd()
{
    int k, i, j;
    for(k = 1; k <= n; k++) //nodul intermediar
        for(i = 1; i <= n; i++)
            for(j = 1; j <= n; j++)
                if(i != j && A[i][k] && A[k][j] && (A[i][j] > A[i][k] + A[k][j] || A[i][j] == 0))
                    A[i][j] = A[i][k] + A[k][j];
}

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