Cod sursa(job #2890038)

Utilizator DordeDorde Matei Dorde Data 14 aprilie 2022 10:28:37
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int dp[103][103];
int main(){
    int n;
    fin >> n;
    for(int i = 1 ; i <= n ; ++ i)
        for(int j = 1 ; j <= n ; ++ j){
            fin >> dp[i][j];
            if(!dp[i][j]) dp[i][j] = INT_MAX;
        }
    for(int k = 1 ; k <= n ; ++ k)
        for(int i = 1 ; i <= n ; ++ i)
            for(int j = 1 ; j <= n ; ++ j)
                if(i != j && dp[i][j] > dp[i][k] + dp[k][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] == INT_MAX ? 0 : dp[i][j]) << ' ';
        fout << '\n';
    }
    return 0;
}