Pagini recente » Cod sursa (job #2917740) | Cod sursa (job #1275751) | Cod sursa (job #104042) | Cod sursa (job #1774079) | Cod sursa (job #235738)
Cod sursa(job #235738)
#include<stdio.h>
int a[257][257],d[257][257],n;
void royfloyd(void)
{
int k,i,j;
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (a[i][k] && a[k][j] && (a[i][j]>=a[i][k]+a[k][j] || !a[i][j]) && i!=j)
{
if (a[i][j]==a[i][k]+a[k][j])
{
if (d[i][j]<d[i][k]+d[k][j])
d[i][j]=d[i][k]+d[k][i];
}
else
{
a[i][j]=a[i][k]+a[k][j];
d[i][j]=d[i][k]+d[k][j];
}
}
}
int main()
{
freopen ("rf.in","r",stdin);
freopen ("rf.out","w",stdout);
scanf("%lld",&n);
int i,j;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++) {
scanf("%lld",&a[i][j]);
if (i!=j)
d[i][j]=1;
}
royfloyd();
for (i=1;i<=n;i++,printf("\n"))
for (j=1;j<=n;j++)
printf("%lld ",a[i][j]);
for (i=1;i<=n;i++,printf("\n"))
for (j=1;j<=n;j++)
printf("%lld ",d[i][j]);
return 0;
}