Pagini recente » Cod sursa (job #2088911) | Cod sursa (job #2219447) | Cod sursa (job #885256) | Cod sursa (job #46352) | Cod sursa (job #2286807)
#include <cstdio>
#define MaxN 102
#define Inf 1002
#define min(a, b) (a<b?a:b)
using namespace std;
int N, i, List[MaxN][MaxN], j, k;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &N);
for(i=1; i<=N; ++i)
for(j=1; j<=N; ++j) {scanf("%d", &List[i][j]); if(List[i][j]==0 && i!=j)List[i][j]=Inf;}
for(k=1; k<=N; ++k)
for(i=1; i<=N; ++i)
for(j=1; j<=N; ++j) if(i!=j)List[i][j]=min(List[i][j], List[i][k]+List[k][j]);
for(i=1; i<=N; ++i){
for(j=1; j<=N; ++j) if(List[i][j]==Inf)printf("0 "); else printf("%d ", List[i][j]);
printf("\n");
}
return 0;
}