Pagini recente » Borderou de evaluare (job #1457851) | Cod sursa (job #875073) | Cod sursa (job #3357393) | Cod sursa (job #2571855) | Cod sursa (job #2491702)
#include <stdio.h>
int n, mat[105][105];
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",&mat[i][j]);
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (mat[i][k] && mat[k][j] && (mat[i][j] > mat[i][k] + mat[k][j] || !mat[i][j]) && i != j)
mat[i][j] = mat[i][k] + mat[k][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++) printf("%d ",mat[i][j]);
printf("\n");
}
}