Pagini recente » Cod sursa (job #506367) | Borderou de evaluare (job #2527720) | Cod sursa (job #3234800) | Cod sursa (job #748368) | Cod sursa (job #644391)
Cod sursa(job #644391)
#include<stdio.h>
#define maxn 128
int v[ maxn ][ maxn ];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int n;
scanf("%d", &n);
for( int i = 1; i <= n; ++i)
for( int j = 1; j <= n; ++j)
scanf("%d", &v[i][j]);
for( int i = 1; i <= n; ++i)
for( int k = 1; k <= n; ++k)
for( int j = 1; j <= n; ++j)
if( i != j)
if( v[k][i] + v[i][j] < v[i][j] || v[ i][ j] == 0)
if( v[k][i] && v[i][j])
v[i][j] = v[k][i] + v[i][j];
for( int i = 1; i <= n; ++i)
{
for( int j = 1; j < n; ++j)
printf("%d ", v[i][j]);
printf("%d\n", v[i][n]);
}
return 0;
}