Pagini recente » Cod sursa (job #2470749) | Cod sursa (job #371609) | Cod sursa (job #1926509) | Cod sursa (job #3205826) | Cod sursa (job #642065)
Cod sursa(job #642065)
#include<iostream>
#include<cstdio>
#include<algorithm>
int a[100+5][100+5];
int main()
{
int n;
freopen("royfloyd.in","rt",stdin);
freopen("royfloyd.out","wt",stdout);
scanf("%d",&n);
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0 && i!=j)
a[i][j]=0x3f3f3f3f;
}
for(int k=0;k<n;++k)
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
a[i][j]=std::min(a[i][k]+a[k][j],a[i][j]);
for(int i=0;i<n;++i,putchar('\n'))
for(int j=0;j<n;++j)
printf("%d ",(a[i][j]==0x3f3f3f3f)?0:a[i][j]);
return 0;
}
/*
#include<cstdio>
using namespace std;
int mat[101][101],n,i,j,k,x;
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",&x);
if(x==0&&i!=j)
mat[i][j]=10000000;
else
mat[i][j]=x;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(mat[i][k]+mat[k][j]<mat[i][j])
mat[i][j]=mat[i][k]+mat[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(mat[i][j]==10000000)
printf("0 ");
else
printf("%d ",mat[i][j]);
}
printf("\n");
}
return 0;
}
*/