Cod sursa(job #1559583)

Utilizator DanielRusuDaniel Rusu DanielRusu Data 31 decembrie 2015 10:15:26
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include <cstdio>
#include <iostream>

using namespace std;

#define DIM 105

int N, dp[DIM][DIM];

int main() {
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);

    scanf("%d\n", &N);

    for(int i = 1; i <= N; ++i) {
        for(int j = 1; j <= N; ++j) {
            scanf("%d", &dp[i][j]);
            if(i != j && !dp[i][j]) {
                dp[i][j] = 2e8;
            }
        }
    }

    for(int k = 1; k <= N; ++k) {
        for(int i = 1; i <= N; ++i) {
            for(int j = 1; j <= N; ++j) {
                if(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) {
            if(dp[i][j] == 2e8) {
                cout << "0 ";
            }
            else {
                cout << dp[i][j] << ' ';
            }
        }

        cout << '\n';
    }

    return 0;
}