Pagini recente » Cod sursa (job #1130645) | Cod sursa (job #673925) | Istoria paginii utilizator/samoila_alexandru | Rating Geambazu Iulia (iuliageambazu) | Cod sursa (job #145480)
Cod sursa(job #145480)
#include<stdio.h>
#define infinit 0x3f3f3f3f
int n, a[101][101], i, j, k;
inline int min(int a, int b){
if (a < b)
return a;
return b;
}
int main()
{
freopen("royfloyd.in", "rt", stdin);
freopen("royfloyd.out", "wt", stdout);
scanf("%d", &n);
for (i = 1; i <= n; i ++)
for (j = 1; j <= n; j ++){
scanf("%d", &a[i][j]);
if (a[i][j] == 0 && i != j)
a[i][j] = infinit;
}
for (k = 1; k <= n; k ++)
for (i = 1; i <= n; i ++)
for (j = 1; j <= n; j ++)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
for (i = 1; i <= n; i ++){
for (j = 1; j <= n; j ++)
printf("%d ", a[i][j]);
printf("\n");
}
return 0;
}