Pagini recente » Cod sursa (job #781637) | Monitorul de evaluare | Cod sursa (job #173363) | Cod sursa (job #445091) | Cod sursa (job #3300568)
#include <bits/stdc++.h>
using namespace std;
#define INF 1e7
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];
if (j != i && d[i][j] == 0)
d[i][j] = INF;
}
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] > 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)
if (d[i][j] == INF)
fout << 0 << ' ';
else
fout << d[i][j] << ' ';
fout << '\n';
}
return 0;
}