Cod sursa(job #2395998)

Utilizator Balan_TudorBalan Tudor Cristian Balan_Tudor Data 3 aprilie 2019 09:29:05
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <fstream>
#define nmax 103
using namespace std;

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

int n, x[nmax][nmax];

void citire()
{
    in >> n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            in >> x[i][j];
}

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

void afisare()
{
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
            out << x[i][j] << " ";
        out << endl;
    }
}

int main()
{
    citire();
    royfloyd();
    afisare();
    return 0;
}