Pagini recente » Cod sursa (job #1516192) | Cod sursa (job #1515354) | Cod sursa (job #2987476) | Cod sursa (job #2909715) | Cod sursa (job #227403)
Cod sursa(job #227403)
#include<stdio.h>
int a[101][101];
int i;
int j;
int n;
int k;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
{
i = 1;
while( i <= n)
{
{
j = 1;
while( j <= n)
{
scanf("%d", & a[i][j]);
j++;
}
}
i++;
}
}
{
k = 1;
while( k <= n)
{
{
i = 1;
while( i<=n)
{
if(a[i][k])
{
j = 1;
while( j<=n)
{
if(i!=j)
if(a[k][j])
if((a[i][j] > a[i][k] + a[k][j]) || (!a[i][j]))
a[i][j] = a[i][k] + a[k][j];
j++;
}
}
i++;
}
}
k++;
}
}
{
i = 1;
while( i <= n)
{
{
{
j = 1;
while( j <= n)
{
printf("%d ",a[i][j]);
j++;
}
}
printf("\n");
}
i++;
}
}
return 0;
}