Pagini recente » Cod sursa (job #3266963) | Cod sursa (job #180423) | Cod sursa (job #56115) | Cod sursa (job #2197152) | Cod sursa (job #2679330)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int d[105][105];
int n;
int main() {
f >> n;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
f >> 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((d[i][k] != 0 && d[k][j] != 0 && i != j) && (d[i][j] == 0 || d[i][k] + d[k][j] < d[i][j])) {
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
g << d[i][j] << " ";
}
g << '\n';
}
return 0;
}