Cod sursa(job #2286159)

Utilizator MoldooooooooMoldoveanu Stefan Moldoooooooo Data 19 noiembrie 2018 21:16:52
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.67 kb
#include <cstdio>
#define MaxN 102
#define Inf 1002
#define min(a, b) (a<b?a:b)
using namespace std;
int N, i, List[MaxN][MaxN], j, k;
int main()
{
    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", &List[i][j]); if(List[i][j]==0 && i!=j)List[i][j]=Inf;}
    for(k=1; k<=N; ++k)
        for(i=1; i<=N; ++i)
            for(j=1; j<=N; ++j) List[i][k]=min(List[i][k], List[i][j]+List[j][k]);
    for(i=1; i<=N; ++i){
        for(j=1; j<=N; ++j) if(List[i][j]==Inf)printf("0 "); else printf("%d ", List[i][j]);
        printf("\n");
    }
    return 0;
}