Pagini recente » Cod sursa (job #2047227) | Cod sursa (job #2543008) | Cod sursa (job #2723115) | Cod sursa (job #10917) | Cod sursa (job #641808)
Cod sursa(job #641808)
#include<stdio.h>
#define maxn 128
int v[ maxn ][ maxn ];
int main()
{
freopen("royfloyd.in.in","r",stdin);
freopen("royfloyd.in.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( v[i][k] + v[k][j] < v[i][j])
v[i][j] = v[i][k] + v[k][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;
}