Cod sursa(job #2351729)

Utilizator robertro1Benedek Robert George robertro1 Data 22 februarie 2019 17:34:09
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <bits/stdc++.h>

using namespace std;

int n,m,INF=INT_MAX;
long long  d[101][101];

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

int main()
{
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    f>>n;
    for(int i=1; i<=n; ++i)
    {
        for(int j=1; j<=n; ++j)
        {
            f>>d[i][j];
            if(d[i][j]==0) d[i][j]=INF;
        }
    }
    royfloyd();
    for(int i=1; i<=n; ++i)
    {
        for(int j=1; j<=n; ++j)
        {
            if(d[i][j]!=INF)
            g<<d[i][j]<<" ";
            else
                g<<"0 ";
        }
        g<<'\n';
    }


  return 0;
}