Pagini recente » Cod sursa (job #132588) | Cod sursa (job #677883) | Cod sursa (job #38123) | Cod sursa (job #2667607) | Cod sursa (job #1492174)
#include <cstdio>
using namespace std;
int n, i, j, k, c[110][110], oo = 200000;
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",&c[i][j]);
if(!c[i][j])
c[i][j] = oo;
}
for(i=1;i<=n;i++)
c[i][i] = 0;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(c[i][j]>c[i][k]+c[k][j])
c[i][j]=c[i][k]+c[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",c[i][j]==oo?0:c[i][j]);
printf("\n");
}
return 0;
}