Pagini recente » Cod sursa (job #1045672) | Cod sursa (job #2918371) | Cod sursa (job #2747870) | Sandbox (cutiuţa cu năsip) | Cod sursa (job #2817184)
#include <stdio.h>
#define MAXN 100
#define INF (0x7fffffff >> 1)
#define MIN(a, b) ((a) < (b) ? (a) : (b))
int drum[MAXN][MAXN];
int main () {
int n;
int i, j, k;
scanf("%d", &n);
for (i = 0; i != n; ++ i)
for (j = 0; j != n; ++ j) {
scanf("%d", &drum[i][j]);
if (drum[i][j] == 0)
drum[i][j] = INF;
}
for (k = 0; k != n; ++ k)
for (i = 0; i != n; ++ i)
for (j = 0; j != n; ++ j)
drum[i][j] = MIN(
drum[i][j],
drum[i][k] +
drum[k][j]);
for (i = 0; i != n; ++ i, putchar('\n'))
for (j = 0; j != n; ++ j) {
if (i == j || drum[i][j] == INF)
drum[i][j] = 0;
printf("%d ", drum[i][j]);
}
return 0;
}