Pagini recente » Cod sursa (job #1416623) | Cod sursa (job #147105) | Cod sursa (job #2463685) | Cod sursa (job #2383700) | Cod sursa (job #2771011)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N;
vector<vector<int>>d;
int main() {
fin >> N;
d = vector<vector<int>>(N + 4, vector<int>(N + 4));
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= N; j++) {
fin >> d[i][j];
}
}
for(int k = 1; k <= N; k++) {
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= N; j++) {
if(i != j && d[i][k] && d[k][j]) {
if(d[i][j] == 0) {
d[i][j] = d[i][k] + d[k][j];
} else {
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++) {
fout << d[i][j] << " ";
}
fout << '\n';
}
return 0;
}