Pagini recente » Cod sursa (job #1554218) | Cod sursa (job #2070932) | Cod sursa (job #2211744) | Cod sursa (job #2922376) | Cod sursa (job #412419)
Cod sursa(job #412419)
#include <stdio.h>
#include <iostream.h>
long int a[257][257][2]={0};
int n;
void beolvas()
{freopen("royfloyd.in","r",stdin);
cin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j][0];
}
void royfloyd()
{for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][j][0]>a[i][k][0]+a[k][j][0] && i!=k)
a[i][j][0]=a[i][k][0]+a[k][j][0];
}
void kiir()
{freopen("royfloyd.out","w",stdout);
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
cout<<a[i][j][0]<<" ";
cout<<"\n";
}
}
int main()
{beolvas();
royfloyd();
kiir();
}