Pagini recente » Cod sursa (job #1151901) | Cod sursa (job #704322) | Cod sursa (job #2941336) | Borderou de evaluare (job #1531907) | Cod sursa (job #149426)
Cod sursa(job #149426)
#include <stdio.h>
int mat[110][110],n;
int min (int a,int b)
{
if (a < b)
return a;
return b;
}
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][j] && mat[i][k] && mat[k][j]) || (!mat[i][j] && i != j))
mat[i][j] = min ( 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");
}
return 0;
}