Pagini recente » Cod sursa (job #2428619) | Cod sursa (job #2275553) | Cod sursa (job #3274771) | Cod sursa (job #1268941) | Cod sursa (job #1112570)
#include<cstdio>
#define N_MAX 110
using namespace std;
int A[N_MAX][N_MAX],N;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&N);
for (int i=1;i<=N;++i)
for (int j=1;j<=N;++j) scanf("%d",&A[i][j]);
for (int k=1;k<=N;++k)
for (int i=1;i<=N;++i)
for (int j=1;j<=N;++j)
if (i!=j && A[i][j] > A[k][j] + A[i][k]) A[i][j]= A[k][j] + A[i][k];
for (int i=1;i<=N;++i)
{
for (int j=1;j<=N;++j) printf("%d ",A[i][j]);
printf("\n");
}
fclose(stdin); fclose(stdout);
return 0;
}