Pagini recente » Cod sursa (job #704163) | Cod sursa (job #541993) | Cod sursa (job #2343701) | Borderou de evaluare (job #222743) | Cod sursa (job #1871800)
#include <cstdio>
using namespace std;
int i,j,k,n,a[105][105];
void rf()
{
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)
a[i][j]=a[i][k]+a[k][j];
}
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]);
rf();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}