Cod sursa(job #3270794)

Utilizator tudorbuhniaTudor Buhnia tudorbuhnia Data 24 ianuarie 2025 15:10:21
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.95 kb
#include <fstream>

using namespace std;

int n, G[105][105], d[105][105];
int inf = 2e9;

void floydwarshall()
{
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(d[i][j] > d[i][k] + d[k][j])
                    d[i][j] = d[i][k] + d[k][j];
            }
        }
    }
}

int main()
{
    ifstream cin("royfloyd.in");
    ofstream cout("royfloyd.out");

    cin >> n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            cin >> G[i][j];
            if(G[i][j] == 0)
                d[i][j] = inf;
            else
                d[i][j] = G[i][j];
        }
    }
    for(int i=1;i<=n;i++)
        d[i][i] = 0;

    floydwarshall();

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            cout << d[i][j] << " ";
        }
        cout << '\n';
    }
    return 0;
}