Pagini recente » Cod sursa (job #134325) | Cod sursa (job #2630914) | Clasament 22_februarie_simulare_oji_2024_clasa_9 | Cod sursa (job #1971131) | Cod sursa (job #936866)
Cod sursa(job #936866)
#include<stdio.h>
int a[105][105],n,i,j,k;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
if(((a[i][j]+a[j][k])<a[i][k] || !a[i][k]) && a[i][j] && a[j][k])
a[i][k]=a[i][j]+a[j][k];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}