Cod sursa(job #1025676)

Utilizator invincibleInvincibilul invincible Data 10 noiembrie 2013 13:59:13
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include<stdio.h>

#define NMAX 107

int n, a[NMAX][NMAX];

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", &a[i][j]);
    for(int k = 1; k <= n; ++ k)
        for(int i = 1; i <= n; ++ i)
            for(int 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(int i = 1; i <= n; ++ i, printf("\n"))
        for(int j = 1; j <= n; ++ j)
            printf("%d ", a[i][j]);
    return 0;
}