Pagini recente » Cod sursa (job #1789678) | Cod sursa (job #3180160) | Cod sursa (job #1508486) | Cod sursa (job #2059886) | Cod sursa (job #1224347)
#include <iostream>
#define max 104
using namespace std;
int n;
int d[max][max];
int main(){
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
scanf("%d", &d[i][j]);
}
}
for(int k = 0; k < n; k++){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(d[i][k] && d[k][j] && i !=j && (!d[i][j] || d[i][j] > d[i][k] + d[k][j]))
d[i][j] = d[i][k] + d[k][j];
}
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
printf("%d ", d[i][j]);
}
printf("\n");
}
return 0;
}