Cod sursa(job #1104846)

Utilizator swim406Teudan Adina swim406 Data 11 februarie 2014 09:17:49
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <stdio.h>
#define NMAX 101

using namespace std;

int A[NMAX][NMAX];

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