Cod sursa(job #2603846)

Utilizator BAlexandruBorgovan Alexandru BAlexandru Data 21 aprilie 2020 01:07:53
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <fstream>

using namespace std;

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

int n;
int dist[101][101], distMin[101][101];
const int inf = 2000000000;

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)
                dist[i][j] = inf;
            if (i != j)
                distMin[i][j] = dist[i][j];
        }

    for (int k=1; k<=n; k++)
        for (int i=1; i<=n; i++)
            for (int j=1; j<=n; j++)
                distMin[i][j] = min(distMin[i][j], distMin[i][k] + distMin[k][j]);

    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
            g << distMin[i][j] << " ";
        g << "\n";
    }

    return 0;
}