Pagini recente » Cod sursa (job #2686859) | Cod sursa (job #1594207) | Cod sursa (job #3265328) | Cod sursa (job #2224977) | Cod sursa (job #444083)
Cod sursa(job #444083)
#include<stdio.h>
const int N=128;
int n,g[N][N];
void read()
{
scanf("%d",&n);
for( int i=1; i<=n; ++i)
for( int j=1; j<=n; ++j)
scanf("%d",&g[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( i!=j && g[i][k] && g[k][j] && ( g[i][j]>g[i][k]+g[k][j] || !g[i][j] ) )
g[i][j]=g[i][k]+g[k][j];
}
void print()
{
for( int i=1; i<=n; ++i, printf("\n"))
for( int j=1; j<=n; ++j)
printf("%d ",g[i][j]);
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
read();
solve();
print();
return 0;
}