Cod sursa(job #2690764)

Utilizator dragos231456Neghina Dragos dragos231456 Data 25 decembrie 2020 17:28:31
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <bits/stdc++.h>

using namespace std;

const int N=105;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int dist[N][N];
int inf = (1<<30)-1;

void RoyFloyd()
{
    for(int k=1;k<=n;++k)
    {
        for(int i=1;i<=n;++i)
        {
            for(int j=1;j<=n;++j)
            {
                if(k!=i && k!=j && i!=j) dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
            }
        }
    }
}

int main()
{
     f>>n;
     for(int i=1;i<=n;++i) for(int j=1;j<=n;++j)
     {
         f>>dist[i][j];
         if(dist[i][j]==0 && i!=j) a[i][j]=inf;
     }
     RoyFloyd();
     for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) if(dist[i][j] == inf) dist[i][j] = 0;
     for(int i=1;i<=n;++i, g<<'\n') for(int j=1;j<=n;++j) g<<dist[i][j]<<' ';
    return 0;
}