Pagini recente » Cod sursa (job #1112521) | Cod sursa (job #448923) | Cod sursa (job #30072) | Cod sursa (job #820367) | Cod sursa (job #1870205)
#include <bits/stdc++.h>
using namespace std;
int a[105][105];
const int INF = 2e9;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int n,i,j,k;
scanf("%d", &n);
for(i = 1;i <= n;i++){
for(j = 1;j <= n;j++){
scanf("%d", &a[i][j]);
if(a[i][j] == 0){
a[i][j] = INF;
}
}
}
for(k = 1;k <= n;k++){
for(i = 1;i <= n;i++){
for(j = 1;j <= n;j++){
if(i != j && a[i][k] && a[k][j]){
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
}
for(i = 1;i <= n;i++){
for(j = 1;j <= n;j++){
if(a[i][j] == INF){
printf("0 ");
}else{
printf("%d ", a[i][j]);
}
}
printf("\n");
}
return 0;
}