Cod sursa(job #2705172)

Utilizator vlad_butnaruVlad Butnaru vlad_butnaru Data 12 februarie 2021 08:14:53
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.66 kb
#include <bits/stdc++.h>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
int a[101][101], n;
int main ()
{
    in >> n;
    for (int i = 1; i<=n; ++i)
        for (int j = 1; j<=n; ++j)
            in >> a[i][j];
    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][k] + a[k][j] < a[i][j])
                    a[i][j] = a[i][k] + a[k][j];

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