Pagini recente » Cod sursa (job #2108093) | Cod sursa (job #3226498) | Cod sursa (job #1985800) | Cod sursa (job #270980) | Cod sursa (job #3300566)
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
int main() {
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
fin >> n;
vector<vector<int>> d(n, vector<int>(n));
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) {
fin >> 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][j] != 0 && 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)
fout << d[i][j] << ' ';
fout << '\n';
}
return 0;
}