Cod sursa(job #3286122)

Utilizator SeracovanuEdwardSeracovanu Edward SeracovanuEdward Data 13 martie 2025 18:54:56
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include <bits/stdc++.h>

using namespace std;

int A[105][105] , n;

void royf(){
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] == 0) && i != j)
                A[i][j] = A[i][k] + A[k][j];
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    freopen("royfloyd.in" , "r" , stdin);
    freopen("royfloyd.out" , "w" , stdout);
    cin >> n;
    for(int i = 1;i <= n; ++i)
        for(int j = 1;j <= n; ++j)
            cin >> A[i][j];
    royf();
    for(int i = 1;i <= n; ++i)
        for(int j = 1;j <= n; ++j)
            cout << A[i][j] << " \n"[j == n];
}