Pagini recente » Cod sursa (job #1553538) | Cod sursa (job #1243337) | Cod sursa (job #1683689) | Cod sursa (job #2777441) | Cod sursa (job #2900751)
#include <bits/stdc++.h>
using namespace std;
#define itn int
#define nit int
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
#define MOD 1000000007
#define MOD2 998244353
#define INF 1e18
#define debug(x) cerr << #x << ' ' << x << '\n'
#define mem0(x) memset(x, 0, sizeof(x))
#define mem0x3f(x) memset(x, 0x3f, sizeof(x))
#define pb push_back
#define fst first
#define snd second
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
const ld pi = acos(-1);
ll rf[50][50];
int main(void) {
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int n; cin >> n;
memset(rf, 0x7f, sizeof(rf));
for (int i = 0; i < n; ++i) rf[i][i] = 0;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
cin >> rf[i][j];
for (int k = 0; k < n; ++k) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (k == i || k == j) continue;
rf[i][j] = min(rf[i][j], rf[i][k] + rf[k][j]);
}
}
}
for (int i = 0;i < n; ++i) {
for (int j = 0; j < n; ++j) {
cout << rf[i][j] << ' ';
}
cout << '\n';
}
return 0;
}