Cod sursa(job #2286137)
| Utilizator | Data | 19 noiembrie 2018 20:59:04 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <cstdio>
#define MaxN 102
#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]);
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)printf("%d ", List[i][j]);
printf("\n");
}
return 0;
}
