Cod sursa(job #2195840)

Utilizator Constantin.Dragancea Constantin Constantin. Data 17 aprilie 2018 15:03:03
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <bits/stdc++.h>
using namespace std;

int n, dp[110][110];

int main(){
    ifstream cin ("royfloyd.in");
    ofstream cout ("royfloyd.out");
    cin >> n;
    for (int i=1; i<=n; i++){
        for (int j=1; j<=n; j++) cin >> dp[i][j], dp[i][j] = (!dp[i][j]?1e9:dp[i][j]);
    }
    for (int k=1; k<=n; k++){
        for (int i=1; i<=n; i++){
            for (int j=1; j<=n; j++) dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
        }
    }
    for (int i=1; i<=n; i++){
        for (int j=1; j<=n; j++) cout << (i == j || dp[i][j] == 1e9? 0 : dp[i][j]) << " ";
        cout << "\n";
    }
    return 0;
}