Cod sursa(job #2861170)

Utilizator norryna07Alexandru Norina norryna07 Data 3 martie 2022 17:19:12
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.03 kb
#include <fstream>
#define N 105
#define oo (int)2e9+3
using namespace std;

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

int a[N][N], d[N][N], n;

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

void initializare()
{
    for (int i=1; i<=n; ++i)
        for (int j=1; j<=n; ++j)
            if (i!=j) d[i][j]=oo;
}

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][j]>a[i][k]+a[k][j] && a[i][k]!=oo && a[k][j]!=oo) 
                    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)
        {
            if (a[i][j]==oo) fout<<"0 ";
            else fout<<a[i][j]<<' ';
        }
        fout<<'\n';
    }
}

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