Cod sursa(job #2649443)

Utilizator Rares31100Popa Rares Rares31100 Data 14 septembrie 2020 19:08:33
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <bits/stdc++.h>

using namespace std;

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

int n, a[101][101];

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])
                {
                    if(a[i][j])
                        a[i][j] = min(a[i][j], a[i][k]+a[k][j]);
                    else
                        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;
}