Pagini recente » Cod sursa (job #2605702) | Cod sursa (job #1691985) | Cod sursa (job #1095235) | Cod sursa (job #842150) | Cod sursa (job #1194897)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int MAX_N = 110;
int d[MAX_N][MAX_N];
int main() {
int n;
fin >> n;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fin >> d[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) {
continue;
}
if(d[i][k] && d[k][j] && (!d[i][j] || d[i][k] + d[k][j] < d[i][j]) ) {
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fout << d[i][j] << ' ';
}
fout << '\n';
}
return 0;
}