Pagini recente » Cod sursa (job #2437154) | Cod sursa (job #1798573) | Cod sursa (job #232703) | Cod sursa (job #1978257) | Cod sursa (job #1816186)
#include <cstdio>
#define MAXN 100
int n, d[MAXN+1][MAXN+1];
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int i, j, k;
scanf("%d", &n);
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j){
scanf("%d", &d[i][j]);
}
for(k=1; k<=n; ++k)
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
if(i!=j && d[i][k] != 0 && d[k][j] != 0 && (d[i][j] == 0 || d[i][j] > d[i][k] + d[k][j]))
d[i][j] = d[i][k] + d[k][j];
for(i=1; i<=n; ++i){
for(j=1; j<=n; ++j)
printf("%d ", d[i][j]);
printf("\n");
}
return 0;
}