Cod sursa(job #3197592)

Utilizator eugenioMarinescu Eugenio eugenio Data 27 ianuarie 2024 10:31:34
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.95 kb
#include <fstream>
#include <vector>
#include <queue>
#define inf 2001
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");

int a[201][201], x, n;

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][j] = a[i][k] + a[k][j];
}


int main()
{
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            cin>>x;
            if(i!=j)
            {
                if(x)
                    a[i][j]=x;
                else
                    a[i][j]=inf;
            }
        }
    }

    roy_floyd();

    for(int i=1; i<=n; i++,cout<<endl)
    {
        for(int j=1; j<=n; j++)
        {
            if(a[i][j]!=inf)
                cout<<a[i][j]<<' ';
            else
                cout<<0<<' ';
        }
    }
}