Cod sursa(job #3302996)

Utilizator parrot279Sofi Tudose parrot279 Data 12 iulie 2025 15:26:02
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb
#include <fstream>
#include <climits>
#include <set>

using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");


long long d[101][101], n;


int main()
{
    cin>>n;
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            cin>>d[i][j];
            if(i != j && d[i][j] == 0)
                d[i][j] = LONG_MAX-1;
        }


    }

    for(int m = 1; m <= n; ++m)
    {
        for(int i = 1; i <= n; ++i)
        {
            for(int j = 1; j <= n; ++j)
            {
                if(i == j)
                    continue;
                if(d[i][m] + d[m][j] < d[i][j])
                    d[i][j] = d[i][m] + d[m][j];
            }
        }
    }

    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            if(d[i][j] == LONG_MAX - 1)
                d[i][j] = 0;
            cout<<d[i][j]<<" ";
        }

        cout<<"\n";
    }



    return 0;
}