Cod sursa(job #1377337)

Utilizator paunmatei7FMI Paun Matei paunmatei7 Data 5 martie 2015 21:13:49
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <cstdio>

#define NMAX 107

using namespace std;

int Dp[NMAX][NMAX];
int n;

int main(){
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            scanf("%d", &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][j] > Dp[i][k] + Dp[k][j] || !Dp[i][j]) && Dp[i][j] && Dp[k][j] && i != j)
                    Dp[i][j] = Dp[i][k] + Dp[k][j];
    for(int i = 1; i <= n; ++i, printf("\n"))
        for(int j = 1; j <= n; ++j)
            printf("%d ", Dp[i][j]);
    return 0;
}