Cod sursa(job #2856203)

Utilizator seburebu111Mustata Dumtru Sebastian seburebu111 Data 23 februarie 2022 16:09:41
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.85 kb
#include <iostream>
#include <fstream>

using namespace std;

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

const int N = 102;
const int INF = 1<<29;

int n;
int d[N][N];

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

    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                if(d[i][k]+d[k][j]<d[i][j] && i!=j)
                    d[i][j]=d[i][k]+d[k][j];

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