Cod sursa(job #1912530)

Utilizator adiXMGemene Adrian adiXM Data 8 martie 2017 09:27:03
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <bits/stdc++.h>

using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int nMax = 103;
int dp[nMax][nMax];
int main()
{
    int n;
    f >> n;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            f >> dp[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][k] + dp[k][j] < dp[i][j] || dp[i][j] == 0 && 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++) {
            g << dp[i][j] << " ";
        }
        g << "\n";
    }
    return 0;
}