Pagini recente » Cod sursa (job #1283507) | Cod sursa (job #1638779) | Cod sursa (job #2281533) | Cod sursa (job #2701792) | Cod sursa (job #771642)
Cod sursa(job #771642)
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a[110][110],m[110][110];
int main()
{
int i,j,k;
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]);
m[i][j]=a[i][j];
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
m[i][j]=min(m[i][j],m[i][k]+m[k][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",m[i][j]);
printf("\n");
}
return 0;
}