Pagini recente » Cod sursa (job #1883263) | Cod sursa (job #2259386) | Cod sursa (job #1808802) | Cod sursa (job #127526) | Cod sursa (job #2930530)
#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>> dist(n, vector<int>(n));
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) {
fin >> dist[i][j];
if (dist[i][j] == 0 && i != j)
dist[i][j] = INF;
}
for (int k = 0; k < n; ++k)
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
dist[i][j] = min(dist[i][k] + dist[k][j], dist[i][j]);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j)
fout << (dist[i][j] == INF ? 0 : dist[i][j]) << ' ';
fout << '\n';
}
}