Pagini recente » Cod sursa (job #2634174) | Cod sursa (job #1617982) | Cod sursa (job #1476685) | Cod sursa (job #2505740) | Cod sursa (job #551396)
Cod sursa(job #551396)
#include<cstdio>
using namespace std;
int n,i,j,k,oo=1<<30,V[105][105],S[105][105];
void read(),solve();
int main()
{
read();
solve();
return 0;
}
void read()
{
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",&V[i][j]);
S[i][j]=oo;
if(i==j)S[i][j]=0;
}
}
void solve()
{
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(!V[i][j])continue;
if(V[i][j]<S[i][j])S[i][j]=V[i][j];
if(V[i][k]+V[k][j]<S[i][j])S[i][j]=V[i][k]+V[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",S[i][j]);
printf("\n");
}
}