Pagini recente » Cod sursa (job #2055764) | Cod sursa (job #2683492) | Cod sursa (job #362220) | Cod sursa (job #2075879) | Cod sursa (job #2224464)
#include <stdio.h>
#define min(a, b) (((a) < (b)) ? (a) : (b))
int main(void)
{
int n;
int dist[100][100] = {0};
// read input
freopen("royfloyd.in", "r", stdin);
scanf("%d", &n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
scanf("%d", &dist[i][j]);
// solve
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
int d = dist[i][k] + dist[k][j];
if (dist[i][k] && dist[k][j] && i != j &&
(dist[i][j] > d || !dist[i][j]))
dist[i][j] = d;
}
// write output
freopen("royfloyd.out", "w", stdout);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
printf("%d ", dist[i][j]);
printf("\n");
}
return 0;
}