Pagini recente » Cod sursa (job #1809930) | Cod sursa (job #1495436) | Cod sursa (job #530883) | Cod sursa (job #725994) | Cod sursa (job #502402)
Cod sursa(job #502402)
#include<cstdio>
const int N=1<<7;
int n,a[N][N],cost[N][N];
void read(int a[N][N])
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
if(a[i][j]==0 && i!=j)
a[i][j]=(1<<29);
cost[i][j]=a[i][j];
}
}
void solve()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(cost[i][k]+cost[k][j]<cost[i][j])
cost[i][j]=cost[i][k]+cost[k][j];
}
void afis(int a[N][N])
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
read(a);
solve();
afis(cost);
return 0;
}