Cod sursa(job #2726158)

Utilizator alexlazuLazureanu Alexandru Ioan alexlazu Data 20 martie 2021 14:06:51
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

const int N = 1002;

void RoyFloyd(int a[1002][1002], int n)
{
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}

int main()
{
    int n;
    cin >> n;
    int a[1002][1002];
    

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            in >> a[i][j];

    RoyFloyd(a, n);

    for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
                out << a[i][j] << ' ';
            out << '\n';
        }
}