Pagini recente » Cod sursa (job #1885877) | Cod sursa (job #2429627) | Cod sursa (job #2764016) | Cod sursa (job #1076082) | Cod sursa (job #2286137)
#include <cstdio>
#define MaxN 102
#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]);
for(k=1; k<=N; ++k)
for(i=1; i<=N; ++i)
for(j=1; j<=N; ++j) List[i][k]=min(List[i][k], List[i][j]+List[j][k]);
for(i=1; i<=N; ++i){
for(j=1; j<=N; ++j)printf("%d ", List[i][j]);
printf("\n");
}
return 0;
}