Cod sursa(job #3300509)

Utilizator ValiAntonieAntonie Valentin ValiAntonie Data 16 iunie 2025 17:51:32
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.77 kb
#include <bits/stdc++.h>

using namespace std;

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

int n, cost[105][105], dp[105][105];

int main()
{
fin>>n;
for (int i = 1; i <= n; i++){
    for (int j = 1; j <= n; j++){
        fin>>cost[i][j];
        if (cost[i][j] == 0 && i != j)
            dp[i][j] = 9999999999;
        else
            dp[i][j] = cost[i][j];
    }
}

for (int k = 1; k <= n; k++){
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++){
            if (dp[i][k] + dp[k][j] < dp[i][j])
                dp[i][j] = dp[i][k] + dp[k][j];
        }
    }
}

for (int i = 1; i <= n; i++){
    for (int j = 1; j <= n; j++){
        fout << dp[i][j] << " ";
    }
    fout << '\n';
}


    return 0;
}