Pagini recente » Cod sursa (job #1660712) | Cod sursa (job #2193707) | Cod sursa (job #376419) | Cod sursa (job #1276347) | Cod sursa (job #2085309)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int main() {
int n;
cin >> n;
vector < vector < int > > dist(n + 1, vector < int > (n + 1));
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= n; j ++) {
cin >> dist[i][j];
}
}
for (int k = 1; k <= n; k ++) {
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= n; j ++) {
if (dist[i][k] and dist[k][j] and (i != j) and
(dist[i][j] > dist[i][k] + dist[k][j] or (not dist[i][j]))) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= n; j ++) {
cout << dist[i][j] << ' ';
}
cout << '\n';
}
}