Pagini recente » Cod sursa (job #720999) | Cod sursa (job #1674276) | Cod sursa (job #484169) | Cod sursa (job #2544146) | Cod sursa (job #651066)
Cod sursa(job #651066)
#include <stdio.h>
#define MAXN 100
int M[MAXN][MAXN], n;
int
main(void)
{
int k, i, j;
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
scanf("%d", &M[i][j]);
for(k = 0; k < n; k++)
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
if(i != j && M[i][j] && M[i][k] && M[k][j] && (M[i][k] + M[k][j] < M[i][j]))
M[i][j] = M[i][k] + M[k][j];
for(i = 0; i < n; i++)
{
for(j = 0; j < n; j++)
printf("%d ", M[i][j]);
printf("\n");
}
return 0;
}