Cod sursa(job #941770)

Utilizator thebest001Neagu Rares Florian thebest001 Data 19 aprilie 2013 18:41:22
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <stdio.h>
#define INF 1000000

int res[101][101][102];

template <class T>
T inline min(T x,T y){ return x<y?x:y;}

int main(){

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

    int n;
    scanf("%d",&n);
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            res[i][j][0]=INF;
            scanf("%d",&res[i][j][0]);
            if (res[i][j][0]==0) res[i][j][0]=INF;
        }
        res[i][i][0]=0;
    }
    for (int k=1;k<=n;k++){
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++){
                res[i][j][k]=min(res[i][j][k-1],res[i][k][k-1]+res[k][j][k-1]);
            }
    }

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

    return 0;
}