Pagini recente » Cod sursa (job #2767976) | Cod sursa (job #3351579) | Cod sursa (job #1471422) | Cod sursa (job #2906786) | Cod sursa (job #3351463)
#include <bits/stdc++.h>
using namespace std;
int n, a[101][101];
void rf() {
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (a[i][k] != 0 && a[k][j] != 0 && (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0) && i != j) {
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
int main() {
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
cin >> a[i][j];
}
}
rf();
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
cout << a[i][j] << ' ';
}
cout << '\n';
}
return 0;
}