Cod sursa(job #2382228)

Utilizator ezioconnorVlad - Gabriel Iftimescu ezioconnor Data 17 martie 2019 21:35:29
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>

using namespace std;

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

int n, a[101][101];

void citire()
{
    in >> n;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
            in >> a[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 (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
                    a[i][j] = a[i][k] + a[k][j];
            }
        }
    }
}

int main()
{
    citire();
    royFloyd();
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
            out << a[i][j] << " ";
        out << '\n';
    }
    return 0;
}