Cod sursa(job #615543)

Utilizator vendettaSalajan Razvan vendetta Data 9 octombrie 2011 23:06:36
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.93 kb
#include <cstdio>
#define nmax 101

int a[nmax][nmax], n;

int minim(int x, int y){

    if (x > y ) return y;
    return x;

}

void citeste(){

    scanf("%d\n", &n);
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++)
            scanf("%d", &a[i][j]);
        //scanf("\n");
    }

}

void rezolva(){

    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
               if (a[i][j]&&a[i][k]&&a[k][j]&&a[i][j]>a[i][k]+a[k][j])
                    a[i][j] = minim(a[i][j], a[i][k] + a[k][j]);

}

void scrie(){

    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++)
            printf("%d ", a[i][j]);
        printf("\n");
    }

}

int main(){

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

    citeste();
    rezolva();
    scrie();

    fclose(stdin);
    fclose(stdout);
    return 0;

}