Pagini recente » Cod sursa (job #1601116) | Cod sursa (job #1464556) | Monitorul de evaluare | Cod sursa (job #677550) | Cod sursa (job #171436)
Cod sursa(job #171436)
#include <stdio.h>
#define nm 128
int n, a[nm][nm];
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
scanf("%d", &a[i][j]);
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (a[i][k] && a[j][k] && a[i][k] + a[k][j] < a[i][j])
a[i][j] = a[i][k] + a[k][j];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
printf("%d ", a[i][j]);
printf("\n");
}
return 0;
}