Pagini recente » Cod sursa (job #3213607) | Cod sursa (job #1505151) | Cod sursa (job #2170106) | Cod sursa (job #2100951) | Cod sursa (job #3319637)
#include <fstream>
#include <vector>
#include <climits>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n;
vector<vector<int>> d;
int main() {
cin >> n;
d.assign(n + 2, vector<int>(n + 2, 0));
for (int i = 1 ; i <= n ; ++i) {
for (int j = 1 ; j <= n ; ++j) {
cin >> d[i][j];
d[i][j] = d[i][j] == 0 && i != j ? INT_MAX : d[i][j];
}
}
for (int k = 1 ; k <= n ; ++k) {
for (int i = 1 ; i <= n ; ++i) {
for (int j = 1 ; j <= n ; ++j) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
for (int i = 1 ; i <= n ; ++i) {
for (int j = 1 ; j <= n ; ++j) {
cout << (d[i][j] == INT_MAX ? 0 : d[i][j]) << " ";
}
cout << "\n";
}
return 0;
}