Datasets:
malteklaes
/
cpp-code-code_search_net-style

Dataset card Data Studio Files Community
1
func_code_string
stringlengths
59
71.4k
#include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { cin.sync_with_stdio(0); cout.sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, r[100], b[100], sumr, sumb, ans = 1, check = 1; cin >> n; for (int i = 0; i < n; i++) cin >> r[i]; for (int i = 0; i < n; i++) cin >> b[i]; sumr = accumulate(r, r + n, 0); sumb = accumulate(b, b + n, 0); if ((sumr == sumb && sumb == 0) || (sumr == sumb && sumb == n)) { cout << -1; return 0; } if (sumr > sumb) { cout << 1; return 0; } for (int i = 0; i < n; i++) if (r[i] && !b[i]) { check = 0; break; } if (check) { cout << -1; return 0; } RELOOP:; ans++; for (int i = 0; i < n; i++) if (r[i] && !b[i]) sumr++; if (sumr <= sumb) goto RELOOP; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int n, r; long long A[1000005], sum; int main() { scanf( %d %d , &n, &r); for (int i = (0); i < (1 << n); i++) scanf( %lld , &A[i]), sum += A[i]; printf( %.12lf n , 1.0 * sum / (1 << n)); for (int i = (0); i < (r); i++) { int x; long long y; scanf( %d %lld , &x, &y); sum += y - A[x]; A[x] = y; printf( %.12lf n , 1.0 * sum / (1 << n)); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); vector<int> a; int n, t; cin >> n; a.reserve(n); while (n--) { cin >> t; if (t != 0) { a.push_back(t); } } sort(a.begin(), a.end()); cout << unique(a.begin(), a.end()) - a.begin(); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = int(2e5); int g[N]; int ans = 0; int n; bool used[N]; void bfs(int start) { queue<int> q; q.push(start); used[start] = true; while (!q.empty()) { int from = q.front(); q.pop(); int to = g[from]; if (!used[to]) { used[to] = true; q.push(to); } } } int main() { ios_base::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; ++i) { cin >> g[i]; g[i]--; } int c = 0; for (int i = 0, t; i < n; ++i) { cin >> t; c += t; } ans += !(bool(c & 1)); int cnt = 0; for (int i = 0; i < n; ++i) { if (!used[i]) { cnt++; bfs(i); } } ans += (cnt == 1 ? 0 : cnt); cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n, m, ans; int d; char c; cin >> n >> c; m = n - 1; if (c == f ) { d = 1; } if (c == e ) { d = 2; } if (c == d ) { d = 3; } if (c == a ) { d = 4; } if (c == b ) { d = 5; } if (c == c ) { d = 6; } if (m % 4 == 0 || m % 4 == 2) ans = (m / 4) * 16 + d; else ans = (m / 4) * 16 + 7 + d; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long long cnt[10]; long long w, ans; void dfs(int pos, long long c) { long long rec; if (pos > 8) { ans = max(ans, w - c); return; } rec = min(cnt[pos], c / pos); for (long long i = rec; i >= max(rec - 8, 0LL); i--) dfs(pos + 1, c - i * pos); } int main() { cin >> w; for (int i = 1; i <= 8; i++) cin >> cnt[i]; ans = 0; dfs(1, w); cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const int MAX_N = 300000; vector<int> g[MAX_N]; int sz[MAX_N]; int x[MAX_N]; int p[MAX_N]; int N; int dfs(int v) { sz[v] = 1; p[v] = N; x[N++] = v; for (int i = 0; i < g[v].size(); i++) { sz[v] += dfs(g[v][i]); } return sz[v]; } int main() { int n, q, a, b; cin >> n >> q; for (int i = 1; i < n; i++) { cin >> a; g[a - 1].push_back(i); } for (int i = 0; i < n; i++) sort(g[i].begin(), g[i].end()); N = 0; dfs(0); for (int i = 0; i < q; i++) { cin >> a >> b; a--; if (sz[a] < b) cout << -1 << endl; else cout << x[p[a] + b - 1] + 1 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, k; long long pr[300005], cr[300005]; long long nr[300005][2], fr[300005][2]; bool visit[300005], visit1[300005]; char str[300005]; vector<long long> vr[300005], br[300005]; void pre(), dfs(long long, long long); long long uni(long long, long long), ccon(long long), ffind(long long); int main() { pre(); for (int i = 1; i < k + 1; i++) if (!visit[i]) dfs(i, 0); long long ans = 0; for (int idx = 1; idx < n + 1; idx++) { if (br[idx].size() == 1) { long long v1 = br[idx][0]; ans -= ccon(v1); if (str[idx] == 0 ) { fr[ffind(v1)][cr[v1]] = 1; } else { fr[ffind(v1)][!cr[v1]] = 1; } ans += ccon(v1); } else if (br[idx].size() == 2) { long long v1 = br[idx][0], v2 = br[idx][1]; if (ffind(v1) != ffind(v2)) { ans -= ccon(v1) + ccon(v2); long long p = uni(ffind(v1), ffind(v2)); ans += ccon(p); } } cout << ans << n ; } } long long ffind(long long idx) { if (pr[idx] != idx) return pr[idx] = ffind(pr[idx]); return idx; } long long uni(long long x, long long y) { if (x == y) return x; if (nr[x][0] + nr[x][1] < nr[y][0] + nr[y][1]) swap(x, y); pr[y] = x; nr[x][0] += nr[y][0]; nr[x][1] += nr[y][1]; fr[x][0] += fr[y][0]; fr[x][1] += fr[y][1]; return x; } long long ccon(long long idx) { long long c = cr[idx]; long long p = ffind(idx); if (fr[p][0]) return nr[p][0]; if (fr[p][1]) return nr[p][1]; return min(nr[p][0], nr[p][1]); } void pre() { cin >> n >> k; cin >> str + 1; for (int i = 1; i < k + 1; i++) { long long s; cin >> s; for (int j = 0; j < s; j++) { long long x; cin >> x; vr[i].push_back(x); br[x].push_back(i); } } } void dfs(long long idx, long long t) { if (visit[idx]) return; visit[idx] = true; nr[idx][t] = 1; cr[idx] = t; pr[idx] = idx; for (int i = 0; i < vr[idx].size(); i++) { long long v = vr[idx][i]; for (int j = 0; j < br[v].size(); j++) { long long node = br[v][j]; dfs(node, str[v] == 1 ? t : !t); } } }
#include <bits/stdc++.h> using namespace std; int n; vector<string> s; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; s.resize(n); for (int i = 0; i < n; i++) cin >> s[i]; for (int i = n - 1; i > 0; i--) { int l = 1, r = min(s[i].length(), s[i - 1].length()); if (s[i - 1].compare(s[i]) < 0) continue; while (l < r) { int mid = l + r + 1 >> 1; if (s[i - 1].compare(0, mid, s[i]) <= 0) l = mid; else r = mid - 1; } s[i - 1] = s[i - 1].substr(0, l); } for (int i = 0; i < n; i++) cout << s[i] << endl; }
#include <bits/stdc++.h> using namespace std; inline char gc() { static char buf[100000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++; } inline long long read() { long long x = 0; char ch = getchar(); bool positive = 1; for (; !isdigit(ch); ch = getchar()) if (ch == - ) positive = 0; for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; return positive ? x : -x; } inline void write(long long a) { if (a < 0) { a = -a; putchar( - ); } if (a >= 10) write(a / 10); putchar( 0 + a % 10); } inline void writeln(long long a) { write(a); puts( ); } inline void wri(long long a) { write(a); putchar( ); } const int N = 205; const long long inf = 4e18; int n, m; long long f[N][N], k, g[N][N]; string F[N]; long long sol(string x) { int len = x.length(); x = + x; int p = 0; memset(f, 0, sizeof(f)); for (int i = 1; i <= len; i++) x[i] -= 0 ; f[0][x[1]] = 1; for (int i = 1; i <= len; i++) { if (i > 1) p = f[p][x[i]]; if (i < len && x[i + 1] == 0) f[i][0] = i + 1; else f[i][0] = f[p][0]; if (i < len && x[i + 1] == 1) f[i][1] = i + 1; else f[i][1] = f[p][1]; } for (int i = 0; i <= len; i++) { g[i][0] = f[i][0] == len; g[i][1] = f[i][1] == len; } for (int i = 2; i <= n; i++) { for (int j = 0; j <= len; j++) { f[j][i] = f[f[j][i - 2]][i - 1]; g[j][i] = min(inf, g[j][i - 2] + g[f[j][i - 2]][i - 1]); } } return g[0][n]; } int main() { n = read(); k = read(); m = read(); string s = ; F[0] = 0 ; F[1] = 1 ; for (int i = 2; i <= n; i++) { F[i] = F[i - 2] + F[i - 1]; if (F[i].length() > m) F[i] = F[i].substr(F[i].length() - m, m); } m = min(m, (int)F[n].length()); for (int i = 1; i <= m; i++) { if (s.length() && F[n].substr(F[n].length() - s.length(), s.length()) == s) { if (--k == 0) { cout << s << endl; return 0; } } s += 0 ; long long t = sol(s); if (t < k) { k -= t; s.pop_back(); s += 1 ; } } cout << s << endl; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); int t, i, j, k, z, x, num[2]; string s; cin >> t; while (t--) { cin >> s; memset(num, 0, sizeof(num)); for (i = 0; i < s.size(); i++) { if (s[i] == 1 ) num[1]++; else num[0]++; } z = min(num[0], num[1]); if (z % 2) cout << DA n ; else cout << NET n ; } return 0; }
#include <bits/stdc++.h> using namespace std; int const MAX = 2005; int mp[MAX][MAX]; int main() { int n; bool flag = true; scanf( %d , &n); for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) scanf( %d , &mp[i][j]); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (mp[i][i] || mp[i][j] != mp[j][i] || (i != j && !mp[i][j])) { printf( NO n ); return 0; } } } for (int i = 1; i <= n; i++) { int u = 1; for (int j = 1; j <= n; j++) { if (i == j) continue; if (mp[i][j] < mp[i][u]) u = j; } for (int j = 1; j <= n; j++) { if (i == j) continue; if (abs(mp[i][j] - mp[j][u]) != mp[i][u]) { printf( NO n ); return 0; } } } printf( YES n ); }
#include <bits/stdc++.h> using namespace std; const int MAXPOW = 20; const int MAXA = 1048577; const int MAXN = 100009; const int MAXM = 100009; const int INF = 1e9 + 7; struct Node { Node(int val) : val(val) {} int val; }; struct MinIntervalTree { MinIntervalTree(int n, int val) { N = 1; while (N < n) { N *= 2; } nodes.resize(N * 2 + 2, Node(val)); } int getMin(int L, int R) { return getMin(0, 0, N, L, R + 1); } void set(int x, int val) { set(0, 0, N, x, val); } private: int getMin(int v, int L, int R, int A, int B) { if (L == A && R == B) { return nodes[v].val; } int M = (L + R) / 2; if (B <= M) { return getMin(v * 2 + 1, L, M, A, B); } if (A >= M) { return getMin(v * 2 + 2, M, R, A, B); } return min(getMin(v * 2 + 1, L, M, A, M), getMin(v * 2 + 2, M, R, M, B)); } void set(int v, int L, int R, int P, int val) { if (L + 1 == R) { nodes[v] = val; return; } int M = (L + R) / 2; if (P < M) { set(v * 2 + 1, L, M, P, val); } else { set(v * 2 + 2, M, R, P, val); } nodes[v].val = min(nodes[v * 2 + 1].val, nodes[v * 2 + 2].val); } int N; vector<Node> nodes; }; void testTree() { MinIntervalTree t(10, 1e9); } int main() { ios::sync_with_stdio(false); int n, s, l; cin >> n >> s >> l; vector<int> a(n); vector<int> maxLeft(n); for (int i = 0; i < n; ++i) { cin >> a[i]; maxLeft[i] = 0; } set<pair<int, int> > aliveUp; set<pair<int, int> > aliveDown; for (int i = n - 1; i >= 0; --i) { { auto it = aliveUp.lower_bound(make_pair(a[i] + s + 1, 0)); while (it != aliveUp.end()) { aliveUp.erase(it); maxLeft[it->second] = max(maxLeft[it->second], i + 1); it = aliveUp.lower_bound(make_pair(a[i] + s + 1, 0)); } } { auto it = aliveDown.lower_bound(make_pair(-a[i] + s + 1, 0)); while (it != aliveDown.end()) { aliveDown.erase(it); maxLeft[it->second] = max(maxLeft[it->second], i + 1); it = aliveDown.lower_bound(make_pair(-a[i] + s + 1, 0)); } } aliveUp.insert(make_pair(a[i], i)); aliveDown.insert(make_pair(-a[i], i)); } for (int i = 1; i < n; ++i) { maxLeft[i] = max(maxLeft[i], maxLeft[i - 1]); } vector<int> dp(n + 1, 1e9); MinIntervalTree T(n + 3, 1e9); dp[0] = 0; T.set(0, 0); for (int i = 0; i < n; ++i) { int L = maxLeft[i] - 1 + 1; int R = i - l + 1; if (L > R) { continue; } dp[i + 1] = 1 + T.getMin(L, R); T.set(i + 1, dp[i + 1]); } if (dp[n] >= 1e9) { cout << -1 << endl; } else { cout << dp[n] << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { long long x, d, k = 1; cin >> x >> d; vector<long long> ans; while (x) { long long rem = 0; for (int i = 31; i >= 0; --i) { if (x >> i & 1) { long long tmp = i; if (i == 0) { ans.push_back(k); rem--; } while (tmp--) ans.push_back(k); k += d; rem++; } } x = rem; } cout << ans.size() << endl; for (int i = 0; i < ans.size(); ++i) cout << ans[i] << ; cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t, n, k; cin >> t; while (t--) { cin >> n >> k; long long a[n], b[n], c = 0; for (int i = 0; i < n; i++) cin >> a[i], b[i] = (a[i] % k); sort(b, b + n); reverse(b, b + n); map<long long, long long> mp; for (int i = 0; i < n && b[i]; i++) if (i) { if (b[i - 1] == b[i]) mp[b[i]] += k; else mp[b[i]] = k - b[i] + 1; } else mp[b[i]] = k - b[i] + 1; for (auto &it : mp) c = max(c, it.second); cout << c << n ; } }
#include <bits/stdc++.h> using namespace std; map<int, vector<pair<int, int> > > mp; int n, tt; int arr[300000]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; for (int r = 1; r <= n; r++) { long long sum = 0; for (int l = r; l >= 1; l--) { sum += arr[l]; mp[sum].push_back(make_pair(l, r)); } } map<int, vector<pair<int, int> > >::iterator it; vector<pair<int, int> > ans; for (it = mp.begin(); it != mp.end(); it++) { int sum = 0; vector<pair<int, int> > &now = it->second; vector<pair<int, int> > cnt; int r = -1; for (int i = 0; i < now.size(); i++) { if (now[i].first > r) sum++, r = now[i].second, cnt.push_back(make_pair(now[i].first, now[i].second)); } if (sum > tt) ans = cnt, tt = sum; } cout << tt << endl; for (int i = 0; i < ans.size(); i++) cout << ans[i].first << << ans[i].second << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, d, v[102], c, g[102], k, S; int main(void) { cin >> n >> d; for (int i = 1; i <= n; i++) cin >> v[i]; for (int i = 1; i < n; i++) { if (v[i] % 2) c++; else c--; if (c == 0) g[k++] = abs(v[i] - v[i + 1]); } sort(g, g + k); for (S = 0; S < k && d >= g[S]; S++) d -= g[S]; cout << S; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); int n, m, k; cin >> n >> m >> k; if (k > 1) { if (m == n) { cout << 2 * k + 1 << endl; for (int i = (int)(1); i < ((int)k + 1); i++) { cout << 1 << ; } cout << n << ; for (int i = (int)(1); i < ((int)k); i++) { cout << n + 1 << ; } cout << n + m << endl; } else { cout << 2 * k << endl; for (int i = (int)(1); i < ((int)k + 1); i++) { cout << 1 << ; } cout << n << ; for (int i = (int)(1); i < ((int)k); i++) { cout << n + 1 << ; } cout << endl; } } else { if (m + 2 <= n) { cout << 2 << endl; cout << 1 << << n << endl; } else { if (n == 2 and m == 2) { cout << 4 << endl; cout << 1 2 3 4 << endl; } else { cout << 3 << endl; cout << 1 << << n << << 2 * n - 1 << endl; } } } return 0; }
#include <bits/stdc++.h> int** arr; std::vector<int> opers; void del3(int x, int y) { if (arr[x][y] && arr[x + 1][y] && arr[x][y + 1]) { opers.push_back(x + 1); opers.push_back(y + 1); opers.push_back(x + 2); opers.push_back(y + 1); opers.push_back(x + 1); opers.push_back(y + 2); arr[x][y] = 0; arr[x + 1][y] = 0; arr[x][y + 1] = 0; } else if (arr[x][y] && arr[x + 1][y] && arr[x + 1][y + 1]) { opers.push_back(x + 1); opers.push_back(y + 1); opers.push_back(x + 2); opers.push_back(y + 1); opers.push_back(x + 2); opers.push_back(y + 2); arr[x][y] = 0; arr[x + 1][y] = 0; arr[x + 1][y + 1] = 0; } else if (arr[x][y + 1] == 1 && arr[x + 1][y] && arr[x + 1][y + 1]) { opers.push_back(x + 1); opers.push_back(y + 2); opers.push_back(x + 2); opers.push_back(y + 1); opers.push_back(x + 2); opers.push_back(y + 2); arr[x][y + 1] = 0; arr[x + 1][y] = 0; arr[x + 1][y + 1] = 0; } else if (arr[x][y] == 1 && arr[x][y + 1] && arr[x + 1][y + 1]) { opers.push_back(x + 1); opers.push_back(y + 1); opers.push_back(x + 1); opers.push_back(y + 2); opers.push_back(x + 2); opers.push_back(y + 2); arr[x][y] = 0; arr[x][y + 1] = 0; arr[x + 1][y + 1] = 0; } } void del2(int x, int y) { bool fl = false; if (arr[x][y] == 0) { opers.push_back(x + 1); opers.push_back(y + 1); arr[x][y] = 1; } else { if (!fl) { opers.push_back(x + 1); opers.push_back(y + 1); arr[x][y] = 0; fl = true; } } if (arr[x + 1][y] == 0) { opers.push_back(x + 2); opers.push_back(y + 1); arr[x + 1][y] = 1; } else { if (!fl) { opers.push_back(x + 2); opers.push_back(y + 1); fl = true; arr[x + 1][y] = 0; } } if (arr[x][y + 1] == 0) { opers.push_back(x + 1); opers.push_back(y + 2); arr[x][y + 1] = 1; } else { if (!fl) { opers.push_back(x + 1); opers.push_back(y + 2); arr[x][y + 1] = 0; fl = true; } } if (arr[x + 1][y + 1] == 0) { opers.push_back(x + 2); opers.push_back(y + 2); arr[x + 1][y + 1] = 1; } else { if (!fl) { opers.push_back(x + 2); opers.push_back(y + 2); arr[x + 1][y + 1] = 0; fl = true; } } del3(x, y); } void del1(int x, int y) { int h = 0; if (arr[x][y] == 1) { opers.push_back(x + 1); opers.push_back(y + 1); arr[x][y] = 0; } else { if (h < 2) { opers.push_back(x + 1); opers.push_back(y + 1); arr[x][y] = 1; h++; } } if (arr[x + 1][y] == 1) { opers.push_back(x + 2); opers.push_back(y + 1); arr[x + 1][y] = 0; } else { if (h < 2) { opers.push_back(x + 2); opers.push_back(y + 1); arr[x + 1][y] = 1; h++; } } if (arr[x][y + 1] == 1) { opers.push_back(x + 1); opers.push_back(y + 2); arr[x][y + 1] = 0; } else { if (h < 2) { opers.push_back(x + 1); opers.push_back(y + 2); arr[x][y + 1] = 1; h++; } } if (arr[x + 1][y + 1] == 1) { opers.push_back(x + 2); opers.push_back(y + 2); arr[x + 1][y + 1] = 0; } else { if (h < 2) { opers.push_back(x + 2); opers.push_back(y + 2); arr[x + 1][y + 1] = 1; h++; } } del2(x, y); } void setup(int x, int y) { int iu = arr[x][y] + arr[x][y + 1] + arr[x + 1][y] + arr[x + 1][y + 1]; if (iu == 3) { del3(x, y); } else if (iu == 2) { del2(x, y); } else if (iu == 1) { del1(x, y); } else if (iu == 4) { del3(x, y); del1(x, y); } arr[x][y] = 0; arr[x][y + 1] = 0; arr[x + 1][y] = 0; arr[x + 1][y + 1] = 0; } int main() { int t; std::cin >> t; for (int i = 0; i < t; i++) { int n, m; std::cin >> n >> m; arr = new int*[n]; for (int i = 0; i < n; i++) arr[i] = new int[m]; for (int i = 0; i < n; i++) { std::string s; std::cin >> s; for (int j = 0; j < s.size(); j++) { arr[i][j] = s[j] - 0 ; } } for (int a = 0; a < n - 1; a++) { for (int b = 0; b < m - 1; b++) { setup(a, b); } } std::cout << opers.size() / 6 << n ; for (int i = 0; i < opers.size() / 6; i++) { for (int j = 0; j < 6; j++) { std::cout << opers[i * 6 + j] << ; } std::cout << n ; } opers.clear(); } return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m, k, ans = 0; int main() { cin >> n >> m >> k; if (n - 1 + m - 1 < k) { cout << -1 << endl; return 0; } long long buf = sqrt(n); buf++; for (int i = 0; i <= buf; i++) { long long x = n / (i + 1); if (k - i < 0) continue; long long y = m / (k - i + 1); ans = max(ans, x * y); } for (int i = 1; i <= buf; i++) { long long cut = n / i - 1; if (cut < 0) continue; long long left = k - cut; if (left < 0) left = 0; ans = max(ans, i * (m / (left + 1))); } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { int N; cin >> N; long long int dp_D = 1, dp = 0, dp_temp; for (int i = 0; i < N; i++) { dp_temp = dp_D; dp_D = 3 * dp; dp = dp * 2 + dp_temp; dp %= 1000000007; dp_D %= 1000000007; } cout << dp_D << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int T = 1; while (T--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; long long cal(long long x) { return (x + 1) * (x + 2) >> 1; } int main() { int a, b, c, l; while (scanf( %d%d%d%d , &a, &b, &c, &l) != EOF) { long long ans = 0; for (int i = 0; i <= l; i++) ans += 1LL * (i + 1) * (i + 2) / 2; for (long long i = 0; i <= l; i++) { if (a + i >= b + c) ans -= cal(min(l - i, a + i - b - c)); if (b + i >= a + c) ans -= cal(min(l - i, b + i - a - c)); if (c + i >= a + b) ans -= cal(min(l - i, c + i - a - b)); } cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e9 + 3; long long n, sum; vector<int> vec; int32_t main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; for (int i = n - 100; i <= n; i++) { long long x = i; while (x) { sum += x % 10; x /= 10; } sum += i; if (sum == n) vec.push_back(i); sum = 0; } cout << vec.size() << endl; for (int i = 0; i < vec.size(); i++) cout << vec[i] << ; cout << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline void read(int &x) { int v = 0, f = 1; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = (c & 15); while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15); x = v * f; } inline void read(long long &x) { long long v = 0ll, f = 1ll; char c = getchar(); while (!isdigit(c) && c != - ) c = getchar(); if (c == - ) f = -1; else v = (c & 15); while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15); x = v * f; } inline void readc(char &x) { char c; while (((c = getchar()) == ) || c == n ) ; x = c; } long long ans; int n, m, k, i, j, fa[150005][19], dep[150005], first[150005], ed[150005], ti, px[150005], py[150005]; int tt, lst[150005], stk[150005], tp; vector<int> ne[150005]; vector<int> e[150005]; vector<int> v[150005]; vector<int> add[150005]; void addedg(int x, int y) { if (lst[x] != tt) { lst[x] = tt; ne[x].clear(); } if (lst[y] != tt) { lst[y] = tt; ne[y].clear(); } ne[x].push_back(y); } bool cmp(int x, int y) { return first[x] < first[y]; } void dfs1(int x, int p) { fa[x][0] = p; first[x] = ++ti; for (__typeof((e[x]).begin()) it = (e[x]).begin(); it != (e[x]).end(); it++) if (*it != p) { dep[*it] = dep[x] + 1; dfs1(*it, x); } ed[x] = ti; } int lca(int x, int y) { if (dep[x] < dep[y]) swap(x, y); int t = dep[x] - dep[y], i; for ((i) = (18); (i) >= (0); (i)--) if ((t >> i) & 1) x = fa[x][i]; if (x == y) return x; for ((i) = (18); (i) >= (0); (i)--) if (fa[x][i] != fa[y][i]) { x = fa[x][i]; y = fa[y][i]; } return fa[x][0]; } int gtf(int x, int y) { int i; for ((i) = (18); (i) >= (0); (i)--) if ((y >> i) & 1) x = fa[x][i]; return x; } struct bit { int c[150005]; void add(int x, int y) { while (x <= n) { c[x] += y; x += (x & -x); } } int query(int x) { int s = 0; while (x) { s += c[x]; x -= (x & -x); } return s; } } tr; void dfs2(int x) { for (__typeof((v[x]).begin()) it = (v[x]).begin(); it != (v[x]).end(); it++) { if (dep[px[*it]] - dep[x] >= k) { int t = gtf(px[*it], dep[px[*it]] - dep[x] - k); ans += tr.query(ed[t]) - tr.query(first[t] - 1); } if (dep[py[*it]] - dep[x] >= k) { int t = gtf(py[*it], dep[py[*it]] - dep[x] - k); ans += tr.query(ed[t]) - tr.query(first[t] - 1); } } for (__typeof((v[x]).begin()) it = (v[x]).begin(); it != (v[x]).end(); it++) { tr.add(first[px[*it]], 1); tr.add(first[py[*it]], 1); } for (__typeof((e[x]).begin()) it = (e[x]).begin(); it != (e[x]).end(); it++) if (*it != fa[x][0]) { dfs2(*it); } for (__typeof((v[x]).begin()) it = (v[x]).begin(); it != (v[x]).end(); it++) { tr.add(first[px[*it]], -1); tr.add(first[py[*it]], -1); } } void ins(int x) { if (x == 1) return; int z = lca(x, stk[tp]); if (z == stk[tp]) { stk[++tp] = x; return; } while (tp > 1 && first[stk[tp - 1]] >= first[z]) { addedg(stk[tp - 1], stk[tp]); tp--; } if (stk[tp] != z) { addedg(z, stk[tp]); stk[tp] = z; } stk[++tp] = x; } multiset<int> s[150005]; int rt[150005], tot, lc[3000005], rc[3000005], sum[3000005]; void update(int &x, int l, int r, int y) { if (!x) { x = ++tot; lc[x] = rc[x] = sum[x] = 0; } sum[x]++; if (l == r) return; int mid = (l + r) / 2; if (y <= mid) update(lc[x], l, mid, y); else update(rc[x], mid + 1, r, y); } void merge(int &x, int y, int l, int r) { if (!x || !y) { x = x + y; return; } if (l == r) { sum[x] += sum[y]; return; } int mid = (l + r) / 2; merge(lc[x], lc[y], l, mid); merge(rc[x], rc[y], mid + 1, r); sum[x] = sum[lc[x]] + sum[rc[x]]; } int query(int x, int l, int r, int ql, int qr) { if (!x) return 0; if (ql <= l && r <= qr) return sum[x]; int mid = (l + r) / 2, s = 0; if (ql <= mid) s += query(lc[x], l, mid, ql, qr); if (qr > mid) s += query(rc[x], mid + 1, r, ql, qr); return s; } void dfs3(int x) { if (dep[x] - dep[i] >= k) { int t = gtf(x, dep[x] - dep[i] - k); ans += 1ll * add[x].size() * (tr.query(ed[t]) - tr.query(first[t] - 1)); } for (__typeof((add[x]).begin()) it = (add[x]).begin(); it != (add[x]).end(); it++) { tr.add(first[*it], 1); } rt[x] = 0; s[x].clear(); for (__typeof((add[x]).begin()) it = (add[x]).begin(); it != (add[x]).end(); it++) { s[x].insert(*it); if (dep[x] - dep[i] >= k) { int t = gtf(x, k - 1); if (first[t] > 1) ans += query(rt[x], 1, n, 1, first[t] - 1); if (ed[t] < n) ans += query(rt[x], 1, n, ed[t] + 1, n); } else { if (dep[x] - dep[i] + dep[*it] - dep[i] < k) continue; int t = gtf(*it, dep[*it] - dep[i] - (k - (dep[x] - dep[i]))); ans += query(rt[x], 1, n, first[t], ed[t]); } update(rt[x], 1, n, first[*it]); } for (__typeof((ne[x]).begin()) it = (ne[x]).begin(); it != (ne[x]).end(); it++) { dfs3(*it); if (s[x].size() < s[*it].size()) { swap(s[x], s[*it]); swap(rt[x], rt[*it]); } for (__typeof((s[*it]).begin()) it2 = (s[*it]).begin(); it2 != (s[*it]).end(); it2++) { if (dep[x] - dep[i] >= k) { int t = gtf(x, k - 1); if (first[t] > 1) ans += query(rt[x], 1, n, 1, first[t] - 1); if (ed[t] < n) ans += query(rt[x], 1, n, ed[t] + 1, n); } else { if (dep[x] - dep[i] + dep[*it2] - dep[i] < k) continue; int t = gtf(*it2, dep[*it2] - dep[i] - (k - (dep[x] - dep[i]))); ans += query(rt[x], 1, n, first[t], ed[t]); } s[x].insert(*it2); } merge(rt[x], rt[*it], 1, n); } } int main() { read(n); read(m); read(k); for (((i)) = (1); ((i)) <= ((n - 1)); ((i))++) { int x, y; read(x); read(y); e[x].push_back(y); e[y].push_back(x); } dfs1(1, 0); for (((j)) = (1); ((j)) <= ((18)); ((j))++) for (((i)) = (1); ((i)) <= ((n)); ((i))++) fa[i][j] = fa[fa[i][j - 1]][j - 1]; for (((i)) = (1); ((i)) <= ((m)); ((i))++) { read(px[i]); read(py[i]); if (first[px[i]] > first[py[i]]) swap(px[i], py[i]); v[lca(px[i], py[i])].push_back(i); } dfs2(1); for (((i)) = (1); ((i)) <= ((n)); ((i))++) { for (__typeof((v[i]).begin()) it = (v[i]).begin(); it != (v[i]).end(); it++) { add[px[*it]].push_back(py[*it]); } vector<int> a; for (__typeof((v[i]).begin()) it = (v[i]).begin(); it != (v[i]).end(); it++) { a.push_back(px[*it]); a.push_back(py[*it]); } a.push_back(1); sort((a).begin(), (a).end(), cmp); a.resize(unique((a).begin(), (a).end()) - a.begin()); tt++; ne[1].clear(); stk[tp = 1] = 1; for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++) { ins(*it); } while (tp > 1) { addedg(stk[tp - 1], stk[tp]); tp--; } tot = 0; dfs3(1); for (__typeof((v[i]).begin()) it = (v[i]).begin(); it != (v[i]).end(); it++) { add[px[*it]].clear(); } for (__typeof((v[i]).begin()) it = (v[i]).begin(); it != (v[i]).end(); it++) { tr.add(first[py[*it]], -1); } } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string d[] = { monday , tuesday , wednesday , thursday , friday , saturday , sunday }; string a, b; int e, c, g, f, u; bool o; cin >> a >> b; for (int i = 0; i < 7; i++) { if (a == d[i]) { e = i; } if (b == d[i]) { c = i; } } u = abs(e - c); for (int m = 1; m <= 12; m++) { if (m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 || m == 12) { g = 4; f = e - g; if (f < 0) { f = 7 - abs(f); } if (d[f] == d[c]) { o = 1; cout << YES ; break; } else o = 0; } else if (m == 2) { g = 0; f = e - g; if (f < 0) { f = 7 - abs(f); } if (d[f] == d[c]) { o = 1; cout << YES ; break; } else o = 0; } else if (m == 4 || m == 6 || m == 9 || m == 1) { g = 5; f = e - g; if (f < 0) { f = 7 - abs(f); } if (d[f] == d[c]) { o = 1; cout << YES ; break; } else o = 0; } } if (o == 0) { cout << NO ; } }
#include <bits/stdc++.h> using namespace std; void solve() { long long n; cin >> n; long long arr[n]; for (long long i = 0; i < n; ++i) { cin >> arr[i]; } stack<pair<long long, long long>> s1, s2; s1.push({0, -1}); long long left[n], right[n]; for (long long i = 0; i < n; ++i) { while (s1.top().first >= arr[i]) s1.pop(); left[i] = s1.top().second + 1; s1.push({arr[i], i}); } s2.push({0, n}); for (long long i = n - 1; i >= 0; --i) { while (s2.top().first >= arr[i]) s2.pop(); right[i] = s2.top().second - 1; s2.push({arr[i], i}); } long long ans[n + 1]; memset(ans, 0, sizeof(ans)); for (long long i = 0; i < n; ++i) { ans[right[i] - left[i] + 1] = max(arr[i], ans[right[i] - left[i] + 1]); } for (long long i = n - 1; i >= 1; --i) { if (ans[i] < ans[i + 1]) ans[i] = ans[i + 1]; } for (long long i = 0; i < n; ++i) { cout << ans[i + 1] << ; } } signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; long long a, b, c, d, cnt = 1; string s; bool ok = true, mtest = true; void solve() { cin >> b; vector<int> v(b), vc(b); for (auto& i : v) cin >> i; for (auto& i : vc) cin >> i; sort(v.begin(), v.end()); sort(vc.begin(), vc.end()); for (auto i : v) cout << i << ; cout << n ; for (auto i : vc) cout << i << ; cout << n ; } int main() { cin >> a; while (a--) solve(); cerr << nTime elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << s. n ; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n; vector<int> a(n); vector<pair<int, int> > d; for (int i = 0; i < n; i++) { cin >> a[i]; d.push_back(make_pair(a[i], 0)); } cin >> m; vector<int> b(m); vector<pair<int, int> > c(n + m); vector<pair<int, int> > sum(n + m, make_pair(0, 0)); for (int i = 0; i < m; i++) { cin >> b[i]; d.push_back(make_pair(b[i], 1)); } sort(d.begin(), d.end()); int tog = 0; if (d[0].second) sum[0].second = 1; else sum[0].first = 1; for (int i = 0; i < n + m; i++) { if (i > 0) { sum[i].first = sum[i - 1].first; sum[i].second = sum[i - 1].second; } if (!d[i].second) { tog++; if (i > 0) sum[i].first++; } else { tog--; if (i > 0) sum[i].second++; } c[i].first = tog; c[i].second = i; } sort(c.begin(), c.end()); if (c[0].first < 0) cout << 3 * n - sum[c[0].second].first << : << 3 * m - sum[c[0].second].second << endl; else cout << 3 * n << : << 3 * m; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 1, M = 1e9 + 7; mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count()); int n, q, bit[N], inv[N], a[N], last[N], INVER[N], ans[N]; bool prime[N]; vector<int> v[N]; struct query { int l, r, id; void sc(int temp) { scanf( %d%d , &l, &r); id = temp; } } Q[N]; int power(int base, int to) { int ret = 1; while (to) { if (to & 1) ret = ret * 1LL * base % M; to >>= 1; base = base * 1LL * base % M; } return ret; } int INV(int a) { if (INVER[a] != -1) return INVER[a]; return INVER[a] = power(a, M - 2); } void add(int at, int *bit, int val) { for (; at < N; at += (-at) & at) bit[at] = bit[at] * 1LL * val % M; } int get(int at, int *bit) { int ret = 1; for (; at; at -= at & (-at)) ret = ret * 1LL * bit[at] % M; return ret; } int main() { for (int i = 0; i < N; i++) bit[i] = inv[i] = 1; memset(last, -1, sizeof last); memset(INVER, -1, sizeof INVER); scanf( %d , &n); for (int i = 2; i < N; i++) if (!prime[i]) { for (int j = i; j < N; j += i) { prime[j] = 1; v[j].push_back(i); } } for (int i = 1; i <= n; i++) scanf( %d , a + i); scanf( %d , &q); for (int i = 0; i < q; i++) Q[i].sc(i); sort(Q, Q + q, [&](query a, query b) { return a.r < b.r; }); int j = 1; for (int i = 0; i < q; i++) { while (j <= Q[i].r) { add(j, bit, a[j]); add(j, inv, INV(a[j])); for (auto k : v[a[j]]) { if (last[k] != -1) { add(last[k], bit, INV(k - 1) * 1LL * k % M); add(last[k], inv, (k - 1LL) * INV(k) % M); } last[k] = j; add(last[k], bit, (k - 1LL) * INV(k) % M); add(last[k], inv, k * 1LL * INV(k - 1) % M); } j++; } ans[Q[i].id] = get(Q[i].r, bit); ans[Q[i].id] = ans[Q[i].id] * 1LL * get(Q[i].l - 1, inv) % M; } for (int i = 0; i < q; i++) printf( %d n , ans[i]); }
#include <bits/stdc++.h> using namespace std; int ans[300005]; int main() { int n, m; scanf( %d%d , &n, &m); set<int> alive; for (int i = 1; i <= n; i++) alive.insert(i); for (int i = 0; i < m; i++) { int l, r, x; scanf( %d%d%d , &l, &r, &x); set<int>::iterator it = alive.lower_bound(l); vector<int> dead; while (it != alive.end()) { int now = *it; if (now > r) break; if (now != x) dead.push_back(now), ans[now] = x; it++; } for (int j = 0; j < (int)((dead).size()); j++) alive.erase(dead[j]); } for (int i = 1; i <= n; i++) printf( %d%c , ans[i], i == n ? n : ); return 0; }
#include <bits/stdc++.h> using namespace std; pair<int, long long> da; inline long long p(long long x) { return x * x * x; } long long m; void dfs(long long now, int sum, long long maxnum) { if (!now) da = max(da, make_pair(sum, maxnum)); else { long long i = 1; for (; p(i + 1) <= now; ++i) ; dfs(now - p(i), sum + 1, maxnum + p(i)); if (now) dfs(p(i) - p(i - 1) - 1, sum + 1, maxnum + p(i - 1)); } } int main() { scanf( %lld , &m); dfs(m, 0, 0); printf( %d %lld , da.first, da.second); }
#include <bits/stdc++.h> std::map<std::string, std::string> opcodes; std::string next(std::string s) { std::string res = s; res[res.size() - 1]++; for (int i = (int)res.size() - 1; i >= 0; i--) { if (res[i] > f ) { res[i] = a ; res[i - 1]++; } } return res; } int check(std::string s) { if (s.size() == 1) return !!(s[0] == a ); std::string f = s.substr(0, 2); s.erase(0, 2); auto it = opcodes.find(f); if (it == opcodes.end()) return 0; s = it->second + s; return check(s); } int main() { std::ios_base::sync_with_stdio(0); int n, q; std::cin >> n >> q; std::string str = , fff, a, b; for (int i = 0; i < n; i++) str.push_back( a ); for (int i = 0; i < n; i++) fff.push_back( f ); for (int i = 0; i < q; i++) { std::cin >> a >> b; opcodes[a] = b; } int ans = 0; while (true) { ans += check(str); if (str == fff) break; else str = next(str); } std::cout << ans << std::endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1e9 + 7; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long int n; cin >> n; long long int a[n]; for (long long int i = 0; i < n; i++) { cin >> a[i]; } if (n == 1) { cout << 1 << n ; return 0; } long long int pre[n + 5]; long long int suf[n + 5]; long long int ans = 1; pre[0] = 1; suf[n - 1] = 1; for (long long int i = 1; i < n; i++) { if (a[i] > a[i - 1]) { pre[i] = pre[i - 1]; pre[i]++; } else { pre[i] = 1; } ans = max(pre[i], ans); } for (long long int i = n - 2; i >= 0; i--) { if (a[i] < a[i + 1]) { suf[i] = suf[i + 1]; suf[i]++; } else { suf[i] = 1; } ans = max(pre[i], ans); } for (long long int i = 1; i + 1 < n; i++) { if (a[i + 1] - a[i - 1] >= 2) { ans = max(ans, 1 + pre[i - 1] + suf[i + 1]); } ans = max(ans, 1 + pre[i - 1]); ans = max(ans, 1 + suf[i + 1]); } ans = max(ans, 1 + suf[1]); ans = max(ans, 1 + pre[n - 2]); cout << ans << n ; return 0; }
#include <bits/stdc++.h> using namespace std; const double EPS = 1e-8; const int mod = 1e9 + 7; const int N = 1e6 + 10; const long long INF = 1e18; long long power(long long x, long long y) { long long t = 1; while (y > 0) { if (y % 2) y -= 1, t = t * x % mod; else y /= 2, x = x * x % mod; } return t; } vector<int> G[N]; vector<long long> snd[N]; long long sub[N], sum[N], red[N], dol[N]; long long mns[N], mxs[N]; int lol[N]; vector<pair<int, pair<long long, long long> > > edges; void done() { printf( -1 n ); exit(0); } void dfs(int v) { for (int i = 0; i < G[v].size(); ++i) { int ed = G[v][i]; dfs(edges[ed].first); long long &w = edges[ed].second.first, &p = edges[ed].second.second; if (mns[edges[ed].first] > p) done(); long long z = min(w - 1, p - mns[edges[ed].first]); mns[v] += mns[edges[ed].first] + w - z; snd[v].push_back(mns[edges[ed].first] + w - z); mxs[v] += w + min(p, mxs[edges[ed].first]); assert(mns[v] <= mxs[v]); } } void dfs1(int v, long long nd) { for (int i = 0; i < G[v].size(); ++i) nd -= snd[v][i]; for (int i = 0; i < G[v].size(); ++i) { int ed = G[v][i], to = edges[ed].first; long long &w = edges[ed].second.first, &p = edges[ed].second.second; long long z = min(w - 1, p - mns[edges[ed].first]); w -= z; p -= z; long long k = min(nd, z); w += k; p += k; nd -= k; k = min(min(nd, p - mns[edges[ed].first]), mxs[edges[ed].first] - mns[edges[ed].first]); dfs1(to, mns[edges[ed].first] + k); nd -= k; } assert(nd == 0); } int main() { int n; scanf( %d , &n); for (int i = 0; i < n - 1; ++i) { int x, y; long long w, p; scanf( %d%d%lld%lld , &x, &y, &w, &p); x--; y--; G[x].push_back(edges.size()); lol[i] = x; edges.push_back(make_pair(y, make_pair(w, p))); } dfs(0); dfs1(0, mxs[0]); printf( %d n , n); for (int i = 0; i < n - 1; ++i) { printf( %d %d %lld %lld n , lol[i] + 1, edges[i].first + 1, edges[i].second.first, edges[i].second.second); } return 0; }
#include <bits/stdc++.h> using namespace std; const long long M = 5005; const int MOD = 998244353; const int MX = 3e5 + 5; const long long INF = 1e18; const long double PI = acos((long double)-1); void msm() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); } int sol(); int main() { msm(); sol(); return 0; } int sol() { long long n; cin >> n; ; long long ar[105], arr[105][5005]; for (long long i = (0); i < (n); ++i) { long long a; cin >> a; ; ar[a]++; arr[a][ar[a]] = i + 1; } long long y = min(ar[1], min(ar[2], ar[3])); cout << y << endl; for (long long i = (1); i <= (y); ++i) cout << arr[1][i] << << arr[2][i] << << arr[3][i] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T1, typename T2> inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; } template <typename T1, typename T2> inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } template <typename T, typename U> inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) { _out << _p.first << << _p.second; return _out; } template <typename T, typename U> inline istream &operator>>(istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; } template <typename T> inline ostream &operator<<(ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << << *_it; } return _out; } template <typename T> inline istream &operator>>(istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; } template <typename T> inline ostream &operator<<(ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << << *_it; } return _out; } template <typename T> inline ostream &operator<<(ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << << *_it; } return _out; } template <typename T> inline ostream &operator<<(ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << << *_it; } return _out; } template <typename T> inline ostream &operator<<(ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << << *_it; } return _out; } template <typename T, typename U> inline ostream &operator<<(ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << ( << _m.begin()->first << : << _m.begin()->second << ) ; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << , ( << _it->first << : << _it->second << ) ; } return _out; } template <typename T, typename U> inline ostream &operator<<(ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << ( << _m.begin()->first << : << _m.begin()->second << ) ; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << , ( << _it->first << : << _it->second << ) ; } return _out; } const string FILENAME = input ; const int MAXN = 100001; int n; int x[MAXN], y[MAXN]; int c[MAXN]; int a[MAXN]; int id[MAXN]; int reals[MAXN]; int xs[MAXN], ys[MAXN]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; int curx = 0, cury = 0; int last = 0; int st = 0; for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; id[i] = i; xs[i] = x[i]; ys[i] = y[i]; } while (true) { random_shuffle(id, id + n); for (int i = 0; i < n; i++) { x[i] = xs[i]; y[i] = ys[i]; } long long lst = 0; curx = 0; cury = 0; last = 0; st = 0; for (int i1 = 0; i1 < n; i1++) { int i = id[i1]; long long res = 1e18; for (int t = 0; t < 2; t++) { for (int t1 = 0; t1 < 2; t1++) { int nx = curx + x[i]; int ny = cury + y[i]; chkmin(res, 1LL * nx * nx + 1LL * ny * ny); x[i] *= -1; y[i] *= -1; } curx *= -1; cury *= -1; } bool was = false; for (int t = 0; t < 2; t++) { int nx = curx + x[i]; int ny = cury + y[i]; if ((1LL * nx * nx + 1LL * ny * ny) == res) { c[i1] = last ^ t; if (i == 0) { st = t; } was = true; curx = nx; cury = ny; last = t; break; } x[i] *= -1; y[i] *= -1; } if (!was) { st ^= 1; last ^= 1; curx *= -1; cury *= -1; for (int t = 0; t < 2; t++) { int nx = curx + x[i]; int ny = cury + y[i]; if ((1LL * nx * nx + 1LL * ny * ny) == res) { c[i1] = t ^ last; if (i == 0) { st = t; } was = true; curx = nx; cury = ny; last = t; break; } x[i] *= -1; y[i] *= -1; } } lst = res; } if (lst <= 1500000LL * 1500000LL) { break; } } for (int i = 0; i < n; i++) { if (i == 0) { a[i] = st; } else { if (c[i]) { a[i] = a[i - 1] ^ 1; } else { a[i] = a[i - 1]; } } reals[id[i]] = a[i]; } for (int i = 0; i < n; i++) { if (reals[i] == 0) { cout << 1 << ; } else { cout << -1 << ; } } cout << n ; return 0; }
#include <bits/stdc++.h> using namespace std; long long n, m, d, l; int main() { cin >> n >> d >> m >> l; long long x = 0; for (long long i = 0; i < n; i++) { if (x < i * m) { break; } while (x <= i * m + l) x = (((i * m + l) / d) + 1) * d; } cout << x << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 40; const int M = 20; long long incident_mask[N]; vector<int> g[N]; int n, m, used[N]; long long ans = 0; long long cntmask[1 << M]; template <typename T> inline void chkmax(T &x, T y) { x = max(x, y); } template <typename T> inline void chkmin(T &x, T y) { x = min(x, y); } template <typename T> inline void read(T &x) { T f = 1; x = 0; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == - ) f = -f; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + c - 0 ; x *= f; } inline long long binpow(long long a, long long n) { long long res = 1; for (; n; n >>= 1, a = (long long)a * a) if (n & 1) res = (long long)res * a; return res; } inline void dfs(int x, int c) { if (used[x]) return; used[x] = c; for (int y : g[x]) dfs(y, 3 - c); } inline long long CountIsolated() { long long ans = 0; for (int i = 0; i < n; ++i) if (g[i].empty()) ++ans; return ans; } inline long long CountComponents() { memset(used, 0, sizeof(used)); long long ans = 0; for (int i = 0; i < n; ++i) if (!used[i]) { ++ans; dfs(i, 1); } return ans; } inline bool bipartite() { memset(used, 0, sizeof(used)); for (int i = 0; i < n; ++i) if (!used[i]) dfs(i, 1); for (int i = 0; i < n; ++i) for (int j : g[i]) if (used[i] == used[j]) return false; return true; } inline long long CountIndependentSets() { int m1 = min(n, 20); int m2 = n - m1; memset(cntmask, 0, sizeof(cntmask)); for (int i = 0; i < (1 << m1); ++i) { long long curmask = 0; bool good = true; for (int j = 0; j < m1; ++j) { if ((i & (1 << j)) == 0) continue; if (curmask & (1 << j)) good = false; curmask |= ((1 << j) | incident_mask[j]); } if (good) ++cntmask[curmask >> m1]; } for (int i = 0; i < m2; ++i) for (int j = 0; j < (1 << m2); ++j) if (j & (1 << i)) cntmask[j] += cntmask[j ^ (1 << i)]; long long ans = 0; for (int i = 0; i < (1 << m2); i++) { long long curmask = 0; bool good = true; for (int j = m1; j < n; j++) { if ((i & (1 << (j - m1))) == 0) continue; if (curmask & (1LL << j)) good = false; curmask |= (1LL << j) | incident_mask[j]; } if (good) ans += cntmask[(i ^ ((1 << m2) - 1))]; } return ans; } inline long long calc(int mask) { if (mask == 0) return binpow(2, n); if (mask == 1 || mask == 4) return CountIndependentSets(); if (mask == 2) return binpow(2, CountComponents()); if (mask == 3 || mask == 6) return binpow(2, CountIsolated()); if (mask == 5) return (bipartite() ? binpow(2, CountComponents()) : 0); if (mask == 7) return (m == 0 ? binpow(2, n) : 0); return 0; } int main() { read(n); read(m); for (int i = 0; i < m; ++i) { int u, v; read(u), read(v); --u, --v; g[u].emplace_back(v); g[v].emplace_back(u); incident_mask[u] ^= (1LL << v); incident_mask[v] ^= (1LL << u); } long long ans = 0; for (int i = 0; i < 8; ++i) if (__builtin_popcount(i) % 2 == 0) ans += calc(i); else ans -= calc(i); printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 1E9; int main() { int n; string s; cin >> n >> s; for (int len = 1; len <= n; len++) { bool ok = true; for (int i = 0; i < n; i++) { if (i + len * 4 < n && s[i] == * && s[i] == s[i + len] && s[i] == s[i + len + len] && s[i] == s[i + len * 3] && s[i] == s[i + len * 4]) { ok = 0; break; } } if (!ok) { puts( yes ); return 0; } } puts( no ); return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e7 + 100; const int INF = 0x3FFFFFFF; bool vis[MAXN]; int main() { long long a, b, m; cin >> a >> b >> m; for (int i = 1; i <= a; i++) { long long t = 1e9; long long mod = i * t % m; if (vis[mod]) break; vis[mod] = 1; if (b + mod < m && mod) { cout << 1 ; int cnt = 0; int temp = i; while (i) { i /= 10; cnt++; } for (int j = 1; j <= 9 - cnt; j++) cout << 0; cout << temp << endl; return 0; } } cout << 2 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 710, size = 1 << 20, mod = (int)1e9 + 7, inf = 2e9; const long long INF = 1e15; template <class o> void qr(o& x) { char c = getchar(); x = 0; int f = 1; while (!isdigit(c)) { if (c == - ) f = -1; c = getchar(); } while (isdigit(c)) x = x * 10 + c - 0 , c = getchar(); x *= f; } template <class o, class... O> void qr(o& x, O&... y) { qr(x); qr(y...); } template <class o> void qw(o x) { if (x / 10) qw(x / 10); putchar(x % 10 + 0 ); } template <class o> void pr1(o x) { if (x < 0) x = -x, putchar( - ); qw(x); putchar( ); } template <class o, class... O> void pr1(o x, O... y) { pr1(x); pr1(y...); } template <class o> void pr2(o x) { if (x < 0) x = -x, putchar( - ); qw(x); putchar( n ); } template <class o, class... O> void pr2(o x, O... y) { pr2(x); pr2(y...); } long long gcd(long long a, long long b) { return !a ? b : gcd(b % a, a); } long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } long long power(long long a, long long b = mod - 2, long long p = mod) { long long c = 1; while (b) { if (b & 1) c = c * a % p; b /= 2; a = a * a % p; } return c; } long long exgcd(long long a, long long b, long long& x, long long& y) { if (!a) { x = 0; y = 1; return b; } long long d = exgcd(b % a, a, y, x); x -= b / a * y; return d; } long long INV(long long n, long long p = mod) { long long x, y; exgcd(n, p, x, y); return (x % p + p) % p; } template <class o> void cmax(o& x, o y) { if (x < y) x = y; } template <class o> void cmin(o& x, o y) { if (x > y) x = y; } template <typename t1, typename t2> void ad(t1& x, t2 y) { x += y; if (x >= mod) x -= mod; } template <typename t1, typename t2> void dl(t1& x, t2 y) { x -= y; if (x < 0) x += mod; } char str[N]; int n, a[N], cnt[10], f[N][N][10][2]; void solve() { scanf( %s , str + 1); int n = strlen(str + 1); for (int i = 1; i <= n; i++) a[i] = str[i] - 0 ; for (int i = 1; i <= 9; i++) f[0][0][i][0] = 1; for (int i = 0; i <= n - 1; i++) for (int j = 0; j <= i; j++) for (int k = 1; k <= 9; k++) for (int l = 0; l <= 1; l++) if (f[i][j][k][l]) for (int v = !l ? a[i + 1] : 9; v >= 0; v--) ad(f[i + 1][j + (v >= k)][k][l | (v < a[i + 1])], f[i][j][k][l]); long long p = 1, ans = 0; for (int i = 1; i <= n; i++) { long long sum = 0; for (int j = 1; j <= 9; j++) sum += f[n][i][j][0] + f[n][i][j][1]; sum %= mod; ans = (ans + sum * p) % mod; p = (p * 10 + 1) % mod; } pr2(ans); } int main() { int T = 1; while (T--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 1e5; int a[100][100]; int main() { int n, i = 0; cin >> n; cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); cin >> a[i / n][i % n]; i++; a[i / n][i % n] = (i >= n * n ? INF : a[i / n][i % n]); i = 0; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[i / 10][i % 10] = ((i / 10 >= n || i % 10 >= n) ? INF : a[i / 10][i % 10]); i++; a[0][0] = min(a[0][0], a[0][0] + a[0][0]); a[0][1] = min(a[0][1], a[0][0] + a[0][1]); a[0][2] = min(a[0][2], a[0][0] + a[0][2]); a[0][3] = min(a[0][3], a[0][0] + a[0][3]); a[0][4] = min(a[0][4], a[0][0] + a[0][4]); a[0][5] = min(a[0][5], a[0][0] + a[0][5]); a[0][6] = min(a[0][6], a[0][0] + a[0][6]); a[0][7] = min(a[0][7], a[0][0] + a[0][7]); a[0][8] = min(a[0][8], a[0][0] + a[0][8]); a[0][9] = min(a[0][9], a[0][0] + a[0][9]); a[1][0] = min(a[1][0], a[1][0] + a[0][0]); a[1][1] = min(a[1][1], a[1][0] + a[0][1]); a[1][2] = min(a[1][2], a[1][0] + a[0][2]); a[1][3] = min(a[1][3], a[1][0] + a[0][3]); a[1][4] = min(a[1][4], a[1][0] + a[0][4]); a[1][5] = min(a[1][5], a[1][0] + a[0][5]); a[1][6] = min(a[1][6], a[1][0] + a[0][6]); a[1][7] = min(a[1][7], a[1][0] + a[0][7]); a[1][8] = min(a[1][8], a[1][0] + a[0][8]); a[1][9] = min(a[1][9], a[1][0] + a[0][9]); a[2][0] = min(a[2][0], a[2][0] + a[0][0]); a[2][1] = min(a[2][1], a[2][0] + a[0][1]); a[2][2] = min(a[2][2], a[2][0] + a[0][2]); a[2][3] = min(a[2][3], a[2][0] + a[0][3]); a[2][4] = min(a[2][4], a[2][0] + a[0][4]); a[2][5] = min(a[2][5], a[2][0] + a[0][5]); a[2][6] = min(a[2][6], a[2][0] + a[0][6]); a[2][7] = min(a[2][7], a[2][0] + a[0][7]); a[2][8] = min(a[2][8], a[2][0] + a[0][8]); a[2][9] = min(a[2][9], a[2][0] + a[0][9]); a[3][0] = min(a[3][0], a[3][0] + a[0][0]); a[3][1] = min(a[3][1], a[3][0] + a[0][1]); a[3][2] = min(a[3][2], a[3][0] + a[0][2]); a[3][3] = min(a[3][3], a[3][0] + a[0][3]); a[3][4] = min(a[3][4], a[3][0] + a[0][4]); a[3][5] = min(a[3][5], a[3][0] + a[0][5]); a[3][6] = min(a[3][6], a[3][0] + a[0][6]); a[3][7] = min(a[3][7], a[3][0] + a[0][7]); a[3][8] = min(a[3][8], a[3][0] + a[0][8]); a[3][9] = min(a[3][9], a[3][0] + a[0][9]); a[4][0] = min(a[4][0], a[4][0] + a[0][0]); a[4][1] = min(a[4][1], a[4][0] + a[0][1]); a[4][2] = min(a[4][2], a[4][0] + a[0][2]); a[4][3] = min(a[4][3], a[4][0] + a[0][3]); a[4][4] = min(a[4][4], a[4][0] + a[0][4]); a[4][5] = min(a[4][5], a[4][0] + a[0][5]); a[4][6] = min(a[4][6], a[4][0] + a[0][6]); a[4][7] = min(a[4][7], a[4][0] + a[0][7]); a[4][8] = min(a[4][8], a[4][0] + a[0][8]); a[4][9] = min(a[4][9], a[4][0] + a[0][9]); a[5][0] = min(a[5][0], a[5][0] + a[0][0]); a[5][1] = min(a[5][1], a[5][0] + a[0][1]); a[5][2] = min(a[5][2], a[5][0] + a[0][2]); a[5][3] = min(a[5][3], a[5][0] + a[0][3]); a[5][4] = min(a[5][4], a[5][0] + a[0][4]); a[5][5] = min(a[5][5], a[5][0] + a[0][5]); a[5][6] = min(a[5][6], a[5][0] + a[0][6]); a[5][7] = min(a[5][7], a[5][0] + a[0][7]); a[5][8] = min(a[5][8], a[5][0] + a[0][8]); a[5][9] = min(a[5][9], a[5][0] + a[0][9]); a[6][0] = min(a[6][0], a[6][0] + a[0][0]); a[6][1] = min(a[6][1], a[6][0] + a[0][1]); a[6][2] = min(a[6][2], a[6][0] + a[0][2]); a[6][3] = min(a[6][3], a[6][0] + a[0][3]); a[6][4] = min(a[6][4], a[6][0] + a[0][4]); a[6][5] = min(a[6][5], a[6][0] + a[0][5]); a[6][6] = min(a[6][6], a[6][0] + a[0][6]); a[6][7] = min(a[6][7], a[6][0] + a[0][7]); a[6][8] = min(a[6][8], a[6][0] + a[0][8]); a[6][9] = min(a[6][9], a[6][0] + a[0][9]); a[7][0] = min(a[7][0], a[7][0] + a[0][0]); a[7][1] = min(a[7][1], a[7][0] + a[0][1]); a[7][2] = min(a[7][2], a[7][0] + a[0][2]); a[7][3] = min(a[7][3], a[7][0] + a[0][3]); a[7][4] = min(a[7][4], a[7][0] + a[0][4]); a[7][5] = min(a[7][5], a[7][0] + a[0][5]); a[7][6] = min(a[7][6], a[7][0] + a[0][6]); a[7][7] = min(a[7][7], a[7][0] + a[0][7]); a[7][8] = min(a[7][8], a[7][0] + a[0][8]); a[7][9] = min(a[7][9], a[7][0] + a[0][9]); a[8][0] = min(a[8][0], a[8][0] + a[0][0]); a[8][1] = min(a[8][1], a[8][0] + a[0][1]); a[8][2] = min(a[8][2], a[8][0] + a[0][2]); a[8][3] = min(a[8][3], a[8][0] + a[0][3]); a[8][4] = min(a[8][4], a[8][0] + a[0][4]); a[8][5] = min(a[8][5], a[8][0] + a[0][5]); a[8][6] = min(a[8][6], a[8][0] + a[0][6]); a[8][7] = min(a[8][7], a[8][0] + a[0][7]); a[8][8] = min(a[8][8], a[8][0] + a[0][8]); a[8][9] = min(a[8][9], a[8][0] + a[0][9]); a[9][0] = min(a[9][0], a[9][0] + a[0][0]); a[9][1] = min(a[9][1], a[9][0] + a[0][1]); a[9][2] = min(a[9][2], a[9][0] + a[0][2]); a[9][3] = min(a[9][3], a[9][0] + a[0][3]); a[9][4] = min(a[9][4], a[9][0] + a[0][4]); a[9][5] = min(a[9][5], a[9][0] + a[0][5]); a[9][6] = min(a[9][6], a[9][0] + a[0][6]); a[9][7] = min(a[9][7], a[9][0] + a[0][7]); a[9][8] = min(a[9][8], a[9][0] + a[0][8]); a[9][9] = min(a[9][9], a[9][0] + a[0][9]); a[0][0] = min(a[0][0], a[0][1] + a[1][0]); a[0][1] = min(a[0][1], a[0][1] + a[1][1]); a[0][2] = min(a[0][2], a[0][1] + a[1][2]); a[0][3] = min(a[0][3], a[0][1] + a[1][3]); a[0][4] = min(a[0][4], a[0][1] + a[1][4]); a[0][5] = min(a[0][5], a[0][1] + a[1][5]); a[0][6] = min(a[0][6], a[0][1] + a[1][6]); a[0][7] = min(a[0][7], a[0][1] + a[1][7]); a[0][8] = min(a[0][8], a[0][1] + a[1][8]); a[0][9] = min(a[0][9], a[0][1] + a[1][9]); a[1][0] = min(a[1][0], a[1][1] + a[1][0]); a[1][1] = min(a[1][1], a[1][1] + a[1][1]); a[1][2] = min(a[1][2], a[1][1] + a[1][2]); a[1][3] = min(a[1][3], a[1][1] + a[1][3]); a[1][4] = min(a[1][4], a[1][1] + a[1][4]); a[1][5] = min(a[1][5], a[1][1] + a[1][5]); a[1][6] = min(a[1][6], a[1][1] + a[1][6]); a[1][7] = min(a[1][7], a[1][1] + a[1][7]); a[1][8] = min(a[1][8], a[1][1] + a[1][8]); a[1][9] = min(a[1][9], a[1][1] + a[1][9]); a[2][0] = min(a[2][0], a[2][1] + a[1][0]); a[2][1] = min(a[2][1], a[2][1] + a[1][1]); a[2][2] = min(a[2][2], a[2][1] + a[1][2]); a[2][3] = min(a[2][3], a[2][1] + a[1][3]); a[2][4] = min(a[2][4], a[2][1] + a[1][4]); a[2][5] = min(a[2][5], a[2][1] + a[1][5]); a[2][6] = min(a[2][6], a[2][1] + a[1][6]); a[2][7] = min(a[2][7], a[2][1] + a[1][7]); a[2][8] = min(a[2][8], a[2][1] + a[1][8]); a[2][9] = min(a[2][9], a[2][1] + a[1][9]); a[3][0] = min(a[3][0], a[3][1] + a[1][0]); a[3][1] = min(a[3][1], a[3][1] + a[1][1]); a[3][2] = min(a[3][2], a[3][1] + a[1][2]); a[3][3] = min(a[3][3], a[3][1] + a[1][3]); a[3][4] = min(a[3][4], a[3][1] + a[1][4]); a[3][5] = min(a[3][5], a[3][1] + a[1][5]); a[3][6] = min(a[3][6], a[3][1] + a[1][6]); a[3][7] = min(a[3][7], a[3][1] + a[1][7]); a[3][8] = min(a[3][8], a[3][1] + a[1][8]); a[3][9] = min(a[3][9], a[3][1] + a[1][9]); a[4][0] = min(a[4][0], a[4][1] + a[1][0]); a[4][1] = min(a[4][1], a[4][1] + a[1][1]); a[4][2] = min(a[4][2], a[4][1] + a[1][2]); a[4][3] = min(a[4][3], a[4][1] + a[1][3]); a[4][4] = min(a[4][4], a[4][1] + a[1][4]); a[4][5] = min(a[4][5], a[4][1] + a[1][5]); a[4][6] = min(a[4][6], a[4][1] + a[1][6]); a[4][7] = min(a[4][7], a[4][1] + a[1][7]); a[4][8] = min(a[4][8], a[4][1] + a[1][8]); a[4][9] = min(a[4][9], a[4][1] + a[1][9]); a[5][0] = min(a[5][0], a[5][1] + a[1][0]); a[5][1] = min(a[5][1], a[5][1] + a[1][1]); a[5][2] = min(a[5][2], a[5][1] + a[1][2]); a[5][3] = min(a[5][3], a[5][1] + a[1][3]); a[5][4] = min(a[5][4], a[5][1] + a[1][4]); a[5][5] = min(a[5][5], a[5][1] + a[1][5]); a[5][6] = min(a[5][6], a[5][1] + a[1][6]); a[5][7] = min(a[5][7], a[5][1] + a[1][7]); a[5][8] = min(a[5][8], a[5][1] + a[1][8]); a[5][9] = min(a[5][9], a[5][1] + a[1][9]); a[6][0] = min(a[6][0], a[6][1] + a[1][0]); a[6][1] = min(a[6][1], a[6][1] + a[1][1]); a[6][2] = min(a[6][2], a[6][1] + a[1][2]); a[6][3] = min(a[6][3], a[6][1] + a[1][3]); a[6][4] = min(a[6][4], a[6][1] + a[1][4]); a[6][5] = min(a[6][5], a[6][1] + a[1][5]); a[6][6] = min(a[6][6], a[6][1] + a[1][6]); a[6][7] = min(a[6][7], a[6][1] + a[1][7]); a[6][8] = min(a[6][8], a[6][1] + a[1][8]); a[6][9] = min(a[6][9], a[6][1] + a[1][9]); a[7][0] = min(a[7][0], a[7][1] + a[1][0]); a[7][1] = min(a[7][1], a[7][1] + a[1][1]); a[7][2] = min(a[7][2], a[7][1] + a[1][2]); a[7][3] = min(a[7][3], a[7][1] + a[1][3]); a[7][4] = min(a[7][4], a[7][1] + a[1][4]); a[7][5] = min(a[7][5], a[7][1] + a[1][5]); a[7][6] = min(a[7][6], a[7][1] + a[1][6]); a[7][7] = min(a[7][7], a[7][1] + a[1][7]); a[7][8] = min(a[7][8], a[7][1] + a[1][8]); a[7][9] = min(a[7][9], a[7][1] + a[1][9]); a[8][0] = min(a[8][0], a[8][1] + a[1][0]); a[8][1] = min(a[8][1], a[8][1] + a[1][1]); a[8][2] = min(a[8][2], a[8][1] + a[1][2]); a[8][3] = min(a[8][3], a[8][1] + a[1][3]); a[8][4] = min(a[8][4], a[8][1] + a[1][4]); a[8][5] = min(a[8][5], a[8][1] + a[1][5]); a[8][6] = min(a[8][6], a[8][1] + a[1][6]); a[8][7] = min(a[8][7], a[8][1] + a[1][7]); a[8][8] = min(a[8][8], a[8][1] + a[1][8]); a[8][9] = min(a[8][9], a[8][1] + a[1][9]); a[9][0] = min(a[9][0], a[9][1] + a[1][0]); a[9][1] = min(a[9][1], a[9][1] + a[1][1]); a[9][2] = min(a[9][2], a[9][1] + a[1][2]); a[9][3] = min(a[9][3], a[9][1] + a[1][3]); a[9][4] = min(a[9][4], a[9][1] + a[1][4]); a[9][5] = min(a[9][5], a[9][1] + a[1][5]); a[9][6] = min(a[9][6], a[9][1] + a[1][6]); a[9][7] = min(a[9][7], a[9][1] + a[1][7]); a[9][8] = min(a[9][8], a[9][1] + a[1][8]); a[9][9] = min(a[9][9], a[9][1] + a[1][9]); a[0][0] = min(a[0][0], a[0][2] + a[2][0]); a[0][1] = min(a[0][1], a[0][2] + a[2][1]); a[0][2] = min(a[0][2], a[0][2] + a[2][2]); a[0][3] = min(a[0][3], a[0][2] + a[2][3]); a[0][4] = min(a[0][4], a[0][2] + a[2][4]); a[0][5] = min(a[0][5], a[0][2] + a[2][5]); a[0][6] = min(a[0][6], a[0][2] + a[2][6]); a[0][7] = min(a[0][7], a[0][2] + a[2][7]); a[0][8] = min(a[0][8], a[0][2] + a[2][8]); a[0][9] = min(a[0][9], a[0][2] + a[2][9]); a[1][0] = min(a[1][0], a[1][2] + a[2][0]); a[1][1] = min(a[1][1], a[1][2] + a[2][1]); a[1][2] = min(a[1][2], a[1][2] + a[2][2]); a[1][3] = min(a[1][3], a[1][2] + a[2][3]); a[1][4] = min(a[1][4], a[1][2] + a[2][4]); a[1][5] = min(a[1][5], a[1][2] + a[2][5]); a[1][6] = min(a[1][6], a[1][2] + a[2][6]); a[1][7] = min(a[1][7], a[1][2] + a[2][7]); a[1][8] = min(a[1][8], a[1][2] + a[2][8]); a[1][9] = min(a[1][9], a[1][2] + a[2][9]); a[2][0] = min(a[2][0], a[2][2] + a[2][0]); a[2][1] = min(a[2][1], a[2][2] + a[2][1]); a[2][2] = min(a[2][2], a[2][2] + a[2][2]); a[2][3] = min(a[2][3], a[2][2] + a[2][3]); a[2][4] = min(a[2][4], a[2][2] + a[2][4]); a[2][5] = min(a[2][5], a[2][2] + a[2][5]); a[2][6] = min(a[2][6], a[2][2] + a[2][6]); a[2][7] = min(a[2][7], a[2][2] + a[2][7]); a[2][8] = min(a[2][8], a[2][2] + a[2][8]); a[2][9] = min(a[2][9], a[2][2] + a[2][9]); a[3][0] = min(a[3][0], a[3][2] + a[2][0]); a[3][1] = min(a[3][1], a[3][2] + a[2][1]); a[3][2] = min(a[3][2], a[3][2] + a[2][2]); a[3][3] = min(a[3][3], a[3][2] + a[2][3]); a[3][4] = min(a[3][4], a[3][2] + a[2][4]); a[3][5] = min(a[3][5], a[3][2] + a[2][5]); a[3][6] = min(a[3][6], a[3][2] + a[2][6]); a[3][7] = min(a[3][7], a[3][2] + a[2][7]); a[3][8] = min(a[3][8], a[3][2] + a[2][8]); a[3][9] = min(a[3][9], a[3][2] + a[2][9]); a[4][0] = min(a[4][0], a[4][2] + a[2][0]); a[4][1] = min(a[4][1], a[4][2] + a[2][1]); a[4][2] = min(a[4][2], a[4][2] + a[2][2]); a[4][3] = min(a[4][3], a[4][2] + a[2][3]); a[4][4] = min(a[4][4], a[4][2] + a[2][4]); a[4][5] = min(a[4][5], a[4][2] + a[2][5]); a[4][6] = min(a[4][6], a[4][2] + a[2][6]); a[4][7] = min(a[4][7], a[4][2] + a[2][7]); a[4][8] = min(a[4][8], a[4][2] + a[2][8]); a[4][9] = min(a[4][9], a[4][2] + a[2][9]); a[5][0] = min(a[5][0], a[5][2] + a[2][0]); a[5][1] = min(a[5][1], a[5][2] + a[2][1]); a[5][2] = min(a[5][2], a[5][2] + a[2][2]); a[5][3] = min(a[5][3], a[5][2] + a[2][3]); a[5][4] = min(a[5][4], a[5][2] + a[2][4]); a[5][5] = min(a[5][5], a[5][2] + a[2][5]); a[5][6] = min(a[5][6], a[5][2] + a[2][6]); a[5][7] = min(a[5][7], a[5][2] + a[2][7]); a[5][8] = min(a[5][8], a[5][2] + a[2][8]); a[5][9] = min(a[5][9], a[5][2] + a[2][9]); a[6][0] = min(a[6][0], a[6][2] + a[2][0]); a[6][1] = min(a[6][1], a[6][2] + a[2][1]); a[6][2] = min(a[6][2], a[6][2] + a[2][2]); a[6][3] = min(a[6][3], a[6][2] + a[2][3]); a[6][4] = min(a[6][4], a[6][2] + a[2][4]); a[6][5] = min(a[6][5], a[6][2] + a[2][5]); a[6][6] = min(a[6][6], a[6][2] + a[2][6]); a[6][7] = min(a[6][7], a[6][2] + a[2][7]); a[6][8] = min(a[6][8], a[6][2] + a[2][8]); a[6][9] = min(a[6][9], a[6][2] + a[2][9]); a[7][0] = min(a[7][0], a[7][2] + a[2][0]); a[7][1] = min(a[7][1], a[7][2] + a[2][1]); a[7][2] = min(a[7][2], a[7][2] + a[2][2]); a[7][3] = min(a[7][3], a[7][2] + a[2][3]); a[7][4] = min(a[7][4], a[7][2] + a[2][4]); a[7][5] = min(a[7][5], a[7][2] + a[2][5]); a[7][6] = min(a[7][6], a[7][2] + a[2][6]); a[7][7] = min(a[7][7], a[7][2] + a[2][7]); a[7][8] = min(a[7][8], a[7][2] + a[2][8]); a[7][9] = min(a[7][9], a[7][2] + a[2][9]); a[8][0] = min(a[8][0], a[8][2] + a[2][0]); a[8][1] = min(a[8][1], a[8][2] + a[2][1]); a[8][2] = min(a[8][2], a[8][2] + a[2][2]); a[8][3] = min(a[8][3], a[8][2] + a[2][3]); a[8][4] = min(a[8][4], a[8][2] + a[2][4]); a[8][5] = min(a[8][5], a[8][2] + a[2][5]); a[8][6] = min(a[8][6], a[8][2] + a[2][6]); a[8][7] = min(a[8][7], a[8][2] + a[2][7]); a[8][8] = min(a[8][8], a[8][2] + a[2][8]); a[8][9] = min(a[8][9], a[8][2] + a[2][9]); a[9][0] = min(a[9][0], a[9][2] + a[2][0]); a[9][1] = min(a[9][1], a[9][2] + a[2][1]); a[9][2] = min(a[9][2], a[9][2] + a[2][2]); a[9][3] = min(a[9][3], a[9][2] + a[2][3]); a[9][4] = min(a[9][4], a[9][2] + a[2][4]); a[9][5] = min(a[9][5], a[9][2] + a[2][5]); a[9][6] = min(a[9][6], a[9][2] + a[2][6]); a[9][7] = min(a[9][7], a[9][2] + a[2][7]); a[9][8] = min(a[9][8], a[9][2] + a[2][8]); a[9][9] = min(a[9][9], a[9][2] + a[2][9]); a[0][0] = min(a[0][0], a[0][3] + a[3][0]); a[0][1] = min(a[0][1], a[0][3] + a[3][1]); a[0][2] = min(a[0][2], a[0][3] + a[3][2]); a[0][3] = min(a[0][3], a[0][3] + a[3][3]); a[0][4] = min(a[0][4], a[0][3] + a[3][4]); a[0][5] = min(a[0][5], a[0][3] + a[3][5]); a[0][6] = min(a[0][6], a[0][3] + a[3][6]); a[0][7] = min(a[0][7], a[0][3] + a[3][7]); a[0][8] = min(a[0][8], a[0][3] + a[3][8]); a[0][9] = min(a[0][9], a[0][3] + a[3][9]); a[1][0] = min(a[1][0], a[1][3] + a[3][0]); a[1][1] = min(a[1][1], a[1][3] + a[3][1]); a[1][2] = min(a[1][2], a[1][3] + a[3][2]); a[1][3] = min(a[1][3], a[1][3] + a[3][3]); a[1][4] = min(a[1][4], a[1][3] + a[3][4]); a[1][5] = min(a[1][5], a[1][3] + a[3][5]); a[1][6] = min(a[1][6], a[1][3] + a[3][6]); a[1][7] = min(a[1][7], a[1][3] + a[3][7]); a[1][8] = min(a[1][8], a[1][3] + a[3][8]); a[1][9] = min(a[1][9], a[1][3] + a[3][9]); a[2][0] = min(a[2][0], a[2][3] + a[3][0]); a[2][1] = min(a[2][1], a[2][3] + a[3][1]); a[2][2] = min(a[2][2], a[2][3] + a[3][2]); a[2][3] = min(a[2][3], a[2][3] + a[3][3]); a[2][4] = min(a[2][4], a[2][3] + a[3][4]); a[2][5] = min(a[2][5], a[2][3] + a[3][5]); a[2][6] = min(a[2][6], a[2][3] + a[3][6]); a[2][7] = min(a[2][7], a[2][3] + a[3][7]); a[2][8] = min(a[2][8], a[2][3] + a[3][8]); a[2][9] = min(a[2][9], a[2][3] + a[3][9]); a[3][0] = min(a[3][0], a[3][3] + a[3][0]); a[3][1] = min(a[3][1], a[3][3] + a[3][1]); a[3][2] = min(a[3][2], a[3][3] + a[3][2]); a[3][3] = min(a[3][3], a[3][3] + a[3][3]); a[3][4] = min(a[3][4], a[3][3] + a[3][4]); a[3][5] = min(a[3][5], a[3][3] + a[3][5]); a[3][6] = min(a[3][6], a[3][3] + a[3][6]); a[3][7] = min(a[3][7], a[3][3] + a[3][7]); a[3][8] = min(a[3][8], a[3][3] + a[3][8]); a[3][9] = min(a[3][9], a[3][3] + a[3][9]); a[4][0] = min(a[4][0], a[4][3] + a[3][0]); a[4][1] = min(a[4][1], a[4][3] + a[3][1]); a[4][2] = min(a[4][2], a[4][3] + a[3][2]); a[4][3] = min(a[4][3], a[4][3] + a[3][3]); a[4][4] = min(a[4][4], a[4][3] + a[3][4]); a[4][5] = min(a[4][5], a[4][3] + a[3][5]); a[4][6] = min(a[4][6], a[4][3] + a[3][6]); a[4][7] = min(a[4][7], a[4][3] + a[3][7]); a[4][8] = min(a[4][8], a[4][3] + a[3][8]); a[4][9] = min(a[4][9], a[4][3] + a[3][9]); a[5][0] = min(a[5][0], a[5][3] + a[3][0]); a[5][1] = min(a[5][1], a[5][3] + a[3][1]); a[5][2] = min(a[5][2], a[5][3] + a[3][2]); a[5][3] = min(a[5][3], a[5][3] + a[3][3]); a[5][4] = min(a[5][4], a[5][3] + a[3][4]); a[5][5] = min(a[5][5], a[5][3] + a[3][5]); a[5][6] = min(a[5][6], a[5][3] + a[3][6]); a[5][7] = min(a[5][7], a[5][3] + a[3][7]); a[5][8] = min(a[5][8], a[5][3] + a[3][8]); a[5][9] = min(a[5][9], a[5][3] + a[3][9]); a[6][0] = min(a[6][0], a[6][3] + a[3][0]); a[6][1] = min(a[6][1], a[6][3] + a[3][1]); a[6][2] = min(a[6][2], a[6][3] + a[3][2]); a[6][3] = min(a[6][3], a[6][3] + a[3][3]); a[6][4] = min(a[6][4], a[6][3] + a[3][4]); a[6][5] = min(a[6][5], a[6][3] + a[3][5]); a[6][6] = min(a[6][6], a[6][3] + a[3][6]); a[6][7] = min(a[6][7], a[6][3] + a[3][7]); a[6][8] = min(a[6][8], a[6][3] + a[3][8]); a[6][9] = min(a[6][9], a[6][3] + a[3][9]); a[7][0] = min(a[7][0], a[7][3] + a[3][0]); a[7][1] = min(a[7][1], a[7][3] + a[3][1]); a[7][2] = min(a[7][2], a[7][3] + a[3][2]); a[7][3] = min(a[7][3], a[7][3] + a[3][3]); a[7][4] = min(a[7][4], a[7][3] + a[3][4]); a[7][5] = min(a[7][5], a[7][3] + a[3][5]); a[7][6] = min(a[7][6], a[7][3] + a[3][6]); a[7][7] = min(a[7][7], a[7][3] + a[3][7]); a[7][8] = min(a[7][8], a[7][3] + a[3][8]); a[7][9] = min(a[7][9], a[7][3] + a[3][9]); a[8][0] = min(a[8][0], a[8][3] + a[3][0]); a[8][1] = min(a[8][1], a[8][3] + a[3][1]); a[8][2] = min(a[8][2], a[8][3] + a[3][2]); a[8][3] = min(a[8][3], a[8][3] + a[3][3]); a[8][4] = min(a[8][4], a[8][3] + a[3][4]); a[8][5] = min(a[8][5], a[8][3] + a[3][5]); a[8][6] = min(a[8][6], a[8][3] + a[3][6]); a[8][7] = min(a[8][7], a[8][3] + a[3][7]); a[8][8] = min(a[8][8], a[8][3] + a[3][8]); a[8][9] = min(a[8][9], a[8][3] + a[3][9]); a[9][0] = min(a[9][0], a[9][3] + a[3][0]); a[9][1] = min(a[9][1], a[9][3] + a[3][1]); a[9][2] = min(a[9][2], a[9][3] + a[3][2]); a[9][3] = min(a[9][3], a[9][3] + a[3][3]); a[9][4] = min(a[9][4], a[9][3] + a[3][4]); a[9][5] = min(a[9][5], a[9][3] + a[3][5]); a[9][6] = min(a[9][6], a[9][3] + a[3][6]); a[9][7] = min(a[9][7], a[9][3] + a[3][7]); a[9][8] = min(a[9][8], a[9][3] + a[3][8]); a[9][9] = min(a[9][9], a[9][3] + a[3][9]); a[0][0] = min(a[0][0], a[0][4] + a[4][0]); a[0][1] = min(a[0][1], a[0][4] + a[4][1]); a[0][2] = min(a[0][2], a[0][4] + a[4][2]); a[0][3] = min(a[0][3], a[0][4] + a[4][3]); a[0][4] = min(a[0][4], a[0][4] + a[4][4]); a[0][5] = min(a[0][5], a[0][4] + a[4][5]); a[0][6] = min(a[0][6], a[0][4] + a[4][6]); a[0][7] = min(a[0][7], a[0][4] + a[4][7]); a[0][8] = min(a[0][8], a[0][4] + a[4][8]); a[0][9] = min(a[0][9], a[0][4] + a[4][9]); a[1][0] = min(a[1][0], a[1][4] + a[4][0]); a[1][1] = min(a[1][1], a[1][4] + a[4][1]); a[1][2] = min(a[1][2], a[1][4] + a[4][2]); a[1][3] = min(a[1][3], a[1][4] + a[4][3]); a[1][4] = min(a[1][4], a[1][4] + a[4][4]); a[1][5] = min(a[1][5], a[1][4] + a[4][5]); a[1][6] = min(a[1][6], a[1][4] + a[4][6]); a[1][7] = min(a[1][7], a[1][4] + a[4][7]); a[1][8] = min(a[1][8], a[1][4] + a[4][8]); a[1][9] = min(a[1][9], a[1][4] + a[4][9]); a[2][0] = min(a[2][0], a[2][4] + a[4][0]); a[2][1] = min(a[2][1], a[2][4] + a[4][1]); a[2][2] = min(a[2][2], a[2][4] + a[4][2]); a[2][3] = min(a[2][3], a[2][4] + a[4][3]); a[2][4] = min(a[2][4], a[2][4] + a[4][4]); a[2][5] = min(a[2][5], a[2][4] + a[4][5]); a[2][6] = min(a[2][6], a[2][4] + a[4][6]); a[2][7] = min(a[2][7], a[2][4] + a[4][7]); a[2][8] = min(a[2][8], a[2][4] + a[4][8]); a[2][9] = min(a[2][9], a[2][4] + a[4][9]); a[3][0] = min(a[3][0], a[3][4] + a[4][0]); a[3][1] = min(a[3][1], a[3][4] + a[4][1]); a[3][2] = min(a[3][2], a[3][4] + a[4][2]); a[3][3] = min(a[3][3], a[3][4] + a[4][3]); a[3][4] = min(a[3][4], a[3][4] + a[4][4]); a[3][5] = min(a[3][5], a[3][4] + a[4][5]); a[3][6] = min(a[3][6], a[3][4] + a[4][6]); a[3][7] = min(a[3][7], a[3][4] + a[4][7]); a[3][8] = min(a[3][8], a[3][4] + a[4][8]); a[3][9] = min(a[3][9], a[3][4] + a[4][9]); a[4][0] = min(a[4][0], a[4][4] + a[4][0]); a[4][1] = min(a[4][1], a[4][4] + a[4][1]); a[4][2] = min(a[4][2], a[4][4] + a[4][2]); a[4][3] = min(a[4][3], a[4][4] + a[4][3]); a[4][4] = min(a[4][4], a[4][4] + a[4][4]); a[4][5] = min(a[4][5], a[4][4] + a[4][5]); a[4][6] = min(a[4][6], a[4][4] + a[4][6]); a[4][7] = min(a[4][7], a[4][4] + a[4][7]); a[4][8] = min(a[4][8], a[4][4] + a[4][8]); a[4][9] = min(a[4][9], a[4][4] + a[4][9]); a[5][0] = min(a[5][0], a[5][4] + a[4][0]); a[5][1] = min(a[5][1], a[5][4] + a[4][1]); a[5][2] = min(a[5][2], a[5][4] + a[4][2]); a[5][3] = min(a[5][3], a[5][4] + a[4][3]); a[5][4] = min(a[5][4], a[5][4] + a[4][4]); a[5][5] = min(a[5][5], a[5][4] + a[4][5]); a[5][6] = min(a[5][6], a[5][4] + a[4][6]); a[5][7] = min(a[5][7], a[5][4] + a[4][7]); a[5][8] = min(a[5][8], a[5][4] + a[4][8]); a[5][9] = min(a[5][9], a[5][4] + a[4][9]); a[6][0] = min(a[6][0], a[6][4] + a[4][0]); a[6][1] = min(a[6][1], a[6][4] + a[4][1]); a[6][2] = min(a[6][2], a[6][4] + a[4][2]); a[6][3] = min(a[6][3], a[6][4] + a[4][3]); a[6][4] = min(a[6][4], a[6][4] + a[4][4]); a[6][5] = min(a[6][5], a[6][4] + a[4][5]); a[6][6] = min(a[6][6], a[6][4] + a[4][6]); a[6][7] = min(a[6][7], a[6][4] + a[4][7]); a[6][8] = min(a[6][8], a[6][4] + a[4][8]); a[6][9] = min(a[6][9], a[6][4] + a[4][9]); a[7][0] = min(a[7][0], a[7][4] + a[4][0]); a[7][1] = min(a[7][1], a[7][4] + a[4][1]); a[7][2] = min(a[7][2], a[7][4] + a[4][2]); a[7][3] = min(a[7][3], a[7][4] + a[4][3]); a[7][4] = min(a[7][4], a[7][4] + a[4][4]); a[7][5] = min(a[7][5], a[7][4] + a[4][5]); a[7][6] = min(a[7][6], a[7][4] + a[4][6]); a[7][7] = min(a[7][7], a[7][4] + a[4][7]); a[7][8] = min(a[7][8], a[7][4] + a[4][8]); a[7][9] = min(a[7][9], a[7][4] + a[4][9]); a[8][0] = min(a[8][0], a[8][4] + a[4][0]); a[8][1] = min(a[8][1], a[8][4] + a[4][1]); a[8][2] = min(a[8][2], a[8][4] + a[4][2]); a[8][3] = min(a[8][3], a[8][4] + a[4][3]); a[8][4] = min(a[8][4], a[8][4] + a[4][4]); a[8][5] = min(a[8][5], a[8][4] + a[4][5]); a[8][6] = min(a[8][6], a[8][4] + a[4][6]); a[8][7] = min(a[8][7], a[8][4] + a[4][7]); a[8][8] = min(a[8][8], a[8][4] + a[4][8]); a[8][9] = min(a[8][9], a[8][4] + a[4][9]); a[9][0] = min(a[9][0], a[9][4] + a[4][0]); a[9][1] = min(a[9][1], a[9][4] + a[4][1]); a[9][2] = min(a[9][2], a[9][4] + a[4][2]); a[9][3] = min(a[9][3], a[9][4] + a[4][3]); a[9][4] = min(a[9][4], a[9][4] + a[4][4]); a[9][5] = min(a[9][5], a[9][4] + a[4][5]); a[9][6] = min(a[9][6], a[9][4] + a[4][6]); a[9][7] = min(a[9][7], a[9][4] + a[4][7]); a[9][8] = min(a[9][8], a[9][4] + a[4][8]); a[9][9] = min(a[9][9], a[9][4] + a[4][9]); a[0][0] = min(a[0][0], a[0][5] + a[5][0]); a[0][1] = min(a[0][1], a[0][5] + a[5][1]); a[0][2] = min(a[0][2], a[0][5] + a[5][2]); a[0][3] = min(a[0][3], a[0][5] + a[5][3]); a[0][4] = min(a[0][4], a[0][5] + a[5][4]); a[0][5] = min(a[0][5], a[0][5] + a[5][5]); a[0][6] = min(a[0][6], a[0][5] + a[5][6]); a[0][7] = min(a[0][7], a[0][5] + a[5][7]); a[0][8] = min(a[0][8], a[0][5] + a[5][8]); a[0][9] = min(a[0][9], a[0][5] + a[5][9]); a[1][0] = min(a[1][0], a[1][5] + a[5][0]); a[1][1] = min(a[1][1], a[1][5] + a[5][1]); a[1][2] = min(a[1][2], a[1][5] + a[5][2]); a[1][3] = min(a[1][3], a[1][5] + a[5][3]); a[1][4] = min(a[1][4], a[1][5] + a[5][4]); a[1][5] = min(a[1][5], a[1][5] + a[5][5]); a[1][6] = min(a[1][6], a[1][5] + a[5][6]); a[1][7] = min(a[1][7], a[1][5] + a[5][7]); a[1][8] = min(a[1][8], a[1][5] + a[5][8]); a[1][9] = min(a[1][9], a[1][5] + a[5][9]); a[2][0] = min(a[2][0], a[2][5] + a[5][0]); a[2][1] = min(a[2][1], a[2][5] + a[5][1]); a[2][2] = min(a[2][2], a[2][5] + a[5][2]); a[2][3] = min(a[2][3], a[2][5] + a[5][3]); a[2][4] = min(a[2][4], a[2][5] + a[5][4]); a[2][5] = min(a[2][5], a[2][5] + a[5][5]); a[2][6] = min(a[2][6], a[2][5] + a[5][6]); a[2][7] = min(a[2][7], a[2][5] + a[5][7]); a[2][8] = min(a[2][8], a[2][5] + a[5][8]); a[2][9] = min(a[2][9], a[2][5] + a[5][9]); a[3][0] = min(a[3][0], a[3][5] + a[5][0]); a[3][1] = min(a[3][1], a[3][5] + a[5][1]); a[3][2] = min(a[3][2], a[3][5] + a[5][2]); a[3][3] = min(a[3][3], a[3][5] + a[5][3]); a[3][4] = min(a[3][4], a[3][5] + a[5][4]); a[3][5] = min(a[3][5], a[3][5] + a[5][5]); a[3][6] = min(a[3][6], a[3][5] + a[5][6]); a[3][7] = min(a[3][7], a[3][5] + a[5][7]); a[3][8] = min(a[3][8], a[3][5] + a[5][8]); a[3][9] = min(a[3][9], a[3][5] + a[5][9]); a[4][0] = min(a[4][0], a[4][5] + a[5][0]); a[4][1] = min(a[4][1], a[4][5] + a[5][1]); a[4][2] = min(a[4][2], a[4][5] + a[5][2]); a[4][3] = min(a[4][3], a[4][5] + a[5][3]); a[4][4] = min(a[4][4], a[4][5] + a[5][4]); a[4][5] = min(a[4][5], a[4][5] + a[5][5]); a[4][6] = min(a[4][6], a[4][5] + a[5][6]); a[4][7] = min(a[4][7], a[4][5] + a[5][7]); a[4][8] = min(a[4][8], a[4][5] + a[5][8]); a[4][9] = min(a[4][9], a[4][5] + a[5][9]); a[5][0] = min(a[5][0], a[5][5] + a[5][0]); a[5][1] = min(a[5][1], a[5][5] + a[5][1]); a[5][2] = min(a[5][2], a[5][5] + a[5][2]); a[5][3] = min(a[5][3], a[5][5] + a[5][3]); a[5][4] = min(a[5][4], a[5][5] + a[5][4]); a[5][5] = min(a[5][5], a[5][5] + a[5][5]); a[5][6] = min(a[5][6], a[5][5] + a[5][6]); a[5][7] = min(a[5][7], a[5][5] + a[5][7]); a[5][8] = min(a[5][8], a[5][5] + a[5][8]); a[5][9] = min(a[5][9], a[5][5] + a[5][9]); a[6][0] = min(a[6][0], a[6][5] + a[5][0]); a[6][1] = min(a[6][1], a[6][5] + a[5][1]); a[6][2] = min(a[6][2], a[6][5] + a[5][2]); a[6][3] = min(a[6][3], a[6][5] + a[5][3]); a[6][4] = min(a[6][4], a[6][5] + a[5][4]); a[6][5] = min(a[6][5], a[6][5] + a[5][5]); a[6][6] = min(a[6][6], a[6][5] + a[5][6]); a[6][7] = min(a[6][7], a[6][5] + a[5][7]); a[6][8] = min(a[6][8], a[6][5] + a[5][8]); a[6][9] = min(a[6][9], a[6][5] + a[5][9]); a[7][0] = min(a[7][0], a[7][5] + a[5][0]); a[7][1] = min(a[7][1], a[7][5] + a[5][1]); a[7][2] = min(a[7][2], a[7][5] + a[5][2]); a[7][3] = min(a[7][3], a[7][5] + a[5][3]); a[7][4] = min(a[7][4], a[7][5] + a[5][4]); a[7][5] = min(a[7][5], a[7][5] + a[5][5]); a[7][6] = min(a[7][6], a[7][5] + a[5][6]); a[7][7] = min(a[7][7], a[7][5] + a[5][7]); a[7][8] = min(a[7][8], a[7][5] + a[5][8]); a[7][9] = min(a[7][9], a[7][5] + a[5][9]); a[8][0] = min(a[8][0], a[8][5] + a[5][0]); a[8][1] = min(a[8][1], a[8][5] + a[5][1]); a[8][2] = min(a[8][2], a[8][5] + a[5][2]); a[8][3] = min(a[8][3], a[8][5] + a[5][3]); a[8][4] = min(a[8][4], a[8][5] + a[5][4]); a[8][5] = min(a[8][5], a[8][5] + a[5][5]); a[8][6] = min(a[8][6], a[8][5] + a[5][6]); a[8][7] = min(a[8][7], a[8][5] + a[5][7]); a[8][8] = min(a[8][8], a[8][5] + a[5][8]); a[8][9] = min(a[8][9], a[8][5] + a[5][9]); a[9][0] = min(a[9][0], a[9][5] + a[5][0]); a[9][1] = min(a[9][1], a[9][5] + a[5][1]); a[9][2] = min(a[9][2], a[9][5] + a[5][2]); a[9][3] = min(a[9][3], a[9][5] + a[5][3]); a[9][4] = min(a[9][4], a[9][5] + a[5][4]); a[9][5] = min(a[9][5], a[9][5] + a[5][5]); a[9][6] = min(a[9][6], a[9][5] + a[5][6]); a[9][7] = min(a[9][7], a[9][5] + a[5][7]); a[9][8] = min(a[9][8], a[9][5] + a[5][8]); a[9][9] = min(a[9][9], a[9][5] + a[5][9]); a[0][0] = min(a[0][0], a[0][6] + a[6][0]); a[0][1] = min(a[0][1], a[0][6] + a[6][1]); a[0][2] = min(a[0][2], a[0][6] + a[6][2]); a[0][3] = min(a[0][3], a[0][6] + a[6][3]); a[0][4] = min(a[0][4], a[0][6] + a[6][4]); a[0][5] = min(a[0][5], a[0][6] + a[6][5]); a[0][6] = min(a[0][6], a[0][6] + a[6][6]); a[0][7] = min(a[0][7], a[0][6] + a[6][7]); a[0][8] = min(a[0][8], a[0][6] + a[6][8]); a[0][9] = min(a[0][9], a[0][6] + a[6][9]); a[1][0] = min(a[1][0], a[1][6] + a[6][0]); a[1][1] = min(a[1][1], a[1][6] + a[6][1]); a[1][2] = min(a[1][2], a[1][6] + a[6][2]); a[1][3] = min(a[1][3], a[1][6] + a[6][3]); a[1][4] = min(a[1][4], a[1][6] + a[6][4]); a[1][5] = min(a[1][5], a[1][6] + a[6][5]); a[1][6] = min(a[1][6], a[1][6] + a[6][6]); a[1][7] = min(a[1][7], a[1][6] + a[6][7]); a[1][8] = min(a[1][8], a[1][6] + a[6][8]); a[1][9] = min(a[1][9], a[1][6] + a[6][9]); a[2][0] = min(a[2][0], a[2][6] + a[6][0]); a[2][1] = min(a[2][1], a[2][6] + a[6][1]); a[2][2] = min(a[2][2], a[2][6] + a[6][2]); a[2][3] = min(a[2][3], a[2][6] + a[6][3]); a[2][4] = min(a[2][4], a[2][6] + a[6][4]); a[2][5] = min(a[2][5], a[2][6] + a[6][5]); a[2][6] = min(a[2][6], a[2][6] + a[6][6]); a[2][7] = min(a[2][7], a[2][6] + a[6][7]); a[2][8] = min(a[2][8], a[2][6] + a[6][8]); a[2][9] = min(a[2][9], a[2][6] + a[6][9]); a[3][0] = min(a[3][0], a[3][6] + a[6][0]); a[3][1] = min(a[3][1], a[3][6] + a[6][1]); a[3][2] = min(a[3][2], a[3][6] + a[6][2]); a[3][3] = min(a[3][3], a[3][6] + a[6][3]); a[3][4] = min(a[3][4], a[3][6] + a[6][4]); a[3][5] = min(a[3][5], a[3][6] + a[6][5]); a[3][6] = min(a[3][6], a[3][6] + a[6][6]); a[3][7] = min(a[3][7], a[3][6] + a[6][7]); a[3][8] = min(a[3][8], a[3][6] + a[6][8]); a[3][9] = min(a[3][9], a[3][6] + a[6][9]); a[4][0] = min(a[4][0], a[4][6] + a[6][0]); a[4][1] = min(a[4][1], a[4][6] + a[6][1]); a[4][2] = min(a[4][2], a[4][6] + a[6][2]); a[4][3] = min(a[4][3], a[4][6] + a[6][3]); a[4][4] = min(a[4][4], a[4][6] + a[6][4]); a[4][5] = min(a[4][5], a[4][6] + a[6][5]); a[4][6] = min(a[4][6], a[4][6] + a[6][6]); a[4][7] = min(a[4][7], a[4][6] + a[6][7]); a[4][8] = min(a[4][8], a[4][6] + a[6][8]); a[4][9] = min(a[4][9], a[4][6] + a[6][9]); a[5][0] = min(a[5][0], a[5][6] + a[6][0]); a[5][1] = min(a[5][1], a[5][6] + a[6][1]); a[5][2] = min(a[5][2], a[5][6] + a[6][2]); a[5][3] = min(a[5][3], a[5][6] + a[6][3]); a[5][4] = min(a[5][4], a[5][6] + a[6][4]); a[5][5] = min(a[5][5], a[5][6] + a[6][5]); a[5][6] = min(a[5][6], a[5][6] + a[6][6]); a[5][7] = min(a[5][7], a[5][6] + a[6][7]); a[5][8] = min(a[5][8], a[5][6] + a[6][8]); a[5][9] = min(a[5][9], a[5][6] + a[6][9]); a[6][0] = min(a[6][0], a[6][6] + a[6][0]); a[6][1] = min(a[6][1], a[6][6] + a[6][1]); a[6][2] = min(a[6][2], a[6][6] + a[6][2]); a[6][3] = min(a[6][3], a[6][6] + a[6][3]); a[6][4] = min(a[6][4], a[6][6] + a[6][4]); a[6][5] = min(a[6][5], a[6][6] + a[6][5]); a[6][6] = min(a[6][6], a[6][6] + a[6][6]); a[6][7] = min(a[6][7], a[6][6] + a[6][7]); a[6][8] = min(a[6][8], a[6][6] + a[6][8]); a[6][9] = min(a[6][9], a[6][6] + a[6][9]); a[7][0] = min(a[7][0], a[7][6] + a[6][0]); a[7][1] = min(a[7][1], a[7][6] + a[6][1]); a[7][2] = min(a[7][2], a[7][6] + a[6][2]); a[7][3] = min(a[7][3], a[7][6] + a[6][3]); a[7][4] = min(a[7][4], a[7][6] + a[6][4]); a[7][5] = min(a[7][5], a[7][6] + a[6][5]); a[7][6] = min(a[7][6], a[7][6] + a[6][6]); a[7][7] = min(a[7][7], a[7][6] + a[6][7]); a[7][8] = min(a[7][8], a[7][6] + a[6][8]); a[7][9] = min(a[7][9], a[7][6] + a[6][9]); a[8][0] = min(a[8][0], a[8][6] + a[6][0]); a[8][1] = min(a[8][1], a[8][6] + a[6][1]); a[8][2] = min(a[8][2], a[8][6] + a[6][2]); a[8][3] = min(a[8][3], a[8][6] + a[6][3]); a[8][4] = min(a[8][4], a[8][6] + a[6][4]); a[8][5] = min(a[8][5], a[8][6] + a[6][5]); a[8][6] = min(a[8][6], a[8][6] + a[6][6]); a[8][7] = min(a[8][7], a[8][6] + a[6][7]); a[8][8] = min(a[8][8], a[8][6] + a[6][8]); a[8][9] = min(a[8][9], a[8][6] + a[6][9]); a[9][0] = min(a[9][0], a[9][6] + a[6][0]); a[9][1] = min(a[9][1], a[9][6] + a[6][1]); a[9][2] = min(a[9][2], a[9][6] + a[6][2]); a[9][3] = min(a[9][3], a[9][6] + a[6][3]); a[9][4] = min(a[9][4], a[9][6] + a[6][4]); a[9][5] = min(a[9][5], a[9][6] + a[6][5]); a[9][6] = min(a[9][6], a[9][6] + a[6][6]); a[9][7] = min(a[9][7], a[9][6] + a[6][7]); a[9][8] = min(a[9][8], a[9][6] + a[6][8]); a[9][9] = min(a[9][9], a[9][6] + a[6][9]); a[0][0] = min(a[0][0], a[0][7] + a[7][0]); a[0][1] = min(a[0][1], a[0][7] + a[7][1]); a[0][2] = min(a[0][2], a[0][7] + a[7][2]); a[0][3] = min(a[0][3], a[0][7] + a[7][3]); a[0][4] = min(a[0][4], a[0][7] + a[7][4]); a[0][5] = min(a[0][5], a[0][7] + a[7][5]); a[0][6] = min(a[0][6], a[0][7] + a[7][6]); a[0][7] = min(a[0][7], a[0][7] + a[7][7]); a[0][8] = min(a[0][8], a[0][7] + a[7][8]); a[0][9] = min(a[0][9], a[0][7] + a[7][9]); a[1][0] = min(a[1][0], a[1][7] + a[7][0]); a[1][1] = min(a[1][1], a[1][7] + a[7][1]); a[1][2] = min(a[1][2], a[1][7] + a[7][2]); a[1][3] = min(a[1][3], a[1][7] + a[7][3]); a[1][4] = min(a[1][4], a[1][7] + a[7][4]); a[1][5] = min(a[1][5], a[1][7] + a[7][5]); a[1][6] = min(a[1][6], a[1][7] + a[7][6]); a[1][7] = min(a[1][7], a[1][7] + a[7][7]); a[1][8] = min(a[1][8], a[1][7] + a[7][8]); a[1][9] = min(a[1][9], a[1][7] + a[7][9]); a[2][0] = min(a[2][0], a[2][7] + a[7][0]); a[2][1] = min(a[2][1], a[2][7] + a[7][1]); a[2][2] = min(a[2][2], a[2][7] + a[7][2]); a[2][3] = min(a[2][3], a[2][7] + a[7][3]); a[2][4] = min(a[2][4], a[2][7] + a[7][4]); a[2][5] = min(a[2][5], a[2][7] + a[7][5]); a[2][6] = min(a[2][6], a[2][7] + a[7][6]); a[2][7] = min(a[2][7], a[2][7] + a[7][7]); a[2][8] = min(a[2][8], a[2][7] + a[7][8]); a[2][9] = min(a[2][9], a[2][7] + a[7][9]); a[3][0] = min(a[3][0], a[3][7] + a[7][0]); a[3][1] = min(a[3][1], a[3][7] + a[7][1]); a[3][2] = min(a[3][2], a[3][7] + a[7][2]); a[3][3] = min(a[3][3], a[3][7] + a[7][3]); a[3][4] = min(a[3][4], a[3][7] + a[7][4]); a[3][5] = min(a[3][5], a[3][7] + a[7][5]); a[3][6] = min(a[3][6], a[3][7] + a[7][6]); a[3][7] = min(a[3][7], a[3][7] + a[7][7]); a[3][8] = min(a[3][8], a[3][7] + a[7][8]); a[3][9] = min(a[3][9], a[3][7] + a[7][9]); a[4][0] = min(a[4][0], a[4][7] + a[7][0]); a[4][1] = min(a[4][1], a[4][7] + a[7][1]); a[4][2] = min(a[4][2], a[4][7] + a[7][2]); a[4][3] = min(a[4][3], a[4][7] + a[7][3]); a[4][4] = min(a[4][4], a[4][7] + a[7][4]); a[4][5] = min(a[4][5], a[4][7] + a[7][5]); a[4][6] = min(a[4][6], a[4][7] + a[7][6]); a[4][7] = min(a[4][7], a[4][7] + a[7][7]); a[4][8] = min(a[4][8], a[4][7] + a[7][8]); a[4][9] = min(a[4][9], a[4][7] + a[7][9]); a[5][0] = min(a[5][0], a[5][7] + a[7][0]); a[5][1] = min(a[5][1], a[5][7] + a[7][1]); a[5][2] = min(a[5][2], a[5][7] + a[7][2]); a[5][3] = min(a[5][3], a[5][7] + a[7][3]); a[5][4] = min(a[5][4], a[5][7] + a[7][4]); a[5][5] = min(a[5][5], a[5][7] + a[7][5]); a[5][6] = min(a[5][6], a[5][7] + a[7][6]); a[5][7] = min(a[5][7], a[5][7] + a[7][7]); a[5][8] = min(a[5][8], a[5][7] + a[7][8]); a[5][9] = min(a[5][9], a[5][7] + a[7][9]); a[6][0] = min(a[6][0], a[6][7] + a[7][0]); a[6][1] = min(a[6][1], a[6][7] + a[7][1]); a[6][2] = min(a[6][2], a[6][7] + a[7][2]); a[6][3] = min(a[6][3], a[6][7] + a[7][3]); a[6][4] = min(a[6][4], a[6][7] + a[7][4]); a[6][5] = min(a[6][5], a[6][7] + a[7][5]); a[6][6] = min(a[6][6], a[6][7] + a[7][6]); a[6][7] = min(a[6][7], a[6][7] + a[7][7]); a[6][8] = min(a[6][8], a[6][7] + a[7][8]); a[6][9] = min(a[6][9], a[6][7] + a[7][9]); a[7][0] = min(a[7][0], a[7][7] + a[7][0]); a[7][1] = min(a[7][1], a[7][7] + a[7][1]); a[7][2] = min(a[7][2], a[7][7] + a[7][2]); a[7][3] = min(a[7][3], a[7][7] + a[7][3]); a[7][4] = min(a[7][4], a[7][7] + a[7][4]); a[7][5] = min(a[7][5], a[7][7] + a[7][5]); a[7][6] = min(a[7][6], a[7][7] + a[7][6]); a[7][7] = min(a[7][7], a[7][7] + a[7][7]); a[7][8] = min(a[7][8], a[7][7] + a[7][8]); a[7][9] = min(a[7][9], a[7][7] + a[7][9]); a[8][0] = min(a[8][0], a[8][7] + a[7][0]); a[8][1] = min(a[8][1], a[8][7] + a[7][1]); a[8][2] = min(a[8][2], a[8][7] + a[7][2]); a[8][3] = min(a[8][3], a[8][7] + a[7][3]); a[8][4] = min(a[8][4], a[8][7] + a[7][4]); a[8][5] = min(a[8][5], a[8][7] + a[7][5]); a[8][6] = min(a[8][6], a[8][7] + a[7][6]); a[8][7] = min(a[8][7], a[8][7] + a[7][7]); a[8][8] = min(a[8][8], a[8][7] + a[7][8]); a[8][9] = min(a[8][9], a[8][7] + a[7][9]); a[9][0] = min(a[9][0], a[9][7] + a[7][0]); a[9][1] = min(a[9][1], a[9][7] + a[7][1]); a[9][2] = min(a[9][2], a[9][7] + a[7][2]); a[9][3] = min(a[9][3], a[9][7] + a[7][3]); a[9][4] = min(a[9][4], a[9][7] + a[7][4]); a[9][5] = min(a[9][5], a[9][7] + a[7][5]); a[9][6] = min(a[9][6], a[9][7] + a[7][6]); a[9][7] = min(a[9][7], a[9][7] + a[7][7]); a[9][8] = min(a[9][8], a[9][7] + a[7][8]); a[9][9] = min(a[9][9], a[9][7] + a[7][9]); a[0][0] = min(a[0][0], a[0][8] + a[8][0]); a[0][1] = min(a[0][1], a[0][8] + a[8][1]); a[0][2] = min(a[0][2], a[0][8] + a[8][2]); a[0][3] = min(a[0][3], a[0][8] + a[8][3]); a[0][4] = min(a[0][4], a[0][8] + a[8][4]); a[0][5] = min(a[0][5], a[0][8] + a[8][5]); a[0][6] = min(a[0][6], a[0][8] + a[8][6]); a[0][7] = min(a[0][7], a[0][8] + a[8][7]); a[0][8] = min(a[0][8], a[0][8] + a[8][8]); a[0][9] = min(a[0][9], a[0][8] + a[8][9]); a[1][0] = min(a[1][0], a[1][8] + a[8][0]); a[1][1] = min(a[1][1], a[1][8] + a[8][1]); a[1][2] = min(a[1][2], a[1][8] + a[8][2]); a[1][3] = min(a[1][3], a[1][8] + a[8][3]); a[1][4] = min(a[1][4], a[1][8] + a[8][4]); a[1][5] = min(a[1][5], a[1][8] + a[8][5]); a[1][6] = min(a[1][6], a[1][8] + a[8][6]); a[1][7] = min(a[1][7], a[1][8] + a[8][7]); a[1][8] = min(a[1][8], a[1][8] + a[8][8]); a[1][9] = min(a[1][9], a[1][8] + a[8][9]); a[2][0] = min(a[2][0], a[2][8] + a[8][0]); a[2][1] = min(a[2][1], a[2][8] + a[8][1]); a[2][2] = min(a[2][2], a[2][8] + a[8][2]); a[2][3] = min(a[2][3], a[2][8] + a[8][3]); a[2][4] = min(a[2][4], a[2][8] + a[8][4]); a[2][5] = min(a[2][5], a[2][8] + a[8][5]); a[2][6] = min(a[2][6], a[2][8] + a[8][6]); a[2][7] = min(a[2][7], a[2][8] + a[8][7]); a[2][8] = min(a[2][8], a[2][8] + a[8][8]); a[2][9] = min(a[2][9], a[2][8] + a[8][9]); a[3][0] = min(a[3][0], a[3][8] + a[8][0]); a[3][1] = min(a[3][1], a[3][8] + a[8][1]); a[3][2] = min(a[3][2], a[3][8] + a[8][2]); a[3][3] = min(a[3][3], a[3][8] + a[8][3]); a[3][4] = min(a[3][4], a[3][8] + a[8][4]); a[3][5] = min(a[3][5], a[3][8] + a[8][5]); a[3][6] = min(a[3][6], a[3][8] + a[8][6]); a[3][7] = min(a[3][7], a[3][8] + a[8][7]); a[3][8] = min(a[3][8], a[3][8] + a[8][8]); a[3][9] = min(a[3][9], a[3][8] + a[8][9]); a[4][0] = min(a[4][0], a[4][8] + a[8][0]); a[4][1] = min(a[4][1], a[4][8] + a[8][1]); a[4][2] = min(a[4][2], a[4][8] + a[8][2]); a[4][3] = min(a[4][3], a[4][8] + a[8][3]); a[4][4] = min(a[4][4], a[4][8] + a[8][4]); a[4][5] = min(a[4][5], a[4][8] + a[8][5]); a[4][6] = min(a[4][6], a[4][8] + a[8][6]); a[4][7] = min(a[4][7], a[4][8] + a[8][7]); a[4][8] = min(a[4][8], a[4][8] + a[8][8]); a[4][9] = min(a[4][9], a[4][8] + a[8][9]); a[5][0] = min(a[5][0], a[5][8] + a[8][0]); a[5][1] = min(a[5][1], a[5][8] + a[8][1]); a[5][2] = min(a[5][2], a[5][8] + a[8][2]); a[5][3] = min(a[5][3], a[5][8] + a[8][3]); a[5][4] = min(a[5][4], a[5][8] + a[8][4]); a[5][5] = min(a[5][5], a[5][8] + a[8][5]); a[5][6] = min(a[5][6], a[5][8] + a[8][6]); a[5][7] = min(a[5][7], a[5][8] + a[8][7]); a[5][8] = min(a[5][8], a[5][8] + a[8][8]); a[5][9] = min(a[5][9], a[5][8] + a[8][9]); a[6][0] = min(a[6][0], a[6][8] + a[8][0]); a[6][1] = min(a[6][1], a[6][8] + a[8][1]); a[6][2] = min(a[6][2], a[6][8] + a[8][2]); a[6][3] = min(a[6][3], a[6][8] + a[8][3]); a[6][4] = min(a[6][4], a[6][8] + a[8][4]); a[6][5] = min(a[6][5], a[6][8] + a[8][5]); a[6][6] = min(a[6][6], a[6][8] + a[8][6]); a[6][7] = min(a[6][7], a[6][8] + a[8][7]); a[6][8] = min(a[6][8], a[6][8] + a[8][8]); a[6][9] = min(a[6][9], a[6][8] + a[8][9]); a[7][0] = min(a[7][0], a[7][8] + a[8][0]); a[7][1] = min(a[7][1], a[7][8] + a[8][1]); a[7][2] = min(a[7][2], a[7][8] + a[8][2]); a[7][3] = min(a[7][3], a[7][8] + a[8][3]); a[7][4] = min(a[7][4], a[7][8] + a[8][4]); a[7][5] = min(a[7][5], a[7][8] + a[8][5]); a[7][6] = min(a[7][6], a[7][8] + a[8][6]); a[7][7] = min(a[7][7], a[7][8] + a[8][7]); a[7][8] = min(a[7][8], a[7][8] + a[8][8]); a[7][9] = min(a[7][9], a[7][8] + a[8][9]); a[8][0] = min(a[8][0], a[8][8] + a[8][0]); a[8][1] = min(a[8][1], a[8][8] + a[8][1]); a[8][2] = min(a[8][2], a[8][8] + a[8][2]); a[8][3] = min(a[8][3], a[8][8] + a[8][3]); a[8][4] = min(a[8][4], a[8][8] + a[8][4]); a[8][5] = min(a[8][5], a[8][8] + a[8][5]); a[8][6] = min(a[8][6], a[8][8] + a[8][6]); a[8][7] = min(a[8][7], a[8][8] + a[8][7]); a[8][8] = min(a[8][8], a[8][8] + a[8][8]); a[8][9] = min(a[8][9], a[8][8] + a[8][9]); a[9][0] = min(a[9][0], a[9][8] + a[8][0]); a[9][1] = min(a[9][1], a[9][8] + a[8][1]); a[9][2] = min(a[9][2], a[9][8] + a[8][2]); a[9][3] = min(a[9][3], a[9][8] + a[8][3]); a[9][4] = min(a[9][4], a[9][8] + a[8][4]); a[9][5] = min(a[9][5], a[9][8] + a[8][5]); a[9][6] = min(a[9][6], a[9][8] + a[8][6]); a[9][7] = min(a[9][7], a[9][8] + a[8][7]); a[9][8] = min(a[9][8], a[9][8] + a[8][8]); a[9][9] = min(a[9][9], a[9][8] + a[8][9]); a[0][0] = min(a[0][0], a[0][9] + a[9][0]); a[0][1] = min(a[0][1], a[0][9] + a[9][1]); a[0][2] = min(a[0][2], a[0][9] + a[9][2]); a[0][3] = min(a[0][3], a[0][9] + a[9][3]); a[0][4] = min(a[0][4], a[0][9] + a[9][4]); a[0][5] = min(a[0][5], a[0][9] + a[9][5]); a[0][6] = min(a[0][6], a[0][9] + a[9][6]); a[0][7] = min(a[0][7], a[0][9] + a[9][7]); a[0][8] = min(a[0][8], a[0][9] + a[9][8]); a[0][9] = min(a[0][9], a[0][9] + a[9][9]); a[1][0] = min(a[1][0], a[1][9] + a[9][0]); a[1][1] = min(a[1][1], a[1][9] + a[9][1]); a[1][2] = min(a[1][2], a[1][9] + a[9][2]); a[1][3] = min(a[1][3], a[1][9] + a[9][3]); a[1][4] = min(a[1][4], a[1][9] + a[9][4]); a[1][5] = min(a[1][5], a[1][9] + a[9][5]); a[1][6] = min(a[1][6], a[1][9] + a[9][6]); a[1][7] = min(a[1][7], a[1][9] + a[9][7]); a[1][8] = min(a[1][8], a[1][9] + a[9][8]); a[1][9] = min(a[1][9], a[1][9] + a[9][9]); a[2][0] = min(a[2][0], a[2][9] + a[9][0]); a[2][1] = min(a[2][1], a[2][9] + a[9][1]); a[2][2] = min(a[2][2], a[2][9] + a[9][2]); a[2][3] = min(a[2][3], a[2][9] + a[9][3]); a[2][4] = min(a[2][4], a[2][9] + a[9][4]); a[2][5] = min(a[2][5], a[2][9] + a[9][5]); a[2][6] = min(a[2][6], a[2][9] + a[9][6]); a[2][7] = min(a[2][7], a[2][9] + a[9][7]); a[2][8] = min(a[2][8], a[2][9] + a[9][8]); a[2][9] = min(a[2][9], a[2][9] + a[9][9]); a[3][0] = min(a[3][0], a[3][9] + a[9][0]); a[3][1] = min(a[3][1], a[3][9] + a[9][1]); a[3][2] = min(a[3][2], a[3][9] + a[9][2]); a[3][3] = min(a[3][3], a[3][9] + a[9][3]); a[3][4] = min(a[3][4], a[3][9] + a[9][4]); a[3][5] = min(a[3][5], a[3][9] + a[9][5]); a[3][6] = min(a[3][6], a[3][9] + a[9][6]); a[3][7] = min(a[3][7], a[3][9] + a[9][7]); a[3][8] = min(a[3][8], a[3][9] + a[9][8]); a[3][9] = min(a[3][9], a[3][9] + a[9][9]); a[4][0] = min(a[4][0], a[4][9] + a[9][0]); a[4][1] = min(a[4][1], a[4][9] + a[9][1]); a[4][2] = min(a[4][2], a[4][9] + a[9][2]); a[4][3] = min(a[4][3], a[4][9] + a[9][3]); a[4][4] = min(a[4][4], a[4][9] + a[9][4]); a[4][5] = min(a[4][5], a[4][9] + a[9][5]); a[4][6] = min(a[4][6], a[4][9] + a[9][6]); a[4][7] = min(a[4][7], a[4][9] + a[9][7]); a[4][8] = min(a[4][8], a[4][9] + a[9][8]); a[4][9] = min(a[4][9], a[4][9] + a[9][9]); a[5][0] = min(a[5][0], a[5][9] + a[9][0]); a[5][1] = min(a[5][1], a[5][9] + a[9][1]); a[5][2] = min(a[5][2], a[5][9] + a[9][2]); a[5][3] = min(a[5][3], a[5][9] + a[9][3]); a[5][4] = min(a[5][4], a[5][9] + a[9][4]); a[5][5] = min(a[5][5], a[5][9] + a[9][5]); a[5][6] = min(a[5][6], a[5][9] + a[9][6]); a[5][7] = min(a[5][7], a[5][9] + a[9][7]); a[5][8] = min(a[5][8], a[5][9] + a[9][8]); a[5][9] = min(a[5][9], a[5][9] + a[9][9]); a[6][0] = min(a[6][0], a[6][9] + a[9][0]); a[6][1] = min(a[6][1], a[6][9] + a[9][1]); a[6][2] = min(a[6][2], a[6][9] + a[9][2]); a[6][3] = min(a[6][3], a[6][9] + a[9][3]); a[6][4] = min(a[6][4], a[6][9] + a[9][4]); a[6][5] = min(a[6][5], a[6][9] + a[9][5]); a[6][6] = min(a[6][6], a[6][9] + a[9][6]); a[6][7] = min(a[6][7], a[6][9] + a[9][7]); a[6][8] = min(a[6][8], a[6][9] + a[9][8]); a[6][9] = min(a[6][9], a[6][9] + a[9][9]); a[7][0] = min(a[7][0], a[7][9] + a[9][0]); a[7][1] = min(a[7][1], a[7][9] + a[9][1]); a[7][2] = min(a[7][2], a[7][9] + a[9][2]); a[7][3] = min(a[7][3], a[7][9] + a[9][3]); a[7][4] = min(a[7][4], a[7][9] + a[9][4]); a[7][5] = min(a[7][5], a[7][9] + a[9][5]); a[7][6] = min(a[7][6], a[7][9] + a[9][6]); a[7][7] = min(a[7][7], a[7][9] + a[9][7]); a[7][8] = min(a[7][8], a[7][9] + a[9][8]); a[7][9] = min(a[7][9], a[7][9] + a[9][9]); a[8][0] = min(a[8][0], a[8][9] + a[9][0]); a[8][1] = min(a[8][1], a[8][9] + a[9][1]); a[8][2] = min(a[8][2], a[8][9] + a[9][2]); a[8][3] = min(a[8][3], a[8][9] + a[9][3]); a[8][4] = min(a[8][4], a[8][9] + a[9][4]); a[8][5] = min(a[8][5], a[8][9] + a[9][5]); a[8][6] = min(a[8][6], a[8][9] + a[9][6]); a[8][7] = min(a[8][7], a[8][9] + a[9][7]); a[8][8] = min(a[8][8], a[8][9] + a[9][8]); a[8][9] = min(a[8][9], a[8][9] + a[9][9]); a[9][0] = min(a[9][0], a[9][9] + a[9][0]); a[9][1] = min(a[9][1], a[9][9] + a[9][1]); a[9][2] = min(a[9][2], a[9][9] + a[9][2]); a[9][3] = min(a[9][3], a[9][9] + a[9][3]); a[9][4] = min(a[9][4], a[9][9] + a[9][4]); a[9][5] = min(a[9][5], a[9][9] + a[9][5]); a[9][6] = min(a[9][6], a[9][9] + a[9][6]); a[9][7] = min(a[9][7], a[9][9] + a[9][7]); a[9][8] = min(a[9][8], a[9][9] + a[9][8]); a[9][9] = min(a[9][9], a[9][9] + a[9][9]); int ans = 0; ans = (0 < n && 0 < n ? max(ans, a[0][0]) : ans); ans = (0 < n && 1 < n ? max(ans, a[0][1]) : ans); ans = (0 < n && 2 < n ? max(ans, a[0][2]) : ans); ans = (0 < n && 3 < n ? max(ans, a[0][3]) : ans); ans = (0 < n && 4 < n ? max(ans, a[0][4]) : ans); ans = (0 < n && 5 < n ? max(ans, a[0][5]) : ans); ans = (0 < n && 6 < n ? max(ans, a[0][6]) : ans); ans = (0 < n && 7 < n ? max(ans, a[0][7]) : ans); ans = (0 < n && 8 < n ? max(ans, a[0][8]) : ans); ans = (0 < n && 9 < n ? max(ans, a[0][9]) : ans); ans = (1 < n && 0 < n ? max(ans, a[1][0]) : ans); ans = (1 < n && 1 < n ? max(ans, a[1][1]) : ans); ans = (1 < n && 2 < n ? max(ans, a[1][2]) : ans); ans = (1 < n && 3 < n ? max(ans, a[1][3]) : ans); ans = (1 < n && 4 < n ? max(ans, a[1][4]) : ans); ans = (1 < n && 5 < n ? max(ans, a[1][5]) : ans); ans = (1 < n && 6 < n ? max(ans, a[1][6]) : ans); ans = (1 < n && 7 < n ? max(ans, a[1][7]) : ans); ans = (1 < n && 8 < n ? max(ans, a[1][8]) : ans); ans = (1 < n && 9 < n ? max(ans, a[1][9]) : ans); ans = (2 < n && 0 < n ? max(ans, a[2][0]) : ans); ans = (2 < n && 1 < n ? max(ans, a[2][1]) : ans); ans = (2 < n && 2 < n ? max(ans, a[2][2]) : ans); ans = (2 < n && 3 < n ? max(ans, a[2][3]) : ans); ans = (2 < n && 4 < n ? max(ans, a[2][4]) : ans); ans = (2 < n && 5 < n ? max(ans, a[2][5]) : ans); ans = (2 < n && 6 < n ? max(ans, a[2][6]) : ans); ans = (2 < n && 7 < n ? max(ans, a[2][7]) : ans); ans = (2 < n && 8 < n ? max(ans, a[2][8]) : ans); ans = (2 < n && 9 < n ? max(ans, a[2][9]) : ans); ans = (3 < n && 0 < n ? max(ans, a[3][0]) : ans); ans = (3 < n && 1 < n ? max(ans, a[3][1]) : ans); ans = (3 < n && 2 < n ? max(ans, a[3][2]) : ans); ans = (3 < n && 3 < n ? max(ans, a[3][3]) : ans); ans = (3 < n && 4 < n ? max(ans, a[3][4]) : ans); ans = (3 < n && 5 < n ? max(ans, a[3][5]) : ans); ans = (3 < n && 6 < n ? max(ans, a[3][6]) : ans); ans = (3 < n && 7 < n ? max(ans, a[3][7]) : ans); ans = (3 < n && 8 < n ? max(ans, a[3][8]) : ans); ans = (3 < n && 9 < n ? max(ans, a[3][9]) : ans); ans = (4 < n && 0 < n ? max(ans, a[4][0]) : ans); ans = (4 < n && 1 < n ? max(ans, a[4][1]) : ans); ans = (4 < n && 2 < n ? max(ans, a[4][2]) : ans); ans = (4 < n && 3 < n ? max(ans, a[4][3]) : ans); ans = (4 < n && 4 < n ? max(ans, a[4][4]) : ans); ans = (4 < n && 5 < n ? max(ans, a[4][5]) : ans); ans = (4 < n && 6 < n ? max(ans, a[4][6]) : ans); ans = (4 < n && 7 < n ? max(ans, a[4][7]) : ans); ans = (4 < n && 8 < n ? max(ans, a[4][8]) : ans); ans = (4 < n && 9 < n ? max(ans, a[4][9]) : ans); ans = (5 < n && 0 < n ? max(ans, a[5][0]) : ans); ans = (5 < n && 1 < n ? max(ans, a[5][1]) : ans); ans = (5 < n && 2 < n ? max(ans, a[5][2]) : ans); ans = (5 < n && 3 < n ? max(ans, a[5][3]) : ans); ans = (5 < n && 4 < n ? max(ans, a[5][4]) : ans); ans = (5 < n && 5 < n ? max(ans, a[5][5]) : ans); ans = (5 < n && 6 < n ? max(ans, a[5][6]) : ans); ans = (5 < n && 7 < n ? max(ans, a[5][7]) : ans); ans = (5 < n && 8 < n ? max(ans, a[5][8]) : ans); ans = (5 < n && 9 < n ? max(ans, a[5][9]) : ans); ans = (6 < n && 0 < n ? max(ans, a[6][0]) : ans); ans = (6 < n && 1 < n ? max(ans, a[6][1]) : ans); ans = (6 < n && 2 < n ? max(ans, a[6][2]) : ans); ans = (6 < n && 3 < n ? max(ans, a[6][3]) : ans); ans = (6 < n && 4 < n ? max(ans, a[6][4]) : ans); ans = (6 < n && 5 < n ? max(ans, a[6][5]) : ans); ans = (6 < n && 6 < n ? max(ans, a[6][6]) : ans); ans = (6 < n && 7 < n ? max(ans, a[6][7]) : ans); ans = (6 < n && 8 < n ? max(ans, a[6][8]) : ans); ans = (6 < n && 9 < n ? max(ans, a[6][9]) : ans); ans = (7 < n && 0 < n ? max(ans, a[7][0]) : ans); ans = (7 < n && 1 < n ? max(ans, a[7][1]) : ans); ans = (7 < n && 2 < n ? max(ans, a[7][2]) : ans); ans = (7 < n && 3 < n ? max(ans, a[7][3]) : ans); ans = (7 < n && 4 < n ? max(ans, a[7][4]) : ans); ans = (7 < n && 5 < n ? max(ans, a[7][5]) : ans); ans = (7 < n && 6 < n ? max(ans, a[7][6]) : ans); ans = (7 < n && 7 < n ? max(ans, a[7][7]) : ans); ans = (7 < n && 8 < n ? max(ans, a[7][8]) : ans); ans = (7 < n && 9 < n ? max(ans, a[7][9]) : ans); ans = (8 < n && 0 < n ? max(ans, a[8][0]) : ans); ans = (8 < n && 1 < n ? max(ans, a[8][1]) : ans); ans = (8 < n && 2 < n ? max(ans, a[8][2]) : ans); ans = (8 < n && 3 < n ? max(ans, a[8][3]) : ans); ans = (8 < n && 4 < n ? max(ans, a[8][4]) : ans); ans = (8 < n && 5 < n ? max(ans, a[8][5]) : ans); ans = (8 < n && 6 < n ? max(ans, a[8][6]) : ans); ans = (8 < n && 7 < n ? max(ans, a[8][7]) : ans); ans = (8 < n && 8 < n ? max(ans, a[8][8]) : ans); ans = (8 < n && 9 < n ? max(ans, a[8][9]) : ans); ans = (9 < n && 0 < n ? max(ans, a[9][0]) : ans); ans = (9 < n && 1 < n ? max(ans, a[9][1]) : ans); ans = (9 < n && 2 < n ? max(ans, a[9][2]) : ans); ans = (9 < n && 3 < n ? max(ans, a[9][3]) : ans); ans = (9 < n && 4 < n ? max(ans, a[9][4]) : ans); ans = (9 < n && 5 < n ? max(ans, a[9][5]) : ans); ans = (9 < n && 6 < n ? max(ans, a[9][6]) : ans); ans = (9 < n && 7 < n ? max(ans, a[9][7]) : ans); ans = (9 < n && 8 < n ? max(ans, a[9][8]) : ans); ans = (9 < n && 9 < n ? max(ans, a[9][9]) : ans); cout << ans; }
#include <bits/stdc++.h> using namespace std; int a[100005], ans[100005], ti[100005], app[100005], t, n; int cnt(int k) { int ret = 1, count = 0; ++t; for (int i = 1; i <= n; i++) { if (ti[a[i]] != t) { ti[a[i]] = t; app[a[i]] = false; } if (!app[a[i]]) { if (count == k) { count = 0; ret++; ti[a[i]] = ++t; } count++; } app[a[i]] = true; } return ret; } void solve(int l, int r, int lo, int hi) { if (l > r) return; int mid = (l + r) / 2; int res = lo == hi ? lo : cnt(mid); ans[mid] = res; solve(l, mid - 1, res, hi); solve(mid + 1, r, lo, res); } int main() { cin >> n; for (int i = 1; i <= n; i++) scanf( %d , &a[i]); solve(1, n, 1, n); for (int i = 1; i <= n; i++) { if (i > 1) printf( ); printf( %d , ans[i]); } cout << endl; }
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; inline void read(long long &x) { x = 0; long long f = 1; char s = getchar(); while (s < 0 || s > 9 ) { if (s == - ) f = -1; s = getchar(); } while (s >= 0 && s <= 9 ) { x = (x << 3) + (x << 1) + (s ^ 48); s = getchar(); } x *= f; } inline long long Max(long long x, long long y) { return x > y ? x : y; } inline long long Min(long long x, long long y) { return x < y ? x : y; } long long Gcd(long long a, long long b) { if (!b) return a; return Gcd(b, a % b); } inline long long Abs(long long x) { if (x < 0) return -x; return x; } inline double Fabs(double x) { if (x > 0) return x; return -x; } long long a[100005]; int main() { long long n; read(n); long long XiangMeiHaoGuai = 1; if (XiangMeiHaoGuai + 1 == 3) printf( SXYYouYiGeQiaoPiGu ); for (register int i = 1; i <= n; ++i) read(a[i]); if (XiangMeiHaoGuai + 1 == 3) printf( SXYYouYiGeQiaoPiGu ); sort(a + 1, a + 1 + n); if (XiangMeiHaoGuai + 1 == 3) printf( SXYYouYiGeQiaoPiGu ); long long FuckingAns = a[2] - a[1]; if (XiangMeiHaoGuai + 1 == 3) printf( SXYYouYiGeQiaoPiGu ); for (register int i = 3; i <= n; ++i) FuckingAns = Gcd(FuckingAns, a[i] - a[i - 1]); if (XiangMeiHaoGuai + 1 == 3) printf( SXYYouYiGeQiaoPiGu ); long long FuckingDis = a[n] - a[1], Sucky = 1 - n; printf( %lld , FuckingDis / FuckingAns + Sucky); if (XiangMeiHaoGuai + 1 == 3) printf( SXYYouYiGeQiaoPiGu ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); string s[4]; for (int i = 0; i < 4; i++) cin >> s[i]; int x = 0; for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { x = s[i][j] == # ; x += s[i + 1][j] == # ; x += s[i][j + 1] == # ; x += s[i + 1][j + 1] == # ; if (x != 2) return cout << YES , 0; } } cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, S; cin >> n >> S; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; long long z = LLONG_MAX; sort(a.begin(), a.end()); long long fh = 0, sh = 0; for (int i = 0; i < n / 2; i++) { if (a[i] > S) fh += a[i] - S; if (a[n - 1 - i] < S) sh += S - a[n - 1 - i]; } cout << fh + sh + abs(a[n / 2] - S); return 0; }
/* problem : CF1466I The Riddle of the Sphinx reference : https://www.luogu.com.cn/blog/CXY07/solution-cf1466i */ #include <bits/stdc++.h> #define mp std::make_pair #define pb push_back #define fi first #define se second #define gc getchar #define pc putchar #define ep emplace #define eb emplace_back #define ctz __builtin_ctz typedef unsigned char u8; typedef unsigned short u16; typedef unsigned int u32; typedef long long ll; typedef long double ld; typedef unsigned long long ull; typedef std::pair <int, int> pii; typedef std::pair <int, ll> pil; typedef std::pair <ll, int> pli; typedef std::pair <ll, ll> pll; const int max_N = 207; int n, b; std::string ans; int read() { char c = gc(); int ans = 0; bool flag = true; while (!isdigit(c)) flag &= (c != - ), c = gc(); while (isdigit(c)) ans = ans * 10 + c - 0 , c = gc(); return flag ? ans : -ans; } void Write(int x) { if (x < 0) pc( - ), x = -x; if (x < 10) pc(x + 0 ); else Write(x / 10), pc(x % 10 + 0 ); } int min(int x, int y) {return x < y ? x : y;} int max(int x, int y) {return x > y ? x : y;} void _min(int &x, int y) {if (x > y) x = y;} void _max(int &x, int y) {if (x < y) x = y;} namespace Interactive { bool compare(int x, std::string y) { std::cout << x << << y << std::endl; return std::cin >> y, y == yes ; } bool compare_less(int x, std::string y) { if (!std::count(y.begin(), y.end(), 1 )) return false; for (int pos = y.size() - 1; y[pos] == 0 ? (y[pos] = 1 , true) : (y[pos] = 0 , false); pos--); return y.insert(y.end(), b - y.size(), 1 ), !compare(x, y); } bool compare_greater(int x, std::string y) { if (!std::count(y.begin(), y.end(), 0 )) return false; return y.insert(y.end(), b - y.size(), 1 ), compare(x, y); } void report(std::string x) { std::cout << 0 << << x << std::endl; } } void solve(std::vector <int> vec, int w) { std::vector <int> stack; for (auto i : vec) { while (!stack.empty() && Interactive::compare_greater(i, (std::string) {ans.begin(), ans.begin() + w + stack.size()})) stack.pop_back(); if (w + stack.size() < b) ans[w + stack.size()] = !Interactive::compare_less(i, (std::string) {ans.begin(), ans.begin() + w + stack.size()} + 1 ) + 0 , stack.pb(i); } for (int i = stack.size() - 1; i >= 0; i--) if (Interactive::compare_greater(stack[i], (std::string) {ans.begin(), ans.begin() + w + stack.size()})) stack.resize(i + 1); if (w + stack.size() < b) solve(stack, w + stack.size()); } int main() { std::cin >> n >> b; std::vector <int> vec; vec.resize(n); std::iota(vec.begin(), vec.end(), 1); ans.resize(b); solve(vec, 0); return Interactive::report(ans), 0; }
#include <bits/stdc++.h> using namespace std; const long long maxn = 3e5 + 30; long long N, M, T, X[maxn], ans[maxn], shift; char W[maxn]; vector<pair<long long, long long> > v; vector<long long> last; int main() { cin >> N >> M >> T; for (long long i = 1; i <= N; i++) { scanf( %lld %c , &X[i], &W[i]); v.push_back(pair<long long, long long>(X[i], i)); W[i] = W[i] == L ? -1 : 1; } for (long long i = 1; i <= N; i++) { long long a = (X[i] + T * W[i]), plus = 0; if (W[i] == -1) { a = a <= 0 ? (-a) / M + 1 : 0; } else plus = -(!(a % M)), a /= M; shift += W[i] * a + plus; } T %= M; for (long long i = 1; i <= N; i++) { long long a = X[i] + T * W[i] + M; a = (a - 1) % M + 1; last.push_back(a); } sort(v.begin(), v.end()); sort(last.begin(), last.end()); if (shift) shift = shift / abs(shift) * (abs(shift) % N); long long beg = ((-shift + N + 1) - 1) % N + 1; long long j = 0; for (long long i = beg - 1; i < N; i++) ans[v[i].second] = last[j++]; for (long long i = 0; i < beg - 1; i++) ans[v[i].second] = last[j++]; for (long long i = 1; i <= N; i++) printf( %lld , ans[i]); return 0; }
#include <bits/stdc++.h> using namespace std; vector<pair<double, pair<int, int> > > s; int n, x; pair<double, pair<int, int> > tmp; signed main() { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; for (register int i = 1; (1 < n) ? (i <= n) : (i >= n); i += (1 < n) ? 1 : (-1)) { cin >> x; s.push_back(make_pair(x, make_pair(i, i))); while (s.size() > 1 && s[s.size() - 2] > s.back()) { tmp = s.back(); s.pop_back(); tmp = make_pair((tmp.first * (tmp.second.second - tmp.second.first + 1) + s.back().first * (s.back().second.second - s.back().second.first + 1)) / (tmp.second.second - s.back().second.first + 1), make_pair(s.back().second.first, tmp.second.second)); s.pop_back(); s.push_back(tmp); } } for (auto i : s) { for (register int j = 1; (1 < i.second.second - i.second.first + 1) ? (j <= i.second.second - i.second.first + 1) : (j >= i.second.second - i.second.first + 1); j += (1 < i.second.second - i.second.first + 1) ? 1 : (-1)) { printf( %.9lf n , i.first); } } return 0; }
#include <bits/stdc++.h> using namespace std; long long X[(int)1e5 + 9]; long long C[(int)1e5 + 9]; int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); long long n, k, a, c, cost; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> X[i]; } cin >> a; for (int i = 1; i <= n; i++) { cin >> C[i]; } c = k; priority_queue<long long, vector<long long>, greater<long long> > Q; cost = 0; bool ans_ase = true; for (int i = 1; i <= n; i++) { Q.push(C[i]); if (c < X[i]) { if (Q.size() * a + c >= X[i]) { while (c < X[i]) { c += a; cost += Q.top(); Q.pop(); } } else { ans_ase = 0; break; } } } if (ans_ase) cout << cost << n ; else cout << -1 << n ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long ans = 0; long long a = 1, b = 2, c; while (b <= n) { ans++; c = a + b; a = b; b = c; } cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000009; vector<long long> vec; long long powmod(long long a, long long m) { long long ret = 1 % MOD; for (; m; m >>= 1) { if (m & 1) { ret *= a; if (ret >= MOD) ret %= MOD; } a *= a; if (a >= MOD) a %= MOD; } return ret; } int main() { long long n, m, k; vec.clear(); cin >> n >> m >> k; m = n - m; if (m >= n) { cout << 0 << endl; return 0; } long long p = (long long)(n / k); if (m >= p) { cout << n - m << endl; return 0; } long long pos = n - m * k; long long div = pos / k; long long mod = pos % k; long long mul = (powmod(2, div) - 1) * k % MOD * 2 % MOD; mul = (mul + MOD) % MOD; mul = (mul + mod) % MOD; long long ans = (mul + n - pos - m) % MOD; ans = (ans + MOD) % MOD; cout << ans << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int d[100008] = {0}; int n = 0, f = 0; cin >> n; for (f = 0; f < n; f++) cin >> d[f]; sort(d, d + n); if (d[n - 1] >= d[n - 2] + d[n - 3]) cout << NO ; else { cout << YES n ; for (f = n - 1; f >= 0; f -= 2) cout << d[f] << ; f = n % 2; for (; f < n; f += 2) { cout << d[f]; if (f != n - 2) cout << ; } } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 7; const int inf = INT_MAX; const long long inff = 1e18; const long long mod = 1e9 + 7; int p[30]; int n; string s; int used[40]; int Find(int x) { return p[x] == x ? x : p[x] = Find(p[x]); } void Union(int x, int y) { p[Find(x)] = Find(y); } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); for (int i = 1; i <= 26; i++) p[i] = i; cin >> n; for (int i = 0; i < n; i++) { cin >> s; int N = s.length(); for (int i = 0; i < N; i++) { used[s[i] - a + 1]++; } for (int i = 0; i < N - 1; i++) { Union(s[i] - a + 1, s[i + 1] - a + 1); } } set<int> second; for (int i = 1; i <= 26; i++) { if (used[i]) { second.insert(Find(i)); } } cout << ((int)(second).size()) << n ; }
#include <bits/stdc++.h> using namespace std; const int N = 100005; int dr8[] = {0, 0, 1, -1, 1, 1, -1, -1}; int dc8[] = {1, -1, 0, 0, -1, 1, -1, 1}; int dr4[] = {0, 1, -1, 0}; int dc4[] = {1, 0, 0, -1}; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; int on = 1023; cin >> n; int z = 0; string s; for (int i = 0; i < n; i++) { cin >> s; int w; cin >> w; if (s[0] == | ) { z = z | w; on = on | w; } else if (s[0] == ^ ) { z = z ^ w; on = on ^ w; } else { z = z & w; on = on & w; } } int a[10]; int x1 = 0, x2 = 1023, x3 = 0; for (int i = 0; i < 10; i++) { if (z % 2 == on % 2 && on % 2 == 1) { a[i] = 1; x1 = x1 ^ (1 << i); } else if (z % 2 == on % 2 && on % 2 == 0) { a[i] = 0; x2 = x2 ^ (1 << i); } else if (z % 2 == 1 && on % 2 == 0) x3 = x3 ^ (1 << i); z = z / 2; on = on / 2; } cout << 3 << endl; cout << | << x1 << endl; cout << & << x2 << endl; cout << ^ << x3 << endl; }
#include <bits/stdc++.h> using namespace std; vector<vector<int> > ad(123456); vector<int> vis(123456, 0), par(123456, -1), hc(123456, 0), hp(123456, 0), v(123456, 0); void dfs(int s) { int i, a, x = ad[s].size(), y = 0; for (i = 0; i < x; i++) { a = ad[s][i]; if (vis[a] == 0) par[a] = s, vis[a] = 1, dfs(a); } for (i = 0; i < x; i++) { a = ad[s][i]; if (par[a] == s) { if (v[a] == 1 || hc[a] > 0) y = max(y, 1 + hc[a]); } } hc[s] = y; return; } void fun(int s) { int x = ad[s].size(), y = -1, i, a, as, k, ind; for (i = 0; i < x; i++) { a = ad[s][i]; if (vis[a] == 0) { if (hc[a] > y && (hc[a] > 0 || v[a] == 1)) y = hc[a], k = 1, ind = a; else if ((hc[a] == y && y > 0) || (y == 0 && v[a] == 1)) k++; } } if (y == -1) { if (hp[s] > 0 || v[s] == 1) as = hp[s] + 1; else if (hp[s] == 0) as = 0; } else if (y >= 0) as = max(1 + hp[s], y + 2); if (as > 0) { for (i = 0; i < x; i++) { a = ad[s][i]; if (vis[a] == 0) hp[a] = as; } } if (y >= 0 && k == 1) { y = -1; for (i = 0; i < x; i++) { a = ad[s][i]; if (vis[a] == 0 && a != ind && (hc[a] > 0 || v[a] == 1)) y = max(hc[a], y); } if (y == -1) { if (hp[s] > 0 || v[s] == 1) hp[ind] = hp[s] + 1; else if (hp[s] == 0) hp[ind] = 0; } else if (y >= 0) hp[ind] = max(y + 2, hp[s] + 1); } for (i = 0; i < x; i++) { a = ad[s][i]; if (vis[a] == 0) vis[a] = 1, fun(a); } return; } int trv(int s) { int x = ad[s].size(), i, y = 0, z, a; for (i = 0; i < x; i++) { a = ad[s][i]; if (vis[a] == 0) { vis[a] = 1, z = trv(a); if (z > 0 || v[a] == 1) y += (2 + z); } } return y; } int main() { int x, y, n, m, i; scanf( %d , &n), scanf( %d , &m); for (i = 1; i < n; i++) { scanf( %d , &x), scanf( %d , &y); x--, y--, ad[x].push_back(y), ad[y].push_back(x); } for (i = 0; i < m; i++) scanf( %d , &x), x--, v[x] = 1; vis[0] = 1; dfs(0); for (i = 1; i < n; i++) vis[i] = 0; fun(0); x = -1, y = -1; for (i = 0; i < n; i++) { m = max(hc[i], hp[i]); if (m > y && v[i]) y = m, x = i; } for (i = 0; i < n; i++) vis[i] = 0; vis[x] = 1; m = trv(x); printf( %d n%d n , x + 1, m - y); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 100, M = 52 + 10, LG = 30, base = 2; const int MOD = 1e9 + 7, mod = 1e9 + 9; const long long INF = 1e9, inf = 1e18; long long p, q, m, k; string w, s, t; vector<long long> a, b; vector<long long> ans; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); ; cin >> w >> s >> t; while (p = w.find(s, p) + 1) a.push_back(p); while (q = w.find(t, q) + 1) b.push_back(q); for (int i = 0; i < a.size(); i++) { m = 0, k = 0; for (int j = a[i]; j <= w.size(); j++) { while (k < b.size() && b[k] < j) k++; if (k < b.size() && b[k] == j && j + t.size() >= a[i] + s.size()) ans.push_back(m); m = m * mod + (w[j - 1] - a + 1); } } sort(ans.begin(), ans.end()); cout << unique(ans.begin(), ans.end()) - ans.begin(); return 0; }
#include <bits/stdc++.h> using namespace std; long long cal(long long a, long long b) { long long sign = 1; if (a < 0) { a = -a; sign = -sign; } if (b < 0) { b = -b; sign = -sign; } unsigned long long n = (unsigned long long)a * b; long long r = n % 4000000000LL; return sign < 0 ? -r : r; } long long a[200001], BIT[200001], lazy[5 * 200001]; void update(long long i, long long n, long long val) { while (i <= n) { BIT[i] += val; i += i & -i; } } long get(long long i) { long long ret = 0; while (i) { ret += BIT[i]; i -= i & -i; } return ret; } struct Num { long long a, b, c; Num() {} Num(long long x, long long y, long long z) { a = x; b = y; c = z; } Num operator+(const Num &n) { Num ret = *this; Num t = n; long long dif = ret.c - t.c; if (dif > 0) { long long k = 1LL << dif; t.a *= k; t.b *= k; } else if (dif < 0) { dif = -dif; long long k = 1LL << dif; ret.a *= k; ret.b *= k; ret.c = t.c; } ret.a += t.a; ret.b += t.b; if (ret.c && !(ret.a & 1) && !(ret.b & 1)) { ret.c--; ret.a >>= 1; ret.b >>= 1; } ret.a %= 4000000000LL; ret.b %= 4000000000LL; return ret; } Num operator-(const Num &n) { return *this + Num(-n.a, -n.b, n.c); } Num operator*(const Num &n) { long long x = (cal(a, n.a) + 5 * cal(b, n.b)) % 4000000000LL; long long y = (cal(a, n.b) + cal(b, n.a)) % 4000000000LL; long long z = c + n.c; while (z && !(x & 1) && !(y & 1)) { z--; x >>= 1; y >>= 1; } return Num(x, y, z); } Num operator*(long long n) { Num ret = Num(a, b, c); if (!n) { return Num(0, 0, 0); } if (ret.c && !(n & 1)) { ret.c--; n >>= 1; } ret.a = cal(ret.a, n); ret.b = cal(ret.b, n); return ret; } long long get() { if (c) return ((b / (1LL << (c - 1))) % 1000000000 + 1000000000) % 1000000000; return (((b << 1) / (1LL << c)) % 1000000000 + 1000000000) % 1000000000; } }; Num x(1, 1, 1); Num sx[200001], Sx[200001]; struct Segment { long long i, l, r; Num val; Segment() {} Segment(int k, int a, int b, Num c) { i = k; l = a; r = b; val = c; } long long len() { return r - l + 1; } void update() { if (lazy[i] == 0) return; val = val + (Sx[r - l + 1] * lazy[i]); if (l < r) { lazy[i << 1] += lazy[i]; lazy[(i << 1) + 1] += lazy[i]; } lazy[i] = 0; } }; Segment T[5 * 200001]; void go(long long i, long long l, long long r) { if (l == r) { T[i] = Segment(i, l, r, x * a[l]); return; } long long m = (l + r) >> 1; go(i << 1, l, m); go((i << 1) + 1, m + 1, r); Num x = T[i << 1].val + (sx[m - l + 1] * T[(i << 1) + 1].val); T[i] = Segment(i, l, r, x); } Num get(long long i, long long l, long long r) { T[i].update(); if (l == T[i].l && r == T[i].r) { return T[i].val; } long long m = (T[i].l + T[i].r) >> 1; if (r <= m) return get(i << 1, l, r); if (l > m) return get((i << 1) + 1, l, r); Num left = get(i << 1, l, m); Num right = get((i << 1) + 1, m + 1, r); return left + (sx[m - l + 1] * right); } void update(long long i, long long l, long long r, long long val) { if (l == T[i].l && r == T[i].r) { lazy[i] += val; return; } long long m = (T[i].l + T[i].r) >> 1; if (r <= m) { update(i << 1, l, r, val); } else if (l > m) { update((i << 1) + 1, l, r, val); } else { update(i << 1, l, m, val); update((i << 1) + 1, m + 1, r, val); } T[i << 1].update(); T[(i << 1) + 1].update(); T[i].val = T[i << 1].val + (sx[T[i << 1].len()] * T[(i << 1) + 1].val); } int main() { long long n, q, i, k, t, v, l, r, d, add; scanf( %lld %lld , &n, &q); sx[1] = Sx[1] = x; for (i = 2; i <= n; i++) { sx[i] = sx[i - 1] * x; Sx[i] = Sx[i - 1] + sx[i]; } for (i = 1; i <= n; i++) { scanf( %lld , a + i); update(i, n, a[i]); update(i + 1, n, -a[i]); } go(1, 1, n); while (q--) { scanf( %lld , &t); if (t == 1) { scanf( %lld %lld , &k, &v); add = v - get(k); update(k, n, add); update(k + 1, n, -add); update(1, k, k, add); } else { scanf( %lld %lld , &l, &r); if (t == 2) { printf( %lld n , get(1, l, r).get()); } else { scanf( %lld , &d); update(l, n, d); update(r + 1, n, -d); update(1, l, r, d); } } } return 0; }
#include <bits/stdc++.h> using namespace std; const int NR = 1005; int read() { int x = 0, f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); } return x * f; } int n, m, a, b; int h[NR][NR]; int num[NR][NR]; int mn[NR][NR]; struct Nd { int id, x; }; Nd md(int id, int x) { Nd tmp; tmp.id = id, tmp.x = x; return tmp; } int all; struct Mashiro { int x, y; long long ans; bool operator<(const Mashiro& A) const { return (ans == A.ans) ? ((x == A.x) ? y < A.y : x < A.x) : ans < A.ans; } } p[NR * NR]; bool flag[NR][NR]; Mashiro Md(int x, int y, long long ans) { Mashiro tmp; tmp.x = x, tmp.y = y, tmp.ans = ans; return tmp; } long long sum[NR][NR]; long long getsum(int l1, int r1, int l2, int r2) { return sum[l2][r2] + sum[l1 - 1][r1 - 1] - sum[l2][r1 - 1] - sum[l1 - 1][r2]; } int tot; int posx[NR * NR], posy[NR * NR]; long long ans[NR * NR]; void add(int x, int y, long long num) { tot++; posx[tot] = x, posy[tot] = y, ans[tot] = num; } void print() { printf( %d n , tot); for (int i = 1; i <= tot; i++) printf( %d %d %lld n , posx[i], posy[i], ans[i]); } int main() { n = read(), m = read(), a = read(), b = read(); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) h[i][j] = read(); for (int i = 1; i <= n; i++) { deque<Nd> q; for (int j = 1; j <= b; j++) { while (!q.empty() && h[i][j] < q.back().x) q.pop_back(); q.push_back(md(j, h[i][j])); } num[i][1] = q.front().x; for (int j = b + 1; j <= m; j++) { while (!q.empty() && q.front().id <= j - b) q.pop_front(); while (!q.empty() && h[i][j] < q.back().x) q.pop_back(); q.push_back(md(j, h[i][j])); num[i][j - b + 1] = q.front().x; } } for (int i = 1; i <= m - b + 1; i++) { deque<Nd> q; for (int j = 1; j <= a; j++) { while (!q.empty() && num[j][i] < q.back().x) q.pop_back(); q.push_back(md(j, num[j][i])); } mn[1][i] = q.front().x; for (int j = a + 1; j <= n; j++) { while (!q.empty() && q.front().id <= j - a) q.pop_front(); while (!q.empty() && num[j][i] < q.back().x) q.pop_back(); q.push_back(md(j, num[j][i])); mn[j - a + 1][i] = q.front().x; } } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + h[i][j]; for (int i = 1; i <= n - a + 1; i++) for (int j = 1; j <= m - b + 1; j++) p[++all] = Md(i, j, getsum(i, j, i + a - 1, j + b - 1) - 1ll * mn[i][j] * a * b); sort(p + 1, p + all + 1); for (int i = 1; i <= all; i++) { if (flag[p[i].x][p[i].y]) continue; add(p[i].x, p[i].y, p[i].ans); for (int j = max(1, p[i].x - a + 1); j <= min(n, p[i].x + a - 1); j++) for (int k = max(1, p[i].y - b + 1); k <= min(m, p[i].y + b - 1); k++) flag[j][k] = 1; } print(); return 0; }
#include<bits/stdc++.h> #define ll long long #define pll pair<ll,ll> #define pii pair<int,int> #define rep(i,a,b) for(int i=a;i<=b;++i) #define per(i,a,b) for(int i=a;i>=b;--i) #define mem0(x) memset(x,0,sizeof(x)) #define meminf(x) memset(x,0x3f,sizeof(x)) #define VI vector<int> #define VL vector<ll> #define pb push_back #define YES(n) cout << ((n) ? YES : NO ) << endl #define Yes(n) cout << ((n) ? Yes : No ) << endl #define endl n #define pb push_back #define fi first #define se second #define dump(x) cerr << #x << = << (x) << endl; #define debug(x) cerr << #x << = << (x) << (L << __LINE__ << ) << << __FILE__ << endl; //#define DEBUG using namespace std; const int N = 150+5, inf = 0x3f3f3f3f; int n,k; ll a[N],b[N],tmm[N]; void solve(){ cin>>n; rep(i,1,n){ cin>>a[i]>>b[i]; } rep(i,1,n){ cin>>tmm[i]; } ll tim = 0; rep(i,1,n){ tim += a[i]-b[i-1]+tmm[i]; if(n == i) break; ll lim = max(b[i]-tim, (b[i]-a[i]+1)/2); tim += lim; } cout << tim <<endl; } int main(){ ios::sync_with_stdio(0); int tt;cin>>tt; while(tt--){ solve(); } }
#include <bits/stdc++.h> using namespace std; void ch_max(int &x, int y) { if (x < y) x = y; } void ch_min(int &x, int y) { if (x > y) x = y; } const double pi = acos(-1.0); const double eps = 1e-9; bool solve(long long a, long long b) { if (a == 0 || b == 0) return false; if (a < b) swap(a, b); if (a % b == 0) return true; if (!solve(a % b, b)) return true; long long t0 = a / b; long long t1 = t0 % (b + 1); if (t1 % 2) return false; return true; } int main() { int i, j, k, t, nc = 0; scanf( %d , &t); while (t--) { long long a, b; scanf( %I64d%I64d , &a, &b); if (solve(a, b)) printf( First n ); else printf( Second n ); } return 0; }
#include <bits/stdc++.h> using namespace std; using LL = long long; void err() { cout << endl; } template <template <typename...> class T, typename t, typename... Args> void err(T<t> a, Args... args) { for (auto x : a) cout << x << ; err(args...); } template <typename T, typename... Args> void err(T a, Args... args) { cout << a << ; err(args...); } struct P { int a, b, item; }; const int N = 1E5 + 100; int n, m, dm[N]; set<int> S[N]; int orders[N]; int main() { cin >> n >> m; int tot = 0; for (decay<decltype(n + 1)>::type i = (1), _i = (n + 1); i < _i; ++i) { int sz; scanf( %d , &sz); for (decay<decltype(sz)>::type j = (0), _j = (sz); j < _j; ++j) { int x; scanf( %d , &x); S[i].insert(x); } tot += sz; } for (decay<decltype(n + 1)>::type i = (1), _i = (n + 1); i < _i; ++i) orders[i] = i; sort(orders + 1, orders + n + 1, [](const int& x, const int& y) { return S[x].size() > S[y].size(); }); int ll = 1, rr = n; int at_least = tot / n; for (decay<decltype(n + 1)>::type i = (1), _i = (n + 1); i < _i; ++i) { if (i <= tot % n) dm[orders[i]] = at_least + 1; else dm[orders[i]] = at_least; } vector<P> gather; while (ll < rr) { vector<P> adds; int rrrrrrrrr = orders[rr], lllllllll = orders[ll]; ; if (int((S[rrrrrrrrr]).size()) >= dm[rrrrrrrrr] && int((S[lllllllll]).size()) <= dm[lllllllll]) break; vector<set<int>::iterator> vs; vs.push_back(S[lllllllll].begin()); for (int v : S[rrrrrrrrr]) { auto it = S[lllllllll].upper_bound(v); if (it != S[lllllllll].end()) vs.push_back(it); } vector<int> dec; for (auto it : vs) while (int((S[lllllllll]).size()) - int((dec).size()) > dm[lllllllll] && int((S[rrrrrrrrr]).size()) < dm[rrrrrrrrr] && S[rrrrrrrrr].find(*it) == S[rrrrrrrrr].end()) { S[rrrrrrrrr].insert(*it); dec.push_back(*it++); } for (int v : dec) { S[lllllllll].erase(v); gather.push_back({lllllllll, rrrrrrrrr, v}); }; if (int((S[lllllllll]).size()) == dm[lllllllll]) ll++; if (int((S[rrrrrrrrr]).size()) == dm[rrrrrrrrr]) rr--; } cout << gather.size() << endl; for (decay<decltype(gather.size())>::type i = (0), _i = (gather.size()); i < _i; ++i) printf( %d %d %d n , gather[i].a, gather[i].b, gather[i].item); }
#include <bits/stdc++.h> using namespace std; int n, head[100005], tot, de[100005], le[100005], lf[100005]; struct node { int to, next; } edge[100005 * 2]; void add_edge(int u, int v) { de[u]++; edge[tot].to = v; edge[tot].next = head[u]; head[u] = tot++; } void dfs(int cnt, int pre) { lf[cnt] = 1; for (int i = head[cnt]; i != -1; i = edge[i].next) { int j = edge[i].to; if (j == pre) continue; if (de[j] <= 2) dfs(j, cnt); } } int main() { while (cin >> n) { tot = 0; memset(head, -1, sizeof(head)); memset(de, 0, sizeof(de)); memset(lf, 0, sizeof(lf)); memset(le, 0, sizeof(le)); for (int i = 1; i < n; i++) { int u, v; cin >> u >> v; add_edge(u, v); add_edge(v, u); } for (int i = 1; i <= n; i++) { if (de[i] == 1) dfs(i, 0); } for (int i = 1; i <= n; i++) { for (int j = head[i]; j != -1; j = edge[j].next) { int k = edge[j].to; if (lf[k]) le[i]++; } } int flag = 0; for (int i = 1; i <= n && !flag; i++) { if (lf[i]) continue; int cn = 0; for (int j = head[i]; j != -1; j = edge[j].next) { int k = edge[j].to; if (lf[k] == 0 && de[k] - min(2, le[k]) >= 2) cn++; if (cn > 2) { flag = 1; break; } } } if (flag) cout << NO n ; else cout << YES n ; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 3e5 + 10; long long n, a, d[MAXN], v[MAXN], P[MAXN]; vector<pair<int, long long> > vc; long long ans; int main() { cin >> n >> a; vc.push_back({0, 0}); P[0] = -1e18; for (int i = 0; i < n; i++) { cin >> d[i] >> v[i]; ans = max(ans, a - v[i]); v[i] -= a; if (i == 0) continue; v[i] += v[i - 1]; long long mn; if (i >= 2) mn = v[i - 2]; else mn = 0; while (!vc.empty() && vc.back().first <= d[i] - d[i - 1]) mn = max(mn, vc.back().second), vc.pop_back(); vc.push_back({d[i] - d[i - 1], mn}); mn -= (d[i] - d[i - 1]) * (d[i] - d[i - 1]); P[vc.size()] = max(P[vc.size() - 1], mn); ans = max(ans, -v[i] + P[vc.size()]); } cout << ans; }
#include <bits/stdc++.h> using namespace std; signed main() { long long n; cin >> n; long long ans = 0; long long L = -4 * 45, R = 45; map<long long, long long> vls; for (long long i = L; i <= R; i++) vls[i] = 1e18; for (long long i = 0; i < 100; i++) { for (long long j = 0; j < 100; j++) { for (long long k = 0; k < 100; k++) { long long nm = -4 * i + 5 * j + 45 * k; if (nm >= L && nm <= R) vls[nm] = min(vls[nm], i + j + k); } } } for (long long i = L; i <= R; i++) { if (vls[i] <= n) { ans++; } } for (long long i = L; i < L + 4; i++) { long long op = vls[i]; if (op < n) ans += n - op; } for (long long i = R - 44; i <= R; i++) { long long op = vls[i]; if (op < n) ans += n - op; } cout << ans; return 0; }
// #include<bits/stdc++.h> #include<iostream> #include<algorithm> #include<cmath> /* #include<vector> #include<set> #include<map> #include<unordered_map> #define umap unordered_map #include<unordered_set> #define uset unordered_set */ #define pii pair<int,int> #define F first #define S second #define fr(i,n) for(int i=0;i<n;++i) #define pr cout<< #define en << n #define sp << using namespace std; typedef long long ll; int ar[200001]; int main() { // ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t=1,n,a ; cin>>t; while(t--) { cin>>n; int no=0, cnt=0,ans=0; fr(i,n){ cin>>a; if(a==no) cnt++; else{ ans=max(ans,cnt); cnt=1; no =a; } } ans=max(ans,cnt); pr ans en; } }
#include <bits/stdc++.h> using namespace std; int y; int main() { long long int a, b, s; cin >> a >> b >> s; a = abs(a); b = abs(b); if (s >= a + b && (s - a - b) % 2 == 0) { cout << YES ; } else cout << NO ; }
#include <bits/stdc++.h> using namespace std; bool cmp(int a, int b) { return a > b; } const int maxen = 1e5 + 5, minn = 1e-5; string a[1005]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int res = 0, mn = 13; for (int i = 0; i < n - 1; i++) { for (int j = i + 1; j < n; j++) { string b = a[i]; string c = a[j]; res = 0; for (int k = 0; k < 6; k++) if (b[k] != c[k]) res++; mn = min(mn, res); } } cout << (mn - 1) / 2 << endl; return 0; }
#include <bits/stdc++.h> #define pb push_back #define mp make_pair #define ll long long #define mod 1000000007 using namespace std; void factorial(ll int *fact) { fact[0]=1; for(ll int i=1;i<=200000;i++) { fact[i]=(fact[i-1]*i)%mod; } } int main() { int t=1; cin>>t; ll int fact[200001]; factorial(fact); while(t--) { ll int n; cin>>n; ll int i,j,a[n]; ll int mi=INT_MAX; for(i=0;i<n;i++) { cin>>a[i]; mi=min(mi,a[i]); } ll int c=0; ll int an=mi; for(i=0;i<n;i++) { if(a[i]==mi) c++; an=an&a[i]; } if(an!=mi && c>=2) { cout<<0<<endl; } else { cout<<((((((c*(c-1))/2)%mod)*fact[n-2])%mod)*2)%mod<<endl; } } }
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, i, t, j, p, q, a, b, m; cin >> t; while (t--) { cin >> n >> m; string s[n]; bool ck = true; ; p = (n * m); if (p % 2 == 0) a = (p / 2) - 1; else a = p / 2; for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { if (!ck && a) { s[i] += W ; a--; ck = true; continue; } else { s[i] += B ; ck = false; continue; } } } if (p % 2 == 0) { s[n - 2][m - 2] = W ; s[n - 2][m - 1] = B ; } for (i = 0; i < n; i++) cout << s[i] << endl; } return; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; }
#include <bits/stdc++.h> using namespace std; vector<vector<int> > arr; double ans = 0; void dfs(int x, int h, int p) { ans += 1.0 / h; for (int i = 0; i < arr[x].size(); i++) { if (arr[x][i] != p) dfs(arr[x][i], h + 1, x); } } int main() { int n; cin >> n; int x, y; arr.resize(n + 1); for (int i = 0; i < n - 1; i++) { cin >> x >> y; arr[x].push_back(y); arr[y].push_back(x); } dfs(1, 1, -1); printf( %0.7f , ans); }
#include <bits/stdc++.h> using namespace std; int MOD = 1e9 + 7; long long int power(long long int a, long long int b) { long long int res = 1; a = a % MOD; while (b > 0) { if (b & 1) { res = (res * a) % MOD; b--; } a = (a * a) % MOD; b >>= 1; } return res; } long long int fermat_inv(long long int y) { return power(y, MOD - 2); } long long int gcd(long long int a, long long int b) { return (b == 0) ? a : gcd(b, a % b); } long long int min(long long int a, long long int b) { return (a > b) ? b : a; } long long int max(long long int a, long long int b) { return (a > b) ? a : b; } using cd = complex<double>; const double PI = acos(-1); void fft(vector<cd> &a, bool invert) { int n = a.size(); for (int i = 1, j = 0; i < n; i++) { int bit = n >> 1; for (; j & bit; bit >>= 1) j ^= bit; j ^= bit; if (i < j) swap(a[i], a[j]); } for (int len = 2; len <= n; len <<= 1) { double ang = 2 * PI / len * (invert ? -1 : 1); cd wlen(cos(ang), sin(ang)); for (int i = 0; i < n; i += len) { cd w(1); for (int j = 0; j < len / 2; j++) { cd u = a[i + j], v = a[i + j + len / 2] * w; a[i + j] = u + v; a[i + j + len / 2] = u - v; w *= wlen; } } } if (invert) { for (cd &x : a) x /= n; } } vector<int> mult(vector<int> &a, vector<int> &b) { int n = 1; while (n < 2 * max(a.size(), b.size())) n <<= 1; vector<cd> A((a).begin(), (a).end()), B((b).begin(), (b).end()); A.resize(n); B.resize(n); fft(A, false); fft(B, false); vector<cd> C(n); for (int i = 0; i < n; i++) C[i] = A[i] * B[i]; fft(C, true); vector<int> ans(n); for (int i = 0; i < n; i++) ans[i] = round(C[i].real()); return ans; } int f[1000005]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int te = 1; while (te--) { int n, x, y; cin >> n >> x >> y; vector<int> a(x + 1), b(x + 1); for (int i = 0; i <= n; i++) { int z; cin >> z; a[z] = 1; b[x - z] = 1; } vector<int> v = mult(a, b); fill(f, f + 1000005, -1); for (int i = x + 1; i < v.size(); i++) { if (v[i]) { int val = 2 * (i - x) + 2 * y; for (int j = val; j <= 1000000; j += val) f[j] = val; } } int q; cin >> q; for (int i = 0; i < q; i++) { int l; cin >> l; cout << f[l] << ; } cout << n ; } }
#include <bits/stdc++.h> using namespace std; vector<int> tree[2010]; int cs[2010], ps[2010]; int numDesc(int node) { int descendants = 0; for (int x : tree[node]) { descendants += 1 + numDesc(x); } if (descendants < cs[node]) return 10000; return descendants; } void solve(int node, vector<int>& order) { ps[node] = order[cs[node]]; order.erase(order.begin() + cs[node]); for (int x : tree[node]) solve(x, order); } int main() { int n; cin >> n; int root; for (int i = 1; i <= n; i++) { int p, c; cin >> p >> c; cs[i] = c; if (p == 0) { root = i; continue; } tree[p].push_back(i); } if (numDesc(root) > 5000) cout << NO ; else { vector<int> order(n); order[0] = 1; for (int i = 1; i < n; i++) order[i] = order[i - 1] + 1; solve(root, order); cout << YES n ; for (int i = 1; i < n; i++) cout << ps[i] << ; cout << ps[n]; } return 0; }
#include <bits/stdc++.h> using namespace std; const int inf = 0x3f3f3f3f; char s[110]; int main() { while (~scanf( %s , s) && s[0] != e ) { char op[10]; int x = 0, y = 0, p, ans = 0; for (int i = 0; i <= 30; i++) { x = (i == 0 ? 0 : 1 << (i - 1)); y = 1 << i; cout << ? << x << << y << endl; cin >> op; if (op[0] == x ) { p = i - 1; break; } } if (p != -1) { ans = 1 << p; for (int i = p - 1; i >= 0; i--) { y = 1 << i; cout << ? << ans << << ans + y << endl; cin >> op; if (op[0] == y ) ans += y; } } cout << ! << ans + 1 << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; long long t, n, m, u, v, cnt = 0; long long head[400005], depth[200005], visited[200005]; vector<long long> ve[5]; struct edge { long long next; long long to; } e[400005]; queue<long long> q; inline void add_edge(long long u, long long v) { cnt++; e[cnt].to = v; e[cnt].next = head[u]; head[u] = cnt; } inline void bfs() { q.push(1); depth[1] = 0; visited[1] = 1; while (!q.empty()) { long long now = q.front(); for (long long i = head[now]; i; i = e[i].next) { if (visited[e[i].to] == 0) { depth[e[i].to] = depth[now] + 1; q.push(e[i].to); visited[e[i].to] = 1; } } visited[now] = 1; q.pop(); } } signed main() { cin >> t; while (t--) { cin >> n >> m; cnt = 0; for (long long i = 0; i <= 1; i++) ve[i].clear(); for (long long i = 1; i <= n; i++) visited[i] = 0; for (long long i = 1; i <= 2 * n; i++) head[i] = e[i].next = e[i].to = 0; for (long long i = 1; i <= m; i++) { cin >> u >> v; add_edge(u, v); add_edge(v, u); } bfs(); for (long long i = 1; i <= n; i++) ve[depth[i] % 2].push_back(i); if (ve[0].size() <= ve[1].size()) { cout << ve[0].size() << endl; for (long long i = 0; i < ve[0].size(); i++) cout << ve[0][i] << ; cout << endl; } else { cout << ve[1].size() << endl; for (long long i = 0; i < ve[1].size(); i++) cout << ve[1][i] << ; cout << endl; } } return 0; }
#include <bits/stdc++.h> using namespace std; const long long INF = 2e18; const long long INFINT = 2e9; const int N = 1000006; const int NN = 1006; const int MOD = 1000000007; int main() { ios_base::sync_with_stdio(0); long double n, h; cin >> n >> h; long double s = 1.0 * 1 * h / 2; long double k = 1.0 * s / n; long double mda = k; for (int i = 0; i < n - 1; i++) { long double l = 0; long double r = h; for (int it = 0; it < 10000; it++) { long double mid = 1.0 * (l + r) / 2; if ((1.0 * mid / h) * mid / 2 < k) { l = mid; } else { r = mid; } } cout << fixed << setprecision(9) << l << ; k = mda * (i + 2); } }
#include <bits/stdc++.h> using namespace std; const int N = (int)1e5 + 9; long long power(long long x, long long y) { if (y == 0) return 1; long long temp = power(x, y / 2); if (y % 2 == 1) return temp * temp * x; else return temp * temp; } bool check(string a, string b) { sort(a.begin(), a.end()); sort(b.begin(), b.end()); if (a == b) return true; return false; } string solve(string x) { int n = x.length(); if (n % 2) return x; string a = solve(x.substr(0, n / 2)); string b = solve(x.substr(n / 2, n)); return a < b ? (a + b) : (b + a); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string a, b; cin >> a >> b; if (solve(a) == solve(b)) cout << YES ; else cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, p, q, c, x, y, mod, lo[100000], z[3005][3005]; long long ans; struct segment_tree { int a[3005][13]; void update(int x, int y) { a[x][0] = y; } void build(int n) { for (int i = 1; i <= lo[n]; i++) for (int j = 1; j + (1 << i) - 1 <= n; j++) a[j][i] = min(a[j][i - 1], a[j + (1 << (i - 1))][i - 1]); } long long find(int x, int y) { int len = lo[y - x + 1]; return min(a[x][len], a[y - (1 << len) + 1][len]); } } a; int main() { scanf( %d%d%d%d , &n, &m, &p, &q); scanf( %d%d%d%d , &c, &x, &y, &mod); a.update(1, c); for (int i = 2; i <= 10000; i++) lo[i] = lo[i >> 1] + 1; for (int i = 2; i <= m; i++) c = (1ll * c * x + y) % mod, a.update(i, c); a.build(m); for (int i = 1; i <= m - q + 1; i++) z[1][i] = a.find(i, i + q - 1); for (int i = 2; i <= n; i++) { for (int j = 1; j <= m; j++) c = (1ll * c * x + y) % mod, a.update(j, c); a.build(m); for (int j = 1; j <= m - q + 1; j++) z[i][j] = a.find(j, j + q - 1); } for (int i = 1; i <= m - q + 1; i++) { for (int j = 1; j <= n; j++) a.update(j, z[j][i]); a.build(n); for (int j = 1; j <= n - p + 1; j++) ans = ans + a.find(j, j + p - 1); } printf( %lld , ans); }
#include <bits/stdc++.h> using namespace std; int t, k; int main() { cin >> t; while (t--) { vector<vector<pair<int, int>>> graph; cin >> k; graph.resize(2 * k); for (int i = 0; i < 2 * k - 1; ++i) { int a, b, c; cin >> a >> b >> c; a--; b--; graph[a].emplace_back(b, c); graph[b].emplace_back(a, c); } vector<int> parent(2 * k, -1); vector<long long> cost(2 * k); vector<int> que(1, 0); parent[0] = 0; for (int i = 0; i < que.size(); ++i) { int t = que[i]; for (auto it : graph[t]) { if (parent[it.first] == -1) { parent[it.first] = t; cost[it.first] = it.second; que.emplace_back(it.first); } } } long long mn = 0, mx = 0; vector<int> size(2 * k, 1); reverse(que.begin(), que.end()); for (int i : que) { size[parent[i]] += size[i]; mx += cost[i] * min(2 * k - size[i], size[i]); mn += cost[i] * (size[i] & 1); } cout << mn << << mx << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int bit[200050]; int n; int lowbit(int x) { return x & (-x); } int sum(int x) { int sum = 0; while (x > 0) { sum += bit[x]; x -= lowbit(x); } return sum; } void push(int pos, int num) { while (pos <= n) { bit[pos] += num; pos += lowbit(pos); } } int kth(int k) { int num = 0; int x = 0; for (int i = 1 << 18; i > 0; i >>= 1) { num += i; if (num >= n || x + bit[num] >= k) num -= i; else x += bit[num]; } return num + 1; } int main() { scanf( %d , &n); int a[200050]; int x; memset((bit), (0), sizeof((bit))); for (int i = 0; i < n; i++) { scanf( %d , &x); push(x + 1, 1); a[i] = x - sum(x); } memset((bit), (0), sizeof((bit))); for (int i = 0; i < n; i++) { scanf( %d , &x); push(x + 1, 1); a[i] += x - sum(x); } for (int i = n - 1; i > 0; i--) { if (a[i] >= n - i) { a[i - 1]++; a[i] -= n - i; } } if (a[0] >= n) a[0] -= n; for (int i = 0; i < n; i++) { int num = kth(a[i] + 1); printf( %d , num - 1); push(num, -1); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long T, n, k, a, b; cin >> T; while (T--) { cin >> n >> k >> a >> b; n -= k; bool flag = 0; if (a < b) swap(a, b); if ((2 * a + b) <= n && (n - 2 * a - b) % 3 == 0 && (2 * b + a) <= k && (k - 2 * b - a) % 3 == 0) flag = 1; if (2 * b + a <= n && (n - 2 * b - a) % 3 == 0 && (2 * a + b) <= k && (k - 2 * a - b) % 3 == 0) flag = 1; if (2 * a - b <= n && (n - 2 * a + b) % 3 == 0 && (a + b) <= k && (k - a - b) % 3 == 0) flag = 1; if (a + b <= n && (n - a - b) % 3 == 0 && (2 * a - b) <= k && (k - 2 * a + b) % 3 == 0) flag = 1; if (flag) cout << yes << endl; else cout << no << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; bool prime(long long x) { if (x == 2) return 1; if (x % 2 == 0) return 0; for (long long j = 3; j * j <= x; j += 2) { if (x % j == 0) return 0; } return 1; } int main() { long long t; cin >> t; while (t--) { long long n, m; cin >> n >> m; if (n - m > 1) { cout << NO << endl; } else { if (prime(n + m)) { cout << YES << endl; } else { cout << NO << endl; } } } }
#include <bits/stdc++.h> using namespace std; mt19937 rnd(time(0)); const long long inf = 0x3f3f3f3f3f3f3f3fLL; const long long N = 35; const long long MOD = 1e9 + 7; long long n, u, r, ans = -inf; long long a[N], b[N], k[N], p[N], dp[N][N]; void go(long long pos, long long lst) { if ((u - pos) % 2 == 0) { long long cur = 0; for (long long i = 1; i <= n; i++) cur += dp[pos][i] * k[i]; ans = max(ans, cur); if (pos == u) return; } if (!lst) { for (long long i = 1; i <= n; i++) dp[pos + 1][i] = dp[pos][i] ^ b[i]; go(pos + 1, 1); } for (long long i = 1; i <= n; i++) dp[pos + 1][i] = dp[pos][p[i]] + r; go(pos + 1, 0); } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> u >> r; for (long long i = 1; i <= n; i++) cin >> a[i], dp[0][i] = a[i]; for (long long i = 1; i <= n; i++) cin >> b[i]; for (long long i = 1; i <= n; i++) cin >> k[i]; for (long long i = 1; i <= n; i++) cin >> p[i]; go(0, 0); cout << ans; return 0; }
#include <iostream> #include <algorithm> #define int long long using namespace std; void solve () { int a, b, c, d; cin >> a >> b >> c >> d; int arr[4] = {a,b,c,d}; sort (arr, arr+4); int max1 = arr[4-1]; int max2 = arr[4-2]; int win1 = max (a, b); int win2 = max (c, d); if (win1 == max1 && win2 == max2){ cout << YES << n ; return; } if (win1 == max2 && win2 == max1){ cout << YES << n ; return; } cout << NO << n ; } signed main () { ios_base::sync_with_stdio (0);cin.tie (0); int t; cin >> t; while (t--) { solve (); } }
#include <bits/stdc++.h> using namespace std; long long int MOD = 1e9 + 7; long long int prime[10000000]; long long int fac[200100], ifac[200100]; long long int inv[200100]; vector<long long int> primes; long long int gcd(long long int a, long long int b) { if (b == 0) return a; return gcd(b, a % b); } bool IsPrime(long long int x) { if (x == 1) return false; for (long long int i = 2; i * i <= x; i++) { if (x % i == 0) return false; } return true; } void seive(long long int n) { prime[0] = prime[1] = 1; for (long long int i = 2; i * i <= n; i++) if (!prime[i]) { primes.push_back(i); for (long long int j = i * i; j <= 1e6; j += i) prime[j] = 1; } } bool sortMa7boub(const pair<long double, int>& a, const pair<long double, int>& b) { if (a.first == b.first) return (a.second < b.second); return (a.first > b.first); } bool IsVowel(char c) { return (c == a || c == e || c == i || c == u || c == o || c == y || c == A || c == E || c == I || c == U || c == O || c == Y ); } bool IsEqual(string s1, string s2) { if (s1.length() != s2.length()) return 0; for (int i = 0; i < s1.length(); i++) if (s1[i] != s2[i]) return 0; return 1; } long long int powMod(long long int base, long long int pw) { long long int ret = 1; while (pw) { if (pw & 1) ret = (ret * base) % MOD; base = (base * base) % MOD; pw >>= 1; } return ret; } void makeFact() { fac[0] = ifac[0] = 1; for (long long int i = 1; i < 200100; i++) { fac[i] = (fac[i - 1] * i) % MOD; ifac[i] = powMod(fac[i], MOD - 2); } } inline void Init() { inv[1] = 1; for (int i = 2; i < 200100; ++i) inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD; } long long int C(long long int a, long long int b) { if (a < b) return 0; return (((fac[a] * ifac[b]) % MOD) * ifac[a - b]) % MOD; } long long int P(long long int a, long long int b) { if (a < b) return 0; return (fac[a] * ifac[a - b]) % MOD; } long long int sum(long long int k) { return (k % MOD) * ((k + 1) % MOD) / 2; } long long int pascalDivisibility(long long int n, long long int p) { long long int ans = 1; long long int i = 0; while (n) { ans = (sum(n % p) % MOD) * (powMod(sum(p), i) % MOD) + ((n % p + 1) % MOD) * (ans % MOD); ans %= MOD; n /= p; i++; } return ans % MOD; } bool PointInRectangle(long double x1, long double y1, long double x2, long double y2, long double x, long double y) { return (x >= x1 && x <= x2 && y >= y1 && y <= y2); } bool InRange(long long int a, long long int b, long long int c) { return a >= b && a <= c; } string AL = ABCDEFGHIJKLMNOPQRSTUVWXYZ ; long long int arr[200100]; long long int level[200100]; vector<long long int> rang; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long int n, k, x, mx(0), mn(2 * 1e18); cin >> n >> k; set<long long int> ss; for (int i = 0; i < n; i++) cin >> x, arr[x]++, mx = max(mx, x), mn = min(mn, x); long long int sum = 0; for (int i = 200100 - 1; i > 0; i--) { sum += arr[i]; } long long int cnt(0); long long int sumi = 0; for (long long int i = mx; i > mn; i--) { sumi += arr[i]; level[i] = sumi; } for (long long int i = mx; i > mn;) { long long int sumo = 0; while (sumo < k) { sumo += level[i]; i--; } if (sumo > k) i++; cnt++; } cout << cnt << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n; int main() { scanf( %d , &n); if (n <= 2) { printf( -1 n ); return 0; } printf( %d , n); for (n--; n; n--) printf( %d , n); return 0; }
#include <bits/stdc++.h> using namespace std; int c[25]; bool vis[25]; int n, m; bool dfs(int p, int s, int k) { if (p > n) return m == n - 1; if (!k) return dfs(p + 1, p, c[p + 1]); for (; s; s--) if (!vis[s] && c[s] + 1 < c[p] && c[s] + 1 <= k) { vis[s] = true; k -= c[s] + 1; m++; if (dfs(p, s - 1, k)) return true; vis[s] = false; k += c[s] + 1; m--; } return false; } int main() { while (~scanf( %d , &n)) { for (int i = 1; i <= n; ++i) { scanf( %d , &c[i]); c[i]--; } sort(c + 1, c + 1 + n); memset(vis, false, sizeof(vis)); m = 0; puts(dfs(1, 0, c[1]) ? YES : NO ); } return 0; }
#include <bits/stdc++.h> using namespace std; string s; class SegmentTree { struct data { int ans; int opened; int closed; }; public: data merge(data A, data B) { int extra = min(A.opened, B.closed); return data{A.ans + B.ans + extra, A.opened + B.opened - extra, A.closed + B.closed - extra}; } data leafNodeValue(int index) { if (s[index] == ( ) return data{0, 1, 0}; else return data{0, 0, 1}; } void updateNode(data& node, int& value, int& start, int& end) {} void updateLazy(int& child, int& parent) {} data outOfRange; int defaultLazyValue; void setDefaultAndOutOfRange() { outOfRange = {0, 0, 0}; } SegmentTree(int n) { setDefaultAndOutOfRange(); size = n; tree = new data[n << 3]; lazy = new int[n << 3]; build(1, 0, size - 1); } void update(int start, int end, int value) { update(1, 0, size - 1, start, end, value); } data query(int start, int end) { return query(1, 0, size - 1, start, end); } private: void build(int node, int start, int end) { int into2 = node << 1, mid = (start + end) / 2; if (start == end) { tree[node] = leafNodeValue(start); lazy[node] = defaultLazyValue; } else { build(into2, start, mid), build(into2 + 1, mid + 1, end); lazy[node] = defaultLazyValue; tree[node] = merge(tree[into2], tree[into2 + 1]); } } void push(int node, int start, int end) { return; if (lazy[node] != defaultLazyValue) { updateNode(tree[node], lazy[node], start, end); if (start != end) { updateLazy(lazy[node + node], lazy[node]); updateLazy(lazy[node + node + 1], lazy[node]); } lazy[node] = defaultLazyValue; } } void update(int node, int start, int end, int rangestart, int rangeend, int value) { return; int into2 = node << 1, mid = (start + end) / 2; push(node, start, end); if (start > end || start > rangeend || end < rangestart) return; if (rangestart <= start && end <= rangeend) { updateNode(tree[node], value, start, end); if (start != end) { updateLazy(lazy[into2 + 1], value); updateLazy(lazy[into2], value); } return; } update(into2, start, mid, rangestart, rangeend, value), update(into2 + 1, mid + 1, end, rangestart, rangeend, value); tree[node] = merge(tree[into2], tree[into2 + 1]); } data query(int node, int start, int end, int rangestart, int rangeend) { int into2 = node << 1, mid = (start + end) / 2; if (start > end || start > rangeend || end < rangestart) return outOfRange; push(node, start, end); if (rangestart <= start && end <= rangeend) return tree[node]; return merge(query(into2, start, mid, rangestart, rangeend), query(into2 + 1, mid + 1, end, rangestart, rangeend)); } long long int size; data* tree; int* lazy; }; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); ; cin >> s; SegmentTree S(s.size()); int n; cin >> n; for (int i = 0; i < n; i++) { int l, r; cin >> l >> r; cout << 2 * S.query(l - 1, r - 1).ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a; cin >> a; if (a > 36) { cout << -1 ; } else { while (a >= 2) { a -= 2; cout << 8 ; } if (a == 1) { cout << 4 ; } } }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; string s; getline(cin, s); for (int i = 0; i < n; i++) { getline(cin, s); if (s.length() >= 5) { if ((s.substr(0, 5) == miao. ) && (s.substr(s.length() - 5, 5) != lala. )) cout << Rainbow s << endl; else if ((s.substr(0, 5) != miao. ) && (s.substr(s.length() - 5, 5) == lala. )) cout << Freda s << endl; else cout << OMG>.< I don t know! << endl; } else cout << OMG>.< I don t know! << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1010; char mtr[MAXN][MAXN]; int main() { int n, m; cin >> n >> m; set<int> s; bool ok = true; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> mtr[i][j]; } } for (int i = 1; i <= n; i++) { int gnomo, doce; for (int j = 1; j <= m; j++) { if (mtr[i][j] == G ) gnomo = j; if (mtr[i][j] == S ) doce = j; } int r = doce - gnomo; if (r > 0) s.insert(r); else ok = false; } if (ok == false) { cout << -1 << endl; return 0; } cout << s.size() << endl; }
#include <bits/stdc++.h> using namespace std; int main() { string a; int count = 0, c = 0; cin >> a; count = a.size(); for (int i = 0; a[i] != 0 ; i++) { if (a[i] >= A && a[i] <= Z ) c++; } if ((c == count) || ((c == count - 1) && (a[0] >= a && a[0] <= z ))) { for (int i = 0; a[i] != 0 ; i++) { if (a[i] >= A && a[i] <= Z ) a[i] = a[i] + 32; else a[i] = a[i] - 32; } } for (int i = 0; a[i] != 0 ; i++) { cout << a[i]; } }
#include <bits/stdc++.h> using namespace std; template <typename T> void chmin(T &x, const T &y) { if (x > y) x = y; } template <typename T> void chmax(T &x, const T &y) { if (x < y) x = y; } char readc() { char c; while ((c = getchar()) < - ) ; return c; } int read() { char c; while ((c = getchar()) < - ) ; if (c == - ) { int x = (c = getchar()) - 0 ; while ((c = getchar()) >= 0 ) x = x * 10 + c - 0 ; return -x; } int x = c - 0 ; while ((c = getchar()) >= 0 ) x = x * 10 + c - 0 ; return x; } const int N = 2e5 + 5; pair<int, int> p[N]; long long s[N]; int main() { int n, a, b; cin >> n >> a >> b; for (int i = 1; i <= n; ++i) { p[i].first = read(); p[i].second = read(); p[i].first -= p[i].second; } sort(p + 1, p + n + 1, greater<pair<int, int> >()); for (int i = 1; i <= n; ++i) s[i] = s[i - 1] + max(0, p[i].first); for (int i = n + 1; i <= b; ++i) s[i] = s[i - 1]; long long ans = s[b]; if (b) for (int i = 1; i <= n; ++i) chmax(ans, ((i < b) ? s[b] - max(0, p[i].first) : s[b - 1]) + ((long long)(p[i].first + p[i].second) << a) - p[i].second); for (int i = 1; i <= n; ++i) ans += p[i].second; cout << ans; }
#include <bits/stdc++.h> using namespace std; const int MAXN = 150000 + 10; int len, n, h; int a[MAXN], b[MAXN]; int dp[1 << 20], all[1 << 20]; inline void go(int root, int lo, int hi, int s, int e, int key) { if (hi < s || e < lo) return; if (s <= lo && hi <= e) { all[root] += key; dp[root] += key; return; } int mid = (lo + hi) / 2; go(root * 2, lo, mid, s, e, key); go(root * 2 + 1, mid + 1, hi, s, e, key); dp[root] = min(dp[root * 2], dp[root * 2 + 1]) + all[root]; } inline void build(int root, int lo, int hi) { if (lo == hi) { dp[root] = -lo; return; } int mid = (lo + hi) / 2; build(root * 2, lo, mid); build(root * 2 + 1, mid + 1, hi); dp[root] = -hi; } int main() { cin >> n >> len >> h; for (int i = 0; i < len; i++) cin >> b[i]; for (int i = 0; i < n; i++) cin >> a[i]; sort(b, b + len); int ret = 0; build(1, 0, len - 1); for (int i = 0; i < n; i++) { int poi = lower_bound(b, b + len, h - a[i]) - b; go(1, 0, len - 1, poi, len - 1, 1); if (len <= i + 1) { ret += (dp[1] > 0); poi = lower_bound(b, b + len, h - a[i - len + 1]) - b; go(1, 0, len - 1, poi, len - 1, -1); } } cout << ret << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n, m, q, ans, top[200005 << 1]; int find(int u) { if (top[u] == u) return u; return top[u] = find(top[u]); } inline void work() { scanf( %d %d %d , &n, &m, &q); for (int i = 1; i <= n + m; i++) top[i] = i; for (int i = 1, u, v; i <= q; i++) { scanf( %d %d , &u, &v); v = v + n; int fu = find(u), fv = find(v); if (fu == fv) continue; top[fu] = fv; } for (int i = 1; i <= n + m; i++) if (top[i] == i) ans++; printf( %d , ans - 1); } int main() { work(); return 0; }
#include <bits/stdc++.h> using namespace std; int getMin(int l, int r, char a[], char ch) { int count = 0; for (int i = l; i <= r; i++) { if (a[i] != ch) { count++; } } return count; } int findans(int l, int r, char a[], char ch) { if (l == r) { if (a[l] == ch) { return 0; } else { return 1; } } int mid = (l + r) / 2; return min(getMin(l, mid, a, ch) + findans(mid + 1, r, a, ch + 1), getMin(mid + 1, r, a, ch) + findans(l, mid, a, ch + 1)); } int main() { long long int t; cin >> t; while (t--) { long long int n; cin >> n; char a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int ans = findans(0, n - 1, a, a ); cout << ans << endl; } }
#include <bits/stdc++.h> using namespace std; void MAIN(); int main() { MAIN(); return 0; } const long long N = 5e3 + 1, mod = 1e9 + 7; int n, m, best[N][N], len[N][N]; char s[N][N]; void MAIN() { scanf( %d%d , &n, &m); for (int i = 1; i <= n; ++i) { scanf( %s , s[i] + 1); for (int j = 1; j <= m; ++j) { if (s[i][j] == 1 ) { len[i][j] = len[i][j - 1] + 1; } ++best[j][len[i][j]]; } } for (int i = m - 1; i >= 1; --i) { for (int j = 1; j <= m; ++j) { best[j][i] += best[j][i + 1]; } } int ans = 0; for (int i = 1; i <= m; ++i) { for (int len = 1; len <= m; ++len) { ans = max(ans, len * best[i][len]); } } printf( %d , ans); }
#include <bits/stdc++.h> using namespace std; vector<int> parent; vector<string> names; void parse(int par) { string str; char c; while (isalpha(cin.peek())) { cin >> c; str += c; } names.push_back(str); parent.push_back(par); int id = names.size() - 1; while (cin.peek() == , || cin.peek() == : ) { cin >> c; parse(id); } cin >> c; } int main() { int ans = 0; parse(-1); for (int i = 0; i < names.size(); i++) { int j = parent[i]; while (j != -1) { ans += (names[j] == names[i]); j = parent[j]; } } cout << ans << endl; }
#include <bits/stdc++.h> using namespace std; const long long sz = 1e5 + 10; long long ara[sz], n, p; ; bool isValid(long long now) { long long ptr = 1; for (long long i = 1; i <= n; ++i) { while (ptr <= n && ara[ptr] <= now) ptr++; if (ptr - i >= p) return 0; now++; } return 1; } int main() { cin >> n >> p; for (long long i = 1; i <= n; ++i) scanf( %lld , &ara[i]); sort(ara + 1, ara + n + 1); long long start = 1, now = start; for (long long i = 1; i <= n; ++i) { if (now < ara[i]) { long long diff = ara[i] - now; now += diff, start += diff; } now++; } long long lo = start, hi = 1e9, stop = -1; while (lo <= hi) { long long mid = lo + hi >> 1; if (isValid(mid)) { stop = mid; lo = mid + 1; } else hi = mid - 1; } cout << max(0LL, stop - start + 1) << n ; for (long long i = start; i <= stop; i += 1) { if (i != start) printf( ); printf( %lld , i); } if (stop != -1) printf( n ); return 0; }
#include <bits/stdc++.h> struct state { int n : 24; int c : 8; state const *prev; }; state b[128][128][128] = {}; void print(state const &s) { if (s.n) { state const &p = *s.prev; print(p); if (p.n < s.n) printf( %c , s.c); } } int main() { char s1[128]; char s2[128]; char sv[128]; scanf( %s%s%s , s1, s2, sv); unsigned int n1 = strlen(s1); unsigned int n2 = strlen(s2); unsigned int nv = strlen(sv); unsigned int fail[128] = {}; for (unsigned int i = 1, j = 0; i < nv;) if (sv[i] == sv[j]) fail[i++] = 1 + j++; else if (0 < j) j = fail[j - 1]; else fail[i++] = 0; b[0][0][0].n = 0; for (unsigned int i = 1; i <= nv; ++i) b[0][0][i].n = -4200; for (unsigned int i = 1; i <= n1; ++i) { for (unsigned int j = 1; j <= n2; ++j) { for (unsigned int k = 0; k < nv; ++k) { b[i][j][k] = b[i - 1][j][k]; if (b[i][j][k].n < b[i][j - 1][k].n) b[i][j][k] = b[i][j - 1][k]; } if (s1[i - 1] == s2[j - 1]) { for (unsigned int k = 0; k < nv; ++k) { unsigned int v = k; while (1) { if (s1[i - 1] == sv[v]) { ++v; break; } if (0 < v) v = fail[v - 1]; else break; } if (b[i][j][v].n < b[i - 1][j - 1][k].n + 1) { b[i][j][v].n = b[i - 1][j - 1][k].n + 1; b[i][j][v].c = s1[i - 1]; b[i][j][v].prev = &b[i - 1][j - 1][k]; } } } } } unsigned int v = 0; for (unsigned int i = 1; i < nv; ++i) if (b[n1][n2][v].n < b[n1][n2][i].n) v = i; if (0 < b[n1][n2][v].n) { print(b[n1][n2][v]); printf( n ); } else printf( 0 n ); }