text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int result = 0;
int n;
int tab[20][20];
void nothingFunc() {}
void solvingFunc();
void maximizingFunc();
void printFunc();
void (*foo[2])(void) = {nothingFunc, solvingFunc};
void (*foofoo[2])(void) = {nothingFunc, maximizingFunc};
void (*foofoofoo[2])(void) = {nothingFunc, printFunc};
void solvingFunc() {
int i = 0, j = 0, k = 0;
solving : {
tab[j][k] = min(tab[j][k], tab[j][i] + tab[i][k]);
k++;
j += (k / n);
k %= n;
i += (j / n);
j %= n;
foofoo[i / n]();
goto solving;
}
}
void maximizingFunc() {
int i = 0, j = 0;
maximizing : {
result = max(result, tab[i][j]);
j++;
i += (j / n);
j %= n;
foofoofoo[i / n]();
goto maximizing;
}
}
void printFunc() {
cout << result;
exit(0);
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
int i = 0, j = 0;
reading : {
cin >> tab[i][j];
j++;
i += (j / n);
j %= n;
foo[i / n]();
goto reading;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
int d[200][200];
int read_input(int i = 0) {
return (i == N * N) ? 0 : (cin >> d[i / N][i % N], read_input(i + 1));
}
int asp(int v = 0) {
int k = v / N / N;
int i = v / N % N;
int j = v % N;
return (v == N * N * N)
? 0
: (d[i][j] = min(d[i][j], d[i][k] + d[k][j]), asp(v + 1));
}
int res(int v = 0) {
return (v == N * N) ? 0 : max(d[v / N][v % N], res(v + 1));
}
int main() {
ios_base::sync_with_stdio(0);
cin >> N;
read_input();
asp();
cout << res() << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[10][10];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
vector<int> vec(n, 0);
vector<int> noop;
int i = 0;
transform(vec.begin(), vec.end(), back_inserter(noop), [&](int x) {
int j = 0;
transform(vec.begin(), vec.end(), back_inserter(noop), [&](int y) {
cin >> a[i][j];
j += 1;
return false;
});
i += 1;
return false;
});
int k = 0;
transform(vec.begin(), vec.end(), back_inserter(noop), [&](int x) {
int i = 0;
transform(vec.begin(), vec.end(), back_inserter(noop), [&](int y) {
int j = 0;
transform(vec.begin(), vec.end(), back_inserter(noop), [&](int z) {
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
j += 1;
return false;
});
i += 1;
return false;
});
k += 1;
return false;
});
int answer = 0;
i = 0;
transform(vec.begin(), vec.end(), back_inserter(noop), [&](int x) {
int j = 0;
transform(vec.begin(), vec.end(), back_inserter(noop), [&](int y) {
answer = max(answer, a[i][j]);
j += 1;
return false;
});
i += 1;
return false;
});
cout << answer << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int d[101][101], mx = 0, n;
bool input(int i) {
cin >> d[i / n][i % n];
i++;
return (i >= n * n) ? 0 : input(i);
}
bool mxm(int i) {
mx = max(mx, d[i / n][i % n]);
i++;
return (i >= n * n) ? 0 : mxm(i);
}
bool fly(int i) {
d[i / n % n][i % n] = min(d[i / n % n][i % n],
d[i / n % n][i / (n * n)] + d[i / (n * n)][i % n]);
i++;
return (i >= n * n * n) ? 0 : fly(i);
}
int main() {
cin >> n;
int i = 0, j = 0, k = 0;
input(0);
fly(0);
mxm(0);
cout << mx << endl;
}
|
#include <bits/stdc++.h>
int const N = 123;
int a[N][N];
bool scan(int i, int j) { return scanf("%d", a[i] + j); }
bool readLine(int i, int j) { return j && readLine(i, j - 1) * scan(i, j); }
bool read(int n, int i) { return i && read(n, i - 1) * readLine(i, n); }
bool update(int k, int i, int j) {
return k && i && j && (a[i][j] = std::min(a[i][j], a[i][k] + a[k][j]));
}
bool floyd3(int k, int i, int j) {
return j && floyd3(k, i, j - 1) * update(k, i, j);
}
bool floyd2(int k, int i, int n) {
return i && floyd2(k, i - 1, n) * floyd3(k, i, n);
}
bool floyd(int k, int n) { return k && floyd(k - 1, n) * floyd2(k, n, n); }
int ans;
bool upd(int i, int j) { return i != j && (ans = std::max(ans, a[i][j])); }
bool goLine(int i, int j) { return j && goLine(i, j - 1) * upd(i, j); }
bool go(int n, int i) { return i && go(n, i - 1) * goLine(i, n); }
int main() {
int n;
scanf("%d", &n);
read(n, n);
floyd(n, n);
go(n, n);
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7, sz = 200;
long long dp[11][11], n, ans;
int fc3() {
int x;
cin >> x;
return x;
}
int func2(int i, int j) { return i < n ? fc3() : 0; }
int fc(int i, int j) {
i += j / n;
j %= n;
dp[i][j] = func2(i, j);
return i < n ? fc(i, j + 1) : 0;
}
int func(int k, int i, int j) {
return k < n ? min(dp[i][j], dp[i][k] + dp[k][j]) : dp[i][j];
}
int fc1(int k, int i, int j) {
i += j / n;
j %= n;
k += i / n;
i %= n;
dp[i][j] = func(k, i, j);
return k < n ? fc1(k, i, j + 1) : 0;
}
int fc2(int i, int j) {
i += j / n;
j %= n;
ans = i < n ? max(ans, dp[i][j]) : ans;
return i < n ? fc2(i, j + 1) : 0;
}
int main() {
iostream::sync_with_stdio(0);
cin.tie(0);
cin >> n;
fc(0, 0);
fc1(0, 0, 0);
fc2(0, 0);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 10;
const int inf = 1 << 29;
int d[N][N];
int loop(function<bool()> ok, function<void()> increment,
function<void()> work) {
return ok() ? work(), increment(), loop(ok, increment, work) : 0;
}
int main() {
int n;
scanf("%d", &n);
{
int i = 0;
loop([&]() -> bool { return i < n; }, [&]() { ++i; },
[&]() {
int j = 0;
loop([&]() -> bool { return j < n; }, [&]() { ++j; },
[&]() { scanf("%d", d[i] + j); });
});
}
{
int k = 0;
loop([&]() -> bool { return k < n; }, [&]() { ++k; },
[&]() {
int i = 0;
loop([&]() -> bool { return i < n; }, [&]() { ++i; },
[&]() {
int j = 0;
loop([&]() -> bool { return j < n; }, [&]() { ++j; },
[&]() { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); });
});
});
}
int ans = 0;
{
int i = 0;
loop([&]() -> bool { return i < n; }, [&]() { ++i; },
[&]() {
int j = 0;
loop([&]() -> bool { return j < n; }, [&]() { ++j; },
[&]() { ans = max(ans, d[i][j]); });
});
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
vector<vector<int> > d;
int _i, _k;
int ans = 0;
bool f(int i, int lim, void (*action)(int i)) {
action(i);
i++;
(i < lim) && f(i, lim, action);
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
d.assign(n, vector<int>(n, 0));
f(0, n, [](int i) {
_i = i;
f(0, n, [](int j) { cin >> d[_i][j]; });
});
f(0, n, [](int k) {
_k = k;
f(0, n, [](int i) {
_i = i;
f(0, n, [](int j) { d[_i][j] = min(d[_i][j], d[_i][_k] + d[_k][j]); });
});
});
f(0, n,
[](int i) { ans = max(ans, (*max_element(d[i].begin(), d[i].end()))); });
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int d[111];
void read();
void h(int k, int i, int j) {
d[i * n + j] = max(max(i, j), k) < n
? min(d[i * n + j], d[i * n + k] + d[k * n + j])
: d[i * n + j];
}
void g(int k, int i) {
h(k, i, 0);
h(k, i, 1);
h(k, i, 2);
h(k, i, 3);
h(k, i, 4);
h(k, i, 5);
h(k, i, 6);
h(k, i, 7);
h(k, i, 8);
h(k, i, 9);
}
void f(int k) {
g(k, 0);
g(k, 1);
g(k, 2);
g(k, 3);
g(k, 4);
g(k, 5);
g(k, 6);
g(k, 7);
g(k, 8);
g(k, 9);
}
int main() {
cin >> n;
read();
f(0);
f(1);
f(2);
f(3);
f(4);
f(5);
f(6);
f(7);
f(8);
f(9);
printf("%d\n", *max_element(d, d + n * n));
return 0;
}
void read() {
cin >> d[0];
cin >> d[1];
cin >> d[2];
cin >> d[3];
cin >> d[4];
cin >> d[5];
cin >> d[6];
cin >> d[7];
cin >> d[8];
cin >> d[9];
cin >> d[10];
cin >> d[11];
cin >> d[12];
cin >> d[13];
cin >> d[14];
cin >> d[15];
cin >> d[16];
cin >> d[17];
cin >> d[18];
cin >> d[19];
cin >> d[20];
cin >> d[21];
cin >> d[22];
cin >> d[23];
cin >> d[24];
cin >> d[25];
cin >> d[26];
cin >> d[27];
cin >> d[28];
cin >> d[29];
cin >> d[30];
cin >> d[31];
cin >> d[32];
cin >> d[33];
cin >> d[34];
cin >> d[35];
cin >> d[36];
cin >> d[37];
cin >> d[38];
cin >> d[39];
cin >> d[40];
cin >> d[41];
cin >> d[42];
cin >> d[43];
cin >> d[44];
cin >> d[45];
cin >> d[46];
cin >> d[47];
cin >> d[48];
cin >> d[49];
cin >> d[50];
cin >> d[51];
cin >> d[52];
cin >> d[53];
cin >> d[54];
cin >> d[55];
cin >> d[56];
cin >> d[57];
cin >> d[58];
cin >> d[59];
cin >> d[60];
cin >> d[61];
cin >> d[62];
cin >> d[63];
cin >> d[64];
cin >> d[65];
cin >> d[66];
cin >> d[67];
cin >> d[68];
cin >> d[69];
cin >> d[70];
cin >> d[71];
cin >> d[72];
cin >> d[73];
cin >> d[74];
cin >> d[75];
cin >> d[76];
cin >> d[77];
cin >> d[78];
cin >> d[79];
cin >> d[80];
cin >> d[81];
cin >> d[82];
cin >> d[83];
cin >> d[84];
cin >> d[85];
cin >> d[86];
cin >> d[87];
cin >> d[88];
cin >> d[89];
cin >> d[90];
cin >> d[91];
cin >> d[92];
cin >> d[93];
cin >> d[94];
cin >> d[95];
cin >> d[96];
cin >> d[97];
cin >> d[98];
cin >> d[99];
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[11][11], ans;
int read_it(int i, int j) {
i += j / n, j %= n;
return i != n ? cin >> a[i][j], read_it(i, j + 1) : 0;
}
int do_it(int k, int i, int j) {
i += j / n, j %= n;
k += i / n, i %= n;
return k != n ? a[i][j] = min(a[i][j], a[i][k] + a[k][j]),
do_it(k, i, j + 1) : 0;
}
int calc_it(int i) {
return i != n ? ans = max(ans, *max_element(a[i], a[i] + n)),
calc_it(i + 1) : 0;
}
int main() {
cin >> n;
read_it(0, 0);
do_it(0, 0, 0);
calc_it(0);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > a;
vector<vector<int> > dist;
vector<int> idx2, idx3;
int id;
int N;
int res = 0;
const int INF = 100 + 1;
void f2(int i) { idx2[id] = id++; }
void f3(int i) { idx3[id] = id++; }
void f_input(int x) {
int i = x / N;
int j = x % N;
cin >> a[i][j];
dist[i][j] = a[i][j];
}
void f_fw(int x) {
int k = x / (N * N);
x -= k * N * N;
int i = x / N;
int j = x % N;
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
void f_res(int x) {
int i = x / N;
int j = x % N;
res = max(res, dist[i][j]);
}
int main(int argc, char **argv) {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0), cout.precision(15);
cin >> N;
a = vector<vector<int> >(N, vector<int>(N));
dist = vector<vector<int> >(N, vector<int>(N, INF));
idx2.resize(N * N);
idx3.resize(N * N * N);
id = 0;
for_each(idx2.begin(), idx2.end(), f2);
id = 0;
for_each(idx3.begin(), idx3.end(), f3);
for_each(idx2.begin(), idx2.end(), f_input);
for_each(idx3.begin(), idx3.end(), f_fw);
for_each(idx2.begin(), idx2.end(), f_res);
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
int A[20][20];
int sol;
bool citeste(int i, int j) {
scanf("%d", &A[i][j]);
(i <= N) && citeste((j == N) ? (i + 1) : i, (j == N) ? 1 : (j + 1));
return 0;
}
bool rezolva(int k, int i, int j) {
A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
(k <= N) && ((i == N && j == N && (k < N) && rezolva(k + 1, 1, 1)) ||
((i < N || (i == N && j < N)) &&
rezolva(k, (j == N) ? (i + 1) : i, (j == N) ? 1 : (j + 1))));
return 0;
}
bool iamax(int i, int j) {
sol = max(sol, A[i][j]);
(i <= N) && iamax((j == N) ? (i + 1) : i, (j == N) ? 1 : (j + 1));
return 0;
}
int main() {
scanf("%d", &N);
citeste(1, 1);
rezolva(1, 1, 1);
iamax(1, 1);
printf("%d\n", sol);
return 0;
}
|
#include <bits/stdc++.h>
int n, ans, a[15][15];
inline void maxx(int& a, int b) { a = (a > b ? a : b); }
inline void minx(int& a, int b) { a = (a < b ? a : b); }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) scanf("%d", &a[i][j]);
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) minx(a[i][j], a[i][k] + a[k][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) maxx(ans, a[i][j]);
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 10;
int n;
int g[N][N];
int ans;
void (*f)(int, int, int);
void read(int i, int j, int k) { scanf("%d", &g[i][j]); }
void floyd(int k, int i, int j) { g[i][j] = min(g[i][j], g[i][k] + g[k][j]); }
void maxs(int i, int j, int k) { i == j ? 0 : ans = max(ans, g[i][j]); }
void loop1(int i, int n, int j, int m, int k, int l);
int loop0(int i, int n, int j, int m, int k, int l) {
f(i, j, k);
loop1(i, n, j, m, k + 1, l);
return 0;
}
void loop1(int i, int n, int j, int m, int k, int l) {
k == l ? ++j, k = 0 : 0;
j == m ? ++i, j = 0 : 0;
i == n ? 0 : loop0(i, n, j, m, k, l);
}
int main() {
scanf("%d", &n);
f = &read;
loop1(0, n, 0, n, 0, 1);
f = &floyd;
loop1(0, n, 0, n, 0, n);
f = &maxs;
loop1(0, n, 0, n, 0, 1);
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
istringstream is;
int n, jnk;
cin >> n;
int a[10][10];
a[0][0] = 10000000;
((0 < n) && (0 < n)) ? (cin >> a[0][0]) : (is >> jnk);
a[0][1] = 10000000;
((0 < n) && (1 < n)) ? (cin >> a[0][1]) : (is >> jnk);
a[0][2] = 10000000;
((0 < n) && (2 < n)) ? (cin >> a[0][2]) : (is >> jnk);
a[0][3] = 10000000;
((0 < n) && (3 < n)) ? (cin >> a[0][3]) : (is >> jnk);
a[0][4] = 10000000;
((0 < n) && (4 < n)) ? (cin >> a[0][4]) : (is >> jnk);
a[0][5] = 10000000;
((0 < n) && (5 < n)) ? (cin >> a[0][5]) : (is >> jnk);
a[0][6] = 10000000;
((0 < n) && (6 < n)) ? (cin >> a[0][6]) : (is >> jnk);
a[0][7] = 10000000;
((0 < n) && (7 < n)) ? (cin >> a[0][7]) : (is >> jnk);
a[0][8] = 10000000;
((0 < n) && (8 < n)) ? (cin >> a[0][8]) : (is >> jnk);
a[0][9] = 10000000;
((0 < n) && (9 < n)) ? (cin >> a[0][9]) : (is >> jnk);
a[1][0] = 10000000;
((1 < n) && (0 < n)) ? (cin >> a[1][0]) : (is >> jnk);
a[1][1] = 10000000;
((1 < n) && (1 < n)) ? (cin >> a[1][1]) : (is >> jnk);
a[1][2] = 10000000;
((1 < n) && (2 < n)) ? (cin >> a[1][2]) : (is >> jnk);
a[1][3] = 10000000;
((1 < n) && (3 < n)) ? (cin >> a[1][3]) : (is >> jnk);
a[1][4] = 10000000;
((1 < n) && (4 < n)) ? (cin >> a[1][4]) : (is >> jnk);
a[1][5] = 10000000;
((1 < n) && (5 < n)) ? (cin >> a[1][5]) : (is >> jnk);
a[1][6] = 10000000;
((1 < n) && (6 < n)) ? (cin >> a[1][6]) : (is >> jnk);
a[1][7] = 10000000;
((1 < n) && (7 < n)) ? (cin >> a[1][7]) : (is >> jnk);
a[1][8] = 10000000;
((1 < n) && (8 < n)) ? (cin >> a[1][8]) : (is >> jnk);
a[1][9] = 10000000;
((1 < n) && (9 < n)) ? (cin >> a[1][9]) : (is >> jnk);
a[2][0] = 10000000;
((2 < n) && (0 < n)) ? (cin >> a[2][0]) : (is >> jnk);
a[2][1] = 10000000;
((2 < n) && (1 < n)) ? (cin >> a[2][1]) : (is >> jnk);
a[2][2] = 10000000;
((2 < n) && (2 < n)) ? (cin >> a[2][2]) : (is >> jnk);
a[2][3] = 10000000;
((2 < n) && (3 < n)) ? (cin >> a[2][3]) : (is >> jnk);
a[2][4] = 10000000;
((2 < n) && (4 < n)) ? (cin >> a[2][4]) : (is >> jnk);
a[2][5] = 10000000;
((2 < n) && (5 < n)) ? (cin >> a[2][5]) : (is >> jnk);
a[2][6] = 10000000;
((2 < n) && (6 < n)) ? (cin >> a[2][6]) : (is >> jnk);
a[2][7] = 10000000;
((2 < n) && (7 < n)) ? (cin >> a[2][7]) : (is >> jnk);
a[2][8] = 10000000;
((2 < n) && (8 < n)) ? (cin >> a[2][8]) : (is >> jnk);
a[2][9] = 10000000;
((2 < n) && (9 < n)) ? (cin >> a[2][9]) : (is >> jnk);
a[3][0] = 10000000;
((3 < n) && (0 < n)) ? (cin >> a[3][0]) : (is >> jnk);
a[3][1] = 10000000;
((3 < n) && (1 < n)) ? (cin >> a[3][1]) : (is >> jnk);
a[3][2] = 10000000;
((3 < n) && (2 < n)) ? (cin >> a[3][2]) : (is >> jnk);
a[3][3] = 10000000;
((3 < n) && (3 < n)) ? (cin >> a[3][3]) : (is >> jnk);
a[3][4] = 10000000;
((3 < n) && (4 < n)) ? (cin >> a[3][4]) : (is >> jnk);
a[3][5] = 10000000;
((3 < n) && (5 < n)) ? (cin >> a[3][5]) : (is >> jnk);
a[3][6] = 10000000;
((3 < n) && (6 < n)) ? (cin >> a[3][6]) : (is >> jnk);
a[3][7] = 10000000;
((3 < n) && (7 < n)) ? (cin >> a[3][7]) : (is >> jnk);
a[3][8] = 10000000;
((3 < n) && (8 < n)) ? (cin >> a[3][8]) : (is >> jnk);
a[3][9] = 10000000;
((3 < n) && (9 < n)) ? (cin >> a[3][9]) : (is >> jnk);
a[4][0] = 10000000;
((4 < n) && (0 < n)) ? (cin >> a[4][0]) : (is >> jnk);
a[4][1] = 10000000;
((4 < n) && (1 < n)) ? (cin >> a[4][1]) : (is >> jnk);
a[4][2] = 10000000;
((4 < n) && (2 < n)) ? (cin >> a[4][2]) : (is >> jnk);
a[4][3] = 10000000;
((4 < n) && (3 < n)) ? (cin >> a[4][3]) : (is >> jnk);
a[4][4] = 10000000;
((4 < n) && (4 < n)) ? (cin >> a[4][4]) : (is >> jnk);
a[4][5] = 10000000;
((4 < n) && (5 < n)) ? (cin >> a[4][5]) : (is >> jnk);
a[4][6] = 10000000;
((4 < n) && (6 < n)) ? (cin >> a[4][6]) : (is >> jnk);
a[4][7] = 10000000;
((4 < n) && (7 < n)) ? (cin >> a[4][7]) : (is >> jnk);
a[4][8] = 10000000;
((4 < n) && (8 < n)) ? (cin >> a[4][8]) : (is >> jnk);
a[4][9] = 10000000;
((4 < n) && (9 < n)) ? (cin >> a[4][9]) : (is >> jnk);
a[5][0] = 10000000;
((5 < n) && (0 < n)) ? (cin >> a[5][0]) : (is >> jnk);
a[5][1] = 10000000;
((5 < n) && (1 < n)) ? (cin >> a[5][1]) : (is >> jnk);
a[5][2] = 10000000;
((5 < n) && (2 < n)) ? (cin >> a[5][2]) : (is >> jnk);
a[5][3] = 10000000;
((5 < n) && (3 < n)) ? (cin >> a[5][3]) : (is >> jnk);
a[5][4] = 10000000;
((5 < n) && (4 < n)) ? (cin >> a[5][4]) : (is >> jnk);
a[5][5] = 10000000;
((5 < n) && (5 < n)) ? (cin >> a[5][5]) : (is >> jnk);
a[5][6] = 10000000;
((5 < n) && (6 < n)) ? (cin >> a[5][6]) : (is >> jnk);
a[5][7] = 10000000;
((5 < n) && (7 < n)) ? (cin >> a[5][7]) : (is >> jnk);
a[5][8] = 10000000;
((5 < n) && (8 < n)) ? (cin >> a[5][8]) : (is >> jnk);
a[5][9] = 10000000;
((5 < n) && (9 < n)) ? (cin >> a[5][9]) : (is >> jnk);
a[6][0] = 10000000;
((6 < n) && (0 < n)) ? (cin >> a[6][0]) : (is >> jnk);
a[6][1] = 10000000;
((6 < n) && (1 < n)) ? (cin >> a[6][1]) : (is >> jnk);
a[6][2] = 10000000;
((6 < n) && (2 < n)) ? (cin >> a[6][2]) : (is >> jnk);
a[6][3] = 10000000;
((6 < n) && (3 < n)) ? (cin >> a[6][3]) : (is >> jnk);
a[6][4] = 10000000;
((6 < n) && (4 < n)) ? (cin >> a[6][4]) : (is >> jnk);
a[6][5] = 10000000;
((6 < n) && (5 < n)) ? (cin >> a[6][5]) : (is >> jnk);
a[6][6] = 10000000;
((6 < n) && (6 < n)) ? (cin >> a[6][6]) : (is >> jnk);
a[6][7] = 10000000;
((6 < n) && (7 < n)) ? (cin >> a[6][7]) : (is >> jnk);
a[6][8] = 10000000;
((6 < n) && (8 < n)) ? (cin >> a[6][8]) : (is >> jnk);
a[6][9] = 10000000;
((6 < n) && (9 < n)) ? (cin >> a[6][9]) : (is >> jnk);
a[7][0] = 10000000;
((7 < n) && (0 < n)) ? (cin >> a[7][0]) : (is >> jnk);
a[7][1] = 10000000;
((7 < n) && (1 < n)) ? (cin >> a[7][1]) : (is >> jnk);
a[7][2] = 10000000;
((7 < n) && (2 < n)) ? (cin >> a[7][2]) : (is >> jnk);
a[7][3] = 10000000;
((7 < n) && (3 < n)) ? (cin >> a[7][3]) : (is >> jnk);
a[7][4] = 10000000;
((7 < n) && (4 < n)) ? (cin >> a[7][4]) : (is >> jnk);
a[7][5] = 10000000;
((7 < n) && (5 < n)) ? (cin >> a[7][5]) : (is >> jnk);
a[7][6] = 10000000;
((7 < n) && (6 < n)) ? (cin >> a[7][6]) : (is >> jnk);
a[7][7] = 10000000;
((7 < n) && (7 < n)) ? (cin >> a[7][7]) : (is >> jnk);
a[7][8] = 10000000;
((7 < n) && (8 < n)) ? (cin >> a[7][8]) : (is >> jnk);
a[7][9] = 10000000;
((7 < n) && (9 < n)) ? (cin >> a[7][9]) : (is >> jnk);
a[8][0] = 10000000;
((8 < n) && (0 < n)) ? (cin >> a[8][0]) : (is >> jnk);
a[8][1] = 10000000;
((8 < n) && (1 < n)) ? (cin >> a[8][1]) : (is >> jnk);
a[8][2] = 10000000;
((8 < n) && (2 < n)) ? (cin >> a[8][2]) : (is >> jnk);
a[8][3] = 10000000;
((8 < n) && (3 < n)) ? (cin >> a[8][3]) : (is >> jnk);
a[8][4] = 10000000;
((8 < n) && (4 < n)) ? (cin >> a[8][4]) : (is >> jnk);
a[8][5] = 10000000;
((8 < n) && (5 < n)) ? (cin >> a[8][5]) : (is >> jnk);
a[8][6] = 10000000;
((8 < n) && (6 < n)) ? (cin >> a[8][6]) : (is >> jnk);
a[8][7] = 10000000;
((8 < n) && (7 < n)) ? (cin >> a[8][7]) : (is >> jnk);
a[8][8] = 10000000;
((8 < n) && (8 < n)) ? (cin >> a[8][8]) : (is >> jnk);
a[8][9] = 10000000;
((8 < n) && (9 < n)) ? (cin >> a[8][9]) : (is >> jnk);
a[9][0] = 10000000;
((9 < n) && (0 < n)) ? (cin >> a[9][0]) : (is >> jnk);
a[9][1] = 10000000;
((9 < n) && (1 < n)) ? (cin >> a[9][1]) : (is >> jnk);
a[9][2] = 10000000;
((9 < n) && (2 < n)) ? (cin >> a[9][2]) : (is >> jnk);
a[9][3] = 10000000;
((9 < n) && (3 < n)) ? (cin >> a[9][3]) : (is >> jnk);
a[9][4] = 10000000;
((9 < n) && (4 < n)) ? (cin >> a[9][4]) : (is >> jnk);
a[9][5] = 10000000;
((9 < n) && (5 < n)) ? (cin >> a[9][5]) : (is >> jnk);
a[9][6] = 10000000;
((9 < n) && (6 < n)) ? (cin >> a[9][6]) : (is >> jnk);
a[9][7] = 10000000;
((9 < n) && (7 < n)) ? (cin >> a[9][7]) : (is >> jnk);
a[9][8] = 10000000;
((9 < n) && (8 < n)) ? (cin >> a[9][8]) : (is >> jnk);
a[9][9] = 10000000;
((9 < n) && (9 < n)) ? (cin >> a[9][9]) : (is >> jnk);
a[1][0] += (a[1][0] + a[0][0] - a[1][0]) * (a[1][0] + a[0][0] < a[1][0]);
a[0][1] = a[1][0];
a[2][0] += (a[2][0] + a[0][0] - a[2][0]) * (a[2][0] + a[0][0] < a[2][0]);
a[0][2] = a[2][0];
a[2][1] += (a[2][0] + a[0][1] - a[2][1]) * (a[2][0] + a[0][1] < a[2][1]);
a[1][2] = a[2][1];
a[3][0] += (a[3][0] + a[0][0] - a[3][0]) * (a[3][0] + a[0][0] < a[3][0]);
a[0][3] = a[3][0];
a[3][1] += (a[3][0] + a[0][1] - a[3][1]) * (a[3][0] + a[0][1] < a[3][1]);
a[1][3] = a[3][1];
a[3][2] += (a[3][0] + a[0][2] - a[3][2]) * (a[3][0] + a[0][2] < a[3][2]);
a[2][3] = a[3][2];
a[4][0] += (a[4][0] + a[0][0] - a[4][0]) * (a[4][0] + a[0][0] < a[4][0]);
a[0][4] = a[4][0];
a[4][1] += (a[4][0] + a[0][1] - a[4][1]) * (a[4][0] + a[0][1] < a[4][1]);
a[1][4] = a[4][1];
a[4][2] += (a[4][0] + a[0][2] - a[4][2]) * (a[4][0] + a[0][2] < a[4][2]);
a[2][4] = a[4][2];
a[4][3] += (a[4][0] + a[0][3] - a[4][3]) * (a[4][0] + a[0][3] < a[4][3]);
a[3][4] = a[4][3];
a[5][0] += (a[5][0] + a[0][0] - a[5][0]) * (a[5][0] + a[0][0] < a[5][0]);
a[0][5] = a[5][0];
a[5][1] += (a[5][0] + a[0][1] - a[5][1]) * (a[5][0] + a[0][1] < a[5][1]);
a[1][5] = a[5][1];
a[5][2] += (a[5][0] + a[0][2] - a[5][2]) * (a[5][0] + a[0][2] < a[5][2]);
a[2][5] = a[5][2];
a[5][3] += (a[5][0] + a[0][3] - a[5][3]) * (a[5][0] + a[0][3] < a[5][3]);
a[3][5] = a[5][3];
a[5][4] += (a[5][0] + a[0][4] - a[5][4]) * (a[5][0] + a[0][4] < a[5][4]);
a[4][5] = a[5][4];
a[6][0] += (a[6][0] + a[0][0] - a[6][0]) * (a[6][0] + a[0][0] < a[6][0]);
a[0][6] = a[6][0];
a[6][1] += (a[6][0] + a[0][1] - a[6][1]) * (a[6][0] + a[0][1] < a[6][1]);
a[1][6] = a[6][1];
a[6][2] += (a[6][0] + a[0][2] - a[6][2]) * (a[6][0] + a[0][2] < a[6][2]);
a[2][6] = a[6][2];
a[6][3] += (a[6][0] + a[0][3] - a[6][3]) * (a[6][0] + a[0][3] < a[6][3]);
a[3][6] = a[6][3];
a[6][4] += (a[6][0] + a[0][4] - a[6][4]) * (a[6][0] + a[0][4] < a[6][4]);
a[4][6] = a[6][4];
a[6][5] += (a[6][0] + a[0][5] - a[6][5]) * (a[6][0] + a[0][5] < a[6][5]);
a[5][6] = a[6][5];
a[7][0] += (a[7][0] + a[0][0] - a[7][0]) * (a[7][0] + a[0][0] < a[7][0]);
a[0][7] = a[7][0];
a[7][1] += (a[7][0] + a[0][1] - a[7][1]) * (a[7][0] + a[0][1] < a[7][1]);
a[1][7] = a[7][1];
a[7][2] += (a[7][0] + a[0][2] - a[7][2]) * (a[7][0] + a[0][2] < a[7][2]);
a[2][7] = a[7][2];
a[7][3] += (a[7][0] + a[0][3] - a[7][3]) * (a[7][0] + a[0][3] < a[7][3]);
a[3][7] = a[7][3];
a[7][4] += (a[7][0] + a[0][4] - a[7][4]) * (a[7][0] + a[0][4] < a[7][4]);
a[4][7] = a[7][4];
a[7][5] += (a[7][0] + a[0][5] - a[7][5]) * (a[7][0] + a[0][5] < a[7][5]);
a[5][7] = a[7][5];
a[7][6] += (a[7][0] + a[0][6] - a[7][6]) * (a[7][0] + a[0][6] < a[7][6]);
a[6][7] = a[7][6];
a[8][0] += (a[8][0] + a[0][0] - a[8][0]) * (a[8][0] + a[0][0] < a[8][0]);
a[0][8] = a[8][0];
a[8][1] += (a[8][0] + a[0][1] - a[8][1]) * (a[8][0] + a[0][1] < a[8][1]);
a[1][8] = a[8][1];
a[8][2] += (a[8][0] + a[0][2] - a[8][2]) * (a[8][0] + a[0][2] < a[8][2]);
a[2][8] = a[8][2];
a[8][3] += (a[8][0] + a[0][3] - a[8][3]) * (a[8][0] + a[0][3] < a[8][3]);
a[3][8] = a[8][3];
a[8][4] += (a[8][0] + a[0][4] - a[8][4]) * (a[8][0] + a[0][4] < a[8][4]);
a[4][8] = a[8][4];
a[8][5] += (a[8][0] + a[0][5] - a[8][5]) * (a[8][0] + a[0][5] < a[8][5]);
a[5][8] = a[8][5];
a[8][6] += (a[8][0] + a[0][6] - a[8][6]) * (a[8][0] + a[0][6] < a[8][6]);
a[6][8] = a[8][6];
a[8][7] += (a[8][0] + a[0][7] - a[8][7]) * (a[8][0] + a[0][7] < a[8][7]);
a[7][8] = a[8][7];
a[9][0] += (a[9][0] + a[0][0] - a[9][0]) * (a[9][0] + a[0][0] < a[9][0]);
a[0][9] = a[9][0];
a[9][1] += (a[9][0] + a[0][1] - a[9][1]) * (a[9][0] + a[0][1] < a[9][1]);
a[1][9] = a[9][1];
a[9][2] += (a[9][0] + a[0][2] - a[9][2]) * (a[9][0] + a[0][2] < a[9][2]);
a[2][9] = a[9][2];
a[9][3] += (a[9][0] + a[0][3] - a[9][3]) * (a[9][0] + a[0][3] < a[9][3]);
a[3][9] = a[9][3];
a[9][4] += (a[9][0] + a[0][4] - a[9][4]) * (a[9][0] + a[0][4] < a[9][4]);
a[4][9] = a[9][4];
a[9][5] += (a[9][0] + a[0][5] - a[9][5]) * (a[9][0] + a[0][5] < a[9][5]);
a[5][9] = a[9][5];
a[9][6] += (a[9][0] + a[0][6] - a[9][6]) * (a[9][0] + a[0][6] < a[9][6]);
a[6][9] = a[9][6];
a[9][7] += (a[9][0] + a[0][7] - a[9][7]) * (a[9][0] + a[0][7] < a[9][7]);
a[7][9] = a[9][7];
a[9][8] += (a[9][0] + a[0][8] - a[9][8]) * (a[9][0] + a[0][8] < a[9][8]);
a[8][9] = a[9][8];
a[1][0] += (a[1][1] + a[1][0] - a[1][0]) * (a[1][1] + a[1][0] < a[1][0]);
a[0][1] = a[1][0];
a[2][0] += (a[2][1] + a[1][0] - a[2][0]) * (a[2][1] + a[1][0] < a[2][0]);
a[0][2] = a[2][0];
a[2][1] += (a[2][1] + a[1][1] - a[2][1]) * (a[2][1] + a[1][1] < a[2][1]);
a[1][2] = a[2][1];
a[3][0] += (a[3][1] + a[1][0] - a[3][0]) * (a[3][1] + a[1][0] < a[3][0]);
a[0][3] = a[3][0];
a[3][1] += (a[3][1] + a[1][1] - a[3][1]) * (a[3][1] + a[1][1] < a[3][1]);
a[1][3] = a[3][1];
a[3][2] += (a[3][1] + a[1][2] - a[3][2]) * (a[3][1] + a[1][2] < a[3][2]);
a[2][3] = a[3][2];
a[4][0] += (a[4][1] + a[1][0] - a[4][0]) * (a[4][1] + a[1][0] < a[4][0]);
a[0][4] = a[4][0];
a[4][1] += (a[4][1] + a[1][1] - a[4][1]) * (a[4][1] + a[1][1] < a[4][1]);
a[1][4] = a[4][1];
a[4][2] += (a[4][1] + a[1][2] - a[4][2]) * (a[4][1] + a[1][2] < a[4][2]);
a[2][4] = a[4][2];
a[4][3] += (a[4][1] + a[1][3] - a[4][3]) * (a[4][1] + a[1][3] < a[4][3]);
a[3][4] = a[4][3];
a[5][0] += (a[5][1] + a[1][0] - a[5][0]) * (a[5][1] + a[1][0] < a[5][0]);
a[0][5] = a[5][0];
a[5][1] += (a[5][1] + a[1][1] - a[5][1]) * (a[5][1] + a[1][1] < a[5][1]);
a[1][5] = a[5][1];
a[5][2] += (a[5][1] + a[1][2] - a[5][2]) * (a[5][1] + a[1][2] < a[5][2]);
a[2][5] = a[5][2];
a[5][3] += (a[5][1] + a[1][3] - a[5][3]) * (a[5][1] + a[1][3] < a[5][3]);
a[3][5] = a[5][3];
a[5][4] += (a[5][1] + a[1][4] - a[5][4]) * (a[5][1] + a[1][4] < a[5][4]);
a[4][5] = a[5][4];
a[6][0] += (a[6][1] + a[1][0] - a[6][0]) * (a[6][1] + a[1][0] < a[6][0]);
a[0][6] = a[6][0];
a[6][1] += (a[6][1] + a[1][1] - a[6][1]) * (a[6][1] + a[1][1] < a[6][1]);
a[1][6] = a[6][1];
a[6][2] += (a[6][1] + a[1][2] - a[6][2]) * (a[6][1] + a[1][2] < a[6][2]);
a[2][6] = a[6][2];
a[6][3] += (a[6][1] + a[1][3] - a[6][3]) * (a[6][1] + a[1][3] < a[6][3]);
a[3][6] = a[6][3];
a[6][4] += (a[6][1] + a[1][4] - a[6][4]) * (a[6][1] + a[1][4] < a[6][4]);
a[4][6] = a[6][4];
a[6][5] += (a[6][1] + a[1][5] - a[6][5]) * (a[6][1] + a[1][5] < a[6][5]);
a[5][6] = a[6][5];
a[7][0] += (a[7][1] + a[1][0] - a[7][0]) * (a[7][1] + a[1][0] < a[7][0]);
a[0][7] = a[7][0];
a[7][1] += (a[7][1] + a[1][1] - a[7][1]) * (a[7][1] + a[1][1] < a[7][1]);
a[1][7] = a[7][1];
a[7][2] += (a[7][1] + a[1][2] - a[7][2]) * (a[7][1] + a[1][2] < a[7][2]);
a[2][7] = a[7][2];
a[7][3] += (a[7][1] + a[1][3] - a[7][3]) * (a[7][1] + a[1][3] < a[7][3]);
a[3][7] = a[7][3];
a[7][4] += (a[7][1] + a[1][4] - a[7][4]) * (a[7][1] + a[1][4] < a[7][4]);
a[4][7] = a[7][4];
a[7][5] += (a[7][1] + a[1][5] - a[7][5]) * (a[7][1] + a[1][5] < a[7][5]);
a[5][7] = a[7][5];
a[7][6] += (a[7][1] + a[1][6] - a[7][6]) * (a[7][1] + a[1][6] < a[7][6]);
a[6][7] = a[7][6];
a[8][0] += (a[8][1] + a[1][0] - a[8][0]) * (a[8][1] + a[1][0] < a[8][0]);
a[0][8] = a[8][0];
a[8][1] += (a[8][1] + a[1][1] - a[8][1]) * (a[8][1] + a[1][1] < a[8][1]);
a[1][8] = a[8][1];
a[8][2] += (a[8][1] + a[1][2] - a[8][2]) * (a[8][1] + a[1][2] < a[8][2]);
a[2][8] = a[8][2];
a[8][3] += (a[8][1] + a[1][3] - a[8][3]) * (a[8][1] + a[1][3] < a[8][3]);
a[3][8] = a[8][3];
a[8][4] += (a[8][1] + a[1][4] - a[8][4]) * (a[8][1] + a[1][4] < a[8][4]);
a[4][8] = a[8][4];
a[8][5] += (a[8][1] + a[1][5] - a[8][5]) * (a[8][1] + a[1][5] < a[8][5]);
a[5][8] = a[8][5];
a[8][6] += (a[8][1] + a[1][6] - a[8][6]) * (a[8][1] + a[1][6] < a[8][6]);
a[6][8] = a[8][6];
a[8][7] += (a[8][1] + a[1][7] - a[8][7]) * (a[8][1] + a[1][7] < a[8][7]);
a[7][8] = a[8][7];
a[9][0] += (a[9][1] + a[1][0] - a[9][0]) * (a[9][1] + a[1][0] < a[9][0]);
a[0][9] = a[9][0];
a[9][1] += (a[9][1] + a[1][1] - a[9][1]) * (a[9][1] + a[1][1] < a[9][1]);
a[1][9] = a[9][1];
a[9][2] += (a[9][1] + a[1][2] - a[9][2]) * (a[9][1] + a[1][2] < a[9][2]);
a[2][9] = a[9][2];
a[9][3] += (a[9][1] + a[1][3] - a[9][3]) * (a[9][1] + a[1][3] < a[9][3]);
a[3][9] = a[9][3];
a[9][4] += (a[9][1] + a[1][4] - a[9][4]) * (a[9][1] + a[1][4] < a[9][4]);
a[4][9] = a[9][4];
a[9][5] += (a[9][1] + a[1][5] - a[9][5]) * (a[9][1] + a[1][5] < a[9][5]);
a[5][9] = a[9][5];
a[9][6] += (a[9][1] + a[1][6] - a[9][6]) * (a[9][1] + a[1][6] < a[9][6]);
a[6][9] = a[9][6];
a[9][7] += (a[9][1] + a[1][7] - a[9][7]) * (a[9][1] + a[1][7] < a[9][7]);
a[7][9] = a[9][7];
a[9][8] += (a[9][1] + a[1][8] - a[9][8]) * (a[9][1] + a[1][8] < a[9][8]);
a[8][9] = a[9][8];
a[1][0] += (a[1][2] + a[2][0] - a[1][0]) * (a[1][2] + a[2][0] < a[1][0]);
a[0][1] = a[1][0];
a[2][0] += (a[2][2] + a[2][0] - a[2][0]) * (a[2][2] + a[2][0] < a[2][0]);
a[0][2] = a[2][0];
a[2][1] += (a[2][2] + a[2][1] - a[2][1]) * (a[2][2] + a[2][1] < a[2][1]);
a[1][2] = a[2][1];
a[3][0] += (a[3][2] + a[2][0] - a[3][0]) * (a[3][2] + a[2][0] < a[3][0]);
a[0][3] = a[3][0];
a[3][1] += (a[3][2] + a[2][1] - a[3][1]) * (a[3][2] + a[2][1] < a[3][1]);
a[1][3] = a[3][1];
a[3][2] += (a[3][2] + a[2][2] - a[3][2]) * (a[3][2] + a[2][2] < a[3][2]);
a[2][3] = a[3][2];
a[4][0] += (a[4][2] + a[2][0] - a[4][0]) * (a[4][2] + a[2][0] < a[4][0]);
a[0][4] = a[4][0];
a[4][1] += (a[4][2] + a[2][1] - a[4][1]) * (a[4][2] + a[2][1] < a[4][1]);
a[1][4] = a[4][1];
a[4][2] += (a[4][2] + a[2][2] - a[4][2]) * (a[4][2] + a[2][2] < a[4][2]);
a[2][4] = a[4][2];
a[4][3] += (a[4][2] + a[2][3] - a[4][3]) * (a[4][2] + a[2][3] < a[4][3]);
a[3][4] = a[4][3];
a[5][0] += (a[5][2] + a[2][0] - a[5][0]) * (a[5][2] + a[2][0] < a[5][0]);
a[0][5] = a[5][0];
a[5][1] += (a[5][2] + a[2][1] - a[5][1]) * (a[5][2] + a[2][1] < a[5][1]);
a[1][5] = a[5][1];
a[5][2] += (a[5][2] + a[2][2] - a[5][2]) * (a[5][2] + a[2][2] < a[5][2]);
a[2][5] = a[5][2];
a[5][3] += (a[5][2] + a[2][3] - a[5][3]) * (a[5][2] + a[2][3] < a[5][3]);
a[3][5] = a[5][3];
a[5][4] += (a[5][2] + a[2][4] - a[5][4]) * (a[5][2] + a[2][4] < a[5][4]);
a[4][5] = a[5][4];
a[6][0] += (a[6][2] + a[2][0] - a[6][0]) * (a[6][2] + a[2][0] < a[6][0]);
a[0][6] = a[6][0];
a[6][1] += (a[6][2] + a[2][1] - a[6][1]) * (a[6][2] + a[2][1] < a[6][1]);
a[1][6] = a[6][1];
a[6][2] += (a[6][2] + a[2][2] - a[6][2]) * (a[6][2] + a[2][2] < a[6][2]);
a[2][6] = a[6][2];
a[6][3] += (a[6][2] + a[2][3] - a[6][3]) * (a[6][2] + a[2][3] < a[6][3]);
a[3][6] = a[6][3];
a[6][4] += (a[6][2] + a[2][4] - a[6][4]) * (a[6][2] + a[2][4] < a[6][4]);
a[4][6] = a[6][4];
a[6][5] += (a[6][2] + a[2][5] - a[6][5]) * (a[6][2] + a[2][5] < a[6][5]);
a[5][6] = a[6][5];
a[7][0] += (a[7][2] + a[2][0] - a[7][0]) * (a[7][2] + a[2][0] < a[7][0]);
a[0][7] = a[7][0];
a[7][1] += (a[7][2] + a[2][1] - a[7][1]) * (a[7][2] + a[2][1] < a[7][1]);
a[1][7] = a[7][1];
a[7][2] += (a[7][2] + a[2][2] - a[7][2]) * (a[7][2] + a[2][2] < a[7][2]);
a[2][7] = a[7][2];
a[7][3] += (a[7][2] + a[2][3] - a[7][3]) * (a[7][2] + a[2][3] < a[7][3]);
a[3][7] = a[7][3];
a[7][4] += (a[7][2] + a[2][4] - a[7][4]) * (a[7][2] + a[2][4] < a[7][4]);
a[4][7] = a[7][4];
a[7][5] += (a[7][2] + a[2][5] - a[7][5]) * (a[7][2] + a[2][5] < a[7][5]);
a[5][7] = a[7][5];
a[7][6] += (a[7][2] + a[2][6] - a[7][6]) * (a[7][2] + a[2][6] < a[7][6]);
a[6][7] = a[7][6];
a[8][0] += (a[8][2] + a[2][0] - a[8][0]) * (a[8][2] + a[2][0] < a[8][0]);
a[0][8] = a[8][0];
a[8][1] += (a[8][2] + a[2][1] - a[8][1]) * (a[8][2] + a[2][1] < a[8][1]);
a[1][8] = a[8][1];
a[8][2] += (a[8][2] + a[2][2] - a[8][2]) * (a[8][2] + a[2][2] < a[8][2]);
a[2][8] = a[8][2];
a[8][3] += (a[8][2] + a[2][3] - a[8][3]) * (a[8][2] + a[2][3] < a[8][3]);
a[3][8] = a[8][3];
a[8][4] += (a[8][2] + a[2][4] - a[8][4]) * (a[8][2] + a[2][4] < a[8][4]);
a[4][8] = a[8][4];
a[8][5] += (a[8][2] + a[2][5] - a[8][5]) * (a[8][2] + a[2][5] < a[8][5]);
a[5][8] = a[8][5];
a[8][6] += (a[8][2] + a[2][6] - a[8][6]) * (a[8][2] + a[2][6] < a[8][6]);
a[6][8] = a[8][6];
a[8][7] += (a[8][2] + a[2][7] - a[8][7]) * (a[8][2] + a[2][7] < a[8][7]);
a[7][8] = a[8][7];
a[9][0] += (a[9][2] + a[2][0] - a[9][0]) * (a[9][2] + a[2][0] < a[9][0]);
a[0][9] = a[9][0];
a[9][1] += (a[9][2] + a[2][1] - a[9][1]) * (a[9][2] + a[2][1] < a[9][1]);
a[1][9] = a[9][1];
a[9][2] += (a[9][2] + a[2][2] - a[9][2]) * (a[9][2] + a[2][2] < a[9][2]);
a[2][9] = a[9][2];
a[9][3] += (a[9][2] + a[2][3] - a[9][3]) * (a[9][2] + a[2][3] < a[9][3]);
a[3][9] = a[9][3];
a[9][4] += (a[9][2] + a[2][4] - a[9][4]) * (a[9][2] + a[2][4] < a[9][4]);
a[4][9] = a[9][4];
a[9][5] += (a[9][2] + a[2][5] - a[9][5]) * (a[9][2] + a[2][5] < a[9][5]);
a[5][9] = a[9][5];
a[9][6] += (a[9][2] + a[2][6] - a[9][6]) * (a[9][2] + a[2][6] < a[9][6]);
a[6][9] = a[9][6];
a[9][7] += (a[9][2] + a[2][7] - a[9][7]) * (a[9][2] + a[2][7] < a[9][7]);
a[7][9] = a[9][7];
a[9][8] += (a[9][2] + a[2][8] - a[9][8]) * (a[9][2] + a[2][8] < a[9][8]);
a[8][9] = a[9][8];
a[1][0] += (a[1][3] + a[3][0] - a[1][0]) * (a[1][3] + a[3][0] < a[1][0]);
a[0][1] = a[1][0];
a[2][0] += (a[2][3] + a[3][0] - a[2][0]) * (a[2][3] + a[3][0] < a[2][0]);
a[0][2] = a[2][0];
a[2][1] += (a[2][3] + a[3][1] - a[2][1]) * (a[2][3] + a[3][1] < a[2][1]);
a[1][2] = a[2][1];
a[3][0] += (a[3][3] + a[3][0] - a[3][0]) * (a[3][3] + a[3][0] < a[3][0]);
a[0][3] = a[3][0];
a[3][1] += (a[3][3] + a[3][1] - a[3][1]) * (a[3][3] + a[3][1] < a[3][1]);
a[1][3] = a[3][1];
a[3][2] += (a[3][3] + a[3][2] - a[3][2]) * (a[3][3] + a[3][2] < a[3][2]);
a[2][3] = a[3][2];
a[4][0] += (a[4][3] + a[3][0] - a[4][0]) * (a[4][3] + a[3][0] < a[4][0]);
a[0][4] = a[4][0];
a[4][1] += (a[4][3] + a[3][1] - a[4][1]) * (a[4][3] + a[3][1] < a[4][1]);
a[1][4] = a[4][1];
a[4][2] += (a[4][3] + a[3][2] - a[4][2]) * (a[4][3] + a[3][2] < a[4][2]);
a[2][4] = a[4][2];
a[4][3] += (a[4][3] + a[3][3] - a[4][3]) * (a[4][3] + a[3][3] < a[4][3]);
a[3][4] = a[4][3];
a[5][0] += (a[5][3] + a[3][0] - a[5][0]) * (a[5][3] + a[3][0] < a[5][0]);
a[0][5] = a[5][0];
a[5][1] += (a[5][3] + a[3][1] - a[5][1]) * (a[5][3] + a[3][1] < a[5][1]);
a[1][5] = a[5][1];
a[5][2] += (a[5][3] + a[3][2] - a[5][2]) * (a[5][3] + a[3][2] < a[5][2]);
a[2][5] = a[5][2];
a[5][3] += (a[5][3] + a[3][3] - a[5][3]) * (a[5][3] + a[3][3] < a[5][3]);
a[3][5] = a[5][3];
a[5][4] += (a[5][3] + a[3][4] - a[5][4]) * (a[5][3] + a[3][4] < a[5][4]);
a[4][5] = a[5][4];
a[6][0] += (a[6][3] + a[3][0] - a[6][0]) * (a[6][3] + a[3][0] < a[6][0]);
a[0][6] = a[6][0];
a[6][1] += (a[6][3] + a[3][1] - a[6][1]) * (a[6][3] + a[3][1] < a[6][1]);
a[1][6] = a[6][1];
a[6][2] += (a[6][3] + a[3][2] - a[6][2]) * (a[6][3] + a[3][2] < a[6][2]);
a[2][6] = a[6][2];
a[6][3] += (a[6][3] + a[3][3] - a[6][3]) * (a[6][3] + a[3][3] < a[6][3]);
a[3][6] = a[6][3];
a[6][4] += (a[6][3] + a[3][4] - a[6][4]) * (a[6][3] + a[3][4] < a[6][4]);
a[4][6] = a[6][4];
a[6][5] += (a[6][3] + a[3][5] - a[6][5]) * (a[6][3] + a[3][5] < a[6][5]);
a[5][6] = a[6][5];
a[7][0] += (a[7][3] + a[3][0] - a[7][0]) * (a[7][3] + a[3][0] < a[7][0]);
a[0][7] = a[7][0];
a[7][1] += (a[7][3] + a[3][1] - a[7][1]) * (a[7][3] + a[3][1] < a[7][1]);
a[1][7] = a[7][1];
a[7][2] += (a[7][3] + a[3][2] - a[7][2]) * (a[7][3] + a[3][2] < a[7][2]);
a[2][7] = a[7][2];
a[7][3] += (a[7][3] + a[3][3] - a[7][3]) * (a[7][3] + a[3][3] < a[7][3]);
a[3][7] = a[7][3];
a[7][4] += (a[7][3] + a[3][4] - a[7][4]) * (a[7][3] + a[3][4] < a[7][4]);
a[4][7] = a[7][4];
a[7][5] += (a[7][3] + a[3][5] - a[7][5]) * (a[7][3] + a[3][5] < a[7][5]);
a[5][7] = a[7][5];
a[7][6] += (a[7][3] + a[3][6] - a[7][6]) * (a[7][3] + a[3][6] < a[7][6]);
a[6][7] = a[7][6];
a[8][0] += (a[8][3] + a[3][0] - a[8][0]) * (a[8][3] + a[3][0] < a[8][0]);
a[0][8] = a[8][0];
a[8][1] += (a[8][3] + a[3][1] - a[8][1]) * (a[8][3] + a[3][1] < a[8][1]);
a[1][8] = a[8][1];
a[8][2] += (a[8][3] + a[3][2] - a[8][2]) * (a[8][3] + a[3][2] < a[8][2]);
a[2][8] = a[8][2];
a[8][3] += (a[8][3] + a[3][3] - a[8][3]) * (a[8][3] + a[3][3] < a[8][3]);
a[3][8] = a[8][3];
a[8][4] += (a[8][3] + a[3][4] - a[8][4]) * (a[8][3] + a[3][4] < a[8][4]);
a[4][8] = a[8][4];
a[8][5] += (a[8][3] + a[3][5] - a[8][5]) * (a[8][3] + a[3][5] < a[8][5]);
a[5][8] = a[8][5];
a[8][6] += (a[8][3] + a[3][6] - a[8][6]) * (a[8][3] + a[3][6] < a[8][6]);
a[6][8] = a[8][6];
a[8][7] += (a[8][3] + a[3][7] - a[8][7]) * (a[8][3] + a[3][7] < a[8][7]);
a[7][8] = a[8][7];
a[9][0] += (a[9][3] + a[3][0] - a[9][0]) * (a[9][3] + a[3][0] < a[9][0]);
a[0][9] = a[9][0];
a[9][1] += (a[9][3] + a[3][1] - a[9][1]) * (a[9][3] + a[3][1] < a[9][1]);
a[1][9] = a[9][1];
a[9][2] += (a[9][3] + a[3][2] - a[9][2]) * (a[9][3] + a[3][2] < a[9][2]);
a[2][9] = a[9][2];
a[9][3] += (a[9][3] + a[3][3] - a[9][3]) * (a[9][3] + a[3][3] < a[9][3]);
a[3][9] = a[9][3];
a[9][4] += (a[9][3] + a[3][4] - a[9][4]) * (a[9][3] + a[3][4] < a[9][4]);
a[4][9] = a[9][4];
a[9][5] += (a[9][3] + a[3][5] - a[9][5]) * (a[9][3] + a[3][5] < a[9][5]);
a[5][9] = a[9][5];
a[9][6] += (a[9][3] + a[3][6] - a[9][6]) * (a[9][3] + a[3][6] < a[9][6]);
a[6][9] = a[9][6];
a[9][7] += (a[9][3] + a[3][7] - a[9][7]) * (a[9][3] + a[3][7] < a[9][7]);
a[7][9] = a[9][7];
a[9][8] += (a[9][3] + a[3][8] - a[9][8]) * (a[9][3] + a[3][8] < a[9][8]);
a[8][9] = a[9][8];
a[1][0] += (a[1][4] + a[4][0] - a[1][0]) * (a[1][4] + a[4][0] < a[1][0]);
a[0][1] = a[1][0];
a[2][0] += (a[2][4] + a[4][0] - a[2][0]) * (a[2][4] + a[4][0] < a[2][0]);
a[0][2] = a[2][0];
a[2][1] += (a[2][4] + a[4][1] - a[2][1]) * (a[2][4] + a[4][1] < a[2][1]);
a[1][2] = a[2][1];
a[3][0] += (a[3][4] + a[4][0] - a[3][0]) * (a[3][4] + a[4][0] < a[3][0]);
a[0][3] = a[3][0];
a[3][1] += (a[3][4] + a[4][1] - a[3][1]) * (a[3][4] + a[4][1] < a[3][1]);
a[1][3] = a[3][1];
a[3][2] += (a[3][4] + a[4][2] - a[3][2]) * (a[3][4] + a[4][2] < a[3][2]);
a[2][3] = a[3][2];
a[4][0] += (a[4][4] + a[4][0] - a[4][0]) * (a[4][4] + a[4][0] < a[4][0]);
a[0][4] = a[4][0];
a[4][1] += (a[4][4] + a[4][1] - a[4][1]) * (a[4][4] + a[4][1] < a[4][1]);
a[1][4] = a[4][1];
a[4][2] += (a[4][4] + a[4][2] - a[4][2]) * (a[4][4] + a[4][2] < a[4][2]);
a[2][4] = a[4][2];
a[4][3] += (a[4][4] + a[4][3] - a[4][3]) * (a[4][4] + a[4][3] < a[4][3]);
a[3][4] = a[4][3];
a[5][0] += (a[5][4] + a[4][0] - a[5][0]) * (a[5][4] + a[4][0] < a[5][0]);
a[0][5] = a[5][0];
a[5][1] += (a[5][4] + a[4][1] - a[5][1]) * (a[5][4] + a[4][1] < a[5][1]);
a[1][5] = a[5][1];
a[5][2] += (a[5][4] + a[4][2] - a[5][2]) * (a[5][4] + a[4][2] < a[5][2]);
a[2][5] = a[5][2];
a[5][3] += (a[5][4] + a[4][3] - a[5][3]) * (a[5][4] + a[4][3] < a[5][3]);
a[3][5] = a[5][3];
a[5][4] += (a[5][4] + a[4][4] - a[5][4]) * (a[5][4] + a[4][4] < a[5][4]);
a[4][5] = a[5][4];
a[6][0] += (a[6][4] + a[4][0] - a[6][0]) * (a[6][4] + a[4][0] < a[6][0]);
a[0][6] = a[6][0];
a[6][1] += (a[6][4] + a[4][1] - a[6][1]) * (a[6][4] + a[4][1] < a[6][1]);
a[1][6] = a[6][1];
a[6][2] += (a[6][4] + a[4][2] - a[6][2]) * (a[6][4] + a[4][2] < a[6][2]);
a[2][6] = a[6][2];
a[6][3] += (a[6][4] + a[4][3] - a[6][3]) * (a[6][4] + a[4][3] < a[6][3]);
a[3][6] = a[6][3];
a[6][4] += (a[6][4] + a[4][4] - a[6][4]) * (a[6][4] + a[4][4] < a[6][4]);
a[4][6] = a[6][4];
a[6][5] += (a[6][4] + a[4][5] - a[6][5]) * (a[6][4] + a[4][5] < a[6][5]);
a[5][6] = a[6][5];
a[7][0] += (a[7][4] + a[4][0] - a[7][0]) * (a[7][4] + a[4][0] < a[7][0]);
a[0][7] = a[7][0];
a[7][1] += (a[7][4] + a[4][1] - a[7][1]) * (a[7][4] + a[4][1] < a[7][1]);
a[1][7] = a[7][1];
a[7][2] += (a[7][4] + a[4][2] - a[7][2]) * (a[7][4] + a[4][2] < a[7][2]);
a[2][7] = a[7][2];
a[7][3] += (a[7][4] + a[4][3] - a[7][3]) * (a[7][4] + a[4][3] < a[7][3]);
a[3][7] = a[7][3];
a[7][4] += (a[7][4] + a[4][4] - a[7][4]) * (a[7][4] + a[4][4] < a[7][4]);
a[4][7] = a[7][4];
a[7][5] += (a[7][4] + a[4][5] - a[7][5]) * (a[7][4] + a[4][5] < a[7][5]);
a[5][7] = a[7][5];
a[7][6] += (a[7][4] + a[4][6] - a[7][6]) * (a[7][4] + a[4][6] < a[7][6]);
a[6][7] = a[7][6];
a[8][0] += (a[8][4] + a[4][0] - a[8][0]) * (a[8][4] + a[4][0] < a[8][0]);
a[0][8] = a[8][0];
a[8][1] += (a[8][4] + a[4][1] - a[8][1]) * (a[8][4] + a[4][1] < a[8][1]);
a[1][8] = a[8][1];
a[8][2] += (a[8][4] + a[4][2] - a[8][2]) * (a[8][4] + a[4][2] < a[8][2]);
a[2][8] = a[8][2];
a[8][3] += (a[8][4] + a[4][3] - a[8][3]) * (a[8][4] + a[4][3] < a[8][3]);
a[3][8] = a[8][3];
a[8][4] += (a[8][4] + a[4][4] - a[8][4]) * (a[8][4] + a[4][4] < a[8][4]);
a[4][8] = a[8][4];
a[8][5] += (a[8][4] + a[4][5] - a[8][5]) * (a[8][4] + a[4][5] < a[8][5]);
a[5][8] = a[8][5];
a[8][6] += (a[8][4] + a[4][6] - a[8][6]) * (a[8][4] + a[4][6] < a[8][6]);
a[6][8] = a[8][6];
a[8][7] += (a[8][4] + a[4][7] - a[8][7]) * (a[8][4] + a[4][7] < a[8][7]);
a[7][8] = a[8][7];
a[9][0] += (a[9][4] + a[4][0] - a[9][0]) * (a[9][4] + a[4][0] < a[9][0]);
a[0][9] = a[9][0];
a[9][1] += (a[9][4] + a[4][1] - a[9][1]) * (a[9][4] + a[4][1] < a[9][1]);
a[1][9] = a[9][1];
a[9][2] += (a[9][4] + a[4][2] - a[9][2]) * (a[9][4] + a[4][2] < a[9][2]);
a[2][9] = a[9][2];
a[9][3] += (a[9][4] + a[4][3] - a[9][3]) * (a[9][4] + a[4][3] < a[9][3]);
a[3][9] = a[9][3];
a[9][4] += (a[9][4] + a[4][4] - a[9][4]) * (a[9][4] + a[4][4] < a[9][4]);
a[4][9] = a[9][4];
a[9][5] += (a[9][4] + a[4][5] - a[9][5]) * (a[9][4] + a[4][5] < a[9][5]);
a[5][9] = a[9][5];
a[9][6] += (a[9][4] + a[4][6] - a[9][6]) * (a[9][4] + a[4][6] < a[9][6]);
a[6][9] = a[9][6];
a[9][7] += (a[9][4] + a[4][7] - a[9][7]) * (a[9][4] + a[4][7] < a[9][7]);
a[7][9] = a[9][7];
a[9][8] += (a[9][4] + a[4][8] - a[9][8]) * (a[9][4] + a[4][8] < a[9][8]);
a[8][9] = a[9][8];
a[1][0] += (a[1][5] + a[5][0] - a[1][0]) * (a[1][5] + a[5][0] < a[1][0]);
a[0][1] = a[1][0];
a[2][0] += (a[2][5] + a[5][0] - a[2][0]) * (a[2][5] + a[5][0] < a[2][0]);
a[0][2] = a[2][0];
a[2][1] += (a[2][5] + a[5][1] - a[2][1]) * (a[2][5] + a[5][1] < a[2][1]);
a[1][2] = a[2][1];
a[3][0] += (a[3][5] + a[5][0] - a[3][0]) * (a[3][5] + a[5][0] < a[3][0]);
a[0][3] = a[3][0];
a[3][1] += (a[3][5] + a[5][1] - a[3][1]) * (a[3][5] + a[5][1] < a[3][1]);
a[1][3] = a[3][1];
a[3][2] += (a[3][5] + a[5][2] - a[3][2]) * (a[3][5] + a[5][2] < a[3][2]);
a[2][3] = a[3][2];
a[4][0] += (a[4][5] + a[5][0] - a[4][0]) * (a[4][5] + a[5][0] < a[4][0]);
a[0][4] = a[4][0];
a[4][1] += (a[4][5] + a[5][1] - a[4][1]) * (a[4][5] + a[5][1] < a[4][1]);
a[1][4] = a[4][1];
a[4][2] += (a[4][5] + a[5][2] - a[4][2]) * (a[4][5] + a[5][2] < a[4][2]);
a[2][4] = a[4][2];
a[4][3] += (a[4][5] + a[5][3] - a[4][3]) * (a[4][5] + a[5][3] < a[4][3]);
a[3][4] = a[4][3];
a[5][0] += (a[5][5] + a[5][0] - a[5][0]) * (a[5][5] + a[5][0] < a[5][0]);
a[0][5] = a[5][0];
a[5][1] += (a[5][5] + a[5][1] - a[5][1]) * (a[5][5] + a[5][1] < a[5][1]);
a[1][5] = a[5][1];
a[5][2] += (a[5][5] + a[5][2] - a[5][2]) * (a[5][5] + a[5][2] < a[5][2]);
a[2][5] = a[5][2];
a[5][3] += (a[5][5] + a[5][3] - a[5][3]) * (a[5][5] + a[5][3] < a[5][3]);
a[3][5] = a[5][3];
a[5][4] += (a[5][5] + a[5][4] - a[5][4]) * (a[5][5] + a[5][4] < a[5][4]);
a[4][5] = a[5][4];
a[6][0] += (a[6][5] + a[5][0] - a[6][0]) * (a[6][5] + a[5][0] < a[6][0]);
a[0][6] = a[6][0];
a[6][1] += (a[6][5] + a[5][1] - a[6][1]) * (a[6][5] + a[5][1] < a[6][1]);
a[1][6] = a[6][1];
a[6][2] += (a[6][5] + a[5][2] - a[6][2]) * (a[6][5] + a[5][2] < a[6][2]);
a[2][6] = a[6][2];
a[6][3] += (a[6][5] + a[5][3] - a[6][3]) * (a[6][5] + a[5][3] < a[6][3]);
a[3][6] = a[6][3];
a[6][4] += (a[6][5] + a[5][4] - a[6][4]) * (a[6][5] + a[5][4] < a[6][4]);
a[4][6] = a[6][4];
a[6][5] += (a[6][5] + a[5][5] - a[6][5]) * (a[6][5] + a[5][5] < a[6][5]);
a[5][6] = a[6][5];
a[7][0] += (a[7][5] + a[5][0] - a[7][0]) * (a[7][5] + a[5][0] < a[7][0]);
a[0][7] = a[7][0];
a[7][1] += (a[7][5] + a[5][1] - a[7][1]) * (a[7][5] + a[5][1] < a[7][1]);
a[1][7] = a[7][1];
a[7][2] += (a[7][5] + a[5][2] - a[7][2]) * (a[7][5] + a[5][2] < a[7][2]);
a[2][7] = a[7][2];
a[7][3] += (a[7][5] + a[5][3] - a[7][3]) * (a[7][5] + a[5][3] < a[7][3]);
a[3][7] = a[7][3];
a[7][4] += (a[7][5] + a[5][4] - a[7][4]) * (a[7][5] + a[5][4] < a[7][4]);
a[4][7] = a[7][4];
a[7][5] += (a[7][5] + a[5][5] - a[7][5]) * (a[7][5] + a[5][5] < a[7][5]);
a[5][7] = a[7][5];
a[7][6] += (a[7][5] + a[5][6] - a[7][6]) * (a[7][5] + a[5][6] < a[7][6]);
a[6][7] = a[7][6];
a[8][0] += (a[8][5] + a[5][0] - a[8][0]) * (a[8][5] + a[5][0] < a[8][0]);
a[0][8] = a[8][0];
a[8][1] += (a[8][5] + a[5][1] - a[8][1]) * (a[8][5] + a[5][1] < a[8][1]);
a[1][8] = a[8][1];
a[8][2] += (a[8][5] + a[5][2] - a[8][2]) * (a[8][5] + a[5][2] < a[8][2]);
a[2][8] = a[8][2];
a[8][3] += (a[8][5] + a[5][3] - a[8][3]) * (a[8][5] + a[5][3] < a[8][3]);
a[3][8] = a[8][3];
a[8][4] += (a[8][5] + a[5][4] - a[8][4]) * (a[8][5] + a[5][4] < a[8][4]);
a[4][8] = a[8][4];
a[8][5] += (a[8][5] + a[5][5] - a[8][5]) * (a[8][5] + a[5][5] < a[8][5]);
a[5][8] = a[8][5];
a[8][6] += (a[8][5] + a[5][6] - a[8][6]) * (a[8][5] + a[5][6] < a[8][6]);
a[6][8] = a[8][6];
a[8][7] += (a[8][5] + a[5][7] - a[8][7]) * (a[8][5] + a[5][7] < a[8][7]);
a[7][8] = a[8][7];
a[9][0] += (a[9][5] + a[5][0] - a[9][0]) * (a[9][5] + a[5][0] < a[9][0]);
a[0][9] = a[9][0];
a[9][1] += (a[9][5] + a[5][1] - a[9][1]) * (a[9][5] + a[5][1] < a[9][1]);
a[1][9] = a[9][1];
a[9][2] += (a[9][5] + a[5][2] - a[9][2]) * (a[9][5] + a[5][2] < a[9][2]);
a[2][9] = a[9][2];
a[9][3] += (a[9][5] + a[5][3] - a[9][3]) * (a[9][5] + a[5][3] < a[9][3]);
a[3][9] = a[9][3];
a[9][4] += (a[9][5] + a[5][4] - a[9][4]) * (a[9][5] + a[5][4] < a[9][4]);
a[4][9] = a[9][4];
a[9][5] += (a[9][5] + a[5][5] - a[9][5]) * (a[9][5] + a[5][5] < a[9][5]);
a[5][9] = a[9][5];
a[9][6] += (a[9][5] + a[5][6] - a[9][6]) * (a[9][5] + a[5][6] < a[9][6]);
a[6][9] = a[9][6];
a[9][7] += (a[9][5] + a[5][7] - a[9][7]) * (a[9][5] + a[5][7] < a[9][7]);
a[7][9] = a[9][7];
a[9][8] += (a[9][5] + a[5][8] - a[9][8]) * (a[9][5] + a[5][8] < a[9][8]);
a[8][9] = a[9][8];
a[1][0] += (a[1][6] + a[6][0] - a[1][0]) * (a[1][6] + a[6][0] < a[1][0]);
a[0][1] = a[1][0];
a[2][0] += (a[2][6] + a[6][0] - a[2][0]) * (a[2][6] + a[6][0] < a[2][0]);
a[0][2] = a[2][0];
a[2][1] += (a[2][6] + a[6][1] - a[2][1]) * (a[2][6] + a[6][1] < a[2][1]);
a[1][2] = a[2][1];
a[3][0] += (a[3][6] + a[6][0] - a[3][0]) * (a[3][6] + a[6][0] < a[3][0]);
a[0][3] = a[3][0];
a[3][1] += (a[3][6] + a[6][1] - a[3][1]) * (a[3][6] + a[6][1] < a[3][1]);
a[1][3] = a[3][1];
a[3][2] += (a[3][6] + a[6][2] - a[3][2]) * (a[3][6] + a[6][2] < a[3][2]);
a[2][3] = a[3][2];
a[4][0] += (a[4][6] + a[6][0] - a[4][0]) * (a[4][6] + a[6][0] < a[4][0]);
a[0][4] = a[4][0];
a[4][1] += (a[4][6] + a[6][1] - a[4][1]) * (a[4][6] + a[6][1] < a[4][1]);
a[1][4] = a[4][1];
a[4][2] += (a[4][6] + a[6][2] - a[4][2]) * (a[4][6] + a[6][2] < a[4][2]);
a[2][4] = a[4][2];
a[4][3] += (a[4][6] + a[6][3] - a[4][3]) * (a[4][6] + a[6][3] < a[4][3]);
a[3][4] = a[4][3];
a[5][0] += (a[5][6] + a[6][0] - a[5][0]) * (a[5][6] + a[6][0] < a[5][0]);
a[0][5] = a[5][0];
a[5][1] += (a[5][6] + a[6][1] - a[5][1]) * (a[5][6] + a[6][1] < a[5][1]);
a[1][5] = a[5][1];
a[5][2] += (a[5][6] + a[6][2] - a[5][2]) * (a[5][6] + a[6][2] < a[5][2]);
a[2][5] = a[5][2];
a[5][3] += (a[5][6] + a[6][3] - a[5][3]) * (a[5][6] + a[6][3] < a[5][3]);
a[3][5] = a[5][3];
a[5][4] += (a[5][6] + a[6][4] - a[5][4]) * (a[5][6] + a[6][4] < a[5][4]);
a[4][5] = a[5][4];
a[6][0] += (a[6][6] + a[6][0] - a[6][0]) * (a[6][6] + a[6][0] < a[6][0]);
a[0][6] = a[6][0];
a[6][1] += (a[6][6] + a[6][1] - a[6][1]) * (a[6][6] + a[6][1] < a[6][1]);
a[1][6] = a[6][1];
a[6][2] += (a[6][6] + a[6][2] - a[6][2]) * (a[6][6] + a[6][2] < a[6][2]);
a[2][6] = a[6][2];
a[6][3] += (a[6][6] + a[6][3] - a[6][3]) * (a[6][6] + a[6][3] < a[6][3]);
a[3][6] = a[6][3];
a[6][4] += (a[6][6] + a[6][4] - a[6][4]) * (a[6][6] + a[6][4] < a[6][4]);
a[4][6] = a[6][4];
a[6][5] += (a[6][6] + a[6][5] - a[6][5]) * (a[6][6] + a[6][5] < a[6][5]);
a[5][6] = a[6][5];
a[7][0] += (a[7][6] + a[6][0] - a[7][0]) * (a[7][6] + a[6][0] < a[7][0]);
a[0][7] = a[7][0];
a[7][1] += (a[7][6] + a[6][1] - a[7][1]) * (a[7][6] + a[6][1] < a[7][1]);
a[1][7] = a[7][1];
a[7][2] += (a[7][6] + a[6][2] - a[7][2]) * (a[7][6] + a[6][2] < a[7][2]);
a[2][7] = a[7][2];
a[7][3] += (a[7][6] + a[6][3] - a[7][3]) * (a[7][6] + a[6][3] < a[7][3]);
a[3][7] = a[7][3];
a[7][4] += (a[7][6] + a[6][4] - a[7][4]) * (a[7][6] + a[6][4] < a[7][4]);
a[4][7] = a[7][4];
a[7][5] += (a[7][6] + a[6][5] - a[7][5]) * (a[7][6] + a[6][5] < a[7][5]);
a[5][7] = a[7][5];
a[7][6] += (a[7][6] + a[6][6] - a[7][6]) * (a[7][6] + a[6][6] < a[7][6]);
a[6][7] = a[7][6];
a[8][0] += (a[8][6] + a[6][0] - a[8][0]) * (a[8][6] + a[6][0] < a[8][0]);
a[0][8] = a[8][0];
a[8][1] += (a[8][6] + a[6][1] - a[8][1]) * (a[8][6] + a[6][1] < a[8][1]);
a[1][8] = a[8][1];
a[8][2] += (a[8][6] + a[6][2] - a[8][2]) * (a[8][6] + a[6][2] < a[8][2]);
a[2][8] = a[8][2];
a[8][3] += (a[8][6] + a[6][3] - a[8][3]) * (a[8][6] + a[6][3] < a[8][3]);
a[3][8] = a[8][3];
a[8][4] += (a[8][6] + a[6][4] - a[8][4]) * (a[8][6] + a[6][4] < a[8][4]);
a[4][8] = a[8][4];
a[8][5] += (a[8][6] + a[6][5] - a[8][5]) * (a[8][6] + a[6][5] < a[8][5]);
a[5][8] = a[8][5];
a[8][6] += (a[8][6] + a[6][6] - a[8][6]) * (a[8][6] + a[6][6] < a[8][6]);
a[6][8] = a[8][6];
a[8][7] += (a[8][6] + a[6][7] - a[8][7]) * (a[8][6] + a[6][7] < a[8][7]);
a[7][8] = a[8][7];
a[9][0] += (a[9][6] + a[6][0] - a[9][0]) * (a[9][6] + a[6][0] < a[9][0]);
a[0][9] = a[9][0];
a[9][1] += (a[9][6] + a[6][1] - a[9][1]) * (a[9][6] + a[6][1] < a[9][1]);
a[1][9] = a[9][1];
a[9][2] += (a[9][6] + a[6][2] - a[9][2]) * (a[9][6] + a[6][2] < a[9][2]);
a[2][9] = a[9][2];
a[9][3] += (a[9][6] + a[6][3] - a[9][3]) * (a[9][6] + a[6][3] < a[9][3]);
a[3][9] = a[9][3];
a[9][4] += (a[9][6] + a[6][4] - a[9][4]) * (a[9][6] + a[6][4] < a[9][4]);
a[4][9] = a[9][4];
a[9][5] += (a[9][6] + a[6][5] - a[9][5]) * (a[9][6] + a[6][5] < a[9][5]);
a[5][9] = a[9][5];
a[9][6] += (a[9][6] + a[6][6] - a[9][6]) * (a[9][6] + a[6][6] < a[9][6]);
a[6][9] = a[9][6];
a[9][7] += (a[9][6] + a[6][7] - a[9][7]) * (a[9][6] + a[6][7] < a[9][7]);
a[7][9] = a[9][7];
a[9][8] += (a[9][6] + a[6][8] - a[9][8]) * (a[9][6] + a[6][8] < a[9][8]);
a[8][9] = a[9][8];
a[1][0] += (a[1][7] + a[7][0] - a[1][0]) * (a[1][7] + a[7][0] < a[1][0]);
a[0][1] = a[1][0];
a[2][0] += (a[2][7] + a[7][0] - a[2][0]) * (a[2][7] + a[7][0] < a[2][0]);
a[0][2] = a[2][0];
a[2][1] += (a[2][7] + a[7][1] - a[2][1]) * (a[2][7] + a[7][1] < a[2][1]);
a[1][2] = a[2][1];
a[3][0] += (a[3][7] + a[7][0] - a[3][0]) * (a[3][7] + a[7][0] < a[3][0]);
a[0][3] = a[3][0];
a[3][1] += (a[3][7] + a[7][1] - a[3][1]) * (a[3][7] + a[7][1] < a[3][1]);
a[1][3] = a[3][1];
a[3][2] += (a[3][7] + a[7][2] - a[3][2]) * (a[3][7] + a[7][2] < a[3][2]);
a[2][3] = a[3][2];
a[4][0] += (a[4][7] + a[7][0] - a[4][0]) * (a[4][7] + a[7][0] < a[4][0]);
a[0][4] = a[4][0];
a[4][1] += (a[4][7] + a[7][1] - a[4][1]) * (a[4][7] + a[7][1] < a[4][1]);
a[1][4] = a[4][1];
a[4][2] += (a[4][7] + a[7][2] - a[4][2]) * (a[4][7] + a[7][2] < a[4][2]);
a[2][4] = a[4][2];
a[4][3] += (a[4][7] + a[7][3] - a[4][3]) * (a[4][7] + a[7][3] < a[4][3]);
a[3][4] = a[4][3];
a[5][0] += (a[5][7] + a[7][0] - a[5][0]) * (a[5][7] + a[7][0] < a[5][0]);
a[0][5] = a[5][0];
a[5][1] += (a[5][7] + a[7][1] - a[5][1]) * (a[5][7] + a[7][1] < a[5][1]);
a[1][5] = a[5][1];
a[5][2] += (a[5][7] + a[7][2] - a[5][2]) * (a[5][7] + a[7][2] < a[5][2]);
a[2][5] = a[5][2];
a[5][3] += (a[5][7] + a[7][3] - a[5][3]) * (a[5][7] + a[7][3] < a[5][3]);
a[3][5] = a[5][3];
a[5][4] += (a[5][7] + a[7][4] - a[5][4]) * (a[5][7] + a[7][4] < a[5][4]);
a[4][5] = a[5][4];
a[6][0] += (a[6][7] + a[7][0] - a[6][0]) * (a[6][7] + a[7][0] < a[6][0]);
a[0][6] = a[6][0];
a[6][1] += (a[6][7] + a[7][1] - a[6][1]) * (a[6][7] + a[7][1] < a[6][1]);
a[1][6] = a[6][1];
a[6][2] += (a[6][7] + a[7][2] - a[6][2]) * (a[6][7] + a[7][2] < a[6][2]);
a[2][6] = a[6][2];
a[6][3] += (a[6][7] + a[7][3] - a[6][3]) * (a[6][7] + a[7][3] < a[6][3]);
a[3][6] = a[6][3];
a[6][4] += (a[6][7] + a[7][4] - a[6][4]) * (a[6][7] + a[7][4] < a[6][4]);
a[4][6] = a[6][4];
a[6][5] += (a[6][7] + a[7][5] - a[6][5]) * (a[6][7] + a[7][5] < a[6][5]);
a[5][6] = a[6][5];
a[7][0] += (a[7][7] + a[7][0] - a[7][0]) * (a[7][7] + a[7][0] < a[7][0]);
a[0][7] = a[7][0];
a[7][1] += (a[7][7] + a[7][1] - a[7][1]) * (a[7][7] + a[7][1] < a[7][1]);
a[1][7] = a[7][1];
a[7][2] += (a[7][7] + a[7][2] - a[7][2]) * (a[7][7] + a[7][2] < a[7][2]);
a[2][7] = a[7][2];
a[7][3] += (a[7][7] + a[7][3] - a[7][3]) * (a[7][7] + a[7][3] < a[7][3]);
a[3][7] = a[7][3];
a[7][4] += (a[7][7] + a[7][4] - a[7][4]) * (a[7][7] + a[7][4] < a[7][4]);
a[4][7] = a[7][4];
a[7][5] += (a[7][7] + a[7][5] - a[7][5]) * (a[7][7] + a[7][5] < a[7][5]);
a[5][7] = a[7][5];
a[7][6] += (a[7][7] + a[7][6] - a[7][6]) * (a[7][7] + a[7][6] < a[7][6]);
a[6][7] = a[7][6];
a[8][0] += (a[8][7] + a[7][0] - a[8][0]) * (a[8][7] + a[7][0] < a[8][0]);
a[0][8] = a[8][0];
a[8][1] += (a[8][7] + a[7][1] - a[8][1]) * (a[8][7] + a[7][1] < a[8][1]);
a[1][8] = a[8][1];
a[8][2] += (a[8][7] + a[7][2] - a[8][2]) * (a[8][7] + a[7][2] < a[8][2]);
a[2][8] = a[8][2];
a[8][3] += (a[8][7] + a[7][3] - a[8][3]) * (a[8][7] + a[7][3] < a[8][3]);
a[3][8] = a[8][3];
a[8][4] += (a[8][7] + a[7][4] - a[8][4]) * (a[8][7] + a[7][4] < a[8][4]);
a[4][8] = a[8][4];
a[8][5] += (a[8][7] + a[7][5] - a[8][5]) * (a[8][7] + a[7][5] < a[8][5]);
a[5][8] = a[8][5];
a[8][6] += (a[8][7] + a[7][6] - a[8][6]) * (a[8][7] + a[7][6] < a[8][6]);
a[6][8] = a[8][6];
a[8][7] += (a[8][7] + a[7][7] - a[8][7]) * (a[8][7] + a[7][7] < a[8][7]);
a[7][8] = a[8][7];
a[9][0] += (a[9][7] + a[7][0] - a[9][0]) * (a[9][7] + a[7][0] < a[9][0]);
a[0][9] = a[9][0];
a[9][1] += (a[9][7] + a[7][1] - a[9][1]) * (a[9][7] + a[7][1] < a[9][1]);
a[1][9] = a[9][1];
a[9][2] += (a[9][7] + a[7][2] - a[9][2]) * (a[9][7] + a[7][2] < a[9][2]);
a[2][9] = a[9][2];
a[9][3] += (a[9][7] + a[7][3] - a[9][3]) * (a[9][7] + a[7][3] < a[9][3]);
a[3][9] = a[9][3];
a[9][4] += (a[9][7] + a[7][4] - a[9][4]) * (a[9][7] + a[7][4] < a[9][4]);
a[4][9] = a[9][4];
a[9][5] += (a[9][7] + a[7][5] - a[9][5]) * (a[9][7] + a[7][5] < a[9][5]);
a[5][9] = a[9][5];
a[9][6] += (a[9][7] + a[7][6] - a[9][6]) * (a[9][7] + a[7][6] < a[9][6]);
a[6][9] = a[9][6];
a[9][7] += (a[9][7] + a[7][7] - a[9][7]) * (a[9][7] + a[7][7] < a[9][7]);
a[7][9] = a[9][7];
a[9][8] += (a[9][7] + a[7][8] - a[9][8]) * (a[9][7] + a[7][8] < a[9][8]);
a[8][9] = a[9][8];
a[1][0] += (a[1][8] + a[8][0] - a[1][0]) * (a[1][8] + a[8][0] < a[1][0]);
a[0][1] = a[1][0];
a[2][0] += (a[2][8] + a[8][0] - a[2][0]) * (a[2][8] + a[8][0] < a[2][0]);
a[0][2] = a[2][0];
a[2][1] += (a[2][8] + a[8][1] - a[2][1]) * (a[2][8] + a[8][1] < a[2][1]);
a[1][2] = a[2][1];
a[3][0] += (a[3][8] + a[8][0] - a[3][0]) * (a[3][8] + a[8][0] < a[3][0]);
a[0][3] = a[3][0];
a[3][1] += (a[3][8] + a[8][1] - a[3][1]) * (a[3][8] + a[8][1] < a[3][1]);
a[1][3] = a[3][1];
a[3][2] += (a[3][8] + a[8][2] - a[3][2]) * (a[3][8] + a[8][2] < a[3][2]);
a[2][3] = a[3][2];
a[4][0] += (a[4][8] + a[8][0] - a[4][0]) * (a[4][8] + a[8][0] < a[4][0]);
a[0][4] = a[4][0];
a[4][1] += (a[4][8] + a[8][1] - a[4][1]) * (a[4][8] + a[8][1] < a[4][1]);
a[1][4] = a[4][1];
a[4][2] += (a[4][8] + a[8][2] - a[4][2]) * (a[4][8] + a[8][2] < a[4][2]);
a[2][4] = a[4][2];
a[4][3] += (a[4][8] + a[8][3] - a[4][3]) * (a[4][8] + a[8][3] < a[4][3]);
a[3][4] = a[4][3];
a[5][0] += (a[5][8] + a[8][0] - a[5][0]) * (a[5][8] + a[8][0] < a[5][0]);
a[0][5] = a[5][0];
a[5][1] += (a[5][8] + a[8][1] - a[5][1]) * (a[5][8] + a[8][1] < a[5][1]);
a[1][5] = a[5][1];
a[5][2] += (a[5][8] + a[8][2] - a[5][2]) * (a[5][8] + a[8][2] < a[5][2]);
a[2][5] = a[5][2];
a[5][3] += (a[5][8] + a[8][3] - a[5][3]) * (a[5][8] + a[8][3] < a[5][3]);
a[3][5] = a[5][3];
a[5][4] += (a[5][8] + a[8][4] - a[5][4]) * (a[5][8] + a[8][4] < a[5][4]);
a[4][5] = a[5][4];
a[6][0] += (a[6][8] + a[8][0] - a[6][0]) * (a[6][8] + a[8][0] < a[6][0]);
a[0][6] = a[6][0];
a[6][1] += (a[6][8] + a[8][1] - a[6][1]) * (a[6][8] + a[8][1] < a[6][1]);
a[1][6] = a[6][1];
a[6][2] += (a[6][8] + a[8][2] - a[6][2]) * (a[6][8] + a[8][2] < a[6][2]);
a[2][6] = a[6][2];
a[6][3] += (a[6][8] + a[8][3] - a[6][3]) * (a[6][8] + a[8][3] < a[6][3]);
a[3][6] = a[6][3];
a[6][4] += (a[6][8] + a[8][4] - a[6][4]) * (a[6][8] + a[8][4] < a[6][4]);
a[4][6] = a[6][4];
a[6][5] += (a[6][8] + a[8][5] - a[6][5]) * (a[6][8] + a[8][5] < a[6][5]);
a[5][6] = a[6][5];
a[7][0] += (a[7][8] + a[8][0] - a[7][0]) * (a[7][8] + a[8][0] < a[7][0]);
a[0][7] = a[7][0];
a[7][1] += (a[7][8] + a[8][1] - a[7][1]) * (a[7][8] + a[8][1] < a[7][1]);
a[1][7] = a[7][1];
a[7][2] += (a[7][8] + a[8][2] - a[7][2]) * (a[7][8] + a[8][2] < a[7][2]);
a[2][7] = a[7][2];
a[7][3] += (a[7][8] + a[8][3] - a[7][3]) * (a[7][8] + a[8][3] < a[7][3]);
a[3][7] = a[7][3];
a[7][4] += (a[7][8] + a[8][4] - a[7][4]) * (a[7][8] + a[8][4] < a[7][4]);
a[4][7] = a[7][4];
a[7][5] += (a[7][8] + a[8][5] - a[7][5]) * (a[7][8] + a[8][5] < a[7][5]);
a[5][7] = a[7][5];
a[7][6] += (a[7][8] + a[8][6] - a[7][6]) * (a[7][8] + a[8][6] < a[7][6]);
a[6][7] = a[7][6];
a[8][0] += (a[8][8] + a[8][0] - a[8][0]) * (a[8][8] + a[8][0] < a[8][0]);
a[0][8] = a[8][0];
a[8][1] += (a[8][8] + a[8][1] - a[8][1]) * (a[8][8] + a[8][1] < a[8][1]);
a[1][8] = a[8][1];
a[8][2] += (a[8][8] + a[8][2] - a[8][2]) * (a[8][8] + a[8][2] < a[8][2]);
a[2][8] = a[8][2];
a[8][3] += (a[8][8] + a[8][3] - a[8][3]) * (a[8][8] + a[8][3] < a[8][3]);
a[3][8] = a[8][3];
a[8][4] += (a[8][8] + a[8][4] - a[8][4]) * (a[8][8] + a[8][4] < a[8][4]);
a[4][8] = a[8][4];
a[8][5] += (a[8][8] + a[8][5] - a[8][5]) * (a[8][8] + a[8][5] < a[8][5]);
a[5][8] = a[8][5];
a[8][6] += (a[8][8] + a[8][6] - a[8][6]) * (a[8][8] + a[8][6] < a[8][6]);
a[6][8] = a[8][6];
a[8][7] += (a[8][8] + a[8][7] - a[8][7]) * (a[8][8] + a[8][7] < a[8][7]);
a[7][8] = a[8][7];
a[9][0] += (a[9][8] + a[8][0] - a[9][0]) * (a[9][8] + a[8][0] < a[9][0]);
a[0][9] = a[9][0];
a[9][1] += (a[9][8] + a[8][1] - a[9][1]) * (a[9][8] + a[8][1] < a[9][1]);
a[1][9] = a[9][1];
a[9][2] += (a[9][8] + a[8][2] - a[9][2]) * (a[9][8] + a[8][2] < a[9][2]);
a[2][9] = a[9][2];
a[9][3] += (a[9][8] + a[8][3] - a[9][3]) * (a[9][8] + a[8][3] < a[9][3]);
a[3][9] = a[9][3];
a[9][4] += (a[9][8] + a[8][4] - a[9][4]) * (a[9][8] + a[8][4] < a[9][4]);
a[4][9] = a[9][4];
a[9][5] += (a[9][8] + a[8][5] - a[9][5]) * (a[9][8] + a[8][5] < a[9][5]);
a[5][9] = a[9][5];
a[9][6] += (a[9][8] + a[8][6] - a[9][6]) * (a[9][8] + a[8][6] < a[9][6]);
a[6][9] = a[9][6];
a[9][7] += (a[9][8] + a[8][7] - a[9][7]) * (a[9][8] + a[8][7] < a[9][7]);
a[7][9] = a[9][7];
a[9][8] += (a[9][8] + a[8][8] - a[9][8]) * (a[9][8] + a[8][8] < a[9][8]);
a[8][9] = a[9][8];
a[1][0] += (a[1][9] + a[9][0] - a[1][0]) * (a[1][9] + a[9][0] < a[1][0]);
a[0][1] = a[1][0];
a[2][0] += (a[2][9] + a[9][0] - a[2][0]) * (a[2][9] + a[9][0] < a[2][0]);
a[0][2] = a[2][0];
a[2][1] += (a[2][9] + a[9][1] - a[2][1]) * (a[2][9] + a[9][1] < a[2][1]);
a[1][2] = a[2][1];
a[3][0] += (a[3][9] + a[9][0] - a[3][0]) * (a[3][9] + a[9][0] < a[3][0]);
a[0][3] = a[3][0];
a[3][1] += (a[3][9] + a[9][1] - a[3][1]) * (a[3][9] + a[9][1] < a[3][1]);
a[1][3] = a[3][1];
a[3][2] += (a[3][9] + a[9][2] - a[3][2]) * (a[3][9] + a[9][2] < a[3][2]);
a[2][3] = a[3][2];
a[4][0] += (a[4][9] + a[9][0] - a[4][0]) * (a[4][9] + a[9][0] < a[4][0]);
a[0][4] = a[4][0];
a[4][1] += (a[4][9] + a[9][1] - a[4][1]) * (a[4][9] + a[9][1] < a[4][1]);
a[1][4] = a[4][1];
a[4][2] += (a[4][9] + a[9][2] - a[4][2]) * (a[4][9] + a[9][2] < a[4][2]);
a[2][4] = a[4][2];
a[4][3] += (a[4][9] + a[9][3] - a[4][3]) * (a[4][9] + a[9][3] < a[4][3]);
a[3][4] = a[4][3];
a[5][0] += (a[5][9] + a[9][0] - a[5][0]) * (a[5][9] + a[9][0] < a[5][0]);
a[0][5] = a[5][0];
a[5][1] += (a[5][9] + a[9][1] - a[5][1]) * (a[5][9] + a[9][1] < a[5][1]);
a[1][5] = a[5][1];
a[5][2] += (a[5][9] + a[9][2] - a[5][2]) * (a[5][9] + a[9][2] < a[5][2]);
a[2][5] = a[5][2];
a[5][3] += (a[5][9] + a[9][3] - a[5][3]) * (a[5][9] + a[9][3] < a[5][3]);
a[3][5] = a[5][3];
a[5][4] += (a[5][9] + a[9][4] - a[5][4]) * (a[5][9] + a[9][4] < a[5][4]);
a[4][5] = a[5][4];
a[6][0] += (a[6][9] + a[9][0] - a[6][0]) * (a[6][9] + a[9][0] < a[6][0]);
a[0][6] = a[6][0];
a[6][1] += (a[6][9] + a[9][1] - a[6][1]) * (a[6][9] + a[9][1] < a[6][1]);
a[1][6] = a[6][1];
a[6][2] += (a[6][9] + a[9][2] - a[6][2]) * (a[6][9] + a[9][2] < a[6][2]);
a[2][6] = a[6][2];
a[6][3] += (a[6][9] + a[9][3] - a[6][3]) * (a[6][9] + a[9][3] < a[6][3]);
a[3][6] = a[6][3];
a[6][4] += (a[6][9] + a[9][4] - a[6][4]) * (a[6][9] + a[9][4] < a[6][4]);
a[4][6] = a[6][4];
a[6][5] += (a[6][9] + a[9][5] - a[6][5]) * (a[6][9] + a[9][5] < a[6][5]);
a[5][6] = a[6][5];
a[7][0] += (a[7][9] + a[9][0] - a[7][0]) * (a[7][9] + a[9][0] < a[7][0]);
a[0][7] = a[7][0];
a[7][1] += (a[7][9] + a[9][1] - a[7][1]) * (a[7][9] + a[9][1] < a[7][1]);
a[1][7] = a[7][1];
a[7][2] += (a[7][9] + a[9][2] - a[7][2]) * (a[7][9] + a[9][2] < a[7][2]);
a[2][7] = a[7][2];
a[7][3] += (a[7][9] + a[9][3] - a[7][3]) * (a[7][9] + a[9][3] < a[7][3]);
a[3][7] = a[7][3];
a[7][4] += (a[7][9] + a[9][4] - a[7][4]) * (a[7][9] + a[9][4] < a[7][4]);
a[4][7] = a[7][4];
a[7][5] += (a[7][9] + a[9][5] - a[7][5]) * (a[7][9] + a[9][5] < a[7][5]);
a[5][7] = a[7][5];
a[7][6] += (a[7][9] + a[9][6] - a[7][6]) * (a[7][9] + a[9][6] < a[7][6]);
a[6][7] = a[7][6];
a[8][0] += (a[8][9] + a[9][0] - a[8][0]) * (a[8][9] + a[9][0] < a[8][0]);
a[0][8] = a[8][0];
a[8][1] += (a[8][9] + a[9][1] - a[8][1]) * (a[8][9] + a[9][1] < a[8][1]);
a[1][8] = a[8][1];
a[8][2] += (a[8][9] + a[9][2] - a[8][2]) * (a[8][9] + a[9][2] < a[8][2]);
a[2][8] = a[8][2];
a[8][3] += (a[8][9] + a[9][3] - a[8][3]) * (a[8][9] + a[9][3] < a[8][3]);
a[3][8] = a[8][3];
a[8][4] += (a[8][9] + a[9][4] - a[8][4]) * (a[8][9] + a[9][4] < a[8][4]);
a[4][8] = a[8][4];
a[8][5] += (a[8][9] + a[9][5] - a[8][5]) * (a[8][9] + a[9][5] < a[8][5]);
a[5][8] = a[8][5];
a[8][6] += (a[8][9] + a[9][6] - a[8][6]) * (a[8][9] + a[9][6] < a[8][6]);
a[6][8] = a[8][6];
a[8][7] += (a[8][9] + a[9][7] - a[8][7]) * (a[8][9] + a[9][7] < a[8][7]);
a[7][8] = a[8][7];
a[9][0] += (a[9][9] + a[9][0] - a[9][0]) * (a[9][9] + a[9][0] < a[9][0]);
a[0][9] = a[9][0];
a[9][1] += (a[9][9] + a[9][1] - a[9][1]) * (a[9][9] + a[9][1] < a[9][1]);
a[1][9] = a[9][1];
a[9][2] += (a[9][9] + a[9][2] - a[9][2]) * (a[9][9] + a[9][2] < a[9][2]);
a[2][9] = a[9][2];
a[9][3] += (a[9][9] + a[9][3] - a[9][3]) * (a[9][9] + a[9][3] < a[9][3]);
a[3][9] = a[9][3];
a[9][4] += (a[9][9] + a[9][4] - a[9][4]) * (a[9][9] + a[9][4] < a[9][4]);
a[4][9] = a[9][4];
a[9][5] += (a[9][9] + a[9][5] - a[9][5]) * (a[9][9] + a[9][5] < a[9][5]);
a[5][9] = a[9][5];
a[9][6] += (a[9][9] + a[9][6] - a[9][6]) * (a[9][9] + a[9][6] < a[9][6]);
a[6][9] = a[9][6];
a[9][7] += (a[9][9] + a[9][7] - a[9][7]) * (a[9][9] + a[9][7] < a[9][7]);
a[7][9] = a[9][7];
a[9][8] += (a[9][9] + a[9][8] - a[9][8]) * (a[9][9] + a[9][8] < a[9][8]);
a[8][9] = a[9][8];
int mx = 0;
mx += (a[0][0] - mx) * (mx < a[0][0]) * (0 < n) * (0 < n);
mx += (a[0][1] - mx) * (mx < a[0][1]) * (0 < n) * (1 < n);
mx += (a[0][2] - mx) * (mx < a[0][2]) * (0 < n) * (2 < n);
mx += (a[0][3] - mx) * (mx < a[0][3]) * (0 < n) * (3 < n);
mx += (a[0][4] - mx) * (mx < a[0][4]) * (0 < n) * (4 < n);
mx += (a[0][5] - mx) * (mx < a[0][5]) * (0 < n) * (5 < n);
mx += (a[0][6] - mx) * (mx < a[0][6]) * (0 < n) * (6 < n);
mx += (a[0][7] - mx) * (mx < a[0][7]) * (0 < n) * (7 < n);
mx += (a[0][8] - mx) * (mx < a[0][8]) * (0 < n) * (8 < n);
mx += (a[0][9] - mx) * (mx < a[0][9]) * (0 < n) * (9 < n);
mx += (a[1][0] - mx) * (mx < a[1][0]) * (1 < n) * (0 < n);
mx += (a[1][1] - mx) * (mx < a[1][1]) * (1 < n) * (1 < n);
mx += (a[1][2] - mx) * (mx < a[1][2]) * (1 < n) * (2 < n);
mx += (a[1][3] - mx) * (mx < a[1][3]) * (1 < n) * (3 < n);
mx += (a[1][4] - mx) * (mx < a[1][4]) * (1 < n) * (4 < n);
mx += (a[1][5] - mx) * (mx < a[1][5]) * (1 < n) * (5 < n);
mx += (a[1][6] - mx) * (mx < a[1][6]) * (1 < n) * (6 < n);
mx += (a[1][7] - mx) * (mx < a[1][7]) * (1 < n) * (7 < n);
mx += (a[1][8] - mx) * (mx < a[1][8]) * (1 < n) * (8 < n);
mx += (a[1][9] - mx) * (mx < a[1][9]) * (1 < n) * (9 < n);
mx += (a[2][0] - mx) * (mx < a[2][0]) * (2 < n) * (0 < n);
mx += (a[2][1] - mx) * (mx < a[2][1]) * (2 < n) * (1 < n);
mx += (a[2][2] - mx) * (mx < a[2][2]) * (2 < n) * (2 < n);
mx += (a[2][3] - mx) * (mx < a[2][3]) * (2 < n) * (3 < n);
mx += (a[2][4] - mx) * (mx < a[2][4]) * (2 < n) * (4 < n);
mx += (a[2][5] - mx) * (mx < a[2][5]) * (2 < n) * (5 < n);
mx += (a[2][6] - mx) * (mx < a[2][6]) * (2 < n) * (6 < n);
mx += (a[2][7] - mx) * (mx < a[2][7]) * (2 < n) * (7 < n);
mx += (a[2][8] - mx) * (mx < a[2][8]) * (2 < n) * (8 < n);
mx += (a[2][9] - mx) * (mx < a[2][9]) * (2 < n) * (9 < n);
mx += (a[3][0] - mx) * (mx < a[3][0]) * (3 < n) * (0 < n);
mx += (a[3][1] - mx) * (mx < a[3][1]) * (3 < n) * (1 < n);
mx += (a[3][2] - mx) * (mx < a[3][2]) * (3 < n) * (2 < n);
mx += (a[3][3] - mx) * (mx < a[3][3]) * (3 < n) * (3 < n);
mx += (a[3][4] - mx) * (mx < a[3][4]) * (3 < n) * (4 < n);
mx += (a[3][5] - mx) * (mx < a[3][5]) * (3 < n) * (5 < n);
mx += (a[3][6] - mx) * (mx < a[3][6]) * (3 < n) * (6 < n);
mx += (a[3][7] - mx) * (mx < a[3][7]) * (3 < n) * (7 < n);
mx += (a[3][8] - mx) * (mx < a[3][8]) * (3 < n) * (8 < n);
mx += (a[3][9] - mx) * (mx < a[3][9]) * (3 < n) * (9 < n);
mx += (a[4][0] - mx) * (mx < a[4][0]) * (4 < n) * (0 < n);
mx += (a[4][1] - mx) * (mx < a[4][1]) * (4 < n) * (1 < n);
mx += (a[4][2] - mx) * (mx < a[4][2]) * (4 < n) * (2 < n);
mx += (a[4][3] - mx) * (mx < a[4][3]) * (4 < n) * (3 < n);
mx += (a[4][4] - mx) * (mx < a[4][4]) * (4 < n) * (4 < n);
mx += (a[4][5] - mx) * (mx < a[4][5]) * (4 < n) * (5 < n);
mx += (a[4][6] - mx) * (mx < a[4][6]) * (4 < n) * (6 < n);
mx += (a[4][7] - mx) * (mx < a[4][7]) * (4 < n) * (7 < n);
mx += (a[4][8] - mx) * (mx < a[4][8]) * (4 < n) * (8 < n);
mx += (a[4][9] - mx) * (mx < a[4][9]) * (4 < n) * (9 < n);
mx += (a[5][0] - mx) * (mx < a[5][0]) * (5 < n) * (0 < n);
mx += (a[5][1] - mx) * (mx < a[5][1]) * (5 < n) * (1 < n);
mx += (a[5][2] - mx) * (mx < a[5][2]) * (5 < n) * (2 < n);
mx += (a[5][3] - mx) * (mx < a[5][3]) * (5 < n) * (3 < n);
mx += (a[5][4] - mx) * (mx < a[5][4]) * (5 < n) * (4 < n);
mx += (a[5][5] - mx) * (mx < a[5][5]) * (5 < n) * (5 < n);
mx += (a[5][6] - mx) * (mx < a[5][6]) * (5 < n) * (6 < n);
mx += (a[5][7] - mx) * (mx < a[5][7]) * (5 < n) * (7 < n);
mx += (a[5][8] - mx) * (mx < a[5][8]) * (5 < n) * (8 < n);
mx += (a[5][9] - mx) * (mx < a[5][9]) * (5 < n) * (9 < n);
mx += (a[6][0] - mx) * (mx < a[6][0]) * (6 < n) * (0 < n);
mx += (a[6][1] - mx) * (mx < a[6][1]) * (6 < n) * (1 < n);
mx += (a[6][2] - mx) * (mx < a[6][2]) * (6 < n) * (2 < n);
mx += (a[6][3] - mx) * (mx < a[6][3]) * (6 < n) * (3 < n);
mx += (a[6][4] - mx) * (mx < a[6][4]) * (6 < n) * (4 < n);
mx += (a[6][5] - mx) * (mx < a[6][5]) * (6 < n) * (5 < n);
mx += (a[6][6] - mx) * (mx < a[6][6]) * (6 < n) * (6 < n);
mx += (a[6][7] - mx) * (mx < a[6][7]) * (6 < n) * (7 < n);
mx += (a[6][8] - mx) * (mx < a[6][8]) * (6 < n) * (8 < n);
mx += (a[6][9] - mx) * (mx < a[6][9]) * (6 < n) * (9 < n);
mx += (a[7][0] - mx) * (mx < a[7][0]) * (7 < n) * (0 < n);
mx += (a[7][1] - mx) * (mx < a[7][1]) * (7 < n) * (1 < n);
mx += (a[7][2] - mx) * (mx < a[7][2]) * (7 < n) * (2 < n);
mx += (a[7][3] - mx) * (mx < a[7][3]) * (7 < n) * (3 < n);
mx += (a[7][4] - mx) * (mx < a[7][4]) * (7 < n) * (4 < n);
mx += (a[7][5] - mx) * (mx < a[7][5]) * (7 < n) * (5 < n);
mx += (a[7][6] - mx) * (mx < a[7][6]) * (7 < n) * (6 < n);
mx += (a[7][7] - mx) * (mx < a[7][7]) * (7 < n) * (7 < n);
mx += (a[7][8] - mx) * (mx < a[7][8]) * (7 < n) * (8 < n);
mx += (a[7][9] - mx) * (mx < a[7][9]) * (7 < n) * (9 < n);
mx += (a[8][0] - mx) * (mx < a[8][0]) * (8 < n) * (0 < n);
mx += (a[8][1] - mx) * (mx < a[8][1]) * (8 < n) * (1 < n);
mx += (a[8][2] - mx) * (mx < a[8][2]) * (8 < n) * (2 < n);
mx += (a[8][3] - mx) * (mx < a[8][3]) * (8 < n) * (3 < n);
mx += (a[8][4] - mx) * (mx < a[8][4]) * (8 < n) * (4 < n);
mx += (a[8][5] - mx) * (mx < a[8][5]) * (8 < n) * (5 < n);
mx += (a[8][6] - mx) * (mx < a[8][6]) * (8 < n) * (6 < n);
mx += (a[8][7] - mx) * (mx < a[8][7]) * (8 < n) * (7 < n);
mx += (a[8][8] - mx) * (mx < a[8][8]) * (8 < n) * (8 < n);
mx += (a[8][9] - mx) * (mx < a[8][9]) * (8 < n) * (9 < n);
mx += (a[9][0] - mx) * (mx < a[9][0]) * (9 < n) * (0 < n);
mx += (a[9][1] - mx) * (mx < a[9][1]) * (9 < n) * (1 < n);
mx += (a[9][2] - mx) * (mx < a[9][2]) * (9 < n) * (2 < n);
mx += (a[9][3] - mx) * (mx < a[9][3]) * (9 < n) * (3 < n);
mx += (a[9][4] - mx) * (mx < a[9][4]) * (9 < n) * (4 < n);
mx += (a[9][5] - mx) * (mx < a[9][5]) * (9 < n) * (5 < n);
mx += (a[9][6] - mx) * (mx < a[9][6]) * (9 < n) * (6 < n);
mx += (a[9][7] - mx) * (mx < a[9][7]) * (9 < n) * (7 < n);
mx += (a[9][8] - mx) * (mx < a[9][8]) * (9 < n) * (8 < n);
mx += (a[9][9] - mx) * (mx < a[9][9]) * (9 < n) * (9 < n);
cout << mx << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[10][10];
int ans;
int f1(int i, int j) {
scanf("%d", &a[i][j]);
return j == n - 1 ? 0 : f1(i, j + 1);
}
int f2(int i) {
f1(i, 0);
return i == n - 1 ? 0 : f2(i + 1);
}
int g1(int k, int i, int j) {
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
return j == n - 1 ? 0 : g1(k, i, j + 1);
}
int g2(int k, int i) {
g1(k, i, 0);
return i == n - 1 ? 0 : g2(k, i + 1);
}
int g3(int k) {
g2(k, 0);
return k == n - 1 ? 0 : g3(k + 1);
}
int h1(int i, int j) {
ans = max(ans, a[i][j]);
return j == n - 1 ? 0 : h1(i, j + 1);
}
int h2(int i) {
h1(i, 0);
return i == n - 1 ? 0 : h2(i + 1);
}
int main() {
scanf("%d", &n);
f2(0);
g3(0);
h2(0);
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100][100], n, ans;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) cin >> a[i][j];
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) ans = max(ans, a[i][j]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using ld = long double;
using pii = pair<int, int>;
template <class F>
void bleh(int i, int n, const F &f) {
f(i);
poop(i + 1, n, f);
}
template <class F>
void poop(int i, int n, const F &f) {
return (i == n) ? void() : bleh(i, n, f);
}
void solve() {
int n;
cin >> n;
ll oo = (ll)1e9;
vector<vector<ll>> d(n, vector<ll>(n, oo));
poop(0, n, [&](int i) { d[i][i] = 0; });
poop(0, n, [&](int i) { poop(0, n, [&](int j) { cin >> d[i][j]; }); });
poop(0, n, [&](int k) {
poop(0, n, [&](int i) {
poop(0, n, [&](int j) { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); });
});
});
ll ans = 0;
poop(0, n, [&](int i) {
poop(0, n, [&](int j) { ans = (d[i][j] < oo) ? max(ans, d[i][j]) : ans; });
});
cout << ans << '\n';
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[20][20], n, ans;
int NEXT1(int x) {
cin >> a[x / n][x % n];
return (x == n * n) ? 0 : NEXT1(x + 1);
}
int NEXT2(int x) {
int k = x / (n * n);
int i = ((x % (n * n)) / n);
int j = x % n;
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
return (x == n * n * n) ? 0 : NEXT2(x + 1);
}
int NEXT3(int x) {
ans = max(ans, a[x / n][x % n]);
return (x == n * n) ? 0 : NEXT3(x + 1);
}
int main() {
cin >> n;
NEXT1(0);
NEXT2(0);
NEXT3(0);
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[105][105];
int n;
int read(int x, int y) {
x == n ? x = n : (y == n ? y = n : scanf("%d", &arr[x][y]));
x == n ? x = n : (y == n ? read(x + 1, 0) : read(x, y + 1));
return 0;
}
int floyd(int k, int i, int j) {
k == n ? k = n
: i == n ? i = n
: j == n ? j = n
: arr[i][j] = min(arr[i][j], arr[i][k] + arr[k][j]);
k == n ? k = n
: i == n ? floyd(k + 1, 0, 0)
: j == n ? floyd(k, i + 1, 0)
: floyd(k, i, j + 1);
return 0;
}
int ans(int x, int y) {
int ret = 0;
x == n ? x = n : ret = max(ret, arr[x][y]);
x == n ? x = n
: y == n ? ret = max(ret, ans(x + 1, 0))
: ret = max(ret, ans(x, y + 1));
return ret;
}
int main() {
scanf("%d", &n);
read(0, 0);
floyd(0, 0, 0);
cout << ans(0, 0) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[20][20], dp[20][20], ans;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) cin >> a[i][j], dp[i][j] = a[i][j];
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) ans = max(ans, dp[i][j]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, dp[10][10];
int input(int x, int y) {
scanf("%d", &dp[x][y]);
return y == n - 1 ? (x == n - 1 ? 1 : input(x + 1, 0)) : input(x, y + 1);
}
int main() {
int ans = 0;
scanf("%d", &n);
dp[0][0] = 0x3f3f3f3f;
dp[0][1] = 0x3f3f3f3f;
dp[0][2] = 0x3f3f3f3f;
dp[0][3] = 0x3f3f3f3f;
dp[0][4] = 0x3f3f3f3f;
dp[0][5] = 0x3f3f3f3f;
dp[0][6] = 0x3f3f3f3f;
dp[0][7] = 0x3f3f3f3f;
dp[0][8] = 0x3f3f3f3f;
dp[0][9] = 0x3f3f3f3f;
dp[1][0] = 0x3f3f3f3f;
dp[1][1] = 0x3f3f3f3f;
dp[1][2] = 0x3f3f3f3f;
dp[1][3] = 0x3f3f3f3f;
dp[1][4] = 0x3f3f3f3f;
dp[1][5] = 0x3f3f3f3f;
dp[1][6] = 0x3f3f3f3f;
dp[1][7] = 0x3f3f3f3f;
dp[1][8] = 0x3f3f3f3f;
dp[1][9] = 0x3f3f3f3f;
dp[2][0] = 0x3f3f3f3f;
dp[2][1] = 0x3f3f3f3f;
dp[2][2] = 0x3f3f3f3f;
dp[2][3] = 0x3f3f3f3f;
dp[2][4] = 0x3f3f3f3f;
dp[2][5] = 0x3f3f3f3f;
dp[2][6] = 0x3f3f3f3f;
dp[2][7] = 0x3f3f3f3f;
dp[2][8] = 0x3f3f3f3f;
dp[2][9] = 0x3f3f3f3f;
dp[3][0] = 0x3f3f3f3f;
dp[3][1] = 0x3f3f3f3f;
dp[3][2] = 0x3f3f3f3f;
dp[3][3] = 0x3f3f3f3f;
dp[3][4] = 0x3f3f3f3f;
dp[3][5] = 0x3f3f3f3f;
dp[3][6] = 0x3f3f3f3f;
dp[3][7] = 0x3f3f3f3f;
dp[3][8] = 0x3f3f3f3f;
dp[3][9] = 0x3f3f3f3f;
dp[4][0] = 0x3f3f3f3f;
dp[4][1] = 0x3f3f3f3f;
dp[4][2] = 0x3f3f3f3f;
dp[4][3] = 0x3f3f3f3f;
dp[4][4] = 0x3f3f3f3f;
dp[4][5] = 0x3f3f3f3f;
dp[4][6] = 0x3f3f3f3f;
dp[4][7] = 0x3f3f3f3f;
dp[4][8] = 0x3f3f3f3f;
dp[4][9] = 0x3f3f3f3f;
dp[5][0] = 0x3f3f3f3f;
dp[5][1] = 0x3f3f3f3f;
dp[5][2] = 0x3f3f3f3f;
dp[5][3] = 0x3f3f3f3f;
dp[5][4] = 0x3f3f3f3f;
dp[5][5] = 0x3f3f3f3f;
dp[5][6] = 0x3f3f3f3f;
dp[5][7] = 0x3f3f3f3f;
dp[5][8] = 0x3f3f3f3f;
dp[5][9] = 0x3f3f3f3f;
dp[6][0] = 0x3f3f3f3f;
dp[6][1] = 0x3f3f3f3f;
dp[6][2] = 0x3f3f3f3f;
dp[6][3] = 0x3f3f3f3f;
dp[6][4] = 0x3f3f3f3f;
dp[6][5] = 0x3f3f3f3f;
dp[6][6] = 0x3f3f3f3f;
dp[6][7] = 0x3f3f3f3f;
dp[6][8] = 0x3f3f3f3f;
dp[6][9] = 0x3f3f3f3f;
dp[7][0] = 0x3f3f3f3f;
dp[7][1] = 0x3f3f3f3f;
dp[7][2] = 0x3f3f3f3f;
dp[7][3] = 0x3f3f3f3f;
dp[7][4] = 0x3f3f3f3f;
dp[7][5] = 0x3f3f3f3f;
dp[7][6] = 0x3f3f3f3f;
dp[7][7] = 0x3f3f3f3f;
dp[7][8] = 0x3f3f3f3f;
dp[7][9] = 0x3f3f3f3f;
dp[8][0] = 0x3f3f3f3f;
dp[8][1] = 0x3f3f3f3f;
dp[8][2] = 0x3f3f3f3f;
dp[8][3] = 0x3f3f3f3f;
dp[8][4] = 0x3f3f3f3f;
dp[8][5] = 0x3f3f3f3f;
dp[8][6] = 0x3f3f3f3f;
dp[8][7] = 0x3f3f3f3f;
dp[8][8] = 0x3f3f3f3f;
dp[8][9] = 0x3f3f3f3f;
dp[9][0] = 0x3f3f3f3f;
dp[9][1] = 0x3f3f3f3f;
dp[9][2] = 0x3f3f3f3f;
dp[9][3] = 0x3f3f3f3f;
dp[9][4] = 0x3f3f3f3f;
dp[9][5] = 0x3f3f3f3f;
dp[9][6] = 0x3f3f3f3f;
dp[9][7] = 0x3f3f3f3f;
dp[9][8] = 0x3f3f3f3f;
dp[9][9] = 0x3f3f3f3f;
input(0, 0);
dp[0][0] = min(dp[0][0], dp[0][0] + dp[0][0]);
dp[0][1] = min(dp[0][1], dp[0][0] + dp[0][1]);
dp[0][2] = min(dp[0][2], dp[0][0] + dp[0][2]);
dp[0][3] = min(dp[0][3], dp[0][0] + dp[0][3]);
dp[0][4] = min(dp[0][4], dp[0][0] + dp[0][4]);
dp[0][5] = min(dp[0][5], dp[0][0] + dp[0][5]);
dp[0][6] = min(dp[0][6], dp[0][0] + dp[0][6]);
dp[0][7] = min(dp[0][7], dp[0][0] + dp[0][7]);
dp[0][8] = min(dp[0][8], dp[0][0] + dp[0][8]);
dp[0][9] = min(dp[0][9], dp[0][0] + dp[0][9]);
dp[1][0] = min(dp[1][0], dp[1][0] + dp[0][0]);
dp[1][1] = min(dp[1][1], dp[1][0] + dp[0][1]);
dp[1][2] = min(dp[1][2], dp[1][0] + dp[0][2]);
dp[1][3] = min(dp[1][3], dp[1][0] + dp[0][3]);
dp[1][4] = min(dp[1][4], dp[1][0] + dp[0][4]);
dp[1][5] = min(dp[1][5], dp[1][0] + dp[0][5]);
dp[1][6] = min(dp[1][6], dp[1][0] + dp[0][6]);
dp[1][7] = min(dp[1][7], dp[1][0] + dp[0][7]);
dp[1][8] = min(dp[1][8], dp[1][0] + dp[0][8]);
dp[1][9] = min(dp[1][9], dp[1][0] + dp[0][9]);
dp[2][0] = min(dp[2][0], dp[2][0] + dp[0][0]);
dp[2][1] = min(dp[2][1], dp[2][0] + dp[0][1]);
dp[2][2] = min(dp[2][2], dp[2][0] + dp[0][2]);
dp[2][3] = min(dp[2][3], dp[2][0] + dp[0][3]);
dp[2][4] = min(dp[2][4], dp[2][0] + dp[0][4]);
dp[2][5] = min(dp[2][5], dp[2][0] + dp[0][5]);
dp[2][6] = min(dp[2][6], dp[2][0] + dp[0][6]);
dp[2][7] = min(dp[2][7], dp[2][0] + dp[0][7]);
dp[2][8] = min(dp[2][8], dp[2][0] + dp[0][8]);
dp[2][9] = min(dp[2][9], dp[2][0] + dp[0][9]);
dp[3][0] = min(dp[3][0], dp[3][0] + dp[0][0]);
dp[3][1] = min(dp[3][1], dp[3][0] + dp[0][1]);
dp[3][2] = min(dp[3][2], dp[3][0] + dp[0][2]);
dp[3][3] = min(dp[3][3], dp[3][0] + dp[0][3]);
dp[3][4] = min(dp[3][4], dp[3][0] + dp[0][4]);
dp[3][5] = min(dp[3][5], dp[3][0] + dp[0][5]);
dp[3][6] = min(dp[3][6], dp[3][0] + dp[0][6]);
dp[3][7] = min(dp[3][7], dp[3][0] + dp[0][7]);
dp[3][8] = min(dp[3][8], dp[3][0] + dp[0][8]);
dp[3][9] = min(dp[3][9], dp[3][0] + dp[0][9]);
dp[4][0] = min(dp[4][0], dp[4][0] + dp[0][0]);
dp[4][1] = min(dp[4][1], dp[4][0] + dp[0][1]);
dp[4][2] = min(dp[4][2], dp[4][0] + dp[0][2]);
dp[4][3] = min(dp[4][3], dp[4][0] + dp[0][3]);
dp[4][4] = min(dp[4][4], dp[4][0] + dp[0][4]);
dp[4][5] = min(dp[4][5], dp[4][0] + dp[0][5]);
dp[4][6] = min(dp[4][6], dp[4][0] + dp[0][6]);
dp[4][7] = min(dp[4][7], dp[4][0] + dp[0][7]);
dp[4][8] = min(dp[4][8], dp[4][0] + dp[0][8]);
dp[4][9] = min(dp[4][9], dp[4][0] + dp[0][9]);
dp[5][0] = min(dp[5][0], dp[5][0] + dp[0][0]);
dp[5][1] = min(dp[5][1], dp[5][0] + dp[0][1]);
dp[5][2] = min(dp[5][2], dp[5][0] + dp[0][2]);
dp[5][3] = min(dp[5][3], dp[5][0] + dp[0][3]);
dp[5][4] = min(dp[5][4], dp[5][0] + dp[0][4]);
dp[5][5] = min(dp[5][5], dp[5][0] + dp[0][5]);
dp[5][6] = min(dp[5][6], dp[5][0] + dp[0][6]);
dp[5][7] = min(dp[5][7], dp[5][0] + dp[0][7]);
dp[5][8] = min(dp[5][8], dp[5][0] + dp[0][8]);
dp[5][9] = min(dp[5][9], dp[5][0] + dp[0][9]);
dp[6][0] = min(dp[6][0], dp[6][0] + dp[0][0]);
dp[6][1] = min(dp[6][1], dp[6][0] + dp[0][1]);
dp[6][2] = min(dp[6][2], dp[6][0] + dp[0][2]);
dp[6][3] = min(dp[6][3], dp[6][0] + dp[0][3]);
dp[6][4] = min(dp[6][4], dp[6][0] + dp[0][4]);
dp[6][5] = min(dp[6][5], dp[6][0] + dp[0][5]);
dp[6][6] = min(dp[6][6], dp[6][0] + dp[0][6]);
dp[6][7] = min(dp[6][7], dp[6][0] + dp[0][7]);
dp[6][8] = min(dp[6][8], dp[6][0] + dp[0][8]);
dp[6][9] = min(dp[6][9], dp[6][0] + dp[0][9]);
dp[7][0] = min(dp[7][0], dp[7][0] + dp[0][0]);
dp[7][1] = min(dp[7][1], dp[7][0] + dp[0][1]);
dp[7][2] = min(dp[7][2], dp[7][0] + dp[0][2]);
dp[7][3] = min(dp[7][3], dp[7][0] + dp[0][3]);
dp[7][4] = min(dp[7][4], dp[7][0] + dp[0][4]);
dp[7][5] = min(dp[7][5], dp[7][0] + dp[0][5]);
dp[7][6] = min(dp[7][6], dp[7][0] + dp[0][6]);
dp[7][7] = min(dp[7][7], dp[7][0] + dp[0][7]);
dp[7][8] = min(dp[7][8], dp[7][0] + dp[0][8]);
dp[7][9] = min(dp[7][9], dp[7][0] + dp[0][9]);
dp[8][0] = min(dp[8][0], dp[8][0] + dp[0][0]);
dp[8][1] = min(dp[8][1], dp[8][0] + dp[0][1]);
dp[8][2] = min(dp[8][2], dp[8][0] + dp[0][2]);
dp[8][3] = min(dp[8][3], dp[8][0] + dp[0][3]);
dp[8][4] = min(dp[8][4], dp[8][0] + dp[0][4]);
dp[8][5] = min(dp[8][5], dp[8][0] + dp[0][5]);
dp[8][6] = min(dp[8][6], dp[8][0] + dp[0][6]);
dp[8][7] = min(dp[8][7], dp[8][0] + dp[0][7]);
dp[8][8] = min(dp[8][8], dp[8][0] + dp[0][8]);
dp[8][9] = min(dp[8][9], dp[8][0] + dp[0][9]);
dp[9][0] = min(dp[9][0], dp[9][0] + dp[0][0]);
dp[9][1] = min(dp[9][1], dp[9][0] + dp[0][1]);
dp[9][2] = min(dp[9][2], dp[9][0] + dp[0][2]);
dp[9][3] = min(dp[9][3], dp[9][0] + dp[0][3]);
dp[9][4] = min(dp[9][4], dp[9][0] + dp[0][4]);
dp[9][5] = min(dp[9][5], dp[9][0] + dp[0][5]);
dp[9][6] = min(dp[9][6], dp[9][0] + dp[0][6]);
dp[9][7] = min(dp[9][7], dp[9][0] + dp[0][7]);
dp[9][8] = min(dp[9][8], dp[9][0] + dp[0][8]);
dp[9][9] = min(dp[9][9], dp[9][0] + dp[0][9]);
dp[0][0] = min(dp[0][0], dp[0][1] + dp[1][0]);
dp[0][1] = min(dp[0][1], dp[0][1] + dp[1][1]);
dp[0][2] = min(dp[0][2], dp[0][1] + dp[1][2]);
dp[0][3] = min(dp[0][3], dp[0][1] + dp[1][3]);
dp[0][4] = min(dp[0][4], dp[0][1] + dp[1][4]);
dp[0][5] = min(dp[0][5], dp[0][1] + dp[1][5]);
dp[0][6] = min(dp[0][6], dp[0][1] + dp[1][6]);
dp[0][7] = min(dp[0][7], dp[0][1] + dp[1][7]);
dp[0][8] = min(dp[0][8], dp[0][1] + dp[1][8]);
dp[0][9] = min(dp[0][9], dp[0][1] + dp[1][9]);
dp[1][0] = min(dp[1][0], dp[1][1] + dp[1][0]);
dp[1][1] = min(dp[1][1], dp[1][1] + dp[1][1]);
dp[1][2] = min(dp[1][2], dp[1][1] + dp[1][2]);
dp[1][3] = min(dp[1][3], dp[1][1] + dp[1][3]);
dp[1][4] = min(dp[1][4], dp[1][1] + dp[1][4]);
dp[1][5] = min(dp[1][5], dp[1][1] + dp[1][5]);
dp[1][6] = min(dp[1][6], dp[1][1] + dp[1][6]);
dp[1][7] = min(dp[1][7], dp[1][1] + dp[1][7]);
dp[1][8] = min(dp[1][8], dp[1][1] + dp[1][8]);
dp[1][9] = min(dp[1][9], dp[1][1] + dp[1][9]);
dp[2][0] = min(dp[2][0], dp[2][1] + dp[1][0]);
dp[2][1] = min(dp[2][1], dp[2][1] + dp[1][1]);
dp[2][2] = min(dp[2][2], dp[2][1] + dp[1][2]);
dp[2][3] = min(dp[2][3], dp[2][1] + dp[1][3]);
dp[2][4] = min(dp[2][4], dp[2][1] + dp[1][4]);
dp[2][5] = min(dp[2][5], dp[2][1] + dp[1][5]);
dp[2][6] = min(dp[2][6], dp[2][1] + dp[1][6]);
dp[2][7] = min(dp[2][7], dp[2][1] + dp[1][7]);
dp[2][8] = min(dp[2][8], dp[2][1] + dp[1][8]);
dp[2][9] = min(dp[2][9], dp[2][1] + dp[1][9]);
dp[3][0] = min(dp[3][0], dp[3][1] + dp[1][0]);
dp[3][1] = min(dp[3][1], dp[3][1] + dp[1][1]);
dp[3][2] = min(dp[3][2], dp[3][1] + dp[1][2]);
dp[3][3] = min(dp[3][3], dp[3][1] + dp[1][3]);
dp[3][4] = min(dp[3][4], dp[3][1] + dp[1][4]);
dp[3][5] = min(dp[3][5], dp[3][1] + dp[1][5]);
dp[3][6] = min(dp[3][6], dp[3][1] + dp[1][6]);
dp[3][7] = min(dp[3][7], dp[3][1] + dp[1][7]);
dp[3][8] = min(dp[3][8], dp[3][1] + dp[1][8]);
dp[3][9] = min(dp[3][9], dp[3][1] + dp[1][9]);
dp[4][0] = min(dp[4][0], dp[4][1] + dp[1][0]);
dp[4][1] = min(dp[4][1], dp[4][1] + dp[1][1]);
dp[4][2] = min(dp[4][2], dp[4][1] + dp[1][2]);
dp[4][3] = min(dp[4][3], dp[4][1] + dp[1][3]);
dp[4][4] = min(dp[4][4], dp[4][1] + dp[1][4]);
dp[4][5] = min(dp[4][5], dp[4][1] + dp[1][5]);
dp[4][6] = min(dp[4][6], dp[4][1] + dp[1][6]);
dp[4][7] = min(dp[4][7], dp[4][1] + dp[1][7]);
dp[4][8] = min(dp[4][8], dp[4][1] + dp[1][8]);
dp[4][9] = min(dp[4][9], dp[4][1] + dp[1][9]);
dp[5][0] = min(dp[5][0], dp[5][1] + dp[1][0]);
dp[5][1] = min(dp[5][1], dp[5][1] + dp[1][1]);
dp[5][2] = min(dp[5][2], dp[5][1] + dp[1][2]);
dp[5][3] = min(dp[5][3], dp[5][1] + dp[1][3]);
dp[5][4] = min(dp[5][4], dp[5][1] + dp[1][4]);
dp[5][5] = min(dp[5][5], dp[5][1] + dp[1][5]);
dp[5][6] = min(dp[5][6], dp[5][1] + dp[1][6]);
dp[5][7] = min(dp[5][7], dp[5][1] + dp[1][7]);
dp[5][8] = min(dp[5][8], dp[5][1] + dp[1][8]);
dp[5][9] = min(dp[5][9], dp[5][1] + dp[1][9]);
dp[6][0] = min(dp[6][0], dp[6][1] + dp[1][0]);
dp[6][1] = min(dp[6][1], dp[6][1] + dp[1][1]);
dp[6][2] = min(dp[6][2], dp[6][1] + dp[1][2]);
dp[6][3] = min(dp[6][3], dp[6][1] + dp[1][3]);
dp[6][4] = min(dp[6][4], dp[6][1] + dp[1][4]);
dp[6][5] = min(dp[6][5], dp[6][1] + dp[1][5]);
dp[6][6] = min(dp[6][6], dp[6][1] + dp[1][6]);
dp[6][7] = min(dp[6][7], dp[6][1] + dp[1][7]);
dp[6][8] = min(dp[6][8], dp[6][1] + dp[1][8]);
dp[6][9] = min(dp[6][9], dp[6][1] + dp[1][9]);
dp[7][0] = min(dp[7][0], dp[7][1] + dp[1][0]);
dp[7][1] = min(dp[7][1], dp[7][1] + dp[1][1]);
dp[7][2] = min(dp[7][2], dp[7][1] + dp[1][2]);
dp[7][3] = min(dp[7][3], dp[7][1] + dp[1][3]);
dp[7][4] = min(dp[7][4], dp[7][1] + dp[1][4]);
dp[7][5] = min(dp[7][5], dp[7][1] + dp[1][5]);
dp[7][6] = min(dp[7][6], dp[7][1] + dp[1][6]);
dp[7][7] = min(dp[7][7], dp[7][1] + dp[1][7]);
dp[7][8] = min(dp[7][8], dp[7][1] + dp[1][8]);
dp[7][9] = min(dp[7][9], dp[7][1] + dp[1][9]);
dp[8][0] = min(dp[8][0], dp[8][1] + dp[1][0]);
dp[8][1] = min(dp[8][1], dp[8][1] + dp[1][1]);
dp[8][2] = min(dp[8][2], dp[8][1] + dp[1][2]);
dp[8][3] = min(dp[8][3], dp[8][1] + dp[1][3]);
dp[8][4] = min(dp[8][4], dp[8][1] + dp[1][4]);
dp[8][5] = min(dp[8][5], dp[8][1] + dp[1][5]);
dp[8][6] = min(dp[8][6], dp[8][1] + dp[1][6]);
dp[8][7] = min(dp[8][7], dp[8][1] + dp[1][7]);
dp[8][8] = min(dp[8][8], dp[8][1] + dp[1][8]);
dp[8][9] = min(dp[8][9], dp[8][1] + dp[1][9]);
dp[9][0] = min(dp[9][0], dp[9][1] + dp[1][0]);
dp[9][1] = min(dp[9][1], dp[9][1] + dp[1][1]);
dp[9][2] = min(dp[9][2], dp[9][1] + dp[1][2]);
dp[9][3] = min(dp[9][3], dp[9][1] + dp[1][3]);
dp[9][4] = min(dp[9][4], dp[9][1] + dp[1][4]);
dp[9][5] = min(dp[9][5], dp[9][1] + dp[1][5]);
dp[9][6] = min(dp[9][6], dp[9][1] + dp[1][6]);
dp[9][7] = min(dp[9][7], dp[9][1] + dp[1][7]);
dp[9][8] = min(dp[9][8], dp[9][1] + dp[1][8]);
dp[9][9] = min(dp[9][9], dp[9][1] + dp[1][9]);
dp[0][0] = min(dp[0][0], dp[0][2] + dp[2][0]);
dp[0][1] = min(dp[0][1], dp[0][2] + dp[2][1]);
dp[0][2] = min(dp[0][2], dp[0][2] + dp[2][2]);
dp[0][3] = min(dp[0][3], dp[0][2] + dp[2][3]);
dp[0][4] = min(dp[0][4], dp[0][2] + dp[2][4]);
dp[0][5] = min(dp[0][5], dp[0][2] + dp[2][5]);
dp[0][6] = min(dp[0][6], dp[0][2] + dp[2][6]);
dp[0][7] = min(dp[0][7], dp[0][2] + dp[2][7]);
dp[0][8] = min(dp[0][8], dp[0][2] + dp[2][8]);
dp[0][9] = min(dp[0][9], dp[0][2] + dp[2][9]);
dp[1][0] = min(dp[1][0], dp[1][2] + dp[2][0]);
dp[1][1] = min(dp[1][1], dp[1][2] + dp[2][1]);
dp[1][2] = min(dp[1][2], dp[1][2] + dp[2][2]);
dp[1][3] = min(dp[1][3], dp[1][2] + dp[2][3]);
dp[1][4] = min(dp[1][4], dp[1][2] + dp[2][4]);
dp[1][5] = min(dp[1][5], dp[1][2] + dp[2][5]);
dp[1][6] = min(dp[1][6], dp[1][2] + dp[2][6]);
dp[1][7] = min(dp[1][7], dp[1][2] + dp[2][7]);
dp[1][8] = min(dp[1][8], dp[1][2] + dp[2][8]);
dp[1][9] = min(dp[1][9], dp[1][2] + dp[2][9]);
dp[2][0] = min(dp[2][0], dp[2][2] + dp[2][0]);
dp[2][1] = min(dp[2][1], dp[2][2] + dp[2][1]);
dp[2][2] = min(dp[2][2], dp[2][2] + dp[2][2]);
dp[2][3] = min(dp[2][3], dp[2][2] + dp[2][3]);
dp[2][4] = min(dp[2][4], dp[2][2] + dp[2][4]);
dp[2][5] = min(dp[2][5], dp[2][2] + dp[2][5]);
dp[2][6] = min(dp[2][6], dp[2][2] + dp[2][6]);
dp[2][7] = min(dp[2][7], dp[2][2] + dp[2][7]);
dp[2][8] = min(dp[2][8], dp[2][2] + dp[2][8]);
dp[2][9] = min(dp[2][9], dp[2][2] + dp[2][9]);
dp[3][0] = min(dp[3][0], dp[3][2] + dp[2][0]);
dp[3][1] = min(dp[3][1], dp[3][2] + dp[2][1]);
dp[3][2] = min(dp[3][2], dp[3][2] + dp[2][2]);
dp[3][3] = min(dp[3][3], dp[3][2] + dp[2][3]);
dp[3][4] = min(dp[3][4], dp[3][2] + dp[2][4]);
dp[3][5] = min(dp[3][5], dp[3][2] + dp[2][5]);
dp[3][6] = min(dp[3][6], dp[3][2] + dp[2][6]);
dp[3][7] = min(dp[3][7], dp[3][2] + dp[2][7]);
dp[3][8] = min(dp[3][8], dp[3][2] + dp[2][8]);
dp[3][9] = min(dp[3][9], dp[3][2] + dp[2][9]);
dp[4][0] = min(dp[4][0], dp[4][2] + dp[2][0]);
dp[4][1] = min(dp[4][1], dp[4][2] + dp[2][1]);
dp[4][2] = min(dp[4][2], dp[4][2] + dp[2][2]);
dp[4][3] = min(dp[4][3], dp[4][2] + dp[2][3]);
dp[4][4] = min(dp[4][4], dp[4][2] + dp[2][4]);
dp[4][5] = min(dp[4][5], dp[4][2] + dp[2][5]);
dp[4][6] = min(dp[4][6], dp[4][2] + dp[2][6]);
dp[4][7] = min(dp[4][7], dp[4][2] + dp[2][7]);
dp[4][8] = min(dp[4][8], dp[4][2] + dp[2][8]);
dp[4][9] = min(dp[4][9], dp[4][2] + dp[2][9]);
dp[5][0] = min(dp[5][0], dp[5][2] + dp[2][0]);
dp[5][1] = min(dp[5][1], dp[5][2] + dp[2][1]);
dp[5][2] = min(dp[5][2], dp[5][2] + dp[2][2]);
dp[5][3] = min(dp[5][3], dp[5][2] + dp[2][3]);
dp[5][4] = min(dp[5][4], dp[5][2] + dp[2][4]);
dp[5][5] = min(dp[5][5], dp[5][2] + dp[2][5]);
dp[5][6] = min(dp[5][6], dp[5][2] + dp[2][6]);
dp[5][7] = min(dp[5][7], dp[5][2] + dp[2][7]);
dp[5][8] = min(dp[5][8], dp[5][2] + dp[2][8]);
dp[5][9] = min(dp[5][9], dp[5][2] + dp[2][9]);
dp[6][0] = min(dp[6][0], dp[6][2] + dp[2][0]);
dp[6][1] = min(dp[6][1], dp[6][2] + dp[2][1]);
dp[6][2] = min(dp[6][2], dp[6][2] + dp[2][2]);
dp[6][3] = min(dp[6][3], dp[6][2] + dp[2][3]);
dp[6][4] = min(dp[6][4], dp[6][2] + dp[2][4]);
dp[6][5] = min(dp[6][5], dp[6][2] + dp[2][5]);
dp[6][6] = min(dp[6][6], dp[6][2] + dp[2][6]);
dp[6][7] = min(dp[6][7], dp[6][2] + dp[2][7]);
dp[6][8] = min(dp[6][8], dp[6][2] + dp[2][8]);
dp[6][9] = min(dp[6][9], dp[6][2] + dp[2][9]);
dp[7][0] = min(dp[7][0], dp[7][2] + dp[2][0]);
dp[7][1] = min(dp[7][1], dp[7][2] + dp[2][1]);
dp[7][2] = min(dp[7][2], dp[7][2] + dp[2][2]);
dp[7][3] = min(dp[7][3], dp[7][2] + dp[2][3]);
dp[7][4] = min(dp[7][4], dp[7][2] + dp[2][4]);
dp[7][5] = min(dp[7][5], dp[7][2] + dp[2][5]);
dp[7][6] = min(dp[7][6], dp[7][2] + dp[2][6]);
dp[7][7] = min(dp[7][7], dp[7][2] + dp[2][7]);
dp[7][8] = min(dp[7][8], dp[7][2] + dp[2][8]);
dp[7][9] = min(dp[7][9], dp[7][2] + dp[2][9]);
dp[8][0] = min(dp[8][0], dp[8][2] + dp[2][0]);
dp[8][1] = min(dp[8][1], dp[8][2] + dp[2][1]);
dp[8][2] = min(dp[8][2], dp[8][2] + dp[2][2]);
dp[8][3] = min(dp[8][3], dp[8][2] + dp[2][3]);
dp[8][4] = min(dp[8][4], dp[8][2] + dp[2][4]);
dp[8][5] = min(dp[8][5], dp[8][2] + dp[2][5]);
dp[8][6] = min(dp[8][6], dp[8][2] + dp[2][6]);
dp[8][7] = min(dp[8][7], dp[8][2] + dp[2][7]);
dp[8][8] = min(dp[8][8], dp[8][2] + dp[2][8]);
dp[8][9] = min(dp[8][9], dp[8][2] + dp[2][9]);
dp[9][0] = min(dp[9][0], dp[9][2] + dp[2][0]);
dp[9][1] = min(dp[9][1], dp[9][2] + dp[2][1]);
dp[9][2] = min(dp[9][2], dp[9][2] + dp[2][2]);
dp[9][3] = min(dp[9][3], dp[9][2] + dp[2][3]);
dp[9][4] = min(dp[9][4], dp[9][2] + dp[2][4]);
dp[9][5] = min(dp[9][5], dp[9][2] + dp[2][5]);
dp[9][6] = min(dp[9][6], dp[9][2] + dp[2][6]);
dp[9][7] = min(dp[9][7], dp[9][2] + dp[2][7]);
dp[9][8] = min(dp[9][8], dp[9][2] + dp[2][8]);
dp[9][9] = min(dp[9][9], dp[9][2] + dp[2][9]);
dp[0][0] = min(dp[0][0], dp[0][3] + dp[3][0]);
dp[0][1] = min(dp[0][1], dp[0][3] + dp[3][1]);
dp[0][2] = min(dp[0][2], dp[0][3] + dp[3][2]);
dp[0][3] = min(dp[0][3], dp[0][3] + dp[3][3]);
dp[0][4] = min(dp[0][4], dp[0][3] + dp[3][4]);
dp[0][5] = min(dp[0][5], dp[0][3] + dp[3][5]);
dp[0][6] = min(dp[0][6], dp[0][3] + dp[3][6]);
dp[0][7] = min(dp[0][7], dp[0][3] + dp[3][7]);
dp[0][8] = min(dp[0][8], dp[0][3] + dp[3][8]);
dp[0][9] = min(dp[0][9], dp[0][3] + dp[3][9]);
dp[1][0] = min(dp[1][0], dp[1][3] + dp[3][0]);
dp[1][1] = min(dp[1][1], dp[1][3] + dp[3][1]);
dp[1][2] = min(dp[1][2], dp[1][3] + dp[3][2]);
dp[1][3] = min(dp[1][3], dp[1][3] + dp[3][3]);
dp[1][4] = min(dp[1][4], dp[1][3] + dp[3][4]);
dp[1][5] = min(dp[1][5], dp[1][3] + dp[3][5]);
dp[1][6] = min(dp[1][6], dp[1][3] + dp[3][6]);
dp[1][7] = min(dp[1][7], dp[1][3] + dp[3][7]);
dp[1][8] = min(dp[1][8], dp[1][3] + dp[3][8]);
dp[1][9] = min(dp[1][9], dp[1][3] + dp[3][9]);
dp[2][0] = min(dp[2][0], dp[2][3] + dp[3][0]);
dp[2][1] = min(dp[2][1], dp[2][3] + dp[3][1]);
dp[2][2] = min(dp[2][2], dp[2][3] + dp[3][2]);
dp[2][3] = min(dp[2][3], dp[2][3] + dp[3][3]);
dp[2][4] = min(dp[2][4], dp[2][3] + dp[3][4]);
dp[2][5] = min(dp[2][5], dp[2][3] + dp[3][5]);
dp[2][6] = min(dp[2][6], dp[2][3] + dp[3][6]);
dp[2][7] = min(dp[2][7], dp[2][3] + dp[3][7]);
dp[2][8] = min(dp[2][8], dp[2][3] + dp[3][8]);
dp[2][9] = min(dp[2][9], dp[2][3] + dp[3][9]);
dp[3][0] = min(dp[3][0], dp[3][3] + dp[3][0]);
dp[3][1] = min(dp[3][1], dp[3][3] + dp[3][1]);
dp[3][2] = min(dp[3][2], dp[3][3] + dp[3][2]);
dp[3][3] = min(dp[3][3], dp[3][3] + dp[3][3]);
dp[3][4] = min(dp[3][4], dp[3][3] + dp[3][4]);
dp[3][5] = min(dp[3][5], dp[3][3] + dp[3][5]);
dp[3][6] = min(dp[3][6], dp[3][3] + dp[3][6]);
dp[3][7] = min(dp[3][7], dp[3][3] + dp[3][7]);
dp[3][8] = min(dp[3][8], dp[3][3] + dp[3][8]);
dp[3][9] = min(dp[3][9], dp[3][3] + dp[3][9]);
dp[4][0] = min(dp[4][0], dp[4][3] + dp[3][0]);
dp[4][1] = min(dp[4][1], dp[4][3] + dp[3][1]);
dp[4][2] = min(dp[4][2], dp[4][3] + dp[3][2]);
dp[4][3] = min(dp[4][3], dp[4][3] + dp[3][3]);
dp[4][4] = min(dp[4][4], dp[4][3] + dp[3][4]);
dp[4][5] = min(dp[4][5], dp[4][3] + dp[3][5]);
dp[4][6] = min(dp[4][6], dp[4][3] + dp[3][6]);
dp[4][7] = min(dp[4][7], dp[4][3] + dp[3][7]);
dp[4][8] = min(dp[4][8], dp[4][3] + dp[3][8]);
dp[4][9] = min(dp[4][9], dp[4][3] + dp[3][9]);
dp[5][0] = min(dp[5][0], dp[5][3] + dp[3][0]);
dp[5][1] = min(dp[5][1], dp[5][3] + dp[3][1]);
dp[5][2] = min(dp[5][2], dp[5][3] + dp[3][2]);
dp[5][3] = min(dp[5][3], dp[5][3] + dp[3][3]);
dp[5][4] = min(dp[5][4], dp[5][3] + dp[3][4]);
dp[5][5] = min(dp[5][5], dp[5][3] + dp[3][5]);
dp[5][6] = min(dp[5][6], dp[5][3] + dp[3][6]);
dp[5][7] = min(dp[5][7], dp[5][3] + dp[3][7]);
dp[5][8] = min(dp[5][8], dp[5][3] + dp[3][8]);
dp[5][9] = min(dp[5][9], dp[5][3] + dp[3][9]);
dp[6][0] = min(dp[6][0], dp[6][3] + dp[3][0]);
dp[6][1] = min(dp[6][1], dp[6][3] + dp[3][1]);
dp[6][2] = min(dp[6][2], dp[6][3] + dp[3][2]);
dp[6][3] = min(dp[6][3], dp[6][3] + dp[3][3]);
dp[6][4] = min(dp[6][4], dp[6][3] + dp[3][4]);
dp[6][5] = min(dp[6][5], dp[6][3] + dp[3][5]);
dp[6][6] = min(dp[6][6], dp[6][3] + dp[3][6]);
dp[6][7] = min(dp[6][7], dp[6][3] + dp[3][7]);
dp[6][8] = min(dp[6][8], dp[6][3] + dp[3][8]);
dp[6][9] = min(dp[6][9], dp[6][3] + dp[3][9]);
dp[7][0] = min(dp[7][0], dp[7][3] + dp[3][0]);
dp[7][1] = min(dp[7][1], dp[7][3] + dp[3][1]);
dp[7][2] = min(dp[7][2], dp[7][3] + dp[3][2]);
dp[7][3] = min(dp[7][3], dp[7][3] + dp[3][3]);
dp[7][4] = min(dp[7][4], dp[7][3] + dp[3][4]);
dp[7][5] = min(dp[7][5], dp[7][3] + dp[3][5]);
dp[7][6] = min(dp[7][6], dp[7][3] + dp[3][6]);
dp[7][7] = min(dp[7][7], dp[7][3] + dp[3][7]);
dp[7][8] = min(dp[7][8], dp[7][3] + dp[3][8]);
dp[7][9] = min(dp[7][9], dp[7][3] + dp[3][9]);
dp[8][0] = min(dp[8][0], dp[8][3] + dp[3][0]);
dp[8][1] = min(dp[8][1], dp[8][3] + dp[3][1]);
dp[8][2] = min(dp[8][2], dp[8][3] + dp[3][2]);
dp[8][3] = min(dp[8][3], dp[8][3] + dp[3][3]);
dp[8][4] = min(dp[8][4], dp[8][3] + dp[3][4]);
dp[8][5] = min(dp[8][5], dp[8][3] + dp[3][5]);
dp[8][6] = min(dp[8][6], dp[8][3] + dp[3][6]);
dp[8][7] = min(dp[8][7], dp[8][3] + dp[3][7]);
dp[8][8] = min(dp[8][8], dp[8][3] + dp[3][8]);
dp[8][9] = min(dp[8][9], dp[8][3] + dp[3][9]);
dp[9][0] = min(dp[9][0], dp[9][3] + dp[3][0]);
dp[9][1] = min(dp[9][1], dp[9][3] + dp[3][1]);
dp[9][2] = min(dp[9][2], dp[9][3] + dp[3][2]);
dp[9][3] = min(dp[9][3], dp[9][3] + dp[3][3]);
dp[9][4] = min(dp[9][4], dp[9][3] + dp[3][4]);
dp[9][5] = min(dp[9][5], dp[9][3] + dp[3][5]);
dp[9][6] = min(dp[9][6], dp[9][3] + dp[3][6]);
dp[9][7] = min(dp[9][7], dp[9][3] + dp[3][7]);
dp[9][8] = min(dp[9][8], dp[9][3] + dp[3][8]);
dp[9][9] = min(dp[9][9], dp[9][3] + dp[3][9]);
dp[0][0] = min(dp[0][0], dp[0][4] + dp[4][0]);
dp[0][1] = min(dp[0][1], dp[0][4] + dp[4][1]);
dp[0][2] = min(dp[0][2], dp[0][4] + dp[4][2]);
dp[0][3] = min(dp[0][3], dp[0][4] + dp[4][3]);
dp[0][4] = min(dp[0][4], dp[0][4] + dp[4][4]);
dp[0][5] = min(dp[0][5], dp[0][4] + dp[4][5]);
dp[0][6] = min(dp[0][6], dp[0][4] + dp[4][6]);
dp[0][7] = min(dp[0][7], dp[0][4] + dp[4][7]);
dp[0][8] = min(dp[0][8], dp[0][4] + dp[4][8]);
dp[0][9] = min(dp[0][9], dp[0][4] + dp[4][9]);
dp[1][0] = min(dp[1][0], dp[1][4] + dp[4][0]);
dp[1][1] = min(dp[1][1], dp[1][4] + dp[4][1]);
dp[1][2] = min(dp[1][2], dp[1][4] + dp[4][2]);
dp[1][3] = min(dp[1][3], dp[1][4] + dp[4][3]);
dp[1][4] = min(dp[1][4], dp[1][4] + dp[4][4]);
dp[1][5] = min(dp[1][5], dp[1][4] + dp[4][5]);
dp[1][6] = min(dp[1][6], dp[1][4] + dp[4][6]);
dp[1][7] = min(dp[1][7], dp[1][4] + dp[4][7]);
dp[1][8] = min(dp[1][8], dp[1][4] + dp[4][8]);
dp[1][9] = min(dp[1][9], dp[1][4] + dp[4][9]);
dp[2][0] = min(dp[2][0], dp[2][4] + dp[4][0]);
dp[2][1] = min(dp[2][1], dp[2][4] + dp[4][1]);
dp[2][2] = min(dp[2][2], dp[2][4] + dp[4][2]);
dp[2][3] = min(dp[2][3], dp[2][4] + dp[4][3]);
dp[2][4] = min(dp[2][4], dp[2][4] + dp[4][4]);
dp[2][5] = min(dp[2][5], dp[2][4] + dp[4][5]);
dp[2][6] = min(dp[2][6], dp[2][4] + dp[4][6]);
dp[2][7] = min(dp[2][7], dp[2][4] + dp[4][7]);
dp[2][8] = min(dp[2][8], dp[2][4] + dp[4][8]);
dp[2][9] = min(dp[2][9], dp[2][4] + dp[4][9]);
dp[3][0] = min(dp[3][0], dp[3][4] + dp[4][0]);
dp[3][1] = min(dp[3][1], dp[3][4] + dp[4][1]);
dp[3][2] = min(dp[3][2], dp[3][4] + dp[4][2]);
dp[3][3] = min(dp[3][3], dp[3][4] + dp[4][3]);
dp[3][4] = min(dp[3][4], dp[3][4] + dp[4][4]);
dp[3][5] = min(dp[3][5], dp[3][4] + dp[4][5]);
dp[3][6] = min(dp[3][6], dp[3][4] + dp[4][6]);
dp[3][7] = min(dp[3][7], dp[3][4] + dp[4][7]);
dp[3][8] = min(dp[3][8], dp[3][4] + dp[4][8]);
dp[3][9] = min(dp[3][9], dp[3][4] + dp[4][9]);
dp[4][0] = min(dp[4][0], dp[4][4] + dp[4][0]);
dp[4][1] = min(dp[4][1], dp[4][4] + dp[4][1]);
dp[4][2] = min(dp[4][2], dp[4][4] + dp[4][2]);
dp[4][3] = min(dp[4][3], dp[4][4] + dp[4][3]);
dp[4][4] = min(dp[4][4], dp[4][4] + dp[4][4]);
dp[4][5] = min(dp[4][5], dp[4][4] + dp[4][5]);
dp[4][6] = min(dp[4][6], dp[4][4] + dp[4][6]);
dp[4][7] = min(dp[4][7], dp[4][4] + dp[4][7]);
dp[4][8] = min(dp[4][8], dp[4][4] + dp[4][8]);
dp[4][9] = min(dp[4][9], dp[4][4] + dp[4][9]);
dp[5][0] = min(dp[5][0], dp[5][4] + dp[4][0]);
dp[5][1] = min(dp[5][1], dp[5][4] + dp[4][1]);
dp[5][2] = min(dp[5][2], dp[5][4] + dp[4][2]);
dp[5][3] = min(dp[5][3], dp[5][4] + dp[4][3]);
dp[5][4] = min(dp[5][4], dp[5][4] + dp[4][4]);
dp[5][5] = min(dp[5][5], dp[5][4] + dp[4][5]);
dp[5][6] = min(dp[5][6], dp[5][4] + dp[4][6]);
dp[5][7] = min(dp[5][7], dp[5][4] + dp[4][7]);
dp[5][8] = min(dp[5][8], dp[5][4] + dp[4][8]);
dp[5][9] = min(dp[5][9], dp[5][4] + dp[4][9]);
dp[6][0] = min(dp[6][0], dp[6][4] + dp[4][0]);
dp[6][1] = min(dp[6][1], dp[6][4] + dp[4][1]);
dp[6][2] = min(dp[6][2], dp[6][4] + dp[4][2]);
dp[6][3] = min(dp[6][3], dp[6][4] + dp[4][3]);
dp[6][4] = min(dp[6][4], dp[6][4] + dp[4][4]);
dp[6][5] = min(dp[6][5], dp[6][4] + dp[4][5]);
dp[6][6] = min(dp[6][6], dp[6][4] + dp[4][6]);
dp[6][7] = min(dp[6][7], dp[6][4] + dp[4][7]);
dp[6][8] = min(dp[6][8], dp[6][4] + dp[4][8]);
dp[6][9] = min(dp[6][9], dp[6][4] + dp[4][9]);
dp[7][0] = min(dp[7][0], dp[7][4] + dp[4][0]);
dp[7][1] = min(dp[7][1], dp[7][4] + dp[4][1]);
dp[7][2] = min(dp[7][2], dp[7][4] + dp[4][2]);
dp[7][3] = min(dp[7][3], dp[7][4] + dp[4][3]);
dp[7][4] = min(dp[7][4], dp[7][4] + dp[4][4]);
dp[7][5] = min(dp[7][5], dp[7][4] + dp[4][5]);
dp[7][6] = min(dp[7][6], dp[7][4] + dp[4][6]);
dp[7][7] = min(dp[7][7], dp[7][4] + dp[4][7]);
dp[7][8] = min(dp[7][8], dp[7][4] + dp[4][8]);
dp[7][9] = min(dp[7][9], dp[7][4] + dp[4][9]);
dp[8][0] = min(dp[8][0], dp[8][4] + dp[4][0]);
dp[8][1] = min(dp[8][1], dp[8][4] + dp[4][1]);
dp[8][2] = min(dp[8][2], dp[8][4] + dp[4][2]);
dp[8][3] = min(dp[8][3], dp[8][4] + dp[4][3]);
dp[8][4] = min(dp[8][4], dp[8][4] + dp[4][4]);
dp[8][5] = min(dp[8][5], dp[8][4] + dp[4][5]);
dp[8][6] = min(dp[8][6], dp[8][4] + dp[4][6]);
dp[8][7] = min(dp[8][7], dp[8][4] + dp[4][7]);
dp[8][8] = min(dp[8][8], dp[8][4] + dp[4][8]);
dp[8][9] = min(dp[8][9], dp[8][4] + dp[4][9]);
dp[9][0] = min(dp[9][0], dp[9][4] + dp[4][0]);
dp[9][1] = min(dp[9][1], dp[9][4] + dp[4][1]);
dp[9][2] = min(dp[9][2], dp[9][4] + dp[4][2]);
dp[9][3] = min(dp[9][3], dp[9][4] + dp[4][3]);
dp[9][4] = min(dp[9][4], dp[9][4] + dp[4][4]);
dp[9][5] = min(dp[9][5], dp[9][4] + dp[4][5]);
dp[9][6] = min(dp[9][6], dp[9][4] + dp[4][6]);
dp[9][7] = min(dp[9][7], dp[9][4] + dp[4][7]);
dp[9][8] = min(dp[9][8], dp[9][4] + dp[4][8]);
dp[9][9] = min(dp[9][9], dp[9][4] + dp[4][9]);
dp[0][0] = min(dp[0][0], dp[0][5] + dp[5][0]);
dp[0][1] = min(dp[0][1], dp[0][5] + dp[5][1]);
dp[0][2] = min(dp[0][2], dp[0][5] + dp[5][2]);
dp[0][3] = min(dp[0][3], dp[0][5] + dp[5][3]);
dp[0][4] = min(dp[0][4], dp[0][5] + dp[5][4]);
dp[0][5] = min(dp[0][5], dp[0][5] + dp[5][5]);
dp[0][6] = min(dp[0][6], dp[0][5] + dp[5][6]);
dp[0][7] = min(dp[0][7], dp[0][5] + dp[5][7]);
dp[0][8] = min(dp[0][8], dp[0][5] + dp[5][8]);
dp[0][9] = min(dp[0][9], dp[0][5] + dp[5][9]);
dp[1][0] = min(dp[1][0], dp[1][5] + dp[5][0]);
dp[1][1] = min(dp[1][1], dp[1][5] + dp[5][1]);
dp[1][2] = min(dp[1][2], dp[1][5] + dp[5][2]);
dp[1][3] = min(dp[1][3], dp[1][5] + dp[5][3]);
dp[1][4] = min(dp[1][4], dp[1][5] + dp[5][4]);
dp[1][5] = min(dp[1][5], dp[1][5] + dp[5][5]);
dp[1][6] = min(dp[1][6], dp[1][5] + dp[5][6]);
dp[1][7] = min(dp[1][7], dp[1][5] + dp[5][7]);
dp[1][8] = min(dp[1][8], dp[1][5] + dp[5][8]);
dp[1][9] = min(dp[1][9], dp[1][5] + dp[5][9]);
dp[2][0] = min(dp[2][0], dp[2][5] + dp[5][0]);
dp[2][1] = min(dp[2][1], dp[2][5] + dp[5][1]);
dp[2][2] = min(dp[2][2], dp[2][5] + dp[5][2]);
dp[2][3] = min(dp[2][3], dp[2][5] + dp[5][3]);
dp[2][4] = min(dp[2][4], dp[2][5] + dp[5][4]);
dp[2][5] = min(dp[2][5], dp[2][5] + dp[5][5]);
dp[2][6] = min(dp[2][6], dp[2][5] + dp[5][6]);
dp[2][7] = min(dp[2][7], dp[2][5] + dp[5][7]);
dp[2][8] = min(dp[2][8], dp[2][5] + dp[5][8]);
dp[2][9] = min(dp[2][9], dp[2][5] + dp[5][9]);
dp[3][0] = min(dp[3][0], dp[3][5] + dp[5][0]);
dp[3][1] = min(dp[3][1], dp[3][5] + dp[5][1]);
dp[3][2] = min(dp[3][2], dp[3][5] + dp[5][2]);
dp[3][3] = min(dp[3][3], dp[3][5] + dp[5][3]);
dp[3][4] = min(dp[3][4], dp[3][5] + dp[5][4]);
dp[3][5] = min(dp[3][5], dp[3][5] + dp[5][5]);
dp[3][6] = min(dp[3][6], dp[3][5] + dp[5][6]);
dp[3][7] = min(dp[3][7], dp[3][5] + dp[5][7]);
dp[3][8] = min(dp[3][8], dp[3][5] + dp[5][8]);
dp[3][9] = min(dp[3][9], dp[3][5] + dp[5][9]);
dp[4][0] = min(dp[4][0], dp[4][5] + dp[5][0]);
dp[4][1] = min(dp[4][1], dp[4][5] + dp[5][1]);
dp[4][2] = min(dp[4][2], dp[4][5] + dp[5][2]);
dp[4][3] = min(dp[4][3], dp[4][5] + dp[5][3]);
dp[4][4] = min(dp[4][4], dp[4][5] + dp[5][4]);
dp[4][5] = min(dp[4][5], dp[4][5] + dp[5][5]);
dp[4][6] = min(dp[4][6], dp[4][5] + dp[5][6]);
dp[4][7] = min(dp[4][7], dp[4][5] + dp[5][7]);
dp[4][8] = min(dp[4][8], dp[4][5] + dp[5][8]);
dp[4][9] = min(dp[4][9], dp[4][5] + dp[5][9]);
dp[5][0] = min(dp[5][0], dp[5][5] + dp[5][0]);
dp[5][1] = min(dp[5][1], dp[5][5] + dp[5][1]);
dp[5][2] = min(dp[5][2], dp[5][5] + dp[5][2]);
dp[5][3] = min(dp[5][3], dp[5][5] + dp[5][3]);
dp[5][4] = min(dp[5][4], dp[5][5] + dp[5][4]);
dp[5][5] = min(dp[5][5], dp[5][5] + dp[5][5]);
dp[5][6] = min(dp[5][6], dp[5][5] + dp[5][6]);
dp[5][7] = min(dp[5][7], dp[5][5] + dp[5][7]);
dp[5][8] = min(dp[5][8], dp[5][5] + dp[5][8]);
dp[5][9] = min(dp[5][9], dp[5][5] + dp[5][9]);
dp[6][0] = min(dp[6][0], dp[6][5] + dp[5][0]);
dp[6][1] = min(dp[6][1], dp[6][5] + dp[5][1]);
dp[6][2] = min(dp[6][2], dp[6][5] + dp[5][2]);
dp[6][3] = min(dp[6][3], dp[6][5] + dp[5][3]);
dp[6][4] = min(dp[6][4], dp[6][5] + dp[5][4]);
dp[6][5] = min(dp[6][5], dp[6][5] + dp[5][5]);
dp[6][6] = min(dp[6][6], dp[6][5] + dp[5][6]);
dp[6][7] = min(dp[6][7], dp[6][5] + dp[5][7]);
dp[6][8] = min(dp[6][8], dp[6][5] + dp[5][8]);
dp[6][9] = min(dp[6][9], dp[6][5] + dp[5][9]);
dp[7][0] = min(dp[7][0], dp[7][5] + dp[5][0]);
dp[7][1] = min(dp[7][1], dp[7][5] + dp[5][1]);
dp[7][2] = min(dp[7][2], dp[7][5] + dp[5][2]);
dp[7][3] = min(dp[7][3], dp[7][5] + dp[5][3]);
dp[7][4] = min(dp[7][4], dp[7][5] + dp[5][4]);
dp[7][5] = min(dp[7][5], dp[7][5] + dp[5][5]);
dp[7][6] = min(dp[7][6], dp[7][5] + dp[5][6]);
dp[7][7] = min(dp[7][7], dp[7][5] + dp[5][7]);
dp[7][8] = min(dp[7][8], dp[7][5] + dp[5][8]);
dp[7][9] = min(dp[7][9], dp[7][5] + dp[5][9]);
dp[8][0] = min(dp[8][0], dp[8][5] + dp[5][0]);
dp[8][1] = min(dp[8][1], dp[8][5] + dp[5][1]);
dp[8][2] = min(dp[8][2], dp[8][5] + dp[5][2]);
dp[8][3] = min(dp[8][3], dp[8][5] + dp[5][3]);
dp[8][4] = min(dp[8][4], dp[8][5] + dp[5][4]);
dp[8][5] = min(dp[8][5], dp[8][5] + dp[5][5]);
dp[8][6] = min(dp[8][6], dp[8][5] + dp[5][6]);
dp[8][7] = min(dp[8][7], dp[8][5] + dp[5][7]);
dp[8][8] = min(dp[8][8], dp[8][5] + dp[5][8]);
dp[8][9] = min(dp[8][9], dp[8][5] + dp[5][9]);
dp[9][0] = min(dp[9][0], dp[9][5] + dp[5][0]);
dp[9][1] = min(dp[9][1], dp[9][5] + dp[5][1]);
dp[9][2] = min(dp[9][2], dp[9][5] + dp[5][2]);
dp[9][3] = min(dp[9][3], dp[9][5] + dp[5][3]);
dp[9][4] = min(dp[9][4], dp[9][5] + dp[5][4]);
dp[9][5] = min(dp[9][5], dp[9][5] + dp[5][5]);
dp[9][6] = min(dp[9][6], dp[9][5] + dp[5][6]);
dp[9][7] = min(dp[9][7], dp[9][5] + dp[5][7]);
dp[9][8] = min(dp[9][8], dp[9][5] + dp[5][8]);
dp[9][9] = min(dp[9][9], dp[9][5] + dp[5][9]);
dp[0][0] = min(dp[0][0], dp[0][6] + dp[6][0]);
dp[0][1] = min(dp[0][1], dp[0][6] + dp[6][1]);
dp[0][2] = min(dp[0][2], dp[0][6] + dp[6][2]);
dp[0][3] = min(dp[0][3], dp[0][6] + dp[6][3]);
dp[0][4] = min(dp[0][4], dp[0][6] + dp[6][4]);
dp[0][5] = min(dp[0][5], dp[0][6] + dp[6][5]);
dp[0][6] = min(dp[0][6], dp[0][6] + dp[6][6]);
dp[0][7] = min(dp[0][7], dp[0][6] + dp[6][7]);
dp[0][8] = min(dp[0][8], dp[0][6] + dp[6][8]);
dp[0][9] = min(dp[0][9], dp[0][6] + dp[6][9]);
dp[1][0] = min(dp[1][0], dp[1][6] + dp[6][0]);
dp[1][1] = min(dp[1][1], dp[1][6] + dp[6][1]);
dp[1][2] = min(dp[1][2], dp[1][6] + dp[6][2]);
dp[1][3] = min(dp[1][3], dp[1][6] + dp[6][3]);
dp[1][4] = min(dp[1][4], dp[1][6] + dp[6][4]);
dp[1][5] = min(dp[1][5], dp[1][6] + dp[6][5]);
dp[1][6] = min(dp[1][6], dp[1][6] + dp[6][6]);
dp[1][7] = min(dp[1][7], dp[1][6] + dp[6][7]);
dp[1][8] = min(dp[1][8], dp[1][6] + dp[6][8]);
dp[1][9] = min(dp[1][9], dp[1][6] + dp[6][9]);
dp[2][0] = min(dp[2][0], dp[2][6] + dp[6][0]);
dp[2][1] = min(dp[2][1], dp[2][6] + dp[6][1]);
dp[2][2] = min(dp[2][2], dp[2][6] + dp[6][2]);
dp[2][3] = min(dp[2][3], dp[2][6] + dp[6][3]);
dp[2][4] = min(dp[2][4], dp[2][6] + dp[6][4]);
dp[2][5] = min(dp[2][5], dp[2][6] + dp[6][5]);
dp[2][6] = min(dp[2][6], dp[2][6] + dp[6][6]);
dp[2][7] = min(dp[2][7], dp[2][6] + dp[6][7]);
dp[2][8] = min(dp[2][8], dp[2][6] + dp[6][8]);
dp[2][9] = min(dp[2][9], dp[2][6] + dp[6][9]);
dp[3][0] = min(dp[3][0], dp[3][6] + dp[6][0]);
dp[3][1] = min(dp[3][1], dp[3][6] + dp[6][1]);
dp[3][2] = min(dp[3][2], dp[3][6] + dp[6][2]);
dp[3][3] = min(dp[3][3], dp[3][6] + dp[6][3]);
dp[3][4] = min(dp[3][4], dp[3][6] + dp[6][4]);
dp[3][5] = min(dp[3][5], dp[3][6] + dp[6][5]);
dp[3][6] = min(dp[3][6], dp[3][6] + dp[6][6]);
dp[3][7] = min(dp[3][7], dp[3][6] + dp[6][7]);
dp[3][8] = min(dp[3][8], dp[3][6] + dp[6][8]);
dp[3][9] = min(dp[3][9], dp[3][6] + dp[6][9]);
dp[4][0] = min(dp[4][0], dp[4][6] + dp[6][0]);
dp[4][1] = min(dp[4][1], dp[4][6] + dp[6][1]);
dp[4][2] = min(dp[4][2], dp[4][6] + dp[6][2]);
dp[4][3] = min(dp[4][3], dp[4][6] + dp[6][3]);
dp[4][4] = min(dp[4][4], dp[4][6] + dp[6][4]);
dp[4][5] = min(dp[4][5], dp[4][6] + dp[6][5]);
dp[4][6] = min(dp[4][6], dp[4][6] + dp[6][6]);
dp[4][7] = min(dp[4][7], dp[4][6] + dp[6][7]);
dp[4][8] = min(dp[4][8], dp[4][6] + dp[6][8]);
dp[4][9] = min(dp[4][9], dp[4][6] + dp[6][9]);
dp[5][0] = min(dp[5][0], dp[5][6] + dp[6][0]);
dp[5][1] = min(dp[5][1], dp[5][6] + dp[6][1]);
dp[5][2] = min(dp[5][2], dp[5][6] + dp[6][2]);
dp[5][3] = min(dp[5][3], dp[5][6] + dp[6][3]);
dp[5][4] = min(dp[5][4], dp[5][6] + dp[6][4]);
dp[5][5] = min(dp[5][5], dp[5][6] + dp[6][5]);
dp[5][6] = min(dp[5][6], dp[5][6] + dp[6][6]);
dp[5][7] = min(dp[5][7], dp[5][6] + dp[6][7]);
dp[5][8] = min(dp[5][8], dp[5][6] + dp[6][8]);
dp[5][9] = min(dp[5][9], dp[5][6] + dp[6][9]);
dp[6][0] = min(dp[6][0], dp[6][6] + dp[6][0]);
dp[6][1] = min(dp[6][1], dp[6][6] + dp[6][1]);
dp[6][2] = min(dp[6][2], dp[6][6] + dp[6][2]);
dp[6][3] = min(dp[6][3], dp[6][6] + dp[6][3]);
dp[6][4] = min(dp[6][4], dp[6][6] + dp[6][4]);
dp[6][5] = min(dp[6][5], dp[6][6] + dp[6][5]);
dp[6][6] = min(dp[6][6], dp[6][6] + dp[6][6]);
dp[6][7] = min(dp[6][7], dp[6][6] + dp[6][7]);
dp[6][8] = min(dp[6][8], dp[6][6] + dp[6][8]);
dp[6][9] = min(dp[6][9], dp[6][6] + dp[6][9]);
dp[7][0] = min(dp[7][0], dp[7][6] + dp[6][0]);
dp[7][1] = min(dp[7][1], dp[7][6] + dp[6][1]);
dp[7][2] = min(dp[7][2], dp[7][6] + dp[6][2]);
dp[7][3] = min(dp[7][3], dp[7][6] + dp[6][3]);
dp[7][4] = min(dp[7][4], dp[7][6] + dp[6][4]);
dp[7][5] = min(dp[7][5], dp[7][6] + dp[6][5]);
dp[7][6] = min(dp[7][6], dp[7][6] + dp[6][6]);
dp[7][7] = min(dp[7][7], dp[7][6] + dp[6][7]);
dp[7][8] = min(dp[7][8], dp[7][6] + dp[6][8]);
dp[7][9] = min(dp[7][9], dp[7][6] + dp[6][9]);
dp[8][0] = min(dp[8][0], dp[8][6] + dp[6][0]);
dp[8][1] = min(dp[8][1], dp[8][6] + dp[6][1]);
dp[8][2] = min(dp[8][2], dp[8][6] + dp[6][2]);
dp[8][3] = min(dp[8][3], dp[8][6] + dp[6][3]);
dp[8][4] = min(dp[8][4], dp[8][6] + dp[6][4]);
dp[8][5] = min(dp[8][5], dp[8][6] + dp[6][5]);
dp[8][6] = min(dp[8][6], dp[8][6] + dp[6][6]);
dp[8][7] = min(dp[8][7], dp[8][6] + dp[6][7]);
dp[8][8] = min(dp[8][8], dp[8][6] + dp[6][8]);
dp[8][9] = min(dp[8][9], dp[8][6] + dp[6][9]);
dp[9][0] = min(dp[9][0], dp[9][6] + dp[6][0]);
dp[9][1] = min(dp[9][1], dp[9][6] + dp[6][1]);
dp[9][2] = min(dp[9][2], dp[9][6] + dp[6][2]);
dp[9][3] = min(dp[9][3], dp[9][6] + dp[6][3]);
dp[9][4] = min(dp[9][4], dp[9][6] + dp[6][4]);
dp[9][5] = min(dp[9][5], dp[9][6] + dp[6][5]);
dp[9][6] = min(dp[9][6], dp[9][6] + dp[6][6]);
dp[9][7] = min(dp[9][7], dp[9][6] + dp[6][7]);
dp[9][8] = min(dp[9][8], dp[9][6] + dp[6][8]);
dp[9][9] = min(dp[9][9], dp[9][6] + dp[6][9]);
dp[0][0] = min(dp[0][0], dp[0][7] + dp[7][0]);
dp[0][1] = min(dp[0][1], dp[0][7] + dp[7][1]);
dp[0][2] = min(dp[0][2], dp[0][7] + dp[7][2]);
dp[0][3] = min(dp[0][3], dp[0][7] + dp[7][3]);
dp[0][4] = min(dp[0][4], dp[0][7] + dp[7][4]);
dp[0][5] = min(dp[0][5], dp[0][7] + dp[7][5]);
dp[0][6] = min(dp[0][6], dp[0][7] + dp[7][6]);
dp[0][7] = min(dp[0][7], dp[0][7] + dp[7][7]);
dp[0][8] = min(dp[0][8], dp[0][7] + dp[7][8]);
dp[0][9] = min(dp[0][9], dp[0][7] + dp[7][9]);
dp[1][0] = min(dp[1][0], dp[1][7] + dp[7][0]);
dp[1][1] = min(dp[1][1], dp[1][7] + dp[7][1]);
dp[1][2] = min(dp[1][2], dp[1][7] + dp[7][2]);
dp[1][3] = min(dp[1][3], dp[1][7] + dp[7][3]);
dp[1][4] = min(dp[1][4], dp[1][7] + dp[7][4]);
dp[1][5] = min(dp[1][5], dp[1][7] + dp[7][5]);
dp[1][6] = min(dp[1][6], dp[1][7] + dp[7][6]);
dp[1][7] = min(dp[1][7], dp[1][7] + dp[7][7]);
dp[1][8] = min(dp[1][8], dp[1][7] + dp[7][8]);
dp[1][9] = min(dp[1][9], dp[1][7] + dp[7][9]);
dp[2][0] = min(dp[2][0], dp[2][7] + dp[7][0]);
dp[2][1] = min(dp[2][1], dp[2][7] + dp[7][1]);
dp[2][2] = min(dp[2][2], dp[2][7] + dp[7][2]);
dp[2][3] = min(dp[2][3], dp[2][7] + dp[7][3]);
dp[2][4] = min(dp[2][4], dp[2][7] + dp[7][4]);
dp[2][5] = min(dp[2][5], dp[2][7] + dp[7][5]);
dp[2][6] = min(dp[2][6], dp[2][7] + dp[7][6]);
dp[2][7] = min(dp[2][7], dp[2][7] + dp[7][7]);
dp[2][8] = min(dp[2][8], dp[2][7] + dp[7][8]);
dp[2][9] = min(dp[2][9], dp[2][7] + dp[7][9]);
dp[3][0] = min(dp[3][0], dp[3][7] + dp[7][0]);
dp[3][1] = min(dp[3][1], dp[3][7] + dp[7][1]);
dp[3][2] = min(dp[3][2], dp[3][7] + dp[7][2]);
dp[3][3] = min(dp[3][3], dp[3][7] + dp[7][3]);
dp[3][4] = min(dp[3][4], dp[3][7] + dp[7][4]);
dp[3][5] = min(dp[3][5], dp[3][7] + dp[7][5]);
dp[3][6] = min(dp[3][6], dp[3][7] + dp[7][6]);
dp[3][7] = min(dp[3][7], dp[3][7] + dp[7][7]);
dp[3][8] = min(dp[3][8], dp[3][7] + dp[7][8]);
dp[3][9] = min(dp[3][9], dp[3][7] + dp[7][9]);
dp[4][0] = min(dp[4][0], dp[4][7] + dp[7][0]);
dp[4][1] = min(dp[4][1], dp[4][7] + dp[7][1]);
dp[4][2] = min(dp[4][2], dp[4][7] + dp[7][2]);
dp[4][3] = min(dp[4][3], dp[4][7] + dp[7][3]);
dp[4][4] = min(dp[4][4], dp[4][7] + dp[7][4]);
dp[4][5] = min(dp[4][5], dp[4][7] + dp[7][5]);
dp[4][6] = min(dp[4][6], dp[4][7] + dp[7][6]);
dp[4][7] = min(dp[4][7], dp[4][7] + dp[7][7]);
dp[4][8] = min(dp[4][8], dp[4][7] + dp[7][8]);
dp[4][9] = min(dp[4][9], dp[4][7] + dp[7][9]);
dp[5][0] = min(dp[5][0], dp[5][7] + dp[7][0]);
dp[5][1] = min(dp[5][1], dp[5][7] + dp[7][1]);
dp[5][2] = min(dp[5][2], dp[5][7] + dp[7][2]);
dp[5][3] = min(dp[5][3], dp[5][7] + dp[7][3]);
dp[5][4] = min(dp[5][4], dp[5][7] + dp[7][4]);
dp[5][5] = min(dp[5][5], dp[5][7] + dp[7][5]);
dp[5][6] = min(dp[5][6], dp[5][7] + dp[7][6]);
dp[5][7] = min(dp[5][7], dp[5][7] + dp[7][7]);
dp[5][8] = min(dp[5][8], dp[5][7] + dp[7][8]);
dp[5][9] = min(dp[5][9], dp[5][7] + dp[7][9]);
dp[6][0] = min(dp[6][0], dp[6][7] + dp[7][0]);
dp[6][1] = min(dp[6][1], dp[6][7] + dp[7][1]);
dp[6][2] = min(dp[6][2], dp[6][7] + dp[7][2]);
dp[6][3] = min(dp[6][3], dp[6][7] + dp[7][3]);
dp[6][4] = min(dp[6][4], dp[6][7] + dp[7][4]);
dp[6][5] = min(dp[6][5], dp[6][7] + dp[7][5]);
dp[6][6] = min(dp[6][6], dp[6][7] + dp[7][6]);
dp[6][7] = min(dp[6][7], dp[6][7] + dp[7][7]);
dp[6][8] = min(dp[6][8], dp[6][7] + dp[7][8]);
dp[6][9] = min(dp[6][9], dp[6][7] + dp[7][9]);
dp[7][0] = min(dp[7][0], dp[7][7] + dp[7][0]);
dp[7][1] = min(dp[7][1], dp[7][7] + dp[7][1]);
dp[7][2] = min(dp[7][2], dp[7][7] + dp[7][2]);
dp[7][3] = min(dp[7][3], dp[7][7] + dp[7][3]);
dp[7][4] = min(dp[7][4], dp[7][7] + dp[7][4]);
dp[7][5] = min(dp[7][5], dp[7][7] + dp[7][5]);
dp[7][6] = min(dp[7][6], dp[7][7] + dp[7][6]);
dp[7][7] = min(dp[7][7], dp[7][7] + dp[7][7]);
dp[7][8] = min(dp[7][8], dp[7][7] + dp[7][8]);
dp[7][9] = min(dp[7][9], dp[7][7] + dp[7][9]);
dp[8][0] = min(dp[8][0], dp[8][7] + dp[7][0]);
dp[8][1] = min(dp[8][1], dp[8][7] + dp[7][1]);
dp[8][2] = min(dp[8][2], dp[8][7] + dp[7][2]);
dp[8][3] = min(dp[8][3], dp[8][7] + dp[7][3]);
dp[8][4] = min(dp[8][4], dp[8][7] + dp[7][4]);
dp[8][5] = min(dp[8][5], dp[8][7] + dp[7][5]);
dp[8][6] = min(dp[8][6], dp[8][7] + dp[7][6]);
dp[8][7] = min(dp[8][7], dp[8][7] + dp[7][7]);
dp[8][8] = min(dp[8][8], dp[8][7] + dp[7][8]);
dp[8][9] = min(dp[8][9], dp[8][7] + dp[7][9]);
dp[9][0] = min(dp[9][0], dp[9][7] + dp[7][0]);
dp[9][1] = min(dp[9][1], dp[9][7] + dp[7][1]);
dp[9][2] = min(dp[9][2], dp[9][7] + dp[7][2]);
dp[9][3] = min(dp[9][3], dp[9][7] + dp[7][3]);
dp[9][4] = min(dp[9][4], dp[9][7] + dp[7][4]);
dp[9][5] = min(dp[9][5], dp[9][7] + dp[7][5]);
dp[9][6] = min(dp[9][6], dp[9][7] + dp[7][6]);
dp[9][7] = min(dp[9][7], dp[9][7] + dp[7][7]);
dp[9][8] = min(dp[9][8], dp[9][7] + dp[7][8]);
dp[9][9] = min(dp[9][9], dp[9][7] + dp[7][9]);
dp[0][0] = min(dp[0][0], dp[0][8] + dp[8][0]);
dp[0][1] = min(dp[0][1], dp[0][8] + dp[8][1]);
dp[0][2] = min(dp[0][2], dp[0][8] + dp[8][2]);
dp[0][3] = min(dp[0][3], dp[0][8] + dp[8][3]);
dp[0][4] = min(dp[0][4], dp[0][8] + dp[8][4]);
dp[0][5] = min(dp[0][5], dp[0][8] + dp[8][5]);
dp[0][6] = min(dp[0][6], dp[0][8] + dp[8][6]);
dp[0][7] = min(dp[0][7], dp[0][8] + dp[8][7]);
dp[0][8] = min(dp[0][8], dp[0][8] + dp[8][8]);
dp[0][9] = min(dp[0][9], dp[0][8] + dp[8][9]);
dp[1][0] = min(dp[1][0], dp[1][8] + dp[8][0]);
dp[1][1] = min(dp[1][1], dp[1][8] + dp[8][1]);
dp[1][2] = min(dp[1][2], dp[1][8] + dp[8][2]);
dp[1][3] = min(dp[1][3], dp[1][8] + dp[8][3]);
dp[1][4] = min(dp[1][4], dp[1][8] + dp[8][4]);
dp[1][5] = min(dp[1][5], dp[1][8] + dp[8][5]);
dp[1][6] = min(dp[1][6], dp[1][8] + dp[8][6]);
dp[1][7] = min(dp[1][7], dp[1][8] + dp[8][7]);
dp[1][8] = min(dp[1][8], dp[1][8] + dp[8][8]);
dp[1][9] = min(dp[1][9], dp[1][8] + dp[8][9]);
dp[2][0] = min(dp[2][0], dp[2][8] + dp[8][0]);
dp[2][1] = min(dp[2][1], dp[2][8] + dp[8][1]);
dp[2][2] = min(dp[2][2], dp[2][8] + dp[8][2]);
dp[2][3] = min(dp[2][3], dp[2][8] + dp[8][3]);
dp[2][4] = min(dp[2][4], dp[2][8] + dp[8][4]);
dp[2][5] = min(dp[2][5], dp[2][8] + dp[8][5]);
dp[2][6] = min(dp[2][6], dp[2][8] + dp[8][6]);
dp[2][7] = min(dp[2][7], dp[2][8] + dp[8][7]);
dp[2][8] = min(dp[2][8], dp[2][8] + dp[8][8]);
dp[2][9] = min(dp[2][9], dp[2][8] + dp[8][9]);
dp[3][0] = min(dp[3][0], dp[3][8] + dp[8][0]);
dp[3][1] = min(dp[3][1], dp[3][8] + dp[8][1]);
dp[3][2] = min(dp[3][2], dp[3][8] + dp[8][2]);
dp[3][3] = min(dp[3][3], dp[3][8] + dp[8][3]);
dp[3][4] = min(dp[3][4], dp[3][8] + dp[8][4]);
dp[3][5] = min(dp[3][5], dp[3][8] + dp[8][5]);
dp[3][6] = min(dp[3][6], dp[3][8] + dp[8][6]);
dp[3][7] = min(dp[3][7], dp[3][8] + dp[8][7]);
dp[3][8] = min(dp[3][8], dp[3][8] + dp[8][8]);
dp[3][9] = min(dp[3][9], dp[3][8] + dp[8][9]);
dp[4][0] = min(dp[4][0], dp[4][8] + dp[8][0]);
dp[4][1] = min(dp[4][1], dp[4][8] + dp[8][1]);
dp[4][2] = min(dp[4][2], dp[4][8] + dp[8][2]);
dp[4][3] = min(dp[4][3], dp[4][8] + dp[8][3]);
dp[4][4] = min(dp[4][4], dp[4][8] + dp[8][4]);
dp[4][5] = min(dp[4][5], dp[4][8] + dp[8][5]);
dp[4][6] = min(dp[4][6], dp[4][8] + dp[8][6]);
dp[4][7] = min(dp[4][7], dp[4][8] + dp[8][7]);
dp[4][8] = min(dp[4][8], dp[4][8] + dp[8][8]);
dp[4][9] = min(dp[4][9], dp[4][8] + dp[8][9]);
dp[5][0] = min(dp[5][0], dp[5][8] + dp[8][0]);
dp[5][1] = min(dp[5][1], dp[5][8] + dp[8][1]);
dp[5][2] = min(dp[5][2], dp[5][8] + dp[8][2]);
dp[5][3] = min(dp[5][3], dp[5][8] + dp[8][3]);
dp[5][4] = min(dp[5][4], dp[5][8] + dp[8][4]);
dp[5][5] = min(dp[5][5], dp[5][8] + dp[8][5]);
dp[5][6] = min(dp[5][6], dp[5][8] + dp[8][6]);
dp[5][7] = min(dp[5][7], dp[5][8] + dp[8][7]);
dp[5][8] = min(dp[5][8], dp[5][8] + dp[8][8]);
dp[5][9] = min(dp[5][9], dp[5][8] + dp[8][9]);
dp[6][0] = min(dp[6][0], dp[6][8] + dp[8][0]);
dp[6][1] = min(dp[6][1], dp[6][8] + dp[8][1]);
dp[6][2] = min(dp[6][2], dp[6][8] + dp[8][2]);
dp[6][3] = min(dp[6][3], dp[6][8] + dp[8][3]);
dp[6][4] = min(dp[6][4], dp[6][8] + dp[8][4]);
dp[6][5] = min(dp[6][5], dp[6][8] + dp[8][5]);
dp[6][6] = min(dp[6][6], dp[6][8] + dp[8][6]);
dp[6][7] = min(dp[6][7], dp[6][8] + dp[8][7]);
dp[6][8] = min(dp[6][8], dp[6][8] + dp[8][8]);
dp[6][9] = min(dp[6][9], dp[6][8] + dp[8][9]);
dp[7][0] = min(dp[7][0], dp[7][8] + dp[8][0]);
dp[7][1] = min(dp[7][1], dp[7][8] + dp[8][1]);
dp[7][2] = min(dp[7][2], dp[7][8] + dp[8][2]);
dp[7][3] = min(dp[7][3], dp[7][8] + dp[8][3]);
dp[7][4] = min(dp[7][4], dp[7][8] + dp[8][4]);
dp[7][5] = min(dp[7][5], dp[7][8] + dp[8][5]);
dp[7][6] = min(dp[7][6], dp[7][8] + dp[8][6]);
dp[7][7] = min(dp[7][7], dp[7][8] + dp[8][7]);
dp[7][8] = min(dp[7][8], dp[7][8] + dp[8][8]);
dp[7][9] = min(dp[7][9], dp[7][8] + dp[8][9]);
dp[8][0] = min(dp[8][0], dp[8][8] + dp[8][0]);
dp[8][1] = min(dp[8][1], dp[8][8] + dp[8][1]);
dp[8][2] = min(dp[8][2], dp[8][8] + dp[8][2]);
dp[8][3] = min(dp[8][3], dp[8][8] + dp[8][3]);
dp[8][4] = min(dp[8][4], dp[8][8] + dp[8][4]);
dp[8][5] = min(dp[8][5], dp[8][8] + dp[8][5]);
dp[8][6] = min(dp[8][6], dp[8][8] + dp[8][6]);
dp[8][7] = min(dp[8][7], dp[8][8] + dp[8][7]);
dp[8][8] = min(dp[8][8], dp[8][8] + dp[8][8]);
dp[8][9] = min(dp[8][9], dp[8][8] + dp[8][9]);
dp[9][0] = min(dp[9][0], dp[9][8] + dp[8][0]);
dp[9][1] = min(dp[9][1], dp[9][8] + dp[8][1]);
dp[9][2] = min(dp[9][2], dp[9][8] + dp[8][2]);
dp[9][3] = min(dp[9][3], dp[9][8] + dp[8][3]);
dp[9][4] = min(dp[9][4], dp[9][8] + dp[8][4]);
dp[9][5] = min(dp[9][5], dp[9][8] + dp[8][5]);
dp[9][6] = min(dp[9][6], dp[9][8] + dp[8][6]);
dp[9][7] = min(dp[9][7], dp[9][8] + dp[8][7]);
dp[9][8] = min(dp[9][8], dp[9][8] + dp[8][8]);
dp[9][9] = min(dp[9][9], dp[9][8] + dp[8][9]);
dp[0][0] = min(dp[0][0], dp[0][9] + dp[9][0]);
dp[0][1] = min(dp[0][1], dp[0][9] + dp[9][1]);
dp[0][2] = min(dp[0][2], dp[0][9] + dp[9][2]);
dp[0][3] = min(dp[0][3], dp[0][9] + dp[9][3]);
dp[0][4] = min(dp[0][4], dp[0][9] + dp[9][4]);
dp[0][5] = min(dp[0][5], dp[0][9] + dp[9][5]);
dp[0][6] = min(dp[0][6], dp[0][9] + dp[9][6]);
dp[0][7] = min(dp[0][7], dp[0][9] + dp[9][7]);
dp[0][8] = min(dp[0][8], dp[0][9] + dp[9][8]);
dp[0][9] = min(dp[0][9], dp[0][9] + dp[9][9]);
dp[1][0] = min(dp[1][0], dp[1][9] + dp[9][0]);
dp[1][1] = min(dp[1][1], dp[1][9] + dp[9][1]);
dp[1][2] = min(dp[1][2], dp[1][9] + dp[9][2]);
dp[1][3] = min(dp[1][3], dp[1][9] + dp[9][3]);
dp[1][4] = min(dp[1][4], dp[1][9] + dp[9][4]);
dp[1][5] = min(dp[1][5], dp[1][9] + dp[9][5]);
dp[1][6] = min(dp[1][6], dp[1][9] + dp[9][6]);
dp[1][7] = min(dp[1][7], dp[1][9] + dp[9][7]);
dp[1][8] = min(dp[1][8], dp[1][9] + dp[9][8]);
dp[1][9] = min(dp[1][9], dp[1][9] + dp[9][9]);
dp[2][0] = min(dp[2][0], dp[2][9] + dp[9][0]);
dp[2][1] = min(dp[2][1], dp[2][9] + dp[9][1]);
dp[2][2] = min(dp[2][2], dp[2][9] + dp[9][2]);
dp[2][3] = min(dp[2][3], dp[2][9] + dp[9][3]);
dp[2][4] = min(dp[2][4], dp[2][9] + dp[9][4]);
dp[2][5] = min(dp[2][5], dp[2][9] + dp[9][5]);
dp[2][6] = min(dp[2][6], dp[2][9] + dp[9][6]);
dp[2][7] = min(dp[2][7], dp[2][9] + dp[9][7]);
dp[2][8] = min(dp[2][8], dp[2][9] + dp[9][8]);
dp[2][9] = min(dp[2][9], dp[2][9] + dp[9][9]);
dp[3][0] = min(dp[3][0], dp[3][9] + dp[9][0]);
dp[3][1] = min(dp[3][1], dp[3][9] + dp[9][1]);
dp[3][2] = min(dp[3][2], dp[3][9] + dp[9][2]);
dp[3][3] = min(dp[3][3], dp[3][9] + dp[9][3]);
dp[3][4] = min(dp[3][4], dp[3][9] + dp[9][4]);
dp[3][5] = min(dp[3][5], dp[3][9] + dp[9][5]);
dp[3][6] = min(dp[3][6], dp[3][9] + dp[9][6]);
dp[3][7] = min(dp[3][7], dp[3][9] + dp[9][7]);
dp[3][8] = min(dp[3][8], dp[3][9] + dp[9][8]);
dp[3][9] = min(dp[3][9], dp[3][9] + dp[9][9]);
dp[4][0] = min(dp[4][0], dp[4][9] + dp[9][0]);
dp[4][1] = min(dp[4][1], dp[4][9] + dp[9][1]);
dp[4][2] = min(dp[4][2], dp[4][9] + dp[9][2]);
dp[4][3] = min(dp[4][3], dp[4][9] + dp[9][3]);
dp[4][4] = min(dp[4][4], dp[4][9] + dp[9][4]);
dp[4][5] = min(dp[4][5], dp[4][9] + dp[9][5]);
dp[4][6] = min(dp[4][6], dp[4][9] + dp[9][6]);
dp[4][7] = min(dp[4][7], dp[4][9] + dp[9][7]);
dp[4][8] = min(dp[4][8], dp[4][9] + dp[9][8]);
dp[4][9] = min(dp[4][9], dp[4][9] + dp[9][9]);
dp[5][0] = min(dp[5][0], dp[5][9] + dp[9][0]);
dp[5][1] = min(dp[5][1], dp[5][9] + dp[9][1]);
dp[5][2] = min(dp[5][2], dp[5][9] + dp[9][2]);
dp[5][3] = min(dp[5][3], dp[5][9] + dp[9][3]);
dp[5][4] = min(dp[5][4], dp[5][9] + dp[9][4]);
dp[5][5] = min(dp[5][5], dp[5][9] + dp[9][5]);
dp[5][6] = min(dp[5][6], dp[5][9] + dp[9][6]);
dp[5][7] = min(dp[5][7], dp[5][9] + dp[9][7]);
dp[5][8] = min(dp[5][8], dp[5][9] + dp[9][8]);
dp[5][9] = min(dp[5][9], dp[5][9] + dp[9][9]);
dp[6][0] = min(dp[6][0], dp[6][9] + dp[9][0]);
dp[6][1] = min(dp[6][1], dp[6][9] + dp[9][1]);
dp[6][2] = min(dp[6][2], dp[6][9] + dp[9][2]);
dp[6][3] = min(dp[6][3], dp[6][9] + dp[9][3]);
dp[6][4] = min(dp[6][4], dp[6][9] + dp[9][4]);
dp[6][5] = min(dp[6][5], dp[6][9] + dp[9][5]);
dp[6][6] = min(dp[6][6], dp[6][9] + dp[9][6]);
dp[6][7] = min(dp[6][7], dp[6][9] + dp[9][7]);
dp[6][8] = min(dp[6][8], dp[6][9] + dp[9][8]);
dp[6][9] = min(dp[6][9], dp[6][9] + dp[9][9]);
dp[7][0] = min(dp[7][0], dp[7][9] + dp[9][0]);
dp[7][1] = min(dp[7][1], dp[7][9] + dp[9][1]);
dp[7][2] = min(dp[7][2], dp[7][9] + dp[9][2]);
dp[7][3] = min(dp[7][3], dp[7][9] + dp[9][3]);
dp[7][4] = min(dp[7][4], dp[7][9] + dp[9][4]);
dp[7][5] = min(dp[7][5], dp[7][9] + dp[9][5]);
dp[7][6] = min(dp[7][6], dp[7][9] + dp[9][6]);
dp[7][7] = min(dp[7][7], dp[7][9] + dp[9][7]);
dp[7][8] = min(dp[7][8], dp[7][9] + dp[9][8]);
dp[7][9] = min(dp[7][9], dp[7][9] + dp[9][9]);
dp[8][0] = min(dp[8][0], dp[8][9] + dp[9][0]);
dp[8][1] = min(dp[8][1], dp[8][9] + dp[9][1]);
dp[8][2] = min(dp[8][2], dp[8][9] + dp[9][2]);
dp[8][3] = min(dp[8][3], dp[8][9] + dp[9][3]);
dp[8][4] = min(dp[8][4], dp[8][9] + dp[9][4]);
dp[8][5] = min(dp[8][5], dp[8][9] + dp[9][5]);
dp[8][6] = min(dp[8][6], dp[8][9] + dp[9][6]);
dp[8][7] = min(dp[8][7], dp[8][9] + dp[9][7]);
dp[8][8] = min(dp[8][8], dp[8][9] + dp[9][8]);
dp[8][9] = min(dp[8][9], dp[8][9] + dp[9][9]);
dp[9][0] = min(dp[9][0], dp[9][9] + dp[9][0]);
dp[9][1] = min(dp[9][1], dp[9][9] + dp[9][1]);
dp[9][2] = min(dp[9][2], dp[9][9] + dp[9][2]);
dp[9][3] = min(dp[9][3], dp[9][9] + dp[9][3]);
dp[9][4] = min(dp[9][4], dp[9][9] + dp[9][4]);
dp[9][5] = min(dp[9][5], dp[9][9] + dp[9][5]);
dp[9][6] = min(dp[9][6], dp[9][9] + dp[9][6]);
dp[9][7] = min(dp[9][7], dp[9][9] + dp[9][7]);
dp[9][8] = min(dp[9][8], dp[9][9] + dp[9][8]);
dp[9][9] = min(dp[9][9], dp[9][9] + dp[9][9]);
ans = dp[0][0] != 0x3f3f3f3f ? max(ans, dp[0][0]) : ans;
ans = dp[0][1] != 0x3f3f3f3f ? max(ans, dp[0][1]) : ans;
ans = dp[0][2] != 0x3f3f3f3f ? max(ans, dp[0][2]) : ans;
ans = dp[0][3] != 0x3f3f3f3f ? max(ans, dp[0][3]) : ans;
ans = dp[0][4] != 0x3f3f3f3f ? max(ans, dp[0][4]) : ans;
ans = dp[0][5] != 0x3f3f3f3f ? max(ans, dp[0][5]) : ans;
ans = dp[0][6] != 0x3f3f3f3f ? max(ans, dp[0][6]) : ans;
ans = dp[0][7] != 0x3f3f3f3f ? max(ans, dp[0][7]) : ans;
ans = dp[0][8] != 0x3f3f3f3f ? max(ans, dp[0][8]) : ans;
ans = dp[0][9] != 0x3f3f3f3f ? max(ans, dp[0][9]) : ans;
ans = dp[1][0] != 0x3f3f3f3f ? max(ans, dp[1][0]) : ans;
ans = dp[1][1] != 0x3f3f3f3f ? max(ans, dp[1][1]) : ans;
ans = dp[1][2] != 0x3f3f3f3f ? max(ans, dp[1][2]) : ans;
ans = dp[1][3] != 0x3f3f3f3f ? max(ans, dp[1][3]) : ans;
ans = dp[1][4] != 0x3f3f3f3f ? max(ans, dp[1][4]) : ans;
ans = dp[1][5] != 0x3f3f3f3f ? max(ans, dp[1][5]) : ans;
ans = dp[1][6] != 0x3f3f3f3f ? max(ans, dp[1][6]) : ans;
ans = dp[1][7] != 0x3f3f3f3f ? max(ans, dp[1][7]) : ans;
ans = dp[1][8] != 0x3f3f3f3f ? max(ans, dp[1][8]) : ans;
ans = dp[1][9] != 0x3f3f3f3f ? max(ans, dp[1][9]) : ans;
ans = dp[2][0] != 0x3f3f3f3f ? max(ans, dp[2][0]) : ans;
ans = dp[2][1] != 0x3f3f3f3f ? max(ans, dp[2][1]) : ans;
ans = dp[2][2] != 0x3f3f3f3f ? max(ans, dp[2][2]) : ans;
ans = dp[2][3] != 0x3f3f3f3f ? max(ans, dp[2][3]) : ans;
ans = dp[2][4] != 0x3f3f3f3f ? max(ans, dp[2][4]) : ans;
ans = dp[2][5] != 0x3f3f3f3f ? max(ans, dp[2][5]) : ans;
ans = dp[2][6] != 0x3f3f3f3f ? max(ans, dp[2][6]) : ans;
ans = dp[2][7] != 0x3f3f3f3f ? max(ans, dp[2][7]) : ans;
ans = dp[2][8] != 0x3f3f3f3f ? max(ans, dp[2][8]) : ans;
ans = dp[2][9] != 0x3f3f3f3f ? max(ans, dp[2][9]) : ans;
ans = dp[3][0] != 0x3f3f3f3f ? max(ans, dp[3][0]) : ans;
ans = dp[3][1] != 0x3f3f3f3f ? max(ans, dp[3][1]) : ans;
ans = dp[3][2] != 0x3f3f3f3f ? max(ans, dp[3][2]) : ans;
ans = dp[3][3] != 0x3f3f3f3f ? max(ans, dp[3][3]) : ans;
ans = dp[3][4] != 0x3f3f3f3f ? max(ans, dp[3][4]) : ans;
ans = dp[3][5] != 0x3f3f3f3f ? max(ans, dp[3][5]) : ans;
ans = dp[3][6] != 0x3f3f3f3f ? max(ans, dp[3][6]) : ans;
ans = dp[3][7] != 0x3f3f3f3f ? max(ans, dp[3][7]) : ans;
ans = dp[3][8] != 0x3f3f3f3f ? max(ans, dp[3][8]) : ans;
ans = dp[3][9] != 0x3f3f3f3f ? max(ans, dp[3][9]) : ans;
ans = dp[4][0] != 0x3f3f3f3f ? max(ans, dp[4][0]) : ans;
ans = dp[4][1] != 0x3f3f3f3f ? max(ans, dp[4][1]) : ans;
ans = dp[4][2] != 0x3f3f3f3f ? max(ans, dp[4][2]) : ans;
ans = dp[4][3] != 0x3f3f3f3f ? max(ans, dp[4][3]) : ans;
ans = dp[4][4] != 0x3f3f3f3f ? max(ans, dp[4][4]) : ans;
ans = dp[4][5] != 0x3f3f3f3f ? max(ans, dp[4][5]) : ans;
ans = dp[4][6] != 0x3f3f3f3f ? max(ans, dp[4][6]) : ans;
ans = dp[4][7] != 0x3f3f3f3f ? max(ans, dp[4][7]) : ans;
ans = dp[4][8] != 0x3f3f3f3f ? max(ans, dp[4][8]) : ans;
ans = dp[4][9] != 0x3f3f3f3f ? max(ans, dp[4][9]) : ans;
ans = dp[5][0] != 0x3f3f3f3f ? max(ans, dp[5][0]) : ans;
ans = dp[5][1] != 0x3f3f3f3f ? max(ans, dp[5][1]) : ans;
ans = dp[5][2] != 0x3f3f3f3f ? max(ans, dp[5][2]) : ans;
ans = dp[5][3] != 0x3f3f3f3f ? max(ans, dp[5][3]) : ans;
ans = dp[5][4] != 0x3f3f3f3f ? max(ans, dp[5][4]) : ans;
ans = dp[5][5] != 0x3f3f3f3f ? max(ans, dp[5][5]) : ans;
ans = dp[5][6] != 0x3f3f3f3f ? max(ans, dp[5][6]) : ans;
ans = dp[5][7] != 0x3f3f3f3f ? max(ans, dp[5][7]) : ans;
ans = dp[5][8] != 0x3f3f3f3f ? max(ans, dp[5][8]) : ans;
ans = dp[5][9] != 0x3f3f3f3f ? max(ans, dp[5][9]) : ans;
ans = dp[6][0] != 0x3f3f3f3f ? max(ans, dp[6][0]) : ans;
ans = dp[6][1] != 0x3f3f3f3f ? max(ans, dp[6][1]) : ans;
ans = dp[6][2] != 0x3f3f3f3f ? max(ans, dp[6][2]) : ans;
ans = dp[6][3] != 0x3f3f3f3f ? max(ans, dp[6][3]) : ans;
ans = dp[6][4] != 0x3f3f3f3f ? max(ans, dp[6][4]) : ans;
ans = dp[6][5] != 0x3f3f3f3f ? max(ans, dp[6][5]) : ans;
ans = dp[6][6] != 0x3f3f3f3f ? max(ans, dp[6][6]) : ans;
ans = dp[6][7] != 0x3f3f3f3f ? max(ans, dp[6][7]) : ans;
ans = dp[6][8] != 0x3f3f3f3f ? max(ans, dp[6][8]) : ans;
ans = dp[6][9] != 0x3f3f3f3f ? max(ans, dp[6][9]) : ans;
ans = dp[7][0] != 0x3f3f3f3f ? max(ans, dp[7][0]) : ans;
ans = dp[7][1] != 0x3f3f3f3f ? max(ans, dp[7][1]) : ans;
ans = dp[7][2] != 0x3f3f3f3f ? max(ans, dp[7][2]) : ans;
ans = dp[7][3] != 0x3f3f3f3f ? max(ans, dp[7][3]) : ans;
ans = dp[7][4] != 0x3f3f3f3f ? max(ans, dp[7][4]) : ans;
ans = dp[7][5] != 0x3f3f3f3f ? max(ans, dp[7][5]) : ans;
ans = dp[7][6] != 0x3f3f3f3f ? max(ans, dp[7][6]) : ans;
ans = dp[7][7] != 0x3f3f3f3f ? max(ans, dp[7][7]) : ans;
ans = dp[7][8] != 0x3f3f3f3f ? max(ans, dp[7][8]) : ans;
ans = dp[7][9] != 0x3f3f3f3f ? max(ans, dp[7][9]) : ans;
ans = dp[8][0] != 0x3f3f3f3f ? max(ans, dp[8][0]) : ans;
ans = dp[8][1] != 0x3f3f3f3f ? max(ans, dp[8][1]) : ans;
ans = dp[8][2] != 0x3f3f3f3f ? max(ans, dp[8][2]) : ans;
ans = dp[8][3] != 0x3f3f3f3f ? max(ans, dp[8][3]) : ans;
ans = dp[8][4] != 0x3f3f3f3f ? max(ans, dp[8][4]) : ans;
ans = dp[8][5] != 0x3f3f3f3f ? max(ans, dp[8][5]) : ans;
ans = dp[8][6] != 0x3f3f3f3f ? max(ans, dp[8][6]) : ans;
ans = dp[8][7] != 0x3f3f3f3f ? max(ans, dp[8][7]) : ans;
ans = dp[8][8] != 0x3f3f3f3f ? max(ans, dp[8][8]) : ans;
ans = dp[8][9] != 0x3f3f3f3f ? max(ans, dp[8][9]) : ans;
ans = dp[9][0] != 0x3f3f3f3f ? max(ans, dp[9][0]) : ans;
ans = dp[9][1] != 0x3f3f3f3f ? max(ans, dp[9][1]) : ans;
ans = dp[9][2] != 0x3f3f3f3f ? max(ans, dp[9][2]) : ans;
ans = dp[9][3] != 0x3f3f3f3f ? max(ans, dp[9][3]) : ans;
ans = dp[9][4] != 0x3f3f3f3f ? max(ans, dp[9][4]) : ans;
ans = dp[9][5] != 0x3f3f3f3f ? max(ans, dp[9][5]) : ans;
ans = dp[9][6] != 0x3f3f3f3f ? max(ans, dp[9][6]) : ans;
ans = dp[9][7] != 0x3f3f3f3f ? max(ans, dp[9][7]) : ans;
ans = dp[9][8] != 0x3f3f3f3f ? max(ans, dp[9][8]) : ans;
ans = dp[9][9] != 0x3f3f3f3f ? max(ans, dp[9][9]) : ans;
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const unsigned char N = (unsigned char)10;
unsigned char n;
int x;
unsigned char mat[N][N];
inline unsigned char smin(const unsigned char& a, const unsigned char& b) {
return a < b ? a : b;
}
inline unsigned char smax(const unsigned char& a, const unsigned char& b) {
return a > b ? a : b;
}
inline unsigned char FOR3(const unsigned char& k, const unsigned char& i,
const unsigned char& j) {
mat[i][j] = smin(mat[i][j], mat[i][k] + mat[k][j]);
return j + 1 < n ? FOR3(k, i, j + 1) : 0;
}
inline unsigned char FOR2(const unsigned char& i, const unsigned char& j) {
FOR3(i, j, 0);
return j + 1 < n ? FOR2(i, j + 1) : 0;
}
inline unsigned char FOR1(const unsigned char& i) {
FOR2(i, 0);
return i + 1 < n ? FOR1(i + 1) : 0;
}
inline unsigned char FOR_INPUT2(const unsigned char& i,
const unsigned char& j) {
cin >> x;
mat[i][j] = x;
return j + 1 < n ? FOR_INPUT2(i, j + 1) : 0;
}
inline unsigned char FOR_INPUT1(const unsigned char& i) {
FOR_INPUT2(i, 0);
return i + 1 < n ? FOR_INPUT1(i + 1) : 0;
}
inline unsigned char BILLY2(const unsigned char& i, const unsigned char& j) {
return smax(mat[i][j], j + 1 < n ? BILLY2(i, j + 1) : 0);
}
inline unsigned char BILLY1(const unsigned char& i) {
unsigned char ans = BILLY2(i, 0);
unsigned char other = i + 1 < n ? BILLY1(i + 1) : 0;
return smax(ans, other);
}
inline void solve() {
cin >> x;
n = x;
FOR_INPUT1(0);
FOR1(0);
cout << (short)BILLY1(0) << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int d[10][10];
int main() {
int i, j, n, inf = 100000;
scanf("%d", &n);
i = j = 0;
d[0][0] = inf;
d[0][1] = inf;
d[0][2] = inf;
d[0][3] = inf;
d[0][4] = inf;
d[0][5] = inf;
d[0][6] = inf;
d[0][7] = inf;
d[0][8] = inf;
d[0][9] = inf;
d[1][0] = inf;
d[1][1] = inf;
d[1][2] = inf;
d[1][3] = inf;
d[1][4] = inf;
d[1][5] = inf;
d[1][6] = inf;
d[1][7] = inf;
d[1][8] = inf;
d[1][9] = inf;
d[2][0] = inf;
d[2][1] = inf;
d[2][2] = inf;
d[2][3] = inf;
d[2][4] = inf;
d[2][5] = inf;
d[2][6] = inf;
d[2][7] = inf;
d[2][8] = inf;
d[2][9] = inf;
d[3][0] = inf;
d[3][1] = inf;
d[3][2] = inf;
d[3][3] = inf;
d[3][4] = inf;
d[3][5] = inf;
d[3][6] = inf;
d[3][7] = inf;
d[3][8] = inf;
d[3][9] = inf;
d[4][0] = inf;
d[4][1] = inf;
d[4][2] = inf;
d[4][3] = inf;
d[4][4] = inf;
d[4][5] = inf;
d[4][6] = inf;
d[4][7] = inf;
d[4][8] = inf;
d[4][9] = inf;
d[5][0] = inf;
d[5][1] = inf;
d[5][2] = inf;
d[5][3] = inf;
d[5][4] = inf;
d[5][5] = inf;
d[5][6] = inf;
d[5][7] = inf;
d[5][8] = inf;
d[5][9] = inf;
d[6][0] = inf;
d[6][1] = inf;
d[6][2] = inf;
d[6][3] = inf;
d[6][4] = inf;
d[6][5] = inf;
d[6][6] = inf;
d[6][7] = inf;
d[6][8] = inf;
d[6][9] = inf;
d[7][0] = inf;
d[7][1] = inf;
d[7][2] = inf;
d[7][3] = inf;
d[7][4] = inf;
d[7][5] = inf;
d[7][6] = inf;
d[7][7] = inf;
d[7][8] = inf;
d[7][9] = inf;
d[8][0] = inf;
d[8][1] = inf;
d[8][2] = inf;
d[8][3] = inf;
d[8][4] = inf;
d[8][5] = inf;
d[8][6] = inf;
d[8][7] = inf;
d[8][8] = inf;
d[8][9] = inf;
d[9][0] = inf;
d[9][1] = inf;
d[9][2] = inf;
d[9][3] = inf;
d[9][4] = inf;
d[9][5] = inf;
d[9][6] = inf;
d[9][7] = inf;
d[9][8] = inf;
d[9][9] = inf;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
scanf("%d", &d[i][j]);
i = (i < n) ? ((j == n - 1) ? i + 1 : i) : n;
j = (i < n) ? ((j == n - 1) ? 0 : j + 1) : n;
d[n][n] = inf;
int ans = 0;
d[0][0] = min(d[0][0], d[0][0] + d[0][0]);
d[0][1] = min(d[0][1], d[0][0] + d[0][1]);
d[0][2] = min(d[0][2], d[0][0] + d[0][2]);
d[0][3] = min(d[0][3], d[0][0] + d[0][3]);
d[0][4] = min(d[0][4], d[0][0] + d[0][4]);
d[0][5] = min(d[0][5], d[0][0] + d[0][5]);
d[0][6] = min(d[0][6], d[0][0] + d[0][6]);
d[0][7] = min(d[0][7], d[0][0] + d[0][7]);
d[0][8] = min(d[0][8], d[0][0] + d[0][8]);
d[0][9] = min(d[0][9], d[0][0] + d[0][9]);
d[1][0] = min(d[1][0], d[1][0] + d[0][0]);
d[1][1] = min(d[1][1], d[1][0] + d[0][1]);
d[1][2] = min(d[1][2], d[1][0] + d[0][2]);
d[1][3] = min(d[1][3], d[1][0] + d[0][3]);
d[1][4] = min(d[1][4], d[1][0] + d[0][4]);
d[1][5] = min(d[1][5], d[1][0] + d[0][5]);
d[1][6] = min(d[1][6], d[1][0] + d[0][6]);
d[1][7] = min(d[1][7], d[1][0] + d[0][7]);
d[1][8] = min(d[1][8], d[1][0] + d[0][8]);
d[1][9] = min(d[1][9], d[1][0] + d[0][9]);
d[2][0] = min(d[2][0], d[2][0] + d[0][0]);
d[2][1] = min(d[2][1], d[2][0] + d[0][1]);
d[2][2] = min(d[2][2], d[2][0] + d[0][2]);
d[2][3] = min(d[2][3], d[2][0] + d[0][3]);
d[2][4] = min(d[2][4], d[2][0] + d[0][4]);
d[2][5] = min(d[2][5], d[2][0] + d[0][5]);
d[2][6] = min(d[2][6], d[2][0] + d[0][6]);
d[2][7] = min(d[2][7], d[2][0] + d[0][7]);
d[2][8] = min(d[2][8], d[2][0] + d[0][8]);
d[2][9] = min(d[2][9], d[2][0] + d[0][9]);
d[3][0] = min(d[3][0], d[3][0] + d[0][0]);
d[3][1] = min(d[3][1], d[3][0] + d[0][1]);
d[3][2] = min(d[3][2], d[3][0] + d[0][2]);
d[3][3] = min(d[3][3], d[3][0] + d[0][3]);
d[3][4] = min(d[3][4], d[3][0] + d[0][4]);
d[3][5] = min(d[3][5], d[3][0] + d[0][5]);
d[3][6] = min(d[3][6], d[3][0] + d[0][6]);
d[3][7] = min(d[3][7], d[3][0] + d[0][7]);
d[3][8] = min(d[3][8], d[3][0] + d[0][8]);
d[3][9] = min(d[3][9], d[3][0] + d[0][9]);
d[4][0] = min(d[4][0], d[4][0] + d[0][0]);
d[4][1] = min(d[4][1], d[4][0] + d[0][1]);
d[4][2] = min(d[4][2], d[4][0] + d[0][2]);
d[4][3] = min(d[4][3], d[4][0] + d[0][3]);
d[4][4] = min(d[4][4], d[4][0] + d[0][4]);
d[4][5] = min(d[4][5], d[4][0] + d[0][5]);
d[4][6] = min(d[4][6], d[4][0] + d[0][6]);
d[4][7] = min(d[4][7], d[4][0] + d[0][7]);
d[4][8] = min(d[4][8], d[4][0] + d[0][8]);
d[4][9] = min(d[4][9], d[4][0] + d[0][9]);
d[5][0] = min(d[5][0], d[5][0] + d[0][0]);
d[5][1] = min(d[5][1], d[5][0] + d[0][1]);
d[5][2] = min(d[5][2], d[5][0] + d[0][2]);
d[5][3] = min(d[5][3], d[5][0] + d[0][3]);
d[5][4] = min(d[5][4], d[5][0] + d[0][4]);
d[5][5] = min(d[5][5], d[5][0] + d[0][5]);
d[5][6] = min(d[5][6], d[5][0] + d[0][6]);
d[5][7] = min(d[5][7], d[5][0] + d[0][7]);
d[5][8] = min(d[5][8], d[5][0] + d[0][8]);
d[5][9] = min(d[5][9], d[5][0] + d[0][9]);
d[6][0] = min(d[6][0], d[6][0] + d[0][0]);
d[6][1] = min(d[6][1], d[6][0] + d[0][1]);
d[6][2] = min(d[6][2], d[6][0] + d[0][2]);
d[6][3] = min(d[6][3], d[6][0] + d[0][3]);
d[6][4] = min(d[6][4], d[6][0] + d[0][4]);
d[6][5] = min(d[6][5], d[6][0] + d[0][5]);
d[6][6] = min(d[6][6], d[6][0] + d[0][6]);
d[6][7] = min(d[6][7], d[6][0] + d[0][7]);
d[6][8] = min(d[6][8], d[6][0] + d[0][8]);
d[6][9] = min(d[6][9], d[6][0] + d[0][9]);
d[7][0] = min(d[7][0], d[7][0] + d[0][0]);
d[7][1] = min(d[7][1], d[7][0] + d[0][1]);
d[7][2] = min(d[7][2], d[7][0] + d[0][2]);
d[7][3] = min(d[7][3], d[7][0] + d[0][3]);
d[7][4] = min(d[7][4], d[7][0] + d[0][4]);
d[7][5] = min(d[7][5], d[7][0] + d[0][5]);
d[7][6] = min(d[7][6], d[7][0] + d[0][6]);
d[7][7] = min(d[7][7], d[7][0] + d[0][7]);
d[7][8] = min(d[7][8], d[7][0] + d[0][8]);
d[7][9] = min(d[7][9], d[7][0] + d[0][9]);
d[8][0] = min(d[8][0], d[8][0] + d[0][0]);
d[8][1] = min(d[8][1], d[8][0] + d[0][1]);
d[8][2] = min(d[8][2], d[8][0] + d[0][2]);
d[8][3] = min(d[8][3], d[8][0] + d[0][3]);
d[8][4] = min(d[8][4], d[8][0] + d[0][4]);
d[8][5] = min(d[8][5], d[8][0] + d[0][5]);
d[8][6] = min(d[8][6], d[8][0] + d[0][6]);
d[8][7] = min(d[8][7], d[8][0] + d[0][7]);
d[8][8] = min(d[8][8], d[8][0] + d[0][8]);
d[8][9] = min(d[8][9], d[8][0] + d[0][9]);
d[9][0] = min(d[9][0], d[9][0] + d[0][0]);
d[9][1] = min(d[9][1], d[9][0] + d[0][1]);
d[9][2] = min(d[9][2], d[9][0] + d[0][2]);
d[9][3] = min(d[9][3], d[9][0] + d[0][3]);
d[9][4] = min(d[9][4], d[9][0] + d[0][4]);
d[9][5] = min(d[9][5], d[9][0] + d[0][5]);
d[9][6] = min(d[9][6], d[9][0] + d[0][6]);
d[9][7] = min(d[9][7], d[9][0] + d[0][7]);
d[9][8] = min(d[9][8], d[9][0] + d[0][8]);
d[9][9] = min(d[9][9], d[9][0] + d[0][9]);
d[0][0] = min(d[0][0], d[0][1] + d[1][0]);
d[0][1] = min(d[0][1], d[0][1] + d[1][1]);
d[0][2] = min(d[0][2], d[0][1] + d[1][2]);
d[0][3] = min(d[0][3], d[0][1] + d[1][3]);
d[0][4] = min(d[0][4], d[0][1] + d[1][4]);
d[0][5] = min(d[0][5], d[0][1] + d[1][5]);
d[0][6] = min(d[0][6], d[0][1] + d[1][6]);
d[0][7] = min(d[0][7], d[0][1] + d[1][7]);
d[0][8] = min(d[0][8], d[0][1] + d[1][8]);
d[0][9] = min(d[0][9], d[0][1] + d[1][9]);
d[1][0] = min(d[1][0], d[1][1] + d[1][0]);
d[1][1] = min(d[1][1], d[1][1] + d[1][1]);
d[1][2] = min(d[1][2], d[1][1] + d[1][2]);
d[1][3] = min(d[1][3], d[1][1] + d[1][3]);
d[1][4] = min(d[1][4], d[1][1] + d[1][4]);
d[1][5] = min(d[1][5], d[1][1] + d[1][5]);
d[1][6] = min(d[1][6], d[1][1] + d[1][6]);
d[1][7] = min(d[1][7], d[1][1] + d[1][7]);
d[1][8] = min(d[1][8], d[1][1] + d[1][8]);
d[1][9] = min(d[1][9], d[1][1] + d[1][9]);
d[2][0] = min(d[2][0], d[2][1] + d[1][0]);
d[2][1] = min(d[2][1], d[2][1] + d[1][1]);
d[2][2] = min(d[2][2], d[2][1] + d[1][2]);
d[2][3] = min(d[2][3], d[2][1] + d[1][3]);
d[2][4] = min(d[2][4], d[2][1] + d[1][4]);
d[2][5] = min(d[2][5], d[2][1] + d[1][5]);
d[2][6] = min(d[2][6], d[2][1] + d[1][6]);
d[2][7] = min(d[2][7], d[2][1] + d[1][7]);
d[2][8] = min(d[2][8], d[2][1] + d[1][8]);
d[2][9] = min(d[2][9], d[2][1] + d[1][9]);
d[3][0] = min(d[3][0], d[3][1] + d[1][0]);
d[3][1] = min(d[3][1], d[3][1] + d[1][1]);
d[3][2] = min(d[3][2], d[3][1] + d[1][2]);
d[3][3] = min(d[3][3], d[3][1] + d[1][3]);
d[3][4] = min(d[3][4], d[3][1] + d[1][4]);
d[3][5] = min(d[3][5], d[3][1] + d[1][5]);
d[3][6] = min(d[3][6], d[3][1] + d[1][6]);
d[3][7] = min(d[3][7], d[3][1] + d[1][7]);
d[3][8] = min(d[3][8], d[3][1] + d[1][8]);
d[3][9] = min(d[3][9], d[3][1] + d[1][9]);
d[4][0] = min(d[4][0], d[4][1] + d[1][0]);
d[4][1] = min(d[4][1], d[4][1] + d[1][1]);
d[4][2] = min(d[4][2], d[4][1] + d[1][2]);
d[4][3] = min(d[4][3], d[4][1] + d[1][3]);
d[4][4] = min(d[4][4], d[4][1] + d[1][4]);
d[4][5] = min(d[4][5], d[4][1] + d[1][5]);
d[4][6] = min(d[4][6], d[4][1] + d[1][6]);
d[4][7] = min(d[4][7], d[4][1] + d[1][7]);
d[4][8] = min(d[4][8], d[4][1] + d[1][8]);
d[4][9] = min(d[4][9], d[4][1] + d[1][9]);
d[5][0] = min(d[5][0], d[5][1] + d[1][0]);
d[5][1] = min(d[5][1], d[5][1] + d[1][1]);
d[5][2] = min(d[5][2], d[5][1] + d[1][2]);
d[5][3] = min(d[5][3], d[5][1] + d[1][3]);
d[5][4] = min(d[5][4], d[5][1] + d[1][4]);
d[5][5] = min(d[5][5], d[5][1] + d[1][5]);
d[5][6] = min(d[5][6], d[5][1] + d[1][6]);
d[5][7] = min(d[5][7], d[5][1] + d[1][7]);
d[5][8] = min(d[5][8], d[5][1] + d[1][8]);
d[5][9] = min(d[5][9], d[5][1] + d[1][9]);
d[6][0] = min(d[6][0], d[6][1] + d[1][0]);
d[6][1] = min(d[6][1], d[6][1] + d[1][1]);
d[6][2] = min(d[6][2], d[6][1] + d[1][2]);
d[6][3] = min(d[6][3], d[6][1] + d[1][3]);
d[6][4] = min(d[6][4], d[6][1] + d[1][4]);
d[6][5] = min(d[6][5], d[6][1] + d[1][5]);
d[6][6] = min(d[6][6], d[6][1] + d[1][6]);
d[6][7] = min(d[6][7], d[6][1] + d[1][7]);
d[6][8] = min(d[6][8], d[6][1] + d[1][8]);
d[6][9] = min(d[6][9], d[6][1] + d[1][9]);
d[7][0] = min(d[7][0], d[7][1] + d[1][0]);
d[7][1] = min(d[7][1], d[7][1] + d[1][1]);
d[7][2] = min(d[7][2], d[7][1] + d[1][2]);
d[7][3] = min(d[7][3], d[7][1] + d[1][3]);
d[7][4] = min(d[7][4], d[7][1] + d[1][4]);
d[7][5] = min(d[7][5], d[7][1] + d[1][5]);
d[7][6] = min(d[7][6], d[7][1] + d[1][6]);
d[7][7] = min(d[7][7], d[7][1] + d[1][7]);
d[7][8] = min(d[7][8], d[7][1] + d[1][8]);
d[7][9] = min(d[7][9], d[7][1] + d[1][9]);
d[8][0] = min(d[8][0], d[8][1] + d[1][0]);
d[8][1] = min(d[8][1], d[8][1] + d[1][1]);
d[8][2] = min(d[8][2], d[8][1] + d[1][2]);
d[8][3] = min(d[8][3], d[8][1] + d[1][3]);
d[8][4] = min(d[8][4], d[8][1] + d[1][4]);
d[8][5] = min(d[8][5], d[8][1] + d[1][5]);
d[8][6] = min(d[8][6], d[8][1] + d[1][6]);
d[8][7] = min(d[8][7], d[8][1] + d[1][7]);
d[8][8] = min(d[8][8], d[8][1] + d[1][8]);
d[8][9] = min(d[8][9], d[8][1] + d[1][9]);
d[9][0] = min(d[9][0], d[9][1] + d[1][0]);
d[9][1] = min(d[9][1], d[9][1] + d[1][1]);
d[9][2] = min(d[9][2], d[9][1] + d[1][2]);
d[9][3] = min(d[9][3], d[9][1] + d[1][3]);
d[9][4] = min(d[9][4], d[9][1] + d[1][4]);
d[9][5] = min(d[9][5], d[9][1] + d[1][5]);
d[9][6] = min(d[9][6], d[9][1] + d[1][6]);
d[9][7] = min(d[9][7], d[9][1] + d[1][7]);
d[9][8] = min(d[9][8], d[9][1] + d[1][8]);
d[9][9] = min(d[9][9], d[9][1] + d[1][9]);
d[0][0] = min(d[0][0], d[0][2] + d[2][0]);
d[0][1] = min(d[0][1], d[0][2] + d[2][1]);
d[0][2] = min(d[0][2], d[0][2] + d[2][2]);
d[0][3] = min(d[0][3], d[0][2] + d[2][3]);
d[0][4] = min(d[0][4], d[0][2] + d[2][4]);
d[0][5] = min(d[0][5], d[0][2] + d[2][5]);
d[0][6] = min(d[0][6], d[0][2] + d[2][6]);
d[0][7] = min(d[0][7], d[0][2] + d[2][7]);
d[0][8] = min(d[0][8], d[0][2] + d[2][8]);
d[0][9] = min(d[0][9], d[0][2] + d[2][9]);
d[1][0] = min(d[1][0], d[1][2] + d[2][0]);
d[1][1] = min(d[1][1], d[1][2] + d[2][1]);
d[1][2] = min(d[1][2], d[1][2] + d[2][2]);
d[1][3] = min(d[1][3], d[1][2] + d[2][3]);
d[1][4] = min(d[1][4], d[1][2] + d[2][4]);
d[1][5] = min(d[1][5], d[1][2] + d[2][5]);
d[1][6] = min(d[1][6], d[1][2] + d[2][6]);
d[1][7] = min(d[1][7], d[1][2] + d[2][7]);
d[1][8] = min(d[1][8], d[1][2] + d[2][8]);
d[1][9] = min(d[1][9], d[1][2] + d[2][9]);
d[2][0] = min(d[2][0], d[2][2] + d[2][0]);
d[2][1] = min(d[2][1], d[2][2] + d[2][1]);
d[2][2] = min(d[2][2], d[2][2] + d[2][2]);
d[2][3] = min(d[2][3], d[2][2] + d[2][3]);
d[2][4] = min(d[2][4], d[2][2] + d[2][4]);
d[2][5] = min(d[2][5], d[2][2] + d[2][5]);
d[2][6] = min(d[2][6], d[2][2] + d[2][6]);
d[2][7] = min(d[2][7], d[2][2] + d[2][7]);
d[2][8] = min(d[2][8], d[2][2] + d[2][8]);
d[2][9] = min(d[2][9], d[2][2] + d[2][9]);
d[3][0] = min(d[3][0], d[3][2] + d[2][0]);
d[3][1] = min(d[3][1], d[3][2] + d[2][1]);
d[3][2] = min(d[3][2], d[3][2] + d[2][2]);
d[3][3] = min(d[3][3], d[3][2] + d[2][3]);
d[3][4] = min(d[3][4], d[3][2] + d[2][4]);
d[3][5] = min(d[3][5], d[3][2] + d[2][5]);
d[3][6] = min(d[3][6], d[3][2] + d[2][6]);
d[3][7] = min(d[3][7], d[3][2] + d[2][7]);
d[3][8] = min(d[3][8], d[3][2] + d[2][8]);
d[3][9] = min(d[3][9], d[3][2] + d[2][9]);
d[4][0] = min(d[4][0], d[4][2] + d[2][0]);
d[4][1] = min(d[4][1], d[4][2] + d[2][1]);
d[4][2] = min(d[4][2], d[4][2] + d[2][2]);
d[4][3] = min(d[4][3], d[4][2] + d[2][3]);
d[4][4] = min(d[4][4], d[4][2] + d[2][4]);
d[4][5] = min(d[4][5], d[4][2] + d[2][5]);
d[4][6] = min(d[4][6], d[4][2] + d[2][6]);
d[4][7] = min(d[4][7], d[4][2] + d[2][7]);
d[4][8] = min(d[4][8], d[4][2] + d[2][8]);
d[4][9] = min(d[4][9], d[4][2] + d[2][9]);
d[5][0] = min(d[5][0], d[5][2] + d[2][0]);
d[5][1] = min(d[5][1], d[5][2] + d[2][1]);
d[5][2] = min(d[5][2], d[5][2] + d[2][2]);
d[5][3] = min(d[5][3], d[5][2] + d[2][3]);
d[5][4] = min(d[5][4], d[5][2] + d[2][4]);
d[5][5] = min(d[5][5], d[5][2] + d[2][5]);
d[5][6] = min(d[5][6], d[5][2] + d[2][6]);
d[5][7] = min(d[5][7], d[5][2] + d[2][7]);
d[5][8] = min(d[5][8], d[5][2] + d[2][8]);
d[5][9] = min(d[5][9], d[5][2] + d[2][9]);
d[6][0] = min(d[6][0], d[6][2] + d[2][0]);
d[6][1] = min(d[6][1], d[6][2] + d[2][1]);
d[6][2] = min(d[6][2], d[6][2] + d[2][2]);
d[6][3] = min(d[6][3], d[6][2] + d[2][3]);
d[6][4] = min(d[6][4], d[6][2] + d[2][4]);
d[6][5] = min(d[6][5], d[6][2] + d[2][5]);
d[6][6] = min(d[6][6], d[6][2] + d[2][6]);
d[6][7] = min(d[6][7], d[6][2] + d[2][7]);
d[6][8] = min(d[6][8], d[6][2] + d[2][8]);
d[6][9] = min(d[6][9], d[6][2] + d[2][9]);
d[7][0] = min(d[7][0], d[7][2] + d[2][0]);
d[7][1] = min(d[7][1], d[7][2] + d[2][1]);
d[7][2] = min(d[7][2], d[7][2] + d[2][2]);
d[7][3] = min(d[7][3], d[7][2] + d[2][3]);
d[7][4] = min(d[7][4], d[7][2] + d[2][4]);
d[7][5] = min(d[7][5], d[7][2] + d[2][5]);
d[7][6] = min(d[7][6], d[7][2] + d[2][6]);
d[7][7] = min(d[7][7], d[7][2] + d[2][7]);
d[7][8] = min(d[7][8], d[7][2] + d[2][8]);
d[7][9] = min(d[7][9], d[7][2] + d[2][9]);
d[8][0] = min(d[8][0], d[8][2] + d[2][0]);
d[8][1] = min(d[8][1], d[8][2] + d[2][1]);
d[8][2] = min(d[8][2], d[8][2] + d[2][2]);
d[8][3] = min(d[8][3], d[8][2] + d[2][3]);
d[8][4] = min(d[8][4], d[8][2] + d[2][4]);
d[8][5] = min(d[8][5], d[8][2] + d[2][5]);
d[8][6] = min(d[8][6], d[8][2] + d[2][6]);
d[8][7] = min(d[8][7], d[8][2] + d[2][7]);
d[8][8] = min(d[8][8], d[8][2] + d[2][8]);
d[8][9] = min(d[8][9], d[8][2] + d[2][9]);
d[9][0] = min(d[9][0], d[9][2] + d[2][0]);
d[9][1] = min(d[9][1], d[9][2] + d[2][1]);
d[9][2] = min(d[9][2], d[9][2] + d[2][2]);
d[9][3] = min(d[9][3], d[9][2] + d[2][3]);
d[9][4] = min(d[9][4], d[9][2] + d[2][4]);
d[9][5] = min(d[9][5], d[9][2] + d[2][5]);
d[9][6] = min(d[9][6], d[9][2] + d[2][6]);
d[9][7] = min(d[9][7], d[9][2] + d[2][7]);
d[9][8] = min(d[9][8], d[9][2] + d[2][8]);
d[9][9] = min(d[9][9], d[9][2] + d[2][9]);
d[0][0] = min(d[0][0], d[0][3] + d[3][0]);
d[0][1] = min(d[0][1], d[0][3] + d[3][1]);
d[0][2] = min(d[0][2], d[0][3] + d[3][2]);
d[0][3] = min(d[0][3], d[0][3] + d[3][3]);
d[0][4] = min(d[0][4], d[0][3] + d[3][4]);
d[0][5] = min(d[0][5], d[0][3] + d[3][5]);
d[0][6] = min(d[0][6], d[0][3] + d[3][6]);
d[0][7] = min(d[0][7], d[0][3] + d[3][7]);
d[0][8] = min(d[0][8], d[0][3] + d[3][8]);
d[0][9] = min(d[0][9], d[0][3] + d[3][9]);
d[1][0] = min(d[1][0], d[1][3] + d[3][0]);
d[1][1] = min(d[1][1], d[1][3] + d[3][1]);
d[1][2] = min(d[1][2], d[1][3] + d[3][2]);
d[1][3] = min(d[1][3], d[1][3] + d[3][3]);
d[1][4] = min(d[1][4], d[1][3] + d[3][4]);
d[1][5] = min(d[1][5], d[1][3] + d[3][5]);
d[1][6] = min(d[1][6], d[1][3] + d[3][6]);
d[1][7] = min(d[1][7], d[1][3] + d[3][7]);
d[1][8] = min(d[1][8], d[1][3] + d[3][8]);
d[1][9] = min(d[1][9], d[1][3] + d[3][9]);
d[2][0] = min(d[2][0], d[2][3] + d[3][0]);
d[2][1] = min(d[2][1], d[2][3] + d[3][1]);
d[2][2] = min(d[2][2], d[2][3] + d[3][2]);
d[2][3] = min(d[2][3], d[2][3] + d[3][3]);
d[2][4] = min(d[2][4], d[2][3] + d[3][4]);
d[2][5] = min(d[2][5], d[2][3] + d[3][5]);
d[2][6] = min(d[2][6], d[2][3] + d[3][6]);
d[2][7] = min(d[2][7], d[2][3] + d[3][7]);
d[2][8] = min(d[2][8], d[2][3] + d[3][8]);
d[2][9] = min(d[2][9], d[2][3] + d[3][9]);
d[3][0] = min(d[3][0], d[3][3] + d[3][0]);
d[3][1] = min(d[3][1], d[3][3] + d[3][1]);
d[3][2] = min(d[3][2], d[3][3] + d[3][2]);
d[3][3] = min(d[3][3], d[3][3] + d[3][3]);
d[3][4] = min(d[3][4], d[3][3] + d[3][4]);
d[3][5] = min(d[3][5], d[3][3] + d[3][5]);
d[3][6] = min(d[3][6], d[3][3] + d[3][6]);
d[3][7] = min(d[3][7], d[3][3] + d[3][7]);
d[3][8] = min(d[3][8], d[3][3] + d[3][8]);
d[3][9] = min(d[3][9], d[3][3] + d[3][9]);
d[4][0] = min(d[4][0], d[4][3] + d[3][0]);
d[4][1] = min(d[4][1], d[4][3] + d[3][1]);
d[4][2] = min(d[4][2], d[4][3] + d[3][2]);
d[4][3] = min(d[4][3], d[4][3] + d[3][3]);
d[4][4] = min(d[4][4], d[4][3] + d[3][4]);
d[4][5] = min(d[4][5], d[4][3] + d[3][5]);
d[4][6] = min(d[4][6], d[4][3] + d[3][6]);
d[4][7] = min(d[4][7], d[4][3] + d[3][7]);
d[4][8] = min(d[4][8], d[4][3] + d[3][8]);
d[4][9] = min(d[4][9], d[4][3] + d[3][9]);
d[5][0] = min(d[5][0], d[5][3] + d[3][0]);
d[5][1] = min(d[5][1], d[5][3] + d[3][1]);
d[5][2] = min(d[5][2], d[5][3] + d[3][2]);
d[5][3] = min(d[5][3], d[5][3] + d[3][3]);
d[5][4] = min(d[5][4], d[5][3] + d[3][4]);
d[5][5] = min(d[5][5], d[5][3] + d[3][5]);
d[5][6] = min(d[5][6], d[5][3] + d[3][6]);
d[5][7] = min(d[5][7], d[5][3] + d[3][7]);
d[5][8] = min(d[5][8], d[5][3] + d[3][8]);
d[5][9] = min(d[5][9], d[5][3] + d[3][9]);
d[6][0] = min(d[6][0], d[6][3] + d[3][0]);
d[6][1] = min(d[6][1], d[6][3] + d[3][1]);
d[6][2] = min(d[6][2], d[6][3] + d[3][2]);
d[6][3] = min(d[6][3], d[6][3] + d[3][3]);
d[6][4] = min(d[6][4], d[6][3] + d[3][4]);
d[6][5] = min(d[6][5], d[6][3] + d[3][5]);
d[6][6] = min(d[6][6], d[6][3] + d[3][6]);
d[6][7] = min(d[6][7], d[6][3] + d[3][7]);
d[6][8] = min(d[6][8], d[6][3] + d[3][8]);
d[6][9] = min(d[6][9], d[6][3] + d[3][9]);
d[7][0] = min(d[7][0], d[7][3] + d[3][0]);
d[7][1] = min(d[7][1], d[7][3] + d[3][1]);
d[7][2] = min(d[7][2], d[7][3] + d[3][2]);
d[7][3] = min(d[7][3], d[7][3] + d[3][3]);
d[7][4] = min(d[7][4], d[7][3] + d[3][4]);
d[7][5] = min(d[7][5], d[7][3] + d[3][5]);
d[7][6] = min(d[7][6], d[7][3] + d[3][6]);
d[7][7] = min(d[7][7], d[7][3] + d[3][7]);
d[7][8] = min(d[7][8], d[7][3] + d[3][8]);
d[7][9] = min(d[7][9], d[7][3] + d[3][9]);
d[8][0] = min(d[8][0], d[8][3] + d[3][0]);
d[8][1] = min(d[8][1], d[8][3] + d[3][1]);
d[8][2] = min(d[8][2], d[8][3] + d[3][2]);
d[8][3] = min(d[8][3], d[8][3] + d[3][3]);
d[8][4] = min(d[8][4], d[8][3] + d[3][4]);
d[8][5] = min(d[8][5], d[8][3] + d[3][5]);
d[8][6] = min(d[8][6], d[8][3] + d[3][6]);
d[8][7] = min(d[8][7], d[8][3] + d[3][7]);
d[8][8] = min(d[8][8], d[8][3] + d[3][8]);
d[8][9] = min(d[8][9], d[8][3] + d[3][9]);
d[9][0] = min(d[9][0], d[9][3] + d[3][0]);
d[9][1] = min(d[9][1], d[9][3] + d[3][1]);
d[9][2] = min(d[9][2], d[9][3] + d[3][2]);
d[9][3] = min(d[9][3], d[9][3] + d[3][3]);
d[9][4] = min(d[9][4], d[9][3] + d[3][4]);
d[9][5] = min(d[9][5], d[9][3] + d[3][5]);
d[9][6] = min(d[9][6], d[9][3] + d[3][6]);
d[9][7] = min(d[9][7], d[9][3] + d[3][7]);
d[9][8] = min(d[9][8], d[9][3] + d[3][8]);
d[9][9] = min(d[9][9], d[9][3] + d[3][9]);
d[0][0] = min(d[0][0], d[0][4] + d[4][0]);
d[0][1] = min(d[0][1], d[0][4] + d[4][1]);
d[0][2] = min(d[0][2], d[0][4] + d[4][2]);
d[0][3] = min(d[0][3], d[0][4] + d[4][3]);
d[0][4] = min(d[0][4], d[0][4] + d[4][4]);
d[0][5] = min(d[0][5], d[0][4] + d[4][5]);
d[0][6] = min(d[0][6], d[0][4] + d[4][6]);
d[0][7] = min(d[0][7], d[0][4] + d[4][7]);
d[0][8] = min(d[0][8], d[0][4] + d[4][8]);
d[0][9] = min(d[0][9], d[0][4] + d[4][9]);
d[1][0] = min(d[1][0], d[1][4] + d[4][0]);
d[1][1] = min(d[1][1], d[1][4] + d[4][1]);
d[1][2] = min(d[1][2], d[1][4] + d[4][2]);
d[1][3] = min(d[1][3], d[1][4] + d[4][3]);
d[1][4] = min(d[1][4], d[1][4] + d[4][4]);
d[1][5] = min(d[1][5], d[1][4] + d[4][5]);
d[1][6] = min(d[1][6], d[1][4] + d[4][6]);
d[1][7] = min(d[1][7], d[1][4] + d[4][7]);
d[1][8] = min(d[1][8], d[1][4] + d[4][8]);
d[1][9] = min(d[1][9], d[1][4] + d[4][9]);
d[2][0] = min(d[2][0], d[2][4] + d[4][0]);
d[2][1] = min(d[2][1], d[2][4] + d[4][1]);
d[2][2] = min(d[2][2], d[2][4] + d[4][2]);
d[2][3] = min(d[2][3], d[2][4] + d[4][3]);
d[2][4] = min(d[2][4], d[2][4] + d[4][4]);
d[2][5] = min(d[2][5], d[2][4] + d[4][5]);
d[2][6] = min(d[2][6], d[2][4] + d[4][6]);
d[2][7] = min(d[2][7], d[2][4] + d[4][7]);
d[2][8] = min(d[2][8], d[2][4] + d[4][8]);
d[2][9] = min(d[2][9], d[2][4] + d[4][9]);
d[3][0] = min(d[3][0], d[3][4] + d[4][0]);
d[3][1] = min(d[3][1], d[3][4] + d[4][1]);
d[3][2] = min(d[3][2], d[3][4] + d[4][2]);
d[3][3] = min(d[3][3], d[3][4] + d[4][3]);
d[3][4] = min(d[3][4], d[3][4] + d[4][4]);
d[3][5] = min(d[3][5], d[3][4] + d[4][5]);
d[3][6] = min(d[3][6], d[3][4] + d[4][6]);
d[3][7] = min(d[3][7], d[3][4] + d[4][7]);
d[3][8] = min(d[3][8], d[3][4] + d[4][8]);
d[3][9] = min(d[3][9], d[3][4] + d[4][9]);
d[4][0] = min(d[4][0], d[4][4] + d[4][0]);
d[4][1] = min(d[4][1], d[4][4] + d[4][1]);
d[4][2] = min(d[4][2], d[4][4] + d[4][2]);
d[4][3] = min(d[4][3], d[4][4] + d[4][3]);
d[4][4] = min(d[4][4], d[4][4] + d[4][4]);
d[4][5] = min(d[4][5], d[4][4] + d[4][5]);
d[4][6] = min(d[4][6], d[4][4] + d[4][6]);
d[4][7] = min(d[4][7], d[4][4] + d[4][7]);
d[4][8] = min(d[4][8], d[4][4] + d[4][8]);
d[4][9] = min(d[4][9], d[4][4] + d[4][9]);
d[5][0] = min(d[5][0], d[5][4] + d[4][0]);
d[5][1] = min(d[5][1], d[5][4] + d[4][1]);
d[5][2] = min(d[5][2], d[5][4] + d[4][2]);
d[5][3] = min(d[5][3], d[5][4] + d[4][3]);
d[5][4] = min(d[5][4], d[5][4] + d[4][4]);
d[5][5] = min(d[5][5], d[5][4] + d[4][5]);
d[5][6] = min(d[5][6], d[5][4] + d[4][6]);
d[5][7] = min(d[5][7], d[5][4] + d[4][7]);
d[5][8] = min(d[5][8], d[5][4] + d[4][8]);
d[5][9] = min(d[5][9], d[5][4] + d[4][9]);
d[6][0] = min(d[6][0], d[6][4] + d[4][0]);
d[6][1] = min(d[6][1], d[6][4] + d[4][1]);
d[6][2] = min(d[6][2], d[6][4] + d[4][2]);
d[6][3] = min(d[6][3], d[6][4] + d[4][3]);
d[6][4] = min(d[6][4], d[6][4] + d[4][4]);
d[6][5] = min(d[6][5], d[6][4] + d[4][5]);
d[6][6] = min(d[6][6], d[6][4] + d[4][6]);
d[6][7] = min(d[6][7], d[6][4] + d[4][7]);
d[6][8] = min(d[6][8], d[6][4] + d[4][8]);
d[6][9] = min(d[6][9], d[6][4] + d[4][9]);
d[7][0] = min(d[7][0], d[7][4] + d[4][0]);
d[7][1] = min(d[7][1], d[7][4] + d[4][1]);
d[7][2] = min(d[7][2], d[7][4] + d[4][2]);
d[7][3] = min(d[7][3], d[7][4] + d[4][3]);
d[7][4] = min(d[7][4], d[7][4] + d[4][4]);
d[7][5] = min(d[7][5], d[7][4] + d[4][5]);
d[7][6] = min(d[7][6], d[7][4] + d[4][6]);
d[7][7] = min(d[7][7], d[7][4] + d[4][7]);
d[7][8] = min(d[7][8], d[7][4] + d[4][8]);
d[7][9] = min(d[7][9], d[7][4] + d[4][9]);
d[8][0] = min(d[8][0], d[8][4] + d[4][0]);
d[8][1] = min(d[8][1], d[8][4] + d[4][1]);
d[8][2] = min(d[8][2], d[8][4] + d[4][2]);
d[8][3] = min(d[8][3], d[8][4] + d[4][3]);
d[8][4] = min(d[8][4], d[8][4] + d[4][4]);
d[8][5] = min(d[8][5], d[8][4] + d[4][5]);
d[8][6] = min(d[8][6], d[8][4] + d[4][6]);
d[8][7] = min(d[8][7], d[8][4] + d[4][7]);
d[8][8] = min(d[8][8], d[8][4] + d[4][8]);
d[8][9] = min(d[8][9], d[8][4] + d[4][9]);
d[9][0] = min(d[9][0], d[9][4] + d[4][0]);
d[9][1] = min(d[9][1], d[9][4] + d[4][1]);
d[9][2] = min(d[9][2], d[9][4] + d[4][2]);
d[9][3] = min(d[9][3], d[9][4] + d[4][3]);
d[9][4] = min(d[9][4], d[9][4] + d[4][4]);
d[9][5] = min(d[9][5], d[9][4] + d[4][5]);
d[9][6] = min(d[9][6], d[9][4] + d[4][6]);
d[9][7] = min(d[9][7], d[9][4] + d[4][7]);
d[9][8] = min(d[9][8], d[9][4] + d[4][8]);
d[9][9] = min(d[9][9], d[9][4] + d[4][9]);
d[0][0] = min(d[0][0], d[0][5] + d[5][0]);
d[0][1] = min(d[0][1], d[0][5] + d[5][1]);
d[0][2] = min(d[0][2], d[0][5] + d[5][2]);
d[0][3] = min(d[0][3], d[0][5] + d[5][3]);
d[0][4] = min(d[0][4], d[0][5] + d[5][4]);
d[0][5] = min(d[0][5], d[0][5] + d[5][5]);
d[0][6] = min(d[0][6], d[0][5] + d[5][6]);
d[0][7] = min(d[0][7], d[0][5] + d[5][7]);
d[0][8] = min(d[0][8], d[0][5] + d[5][8]);
d[0][9] = min(d[0][9], d[0][5] + d[5][9]);
d[1][0] = min(d[1][0], d[1][5] + d[5][0]);
d[1][1] = min(d[1][1], d[1][5] + d[5][1]);
d[1][2] = min(d[1][2], d[1][5] + d[5][2]);
d[1][3] = min(d[1][3], d[1][5] + d[5][3]);
d[1][4] = min(d[1][4], d[1][5] + d[5][4]);
d[1][5] = min(d[1][5], d[1][5] + d[5][5]);
d[1][6] = min(d[1][6], d[1][5] + d[5][6]);
d[1][7] = min(d[1][7], d[1][5] + d[5][7]);
d[1][8] = min(d[1][8], d[1][5] + d[5][8]);
d[1][9] = min(d[1][9], d[1][5] + d[5][9]);
d[2][0] = min(d[2][0], d[2][5] + d[5][0]);
d[2][1] = min(d[2][1], d[2][5] + d[5][1]);
d[2][2] = min(d[2][2], d[2][5] + d[5][2]);
d[2][3] = min(d[2][3], d[2][5] + d[5][3]);
d[2][4] = min(d[2][4], d[2][5] + d[5][4]);
d[2][5] = min(d[2][5], d[2][5] + d[5][5]);
d[2][6] = min(d[2][6], d[2][5] + d[5][6]);
d[2][7] = min(d[2][7], d[2][5] + d[5][7]);
d[2][8] = min(d[2][8], d[2][5] + d[5][8]);
d[2][9] = min(d[2][9], d[2][5] + d[5][9]);
d[3][0] = min(d[3][0], d[3][5] + d[5][0]);
d[3][1] = min(d[3][1], d[3][5] + d[5][1]);
d[3][2] = min(d[3][2], d[3][5] + d[5][2]);
d[3][3] = min(d[3][3], d[3][5] + d[5][3]);
d[3][4] = min(d[3][4], d[3][5] + d[5][4]);
d[3][5] = min(d[3][5], d[3][5] + d[5][5]);
d[3][6] = min(d[3][6], d[3][5] + d[5][6]);
d[3][7] = min(d[3][7], d[3][5] + d[5][7]);
d[3][8] = min(d[3][8], d[3][5] + d[5][8]);
d[3][9] = min(d[3][9], d[3][5] + d[5][9]);
d[4][0] = min(d[4][0], d[4][5] + d[5][0]);
d[4][1] = min(d[4][1], d[4][5] + d[5][1]);
d[4][2] = min(d[4][2], d[4][5] + d[5][2]);
d[4][3] = min(d[4][3], d[4][5] + d[5][3]);
d[4][4] = min(d[4][4], d[4][5] + d[5][4]);
d[4][5] = min(d[4][5], d[4][5] + d[5][5]);
d[4][6] = min(d[4][6], d[4][5] + d[5][6]);
d[4][7] = min(d[4][7], d[4][5] + d[5][7]);
d[4][8] = min(d[4][8], d[4][5] + d[5][8]);
d[4][9] = min(d[4][9], d[4][5] + d[5][9]);
d[5][0] = min(d[5][0], d[5][5] + d[5][0]);
d[5][1] = min(d[5][1], d[5][5] + d[5][1]);
d[5][2] = min(d[5][2], d[5][5] + d[5][2]);
d[5][3] = min(d[5][3], d[5][5] + d[5][3]);
d[5][4] = min(d[5][4], d[5][5] + d[5][4]);
d[5][5] = min(d[5][5], d[5][5] + d[5][5]);
d[5][6] = min(d[5][6], d[5][5] + d[5][6]);
d[5][7] = min(d[5][7], d[5][5] + d[5][7]);
d[5][8] = min(d[5][8], d[5][5] + d[5][8]);
d[5][9] = min(d[5][9], d[5][5] + d[5][9]);
d[6][0] = min(d[6][0], d[6][5] + d[5][0]);
d[6][1] = min(d[6][1], d[6][5] + d[5][1]);
d[6][2] = min(d[6][2], d[6][5] + d[5][2]);
d[6][3] = min(d[6][3], d[6][5] + d[5][3]);
d[6][4] = min(d[6][4], d[6][5] + d[5][4]);
d[6][5] = min(d[6][5], d[6][5] + d[5][5]);
d[6][6] = min(d[6][6], d[6][5] + d[5][6]);
d[6][7] = min(d[6][7], d[6][5] + d[5][7]);
d[6][8] = min(d[6][8], d[6][5] + d[5][8]);
d[6][9] = min(d[6][9], d[6][5] + d[5][9]);
d[7][0] = min(d[7][0], d[7][5] + d[5][0]);
d[7][1] = min(d[7][1], d[7][5] + d[5][1]);
d[7][2] = min(d[7][2], d[7][5] + d[5][2]);
d[7][3] = min(d[7][3], d[7][5] + d[5][3]);
d[7][4] = min(d[7][4], d[7][5] + d[5][4]);
d[7][5] = min(d[7][5], d[7][5] + d[5][5]);
d[7][6] = min(d[7][6], d[7][5] + d[5][6]);
d[7][7] = min(d[7][7], d[7][5] + d[5][7]);
d[7][8] = min(d[7][8], d[7][5] + d[5][8]);
d[7][9] = min(d[7][9], d[7][5] + d[5][9]);
d[8][0] = min(d[8][0], d[8][5] + d[5][0]);
d[8][1] = min(d[8][1], d[8][5] + d[5][1]);
d[8][2] = min(d[8][2], d[8][5] + d[5][2]);
d[8][3] = min(d[8][3], d[8][5] + d[5][3]);
d[8][4] = min(d[8][4], d[8][5] + d[5][4]);
d[8][5] = min(d[8][5], d[8][5] + d[5][5]);
d[8][6] = min(d[8][6], d[8][5] + d[5][6]);
d[8][7] = min(d[8][7], d[8][5] + d[5][7]);
d[8][8] = min(d[8][8], d[8][5] + d[5][8]);
d[8][9] = min(d[8][9], d[8][5] + d[5][9]);
d[9][0] = min(d[9][0], d[9][5] + d[5][0]);
d[9][1] = min(d[9][1], d[9][5] + d[5][1]);
d[9][2] = min(d[9][2], d[9][5] + d[5][2]);
d[9][3] = min(d[9][3], d[9][5] + d[5][3]);
d[9][4] = min(d[9][4], d[9][5] + d[5][4]);
d[9][5] = min(d[9][5], d[9][5] + d[5][5]);
d[9][6] = min(d[9][6], d[9][5] + d[5][6]);
d[9][7] = min(d[9][7], d[9][5] + d[5][7]);
d[9][8] = min(d[9][8], d[9][5] + d[5][8]);
d[9][9] = min(d[9][9], d[9][5] + d[5][9]);
d[0][0] = min(d[0][0], d[0][6] + d[6][0]);
d[0][1] = min(d[0][1], d[0][6] + d[6][1]);
d[0][2] = min(d[0][2], d[0][6] + d[6][2]);
d[0][3] = min(d[0][3], d[0][6] + d[6][3]);
d[0][4] = min(d[0][4], d[0][6] + d[6][4]);
d[0][5] = min(d[0][5], d[0][6] + d[6][5]);
d[0][6] = min(d[0][6], d[0][6] + d[6][6]);
d[0][7] = min(d[0][7], d[0][6] + d[6][7]);
d[0][8] = min(d[0][8], d[0][6] + d[6][8]);
d[0][9] = min(d[0][9], d[0][6] + d[6][9]);
d[1][0] = min(d[1][0], d[1][6] + d[6][0]);
d[1][1] = min(d[1][1], d[1][6] + d[6][1]);
d[1][2] = min(d[1][2], d[1][6] + d[6][2]);
d[1][3] = min(d[1][3], d[1][6] + d[6][3]);
d[1][4] = min(d[1][4], d[1][6] + d[6][4]);
d[1][5] = min(d[1][5], d[1][6] + d[6][5]);
d[1][6] = min(d[1][6], d[1][6] + d[6][6]);
d[1][7] = min(d[1][7], d[1][6] + d[6][7]);
d[1][8] = min(d[1][8], d[1][6] + d[6][8]);
d[1][9] = min(d[1][9], d[1][6] + d[6][9]);
d[2][0] = min(d[2][0], d[2][6] + d[6][0]);
d[2][1] = min(d[2][1], d[2][6] + d[6][1]);
d[2][2] = min(d[2][2], d[2][6] + d[6][2]);
d[2][3] = min(d[2][3], d[2][6] + d[6][3]);
d[2][4] = min(d[2][4], d[2][6] + d[6][4]);
d[2][5] = min(d[2][5], d[2][6] + d[6][5]);
d[2][6] = min(d[2][6], d[2][6] + d[6][6]);
d[2][7] = min(d[2][7], d[2][6] + d[6][7]);
d[2][8] = min(d[2][8], d[2][6] + d[6][8]);
d[2][9] = min(d[2][9], d[2][6] + d[6][9]);
d[3][0] = min(d[3][0], d[3][6] + d[6][0]);
d[3][1] = min(d[3][1], d[3][6] + d[6][1]);
d[3][2] = min(d[3][2], d[3][6] + d[6][2]);
d[3][3] = min(d[3][3], d[3][6] + d[6][3]);
d[3][4] = min(d[3][4], d[3][6] + d[6][4]);
d[3][5] = min(d[3][5], d[3][6] + d[6][5]);
d[3][6] = min(d[3][6], d[3][6] + d[6][6]);
d[3][7] = min(d[3][7], d[3][6] + d[6][7]);
d[3][8] = min(d[3][8], d[3][6] + d[6][8]);
d[3][9] = min(d[3][9], d[3][6] + d[6][9]);
d[4][0] = min(d[4][0], d[4][6] + d[6][0]);
d[4][1] = min(d[4][1], d[4][6] + d[6][1]);
d[4][2] = min(d[4][2], d[4][6] + d[6][2]);
d[4][3] = min(d[4][3], d[4][6] + d[6][3]);
d[4][4] = min(d[4][4], d[4][6] + d[6][4]);
d[4][5] = min(d[4][5], d[4][6] + d[6][5]);
d[4][6] = min(d[4][6], d[4][6] + d[6][6]);
d[4][7] = min(d[4][7], d[4][6] + d[6][7]);
d[4][8] = min(d[4][8], d[4][6] + d[6][8]);
d[4][9] = min(d[4][9], d[4][6] + d[6][9]);
d[5][0] = min(d[5][0], d[5][6] + d[6][0]);
d[5][1] = min(d[5][1], d[5][6] + d[6][1]);
d[5][2] = min(d[5][2], d[5][6] + d[6][2]);
d[5][3] = min(d[5][3], d[5][6] + d[6][3]);
d[5][4] = min(d[5][4], d[5][6] + d[6][4]);
d[5][5] = min(d[5][5], d[5][6] + d[6][5]);
d[5][6] = min(d[5][6], d[5][6] + d[6][6]);
d[5][7] = min(d[5][7], d[5][6] + d[6][7]);
d[5][8] = min(d[5][8], d[5][6] + d[6][8]);
d[5][9] = min(d[5][9], d[5][6] + d[6][9]);
d[6][0] = min(d[6][0], d[6][6] + d[6][0]);
d[6][1] = min(d[6][1], d[6][6] + d[6][1]);
d[6][2] = min(d[6][2], d[6][6] + d[6][2]);
d[6][3] = min(d[6][3], d[6][6] + d[6][3]);
d[6][4] = min(d[6][4], d[6][6] + d[6][4]);
d[6][5] = min(d[6][5], d[6][6] + d[6][5]);
d[6][6] = min(d[6][6], d[6][6] + d[6][6]);
d[6][7] = min(d[6][7], d[6][6] + d[6][7]);
d[6][8] = min(d[6][8], d[6][6] + d[6][8]);
d[6][9] = min(d[6][9], d[6][6] + d[6][9]);
d[7][0] = min(d[7][0], d[7][6] + d[6][0]);
d[7][1] = min(d[7][1], d[7][6] + d[6][1]);
d[7][2] = min(d[7][2], d[7][6] + d[6][2]);
d[7][3] = min(d[7][3], d[7][6] + d[6][3]);
d[7][4] = min(d[7][4], d[7][6] + d[6][4]);
d[7][5] = min(d[7][5], d[7][6] + d[6][5]);
d[7][6] = min(d[7][6], d[7][6] + d[6][6]);
d[7][7] = min(d[7][7], d[7][6] + d[6][7]);
d[7][8] = min(d[7][8], d[7][6] + d[6][8]);
d[7][9] = min(d[7][9], d[7][6] + d[6][9]);
d[8][0] = min(d[8][0], d[8][6] + d[6][0]);
d[8][1] = min(d[8][1], d[8][6] + d[6][1]);
d[8][2] = min(d[8][2], d[8][6] + d[6][2]);
d[8][3] = min(d[8][3], d[8][6] + d[6][3]);
d[8][4] = min(d[8][4], d[8][6] + d[6][4]);
d[8][5] = min(d[8][5], d[8][6] + d[6][5]);
d[8][6] = min(d[8][6], d[8][6] + d[6][6]);
d[8][7] = min(d[8][7], d[8][6] + d[6][7]);
d[8][8] = min(d[8][8], d[8][6] + d[6][8]);
d[8][9] = min(d[8][9], d[8][6] + d[6][9]);
d[9][0] = min(d[9][0], d[9][6] + d[6][0]);
d[9][1] = min(d[9][1], d[9][6] + d[6][1]);
d[9][2] = min(d[9][2], d[9][6] + d[6][2]);
d[9][3] = min(d[9][3], d[9][6] + d[6][3]);
d[9][4] = min(d[9][4], d[9][6] + d[6][4]);
d[9][5] = min(d[9][5], d[9][6] + d[6][5]);
d[9][6] = min(d[9][6], d[9][6] + d[6][6]);
d[9][7] = min(d[9][7], d[9][6] + d[6][7]);
d[9][8] = min(d[9][8], d[9][6] + d[6][8]);
d[9][9] = min(d[9][9], d[9][6] + d[6][9]);
d[0][0] = min(d[0][0], d[0][7] + d[7][0]);
d[0][1] = min(d[0][1], d[0][7] + d[7][1]);
d[0][2] = min(d[0][2], d[0][7] + d[7][2]);
d[0][3] = min(d[0][3], d[0][7] + d[7][3]);
d[0][4] = min(d[0][4], d[0][7] + d[7][4]);
d[0][5] = min(d[0][5], d[0][7] + d[7][5]);
d[0][6] = min(d[0][6], d[0][7] + d[7][6]);
d[0][7] = min(d[0][7], d[0][7] + d[7][7]);
d[0][8] = min(d[0][8], d[0][7] + d[7][8]);
d[0][9] = min(d[0][9], d[0][7] + d[7][9]);
d[1][0] = min(d[1][0], d[1][7] + d[7][0]);
d[1][1] = min(d[1][1], d[1][7] + d[7][1]);
d[1][2] = min(d[1][2], d[1][7] + d[7][2]);
d[1][3] = min(d[1][3], d[1][7] + d[7][3]);
d[1][4] = min(d[1][4], d[1][7] + d[7][4]);
d[1][5] = min(d[1][5], d[1][7] + d[7][5]);
d[1][6] = min(d[1][6], d[1][7] + d[7][6]);
d[1][7] = min(d[1][7], d[1][7] + d[7][7]);
d[1][8] = min(d[1][8], d[1][7] + d[7][8]);
d[1][9] = min(d[1][9], d[1][7] + d[7][9]);
d[2][0] = min(d[2][0], d[2][7] + d[7][0]);
d[2][1] = min(d[2][1], d[2][7] + d[7][1]);
d[2][2] = min(d[2][2], d[2][7] + d[7][2]);
d[2][3] = min(d[2][3], d[2][7] + d[7][3]);
d[2][4] = min(d[2][4], d[2][7] + d[7][4]);
d[2][5] = min(d[2][5], d[2][7] + d[7][5]);
d[2][6] = min(d[2][6], d[2][7] + d[7][6]);
d[2][7] = min(d[2][7], d[2][7] + d[7][7]);
d[2][8] = min(d[2][8], d[2][7] + d[7][8]);
d[2][9] = min(d[2][9], d[2][7] + d[7][9]);
d[3][0] = min(d[3][0], d[3][7] + d[7][0]);
d[3][1] = min(d[3][1], d[3][7] + d[7][1]);
d[3][2] = min(d[3][2], d[3][7] + d[7][2]);
d[3][3] = min(d[3][3], d[3][7] + d[7][3]);
d[3][4] = min(d[3][4], d[3][7] + d[7][4]);
d[3][5] = min(d[3][5], d[3][7] + d[7][5]);
d[3][6] = min(d[3][6], d[3][7] + d[7][6]);
d[3][7] = min(d[3][7], d[3][7] + d[7][7]);
d[3][8] = min(d[3][8], d[3][7] + d[7][8]);
d[3][9] = min(d[3][9], d[3][7] + d[7][9]);
d[4][0] = min(d[4][0], d[4][7] + d[7][0]);
d[4][1] = min(d[4][1], d[4][7] + d[7][1]);
d[4][2] = min(d[4][2], d[4][7] + d[7][2]);
d[4][3] = min(d[4][3], d[4][7] + d[7][3]);
d[4][4] = min(d[4][4], d[4][7] + d[7][4]);
d[4][5] = min(d[4][5], d[4][7] + d[7][5]);
d[4][6] = min(d[4][6], d[4][7] + d[7][6]);
d[4][7] = min(d[4][7], d[4][7] + d[7][7]);
d[4][8] = min(d[4][8], d[4][7] + d[7][8]);
d[4][9] = min(d[4][9], d[4][7] + d[7][9]);
d[5][0] = min(d[5][0], d[5][7] + d[7][0]);
d[5][1] = min(d[5][1], d[5][7] + d[7][1]);
d[5][2] = min(d[5][2], d[5][7] + d[7][2]);
d[5][3] = min(d[5][3], d[5][7] + d[7][3]);
d[5][4] = min(d[5][4], d[5][7] + d[7][4]);
d[5][5] = min(d[5][5], d[5][7] + d[7][5]);
d[5][6] = min(d[5][6], d[5][7] + d[7][6]);
d[5][7] = min(d[5][7], d[5][7] + d[7][7]);
d[5][8] = min(d[5][8], d[5][7] + d[7][8]);
d[5][9] = min(d[5][9], d[5][7] + d[7][9]);
d[6][0] = min(d[6][0], d[6][7] + d[7][0]);
d[6][1] = min(d[6][1], d[6][7] + d[7][1]);
d[6][2] = min(d[6][2], d[6][7] + d[7][2]);
d[6][3] = min(d[6][3], d[6][7] + d[7][3]);
d[6][4] = min(d[6][4], d[6][7] + d[7][4]);
d[6][5] = min(d[6][5], d[6][7] + d[7][5]);
d[6][6] = min(d[6][6], d[6][7] + d[7][6]);
d[6][7] = min(d[6][7], d[6][7] + d[7][7]);
d[6][8] = min(d[6][8], d[6][7] + d[7][8]);
d[6][9] = min(d[6][9], d[6][7] + d[7][9]);
d[7][0] = min(d[7][0], d[7][7] + d[7][0]);
d[7][1] = min(d[7][1], d[7][7] + d[7][1]);
d[7][2] = min(d[7][2], d[7][7] + d[7][2]);
d[7][3] = min(d[7][3], d[7][7] + d[7][3]);
d[7][4] = min(d[7][4], d[7][7] + d[7][4]);
d[7][5] = min(d[7][5], d[7][7] + d[7][5]);
d[7][6] = min(d[7][6], d[7][7] + d[7][6]);
d[7][7] = min(d[7][7], d[7][7] + d[7][7]);
d[7][8] = min(d[7][8], d[7][7] + d[7][8]);
d[7][9] = min(d[7][9], d[7][7] + d[7][9]);
d[8][0] = min(d[8][0], d[8][7] + d[7][0]);
d[8][1] = min(d[8][1], d[8][7] + d[7][1]);
d[8][2] = min(d[8][2], d[8][7] + d[7][2]);
d[8][3] = min(d[8][3], d[8][7] + d[7][3]);
d[8][4] = min(d[8][4], d[8][7] + d[7][4]);
d[8][5] = min(d[8][5], d[8][7] + d[7][5]);
d[8][6] = min(d[8][6], d[8][7] + d[7][6]);
d[8][7] = min(d[8][7], d[8][7] + d[7][7]);
d[8][8] = min(d[8][8], d[8][7] + d[7][8]);
d[8][9] = min(d[8][9], d[8][7] + d[7][9]);
d[9][0] = min(d[9][0], d[9][7] + d[7][0]);
d[9][1] = min(d[9][1], d[9][7] + d[7][1]);
d[9][2] = min(d[9][2], d[9][7] + d[7][2]);
d[9][3] = min(d[9][3], d[9][7] + d[7][3]);
d[9][4] = min(d[9][4], d[9][7] + d[7][4]);
d[9][5] = min(d[9][5], d[9][7] + d[7][5]);
d[9][6] = min(d[9][6], d[9][7] + d[7][6]);
d[9][7] = min(d[9][7], d[9][7] + d[7][7]);
d[9][8] = min(d[9][8], d[9][7] + d[7][8]);
d[9][9] = min(d[9][9], d[9][7] + d[7][9]);
d[0][0] = min(d[0][0], d[0][8] + d[8][0]);
d[0][1] = min(d[0][1], d[0][8] + d[8][1]);
d[0][2] = min(d[0][2], d[0][8] + d[8][2]);
d[0][3] = min(d[0][3], d[0][8] + d[8][3]);
d[0][4] = min(d[0][4], d[0][8] + d[8][4]);
d[0][5] = min(d[0][5], d[0][8] + d[8][5]);
d[0][6] = min(d[0][6], d[0][8] + d[8][6]);
d[0][7] = min(d[0][7], d[0][8] + d[8][7]);
d[0][8] = min(d[0][8], d[0][8] + d[8][8]);
d[0][9] = min(d[0][9], d[0][8] + d[8][9]);
d[1][0] = min(d[1][0], d[1][8] + d[8][0]);
d[1][1] = min(d[1][1], d[1][8] + d[8][1]);
d[1][2] = min(d[1][2], d[1][8] + d[8][2]);
d[1][3] = min(d[1][3], d[1][8] + d[8][3]);
d[1][4] = min(d[1][4], d[1][8] + d[8][4]);
d[1][5] = min(d[1][5], d[1][8] + d[8][5]);
d[1][6] = min(d[1][6], d[1][8] + d[8][6]);
d[1][7] = min(d[1][7], d[1][8] + d[8][7]);
d[1][8] = min(d[1][8], d[1][8] + d[8][8]);
d[1][9] = min(d[1][9], d[1][8] + d[8][9]);
d[2][0] = min(d[2][0], d[2][8] + d[8][0]);
d[2][1] = min(d[2][1], d[2][8] + d[8][1]);
d[2][2] = min(d[2][2], d[2][8] + d[8][2]);
d[2][3] = min(d[2][3], d[2][8] + d[8][3]);
d[2][4] = min(d[2][4], d[2][8] + d[8][4]);
d[2][5] = min(d[2][5], d[2][8] + d[8][5]);
d[2][6] = min(d[2][6], d[2][8] + d[8][6]);
d[2][7] = min(d[2][7], d[2][8] + d[8][7]);
d[2][8] = min(d[2][8], d[2][8] + d[8][8]);
d[2][9] = min(d[2][9], d[2][8] + d[8][9]);
d[3][0] = min(d[3][0], d[3][8] + d[8][0]);
d[3][1] = min(d[3][1], d[3][8] + d[8][1]);
d[3][2] = min(d[3][2], d[3][8] + d[8][2]);
d[3][3] = min(d[3][3], d[3][8] + d[8][3]);
d[3][4] = min(d[3][4], d[3][8] + d[8][4]);
d[3][5] = min(d[3][5], d[3][8] + d[8][5]);
d[3][6] = min(d[3][6], d[3][8] + d[8][6]);
d[3][7] = min(d[3][7], d[3][8] + d[8][7]);
d[3][8] = min(d[3][8], d[3][8] + d[8][8]);
d[3][9] = min(d[3][9], d[3][8] + d[8][9]);
d[4][0] = min(d[4][0], d[4][8] + d[8][0]);
d[4][1] = min(d[4][1], d[4][8] + d[8][1]);
d[4][2] = min(d[4][2], d[4][8] + d[8][2]);
d[4][3] = min(d[4][3], d[4][8] + d[8][3]);
d[4][4] = min(d[4][4], d[4][8] + d[8][4]);
d[4][5] = min(d[4][5], d[4][8] + d[8][5]);
d[4][6] = min(d[4][6], d[4][8] + d[8][6]);
d[4][7] = min(d[4][7], d[4][8] + d[8][7]);
d[4][8] = min(d[4][8], d[4][8] + d[8][8]);
d[4][9] = min(d[4][9], d[4][8] + d[8][9]);
d[5][0] = min(d[5][0], d[5][8] + d[8][0]);
d[5][1] = min(d[5][1], d[5][8] + d[8][1]);
d[5][2] = min(d[5][2], d[5][8] + d[8][2]);
d[5][3] = min(d[5][3], d[5][8] + d[8][3]);
d[5][4] = min(d[5][4], d[5][8] + d[8][4]);
d[5][5] = min(d[5][5], d[5][8] + d[8][5]);
d[5][6] = min(d[5][6], d[5][8] + d[8][6]);
d[5][7] = min(d[5][7], d[5][8] + d[8][7]);
d[5][8] = min(d[5][8], d[5][8] + d[8][8]);
d[5][9] = min(d[5][9], d[5][8] + d[8][9]);
d[6][0] = min(d[6][0], d[6][8] + d[8][0]);
d[6][1] = min(d[6][1], d[6][8] + d[8][1]);
d[6][2] = min(d[6][2], d[6][8] + d[8][2]);
d[6][3] = min(d[6][3], d[6][8] + d[8][3]);
d[6][4] = min(d[6][4], d[6][8] + d[8][4]);
d[6][5] = min(d[6][5], d[6][8] + d[8][5]);
d[6][6] = min(d[6][6], d[6][8] + d[8][6]);
d[6][7] = min(d[6][7], d[6][8] + d[8][7]);
d[6][8] = min(d[6][8], d[6][8] + d[8][8]);
d[6][9] = min(d[6][9], d[6][8] + d[8][9]);
d[7][0] = min(d[7][0], d[7][8] + d[8][0]);
d[7][1] = min(d[7][1], d[7][8] + d[8][1]);
d[7][2] = min(d[7][2], d[7][8] + d[8][2]);
d[7][3] = min(d[7][3], d[7][8] + d[8][3]);
d[7][4] = min(d[7][4], d[7][8] + d[8][4]);
d[7][5] = min(d[7][5], d[7][8] + d[8][5]);
d[7][6] = min(d[7][6], d[7][8] + d[8][6]);
d[7][7] = min(d[7][7], d[7][8] + d[8][7]);
d[7][8] = min(d[7][8], d[7][8] + d[8][8]);
d[7][9] = min(d[7][9], d[7][8] + d[8][9]);
d[8][0] = min(d[8][0], d[8][8] + d[8][0]);
d[8][1] = min(d[8][1], d[8][8] + d[8][1]);
d[8][2] = min(d[8][2], d[8][8] + d[8][2]);
d[8][3] = min(d[8][3], d[8][8] + d[8][3]);
d[8][4] = min(d[8][4], d[8][8] + d[8][4]);
d[8][5] = min(d[8][5], d[8][8] + d[8][5]);
d[8][6] = min(d[8][6], d[8][8] + d[8][6]);
d[8][7] = min(d[8][7], d[8][8] + d[8][7]);
d[8][8] = min(d[8][8], d[8][8] + d[8][8]);
d[8][9] = min(d[8][9], d[8][8] + d[8][9]);
d[9][0] = min(d[9][0], d[9][8] + d[8][0]);
d[9][1] = min(d[9][1], d[9][8] + d[8][1]);
d[9][2] = min(d[9][2], d[9][8] + d[8][2]);
d[9][3] = min(d[9][3], d[9][8] + d[8][3]);
d[9][4] = min(d[9][4], d[9][8] + d[8][4]);
d[9][5] = min(d[9][5], d[9][8] + d[8][5]);
d[9][6] = min(d[9][6], d[9][8] + d[8][6]);
d[9][7] = min(d[9][7], d[9][8] + d[8][7]);
d[9][8] = min(d[9][8], d[9][8] + d[8][8]);
d[9][9] = min(d[9][9], d[9][8] + d[8][9]);
d[0][0] = min(d[0][0], d[0][9] + d[9][0]);
d[0][1] = min(d[0][1], d[0][9] + d[9][1]);
d[0][2] = min(d[0][2], d[0][9] + d[9][2]);
d[0][3] = min(d[0][3], d[0][9] + d[9][3]);
d[0][4] = min(d[0][4], d[0][9] + d[9][4]);
d[0][5] = min(d[0][5], d[0][9] + d[9][5]);
d[0][6] = min(d[0][6], d[0][9] + d[9][6]);
d[0][7] = min(d[0][7], d[0][9] + d[9][7]);
d[0][8] = min(d[0][8], d[0][9] + d[9][8]);
d[0][9] = min(d[0][9], d[0][9] + d[9][9]);
d[1][0] = min(d[1][0], d[1][9] + d[9][0]);
d[1][1] = min(d[1][1], d[1][9] + d[9][1]);
d[1][2] = min(d[1][2], d[1][9] + d[9][2]);
d[1][3] = min(d[1][3], d[1][9] + d[9][3]);
d[1][4] = min(d[1][4], d[1][9] + d[9][4]);
d[1][5] = min(d[1][5], d[1][9] + d[9][5]);
d[1][6] = min(d[1][6], d[1][9] + d[9][6]);
d[1][7] = min(d[1][7], d[1][9] + d[9][7]);
d[1][8] = min(d[1][8], d[1][9] + d[9][8]);
d[1][9] = min(d[1][9], d[1][9] + d[9][9]);
d[2][0] = min(d[2][0], d[2][9] + d[9][0]);
d[2][1] = min(d[2][1], d[2][9] + d[9][1]);
d[2][2] = min(d[2][2], d[2][9] + d[9][2]);
d[2][3] = min(d[2][3], d[2][9] + d[9][3]);
d[2][4] = min(d[2][4], d[2][9] + d[9][4]);
d[2][5] = min(d[2][5], d[2][9] + d[9][5]);
d[2][6] = min(d[2][6], d[2][9] + d[9][6]);
d[2][7] = min(d[2][7], d[2][9] + d[9][7]);
d[2][8] = min(d[2][8], d[2][9] + d[9][8]);
d[2][9] = min(d[2][9], d[2][9] + d[9][9]);
d[3][0] = min(d[3][0], d[3][9] + d[9][0]);
d[3][1] = min(d[3][1], d[3][9] + d[9][1]);
d[3][2] = min(d[3][2], d[3][9] + d[9][2]);
d[3][3] = min(d[3][3], d[3][9] + d[9][3]);
d[3][4] = min(d[3][4], d[3][9] + d[9][4]);
d[3][5] = min(d[3][5], d[3][9] + d[9][5]);
d[3][6] = min(d[3][6], d[3][9] + d[9][6]);
d[3][7] = min(d[3][7], d[3][9] + d[9][7]);
d[3][8] = min(d[3][8], d[3][9] + d[9][8]);
d[3][9] = min(d[3][9], d[3][9] + d[9][9]);
d[4][0] = min(d[4][0], d[4][9] + d[9][0]);
d[4][1] = min(d[4][1], d[4][9] + d[9][1]);
d[4][2] = min(d[4][2], d[4][9] + d[9][2]);
d[4][3] = min(d[4][3], d[4][9] + d[9][3]);
d[4][4] = min(d[4][4], d[4][9] + d[9][4]);
d[4][5] = min(d[4][5], d[4][9] + d[9][5]);
d[4][6] = min(d[4][6], d[4][9] + d[9][6]);
d[4][7] = min(d[4][7], d[4][9] + d[9][7]);
d[4][8] = min(d[4][8], d[4][9] + d[9][8]);
d[4][9] = min(d[4][9], d[4][9] + d[9][9]);
d[5][0] = min(d[5][0], d[5][9] + d[9][0]);
d[5][1] = min(d[5][1], d[5][9] + d[9][1]);
d[5][2] = min(d[5][2], d[5][9] + d[9][2]);
d[5][3] = min(d[5][3], d[5][9] + d[9][3]);
d[5][4] = min(d[5][4], d[5][9] + d[9][4]);
d[5][5] = min(d[5][5], d[5][9] + d[9][5]);
d[5][6] = min(d[5][6], d[5][9] + d[9][6]);
d[5][7] = min(d[5][7], d[5][9] + d[9][7]);
d[5][8] = min(d[5][8], d[5][9] + d[9][8]);
d[5][9] = min(d[5][9], d[5][9] + d[9][9]);
d[6][0] = min(d[6][0], d[6][9] + d[9][0]);
d[6][1] = min(d[6][1], d[6][9] + d[9][1]);
d[6][2] = min(d[6][2], d[6][9] + d[9][2]);
d[6][3] = min(d[6][3], d[6][9] + d[9][3]);
d[6][4] = min(d[6][4], d[6][9] + d[9][4]);
d[6][5] = min(d[6][5], d[6][9] + d[9][5]);
d[6][6] = min(d[6][6], d[6][9] + d[9][6]);
d[6][7] = min(d[6][7], d[6][9] + d[9][7]);
d[6][8] = min(d[6][8], d[6][9] + d[9][8]);
d[6][9] = min(d[6][9], d[6][9] + d[9][9]);
d[7][0] = min(d[7][0], d[7][9] + d[9][0]);
d[7][1] = min(d[7][1], d[7][9] + d[9][1]);
d[7][2] = min(d[7][2], d[7][9] + d[9][2]);
d[7][3] = min(d[7][3], d[7][9] + d[9][3]);
d[7][4] = min(d[7][4], d[7][9] + d[9][4]);
d[7][5] = min(d[7][5], d[7][9] + d[9][5]);
d[7][6] = min(d[7][6], d[7][9] + d[9][6]);
d[7][7] = min(d[7][7], d[7][9] + d[9][7]);
d[7][8] = min(d[7][8], d[7][9] + d[9][8]);
d[7][9] = min(d[7][9], d[7][9] + d[9][9]);
d[8][0] = min(d[8][0], d[8][9] + d[9][0]);
d[8][1] = min(d[8][1], d[8][9] + d[9][1]);
d[8][2] = min(d[8][2], d[8][9] + d[9][2]);
d[8][3] = min(d[8][3], d[8][9] + d[9][3]);
d[8][4] = min(d[8][4], d[8][9] + d[9][4]);
d[8][5] = min(d[8][5], d[8][9] + d[9][5]);
d[8][6] = min(d[8][6], d[8][9] + d[9][6]);
d[8][7] = min(d[8][7], d[8][9] + d[9][7]);
d[8][8] = min(d[8][8], d[8][9] + d[9][8]);
d[8][9] = min(d[8][9], d[8][9] + d[9][9]);
d[9][0] = min(d[9][0], d[9][9] + d[9][0]);
d[9][1] = min(d[9][1], d[9][9] + d[9][1]);
d[9][2] = min(d[9][2], d[9][9] + d[9][2]);
d[9][3] = min(d[9][3], d[9][9] + d[9][3]);
d[9][4] = min(d[9][4], d[9][9] + d[9][4]);
d[9][5] = min(d[9][5], d[9][9] + d[9][5]);
d[9][6] = min(d[9][6], d[9][9] + d[9][6]);
d[9][7] = min(d[9][7], d[9][9] + d[9][7]);
d[9][8] = min(d[9][8], d[9][9] + d[9][8]);
d[9][9] = min(d[9][9], d[9][9] + d[9][9]);
ans = (d[0][0] == inf) ? ans : max(d[0][0], ans);
ans = (d[0][1] == inf) ? ans : max(d[0][1], ans);
ans = (d[0][2] == inf) ? ans : max(d[0][2], ans);
ans = (d[0][3] == inf) ? ans : max(d[0][3], ans);
ans = (d[0][4] == inf) ? ans : max(d[0][4], ans);
ans = (d[0][5] == inf) ? ans : max(d[0][5], ans);
ans = (d[0][6] == inf) ? ans : max(d[0][6], ans);
ans = (d[0][7] == inf) ? ans : max(d[0][7], ans);
ans = (d[0][8] == inf) ? ans : max(d[0][8], ans);
ans = (d[0][9] == inf) ? ans : max(d[0][9], ans);
ans = (d[1][0] == inf) ? ans : max(d[1][0], ans);
ans = (d[1][1] == inf) ? ans : max(d[1][1], ans);
ans = (d[1][2] == inf) ? ans : max(d[1][2], ans);
ans = (d[1][3] == inf) ? ans : max(d[1][3], ans);
ans = (d[1][4] == inf) ? ans : max(d[1][4], ans);
ans = (d[1][5] == inf) ? ans : max(d[1][5], ans);
ans = (d[1][6] == inf) ? ans : max(d[1][6], ans);
ans = (d[1][7] == inf) ? ans : max(d[1][7], ans);
ans = (d[1][8] == inf) ? ans : max(d[1][8], ans);
ans = (d[1][9] == inf) ? ans : max(d[1][9], ans);
ans = (d[2][0] == inf) ? ans : max(d[2][0], ans);
ans = (d[2][1] == inf) ? ans : max(d[2][1], ans);
ans = (d[2][2] == inf) ? ans : max(d[2][2], ans);
ans = (d[2][3] == inf) ? ans : max(d[2][3], ans);
ans = (d[2][4] == inf) ? ans : max(d[2][4], ans);
ans = (d[2][5] == inf) ? ans : max(d[2][5], ans);
ans = (d[2][6] == inf) ? ans : max(d[2][6], ans);
ans = (d[2][7] == inf) ? ans : max(d[2][7], ans);
ans = (d[2][8] == inf) ? ans : max(d[2][8], ans);
ans = (d[2][9] == inf) ? ans : max(d[2][9], ans);
ans = (d[3][0] == inf) ? ans : max(d[3][0], ans);
ans = (d[3][1] == inf) ? ans : max(d[3][1], ans);
ans = (d[3][2] == inf) ? ans : max(d[3][2], ans);
ans = (d[3][3] == inf) ? ans : max(d[3][3], ans);
ans = (d[3][4] == inf) ? ans : max(d[3][4], ans);
ans = (d[3][5] == inf) ? ans : max(d[3][5], ans);
ans = (d[3][6] == inf) ? ans : max(d[3][6], ans);
ans = (d[3][7] == inf) ? ans : max(d[3][7], ans);
ans = (d[3][8] == inf) ? ans : max(d[3][8], ans);
ans = (d[3][9] == inf) ? ans : max(d[3][9], ans);
ans = (d[4][0] == inf) ? ans : max(d[4][0], ans);
ans = (d[4][1] == inf) ? ans : max(d[4][1], ans);
ans = (d[4][2] == inf) ? ans : max(d[4][2], ans);
ans = (d[4][3] == inf) ? ans : max(d[4][3], ans);
ans = (d[4][4] == inf) ? ans : max(d[4][4], ans);
ans = (d[4][5] == inf) ? ans : max(d[4][5], ans);
ans = (d[4][6] == inf) ? ans : max(d[4][6], ans);
ans = (d[4][7] == inf) ? ans : max(d[4][7], ans);
ans = (d[4][8] == inf) ? ans : max(d[4][8], ans);
ans = (d[4][9] == inf) ? ans : max(d[4][9], ans);
ans = (d[5][0] == inf) ? ans : max(d[5][0], ans);
ans = (d[5][1] == inf) ? ans : max(d[5][1], ans);
ans = (d[5][2] == inf) ? ans : max(d[5][2], ans);
ans = (d[5][3] == inf) ? ans : max(d[5][3], ans);
ans = (d[5][4] == inf) ? ans : max(d[5][4], ans);
ans = (d[5][5] == inf) ? ans : max(d[5][5], ans);
ans = (d[5][6] == inf) ? ans : max(d[5][6], ans);
ans = (d[5][7] == inf) ? ans : max(d[5][7], ans);
ans = (d[5][8] == inf) ? ans : max(d[5][8], ans);
ans = (d[5][9] == inf) ? ans : max(d[5][9], ans);
ans = (d[6][0] == inf) ? ans : max(d[6][0], ans);
ans = (d[6][1] == inf) ? ans : max(d[6][1], ans);
ans = (d[6][2] == inf) ? ans : max(d[6][2], ans);
ans = (d[6][3] == inf) ? ans : max(d[6][3], ans);
ans = (d[6][4] == inf) ? ans : max(d[6][4], ans);
ans = (d[6][5] == inf) ? ans : max(d[6][5], ans);
ans = (d[6][6] == inf) ? ans : max(d[6][6], ans);
ans = (d[6][7] == inf) ? ans : max(d[6][7], ans);
ans = (d[6][8] == inf) ? ans : max(d[6][8], ans);
ans = (d[6][9] == inf) ? ans : max(d[6][9], ans);
ans = (d[7][0] == inf) ? ans : max(d[7][0], ans);
ans = (d[7][1] == inf) ? ans : max(d[7][1], ans);
ans = (d[7][2] == inf) ? ans : max(d[7][2], ans);
ans = (d[7][3] == inf) ? ans : max(d[7][3], ans);
ans = (d[7][4] == inf) ? ans : max(d[7][4], ans);
ans = (d[7][5] == inf) ? ans : max(d[7][5], ans);
ans = (d[7][6] == inf) ? ans : max(d[7][6], ans);
ans = (d[7][7] == inf) ? ans : max(d[7][7], ans);
ans = (d[7][8] == inf) ? ans : max(d[7][8], ans);
ans = (d[7][9] == inf) ? ans : max(d[7][9], ans);
ans = (d[8][0] == inf) ? ans : max(d[8][0], ans);
ans = (d[8][1] == inf) ? ans : max(d[8][1], ans);
ans = (d[8][2] == inf) ? ans : max(d[8][2], ans);
ans = (d[8][3] == inf) ? ans : max(d[8][3], ans);
ans = (d[8][4] == inf) ? ans : max(d[8][4], ans);
ans = (d[8][5] == inf) ? ans : max(d[8][5], ans);
ans = (d[8][6] == inf) ? ans : max(d[8][6], ans);
ans = (d[8][7] == inf) ? ans : max(d[8][7], ans);
ans = (d[8][8] == inf) ? ans : max(d[8][8], ans);
ans = (d[8][9] == inf) ? ans : max(d[8][9], ans);
ans = (d[9][0] == inf) ? ans : max(d[9][0], ans);
ans = (d[9][1] == inf) ? ans : max(d[9][1], ans);
ans = (d[9][2] == inf) ? ans : max(d[9][2], ans);
ans = (d[9][3] == inf) ? ans : max(d[9][3], ans);
ans = (d[9][4] == inf) ? ans : max(d[9][4], ans);
ans = (d[9][5] == inf) ? ans : max(d[9][5], ans);
ans = (d[9][6] == inf) ? ans : max(d[9][6], ans);
ans = (d[9][7] == inf) ? ans : max(d[9][7], ans);
ans = (d[9][8] == inf) ? ans : max(d[9][8], ans);
ans = (d[9][9] == inf) ? ans : max(d[9][9], ans);
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct ExCont {};
struct ExBrk {};
int d[11][11] = {
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}};
inline int max(int a) { return a; }
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a < b ? a : b; }
int thrExBrk() {
throw ExBrk();
return 0;
}
int thrExCont() {
throw ExCont();
return 0;
}
int main(void) {
int N;
cin >> N;
int i, j, k;
try {
i = 0;
loadOuter:
try {
throw(i < N ? thrExCont() : thrExBrk());
} catch (ExCont) {
try {
j = 0;
loadInner:
try {
throw(j < N ? thrExCont() : thrExBrk());
} catch (ExCont) {
cin >> d[i][j];
++j;
}
goto loadInner;
} catch (ExBrk) {
}
++i;
}
goto loadOuter;
} catch (ExBrk) {
}
try {
i = 0;
loadOuter2:
try {
throw(i < N ? thrExCont() : thrExBrk());
} catch (ExCont) {
try {
j = 0;
loadInner2:
try {
throw(j < N ? thrExCont() : thrExBrk());
} catch (ExCont) {
try {
k = 0;
loadInnerInner:
try {
throw(k < N ? thrExCont() : thrExBrk());
} catch (ExCont) {
d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
++k;
}
goto loadInnerInner;
} catch (ExBrk) {
}
++j;
}
goto loadInner2;
} catch (ExBrk) {
}
++i;
}
goto loadOuter2;
} catch (ExBrk) {
}
int m = 0;
m = max(m,
max(d[0][0],
max(d[0][1],
max(d[0][2],
max(d[0][3],
max(d[0][4],
max(d[0][5],
max(d[0][6],
max(d[0][7],
max(d[0][8],
max(d[0][9], d[0][10])))))))))));
m = max(m,
max(d[1][0],
max(d[1][1],
max(d[1][2],
max(d[1][3],
max(d[1][4],
max(d[1][5],
max(d[1][6],
max(d[1][7],
max(d[1][8],
max(d[1][9], d[1][10])))))))))));
m = max(m,
max(d[2][0],
max(d[2][1],
max(d[2][2],
max(d[2][3],
max(d[2][4],
max(d[2][5],
max(d[2][6],
max(d[2][7],
max(d[2][8],
max(d[2][9], d[2][10])))))))))));
m = max(m,
max(d[3][0],
max(d[3][1],
max(d[3][2],
max(d[3][3],
max(d[3][4],
max(d[3][5],
max(d[3][6],
max(d[3][7],
max(d[3][8],
max(d[3][9], d[3][10])))))))))));
m = max(m,
max(d[4][0],
max(d[4][1],
max(d[4][2],
max(d[4][3],
max(d[4][4],
max(d[4][5],
max(d[4][6],
max(d[4][7],
max(d[4][8],
max(d[4][9], d[4][10])))))))))));
m = max(m,
max(d[5][0],
max(d[5][1],
max(d[5][2],
max(d[5][3],
max(d[5][4],
max(d[5][5],
max(d[5][6],
max(d[5][7],
max(d[5][8],
max(d[5][9], d[5][10])))))))))));
m = max(m,
max(d[6][0],
max(d[6][1],
max(d[6][2],
max(d[6][3],
max(d[6][4],
max(d[6][5],
max(d[6][6],
max(d[6][7],
max(d[6][8],
max(d[6][9], d[6][10])))))))))));
m = max(m,
max(d[7][0],
max(d[7][1],
max(d[7][2],
max(d[7][3],
max(d[7][4],
max(d[7][5],
max(d[7][6],
max(d[7][7],
max(d[7][8],
max(d[7][9], d[7][10])))))))))));
m = max(m,
max(d[8][0],
max(d[8][1],
max(d[8][2],
max(d[8][3],
max(d[8][4],
max(d[8][5],
max(d[8][6],
max(d[8][7],
max(d[8][8],
max(d[8][9], d[8][10])))))))))));
m = max(m,
max(d[9][0],
max(d[9][1],
max(d[9][2],
max(d[9][3],
max(d[9][4],
max(d[9][5],
max(d[9][6],
max(d[9][7],
max(d[9][8],
max(d[9][9], d[9][10])))))))))));
m = max(
m, max(d[10][0],
max(d[10][1],
max(d[10][2],
max(d[10][3],
max(d[10][4],
max(d[10][5],
max(d[10][6],
max(d[10][7],
max(d[10][8],
max(d[10][9], d[10][10])))))))))));
cout << m << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int m[11][11] = {0};
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) cin >> m[i][j];
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) m[i][j] = min(m[i][j], m[i][k] + m[k][j]);
int ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) ans = max(ans, m[i][j]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mat[11][11];
void floyd_warshal(int v) {
for (int k = 1; k <= v; k++) {
for (int i = 1; i <= v; i++) {
for (int j = 1; j <= v; j++) {
if (mat[i][j] > mat[i][k] + mat[k][j]) {
mat[i][j] = mat[i][k] + mat[k][j];
}
}
}
}
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> mat[i][j];
}
}
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (mat[i][j] > mat[i][k] + mat[k][j]) {
mat[i][j] = mat[i][k] + mat[k][j];
}
}
}
}
int ans = -1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
ans = max(ans, mat[i][j]);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int nxt() {
int x;
scanf("%d", &x);
return x;
}
int a[11][11];
int in(int i, int j, int n) {
a[i][j] = nxt();
i = i + (j + 1) / n;
j = (j + 1) % n;
return (i < n) ? in(i, j, n) : 0;
}
int rec(int i, int j, int k, int n) {
a[j][k] = min(a[j][k], a[j][i] + a[i][k]);
k++;
j += k == n ? 1 : 0;
k %= n;
i += j == n ? 1 : 0;
j %= n;
return i < n ? rec(i, j, k, n) : 0;
}
int get_mx(int i, int n) {
return i == n ? 0 : max(*max_element(a[i], a[i] + n), get_mx(i + 1, n));
}
int main() {
int n = nxt();
in(0, 0, n);
rec(0, 0, 0, n);
cout << get_mx(0, n) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using ld = long double;
using pii = pair<int, int>;
template <class F>
void bleh(int i, int n, F f) {
f(i);
poop(i + 1, n, f);
}
template <class F>
void poop(int i, int n, F f) {
return (i == n) ? void() : bleh(i, n, f);
}
int d[10][10];
int main() {
int n;
cin >> n;
int oo = (int)1e9;
memset(d, oo, sizeof(d));
poop(0, n, [&](int i) { d[i][i] = 0; });
poop(0, n, [&](int i) { poop(0, n, [&](int j) { cin >> d[i][j]; }); });
poop(0, n, [&](int k) {
poop(0, n, [&](int i) {
poop(0, n, [&](int j) { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); });
});
});
int ans = 0;
poop(0, n, [&](int i) {
poop(0, n, [&](int j) { ans = (d[i][j] < oo) ? max(ans, d[i][j]) : ans; });
});
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
int a[20][20];
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) scanf("%d", &a[i][j]);
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) ans = max(ans, a[i][j]);
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T sqr(T x) {
return x * x;
}
template <typename T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
int n;
int a[20], b[20];
int wash;
int d[111][111];
int dist[100][100];
int ma = 0;
int read(int ost) {
int x;
cin >> x;
ost--;
d[n - 1 - ost / n][n - 1 - ost % n] = x;
ost++;
return ost > 1 ? read(ost - 1) : 0;
}
int fr3(int k, int i, int j) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
return j == n - 1 ? 0 : fr3(k, i, j + 1);
}
int fr2(int k, int i) {
fr3(k, i, 0);
return i == n - 1 ? 0 : fr2(k, i + 1);
}
int fr1(int k) {
fr2(k, 0);
return k == n - 1 ? 0 : fr1(k + 1);
}
int findm(int ost) {
ost--;
ma = max(ma, d[n - 1 - ost / n][n - 1 - ost % n]);
ost++;
return ost > 1 ? findm(ost - 1) : 0;
}
int main() {
ios_base ::sync_with_stdio(false);
cin >> n;
read(n * n);
fr1(0);
findm(n * n);
cout << ma;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
long long inf = 1e15;
int n;
long long a[12][12];
long long dp[12][12][12];
long long take(int i, int j, int k, int p) {
return p == n ? inf
: min(dp[i][p][k - 1] + dp[p][j][k - 1], take(i, j, k, p + 1));
}
long long calc(int h, int k) {
int i = h / n, j = h % n;
return h == n * n ? 0 : ((dp[i][j][k] = take(i, j, k, 0)), calc(h + 1, k));
}
int floyd(int k) { return k == n + 1 ? 0 : (calc(0, k), floyd(k + 1)); }
int input(int h) {
return h == n * n ? 0 : ((cin >> a[h / n][h % n]), input(h + 1));
}
int init(int h) {
return h == n * n ? 0
: ((dp[h / n][h % n][0] = a[h / n][h % n]), init(h + 1));
}
long long maxim(int h) {
int i = h / n, j = h % n;
return h == n * n ? -1 : max(dp[i][j][n], maxim(h + 1));
}
int main() {
cin >> n;
input(0);
init(0);
floyd(1);
cout << maxim(0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[99][99], r;
bool bio[99];
int rek(int x, int y, int d) {
a[x][y] == d && (r = max(r, d));
0 < n && !bio[0]++ && rek(x, 0, d + a[y][0]) && (bio[0] = 0);
1 < n && !bio[1]++ && rek(x, 1, d + a[y][1]) && (bio[1] = 0);
2 < n && !bio[2]++ && rek(x, 2, d + a[y][2]) && (bio[2] = 0);
3 < n && !bio[3]++ && rek(x, 3, d + a[y][3]) && (bio[3] = 0);
4 < n && !bio[4]++ && rek(x, 4, d + a[y][4]) && (bio[4] = 0);
5 < n && !bio[5]++ && rek(x, 5, d + a[y][5]) && (bio[5] = 0);
6 < n && !bio[6]++ && rek(x, 6, d + a[y][6]) && (bio[6] = 0);
7 < n && !bio[7]++ && rek(x, 7, d + a[y][7]) && (bio[7] = 0);
8 < n && !bio[8]++ && rek(x, 8, d + a[y][8]) && (bio[8] = 0);
9 < n && !bio[9]++ && rek(x, 9, d + a[y][9]) && (bio[9] = 0);
return 1;
}
int main() {
cin >> n;
0 < n && 0 < n&& cin >> a[0][0];
0 < n && 1 < n&& cin >> a[0][1];
0 < n && 2 < n&& cin >> a[0][2];
0 < n && 3 < n&& cin >> a[0][3];
0 < n && 4 < n&& cin >> a[0][4];
0 < n && 5 < n&& cin >> a[0][5];
0 < n && 6 < n&& cin >> a[0][6];
0 < n && 7 < n&& cin >> a[0][7];
0 < n && 8 < n&& cin >> a[0][8];
0 < n && 9 < n&& cin >> a[0][9];
1 < n && 0 < n&& cin >> a[1][0];
1 < n && 1 < n&& cin >> a[1][1];
1 < n && 2 < n&& cin >> a[1][2];
1 < n && 3 < n&& cin >> a[1][3];
1 < n && 4 < n&& cin >> a[1][4];
1 < n && 5 < n&& cin >> a[1][5];
1 < n && 6 < n&& cin >> a[1][6];
1 < n && 7 < n&& cin >> a[1][7];
1 < n && 8 < n&& cin >> a[1][8];
1 < n && 9 < n&& cin >> a[1][9];
2 < n && 0 < n&& cin >> a[2][0];
2 < n && 1 < n&& cin >> a[2][1];
2 < n && 2 < n&& cin >> a[2][2];
2 < n && 3 < n&& cin >> a[2][3];
2 < n && 4 < n&& cin >> a[2][4];
2 < n && 5 < n&& cin >> a[2][5];
2 < n && 6 < n&& cin >> a[2][6];
2 < n && 7 < n&& cin >> a[2][7];
2 < n && 8 < n&& cin >> a[2][8];
2 < n && 9 < n&& cin >> a[2][9];
3 < n && 0 < n&& cin >> a[3][0];
3 < n && 1 < n&& cin >> a[3][1];
3 < n && 2 < n&& cin >> a[3][2];
3 < n && 3 < n&& cin >> a[3][3];
3 < n && 4 < n&& cin >> a[3][4];
3 < n && 5 < n&& cin >> a[3][5];
3 < n && 6 < n&& cin >> a[3][6];
3 < n && 7 < n&& cin >> a[3][7];
3 < n && 8 < n&& cin >> a[3][8];
3 < n && 9 < n&& cin >> a[3][9];
4 < n && 0 < n&& cin >> a[4][0];
4 < n && 1 < n&& cin >> a[4][1];
4 < n && 2 < n&& cin >> a[4][2];
4 < n && 3 < n&& cin >> a[4][3];
4 < n && 4 < n&& cin >> a[4][4];
4 < n && 5 < n&& cin >> a[4][5];
4 < n && 6 < n&& cin >> a[4][6];
4 < n && 7 < n&& cin >> a[4][7];
4 < n && 8 < n&& cin >> a[4][8];
4 < n && 9 < n&& cin >> a[4][9];
5 < n && 0 < n&& cin >> a[5][0];
5 < n && 1 < n&& cin >> a[5][1];
5 < n && 2 < n&& cin >> a[5][2];
5 < n && 3 < n&& cin >> a[5][3];
5 < n && 4 < n&& cin >> a[5][4];
5 < n && 5 < n&& cin >> a[5][5];
5 < n && 6 < n&& cin >> a[5][6];
5 < n && 7 < n&& cin >> a[5][7];
5 < n && 8 < n&& cin >> a[5][8];
5 < n && 9 < n&& cin >> a[5][9];
6 < n && 0 < n&& cin >> a[6][0];
6 < n && 1 < n&& cin >> a[6][1];
6 < n && 2 < n&& cin >> a[6][2];
6 < n && 3 < n&& cin >> a[6][3];
6 < n && 4 < n&& cin >> a[6][4];
6 < n && 5 < n&& cin >> a[6][5];
6 < n && 6 < n&& cin >> a[6][6];
6 < n && 7 < n&& cin >> a[6][7];
6 < n && 8 < n&& cin >> a[6][8];
6 < n && 9 < n&& cin >> a[6][9];
7 < n && 0 < n&& cin >> a[7][0];
7 < n && 1 < n&& cin >> a[7][1];
7 < n && 2 < n&& cin >> a[7][2];
7 < n && 3 < n&& cin >> a[7][3];
7 < n && 4 < n&& cin >> a[7][4];
7 < n && 5 < n&& cin >> a[7][5];
7 < n && 6 < n&& cin >> a[7][6];
7 < n && 7 < n&& cin >> a[7][7];
7 < n && 8 < n&& cin >> a[7][8];
7 < n && 9 < n&& cin >> a[7][9];
8 < n && 0 < n&& cin >> a[8][0];
8 < n && 1 < n&& cin >> a[8][1];
8 < n && 2 < n&& cin >> a[8][2];
8 < n && 3 < n&& cin >> a[8][3];
8 < n && 4 < n&& cin >> a[8][4];
8 < n && 5 < n&& cin >> a[8][5];
8 < n && 6 < n&& cin >> a[8][6];
8 < n && 7 < n&& cin >> a[8][7];
8 < n && 8 < n&& cin >> a[8][8];
8 < n && 9 < n&& cin >> a[8][9];
9 < n && 0 < n&& cin >> a[9][0];
9 < n && 1 < n&& cin >> a[9][1];
9 < n && 2 < n&& cin >> a[9][2];
9 < n && 3 < n&& cin >> a[9][3];
9 < n && 4 < n&& cin >> a[9][4];
9 < n && 5 < n&& cin >> a[9][5];
9 < n && 6 < n&& cin >> a[9][6];
9 < n && 7 < n&& cin >> a[9][7];
9 < n && 8 < n&& cin >> a[9][8];
9 < n && 9 < n&& cin >> a[9][9];
0 < n && 0 < n && 0 < n && (a[0][0] = min(a[0][0], a[0][0] + a[0][0]));
0 < n && 0 < n && 1 < n && (a[0][1] = min(a[0][1], a[0][0] + a[0][1]));
0 < n && 0 < n && 2 < n && (a[0][2] = min(a[0][2], a[0][0] + a[0][2]));
0 < n && 0 < n && 3 < n && (a[0][3] = min(a[0][3], a[0][0] + a[0][3]));
0 < n && 0 < n && 4 < n && (a[0][4] = min(a[0][4], a[0][0] + a[0][4]));
0 < n && 0 < n && 5 < n && (a[0][5] = min(a[0][5], a[0][0] + a[0][5]));
0 < n && 0 < n && 6 < n && (a[0][6] = min(a[0][6], a[0][0] + a[0][6]));
0 < n && 0 < n && 7 < n && (a[0][7] = min(a[0][7], a[0][0] + a[0][7]));
0 < n && 0 < n && 8 < n && (a[0][8] = min(a[0][8], a[0][0] + a[0][8]));
0 < n && 0 < n && 9 < n && (a[0][9] = min(a[0][9], a[0][0] + a[0][9]));
0 < n && 1 < n && 0 < n && (a[1][0] = min(a[1][0], a[1][0] + a[0][0]));
0 < n && 1 < n && 1 < n && (a[1][1] = min(a[1][1], a[1][0] + a[0][1]));
0 < n && 1 < n && 2 < n && (a[1][2] = min(a[1][2], a[1][0] + a[0][2]));
0 < n && 1 < n && 3 < n && (a[1][3] = min(a[1][3], a[1][0] + a[0][3]));
0 < n && 1 < n && 4 < n && (a[1][4] = min(a[1][4], a[1][0] + a[0][4]));
0 < n && 1 < n && 5 < n && (a[1][5] = min(a[1][5], a[1][0] + a[0][5]));
0 < n && 1 < n && 6 < n && (a[1][6] = min(a[1][6], a[1][0] + a[0][6]));
0 < n && 1 < n && 7 < n && (a[1][7] = min(a[1][7], a[1][0] + a[0][7]));
0 < n && 1 < n && 8 < n && (a[1][8] = min(a[1][8], a[1][0] + a[0][8]));
0 < n && 1 < n && 9 < n && (a[1][9] = min(a[1][9], a[1][0] + a[0][9]));
0 < n && 2 < n && 0 < n && (a[2][0] = min(a[2][0], a[2][0] + a[0][0]));
0 < n && 2 < n && 1 < n && (a[2][1] = min(a[2][1], a[2][0] + a[0][1]));
0 < n && 2 < n && 2 < n && (a[2][2] = min(a[2][2], a[2][0] + a[0][2]));
0 < n && 2 < n && 3 < n && (a[2][3] = min(a[2][3], a[2][0] + a[0][3]));
0 < n && 2 < n && 4 < n && (a[2][4] = min(a[2][4], a[2][0] + a[0][4]));
0 < n && 2 < n && 5 < n && (a[2][5] = min(a[2][5], a[2][0] + a[0][5]));
0 < n && 2 < n && 6 < n && (a[2][6] = min(a[2][6], a[2][0] + a[0][6]));
0 < n && 2 < n && 7 < n && (a[2][7] = min(a[2][7], a[2][0] + a[0][7]));
0 < n && 2 < n && 8 < n && (a[2][8] = min(a[2][8], a[2][0] + a[0][8]));
0 < n && 2 < n && 9 < n && (a[2][9] = min(a[2][9], a[2][0] + a[0][9]));
0 < n && 3 < n && 0 < n && (a[3][0] = min(a[3][0], a[3][0] + a[0][0]));
0 < n && 3 < n && 1 < n && (a[3][1] = min(a[3][1], a[3][0] + a[0][1]));
0 < n && 3 < n && 2 < n && (a[3][2] = min(a[3][2], a[3][0] + a[0][2]));
0 < n && 3 < n && 3 < n && (a[3][3] = min(a[3][3], a[3][0] + a[0][3]));
0 < n && 3 < n && 4 < n && (a[3][4] = min(a[3][4], a[3][0] + a[0][4]));
0 < n && 3 < n && 5 < n && (a[3][5] = min(a[3][5], a[3][0] + a[0][5]));
0 < n && 3 < n && 6 < n && (a[3][6] = min(a[3][6], a[3][0] + a[0][6]));
0 < n && 3 < n && 7 < n && (a[3][7] = min(a[3][7], a[3][0] + a[0][7]));
0 < n && 3 < n && 8 < n && (a[3][8] = min(a[3][8], a[3][0] + a[0][8]));
0 < n && 3 < n && 9 < n && (a[3][9] = min(a[3][9], a[3][0] + a[0][9]));
0 < n && 4 < n && 0 < n && (a[4][0] = min(a[4][0], a[4][0] + a[0][0]));
0 < n && 4 < n && 1 < n && (a[4][1] = min(a[4][1], a[4][0] + a[0][1]));
0 < n && 4 < n && 2 < n && (a[4][2] = min(a[4][2], a[4][0] + a[0][2]));
0 < n && 4 < n && 3 < n && (a[4][3] = min(a[4][3], a[4][0] + a[0][3]));
0 < n && 4 < n && 4 < n && (a[4][4] = min(a[4][4], a[4][0] + a[0][4]));
0 < n && 4 < n && 5 < n && (a[4][5] = min(a[4][5], a[4][0] + a[0][5]));
0 < n && 4 < n && 6 < n && (a[4][6] = min(a[4][6], a[4][0] + a[0][6]));
0 < n && 4 < n && 7 < n && (a[4][7] = min(a[4][7], a[4][0] + a[0][7]));
0 < n && 4 < n && 8 < n && (a[4][8] = min(a[4][8], a[4][0] + a[0][8]));
0 < n && 4 < n && 9 < n && (a[4][9] = min(a[4][9], a[4][0] + a[0][9]));
0 < n && 5 < n && 0 < n && (a[5][0] = min(a[5][0], a[5][0] + a[0][0]));
0 < n && 5 < n && 1 < n && (a[5][1] = min(a[5][1], a[5][0] + a[0][1]));
0 < n && 5 < n && 2 < n && (a[5][2] = min(a[5][2], a[5][0] + a[0][2]));
0 < n && 5 < n && 3 < n && (a[5][3] = min(a[5][3], a[5][0] + a[0][3]));
0 < n && 5 < n && 4 < n && (a[5][4] = min(a[5][4], a[5][0] + a[0][4]));
0 < n && 5 < n && 5 < n && (a[5][5] = min(a[5][5], a[5][0] + a[0][5]));
0 < n && 5 < n && 6 < n && (a[5][6] = min(a[5][6], a[5][0] + a[0][6]));
0 < n && 5 < n && 7 < n && (a[5][7] = min(a[5][7], a[5][0] + a[0][7]));
0 < n && 5 < n && 8 < n && (a[5][8] = min(a[5][8], a[5][0] + a[0][8]));
0 < n && 5 < n && 9 < n && (a[5][9] = min(a[5][9], a[5][0] + a[0][9]));
0 < n && 6 < n && 0 < n && (a[6][0] = min(a[6][0], a[6][0] + a[0][0]));
0 < n && 6 < n && 1 < n && (a[6][1] = min(a[6][1], a[6][0] + a[0][1]));
0 < n && 6 < n && 2 < n && (a[6][2] = min(a[6][2], a[6][0] + a[0][2]));
0 < n && 6 < n && 3 < n && (a[6][3] = min(a[6][3], a[6][0] + a[0][3]));
0 < n && 6 < n && 4 < n && (a[6][4] = min(a[6][4], a[6][0] + a[0][4]));
0 < n && 6 < n && 5 < n && (a[6][5] = min(a[6][5], a[6][0] + a[0][5]));
0 < n && 6 < n && 6 < n && (a[6][6] = min(a[6][6], a[6][0] + a[0][6]));
0 < n && 6 < n && 7 < n && (a[6][7] = min(a[6][7], a[6][0] + a[0][7]));
0 < n && 6 < n && 8 < n && (a[6][8] = min(a[6][8], a[6][0] + a[0][8]));
0 < n && 6 < n && 9 < n && (a[6][9] = min(a[6][9], a[6][0] + a[0][9]));
0 < n && 7 < n && 0 < n && (a[7][0] = min(a[7][0], a[7][0] + a[0][0]));
0 < n && 7 < n && 1 < n && (a[7][1] = min(a[7][1], a[7][0] + a[0][1]));
0 < n && 7 < n && 2 < n && (a[7][2] = min(a[7][2], a[7][0] + a[0][2]));
0 < n && 7 < n && 3 < n && (a[7][3] = min(a[7][3], a[7][0] + a[0][3]));
0 < n && 7 < n && 4 < n && (a[7][4] = min(a[7][4], a[7][0] + a[0][4]));
0 < n && 7 < n && 5 < n && (a[7][5] = min(a[7][5], a[7][0] + a[0][5]));
0 < n && 7 < n && 6 < n && (a[7][6] = min(a[7][6], a[7][0] + a[0][6]));
0 < n && 7 < n && 7 < n && (a[7][7] = min(a[7][7], a[7][0] + a[0][7]));
0 < n && 7 < n && 8 < n && (a[7][8] = min(a[7][8], a[7][0] + a[0][8]));
0 < n && 7 < n && 9 < n && (a[7][9] = min(a[7][9], a[7][0] + a[0][9]));
0 < n && 8 < n && 0 < n && (a[8][0] = min(a[8][0], a[8][0] + a[0][0]));
0 < n && 8 < n && 1 < n && (a[8][1] = min(a[8][1], a[8][0] + a[0][1]));
0 < n && 8 < n && 2 < n && (a[8][2] = min(a[8][2], a[8][0] + a[0][2]));
0 < n && 8 < n && 3 < n && (a[8][3] = min(a[8][3], a[8][0] + a[0][3]));
0 < n && 8 < n && 4 < n && (a[8][4] = min(a[8][4], a[8][0] + a[0][4]));
0 < n && 8 < n && 5 < n && (a[8][5] = min(a[8][5], a[8][0] + a[0][5]));
0 < n && 8 < n && 6 < n && (a[8][6] = min(a[8][6], a[8][0] + a[0][6]));
0 < n && 8 < n && 7 < n && (a[8][7] = min(a[8][7], a[8][0] + a[0][7]));
0 < n && 8 < n && 8 < n && (a[8][8] = min(a[8][8], a[8][0] + a[0][8]));
0 < n && 8 < n && 9 < n && (a[8][9] = min(a[8][9], a[8][0] + a[0][9]));
0 < n && 9 < n && 0 < n && (a[9][0] = min(a[9][0], a[9][0] + a[0][0]));
0 < n && 9 < n && 1 < n && (a[9][1] = min(a[9][1], a[9][0] + a[0][1]));
0 < n && 9 < n && 2 < n && (a[9][2] = min(a[9][2], a[9][0] + a[0][2]));
0 < n && 9 < n && 3 < n && (a[9][3] = min(a[9][3], a[9][0] + a[0][3]));
0 < n && 9 < n && 4 < n && (a[9][4] = min(a[9][4], a[9][0] + a[0][4]));
0 < n && 9 < n && 5 < n && (a[9][5] = min(a[9][5], a[9][0] + a[0][5]));
0 < n && 9 < n && 6 < n && (a[9][6] = min(a[9][6], a[9][0] + a[0][6]));
0 < n && 9 < n && 7 < n && (a[9][7] = min(a[9][7], a[9][0] + a[0][7]));
0 < n && 9 < n && 8 < n && (a[9][8] = min(a[9][8], a[9][0] + a[0][8]));
0 < n && 9 < n && 9 < n && (a[9][9] = min(a[9][9], a[9][0] + a[0][9]));
1 < n && 0 < n && 0 < n && (a[0][0] = min(a[0][0], a[0][1] + a[1][0]));
1 < n && 0 < n && 1 < n && (a[0][1] = min(a[0][1], a[0][1] + a[1][1]));
1 < n && 0 < n && 2 < n && (a[0][2] = min(a[0][2], a[0][1] + a[1][2]));
1 < n && 0 < n && 3 < n && (a[0][3] = min(a[0][3], a[0][1] + a[1][3]));
1 < n && 0 < n && 4 < n && (a[0][4] = min(a[0][4], a[0][1] + a[1][4]));
1 < n && 0 < n && 5 < n && (a[0][5] = min(a[0][5], a[0][1] + a[1][5]));
1 < n && 0 < n && 6 < n && (a[0][6] = min(a[0][6], a[0][1] + a[1][6]));
1 < n && 0 < n && 7 < n && (a[0][7] = min(a[0][7], a[0][1] + a[1][7]));
1 < n && 0 < n && 8 < n && (a[0][8] = min(a[0][8], a[0][1] + a[1][8]));
1 < n && 0 < n && 9 < n && (a[0][9] = min(a[0][9], a[0][1] + a[1][9]));
1 < n && 1 < n && 0 < n && (a[1][0] = min(a[1][0], a[1][1] + a[1][0]));
1 < n && 1 < n && 1 < n && (a[1][1] = min(a[1][1], a[1][1] + a[1][1]));
1 < n && 1 < n && 2 < n && (a[1][2] = min(a[1][2], a[1][1] + a[1][2]));
1 < n && 1 < n && 3 < n && (a[1][3] = min(a[1][3], a[1][1] + a[1][3]));
1 < n && 1 < n && 4 < n && (a[1][4] = min(a[1][4], a[1][1] + a[1][4]));
1 < n && 1 < n && 5 < n && (a[1][5] = min(a[1][5], a[1][1] + a[1][5]));
1 < n && 1 < n && 6 < n && (a[1][6] = min(a[1][6], a[1][1] + a[1][6]));
1 < n && 1 < n && 7 < n && (a[1][7] = min(a[1][7], a[1][1] + a[1][7]));
1 < n && 1 < n && 8 < n && (a[1][8] = min(a[1][8], a[1][1] + a[1][8]));
1 < n && 1 < n && 9 < n && (a[1][9] = min(a[1][9], a[1][1] + a[1][9]));
1 < n && 2 < n && 0 < n && (a[2][0] = min(a[2][0], a[2][1] + a[1][0]));
1 < n && 2 < n && 1 < n && (a[2][1] = min(a[2][1], a[2][1] + a[1][1]));
1 < n && 2 < n && 2 < n && (a[2][2] = min(a[2][2], a[2][1] + a[1][2]));
1 < n && 2 < n && 3 < n && (a[2][3] = min(a[2][3], a[2][1] + a[1][3]));
1 < n && 2 < n && 4 < n && (a[2][4] = min(a[2][4], a[2][1] + a[1][4]));
1 < n && 2 < n && 5 < n && (a[2][5] = min(a[2][5], a[2][1] + a[1][5]));
1 < n && 2 < n && 6 < n && (a[2][6] = min(a[2][6], a[2][1] + a[1][6]));
1 < n && 2 < n && 7 < n && (a[2][7] = min(a[2][7], a[2][1] + a[1][7]));
1 < n && 2 < n && 8 < n && (a[2][8] = min(a[2][8], a[2][1] + a[1][8]));
1 < n && 2 < n && 9 < n && (a[2][9] = min(a[2][9], a[2][1] + a[1][9]));
1 < n && 3 < n && 0 < n && (a[3][0] = min(a[3][0], a[3][1] + a[1][0]));
1 < n && 3 < n && 1 < n && (a[3][1] = min(a[3][1], a[3][1] + a[1][1]));
1 < n && 3 < n && 2 < n && (a[3][2] = min(a[3][2], a[3][1] + a[1][2]));
1 < n && 3 < n && 3 < n && (a[3][3] = min(a[3][3], a[3][1] + a[1][3]));
1 < n && 3 < n && 4 < n && (a[3][4] = min(a[3][4], a[3][1] + a[1][4]));
1 < n && 3 < n && 5 < n && (a[3][5] = min(a[3][5], a[3][1] + a[1][5]));
1 < n && 3 < n && 6 < n && (a[3][6] = min(a[3][6], a[3][1] + a[1][6]));
1 < n && 3 < n && 7 < n && (a[3][7] = min(a[3][7], a[3][1] + a[1][7]));
1 < n && 3 < n && 8 < n && (a[3][8] = min(a[3][8], a[3][1] + a[1][8]));
1 < n && 3 < n && 9 < n && (a[3][9] = min(a[3][9], a[3][1] + a[1][9]));
1 < n && 4 < n && 0 < n && (a[4][0] = min(a[4][0], a[4][1] + a[1][0]));
1 < n && 4 < n && 1 < n && (a[4][1] = min(a[4][1], a[4][1] + a[1][1]));
1 < n && 4 < n && 2 < n && (a[4][2] = min(a[4][2], a[4][1] + a[1][2]));
1 < n && 4 < n && 3 < n && (a[4][3] = min(a[4][3], a[4][1] + a[1][3]));
1 < n && 4 < n && 4 < n && (a[4][4] = min(a[4][4], a[4][1] + a[1][4]));
1 < n && 4 < n && 5 < n && (a[4][5] = min(a[4][5], a[4][1] + a[1][5]));
1 < n && 4 < n && 6 < n && (a[4][6] = min(a[4][6], a[4][1] + a[1][6]));
1 < n && 4 < n && 7 < n && (a[4][7] = min(a[4][7], a[4][1] + a[1][7]));
1 < n && 4 < n && 8 < n && (a[4][8] = min(a[4][8], a[4][1] + a[1][8]));
1 < n && 4 < n && 9 < n && (a[4][9] = min(a[4][9], a[4][1] + a[1][9]));
1 < n && 5 < n && 0 < n && (a[5][0] = min(a[5][0], a[5][1] + a[1][0]));
1 < n && 5 < n && 1 < n && (a[5][1] = min(a[5][1], a[5][1] + a[1][1]));
1 < n && 5 < n && 2 < n && (a[5][2] = min(a[5][2], a[5][1] + a[1][2]));
1 < n && 5 < n && 3 < n && (a[5][3] = min(a[5][3], a[5][1] + a[1][3]));
1 < n && 5 < n && 4 < n && (a[5][4] = min(a[5][4], a[5][1] + a[1][4]));
1 < n && 5 < n && 5 < n && (a[5][5] = min(a[5][5], a[5][1] + a[1][5]));
1 < n && 5 < n && 6 < n && (a[5][6] = min(a[5][6], a[5][1] + a[1][6]));
1 < n && 5 < n && 7 < n && (a[5][7] = min(a[5][7], a[5][1] + a[1][7]));
1 < n && 5 < n && 8 < n && (a[5][8] = min(a[5][8], a[5][1] + a[1][8]));
1 < n && 5 < n && 9 < n && (a[5][9] = min(a[5][9], a[5][1] + a[1][9]));
1 < n && 6 < n && 0 < n && (a[6][0] = min(a[6][0], a[6][1] + a[1][0]));
1 < n && 6 < n && 1 < n && (a[6][1] = min(a[6][1], a[6][1] + a[1][1]));
1 < n && 6 < n && 2 < n && (a[6][2] = min(a[6][2], a[6][1] + a[1][2]));
1 < n && 6 < n && 3 < n && (a[6][3] = min(a[6][3], a[6][1] + a[1][3]));
1 < n && 6 < n && 4 < n && (a[6][4] = min(a[6][4], a[6][1] + a[1][4]));
1 < n && 6 < n && 5 < n && (a[6][5] = min(a[6][5], a[6][1] + a[1][5]));
1 < n && 6 < n && 6 < n && (a[6][6] = min(a[6][6], a[6][1] + a[1][6]));
1 < n && 6 < n && 7 < n && (a[6][7] = min(a[6][7], a[6][1] + a[1][7]));
1 < n && 6 < n && 8 < n && (a[6][8] = min(a[6][8], a[6][1] + a[1][8]));
1 < n && 6 < n && 9 < n && (a[6][9] = min(a[6][9], a[6][1] + a[1][9]));
1 < n && 7 < n && 0 < n && (a[7][0] = min(a[7][0], a[7][1] + a[1][0]));
1 < n && 7 < n && 1 < n && (a[7][1] = min(a[7][1], a[7][1] + a[1][1]));
1 < n && 7 < n && 2 < n && (a[7][2] = min(a[7][2], a[7][1] + a[1][2]));
1 < n && 7 < n && 3 < n && (a[7][3] = min(a[7][3], a[7][1] + a[1][3]));
1 < n && 7 < n && 4 < n && (a[7][4] = min(a[7][4], a[7][1] + a[1][4]));
1 < n && 7 < n && 5 < n && (a[7][5] = min(a[7][5], a[7][1] + a[1][5]));
1 < n && 7 < n && 6 < n && (a[7][6] = min(a[7][6], a[7][1] + a[1][6]));
1 < n && 7 < n && 7 < n && (a[7][7] = min(a[7][7], a[7][1] + a[1][7]));
1 < n && 7 < n && 8 < n && (a[7][8] = min(a[7][8], a[7][1] + a[1][8]));
1 < n && 7 < n && 9 < n && (a[7][9] = min(a[7][9], a[7][1] + a[1][9]));
1 < n && 8 < n && 0 < n && (a[8][0] = min(a[8][0], a[8][1] + a[1][0]));
1 < n && 8 < n && 1 < n && (a[8][1] = min(a[8][1], a[8][1] + a[1][1]));
1 < n && 8 < n && 2 < n && (a[8][2] = min(a[8][2], a[8][1] + a[1][2]));
1 < n && 8 < n && 3 < n && (a[8][3] = min(a[8][3], a[8][1] + a[1][3]));
1 < n && 8 < n && 4 < n && (a[8][4] = min(a[8][4], a[8][1] + a[1][4]));
1 < n && 8 < n && 5 < n && (a[8][5] = min(a[8][5], a[8][1] + a[1][5]));
1 < n && 8 < n && 6 < n && (a[8][6] = min(a[8][6], a[8][1] + a[1][6]));
1 < n && 8 < n && 7 < n && (a[8][7] = min(a[8][7], a[8][1] + a[1][7]));
1 < n && 8 < n && 8 < n && (a[8][8] = min(a[8][8], a[8][1] + a[1][8]));
1 < n && 8 < n && 9 < n && (a[8][9] = min(a[8][9], a[8][1] + a[1][9]));
1 < n && 9 < n && 0 < n && (a[9][0] = min(a[9][0], a[9][1] + a[1][0]));
1 < n && 9 < n && 1 < n && (a[9][1] = min(a[9][1], a[9][1] + a[1][1]));
1 < n && 9 < n && 2 < n && (a[9][2] = min(a[9][2], a[9][1] + a[1][2]));
1 < n && 9 < n && 3 < n && (a[9][3] = min(a[9][3], a[9][1] + a[1][3]));
1 < n && 9 < n && 4 < n && (a[9][4] = min(a[9][4], a[9][1] + a[1][4]));
1 < n && 9 < n && 5 < n && (a[9][5] = min(a[9][5], a[9][1] + a[1][5]));
1 < n && 9 < n && 6 < n && (a[9][6] = min(a[9][6], a[9][1] + a[1][6]));
1 < n && 9 < n && 7 < n && (a[9][7] = min(a[9][7], a[9][1] + a[1][7]));
1 < n && 9 < n && 8 < n && (a[9][8] = min(a[9][8], a[9][1] + a[1][8]));
1 < n && 9 < n && 9 < n && (a[9][9] = min(a[9][9], a[9][1] + a[1][9]));
2 < n && 0 < n && 0 < n && (a[0][0] = min(a[0][0], a[0][2] + a[2][0]));
2 < n && 0 < n && 1 < n && (a[0][1] = min(a[0][1], a[0][2] + a[2][1]));
2 < n && 0 < n && 2 < n && (a[0][2] = min(a[0][2], a[0][2] + a[2][2]));
2 < n && 0 < n && 3 < n && (a[0][3] = min(a[0][3], a[0][2] + a[2][3]));
2 < n && 0 < n && 4 < n && (a[0][4] = min(a[0][4], a[0][2] + a[2][4]));
2 < n && 0 < n && 5 < n && (a[0][5] = min(a[0][5], a[0][2] + a[2][5]));
2 < n && 0 < n && 6 < n && (a[0][6] = min(a[0][6], a[0][2] + a[2][6]));
2 < n && 0 < n && 7 < n && (a[0][7] = min(a[0][7], a[0][2] + a[2][7]));
2 < n && 0 < n && 8 < n && (a[0][8] = min(a[0][8], a[0][2] + a[2][8]));
2 < n && 0 < n && 9 < n && (a[0][9] = min(a[0][9], a[0][2] + a[2][9]));
2 < n && 1 < n && 0 < n && (a[1][0] = min(a[1][0], a[1][2] + a[2][0]));
2 < n && 1 < n && 1 < n && (a[1][1] = min(a[1][1], a[1][2] + a[2][1]));
2 < n && 1 < n && 2 < n && (a[1][2] = min(a[1][2], a[1][2] + a[2][2]));
2 < n && 1 < n && 3 < n && (a[1][3] = min(a[1][3], a[1][2] + a[2][3]));
2 < n && 1 < n && 4 < n && (a[1][4] = min(a[1][4], a[1][2] + a[2][4]));
2 < n && 1 < n && 5 < n && (a[1][5] = min(a[1][5], a[1][2] + a[2][5]));
2 < n && 1 < n && 6 < n && (a[1][6] = min(a[1][6], a[1][2] + a[2][6]));
2 < n && 1 < n && 7 < n && (a[1][7] = min(a[1][7], a[1][2] + a[2][7]));
2 < n && 1 < n && 8 < n && (a[1][8] = min(a[1][8], a[1][2] + a[2][8]));
2 < n && 1 < n && 9 < n && (a[1][9] = min(a[1][9], a[1][2] + a[2][9]));
2 < n && 2 < n && 0 < n && (a[2][0] = min(a[2][0], a[2][2] + a[2][0]));
2 < n && 2 < n && 1 < n && (a[2][1] = min(a[2][1], a[2][2] + a[2][1]));
2 < n && 2 < n && 2 < n && (a[2][2] = min(a[2][2], a[2][2] + a[2][2]));
2 < n && 2 < n && 3 < n && (a[2][3] = min(a[2][3], a[2][2] + a[2][3]));
2 < n && 2 < n && 4 < n && (a[2][4] = min(a[2][4], a[2][2] + a[2][4]));
2 < n && 2 < n && 5 < n && (a[2][5] = min(a[2][5], a[2][2] + a[2][5]));
2 < n && 2 < n && 6 < n && (a[2][6] = min(a[2][6], a[2][2] + a[2][6]));
2 < n && 2 < n && 7 < n && (a[2][7] = min(a[2][7], a[2][2] + a[2][7]));
2 < n && 2 < n && 8 < n && (a[2][8] = min(a[2][8], a[2][2] + a[2][8]));
2 < n && 2 < n && 9 < n && (a[2][9] = min(a[2][9], a[2][2] + a[2][9]));
2 < n && 3 < n && 0 < n && (a[3][0] = min(a[3][0], a[3][2] + a[2][0]));
2 < n && 3 < n && 1 < n && (a[3][1] = min(a[3][1], a[3][2] + a[2][1]));
2 < n && 3 < n && 2 < n && (a[3][2] = min(a[3][2], a[3][2] + a[2][2]));
2 < n && 3 < n && 3 < n && (a[3][3] = min(a[3][3], a[3][2] + a[2][3]));
2 < n && 3 < n && 4 < n && (a[3][4] = min(a[3][4], a[3][2] + a[2][4]));
2 < n && 3 < n && 5 < n && (a[3][5] = min(a[3][5], a[3][2] + a[2][5]));
2 < n && 3 < n && 6 < n && (a[3][6] = min(a[3][6], a[3][2] + a[2][6]));
2 < n && 3 < n && 7 < n && (a[3][7] = min(a[3][7], a[3][2] + a[2][7]));
2 < n && 3 < n && 8 < n && (a[3][8] = min(a[3][8], a[3][2] + a[2][8]));
2 < n && 3 < n && 9 < n && (a[3][9] = min(a[3][9], a[3][2] + a[2][9]));
2 < n && 4 < n && 0 < n && (a[4][0] = min(a[4][0], a[4][2] + a[2][0]));
2 < n && 4 < n && 1 < n && (a[4][1] = min(a[4][1], a[4][2] + a[2][1]));
2 < n && 4 < n && 2 < n && (a[4][2] = min(a[4][2], a[4][2] + a[2][2]));
2 < n && 4 < n && 3 < n && (a[4][3] = min(a[4][3], a[4][2] + a[2][3]));
2 < n && 4 < n && 4 < n && (a[4][4] = min(a[4][4], a[4][2] + a[2][4]));
2 < n && 4 < n && 5 < n && (a[4][5] = min(a[4][5], a[4][2] + a[2][5]));
2 < n && 4 < n && 6 < n && (a[4][6] = min(a[4][6], a[4][2] + a[2][6]));
2 < n && 4 < n && 7 < n && (a[4][7] = min(a[4][7], a[4][2] + a[2][7]));
2 < n && 4 < n && 8 < n && (a[4][8] = min(a[4][8], a[4][2] + a[2][8]));
2 < n && 4 < n && 9 < n && (a[4][9] = min(a[4][9], a[4][2] + a[2][9]));
2 < n && 5 < n && 0 < n && (a[5][0] = min(a[5][0], a[5][2] + a[2][0]));
2 < n && 5 < n && 1 < n && (a[5][1] = min(a[5][1], a[5][2] + a[2][1]));
2 < n && 5 < n && 2 < n && (a[5][2] = min(a[5][2], a[5][2] + a[2][2]));
2 < n && 5 < n && 3 < n && (a[5][3] = min(a[5][3], a[5][2] + a[2][3]));
2 < n && 5 < n && 4 < n && (a[5][4] = min(a[5][4], a[5][2] + a[2][4]));
2 < n && 5 < n && 5 < n && (a[5][5] = min(a[5][5], a[5][2] + a[2][5]));
2 < n && 5 < n && 6 < n && (a[5][6] = min(a[5][6], a[5][2] + a[2][6]));
2 < n && 5 < n && 7 < n && (a[5][7] = min(a[5][7], a[5][2] + a[2][7]));
2 < n && 5 < n && 8 < n && (a[5][8] = min(a[5][8], a[5][2] + a[2][8]));
2 < n && 5 < n && 9 < n && (a[5][9] = min(a[5][9], a[5][2] + a[2][9]));
2 < n && 6 < n && 0 < n && (a[6][0] = min(a[6][0], a[6][2] + a[2][0]));
2 < n && 6 < n && 1 < n && (a[6][1] = min(a[6][1], a[6][2] + a[2][1]));
2 < n && 6 < n && 2 < n && (a[6][2] = min(a[6][2], a[6][2] + a[2][2]));
2 < n && 6 < n && 3 < n && (a[6][3] = min(a[6][3], a[6][2] + a[2][3]));
2 < n && 6 < n && 4 < n && (a[6][4] = min(a[6][4], a[6][2] + a[2][4]));
2 < n && 6 < n && 5 < n && (a[6][5] = min(a[6][5], a[6][2] + a[2][5]));
2 < n && 6 < n && 6 < n && (a[6][6] = min(a[6][6], a[6][2] + a[2][6]));
2 < n && 6 < n && 7 < n && (a[6][7] = min(a[6][7], a[6][2] + a[2][7]));
2 < n && 6 < n && 8 < n && (a[6][8] = min(a[6][8], a[6][2] + a[2][8]));
2 < n && 6 < n && 9 < n && (a[6][9] = min(a[6][9], a[6][2] + a[2][9]));
2 < n && 7 < n && 0 < n && (a[7][0] = min(a[7][0], a[7][2] + a[2][0]));
2 < n && 7 < n && 1 < n && (a[7][1] = min(a[7][1], a[7][2] + a[2][1]));
2 < n && 7 < n && 2 < n && (a[7][2] = min(a[7][2], a[7][2] + a[2][2]));
2 < n && 7 < n && 3 < n && (a[7][3] = min(a[7][3], a[7][2] + a[2][3]));
2 < n && 7 < n && 4 < n && (a[7][4] = min(a[7][4], a[7][2] + a[2][4]));
2 < n && 7 < n && 5 < n && (a[7][5] = min(a[7][5], a[7][2] + a[2][5]));
2 < n && 7 < n && 6 < n && (a[7][6] = min(a[7][6], a[7][2] + a[2][6]));
2 < n && 7 < n && 7 < n && (a[7][7] = min(a[7][7], a[7][2] + a[2][7]));
2 < n && 7 < n && 8 < n && (a[7][8] = min(a[7][8], a[7][2] + a[2][8]));
2 < n && 7 < n && 9 < n && (a[7][9] = min(a[7][9], a[7][2] + a[2][9]));
2 < n && 8 < n && 0 < n && (a[8][0] = min(a[8][0], a[8][2] + a[2][0]));
2 < n && 8 < n && 1 < n && (a[8][1] = min(a[8][1], a[8][2] + a[2][1]));
2 < n && 8 < n && 2 < n && (a[8][2] = min(a[8][2], a[8][2] + a[2][2]));
2 < n && 8 < n && 3 < n && (a[8][3] = min(a[8][3], a[8][2] + a[2][3]));
2 < n && 8 < n && 4 < n && (a[8][4] = min(a[8][4], a[8][2] + a[2][4]));
2 < n && 8 < n && 5 < n && (a[8][5] = min(a[8][5], a[8][2] + a[2][5]));
2 < n && 8 < n && 6 < n && (a[8][6] = min(a[8][6], a[8][2] + a[2][6]));
2 < n && 8 < n && 7 < n && (a[8][7] = min(a[8][7], a[8][2] + a[2][7]));
2 < n && 8 < n && 8 < n && (a[8][8] = min(a[8][8], a[8][2] + a[2][8]));
2 < n && 8 < n && 9 < n && (a[8][9] = min(a[8][9], a[8][2] + a[2][9]));
2 < n && 9 < n && 0 < n && (a[9][0] = min(a[9][0], a[9][2] + a[2][0]));
2 < n && 9 < n && 1 < n && (a[9][1] = min(a[9][1], a[9][2] + a[2][1]));
2 < n && 9 < n && 2 < n && (a[9][2] = min(a[9][2], a[9][2] + a[2][2]));
2 < n && 9 < n && 3 < n && (a[9][3] = min(a[9][3], a[9][2] + a[2][3]));
2 < n && 9 < n && 4 < n && (a[9][4] = min(a[9][4], a[9][2] + a[2][4]));
2 < n && 9 < n && 5 < n && (a[9][5] = min(a[9][5], a[9][2] + a[2][5]));
2 < n && 9 < n && 6 < n && (a[9][6] = min(a[9][6], a[9][2] + a[2][6]));
2 < n && 9 < n && 7 < n && (a[9][7] = min(a[9][7], a[9][2] + a[2][7]));
2 < n && 9 < n && 8 < n && (a[9][8] = min(a[9][8], a[9][2] + a[2][8]));
2 < n && 9 < n && 9 < n && (a[9][9] = min(a[9][9], a[9][2] + a[2][9]));
3 < n && 0 < n && 0 < n && (a[0][0] = min(a[0][0], a[0][3] + a[3][0]));
3 < n && 0 < n && 1 < n && (a[0][1] = min(a[0][1], a[0][3] + a[3][1]));
3 < n && 0 < n && 2 < n && (a[0][2] = min(a[0][2], a[0][3] + a[3][2]));
3 < n && 0 < n && 3 < n && (a[0][3] = min(a[0][3], a[0][3] + a[3][3]));
3 < n && 0 < n && 4 < n && (a[0][4] = min(a[0][4], a[0][3] + a[3][4]));
3 < n && 0 < n && 5 < n && (a[0][5] = min(a[0][5], a[0][3] + a[3][5]));
3 < n && 0 < n && 6 < n && (a[0][6] = min(a[0][6], a[0][3] + a[3][6]));
3 < n && 0 < n && 7 < n && (a[0][7] = min(a[0][7], a[0][3] + a[3][7]));
3 < n && 0 < n && 8 < n && (a[0][8] = min(a[0][8], a[0][3] + a[3][8]));
3 < n && 0 < n && 9 < n && (a[0][9] = min(a[0][9], a[0][3] + a[3][9]));
3 < n && 1 < n && 0 < n && (a[1][0] = min(a[1][0], a[1][3] + a[3][0]));
3 < n && 1 < n && 1 < n && (a[1][1] = min(a[1][1], a[1][3] + a[3][1]));
3 < n && 1 < n && 2 < n && (a[1][2] = min(a[1][2], a[1][3] + a[3][2]));
3 < n && 1 < n && 3 < n && (a[1][3] = min(a[1][3], a[1][3] + a[3][3]));
3 < n && 1 < n && 4 < n && (a[1][4] = min(a[1][4], a[1][3] + a[3][4]));
3 < n && 1 < n && 5 < n && (a[1][5] = min(a[1][5], a[1][3] + a[3][5]));
3 < n && 1 < n && 6 < n && (a[1][6] = min(a[1][6], a[1][3] + a[3][6]));
3 < n && 1 < n && 7 < n && (a[1][7] = min(a[1][7], a[1][3] + a[3][7]));
3 < n && 1 < n && 8 < n && (a[1][8] = min(a[1][8], a[1][3] + a[3][8]));
3 < n && 1 < n && 9 < n && (a[1][9] = min(a[1][9], a[1][3] + a[3][9]));
3 < n && 2 < n && 0 < n && (a[2][0] = min(a[2][0], a[2][3] + a[3][0]));
3 < n && 2 < n && 1 < n && (a[2][1] = min(a[2][1], a[2][3] + a[3][1]));
3 < n && 2 < n && 2 < n && (a[2][2] = min(a[2][2], a[2][3] + a[3][2]));
3 < n && 2 < n && 3 < n && (a[2][3] = min(a[2][3], a[2][3] + a[3][3]));
3 < n && 2 < n && 4 < n && (a[2][4] = min(a[2][4], a[2][3] + a[3][4]));
3 < n && 2 < n && 5 < n && (a[2][5] = min(a[2][5], a[2][3] + a[3][5]));
3 < n && 2 < n && 6 < n && (a[2][6] = min(a[2][6], a[2][3] + a[3][6]));
3 < n && 2 < n && 7 < n && (a[2][7] = min(a[2][7], a[2][3] + a[3][7]));
3 < n && 2 < n && 8 < n && (a[2][8] = min(a[2][8], a[2][3] + a[3][8]));
3 < n && 2 < n && 9 < n && (a[2][9] = min(a[2][9], a[2][3] + a[3][9]));
3 < n && 3 < n && 0 < n && (a[3][0] = min(a[3][0], a[3][3] + a[3][0]));
3 < n && 3 < n && 1 < n && (a[3][1] = min(a[3][1], a[3][3] + a[3][1]));
3 < n && 3 < n && 2 < n && (a[3][2] = min(a[3][2], a[3][3] + a[3][2]));
3 < n && 3 < n && 3 < n && (a[3][3] = min(a[3][3], a[3][3] + a[3][3]));
3 < n && 3 < n && 4 < n && (a[3][4] = min(a[3][4], a[3][3] + a[3][4]));
3 < n && 3 < n && 5 < n && (a[3][5] = min(a[3][5], a[3][3] + a[3][5]));
3 < n && 3 < n && 6 < n && (a[3][6] = min(a[3][6], a[3][3] + a[3][6]));
3 < n && 3 < n && 7 < n && (a[3][7] = min(a[3][7], a[3][3] + a[3][7]));
3 < n && 3 < n && 8 < n && (a[3][8] = min(a[3][8], a[3][3] + a[3][8]));
3 < n && 3 < n && 9 < n && (a[3][9] = min(a[3][9], a[3][3] + a[3][9]));
3 < n && 4 < n && 0 < n && (a[4][0] = min(a[4][0], a[4][3] + a[3][0]));
3 < n && 4 < n && 1 < n && (a[4][1] = min(a[4][1], a[4][3] + a[3][1]));
3 < n && 4 < n && 2 < n && (a[4][2] = min(a[4][2], a[4][3] + a[3][2]));
3 < n && 4 < n && 3 < n && (a[4][3] = min(a[4][3], a[4][3] + a[3][3]));
3 < n && 4 < n && 4 < n && (a[4][4] = min(a[4][4], a[4][3] + a[3][4]));
3 < n && 4 < n && 5 < n && (a[4][5] = min(a[4][5], a[4][3] + a[3][5]));
3 < n && 4 < n && 6 < n && (a[4][6] = min(a[4][6], a[4][3] + a[3][6]));
3 < n && 4 < n && 7 < n && (a[4][7] = min(a[4][7], a[4][3] + a[3][7]));
3 < n && 4 < n && 8 < n && (a[4][8] = min(a[4][8], a[4][3] + a[3][8]));
3 < n && 4 < n && 9 < n && (a[4][9] = min(a[4][9], a[4][3] + a[3][9]));
3 < n && 5 < n && 0 < n && (a[5][0] = min(a[5][0], a[5][3] + a[3][0]));
3 < n && 5 < n && 1 < n && (a[5][1] = min(a[5][1], a[5][3] + a[3][1]));
3 < n && 5 < n && 2 < n && (a[5][2] = min(a[5][2], a[5][3] + a[3][2]));
3 < n && 5 < n && 3 < n && (a[5][3] = min(a[5][3], a[5][3] + a[3][3]));
3 < n && 5 < n && 4 < n && (a[5][4] = min(a[5][4], a[5][3] + a[3][4]));
3 < n && 5 < n && 5 < n && (a[5][5] = min(a[5][5], a[5][3] + a[3][5]));
3 < n && 5 < n && 6 < n && (a[5][6] = min(a[5][6], a[5][3] + a[3][6]));
3 < n && 5 < n && 7 < n && (a[5][7] = min(a[5][7], a[5][3] + a[3][7]));
3 < n && 5 < n && 8 < n && (a[5][8] = min(a[5][8], a[5][3] + a[3][8]));
3 < n && 5 < n && 9 < n && (a[5][9] = min(a[5][9], a[5][3] + a[3][9]));
3 < n && 6 < n && 0 < n && (a[6][0] = min(a[6][0], a[6][3] + a[3][0]));
3 < n && 6 < n && 1 < n && (a[6][1] = min(a[6][1], a[6][3] + a[3][1]));
3 < n && 6 < n && 2 < n && (a[6][2] = min(a[6][2], a[6][3] + a[3][2]));
3 < n && 6 < n && 3 < n && (a[6][3] = min(a[6][3], a[6][3] + a[3][3]));
3 < n && 6 < n && 4 < n && (a[6][4] = min(a[6][4], a[6][3] + a[3][4]));
3 < n && 6 < n && 5 < n && (a[6][5] = min(a[6][5], a[6][3] + a[3][5]));
3 < n && 6 < n && 6 < n && (a[6][6] = min(a[6][6], a[6][3] + a[3][6]));
3 < n && 6 < n && 7 < n && (a[6][7] = min(a[6][7], a[6][3] + a[3][7]));
3 < n && 6 < n && 8 < n && (a[6][8] = min(a[6][8], a[6][3] + a[3][8]));
3 < n && 6 < n && 9 < n && (a[6][9] = min(a[6][9], a[6][3] + a[3][9]));
3 < n && 7 < n && 0 < n && (a[7][0] = min(a[7][0], a[7][3] + a[3][0]));
3 < n && 7 < n && 1 < n && (a[7][1] = min(a[7][1], a[7][3] + a[3][1]));
3 < n && 7 < n && 2 < n && (a[7][2] = min(a[7][2], a[7][3] + a[3][2]));
3 < n && 7 < n && 3 < n && (a[7][3] = min(a[7][3], a[7][3] + a[3][3]));
3 < n && 7 < n && 4 < n && (a[7][4] = min(a[7][4], a[7][3] + a[3][4]));
3 < n && 7 < n && 5 < n && (a[7][5] = min(a[7][5], a[7][3] + a[3][5]));
3 < n && 7 < n && 6 < n && (a[7][6] = min(a[7][6], a[7][3] + a[3][6]));
3 < n && 7 < n && 7 < n && (a[7][7] = min(a[7][7], a[7][3] + a[3][7]));
3 < n && 7 < n && 8 < n && (a[7][8] = min(a[7][8], a[7][3] + a[3][8]));
3 < n && 7 < n && 9 < n && (a[7][9] = min(a[7][9], a[7][3] + a[3][9]));
3 < n && 8 < n && 0 < n && (a[8][0] = min(a[8][0], a[8][3] + a[3][0]));
3 < n && 8 < n && 1 < n && (a[8][1] = min(a[8][1], a[8][3] + a[3][1]));
3 < n && 8 < n && 2 < n && (a[8][2] = min(a[8][2], a[8][3] + a[3][2]));
3 < n && 8 < n && 3 < n && (a[8][3] = min(a[8][3], a[8][3] + a[3][3]));
3 < n && 8 < n && 4 < n && (a[8][4] = min(a[8][4], a[8][3] + a[3][4]));
3 < n && 8 < n && 5 < n && (a[8][5] = min(a[8][5], a[8][3] + a[3][5]));
3 < n && 8 < n && 6 < n && (a[8][6] = min(a[8][6], a[8][3] + a[3][6]));
3 < n && 8 < n && 7 < n && (a[8][7] = min(a[8][7], a[8][3] + a[3][7]));
3 < n && 8 < n && 8 < n && (a[8][8] = min(a[8][8], a[8][3] + a[3][8]));
3 < n && 8 < n && 9 < n && (a[8][9] = min(a[8][9], a[8][3] + a[3][9]));
3 < n && 9 < n && 0 < n && (a[9][0] = min(a[9][0], a[9][3] + a[3][0]));
3 < n && 9 < n && 1 < n && (a[9][1] = min(a[9][1], a[9][3] + a[3][1]));
3 < n && 9 < n && 2 < n && (a[9][2] = min(a[9][2], a[9][3] + a[3][2]));
3 < n && 9 < n && 3 < n && (a[9][3] = min(a[9][3], a[9][3] + a[3][3]));
3 < n && 9 < n && 4 < n && (a[9][4] = min(a[9][4], a[9][3] + a[3][4]));
3 < n && 9 < n && 5 < n && (a[9][5] = min(a[9][5], a[9][3] + a[3][5]));
3 < n && 9 < n && 6 < n && (a[9][6] = min(a[9][6], a[9][3] + a[3][6]));
3 < n && 9 < n && 7 < n && (a[9][7] = min(a[9][7], a[9][3] + a[3][7]));
3 < n && 9 < n && 8 < n && (a[9][8] = min(a[9][8], a[9][3] + a[3][8]));
3 < n && 9 < n && 9 < n && (a[9][9] = min(a[9][9], a[9][3] + a[3][9]));
4 < n && 0 < n && 0 < n && (a[0][0] = min(a[0][0], a[0][4] + a[4][0]));
4 < n && 0 < n && 1 < n && (a[0][1] = min(a[0][1], a[0][4] + a[4][1]));
4 < n && 0 < n && 2 < n && (a[0][2] = min(a[0][2], a[0][4] + a[4][2]));
4 < n && 0 < n && 3 < n && (a[0][3] = min(a[0][3], a[0][4] + a[4][3]));
4 < n && 0 < n && 4 < n && (a[0][4] = min(a[0][4], a[0][4] + a[4][4]));
4 < n && 0 < n && 5 < n && (a[0][5] = min(a[0][5], a[0][4] + a[4][5]));
4 < n && 0 < n && 6 < n && (a[0][6] = min(a[0][6], a[0][4] + a[4][6]));
4 < n && 0 < n && 7 < n && (a[0][7] = min(a[0][7], a[0][4] + a[4][7]));
4 < n && 0 < n && 8 < n && (a[0][8] = min(a[0][8], a[0][4] + a[4][8]));
4 < n && 0 < n && 9 < n && (a[0][9] = min(a[0][9], a[0][4] + a[4][9]));
4 < n && 1 < n && 0 < n && (a[1][0] = min(a[1][0], a[1][4] + a[4][0]));
4 < n && 1 < n && 1 < n && (a[1][1] = min(a[1][1], a[1][4] + a[4][1]));
4 < n && 1 < n && 2 < n && (a[1][2] = min(a[1][2], a[1][4] + a[4][2]));
4 < n && 1 < n && 3 < n && (a[1][3] = min(a[1][3], a[1][4] + a[4][3]));
4 < n && 1 < n && 4 < n && (a[1][4] = min(a[1][4], a[1][4] + a[4][4]));
4 < n && 1 < n && 5 < n && (a[1][5] = min(a[1][5], a[1][4] + a[4][5]));
4 < n && 1 < n && 6 < n && (a[1][6] = min(a[1][6], a[1][4] + a[4][6]));
4 < n && 1 < n && 7 < n && (a[1][7] = min(a[1][7], a[1][4] + a[4][7]));
4 < n && 1 < n && 8 < n && (a[1][8] = min(a[1][8], a[1][4] + a[4][8]));
4 < n && 1 < n && 9 < n && (a[1][9] = min(a[1][9], a[1][4] + a[4][9]));
4 < n && 2 < n && 0 < n && (a[2][0] = min(a[2][0], a[2][4] + a[4][0]));
4 < n && 2 < n && 1 < n && (a[2][1] = min(a[2][1], a[2][4] + a[4][1]));
4 < n && 2 < n && 2 < n && (a[2][2] = min(a[2][2], a[2][4] + a[4][2]));
4 < n && 2 < n && 3 < n && (a[2][3] = min(a[2][3], a[2][4] + a[4][3]));
4 < n && 2 < n && 4 < n && (a[2][4] = min(a[2][4], a[2][4] + a[4][4]));
4 < n && 2 < n && 5 < n && (a[2][5] = min(a[2][5], a[2][4] + a[4][5]));
4 < n && 2 < n && 6 < n && (a[2][6] = min(a[2][6], a[2][4] + a[4][6]));
4 < n && 2 < n && 7 < n && (a[2][7] = min(a[2][7], a[2][4] + a[4][7]));
4 < n && 2 < n && 8 < n && (a[2][8] = min(a[2][8], a[2][4] + a[4][8]));
4 < n && 2 < n && 9 < n && (a[2][9] = min(a[2][9], a[2][4] + a[4][9]));
4 < n && 3 < n && 0 < n && (a[3][0] = min(a[3][0], a[3][4] + a[4][0]));
4 < n && 3 < n && 1 < n && (a[3][1] = min(a[3][1], a[3][4] + a[4][1]));
4 < n && 3 < n && 2 < n && (a[3][2] = min(a[3][2], a[3][4] + a[4][2]));
4 < n && 3 < n && 3 < n && (a[3][3] = min(a[3][3], a[3][4] + a[4][3]));
4 < n && 3 < n && 4 < n && (a[3][4] = min(a[3][4], a[3][4] + a[4][4]));
4 < n && 3 < n && 5 < n && (a[3][5] = min(a[3][5], a[3][4] + a[4][5]));
4 < n && 3 < n && 6 < n && (a[3][6] = min(a[3][6], a[3][4] + a[4][6]));
4 < n && 3 < n && 7 < n && (a[3][7] = min(a[3][7], a[3][4] + a[4][7]));
4 < n && 3 < n && 8 < n && (a[3][8] = min(a[3][8], a[3][4] + a[4][8]));
4 < n && 3 < n && 9 < n && (a[3][9] = min(a[3][9], a[3][4] + a[4][9]));
4 < n && 4 < n && 0 < n && (a[4][0] = min(a[4][0], a[4][4] + a[4][0]));
4 < n && 4 < n && 1 < n && (a[4][1] = min(a[4][1], a[4][4] + a[4][1]));
4 < n && 4 < n && 2 < n && (a[4][2] = min(a[4][2], a[4][4] + a[4][2]));
4 < n && 4 < n && 3 < n && (a[4][3] = min(a[4][3], a[4][4] + a[4][3]));
4 < n && 4 < n && 4 < n && (a[4][4] = min(a[4][4], a[4][4] + a[4][4]));
4 < n && 4 < n && 5 < n && (a[4][5] = min(a[4][5], a[4][4] + a[4][5]));
4 < n && 4 < n && 6 < n && (a[4][6] = min(a[4][6], a[4][4] + a[4][6]));
4 < n && 4 < n && 7 < n && (a[4][7] = min(a[4][7], a[4][4] + a[4][7]));
4 < n && 4 < n && 8 < n && (a[4][8] = min(a[4][8], a[4][4] + a[4][8]));
4 < n && 4 < n && 9 < n && (a[4][9] = min(a[4][9], a[4][4] + a[4][9]));
4 < n && 5 < n && 0 < n && (a[5][0] = min(a[5][0], a[5][4] + a[4][0]));
4 < n && 5 < n && 1 < n && (a[5][1] = min(a[5][1], a[5][4] + a[4][1]));
4 < n && 5 < n && 2 < n && (a[5][2] = min(a[5][2], a[5][4] + a[4][2]));
4 < n && 5 < n && 3 < n && (a[5][3] = min(a[5][3], a[5][4] + a[4][3]));
4 < n && 5 < n && 4 < n && (a[5][4] = min(a[5][4], a[5][4] + a[4][4]));
4 < n && 5 < n && 5 < n && (a[5][5] = min(a[5][5], a[5][4] + a[4][5]));
4 < n && 5 < n && 6 < n && (a[5][6] = min(a[5][6], a[5][4] + a[4][6]));
4 < n && 5 < n && 7 < n && (a[5][7] = min(a[5][7], a[5][4] + a[4][7]));
4 < n && 5 < n && 8 < n && (a[5][8] = min(a[5][8], a[5][4] + a[4][8]));
4 < n && 5 < n && 9 < n && (a[5][9] = min(a[5][9], a[5][4] + a[4][9]));
4 < n && 6 < n && 0 < n && (a[6][0] = min(a[6][0], a[6][4] + a[4][0]));
4 < n && 6 < n && 1 < n && (a[6][1] = min(a[6][1], a[6][4] + a[4][1]));
4 < n && 6 < n && 2 < n && (a[6][2] = min(a[6][2], a[6][4] + a[4][2]));
4 < n && 6 < n && 3 < n && (a[6][3] = min(a[6][3], a[6][4] + a[4][3]));
4 < n && 6 < n && 4 < n && (a[6][4] = min(a[6][4], a[6][4] + a[4][4]));
4 < n && 6 < n && 5 < n && (a[6][5] = min(a[6][5], a[6][4] + a[4][5]));
4 < n && 6 < n && 6 < n && (a[6][6] = min(a[6][6], a[6][4] + a[4][6]));
4 < n && 6 < n && 7 < n && (a[6][7] = min(a[6][7], a[6][4] + a[4][7]));
4 < n && 6 < n && 8 < n && (a[6][8] = min(a[6][8], a[6][4] + a[4][8]));
4 < n && 6 < n && 9 < n && (a[6][9] = min(a[6][9], a[6][4] + a[4][9]));
4 < n && 7 < n && 0 < n && (a[7][0] = min(a[7][0], a[7][4] + a[4][0]));
4 < n && 7 < n && 1 < n && (a[7][1] = min(a[7][1], a[7][4] + a[4][1]));
4 < n && 7 < n && 2 < n && (a[7][2] = min(a[7][2], a[7][4] + a[4][2]));
4 < n && 7 < n && 3 < n && (a[7][3] = min(a[7][3], a[7][4] + a[4][3]));
4 < n && 7 < n && 4 < n && (a[7][4] = min(a[7][4], a[7][4] + a[4][4]));
4 < n && 7 < n && 5 < n && (a[7][5] = min(a[7][5], a[7][4] + a[4][5]));
4 < n && 7 < n && 6 < n && (a[7][6] = min(a[7][6], a[7][4] + a[4][6]));
4 < n && 7 < n && 7 < n && (a[7][7] = min(a[7][7], a[7][4] + a[4][7]));
4 < n && 7 < n && 8 < n && (a[7][8] = min(a[7][8], a[7][4] + a[4][8]));
4 < n && 7 < n && 9 < n && (a[7][9] = min(a[7][9], a[7][4] + a[4][9]));
4 < n && 8 < n && 0 < n && (a[8][0] = min(a[8][0], a[8][4] + a[4][0]));
4 < n && 8 < n && 1 < n && (a[8][1] = min(a[8][1], a[8][4] + a[4][1]));
4 < n && 8 < n && 2 < n && (a[8][2] = min(a[8][2], a[8][4] + a[4][2]));
4 < n && 8 < n && 3 < n && (a[8][3] = min(a[8][3], a[8][4] + a[4][3]));
4 < n && 8 < n && 4 < n && (a[8][4] = min(a[8][4], a[8][4] + a[4][4]));
4 < n && 8 < n && 5 < n && (a[8][5] = min(a[8][5], a[8][4] + a[4][5]));
4 < n && 8 < n && 6 < n && (a[8][6] = min(a[8][6], a[8][4] + a[4][6]));
4 < n && 8 < n && 7 < n && (a[8][7] = min(a[8][7], a[8][4] + a[4][7]));
4 < n && 8 < n && 8 < n && (a[8][8] = min(a[8][8], a[8][4] + a[4][8]));
4 < n && 8 < n && 9 < n && (a[8][9] = min(a[8][9], a[8][4] + a[4][9]));
4 < n && 9 < n && 0 < n && (a[9][0] = min(a[9][0], a[9][4] + a[4][0]));
4 < n && 9 < n && 1 < n && (a[9][1] = min(a[9][1], a[9][4] + a[4][1]));
4 < n && 9 < n && 2 < n && (a[9][2] = min(a[9][2], a[9][4] + a[4][2]));
4 < n && 9 < n && 3 < n && (a[9][3] = min(a[9][3], a[9][4] + a[4][3]));
4 < n && 9 < n && 4 < n && (a[9][4] = min(a[9][4], a[9][4] + a[4][4]));
4 < n && 9 < n && 5 < n && (a[9][5] = min(a[9][5], a[9][4] + a[4][5]));
4 < n && 9 < n && 6 < n && (a[9][6] = min(a[9][6], a[9][4] + a[4][6]));
4 < n && 9 < n && 7 < n && (a[9][7] = min(a[9][7], a[9][4] + a[4][7]));
4 < n && 9 < n && 8 < n && (a[9][8] = min(a[9][8], a[9][4] + a[4][8]));
4 < n && 9 < n && 9 < n && (a[9][9] = min(a[9][9], a[9][4] + a[4][9]));
5 < n && 0 < n && 0 < n && (a[0][0] = min(a[0][0], a[0][5] + a[5][0]));
5 < n && 0 < n && 1 < n && (a[0][1] = min(a[0][1], a[0][5] + a[5][1]));
5 < n && 0 < n && 2 < n && (a[0][2] = min(a[0][2], a[0][5] + a[5][2]));
5 < n && 0 < n && 3 < n && (a[0][3] = min(a[0][3], a[0][5] + a[5][3]));
5 < n && 0 < n && 4 < n && (a[0][4] = min(a[0][4], a[0][5] + a[5][4]));
5 < n && 0 < n && 5 < n && (a[0][5] = min(a[0][5], a[0][5] + a[5][5]));
5 < n && 0 < n && 6 < n && (a[0][6] = min(a[0][6], a[0][5] + a[5][6]));
5 < n && 0 < n && 7 < n && (a[0][7] = min(a[0][7], a[0][5] + a[5][7]));
5 < n && 0 < n && 8 < n && (a[0][8] = min(a[0][8], a[0][5] + a[5][8]));
5 < n && 0 < n && 9 < n && (a[0][9] = min(a[0][9], a[0][5] + a[5][9]));
5 < n && 1 < n && 0 < n && (a[1][0] = min(a[1][0], a[1][5] + a[5][0]));
5 < n && 1 < n && 1 < n && (a[1][1] = min(a[1][1], a[1][5] + a[5][1]));
5 < n && 1 < n && 2 < n && (a[1][2] = min(a[1][2], a[1][5] + a[5][2]));
5 < n && 1 < n && 3 < n && (a[1][3] = min(a[1][3], a[1][5] + a[5][3]));
5 < n && 1 < n && 4 < n && (a[1][4] = min(a[1][4], a[1][5] + a[5][4]));
5 < n && 1 < n && 5 < n && (a[1][5] = min(a[1][5], a[1][5] + a[5][5]));
5 < n && 1 < n && 6 < n && (a[1][6] = min(a[1][6], a[1][5] + a[5][6]));
5 < n && 1 < n && 7 < n && (a[1][7] = min(a[1][7], a[1][5] + a[5][7]));
5 < n && 1 < n && 8 < n && (a[1][8] = min(a[1][8], a[1][5] + a[5][8]));
5 < n && 1 < n && 9 < n && (a[1][9] = min(a[1][9], a[1][5] + a[5][9]));
5 < n && 2 < n && 0 < n && (a[2][0] = min(a[2][0], a[2][5] + a[5][0]));
5 < n && 2 < n && 1 < n && (a[2][1] = min(a[2][1], a[2][5] + a[5][1]));
5 < n && 2 < n && 2 < n && (a[2][2] = min(a[2][2], a[2][5] + a[5][2]));
5 < n && 2 < n && 3 < n && (a[2][3] = min(a[2][3], a[2][5] + a[5][3]));
5 < n && 2 < n && 4 < n && (a[2][4] = min(a[2][4], a[2][5] + a[5][4]));
5 < n && 2 < n && 5 < n && (a[2][5] = min(a[2][5], a[2][5] + a[5][5]));
5 < n && 2 < n && 6 < n && (a[2][6] = min(a[2][6], a[2][5] + a[5][6]));
5 < n && 2 < n && 7 < n && (a[2][7] = min(a[2][7], a[2][5] + a[5][7]));
5 < n && 2 < n && 8 < n && (a[2][8] = min(a[2][8], a[2][5] + a[5][8]));
5 < n && 2 < n && 9 < n && (a[2][9] = min(a[2][9], a[2][5] + a[5][9]));
5 < n && 3 < n && 0 < n && (a[3][0] = min(a[3][0], a[3][5] + a[5][0]));
5 < n && 3 < n && 1 < n && (a[3][1] = min(a[3][1], a[3][5] + a[5][1]));
5 < n && 3 < n && 2 < n && (a[3][2] = min(a[3][2], a[3][5] + a[5][2]));
5 < n && 3 < n && 3 < n && (a[3][3] = min(a[3][3], a[3][5] + a[5][3]));
5 < n && 3 < n && 4 < n && (a[3][4] = min(a[3][4], a[3][5] + a[5][4]));
5 < n && 3 < n && 5 < n && (a[3][5] = min(a[3][5], a[3][5] + a[5][5]));
5 < n && 3 < n && 6 < n && (a[3][6] = min(a[3][6], a[3][5] + a[5][6]));
5 < n && 3 < n && 7 < n && (a[3][7] = min(a[3][7], a[3][5] + a[5][7]));
5 < n && 3 < n && 8 < n && (a[3][8] = min(a[3][8], a[3][5] + a[5][8]));
5 < n && 3 < n && 9 < n && (a[3][9] = min(a[3][9], a[3][5] + a[5][9]));
5 < n && 4 < n && 0 < n && (a[4][0] = min(a[4][0], a[4][5] + a[5][0]));
5 < n && 4 < n && 1 < n && (a[4][1] = min(a[4][1], a[4][5] + a[5][1]));
5 < n && 4 < n && 2 < n && (a[4][2] = min(a[4][2], a[4][5] + a[5][2]));
5 < n && 4 < n && 3 < n && (a[4][3] = min(a[4][3], a[4][5] + a[5][3]));
5 < n && 4 < n && 4 < n && (a[4][4] = min(a[4][4], a[4][5] + a[5][4]));
5 < n && 4 < n && 5 < n && (a[4][5] = min(a[4][5], a[4][5] + a[5][5]));
5 < n && 4 < n && 6 < n && (a[4][6] = min(a[4][6], a[4][5] + a[5][6]));
5 < n && 4 < n && 7 < n && (a[4][7] = min(a[4][7], a[4][5] + a[5][7]));
5 < n && 4 < n && 8 < n && (a[4][8] = min(a[4][8], a[4][5] + a[5][8]));
5 < n && 4 < n && 9 < n && (a[4][9] = min(a[4][9], a[4][5] + a[5][9]));
5 < n && 5 < n && 0 < n && (a[5][0] = min(a[5][0], a[5][5] + a[5][0]));
5 < n && 5 < n && 1 < n && (a[5][1] = min(a[5][1], a[5][5] + a[5][1]));
5 < n && 5 < n && 2 < n && (a[5][2] = min(a[5][2], a[5][5] + a[5][2]));
5 < n && 5 < n && 3 < n && (a[5][3] = min(a[5][3], a[5][5] + a[5][3]));
5 < n && 5 < n && 4 < n && (a[5][4] = min(a[5][4], a[5][5] + a[5][4]));
5 < n && 5 < n && 5 < n && (a[5][5] = min(a[5][5], a[5][5] + a[5][5]));
5 < n && 5 < n && 6 < n && (a[5][6] = min(a[5][6], a[5][5] + a[5][6]));
5 < n && 5 < n && 7 < n && (a[5][7] = min(a[5][7], a[5][5] + a[5][7]));
5 < n && 5 < n && 8 < n && (a[5][8] = min(a[5][8], a[5][5] + a[5][8]));
5 < n && 5 < n && 9 < n && (a[5][9] = min(a[5][9], a[5][5] + a[5][9]));
5 < n && 6 < n && 0 < n && (a[6][0] = min(a[6][0], a[6][5] + a[5][0]));
5 < n && 6 < n && 1 < n && (a[6][1] = min(a[6][1], a[6][5] + a[5][1]));
5 < n && 6 < n && 2 < n && (a[6][2] = min(a[6][2], a[6][5] + a[5][2]));
5 < n && 6 < n && 3 < n && (a[6][3] = min(a[6][3], a[6][5] + a[5][3]));
5 < n && 6 < n && 4 < n && (a[6][4] = min(a[6][4], a[6][5] + a[5][4]));
5 < n && 6 < n && 5 < n && (a[6][5] = min(a[6][5], a[6][5] + a[5][5]));
5 < n && 6 < n && 6 < n && (a[6][6] = min(a[6][6], a[6][5] + a[5][6]));
5 < n && 6 < n && 7 < n && (a[6][7] = min(a[6][7], a[6][5] + a[5][7]));
5 < n && 6 < n && 8 < n && (a[6][8] = min(a[6][8], a[6][5] + a[5][8]));
5 < n && 6 < n && 9 < n && (a[6][9] = min(a[6][9], a[6][5] + a[5][9]));
5 < n && 7 < n && 0 < n && (a[7][0] = min(a[7][0], a[7][5] + a[5][0]));
5 < n && 7 < n && 1 < n && (a[7][1] = min(a[7][1], a[7][5] + a[5][1]));
5 < n && 7 < n && 2 < n && (a[7][2] = min(a[7][2], a[7][5] + a[5][2]));
5 < n && 7 < n && 3 < n && (a[7][3] = min(a[7][3], a[7][5] + a[5][3]));
5 < n && 7 < n && 4 < n && (a[7][4] = min(a[7][4], a[7][5] + a[5][4]));
5 < n && 7 < n && 5 < n && (a[7][5] = min(a[7][5], a[7][5] + a[5][5]));
5 < n && 7 < n && 6 < n && (a[7][6] = min(a[7][6], a[7][5] + a[5][6]));
5 < n && 7 < n && 7 < n && (a[7][7] = min(a[7][7], a[7][5] + a[5][7]));
5 < n && 7 < n && 8 < n && (a[7][8] = min(a[7][8], a[7][5] + a[5][8]));
5 < n && 7 < n && 9 < n && (a[7][9] = min(a[7][9], a[7][5] + a[5][9]));
5 < n && 8 < n && 0 < n && (a[8][0] = min(a[8][0], a[8][5] + a[5][0]));
5 < n && 8 < n && 1 < n && (a[8][1] = min(a[8][1], a[8][5] + a[5][1]));
5 < n && 8 < n && 2 < n && (a[8][2] = min(a[8][2], a[8][5] + a[5][2]));
5 < n && 8 < n && 3 < n && (a[8][3] = min(a[8][3], a[8][5] + a[5][3]));
5 < n && 8 < n && 4 < n && (a[8][4] = min(a[8][4], a[8][5] + a[5][4]));
5 < n && 8 < n && 5 < n && (a[8][5] = min(a[8][5], a[8][5] + a[5][5]));
5 < n && 8 < n && 6 < n && (a[8][6] = min(a[8][6], a[8][5] + a[5][6]));
5 < n && 8 < n && 7 < n && (a[8][7] = min(a[8][7], a[8][5] + a[5][7]));
5 < n && 8 < n && 8 < n && (a[8][8] = min(a[8][8], a[8][5] + a[5][8]));
5 < n && 8 < n && 9 < n && (a[8][9] = min(a[8][9], a[8][5] + a[5][9]));
5 < n && 9 < n && 0 < n && (a[9][0] = min(a[9][0], a[9][5] + a[5][0]));
5 < n && 9 < n && 1 < n && (a[9][1] = min(a[9][1], a[9][5] + a[5][1]));
5 < n && 9 < n && 2 < n && (a[9][2] = min(a[9][2], a[9][5] + a[5][2]));
5 < n && 9 < n && 3 < n && (a[9][3] = min(a[9][3], a[9][5] + a[5][3]));
5 < n && 9 < n && 4 < n && (a[9][4] = min(a[9][4], a[9][5] + a[5][4]));
5 < n && 9 < n && 5 < n && (a[9][5] = min(a[9][5], a[9][5] + a[5][5]));
5 < n && 9 < n && 6 < n && (a[9][6] = min(a[9][6], a[9][5] + a[5][6]));
5 < n && 9 < n && 7 < n && (a[9][7] = min(a[9][7], a[9][5] + a[5][7]));
5 < n && 9 < n && 8 < n && (a[9][8] = min(a[9][8], a[9][5] + a[5][8]));
5 < n && 9 < n && 9 < n && (a[9][9] = min(a[9][9], a[9][5] + a[5][9]));
6 < n && 0 < n && 0 < n && (a[0][0] = min(a[0][0], a[0][6] + a[6][0]));
6 < n && 0 < n && 1 < n && (a[0][1] = min(a[0][1], a[0][6] + a[6][1]));
6 < n && 0 < n && 2 < n && (a[0][2] = min(a[0][2], a[0][6] + a[6][2]));
6 < n && 0 < n && 3 < n && (a[0][3] = min(a[0][3], a[0][6] + a[6][3]));
6 < n && 0 < n && 4 < n && (a[0][4] = min(a[0][4], a[0][6] + a[6][4]));
6 < n && 0 < n && 5 < n && (a[0][5] = min(a[0][5], a[0][6] + a[6][5]));
6 < n && 0 < n && 6 < n && (a[0][6] = min(a[0][6], a[0][6] + a[6][6]));
6 < n && 0 < n && 7 < n && (a[0][7] = min(a[0][7], a[0][6] + a[6][7]));
6 < n && 0 < n && 8 < n && (a[0][8] = min(a[0][8], a[0][6] + a[6][8]));
6 < n && 0 < n && 9 < n && (a[0][9] = min(a[0][9], a[0][6] + a[6][9]));
6 < n && 1 < n && 0 < n && (a[1][0] = min(a[1][0], a[1][6] + a[6][0]));
6 < n && 1 < n && 1 < n && (a[1][1] = min(a[1][1], a[1][6] + a[6][1]));
6 < n && 1 < n && 2 < n && (a[1][2] = min(a[1][2], a[1][6] + a[6][2]));
6 < n && 1 < n && 3 < n && (a[1][3] = min(a[1][3], a[1][6] + a[6][3]));
6 < n && 1 < n && 4 < n && (a[1][4] = min(a[1][4], a[1][6] + a[6][4]));
6 < n && 1 < n && 5 < n && (a[1][5] = min(a[1][5], a[1][6] + a[6][5]));
6 < n && 1 < n && 6 < n && (a[1][6] = min(a[1][6], a[1][6] + a[6][6]));
6 < n && 1 < n && 7 < n && (a[1][7] = min(a[1][7], a[1][6] + a[6][7]));
6 < n && 1 < n && 8 < n && (a[1][8] = min(a[1][8], a[1][6] + a[6][8]));
6 < n && 1 < n && 9 < n && (a[1][9] = min(a[1][9], a[1][6] + a[6][9]));
6 < n && 2 < n && 0 < n && (a[2][0] = min(a[2][0], a[2][6] + a[6][0]));
6 < n && 2 < n && 1 < n && (a[2][1] = min(a[2][1], a[2][6] + a[6][1]));
6 < n && 2 < n && 2 < n && (a[2][2] = min(a[2][2], a[2][6] + a[6][2]));
6 < n && 2 < n && 3 < n && (a[2][3] = min(a[2][3], a[2][6] + a[6][3]));
6 < n && 2 < n && 4 < n && (a[2][4] = min(a[2][4], a[2][6] + a[6][4]));
6 < n && 2 < n && 5 < n && (a[2][5] = min(a[2][5], a[2][6] + a[6][5]));
6 < n && 2 < n && 6 < n && (a[2][6] = min(a[2][6], a[2][6] + a[6][6]));
6 < n && 2 < n && 7 < n && (a[2][7] = min(a[2][7], a[2][6] + a[6][7]));
6 < n && 2 < n && 8 < n && (a[2][8] = min(a[2][8], a[2][6] + a[6][8]));
6 < n && 2 < n && 9 < n && (a[2][9] = min(a[2][9], a[2][6] + a[6][9]));
6 < n && 3 < n && 0 < n && (a[3][0] = min(a[3][0], a[3][6] + a[6][0]));
6 < n && 3 < n && 1 < n && (a[3][1] = min(a[3][1], a[3][6] + a[6][1]));
6 < n && 3 < n && 2 < n && (a[3][2] = min(a[3][2], a[3][6] + a[6][2]));
6 < n && 3 < n && 3 < n && (a[3][3] = min(a[3][3], a[3][6] + a[6][3]));
6 < n && 3 < n && 4 < n && (a[3][4] = min(a[3][4], a[3][6] + a[6][4]));
6 < n && 3 < n && 5 < n && (a[3][5] = min(a[3][5], a[3][6] + a[6][5]));
6 < n && 3 < n && 6 < n && (a[3][6] = min(a[3][6], a[3][6] + a[6][6]));
6 < n && 3 < n && 7 < n && (a[3][7] = min(a[3][7], a[3][6] + a[6][7]));
6 < n && 3 < n && 8 < n && (a[3][8] = min(a[3][8], a[3][6] + a[6][8]));
6 < n && 3 < n && 9 < n && (a[3][9] = min(a[3][9], a[3][6] + a[6][9]));
6 < n && 4 < n && 0 < n && (a[4][0] = min(a[4][0], a[4][6] + a[6][0]));
6 < n && 4 < n && 1 < n && (a[4][1] = min(a[4][1], a[4][6] + a[6][1]));
6 < n && 4 < n && 2 < n && (a[4][2] = min(a[4][2], a[4][6] + a[6][2]));
6 < n && 4 < n && 3 < n && (a[4][3] = min(a[4][3], a[4][6] + a[6][3]));
6 < n && 4 < n && 4 < n && (a[4][4] = min(a[4][4], a[4][6] + a[6][4]));
6 < n && 4 < n && 5 < n && (a[4][5] = min(a[4][5], a[4][6] + a[6][5]));
6 < n && 4 < n && 6 < n && (a[4][6] = min(a[4][6], a[4][6] + a[6][6]));
6 < n && 4 < n && 7 < n && (a[4][7] = min(a[4][7], a[4][6] + a[6][7]));
6 < n && 4 < n && 8 < n && (a[4][8] = min(a[4][8], a[4][6] + a[6][8]));
6 < n && 4 < n && 9 < n && (a[4][9] = min(a[4][9], a[4][6] + a[6][9]));
6 < n && 5 < n && 0 < n && (a[5][0] = min(a[5][0], a[5][6] + a[6][0]));
6 < n && 5 < n && 1 < n && (a[5][1] = min(a[5][1], a[5][6] + a[6][1]));
6 < n && 5 < n && 2 < n && (a[5][2] = min(a[5][2], a[5][6] + a[6][2]));
6 < n && 5 < n && 3 < n && (a[5][3] = min(a[5][3], a[5][6] + a[6][3]));
6 < n && 5 < n && 4 < n && (a[5][4] = min(a[5][4], a[5][6] + a[6][4]));
6 < n && 5 < n && 5 < n && (a[5][5] = min(a[5][5], a[5][6] + a[6][5]));
6 < n && 5 < n && 6 < n && (a[5][6] = min(a[5][6], a[5][6] + a[6][6]));
6 < n && 5 < n && 7 < n && (a[5][7] = min(a[5][7], a[5][6] + a[6][7]));
6 < n && 5 < n && 8 < n && (a[5][8] = min(a[5][8], a[5][6] + a[6][8]));
6 < n && 5 < n && 9 < n && (a[5][9] = min(a[5][9], a[5][6] + a[6][9]));
6 < n && 6 < n && 0 < n && (a[6][0] = min(a[6][0], a[6][6] + a[6][0]));
6 < n && 6 < n && 1 < n && (a[6][1] = min(a[6][1], a[6][6] + a[6][1]));
6 < n && 6 < n && 2 < n && (a[6][2] = min(a[6][2], a[6][6] + a[6][2]));
6 < n && 6 < n && 3 < n && (a[6][3] = min(a[6][3], a[6][6] + a[6][3]));
6 < n && 6 < n && 4 < n && (a[6][4] = min(a[6][4], a[6][6] + a[6][4]));
6 < n && 6 < n && 5 < n && (a[6][5] = min(a[6][5], a[6][6] + a[6][5]));
6 < n && 6 < n && 6 < n && (a[6][6] = min(a[6][6], a[6][6] + a[6][6]));
6 < n && 6 < n && 7 < n && (a[6][7] = min(a[6][7], a[6][6] + a[6][7]));
6 < n && 6 < n && 8 < n && (a[6][8] = min(a[6][8], a[6][6] + a[6][8]));
6 < n && 6 < n && 9 < n && (a[6][9] = min(a[6][9], a[6][6] + a[6][9]));
6 < n && 7 < n && 0 < n && (a[7][0] = min(a[7][0], a[7][6] + a[6][0]));
6 < n && 7 < n && 1 < n && (a[7][1] = min(a[7][1], a[7][6] + a[6][1]));
6 < n && 7 < n && 2 < n && (a[7][2] = min(a[7][2], a[7][6] + a[6][2]));
6 < n && 7 < n && 3 < n && (a[7][3] = min(a[7][3], a[7][6] + a[6][3]));
6 < n && 7 < n && 4 < n && (a[7][4] = min(a[7][4], a[7][6] + a[6][4]));
6 < n && 7 < n && 5 < n && (a[7][5] = min(a[7][5], a[7][6] + a[6][5]));
6 < n && 7 < n && 6 < n && (a[7][6] = min(a[7][6], a[7][6] + a[6][6]));
6 < n && 7 < n && 7 < n && (a[7][7] = min(a[7][7], a[7][6] + a[6][7]));
6 < n && 7 < n && 8 < n && (a[7][8] = min(a[7][8], a[7][6] + a[6][8]));
6 < n && 7 < n && 9 < n && (a[7][9] = min(a[7][9], a[7][6] + a[6][9]));
6 < n && 8 < n && 0 < n && (a[8][0] = min(a[8][0], a[8][6] + a[6][0]));
6 < n && 8 < n && 1 < n && (a[8][1] = min(a[8][1], a[8][6] + a[6][1]));
6 < n && 8 < n && 2 < n && (a[8][2] = min(a[8][2], a[8][6] + a[6][2]));
6 < n && 8 < n && 3 < n && (a[8][3] = min(a[8][3], a[8][6] + a[6][3]));
6 < n && 8 < n && 4 < n && (a[8][4] = min(a[8][4], a[8][6] + a[6][4]));
6 < n && 8 < n && 5 < n && (a[8][5] = min(a[8][5], a[8][6] + a[6][5]));
6 < n && 8 < n && 6 < n && (a[8][6] = min(a[8][6], a[8][6] + a[6][6]));
6 < n && 8 < n && 7 < n && (a[8][7] = min(a[8][7], a[8][6] + a[6][7]));
6 < n && 8 < n && 8 < n && (a[8][8] = min(a[8][8], a[8][6] + a[6][8]));
6 < n && 8 < n && 9 < n && (a[8][9] = min(a[8][9], a[8][6] + a[6][9]));
6 < n && 9 < n && 0 < n && (a[9][0] = min(a[9][0], a[9][6] + a[6][0]));
6 < n && 9 < n && 1 < n && (a[9][1] = min(a[9][1], a[9][6] + a[6][1]));
6 < n && 9 < n && 2 < n && (a[9][2] = min(a[9][2], a[9][6] + a[6][2]));
6 < n && 9 < n && 3 < n && (a[9][3] = min(a[9][3], a[9][6] + a[6][3]));
6 < n && 9 < n && 4 < n && (a[9][4] = min(a[9][4], a[9][6] + a[6][4]));
6 < n && 9 < n && 5 < n && (a[9][5] = min(a[9][5], a[9][6] + a[6][5]));
6 < n && 9 < n && 6 < n && (a[9][6] = min(a[9][6], a[9][6] + a[6][6]));
6 < n && 9 < n && 7 < n && (a[9][7] = min(a[9][7], a[9][6] + a[6][7]));
6 < n && 9 < n && 8 < n && (a[9][8] = min(a[9][8], a[9][6] + a[6][8]));
6 < n && 9 < n && 9 < n && (a[9][9] = min(a[9][9], a[9][6] + a[6][9]));
7 < n && 0 < n && 0 < n && (a[0][0] = min(a[0][0], a[0][7] + a[7][0]));
7 < n && 0 < n && 1 < n && (a[0][1] = min(a[0][1], a[0][7] + a[7][1]));
7 < n && 0 < n && 2 < n && (a[0][2] = min(a[0][2], a[0][7] + a[7][2]));
7 < n && 0 < n && 3 < n && (a[0][3] = min(a[0][3], a[0][7] + a[7][3]));
7 < n && 0 < n && 4 < n && (a[0][4] = min(a[0][4], a[0][7] + a[7][4]));
7 < n && 0 < n && 5 < n && (a[0][5] = min(a[0][5], a[0][7] + a[7][5]));
7 < n && 0 < n && 6 < n && (a[0][6] = min(a[0][6], a[0][7] + a[7][6]));
7 < n && 0 < n && 7 < n && (a[0][7] = min(a[0][7], a[0][7] + a[7][7]));
7 < n && 0 < n && 8 < n && (a[0][8] = min(a[0][8], a[0][7] + a[7][8]));
7 < n && 0 < n && 9 < n && (a[0][9] = min(a[0][9], a[0][7] + a[7][9]));
7 < n && 1 < n && 0 < n && (a[1][0] = min(a[1][0], a[1][7] + a[7][0]));
7 < n && 1 < n && 1 < n && (a[1][1] = min(a[1][1], a[1][7] + a[7][1]));
7 < n && 1 < n && 2 < n && (a[1][2] = min(a[1][2], a[1][7] + a[7][2]));
7 < n && 1 < n && 3 < n && (a[1][3] = min(a[1][3], a[1][7] + a[7][3]));
7 < n && 1 < n && 4 < n && (a[1][4] = min(a[1][4], a[1][7] + a[7][4]));
7 < n && 1 < n && 5 < n && (a[1][5] = min(a[1][5], a[1][7] + a[7][5]));
7 < n && 1 < n && 6 < n && (a[1][6] = min(a[1][6], a[1][7] + a[7][6]));
7 < n && 1 < n && 7 < n && (a[1][7] = min(a[1][7], a[1][7] + a[7][7]));
7 < n && 1 < n && 8 < n && (a[1][8] = min(a[1][8], a[1][7] + a[7][8]));
7 < n && 1 < n && 9 < n && (a[1][9] = min(a[1][9], a[1][7] + a[7][9]));
7 < n && 2 < n && 0 < n && (a[2][0] = min(a[2][0], a[2][7] + a[7][0]));
7 < n && 2 < n && 1 < n && (a[2][1] = min(a[2][1], a[2][7] + a[7][1]));
7 < n && 2 < n && 2 < n && (a[2][2] = min(a[2][2], a[2][7] + a[7][2]));
7 < n && 2 < n && 3 < n && (a[2][3] = min(a[2][3], a[2][7] + a[7][3]));
7 < n && 2 < n && 4 < n && (a[2][4] = min(a[2][4], a[2][7] + a[7][4]));
7 < n && 2 < n && 5 < n && (a[2][5] = min(a[2][5], a[2][7] + a[7][5]));
7 < n && 2 < n && 6 < n && (a[2][6] = min(a[2][6], a[2][7] + a[7][6]));
7 < n && 2 < n && 7 < n && (a[2][7] = min(a[2][7], a[2][7] + a[7][7]));
7 < n && 2 < n && 8 < n && (a[2][8] = min(a[2][8], a[2][7] + a[7][8]));
7 < n && 2 < n && 9 < n && (a[2][9] = min(a[2][9], a[2][7] + a[7][9]));
7 < n && 3 < n && 0 < n && (a[3][0] = min(a[3][0], a[3][7] + a[7][0]));
7 < n && 3 < n && 1 < n && (a[3][1] = min(a[3][1], a[3][7] + a[7][1]));
7 < n && 3 < n && 2 < n && (a[3][2] = min(a[3][2], a[3][7] + a[7][2]));
7 < n && 3 < n && 3 < n && (a[3][3] = min(a[3][3], a[3][7] + a[7][3]));
7 < n && 3 < n && 4 < n && (a[3][4] = min(a[3][4], a[3][7] + a[7][4]));
7 < n && 3 < n && 5 < n && (a[3][5] = min(a[3][5], a[3][7] + a[7][5]));
7 < n && 3 < n && 6 < n && (a[3][6] = min(a[3][6], a[3][7] + a[7][6]));
7 < n && 3 < n && 7 < n && (a[3][7] = min(a[3][7], a[3][7] + a[7][7]));
7 < n && 3 < n && 8 < n && (a[3][8] = min(a[3][8], a[3][7] + a[7][8]));
7 < n && 3 < n && 9 < n && (a[3][9] = min(a[3][9], a[3][7] + a[7][9]));
7 < n && 4 < n && 0 < n && (a[4][0] = min(a[4][0], a[4][7] + a[7][0]));
7 < n && 4 < n && 1 < n && (a[4][1] = min(a[4][1], a[4][7] + a[7][1]));
7 < n && 4 < n && 2 < n && (a[4][2] = min(a[4][2], a[4][7] + a[7][2]));
7 < n && 4 < n && 3 < n && (a[4][3] = min(a[4][3], a[4][7] + a[7][3]));
7 < n && 4 < n && 4 < n && (a[4][4] = min(a[4][4], a[4][7] + a[7][4]));
7 < n && 4 < n && 5 < n && (a[4][5] = min(a[4][5], a[4][7] + a[7][5]));
7 < n && 4 < n && 6 < n && (a[4][6] = min(a[4][6], a[4][7] + a[7][6]));
7 < n && 4 < n && 7 < n && (a[4][7] = min(a[4][7], a[4][7] + a[7][7]));
7 < n && 4 < n && 8 < n && (a[4][8] = min(a[4][8], a[4][7] + a[7][8]));
7 < n && 4 < n && 9 < n && (a[4][9] = min(a[4][9], a[4][7] + a[7][9]));
7 < n && 5 < n && 0 < n && (a[5][0] = min(a[5][0], a[5][7] + a[7][0]));
7 < n && 5 < n && 1 < n && (a[5][1] = min(a[5][1], a[5][7] + a[7][1]));
7 < n && 5 < n && 2 < n && (a[5][2] = min(a[5][2], a[5][7] + a[7][2]));
7 < n && 5 < n && 3 < n && (a[5][3] = min(a[5][3], a[5][7] + a[7][3]));
7 < n && 5 < n && 4 < n && (a[5][4] = min(a[5][4], a[5][7] + a[7][4]));
7 < n && 5 < n && 5 < n && (a[5][5] = min(a[5][5], a[5][7] + a[7][5]));
7 < n && 5 < n && 6 < n && (a[5][6] = min(a[5][6], a[5][7] + a[7][6]));
7 < n && 5 < n && 7 < n && (a[5][7] = min(a[5][7], a[5][7] + a[7][7]));
7 < n && 5 < n && 8 < n && (a[5][8] = min(a[5][8], a[5][7] + a[7][8]));
7 < n && 5 < n && 9 < n && (a[5][9] = min(a[5][9], a[5][7] + a[7][9]));
7 < n && 6 < n && 0 < n && (a[6][0] = min(a[6][0], a[6][7] + a[7][0]));
7 < n && 6 < n && 1 < n && (a[6][1] = min(a[6][1], a[6][7] + a[7][1]));
7 < n && 6 < n && 2 < n && (a[6][2] = min(a[6][2], a[6][7] + a[7][2]));
7 < n && 6 < n && 3 < n && (a[6][3] = min(a[6][3], a[6][7] + a[7][3]));
7 < n && 6 < n && 4 < n && (a[6][4] = min(a[6][4], a[6][7] + a[7][4]));
7 < n && 6 < n && 5 < n && (a[6][5] = min(a[6][5], a[6][7] + a[7][5]));
7 < n && 6 < n && 6 < n && (a[6][6] = min(a[6][6], a[6][7] + a[7][6]));
7 < n && 6 < n && 7 < n && (a[6][7] = min(a[6][7], a[6][7] + a[7][7]));
7 < n && 6 < n && 8 < n && (a[6][8] = min(a[6][8], a[6][7] + a[7][8]));
7 < n && 6 < n && 9 < n && (a[6][9] = min(a[6][9], a[6][7] + a[7][9]));
7 < n && 7 < n && 0 < n && (a[7][0] = min(a[7][0], a[7][7] + a[7][0]));
7 < n && 7 < n && 1 < n && (a[7][1] = min(a[7][1], a[7][7] + a[7][1]));
7 < n && 7 < n && 2 < n && (a[7][2] = min(a[7][2], a[7][7] + a[7][2]));
7 < n && 7 < n && 3 < n && (a[7][3] = min(a[7][3], a[7][7] + a[7][3]));
7 < n && 7 < n && 4 < n && (a[7][4] = min(a[7][4], a[7][7] + a[7][4]));
7 < n && 7 < n && 5 < n && (a[7][5] = min(a[7][5], a[7][7] + a[7][5]));
7 < n && 7 < n && 6 < n && (a[7][6] = min(a[7][6], a[7][7] + a[7][6]));
7 < n && 7 < n && 7 < n && (a[7][7] = min(a[7][7], a[7][7] + a[7][7]));
7 < n && 7 < n && 8 < n && (a[7][8] = min(a[7][8], a[7][7] + a[7][8]));
7 < n && 7 < n && 9 < n && (a[7][9] = min(a[7][9], a[7][7] + a[7][9]));
7 < n && 8 < n && 0 < n && (a[8][0] = min(a[8][0], a[8][7] + a[7][0]));
7 < n && 8 < n && 1 < n && (a[8][1] = min(a[8][1], a[8][7] + a[7][1]));
7 < n && 8 < n && 2 < n && (a[8][2] = min(a[8][2], a[8][7] + a[7][2]));
7 < n && 8 < n && 3 < n && (a[8][3] = min(a[8][3], a[8][7] + a[7][3]));
7 < n && 8 < n && 4 < n && (a[8][4] = min(a[8][4], a[8][7] + a[7][4]));
7 < n && 8 < n && 5 < n && (a[8][5] = min(a[8][5], a[8][7] + a[7][5]));
7 < n && 8 < n && 6 < n && (a[8][6] = min(a[8][6], a[8][7] + a[7][6]));
7 < n && 8 < n && 7 < n && (a[8][7] = min(a[8][7], a[8][7] + a[7][7]));
7 < n && 8 < n && 8 < n && (a[8][8] = min(a[8][8], a[8][7] + a[7][8]));
7 < n && 8 < n && 9 < n && (a[8][9] = min(a[8][9], a[8][7] + a[7][9]));
7 < n && 9 < n && 0 < n && (a[9][0] = min(a[9][0], a[9][7] + a[7][0]));
7 < n && 9 < n && 1 < n && (a[9][1] = min(a[9][1], a[9][7] + a[7][1]));
7 < n && 9 < n && 2 < n && (a[9][2] = min(a[9][2], a[9][7] + a[7][2]));
7 < n && 9 < n && 3 < n && (a[9][3] = min(a[9][3], a[9][7] + a[7][3]));
7 < n && 9 < n && 4 < n && (a[9][4] = min(a[9][4], a[9][7] + a[7][4]));
7 < n && 9 < n && 5 < n && (a[9][5] = min(a[9][5], a[9][7] + a[7][5]));
7 < n && 9 < n && 6 < n && (a[9][6] = min(a[9][6], a[9][7] + a[7][6]));
7 < n && 9 < n && 7 < n && (a[9][7] = min(a[9][7], a[9][7] + a[7][7]));
7 < n && 9 < n && 8 < n && (a[9][8] = min(a[9][8], a[9][7] + a[7][8]));
7 < n && 9 < n && 9 < n && (a[9][9] = min(a[9][9], a[9][7] + a[7][9]));
8 < n && 0 < n && 0 < n && (a[0][0] = min(a[0][0], a[0][8] + a[8][0]));
8 < n && 0 < n && 1 < n && (a[0][1] = min(a[0][1], a[0][8] + a[8][1]));
8 < n && 0 < n && 2 < n && (a[0][2] = min(a[0][2], a[0][8] + a[8][2]));
8 < n && 0 < n && 3 < n && (a[0][3] = min(a[0][3], a[0][8] + a[8][3]));
8 < n && 0 < n && 4 < n && (a[0][4] = min(a[0][4], a[0][8] + a[8][4]));
8 < n && 0 < n && 5 < n && (a[0][5] = min(a[0][5], a[0][8] + a[8][5]));
8 < n && 0 < n && 6 < n && (a[0][6] = min(a[0][6], a[0][8] + a[8][6]));
8 < n && 0 < n && 7 < n && (a[0][7] = min(a[0][7], a[0][8] + a[8][7]));
8 < n && 0 < n && 8 < n && (a[0][8] = min(a[0][8], a[0][8] + a[8][8]));
8 < n && 0 < n && 9 < n && (a[0][9] = min(a[0][9], a[0][8] + a[8][9]));
8 < n && 1 < n && 0 < n && (a[1][0] = min(a[1][0], a[1][8] + a[8][0]));
8 < n && 1 < n && 1 < n && (a[1][1] = min(a[1][1], a[1][8] + a[8][1]));
8 < n && 1 < n && 2 < n && (a[1][2] = min(a[1][2], a[1][8] + a[8][2]));
8 < n && 1 < n && 3 < n && (a[1][3] = min(a[1][3], a[1][8] + a[8][3]));
8 < n && 1 < n && 4 < n && (a[1][4] = min(a[1][4], a[1][8] + a[8][4]));
8 < n && 1 < n && 5 < n && (a[1][5] = min(a[1][5], a[1][8] + a[8][5]));
8 < n && 1 < n && 6 < n && (a[1][6] = min(a[1][6], a[1][8] + a[8][6]));
8 < n && 1 < n && 7 < n && (a[1][7] = min(a[1][7], a[1][8] + a[8][7]));
8 < n && 1 < n && 8 < n && (a[1][8] = min(a[1][8], a[1][8] + a[8][8]));
8 < n && 1 < n && 9 < n && (a[1][9] = min(a[1][9], a[1][8] + a[8][9]));
8 < n && 2 < n && 0 < n && (a[2][0] = min(a[2][0], a[2][8] + a[8][0]));
8 < n && 2 < n && 1 < n && (a[2][1] = min(a[2][1], a[2][8] + a[8][1]));
8 < n && 2 < n && 2 < n && (a[2][2] = min(a[2][2], a[2][8] + a[8][2]));
8 < n && 2 < n && 3 < n && (a[2][3] = min(a[2][3], a[2][8] + a[8][3]));
8 < n && 2 < n && 4 < n && (a[2][4] = min(a[2][4], a[2][8] + a[8][4]));
8 < n && 2 < n && 5 < n && (a[2][5] = min(a[2][5], a[2][8] + a[8][5]));
8 < n && 2 < n && 6 < n && (a[2][6] = min(a[2][6], a[2][8] + a[8][6]));
8 < n && 2 < n && 7 < n && (a[2][7] = min(a[2][7], a[2][8] + a[8][7]));
8 < n && 2 < n && 8 < n && (a[2][8] = min(a[2][8], a[2][8] + a[8][8]));
8 < n && 2 < n && 9 < n && (a[2][9] = min(a[2][9], a[2][8] + a[8][9]));
8 < n && 3 < n && 0 < n && (a[3][0] = min(a[3][0], a[3][8] + a[8][0]));
8 < n && 3 < n && 1 < n && (a[3][1] = min(a[3][1], a[3][8] + a[8][1]));
8 < n && 3 < n && 2 < n && (a[3][2] = min(a[3][2], a[3][8] + a[8][2]));
8 < n && 3 < n && 3 < n && (a[3][3] = min(a[3][3], a[3][8] + a[8][3]));
8 < n && 3 < n && 4 < n && (a[3][4] = min(a[3][4], a[3][8] + a[8][4]));
8 < n && 3 < n && 5 < n && (a[3][5] = min(a[3][5], a[3][8] + a[8][5]));
8 < n && 3 < n && 6 < n && (a[3][6] = min(a[3][6], a[3][8] + a[8][6]));
8 < n && 3 < n && 7 < n && (a[3][7] = min(a[3][7], a[3][8] + a[8][7]));
8 < n && 3 < n && 8 < n && (a[3][8] = min(a[3][8], a[3][8] + a[8][8]));
8 < n && 3 < n && 9 < n && (a[3][9] = min(a[3][9], a[3][8] + a[8][9]));
8 < n && 4 < n && 0 < n && (a[4][0] = min(a[4][0], a[4][8] + a[8][0]));
8 < n && 4 < n && 1 < n && (a[4][1] = min(a[4][1], a[4][8] + a[8][1]));
8 < n && 4 < n && 2 < n && (a[4][2] = min(a[4][2], a[4][8] + a[8][2]));
8 < n && 4 < n && 3 < n && (a[4][3] = min(a[4][3], a[4][8] + a[8][3]));
8 < n && 4 < n && 4 < n && (a[4][4] = min(a[4][4], a[4][8] + a[8][4]));
8 < n && 4 < n && 5 < n && (a[4][5] = min(a[4][5], a[4][8] + a[8][5]));
8 < n && 4 < n && 6 < n && (a[4][6] = min(a[4][6], a[4][8] + a[8][6]));
8 < n && 4 < n && 7 < n && (a[4][7] = min(a[4][7], a[4][8] + a[8][7]));
8 < n && 4 < n && 8 < n && (a[4][8] = min(a[4][8], a[4][8] + a[8][8]));
8 < n && 4 < n && 9 < n && (a[4][9] = min(a[4][9], a[4][8] + a[8][9]));
8 < n && 5 < n && 0 < n && (a[5][0] = min(a[5][0], a[5][8] + a[8][0]));
8 < n && 5 < n && 1 < n && (a[5][1] = min(a[5][1], a[5][8] + a[8][1]));
8 < n && 5 < n && 2 < n && (a[5][2] = min(a[5][2], a[5][8] + a[8][2]));
8 < n && 5 < n && 3 < n && (a[5][3] = min(a[5][3], a[5][8] + a[8][3]));
8 < n && 5 < n && 4 < n && (a[5][4] = min(a[5][4], a[5][8] + a[8][4]));
8 < n && 5 < n && 5 < n && (a[5][5] = min(a[5][5], a[5][8] + a[8][5]));
8 < n && 5 < n && 6 < n && (a[5][6] = min(a[5][6], a[5][8] + a[8][6]));
8 < n && 5 < n && 7 < n && (a[5][7] = min(a[5][7], a[5][8] + a[8][7]));
8 < n && 5 < n && 8 < n && (a[5][8] = min(a[5][8], a[5][8] + a[8][8]));
8 < n && 5 < n && 9 < n && (a[5][9] = min(a[5][9], a[5][8] + a[8][9]));
8 < n && 6 < n && 0 < n && (a[6][0] = min(a[6][0], a[6][8] + a[8][0]));
8 < n && 6 < n && 1 < n && (a[6][1] = min(a[6][1], a[6][8] + a[8][1]));
8 < n && 6 < n && 2 < n && (a[6][2] = min(a[6][2], a[6][8] + a[8][2]));
8 < n && 6 < n && 3 < n && (a[6][3] = min(a[6][3], a[6][8] + a[8][3]));
8 < n && 6 < n && 4 < n && (a[6][4] = min(a[6][4], a[6][8] + a[8][4]));
8 < n && 6 < n && 5 < n && (a[6][5] = min(a[6][5], a[6][8] + a[8][5]));
8 < n && 6 < n && 6 < n && (a[6][6] = min(a[6][6], a[6][8] + a[8][6]));
8 < n && 6 < n && 7 < n && (a[6][7] = min(a[6][7], a[6][8] + a[8][7]));
8 < n && 6 < n && 8 < n && (a[6][8] = min(a[6][8], a[6][8] + a[8][8]));
8 < n && 6 < n && 9 < n && (a[6][9] = min(a[6][9], a[6][8] + a[8][9]));
8 < n && 7 < n && 0 < n && (a[7][0] = min(a[7][0], a[7][8] + a[8][0]));
8 < n && 7 < n && 1 < n && (a[7][1] = min(a[7][1], a[7][8] + a[8][1]));
8 < n && 7 < n && 2 < n && (a[7][2] = min(a[7][2], a[7][8] + a[8][2]));
8 < n && 7 < n && 3 < n && (a[7][3] = min(a[7][3], a[7][8] + a[8][3]));
8 < n && 7 < n && 4 < n && (a[7][4] = min(a[7][4], a[7][8] + a[8][4]));
8 < n && 7 < n && 5 < n && (a[7][5] = min(a[7][5], a[7][8] + a[8][5]));
8 < n && 7 < n && 6 < n && (a[7][6] = min(a[7][6], a[7][8] + a[8][6]));
8 < n && 7 < n && 7 < n && (a[7][7] = min(a[7][7], a[7][8] + a[8][7]));
8 < n && 7 < n && 8 < n && (a[7][8] = min(a[7][8], a[7][8] + a[8][8]));
8 < n && 7 < n && 9 < n && (a[7][9] = min(a[7][9], a[7][8] + a[8][9]));
8 < n && 8 < n && 0 < n && (a[8][0] = min(a[8][0], a[8][8] + a[8][0]));
8 < n && 8 < n && 1 < n && (a[8][1] = min(a[8][1], a[8][8] + a[8][1]));
8 < n && 8 < n && 2 < n && (a[8][2] = min(a[8][2], a[8][8] + a[8][2]));
8 < n && 8 < n && 3 < n && (a[8][3] = min(a[8][3], a[8][8] + a[8][3]));
8 < n && 8 < n && 4 < n && (a[8][4] = min(a[8][4], a[8][8] + a[8][4]));
8 < n && 8 < n && 5 < n && (a[8][5] = min(a[8][5], a[8][8] + a[8][5]));
8 < n && 8 < n && 6 < n && (a[8][6] = min(a[8][6], a[8][8] + a[8][6]));
8 < n && 8 < n && 7 < n && (a[8][7] = min(a[8][7], a[8][8] + a[8][7]));
8 < n && 8 < n && 8 < n && (a[8][8] = min(a[8][8], a[8][8] + a[8][8]));
8 < n && 8 < n && 9 < n && (a[8][9] = min(a[8][9], a[8][8] + a[8][9]));
8 < n && 9 < n && 0 < n && (a[9][0] = min(a[9][0], a[9][8] + a[8][0]));
8 < n && 9 < n && 1 < n && (a[9][1] = min(a[9][1], a[9][8] + a[8][1]));
8 < n && 9 < n && 2 < n && (a[9][2] = min(a[9][2], a[9][8] + a[8][2]));
8 < n && 9 < n && 3 < n && (a[9][3] = min(a[9][3], a[9][8] + a[8][3]));
8 < n && 9 < n && 4 < n && (a[9][4] = min(a[9][4], a[9][8] + a[8][4]));
8 < n && 9 < n && 5 < n && (a[9][5] = min(a[9][5], a[9][8] + a[8][5]));
8 < n && 9 < n && 6 < n && (a[9][6] = min(a[9][6], a[9][8] + a[8][6]));
8 < n && 9 < n && 7 < n && (a[9][7] = min(a[9][7], a[9][8] + a[8][7]));
8 < n && 9 < n && 8 < n && (a[9][8] = min(a[9][8], a[9][8] + a[8][8]));
8 < n && 9 < n && 9 < n && (a[9][9] = min(a[9][9], a[9][8] + a[8][9]));
9 < n && 0 < n && 0 < n && (a[0][0] = min(a[0][0], a[0][9] + a[9][0]));
9 < n && 0 < n && 1 < n && (a[0][1] = min(a[0][1], a[0][9] + a[9][1]));
9 < n && 0 < n && 2 < n && (a[0][2] = min(a[0][2], a[0][9] + a[9][2]));
9 < n && 0 < n && 3 < n && (a[0][3] = min(a[0][3], a[0][9] + a[9][3]));
9 < n && 0 < n && 4 < n && (a[0][4] = min(a[0][4], a[0][9] + a[9][4]));
9 < n && 0 < n && 5 < n && (a[0][5] = min(a[0][5], a[0][9] + a[9][5]));
9 < n && 0 < n && 6 < n && (a[0][6] = min(a[0][6], a[0][9] + a[9][6]));
9 < n && 0 < n && 7 < n && (a[0][7] = min(a[0][7], a[0][9] + a[9][7]));
9 < n && 0 < n && 8 < n && (a[0][8] = min(a[0][8], a[0][9] + a[9][8]));
9 < n && 0 < n && 9 < n && (a[0][9] = min(a[0][9], a[0][9] + a[9][9]));
9 < n && 1 < n && 0 < n && (a[1][0] = min(a[1][0], a[1][9] + a[9][0]));
9 < n && 1 < n && 1 < n && (a[1][1] = min(a[1][1], a[1][9] + a[9][1]));
9 < n && 1 < n && 2 < n && (a[1][2] = min(a[1][2], a[1][9] + a[9][2]));
9 < n && 1 < n && 3 < n && (a[1][3] = min(a[1][3], a[1][9] + a[9][3]));
9 < n && 1 < n && 4 < n && (a[1][4] = min(a[1][4], a[1][9] + a[9][4]));
9 < n && 1 < n && 5 < n && (a[1][5] = min(a[1][5], a[1][9] + a[9][5]));
9 < n && 1 < n && 6 < n && (a[1][6] = min(a[1][6], a[1][9] + a[9][6]));
9 < n && 1 < n && 7 < n && (a[1][7] = min(a[1][7], a[1][9] + a[9][7]));
9 < n && 1 < n && 8 < n && (a[1][8] = min(a[1][8], a[1][9] + a[9][8]));
9 < n && 1 < n && 9 < n && (a[1][9] = min(a[1][9], a[1][9] + a[9][9]));
9 < n && 2 < n && 0 < n && (a[2][0] = min(a[2][0], a[2][9] + a[9][0]));
9 < n && 2 < n && 1 < n && (a[2][1] = min(a[2][1], a[2][9] + a[9][1]));
9 < n && 2 < n && 2 < n && (a[2][2] = min(a[2][2], a[2][9] + a[9][2]));
9 < n && 2 < n && 3 < n && (a[2][3] = min(a[2][3], a[2][9] + a[9][3]));
9 < n && 2 < n && 4 < n && (a[2][4] = min(a[2][4], a[2][9] + a[9][4]));
9 < n && 2 < n && 5 < n && (a[2][5] = min(a[2][5], a[2][9] + a[9][5]));
9 < n && 2 < n && 6 < n && (a[2][6] = min(a[2][6], a[2][9] + a[9][6]));
9 < n && 2 < n && 7 < n && (a[2][7] = min(a[2][7], a[2][9] + a[9][7]));
9 < n && 2 < n && 8 < n && (a[2][8] = min(a[2][8], a[2][9] + a[9][8]));
9 < n && 2 < n && 9 < n && (a[2][9] = min(a[2][9], a[2][9] + a[9][9]));
9 < n && 3 < n && 0 < n && (a[3][0] = min(a[3][0], a[3][9] + a[9][0]));
9 < n && 3 < n && 1 < n && (a[3][1] = min(a[3][1], a[3][9] + a[9][1]));
9 < n && 3 < n && 2 < n && (a[3][2] = min(a[3][2], a[3][9] + a[9][2]));
9 < n && 3 < n && 3 < n && (a[3][3] = min(a[3][3], a[3][9] + a[9][3]));
9 < n && 3 < n && 4 < n && (a[3][4] = min(a[3][4], a[3][9] + a[9][4]));
9 < n && 3 < n && 5 < n && (a[3][5] = min(a[3][5], a[3][9] + a[9][5]));
9 < n && 3 < n && 6 < n && (a[3][6] = min(a[3][6], a[3][9] + a[9][6]));
9 < n && 3 < n && 7 < n && (a[3][7] = min(a[3][7], a[3][9] + a[9][7]));
9 < n && 3 < n && 8 < n && (a[3][8] = min(a[3][8], a[3][9] + a[9][8]));
9 < n && 3 < n && 9 < n && (a[3][9] = min(a[3][9], a[3][9] + a[9][9]));
9 < n && 4 < n && 0 < n && (a[4][0] = min(a[4][0], a[4][9] + a[9][0]));
9 < n && 4 < n && 1 < n && (a[4][1] = min(a[4][1], a[4][9] + a[9][1]));
9 < n && 4 < n && 2 < n && (a[4][2] = min(a[4][2], a[4][9] + a[9][2]));
9 < n && 4 < n && 3 < n && (a[4][3] = min(a[4][3], a[4][9] + a[9][3]));
9 < n && 4 < n && 4 < n && (a[4][4] = min(a[4][4], a[4][9] + a[9][4]));
9 < n && 4 < n && 5 < n && (a[4][5] = min(a[4][5], a[4][9] + a[9][5]));
9 < n && 4 < n && 6 < n && (a[4][6] = min(a[4][6], a[4][9] + a[9][6]));
9 < n && 4 < n && 7 < n && (a[4][7] = min(a[4][7], a[4][9] + a[9][7]));
9 < n && 4 < n && 8 < n && (a[4][8] = min(a[4][8], a[4][9] + a[9][8]));
9 < n && 4 < n && 9 < n && (a[4][9] = min(a[4][9], a[4][9] + a[9][9]));
9 < n && 5 < n && 0 < n && (a[5][0] = min(a[5][0], a[5][9] + a[9][0]));
9 < n && 5 < n && 1 < n && (a[5][1] = min(a[5][1], a[5][9] + a[9][1]));
9 < n && 5 < n && 2 < n && (a[5][2] = min(a[5][2], a[5][9] + a[9][2]));
9 < n && 5 < n && 3 < n && (a[5][3] = min(a[5][3], a[5][9] + a[9][3]));
9 < n && 5 < n && 4 < n && (a[5][4] = min(a[5][4], a[5][9] + a[9][4]));
9 < n && 5 < n && 5 < n && (a[5][5] = min(a[5][5], a[5][9] + a[9][5]));
9 < n && 5 < n && 6 < n && (a[5][6] = min(a[5][6], a[5][9] + a[9][6]));
9 < n && 5 < n && 7 < n && (a[5][7] = min(a[5][7], a[5][9] + a[9][7]));
9 < n && 5 < n && 8 < n && (a[5][8] = min(a[5][8], a[5][9] + a[9][8]));
9 < n && 5 < n && 9 < n && (a[5][9] = min(a[5][9], a[5][9] + a[9][9]));
9 < n && 6 < n && 0 < n && (a[6][0] = min(a[6][0], a[6][9] + a[9][0]));
9 < n && 6 < n && 1 < n && (a[6][1] = min(a[6][1], a[6][9] + a[9][1]));
9 < n && 6 < n && 2 < n && (a[6][2] = min(a[6][2], a[6][9] + a[9][2]));
9 < n && 6 < n && 3 < n && (a[6][3] = min(a[6][3], a[6][9] + a[9][3]));
9 < n && 6 < n && 4 < n && (a[6][4] = min(a[6][4], a[6][9] + a[9][4]));
9 < n && 6 < n && 5 < n && (a[6][5] = min(a[6][5], a[6][9] + a[9][5]));
9 < n && 6 < n && 6 < n && (a[6][6] = min(a[6][6], a[6][9] + a[9][6]));
9 < n && 6 < n && 7 < n && (a[6][7] = min(a[6][7], a[6][9] + a[9][7]));
9 < n && 6 < n && 8 < n && (a[6][8] = min(a[6][8], a[6][9] + a[9][8]));
9 < n && 6 < n && 9 < n && (a[6][9] = min(a[6][9], a[6][9] + a[9][9]));
9 < n && 7 < n && 0 < n && (a[7][0] = min(a[7][0], a[7][9] + a[9][0]));
9 < n && 7 < n && 1 < n && (a[7][1] = min(a[7][1], a[7][9] + a[9][1]));
9 < n && 7 < n && 2 < n && (a[7][2] = min(a[7][2], a[7][9] + a[9][2]));
9 < n && 7 < n && 3 < n && (a[7][3] = min(a[7][3], a[7][9] + a[9][3]));
9 < n && 7 < n && 4 < n && (a[7][4] = min(a[7][4], a[7][9] + a[9][4]));
9 < n && 7 < n && 5 < n && (a[7][5] = min(a[7][5], a[7][9] + a[9][5]));
9 < n && 7 < n && 6 < n && (a[7][6] = min(a[7][6], a[7][9] + a[9][6]));
9 < n && 7 < n && 7 < n && (a[7][7] = min(a[7][7], a[7][9] + a[9][7]));
9 < n && 7 < n && 8 < n && (a[7][8] = min(a[7][8], a[7][9] + a[9][8]));
9 < n && 7 < n && 9 < n && (a[7][9] = min(a[7][9], a[7][9] + a[9][9]));
9 < n && 8 < n && 0 < n && (a[8][0] = min(a[8][0], a[8][9] + a[9][0]));
9 < n && 8 < n && 1 < n && (a[8][1] = min(a[8][1], a[8][9] + a[9][1]));
9 < n && 8 < n && 2 < n && (a[8][2] = min(a[8][2], a[8][9] + a[9][2]));
9 < n && 8 < n && 3 < n && (a[8][3] = min(a[8][3], a[8][9] + a[9][3]));
9 < n && 8 < n && 4 < n && (a[8][4] = min(a[8][4], a[8][9] + a[9][4]));
9 < n && 8 < n && 5 < n && (a[8][5] = min(a[8][5], a[8][9] + a[9][5]));
9 < n && 8 < n && 6 < n && (a[8][6] = min(a[8][6], a[8][9] + a[9][6]));
9 < n && 8 < n && 7 < n && (a[8][7] = min(a[8][7], a[8][9] + a[9][7]));
9 < n && 8 < n && 8 < n && (a[8][8] = min(a[8][8], a[8][9] + a[9][8]));
9 < n && 8 < n && 9 < n && (a[8][9] = min(a[8][9], a[8][9] + a[9][9]));
9 < n && 9 < n && 0 < n && (a[9][0] = min(a[9][0], a[9][9] + a[9][0]));
9 < n && 9 < n && 1 < n && (a[9][1] = min(a[9][1], a[9][9] + a[9][1]));
9 < n && 9 < n && 2 < n && (a[9][2] = min(a[9][2], a[9][9] + a[9][2]));
9 < n && 9 < n && 3 < n && (a[9][3] = min(a[9][3], a[9][9] + a[9][3]));
9 < n && 9 < n && 4 < n && (a[9][4] = min(a[9][4], a[9][9] + a[9][4]));
9 < n && 9 < n && 5 < n && (a[9][5] = min(a[9][5], a[9][9] + a[9][5]));
9 < n && 9 < n && 6 < n && (a[9][6] = min(a[9][6], a[9][9] + a[9][6]));
9 < n && 9 < n && 7 < n && (a[9][7] = min(a[9][7], a[9][9] + a[9][7]));
9 < n && 9 < n && 8 < n && (a[9][8] = min(a[9][8], a[9][9] + a[9][8]));
9 < n && 9 < n && 9 < n && (a[9][9] = min(a[9][9], a[9][9] + a[9][9]));
0 < n&& rek(0, 0, 0);
1 < n&& rek(1, 1, 0);
2 < n&& rek(2, 2, 0);
3 < n&& rek(3, 3, 0);
4 < n&& rek(4, 4, 0);
5 < n&& rek(5, 5, 0);
6 < n&& rek(6, 6, 0);
7 < n&& rek(7, 7, 0);
8 < n&& rek(8, 8, 0);
9 < n&& rek(9, 9, 0);
cout << r << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
int A[101][101];
void hoge(int y, int x) { cin >> A[y][x]; }
int loop(int y, int x) {
hoge(y, x);
return (x < N - 1) ? loop(y, x + 1) : (y < N - 1) ? loop(y + 1, 0) : 0;
}
int loop2(int y, int x) {
int r = (x < N - 1) ? loop2(y, x + 1) : (y < N - 2) ? loop2(y + 1, y + 2) : 0;
return max(r, A[y][x]);
}
int dfs(int z, int x, int y) {
A[x][y] = min(A[x][y], A[x][z] + A[z][y]);
return (y < N - 1) ? dfs(z, x, y + 1)
: (x < N - 1) ? dfs(z, x + 1, 0)
: (z < N - 1) ? dfs(z + 1, 0, 0)
: 0;
}
int main(int argc, char** argv) {
cin >> N;
loop(0, 0);
dfs(0, 0, 0);
cout << loop2(0, 1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, j, k, ans, n, a[15][15];
int main() {
cin >> n;
ans = 0;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) cin >> a[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) a[i][j] = min(a[i][k] + a[k][j], a[i][j]);
for (i = 1; i <= n; i++)
for (j = i + 1; j <= n; j++) ans = max(ans, a[i][j]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int grid[10][10];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> grid[i][j];
}
}
for (int k = 0; k < n; ++k) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
grid[i][j] = min(grid[i][j], grid[i][k] + grid[k][j]);
}
}
}
int ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
ans = max(ans, grid[i][j]);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const unsigned char N = (unsigned char)10;
unsigned char n;
int x;
unsigned char mat[N][N];
inline unsigned char smin(const unsigned char& a, const unsigned char& b) {
return a < b ? a : b;
}
inline unsigned char smax(const unsigned char& a, const unsigned char& b) {
return a > b ? a : b;
}
inline unsigned char FOR3(const unsigned char& k, const unsigned char& i,
const unsigned char& j) {
mat[i][j] = smin(mat[i][j], mat[i][k] + mat[k][j]);
return j + 1 < n ? FOR3(k, i, j + 1) : 0;
}
inline unsigned char FOR2(const unsigned char& i, const unsigned char& j) {
FOR3(i, j, 0);
return j + 1 < n ? FOR2(i, j + 1) : 0;
}
inline unsigned char FOR1(const unsigned char& i) {
FOR2(i, 0);
return i + 1 < n ? FOR1(i + 1) : 0;
}
inline unsigned char FOR_INPUT2(const unsigned char& i,
const unsigned char& j) {
scanf("%d", &x);
mat[i][j] = x;
return j + 1 < n ? FOR_INPUT2(i, j + 1) : 0;
}
inline unsigned char FOR_INPUT1(const unsigned char& i) {
FOR_INPUT2(i, 0);
return i + 1 < n ? FOR_INPUT1(i + 1) : 0;
}
inline unsigned char BILLY2(const unsigned char& i, const unsigned char& j) {
return smax(mat[i][j], j + 1 < n ? BILLY2(i, j + 1) : 0);
}
inline unsigned char BILLY1(const unsigned char& i) {
unsigned char ans = BILLY2(i, 0);
unsigned char other = i + 1 < n ? BILLY1(i + 1) : 0;
return smax(ans, other);
}
inline void solve() {
scanf("%d", &x);
n = x;
FOR_INPUT1(0);
FOR1(0);
cout << (short)BILLY1(0) << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, f[15][15], ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) scanf("%d", &f[i][j]);
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) ans = max(ans, f[i][j]);
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 15;
int d[maxn][maxn];
int n;
bool h(int i, int j, int k);
bool g(int i, int j);
bool f(int i) {
g(i, 0);
return i == n - 1 ? false : f(i + 1);
}
bool g(int i, int j) {
h(i, j, 0);
return j == n - 1 ? false : g(i, j + 1);
}
bool h(int i, int j, int k) {
d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
return k == n - 1 ? false : h(i, j, k + 1);
}
bool u(int i);
bool v(int i, int j);
int ans;
bool u(int i) {
v(i, 0);
return i == n - 1 ? false : u(i + 1);
}
bool v(int i, int j) {
ans = max(ans, d[i][j]);
return j == n - 1 ? false : v(i, j + 1);
}
bool y(int i, int j);
bool x(int i) {
y(i, 0);
return i == n - 1 ? false : x(i + 1);
}
bool y(int i, int j) {
cin >> d[i][j];
return j == n - 1 ? false : y(i, j + 1);
}
int main() {
srand(time(NULL));
cin >> n;
x(0);
f(0);
u(0);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, i, j, k, ans = 0, INF = 1E9;
cin >> n;
vector<vector<int>> d(11, vector<int>(11, INF));
if ((0 < n) && (0 < n)) cin >> d[0][0];
if ((0 < n) && (1 < n)) cin >> d[0][1];
if ((0 < n) && (2 < n)) cin >> d[0][2];
if ((0 < n) && (3 < n)) cin >> d[0][3];
if ((0 < n) && (4 < n)) cin >> d[0][4];
if ((0 < n) && (5 < n)) cin >> d[0][5];
if ((0 < n) && (6 < n)) cin >> d[0][6];
if ((0 < n) && (7 < n)) cin >> d[0][7];
if ((0 < n) && (8 < n)) cin >> d[0][8];
if ((0 < n) && (9 < n)) cin >> d[0][9];
if ((1 < n) && (0 < n)) cin >> d[1][0];
if ((1 < n) && (1 < n)) cin >> d[1][1];
if ((1 < n) && (2 < n)) cin >> d[1][2];
if ((1 < n) && (3 < n)) cin >> d[1][3];
if ((1 < n) && (4 < n)) cin >> d[1][4];
if ((1 < n) && (5 < n)) cin >> d[1][5];
if ((1 < n) && (6 < n)) cin >> d[1][6];
if ((1 < n) && (7 < n)) cin >> d[1][7];
if ((1 < n) && (8 < n)) cin >> d[1][8];
if ((1 < n) && (9 < n)) cin >> d[1][9];
if ((2 < n) && (0 < n)) cin >> d[2][0];
if ((2 < n) && (1 < n)) cin >> d[2][1];
if ((2 < n) && (2 < n)) cin >> d[2][2];
if ((2 < n) && (3 < n)) cin >> d[2][3];
if ((2 < n) && (4 < n)) cin >> d[2][4];
if ((2 < n) && (5 < n)) cin >> d[2][5];
if ((2 < n) && (6 < n)) cin >> d[2][6];
if ((2 < n) && (7 < n)) cin >> d[2][7];
if ((2 < n) && (8 < n)) cin >> d[2][8];
if ((2 < n) && (9 < n)) cin >> d[2][9];
if ((3 < n) && (0 < n)) cin >> d[3][0];
if ((3 < n) && (1 < n)) cin >> d[3][1];
if ((3 < n) && (2 < n)) cin >> d[3][2];
if ((3 < n) && (3 < n)) cin >> d[3][3];
if ((3 < n) && (4 < n)) cin >> d[3][4];
if ((3 < n) && (5 < n)) cin >> d[3][5];
if ((3 < n) && (6 < n)) cin >> d[3][6];
if ((3 < n) && (7 < n)) cin >> d[3][7];
if ((3 < n) && (8 < n)) cin >> d[3][8];
if ((3 < n) && (9 < n)) cin >> d[3][9];
if ((4 < n) && (0 < n)) cin >> d[4][0];
if ((4 < n) && (1 < n)) cin >> d[4][1];
if ((4 < n) && (2 < n)) cin >> d[4][2];
if ((4 < n) && (3 < n)) cin >> d[4][3];
if ((4 < n) && (4 < n)) cin >> d[4][4];
if ((4 < n) && (5 < n)) cin >> d[4][5];
if ((4 < n) && (6 < n)) cin >> d[4][6];
if ((4 < n) && (7 < n)) cin >> d[4][7];
if ((4 < n) && (8 < n)) cin >> d[4][8];
if ((4 < n) && (9 < n)) cin >> d[4][9];
if ((5 < n) && (0 < n)) cin >> d[5][0];
if ((5 < n) && (1 < n)) cin >> d[5][1];
if ((5 < n) && (2 < n)) cin >> d[5][2];
if ((5 < n) && (3 < n)) cin >> d[5][3];
if ((5 < n) && (4 < n)) cin >> d[5][4];
if ((5 < n) && (5 < n)) cin >> d[5][5];
if ((5 < n) && (6 < n)) cin >> d[5][6];
if ((5 < n) && (7 < n)) cin >> d[5][7];
if ((5 < n) && (8 < n)) cin >> d[5][8];
if ((5 < n) && (9 < n)) cin >> d[5][9];
if ((6 < n) && (0 < n)) cin >> d[6][0];
if ((6 < n) && (1 < n)) cin >> d[6][1];
if ((6 < n) && (2 < n)) cin >> d[6][2];
if ((6 < n) && (3 < n)) cin >> d[6][3];
if ((6 < n) && (4 < n)) cin >> d[6][4];
if ((6 < n) && (5 < n)) cin >> d[6][5];
if ((6 < n) && (6 < n)) cin >> d[6][6];
if ((6 < n) && (7 < n)) cin >> d[6][7];
if ((6 < n) && (8 < n)) cin >> d[6][8];
if ((6 < n) && (9 < n)) cin >> d[6][9];
if ((7 < n) && (0 < n)) cin >> d[7][0];
if ((7 < n) && (1 < n)) cin >> d[7][1];
if ((7 < n) && (2 < n)) cin >> d[7][2];
if ((7 < n) && (3 < n)) cin >> d[7][3];
if ((7 < n) && (4 < n)) cin >> d[7][4];
if ((7 < n) && (5 < n)) cin >> d[7][5];
if ((7 < n) && (6 < n)) cin >> d[7][6];
if ((7 < n) && (7 < n)) cin >> d[7][7];
if ((7 < n) && (8 < n)) cin >> d[7][8];
if ((7 < n) && (9 < n)) cin >> d[7][9];
if ((8 < n) && (0 < n)) cin >> d[8][0];
if ((8 < n) && (1 < n)) cin >> d[8][1];
if ((8 < n) && (2 < n)) cin >> d[8][2];
if ((8 < n) && (3 < n)) cin >> d[8][3];
if ((8 < n) && (4 < n)) cin >> d[8][4];
if ((8 < n) && (5 < n)) cin >> d[8][5];
if ((8 < n) && (6 < n)) cin >> d[8][6];
if ((8 < n) && (7 < n)) cin >> d[8][7];
if ((8 < n) && (8 < n)) cin >> d[8][8];
if ((8 < n) && (9 < n)) cin >> d[8][9];
if ((9 < n) && (0 < n)) cin >> d[9][0];
if ((9 < n) && (1 < n)) cin >> d[9][1];
if ((9 < n) && (2 < n)) cin >> d[9][2];
if ((9 < n) && (3 < n)) cin >> d[9][3];
if ((9 < n) && (4 < n)) cin >> d[9][4];
if ((9 < n) && (5 < n)) cin >> d[9][5];
if ((9 < n) && (6 < n)) cin >> d[9][6];
if ((9 < n) && (7 < n)) cin >> d[9][7];
if ((9 < n) && (8 < n)) cin >> d[9][8];
if ((9 < n) && (9 < n)) cin >> d[9][9];
d[0][0] = min(d[0][0], d[0][0] + d[0][0]);
d[0][1] = min(d[0][1], d[0][0] + d[0][1]);
d[0][2] = min(d[0][2], d[0][0] + d[0][2]);
d[0][3] = min(d[0][3], d[0][0] + d[0][3]);
d[0][4] = min(d[0][4], d[0][0] + d[0][4]);
d[0][5] = min(d[0][5], d[0][0] + d[0][5]);
d[0][6] = min(d[0][6], d[0][0] + d[0][6]);
d[0][7] = min(d[0][7], d[0][0] + d[0][7]);
d[0][8] = min(d[0][8], d[0][0] + d[0][8]);
d[0][9] = min(d[0][9], d[0][0] + d[0][9]);
d[1][0] = min(d[1][0], d[1][0] + d[0][0]);
d[1][1] = min(d[1][1], d[1][0] + d[0][1]);
d[1][2] = min(d[1][2], d[1][0] + d[0][2]);
d[1][3] = min(d[1][3], d[1][0] + d[0][3]);
d[1][4] = min(d[1][4], d[1][0] + d[0][4]);
d[1][5] = min(d[1][5], d[1][0] + d[0][5]);
d[1][6] = min(d[1][6], d[1][0] + d[0][6]);
d[1][7] = min(d[1][7], d[1][0] + d[0][7]);
d[1][8] = min(d[1][8], d[1][0] + d[0][8]);
d[1][9] = min(d[1][9], d[1][0] + d[0][9]);
d[2][0] = min(d[2][0], d[2][0] + d[0][0]);
d[2][1] = min(d[2][1], d[2][0] + d[0][1]);
d[2][2] = min(d[2][2], d[2][0] + d[0][2]);
d[2][3] = min(d[2][3], d[2][0] + d[0][3]);
d[2][4] = min(d[2][4], d[2][0] + d[0][4]);
d[2][5] = min(d[2][5], d[2][0] + d[0][5]);
d[2][6] = min(d[2][6], d[2][0] + d[0][6]);
d[2][7] = min(d[2][7], d[2][0] + d[0][7]);
d[2][8] = min(d[2][8], d[2][0] + d[0][8]);
d[2][9] = min(d[2][9], d[2][0] + d[0][9]);
d[3][0] = min(d[3][0], d[3][0] + d[0][0]);
d[3][1] = min(d[3][1], d[3][0] + d[0][1]);
d[3][2] = min(d[3][2], d[3][0] + d[0][2]);
d[3][3] = min(d[3][3], d[3][0] + d[0][3]);
d[3][4] = min(d[3][4], d[3][0] + d[0][4]);
d[3][5] = min(d[3][5], d[3][0] + d[0][5]);
d[3][6] = min(d[3][6], d[3][0] + d[0][6]);
d[3][7] = min(d[3][7], d[3][0] + d[0][7]);
d[3][8] = min(d[3][8], d[3][0] + d[0][8]);
d[3][9] = min(d[3][9], d[3][0] + d[0][9]);
d[4][0] = min(d[4][0], d[4][0] + d[0][0]);
d[4][1] = min(d[4][1], d[4][0] + d[0][1]);
d[4][2] = min(d[4][2], d[4][0] + d[0][2]);
d[4][3] = min(d[4][3], d[4][0] + d[0][3]);
d[4][4] = min(d[4][4], d[4][0] + d[0][4]);
d[4][5] = min(d[4][5], d[4][0] + d[0][5]);
d[4][6] = min(d[4][6], d[4][0] + d[0][6]);
d[4][7] = min(d[4][7], d[4][0] + d[0][7]);
d[4][8] = min(d[4][8], d[4][0] + d[0][8]);
d[4][9] = min(d[4][9], d[4][0] + d[0][9]);
d[5][0] = min(d[5][0], d[5][0] + d[0][0]);
d[5][1] = min(d[5][1], d[5][0] + d[0][1]);
d[5][2] = min(d[5][2], d[5][0] + d[0][2]);
d[5][3] = min(d[5][3], d[5][0] + d[0][3]);
d[5][4] = min(d[5][4], d[5][0] + d[0][4]);
d[5][5] = min(d[5][5], d[5][0] + d[0][5]);
d[5][6] = min(d[5][6], d[5][0] + d[0][6]);
d[5][7] = min(d[5][7], d[5][0] + d[0][7]);
d[5][8] = min(d[5][8], d[5][0] + d[0][8]);
d[5][9] = min(d[5][9], d[5][0] + d[0][9]);
d[6][0] = min(d[6][0], d[6][0] + d[0][0]);
d[6][1] = min(d[6][1], d[6][0] + d[0][1]);
d[6][2] = min(d[6][2], d[6][0] + d[0][2]);
d[6][3] = min(d[6][3], d[6][0] + d[0][3]);
d[6][4] = min(d[6][4], d[6][0] + d[0][4]);
d[6][5] = min(d[6][5], d[6][0] + d[0][5]);
d[6][6] = min(d[6][6], d[6][0] + d[0][6]);
d[6][7] = min(d[6][7], d[6][0] + d[0][7]);
d[6][8] = min(d[6][8], d[6][0] + d[0][8]);
d[6][9] = min(d[6][9], d[6][0] + d[0][9]);
d[7][0] = min(d[7][0], d[7][0] + d[0][0]);
d[7][1] = min(d[7][1], d[7][0] + d[0][1]);
d[7][2] = min(d[7][2], d[7][0] + d[0][2]);
d[7][3] = min(d[7][3], d[7][0] + d[0][3]);
d[7][4] = min(d[7][4], d[7][0] + d[0][4]);
d[7][5] = min(d[7][5], d[7][0] + d[0][5]);
d[7][6] = min(d[7][6], d[7][0] + d[0][6]);
d[7][7] = min(d[7][7], d[7][0] + d[0][7]);
d[7][8] = min(d[7][8], d[7][0] + d[0][8]);
d[7][9] = min(d[7][9], d[7][0] + d[0][9]);
d[8][0] = min(d[8][0], d[8][0] + d[0][0]);
d[8][1] = min(d[8][1], d[8][0] + d[0][1]);
d[8][2] = min(d[8][2], d[8][0] + d[0][2]);
d[8][3] = min(d[8][3], d[8][0] + d[0][3]);
d[8][4] = min(d[8][4], d[8][0] + d[0][4]);
d[8][5] = min(d[8][5], d[8][0] + d[0][5]);
d[8][6] = min(d[8][6], d[8][0] + d[0][6]);
d[8][7] = min(d[8][7], d[8][0] + d[0][7]);
d[8][8] = min(d[8][8], d[8][0] + d[0][8]);
d[8][9] = min(d[8][9], d[8][0] + d[0][9]);
d[9][0] = min(d[9][0], d[9][0] + d[0][0]);
d[9][1] = min(d[9][1], d[9][0] + d[0][1]);
d[9][2] = min(d[9][2], d[9][0] + d[0][2]);
d[9][3] = min(d[9][3], d[9][0] + d[0][3]);
d[9][4] = min(d[9][4], d[9][0] + d[0][4]);
d[9][5] = min(d[9][5], d[9][0] + d[0][5]);
d[9][6] = min(d[9][6], d[9][0] + d[0][6]);
d[9][7] = min(d[9][7], d[9][0] + d[0][7]);
d[9][8] = min(d[9][8], d[9][0] + d[0][8]);
d[9][9] = min(d[9][9], d[9][0] + d[0][9]);
d[0][0] = min(d[0][0], d[0][1] + d[1][0]);
d[0][1] = min(d[0][1], d[0][1] + d[1][1]);
d[0][2] = min(d[0][2], d[0][1] + d[1][2]);
d[0][3] = min(d[0][3], d[0][1] + d[1][3]);
d[0][4] = min(d[0][4], d[0][1] + d[1][4]);
d[0][5] = min(d[0][5], d[0][1] + d[1][5]);
d[0][6] = min(d[0][6], d[0][1] + d[1][6]);
d[0][7] = min(d[0][7], d[0][1] + d[1][7]);
d[0][8] = min(d[0][8], d[0][1] + d[1][8]);
d[0][9] = min(d[0][9], d[0][1] + d[1][9]);
d[1][0] = min(d[1][0], d[1][1] + d[1][0]);
d[1][1] = min(d[1][1], d[1][1] + d[1][1]);
d[1][2] = min(d[1][2], d[1][1] + d[1][2]);
d[1][3] = min(d[1][3], d[1][1] + d[1][3]);
d[1][4] = min(d[1][4], d[1][1] + d[1][4]);
d[1][5] = min(d[1][5], d[1][1] + d[1][5]);
d[1][6] = min(d[1][6], d[1][1] + d[1][6]);
d[1][7] = min(d[1][7], d[1][1] + d[1][7]);
d[1][8] = min(d[1][8], d[1][1] + d[1][8]);
d[1][9] = min(d[1][9], d[1][1] + d[1][9]);
d[2][0] = min(d[2][0], d[2][1] + d[1][0]);
d[2][1] = min(d[2][1], d[2][1] + d[1][1]);
d[2][2] = min(d[2][2], d[2][1] + d[1][2]);
d[2][3] = min(d[2][3], d[2][1] + d[1][3]);
d[2][4] = min(d[2][4], d[2][1] + d[1][4]);
d[2][5] = min(d[2][5], d[2][1] + d[1][5]);
d[2][6] = min(d[2][6], d[2][1] + d[1][6]);
d[2][7] = min(d[2][7], d[2][1] + d[1][7]);
d[2][8] = min(d[2][8], d[2][1] + d[1][8]);
d[2][9] = min(d[2][9], d[2][1] + d[1][9]);
d[3][0] = min(d[3][0], d[3][1] + d[1][0]);
d[3][1] = min(d[3][1], d[3][1] + d[1][1]);
d[3][2] = min(d[3][2], d[3][1] + d[1][2]);
d[3][3] = min(d[3][3], d[3][1] + d[1][3]);
d[3][4] = min(d[3][4], d[3][1] + d[1][4]);
d[3][5] = min(d[3][5], d[3][1] + d[1][5]);
d[3][6] = min(d[3][6], d[3][1] + d[1][6]);
d[3][7] = min(d[3][7], d[3][1] + d[1][7]);
d[3][8] = min(d[3][8], d[3][1] + d[1][8]);
d[3][9] = min(d[3][9], d[3][1] + d[1][9]);
d[4][0] = min(d[4][0], d[4][1] + d[1][0]);
d[4][1] = min(d[4][1], d[4][1] + d[1][1]);
d[4][2] = min(d[4][2], d[4][1] + d[1][2]);
d[4][3] = min(d[4][3], d[4][1] + d[1][3]);
d[4][4] = min(d[4][4], d[4][1] + d[1][4]);
d[4][5] = min(d[4][5], d[4][1] + d[1][5]);
d[4][6] = min(d[4][6], d[4][1] + d[1][6]);
d[4][7] = min(d[4][7], d[4][1] + d[1][7]);
d[4][8] = min(d[4][8], d[4][1] + d[1][8]);
d[4][9] = min(d[4][9], d[4][1] + d[1][9]);
d[5][0] = min(d[5][0], d[5][1] + d[1][0]);
d[5][1] = min(d[5][1], d[5][1] + d[1][1]);
d[5][2] = min(d[5][2], d[5][1] + d[1][2]);
d[5][3] = min(d[5][3], d[5][1] + d[1][3]);
d[5][4] = min(d[5][4], d[5][1] + d[1][4]);
d[5][5] = min(d[5][5], d[5][1] + d[1][5]);
d[5][6] = min(d[5][6], d[5][1] + d[1][6]);
d[5][7] = min(d[5][7], d[5][1] + d[1][7]);
d[5][8] = min(d[5][8], d[5][1] + d[1][8]);
d[5][9] = min(d[5][9], d[5][1] + d[1][9]);
d[6][0] = min(d[6][0], d[6][1] + d[1][0]);
d[6][1] = min(d[6][1], d[6][1] + d[1][1]);
d[6][2] = min(d[6][2], d[6][1] + d[1][2]);
d[6][3] = min(d[6][3], d[6][1] + d[1][3]);
d[6][4] = min(d[6][4], d[6][1] + d[1][4]);
d[6][5] = min(d[6][5], d[6][1] + d[1][5]);
d[6][6] = min(d[6][6], d[6][1] + d[1][6]);
d[6][7] = min(d[6][7], d[6][1] + d[1][7]);
d[6][8] = min(d[6][8], d[6][1] + d[1][8]);
d[6][9] = min(d[6][9], d[6][1] + d[1][9]);
d[7][0] = min(d[7][0], d[7][1] + d[1][0]);
d[7][1] = min(d[7][1], d[7][1] + d[1][1]);
d[7][2] = min(d[7][2], d[7][1] + d[1][2]);
d[7][3] = min(d[7][3], d[7][1] + d[1][3]);
d[7][4] = min(d[7][4], d[7][1] + d[1][4]);
d[7][5] = min(d[7][5], d[7][1] + d[1][5]);
d[7][6] = min(d[7][6], d[7][1] + d[1][6]);
d[7][7] = min(d[7][7], d[7][1] + d[1][7]);
d[7][8] = min(d[7][8], d[7][1] + d[1][8]);
d[7][9] = min(d[7][9], d[7][1] + d[1][9]);
d[8][0] = min(d[8][0], d[8][1] + d[1][0]);
d[8][1] = min(d[8][1], d[8][1] + d[1][1]);
d[8][2] = min(d[8][2], d[8][1] + d[1][2]);
d[8][3] = min(d[8][3], d[8][1] + d[1][3]);
d[8][4] = min(d[8][4], d[8][1] + d[1][4]);
d[8][5] = min(d[8][5], d[8][1] + d[1][5]);
d[8][6] = min(d[8][6], d[8][1] + d[1][6]);
d[8][7] = min(d[8][7], d[8][1] + d[1][7]);
d[8][8] = min(d[8][8], d[8][1] + d[1][8]);
d[8][9] = min(d[8][9], d[8][1] + d[1][9]);
d[9][0] = min(d[9][0], d[9][1] + d[1][0]);
d[9][1] = min(d[9][1], d[9][1] + d[1][1]);
d[9][2] = min(d[9][2], d[9][1] + d[1][2]);
d[9][3] = min(d[9][3], d[9][1] + d[1][3]);
d[9][4] = min(d[9][4], d[9][1] + d[1][4]);
d[9][5] = min(d[9][5], d[9][1] + d[1][5]);
d[9][6] = min(d[9][6], d[9][1] + d[1][6]);
d[9][7] = min(d[9][7], d[9][1] + d[1][7]);
d[9][8] = min(d[9][8], d[9][1] + d[1][8]);
d[9][9] = min(d[9][9], d[9][1] + d[1][9]);
d[0][0] = min(d[0][0], d[0][2] + d[2][0]);
d[0][1] = min(d[0][1], d[0][2] + d[2][1]);
d[0][2] = min(d[0][2], d[0][2] + d[2][2]);
d[0][3] = min(d[0][3], d[0][2] + d[2][3]);
d[0][4] = min(d[0][4], d[0][2] + d[2][4]);
d[0][5] = min(d[0][5], d[0][2] + d[2][5]);
d[0][6] = min(d[0][6], d[0][2] + d[2][6]);
d[0][7] = min(d[0][7], d[0][2] + d[2][7]);
d[0][8] = min(d[0][8], d[0][2] + d[2][8]);
d[0][9] = min(d[0][9], d[0][2] + d[2][9]);
d[1][0] = min(d[1][0], d[1][2] + d[2][0]);
d[1][1] = min(d[1][1], d[1][2] + d[2][1]);
d[1][2] = min(d[1][2], d[1][2] + d[2][2]);
d[1][3] = min(d[1][3], d[1][2] + d[2][3]);
d[1][4] = min(d[1][4], d[1][2] + d[2][4]);
d[1][5] = min(d[1][5], d[1][2] + d[2][5]);
d[1][6] = min(d[1][6], d[1][2] + d[2][6]);
d[1][7] = min(d[1][7], d[1][2] + d[2][7]);
d[1][8] = min(d[1][8], d[1][2] + d[2][8]);
d[1][9] = min(d[1][9], d[1][2] + d[2][9]);
d[2][0] = min(d[2][0], d[2][2] + d[2][0]);
d[2][1] = min(d[2][1], d[2][2] + d[2][1]);
d[2][2] = min(d[2][2], d[2][2] + d[2][2]);
d[2][3] = min(d[2][3], d[2][2] + d[2][3]);
d[2][4] = min(d[2][4], d[2][2] + d[2][4]);
d[2][5] = min(d[2][5], d[2][2] + d[2][5]);
d[2][6] = min(d[2][6], d[2][2] + d[2][6]);
d[2][7] = min(d[2][7], d[2][2] + d[2][7]);
d[2][8] = min(d[2][8], d[2][2] + d[2][8]);
d[2][9] = min(d[2][9], d[2][2] + d[2][9]);
d[3][0] = min(d[3][0], d[3][2] + d[2][0]);
d[3][1] = min(d[3][1], d[3][2] + d[2][1]);
d[3][2] = min(d[3][2], d[3][2] + d[2][2]);
d[3][3] = min(d[3][3], d[3][2] + d[2][3]);
d[3][4] = min(d[3][4], d[3][2] + d[2][4]);
d[3][5] = min(d[3][5], d[3][2] + d[2][5]);
d[3][6] = min(d[3][6], d[3][2] + d[2][6]);
d[3][7] = min(d[3][7], d[3][2] + d[2][7]);
d[3][8] = min(d[3][8], d[3][2] + d[2][8]);
d[3][9] = min(d[3][9], d[3][2] + d[2][9]);
d[4][0] = min(d[4][0], d[4][2] + d[2][0]);
d[4][1] = min(d[4][1], d[4][2] + d[2][1]);
d[4][2] = min(d[4][2], d[4][2] + d[2][2]);
d[4][3] = min(d[4][3], d[4][2] + d[2][3]);
d[4][4] = min(d[4][4], d[4][2] + d[2][4]);
d[4][5] = min(d[4][5], d[4][2] + d[2][5]);
d[4][6] = min(d[4][6], d[4][2] + d[2][6]);
d[4][7] = min(d[4][7], d[4][2] + d[2][7]);
d[4][8] = min(d[4][8], d[4][2] + d[2][8]);
d[4][9] = min(d[4][9], d[4][2] + d[2][9]);
d[5][0] = min(d[5][0], d[5][2] + d[2][0]);
d[5][1] = min(d[5][1], d[5][2] + d[2][1]);
d[5][2] = min(d[5][2], d[5][2] + d[2][2]);
d[5][3] = min(d[5][3], d[5][2] + d[2][3]);
d[5][4] = min(d[5][4], d[5][2] + d[2][4]);
d[5][5] = min(d[5][5], d[5][2] + d[2][5]);
d[5][6] = min(d[5][6], d[5][2] + d[2][6]);
d[5][7] = min(d[5][7], d[5][2] + d[2][7]);
d[5][8] = min(d[5][8], d[5][2] + d[2][8]);
d[5][9] = min(d[5][9], d[5][2] + d[2][9]);
d[6][0] = min(d[6][0], d[6][2] + d[2][0]);
d[6][1] = min(d[6][1], d[6][2] + d[2][1]);
d[6][2] = min(d[6][2], d[6][2] + d[2][2]);
d[6][3] = min(d[6][3], d[6][2] + d[2][3]);
d[6][4] = min(d[6][4], d[6][2] + d[2][4]);
d[6][5] = min(d[6][5], d[6][2] + d[2][5]);
d[6][6] = min(d[6][6], d[6][2] + d[2][6]);
d[6][7] = min(d[6][7], d[6][2] + d[2][7]);
d[6][8] = min(d[6][8], d[6][2] + d[2][8]);
d[6][9] = min(d[6][9], d[6][2] + d[2][9]);
d[7][0] = min(d[7][0], d[7][2] + d[2][0]);
d[7][1] = min(d[7][1], d[7][2] + d[2][1]);
d[7][2] = min(d[7][2], d[7][2] + d[2][2]);
d[7][3] = min(d[7][3], d[7][2] + d[2][3]);
d[7][4] = min(d[7][4], d[7][2] + d[2][4]);
d[7][5] = min(d[7][5], d[7][2] + d[2][5]);
d[7][6] = min(d[7][6], d[7][2] + d[2][6]);
d[7][7] = min(d[7][7], d[7][2] + d[2][7]);
d[7][8] = min(d[7][8], d[7][2] + d[2][8]);
d[7][9] = min(d[7][9], d[7][2] + d[2][9]);
d[8][0] = min(d[8][0], d[8][2] + d[2][0]);
d[8][1] = min(d[8][1], d[8][2] + d[2][1]);
d[8][2] = min(d[8][2], d[8][2] + d[2][2]);
d[8][3] = min(d[8][3], d[8][2] + d[2][3]);
d[8][4] = min(d[8][4], d[8][2] + d[2][4]);
d[8][5] = min(d[8][5], d[8][2] + d[2][5]);
d[8][6] = min(d[8][6], d[8][2] + d[2][6]);
d[8][7] = min(d[8][7], d[8][2] + d[2][7]);
d[8][8] = min(d[8][8], d[8][2] + d[2][8]);
d[8][9] = min(d[8][9], d[8][2] + d[2][9]);
d[9][0] = min(d[9][0], d[9][2] + d[2][0]);
d[9][1] = min(d[9][1], d[9][2] + d[2][1]);
d[9][2] = min(d[9][2], d[9][2] + d[2][2]);
d[9][3] = min(d[9][3], d[9][2] + d[2][3]);
d[9][4] = min(d[9][4], d[9][2] + d[2][4]);
d[9][5] = min(d[9][5], d[9][2] + d[2][5]);
d[9][6] = min(d[9][6], d[9][2] + d[2][6]);
d[9][7] = min(d[9][7], d[9][2] + d[2][7]);
d[9][8] = min(d[9][8], d[9][2] + d[2][8]);
d[9][9] = min(d[9][9], d[9][2] + d[2][9]);
d[0][0] = min(d[0][0], d[0][3] + d[3][0]);
d[0][1] = min(d[0][1], d[0][3] + d[3][1]);
d[0][2] = min(d[0][2], d[0][3] + d[3][2]);
d[0][3] = min(d[0][3], d[0][3] + d[3][3]);
d[0][4] = min(d[0][4], d[0][3] + d[3][4]);
d[0][5] = min(d[0][5], d[0][3] + d[3][5]);
d[0][6] = min(d[0][6], d[0][3] + d[3][6]);
d[0][7] = min(d[0][7], d[0][3] + d[3][7]);
d[0][8] = min(d[0][8], d[0][3] + d[3][8]);
d[0][9] = min(d[0][9], d[0][3] + d[3][9]);
d[1][0] = min(d[1][0], d[1][3] + d[3][0]);
d[1][1] = min(d[1][1], d[1][3] + d[3][1]);
d[1][2] = min(d[1][2], d[1][3] + d[3][2]);
d[1][3] = min(d[1][3], d[1][3] + d[3][3]);
d[1][4] = min(d[1][4], d[1][3] + d[3][4]);
d[1][5] = min(d[1][5], d[1][3] + d[3][5]);
d[1][6] = min(d[1][6], d[1][3] + d[3][6]);
d[1][7] = min(d[1][7], d[1][3] + d[3][7]);
d[1][8] = min(d[1][8], d[1][3] + d[3][8]);
d[1][9] = min(d[1][9], d[1][3] + d[3][9]);
d[2][0] = min(d[2][0], d[2][3] + d[3][0]);
d[2][1] = min(d[2][1], d[2][3] + d[3][1]);
d[2][2] = min(d[2][2], d[2][3] + d[3][2]);
d[2][3] = min(d[2][3], d[2][3] + d[3][3]);
d[2][4] = min(d[2][4], d[2][3] + d[3][4]);
d[2][5] = min(d[2][5], d[2][3] + d[3][5]);
d[2][6] = min(d[2][6], d[2][3] + d[3][6]);
d[2][7] = min(d[2][7], d[2][3] + d[3][7]);
d[2][8] = min(d[2][8], d[2][3] + d[3][8]);
d[2][9] = min(d[2][9], d[2][3] + d[3][9]);
d[3][0] = min(d[3][0], d[3][3] + d[3][0]);
d[3][1] = min(d[3][1], d[3][3] + d[3][1]);
d[3][2] = min(d[3][2], d[3][3] + d[3][2]);
d[3][3] = min(d[3][3], d[3][3] + d[3][3]);
d[3][4] = min(d[3][4], d[3][3] + d[3][4]);
d[3][5] = min(d[3][5], d[3][3] + d[3][5]);
d[3][6] = min(d[3][6], d[3][3] + d[3][6]);
d[3][7] = min(d[3][7], d[3][3] + d[3][7]);
d[3][8] = min(d[3][8], d[3][3] + d[3][8]);
d[3][9] = min(d[3][9], d[3][3] + d[3][9]);
d[4][0] = min(d[4][0], d[4][3] + d[3][0]);
d[4][1] = min(d[4][1], d[4][3] + d[3][1]);
d[4][2] = min(d[4][2], d[4][3] + d[3][2]);
d[4][3] = min(d[4][3], d[4][3] + d[3][3]);
d[4][4] = min(d[4][4], d[4][3] + d[3][4]);
d[4][5] = min(d[4][5], d[4][3] + d[3][5]);
d[4][6] = min(d[4][6], d[4][3] + d[3][6]);
d[4][7] = min(d[4][7], d[4][3] + d[3][7]);
d[4][8] = min(d[4][8], d[4][3] + d[3][8]);
d[4][9] = min(d[4][9], d[4][3] + d[3][9]);
d[5][0] = min(d[5][0], d[5][3] + d[3][0]);
d[5][1] = min(d[5][1], d[5][3] + d[3][1]);
d[5][2] = min(d[5][2], d[5][3] + d[3][2]);
d[5][3] = min(d[5][3], d[5][3] + d[3][3]);
d[5][4] = min(d[5][4], d[5][3] + d[3][4]);
d[5][5] = min(d[5][5], d[5][3] + d[3][5]);
d[5][6] = min(d[5][6], d[5][3] + d[3][6]);
d[5][7] = min(d[5][7], d[5][3] + d[3][7]);
d[5][8] = min(d[5][8], d[5][3] + d[3][8]);
d[5][9] = min(d[5][9], d[5][3] + d[3][9]);
d[6][0] = min(d[6][0], d[6][3] + d[3][0]);
d[6][1] = min(d[6][1], d[6][3] + d[3][1]);
d[6][2] = min(d[6][2], d[6][3] + d[3][2]);
d[6][3] = min(d[6][3], d[6][3] + d[3][3]);
d[6][4] = min(d[6][4], d[6][3] + d[3][4]);
d[6][5] = min(d[6][5], d[6][3] + d[3][5]);
d[6][6] = min(d[6][6], d[6][3] + d[3][6]);
d[6][7] = min(d[6][7], d[6][3] + d[3][7]);
d[6][8] = min(d[6][8], d[6][3] + d[3][8]);
d[6][9] = min(d[6][9], d[6][3] + d[3][9]);
d[7][0] = min(d[7][0], d[7][3] + d[3][0]);
d[7][1] = min(d[7][1], d[7][3] + d[3][1]);
d[7][2] = min(d[7][2], d[7][3] + d[3][2]);
d[7][3] = min(d[7][3], d[7][3] + d[3][3]);
d[7][4] = min(d[7][4], d[7][3] + d[3][4]);
d[7][5] = min(d[7][5], d[7][3] + d[3][5]);
d[7][6] = min(d[7][6], d[7][3] + d[3][6]);
d[7][7] = min(d[7][7], d[7][3] + d[3][7]);
d[7][8] = min(d[7][8], d[7][3] + d[3][8]);
d[7][9] = min(d[7][9], d[7][3] + d[3][9]);
d[8][0] = min(d[8][0], d[8][3] + d[3][0]);
d[8][1] = min(d[8][1], d[8][3] + d[3][1]);
d[8][2] = min(d[8][2], d[8][3] + d[3][2]);
d[8][3] = min(d[8][3], d[8][3] + d[3][3]);
d[8][4] = min(d[8][4], d[8][3] + d[3][4]);
d[8][5] = min(d[8][5], d[8][3] + d[3][5]);
d[8][6] = min(d[8][6], d[8][3] + d[3][6]);
d[8][7] = min(d[8][7], d[8][3] + d[3][7]);
d[8][8] = min(d[8][8], d[8][3] + d[3][8]);
d[8][9] = min(d[8][9], d[8][3] + d[3][9]);
d[9][0] = min(d[9][0], d[9][3] + d[3][0]);
d[9][1] = min(d[9][1], d[9][3] + d[3][1]);
d[9][2] = min(d[9][2], d[9][3] + d[3][2]);
d[9][3] = min(d[9][3], d[9][3] + d[3][3]);
d[9][4] = min(d[9][4], d[9][3] + d[3][4]);
d[9][5] = min(d[9][5], d[9][3] + d[3][5]);
d[9][6] = min(d[9][6], d[9][3] + d[3][6]);
d[9][7] = min(d[9][7], d[9][3] + d[3][7]);
d[9][8] = min(d[9][8], d[9][3] + d[3][8]);
d[9][9] = min(d[9][9], d[9][3] + d[3][9]);
d[0][0] = min(d[0][0], d[0][4] + d[4][0]);
d[0][1] = min(d[0][1], d[0][4] + d[4][1]);
d[0][2] = min(d[0][2], d[0][4] + d[4][2]);
d[0][3] = min(d[0][3], d[0][4] + d[4][3]);
d[0][4] = min(d[0][4], d[0][4] + d[4][4]);
d[0][5] = min(d[0][5], d[0][4] + d[4][5]);
d[0][6] = min(d[0][6], d[0][4] + d[4][6]);
d[0][7] = min(d[0][7], d[0][4] + d[4][7]);
d[0][8] = min(d[0][8], d[0][4] + d[4][8]);
d[0][9] = min(d[0][9], d[0][4] + d[4][9]);
d[1][0] = min(d[1][0], d[1][4] + d[4][0]);
d[1][1] = min(d[1][1], d[1][4] + d[4][1]);
d[1][2] = min(d[1][2], d[1][4] + d[4][2]);
d[1][3] = min(d[1][3], d[1][4] + d[4][3]);
d[1][4] = min(d[1][4], d[1][4] + d[4][4]);
d[1][5] = min(d[1][5], d[1][4] + d[4][5]);
d[1][6] = min(d[1][6], d[1][4] + d[4][6]);
d[1][7] = min(d[1][7], d[1][4] + d[4][7]);
d[1][8] = min(d[1][8], d[1][4] + d[4][8]);
d[1][9] = min(d[1][9], d[1][4] + d[4][9]);
d[2][0] = min(d[2][0], d[2][4] + d[4][0]);
d[2][1] = min(d[2][1], d[2][4] + d[4][1]);
d[2][2] = min(d[2][2], d[2][4] + d[4][2]);
d[2][3] = min(d[2][3], d[2][4] + d[4][3]);
d[2][4] = min(d[2][4], d[2][4] + d[4][4]);
d[2][5] = min(d[2][5], d[2][4] + d[4][5]);
d[2][6] = min(d[2][6], d[2][4] + d[4][6]);
d[2][7] = min(d[2][7], d[2][4] + d[4][7]);
d[2][8] = min(d[2][8], d[2][4] + d[4][8]);
d[2][9] = min(d[2][9], d[2][4] + d[4][9]);
d[3][0] = min(d[3][0], d[3][4] + d[4][0]);
d[3][1] = min(d[3][1], d[3][4] + d[4][1]);
d[3][2] = min(d[3][2], d[3][4] + d[4][2]);
d[3][3] = min(d[3][3], d[3][4] + d[4][3]);
d[3][4] = min(d[3][4], d[3][4] + d[4][4]);
d[3][5] = min(d[3][5], d[3][4] + d[4][5]);
d[3][6] = min(d[3][6], d[3][4] + d[4][6]);
d[3][7] = min(d[3][7], d[3][4] + d[4][7]);
d[3][8] = min(d[3][8], d[3][4] + d[4][8]);
d[3][9] = min(d[3][9], d[3][4] + d[4][9]);
d[4][0] = min(d[4][0], d[4][4] + d[4][0]);
d[4][1] = min(d[4][1], d[4][4] + d[4][1]);
d[4][2] = min(d[4][2], d[4][4] + d[4][2]);
d[4][3] = min(d[4][3], d[4][4] + d[4][3]);
d[4][4] = min(d[4][4], d[4][4] + d[4][4]);
d[4][5] = min(d[4][5], d[4][4] + d[4][5]);
d[4][6] = min(d[4][6], d[4][4] + d[4][6]);
d[4][7] = min(d[4][7], d[4][4] + d[4][7]);
d[4][8] = min(d[4][8], d[4][4] + d[4][8]);
d[4][9] = min(d[4][9], d[4][4] + d[4][9]);
d[5][0] = min(d[5][0], d[5][4] + d[4][0]);
d[5][1] = min(d[5][1], d[5][4] + d[4][1]);
d[5][2] = min(d[5][2], d[5][4] + d[4][2]);
d[5][3] = min(d[5][3], d[5][4] + d[4][3]);
d[5][4] = min(d[5][4], d[5][4] + d[4][4]);
d[5][5] = min(d[5][5], d[5][4] + d[4][5]);
d[5][6] = min(d[5][6], d[5][4] + d[4][6]);
d[5][7] = min(d[5][7], d[5][4] + d[4][7]);
d[5][8] = min(d[5][8], d[5][4] + d[4][8]);
d[5][9] = min(d[5][9], d[5][4] + d[4][9]);
d[6][0] = min(d[6][0], d[6][4] + d[4][0]);
d[6][1] = min(d[6][1], d[6][4] + d[4][1]);
d[6][2] = min(d[6][2], d[6][4] + d[4][2]);
d[6][3] = min(d[6][3], d[6][4] + d[4][3]);
d[6][4] = min(d[6][4], d[6][4] + d[4][4]);
d[6][5] = min(d[6][5], d[6][4] + d[4][5]);
d[6][6] = min(d[6][6], d[6][4] + d[4][6]);
d[6][7] = min(d[6][7], d[6][4] + d[4][7]);
d[6][8] = min(d[6][8], d[6][4] + d[4][8]);
d[6][9] = min(d[6][9], d[6][4] + d[4][9]);
d[7][0] = min(d[7][0], d[7][4] + d[4][0]);
d[7][1] = min(d[7][1], d[7][4] + d[4][1]);
d[7][2] = min(d[7][2], d[7][4] + d[4][2]);
d[7][3] = min(d[7][3], d[7][4] + d[4][3]);
d[7][4] = min(d[7][4], d[7][4] + d[4][4]);
d[7][5] = min(d[7][5], d[7][4] + d[4][5]);
d[7][6] = min(d[7][6], d[7][4] + d[4][6]);
d[7][7] = min(d[7][7], d[7][4] + d[4][7]);
d[7][8] = min(d[7][8], d[7][4] + d[4][8]);
d[7][9] = min(d[7][9], d[7][4] + d[4][9]);
d[8][0] = min(d[8][0], d[8][4] + d[4][0]);
d[8][1] = min(d[8][1], d[8][4] + d[4][1]);
d[8][2] = min(d[8][2], d[8][4] + d[4][2]);
d[8][3] = min(d[8][3], d[8][4] + d[4][3]);
d[8][4] = min(d[8][4], d[8][4] + d[4][4]);
d[8][5] = min(d[8][5], d[8][4] + d[4][5]);
d[8][6] = min(d[8][6], d[8][4] + d[4][6]);
d[8][7] = min(d[8][7], d[8][4] + d[4][7]);
d[8][8] = min(d[8][8], d[8][4] + d[4][8]);
d[8][9] = min(d[8][9], d[8][4] + d[4][9]);
d[9][0] = min(d[9][0], d[9][4] + d[4][0]);
d[9][1] = min(d[9][1], d[9][4] + d[4][1]);
d[9][2] = min(d[9][2], d[9][4] + d[4][2]);
d[9][3] = min(d[9][3], d[9][4] + d[4][3]);
d[9][4] = min(d[9][4], d[9][4] + d[4][4]);
d[9][5] = min(d[9][5], d[9][4] + d[4][5]);
d[9][6] = min(d[9][6], d[9][4] + d[4][6]);
d[9][7] = min(d[9][7], d[9][4] + d[4][7]);
d[9][8] = min(d[9][8], d[9][4] + d[4][8]);
d[9][9] = min(d[9][9], d[9][4] + d[4][9]);
d[0][0] = min(d[0][0], d[0][5] + d[5][0]);
d[0][1] = min(d[0][1], d[0][5] + d[5][1]);
d[0][2] = min(d[0][2], d[0][5] + d[5][2]);
d[0][3] = min(d[0][3], d[0][5] + d[5][3]);
d[0][4] = min(d[0][4], d[0][5] + d[5][4]);
d[0][5] = min(d[0][5], d[0][5] + d[5][5]);
d[0][6] = min(d[0][6], d[0][5] + d[5][6]);
d[0][7] = min(d[0][7], d[0][5] + d[5][7]);
d[0][8] = min(d[0][8], d[0][5] + d[5][8]);
d[0][9] = min(d[0][9], d[0][5] + d[5][9]);
d[1][0] = min(d[1][0], d[1][5] + d[5][0]);
d[1][1] = min(d[1][1], d[1][5] + d[5][1]);
d[1][2] = min(d[1][2], d[1][5] + d[5][2]);
d[1][3] = min(d[1][3], d[1][5] + d[5][3]);
d[1][4] = min(d[1][4], d[1][5] + d[5][4]);
d[1][5] = min(d[1][5], d[1][5] + d[5][5]);
d[1][6] = min(d[1][6], d[1][5] + d[5][6]);
d[1][7] = min(d[1][7], d[1][5] + d[5][7]);
d[1][8] = min(d[1][8], d[1][5] + d[5][8]);
d[1][9] = min(d[1][9], d[1][5] + d[5][9]);
d[2][0] = min(d[2][0], d[2][5] + d[5][0]);
d[2][1] = min(d[2][1], d[2][5] + d[5][1]);
d[2][2] = min(d[2][2], d[2][5] + d[5][2]);
d[2][3] = min(d[2][3], d[2][5] + d[5][3]);
d[2][4] = min(d[2][4], d[2][5] + d[5][4]);
d[2][5] = min(d[2][5], d[2][5] + d[5][5]);
d[2][6] = min(d[2][6], d[2][5] + d[5][6]);
d[2][7] = min(d[2][7], d[2][5] + d[5][7]);
d[2][8] = min(d[2][8], d[2][5] + d[5][8]);
d[2][9] = min(d[2][9], d[2][5] + d[5][9]);
d[3][0] = min(d[3][0], d[3][5] + d[5][0]);
d[3][1] = min(d[3][1], d[3][5] + d[5][1]);
d[3][2] = min(d[3][2], d[3][5] + d[5][2]);
d[3][3] = min(d[3][3], d[3][5] + d[5][3]);
d[3][4] = min(d[3][4], d[3][5] + d[5][4]);
d[3][5] = min(d[3][5], d[3][5] + d[5][5]);
d[3][6] = min(d[3][6], d[3][5] + d[5][6]);
d[3][7] = min(d[3][7], d[3][5] + d[5][7]);
d[3][8] = min(d[3][8], d[3][5] + d[5][8]);
d[3][9] = min(d[3][9], d[3][5] + d[5][9]);
d[4][0] = min(d[4][0], d[4][5] + d[5][0]);
d[4][1] = min(d[4][1], d[4][5] + d[5][1]);
d[4][2] = min(d[4][2], d[4][5] + d[5][2]);
d[4][3] = min(d[4][3], d[4][5] + d[5][3]);
d[4][4] = min(d[4][4], d[4][5] + d[5][4]);
d[4][5] = min(d[4][5], d[4][5] + d[5][5]);
d[4][6] = min(d[4][6], d[4][5] + d[5][6]);
d[4][7] = min(d[4][7], d[4][5] + d[5][7]);
d[4][8] = min(d[4][8], d[4][5] + d[5][8]);
d[4][9] = min(d[4][9], d[4][5] + d[5][9]);
d[5][0] = min(d[5][0], d[5][5] + d[5][0]);
d[5][1] = min(d[5][1], d[5][5] + d[5][1]);
d[5][2] = min(d[5][2], d[5][5] + d[5][2]);
d[5][3] = min(d[5][3], d[5][5] + d[5][3]);
d[5][4] = min(d[5][4], d[5][5] + d[5][4]);
d[5][5] = min(d[5][5], d[5][5] + d[5][5]);
d[5][6] = min(d[5][6], d[5][5] + d[5][6]);
d[5][7] = min(d[5][7], d[5][5] + d[5][7]);
d[5][8] = min(d[5][8], d[5][5] + d[5][8]);
d[5][9] = min(d[5][9], d[5][5] + d[5][9]);
d[6][0] = min(d[6][0], d[6][5] + d[5][0]);
d[6][1] = min(d[6][1], d[6][5] + d[5][1]);
d[6][2] = min(d[6][2], d[6][5] + d[5][2]);
d[6][3] = min(d[6][3], d[6][5] + d[5][3]);
d[6][4] = min(d[6][4], d[6][5] + d[5][4]);
d[6][5] = min(d[6][5], d[6][5] + d[5][5]);
d[6][6] = min(d[6][6], d[6][5] + d[5][6]);
d[6][7] = min(d[6][7], d[6][5] + d[5][7]);
d[6][8] = min(d[6][8], d[6][5] + d[5][8]);
d[6][9] = min(d[6][9], d[6][5] + d[5][9]);
d[7][0] = min(d[7][0], d[7][5] + d[5][0]);
d[7][1] = min(d[7][1], d[7][5] + d[5][1]);
d[7][2] = min(d[7][2], d[7][5] + d[5][2]);
d[7][3] = min(d[7][3], d[7][5] + d[5][3]);
d[7][4] = min(d[7][4], d[7][5] + d[5][4]);
d[7][5] = min(d[7][5], d[7][5] + d[5][5]);
d[7][6] = min(d[7][6], d[7][5] + d[5][6]);
d[7][7] = min(d[7][7], d[7][5] + d[5][7]);
d[7][8] = min(d[7][8], d[7][5] + d[5][8]);
d[7][9] = min(d[7][9], d[7][5] + d[5][9]);
d[8][0] = min(d[8][0], d[8][5] + d[5][0]);
d[8][1] = min(d[8][1], d[8][5] + d[5][1]);
d[8][2] = min(d[8][2], d[8][5] + d[5][2]);
d[8][3] = min(d[8][3], d[8][5] + d[5][3]);
d[8][4] = min(d[8][4], d[8][5] + d[5][4]);
d[8][5] = min(d[8][5], d[8][5] + d[5][5]);
d[8][6] = min(d[8][6], d[8][5] + d[5][6]);
d[8][7] = min(d[8][7], d[8][5] + d[5][7]);
d[8][8] = min(d[8][8], d[8][5] + d[5][8]);
d[8][9] = min(d[8][9], d[8][5] + d[5][9]);
d[9][0] = min(d[9][0], d[9][5] + d[5][0]);
d[9][1] = min(d[9][1], d[9][5] + d[5][1]);
d[9][2] = min(d[9][2], d[9][5] + d[5][2]);
d[9][3] = min(d[9][3], d[9][5] + d[5][3]);
d[9][4] = min(d[9][4], d[9][5] + d[5][4]);
d[9][5] = min(d[9][5], d[9][5] + d[5][5]);
d[9][6] = min(d[9][6], d[9][5] + d[5][6]);
d[9][7] = min(d[9][7], d[9][5] + d[5][7]);
d[9][8] = min(d[9][8], d[9][5] + d[5][8]);
d[9][9] = min(d[9][9], d[9][5] + d[5][9]);
d[0][0] = min(d[0][0], d[0][6] + d[6][0]);
d[0][1] = min(d[0][1], d[0][6] + d[6][1]);
d[0][2] = min(d[0][2], d[0][6] + d[6][2]);
d[0][3] = min(d[0][3], d[0][6] + d[6][3]);
d[0][4] = min(d[0][4], d[0][6] + d[6][4]);
d[0][5] = min(d[0][5], d[0][6] + d[6][5]);
d[0][6] = min(d[0][6], d[0][6] + d[6][6]);
d[0][7] = min(d[0][7], d[0][6] + d[6][7]);
d[0][8] = min(d[0][8], d[0][6] + d[6][8]);
d[0][9] = min(d[0][9], d[0][6] + d[6][9]);
d[1][0] = min(d[1][0], d[1][6] + d[6][0]);
d[1][1] = min(d[1][1], d[1][6] + d[6][1]);
d[1][2] = min(d[1][2], d[1][6] + d[6][2]);
d[1][3] = min(d[1][3], d[1][6] + d[6][3]);
d[1][4] = min(d[1][4], d[1][6] + d[6][4]);
d[1][5] = min(d[1][5], d[1][6] + d[6][5]);
d[1][6] = min(d[1][6], d[1][6] + d[6][6]);
d[1][7] = min(d[1][7], d[1][6] + d[6][7]);
d[1][8] = min(d[1][8], d[1][6] + d[6][8]);
d[1][9] = min(d[1][9], d[1][6] + d[6][9]);
d[2][0] = min(d[2][0], d[2][6] + d[6][0]);
d[2][1] = min(d[2][1], d[2][6] + d[6][1]);
d[2][2] = min(d[2][2], d[2][6] + d[6][2]);
d[2][3] = min(d[2][3], d[2][6] + d[6][3]);
d[2][4] = min(d[2][4], d[2][6] + d[6][4]);
d[2][5] = min(d[2][5], d[2][6] + d[6][5]);
d[2][6] = min(d[2][6], d[2][6] + d[6][6]);
d[2][7] = min(d[2][7], d[2][6] + d[6][7]);
d[2][8] = min(d[2][8], d[2][6] + d[6][8]);
d[2][9] = min(d[2][9], d[2][6] + d[6][9]);
d[3][0] = min(d[3][0], d[3][6] + d[6][0]);
d[3][1] = min(d[3][1], d[3][6] + d[6][1]);
d[3][2] = min(d[3][2], d[3][6] + d[6][2]);
d[3][3] = min(d[3][3], d[3][6] + d[6][3]);
d[3][4] = min(d[3][4], d[3][6] + d[6][4]);
d[3][5] = min(d[3][5], d[3][6] + d[6][5]);
d[3][6] = min(d[3][6], d[3][6] + d[6][6]);
d[3][7] = min(d[3][7], d[3][6] + d[6][7]);
d[3][8] = min(d[3][8], d[3][6] + d[6][8]);
d[3][9] = min(d[3][9], d[3][6] + d[6][9]);
d[4][0] = min(d[4][0], d[4][6] + d[6][0]);
d[4][1] = min(d[4][1], d[4][6] + d[6][1]);
d[4][2] = min(d[4][2], d[4][6] + d[6][2]);
d[4][3] = min(d[4][3], d[4][6] + d[6][3]);
d[4][4] = min(d[4][4], d[4][6] + d[6][4]);
d[4][5] = min(d[4][5], d[4][6] + d[6][5]);
d[4][6] = min(d[4][6], d[4][6] + d[6][6]);
d[4][7] = min(d[4][7], d[4][6] + d[6][7]);
d[4][8] = min(d[4][8], d[4][6] + d[6][8]);
d[4][9] = min(d[4][9], d[4][6] + d[6][9]);
d[5][0] = min(d[5][0], d[5][6] + d[6][0]);
d[5][1] = min(d[5][1], d[5][6] + d[6][1]);
d[5][2] = min(d[5][2], d[5][6] + d[6][2]);
d[5][3] = min(d[5][3], d[5][6] + d[6][3]);
d[5][4] = min(d[5][4], d[5][6] + d[6][4]);
d[5][5] = min(d[5][5], d[5][6] + d[6][5]);
d[5][6] = min(d[5][6], d[5][6] + d[6][6]);
d[5][7] = min(d[5][7], d[5][6] + d[6][7]);
d[5][8] = min(d[5][8], d[5][6] + d[6][8]);
d[5][9] = min(d[5][9], d[5][6] + d[6][9]);
d[6][0] = min(d[6][0], d[6][6] + d[6][0]);
d[6][1] = min(d[6][1], d[6][6] + d[6][1]);
d[6][2] = min(d[6][2], d[6][6] + d[6][2]);
d[6][3] = min(d[6][3], d[6][6] + d[6][3]);
d[6][4] = min(d[6][4], d[6][6] + d[6][4]);
d[6][5] = min(d[6][5], d[6][6] + d[6][5]);
d[6][6] = min(d[6][6], d[6][6] + d[6][6]);
d[6][7] = min(d[6][7], d[6][6] + d[6][7]);
d[6][8] = min(d[6][8], d[6][6] + d[6][8]);
d[6][9] = min(d[6][9], d[6][6] + d[6][9]);
d[7][0] = min(d[7][0], d[7][6] + d[6][0]);
d[7][1] = min(d[7][1], d[7][6] + d[6][1]);
d[7][2] = min(d[7][2], d[7][6] + d[6][2]);
d[7][3] = min(d[7][3], d[7][6] + d[6][3]);
d[7][4] = min(d[7][4], d[7][6] + d[6][4]);
d[7][5] = min(d[7][5], d[7][6] + d[6][5]);
d[7][6] = min(d[7][6], d[7][6] + d[6][6]);
d[7][7] = min(d[7][7], d[7][6] + d[6][7]);
d[7][8] = min(d[7][8], d[7][6] + d[6][8]);
d[7][9] = min(d[7][9], d[7][6] + d[6][9]);
d[8][0] = min(d[8][0], d[8][6] + d[6][0]);
d[8][1] = min(d[8][1], d[8][6] + d[6][1]);
d[8][2] = min(d[8][2], d[8][6] + d[6][2]);
d[8][3] = min(d[8][3], d[8][6] + d[6][3]);
d[8][4] = min(d[8][4], d[8][6] + d[6][4]);
d[8][5] = min(d[8][5], d[8][6] + d[6][5]);
d[8][6] = min(d[8][6], d[8][6] + d[6][6]);
d[8][7] = min(d[8][7], d[8][6] + d[6][7]);
d[8][8] = min(d[8][8], d[8][6] + d[6][8]);
d[8][9] = min(d[8][9], d[8][6] + d[6][9]);
d[9][0] = min(d[9][0], d[9][6] + d[6][0]);
d[9][1] = min(d[9][1], d[9][6] + d[6][1]);
d[9][2] = min(d[9][2], d[9][6] + d[6][2]);
d[9][3] = min(d[9][3], d[9][6] + d[6][3]);
d[9][4] = min(d[9][4], d[9][6] + d[6][4]);
d[9][5] = min(d[9][5], d[9][6] + d[6][5]);
d[9][6] = min(d[9][6], d[9][6] + d[6][6]);
d[9][7] = min(d[9][7], d[9][6] + d[6][7]);
d[9][8] = min(d[9][8], d[9][6] + d[6][8]);
d[9][9] = min(d[9][9], d[9][6] + d[6][9]);
d[0][0] = min(d[0][0], d[0][7] + d[7][0]);
d[0][1] = min(d[0][1], d[0][7] + d[7][1]);
d[0][2] = min(d[0][2], d[0][7] + d[7][2]);
d[0][3] = min(d[0][3], d[0][7] + d[7][3]);
d[0][4] = min(d[0][4], d[0][7] + d[7][4]);
d[0][5] = min(d[0][5], d[0][7] + d[7][5]);
d[0][6] = min(d[0][6], d[0][7] + d[7][6]);
d[0][7] = min(d[0][7], d[0][7] + d[7][7]);
d[0][8] = min(d[0][8], d[0][7] + d[7][8]);
d[0][9] = min(d[0][9], d[0][7] + d[7][9]);
d[1][0] = min(d[1][0], d[1][7] + d[7][0]);
d[1][1] = min(d[1][1], d[1][7] + d[7][1]);
d[1][2] = min(d[1][2], d[1][7] + d[7][2]);
d[1][3] = min(d[1][3], d[1][7] + d[7][3]);
d[1][4] = min(d[1][4], d[1][7] + d[7][4]);
d[1][5] = min(d[1][5], d[1][7] + d[7][5]);
d[1][6] = min(d[1][6], d[1][7] + d[7][6]);
d[1][7] = min(d[1][7], d[1][7] + d[7][7]);
d[1][8] = min(d[1][8], d[1][7] + d[7][8]);
d[1][9] = min(d[1][9], d[1][7] + d[7][9]);
d[2][0] = min(d[2][0], d[2][7] + d[7][0]);
d[2][1] = min(d[2][1], d[2][7] + d[7][1]);
d[2][2] = min(d[2][2], d[2][7] + d[7][2]);
d[2][3] = min(d[2][3], d[2][7] + d[7][3]);
d[2][4] = min(d[2][4], d[2][7] + d[7][4]);
d[2][5] = min(d[2][5], d[2][7] + d[7][5]);
d[2][6] = min(d[2][6], d[2][7] + d[7][6]);
d[2][7] = min(d[2][7], d[2][7] + d[7][7]);
d[2][8] = min(d[2][8], d[2][7] + d[7][8]);
d[2][9] = min(d[2][9], d[2][7] + d[7][9]);
d[3][0] = min(d[3][0], d[3][7] + d[7][0]);
d[3][1] = min(d[3][1], d[3][7] + d[7][1]);
d[3][2] = min(d[3][2], d[3][7] + d[7][2]);
d[3][3] = min(d[3][3], d[3][7] + d[7][3]);
d[3][4] = min(d[3][4], d[3][7] + d[7][4]);
d[3][5] = min(d[3][5], d[3][7] + d[7][5]);
d[3][6] = min(d[3][6], d[3][7] + d[7][6]);
d[3][7] = min(d[3][7], d[3][7] + d[7][7]);
d[3][8] = min(d[3][8], d[3][7] + d[7][8]);
d[3][9] = min(d[3][9], d[3][7] + d[7][9]);
d[4][0] = min(d[4][0], d[4][7] + d[7][0]);
d[4][1] = min(d[4][1], d[4][7] + d[7][1]);
d[4][2] = min(d[4][2], d[4][7] + d[7][2]);
d[4][3] = min(d[4][3], d[4][7] + d[7][3]);
d[4][4] = min(d[4][4], d[4][7] + d[7][4]);
d[4][5] = min(d[4][5], d[4][7] + d[7][5]);
d[4][6] = min(d[4][6], d[4][7] + d[7][6]);
d[4][7] = min(d[4][7], d[4][7] + d[7][7]);
d[4][8] = min(d[4][8], d[4][7] + d[7][8]);
d[4][9] = min(d[4][9], d[4][7] + d[7][9]);
d[5][0] = min(d[5][0], d[5][7] + d[7][0]);
d[5][1] = min(d[5][1], d[5][7] + d[7][1]);
d[5][2] = min(d[5][2], d[5][7] + d[7][2]);
d[5][3] = min(d[5][3], d[5][7] + d[7][3]);
d[5][4] = min(d[5][4], d[5][7] + d[7][4]);
d[5][5] = min(d[5][5], d[5][7] + d[7][5]);
d[5][6] = min(d[5][6], d[5][7] + d[7][6]);
d[5][7] = min(d[5][7], d[5][7] + d[7][7]);
d[5][8] = min(d[5][8], d[5][7] + d[7][8]);
d[5][9] = min(d[5][9], d[5][7] + d[7][9]);
d[6][0] = min(d[6][0], d[6][7] + d[7][0]);
d[6][1] = min(d[6][1], d[6][7] + d[7][1]);
d[6][2] = min(d[6][2], d[6][7] + d[7][2]);
d[6][3] = min(d[6][3], d[6][7] + d[7][3]);
d[6][4] = min(d[6][4], d[6][7] + d[7][4]);
d[6][5] = min(d[6][5], d[6][7] + d[7][5]);
d[6][6] = min(d[6][6], d[6][7] + d[7][6]);
d[6][7] = min(d[6][7], d[6][7] + d[7][7]);
d[6][8] = min(d[6][8], d[6][7] + d[7][8]);
d[6][9] = min(d[6][9], d[6][7] + d[7][9]);
d[7][0] = min(d[7][0], d[7][7] + d[7][0]);
d[7][1] = min(d[7][1], d[7][7] + d[7][1]);
d[7][2] = min(d[7][2], d[7][7] + d[7][2]);
d[7][3] = min(d[7][3], d[7][7] + d[7][3]);
d[7][4] = min(d[7][4], d[7][7] + d[7][4]);
d[7][5] = min(d[7][5], d[7][7] + d[7][5]);
d[7][6] = min(d[7][6], d[7][7] + d[7][6]);
d[7][7] = min(d[7][7], d[7][7] + d[7][7]);
d[7][8] = min(d[7][8], d[7][7] + d[7][8]);
d[7][9] = min(d[7][9], d[7][7] + d[7][9]);
d[8][0] = min(d[8][0], d[8][7] + d[7][0]);
d[8][1] = min(d[8][1], d[8][7] + d[7][1]);
d[8][2] = min(d[8][2], d[8][7] + d[7][2]);
d[8][3] = min(d[8][3], d[8][7] + d[7][3]);
d[8][4] = min(d[8][4], d[8][7] + d[7][4]);
d[8][5] = min(d[8][5], d[8][7] + d[7][5]);
d[8][6] = min(d[8][6], d[8][7] + d[7][6]);
d[8][7] = min(d[8][7], d[8][7] + d[7][7]);
d[8][8] = min(d[8][8], d[8][7] + d[7][8]);
d[8][9] = min(d[8][9], d[8][7] + d[7][9]);
d[9][0] = min(d[9][0], d[9][7] + d[7][0]);
d[9][1] = min(d[9][1], d[9][7] + d[7][1]);
d[9][2] = min(d[9][2], d[9][7] + d[7][2]);
d[9][3] = min(d[9][3], d[9][7] + d[7][3]);
d[9][4] = min(d[9][4], d[9][7] + d[7][4]);
d[9][5] = min(d[9][5], d[9][7] + d[7][5]);
d[9][6] = min(d[9][6], d[9][7] + d[7][6]);
d[9][7] = min(d[9][7], d[9][7] + d[7][7]);
d[9][8] = min(d[9][8], d[9][7] + d[7][8]);
d[9][9] = min(d[9][9], d[9][7] + d[7][9]);
d[0][0] = min(d[0][0], d[0][8] + d[8][0]);
d[0][1] = min(d[0][1], d[0][8] + d[8][1]);
d[0][2] = min(d[0][2], d[0][8] + d[8][2]);
d[0][3] = min(d[0][3], d[0][8] + d[8][3]);
d[0][4] = min(d[0][4], d[0][8] + d[8][4]);
d[0][5] = min(d[0][5], d[0][8] + d[8][5]);
d[0][6] = min(d[0][6], d[0][8] + d[8][6]);
d[0][7] = min(d[0][7], d[0][8] + d[8][7]);
d[0][8] = min(d[0][8], d[0][8] + d[8][8]);
d[0][9] = min(d[0][9], d[0][8] + d[8][9]);
d[1][0] = min(d[1][0], d[1][8] + d[8][0]);
d[1][1] = min(d[1][1], d[1][8] + d[8][1]);
d[1][2] = min(d[1][2], d[1][8] + d[8][2]);
d[1][3] = min(d[1][3], d[1][8] + d[8][3]);
d[1][4] = min(d[1][4], d[1][8] + d[8][4]);
d[1][5] = min(d[1][5], d[1][8] + d[8][5]);
d[1][6] = min(d[1][6], d[1][8] + d[8][6]);
d[1][7] = min(d[1][7], d[1][8] + d[8][7]);
d[1][8] = min(d[1][8], d[1][8] + d[8][8]);
d[1][9] = min(d[1][9], d[1][8] + d[8][9]);
d[2][0] = min(d[2][0], d[2][8] + d[8][0]);
d[2][1] = min(d[2][1], d[2][8] + d[8][1]);
d[2][2] = min(d[2][2], d[2][8] + d[8][2]);
d[2][3] = min(d[2][3], d[2][8] + d[8][3]);
d[2][4] = min(d[2][4], d[2][8] + d[8][4]);
d[2][5] = min(d[2][5], d[2][8] + d[8][5]);
d[2][6] = min(d[2][6], d[2][8] + d[8][6]);
d[2][7] = min(d[2][7], d[2][8] + d[8][7]);
d[2][8] = min(d[2][8], d[2][8] + d[8][8]);
d[2][9] = min(d[2][9], d[2][8] + d[8][9]);
d[3][0] = min(d[3][0], d[3][8] + d[8][0]);
d[3][1] = min(d[3][1], d[3][8] + d[8][1]);
d[3][2] = min(d[3][2], d[3][8] + d[8][2]);
d[3][3] = min(d[3][3], d[3][8] + d[8][3]);
d[3][4] = min(d[3][4], d[3][8] + d[8][4]);
d[3][5] = min(d[3][5], d[3][8] + d[8][5]);
d[3][6] = min(d[3][6], d[3][8] + d[8][6]);
d[3][7] = min(d[3][7], d[3][8] + d[8][7]);
d[3][8] = min(d[3][8], d[3][8] + d[8][8]);
d[3][9] = min(d[3][9], d[3][8] + d[8][9]);
d[4][0] = min(d[4][0], d[4][8] + d[8][0]);
d[4][1] = min(d[4][1], d[4][8] + d[8][1]);
d[4][2] = min(d[4][2], d[4][8] + d[8][2]);
d[4][3] = min(d[4][3], d[4][8] + d[8][3]);
d[4][4] = min(d[4][4], d[4][8] + d[8][4]);
d[4][5] = min(d[4][5], d[4][8] + d[8][5]);
d[4][6] = min(d[4][6], d[4][8] + d[8][6]);
d[4][7] = min(d[4][7], d[4][8] + d[8][7]);
d[4][8] = min(d[4][8], d[4][8] + d[8][8]);
d[4][9] = min(d[4][9], d[4][8] + d[8][9]);
d[5][0] = min(d[5][0], d[5][8] + d[8][0]);
d[5][1] = min(d[5][1], d[5][8] + d[8][1]);
d[5][2] = min(d[5][2], d[5][8] + d[8][2]);
d[5][3] = min(d[5][3], d[5][8] + d[8][3]);
d[5][4] = min(d[5][4], d[5][8] + d[8][4]);
d[5][5] = min(d[5][5], d[5][8] + d[8][5]);
d[5][6] = min(d[5][6], d[5][8] + d[8][6]);
d[5][7] = min(d[5][7], d[5][8] + d[8][7]);
d[5][8] = min(d[5][8], d[5][8] + d[8][8]);
d[5][9] = min(d[5][9], d[5][8] + d[8][9]);
d[6][0] = min(d[6][0], d[6][8] + d[8][0]);
d[6][1] = min(d[6][1], d[6][8] + d[8][1]);
d[6][2] = min(d[6][2], d[6][8] + d[8][2]);
d[6][3] = min(d[6][3], d[6][8] + d[8][3]);
d[6][4] = min(d[6][4], d[6][8] + d[8][4]);
d[6][5] = min(d[6][5], d[6][8] + d[8][5]);
d[6][6] = min(d[6][6], d[6][8] + d[8][6]);
d[6][7] = min(d[6][7], d[6][8] + d[8][7]);
d[6][8] = min(d[6][8], d[6][8] + d[8][8]);
d[6][9] = min(d[6][9], d[6][8] + d[8][9]);
d[7][0] = min(d[7][0], d[7][8] + d[8][0]);
d[7][1] = min(d[7][1], d[7][8] + d[8][1]);
d[7][2] = min(d[7][2], d[7][8] + d[8][2]);
d[7][3] = min(d[7][3], d[7][8] + d[8][3]);
d[7][4] = min(d[7][4], d[7][8] + d[8][4]);
d[7][5] = min(d[7][5], d[7][8] + d[8][5]);
d[7][6] = min(d[7][6], d[7][8] + d[8][6]);
d[7][7] = min(d[7][7], d[7][8] + d[8][7]);
d[7][8] = min(d[7][8], d[7][8] + d[8][8]);
d[7][9] = min(d[7][9], d[7][8] + d[8][9]);
d[8][0] = min(d[8][0], d[8][8] + d[8][0]);
d[8][1] = min(d[8][1], d[8][8] + d[8][1]);
d[8][2] = min(d[8][2], d[8][8] + d[8][2]);
d[8][3] = min(d[8][3], d[8][8] + d[8][3]);
d[8][4] = min(d[8][4], d[8][8] + d[8][4]);
d[8][5] = min(d[8][5], d[8][8] + d[8][5]);
d[8][6] = min(d[8][6], d[8][8] + d[8][6]);
d[8][7] = min(d[8][7], d[8][8] + d[8][7]);
d[8][8] = min(d[8][8], d[8][8] + d[8][8]);
d[8][9] = min(d[8][9], d[8][8] + d[8][9]);
d[9][0] = min(d[9][0], d[9][8] + d[8][0]);
d[9][1] = min(d[9][1], d[9][8] + d[8][1]);
d[9][2] = min(d[9][2], d[9][8] + d[8][2]);
d[9][3] = min(d[9][3], d[9][8] + d[8][3]);
d[9][4] = min(d[9][4], d[9][8] + d[8][4]);
d[9][5] = min(d[9][5], d[9][8] + d[8][5]);
d[9][6] = min(d[9][6], d[9][8] + d[8][6]);
d[9][7] = min(d[9][7], d[9][8] + d[8][7]);
d[9][8] = min(d[9][8], d[9][8] + d[8][8]);
d[9][9] = min(d[9][9], d[9][8] + d[8][9]);
d[0][0] = min(d[0][0], d[0][9] + d[9][0]);
d[0][1] = min(d[0][1], d[0][9] + d[9][1]);
d[0][2] = min(d[0][2], d[0][9] + d[9][2]);
d[0][3] = min(d[0][3], d[0][9] + d[9][3]);
d[0][4] = min(d[0][4], d[0][9] + d[9][4]);
d[0][5] = min(d[0][5], d[0][9] + d[9][5]);
d[0][6] = min(d[0][6], d[0][9] + d[9][6]);
d[0][7] = min(d[0][7], d[0][9] + d[9][7]);
d[0][8] = min(d[0][8], d[0][9] + d[9][8]);
d[0][9] = min(d[0][9], d[0][9] + d[9][9]);
d[1][0] = min(d[1][0], d[1][9] + d[9][0]);
d[1][1] = min(d[1][1], d[1][9] + d[9][1]);
d[1][2] = min(d[1][2], d[1][9] + d[9][2]);
d[1][3] = min(d[1][3], d[1][9] + d[9][3]);
d[1][4] = min(d[1][4], d[1][9] + d[9][4]);
d[1][5] = min(d[1][5], d[1][9] + d[9][5]);
d[1][6] = min(d[1][6], d[1][9] + d[9][6]);
d[1][7] = min(d[1][7], d[1][9] + d[9][7]);
d[1][8] = min(d[1][8], d[1][9] + d[9][8]);
d[1][9] = min(d[1][9], d[1][9] + d[9][9]);
d[2][0] = min(d[2][0], d[2][9] + d[9][0]);
d[2][1] = min(d[2][1], d[2][9] + d[9][1]);
d[2][2] = min(d[2][2], d[2][9] + d[9][2]);
d[2][3] = min(d[2][3], d[2][9] + d[9][3]);
d[2][4] = min(d[2][4], d[2][9] + d[9][4]);
d[2][5] = min(d[2][5], d[2][9] + d[9][5]);
d[2][6] = min(d[2][6], d[2][9] + d[9][6]);
d[2][7] = min(d[2][7], d[2][9] + d[9][7]);
d[2][8] = min(d[2][8], d[2][9] + d[9][8]);
d[2][9] = min(d[2][9], d[2][9] + d[9][9]);
d[3][0] = min(d[3][0], d[3][9] + d[9][0]);
d[3][1] = min(d[3][1], d[3][9] + d[9][1]);
d[3][2] = min(d[3][2], d[3][9] + d[9][2]);
d[3][3] = min(d[3][3], d[3][9] + d[9][3]);
d[3][4] = min(d[3][4], d[3][9] + d[9][4]);
d[3][5] = min(d[3][5], d[3][9] + d[9][5]);
d[3][6] = min(d[3][6], d[3][9] + d[9][6]);
d[3][7] = min(d[3][7], d[3][9] + d[9][7]);
d[3][8] = min(d[3][8], d[3][9] + d[9][8]);
d[3][9] = min(d[3][9], d[3][9] + d[9][9]);
d[4][0] = min(d[4][0], d[4][9] + d[9][0]);
d[4][1] = min(d[4][1], d[4][9] + d[9][1]);
d[4][2] = min(d[4][2], d[4][9] + d[9][2]);
d[4][3] = min(d[4][3], d[4][9] + d[9][3]);
d[4][4] = min(d[4][4], d[4][9] + d[9][4]);
d[4][5] = min(d[4][5], d[4][9] + d[9][5]);
d[4][6] = min(d[4][6], d[4][9] + d[9][6]);
d[4][7] = min(d[4][7], d[4][9] + d[9][7]);
d[4][8] = min(d[4][8], d[4][9] + d[9][8]);
d[4][9] = min(d[4][9], d[4][9] + d[9][9]);
d[5][0] = min(d[5][0], d[5][9] + d[9][0]);
d[5][1] = min(d[5][1], d[5][9] + d[9][1]);
d[5][2] = min(d[5][2], d[5][9] + d[9][2]);
d[5][3] = min(d[5][3], d[5][9] + d[9][3]);
d[5][4] = min(d[5][4], d[5][9] + d[9][4]);
d[5][5] = min(d[5][5], d[5][9] + d[9][5]);
d[5][6] = min(d[5][6], d[5][9] + d[9][6]);
d[5][7] = min(d[5][7], d[5][9] + d[9][7]);
d[5][8] = min(d[5][8], d[5][9] + d[9][8]);
d[5][9] = min(d[5][9], d[5][9] + d[9][9]);
d[6][0] = min(d[6][0], d[6][9] + d[9][0]);
d[6][1] = min(d[6][1], d[6][9] + d[9][1]);
d[6][2] = min(d[6][2], d[6][9] + d[9][2]);
d[6][3] = min(d[6][3], d[6][9] + d[9][3]);
d[6][4] = min(d[6][4], d[6][9] + d[9][4]);
d[6][5] = min(d[6][5], d[6][9] + d[9][5]);
d[6][6] = min(d[6][6], d[6][9] + d[9][6]);
d[6][7] = min(d[6][7], d[6][9] + d[9][7]);
d[6][8] = min(d[6][8], d[6][9] + d[9][8]);
d[6][9] = min(d[6][9], d[6][9] + d[9][9]);
d[7][0] = min(d[7][0], d[7][9] + d[9][0]);
d[7][1] = min(d[7][1], d[7][9] + d[9][1]);
d[7][2] = min(d[7][2], d[7][9] + d[9][2]);
d[7][3] = min(d[7][3], d[7][9] + d[9][3]);
d[7][4] = min(d[7][4], d[7][9] + d[9][4]);
d[7][5] = min(d[7][5], d[7][9] + d[9][5]);
d[7][6] = min(d[7][6], d[7][9] + d[9][6]);
d[7][7] = min(d[7][7], d[7][9] + d[9][7]);
d[7][8] = min(d[7][8], d[7][9] + d[9][8]);
d[7][9] = min(d[7][9], d[7][9] + d[9][9]);
d[8][0] = min(d[8][0], d[8][9] + d[9][0]);
d[8][1] = min(d[8][1], d[8][9] + d[9][1]);
d[8][2] = min(d[8][2], d[8][9] + d[9][2]);
d[8][3] = min(d[8][3], d[8][9] + d[9][3]);
d[8][4] = min(d[8][4], d[8][9] + d[9][4]);
d[8][5] = min(d[8][5], d[8][9] + d[9][5]);
d[8][6] = min(d[8][6], d[8][9] + d[9][6]);
d[8][7] = min(d[8][7], d[8][9] + d[9][7]);
d[8][8] = min(d[8][8], d[8][9] + d[9][8]);
d[8][9] = min(d[8][9], d[8][9] + d[9][9]);
d[9][0] = min(d[9][0], d[9][9] + d[9][0]);
d[9][1] = min(d[9][1], d[9][9] + d[9][1]);
d[9][2] = min(d[9][2], d[9][9] + d[9][2]);
d[9][3] = min(d[9][3], d[9][9] + d[9][3]);
d[9][4] = min(d[9][4], d[9][9] + d[9][4]);
d[9][5] = min(d[9][5], d[9][9] + d[9][5]);
d[9][6] = min(d[9][6], d[9][9] + d[9][6]);
d[9][7] = min(d[9][7], d[9][9] + d[9][7]);
d[9][8] = min(d[9][8], d[9][9] + d[9][8]);
d[9][9] = min(d[9][9], d[9][9] + d[9][9]);
ans = max(ans, d[0 % n][0 % n]);
ans = max(ans, d[0 % n][1 % n]);
ans = max(ans, d[0 % n][2 % n]);
ans = max(ans, d[0 % n][3 % n]);
ans = max(ans, d[0 % n][4 % n]);
ans = max(ans, d[0 % n][5 % n]);
ans = max(ans, d[0 % n][6 % n]);
ans = max(ans, d[0 % n][7 % n]);
ans = max(ans, d[0 % n][8 % n]);
ans = max(ans, d[0 % n][9 % n]);
ans = max(ans, d[1 % n][0 % n]);
ans = max(ans, d[1 % n][1 % n]);
ans = max(ans, d[1 % n][2 % n]);
ans = max(ans, d[1 % n][3 % n]);
ans = max(ans, d[1 % n][4 % n]);
ans = max(ans, d[1 % n][5 % n]);
ans = max(ans, d[1 % n][6 % n]);
ans = max(ans, d[1 % n][7 % n]);
ans = max(ans, d[1 % n][8 % n]);
ans = max(ans, d[1 % n][9 % n]);
ans = max(ans, d[2 % n][0 % n]);
ans = max(ans, d[2 % n][1 % n]);
ans = max(ans, d[2 % n][2 % n]);
ans = max(ans, d[2 % n][3 % n]);
ans = max(ans, d[2 % n][4 % n]);
ans = max(ans, d[2 % n][5 % n]);
ans = max(ans, d[2 % n][6 % n]);
ans = max(ans, d[2 % n][7 % n]);
ans = max(ans, d[2 % n][8 % n]);
ans = max(ans, d[2 % n][9 % n]);
ans = max(ans, d[3 % n][0 % n]);
ans = max(ans, d[3 % n][1 % n]);
ans = max(ans, d[3 % n][2 % n]);
ans = max(ans, d[3 % n][3 % n]);
ans = max(ans, d[3 % n][4 % n]);
ans = max(ans, d[3 % n][5 % n]);
ans = max(ans, d[3 % n][6 % n]);
ans = max(ans, d[3 % n][7 % n]);
ans = max(ans, d[3 % n][8 % n]);
ans = max(ans, d[3 % n][9 % n]);
ans = max(ans, d[4 % n][0 % n]);
ans = max(ans, d[4 % n][1 % n]);
ans = max(ans, d[4 % n][2 % n]);
ans = max(ans, d[4 % n][3 % n]);
ans = max(ans, d[4 % n][4 % n]);
ans = max(ans, d[4 % n][5 % n]);
ans = max(ans, d[4 % n][6 % n]);
ans = max(ans, d[4 % n][7 % n]);
ans = max(ans, d[4 % n][8 % n]);
ans = max(ans, d[4 % n][9 % n]);
ans = max(ans, d[5 % n][0 % n]);
ans = max(ans, d[5 % n][1 % n]);
ans = max(ans, d[5 % n][2 % n]);
ans = max(ans, d[5 % n][3 % n]);
ans = max(ans, d[5 % n][4 % n]);
ans = max(ans, d[5 % n][5 % n]);
ans = max(ans, d[5 % n][6 % n]);
ans = max(ans, d[5 % n][7 % n]);
ans = max(ans, d[5 % n][8 % n]);
ans = max(ans, d[5 % n][9 % n]);
ans = max(ans, d[6 % n][0 % n]);
ans = max(ans, d[6 % n][1 % n]);
ans = max(ans, d[6 % n][2 % n]);
ans = max(ans, d[6 % n][3 % n]);
ans = max(ans, d[6 % n][4 % n]);
ans = max(ans, d[6 % n][5 % n]);
ans = max(ans, d[6 % n][6 % n]);
ans = max(ans, d[6 % n][7 % n]);
ans = max(ans, d[6 % n][8 % n]);
ans = max(ans, d[6 % n][9 % n]);
ans = max(ans, d[7 % n][0 % n]);
ans = max(ans, d[7 % n][1 % n]);
ans = max(ans, d[7 % n][2 % n]);
ans = max(ans, d[7 % n][3 % n]);
ans = max(ans, d[7 % n][4 % n]);
ans = max(ans, d[7 % n][5 % n]);
ans = max(ans, d[7 % n][6 % n]);
ans = max(ans, d[7 % n][7 % n]);
ans = max(ans, d[7 % n][8 % n]);
ans = max(ans, d[7 % n][9 % n]);
ans = max(ans, d[8 % n][0 % n]);
ans = max(ans, d[8 % n][1 % n]);
ans = max(ans, d[8 % n][2 % n]);
ans = max(ans, d[8 % n][3 % n]);
ans = max(ans, d[8 % n][4 % n]);
ans = max(ans, d[8 % n][5 % n]);
ans = max(ans, d[8 % n][6 % n]);
ans = max(ans, d[8 % n][7 % n]);
ans = max(ans, d[8 % n][8 % n]);
ans = max(ans, d[8 % n][9 % n]);
ans = max(ans, d[9 % n][0 % n]);
ans = max(ans, d[9 % n][1 % n]);
ans = max(ans, d[9 % n][2 % n]);
ans = max(ans, d[9 % n][3 % n]);
ans = max(ans, d[9 % n][4 % n]);
ans = max(ans, d[9 % n][5 % n]);
ans = max(ans, d[9 % n][6 % n]);
ans = max(ans, d[9 % n][7 % n]);
ans = max(ans, d[9 % n][8 % n]);
ans = max(ans, d[9 % n][9 % n]);
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void SolveA() {
long long r, a;
cin >> a;
r = 1 << a;
cout << r << endl;
}
void IFIF(bool v, function<void()> f0) {
v ? f0() : [] {}();
}
void _Eor(int n, int idx, function<void(int i)> f) {
IFIF(idx < n, [&]() {
f(idx);
_Eor(n, idx + 1, f);
});
}
void Eor(int n, function<void(int i)> f) { _Eor(n, 0, f); }
void SolveE() {
int N;
cin >> N;
vector<vector<int>> dis(N, vector<int>(N));
Eor(N * N, [&](int i) { cin >> dis[i / N][i % N]; });
Eor(N, [&](int k) {
Eor(N, [&](int i) {
Eor(N, [&](int j) {
IFIF(dis[i][k] + dis[k][j] < dis[i][j],
[&]() { dis[i][j] = dis[i][k] + dis[k][j]; });
});
});
});
int r = 0;
Eor(N * N, [&](int v) {
int i = v / N;
int j = v % N;
IFIF(dis[i][j] > r, [&]() { r = dis[i][j]; });
});
cout << r << endl;
}
int main() {
SolveE();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 15;
int fg, G[15][15], i, j, n, k, ans = 0;
inline int Forj() {
j++;
fg && (scanf("%d", &G[i][j]) || 1);
ans = max(ans, G[i][j]);
return j != n ? Forj() : n;
}
inline int Fori() {
i++;
j = 0;
Forj();
return i != n ? Fori() : n;
}
inline int Forj1() {
j++;
G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
return j != n ? Forj1() : n;
}
inline int Fori1() {
i++;
j = 0;
Forj1();
return i != n ? Fori1() : n;
}
inline int Fork() {
k++;
i = 0;
Fori1();
return k != n ? Fork() : n;
}
int main() {
scanf("%d", &n);
fg = 1;
i = 0;
Fori();
k = 0;
Fork();
fg = 0;
i = 0;
ans = 0;
Fori();
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
int n, arr[20][20], ma = -1;
int scan(int x) {
scanf("%d", &arr[x / n][x % n]);
return x = x < n * n - 1 ? scan(x + 1) : 0;
}
int solve(int x) {
int i, j, k;
k = (x / n) / n;
i = (x / n) % n;
j = (x % n);
arr[i][j] =
arr[i][j] > arr[i][k] + arr[k][j] ? arr[i][k] + arr[k][j] : arr[i][j];
return x = x < n * n * n - 1 ? solve(x + 1) : 0;
}
int get_max(int x) {
int i, j;
i = x / n;
j = x % n;
ma = arr[i][j] > ma ? arr[i][j] : ma;
return x < n * n - 1 ? get_max(x + 1) : 0;
}
int main() {
int i, j;
scanf("%d", &n);
scan(0);
solve(0);
get_max(0);
printf("%d", ma);
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int g[22][22];
int tmp;
int main() {
cin >> n;
vector<int> all;
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
cin >> tmp;
all.push_back(tmp);
int sz = 0;
g[1][1] = (1 <= n && 1 <= n ? all[sz++] : 999);
g[1][2] = (1 <= n && 2 <= n ? all[sz++] : 999);
g[1][3] = (1 <= n && 3 <= n ? all[sz++] : 999);
g[1][4] = (1 <= n && 4 <= n ? all[sz++] : 999);
g[1][5] = (1 <= n && 5 <= n ? all[sz++] : 999);
g[1][6] = (1 <= n && 6 <= n ? all[sz++] : 999);
g[1][7] = (1 <= n && 7 <= n ? all[sz++] : 999);
g[1][8] = (1 <= n && 8 <= n ? all[sz++] : 999);
g[1][9] = (1 <= n && 9 <= n ? all[sz++] : 999);
g[1][10] = (1 <= n && 10 <= n ? all[sz++] : 999);
g[2][1] = (2 <= n && 1 <= n ? all[sz++] : 999);
g[2][2] = (2 <= n && 2 <= n ? all[sz++] : 999);
g[2][3] = (2 <= n && 3 <= n ? all[sz++] : 999);
g[2][4] = (2 <= n && 4 <= n ? all[sz++] : 999);
g[2][5] = (2 <= n && 5 <= n ? all[sz++] : 999);
g[2][6] = (2 <= n && 6 <= n ? all[sz++] : 999);
g[2][7] = (2 <= n && 7 <= n ? all[sz++] : 999);
g[2][8] = (2 <= n && 8 <= n ? all[sz++] : 999);
g[2][9] = (2 <= n && 9 <= n ? all[sz++] : 999);
g[2][10] = (2 <= n && 10 <= n ? all[sz++] : 999);
g[3][1] = (3 <= n && 1 <= n ? all[sz++] : 999);
g[3][2] = (3 <= n && 2 <= n ? all[sz++] : 999);
g[3][3] = (3 <= n && 3 <= n ? all[sz++] : 999);
g[3][4] = (3 <= n && 4 <= n ? all[sz++] : 999);
g[3][5] = (3 <= n && 5 <= n ? all[sz++] : 999);
g[3][6] = (3 <= n && 6 <= n ? all[sz++] : 999);
g[3][7] = (3 <= n && 7 <= n ? all[sz++] : 999);
g[3][8] = (3 <= n && 8 <= n ? all[sz++] : 999);
g[3][9] = (3 <= n && 9 <= n ? all[sz++] : 999);
g[3][10] = (3 <= n && 10 <= n ? all[sz++] : 999);
g[4][1] = (4 <= n && 1 <= n ? all[sz++] : 999);
g[4][2] = (4 <= n && 2 <= n ? all[sz++] : 999);
g[4][3] = (4 <= n && 3 <= n ? all[sz++] : 999);
g[4][4] = (4 <= n && 4 <= n ? all[sz++] : 999);
g[4][5] = (4 <= n && 5 <= n ? all[sz++] : 999);
g[4][6] = (4 <= n && 6 <= n ? all[sz++] : 999);
g[4][7] = (4 <= n && 7 <= n ? all[sz++] : 999);
g[4][8] = (4 <= n && 8 <= n ? all[sz++] : 999);
g[4][9] = (4 <= n && 9 <= n ? all[sz++] : 999);
g[4][10] = (4 <= n && 10 <= n ? all[sz++] : 999);
g[5][1] = (5 <= n && 1 <= n ? all[sz++] : 999);
g[5][2] = (5 <= n && 2 <= n ? all[sz++] : 999);
g[5][3] = (5 <= n && 3 <= n ? all[sz++] : 999);
g[5][4] = (5 <= n && 4 <= n ? all[sz++] : 999);
g[5][5] = (5 <= n && 5 <= n ? all[sz++] : 999);
g[5][6] = (5 <= n && 6 <= n ? all[sz++] : 999);
g[5][7] = (5 <= n && 7 <= n ? all[sz++] : 999);
g[5][8] = (5 <= n && 8 <= n ? all[sz++] : 999);
g[5][9] = (5 <= n && 9 <= n ? all[sz++] : 999);
g[5][10] = (5 <= n && 10 <= n ? all[sz++] : 999);
g[6][1] = (6 <= n && 1 <= n ? all[sz++] : 999);
g[6][2] = (6 <= n && 2 <= n ? all[sz++] : 999);
g[6][3] = (6 <= n && 3 <= n ? all[sz++] : 999);
g[6][4] = (6 <= n && 4 <= n ? all[sz++] : 999);
g[6][5] = (6 <= n && 5 <= n ? all[sz++] : 999);
g[6][6] = (6 <= n && 6 <= n ? all[sz++] : 999);
g[6][7] = (6 <= n && 7 <= n ? all[sz++] : 999);
g[6][8] = (6 <= n && 8 <= n ? all[sz++] : 999);
g[6][9] = (6 <= n && 9 <= n ? all[sz++] : 999);
g[6][10] = (6 <= n && 10 <= n ? all[sz++] : 999);
g[7][1] = (7 <= n && 1 <= n ? all[sz++] : 999);
g[7][2] = (7 <= n && 2 <= n ? all[sz++] : 999);
g[7][3] = (7 <= n && 3 <= n ? all[sz++] : 999);
g[7][4] = (7 <= n && 4 <= n ? all[sz++] : 999);
g[7][5] = (7 <= n && 5 <= n ? all[sz++] : 999);
g[7][6] = (7 <= n && 6 <= n ? all[sz++] : 999);
g[7][7] = (7 <= n && 7 <= n ? all[sz++] : 999);
g[7][8] = (7 <= n && 8 <= n ? all[sz++] : 999);
g[7][9] = (7 <= n && 9 <= n ? all[sz++] : 999);
g[7][10] = (7 <= n && 10 <= n ? all[sz++] : 999);
g[8][1] = (8 <= n && 1 <= n ? all[sz++] : 999);
g[8][2] = (8 <= n && 2 <= n ? all[sz++] : 999);
g[8][3] = (8 <= n && 3 <= n ? all[sz++] : 999);
g[8][4] = (8 <= n && 4 <= n ? all[sz++] : 999);
g[8][5] = (8 <= n && 5 <= n ? all[sz++] : 999);
g[8][6] = (8 <= n && 6 <= n ? all[sz++] : 999);
g[8][7] = (8 <= n && 7 <= n ? all[sz++] : 999);
g[8][8] = (8 <= n && 8 <= n ? all[sz++] : 999);
g[8][9] = (8 <= n && 9 <= n ? all[sz++] : 999);
g[8][10] = (8 <= n && 10 <= n ? all[sz++] : 999);
g[9][1] = (9 <= n && 1 <= n ? all[sz++] : 999);
g[9][2] = (9 <= n && 2 <= n ? all[sz++] : 999);
g[9][3] = (9 <= n && 3 <= n ? all[sz++] : 999);
g[9][4] = (9 <= n && 4 <= n ? all[sz++] : 999);
g[9][5] = (9 <= n && 5 <= n ? all[sz++] : 999);
g[9][6] = (9 <= n && 6 <= n ? all[sz++] : 999);
g[9][7] = (9 <= n && 7 <= n ? all[sz++] : 999);
g[9][8] = (9 <= n && 8 <= n ? all[sz++] : 999);
g[9][9] = (9 <= n && 9 <= n ? all[sz++] : 999);
g[9][10] = (9 <= n && 10 <= n ? all[sz++] : 999);
g[10][1] = (10 <= n && 1 <= n ? all[sz++] : 999);
g[10][2] = (10 <= n && 2 <= n ? all[sz++] : 999);
g[10][3] = (10 <= n && 3 <= n ? all[sz++] : 999);
g[10][4] = (10 <= n && 4 <= n ? all[sz++] : 999);
g[10][5] = (10 <= n && 5 <= n ? all[sz++] : 999);
g[10][6] = (10 <= n && 6 <= n ? all[sz++] : 999);
g[10][7] = (10 <= n && 7 <= n ? all[sz++] : 999);
g[10][8] = (10 <= n && 8 <= n ? all[sz++] : 999);
g[10][9] = (10 <= n && 9 <= n ? all[sz++] : 999);
g[10][10] = (10 <= n && 10 <= n ? all[sz++] : 999);
g[1][1] = min(g[1][1], g[1][1] + g[1][1]);
g[1][2] = min(g[1][2], g[1][1] + g[1][2]);
g[1][3] = min(g[1][3], g[1][1] + g[1][3]);
g[1][4] = min(g[1][4], g[1][1] + g[1][4]);
g[1][5] = min(g[1][5], g[1][1] + g[1][5]);
g[1][6] = min(g[1][6], g[1][1] + g[1][6]);
g[1][7] = min(g[1][7], g[1][1] + g[1][7]);
g[1][8] = min(g[1][8], g[1][1] + g[1][8]);
g[1][9] = min(g[1][9], g[1][1] + g[1][9]);
g[1][10] = min(g[1][10], g[1][1] + g[1][10]);
g[2][1] = min(g[2][1], g[2][1] + g[1][1]);
g[2][2] = min(g[2][2], g[2][1] + g[1][2]);
g[2][3] = min(g[2][3], g[2][1] + g[1][3]);
g[2][4] = min(g[2][4], g[2][1] + g[1][4]);
g[2][5] = min(g[2][5], g[2][1] + g[1][5]);
g[2][6] = min(g[2][6], g[2][1] + g[1][6]);
g[2][7] = min(g[2][7], g[2][1] + g[1][7]);
g[2][8] = min(g[2][8], g[2][1] + g[1][8]);
g[2][9] = min(g[2][9], g[2][1] + g[1][9]);
g[2][10] = min(g[2][10], g[2][1] + g[1][10]);
g[3][1] = min(g[3][1], g[3][1] + g[1][1]);
g[3][2] = min(g[3][2], g[3][1] + g[1][2]);
g[3][3] = min(g[3][3], g[3][1] + g[1][3]);
g[3][4] = min(g[3][4], g[3][1] + g[1][4]);
g[3][5] = min(g[3][5], g[3][1] + g[1][5]);
g[3][6] = min(g[3][6], g[3][1] + g[1][6]);
g[3][7] = min(g[3][7], g[3][1] + g[1][7]);
g[3][8] = min(g[3][8], g[3][1] + g[1][8]);
g[3][9] = min(g[3][9], g[3][1] + g[1][9]);
g[3][10] = min(g[3][10], g[3][1] + g[1][10]);
g[4][1] = min(g[4][1], g[4][1] + g[1][1]);
g[4][2] = min(g[4][2], g[4][1] + g[1][2]);
g[4][3] = min(g[4][3], g[4][1] + g[1][3]);
g[4][4] = min(g[4][4], g[4][1] + g[1][4]);
g[4][5] = min(g[4][5], g[4][1] + g[1][5]);
g[4][6] = min(g[4][6], g[4][1] + g[1][6]);
g[4][7] = min(g[4][7], g[4][1] + g[1][7]);
g[4][8] = min(g[4][8], g[4][1] + g[1][8]);
g[4][9] = min(g[4][9], g[4][1] + g[1][9]);
g[4][10] = min(g[4][10], g[4][1] + g[1][10]);
g[5][1] = min(g[5][1], g[5][1] + g[1][1]);
g[5][2] = min(g[5][2], g[5][1] + g[1][2]);
g[5][3] = min(g[5][3], g[5][1] + g[1][3]);
g[5][4] = min(g[5][4], g[5][1] + g[1][4]);
g[5][5] = min(g[5][5], g[5][1] + g[1][5]);
g[5][6] = min(g[5][6], g[5][1] + g[1][6]);
g[5][7] = min(g[5][7], g[5][1] + g[1][7]);
g[5][8] = min(g[5][8], g[5][1] + g[1][8]);
g[5][9] = min(g[5][9], g[5][1] + g[1][9]);
g[5][10] = min(g[5][10], g[5][1] + g[1][10]);
g[6][1] = min(g[6][1], g[6][1] + g[1][1]);
g[6][2] = min(g[6][2], g[6][1] + g[1][2]);
g[6][3] = min(g[6][3], g[6][1] + g[1][3]);
g[6][4] = min(g[6][4], g[6][1] + g[1][4]);
g[6][5] = min(g[6][5], g[6][1] + g[1][5]);
g[6][6] = min(g[6][6], g[6][1] + g[1][6]);
g[6][7] = min(g[6][7], g[6][1] + g[1][7]);
g[6][8] = min(g[6][8], g[6][1] + g[1][8]);
g[6][9] = min(g[6][9], g[6][1] + g[1][9]);
g[6][10] = min(g[6][10], g[6][1] + g[1][10]);
g[7][1] = min(g[7][1], g[7][1] + g[1][1]);
g[7][2] = min(g[7][2], g[7][1] + g[1][2]);
g[7][3] = min(g[7][3], g[7][1] + g[1][3]);
g[7][4] = min(g[7][4], g[7][1] + g[1][4]);
g[7][5] = min(g[7][5], g[7][1] + g[1][5]);
g[7][6] = min(g[7][6], g[7][1] + g[1][6]);
g[7][7] = min(g[7][7], g[7][1] + g[1][7]);
g[7][8] = min(g[7][8], g[7][1] + g[1][8]);
g[7][9] = min(g[7][9], g[7][1] + g[1][9]);
g[7][10] = min(g[7][10], g[7][1] + g[1][10]);
g[8][1] = min(g[8][1], g[8][1] + g[1][1]);
g[8][2] = min(g[8][2], g[8][1] + g[1][2]);
g[8][3] = min(g[8][3], g[8][1] + g[1][3]);
g[8][4] = min(g[8][4], g[8][1] + g[1][4]);
g[8][5] = min(g[8][5], g[8][1] + g[1][5]);
g[8][6] = min(g[8][6], g[8][1] + g[1][6]);
g[8][7] = min(g[8][7], g[8][1] + g[1][7]);
g[8][8] = min(g[8][8], g[8][1] + g[1][8]);
g[8][9] = min(g[8][9], g[8][1] + g[1][9]);
g[8][10] = min(g[8][10], g[8][1] + g[1][10]);
g[9][1] = min(g[9][1], g[9][1] + g[1][1]);
g[9][2] = min(g[9][2], g[9][1] + g[1][2]);
g[9][3] = min(g[9][3], g[9][1] + g[1][3]);
g[9][4] = min(g[9][4], g[9][1] + g[1][4]);
g[9][5] = min(g[9][5], g[9][1] + g[1][5]);
g[9][6] = min(g[9][6], g[9][1] + g[1][6]);
g[9][7] = min(g[9][7], g[9][1] + g[1][7]);
g[9][8] = min(g[9][8], g[9][1] + g[1][8]);
g[9][9] = min(g[9][9], g[9][1] + g[1][9]);
g[9][10] = min(g[9][10], g[9][1] + g[1][10]);
g[10][1] = min(g[10][1], g[10][1] + g[1][1]);
g[10][2] = min(g[10][2], g[10][1] + g[1][2]);
g[10][3] = min(g[10][3], g[10][1] + g[1][3]);
g[10][4] = min(g[10][4], g[10][1] + g[1][4]);
g[10][5] = min(g[10][5], g[10][1] + g[1][5]);
g[10][6] = min(g[10][6], g[10][1] + g[1][6]);
g[10][7] = min(g[10][7], g[10][1] + g[1][7]);
g[10][8] = min(g[10][8], g[10][1] + g[1][8]);
g[10][9] = min(g[10][9], g[10][1] + g[1][9]);
g[10][10] = min(g[10][10], g[10][1] + g[1][10]);
g[1][1] = min(g[1][1], g[1][2] + g[2][1]);
g[1][2] = min(g[1][2], g[1][2] + g[2][2]);
g[1][3] = min(g[1][3], g[1][2] + g[2][3]);
g[1][4] = min(g[1][4], g[1][2] + g[2][4]);
g[1][5] = min(g[1][5], g[1][2] + g[2][5]);
g[1][6] = min(g[1][6], g[1][2] + g[2][6]);
g[1][7] = min(g[1][7], g[1][2] + g[2][7]);
g[1][8] = min(g[1][8], g[1][2] + g[2][8]);
g[1][9] = min(g[1][9], g[1][2] + g[2][9]);
g[1][10] = min(g[1][10], g[1][2] + g[2][10]);
g[2][1] = min(g[2][1], g[2][2] + g[2][1]);
g[2][2] = min(g[2][2], g[2][2] + g[2][2]);
g[2][3] = min(g[2][3], g[2][2] + g[2][3]);
g[2][4] = min(g[2][4], g[2][2] + g[2][4]);
g[2][5] = min(g[2][5], g[2][2] + g[2][5]);
g[2][6] = min(g[2][6], g[2][2] + g[2][6]);
g[2][7] = min(g[2][7], g[2][2] + g[2][7]);
g[2][8] = min(g[2][8], g[2][2] + g[2][8]);
g[2][9] = min(g[2][9], g[2][2] + g[2][9]);
g[2][10] = min(g[2][10], g[2][2] + g[2][10]);
g[3][1] = min(g[3][1], g[3][2] + g[2][1]);
g[3][2] = min(g[3][2], g[3][2] + g[2][2]);
g[3][3] = min(g[3][3], g[3][2] + g[2][3]);
g[3][4] = min(g[3][4], g[3][2] + g[2][4]);
g[3][5] = min(g[3][5], g[3][2] + g[2][5]);
g[3][6] = min(g[3][6], g[3][2] + g[2][6]);
g[3][7] = min(g[3][7], g[3][2] + g[2][7]);
g[3][8] = min(g[3][8], g[3][2] + g[2][8]);
g[3][9] = min(g[3][9], g[3][2] + g[2][9]);
g[3][10] = min(g[3][10], g[3][2] + g[2][10]);
g[4][1] = min(g[4][1], g[4][2] + g[2][1]);
g[4][2] = min(g[4][2], g[4][2] + g[2][2]);
g[4][3] = min(g[4][3], g[4][2] + g[2][3]);
g[4][4] = min(g[4][4], g[4][2] + g[2][4]);
g[4][5] = min(g[4][5], g[4][2] + g[2][5]);
g[4][6] = min(g[4][6], g[4][2] + g[2][6]);
g[4][7] = min(g[4][7], g[4][2] + g[2][7]);
g[4][8] = min(g[4][8], g[4][2] + g[2][8]);
g[4][9] = min(g[4][9], g[4][2] + g[2][9]);
g[4][10] = min(g[4][10], g[4][2] + g[2][10]);
g[5][1] = min(g[5][1], g[5][2] + g[2][1]);
g[5][2] = min(g[5][2], g[5][2] + g[2][2]);
g[5][3] = min(g[5][3], g[5][2] + g[2][3]);
g[5][4] = min(g[5][4], g[5][2] + g[2][4]);
g[5][5] = min(g[5][5], g[5][2] + g[2][5]);
g[5][6] = min(g[5][6], g[5][2] + g[2][6]);
g[5][7] = min(g[5][7], g[5][2] + g[2][7]);
g[5][8] = min(g[5][8], g[5][2] + g[2][8]);
g[5][9] = min(g[5][9], g[5][2] + g[2][9]);
g[5][10] = min(g[5][10], g[5][2] + g[2][10]);
g[6][1] = min(g[6][1], g[6][2] + g[2][1]);
g[6][2] = min(g[6][2], g[6][2] + g[2][2]);
g[6][3] = min(g[6][3], g[6][2] + g[2][3]);
g[6][4] = min(g[6][4], g[6][2] + g[2][4]);
g[6][5] = min(g[6][5], g[6][2] + g[2][5]);
g[6][6] = min(g[6][6], g[6][2] + g[2][6]);
g[6][7] = min(g[6][7], g[6][2] + g[2][7]);
g[6][8] = min(g[6][8], g[6][2] + g[2][8]);
g[6][9] = min(g[6][9], g[6][2] + g[2][9]);
g[6][10] = min(g[6][10], g[6][2] + g[2][10]);
g[7][1] = min(g[7][1], g[7][2] + g[2][1]);
g[7][2] = min(g[7][2], g[7][2] + g[2][2]);
g[7][3] = min(g[7][3], g[7][2] + g[2][3]);
g[7][4] = min(g[7][4], g[7][2] + g[2][4]);
g[7][5] = min(g[7][5], g[7][2] + g[2][5]);
g[7][6] = min(g[7][6], g[7][2] + g[2][6]);
g[7][7] = min(g[7][7], g[7][2] + g[2][7]);
g[7][8] = min(g[7][8], g[7][2] + g[2][8]);
g[7][9] = min(g[7][9], g[7][2] + g[2][9]);
g[7][10] = min(g[7][10], g[7][2] + g[2][10]);
g[8][1] = min(g[8][1], g[8][2] + g[2][1]);
g[8][2] = min(g[8][2], g[8][2] + g[2][2]);
g[8][3] = min(g[8][3], g[8][2] + g[2][3]);
g[8][4] = min(g[8][4], g[8][2] + g[2][4]);
g[8][5] = min(g[8][5], g[8][2] + g[2][5]);
g[8][6] = min(g[8][6], g[8][2] + g[2][6]);
g[8][7] = min(g[8][7], g[8][2] + g[2][7]);
g[8][8] = min(g[8][8], g[8][2] + g[2][8]);
g[8][9] = min(g[8][9], g[8][2] + g[2][9]);
g[8][10] = min(g[8][10], g[8][2] + g[2][10]);
g[9][1] = min(g[9][1], g[9][2] + g[2][1]);
g[9][2] = min(g[9][2], g[9][2] + g[2][2]);
g[9][3] = min(g[9][3], g[9][2] + g[2][3]);
g[9][4] = min(g[9][4], g[9][2] + g[2][4]);
g[9][5] = min(g[9][5], g[9][2] + g[2][5]);
g[9][6] = min(g[9][6], g[9][2] + g[2][6]);
g[9][7] = min(g[9][7], g[9][2] + g[2][7]);
g[9][8] = min(g[9][8], g[9][2] + g[2][8]);
g[9][9] = min(g[9][9], g[9][2] + g[2][9]);
g[9][10] = min(g[9][10], g[9][2] + g[2][10]);
g[10][1] = min(g[10][1], g[10][2] + g[2][1]);
g[10][2] = min(g[10][2], g[10][2] + g[2][2]);
g[10][3] = min(g[10][3], g[10][2] + g[2][3]);
g[10][4] = min(g[10][4], g[10][2] + g[2][4]);
g[10][5] = min(g[10][5], g[10][2] + g[2][5]);
g[10][6] = min(g[10][6], g[10][2] + g[2][6]);
g[10][7] = min(g[10][7], g[10][2] + g[2][7]);
g[10][8] = min(g[10][8], g[10][2] + g[2][8]);
g[10][9] = min(g[10][9], g[10][2] + g[2][9]);
g[10][10] = min(g[10][10], g[10][2] + g[2][10]);
g[1][1] = min(g[1][1], g[1][3] + g[3][1]);
g[1][2] = min(g[1][2], g[1][3] + g[3][2]);
g[1][3] = min(g[1][3], g[1][3] + g[3][3]);
g[1][4] = min(g[1][4], g[1][3] + g[3][4]);
g[1][5] = min(g[1][5], g[1][3] + g[3][5]);
g[1][6] = min(g[1][6], g[1][3] + g[3][6]);
g[1][7] = min(g[1][7], g[1][3] + g[3][7]);
g[1][8] = min(g[1][8], g[1][3] + g[3][8]);
g[1][9] = min(g[1][9], g[1][3] + g[3][9]);
g[1][10] = min(g[1][10], g[1][3] + g[3][10]);
g[2][1] = min(g[2][1], g[2][3] + g[3][1]);
g[2][2] = min(g[2][2], g[2][3] + g[3][2]);
g[2][3] = min(g[2][3], g[2][3] + g[3][3]);
g[2][4] = min(g[2][4], g[2][3] + g[3][4]);
g[2][5] = min(g[2][5], g[2][3] + g[3][5]);
g[2][6] = min(g[2][6], g[2][3] + g[3][6]);
g[2][7] = min(g[2][7], g[2][3] + g[3][7]);
g[2][8] = min(g[2][8], g[2][3] + g[3][8]);
g[2][9] = min(g[2][9], g[2][3] + g[3][9]);
g[2][10] = min(g[2][10], g[2][3] + g[3][10]);
g[3][1] = min(g[3][1], g[3][3] + g[3][1]);
g[3][2] = min(g[3][2], g[3][3] + g[3][2]);
g[3][3] = min(g[3][3], g[3][3] + g[3][3]);
g[3][4] = min(g[3][4], g[3][3] + g[3][4]);
g[3][5] = min(g[3][5], g[3][3] + g[3][5]);
g[3][6] = min(g[3][6], g[3][3] + g[3][6]);
g[3][7] = min(g[3][7], g[3][3] + g[3][7]);
g[3][8] = min(g[3][8], g[3][3] + g[3][8]);
g[3][9] = min(g[3][9], g[3][3] + g[3][9]);
g[3][10] = min(g[3][10], g[3][3] + g[3][10]);
g[4][1] = min(g[4][1], g[4][3] + g[3][1]);
g[4][2] = min(g[4][2], g[4][3] + g[3][2]);
g[4][3] = min(g[4][3], g[4][3] + g[3][3]);
g[4][4] = min(g[4][4], g[4][3] + g[3][4]);
g[4][5] = min(g[4][5], g[4][3] + g[3][5]);
g[4][6] = min(g[4][6], g[4][3] + g[3][6]);
g[4][7] = min(g[4][7], g[4][3] + g[3][7]);
g[4][8] = min(g[4][8], g[4][3] + g[3][8]);
g[4][9] = min(g[4][9], g[4][3] + g[3][9]);
g[4][10] = min(g[4][10], g[4][3] + g[3][10]);
g[5][1] = min(g[5][1], g[5][3] + g[3][1]);
g[5][2] = min(g[5][2], g[5][3] + g[3][2]);
g[5][3] = min(g[5][3], g[5][3] + g[3][3]);
g[5][4] = min(g[5][4], g[5][3] + g[3][4]);
g[5][5] = min(g[5][5], g[5][3] + g[3][5]);
g[5][6] = min(g[5][6], g[5][3] + g[3][6]);
g[5][7] = min(g[5][7], g[5][3] + g[3][7]);
g[5][8] = min(g[5][8], g[5][3] + g[3][8]);
g[5][9] = min(g[5][9], g[5][3] + g[3][9]);
g[5][10] = min(g[5][10], g[5][3] + g[3][10]);
g[6][1] = min(g[6][1], g[6][3] + g[3][1]);
g[6][2] = min(g[6][2], g[6][3] + g[3][2]);
g[6][3] = min(g[6][3], g[6][3] + g[3][3]);
g[6][4] = min(g[6][4], g[6][3] + g[3][4]);
g[6][5] = min(g[6][5], g[6][3] + g[3][5]);
g[6][6] = min(g[6][6], g[6][3] + g[3][6]);
g[6][7] = min(g[6][7], g[6][3] + g[3][7]);
g[6][8] = min(g[6][8], g[6][3] + g[3][8]);
g[6][9] = min(g[6][9], g[6][3] + g[3][9]);
g[6][10] = min(g[6][10], g[6][3] + g[3][10]);
g[7][1] = min(g[7][1], g[7][3] + g[3][1]);
g[7][2] = min(g[7][2], g[7][3] + g[3][2]);
g[7][3] = min(g[7][3], g[7][3] + g[3][3]);
g[7][4] = min(g[7][4], g[7][3] + g[3][4]);
g[7][5] = min(g[7][5], g[7][3] + g[3][5]);
g[7][6] = min(g[7][6], g[7][3] + g[3][6]);
g[7][7] = min(g[7][7], g[7][3] + g[3][7]);
g[7][8] = min(g[7][8], g[7][3] + g[3][8]);
g[7][9] = min(g[7][9], g[7][3] + g[3][9]);
g[7][10] = min(g[7][10], g[7][3] + g[3][10]);
g[8][1] = min(g[8][1], g[8][3] + g[3][1]);
g[8][2] = min(g[8][2], g[8][3] + g[3][2]);
g[8][3] = min(g[8][3], g[8][3] + g[3][3]);
g[8][4] = min(g[8][4], g[8][3] + g[3][4]);
g[8][5] = min(g[8][5], g[8][3] + g[3][5]);
g[8][6] = min(g[8][6], g[8][3] + g[3][6]);
g[8][7] = min(g[8][7], g[8][3] + g[3][7]);
g[8][8] = min(g[8][8], g[8][3] + g[3][8]);
g[8][9] = min(g[8][9], g[8][3] + g[3][9]);
g[8][10] = min(g[8][10], g[8][3] + g[3][10]);
g[9][1] = min(g[9][1], g[9][3] + g[3][1]);
g[9][2] = min(g[9][2], g[9][3] + g[3][2]);
g[9][3] = min(g[9][3], g[9][3] + g[3][3]);
g[9][4] = min(g[9][4], g[9][3] + g[3][4]);
g[9][5] = min(g[9][5], g[9][3] + g[3][5]);
g[9][6] = min(g[9][6], g[9][3] + g[3][6]);
g[9][7] = min(g[9][7], g[9][3] + g[3][7]);
g[9][8] = min(g[9][8], g[9][3] + g[3][8]);
g[9][9] = min(g[9][9], g[9][3] + g[3][9]);
g[9][10] = min(g[9][10], g[9][3] + g[3][10]);
g[10][1] = min(g[10][1], g[10][3] + g[3][1]);
g[10][2] = min(g[10][2], g[10][3] + g[3][2]);
g[10][3] = min(g[10][3], g[10][3] + g[3][3]);
g[10][4] = min(g[10][4], g[10][3] + g[3][4]);
g[10][5] = min(g[10][5], g[10][3] + g[3][5]);
g[10][6] = min(g[10][6], g[10][3] + g[3][6]);
g[10][7] = min(g[10][7], g[10][3] + g[3][7]);
g[10][8] = min(g[10][8], g[10][3] + g[3][8]);
g[10][9] = min(g[10][9], g[10][3] + g[3][9]);
g[10][10] = min(g[10][10], g[10][3] + g[3][10]);
g[1][1] = min(g[1][1], g[1][4] + g[4][1]);
g[1][2] = min(g[1][2], g[1][4] + g[4][2]);
g[1][3] = min(g[1][3], g[1][4] + g[4][3]);
g[1][4] = min(g[1][4], g[1][4] + g[4][4]);
g[1][5] = min(g[1][5], g[1][4] + g[4][5]);
g[1][6] = min(g[1][6], g[1][4] + g[4][6]);
g[1][7] = min(g[1][7], g[1][4] + g[4][7]);
g[1][8] = min(g[1][8], g[1][4] + g[4][8]);
g[1][9] = min(g[1][9], g[1][4] + g[4][9]);
g[1][10] = min(g[1][10], g[1][4] + g[4][10]);
g[2][1] = min(g[2][1], g[2][4] + g[4][1]);
g[2][2] = min(g[2][2], g[2][4] + g[4][2]);
g[2][3] = min(g[2][3], g[2][4] + g[4][3]);
g[2][4] = min(g[2][4], g[2][4] + g[4][4]);
g[2][5] = min(g[2][5], g[2][4] + g[4][5]);
g[2][6] = min(g[2][6], g[2][4] + g[4][6]);
g[2][7] = min(g[2][7], g[2][4] + g[4][7]);
g[2][8] = min(g[2][8], g[2][4] + g[4][8]);
g[2][9] = min(g[2][9], g[2][4] + g[4][9]);
g[2][10] = min(g[2][10], g[2][4] + g[4][10]);
g[3][1] = min(g[3][1], g[3][4] + g[4][1]);
g[3][2] = min(g[3][2], g[3][4] + g[4][2]);
g[3][3] = min(g[3][3], g[3][4] + g[4][3]);
g[3][4] = min(g[3][4], g[3][4] + g[4][4]);
g[3][5] = min(g[3][5], g[3][4] + g[4][5]);
g[3][6] = min(g[3][6], g[3][4] + g[4][6]);
g[3][7] = min(g[3][7], g[3][4] + g[4][7]);
g[3][8] = min(g[3][8], g[3][4] + g[4][8]);
g[3][9] = min(g[3][9], g[3][4] + g[4][9]);
g[3][10] = min(g[3][10], g[3][4] + g[4][10]);
g[4][1] = min(g[4][1], g[4][4] + g[4][1]);
g[4][2] = min(g[4][2], g[4][4] + g[4][2]);
g[4][3] = min(g[4][3], g[4][4] + g[4][3]);
g[4][4] = min(g[4][4], g[4][4] + g[4][4]);
g[4][5] = min(g[4][5], g[4][4] + g[4][5]);
g[4][6] = min(g[4][6], g[4][4] + g[4][6]);
g[4][7] = min(g[4][7], g[4][4] + g[4][7]);
g[4][8] = min(g[4][8], g[4][4] + g[4][8]);
g[4][9] = min(g[4][9], g[4][4] + g[4][9]);
g[4][10] = min(g[4][10], g[4][4] + g[4][10]);
g[5][1] = min(g[5][1], g[5][4] + g[4][1]);
g[5][2] = min(g[5][2], g[5][4] + g[4][2]);
g[5][3] = min(g[5][3], g[5][4] + g[4][3]);
g[5][4] = min(g[5][4], g[5][4] + g[4][4]);
g[5][5] = min(g[5][5], g[5][4] + g[4][5]);
g[5][6] = min(g[5][6], g[5][4] + g[4][6]);
g[5][7] = min(g[5][7], g[5][4] + g[4][7]);
g[5][8] = min(g[5][8], g[5][4] + g[4][8]);
g[5][9] = min(g[5][9], g[5][4] + g[4][9]);
g[5][10] = min(g[5][10], g[5][4] + g[4][10]);
g[6][1] = min(g[6][1], g[6][4] + g[4][1]);
g[6][2] = min(g[6][2], g[6][4] + g[4][2]);
g[6][3] = min(g[6][3], g[6][4] + g[4][3]);
g[6][4] = min(g[6][4], g[6][4] + g[4][4]);
g[6][5] = min(g[6][5], g[6][4] + g[4][5]);
g[6][6] = min(g[6][6], g[6][4] + g[4][6]);
g[6][7] = min(g[6][7], g[6][4] + g[4][7]);
g[6][8] = min(g[6][8], g[6][4] + g[4][8]);
g[6][9] = min(g[6][9], g[6][4] + g[4][9]);
g[6][10] = min(g[6][10], g[6][4] + g[4][10]);
g[7][1] = min(g[7][1], g[7][4] + g[4][1]);
g[7][2] = min(g[7][2], g[7][4] + g[4][2]);
g[7][3] = min(g[7][3], g[7][4] + g[4][3]);
g[7][4] = min(g[7][4], g[7][4] + g[4][4]);
g[7][5] = min(g[7][5], g[7][4] + g[4][5]);
g[7][6] = min(g[7][6], g[7][4] + g[4][6]);
g[7][7] = min(g[7][7], g[7][4] + g[4][7]);
g[7][8] = min(g[7][8], g[7][4] + g[4][8]);
g[7][9] = min(g[7][9], g[7][4] + g[4][9]);
g[7][10] = min(g[7][10], g[7][4] + g[4][10]);
g[8][1] = min(g[8][1], g[8][4] + g[4][1]);
g[8][2] = min(g[8][2], g[8][4] + g[4][2]);
g[8][3] = min(g[8][3], g[8][4] + g[4][3]);
g[8][4] = min(g[8][4], g[8][4] + g[4][4]);
g[8][5] = min(g[8][5], g[8][4] + g[4][5]);
g[8][6] = min(g[8][6], g[8][4] + g[4][6]);
g[8][7] = min(g[8][7], g[8][4] + g[4][7]);
g[8][8] = min(g[8][8], g[8][4] + g[4][8]);
g[8][9] = min(g[8][9], g[8][4] + g[4][9]);
g[8][10] = min(g[8][10], g[8][4] + g[4][10]);
g[9][1] = min(g[9][1], g[9][4] + g[4][1]);
g[9][2] = min(g[9][2], g[9][4] + g[4][2]);
g[9][3] = min(g[9][3], g[9][4] + g[4][3]);
g[9][4] = min(g[9][4], g[9][4] + g[4][4]);
g[9][5] = min(g[9][5], g[9][4] + g[4][5]);
g[9][6] = min(g[9][6], g[9][4] + g[4][6]);
g[9][7] = min(g[9][7], g[9][4] + g[4][7]);
g[9][8] = min(g[9][8], g[9][4] + g[4][8]);
g[9][9] = min(g[9][9], g[9][4] + g[4][9]);
g[9][10] = min(g[9][10], g[9][4] + g[4][10]);
g[10][1] = min(g[10][1], g[10][4] + g[4][1]);
g[10][2] = min(g[10][2], g[10][4] + g[4][2]);
g[10][3] = min(g[10][3], g[10][4] + g[4][3]);
g[10][4] = min(g[10][4], g[10][4] + g[4][4]);
g[10][5] = min(g[10][5], g[10][4] + g[4][5]);
g[10][6] = min(g[10][6], g[10][4] + g[4][6]);
g[10][7] = min(g[10][7], g[10][4] + g[4][7]);
g[10][8] = min(g[10][8], g[10][4] + g[4][8]);
g[10][9] = min(g[10][9], g[10][4] + g[4][9]);
g[10][10] = min(g[10][10], g[10][4] + g[4][10]);
g[1][1] = min(g[1][1], g[1][5] + g[5][1]);
g[1][2] = min(g[1][2], g[1][5] + g[5][2]);
g[1][3] = min(g[1][3], g[1][5] + g[5][3]);
g[1][4] = min(g[1][4], g[1][5] + g[5][4]);
g[1][5] = min(g[1][5], g[1][5] + g[5][5]);
g[1][6] = min(g[1][6], g[1][5] + g[5][6]);
g[1][7] = min(g[1][7], g[1][5] + g[5][7]);
g[1][8] = min(g[1][8], g[1][5] + g[5][8]);
g[1][9] = min(g[1][9], g[1][5] + g[5][9]);
g[1][10] = min(g[1][10], g[1][5] + g[5][10]);
g[2][1] = min(g[2][1], g[2][5] + g[5][1]);
g[2][2] = min(g[2][2], g[2][5] + g[5][2]);
g[2][3] = min(g[2][3], g[2][5] + g[5][3]);
g[2][4] = min(g[2][4], g[2][5] + g[5][4]);
g[2][5] = min(g[2][5], g[2][5] + g[5][5]);
g[2][6] = min(g[2][6], g[2][5] + g[5][6]);
g[2][7] = min(g[2][7], g[2][5] + g[5][7]);
g[2][8] = min(g[2][8], g[2][5] + g[5][8]);
g[2][9] = min(g[2][9], g[2][5] + g[5][9]);
g[2][10] = min(g[2][10], g[2][5] + g[5][10]);
g[3][1] = min(g[3][1], g[3][5] + g[5][1]);
g[3][2] = min(g[3][2], g[3][5] + g[5][2]);
g[3][3] = min(g[3][3], g[3][5] + g[5][3]);
g[3][4] = min(g[3][4], g[3][5] + g[5][4]);
g[3][5] = min(g[3][5], g[3][5] + g[5][5]);
g[3][6] = min(g[3][6], g[3][5] + g[5][6]);
g[3][7] = min(g[3][7], g[3][5] + g[5][7]);
g[3][8] = min(g[3][8], g[3][5] + g[5][8]);
g[3][9] = min(g[3][9], g[3][5] + g[5][9]);
g[3][10] = min(g[3][10], g[3][5] + g[5][10]);
g[4][1] = min(g[4][1], g[4][5] + g[5][1]);
g[4][2] = min(g[4][2], g[4][5] + g[5][2]);
g[4][3] = min(g[4][3], g[4][5] + g[5][3]);
g[4][4] = min(g[4][4], g[4][5] + g[5][4]);
g[4][5] = min(g[4][5], g[4][5] + g[5][5]);
g[4][6] = min(g[4][6], g[4][5] + g[5][6]);
g[4][7] = min(g[4][7], g[4][5] + g[5][7]);
g[4][8] = min(g[4][8], g[4][5] + g[5][8]);
g[4][9] = min(g[4][9], g[4][5] + g[5][9]);
g[4][10] = min(g[4][10], g[4][5] + g[5][10]);
g[5][1] = min(g[5][1], g[5][5] + g[5][1]);
g[5][2] = min(g[5][2], g[5][5] + g[5][2]);
g[5][3] = min(g[5][3], g[5][5] + g[5][3]);
g[5][4] = min(g[5][4], g[5][5] + g[5][4]);
g[5][5] = min(g[5][5], g[5][5] + g[5][5]);
g[5][6] = min(g[5][6], g[5][5] + g[5][6]);
g[5][7] = min(g[5][7], g[5][5] + g[5][7]);
g[5][8] = min(g[5][8], g[5][5] + g[5][8]);
g[5][9] = min(g[5][9], g[5][5] + g[5][9]);
g[5][10] = min(g[5][10], g[5][5] + g[5][10]);
g[6][1] = min(g[6][1], g[6][5] + g[5][1]);
g[6][2] = min(g[6][2], g[6][5] + g[5][2]);
g[6][3] = min(g[6][3], g[6][5] + g[5][3]);
g[6][4] = min(g[6][4], g[6][5] + g[5][4]);
g[6][5] = min(g[6][5], g[6][5] + g[5][5]);
g[6][6] = min(g[6][6], g[6][5] + g[5][6]);
g[6][7] = min(g[6][7], g[6][5] + g[5][7]);
g[6][8] = min(g[6][8], g[6][5] + g[5][8]);
g[6][9] = min(g[6][9], g[6][5] + g[5][9]);
g[6][10] = min(g[6][10], g[6][5] + g[5][10]);
g[7][1] = min(g[7][1], g[7][5] + g[5][1]);
g[7][2] = min(g[7][2], g[7][5] + g[5][2]);
g[7][3] = min(g[7][3], g[7][5] + g[5][3]);
g[7][4] = min(g[7][4], g[7][5] + g[5][4]);
g[7][5] = min(g[7][5], g[7][5] + g[5][5]);
g[7][6] = min(g[7][6], g[7][5] + g[5][6]);
g[7][7] = min(g[7][7], g[7][5] + g[5][7]);
g[7][8] = min(g[7][8], g[7][5] + g[5][8]);
g[7][9] = min(g[7][9], g[7][5] + g[5][9]);
g[7][10] = min(g[7][10], g[7][5] + g[5][10]);
g[8][1] = min(g[8][1], g[8][5] + g[5][1]);
g[8][2] = min(g[8][2], g[8][5] + g[5][2]);
g[8][3] = min(g[8][3], g[8][5] + g[5][3]);
g[8][4] = min(g[8][4], g[8][5] + g[5][4]);
g[8][5] = min(g[8][5], g[8][5] + g[5][5]);
g[8][6] = min(g[8][6], g[8][5] + g[5][6]);
g[8][7] = min(g[8][7], g[8][5] + g[5][7]);
g[8][8] = min(g[8][8], g[8][5] + g[5][8]);
g[8][9] = min(g[8][9], g[8][5] + g[5][9]);
g[8][10] = min(g[8][10], g[8][5] + g[5][10]);
g[9][1] = min(g[9][1], g[9][5] + g[5][1]);
g[9][2] = min(g[9][2], g[9][5] + g[5][2]);
g[9][3] = min(g[9][3], g[9][5] + g[5][3]);
g[9][4] = min(g[9][4], g[9][5] + g[5][4]);
g[9][5] = min(g[9][5], g[9][5] + g[5][5]);
g[9][6] = min(g[9][6], g[9][5] + g[5][6]);
g[9][7] = min(g[9][7], g[9][5] + g[5][7]);
g[9][8] = min(g[9][8], g[9][5] + g[5][8]);
g[9][9] = min(g[9][9], g[9][5] + g[5][9]);
g[9][10] = min(g[9][10], g[9][5] + g[5][10]);
g[10][1] = min(g[10][1], g[10][5] + g[5][1]);
g[10][2] = min(g[10][2], g[10][5] + g[5][2]);
g[10][3] = min(g[10][3], g[10][5] + g[5][3]);
g[10][4] = min(g[10][4], g[10][5] + g[5][4]);
g[10][5] = min(g[10][5], g[10][5] + g[5][5]);
g[10][6] = min(g[10][6], g[10][5] + g[5][6]);
g[10][7] = min(g[10][7], g[10][5] + g[5][7]);
g[10][8] = min(g[10][8], g[10][5] + g[5][8]);
g[10][9] = min(g[10][9], g[10][5] + g[5][9]);
g[10][10] = min(g[10][10], g[10][5] + g[5][10]);
g[1][1] = min(g[1][1], g[1][6] + g[6][1]);
g[1][2] = min(g[1][2], g[1][6] + g[6][2]);
g[1][3] = min(g[1][3], g[1][6] + g[6][3]);
g[1][4] = min(g[1][4], g[1][6] + g[6][4]);
g[1][5] = min(g[1][5], g[1][6] + g[6][5]);
g[1][6] = min(g[1][6], g[1][6] + g[6][6]);
g[1][7] = min(g[1][7], g[1][6] + g[6][7]);
g[1][8] = min(g[1][8], g[1][6] + g[6][8]);
g[1][9] = min(g[1][9], g[1][6] + g[6][9]);
g[1][10] = min(g[1][10], g[1][6] + g[6][10]);
g[2][1] = min(g[2][1], g[2][6] + g[6][1]);
g[2][2] = min(g[2][2], g[2][6] + g[6][2]);
g[2][3] = min(g[2][3], g[2][6] + g[6][3]);
g[2][4] = min(g[2][4], g[2][6] + g[6][4]);
g[2][5] = min(g[2][5], g[2][6] + g[6][5]);
g[2][6] = min(g[2][6], g[2][6] + g[6][6]);
g[2][7] = min(g[2][7], g[2][6] + g[6][7]);
g[2][8] = min(g[2][8], g[2][6] + g[6][8]);
g[2][9] = min(g[2][9], g[2][6] + g[6][9]);
g[2][10] = min(g[2][10], g[2][6] + g[6][10]);
g[3][1] = min(g[3][1], g[3][6] + g[6][1]);
g[3][2] = min(g[3][2], g[3][6] + g[6][2]);
g[3][3] = min(g[3][3], g[3][6] + g[6][3]);
g[3][4] = min(g[3][4], g[3][6] + g[6][4]);
g[3][5] = min(g[3][5], g[3][6] + g[6][5]);
g[3][6] = min(g[3][6], g[3][6] + g[6][6]);
g[3][7] = min(g[3][7], g[3][6] + g[6][7]);
g[3][8] = min(g[3][8], g[3][6] + g[6][8]);
g[3][9] = min(g[3][9], g[3][6] + g[6][9]);
g[3][10] = min(g[3][10], g[3][6] + g[6][10]);
g[4][1] = min(g[4][1], g[4][6] + g[6][1]);
g[4][2] = min(g[4][2], g[4][6] + g[6][2]);
g[4][3] = min(g[4][3], g[4][6] + g[6][3]);
g[4][4] = min(g[4][4], g[4][6] + g[6][4]);
g[4][5] = min(g[4][5], g[4][6] + g[6][5]);
g[4][6] = min(g[4][6], g[4][6] + g[6][6]);
g[4][7] = min(g[4][7], g[4][6] + g[6][7]);
g[4][8] = min(g[4][8], g[4][6] + g[6][8]);
g[4][9] = min(g[4][9], g[4][6] + g[6][9]);
g[4][10] = min(g[4][10], g[4][6] + g[6][10]);
g[5][1] = min(g[5][1], g[5][6] + g[6][1]);
g[5][2] = min(g[5][2], g[5][6] + g[6][2]);
g[5][3] = min(g[5][3], g[5][6] + g[6][3]);
g[5][4] = min(g[5][4], g[5][6] + g[6][4]);
g[5][5] = min(g[5][5], g[5][6] + g[6][5]);
g[5][6] = min(g[5][6], g[5][6] + g[6][6]);
g[5][7] = min(g[5][7], g[5][6] + g[6][7]);
g[5][8] = min(g[5][8], g[5][6] + g[6][8]);
g[5][9] = min(g[5][9], g[5][6] + g[6][9]);
g[5][10] = min(g[5][10], g[5][6] + g[6][10]);
g[6][1] = min(g[6][1], g[6][6] + g[6][1]);
g[6][2] = min(g[6][2], g[6][6] + g[6][2]);
g[6][3] = min(g[6][3], g[6][6] + g[6][3]);
g[6][4] = min(g[6][4], g[6][6] + g[6][4]);
g[6][5] = min(g[6][5], g[6][6] + g[6][5]);
g[6][6] = min(g[6][6], g[6][6] + g[6][6]);
g[6][7] = min(g[6][7], g[6][6] + g[6][7]);
g[6][8] = min(g[6][8], g[6][6] + g[6][8]);
g[6][9] = min(g[6][9], g[6][6] + g[6][9]);
g[6][10] = min(g[6][10], g[6][6] + g[6][10]);
g[7][1] = min(g[7][1], g[7][6] + g[6][1]);
g[7][2] = min(g[7][2], g[7][6] + g[6][2]);
g[7][3] = min(g[7][3], g[7][6] + g[6][3]);
g[7][4] = min(g[7][4], g[7][6] + g[6][4]);
g[7][5] = min(g[7][5], g[7][6] + g[6][5]);
g[7][6] = min(g[7][6], g[7][6] + g[6][6]);
g[7][7] = min(g[7][7], g[7][6] + g[6][7]);
g[7][8] = min(g[7][8], g[7][6] + g[6][8]);
g[7][9] = min(g[7][9], g[7][6] + g[6][9]);
g[7][10] = min(g[7][10], g[7][6] + g[6][10]);
g[8][1] = min(g[8][1], g[8][6] + g[6][1]);
g[8][2] = min(g[8][2], g[8][6] + g[6][2]);
g[8][3] = min(g[8][3], g[8][6] + g[6][3]);
g[8][4] = min(g[8][4], g[8][6] + g[6][4]);
g[8][5] = min(g[8][5], g[8][6] + g[6][5]);
g[8][6] = min(g[8][6], g[8][6] + g[6][6]);
g[8][7] = min(g[8][7], g[8][6] + g[6][7]);
g[8][8] = min(g[8][8], g[8][6] + g[6][8]);
g[8][9] = min(g[8][9], g[8][6] + g[6][9]);
g[8][10] = min(g[8][10], g[8][6] + g[6][10]);
g[9][1] = min(g[9][1], g[9][6] + g[6][1]);
g[9][2] = min(g[9][2], g[9][6] + g[6][2]);
g[9][3] = min(g[9][3], g[9][6] + g[6][3]);
g[9][4] = min(g[9][4], g[9][6] + g[6][4]);
g[9][5] = min(g[9][5], g[9][6] + g[6][5]);
g[9][6] = min(g[9][6], g[9][6] + g[6][6]);
g[9][7] = min(g[9][7], g[9][6] + g[6][7]);
g[9][8] = min(g[9][8], g[9][6] + g[6][8]);
g[9][9] = min(g[9][9], g[9][6] + g[6][9]);
g[9][10] = min(g[9][10], g[9][6] + g[6][10]);
g[10][1] = min(g[10][1], g[10][6] + g[6][1]);
g[10][2] = min(g[10][2], g[10][6] + g[6][2]);
g[10][3] = min(g[10][3], g[10][6] + g[6][3]);
g[10][4] = min(g[10][4], g[10][6] + g[6][4]);
g[10][5] = min(g[10][5], g[10][6] + g[6][5]);
g[10][6] = min(g[10][6], g[10][6] + g[6][6]);
g[10][7] = min(g[10][7], g[10][6] + g[6][7]);
g[10][8] = min(g[10][8], g[10][6] + g[6][8]);
g[10][9] = min(g[10][9], g[10][6] + g[6][9]);
g[10][10] = min(g[10][10], g[10][6] + g[6][10]);
g[1][1] = min(g[1][1], g[1][7] + g[7][1]);
g[1][2] = min(g[1][2], g[1][7] + g[7][2]);
g[1][3] = min(g[1][3], g[1][7] + g[7][3]);
g[1][4] = min(g[1][4], g[1][7] + g[7][4]);
g[1][5] = min(g[1][5], g[1][7] + g[7][5]);
g[1][6] = min(g[1][6], g[1][7] + g[7][6]);
g[1][7] = min(g[1][7], g[1][7] + g[7][7]);
g[1][8] = min(g[1][8], g[1][7] + g[7][8]);
g[1][9] = min(g[1][9], g[1][7] + g[7][9]);
g[1][10] = min(g[1][10], g[1][7] + g[7][10]);
g[2][1] = min(g[2][1], g[2][7] + g[7][1]);
g[2][2] = min(g[2][2], g[2][7] + g[7][2]);
g[2][3] = min(g[2][3], g[2][7] + g[7][3]);
g[2][4] = min(g[2][4], g[2][7] + g[7][4]);
g[2][5] = min(g[2][5], g[2][7] + g[7][5]);
g[2][6] = min(g[2][6], g[2][7] + g[7][6]);
g[2][7] = min(g[2][7], g[2][7] + g[7][7]);
g[2][8] = min(g[2][8], g[2][7] + g[7][8]);
g[2][9] = min(g[2][9], g[2][7] + g[7][9]);
g[2][10] = min(g[2][10], g[2][7] + g[7][10]);
g[3][1] = min(g[3][1], g[3][7] + g[7][1]);
g[3][2] = min(g[3][2], g[3][7] + g[7][2]);
g[3][3] = min(g[3][3], g[3][7] + g[7][3]);
g[3][4] = min(g[3][4], g[3][7] + g[7][4]);
g[3][5] = min(g[3][5], g[3][7] + g[7][5]);
g[3][6] = min(g[3][6], g[3][7] + g[7][6]);
g[3][7] = min(g[3][7], g[3][7] + g[7][7]);
g[3][8] = min(g[3][8], g[3][7] + g[7][8]);
g[3][9] = min(g[3][9], g[3][7] + g[7][9]);
g[3][10] = min(g[3][10], g[3][7] + g[7][10]);
g[4][1] = min(g[4][1], g[4][7] + g[7][1]);
g[4][2] = min(g[4][2], g[4][7] + g[7][2]);
g[4][3] = min(g[4][3], g[4][7] + g[7][3]);
g[4][4] = min(g[4][4], g[4][7] + g[7][4]);
g[4][5] = min(g[4][5], g[4][7] + g[7][5]);
g[4][6] = min(g[4][6], g[4][7] + g[7][6]);
g[4][7] = min(g[4][7], g[4][7] + g[7][7]);
g[4][8] = min(g[4][8], g[4][7] + g[7][8]);
g[4][9] = min(g[4][9], g[4][7] + g[7][9]);
g[4][10] = min(g[4][10], g[4][7] + g[7][10]);
g[5][1] = min(g[5][1], g[5][7] + g[7][1]);
g[5][2] = min(g[5][2], g[5][7] + g[7][2]);
g[5][3] = min(g[5][3], g[5][7] + g[7][3]);
g[5][4] = min(g[5][4], g[5][7] + g[7][4]);
g[5][5] = min(g[5][5], g[5][7] + g[7][5]);
g[5][6] = min(g[5][6], g[5][7] + g[7][6]);
g[5][7] = min(g[5][7], g[5][7] + g[7][7]);
g[5][8] = min(g[5][8], g[5][7] + g[7][8]);
g[5][9] = min(g[5][9], g[5][7] + g[7][9]);
g[5][10] = min(g[5][10], g[5][7] + g[7][10]);
g[6][1] = min(g[6][1], g[6][7] + g[7][1]);
g[6][2] = min(g[6][2], g[6][7] + g[7][2]);
g[6][3] = min(g[6][3], g[6][7] + g[7][3]);
g[6][4] = min(g[6][4], g[6][7] + g[7][4]);
g[6][5] = min(g[6][5], g[6][7] + g[7][5]);
g[6][6] = min(g[6][6], g[6][7] + g[7][6]);
g[6][7] = min(g[6][7], g[6][7] + g[7][7]);
g[6][8] = min(g[6][8], g[6][7] + g[7][8]);
g[6][9] = min(g[6][9], g[6][7] + g[7][9]);
g[6][10] = min(g[6][10], g[6][7] + g[7][10]);
g[7][1] = min(g[7][1], g[7][7] + g[7][1]);
g[7][2] = min(g[7][2], g[7][7] + g[7][2]);
g[7][3] = min(g[7][3], g[7][7] + g[7][3]);
g[7][4] = min(g[7][4], g[7][7] + g[7][4]);
g[7][5] = min(g[7][5], g[7][7] + g[7][5]);
g[7][6] = min(g[7][6], g[7][7] + g[7][6]);
g[7][7] = min(g[7][7], g[7][7] + g[7][7]);
g[7][8] = min(g[7][8], g[7][7] + g[7][8]);
g[7][9] = min(g[7][9], g[7][7] + g[7][9]);
g[7][10] = min(g[7][10], g[7][7] + g[7][10]);
g[8][1] = min(g[8][1], g[8][7] + g[7][1]);
g[8][2] = min(g[8][2], g[8][7] + g[7][2]);
g[8][3] = min(g[8][3], g[8][7] + g[7][3]);
g[8][4] = min(g[8][4], g[8][7] + g[7][4]);
g[8][5] = min(g[8][5], g[8][7] + g[7][5]);
g[8][6] = min(g[8][6], g[8][7] + g[7][6]);
g[8][7] = min(g[8][7], g[8][7] + g[7][7]);
g[8][8] = min(g[8][8], g[8][7] + g[7][8]);
g[8][9] = min(g[8][9], g[8][7] + g[7][9]);
g[8][10] = min(g[8][10], g[8][7] + g[7][10]);
g[9][1] = min(g[9][1], g[9][7] + g[7][1]);
g[9][2] = min(g[9][2], g[9][7] + g[7][2]);
g[9][3] = min(g[9][3], g[9][7] + g[7][3]);
g[9][4] = min(g[9][4], g[9][7] + g[7][4]);
g[9][5] = min(g[9][5], g[9][7] + g[7][5]);
g[9][6] = min(g[9][6], g[9][7] + g[7][6]);
g[9][7] = min(g[9][7], g[9][7] + g[7][7]);
g[9][8] = min(g[9][8], g[9][7] + g[7][8]);
g[9][9] = min(g[9][9], g[9][7] + g[7][9]);
g[9][10] = min(g[9][10], g[9][7] + g[7][10]);
g[10][1] = min(g[10][1], g[10][7] + g[7][1]);
g[10][2] = min(g[10][2], g[10][7] + g[7][2]);
g[10][3] = min(g[10][3], g[10][7] + g[7][3]);
g[10][4] = min(g[10][4], g[10][7] + g[7][4]);
g[10][5] = min(g[10][5], g[10][7] + g[7][5]);
g[10][6] = min(g[10][6], g[10][7] + g[7][6]);
g[10][7] = min(g[10][7], g[10][7] + g[7][7]);
g[10][8] = min(g[10][8], g[10][7] + g[7][8]);
g[10][9] = min(g[10][9], g[10][7] + g[7][9]);
g[10][10] = min(g[10][10], g[10][7] + g[7][10]);
g[1][1] = min(g[1][1], g[1][8] + g[8][1]);
g[1][2] = min(g[1][2], g[1][8] + g[8][2]);
g[1][3] = min(g[1][3], g[1][8] + g[8][3]);
g[1][4] = min(g[1][4], g[1][8] + g[8][4]);
g[1][5] = min(g[1][5], g[1][8] + g[8][5]);
g[1][6] = min(g[1][6], g[1][8] + g[8][6]);
g[1][7] = min(g[1][7], g[1][8] + g[8][7]);
g[1][8] = min(g[1][8], g[1][8] + g[8][8]);
g[1][9] = min(g[1][9], g[1][8] + g[8][9]);
g[1][10] = min(g[1][10], g[1][8] + g[8][10]);
g[2][1] = min(g[2][1], g[2][8] + g[8][1]);
g[2][2] = min(g[2][2], g[2][8] + g[8][2]);
g[2][3] = min(g[2][3], g[2][8] + g[8][3]);
g[2][4] = min(g[2][4], g[2][8] + g[8][4]);
g[2][5] = min(g[2][5], g[2][8] + g[8][5]);
g[2][6] = min(g[2][6], g[2][8] + g[8][6]);
g[2][7] = min(g[2][7], g[2][8] + g[8][7]);
g[2][8] = min(g[2][8], g[2][8] + g[8][8]);
g[2][9] = min(g[2][9], g[2][8] + g[8][9]);
g[2][10] = min(g[2][10], g[2][8] + g[8][10]);
g[3][1] = min(g[3][1], g[3][8] + g[8][1]);
g[3][2] = min(g[3][2], g[3][8] + g[8][2]);
g[3][3] = min(g[3][3], g[3][8] + g[8][3]);
g[3][4] = min(g[3][4], g[3][8] + g[8][4]);
g[3][5] = min(g[3][5], g[3][8] + g[8][5]);
g[3][6] = min(g[3][6], g[3][8] + g[8][6]);
g[3][7] = min(g[3][7], g[3][8] + g[8][7]);
g[3][8] = min(g[3][8], g[3][8] + g[8][8]);
g[3][9] = min(g[3][9], g[3][8] + g[8][9]);
g[3][10] = min(g[3][10], g[3][8] + g[8][10]);
g[4][1] = min(g[4][1], g[4][8] + g[8][1]);
g[4][2] = min(g[4][2], g[4][8] + g[8][2]);
g[4][3] = min(g[4][3], g[4][8] + g[8][3]);
g[4][4] = min(g[4][4], g[4][8] + g[8][4]);
g[4][5] = min(g[4][5], g[4][8] + g[8][5]);
g[4][6] = min(g[4][6], g[4][8] + g[8][6]);
g[4][7] = min(g[4][7], g[4][8] + g[8][7]);
g[4][8] = min(g[4][8], g[4][8] + g[8][8]);
g[4][9] = min(g[4][9], g[4][8] + g[8][9]);
g[4][10] = min(g[4][10], g[4][8] + g[8][10]);
g[5][1] = min(g[5][1], g[5][8] + g[8][1]);
g[5][2] = min(g[5][2], g[5][8] + g[8][2]);
g[5][3] = min(g[5][3], g[5][8] + g[8][3]);
g[5][4] = min(g[5][4], g[5][8] + g[8][4]);
g[5][5] = min(g[5][5], g[5][8] + g[8][5]);
g[5][6] = min(g[5][6], g[5][8] + g[8][6]);
g[5][7] = min(g[5][7], g[5][8] + g[8][7]);
g[5][8] = min(g[5][8], g[5][8] + g[8][8]);
g[5][9] = min(g[5][9], g[5][8] + g[8][9]);
g[5][10] = min(g[5][10], g[5][8] + g[8][10]);
g[6][1] = min(g[6][1], g[6][8] + g[8][1]);
g[6][2] = min(g[6][2], g[6][8] + g[8][2]);
g[6][3] = min(g[6][3], g[6][8] + g[8][3]);
g[6][4] = min(g[6][4], g[6][8] + g[8][4]);
g[6][5] = min(g[6][5], g[6][8] + g[8][5]);
g[6][6] = min(g[6][6], g[6][8] + g[8][6]);
g[6][7] = min(g[6][7], g[6][8] + g[8][7]);
g[6][8] = min(g[6][8], g[6][8] + g[8][8]);
g[6][9] = min(g[6][9], g[6][8] + g[8][9]);
g[6][10] = min(g[6][10], g[6][8] + g[8][10]);
g[7][1] = min(g[7][1], g[7][8] + g[8][1]);
g[7][2] = min(g[7][2], g[7][8] + g[8][2]);
g[7][3] = min(g[7][3], g[7][8] + g[8][3]);
g[7][4] = min(g[7][4], g[7][8] + g[8][4]);
g[7][5] = min(g[7][5], g[7][8] + g[8][5]);
g[7][6] = min(g[7][6], g[7][8] + g[8][6]);
g[7][7] = min(g[7][7], g[7][8] + g[8][7]);
g[7][8] = min(g[7][8], g[7][8] + g[8][8]);
g[7][9] = min(g[7][9], g[7][8] + g[8][9]);
g[7][10] = min(g[7][10], g[7][8] + g[8][10]);
g[8][1] = min(g[8][1], g[8][8] + g[8][1]);
g[8][2] = min(g[8][2], g[8][8] + g[8][2]);
g[8][3] = min(g[8][3], g[8][8] + g[8][3]);
g[8][4] = min(g[8][4], g[8][8] + g[8][4]);
g[8][5] = min(g[8][5], g[8][8] + g[8][5]);
g[8][6] = min(g[8][6], g[8][8] + g[8][6]);
g[8][7] = min(g[8][7], g[8][8] + g[8][7]);
g[8][8] = min(g[8][8], g[8][8] + g[8][8]);
g[8][9] = min(g[8][9], g[8][8] + g[8][9]);
g[8][10] = min(g[8][10], g[8][8] + g[8][10]);
g[9][1] = min(g[9][1], g[9][8] + g[8][1]);
g[9][2] = min(g[9][2], g[9][8] + g[8][2]);
g[9][3] = min(g[9][3], g[9][8] + g[8][3]);
g[9][4] = min(g[9][4], g[9][8] + g[8][4]);
g[9][5] = min(g[9][5], g[9][8] + g[8][5]);
g[9][6] = min(g[9][6], g[9][8] + g[8][6]);
g[9][7] = min(g[9][7], g[9][8] + g[8][7]);
g[9][8] = min(g[9][8], g[9][8] + g[8][8]);
g[9][9] = min(g[9][9], g[9][8] + g[8][9]);
g[9][10] = min(g[9][10], g[9][8] + g[8][10]);
g[10][1] = min(g[10][1], g[10][8] + g[8][1]);
g[10][2] = min(g[10][2], g[10][8] + g[8][2]);
g[10][3] = min(g[10][3], g[10][8] + g[8][3]);
g[10][4] = min(g[10][4], g[10][8] + g[8][4]);
g[10][5] = min(g[10][5], g[10][8] + g[8][5]);
g[10][6] = min(g[10][6], g[10][8] + g[8][6]);
g[10][7] = min(g[10][7], g[10][8] + g[8][7]);
g[10][8] = min(g[10][8], g[10][8] + g[8][8]);
g[10][9] = min(g[10][9], g[10][8] + g[8][9]);
g[10][10] = min(g[10][10], g[10][8] + g[8][10]);
g[1][1] = min(g[1][1], g[1][9] + g[9][1]);
g[1][2] = min(g[1][2], g[1][9] + g[9][2]);
g[1][3] = min(g[1][3], g[1][9] + g[9][3]);
g[1][4] = min(g[1][4], g[1][9] + g[9][4]);
g[1][5] = min(g[1][5], g[1][9] + g[9][5]);
g[1][6] = min(g[1][6], g[1][9] + g[9][6]);
g[1][7] = min(g[1][7], g[1][9] + g[9][7]);
g[1][8] = min(g[1][8], g[1][9] + g[9][8]);
g[1][9] = min(g[1][9], g[1][9] + g[9][9]);
g[1][10] = min(g[1][10], g[1][9] + g[9][10]);
g[2][1] = min(g[2][1], g[2][9] + g[9][1]);
g[2][2] = min(g[2][2], g[2][9] + g[9][2]);
g[2][3] = min(g[2][3], g[2][9] + g[9][3]);
g[2][4] = min(g[2][4], g[2][9] + g[9][4]);
g[2][5] = min(g[2][5], g[2][9] + g[9][5]);
g[2][6] = min(g[2][6], g[2][9] + g[9][6]);
g[2][7] = min(g[2][7], g[2][9] + g[9][7]);
g[2][8] = min(g[2][8], g[2][9] + g[9][8]);
g[2][9] = min(g[2][9], g[2][9] + g[9][9]);
g[2][10] = min(g[2][10], g[2][9] + g[9][10]);
g[3][1] = min(g[3][1], g[3][9] + g[9][1]);
g[3][2] = min(g[3][2], g[3][9] + g[9][2]);
g[3][3] = min(g[3][3], g[3][9] + g[9][3]);
g[3][4] = min(g[3][4], g[3][9] + g[9][4]);
g[3][5] = min(g[3][5], g[3][9] + g[9][5]);
g[3][6] = min(g[3][6], g[3][9] + g[9][6]);
g[3][7] = min(g[3][7], g[3][9] + g[9][7]);
g[3][8] = min(g[3][8], g[3][9] + g[9][8]);
g[3][9] = min(g[3][9], g[3][9] + g[9][9]);
g[3][10] = min(g[3][10], g[3][9] + g[9][10]);
g[4][1] = min(g[4][1], g[4][9] + g[9][1]);
g[4][2] = min(g[4][2], g[4][9] + g[9][2]);
g[4][3] = min(g[4][3], g[4][9] + g[9][3]);
g[4][4] = min(g[4][4], g[4][9] + g[9][4]);
g[4][5] = min(g[4][5], g[4][9] + g[9][5]);
g[4][6] = min(g[4][6], g[4][9] + g[9][6]);
g[4][7] = min(g[4][7], g[4][9] + g[9][7]);
g[4][8] = min(g[4][8], g[4][9] + g[9][8]);
g[4][9] = min(g[4][9], g[4][9] + g[9][9]);
g[4][10] = min(g[4][10], g[4][9] + g[9][10]);
g[5][1] = min(g[5][1], g[5][9] + g[9][1]);
g[5][2] = min(g[5][2], g[5][9] + g[9][2]);
g[5][3] = min(g[5][3], g[5][9] + g[9][3]);
g[5][4] = min(g[5][4], g[5][9] + g[9][4]);
g[5][5] = min(g[5][5], g[5][9] + g[9][5]);
g[5][6] = min(g[5][6], g[5][9] + g[9][6]);
g[5][7] = min(g[5][7], g[5][9] + g[9][7]);
g[5][8] = min(g[5][8], g[5][9] + g[9][8]);
g[5][9] = min(g[5][9], g[5][9] + g[9][9]);
g[5][10] = min(g[5][10], g[5][9] + g[9][10]);
g[6][1] = min(g[6][1], g[6][9] + g[9][1]);
g[6][2] = min(g[6][2], g[6][9] + g[9][2]);
g[6][3] = min(g[6][3], g[6][9] + g[9][3]);
g[6][4] = min(g[6][4], g[6][9] + g[9][4]);
g[6][5] = min(g[6][5], g[6][9] + g[9][5]);
g[6][6] = min(g[6][6], g[6][9] + g[9][6]);
g[6][7] = min(g[6][7], g[6][9] + g[9][7]);
g[6][8] = min(g[6][8], g[6][9] + g[9][8]);
g[6][9] = min(g[6][9], g[6][9] + g[9][9]);
g[6][10] = min(g[6][10], g[6][9] + g[9][10]);
g[7][1] = min(g[7][1], g[7][9] + g[9][1]);
g[7][2] = min(g[7][2], g[7][9] + g[9][2]);
g[7][3] = min(g[7][3], g[7][9] + g[9][3]);
g[7][4] = min(g[7][4], g[7][9] + g[9][4]);
g[7][5] = min(g[7][5], g[7][9] + g[9][5]);
g[7][6] = min(g[7][6], g[7][9] + g[9][6]);
g[7][7] = min(g[7][7], g[7][9] + g[9][7]);
g[7][8] = min(g[7][8], g[7][9] + g[9][8]);
g[7][9] = min(g[7][9], g[7][9] + g[9][9]);
g[7][10] = min(g[7][10], g[7][9] + g[9][10]);
g[8][1] = min(g[8][1], g[8][9] + g[9][1]);
g[8][2] = min(g[8][2], g[8][9] + g[9][2]);
g[8][3] = min(g[8][3], g[8][9] + g[9][3]);
g[8][4] = min(g[8][4], g[8][9] + g[9][4]);
g[8][5] = min(g[8][5], g[8][9] + g[9][5]);
g[8][6] = min(g[8][6], g[8][9] + g[9][6]);
g[8][7] = min(g[8][7], g[8][9] + g[9][7]);
g[8][8] = min(g[8][8], g[8][9] + g[9][8]);
g[8][9] = min(g[8][9], g[8][9] + g[9][9]);
g[8][10] = min(g[8][10], g[8][9] + g[9][10]);
g[9][1] = min(g[9][1], g[9][9] + g[9][1]);
g[9][2] = min(g[9][2], g[9][9] + g[9][2]);
g[9][3] = min(g[9][3], g[9][9] + g[9][3]);
g[9][4] = min(g[9][4], g[9][9] + g[9][4]);
g[9][5] = min(g[9][5], g[9][9] + g[9][5]);
g[9][6] = min(g[9][6], g[9][9] + g[9][6]);
g[9][7] = min(g[9][7], g[9][9] + g[9][7]);
g[9][8] = min(g[9][8], g[9][9] + g[9][8]);
g[9][9] = min(g[9][9], g[9][9] + g[9][9]);
g[9][10] = min(g[9][10], g[9][9] + g[9][10]);
g[10][1] = min(g[10][1], g[10][9] + g[9][1]);
g[10][2] = min(g[10][2], g[10][9] + g[9][2]);
g[10][3] = min(g[10][3], g[10][9] + g[9][3]);
g[10][4] = min(g[10][4], g[10][9] + g[9][4]);
g[10][5] = min(g[10][5], g[10][9] + g[9][5]);
g[10][6] = min(g[10][6], g[10][9] + g[9][6]);
g[10][7] = min(g[10][7], g[10][9] + g[9][7]);
g[10][8] = min(g[10][8], g[10][9] + g[9][8]);
g[10][9] = min(g[10][9], g[10][9] + g[9][9]);
g[10][10] = min(g[10][10], g[10][9] + g[9][10]);
g[1][1] = min(g[1][1], g[1][10] + g[10][1]);
g[1][2] = min(g[1][2], g[1][10] + g[10][2]);
g[1][3] = min(g[1][3], g[1][10] + g[10][3]);
g[1][4] = min(g[1][4], g[1][10] + g[10][4]);
g[1][5] = min(g[1][5], g[1][10] + g[10][5]);
g[1][6] = min(g[1][6], g[1][10] + g[10][6]);
g[1][7] = min(g[1][7], g[1][10] + g[10][7]);
g[1][8] = min(g[1][8], g[1][10] + g[10][8]);
g[1][9] = min(g[1][9], g[1][10] + g[10][9]);
g[1][10] = min(g[1][10], g[1][10] + g[10][10]);
g[2][1] = min(g[2][1], g[2][10] + g[10][1]);
g[2][2] = min(g[2][2], g[2][10] + g[10][2]);
g[2][3] = min(g[2][3], g[2][10] + g[10][3]);
g[2][4] = min(g[2][4], g[2][10] + g[10][4]);
g[2][5] = min(g[2][5], g[2][10] + g[10][5]);
g[2][6] = min(g[2][6], g[2][10] + g[10][6]);
g[2][7] = min(g[2][7], g[2][10] + g[10][7]);
g[2][8] = min(g[2][8], g[2][10] + g[10][8]);
g[2][9] = min(g[2][9], g[2][10] + g[10][9]);
g[2][10] = min(g[2][10], g[2][10] + g[10][10]);
g[3][1] = min(g[3][1], g[3][10] + g[10][1]);
g[3][2] = min(g[3][2], g[3][10] + g[10][2]);
g[3][3] = min(g[3][3], g[3][10] + g[10][3]);
g[3][4] = min(g[3][4], g[3][10] + g[10][4]);
g[3][5] = min(g[3][5], g[3][10] + g[10][5]);
g[3][6] = min(g[3][6], g[3][10] + g[10][6]);
g[3][7] = min(g[3][7], g[3][10] + g[10][7]);
g[3][8] = min(g[3][8], g[3][10] + g[10][8]);
g[3][9] = min(g[3][9], g[3][10] + g[10][9]);
g[3][10] = min(g[3][10], g[3][10] + g[10][10]);
g[4][1] = min(g[4][1], g[4][10] + g[10][1]);
g[4][2] = min(g[4][2], g[4][10] + g[10][2]);
g[4][3] = min(g[4][3], g[4][10] + g[10][3]);
g[4][4] = min(g[4][4], g[4][10] + g[10][4]);
g[4][5] = min(g[4][5], g[4][10] + g[10][5]);
g[4][6] = min(g[4][6], g[4][10] + g[10][6]);
g[4][7] = min(g[4][7], g[4][10] + g[10][7]);
g[4][8] = min(g[4][8], g[4][10] + g[10][8]);
g[4][9] = min(g[4][9], g[4][10] + g[10][9]);
g[4][10] = min(g[4][10], g[4][10] + g[10][10]);
g[5][1] = min(g[5][1], g[5][10] + g[10][1]);
g[5][2] = min(g[5][2], g[5][10] + g[10][2]);
g[5][3] = min(g[5][3], g[5][10] + g[10][3]);
g[5][4] = min(g[5][4], g[5][10] + g[10][4]);
g[5][5] = min(g[5][5], g[5][10] + g[10][5]);
g[5][6] = min(g[5][6], g[5][10] + g[10][6]);
g[5][7] = min(g[5][7], g[5][10] + g[10][7]);
g[5][8] = min(g[5][8], g[5][10] + g[10][8]);
g[5][9] = min(g[5][9], g[5][10] + g[10][9]);
g[5][10] = min(g[5][10], g[5][10] + g[10][10]);
g[6][1] = min(g[6][1], g[6][10] + g[10][1]);
g[6][2] = min(g[6][2], g[6][10] + g[10][2]);
g[6][3] = min(g[6][3], g[6][10] + g[10][3]);
g[6][4] = min(g[6][4], g[6][10] + g[10][4]);
g[6][5] = min(g[6][5], g[6][10] + g[10][5]);
g[6][6] = min(g[6][6], g[6][10] + g[10][6]);
g[6][7] = min(g[6][7], g[6][10] + g[10][7]);
g[6][8] = min(g[6][8], g[6][10] + g[10][8]);
g[6][9] = min(g[6][9], g[6][10] + g[10][9]);
g[6][10] = min(g[6][10], g[6][10] + g[10][10]);
g[7][1] = min(g[7][1], g[7][10] + g[10][1]);
g[7][2] = min(g[7][2], g[7][10] + g[10][2]);
g[7][3] = min(g[7][3], g[7][10] + g[10][3]);
g[7][4] = min(g[7][4], g[7][10] + g[10][4]);
g[7][5] = min(g[7][5], g[7][10] + g[10][5]);
g[7][6] = min(g[7][6], g[7][10] + g[10][6]);
g[7][7] = min(g[7][7], g[7][10] + g[10][7]);
g[7][8] = min(g[7][8], g[7][10] + g[10][8]);
g[7][9] = min(g[7][9], g[7][10] + g[10][9]);
g[7][10] = min(g[7][10], g[7][10] + g[10][10]);
g[8][1] = min(g[8][1], g[8][10] + g[10][1]);
g[8][2] = min(g[8][2], g[8][10] + g[10][2]);
g[8][3] = min(g[8][3], g[8][10] + g[10][3]);
g[8][4] = min(g[8][4], g[8][10] + g[10][4]);
g[8][5] = min(g[8][5], g[8][10] + g[10][5]);
g[8][6] = min(g[8][6], g[8][10] + g[10][6]);
g[8][7] = min(g[8][7], g[8][10] + g[10][7]);
g[8][8] = min(g[8][8], g[8][10] + g[10][8]);
g[8][9] = min(g[8][9], g[8][10] + g[10][9]);
g[8][10] = min(g[8][10], g[8][10] + g[10][10]);
g[9][1] = min(g[9][1], g[9][10] + g[10][1]);
g[9][2] = min(g[9][2], g[9][10] + g[10][2]);
g[9][3] = min(g[9][3], g[9][10] + g[10][3]);
g[9][4] = min(g[9][4], g[9][10] + g[10][4]);
g[9][5] = min(g[9][5], g[9][10] + g[10][5]);
g[9][6] = min(g[9][6], g[9][10] + g[10][6]);
g[9][7] = min(g[9][7], g[9][10] + g[10][7]);
g[9][8] = min(g[9][8], g[9][10] + g[10][8]);
g[9][9] = min(g[9][9], g[9][10] + g[10][9]);
g[9][10] = min(g[9][10], g[9][10] + g[10][10]);
g[10][1] = min(g[10][1], g[10][10] + g[10][1]);
g[10][2] = min(g[10][2], g[10][10] + g[10][2]);
g[10][3] = min(g[10][3], g[10][10] + g[10][3]);
g[10][4] = min(g[10][4], g[10][10] + g[10][4]);
g[10][5] = min(g[10][5], g[10][10] + g[10][5]);
g[10][6] = min(g[10][6], g[10][10] + g[10][6]);
g[10][7] = min(g[10][7], g[10][10] + g[10][7]);
g[10][8] = min(g[10][8], g[10][10] + g[10][8]);
g[10][9] = min(g[10][9], g[10][10] + g[10][9]);
g[10][10] = min(g[10][10], g[10][10] + g[10][10]);
int ans = 0;
ans = (1 <= n && 1 <= n ? max(ans, g[1][1]) : ans);
ans = (1 <= n && 2 <= n ? max(ans, g[1][2]) : ans);
ans = (1 <= n && 3 <= n ? max(ans, g[1][3]) : ans);
ans = (1 <= n && 4 <= n ? max(ans, g[1][4]) : ans);
ans = (1 <= n && 5 <= n ? max(ans, g[1][5]) : ans);
ans = (1 <= n && 6 <= n ? max(ans, g[1][6]) : ans);
ans = (1 <= n && 7 <= n ? max(ans, g[1][7]) : ans);
ans = (1 <= n && 8 <= n ? max(ans, g[1][8]) : ans);
ans = (1 <= n && 9 <= n ? max(ans, g[1][9]) : ans);
ans = (1 <= n && 10 <= n ? max(ans, g[1][10]) : ans);
ans = (2 <= n && 1 <= n ? max(ans, g[2][1]) : ans);
ans = (2 <= n && 2 <= n ? max(ans, g[2][2]) : ans);
ans = (2 <= n && 3 <= n ? max(ans, g[2][3]) : ans);
ans = (2 <= n && 4 <= n ? max(ans, g[2][4]) : ans);
ans = (2 <= n && 5 <= n ? max(ans, g[2][5]) : ans);
ans = (2 <= n && 6 <= n ? max(ans, g[2][6]) : ans);
ans = (2 <= n && 7 <= n ? max(ans, g[2][7]) : ans);
ans = (2 <= n && 8 <= n ? max(ans, g[2][8]) : ans);
ans = (2 <= n && 9 <= n ? max(ans, g[2][9]) : ans);
ans = (2 <= n && 10 <= n ? max(ans, g[2][10]) : ans);
ans = (3 <= n && 1 <= n ? max(ans, g[3][1]) : ans);
ans = (3 <= n && 2 <= n ? max(ans, g[3][2]) : ans);
ans = (3 <= n && 3 <= n ? max(ans, g[3][3]) : ans);
ans = (3 <= n && 4 <= n ? max(ans, g[3][4]) : ans);
ans = (3 <= n && 5 <= n ? max(ans, g[3][5]) : ans);
ans = (3 <= n && 6 <= n ? max(ans, g[3][6]) : ans);
ans = (3 <= n && 7 <= n ? max(ans, g[3][7]) : ans);
ans = (3 <= n && 8 <= n ? max(ans, g[3][8]) : ans);
ans = (3 <= n && 9 <= n ? max(ans, g[3][9]) : ans);
ans = (3 <= n && 10 <= n ? max(ans, g[3][10]) : ans);
ans = (4 <= n && 1 <= n ? max(ans, g[4][1]) : ans);
ans = (4 <= n && 2 <= n ? max(ans, g[4][2]) : ans);
ans = (4 <= n && 3 <= n ? max(ans, g[4][3]) : ans);
ans = (4 <= n && 4 <= n ? max(ans, g[4][4]) : ans);
ans = (4 <= n && 5 <= n ? max(ans, g[4][5]) : ans);
ans = (4 <= n && 6 <= n ? max(ans, g[4][6]) : ans);
ans = (4 <= n && 7 <= n ? max(ans, g[4][7]) : ans);
ans = (4 <= n && 8 <= n ? max(ans, g[4][8]) : ans);
ans = (4 <= n && 9 <= n ? max(ans, g[4][9]) : ans);
ans = (4 <= n && 10 <= n ? max(ans, g[4][10]) : ans);
ans = (5 <= n && 1 <= n ? max(ans, g[5][1]) : ans);
ans = (5 <= n && 2 <= n ? max(ans, g[5][2]) : ans);
ans = (5 <= n && 3 <= n ? max(ans, g[5][3]) : ans);
ans = (5 <= n && 4 <= n ? max(ans, g[5][4]) : ans);
ans = (5 <= n && 5 <= n ? max(ans, g[5][5]) : ans);
ans = (5 <= n && 6 <= n ? max(ans, g[5][6]) : ans);
ans = (5 <= n && 7 <= n ? max(ans, g[5][7]) : ans);
ans = (5 <= n && 8 <= n ? max(ans, g[5][8]) : ans);
ans = (5 <= n && 9 <= n ? max(ans, g[5][9]) : ans);
ans = (5 <= n && 10 <= n ? max(ans, g[5][10]) : ans);
ans = (6 <= n && 1 <= n ? max(ans, g[6][1]) : ans);
ans = (6 <= n && 2 <= n ? max(ans, g[6][2]) : ans);
ans = (6 <= n && 3 <= n ? max(ans, g[6][3]) : ans);
ans = (6 <= n && 4 <= n ? max(ans, g[6][4]) : ans);
ans = (6 <= n && 5 <= n ? max(ans, g[6][5]) : ans);
ans = (6 <= n && 6 <= n ? max(ans, g[6][6]) : ans);
ans = (6 <= n && 7 <= n ? max(ans, g[6][7]) : ans);
ans = (6 <= n && 8 <= n ? max(ans, g[6][8]) : ans);
ans = (6 <= n && 9 <= n ? max(ans, g[6][9]) : ans);
ans = (6 <= n && 10 <= n ? max(ans, g[6][10]) : ans);
ans = (7 <= n && 1 <= n ? max(ans, g[7][1]) : ans);
ans = (7 <= n && 2 <= n ? max(ans, g[7][2]) : ans);
ans = (7 <= n && 3 <= n ? max(ans, g[7][3]) : ans);
ans = (7 <= n && 4 <= n ? max(ans, g[7][4]) : ans);
ans = (7 <= n && 5 <= n ? max(ans, g[7][5]) : ans);
ans = (7 <= n && 6 <= n ? max(ans, g[7][6]) : ans);
ans = (7 <= n && 7 <= n ? max(ans, g[7][7]) : ans);
ans = (7 <= n && 8 <= n ? max(ans, g[7][8]) : ans);
ans = (7 <= n && 9 <= n ? max(ans, g[7][9]) : ans);
ans = (7 <= n && 10 <= n ? max(ans, g[7][10]) : ans);
ans = (8 <= n && 1 <= n ? max(ans, g[8][1]) : ans);
ans = (8 <= n && 2 <= n ? max(ans, g[8][2]) : ans);
ans = (8 <= n && 3 <= n ? max(ans, g[8][3]) : ans);
ans = (8 <= n && 4 <= n ? max(ans, g[8][4]) : ans);
ans = (8 <= n && 5 <= n ? max(ans, g[8][5]) : ans);
ans = (8 <= n && 6 <= n ? max(ans, g[8][6]) : ans);
ans = (8 <= n && 7 <= n ? max(ans, g[8][7]) : ans);
ans = (8 <= n && 8 <= n ? max(ans, g[8][8]) : ans);
ans = (8 <= n && 9 <= n ? max(ans, g[8][9]) : ans);
ans = (8 <= n && 10 <= n ? max(ans, g[8][10]) : ans);
ans = (9 <= n && 1 <= n ? max(ans, g[9][1]) : ans);
ans = (9 <= n && 2 <= n ? max(ans, g[9][2]) : ans);
ans = (9 <= n && 3 <= n ? max(ans, g[9][3]) : ans);
ans = (9 <= n && 4 <= n ? max(ans, g[9][4]) : ans);
ans = (9 <= n && 5 <= n ? max(ans, g[9][5]) : ans);
ans = (9 <= n && 6 <= n ? max(ans, g[9][6]) : ans);
ans = (9 <= n && 7 <= n ? max(ans, g[9][7]) : ans);
ans = (9 <= n && 8 <= n ? max(ans, g[9][8]) : ans);
ans = (9 <= n && 9 <= n ? max(ans, g[9][9]) : ans);
ans = (9 <= n && 10 <= n ? max(ans, g[9][10]) : ans);
ans = (10 <= n && 1 <= n ? max(ans, g[10][1]) : ans);
ans = (10 <= n && 2 <= n ? max(ans, g[10][2]) : ans);
ans = (10 <= n && 3 <= n ? max(ans, g[10][3]) : ans);
ans = (10 <= n && 4 <= n ? max(ans, g[10][4]) : ans);
ans = (10 <= n && 5 <= n ? max(ans, g[10][5]) : ans);
ans = (10 <= n && 6 <= n ? max(ans, g[10][6]) : ans);
ans = (10 <= n && 7 <= n ? max(ans, g[10][7]) : ans);
ans = (10 <= n && 8 <= n ? max(ans, g[10][8]) : ans);
ans = (10 <= n && 9 <= n ? max(ans, g[10][9]) : ans);
ans = (10 <= n && 10 <= n ? max(ans, g[10][10]) : ans);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int m[200][200], ma, n;
void buff() {}
void loop(int i, int j) {
cin >> m[i][j];
i = (j + 1 == n) ? i + 1 : i;
j = (j + 1 == n) ? 0 : j + 1;
((i == n) ? buff() : loop(i, j));
}
void max_v(int i, int j) {
ma = max(ma, ((i != j) ? m[i][j] : ma));
i = (j + 1 == n) ? i + 1 : i;
j = (j + 1 == n) ? 0 : j + 1;
((i == n) ? buff() : max_v(i, j));
}
void floyd(int k, int i, int j) {
m[i][j] = min(m[i][k] + m[k][j], m[i][j]);
i = (j + 1 == n) ? i + 1 : i;
k = (i == n) ? k + 1 : k;
j = (j + 1 == n) ? 0 : j + 1;
i = (i == n) ? 0 : i;
((k == n) ? buff() : floyd(k, i, j));
}
int main() {
cin >> n;
ma = 0;
loop(0, 0);
floyd(0, 0, 0);
max_v(0, 0);
cout << ma << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, maxi = 0;
vector<vector<int> > G;
vector<int> v;
int c = 0, t = 0, k;
int pu;
void mito(int &u) {
int t;
cin >> t;
u = t;
}
void myfunction(vector<int> &v) {
v.resize(n);
for_each(v.begin(), v.end(), mito);
}
void llena(int &u) { u = c++; }
void pato(int &u) {
u = min(u, G[k][pu] + G[t][k]);
pu++;
}
void rata(vector<int> &v) {
pu = 0;
for_each(v.begin(), v.end(), pato);
t++;
}
void otrafuncion(int u) {
k = u;
t = 0;
for_each(G.begin(), G.end(), rata);
}
void porfavor(int u) { maxi = max(u, maxi); }
void buscamax(vector<int> &v) { for_each(v.begin(), v.end(), porfavor); }
int main() {
cin >> n;
G.resize(n);
v.resize(n);
for_each(v.begin(), v.end(), llena);
for_each(G.begin(), G.end(), myfunction);
for_each(v.begin(), v.end(), otrafuncion);
for_each(G.begin(), G.end(), buscamax);
cout << maxi << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 11;
int g[N][N], n, ans;
signed main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) scanf("%d", &g[i][j]);
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) ans = max(ans, g[i][j]);
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int a[10][10];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
scanf("%d", &a[i][j]);
}
}
for (int k = 0; k < n; ++k) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
int ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
ans = max(ans, a[i][j]);
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int M = 15;
int f[M][M], n, ans = -1000000;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) cin >> f[i][j];
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) ans = max(ans, f[i][j]);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[10][10];
int n;
int mx = 0;
bool read1(int i, int j) {
cin >> a[i][j];
return (j == n - 1) || read1(i, j + 1);
}
bool read(int i) {
read1(i, 0);
return (i == n - 1 || read(i + 1));
}
bool fl2(int k, int i, int j) {
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
return j == n - 1 || fl2(k, i, j + 1);
}
bool fl1(int k, int i) {
fl2(k, i, 0);
return (i == n - 1 || fl1(k, i + 1));
}
bool fl(int k) {
fl1(k, 0);
return (k == n - 1 || fl(k + 1));
}
bool gm1(int i, int j) {
mx = max(mx, a[i][j]);
return (j == i - 1) || gm1(i, j + 1);
}
bool gm(int i) {
gm1(i, 0);
return (i == n - 1 || gm(i + 1));
}
int main() {
cin >> n;
read(0);
fl(0);
gm(1);
cout << mx;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned d[111][111];
int main() {
fill(d[0], d[110] + 111, 10000);
int n;
cin >> n;
int idx = 0;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
cin >> d[idx / n][idx % n];
idx++;
int i = 0, j = 0, k = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
k++;
i = j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
k++;
i = j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
k++;
i = j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
k++;
i = j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
k++;
i = j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
k++;
i = j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
k++;
i = j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
k++;
i = j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
k++;
i = j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
j++;
i++;
j = 0;
k++;
i = j = 0;
int x[10];
x[0] = *max_element(d[0], d[0] + n);
x[1] = *max_element(d[1], d[1] + n);
x[2] = *max_element(d[2], d[2] + n);
x[3] = *max_element(d[3], d[3] + n);
x[4] = *max_element(d[4], d[4] + n);
x[5] = *max_element(d[5], d[5] + n);
x[6] = *max_element(d[6], d[6] + n);
x[7] = *max_element(d[7], d[7] + n);
x[8] = *max_element(d[8], d[8] + n);
x[9] = *max_element(d[9], d[9] + n);
cout << *max_element(x, x + n);
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-6;
struct pos {
double x, y;
};
struct vec {
double x, y;
};
struct seg {
pos a, b;
};
long long sign(double x) { return x < -eps ? -1 : x > eps ? 1 : 0; }
double dot(vec a, vec b) { return a.x * b.x + a.y * b.y; }
double cross(vec a, vec b) { return a.x * b.y - a.y * b.x; }
vec fwd(pos a, pos b) { return {b.x - a.x, b.y - a.y}; }
void mkang(pos src, pos A, pos B) {}
pos operator+(pos p, vec v) { return {p.x + v.x, p.y + v.y}; }
vec operator*(vec v, double t) { return {v.x * t, v.y * t}; }
bool checkInt(seg a, seg b) {
return sign(cross(fwd(a.a, a.b), fwd(b.a, b.b))) != 0;
}
void prt(pos p) { cout << "p(" << p.x << "," << p.y << ") "; }
void prt(vec p) { cout << "v(" << p.x << "," << p.y << ") "; }
pos segIntSeg(seg a, seg b) {
double t =
cross(fwd(a.a, b.a), fwd(a.a, a.b)) / cross(fwd(a.a, a.b), fwd(b.a, b.b));
return b.a + fwd(b.a, b.b) * t;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
;
long long n;
cin >> n;
vector<pos> v(n);
for (long long i = 0; i < n; i++) cin >> v[i].x >> v[i].y;
seg ln = {v[0], v[1]};
bool inv = v[0].x > v[1].x;
double L = !inv ? v[0].x : v[1].x, R = !inv ? v[1].x : v[0].x;
for (long long i = 2; i < n; i++) {
for (long long j = 2; j < i; j++) {
seg ln2 = {v[i], v[j]};
if (!checkInt(ln, ln2)) {
if ((v[j].x < v[i].x) ^ inv) R = L - 1;
continue;
}
pos p = segIntSeg(ln, ln2);
if (sign(dot(fwd(v[i], v[j]), fwd(v[i], p))) < 0) continue;
if (!inv)
R = min(R, p.x);
else
L = max(L, p.x);
}
for (long long j = i + 1; j < n; j++) {
seg ln2 = {v[i], v[j]};
if (!checkInt(ln, ln2)) {
if ((v[j].x > v[i].x) ^ inv) L = R + 1;
continue;
}
pos p = segIntSeg(ln, ln2);
if (sign(dot(fwd(v[i], v[j]), fwd(v[i], p))) < 0) continue;
if (!inv)
L = max(L, p.x);
else
R = min(R, p.x);
}
}
long long cnt = floor(R) - ceil(L) + 1;
cout << max(cnt, 0LL) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
size_t numEntries;
struct Point {
Point() : x(0), y(0) {}
long long x{0};
long long y{0};
Point operator-(const Point &pointR) const {
return Point{this->x - pointR.x, this->y - pointR.y};
}
Point operator+(const Point &pointR) const {
return Point{this->x + pointR.x, this->y + pointR.y};
}
Point operator*(const Point &pointR) const {
return Point{this->x - pointR.x, this->y - pointR.y};
}
bool operator==(const Point &pointR) const {
return (this->x == pointR.x && this->y == pointR.y);
}
bool operator<(const Point &pointR) const {
if (this->x < pointR.x) return true;
return false;
}
Point(long long x, long long y) : x(x), y(y) {}
Point(const Point &rhs) : x(rhs.x), y(rhs.y) {}
int distance(const Point &rhs) const {
auto temp = (*this) - rhs;
return temp.x * temp.x + temp.y * temp.y;
}
};
long long crossProduct(const Point &pointA, const Point &pointB) {
return pointA.x * pointB.y - pointA.y * pointB.x;
}
float findXIntercept(const Point &A, const Point &B) {
if (A.x - B.x == 0) return A.x;
float m = (float)(A.y - B.y) / (A.x - B.x);
if (m == 0) {
return -1;
}
float b = A.y - m * A.x;
float xIntercept = (-b) / m;
return xIntercept;
}
int main(void) {
std::ios::sync_with_stdio(false);
cin >> numEntries;
float upperBound{0};
float lowerBound{0.0};
int adjustX{0};
int adjustY{0};
int flipH{1};
int flipV{1};
vector<Point> points(numEntries);
for (int i = 0; i < numEntries; ++i) {
cin >> points[i].x;
cin >> points[i].y;
if (i == 0) {
adjustX = points[i].x;
adjustY = points[i].y;
}
points[i].x -= adjustX;
points[i].y -= adjustY;
if (i == 1) {
if (points[i].x < 0) {
flipV = -1;
}
upperBound = points[i].x * flipV;
}
points[i].x *= flipV;
if (i == 2) {
if (points[i].y < 0) {
flipH = -1;
}
}
points[i].y *= flipH;
}
for (int i = 1; i < numEntries; ++i) {
int A = i - 1;
int B = i;
int C = (i + 1) % numEntries;
if (crossProduct(points[C] - points[B], points[A] - points[B]) < 0) {
auto updateB = crossProduct(points[C] - points[B], points[1] - points[B]);
auto updateA = crossProduct(points[C] - points[B], points[0] - points[B]);
bool skipComp{false};
if (updateB < 0 && updateA < 0) {
printf("0\n");
return 0;
} else if (updateB > 0 && updateA > 0) {
skipComp = true;
}
if (!skipComp) {
auto xIntercept = findXIntercept(points[C], points[B]);
if (xIntercept == -1) {
printf("0\n");
return 0;
}
if (updateB < 0) {
upperBound = min(upperBound, xIntercept);
}
if (updateA < 0) {
lowerBound = max(lowerBound, xIntercept);
}
}
updateB = crossProduct(points[B] - points[1], points[B] - points[A]);
updateA = crossProduct(points[B] - points[0], points[B] - points[A]);
if (updateB < 0 && updateA < 0) {
printf("0\n");
return 0;
} else if (updateB > 0 && updateA > 0) {
continue;
}
auto xIntercept = findXIntercept(points[B], points[A]);
if (xIntercept == -1) {
printf("0\n");
return 0;
}
if (updateB < 0) {
upperBound = min(upperBound, xIntercept);
}
if (updateA < 0) {
lowerBound = max(lowerBound, xIntercept);
}
}
}
int lower = ceil(lowerBound);
int upper = floor(upperBound);
int answer = (upper - lower) + 1;
if (answer > 0)
printf("%i\n", answer);
else
printf("0\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long test(double x) {
if (x < 0) {
return (test(-x + 1.0 - 0.000000001)) * -1;
}
return x;
}
int main() {
int n;
long long x[2000] = {};
long long y[2000] = {};
cin >> n;
for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
long long minx = min(x[1], x[2]);
long long maxx = max(x[1], x[2]);
for (int i = 3; i < n; i++) {
if (y[i] == y[i + 1]) {
if (y[3] < y[1] && x[i + 1] > x[i]) {
minx = 1e9;
}
if (y[3] > y[1] && x[i + 1] < x[i]) {
minx = 1e9;
}
continue;
}
long long disty = y[i] - y[i + 1];
long long distx = x[i + 1] - x[i];
long long distcom = x[i] * disty + y[i] * distx;
double inter = (distcom - y[1] * distx) * 1.0 / disty;
if (y[i] < y[i + 1]) {
minx = max(minx, test(inter + 1 - 0.000000001));
} else {
maxx = min(maxx, test(inter));
}
}
if (minx > maxx) {
minx = maxx + 1;
}
cout << maxx - minx + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct point {
double x, y;
};
struct sline {
double a, b, c;
};
point ps[1010], ps2[1010];
int pc, pc2;
sline ss[1010];
const double E = 1e-12;
inline void format(sline &s, point &p1, point &p2) {
s.a = p2.y - p1.y;
s.b = p1.x - p2.x;
s.c = -s.a * p1.x - s.b * p1.y;
}
inline int dblcmp(double x) {
if (x > -E && x < E) return 0;
return x > 0 ? 1 : -1;
}
inline point gcross(sline &s, point &p1, point &p2) {
double u = fabs(s.a * p1.x + s.b * p1.y + s.c);
double v = fabs(s.a * p2.x + s.b * p2.y + s.c);
point p;
p.x = (v * p1.x + u * p2.x) / (u + v);
p.y = (v * p1.y + u * p2.y) / (u + v);
return p;
}
void cut(sline &s) {
pc2 = 0;
for (int i = 1; i <= pc; i++) {
if (dblcmp(s.a * ps[i].x + s.b * ps[i].y + s.c) >= 0) {
ps2[++pc2] = ps[i];
} else {
if (dblcmp(s.a * ps[i - 1].x + s.b * ps[i - 1].y + s.c) > 0) {
ps2[++pc2] = gcross(s, ps[i - 1], ps[i]);
}
if (dblcmp(s.a * ps[i + 1].x + s.b * ps[i + 1].y + s.c) > 0) {
ps2[++pc2] = gcross(s, ps[i + 1], ps[i]);
}
}
}
pc = pc2;
for (int i = 1; i <= pc; i++) {
ps[i] = ps2[i];
}
ps[0] = ps[pc];
ps[pc + 1] = ps[1];
}
bool cmp(const point &p1, const point &p2) {
if (dblcmp(p1.x - p2.x) == 0) return p1.y < p2.y;
return p1.x < p2.x;
}
bool uncmp(const point &p1, const point &p2) {
if (dblcmp(p1.x - p2.x) == 0 && dblcmp(p1.y - p2.y) == 0) return true;
return false;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lf%lf", &ps[i].x, &ps[i].y);
}
ps[0] = ps[n];
ps[n + 1] = ps[1];
for (int i = 2; i <= n; i++) {
format(ss[i - 1], ps[i], ps[i + 1]);
}
ps[0] = ps[2];
ps[3] = ps[1];
pc = 2;
for (int i = 1; i <= n - 1; i++) {
cut(ss[i]);
}
for (int i = 0; i < pc; i++) {
ps[i] = ps[i + 1];
}
sort(ps, ps + pc, cmp);
pc = unique(ps, ps + pc, uncmp) - ps;
if (pc == 0) {
printf("0\n");
} else {
int h = (int)floor(ps[1 % pc].x + E);
int l = (int)ceil(ps[0].x - E);
printf("%d\n", h - l + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 11111;
double Area, Length;
double P_x_min, P_x_max;
double P_y_min, P_y_max;
struct Point {
double x, y;
Point() {}
Point(double _x, double _y) : x(_x), y(_y) {}
} p[N];
Point MakeVector(Point &P, Point &Q) { return Point(Q.x - P.x, Q.y - P.y); }
double CrossProduct(Point P, Point Q) { return P.x * Q.y - P.y * Q.x; }
double MultiCross(Point P, Point Q, Point R) {
return CrossProduct(MakeVector(Q, P), MakeVector(Q, R));
}
struct halfPlane {
Point s, t;
double angle;
halfPlane() {}
halfPlane(Point _s, Point _t) : s(_s), t(_t) {}
halfPlane(double sx, double sy, double tx, double ty)
: s(sx, sy), t(tx, ty) {}
void GetAngle() { angle = atan2(t.y - s.y, t.x - s.x); }
} hp[N], q[N];
Point IntersectPoint(halfPlane P, halfPlane Q) {
double a1 = CrossProduct(MakeVector(P.s, Q.t), MakeVector(P.s, Q.s));
double a2 = CrossProduct(MakeVector(P.t, Q.s), MakeVector(P.t, Q.t));
return Point((P.s.x * a2 + P.t.x * a1) / (a2 + a1),
(P.s.y * a2 + P.t.y * a1) / (a2 + a1));
}
bool cmp(halfPlane P, halfPlane Q) {
if (fabs(P.angle - Q.angle) < 1e-8) return MultiCross(P.s, P.t, Q.s) > 0;
return P.angle < Q.angle;
}
bool IsParallel(halfPlane P, halfPlane Q) {
return fabs(CrossProduct(MakeVector(P.s, P.t), MakeVector(Q.s, Q.t))) < 1e-8;
}
void HalfPlaneIntersect(int n, int &m) {
sort(hp, hp + n, cmp);
int i, l = 0, r = 1;
for (m = i = 1; i < n; ++i)
if (hp[i].angle - hp[i - 1].angle > 1e-8) hp[m++] = hp[i];
n = m;
m = 0;
q[0] = hp[0], q[1] = hp[1];
for (i = 2; i < n; ++i) {
if (IsParallel(q[r], q[r - 1]) || IsParallel(q[l], q[l + 1])) return;
while (l < r &&
MultiCross(hp[i].s, hp[i].t, IntersectPoint(q[r], q[r - 1])) > 0)
--r;
while (l < r &&
MultiCross(hp[i].s, hp[i].t, IntersectPoint(q[l], q[l + 1])) > 0)
++l;
q[++r] = hp[i];
}
while (l < r &&
MultiCross(q[l].s, q[l].t, IntersectPoint(q[r], q[r - 1])) > 0)
--r;
while (l < r &&
MultiCross(q[r].s, q[r].t, IntersectPoint(q[l], q[l + 1])) > 0)
++l;
q[++r] = q[l];
for (i = l; i < r; ++i) p[m++] = IntersectPoint(q[i], q[i + 1]);
}
int main() {
int n, m;
Point a, b;
while (cin >> n) {
for (int i = 0; i < n; i++) cin >> p[i].x >> p[i].y;
for (int i = 0; i < n; i++) {
hp[i] = halfPlane(p[(i + 1) % n], p[i]);
hp[i].GetAngle();
}
a = p[0], b = p[1];
HalfPlaneIntersect(n, m);
if (m < 3) {
cout << 0 << endl;
continue;
}
int ans = 0;
if (a.x > b.x) swap(a, b);
int f2 = 0, f1 = 0;
for (int i = 0; i < m; i++) {
if (p[i].y == a.y && p[(i + 1) % m].y == a.y) {
f2 = 1;
a = p[i], b = p[(i + 1) % m];
break;
} else if (p[i].y == a.y)
f1 = 1;
}
if (f1 && !f2)
cout << 1 << endl;
else if (f2) {
if (a.x > b.x) swap(a, b);
cout << int(b.x - a.x) + 1 << endl;
} else
cout << 0 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1123;
const int INF = 0x3f3f3f3f;
const long long MOD = 1000000007;
const double EPS = 1e-9;
const double PI = acos(-1);
inline int cmp(double x, double y = 0, double tol = EPS) {
return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
struct point {
double x, y;
point(double a, double b) : x(a), y(b) {}
point() : x(0.0), y(0.0) {}
point operator+(point q) { return point(x + q.x, y + q.y); }
point operator-(point q) { return point(x - q.x, y - q.y); }
point operator*(double t) { return point(x * t, y * t); }
point operator/(double t) { return point(x / t, y / t); }
double operator*(point q) { return x * q.x + y * q.y; }
double operator^(point q) { return x * q.y - y * q.x; }
double polar() { return ((y > -EPS) ? atan2(y, x) : 2 * PI + atan2(y, x)); }
double mod() { return sqrt(x * x + y * y); }
double mod2() { return (x * x + y * y); }
point rotate(double t) {
return point(x * cos(t) - y * sin(t), x * sin(t) + y * cos(t));
}
int cmp(point q) const {
if (int t = ::cmp(x, q.x)) return t;
return ::cmp(y, q.y);
}
bool operator==(point q) const { return cmp(q) == 0; }
bool operator!=(point q) const { return cmp(q) != 0; }
bool operator<(point q) const { return cmp(q) < 0; }
};
int n, tam;
point P[MAX];
point Q[MAX * MAX];
inline int ccw(point p, point q, point r) { return cmp((q - r) ^ (p - r)); }
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> P[i].x >> P[i].y;
if (P[0].x == P[1].x) {
tam = 0;
if (P[1].y > P[0].y) {
for (int i = P[0].y; i <= P[1].y; i++) Q[tam++] = point(P[0].x, i);
} else {
for (int i = P[0].y; i >= P[1].y; i--) Q[tam++] = point(P[0].x, i);
}
} else if (P[0].y == P[1].y) {
tam = 0;
if (P[1].x > P[0].x) {
for (int i = P[0].x; i <= P[1].x; i++) Q[tam++] = point(i, P[0].y);
} else {
for (int i = P[0].x; i >= P[1].x; i--) Q[tam++] = point(i, P[0].y);
}
} else {
tam = 0;
int g = gcd((int)(abs(P[0].y - P[1].y)), (int)(abs(P[0].x - P[1].x)));
int p = (P[0].y - P[1].y) / g;
int q = (P[0].x - P[1].x) / g;
for (int i = P[0].x; q ? (i <= P[1].x) : (i >= P[1].x); i += q)
Q[tam++] = point(i, P[0].y + ((i - P[0].x) * p) / q);
}
int st = 0, ed = tam - 1;
fprintf(stderr, "%d %d\n", st, ed);
for (int i = 1; i < n; i++) {
while (st <= ed && ccw(P[i], P[(i + 1) % n], Q[st]) < 0) st++;
while (ed >= st && ccw(P[i], P[(i + 1) % n], Q[ed]) < 0) ed--;
}
cout << max(ed - st + 1, 0) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
pair<int, int> p[maxn];
int n;
void operator-=(pair<int, int> &a, pair<int, int> b) {
a.first -= b.first;
a.second -= b.second;
}
bool ccw(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
b -= a;
c -= a;
return 1ll * b.first * c.second > 1ll * b.second * c.first;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d%d", &p[i].first, &p[i].second);
p[n + 1] = p[n];
int l = min(p[1].first, p[2].first), r = max(p[1].first, p[2].first);
for (int i = 2; i <= n; ++i) {
while (r >= l && ccw(p[i], p[i + 1], make_pair(r, p[1].second))) --r;
while (r >= l && ccw(p[i], p[i + 1], make_pair(l, p[1].second))) ++l;
}
printf("%d", r - l + 1);
return 0;
}
|
#include <bits/stdc++.h>
long long cross2(long long x1, long long y1, long long x2, long long y2) {
return x1 * y2 - x2 * y1;
}
long long cross(std::pair<long long, long long> &i,
std::pair<long long, long long> &j,
std::pair<long long, long long> &k) {
return cross2(j.first - i.first, j.second - i.second, k.first - i.first,
k.second - i.second);
}
int main() {
int n = 0;
std::cin >> n;
std::vector<std::pair<long long, long long>> points(n);
for (int i = 0; i < n; i++) {
std::cin >> points[i].first >> points[i].second;
}
bool flip = points[0].first < points[1].second;
long long x = points[1].first;
long long y = points[1].second;
for (int i = 0; i < n; i++) {
points[i].first -= x;
points[i].second -= y;
if (flip) {
points[i].first = -points[i].first;
points[i].second = -points[i].second;
}
}
long long left = 0;
long long right = points[0].first;
for (int i = 2; i + 1 < n; i++) {
long long crossRight = cross(points[i], points[i + 1], points[0]);
long long crossLeft = cross(points[i], points[i + 1], points[1]);
if (crossRight > 0 && crossLeft > 0) {
std::cout << 0 << std::endl;
return 0;
}
if (crossRight > 0 || crossLeft > 0) {
long long p =
points[i].first * (points[i + 1].second - points[i].second) -
points[i].second * (points[i + 1].first - points[i].first);
long long q = points[i + 1].second - points[i].second;
if (q < 0) {
p = -p;
q = -q;
}
if (crossRight > 0) {
right = std::min(right, (p / q));
} else {
left = std::max(left, ((p + q - 1) / q));
}
}
}
std::cout << (left <= right ? right - left + 1 : 0) << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int sign(long long x) { return x < 0 ? -1 : x > 0 ? 1 : 0; }
struct point {
long long x, y;
point(long long a = 0, long long b = 0) : x(a), y(b) {}
point operator-(point q) { return point(x - q.x, y - q.y); }
long long operator%(point q) { return x * q.y - y * q.x; }
};
point T[1001];
long long piso(long long A, long long B) {
if (B < 0) A = -A, B = -B;
if (A >= 0)
return A / B;
else
return -((-A + B - 1) / B);
}
long long techo(long long A, long long B) {
if (B < 0) A = -A, B = -B;
if (A >= 0)
return (A + B - 1) / B;
else
return A / B;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%lld %lld", &T[i].x, &T[i].y);
if (T[2].y > T[0].y) {
for (int i = 0; i < n; i++) T[i].y = -T[i].y;
swap(T[0], T[1]);
reverse(T + 2, T + n);
}
T[n] = T[0];
long long y = T[0].y;
bool sirve = true;
long long le = T[0].x, ri = T[1].x;
for (int i = 2; i < n; i++) {
long long der = T[1].x;
long long izq = T[0].x;
for (int j = 2; j < i; j++)
if (abs(y - T[j].y) < abs(y - T[i].y)) {
long long A = T[j].y - T[i].y;
long long B = T[i].x - T[j].x;
long long C = T[i].x * A + T[i].y * B;
der = min(der, piso(C - B * y, A));
}
if (i - 1 > 1)
if (T[i].y == T[i - 1].y && T[i - 2].y > T[i].y &&
sign((T[i] - T[i - 1]) % (T[i] - T[i - 2])) <= 0)
sirve = false;
for (int j = i + 1; j < n; j++)
if (abs(y - T[j].y) < abs(y - T[i].y)) {
long long A = T[j].y - T[i].y;
long long B = T[i].x - T[j].x;
long long C = T[i].x * A + T[i].y * B;
izq = max(izq, techo(C - B * y, A));
}
if (i + 1 < n)
if (T[i].y == T[i + 1].y && T[i + 2].y > T[i].y &&
sign((T[i] - T[i + 1]) % (T[i] - T[i + 2])) >= 0)
sirve = false;
if (der < izq)
sirve = false;
else if (ri < izq || der < le)
sirve = false;
else {
le = max(izq, le);
ri = min(der, ri);
}
}
int res = ri - le + 1;
if (!sirve) res = 0;
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
struct Point {
int x, y;
inline void Read() { cin >> x >> y; }
} P[1003], A, B;
inline long long Cross(const Point& O, const Point& A, const Point& B) {
long long x1 = A.x - O.x, x2 = B.x - O.x, y1 = A.y - O.y, y2 = B.y - O.y;
return x1 * y2 - x2 * y1;
}
int Calc() {
Point Left = A, Right = B;
for (int i = 2; i <= n; i++)
if (Cross(Left, P[i - 1], P[i]) > 0) {
if (P[i].y == P[i - 1].y) return 0;
double t = 1.0 * (Left.y - P[i].y) / (P[i].y - P[i - 1].y) *
(P[i].x - P[i - 1].x),
pos = t + P[i].x;
if (pos + 1e-5 < Left.x)
return 0;
else
Left.x = (int)ceil(pos);
}
if (Left.x > B.x) return 0;
for (int i = 2; i <= n; i++)
if (Cross(Left, P[i - 1], P[i]) > 0) return 0;
for (int i = n - 1; i; i--)
if (Cross(Right, P[i + 1], P[i]) < 0) {
if (P[i].y == P[i + 1].y) return 0;
double t = 1.0 * (Right.y - P[i].y) / (P[i].y - P[i + 1].y) *
(P[i].x - P[i + 1].x),
pos = t + P[i].x;
if (pos - 1e-5 > Right.x)
return 0;
else
Right.x = (int)floor(pos);
}
if (Right.x < A.x) return 0;
for (int i = n - 1; i; i--)
if (Cross(Right, P[i + 1], P[i]) < 0) return 0;
return Right.x - Left.x + 1;
}
int main() {
cin >> n;
A.Read(), B.Read();
n -= 2;
for (int i = 1; i <= n; i++) P[i].Read();
if (A.x > B.x) {
swap(A, B);
for (int i = 1; i <= n; i++) P[i].y = 2 * A.y - P[i].y;
for (int i = 1, j = n; i < j; i++, j--) swap(P[i], P[j]);
}
cout << Calc() << endl;
getchar();
getchar();
return 0;
}
|
#include <bits/stdc++.h>
const int N = 1010;
const double zero = 1e-8;
int x[N], y[N];
long long work(int x1, int y1, int x2, int y2) {
long long t1 = x1;
t1 *= y2;
long long t2 = x2;
t2 *= y1;
return (t1 - t2);
}
int main() {
int n, i, j, l, r, yy, ans = 0;
bool p = true;
scanf("%d\n", &n);
for (i = 0; i < n; i++) scanf("%d %d", &x[i], &y[i]);
x[n] = x[0];
y[n] = y[0];
yy = y[0];
if (x[0] < x[1]) {
l = x[0];
r = x[1];
} else {
l = x[1];
r = x[0];
}
for (i = 1; i < n; i++)
if (work(x[i] - l, y[i] - yy, x[i + 1] - l, y[i + 1] - yy) > 0) {
if (y[i] == y[i + 1]) {
p = false;
break;
} else {
if (x[i] == x[i + 1]) {
if (x[i] < l) {
p = false;
break;
}
l = x[i];
} else {
double k = double(y[i + 1] - y[i]) / double(x[i + 1] - x[i]),
b = y[i] - k * x[i];
double tx = (yy - b) / k;
if (tx < l && fabs(tx - l) > zero) {
p = false;
break;
}
if ((tx - int(tx)) < zero)
l = int(tx);
else
l = int(tx) + 1;
}
if (l > r) break;
}
}
if (p && l <= r)
for (i = 1; i < n; i++)
if (work(x[i] - r, y[i] - yy, x[i + 1] - r, y[i + 1] - yy) > 0) {
if (y[i] == y[i + 1]) {
p = false;
break;
} else {
if (x[i] == x[i + 1]) {
if (x[i] > r) {
p = false;
break;
}
r = x[i];
} else {
double k = double(y[i + 1] - y[i]) / double(x[i + 1] - x[i]),
b = y[i] - k * x[i];
double tx = (yy - b) / k;
if (tx > r && fabs(tx - r) > zero) {
p = false;
break;
}
r = int(tx);
}
if (l > r) break;
}
}
if (!p || l > r)
printf("0");
else
printf("%d", r - l + 1);
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 50;
const double EPS = 1e-7;
struct P {
double x, y;
P(double _x = 0.0, double _y = 0.0) : x(_x), y(_y) {}
};
P operator+(P A, P B) { return P(A.x + B.x, A.y + B.y); }
P operator-(P A, P B) { return P(A.x - B.x, A.y - B.y); }
P operator*(P A, double B) { return P(A.x * B, A.y * B); }
P operator/(P A, double B) { return P(A.x / B, A.y / B); }
double operator*(P A, P B) { return A.x * B.x + A.y * B.y; }
double Det(P A, P B, P C) {
return (B.x - A.x) * (C.y - A.y) - (C.x - A.x) * (B.y - A.y);
}
ostream &operator<<(ostream &out, P A) { return out << A.x << " " << A.y; }
istream &operator>>(istream &in, P &A) { return in >> A.x >> A.y; }
int sgn(double k) { return k < -EPS ? -1 : int(k > EPS); }
bool CanCross(P A1, P A2, P B1, P B2) {
double Area1 = Det(A1, B1, A2);
double Area2 = Det(A1, A2, B2);
return sgn(Area1) || sgn(Area2);
}
P CrossPoint(P A1, P A2, P B1, P B2) {
double Area1 = Det(A1, B1, A2);
double Area2 = Det(A1, A2, B2);
return (B1 * Area2 + B2 * Area1) / (Area1 + Area2);
}
int n;
double L, R, Y;
P K0, K1, K2;
int main() {
cin >> n;
cin >> K0 >> K1;
L = min(K0.x, K1.x);
R = max(K0.x, K1.x);
Y = K0.y;
for (int i = 3; i <= n; i++) {
cin >> K2;
if (K1.y == K2.y) {
if (Det(K2, K1, P(L, Y)) < 0) {
cout << 0 << endl;
return 0;
}
}
P CP = CrossPoint(P(L, Y), P(R, Y), K2, K1);
if (sgn(Det(K2, K1, P(L, Y))) < 0) {
L = max(CP.x, L);
}
if (sgn(Det(K2, K1, P(R, Y))) < 0) {
R = min(CP.x, R);
}
K0 = K1;
K1 = K2;
}
int LL = ceil(L);
int RR = floor(R);
if (LL > RR) {
cout << 0 << endl;
} else {
cout << RR - LL + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
complex<long long> P[1010];
long long cross(complex<long long> p, complex<long long> a,
complex<long long> b) {
return imag(conj(a - p) * (b - p));
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x, y;
scanf("%d%d", &x, &y);
P[i] = complex<long long>(x, y);
}
int y = imag(P[1]), xl = real(P[1]), xr = real(P[2]);
if (xl > xr) swap(xl, xr);
int L = xl, R = xr;
for (int i = 1; i <= n; i++) {
while (xl <= R && cross(complex<long long>(xl, y), P[i], P[i % n + 1]) > 0)
xl++;
while (xr >= L && cross(complex<long long>(xr, y), P[i], P[i % n + 1]) > 0)
xr--;
}
printf("%d\n", xl <= xr ? xr - xl + 1 : 0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6, mod = 1e9 + 7;
const double eps = 1e-9;
int sgn(double x) {
if (fabs(x) <= eps) return 0;
return x > 0 ? 1 : -1;
}
struct point {
double x, y;
point() {}
point(double _x, double _y) : x(_x), y(_y) {}
point operator-(const point &p) { return {x - p.x, y - p.y}; }
point operator+(const point &p) { return {x + p.x, y + p.y}; }
point operator*(double d) { return {x * d, y * d}; }
double operator^(const point &p) { return x * p.y - y * p.x; }
};
struct line {
point p, v;
double ang;
line() {}
line(point p1, point p2) {
p = p1, v = p2 - p1;
ang = atan2(v.y, v.x);
}
bool operator<(const line &l) const { return ang < l.ang; }
point intersection(line l) {
double t = (l.v ^ (p - l.p)) / (v ^ l.v);
return p + v * t;
}
};
vector<point> halfPlaneIntersection(vector<line> &l) {
int n = l.size();
sort(l.begin(), l.end());
int first = 0, last = 0;
vector<point> poly;
vector<point> p(n);
vector<line> q(n);
q[first] = l[0];
for (int i = 1; i < n; i++) {
while (first < last && (l[i].v ^ (p[last - 1] - l[i].p)) <= eps) last--;
while (first < last && (l[i].v ^ (p[first] - l[i].p)) <= eps) first++;
q[++last] = l[i];
if (sgn(q[last].v ^ q[last - 1].v) == 0) {
last--;
if ((q[last].v ^ (l[i].p - q[last].p)) > eps) q[last] = l[i];
}
if (first < last) p[last - 1] = q[last - 1].intersection(q[last]);
}
while (first < last && (q[first].v ^ (p[last - 1] - q[first].p)) <= eps)
last--;
if (last - first <= 1) return poly;
p[last] = q[last].intersection(q[first]);
for (int i = first; i <= last; i++) poly.push_back(p[i]);
return poly;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<point> v(n);
for (int i = 0; i < n; i++) cin >> v[i].x >> v[i].y;
int y = v[0].y, x1 = v[0].x, x2 = v[1].x;
vector<line> l;
for (int i = n - 1; i > 0; i--) {
line x(v[i], v[i - 1]);
l.push_back(x);
}
line x(v[0], v[n - 1]);
l.push_back(x);
v = halfPlaneIntersection(l);
cout << setprecision(3) << fixed;
if ((int)v.size() == 0) cout << 0 << endl, exit(0);
v.push_back(v[0]);
double ad = 0.0000001;
int ans = 0;
for (int i = 0; i < (int)v.size() - 1; i++) {
if (floor(v[i].y + ad) == y && floor(v[i + 1].y + ad) == y) {
double sm = v[i + 1].x, lr = v[i].x;
if (sm > lr) swap(sm, lr);
if (x1 > x2) swap(x1, x2);
x1 = max(x1, (int)ceil(sm - ad));
x2 = min(x2, (int)floor(lr + ad));
cout << x2 - x1 + 1 << endl, exit(0);
}
}
for (auto x : v)
if (floor(x.y + ad) == y) cout << 1 << endl, exit(0);
cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long test(double x) {
if (x < 0) {
return (test(-x + 1.0 - 0.000000001)) * -1;
}
return x;
}
int main() {
int n;
long long x[2000] = {};
long long y[2000] = {};
cin >> n;
for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
long long minx = min(x[1], x[2]);
long long maxx = max(x[1], x[2]);
for (int i = 3; i < n; i++) {
if (y[i] == y[i + 1]) {
if (y[3] < y[1] && x[i + 1] > x[i]) {
minx = 1e9;
}
if (y[3] > y[1] && x[i + 1] < x[i]) {
minx = 1e9;
}
continue;
}
long long disty = y[i] - y[i + 1];
long long distx = x[i + 1] - x[i];
long long distcom = x[i] * disty + y[i] * distx;
double inter = (distcom - y[1] * distx) * 1.0 / disty;
if (y[i] < y[i + 1]) {
minx = max(minx, test(inter + 1 - 0.000000001));
} else {
maxx = min(maxx, test(inter));
}
}
if (minx > maxx) {
minx = maxx + 1;
}
cout << maxx - minx + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
const double oo = 1E7, eps = 1E-7;
struct point {
double x, y;
} P[maxn];
int n;
double ansl, ansr;
point operator+(point a, point b) { return (point){a.x + b.x, a.y + b.y}; }
point operator-(point a, point b) { return (point){a.x - b.x, a.y - b.y}; }
double operator*(point a, point b) { return a.x * b.x + a.y * b.y; }
double operator/(point a, point b) { return a.x * b.y - b.x * a.y; }
double get(point A, point B) {
double a, b, c, res;
a = A.y - B.y;
b = B.x - A.x;
c = A / B;
if (a)
res = (-c - b * P[1].y) / a;
else
res = oo;
return res;
}
int main() {
int i, j;
double x, sita;
scanf("%d", &n);
scanf("%lf%lf", &P[n].x, &P[n].y);
for (i = 1; i < n; ++i) scanf("%lf%lf", &P[i].x, &P[i].y);
ansl = min(P[1].x, P[n].x), ansr = max(P[1].x, P[n].x);
for (i = 2; i < n; ++i) {
j = i + 1;
x = get(P[i], P[j]);
sita = (P[1].y - P[i].y) * (P[j].x - P[i].x);
if (sita > (P[j].y - P[i].y) * (ansl - P[i].x)) ansl = max(ansl, x);
if (sita > (P[j].y - P[i].y) * (ansr - P[i].x)) ansr = min(ansr, x);
}
if (ansr >= ansl)
printf("%.0lf", floor(ansr) - floor(ansl - eps));
else
printf("0");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000;
struct T {
int x, y;
} S[maxn];
static int N;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) scanf("%d%d", &S[i].x, &S[i].y);
double L = S[1].x, R = S[2].x;
if (S[3].y > S[2].y) swap(L, R);
for (int i = 2; i < N; i++)
if (S[i].y != S[i + 1].y) {
double tx = S[i].x;
if (S[i].x != S[i + 1].x)
tx = double(S[2].y - S[i].y) / (S[i + 1].y - S[i].y) *
(S[i + 1].x - S[i].x) +
S[i].x;
if (S[i + 1].y > S[i].y) {
if (L < tx) L = tx;
} else if (R > tx)
R = tx;
} else if ((double)(S[1].x - S[2].x) * (S[i].x - S[i + 1].x) > 0)
L = R + 1;
if (L > R + 1E-10)
printf("0\n");
else
printf("%d\n", int(R + 1E-10 + 10000) - int(L - 1E-10 + 10000));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 11111;
double Area, Length;
double P_x_min, P_x_max;
double P_y_min, P_y_max;
struct Point {
double x, y;
Point() {}
Point(double _x, double _y) : x(_x), y(_y) {}
} p[N];
Point MakeVector(Point &P, Point &Q) { return Point(Q.x - P.x, Q.y - P.y); }
double CrossProduct(Point P, Point Q) { return P.x * Q.y - P.y * Q.x; }
double MultiCross(Point P, Point Q, Point R) {
return CrossProduct(MakeVector(Q, P), MakeVector(Q, R));
}
struct halfPlane {
Point s, t;
double angle;
halfPlane() {}
halfPlane(Point _s, Point _t) : s(_s), t(_t) {}
halfPlane(double sx, double sy, double tx, double ty)
: s(sx, sy), t(tx, ty) {}
void GetAngle() { angle = atan2(t.y - s.y, t.x - s.x); }
} hp[N], q[N];
Point IntersectPoint(halfPlane P, halfPlane Q) {
double a1 = CrossProduct(MakeVector(P.s, Q.t), MakeVector(P.s, Q.s));
double a2 = CrossProduct(MakeVector(P.t, Q.s), MakeVector(P.t, Q.t));
return Point((P.s.x * a2 + P.t.x * a1) / (a2 + a1),
(P.s.y * a2 + P.t.y * a1) / (a2 + a1));
}
bool cmp(halfPlane P, halfPlane Q) {
if (fabs(P.angle - Q.angle) < 1e-8) return MultiCross(P.s, P.t, Q.s) > 0;
return P.angle < Q.angle;
}
bool IsParallel(halfPlane P, halfPlane Q) {
return fabs(CrossProduct(MakeVector(P.s, P.t), MakeVector(Q.s, Q.t))) < 1e-8;
}
void HalfPlaneIntersect(int n, int &m) {
sort(hp, hp + n, cmp);
int i, l = 0, r = 1;
for (m = i = 1; i < n; ++i)
if (hp[i].angle - hp[i - 1].angle > 1e-8) hp[m++] = hp[i];
n = m;
m = 0;
q[0] = hp[0], q[1] = hp[1];
for (i = 2; i < n; ++i) {
if (IsParallel(q[r], q[r - 1]) || IsParallel(q[l], q[l + 1])) return;
while (l < r &&
MultiCross(hp[i].s, hp[i].t, IntersectPoint(q[r], q[r - 1])) > 0)
--r;
while (l < r &&
MultiCross(hp[i].s, hp[i].t, IntersectPoint(q[l], q[l + 1])) > 0)
++l;
q[++r] = hp[i];
}
while (l < r &&
MultiCross(q[l].s, q[l].t, IntersectPoint(q[r], q[r - 1])) > 0)
--r;
while (l < r &&
MultiCross(q[r].s, q[r].t, IntersectPoint(q[l], q[l + 1])) > 0)
++l;
q[++r] = q[l];
for (i = l; i < r; ++i) p[m++] = IntersectPoint(q[i], q[i + 1]);
}
void Solve(Point *p, int n, int &m) {
int i, j;
Point a, b;
p[n] = p[0];
for (i = 0; i < n; i++) {
hp[i] = halfPlane(p[(i + 1) % n], p[i]);
hp[i].GetAngle();
}
a = p[0], b = p[1];
HalfPlaneIntersect(n, m);
Area = 0;
Length = 0;
P_x_min = P_x_max = 0;
P_y_min = P_y_max = 0;
if (m > 2) {
if (a.x > b.x) swap(a, b);
int f2 = 0, f1 = 0;
for (int i = 0; i < m; i++) {
if (p[i].y == a.y && p[(i + 1) % m].y == a.y) {
f2 = 1;
a = p[i];
b = p[(i + 1) % m];
break;
} else if (p[i].y == a.y)
f1 = 1;
}
if (f1 && !f2)
Length = 1;
else if (f2) {
if (a.x > b.x) swap(a, b);
Length = (int)(b.x - a.x) + 1;
}
}
if (m > 2) {
p[m] = p[0];
for (i = 0; i < m; ++i) Area += CrossProduct(p[i], p[i + 1]);
if (Area < 0) Area = -Area;
}
Area /= 2.0;
}
int main() {
int n, m, t = 1;
Point a, b;
while (cin >> n) {
if (n == 0) break;
for (int i = 0; i < n; i++) cin >> p[i].x >> p[i].y;
Solve(p, n, m);
cout << Length << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int SG(double x) {
if (x > 1E-7) return 1;
if (x < -1E-7) return -1;
return 0;
}
class PT {
public:
double x, y;
PT() {}
PT(double _x, double _y) {
x = _x;
y = _y;
}
PT operator-(const PT& p) const { return PT(x - p.x, y - p.y); }
PT operator+(const PT& p) const { return PT(x + p.x, y + p.y); }
PT operator*(const double c) const { return PT(x * c, y * c); }
PT operator/(const double c) const { return PT(x / c, y / c); }
double operator*(const PT& p) const { return x * p.x + y * p.y; }
double operator^(const PT& p) const { return x * p.y - y * p.x; }
void prt() { printf("%.4f %.4f ", x, y); }
};
PT pt[1100];
inline double tri(PT p1, PT p2, PT p3) { return (p2 - p1) ^ (p3 - p1); }
inline int sect(PT p1, PT p2, PT p3, PT p4, PT& p) {
double tc, td;
tc = tri(p3, p4, p1);
td = tri(p3, p4, p2);
if (SG(td - tc) == 0) {
if (tc > 0) {
return 0;
} else {
return 2;
}
}
p = (p1 * td - p2 * tc) / (td - tc);
return 1;
}
inline int btw(PT p1, PT p2, PT p3) { return SG((p2 - p1) * (p3 - p1)) <= 0; }
inline int gcd(int a, int b) {
if (a < 0) a = -a;
if (b < 0) b = -b;
if (a == 0 || b == 0) return a + b;
while ((a %= b) && (b %= a))
;
return a + b;
}
int main() {
int n, i, x1, y1, x2, y2, d, dx, dy, s, rt;
PT p1, p2, p;
while (scanf("%d", &n) == 1) {
for (i = 0; i < n; i++) {
scanf("%lf %lf", &pt[i].x, &pt[i].y);
}
pt[n] = pt[0];
p1 = pt[0];
p2 = pt[1];
for (i = 1; i < n; i++) {
if ((rt = sect(p1, p2, pt[i], pt[i + 1], p)) != 0) {
if (rt == 1) {
if (tri(pt[i], pt[i + 1], p1) > 0) {
if (tri(pt[i], pt[i + 1], p2) > 0) {
break;
} else {
p1 = p;
}
} else {
if (tri(pt[i], pt[i + 1], p2) > 0) {
p2 = p;
}
}
}
} else {
break;
}
}
if (i < n) {
printf("0\n");
continue;
}
x1 = (int)(pt[0].x + 0.1);
y1 = (int)(pt[0].y + 0.1);
x2 = (int)(pt[1].x + 0.1);
y2 = (int)(pt[1].y + 0.1);
d = gcd(x2 - x1, y2 - y1);
dx = (x2 - x1) / d;
dy = (y2 - y1) / d;
s = 0;
for (i = 0; i <= d; i++) {
if (btw(PT(x1 + i * dx, y1 + i * dy), p1, p2)) {
s++;
}
}
printf("%d\n", s);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct point {
double x, y;
};
struct point a[1010];
int n, ff, flag;
double inf = 1e9;
point calc(point p1, point p2, point q1, point q2) {
point ret;
double k;
ff = 0;
if (p1.x == p2.x) {
ret.x = p1.x;
ret.y = q1.y;
} else {
k = (p2.y - p1.y) / (p2.x - p1.x);
if (k == 0) {
if ((p1.x > p2.x ? 1 : -1) * (q1.x > q2.x ? 1 : -1) == 1)
ff = -1;
else
ff = 1;
} else {
ret.x = p1.x + (q1.y - p1.y) / k;
ret.y = q1.y;
}
}
return ret;
}
int main() {
int i, j, k, f;
double l, r;
point p;
scanf("%d", &n);
for (i = 1; i <= n; i++) scanf("%lf%lf", &a[i].x, &a[i].y);
l = min(a[1].x, a[2].x);
r = max(a[1].x, a[2].x);
a[n + 1] = a[1];
for (i = 2; i <= n; i++) {
p = calc(a[i], a[i + 1], a[1], a[2]);
f = (a[i + 1].y > a[i].y ? 1 : -1);
if (ff == 0) {
if (f == -1)
r = min(r, p.x);
else
l = max(l, p.x);
} else if (ff == -1)
l = r + 1;
}
l = ceil(l);
r = floor(r);
printf("%d\n", max(0, int(r - l + 1)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int hd, td;
int X[1020], Y[1020];
int n;
long long cj(int x1, int y1, int x2, int y2) {
return (long long)x1 * y2 - (long long)x2 * y1;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d%d", &X[i], &Y[i]);
hd = min(X[1], X[2]);
td = max(X[1], X[2]);
X[n + 1] = X[1];
Y[n + 1] = Y[1];
for (int i = 1; i <= n; ++i) {
while (hd <= td &&
cj(X[i + 1] - X[i], Y[i + 1] - Y[i], hd - X[i], Y[1] - Y[i]) > 0)
++hd;
while (hd <= td &&
cj(X[i + 1] - X[i], Y[i + 1] - Y[i], td - X[i], Y[1] - Y[i]) > 0)
--td;
}
printf("%d\n", td - hd + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
const double EPS = 1e-9;
complex<double> pt[maxn];
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long x[maxn], y[maxn];
double cross(complex<double> &a, complex<double> &b, complex<double> &c) {
return imag(conj(b - a) * (c - a));
}
bool eq(double a, double b) { return fabs(a - b) < EPS; }
bool lt(double a, double b) { return a + EPS < b; }
int main() {
complex<double> offset, rotation, aa, bb;
int n, i, ans, ansa, ansb;
long long stepx, stepy, g;
double xa, xb, curx, step;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x[i] >> y[i];
pt[i] = complex<double>((double)x[i], (double)y[i]);
}
offset = pt[0];
for (i = 0; i < n; i++) pt[i] -= offset;
rotation = pt[1];
for (i = 0; i < n; i++) pt[i] = pt[i] / rotation * abs(rotation);
xa = 0., xb = pt[1].real();
for (i = 2; i < n; i++) {
if (eq(pt[i - 1].imag(), pt[i].imag())) {
if (pt[i - 1].real() < pt[i].real()) {
printf("0");
return 0;
}
continue;
}
curx = cross(pt[0], pt[i - 1], pt[i]) / (pt[i].imag() - pt[i - 1].imag());
if (lt(pt[i - 1].imag(), pt[i].imag())) {
if (curx > xa) xa = curx;
} else {
if (curx < xb) xb = curx;
}
if (lt(xb, xa)) {
printf("0");
return 0;
}
}
g = gcd(x[1] - x[0], y[1] - y[0]);
stepx = (x[1] - x[0]) / g;
stepy = (y[1] - y[0]) / g;
step = sqrt(stepx * stepx + stepy * stepy + 0.);
ansb = (int)((xb + EPS) / step) + 1;
ansa = (xa - EPS < EPS ? 0 : (int)((xa - EPS) / step) + 1);
ans = ansb - ansa;
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int dbl_cmp(double d1, double d2) {
if (fabs(d1 - d2) <= 1e-9) {
return 0;
}
return d1 < d2 ? -1 : 1;
}
bool line_intersect(complex<double> &a, complex<double> &b, complex<double> &p,
complex<double> &q, complex<double> &ret) {
double d1 = ((conj(((p) - (a))) * (((b) - (a)))).imag());
double d2 = ((conj(((q) - (a))) * (((b) - (a)))).imag());
ret = (d1 * q - d2 * p) / (d1 - d2);
return dbl_cmp(d1, d2) != 0;
}
int main() {
int n;
scanf("%d", &n);
complex<double> p[1111];
bool dir = 0;
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
p[i] = complex<double>(x, y);
}
if (dbl_cmp(p[0].real(), p[1].real()) > 0) {
dir = 1;
swap(p[0], p[1]);
reverse(p + 2, p + n);
}
pair<double, double> v[1111];
for (int i = 0; i < n; i++) {
v[i] = pair<double, double>(p[0].real(), p[1].real());
}
for (int i = 1; i < n; i++) {
for (int j = 2; j < n; j++) {
if (j == i || j == i + 1) {
continue;
}
complex<double> p1, p2;
if (!line_intersect(p[0], p[1], p[j], p[(i + 0) % n], p1)) {
if (dbl_cmp(p[j].real(), p[(i + 0) % n].real()) < 0) {
p1 = complex<double>(+1e9, p[0].imag());
} else {
p1 = complex<double>(-1e9, p[0].imag());
}
}
if (!line_intersect(p[0], p[1], p[j], p[(i + 1) % n], p2)) {
if (dbl_cmp(p[j].real(), p[(i + 1) % n].real()) < 0) {
p2 = complex<double>(+1e9, p[0].imag());
} else {
p2 = complex<double>(-1e9, p[0].imag());
}
}
bool op1 =
dbl_cmp((sqrt((((p[(i + 0) % n]) - (p[j]))).real() *
(((p[(i + 0) % n]) - (p[j]))).real() +
(((p[(i + 0) % n]) - (p[j]))).imag() *
(((p[(i + 0) % n]) - (p[j]))).imag())) +
(sqrt((((p1) - (p[(i + 0) % n]))).real() *
(((p1) - (p[(i + 0) % n]))).real() +
(((p1) - (p[(i + 0) % n]))).imag() *
(((p1) - (p[(i + 0) % n]))).imag())),
(sqrt((((p1) - (p[j]))).real() * (((p1) - (p[j]))).real() +
(((p1) - (p[j]))).imag() * (((p1) - (p[j]))).imag())));
bool op2 =
dbl_cmp((sqrt((((p[(i + 1) % n]) - (p[j]))).real() *
(((p[(i + 1) % n]) - (p[j]))).real() +
(((p[(i + 1) % n]) - (p[j]))).imag() *
(((p[(i + 1) % n]) - (p[j]))).imag())) +
(sqrt((((p2) - (p[(i + 1) % n]))).real() *
(((p2) - (p[(i + 1) % n]))).real() +
(((p2) - (p[(i + 1) % n]))).imag() *
(((p2) - (p[(i + 1) % n]))).imag())),
(sqrt((((p2) - (p[j]))).real() * (((p2) - (p[j]))).real() +
(((p2) - (p[j]))).imag() * (((p2) - (p[j]))).imag())));
if (op1 && op2) {
continue;
} else if (op1) {
if ((((conj(((p[(i + 1) % n]) - (p[(i + 0) % n]))) *
(((p[j]) - (p[(i + 0) % n]))))
.imag()) > 1e-9) == dir) {
continue;
}
if (dbl_cmp(p[j].real(), p[(i + 0) % n].real()) < 0) {
p1 = complex<double>(+1e9, p[0].imag());
} else {
p1 = complex<double>(-1e9, p[0].imag());
}
} else if (op2) {
if ((((conj(((p[(i + 1) % n]) - (p[(i + 0) % n]))) *
(((p[j]) - (p[(i + 0) % n]))))
.imag()) > 1e-9) == dir) {
continue;
}
if (dbl_cmp(p[j].real(), p[(i + 1) % n].real()) < 0) {
p2 = complex<double>(+1e9, p[0].imag());
} else {
p2 = complex<double>(-1e9, p[0].imag());
}
}
if (dbl_cmp(p1.real(), p2.real()) > 0) {
swap(p1, p2);
}
pair<double, double> np = pair<double, double>(min(p1.real(), p2.real()),
max(p1.real(), p2.real()));
if (i < j) {
v[j].second = min(v[j].second, p1.real());
} else {
v[j].first = max(v[j].first, p2.real());
}
}
}
double a = min(p[0].real(), p[1].real()), b = max(p[0].real(), p[1].real());
for (int i = 0; i < n; i++) {
a = max(a, v[i].first);
b = min(b, v[i].second);
}
char x[100];
sprintf(x, "%.0lf %.0lf", a - 1e-9 + 0.5, b + 1e-9 - 0.5);
int s, e;
sscanf(x, "%d %d", &s, &e);
printf("%d\n", max(0, e - s + 1));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-8;
const int MAXN = 1000;
int n;
struct Point {
int x, y;
} p[MAXN + 10];
void getABC(Point x, Point y, double& a, double& b, double& c) {
a = y.y - x.y;
b = x.x - y.x;
c = y.x * (double)x.y - x.x * (double)y.y;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &p[i].x, &p[i].y);
}
bool rev = p[3].y > p[1].y;
p[n + 1] = p[1];
double lb = -1e9, rb = 1e9;
for (int i = 2; i <= n; i++) {
if (p[i].y != p[i + 1].y) {
double a, b, c;
getABC(p[i], p[i + 1], a, b, c);
double interPos = (b * p[1].y + c) / -a;
if (p[i + 1].y > p[i].y) {
lb = max(lb, interPos);
} else {
rb = min(rb, interPos);
}
} else if (!rev && p[i].x < p[i + 1].x || rev && p[i].x > p[i + 1].x) {
puts("0");
return 0;
}
}
int ilb = ceil(lb - EPS), irb = floor(rb + EPS);
printf("%d\n", max(0, irb - ilb + 1));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int gi() {
int w = 0;
bool q = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') q = 0, c = getchar();
while (c >= '0' && c <= '9') w = w * 10 + c - '0', c = getchar();
return q ? w : -w;
}
int x[N], y[N];
int main() {
int n = gi(), i, t, L, R;
double k;
for (i = 1; i <= n; i++) x[i] = gi(), y[i] = gi();
for (i = 1; i <= n; i++)
if (y[i] > y[1]) {
for (i = 1; i <= n; i++) y[i] = -y[i];
for (i = n >> 1; i; i--)
swap(x[i], x[n + 1 - i]), swap(y[i], y[n + 1 - i]);
for (i = n; i; i--) x[i + 2] = x[i], y[i + 2] = y[i];
x[2] = x[n + 2], y[2] = y[n + 2];
x[1] = x[n + 1], y[1] = y[n + 1];
break;
}
x[n + 1] = x[1], y[n + 1] = y[1];
L = x[1], R = x[2];
for (i = 2; i <= n; i++)
if (y[i] != y[i + 1]) {
k = (x[i + 1] - x[i]) / ((double)y[i + 1] - y[i]);
k = x[i] + k * (y[1] - y[i]);
if (y[i + 1] > y[i]) {
t = k - 1e-8 + 1;
if (t > x[2]) return puts("0"), 0;
L = max(L, t);
} else {
t = k;
if (k < x[1]) return puts("0"), 0;
R = min(R, t);
}
} else if (x[i + 1] > x[i])
return puts("0"), 0;
printf("%d\n", max(R - L + 1, 0));
return 0;
}
|
#include <bits/stdc++.h>
int n, x[1005], y[1005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &y[i]);
double L = x[1], R = x[2], w;
if (y[3] > y[1]) L = x[2], R = x[1];
for (int i = 3; i < n; i++) {
if (y[i] == y[i + 1])
w = 1e15 * ((x[i] < x[i + 1]) ^ (y[3] < y[1]) ? 1 : -1);
else
w = x[i] + 1. * (x[i] - x[i + 1]) / (y[i] - y[i + 1]) * (y[1] - y[i]);
if ((y[i] < y[i + 1]))
L = w > L ? w : L;
else
R = w < R ? w : R;
}
if (L > R + 1e-8)
printf("0");
else
printf("%d\n", int(R + 1 + 1e-8) - int(L + 1 - 1e-8));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (!b) return a;
return gcd(b, a % b);
}
struct Fraction {
long long p, q;
Fraction(long long p) : p(p), q(1) {}
Fraction(long long p, long long q) : p(p), q(q) { relax(); }
void relax() {
assert(q != 0);
if (q < 0) {
p = -p;
q = -q;
}
long long g = gcd(abs(p), abs(q));
p /= g;
q /= g;
}
bool operator<(const Fraction &t) const { return p * t.q < q * t.p; }
};
struct Point {
long long x, y;
Point operator-(const Point &t) const { return {x - t.x, y - t.y}; }
};
inline long long cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
inline long long ccw(Point a, Point b, Point c) { return cross(b - a, c - a); }
bool inAngle(Point p, Point a, Point b, Point o) {
assert(ccw(a, b, o) != 0);
if (ccw(a, b, o) < 0) swap(a, b);
return ccw(a, p, o) >= 0 && ccw(b, p, o) <= 0;
}
Fraction findRatio(Point p, Point a, Point b, Point o) {
a = a - o;
b = b - o;
p = p - o;
return Fraction(cross(a, p), cross(a, p) - cross(b, p));
}
const int MAXN = 1050;
Point a[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%lld%lld", &a[i].x, &a[i].y);
Fraction l(0, 1), r(1, 1);
for (int k = 2; k < n; k++) {
for (int i = 2; i < k; i++) {
if (inAngle(a[i], a[0], a[1], a[k]))
r = min(r, findRatio(a[i], a[0], a[1], a[k]));
else if (ccw(a[k], a[1], a[i]) > 0) {
printf("0\n");
return 0;
}
}
for (int i = k + 1; i < n; i++) {
if (inAngle(a[i], a[0], a[1], a[k]))
l = max(l, findRatio(a[i], a[0], a[1], a[k]));
else if (ccw(a[k], a[0], a[i]) < 0) {
printf("0\n");
return 0;
}
}
}
long long g = gcd(abs(a[0].x - a[1].x), abs(a[0].y - a[1].y));
long long lbnd = (l.p * g - 1) / l.q + 1, rbnd = r.p * g / r.q;
if (lbnd <= rbnd)
printf("%lld\n", rbnd - lbnd + 1);
else
printf("0\n");
}
|
#include <bits/stdc++.h>
using namespace std;
long long cross2(long long x1, long long y1, long long x2, long long y2) {
return x1 * y2 - x2 * y1;
}
long long cross(long long i, long long j, long long k, const long long* xx,
const long long* yy) {
return cross2(xx[j] - xx[i], yy[j] - yy[i], xx[k] - xx[i], yy[k] - yy[i]);
}
int main() {
int n;
cin >> n;
auto* xx = new long long[n];
auto* yy = new long long[n];
for (int i = 0; i < n; i++) {
cin >> xx[i];
cin >> yy[i];
}
bool flip = xx[0] < xx[1];
long long x = xx[1], y = yy[1];
for (int i = 0; i < n; i++) {
xx[i] -= x;
yy[i] -= y;
if (flip) {
xx[i] = -xx[i];
yy[i] = -yy[i];
}
}
long long left = 0, right = xx[0];
for (int i = 2; i + 1 < n; i++) {
long long cright = cross(i, i + 1, 0, xx, yy);
long long cleft = cross(i, i + 1, 1, xx, yy);
if (cright > 0 && cleft > 0) {
cout << 0;
return 0;
}
long long x0 = xx[i], y0 = yy[i], x1 = xx[i + 1], y1 = yy[i + 1];
if (cright > 0 || cleft > 0) {
long long p = x0 * (y1 - y0) - y0 * (x1 - x0);
long long q = y1 - y0;
if (q < 0) {
p = -p;
q = -q;
}
if (cright > 0)
right = min(right, (p / q));
else
left = max(left, ((p + q - 1) / q));
}
}
cout << (left <= right ? right - left + 1 : 0) << endl;
}
|
#include <bits/stdc++.h>
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int xx[1000], yy[1000];
long long cross2(long long x1, long long y1, long long x2, long long y2) {
return x1 * y2 - x2 * y1;
}
long long cross(int i, int j, int k) {
return cross2(xx[j] - xx[i], yy[j] - yy[i], xx[k] - xx[i], yy[k] - yy[i]);
}
int main() {
int n, i, flip, x, y, l, r;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d%d", &xx[i], &yy[i]);
flip = xx[0] < xx[1];
x = xx[1], y = yy[1];
for (i = 0; i < n; i++) {
xx[i] -= x;
yy[i] -= y;
if (flip) {
xx[i] = -xx[i];
yy[i] = -yy[i];
}
}
l = 0, r = xx[0];
for (i = 2; i + 1 < n; i++) {
long long cr = cross(i, i + 1, 0);
long long cl = cross(i, i + 1, 1);
int x0, y0, x1, y1;
if (cr > 0 && cl > 0) {
printf("0\n");
return 0;
}
x0 = xx[i], y0 = yy[i], x1 = xx[i + 1], y1 = yy[i + 1];
if (cr > 0 || cl > 0) {
long long p = (long long)x0 * (y1 - y0) - (long long)y0 * (x1 - x0);
long long q = y1 - y0;
if (q < 0) p = -p, q = -q;
if (cr > 0)
r = min(r, p / q);
else
l = max(l, (p + q - 1) / q);
}
}
printf("%d\n", l <= r ? r - l + 1 : 0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1010;
const int INF = 1000000000;
int n;
int x[MaxN], y[MaxN], tx[MaxN], ty[MaxN];
long double L, R;
long double det(long double x1, long double y1, long double x2, long double y2,
long double x3, long double y3) {
return x1 * y2 - x2 * y1 + x2 * y3 - x3 * y2 + x3 * y1 - x1 * y3;
}
void line(long double x1, long double y1, long double x2, long double y2,
long double y0, long double& x0) {
long double A = y1 - y2;
long double B = x2 - x1;
long double C = A * x1 + B * y1;
x0 = (C - B * y0) / A;
}
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) cin >> x[i] >> y[i];
L = x[1], R = x[2];
if (L > R) {
for (int i = 1, j = 2; i <= n; ++i) {
tx[i] = x[j];
ty[i] = -y[j];
--j;
if (!j) j = n;
}
for (int i = 1; i <= n; ++i) {
x[i] = tx[i];
y[i] = ty[i];
}
swap(L, R);
}
for (int i = 3; i <= n; ++i) {
int px = x[1], py = y[1];
for (int j = i + 1; j <= n; ++j)
if (det(x[i], y[i], x[j], y[j], px, py) > 0) {
px = x[j];
py = y[j];
}
long double tmp;
line(x[i], y[i], px, py, y[1], tmp);
L = max(L, tmp);
px = x[2], py = y[2];
for (int j = 3; j < i; ++j)
if (det(x[i], y[i], px, py, x[j], y[j]) > 0) {
px = x[j];
py = y[j];
}
line(x[i], y[i], px, py, y[1], tmp);
R = min(R, tmp);
}
int ans = 0;
for (int i = L - 1; i <= R + 1; ++i)
if (L <= i && i <= R) ++ans;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
complex<long long> p[1005];
double cross_product(complex<long long> p, complex<long long> a,
complex<long long> b) {
return (double)imag(conj(a - p) * (b - p));
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int x, y;
scanf("%d%d", &x, &y);
p[i] = complex<long long>(x, y);
}
long long lx, L, rx, R, y;
lx = real(p[0]), rx = real(p[1]);
if (lx > rx) swap(lx, rx);
L = lx, R = rx, y = imag(p[0]);
for (int i = 1; i < n; ++i) {
while (lx <= R &&
cross_product(complex<long long>(lx, y), p[i], p[(i + 1) % n]) > 0)
lx++;
while (rx >= L &&
cross_product(complex<long long>(rx, y), p[i], p[(i + 1) % n]) > 0)
rx--;
}
if (lx > rx)
printf("0\n");
else
printf("%d\n", (int)(rx - lx + 1));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-6;
struct pos {
double x, y;
};
struct vec {
double x, y;
};
struct seg {
pos a, b;
};
long long sign(double x) { return x < -eps ? -1 : x > eps ? 1 : 0; }
double dot(vec a, vec b) { return a.x * b.x + a.y * b.y; }
double cross(vec a, vec b) { return a.x * b.y - a.y * b.x; }
vec fwd(pos a, pos b) { return {b.x - a.x, b.y - a.y}; }
void mkang(pos src, pos A, pos B) {}
pos operator+(pos p, vec v) { return {p.x + v.x, p.y + v.y}; }
vec operator*(vec v, double t) { return {v.x * t, v.y * t}; }
bool checkInt(seg a, seg b) {
return sign(cross(fwd(a.a, a.b), fwd(b.a, b.b))) != 0;
}
void prt(pos p) { cout << "p(" << p.x << "," << p.y << ") "; }
void prt(vec p) { cout << "v(" << p.x << "," << p.y << ") "; }
pos segIntSeg(seg a, seg b) {
double t =
cross(fwd(a.a, b.a), fwd(a.a, a.b)) / cross(fwd(a.a, a.b), fwd(b.a, b.b));
return b.a + fwd(b.a, b.b) * t;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
;
long long n;
cin >> n;
vector<pos> v(n);
for (long long i = 0; i < n; i++) cin >> v[i].x >> v[i].y;
seg ln = {v[0], v[1]};
if (v[0].x > v[1].x) {
for (long long i = 0; i < n; i++) {
v[i].x = -v[i].x;
v[i].y = -v[i].y;
}
}
double L = v[0].x, R = v[1].x;
for (long long i = 2; i < n; i++) {
for (long long j = 2; j < i; j++) {
seg ln2 = {v[i], v[j]};
if (!checkInt(ln, ln2)) {
if (v[j].x < v[i].x) R = L - 1;
continue;
}
pos p = segIntSeg(ln, ln2);
if (sign(dot(fwd(v[i], v[j]), fwd(v[i], p))) < 0) continue;
R = min(R, p.x);
}
for (long long j = i + 1; j < n; j++) {
seg ln2 = {v[i], v[j]};
if (!checkInt(ln, ln2)) {
if (v[j].x > v[i].x) L = R + 1;
continue;
}
pos p = segIntSeg(ln, ln2);
if (sign(dot(fwd(v[i], v[j]), fwd(v[i], p))) < 0) continue;
L = max(L, p.x);
}
}
long long cnt = floor(R) - ceil(L) + 1;
cout << max(cnt, 0LL) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int n, i, t, ee, flag;
long long x[1010], y[1010];
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++) scanf("%I64d%I64d", &x[i], &y[i]);
t = n;
if (y[n] > y[1])
for (i = 1; i <= n; i++) y[i] = -y[i], x[i] = -x[i];
for (i = x[1]; i <= x[2] && t > 2; i++)
for (;
(x[t] - i) * (y[t - 1] - y[1]) - (x[t - 1] - i) * (y[t] - y[1]) >= 0 &&
t > 2;
t--)
;
ee = i - 1;
t = 2;
for (i = x[2]; i >= x[1] && t < n; i--)
for (;
(x[t] - i) * (y[t + 1] - y[1]) - (x[t + 1] - i) * (y[t] - y[1]) <= 0 &&
t < n;
t++)
;
i++;
if (i - ee + 1 > 0)
printf("%d\n", i - ee + 1);
else
printf("0\n");
}
|
#include <bits/stdc++.h>
using namespace std;
struct point {
double x, y;
point() {}
point(double x, double y) : x(x), y(y) {}
double operator*(const point &b) const {
double tmp(x * b.y - y * b.x);
if (tmp == 0)
return 0;
else
return tmp > 0 ? 1 : -1;
}
point operator-(const point &b) { return point(x - b.x, y - b.y); }
void operator-=(const point &b) {
x -= b.x;
y -= b.y;
}
void get() { cin >> x >> y; }
};
vector<point> pnt;
int n;
bool up;
double L, R;
stack<int> st;
int RST(point r, point s, point t) {
double val = t.x * (r.y - s.y) + t.y * (s.x - r.x) + r.x * s.y - r.y * s.x;
if (val < 0) return -1;
return 1;
}
bool RSCAN() {
while (!st.empty()) st.pop();
int r(1), s(2), t(3), x;
st.push(r);
st.push(s);
st.push(t);
while (t != n) {
x = s - 1;
if ((pnt[t] - pnt[r]) * (pnt[t] - pnt[s]) > 0 &&
(pnt[t] - pnt[x]) * (pnt[t] - pnt[s]) < 0) {
puts("0");
return 0;
}
while (st.size() != 1 && (pnt[t] - pnt[r]) * (pnt[t] - pnt[s]) < 0) {
st.pop();
s = st.top();
if (st.size() > 1) {
int tmp(st.top());
st.pop();
r = st.top();
st.push(tmp);
}
}
double inx;
if ((fabs(pnt[s].y - pnt[t].y) <= 1e-9)) {
puts("0");
return 0;
}
inx = ((pnt[s].x - pnt[t].x) * (pnt[0].y - pnt[t].y) /
(pnt[s].y - pnt[t].y)) +
pnt[t].x;
if (inx > (pnt[up].x - 1e-9) && inx < (pnt[1 - up].x + 1e-9)) {
if (up) {
if (inx > L - 1e-9) L = inx;
} else if (inx < R + 1e-9)
R = inx;
} else {
puts("0");
return 0;
}
st.push(t);
r = s;
s = t;
t++;
}
return 1;
}
bool LSCAN() {
while (!st.empty()) st.pop();
int r(n), s(n - 1), t(n - 2), x;
st.push(r);
st.push(s);
while (t != 1) {
x = s + 1;
if ((pnt[t] - pnt[r]) * (pnt[t] - pnt[s]) < 0 &&
(pnt[t] - pnt[x]) * (pnt[t] - pnt[s]) > 0) {
puts("0");
return 0;
}
while (st.size() != 1 && (pnt[t] - pnt[r]) * (pnt[t] - pnt[s]) > 0) {
st.pop();
s = st.top();
if (st.size() > 1) {
int tmp(st.top());
st.pop();
r = st.top();
st.push(tmp);
}
}
double inx;
if ((fabs(pnt[s].y - pnt[t].y) <= 1e-9)) {
puts("0");
return 0;
}
inx = ((pnt[s].x - pnt[t].x) * (pnt[0].y - pnt[t].y) /
(pnt[s].y - pnt[t].y)) +
pnt[t].x;
if (inx > (pnt[up].x - 1e-9) && inx < (pnt[1 - up].x + 1e-9)) {
if (!up) {
if (inx > L - 1e-9) L = inx;
} else if (inx < R + 1e-9)
R = inx;
} else {
puts("0");
return 0;
}
st.push(t);
r = s;
s = t;
t--;
}
return 1;
}
int main() {
cin >> n;
pnt.clear();
pnt.resize(n + 1);
for (int i(0); i < n; ++i) pnt[i].get();
pnt[n] = pnt[0];
if (pnt[2].y > pnt[0].y)
L = pnt[1].x, R = pnt[0].x, up = 1;
else
L = pnt[0].x, R = pnt[1].x, up = 0;
if (LSCAN() && RSCAN())
if (R + 1e-9 <= L)
puts("0");
else
cout << floor(R + 1e-9) - ceil(L - 1e-9) + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, i, j, k, a, b;
int x[1010], y[1010];
double mn, mx, xx;
double intersectie(int a, int b) {
double rez, m, n;
if (x[a] == x[b]) return x[a];
m = 1.0 * (y[a] - y[b]) / (x[a] - x[b]);
n = 1.0 * y[a] - m * x[a];
return (1.0 * y[1] - n) / m;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d%d", &x[i], &y[i]);
}
if (y[3] > y[1]) {
for (int i = 2; i <= n; ++i) {
x[i] = x[1] - (x[i] - x[1]);
y[i] = y[1] - (y[i] - y[1]);
}
}
x[n + 1] = x[1];
y[n + 1] = y[1];
mn = x[1];
mx = x[2];
for (int i = 2; i <= n; ++i) {
if (y[i] == y[i + 1]) {
if (x[i] < x[i + 1]) {
printf("0\n");
return 0;
}
continue;
}
xx = intersectie(i, i + 1);
if (y[i] > y[i + 1])
mx = min(mx, xx);
else
mn = max(mn, xx);
}
if (mn > mx) {
printf("0\n");
return 0;
}
for (int i = -2000100; i <= 2000100; ++i) {
if (i < mn) a = i;
if (i <= mx) b = i;
}
a++;
printf("%d\n", max(0, b - a + 1));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct point {
int x;
int y;
point() {}
point(const int x, const int y) : x(x), y(y) {}
} A[500000];
inline bool leftTurn(point A, point B) {
return (long long)A.x * B.y < (long long)A.y * B.x;
}
inline bool rightTurn(point A, point B) { return !leftTurn(A, B); }
point makeVector(point A, point B) { return point(B.x - A.x, B.y - A.y); }
int n;
inline long long ceil(long long n, long long m) { return n / m + (n % m != 0); }
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &A[i].x, &A[i].y);
}
int left = A[0].x;
int right = A[1].x;
for (int i = 2; i < n - 1; i++) {
point segment = makeVector(A[i], A[i + 1]);
if (leftTurn(makeVector(A[i], A[0]), segment) &&
leftTurn(makeVector(A[i], A[1]), segment)) {
printf("0\n");
return 0;
}
if (!rightTurn(makeVector(A[i], A[0]), segment) ||
!rightTurn(makeVector(A[i], A[1]), segment)) {
if (A[i].y < A[i + 1].y && A[0].x < A[1].x) {
long long x = ceil((long long)A[i].x * segment.y +
(long long)segment.x * (A[0].y - A[i].y),
segment.y);
if (left < x) left = x;
} else if (A[i].y > A[i + 1].y && A[0].x < A[1].x) {
long long x = (long long)A[i].x * segment.y +
(long long)segment.x * (A[0].y - A[i].y);
x /= segment.y;
if (x < right) right = x;
} else if (A[i].y > A[i + 1].y && A[0].x > A[1].x) {
long long x = (long long)A[i].x * segment.y +
(long long)segment.x * (A[0].y - A[i].y);
x /= segment.y;
if (x < left) left = x;
} else if (A[i].y < A[i + 1].y && A[0].x > A[1].x) {
long long x = ceil((long long)A[i].x * segment.y +
(long long)segment.x * (A[0].y - A[i].y),
segment.y);
if (right < x) right = x;
}
}
}
int len;
if (A[0].x < A[1].x)
len = right - left + 1;
else
len = left - right + 1;
if (len < 0) len = 0;
printf("%d\n", len);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf(1010101010);
int n;
struct pt {
long long x, y;
};
void rr(pt& p) { cin >> p.x >> p.y; }
pt p[1005];
long long sgn(pt& p1, pt& p2, pt& p3) {
return (p1.x - p3.x) * (p2.y - p3.y) - (p2.x - p3.x) * (p1.y - p3.y);
}
long long fdiv(long long x, long long y) { return (x - (x % y + y) % y) / y; }
long long cdiv(long long x, long long y) {
if (x % y == 0) return x / y;
return fdiv(x, y) + 1;
}
void must_neg(pt& p1, pt& p2, pt& p3, long long& lb, long long& ub) {
long long b(p3.x * (p2.y - p3.y) + (p2.x - p3.x) * (p1.y - p3.y));
long long a(p2.y - p3.y);
if (a == 0) {
if (b < 0) lb = inf;
}
if (a > 0) {
ub = min(ub, fdiv(b, a));
}
if (a < 0) {
lb = max(lb, cdiv(-b, -a));
}
}
int main() {
cin >> n;
for (int i(0); i < (n); i++) rr(p[i]);
long long lb(min(p[0].x, p[1].x)), ub(max(p[0].x, p[1].x));
for (int i(1); i < (n - 1); i++) {
must_neg(p[0], p[i], p[(i + 1) % n], lb, ub);
}
cout << max(0LL, ub - lb + 1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
double x, y;
};
const int maxn = 1010;
int n;
node v[maxn], t[maxn];
int cmp(double x) {
if (fabs(x) <= 1e-8) return 0;
if (x > 1e-8) return 1;
return -1;
}
double det(node a, node b, node c) {
return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y);
}
double dot(node a, node b, node c) {
return (b.x - a.x) * (c.x - a.x) + (b.y - a.y) * (c.y - a.y);
}
void get(node m1, node m2, double &a1, double &b1, double &c1) {
a1 = m1.y - m2.y;
b1 = m2.x - m1.x;
c1 = m1.x * m2.y - m2.x * m1.y;
}
node getcross(double a1, double b1, double c1, double a2, double b2,
double c2) {
node ans;
ans.x = (b1 * c2 - b2 * c1) / (a1 * b2 - a2 * b1);
ans.y = (a1 * c2 - a2 * c1) / (b1 * a2 - b2 * a1);
return ans;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> v[i].x >> v[i].y;
if (v[1].x > v[2].x) {
for (int i = 1; i <= n; i++) t[i] = v[i], t[i].y *= -1;
v[1] = t[2];
v[2] = t[1];
for (int i = n, cur = 3; i >= 3; i--, cur++) v[cur] = t[i];
}
double L = v[1].x, R = v[2].x;
L = v[1].x, R = v[2].x;
for (int i = 4; i <= n; i++)
if (cmp(det(v[2], v[1], v[i])) * cmp(det(v[2], v[i - 1], v[i])) > 0) {
R--;
break;
}
for (int i = n - 1; i >= 3; i--)
if (cmp(det(v[1], v[2], v[i])) * cmp(det(v[1], v[i + 1], v[i])) > 0) {
L++;
break;
}
for (int i = 3; i <= n; i++) {
for (int j = 3; j < i; j++) {
if (cmp(v[j].y - v[i].y) <= 0) continue;
double a1, b1, c1, a2, b2, c2;
get(v[i], v[j], a1, b1, c1);
get(v[1], v[2], a2, b2, c2);
node cross = getcross(a1, b1, c1, a2, b2, c2);
R = min(R, cross.x);
}
for (int j = i + 1; j <= n; j++) {
if (cmp(v[j].y - v[i].y) <= 0) continue;
double a1, b1, c1, a2, b2, c2;
get(v[i], v[j], a1, b1, c1);
get(v[1], v[2], a2, b2, c2);
if (!cmp(v[i].y - v[j].y)) continue;
node cross = getcross(a1, b1, c1, a2, b2, c2);
L = max(L, cross.x);
}
}
int ans = 0;
for (int i = 0; i <= 1000000; i++)
if (cmp((double)i - L) >= 0 && cmp((double)i - R) <= 0) ans++;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
const double eps = 1e-8;
int n, x[maxn], y[maxn];
double w, L, R;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &y[i]);
L = x[1], R = x[2];
if (y[3] > y[1]) L = x[2], R = x[1];
for (int i = 3; i < n; i++) {
if (y[i] == y[i + 1])
w = 1e15 * ((x[i] < x[i + 1]) ^ (y[3] < y[1]) ? 1 : -1);
else
w = x[i] + 1. * (x[i] - x[i + 1]) / (y[i] - y[i + 1]) * (y[1] - y[i]);
if ((y[i] < y[i + 1]))
L = w > L ? w : L;
else
R = w < R ? w : R;
}
if (L > R + eps)
puts("0");
else
printf("%d\n", int(R + 1 + 1e-8) - int(L + 1 - 1e-8));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mod(int first) {
if (first < 0) return -first;
return first;
}
int area(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
long long aux = (long long)a.first * (b.second - c.second) +
(long long)b.first * (c.second - a.second) +
(long long)c.first * (a.second - b.second);
if (aux < 0) return -1;
return (aux > 0);
}
const int maxn = 1005;
int n, i, normal, sgn, first, second, j, step;
pair<int, int> a[maxn], left2, right2;
int main() {
cin >> n;
for (i = 1; i <= n; ++i) cin >> a[i].first >> a[i].second;
a[n + 1] = a[1];
sgn = a[2].first - a[1].first;
if (sgn < 0)
sgn = -1;
else
sgn = 1;
left2 = a[1];
right2 = a[2];
for (i = 2; i <= n; ++i) {
first = area(a[i], a[i + 1], left2);
second = area(a[i], a[i + 1], right2);
if (first > 0 && second > 0) {
cout << "0";
return 0;
}
if (first <= 0 && second <= 0) continue;
if (first <= 0) {
for (step = 1; step < mod(a[2].first - a[1].first); step <<= 1)
;
for (j = left2.first; step; step >>= 1)
if (area(a[i], a[i + 1], make_pair(j + step * sgn, left2.second)) <= 0)
j += step * sgn;
right2.first = j;
continue;
}
for (step = 1; step < mod(a[2].first - a[1].first); step <<= 1)
;
for (j = right2.first; step; step >>= 1) {
if (area(a[i], a[i + 1], make_pair(j - step * sgn, left2.second)) <= 0)
j -= step * sgn;
left2.first = j;
continue;
}
}
cout << mod(right2.first - left2.first) + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
cin >> n;
vector<long long> left, right;
vector<long long> vx(n), vy(n);
for (long long i = 0; i < ((long long)n); i++) cin >> vx[i] >> vy[i];
for (long long i = 0; i < ((long long)n); i++) {
long long next = (i + 1) % n;
if (vy[i] == vy[next]) {
if ((vx[1] - vx[0]) * (vx[next] - vx[i]) < 0 || i == 0) continue;
cout << "0" << endl;
return 0;
}
long long dx = vx[i] - vx[next];
long long dy = vy[i] - vy[next];
long long c = -(dx * vy[i] - dy * vx[i]);
long long sum = vy[0] * dx + c;
long long x = sum / dy;
if (sum % dy) {
if (vy[i] < vy[next])
x = (long long)ceil((double)sum / (double)dy);
else
x = (long long)floor((double)sum / (double)dy);
}
if (vy[i] < vy[next])
left.push_back(x);
else
right.push_back(x);
}
left.push_back(min(vx[0], vx[1]));
right.push_back(max(vx[0], vx[1]));
long long r = *min_element(right.begin(), right.end());
long long l = *max_element(left.begin(), left.end());
cout << max(0ll, r - l + 1) << endl;
}
|
#include <bits/stdc++.h>
class P {
public:
P(long long int _x, long long int _y) : x(_x), y(_y) {}
long long int x;
long long int y;
bool operator<(P const &rhs) const {
if (x == rhs.x) return y < rhs.y;
return x < rhs.x;
}
double getSlope() const { return double(y / x); };
bool operator==(P const &rhs) const { return x == rhs.x && y == rhs.y; }
};
P operator-(P const &lhs, P const &rhs) {
return P(lhs.x - rhs.x, lhs.y - rhs.y);
}
long long int cross3(P const &a, P const &b, P const &c) {
P one = b - a;
P two = c - b;
return one.x * two.y - two.x * one.y;
}
long long int getIntPoints(long long int const a, long long int const b) {
return std::abs(a - b) + 1;
}
double getIntersection(P const &seg, P const &base, P const &a) {
double yShift = base.y - a.y;
double xShift = yShift / seg.y * seg.x;
return a.x + xShift;
}
long long int solve(std::vector<P> const &points) {
if (points.size() == 3) {
return getIntPoints(points[0].x, points[1].x);
}
P a = points[0], b = points[1];
P min = points[0], max = points[1];
if (max < min) {
std::swap(min, max);
}
for (int i = 2; i < points.size(); i++) {
P seg = points[i] - points[i - 1];
auto c = cross3(min, points[i - 1], points[i]);
if (c > 0) {
if (seg.y == 0) {
min.x = max.x + 1;
} else if (seg.x == 0) {
min.x = std::max(points[i].x, min.x);
} else {
min.x = std::max(double(min.x),
std::ceil(getIntersection(seg, points[0], points[i])));
}
}
c = cross3(max, points[i - 1], points[i]);
if (c > 0) {
if (seg.y == 0) {
max.x = min.x - 1;
} else if (seg.x == 0) {
max.x = std::min(points[i].x, max.x);
} else {
max.x = std::min(std::floor(getIntersection(seg, points[0], points[i])),
double(max.x));
}
}
if (min.x > max.x) return 0;
}
return getIntPoints(min.x, max.x);
}
int main() {
int c;
long long int x, y;
std::vector<P> points;
std::cin >> c;
points.reserve(c);
while (c > 0) {
std::cin >> x >> y;
points.emplace_back(x, y);
c--;
}
std::cout << solve(points);
}
|
#include <bits/stdc++.h>
using namespace std;
struct point {
int x, y;
};
point p[1001];
double cross(point a, point b, point c, point d) {
double x1 = b.x - a.x, y1 = b.y - a.y, x2 = d.x - c.x, y2 = d.y - c.y;
return x1 * y2 - x2 * y1;
}
int main(void) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d %d", &p[i].x, &p[i].y);
point l = p[1], r = p[2];
if (l.x > r.x) swap(l, r);
for (int i = 3; i < n; ++i) {
while ((l.x <= r.x) && (cross(p[i], p[i + 1], p[i], l) > 0)) ++l.x;
while ((l.x <= r.x) && (cross(p[i], p[i + 1], p[i], r) > 0)) --r.x;
if (l.x > r.x) {
printf("0\n");
return 0;
}
}
printf("%d\n", r.x - l.x + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
struct point {
double x, y;
point() {}
point(double _x, double _y) {
x = _x;
y = _y;
}
point operator+(const point &t) { return point(x + t.x, y + t.y); }
point operator-(const point &t) { return point(x - t.x, y - t.y); }
double dist(const point &t) {
return ((x - t.x) * (x - t.x) + (y - t.y) * (y - t.y));
}
};
struct line {
double a, b, c;
line() {}
line(double _a, double _b, double _c) {
a = _a;
b = _b;
c = _c;
}
void build(const point &p, const point &q) {
a = p.y - q.y;
b = q.x - p.x;
c = -(p.x * (p.y - q.y) + p.y * (q.x - p.x));
}
};
int n, lt, rt;
point p[2000];
double mx = 1e+15, mn = -(1e+15);
bool intersect(const line &a, point &res) {
if (fabs(a.a) <= eps) return false;
res.y = p[0].y;
res.x = (-a.c - (a.b * res.y)) / a.a;
return true;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%lf%lf", &p[i].x, &p[i].y);
p[n] = p[0];
lt = int(min(p[0].x, p[1].x));
rt = int(max(p[0].x, p[1].x));
p[n + 1] = p[1];
for (int i = 1; i < n; i++) {
line l;
l.build(p[i], p[i + 1]);
point res, tt = p[i + 1] - p[i];
if (intersect(l, res)) {
if (tt.y < eps)
mx = min(mx, res.x);
else
mn = max(mn, res.x);
} else if ((p[1].x - p[0].x) * tt.x > eps) {
printf("0\n");
return 0;
}
}
int x = ceil(mn - eps), y = floor(mx + eps);
printf("%d\n", max(0, min(y, rt) - max(x, lt) + 1));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int xx[1000], yy[1000];
int N;
long long cross(int i, int j, int k) {
long long x1 = xx[j] - xx[i];
long long y1 = yy[j] - yy[i];
long long x2 = xx[k] - xx[i];
long long y2 = yy[k] - yy[i];
return x1 * y2 - x2 * y1;
}
bool canBeTower(int x1, int x2, int N) {
int ax = xx[0];
xx[0] = x1;
bool res = true;
for (int i = 2; i + 1 < N; i++) {
long long left = cross(i, i + 1, 0);
long long right = cross(i, i + 1, 0);
if (left > 0 && right > 0) {
res = false;
break;
}
}
xx[0] = ax;
return res;
}
int lowerBound(vector<int>& arr, int N) {
int left = 0, right = arr.size() - 1;
while (left <= right) {
int m = (int)(left + right) / 2;
m = arr[m];
if (canBeTower(m, m, N)) {
right = m;
} else {
left = m + 1;
}
}
return left;
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) cin >> xx[i] >> yy[i];
bool flip = xx[0] < xx[1];
int x = xx[0], y = yy[0];
for (int i = 0; i < N; i++) {
xx[i] -= x;
yy[i] -= y;
}
int left = min(xx[0], xx[1]);
int right = max(xx[0], xx[1]);
int total = 0;
vector<int> arr;
for (int i = left; i <= right; i++) arr.push_back(i);
int lower = 0, upper = arr.size() - 1;
while (lower < upper && canBeTower(arr[lower], arr[lower], N) == false)
lower++;
while (lower < upper && canBeTower(arr[upper], arr[upper], N) == false)
upper--;
bool l = canBeTower(arr[lower], arr[lower], N);
bool r = canBeTower(arr[upper], arr[upper], N);
total = upper - lower + 1;
if ((l && r) == false) {
total = 0;
if (l) total++;
if (r) total++;
}
cout << total << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 11111;
double Area, Length;
double P_x_min, P_x_max;
double P_y_min, P_y_max;
struct Point {
double x, y;
Point() {}
Point(double _x, double _y) : x(_x), y(_y) {}
} p[N];
Point MakeVector(Point &P, Point &Q) { return Point(Q.x - P.x, Q.y - P.y); }
double CrossProduct(Point P, Point Q) { return P.x * Q.y - P.y * Q.x; }
double MultiCross(Point P, Point Q, Point R) {
return CrossProduct(MakeVector(Q, P), MakeVector(Q, R));
}
struct halfPlane {
Point s, t;
double angle;
halfPlane() {}
halfPlane(Point _s, Point _t) : s(_s), t(_t) {}
halfPlane(double sx, double sy, double tx, double ty)
: s(sx, sy), t(tx, ty) {}
void GetAngle() { angle = atan2(t.y - s.y, t.x - s.x); }
} hp[N], q[N];
Point IntersectPoint(halfPlane P, halfPlane Q) {
double a1 = CrossProduct(MakeVector(P.s, Q.t), MakeVector(P.s, Q.s));
double a2 = CrossProduct(MakeVector(P.t, Q.s), MakeVector(P.t, Q.t));
return Point((P.s.x * a2 + P.t.x * a1) / (a2 + a1),
(P.s.y * a2 + P.t.y * a1) / (a2 + a1));
}
bool cmp(halfPlane P, halfPlane Q) {
if (fabs(P.angle - Q.angle) < 1e-8) return MultiCross(P.s, P.t, Q.s) > 0;
return P.angle < Q.angle;
}
bool IsParallel(halfPlane P, halfPlane Q) {
return fabs(CrossProduct(MakeVector(P.s, P.t), MakeVector(Q.s, Q.t))) < 1e-8;
}
void HalfPlaneIntersect(int n, int &m) {
sort(hp, hp + n, cmp);
int i, l = 0, r = 1;
for (m = i = 1; i < n; ++i)
if (hp[i].angle - hp[i - 1].angle > 1e-8) hp[m++] = hp[i];
n = m;
m = 0;
q[0] = hp[0], q[1] = hp[1];
for (i = 2; i < n; ++i) {
if (IsParallel(q[r], q[r - 1]) || IsParallel(q[l], q[l + 1])) return;
while (l < r &&
MultiCross(hp[i].s, hp[i].t, IntersectPoint(q[r], q[r - 1])) > 0)
--r;
while (l < r &&
MultiCross(hp[i].s, hp[i].t, IntersectPoint(q[l], q[l + 1])) > 0)
++l;
q[++r] = hp[i];
}
while (l < r &&
MultiCross(q[l].s, q[l].t, IntersectPoint(q[r], q[r - 1])) > 0)
--r;
while (l < r &&
MultiCross(q[r].s, q[r].t, IntersectPoint(q[l], q[l + 1])) > 0)
++l;
q[++r] = q[l];
for (i = l; i < r; ++i) p[m++] = IntersectPoint(q[i], q[i + 1]);
}
void Solve(Point *p, int n, int &m) {
int i, j;
Point a, b;
p[n] = p[0];
for (i = 0; i < n; i++) {
hp[i] = halfPlane(p[(i + 1) % n], p[i]);
hp[i].GetAngle();
}
a = p[0], b = p[1];
HalfPlaneIntersect(n, m);
Area = 0;
Length = 0;
P_x_min = P_x_max = 0;
P_y_min = P_y_max = 0;
if (m > 2) {
if (a.x > b.x) swap(a, b);
int f2 = 0, f1 = 0;
for (int i = 0; i < m; i++) {
if (p[i].y == a.y && p[(i + 1) % m].y == a.y) {
f2 = 1;
a = p[i];
b = p[(i + 1) % m];
break;
} else if (p[i].y == a.y)
f1 = 1;
}
if (f1 && !f2)
Length = 1;
else if (f2) {
if (a.x > b.x) swap(a, b);
Length = (int)(b.x - a.x) + 1;
}
}
if (m > 2) {
p[m] = p[0];
for (i = 0; i < m; ++i) Area += CrossProduct(p[i], p[i + 1]);
if (Area < 0) Area = -Area;
}
Area /= 2.0;
}
int main() {
int n, m, t;
Point a, b;
while (cin >> n) {
for (int i = 0; i < n; i++) cin >> p[i].x >> p[i].y;
Solve(p, n, m);
cout << Length << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct point {
double x, y;
point() {}
point(double x, double y) : x(x), y(y) {}
double operator*(const point &b) const {
double tmp(x * b.y - y * b.x);
if (tmp == 0)
return 0;
else
return tmp > 0 ? 1 : -1;
}
point operator-(const point &b) { return point(x - b.x, y - b.y); }
void operator-=(const point &b) {
x -= b.x;
y -= b.y;
}
void get() { cin >> x >> y; }
};
vector<point> pnt;
int n;
bool up;
double L, R;
stack<int> st;
int RST(point r, point s, point t) {
double val = t.x * (r.y - s.y) + t.y * (s.x - r.x) + r.x * s.y - r.y * s.x;
if (val < 0) return -1;
return 1;
}
bool RSCAN() {
while (!st.empty()) st.pop();
int r(1), s(2), t(3), x;
st.push(r);
st.push(s);
st.push(t);
while (t != n) {
x = s - 1;
if (RST(pnt[r], pnt[s], pnt[t]) > 0 && RST(pnt[x], pnt[s], pnt[t]) < 0) {
puts("0");
return 0;
}
while (st.size() != 1 && RST(pnt[r], pnt[s], pnt[t]) < 0) {
st.pop();
s = st.top();
if (st.size() > 1) {
int tmp(st.top());
st.pop();
r = st.top();
st.push(tmp);
}
}
double inx;
if ((fabs(pnt[s].y - pnt[t].y) <= 1e-9)) {
puts("0");
return 0;
}
inx = ((pnt[s].x - pnt[t].x) * (pnt[0].y - pnt[t].y) /
(pnt[s].y - pnt[t].y)) +
pnt[t].x;
if (inx > (pnt[up].x - 1e-9) && inx < (pnt[1 - up].x + 1e-9)) {
if (up) {
if (inx > L - 1e-9) L = inx;
} else if (inx < R + 1e-9)
R = inx;
} else {
puts("0");
return 0;
}
st.push(t);
r = s;
s = t;
t++;
}
return 1;
}
bool LSCAN() {
while (!st.empty()) st.pop();
int r(n), s(n - 1), t(n - 2), x;
st.push(r);
st.push(s);
while (t != 1) {
x = s + 1;
if (RST(pnt[r], pnt[s], pnt[t]) < 0 && RST(pnt[x], pnt[s], pnt[t]) > 0) {
puts("0");
return 0;
}
while (st.size() != 1 && RST(pnt[r], pnt[s], pnt[t]) > 0) {
st.pop();
s = st.top();
if (st.size() > 1) {
int tmp(st.top());
st.pop();
r = st.top();
st.push(tmp);
}
}
double inx;
if ((fabs(pnt[s].y - pnt[t].y) <= 1e-9)) {
puts("0");
return 0;
}
inx = ((pnt[s].x - pnt[t].x) * (pnt[0].y - pnt[t].y) /
(pnt[s].y - pnt[t].y)) +
pnt[t].x;
if (inx > (pnt[up].x - 1e-9) && inx < (pnt[1 - up].x + 1e-9)) {
if (!up) {
if (inx > L - 1e-9) L = inx;
} else if (inx < R + 1e-9)
R = inx;
} else {
puts("0");
return 0;
}
st.push(t);
r = s;
s = t;
t--;
}
return 1;
}
int main() {
cin >> n;
pnt.clear();
pnt.resize(n + 1);
for (int i(0); i < n; ++i) pnt[i].get();
pnt[n] = pnt[0];
if (pnt[2].y > pnt[0].y)
L = pnt[1].x, R = pnt[0].x, up = 1;
else
L = pnt[0].x, R = pnt[1].x, up = 0;
if (LSCAN() && RSCAN())
if (R + 1e-9 <= L)
puts("0");
else
cout << floor(R + 1e-9) - ceil(L - 1e-9) + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct P {
double x, y;
P() {}
P(double x, double y) : x(x), y(y) {}
double operator^(const P &p) const { return x * p.y - y * p.x; }
double operator*(const P &p) const { return x * p.x + y * p.y; }
P operator-(const P &p) const { return P(x - p.x, y - p.y); }
P operator+(const P &p) const { return P(x + p.x, y + p.y); }
P operator*(double u) const { return P(x * u, y * u); }
void eat() { scanf("%lf%lf", &x, &y); }
};
long long gcd(long long a, long long b, long long &x, long long &y) {
long long d, t;
if (b == 0) {
x = 1;
y = 0;
return a;
}
d = gcd(b, a % b, x, y);
t = x;
x = y;
y = t - a / b * y;
return d;
}
int r, l;
void inter(P a, P b, P c, P d, int dir) {
P ca = a - c, ab = b - a, cd = d - c;
int tmp;
if ((ab ^ cd) == 0) {
if (c.x < d.x && dir == 1)
l = 1e9;
else if (c.x > d.x && dir == 0)
l = 1e9;
return;
}
double s = (ca ^ ab) / (cd ^ ab);
if (s == 0) return;
if (dir == 1) {
if (s > 0) {
tmp = (int)ceil((c + cd * s).x);
if (tmp > l) l = tmp;
} else if (s < 0) {
tmp = (int)floor((c + cd * s).x);
if (tmp < r) r = tmp;
}
} else if (dir == 0) {
if (s < 0) {
tmp = (int)ceil((c + cd * s).x);
if (tmp > l) l = tmp;
} else if (s > 0) {
tmp = (int)floor((c + cd * s).x);
if (tmp < r) r = tmp;
}
}
}
P a[1000100];
int main() {
int n, dir = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) a[i].eat();
if (a[0].x < a[1].x) {
dir = 1;
l = a[0].x;
r = a[1].x;
} else {
l = a[1].x;
r = a[0].x;
}
for (int i = 2; i < n - 1; i++) {
inter(a[0], a[1], a[i], a[i + 1], dir);
}
if (l > r)
printf("0\n");
else {
printf("%d\n", r - l + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10, err = 2.718e28;
struct VEC {
double x;
double y;
VEC() : x(), y() {}
VEC(double x, double y) : x(x), y(y) {}
};
struct LAN {
VEC u;
VEC v;
LAN() : u(), v() {}
LAN(VEC u, VEC v) : u(u), v(v) {}
};
inline double sqr(double a) { return a * a; }
inline double cmp(double a, double b) {
return fabs(a - b) > eps * fabs(a) + eps ? a - b : 0;
}
inline double sqr(const VEC& a) { return sqr(a.x) + sqr(a.y); }
inline double abs(const VEC& a) { return sqrt(sqr(a)); }
inline double arg(const VEC& a) { return atan2(a.y, a.x); }
inline double cmp(const VEC& a, const VEC& b) {
return cmp(a.x, b.x) ? a.x - b.x : cmp(a.y, b.y);
}
VEC operator-(const VEC& a) { return VEC(-a.x, -a.y); }
VEC operator~(const VEC& a) { return VEC(-a.y, +a.x); }
VEC operator+(const VEC& a, const VEC& b) { return VEC(a.x + b.x, a.y + b.y); }
VEC operator-(const VEC& a, const VEC& b) { return VEC(a.x - b.x, a.y - b.y); }
VEC operator*(const VEC& a, double u) { return VEC(a.x * u, a.y * u); }
VEC operator/(const VEC& a, double u) { return VEC(a.x / u, a.y / u); }
VEC operator*(double u, const VEC& a) { return VEC(u * a.x, u * a.y); }
double operator*(const VEC& a, const VEC& b) { return a.x * b.y - a.y * b.x; }
double operator%(const VEC& a, const VEC& b) { return a.x * b.x + a.y * b.y; }
VEC operator/(const VEC& a, const VEC& b) { return a % b / sqr(b) * b; }
inline double cmp_side(const VEC& a, const VEC& b) {
return cmp(a.x * b.y, +a.y * b.x);
}
inline double cmp_axis(const VEC& a, const VEC& b) {
return cmp(a.x * b.x, -a.y * b.y);
}
VEC cross(const LAN& a, const LAN& b) {
VEC p = a.u - a.v, q = b.u - b.v;
double ne = cmp_side(p, q);
if (!ne) return VEC(err, err);
return a.u + (b.u - a.u) * q / ne * p;
}
int main() {
int n;
scanf("%d", &n);
vector<VEC> u(n);
for (int i = 0; i < n; i++) scanf("%lf%lf", &u[i].x, &u[i].y);
VEC p = u[0], q = u[1];
if (p.x > q.x) swap(p, q);
double lo = p.x, hi = q.x;
for (int i = 2; i + 1 < n; i++) {
double l = cmp_side(u[i + 1] - u[i], q - p);
if (!l) {
if (cmp_axis(u[i + 1] - u[i], u[1] - u[0]) > 0) lo = hi + 1;
} else {
VEC c = cross(LAN(p, q), LAN(u[i], u[i + 1]));
if (l < 0)
lo = max(lo, c.x);
else
hi = min(hi, c.x);
}
}
printf("%d\n", max(int(floor(hi + eps) - ceil(lo - eps) + 1), 0));
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.