Pagini recente » Cod sursa (job #1128675) | Cod sursa (job #3259145) | Cod sursa (job #153324) | Cod sursa (job #2834992) | Cod sursa (job #1332192)
#include <cstdio>
using namespace std;
int n,d[101][101];
const long long inf=1<<15;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int i,j,k;
scanf("%d",&n);
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
{
scanf("%d",&d[i][j]);
}
for(k=1;k<=n;++k)
{
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
{
if(d[i][j]>d[i][k]+d[k][j]) d[i][j]=d[i][k]+d[k][j];
}
}
}
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j) if(d[i][j]==inf) printf("0 ");
else printf("%d ",d[i][j]);
printf("\n");
}
return 0;
}