diff --git "a/cpp_dataset/train/train.jsonl" "b/cpp_dataset/train/train.jsonl" --- "a/cpp_dataset/train/train.jsonl" +++ "b/cpp_dataset/train/train.jsonl" @@ -998,3 +998,4003 @@ {"func_code_string": "#include n using namespace std; n int main() { n int n, x, i, y, ans = 0, q; n scanf( %d%d , &n, &x); n y = int(sqrt(x)); n if (n < y) y = n; n for (i = 1; i <= y; i++) { n if (x % i == 0) { n q = x / i; n if (q <= n) { n if (i == q) n ans++; n else n ans += 2; n } n } n } n if (x == 1) n printf( %d n , 1); n else n printf( %d n , ans); n return 0; n } n "} {"func_code_string": "#include n using namespace std; n const int mx = 1e9; n struct Data { n int p1, p2, p3, p4; n Data(int a = mx, int b = mx, int c = mx, int d = mx) { n p1 = a, p2 = b, p3 = c, p4 = d; n } n }; n inline Data UN(Data a, Data b) { n Data c; n c.p1 = min(a.p1 + b.p1, a.p2 + b.p3), c.p2 = min(a.p1 + b.p2, a.p2 + b.p4); n c.p3 = min(a.p3 + b.p1, a.p4 + b.p3), c.p4 = min(a.p3 + b.p2, a.p4 + b.p4); n c.p1 = min(c.p1, mx), c.p2 = min(c.p2, mx), c.p3 = min(c.p3, mx), n c.p4 = min(c.p4, mx); n return c; n } n struct node { n int l, r; n Data s; n } T[200010 << 2]; n char G[3][200010]; n void build(int rt, int l, int r) { n T[rt].l = l, T[rt].r = r; n int mid = (l + r) >> 1; n if (l == r) { n if (G[1][l] == . ) T[rt].s.p1 = 1; n if (G[2][l] == . ) T[rt].s.p4 = 1; n if (G[1][l] == . && G[2][l] == . ) T[rt].s.p2 = T[rt].s.p3 = 2; n return; n } n build(rt << 1, l, mid), build(rt << 1 | 1, mid + 1, r); n T[rt].s = UN(T[rt << 1].s, T[rt << 1 | 1].s); n } n Data query(int rt, int start, int end) { n int l = T[rt].l, r = T[rt].r, mid = (l + r) >> 1; n if (start <= l && r <= end) return T[rt].s; n if (end <= mid) return query(rt << 1, start, end); n if (start > mid) return query(rt << 1 | 1, start, end); n return UN(query(rt << 1, start, end), query(rt << 1 | 1, start, end)); n } n int main() { n int n, q; n scanf( %d%d , &n, &q); n scanf( %s%s , G[1] + 1, G[2] + 1); n build(1, 1, n); n while (q--) { n int a, b; n scanf( %d%d , &a, &b); n int l = a > n ? a - n : a, r = b > n ? b - n : b, res; n if (l > r) swap(l, r), swap(a, b); n Data tmp = query(1, l, r); n if (a <= n && b <= n) res = tmp.p1; n if (a <= n && b > n) res = tmp.p2; n if (a > n && b <= n) res = tmp.p3; n if (a > n && b > n) res = tmp.p4; n if (res < 1e8) n printf( %d n , res - 1); n else n printf( -1 n ); n } n return 0; n } n "} {"func_code_string": "#include n using namespace std; n int main() { n long long t, x, y, a, b; n scanf( %lld , &t); n while (t--) { n scanf( %lld %lld %lld %lld , &x, &y, &a, &b); n bool yes = false; n int i = 0; n int tens = 1000000; n while (x <= y) { n if (x == y) { n yes = true; n break; n } n while (x + a * tens > y - b * tens && tens > 1) tens /= 10; n x += tens * a; n y -= tens * b; n i += tens; n } n printf( %d n , yes ? i : -1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 rnd(228); n const int N = 404; n int mod; n int fact[N], d0[N], d[N], d2[N][N]; n int main() { n int qq; n cin >> qq >> mod; n fact[0] = 1; n for (int i = 1; i < N; ++i) fact[i] = (1LL * fact[i - 1] * i) % mod; n d[1] = 1; n d0[1] = 1; n for (int n = 2; n < N; ++n) { n d0[n] = fact[n]; n for (int k = 1; k < n; ++k) n d0[n] = (d0[n] - 1LL * d0[k] * fact[n - k]) % mod; n if (d0[n] < 0) d0[n] += mod; n } n d2[0][0] = 1; n for (int n = 1; n < N; ++n) { n d2[n][1] = fact[n]; n for (int k = 2; k <= n; ++k) n for (int x = 1; x < n; ++x) n d2[n][k] = (d2[n][k] + 1LL * fact[x] * d2[n - x][k - 1]) % mod; n } n for (int n = 2; n < N; ++n) { n int dz = 0; n for (int x = 1; x < n - 1; ++x) n for (int y = x; y < n - 1; ++y) { n int c = fact[y - x + 1]; n c = (1LL * c * d0[x]) % mod; n c = (1LL * c * d0[n - y - 1]) % mod; n dz += c; n if (dz >= mod) dz -= mod; n } n dz = (dz * 2) % mod; n int cd = fact[n]; n cd = (cd - dz + mod) % mod; n for (int k = 3; k < n; ++k) { n cd = (cd - 1LL * d2[n][k] * d[k]) % mod; n } n if (n != 2) { n for (int x = 1; x < n; ++x) cd = (cd - 1LL * d0[x] * d0[n - x]) % mod; n for (int x = 1; x < n; ++x) cd = (cd - 1LL * d0[x] * d0[n - x]) % mod; n } n cd = (cd + mod) % mod; n d[n] = cd; n } n while (qq--) { n int x; n cin >> x; n cout << d[x] << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2020; n vector > edges; n vector g[N]; n vector back_edge[N]; n bool global; n int num[N], low[N], low2[N], cnt, pai[N], pw[N], aux[N], prev_pai[N], n prev_pw[N], sobe[N], prev_sobe[N]; n int edg_used, edg_u, edg_v, edg_w; n void dfs(int u) { n num[u] = low[u] = ++cnt; n bool flag = false; n for (auto w : g[u]) { n int x, v, p; n tie(x, v, p) = edges[w]; n if (v == u) swap(v, x); n if (edg_used == w) continue; n if (!num[v]) { n pai[v] = u; n pw[v] = p; n sobe[v] = w; n dfs(v); n low[u] = min(low[u], low[v]); n } else if (flag or pai[u] != v) { n low[u] = min(low[u], num[v]); n if (!global and num[u] > num[v]) back_edge[u].push_back(w); n } else if (pai[u] == v) n flag = true; n } n } n int main(void) { n int n, m; n scanf( %d %d , &n, &m); n int s, t; n scanf( %d %d , &s, &t); n for (int i = 0; i < m; i++) { n int u, v, w; n scanf( %d %d %d , &u, &v, &w); n g[u].push_back(i); n g[v].push_back(i); n edges.emplace_back(u, v, w); n } n edg_used = -1; n dfs(s); n global = true; n int S = s; n if (!low[t]) { n printf( 0 n0 n ); n return 0; n } n int ans = 0x3f3f3f3f; n int edg; n int v = t; n while (v != s) { n int u = pai[v]; n if (low[v] > num[u]) { n if (pw[v] < ans) edg = sobe[v]; n ans = min(ans, pw[v]); n } n v = u; n } n int dupla = INT_MAX; n int x, y; n for (int i = 1; i <= n; i++) { n if (back_edge[i].empty()) continue; n int k = 0, ans = 0x3f3f3f3f; n for (int j = 0; j < back_edge[i].size(); j++) { n int e = back_edge[i][j]; n int x, v, p; n tie(x, v, p) = edges[e]; n if (v == i) swap(v, x); n if (num[v] < ans) k = j; n } n vector c[5]; n cnt = 0; n for (int j = 1; j <= n; j++) { n c[0].push_back(num[j]); n c[1].push_back(low[j]); n c[2].push_back(pai[j]); n c[3].push_back(pw[j]); n c[4].push_back(sobe[j]); n num[j] = low[j] = 0; n } n tie(edg_u, edg_v, edg_w) = edges[back_edge[i][k]]; n edg_used = back_edge[i][k]; n dfs(s); n ans = 0x3f3f3f3f; n int v = t, edg; n while (v != s) { n int u = pai[v]; n if (low[v] > num[u]) { n if (pw[v] < ans) edg = sobe[v]; n ans = min(ans, pw[v]); n } n v = u; n } n if (ans != 0x3f3f3f3f and ans + edg_w < dupla) { n dupla = ans + edg_w; n x = back_edge[i][k]; n y = edg; n } n for (int j = 1; j <= n; j++) { n num[j] = c[0][j - 1]; n low[j] = c[1][j - 1]; n pai[j] = c[2][j - 1]; n pw[j] = c[3][j - 1]; n sobe[j] = c[4][j - 1]; n } n } n for (int i = 1; i <= n; i++) { n prev_pai[i] = pai[i]; n prev_pw[i] = pw[i]; n prev_sobe[i] = sobe[i]; n } n for (int i = 1; i <= n; i++) { n if (i == s) continue; n cnt = 0; n for (int j = 1; j <= n; j++) num[j] = low[j] = 0; n tie(edg_u, edg_v, edg_w) = edges[prev_sobe[i]]; n edg_used = prev_sobe[i]; n dfs(s); n if (!low[t]) continue; n int ans = 0x3f3f3f3f, v = t, edg; n while (v != s) { n int u = pai[v]; n if (low[v] > num[u]) { n if (pw[v] < ans) edg = sobe[v]; n ans = min(ans, pw[v]); n } n v = u; n } n if (ans != 0x3f3f3f3f and ans + edg_w < dupla) { n dupla = ans + edg_w; n x = prev_sobe[i]; n y = edg; n } n } n if (ans == 0x3f3f3f3f and dupla == INT_MAX) { n printf( -1 n ); n } else if (ans < dupla and ans != 0x3f3f3f3f) n printf( %d n1 n%d n , ans, edg + 1); n else n printf( %d n2 n%d %d n , dupla, x + 1, y + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int i, j, k; n j = (n * 2) - 1; n cout << j << n << 2 ; n cout << endl << 1 2 ; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 5; n vector > adj[N]; n int ans[N]; n int off[N]; n int lvl[N], anc[N][25]; n int n, a, b, k; n void dfs(int u = 0, int par = 0, int l = 0) { n lvl[u] = l; n anc[u][0] = par; n for (auto nxt : adj[u]) n if (nxt.first != par) dfs(nxt.first, u, l + 1); n } n void buildLCA() { n int lg = ceil(log2(n)); n for (int j = 1; j < lg; j++) n for (int i = 0; i < n; i++) anc[i][j] = anc[anc[i][j - 1]][j - 1]; n } n int LCA(int i, int j) { n int lg = ceil(log2(n)); n int st = lg; n if (lvl[i] > lvl[j]) swap(i, j); n int cur = lvl[j]; n for (; st >= 0; st--) n if (cur - (1 << st) >= lvl[i]) cur -= (1 << st), j = anc[j][st]; n if (i == j) return 2 * i - j; n cur = lvl[i]; n for (st = lg; st >= 0; st--) n if (anc[i][st] != anc[j][st]) n cur -= (1 << st), i = anc[i][st], j = anc[j][st]; n return anc[i][0]; n } n int solve(int u = 0, int par = 0) { n int cnt = off[u]; n for (auto nxt : adj[u]) { n if (par == nxt.first) continue; n int x = solve(nxt.first, u); n ans[nxt.second] = x; n cnt += x; n } n return cnt; n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n - 1; i++) { n scanf( %d%d , &a, &b); n a--, b--; n adj[a].push_back({b, i}); n adj[b].push_back({a, i}); n } n dfs(); n buildLCA(); n scanf( %d , &k); n for (int i = 0; i < k; i++) { n scanf( %d%d , &a, &b); n a--, b--; n off[a]++, off[b]++; n off[LCA(a, b)] -= 2; n } n solve(); n for (int i = 0; i < n - 1; i++) printf( %d%c , ans[i], n [i == n - 2]); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n using namespace std; n struct Point { n int x, y, type, index; n } num[20005]; n int ans[10005]; n Point c; n bool cmp(Point a, Point b) { n return (a.x - c.x) * (b.y - c.y) - (a.y - c.y) * (b.x - c.x) > 0; n } n bool cmp2(Point a, Point b) { return (a.x < b.x) || (a.x == b.x && a.y < b.y); } n void f(int l, int r) { n if (l >= r) return; n int i; n swap(num[l], num[min_element(num + l, num + r + 1, cmp2) - num]); n for (i = l + 1; i <= r; i++) { n num[i].x -= num[l].x; n num[i].y -= num[l].y; n } n num[l].x = num[l].y = 0; n c = num[l]; n sort(num + l + 1, num + r + 1, cmp); n int pre = num[l].type, minv = 1000000000, id = -1; n for (i = l + 1; i <= r; i++) { n pre += num[i].type; n if (!pre && num[i].type != num[l].type && max(i - l - 1, r - i) < minv) { n minv = max(i - l - 1, r - i); n id = i; n } n } n if (num[l].type == 1) n ans[num[id].index] = num[l].index; n else n ans[num[l].index] = num[id].index; n f(l + 1, id - 1); n f(id + 1, r); n } n int main() { n int i, n; n scanf( %d , &n); n for (i = 0; i < n; i++) { n scanf( %d%d , &num[i].x, &num[i].y); n num[i].type = -1; n num[i].index = i + 1; n } n for (i = 0; i < n; i++) { n scanf( %d%d , &num[n + i].x, &num[n + i].y); n num[n + i].type = 1; n num[n + i].index = i + 1; n } n f(0, 2 * n - 1); n for (i = 1; i <= n; i++) printf( %d n , ans[i]); n } n "} +{"func_code_string": "#include n using namespace std; n const int mn = 201000, inf = 1 << 30; n struct node { n int x, y; n } pt[mn], sub[mn]; n struct point { n int k, x, y, r; n } e[mn * 2]; n int s1[mn * 2], s2[mn * 2]; n int xs[mn * 2], dis[mn], sa[mn], L; n int n, m, i, j, step, lo, hi, mid; n bool cmp(node a, node b) { return a.x < b.x || (a.x == b.x && a.y < b.y); } n bool cmp1(point a, point b) { return a.x < b.x || (a.x == b.x && a.k < b.k); } n bool subway(int i, int j) { return dis[i] > dis[j]; } n struct tree { n int tt, rt[mn], s[mn * 20], le[mn * 20], ri[mn * 20]; n int get(const int &p, int l, int r, int x, int y) { n if (x <= l && y >= r) return s[p]; n int m = (l + r) / 2, res = 0; n if (x <= m) res += get(le[p], l, m, x, y); n if (y > m) res += get(ri[p], m + 1, r, x, y); n return res; n } n void add(const int &t, int &p, int l, int r, int k) { n s[p = ++tt] = s[t] + 1; n if (l == r) return; n int m = (l + r) / 2; n if (k <= m) n add(le[t], le[p], l, m, k), ri[p] = ri[t]; n else n add(ri[t], ri[p], m + 1, r, k), le[p] = le[t]; n } n void ins(int i, int v) { add(rt[i - 1], rt[i], 1, L, v); } n int query(int x, int y, int l, int r) { n if (x > y || l > r || x > m) return 0; n return get(rt[y], 1, L, l, r) - get(rt[x - 1], 1, L, l, r); n } n } T; n point eva(int k, int x, int y, int r) { n point res; n res.k = k, res.x = x, res.y = y, res.r = r; n return res; n } n void cross(int &l, int &r, int &x, int &y, int i, int t) { n l = max(l, pt[i].x - t), x = max(x, pt[i].y - t); n r = min(r, pt[i].x + t), y = min(y, pt[i].y + t); n } n void add(int *s, int p, int v) { n for (; p <= L; p += p & (-p)) s[p] = max(s[p], v); n } n int query(int *s, int p) { n int res = -inf; n for (; p; p -= p & (-p)) res = max(res, s[p]); n return res; n } n void get(point p) { n int y = lower_bound(xs + 1, xs + 1 + L, p.y) - xs; n if (p.k == 0) n add(s1, y, p.x + p.y), add(s2, L - y + 1, p.x - p.y); n else { n int t1 = p.x + p.y - query(s1, y), t2 = p.x - p.y - query(s2, L - y + 1); n dis[p.r] = min(dis[p.r], min(t1, t2)); n } n } n void ugly(node &p) { n int X = p.x - p.y, Y = p.x + p.y; n p.x = X, p.y = Y; n } n void nearest() { n int i, tt = 0; n for (i = 1; i <= n; ++i) xs[++L] = pt[i].y; n for (i = 1; i <= m; ++i) xs[++L] = sub[i].y; n sort(xs + 1, xs + 1 + L); n L = unique(xs + 1, xs + 1 + L) - xs - 1; n for (i = 1; i <= n; ++i) e[++tt] = eva(1, pt[i].x, pt[i].y, i); n for (i = 1; i <= m; ++i) e[++tt] = eva(0, sub[i].x, sub[i].y, i); n sort(e + 1, e + 1 + tt, cmp1); n fill(dis + 1, dis + 1 + n, inf); n fill(s1 + 1, s1 + L + 1, -inf), fill(s2 + 1, s2 + 1 + L, -inf); n for (i = 1; i <= tt; ++i) get(e[i]); n for (i = 1; i <= tt; ++i) e[i].x = -e[i].x; n sort(e + 1, e + 1 + tt, cmp1); n fill(s1 + 1, s1 + L + 1, -inf), fill(s2 + 1, s2 + 1 + L, -inf); n for (i = 1; i <= tt; ++i) get(e[i]); n } n int main() { n scanf( %d%d , &n, &m); n for (i = 1; i <= n; ++i) scanf( %d%d , &pt[i].x, &pt[i].y); n for (i = 1; i <= m; ++i) scanf( %d%d , &sub[i].x, &sub[i].y); n nearest(); n for (i = 1; i <= n; ++i) ugly(pt[i]); n for (i = 1; i <= m; ++i) ugly(sub[i]); n sort(sub + 1, sub + 1 + m, cmp); n L = 0; n for (i = 1; i <= n; ++i) xs[++L] = pt[i].y; n for (i = 1; i <= m; ++i) xs[++L] = sub[i].y; n sort(xs + 1, xs + 1 + L), L = unique(xs + 1, xs + 1 + L) - xs - 1; n for (i = 1; i <= m; ++i) n T.ins(i, lower_bound(xs + 1, xs + 1 + L, sub[i].y) - xs); n for (i = 1; i <= n; ++i) sa[i] = i; n sort(sa + 1, sa + 1 + n, subway); n lo = 0, hi = dis[sa[1]]; n int mix, mxx, miy, mxy, ct, l, r, x, y; n node su; n while (lo < hi) { n int mid = (lo + hi) / 2; n mix = miy = -inf, mxx = mxy = inf; n for (i = 1; i <= n; ++i) { n if (dis[sa[i]] > mid) n cross(mix, mxx, miy, mxy, sa[i], mid); n else { n ct = mid - dis[sa[i]]; n su.y = -inf, su.x = mix - ct; n l = lower_bound(sub + 1, sub + 1 + m, su, cmp) - sub; n su.y = inf, su.x = mxx + ct; n r = lower_bound(sub + 1, sub + 1 + m, su, cmp) - sub - 1; n x = lower_bound(xs + 1, xs + 1 + L, miy - ct) - xs, n y = lower_bound(xs + 1, xs + 1 + L, mxy + ct + 1) - xs - 1; n if (T.query(l, r, x, y)) n break; n else n cross(mix, mxx, miy, mxy, sa[i], mid); n } n if (mix > mxx || miy > mxy) break; n } n if (mix <= mxx && miy <= mxy) n hi = mid; n else n lo = mid + 1; n } n printf( %d n , lo); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void smin(T &a, U b) { n if (a > b) a = b; n } n template n inline void smax(T &a, U b) { n if (a < b) a = b; n } n inline void gn(long long &first) { n int sg = 1; n char c; n while (((c = getchar()) < 0 || c > 9 ) && c != - ) n ; n c == - ? (sg = -1, first = 0) : (first = c - 0 ); n while ((c = getchar()) >= 0 && c <= 9 ) first = first * 10 + c - 0 ; n first *= sg; n } n inline void gn(int &first) { n long long t; n gn(t); n first = t; n } n inline void gn(unsigned long long &first) { n long long t; n gn(t); n first = t; n } n inline void gn(double &first) { n double t; n scanf( %lf , &t); n first = t; n } n inline void gn(long double &first) { n double t; n scanf( %lf , &t); n first = t; n } n int power(int a, int b, int m, int ans = 1) { n for (; b; b >>= 1, a = 1LL * a * a % m) n if (b & 1) ans = 1LL * ans * a % m; n return ans; n } n int N, M, E, W; n int dis[101000]; n queue Q; n int pre[101000], edg[101000][3], cnt[101000], val[101000]; n map, int> state, flag; n vector adj[101000]; n int len = 0x3f3f3f3f, tot; n void Dijk(int s) { n memset(dis, 0x3f, sizeof(dis)); n Q.push(s); n dis[s] = 0; n cnt[s] = 0; n val[s] = W; n while (!Q.empty()) { n int u = Q.front(); n Q.pop(); n for (int i = 0; i < adj[u].size(); i++) { n int v = adj[u][i], k; n if (!state[pair(u, v)]) n k = val[u] + 1; n else n k = val[u] - 1; n if (dis[v] > dis[u] + 1) { n dis[v] = dis[u] + 1; n pre[v] = u; n val[v] = k; n Q.push(v); n } else if (dis[v] == dis[u] + 1 && val[v] > k) { n val[v] = k; n pre[v] = u; n Q.push(v); n } n } n } n } n int main() { n int u, v, w; n scanf( %d%d , &N, &M); n for (int i = 0; i < M; i++) { n scanf( %d%d%d , &u, &v, &w); n adj[u].push_back(v); n adj[v].push_back(u); n state[pair(u, v)] = w; n state[pair(v, u)] = w; n edg[i][0] = u; n edg[i][1] = v; n edg[i][2] = w; n W += w; n } n Dijk(1); n u = N; n while (u != 1) { n flag[pair(u, pre[u])] = 1; n flag[pair(pre[u], u)] = 1; n u = pre[u]; n } n tot = 0; n for (int i = 0; i < M; i++) { n u = edg[i][0]; n v = edg[i][1]; n w = edg[i][2]; n if (!flag[pair(u, v)] && w == 1) n tot++; n else if (flag[pair(u, v)] && w == 0) n tot++; n } n printf( %d n , tot); n for (int i = 0; i < M; i++) { n u = edg[i][0]; n v = edg[i][1]; n w = edg[i][2]; n if (!flag[pair(u, v)] && w == 1) { n printf( %d %d 0 n , u, v); n } else if (flag[pair(u, v)] && w == 0) { n printf( %d %d 1 n , u, v); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 35005; n struct Node { n int l, r; n int lazy; n int Max; n } node[maxn << 2]; n int n, k; n int a[maxn]; n int pre[maxn]; n int dp[maxn]; n void push_down(int root) { n node[root << 1].lazy += node[root].lazy; n node[root << 1 | 1].lazy += node[root].lazy; n node[root << 1].Max += node[root].lazy; n node[root << 1 | 1].Max += node[root].lazy; n node[root].lazy = false; n } n void push_up(int root) { n node[root].Max = max(node[root << 1].Max, node[root << 1 | 1].Max); n } n void build(int l, int r, int root) { n node[root].l = l, node[root].r = r; n node[root].lazy = 0; n if (l == r) { n node[root].Max = dp[l]; n return; n } n int mid = (l + r) >> 1; n build(l, mid, root << 1); n build(mid + 1, r, root << 1 | 1); n push_up(root); n } n void update(int l, int r, int root) { n if (node[root].l >= l && node[root].r <= r) { n node[root].lazy += 1; n node[root].Max += 1; n return; n } n if (node[root].lazy) push_down(root); n int mid = (node[root].l + node[root].r) >> 1; n if (l <= mid) update(l, r, root << 1); n if (r > mid) update(l, r, root << 1 | 1); n push_up(root); n } n int query(int l, int r, int root) { n if (node[root].l >= l && node[root].r <= r) { n return node[root].Max; n } n if (node[root].lazy) push_down(root); n int t1 = 0, t2 = 0; n int mid = (node[root].l + node[root].r) >> 1; n if (l <= mid) t1 = query(l, r, root << 1); n if (r > mid) t2 = query(l, r, root << 1 | 1); n push_up(root); n if (t1 > t2) return t1; n return t2; n } n int main() { n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n memset(dp, 0, sizeof(dp)); n for (int i = 1; i <= k; i++) { n build(0, n, 1); n for (int j = 0; j < maxn; j++) pre[j] = 0; n for (int j = 1; j <= n; j++) { n update(pre[a[j]], j - 1, 1); n pre[a[j]] = j; n dp[j] = query(0, j - 1, 1); n } n } n printf( %d n , dp[n]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void small(long long m, long long s) { n vector v; n long long p = (s % 9 == 0) ? s / 9 - 1 : s / 9; n for (long long i = 0; i < p; i++) { n v.push_back(9); n s -= 9; n } n if (m - p == 1) { n v.push_back(s); n } n if (m - p >= 2) { n s--; n v.push_back(s); n for (long long i = 0; i < m - p - 2; i++) { n v.push_back(0); n } n v.push_back(1); n } n for (long long i = v.size() - 1; i >= 0; i--) { n cout << v[i]; n } n cout << ; n } n void great(long long m, long long s) { n vector v; n long long k = s / 9; n for (long long i = 0; i < k; i++) { n v.push_back(9); n s -= 9; n } n if (s > 0) { n v.push_back(s); n k++; n } n for (long long i = 0; i < m - k; i++) { n v.push_back(0); n } n for (long long i = 0; i < v.size(); i++) { n cout << v[i]; n } n } n int main() { n long long m, s, h; n string k; n vector v; n cin >> m >> s; n if (s % 9 == 0) { n long long t = 0; n if (m == 1 && s == 0) { n cout << 0 n << 0 ; n t = 1; n } n if (t == 0) { n if (m < s / 9 || s == 0) { n cout << -1 n << -1 ; n } else { n small(m, s); n great(m, s); n } n } n } else if (s % 9 != 0) { n long long t = 0; n if (m == 1 && s == 0) { n cout << 0 n << 0 ; n t = 1; n } n if (t == 0) { n if (m < s / 9 + 1 || s == 0) { n cout << -1 n << -1 ; n } else { n small(m, s); n great(m, s); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int mod = 1e9 + 7; n long long int inf = 1e9 + 7; n void solve() { n long long int n; n cin >> n; n if (n <= 2) { n cout << -1 << endl; n } else { n long long int i; n for (i = n; i >= 1; i--) { n cout << i << ; n } n cout << endl; n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long int t = 1; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n string s, t; n cin >> s >> t; n int cost = 0; n for (int i = 0; i < n;) { n if (s[i] != t[i]) { n if (i + 1 < n && s[i] != s[i + 1] && s[i + 1] != t[i + 1]) { n i += 2; n } else { n i++; n } n cost++; n } else { n i++; n } n } n cout << cost << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long read() { n long long x = 0, f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = x * 10 + (ch ^ 48); n ch = getchar(); n } n return x * f; n } n const long long N = 100010; n struct edge { n long long v, nxt; n } e[N << 1]; n long long head[N], cnt, n, x, y, a[N], dp[N][2], f[N], g[N], h[N]; n inline void add(long long u, long long v) { n e[++cnt].v = v; n e[cnt].nxt = head[u]; n head[u] = cnt; n } n inline void dfs(long long u, long long fa) { n dp[u][0] = dp[u][1] = f[u] = g[u] = a[u]; n h[u] = 0; n for (long long i = head[u]; i; i = e[i].nxt) { n long long v = e[i].v; n if (v == fa) continue; n dfs(v, u); n dp[u][0] = max(dp[u][0], max(dp[v][0], dp[u][1] + dp[v][1])); n dp[u][0] = max(dp[u][0], max(f[u] + g[v], f[v] + g[u])); n dp[u][1] = max(dp[u][1], max(dp[v][1], f[u] + f[v])); n g[u] = max(g[u], a[u] + g[v]); n g[u] = max(g[u], max(f[u] + dp[v][1], f[v] + a[u] + h[u])); n h[u] = max(h[u], dp[v][1]); n f[u] = max(f[u], f[v] + a[u]); n } n } n inline void mian() { n n = read(); n for (long long i = 1; i <= n; ++i) a[i] = read(); n for (long long i = 1; i <= n - 1; ++i) { n x = read(); n y = read(); n add(x, y); n add(y, x); n } n dfs(1, 0); n printf( %lld n , dp[1][0]); n } n signed main() { n long long qwq = 1; n while (qwq--) mian(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n string s; n string t; n cin >> s >> t; n int ans = 1; n int last = INT_MIN; n vector v[26]; n int dp[2][26]; n for (int i = 0; i < s.length(); i++) { n v[s[i] - a ].push_back(i); n } n for (int i = 0; i < 26; i++) { n dp[0][i] = v[i].size(); n dp[1][i] = 0; n } n for (int i = 0; i < t.length(); i++) { n if (v[t[i] - a ].empty()) { n ans = -1; n break; n } else { n int temp = dp[1][t[i] - a ]; n vector::iterator lower, l; n l = v[t[i] - a ].begin() + temp; n lower = lower_bound(l, v[t[i] - a ].end(), last); n if (lower - v[t[i] - a ].begin() == dp[0][t[i] - a ]) { n ans++; n last = v[t[i] - a ][0]; n for (int j = 0; j < 26; j++) dp[1][j] = 0; n dp[1][t[i] - a ] = 1; n } else { n last = v[t[i] - a ][lower - v[t[i] - a ].begin()]; n dp[1][t[i] - a ] = lower - v[t[i] - a ].begin() + 1; n } n } n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s; n stack num; n stack fuhao; n vector pos; n void calc() { n char cc = fuhao.top(); n fuhao.pop(); n long long a = num.top(); n num.pop(); n long long b = num.top(); n num.pop(); n long long ans; n if (cc == * ) n ans = a * b; n else n ans = a + b; n num.push(ans); n } n long long solve(string p) { n int len = p.length(); n for (int i = 0; i < len; i++) { n if (p[i] >= 0 && p[i] <= 9 ) { n num.push(p[i] - 0 ); n } else if (p[i] == ( ) { n fuhao.push(p[i]); n } else if (p[i] == ) ) { n while (fuhao.top() != ( ) calc(); n fuhao.pop(); n } else if (p[i] == * ) { n fuhao.push(p[i]); n } else if (p[i] == + ) { n while (!fuhao.empty() && fuhao.top() == * ) { n calc(); n } n fuhao.push(p[i]); n } n } n while (!fuhao.empty()) calc(); n long long ans = num.top(); n return ans; n } n int main() { n cin >> s; n int len = s.length(); n pos.push_back(-1); n for (int i = 1; i < len; i += 2) n if (s[i] == * ) pos.push_back(i); n pos.push_back(len); n long long ans = 0; n for (int i = 0; i < pos.size() - 1; i++) { n for (int j = i + 1; j < pos.size(); j++) { n string temp = s; n temp.insert(pos[i] + 1, 1, ( ); n temp.insert(pos[j] + 1, 1, ) ); n ans = max(ans, solve(temp)); n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dx[4] = {1, 0, -1, 0}; n int dy[4] = {0, 1, 0, -1}; n long long n, m, k; n long long arr[300001]; n long long arr2[300001]; n int main() { n std::ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n cin.ignore(); n for (int test_case = 0; test_case < t; ++test_case) { n int flg = 0; n long long ans1 = 0, ans2 = 0; n string ans[3] = { NO , YES , R }; n string s1, s2 = ; n cin >> n >> k; n for (int i = 0; i < n; ++i) { n cin >> arr[i]; n } n int i; n long long mn = 10000000000; n long long mx = 0; n for (i = 0; i < n; ++i) { n if (mn < arr[i]) { n if (mn != 10000000000) { n ans1 += mx - mn; n mx = 0; n mn = 10000000000; n } n } n mx = max(mx, arr[i]); n mn = min(mn, arr[i]); n } n ans1 += mx; n cout << ans1; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = int(1e6 + 3); n vector > v; n char second[600000]; n int n, m; n int main() { n scanf( %d%d n , &n, &m); n v.resize(n); n for (int i = 0; i < n; ++i) { n gets(second); n v[i].resize(m); n for (int j = 0; j < m; ++j) { n v[i][j] = (second[j] == . ) ? -1 : second[j] - 0 ; n } n } n int res = 1; n for (int i = 0; i < n; ++i) { n int dir = -1; n for (int j = 0; j < m; ++j) n if (v[i][j] != -1) { n dir = (v[i][j] > 2) ? 1 : 0; n if (j & 1) dir = 1 - dir; n break; n } n if (dir != -1) { n for (int j = 0; j < m; ++j) n if (v[i][j] != -1) { n int d2 = (v[i][j] > 2) ? 1 : 0; n if (j & 1) d2 = 1 - d2; n if (dir != d2) res = 0; n } n } else if (dir == -1) n res = (res * 2) % mod; n } n for (int j = 0; j < m; ++j) { n int dir = -1; n for (int i = 0; i < n; ++i) n if (v[i][j] != -1) { n dir = (v[i][j] > 1 && v[i][j] < 4) ? 1 : 0; n if (i & 1) dir = 1 - dir; n break; n } n if (dir != -1) { n for (int i = 0; i < n; ++i) n if (v[i][j] != -1) { n int d2 = (v[i][j] > 1 && v[i][j] < 4) ? 1 : 0; n if (i & 1) d2 = 1 - d2; n if (dir != d2) res = 0; n } n } else if (dir == -1) n res = (res * 2) % mod; n } n printf( %d n , res); n return 0; n } n "} +{"func_code_string": "#include n const int maxn = 1e5 + 5; n using namespace std; n int a[maxn]; n int vis[maxn]; n int step[maxn * 2]; n int main() { n int n; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n int temp = a[i]; n int step1 = 0, step2 = 0, step3 = 0; n while (temp < maxn) { n step1++; n vis[temp]++; n temp = temp << 1; n step[temp] += step1; n } n while (a[i] >= 1) { n if (a[i] & 1 && a[i] != 1) { n int temp1 = a[i] = a[i] >> 1; n step2++; n step3 = step2; n vis[temp1]++; n step[temp1] += step3; n while (temp1 < maxn) { n step3++; n temp1 = temp1 << 1; n vis[temp1]++; n step[temp1] += step3; n } n } else { n step2++; n a[i] = a[i] >> 1; n vis[a[i]]++; n step[a[i]] += step2; n } n } n } n int ans = 1e9; n for (int i = 1; i < maxn; i++) { n if (vis[i] == n) { n ans = min(step[i], ans); n } n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void __f(const char* name, Arg1&& arg1) { n cerr << name << : << arg1 << std::endl; n } n template n void __f(const char* names, Arg1&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n cerr.write(names, comma - names) << : << arg1 << | ; n __f(comma + 1, args...); n } n const int mod = int(1e9) + 7; n const int N = int(1e6) + 7; n long long int two[N]; n void pre() { n two[0] = 1; n for (int i = (int)1; i < (int)N; i++) { n two[i] = (two[i - 1] * 2) % mod; n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n pre(); n string s; n cin >> s; n int cnt = 0; n long long int ans = 0; n for (int i = (int)0; i < (int)(int)(s.size()); i++) { n if (s[i] == b ) { n ans = (ans + (two[cnt] - 1)) % mod; n continue; n } n cnt++; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = n 3.14159265358979323846264338327950288419716939937510582097494459230; n void swaps(char *x, char *y) { n char temp; n temp = *x; n *x = *y; n *y = temp; n } n void swapi(int *a, int *b) { n int temp; n temp = *a; n *a = *b; n *b = temp; n } n unsigned long long gcd(unsigned long long a, unsigned long long b) { n if (a == 0) return b; n if (b == 0) return a; n if (a == 1 || b == 1) return 1; n if (a == b) return a; n if (a > b) n return gcd(b, a % b); n else n return gcd(a, b % a); n } n long long Tree[4000010]; n int V[4000010]; n int N; n int Time; n int Outtime[4000010]; n int Intime[4000010]; n int Lvl[4000010]; n int maxval; n bool vis[4000010]; n std::vector > Edge(2000010); n void Add(int idx, int val) { n for (int i = idx; i <= maxval; i += (i & -i)) Tree[i] += val; n } n long long Query(int idx) { n long long S = 0; n for (int i = idx; i > 0; i -= (i & -i)) S += Tree[i]; n return S; n } n void dfs(int idx) { n vis[idx] = true; n Intime[idx] = ++Time; n vis[idx] = true; n for (int i = 0; i < Edge[idx].size(); i++) { n if (vis[Edge[idx][i]]) continue; n Lvl[Edge[idx][i]] = Lvl[idx] + 1; n dfs(Edge[idx][i]); n } n Outtime[idx] = ++Time; n } n int main() { n int Cases = 1; n for (int Case = 0; Case < Cases; Case++) { n int u, v, opt, node, Q; n cin >> N >> Q; n for (int i = 1; i <= N; i++) cin >> V[i]; n for (int i = 0; i < N - 1; i++) { n cin >> u >> v; n Edge[u].push_back(v); n Edge[v].push_back(u); n } n dfs(1); n maxval = Outtime[1]; n for (int i = 0; i < Q; i++) { n cin >> opt; n opt -= 1; n if (opt == 0) { n cin >> node >> v; n if (Lvl[node] % 2) { n Add(Intime[node], -v); n Add(Outtime[node], v); n } else { n Add(Intime[node], v); n Add(Outtime[node], -v); n } n } else { n cin >> node; n if (Lvl[node] % 2) n cout << V[node] - Query(Intime[node]) << endl; n else n cout << V[node] + Query(Intime[node]) << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n long long int binpow(long long int a, long long int b) { n if (b == 0) return 1; n long long int res = binpow(a, b / 2); n if (b % 2) n return res * res * a; n else n return res * res; n } n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n vector v(n, 0); n for (int i = 0; i < v.size(); i++) cin >> v[i]; n sort(v.begin(), v.end(), greater()); n for (int i = 0; i < n; i++) cout << v[i] << ; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long LLINF = 1e18; n const int INF = 1e9; n const int MOD = 20101009; n const int HMOD = 999959; n const int VMOD = 5000000; n const int MAXN = 1e5 + 10; n const int MAXM = 5e5 + 10; n const int INV = 10050505; n const long long LLINV = 1e18; n const double eps = 1e-3; n int dirx[5] = {0, -1, 1, 0, 0}, diry[5] = {0, 0, 0, -1, 1}; n int n, d, m; n int cnt1, cnt2; n long long a[MAXN], b[MAXN]; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n ; n scanf( %d%d%d , &n, &d, &m); n for (int i = 1, x; i <= n; ++i) { n scanf( %d , &x); n if (x <= m) n a[++cnt1] = x; n else n b[++cnt2] = x; n } n sort(a + 1, a + 1 + cnt1, greater()); n sort(b + 1, b + 1 + cnt2, greater()); n if (cnt2 == 0) { n long long sum = 0; n for (int i = 1; i <= n; ++i) sum += a[i]; n printf( %lld n , sum); n return 0; n } n for (int i = 1; i <= cnt1; ++i) a[i] = a[i - 1] + a[i]; n for (int i = 1; i <= cnt2; ++i) b[i] = b[i - 1] + b[i]; n long long ans = 0; n for (int i = 1; i <= cnt2; ++i) { n long long tmp = (long long)(i - 1) * d; n long long oth = n - i; n long long ned = cnt1 - (max(0LL, tmp - (cnt2 - i))); n if (oth >= tmp) ans = max(ans, b[i] + a[ned]); n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int h, m; n char c; n cin >> h >> c >> m; n while (1 > 0) { n m++; n h += (m / 60); n m %= 60; n h %= 24; n if (h / 10 == m % 10 && h % 10 == m / 10) break; n } n cout << h / 10 << h % 10 << : << m / 10 << m % 10; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, q; n int tt; n int ss = n + m; n int fa[400005]; n bool vis[500005]; n int ans; n int find(int x) { n if (fa[x] == x) return x; n return fa[x] = find(fa[x]); n } n int main() { n scanf( %d%d%d , &n, &m, &q); n for (int i = 1; i <= n + m; i++) { n fa[i] = i; n } n for (int i = 1; i <= q; i++) { n int x, y; n scanf( %d%d , &x, &y); n fa[find(x)] = find(n + y); n } n for (int i = 1; i <= n + m; i++) { n if (!vis[find(i)]) { n vis[fa[i]] = 1; n ans++; n } n } n cout << ans - 1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n long long ans = 0; n for (int i = (0); i < (n); ++i) { n long long t, T, x, cost; n cin >> t >> T >> x >> cost; n if (t >= T) { n ans += cost + m * x; n continue; n } n long long aux1 = cost; n if (m > (T - t)) aux1 += m * x; n long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1; n aux2 *= cost; n ans += min(aux1, aux2); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long modulo(long long base, long long exponent, long long modulus); n long long choose(long long n, long long k); n long long inverse(long long a, long long m); n void build(); n void fileio(); n long long ncr(long long n, long long r); n const int nax = 1e6 + 10; n const int LG = log2(nax) + 1; n vector fact(nax); n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n string s; n cin >> s; n long long ans = n; n for (long long i = 0; i < n; i++) { n if (s[i] == 1 ) { n ans = max(ans, 2 * (i + 1)); n ans = max(ans, 2 * (n - i)); n } n } n cout << ans << n ; n } n return 0; n } n long long ncr(long long n, long long r) { n if (r > n || r < 0 || n < 0) return 0; n long long ans = fact[n]; n long long temp = (fact[n - r] * fact[r]) % 1000000007; n ans = (ans * inverse(temp, 1000000007)) % 1000000007; n return ans; n } n void fileio() { n freopen( input.txt , r , stdin); n freopen( output.txt , w , stdout); n } n void build() { n fact[0] = 1; n for (long long i = 1; i < nax; i++) fact[i] = (fact[i - 1] * i) % 1000000007; n } n long long modulo(long long base, long long exponent, long long modulus) { n if (modulus == 1) return 0; n long long result = 1; n base = base % modulus; n while (exponent > 0) { n if (exponent % 2 == 1) { n result = (result * base) % modulus; n } n exponent = exponent >> 1; n base = (base * base) % modulus; n } n return result; n } n long long choose(long long n, long long k) { n if (k == 0) return 1; n return (n * choose(n - 1, k - 1)) / k; n } n void EE(long long a, long long b, long long &co1, long long &co2) { n if (a % b == 0) { n co1 = 0; n co2 = 1; n return; n } n EE(b, a % b, co1, co2); n long long temp = co1; n co1 = co2; n co2 = temp - co2 * (a / b); n } n long long inverse(long long a, long long m) { n long long x, y; n EE(a, m, x, y); n if (x < 0) x += m; n return x; n } n "} +{"func_code_string": "#include n using namespace std; n void fastio() { n cin.tie(nullptr); n cin.sync_with_stdio(false); n } n using LL = long long; n using LD = long double; n const LL MOD = 1e9 + 7; n const LL INF = LLONG_MAX; n const LL N = 2e5 + 1; n int main() { n fastio(); n LL n; n cin >> n; n vector a(n); n for (auto &e : a) { n cin >> e; n } n vector ans(n, 0); n sort(a.begin(), a.end(), greater()); n LL p = 0; n for (LL i = 0; i < n; i += 2) { n ans[i] = a[p++]; n } n for (LL i = 0; i < n; ++i) { n if (ans[i] == 0) { n ans[i] = a[p++]; n } n } n cout << (n - 1) / 2 << n ; n for (auto &e : ans) { n cout << e << ; n } n cout << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int q, n, sum, a; n cin >> q; n while (q--) { n sum = 0; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a; n sum += a; n } n cout << (sum + n - 1) / n << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5000 + 20; n const int maxn = 1e5 + 20; n const int mod = 998244353; n int cnt, head[maxn], pos[maxn]; n long long ksm(long long a, long long b) { n long long res = 1; n while (b) { n if (b & 1) res = (res * a) % mod; n b >>= 1, a = a * a % mod; n } n return res % mod; n } n void read(int &v) { n int k = 1; n v = 0; n int c = getchar(); n while (c < 0 || c > 9 ) { n if (c == - ) k = 0; n c = getchar(); n } n while (c >= 0 && c <= 9 ) n v = (v << 3) + (v << 1) + (c - 48), c = getchar(); n if (k == 0) v = -v; n } n int d[maxn], dp[maxn], a[maxn], same[maxn]; n int main() { n int n, q; n read(n), read(q); n for (int i = 1; i <= n; i++) { n read(a[i]); n if (a[i] == a[i - 1]) same[i] = same[i - 1] + 1; n if (a[i] >= a[i - 1]) n d[i] = 0; n else n d[i] = 1; n } n dp[0] = 0; n for (int i = 1; i <= n; i++) dp[i] = dp[i - 1] + d[i]; n while (q--) { n int l, r; n read(l), read(r); n if (dp[r] - dp[l] == 0) n puts( Yes ); n else if (dp[r] - dp[l] == r - l) n puts( Yes ); n else { n int x = dp[r] - dp[l]; n r = r - same[r]; n if (dp[r] - dp[r - x] == x) n puts( Yes ); n else n puts( No ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int query(int x, int y) { n if (x == -1) return 0; n cout << 1 << << x << << y << endl; n string ret; n cin >> ret; n return ( TAK == ret); n } n int get(int l, int r) { n if (l > r) return -1; n while (l < r) { n int m = (l + r) >> 1; n if (query(m, m + 1)) { n r = m; n } else { n l = m + 1; n } n } n return l; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int n, k; n cin >> n >> k; n int x = get(1, n); n int y = get(1, x - 1); n if (!query(y, x)) y = get(x + 1, n); n cout << 2 << << x << << y << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, d, done[300005] = {0}; n vector graph[300005]; n map, int> edge; n set p; n void go() { n queue > q; n for (auto it : p) q.push({it, 0}); n while (!q.empty()) { n int x = q.front().first, P = q.front().second; n q.pop(); n if (done[x]) continue; n done[x] = 1; n for (auto it : graph[x]) { n if (done[it] && it != P) n printf( %d , edge[{min(x, it), max(x, it)}]); n else if (it != P) n q.push({it, x}); n } n } n } n int main() { n scanf( %d , &n); n scanf( %d , &k); n scanf( %d , &d); n for (__typeof(k) i = 0 - (0 > k); i != k - (0 > k); i += 1 - 2 * (0 > k)) { n int x; n scanf( %d , &x); n p.insert(x); n } n for (__typeof(n - 1) i = 0 - (0 > n - 1); i != n - 1 - (0 > n - 1); n i += 1 - 2 * (0 > n - 1)) { n int u, v; n scanf( %d , &u); n scanf( %d , &v); n graph[u].push_back(v); n graph[v].push_back(u); n edge[{min(u, v), max(u, v)}] = i + 1; n } n printf( %d n , (int)p.size() - 1); n go(); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n const int N = 88; n const int M = 100100; n int dp[N][M][2]; n pair a[N]; n int n, m; n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < n; i++) scanf( %d%d , &a[i].first, &a[i].second); n sort(a, a + n); n for (int i = 0; i <= n; i++) n for (int j = 0; j <= m; j++) n for (int f = 0; f < 2; f++) dp[i][j][f] = M; n dp[0][0][1] = 0; n for (int i = 0; i < n; i++) { n for (int x = 0; x <= m; x++) n dp[i + 1][x][0] = min(dp[i + 1][x][0], min(dp[i][x][0], dp[i][x][1])); n for (int x = 0; x <= m; x++) { n int r = a[i].first - x - 1; n r = max(r, x - a[i].first); n r = max(r, a[i].second); n int y = min(m, a[i].first + r); n dp[i + 1][y][1] = n min(dp[i + 1][y][1], min(dp[i][x][0], dp[i][x][1]) + r - a[i].second); n } n for (int x = 1; x <= m; x++) n dp[i + 1][x][1] = min(dp[i + 1][x][1], dp[i + 1][x - 1][1] + 1); n } n printf( %d n , min(dp[n][m][0], dp[n][m][1])); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[200010]; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n sort(a + 1, a + n + 1); n int p = 2e9 + 7, ans = 0; n for (int i = 1; i < n; i++) p = min(p, a[i + 1] - a[i]); n for (int i = 1; i < n; i++) ans += (a[i + 1] - a[i] == p); n return printf( %d %d , p, ans), 0; n } n "} +{"func_code_string": "#include n const long long mod = 1000000007; n const long long Inf = 1e9; n using namespace std; n bool valid(string s) { n for (int i = 0; i < s.length(); ++i) { n if (s[i] == || s[i] == # ) { n if (s[i] == # ) return true; n } else n return false; n } n return false; n } n string wtSpace(string s) { n string res = ; n for (int i = 0; i < s.length(); ++i) { n if (s[i] != ) res += s[i]; n } n return res; n } n int main() { n int n, a, d; n scanf( %d %d %d , &n, &a, &d); n vector ans(n); n for (int i = 0; i < n; i++) { n int t, v; n scanf( %d %d , &t, &v); n double time = pow(2 * d / (double)a, 0.5); n double time2 = v / (double)a; n if (time <= time2) n ans[i] = t + time; n else { n double x = a * pow(time2, 2) / 2.0; n ans[i] = t + time2 + (d - x) / (double)v; n } n } n for (int i = 0; i < n - 1; i++) { n if (ans[i + 1] < ans[i]) ans[i + 1] = ans[i]; n printf( %.6f n , ans[i]); n } n printf( %.6f n , ans[n - 1]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void smin(T &a, U b) { n if (a > b) a = b; n } n template n inline void smax(T &a, U b) { n if (a < b) a = b; n } n template n inline void gn(T &first) { n char c, sg = 0; n while (c = getchar(), (c > 9 || c < 0 ) && c != - ) n ; n for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; n c = getchar()) n first = (first << 1) + (first << 3) + c - 0 ; n if (sg) first = -first; n } n template n inline void gn(T &first, T1 &second) { n gn(first); n gn(second); n } n template n inline void gn(T &first, T1 &second, T2 &z) { n gn(first); n gn(second); n gn(z); n } n template n inline void print(T first) { n if (first < 0) { n putchar( - ); n return print(-first); n } n if (first < 10) { n putchar( 0 + first); n return; n } n print(first / 10); n putchar(first % 10 + 0 ); n } n template n inline void printsp(T first) { n print(first); n putchar( ); n } n template n inline void println(T first) { n print(first); n putchar( n ); n } n template n inline void print(T first, U second) { n printsp(first); n println(second); n } n template n inline void print(T first, U second, V z) { n printsp(first); n printsp(second); n println(z); n } n int power(int a, int b, int m, int ans = 1) { n for (; b; b >>= 1, a = 1LL * a * a % m) n if (b & 1) ans = 1LL * ans * a % m; n return ans; n } n const int B = 2222222; n int n, u, cnt[B << 1], flag[B]; n long long s[B << 1], first, second; n long long calc(int p) { n long long ans = 0; n int r = max(1, p - (int)(first / second)); n for (int t = 0; t + p < B; t += p) { n ans += second * ((long long)(cnt[t + p - 1] - cnt[t + r - 1]) * (t + p) - n s[t + p - 1] + s[t + r - 1]); n ans += first * (cnt[t + r - 1] - cnt[t]); n } n return ans; n } n void solve_B() { n gn(n, first, second); n for (int i = 0; i < n; i++) { n gn(u); n s[u] += u; n cnt[u]++; n } n for (int i = 1; i < B; i++) s[i] += s[i - 1], cnt[i] += cnt[i - 1]; n long long ans = n * first; n for (int i = 2; i < B; i++) n if (!flag[i]) { n smin(ans, calc(i)); n if ((long long)i * i >= B) continue; n for (int j = i * i; j < B; j += i) flag[j] = 1; n } n println(ans); n exit(0); n } n int main() { n solve_B(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n for (int ii = 0; ii < t; ii++) { n int n; n cin >> n; n bool A[52]; n char Aa[52][52]; n for (int i = 0; i < n; i++) { n char t; n cin >> t; n if (t == 1 ) n A[i] = 0; n else n A[i] = 1; n } n int k = 0; n int t = -1; n for (int i = n - 1; i >= 0; i--) { n if (A[i] == 0) { n k++; n } else { n t = i; n } n } n if (n - k > 2 || n - k == 0) n cout << YES << endl; n else { n cout << NO << endl; n continue; n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n Aa[i][j] = = ; n } n } n for (int i = 0; i < n; i++) Aa[i][i] = X ; n int c1 = t; n if (n - k > 2) { n for (int i = t + 1; i < n; i++) { n if (A[i] == 1) { n Aa[c1][i] = + ; n Aa[i][c1] = - ; n c1 = i; n } n } n Aa[c1][t] = + ; n Aa[t][c1] = - ; n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n cout << Aa[i][j]; n } n cout << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long T; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> T; n int a, b, c, d; n while (T--) { n cin >> a >> b >> c >> d; n bool ok = 0; n if (a == c) { n if (d + b == a) ok = 1; n } n if (a == d) { n if (c + b == a) ok = 1; n } n if (b == c) { n if (a + d == b) ok = 1; n } n if (b == d) { n if (a + c == b) ok = 1; n } n if (ok) n cout << Yes n ; n else n cout << No n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector adjc[100005]; n vector cadj[100005]; n struct edge { n int u, v, c; n }; n class dsu { n public: n dsu(vector vert) : vert(vert) { n n = vert.size(); n par.resize(n); n iota(par.begin(), par.end(), 0); n } n int root(int u) { n if (par[u] == u) { n return u; n } n return (par[u] = root(par[u])); n } n void merge(int u, int v) { n int ui = lower_bound(vert.begin(), vert.end(), u) - vert.begin(); n int vi = lower_bound(vert.begin(), vert.end(), v) - vert.begin(); n int ru = root(ui), rv = root(vi); n if (ru != rv) { n if (rand() % 2) { n swap(ru, rv); n } n par[ru] = rv; n } n } n bool ced(int u, int v) { n int ui = lower_bound(vert.begin(), vert.end(), u) - vert.begin(); n int vi = lower_bound(vert.begin(), vert.end(), v) - vert.begin(); n if ((ui == n || (vert[ui] != u)) || (vi == n || (vert[vi] != v))) return 0; n return (root(ui) == root(vi)); n } n int n; n vector vert, par; n }; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n, m; n cin >> n >> m; n vector e; n for (int i = 0; i < m; i++) { n int u, v, c; n cin >> u >> v >> c; n e.push_back({u, v, c}); n cadj[c].push_back(u); n cadj[c].push_back(v); n adjc[u].push_back(c); n adjc[v].push_back(c); n } n for (int i = 1; i <= n; i++) { n sort(adjc[i].begin(), adjc[i].end()); n adjc[i].resize(unique(adjc[i].begin(), adjc[i].end()) - adjc[i].begin()); n } n vector cdsu; n for (int i = 1; i <= m; i++) { n sort(cadj[i].begin(), cadj[i].end()); n cadj[i].resize(unique(cadj[i].begin(), cadj[i].end()) - cadj[i].begin()); n cdsu.emplace_back(cadj[i]); n } n for (edge ed : e) { n cdsu[ed.c - 1].merge(ed.u, ed.v); n } n map, int> dp; n int q; n cin >> q; n while (q--) { n int u, v; n cin >> u >> v; n if (adjc[u].size() > adjc[v].size()) { n swap(u, v); n } n if (dp.find({u, v}) != dp.end()) { n cout << dp[{u, v}] << endl; n continue; n } n int ans = 0; n for (auto c : adjc[u]) { n ans += cdsu[c - 1].ced(u, v); n } n cout << ans << endl; n dp[{u, v}] = ans; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 20 + 5; n const long long INF = 3e9; n const char *cc = 0123456789abcdef ; n int c[maxn][maxn], used[maxn]; n long long dp[maxn][maxn]; n char s[maxn]; n long long solve(int t, int m, bool flag) { n memset(dp[0], 0, sizeof(dp[0])); n if (flag) { n for (int i = 0; i < m; ++i) { n for (int j = 0; j + used[0] <= t && j + i + 1 <= m; ++j) { n dp[0][i + j] = min(INF, dp[0][i + j] + c[m - i - 1][j]); n } n } n } else n for (int i = 0; i + used[0] <= t && i <= m; ++i) dp[0][i] = c[m][i]; n for (int i = 1; i < 16; ++i) { n memset(dp[i], 0, sizeof(dp[i])); n for (int j = 0; j <= m; ++j) { n if (!dp[i - 1][j]) continue; n for (int k = 0; k + used[i] <= t && k + j <= m; ++k) { n dp[i][j + k] = min(INF, dp[i][j + k] + dp[i - 1][j] * c[m - j][k]); n } n } n } n return dp[15][m]; n } n int main() { n for (int i = 0; i < maxn; ++i) { n c[i][0] = c[i][i] = 1; n for (int j = 1; j < i; ++j) c[i][j] = c[i - 1][j - 1] + c[i - 1][j]; n } n int k, t; n cin >> k >> t; n bool flag = true; n for (int i = 0; i < 20; ++i) { n long long sum = 0; n for (int j = 0; j < 16; ++j) { n if (used[j] >= t) continue; n if (!flag || j != 0) ++used[j]; n long long tmp = solve(t, 20 - i - 1, flag && j == 0); n sum += tmp; n if (sum >= k) { n s[i] = cc[j]; n k -= sum - tmp; n if (j > 0) flag = false; n break; n } n if (!flag || j != 0) --used[j]; n } n } n s[20] = 0; n int p = 0; n while (s[p] == 0 ) ++p; n cout << s + p << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector > inc[100010]; n priority_queue > Q; n long long A[100010]; n int N, M, K; n vector > mul; n int sel[100010]; n int typ[100010]; n void compute() { n int k; n while (M-- && !(Q.empty() && mul.empty())) { n k = Q.empty() ? -1 : Q.top().second; n if (mul.empty() || (k >= 0 && Q.top().first >= mul.back().first)) { n A[k] += inc[k].back().first; n sel[inc[k].back().second] = 1; n inc[k].pop_back(); n Q.pop(); n if (!inc[k].empty()) n Q.push(make_pair((A[k] + inc[k].back().first) / (1.0 * A[k]), k)); n continue; n } n sel[mul.back().second] = 1; n mul.pop_back(); n } n } n pair typ1[100010]; n int main() { n int i, b, t; n cin >> K >> N >> M; n for (i = 0; i < K; ++i) cin >> A[i]; n for (int idx = 0; idx < N; ++idx) { n cin >> t >> i >> b; n typ[idx] = t; n if (t == 3) { n mul.push_back(make_pair(b, idx)); n continue; n } n --i; n if (t == 1) { n typ1[i] = max(typ1[i], make_pair(b - (int)A[i], idx)); n continue; n } n inc[i].push_back(make_pair(b, idx)); n } n for (i = 0; i < K; ++i) { n if (!typ1[i].first) continue; n inc[i].push_back(typ1[i]); n } n sort(mul.begin(), mul.end()); n for (i = 0; i < K; ++i) { n if (inc[i].empty()) continue; n sort(inc[i].begin(), inc[i].end()); n Q.push(make_pair((A[i] + inc[i].back().first) / (1.0 * A[i]), i)); n } n compute(); n cout << accumulate(sel, sel + N, 0) << n ; n for (i = 0; i < N; ++i) { n if (!sel[i] || typ[i] > 1) continue; n cout << i + 1 << ; n } n for (i = 0; i < N; ++i) { n if (!sel[i] || typ[i] != 2) continue; n cout << i + 1 << ; n } n for (i = 0; i < N; ++i) { n if (!sel[i] || typ[i] < 3) continue; n cout << i + 1 << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char a[102]; n char b[102]; n char c[102]; n int main() { n gets(a); n gets(b); n int l = strlen(a); n int i; n for (i = l - 1; i >= 0; i--) { n if (a[i] == z ) { n a[i] = a ; n } else { n a[i] = a[i] + 1; n break; n } n } n if (!strcmp(a, b)) n cout << No such string ; n else n cout << a; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 500005; n int a[N]; n int main() { n int n; n while (scanf( %d , &n) != EOF) { n memset(a, 0, sizeof(a)); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n } n sort(a, a + n); n int mid = (n - 1) / 2; n int big = n - 1; n int small = mid; n int ok = 0; n while (big > mid && small >= 0) { n if (a[small] * 2 <= a[big]) { n ok++; n small--; n big--; n } else { n small--; n } n } n printf( %d n , n - ok); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, sol; n multiset S; n multiset::iterator p; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n int val; n scanf( %d , &val); n S.insert(val); n } n long long s = 0; n for (int i = 1; i <= n; i++) { n p = S.lower_bound(s); n if (p == S.end()) break; n if (*p < s) p++; n sol++; n s += *p; n S.erase(p); n } n printf( %d n , sol); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long bz = -10000000000; n long long t[50001], ll[50001], rr[50001], dd[50001]; n long long tu[50001]; n int main() { n long long n, m; n cin >> n >> m; n for (long long a = 1; a <= n; a++) tu[a] = bz; n for (long long a = 1; a <= m; a++) cin >> t[a] >> ll[a] >> rr[a] >> dd[a]; n for (long long a = 1; a <= m; a++) { n if (t[a] == 1) { n for (long long b = ll[a]; b <= rr[a]; b++) { n if (tu[b] == bz) n continue; n else n tu[b] += dd[a]; n } n } else { n long long jc = 1; n for (long long b = ll[a]; b <= rr[a]; b++) { n if (tu[b] == bz) { n tu[b] = dd[a]; n jc = 0; n } else { n if (tu[b] >= dd[a]) { n tu[b] = dd[a]; n jc = 0; n } n } n } n if (jc) { n cout << NO ; n return 0; n } n } n } n for (long long a = 1; a <= n; a++) n if (tu[a] == bz) tu[a] = 0; n for (long long a = m; a >= 1; a--) { n if (t[a] == 2) { n long long jc = 1; n for (long long b = ll[a]; b <= rr[a]; b++) { n if (tu[b] == dd[a]) jc = 0; n } n if (jc) { n cout << NO ; n return 0; n } n continue; n } n for (long long b = ll[a]; b <= rr[a]; b++) n if (tu[a] != bz) tu[b] -= dd[a]; n } n cout << YES << endl; n long long jc = 0; n for (long long a = 1; a <= n; a++) { n if (tu[a] == bz) tu[a] = 0; n if (!jc) { n cout << tu[a]; n jc = 1; n } else { n cout << << tu[a]; n } n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n const int N = 4040; n using namespace std; n int n, m; n int l[N], s[N]; n int cost[N]; n int inf = -1e9; n int d[N][N]; n int f[N][N]; n vector v[N]; n vector pos[N]; n vector fut[N][14]; n int main() { n ios_base::sync_with_stdio(0); n cin >> n >> m; n for (int i = 1; i <= n; i++) cin >> l[i]; n for (int i = 1; i <= n; i++) cin >> s[i]; n reverse(l + 1, l + n + 1); n reverse(s + 1, s + n + 1); n for (int i = 1; i <= n + m; i++) cin >> cost[i]; n for (int i = 1; i <= n; i++) v[l[i]].push_back(i); n for (int i = 0; i < N; i++) n for (int j = 0; j < N; j++) d[i][j] = inf; n for (int i = 1; i <= n + m; i++) { n for (int j = 0; j < 13; j++) { n fut[i][j].resize((1 << 13 - j)); n while (fut[i][j].size() >= N - 4) fut[i][j].pop_back(); n for (auto &x : fut[i][j]) x = inf; n } n } n for (int i = 0; i < N; i++) { n for (int j = 1; j <= n + m; j++) { n f[i][j] = cost[j]; n for (int h = 0; h < 13; h++) { n if (i & (1 << h)) n f[i][j] += cost[j + h + 1]; n else n break; n } n } n } n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= l[i]; j++) { n int dif = min(12, l[i] - j); n for (int p = 0; p < fut[j][dif].size(); p++) { n d[p + 1][i] = max(d[p + 1][i], fut[j][dif][p] + f[p][l[i]] - s[i]); n } n } n d[1][i] = max(d[1][i], cost[l[i]] - s[i]); n for (int j = 0; j < N; j++) { n int nj = j, x = l[i]; n for (int h = 0; h < 13; h++) { n fut[x][h][nj] = max(fut[x][h][nj], d[j][i]); n nj >>= 1; n } n } n } n int res = 0; n for (int i = 0; i < N; i++) { n for (int j = 1; j <= n; j++) { n res = max(res, d[i][j]); n } n } n cout << res << n ; n } n "} +{"func_code_string": "#include n using namespace std; n long long int XpowerY(long long int x, long long int y, long long int m) { n long long int ans = 1; n x = x % m; n while (y > 0) { n if (y % 2 == 1) ans = (ans * x) % m; n x = ((x % m) * (x % m)) % m; n y = y >> 1; n } n return ans % m; n } n vector gr[100023]; n long long int s[100023], val[100023]; n long long int fl, minP; n long long int dfs(long long int node, long long int prev, long long int lev) { n long long int mx = 1e12; n if (lev % 2 == 0) { n for (int i = 0; i < gr[node].size(); i++) { n if (s[gr[node][i]] < prev) fl = 1; n mx = min(mx, s[gr[node][i]] - prev); n }; n val[node] = mx; n if (gr[node].size() == 0) val[node] = 0; n } n for (int i = 0; i < gr[node].size(); i++) { n val[gr[node][i]] = s[gr[node][i]] - mx - prev; n long long int temp; n if (lev % 2 == 0) n temp = prev + val[node]; n else n temp = s[node]; n dfs(gr[node][i], temp, lev + 1); n } n return 0; n } n int main() { n long long int n, x; n cin >> n; n for (long long int i = 0; i < n - 1; i++) { n cin >> x; n gr[x].push_back(i + 2); n } n for (long long int i = 1; i <= n; i++) cin >> s[i]; n dfs(1, -1, 1); n val[1] = s[1]; n if (fl) return cout << -1 << endl, 0; n for (long long int i = 0; i < n; i++) { n ; n minP += val[i + 1]; n } n cout << minP << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int ALPHA = 26 + 1; n struct Trie { n Trie() { nodes.resize(2); } n struct Node { n Node() { memset(next, 0, sizeof(next)); } n int next[ALPHA]; n int finish = -1; n }; n int alloc() { n nodes.push_back(Node()); n return nodes.size() - 1; n } n void addWord(const string& s, int id) { n int v = root; n for (char c : s) { n c = tolower(c) - a ; n if (!nodes[v].next[c]) { n int x = alloc(); n nodes[v].next[c] = x; n } n v = nodes[v].next[c]; n } n nodes[v].finish = id; n } n vector nodes; n const int root = 1; n }; n int n; n string ciph; n int m; n Trie trie; n vector solved; n vector toTake; n bool solve(int pos) { n if (pos == n) { n return true; n } n if (solved[pos] == -1) { n solved[pos] = false; n int v = trie.root; n int i = pos; n while (i < ciph.length() && trie.nodes[v].next[ciph[i] - a ]) { n v = trie.nodes[v].next[ciph[i] - a ]; n ++i; n if (trie.nodes[v].finish != -1) { n if (solve(i)) { n solved[pos] = true; n toTake[pos] = trie.nodes[v].finish; n } n } n } n } n return solved[pos]; n } n int main() { n ios::sync_with_stdio(false); n cin >> n; n solved.resize(n, -1); n toTake.resize(n, -1); n cin >> ciph; n cin >> m; n vector words(m); n for (int i = 0; i < m; ++i) { n cin >> words[i]; n trie.addWord(words[i], i); n } n reverse(ciph.begin(), ciph.end()); n solve(0); n vector ans; n if (solved[0] == 1) { n int pos = 0; n while (pos != n) { n int id = toTake[pos]; n ans.push_back(id); n pos += words[id].length(); n } n } else { n assert(false); n } n reverse(ans.begin(), ans.end()); n for (int i = 0; i < ans.size(); ++i) { n if (i != 0) { n cout << ; n } n cout << words[ans[i]]; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long x, y, m, cnt = 0; n int main() { n scanf( %lld%lld%lld , &x, &y, &m); n if (x >= m || y >= m) { n printf( 0 ); n return 0; n } n if (x <= 0 && y <= 0) { n printf( -1 ); n return 0; n } n while (x < m && y < m) { n if (x > y) swap(x, y); n if (x + y <= 0) { n cnt += abs(x) / y; n x = x + (abs(x) - abs(x) % y); n } else { n x += y; n cnt++; n ; n } n } n printf( %lld , cnt); n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:256000000 ) n using namespace std; n const int maxN = 2000; n const int S_CNT = 9; n const int M_CNT = 25; n const int DIST = 60 * 60; n int n, m; n int a[maxN][maxN]; n int t[maxN][maxN]; n int used[maxN][maxN]; n int rc[maxN][maxN]; n int is_in(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; } n int get(int x, int y) { n int cnt = 0; n for (int i = x - 2; i <= x + 2; ++i) { n for (int j = y - 2; j <= y + 2; ++j) { n if (is_in(i, j)) { n cnt += a[i][j]; n } n } n } n return cnt; n } n pair choose_max(int x, int y) { n pair res = make_pair(-1, -1); n int rs = -1; n for (int i = x - 2; i <= x + 2; ++i) { n for (int j = y - 2; j <= y + 2; ++j) { n if (is_in(i, j)) { n if (t[i][j] > rs) { n rs = t[i][j]; n res = make_pair(i, j); n } n } n } n } n return res; n } n void change_used(int x, int y, int num) { n for (int i = x - 2; i <= x + 2; ++i) { n for (int j = y - 2; j <= y + 2; ++j) { n if (is_in(i, j)) { n used[i][j] = num; n } n } n } n } n int dist(pair a, pair b) { n return (a.first - b.first) * (a.first - b.first) + n (a.second - b.second) * (a.second - b.second); n } n pair choose_long(int cx, int cy, int x, int y, int step) { n pair res = make_pair(cx, cy); n int rs = -1; n for (int i = cx - 2; i <= cx + 2; ++i) { n for (int j = cy - 2; j <= cy + 2; ++j) { n if (is_in(i, j) && a[i][j] && used[i][j] != step) { n if (dist(make_pair(i, j), make_pair(x, y)) > rs) { n rs = dist(make_pair(i, j), make_pair(x, y)); n res = make_pair(i, j); n } n } n } n } n return res; n } n void dfs(int x, int y, int color) { n if (rc[x][y] != 0) return; n rc[x][y] = color; n if (is_in(x + 1, y) && a[x + 1][y]) dfs(x + 1, y, color); n if (is_in(x - 1, y) && a[x - 1][y]) dfs(x - 1, y, color); n if (is_in(x, y + 1) && a[x][y + 1]) dfs(x, y + 1, color); n if (is_in(x, y - 1) && a[x][y - 1]) dfs(x, y - 1, color); n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n scanf( %d , &a[i][j]); n } n } n int c_col = 0; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (a[i][j] && !rc[i][j]) { n ++c_col; n dfs(i, j, c_col); n } n } n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (a[i][j]) { n t[i][j] = get(i, j); n } n } n } n vector > cur; n int step = 1; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (a[i][j] && !used[i][j] && t[i][j] == S_CNT) { n ++step; n int cx = i, cy = j; n change_used(cx, cy, step); n cur.push_back(make_pair(cx, cy)); n } n } n } n vector col(cur.size(), 0); n for (int i = 0; i < col.size(); ++i) { n col[i] = rc[cur[i].first][cur[i].second]; n } n map res; n for (int i = 0; i < col.size(); ++i) { n ++res[col[i]]; n } n cout << res.size() << endl; n vector ans; n for (map::iterator it = res.begin(); it != res.end(); ++it) { n ans.push_back(it->second); n } n sort(ans.begin(), ans.end()); n for (int i = 0; i < ans.size(); ++i) { n cout << ans[i] << ; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n char Src[1000001], Dst[1000001]; n int main() { n int i, j, Cnts, Cntd, Lens, Lend; n scanf( %s %s , Src, Dst); n if (strlen(Src) != strlen(Dst)) { n puts( NO ); n return 0; n } n if (strcmp(Src, Dst) == 0) { n puts( YES ); n return 0; n } n if (strlen(Src) == 1) { n puts(Src[0] == Dst[0] ? YES : NO ); n return 0; n } n for (i = 0; Src[i] != 0 ; ++i) { n if (Src[i] == 1 ) { n break; n } n } n for (j = 0; Dst[j] != 0 ; ++j) { n if (Dst[j] == 1 ) { n break; n } n } n puts(Src[i] == 1 && Dst[j] == 1 ? YES : NO ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n bool smax(T &x, L y) { n return x < y ? (x = y, 1) : 0; n } n template n bool smin(T &x, L y) { n return y < x ? (x = y, 1) : 0; n } n const int maxn = 5e5 + 17; n list a; n list::iterator per[maxn]; n int n; n int main() { n ios::sync_with_stdio(0), cin.tie(0); n cin >> n; n for (int i = 0, x; i < n; i++) cin >> x, a.push_back(x), per[i] = --a.end(); n sort(per, per + n, n [](list::iterator &i, list::iterator &j) { return *i < *j; }); n long long ans = 0, dam = 0; n for_each(per, per + max(0, n - 2), [&](list::iterator &i) { n if (i == a.begin() || i == --a.end()) { n ans += (a.size() - 2) * (*i - dam); n dam = *i; n } else { n auto prv = i, nxt = i; n prv--, nxt++; n ans += min(*prv, *nxt) - dam; n } n a.erase(i); n }); n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n int main() { n int t; n scanf( %d , &t); n while (t--) { n int n; n scanf( %d , &n); n std::vector a(n); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n } n int minadd = 0; n int cur = a[0]; n for (int i = 1; i < n; i++) { n if (cur > a[i]) { n minadd = std::max(minadd, cur - a[i]); n } n cur = std::max(cur, a[i]); n } n int nBits = 0; n while (minadd) { n nBits++; n minadd >>= 1; n } n printf( %d n , nBits); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Ans { n long long maxm, maxp, lmr, rml; n Ans() { maxm = maxp = lmr = rml = -(1ll << 60); } n } node[100010 << 2]; n void Union(Ans &o, Ans a, Ans b) { n o.maxm = max(a.maxm, b.maxm); n o.maxp = max(a.maxp, b.maxp); n o.lmr = max(max(a.lmr, b.lmr), a.maxp + b.maxm); n o.rml = max(max(a.rml, b.rml), a.maxm + b.maxp); n } n long long h[100010], d[100010], n; n void build(int o, int l, int r) { n if (l == r) { n node[o].maxm = 2 * h[l] - (long long)d[l]; n node[o].maxp = 2 * h[l] + (long long)d[l]; n node[o].rml = -(1ll << 60); n node[o].lmr = -(1ll << 60); n return; n } n build((o << 1), l, ((l + r) >> 1)); n build((o << 1 | 1), ((l + r) >> 1) + 1, r); n Union(node[o], node[(o << 1)], node[(o << 1 | 1)]); n } n Ans query(int L, int R, int o = 1, int l = 1, int r = n) { n Ans ret; n if (L > R) return ret; n if (L <= l && r <= R) return node[o]; n if (R <= ((l + r) >> 1)) return query(L, R, (o << 1), l, ((l + r) >> 1)); n if (L > ((l + r) >> 1)) n return query(L, R, (o << 1 | 1), ((l + r) >> 1) + 1, r); n Union(ret, query(L, R, (o << 1), l, ((l + r) >> 1)), n query(L, R, (o << 1 | 1), ((l + r) >> 1) + 1, r)); n return ret; n } n int Q; n Ans ansl, ansr; n int main() { n scanf( %d%d , &n, &Q); n for (int i = 1; i <= n; i++) { n cin >> d[i + 1]; n d[i + 1] += d[i]; n } n for (int i = 1; i <= n; i++) cin >> h[i]; n build(1, 1, n); n while (Q--) { n int l, r; n scanf( %d %d , &l, &r); n if (l <= r) { n ansl = query(r + 1, n); n ansr = query(1, l - 1); n cout << max(max(ansr.rml, ansl.rml), ansr.maxp + d[n + 1] + ansl.maxm) n << endl; n } else { n cout << query(r + 1, l - 1).rml << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, tot; n long long ans; n int main(int argc, char **argv) { n scanf( %d%d , &n, &m); n ++n; n for (int i = m + 1; (i << 1) <= n && i < n - m; ++i) n for (int j = m + 1; j < n - m; ++j) { n tot = (-i * i * 2 + i * j + i * n * 2 - j * n - 1) / (i + j); n ans += max(min(tot, n - m - 1) - m, 0) * ((i << 1) == n ? 1 : 2); n } n printf( %I64d n , ans * 3); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int A, B, C, N; n int main() { n scanf( %d%d%d%d , &A, &B, &C, &N); n if (A < C || B < C || A + B >= N + C) n puts( -1 ); n else n printf( %d n , N - (A + B - C)); n } n "} +{"func_code_string": "#include n using namespace std; n template n struct modulo { n int w; n operator int() const { return w; } n modulo() {} n modulo(int w) { n this->w = w; n fix(); n } n template n modulo(type w) { n this->w = w % mod; n fix(); n } n void inline fix() { n if (w >= mod || w < -mod) w %= mod; n if (w < 0) w += mod; n } n inline modulo operator-() const { return mod - w; } n inline modulo &operator+=(const modulo &b) { n if ((w += b.w) >= mod) w -= mod; n return *this; n } n inline modulo &operator-=(const modulo &b) { n if ((w -= b.w) < 0) w += mod; n return *this; n } n inline modulo &operator*=(const modulo &b) { n w = (unsigned long long)w * b.w % mod; n return *this; n } n inline modulo &operator/=(const modulo &b) { return *this *= inv(b); } n friend modulo operator+(const modulo &a, const modulo &b) { n return modulo(a) += b; n } n template n friend modulo operator+(const modulo &a, const type &b) { n return modulo(a) += b; n } n template n friend modulo operator+(const type &a, const modulo &b) { n return modulo(a) += b; n } n friend modulo operator-(const modulo &a, const modulo &b) { n return modulo(a) -= b; n } n template n friend modulo operator-(const modulo &a, const type &b) { n return modulo(a) -= b; n } n template n friend modulo operator-(const type &a, const modulo &b) { n return modulo(a) -= b; n } n friend modulo operator*(const modulo &a, const modulo &b) { n return modulo(a) *= b; n } n template n friend modulo operator*(const modulo &a, const type &b) { n return modulo(a) *= b; n } n template n friend modulo operator*(const type &a, const modulo &b) { n return modulo(a) *= b; n } n friend modulo operator/(const modulo &a, const modulo &b) { n return modulo(a) /= b; n } n template n friend modulo operator/(const modulo &a, const type &b) { n return modulo(a) /= b; n } n template n friend modulo operator/(const type &a, const modulo &b) { n return modulo(a) /= b; n } n friend inline modulo inv(const modulo &w) { n int a = w, m = mod, u = 0, v = 1, t; n for (; a != 0; t = m / a, m -= t * a, swap(a, m), u -= t * v, swap(u, v)) n ; n return u; n } n friend inline modulo pow(const modulo &w, int p) { n if (!w) return 0; n modulo a = w, r = 1; n for (; p > 0; a *= a, p >>= 1) n if (p & 1) r *= a; n return r; n } n }; n const int mod = 998244353; n const int nsz = 5e3; n int n; n modulo f[2][nsz + 5], g[nsz + 5], S[nsz + 5][nsz + 5], ans[nsz + 5]; n modulo inline C(int n, int m) { return f[0][n] * f[1][m] * f[1][n - m]; } n void inline init() { n f[0][0] = 1; n for (int i = 1; i <= n; ++i) f[0][i] = f[0][i - 1] * i; n f[1][n] = 1 / f[0][n]; n for (int i = n; i >= 1; --i) f[1][i - 1] = f[1][i] * i; n S[0][0] = 1; n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= i; ++j) S[i][j] = S[i - 1][j] * j + S[i - 1][j - 1]; n } n for (int i = 0; i <= n; ++i) { n for (int len = i + 1; len <= n; ++len) n g[i] += f[0][len - i] * f[1][len] * S[len][len - i]; n } n } n void inline solve() { n for (int k = 0; k < n; ++k) { n for (int i = k; i <= n; ++i) { n modulo res = g[i] * C(i, k) * f[0][n]; n ans[k + 1] += (i - k) & 1 ? -res : res; n } n } n } n int main() { n scanf( %d , &n); n init(); n solve(); n for (int k = 1; k <= n; ++k) printf( %d%c , ans[k].w, n [k < n]); n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n vector prices[1010]; n int allp[1010]; n int all; n int margin_price; n int above_cnt[1010], margin_cnt[1010], cnt[1010]; n double f[1010][1010], g[1010][1010]; n double comb[1010][1010]; n int main() { n comb[1][0] = comb[1][1] = 1; n for (int i = 2; i <= 1000; i++) { n comb[i][0] = comb[i][i] = 1; n for (int j = 1; j < i; j++) n comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1]; n } n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n int k; n scanf( %d , &k); n while (k--) { n int v; n scanf( %d , &v); n prices[i].push_back(v); n allp[++all] = v; n } n } n sort(allp + 1, allp + all + 1); n reverse(allp + 1, allp + all + 1); n margin_price = allp[n]; n int need_margin = 0; n for (int i = 1; i <= n; i++) n if (allp[i] == margin_price) need_margin++; n for (int i = 1; i <= m; i++) { n for (int p : prices[i]) { n if (p > margin_price) n above_cnt[i]++; n else if (p == margin_price) n margin_cnt[i]++; n cnt[i]++; n } n } n f[0][0] = 1; n g[0][0] = 1; n for (int i = 1; i <= m; i++) { n for (int j = 0; j <= need_margin; j++) { n if (margin_cnt[i] == 0) { n f[i][j] += f[i - 1][j] / comb[cnt[i]][above_cnt[i]]; n g[i][j] += g[i - 1][j]; n } else if (margin_cnt[i] == 1) { n f[i][j] += f[i - 1][j] / comb[cnt[i]][above_cnt[i]]; n g[i][j] += g[i - 1][j]; n f[i][j + 1] += f[i - 1][j] / comb[cnt[i]][above_cnt[i] + 1]; n g[i][j + 1] += g[i - 1][j]; n } else { n assert(false); n } n } n } n printf( %.15f n , f[m][need_margin] / g[m][need_margin]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int INF = 1000000005; n long long INFF = 1000000000000000005LL; n int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1}; n int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1}; n double pi = 3.1415926536; n int MOD = 1e9 + 7; n long long power(long long x, long long n) { n long long res = 1; n while (n > 0) { n if (n & 1) res = res * x; n x = (x * x); n n /= 2; n } n return res; n } n bool ok(int n, long long d) { n long long sum = (n * (n + 1) / 2); n if (sum < d) return false; n return (d % 2 == sum % 2); n } n int main() { n ios::sync_with_stdio(false); n cin.tie(); n cout.tie(); n int t; n cin >> t; n while (t--) { n int a, b; n cin >> a >> b; n int i = 0; n while (!ok(i, abs(a - b))) i++; n cout << i << n ; n } n } n "} +{"func_code_string": "#include n int a[1000000], b[1000000], n, k, f[1000000], c[1000000], i, j; n int max(int a, int b) { n if (a > b) return a; n return b; n } n int main() { n scanf( %d%d , &n, &k); n for (i = 1; i <= n; i++) scanf( %d , &a[i]); n for (i = 1; i <= n; i++) { n scanf( %d , &b[i]); n b[i] = b[i] * k; n c[i] = a[i] - b[i]; n } n for (i = 0; i <= 20000; i++) f[i] = -0x37373737; n f[10000] = 0; n for (i = 1; i <= n; i++) { n if (c[i] > 0) n for (j = 20000; j >= c[i]; j--) f[j] = max(f[j - c[i]] + a[i], f[j]); n else n for (j = 0; j <= 20000 + c[i]; j++) f[j] = max(f[j - c[i]] + a[i], f[j]); n } n if (f[10000]) n printf( %d , f[10000]); n else n printf( -1 ); n } n "} +{"func_code_string": "#include n using namespace std; n void input() { n int n; n cin >> n; n vector v; n int i = 1; n int k = n - 1; n while (k--) { n cout << ? << i << << i + 1 << n ; n fflush(stdout); n int x; n cin >> x; n v.push_back(x); n i++; n } n cout << ? << 1 << << 3 << n ; n fflush(stdout); n int x; n cin >> x; n int a[n + 1]; n a[1] = x - v[1]; n for (int i = 2; i <= n; i++) { n a[i] = v[i - 2] - a[i - 1]; n } n cout << ! ; n for (int i = 1; i <= n; i++) { n cout << a[i] << ; n } n cout << n ; n } n int main() { n input(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int an[101][21][21], n, k, md = 1e9 + 7, t[21][21]; n vector tr[101]; n void go(int v = 1, int p = 0) { n an[v][0][1] = an[v][1][0] = 1; n for (int i = 0; i < (int)(tr[v].size()); ++i) { n int u = tr[v][i]; n if (u == p) continue; n go(u, v); n for (int i = 0; i < (int)(21); ++i) n for (int j = 0; j < (int)(21); ++j) n for (int w = 0; w < (int)(21); ++w) n for (int z = 0; z < (int)(21); ++z) { n int a = i; n if (w && (w + 1 < a || !a)) a = w + 1; n if (a > 20) a = 0; n int b = 0; n if (!i && z) n b = z + 1; n else if (i && z && k - i + 1 < z) n b = z + 1; n if (!w) n b = max(b, j); n else if (j && k - w + 1 < j) n b = max(b, j); n if (b > 20) continue; n t[a][b] = ((long long)an[v][i][j] * an[u][w][z] + t[a][b]) % md; n } n for (int i = 0; i < (int)(21); ++i) n for (int j = 0; j < (int)(21); ++j) an[v][i][j] = t[i][j], t[i][j] = 0; n } n } n int main() { n scanf( %d%d , &n, &k); n for (int i = 1; i < (int)(n); ++i) { n int a, b; n scanf( %d%d , &a, &b); n tr[a].push_back(b); n tr[b].push_back(a); n } n go(); n int a = 0; n for (int i = 0; i < (int)(21); ++i) n if ((a += an[1][i][0]) >= md) a -= md; n printf( %d n , a); n } n "} +{"func_code_string": "#include n using namespace std; n long long dp[100010]; n int a[310], in[310]; n long long tmp[310]; n struct edge { n int to; n int next; n } e[310]; n int box[100010], cnt; n long long T; n void init() { n memset(box, -1, sizeof(box)); n memset(in, 0, sizeof(in)); n memset(dp, 0, sizeof(dp)); n cnt = 0; n } n void add(int from, int to) { n e[cnt].to = to; n e[cnt].next = box[from]; n box[from] = cnt++; n } n long long dfs(int now) { n tmp[now] = a[now]; n int t, v; n for (t = box[now]; t + 1; t = e[t].next) { n v = e[t].to; n long long tt = dfs(v); n tmp[now] += tt; n } n T -= tmp[now]; n return tmp[now]; n } n bool iscircle(int n) { n int qu[310], tmp[310]; n int i, sum = 0, top = 0; n for (i = 1; i <= n; i++) { n tmp[i] = in[i]; n if (tmp[i] == 0) qu[top++] = i; n } n for (i = 0; i < top; i++) { n int now = qu[i], t, v; n for (t = box[now]; t + 1; t = e[t].next) { n v = e[t].to; n tmp[v]--; n if (!tmp[v]) qu[top++] = v; n } n } n if (top < n) return true; n return false; n } n int main() { n int n, q, i, aa, b, j; n scanf( %d%d%I64d , &n, &q, &T); n for (i = 1; i <= n; i++) scanf( %d , &a[i]); n init(); n for (i = 1; i <= q; i++) { n scanf( %d%d , &aa, &b); n in[aa]++; n add(b, aa); n } n bool tru = iscircle(n); n for (i = 1; i <= n; i++) { n if (!in[i]) { n dfs(i); n T += tmp[i]; n } n } n if (tru || T < 0) n printf( 0 n ); n else { n dp[0] = 1; n for (i = 1; i <= n; i++) { n for (j = tmp[i]; j <= T; j++) n dp[j] = (dp[j] + dp[j - tmp[i]]) % 1000000007; n } n printf( %I64d n , dp[T]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int m[26]; n int main() { n float a, c, d, b; n cin >> a >> b >> c >> d; n float sa = max((3 * a) / 10.0, a - (a / 250.0) * c); n float sb = max((3 * b) / 10.0, b - (b / 250.0) * d); n if (sa > sb) n cout << Misha ; n else if (sb > sa) n cout << Vasya ; n else n cout << Tie ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 3e5 + 5; n int n, m; n int first[maxn], second[maxn]; n void solve() { n cin >> n >> m; n for (int i = 1; i <= m; ++i) cin >> first[i] >> second[i]; n int a, b; n a = first[1]; n b = -1; n for (int i = 1; i <= m; ++i) { n if (first[i] != a && second[i] != a) { n if (first[i] != b && second[i] != b) { n if (b == -1) n b = first[i]; n else n break; n } n } n if (i == m) { n puts( YES ); n return; n } n } n a = -1; n b = second[1]; n for (int i = 1; i <= m; ++i) { n if (first[i] != b && second[i] != b) { n if (first[i] != a && second[i] != a) { n if (a == -1) n a = first[i]; n else n break; n } n } n if (i == m) { n puts( YES ); n return; n } n } n a = -1; n b = second[1]; n for (int i = 1; i <= m; ++i) { n if (first[i] != b && second[i] != b) { n if (first[i] != a && second[i] != a) { n if (a == -1) n a = second[i]; n else n break; n } n } n if (i == m) { n puts( YES ); n return; n } n } n a = first[1]; n b = -1; n for (int i = 1; i <= m; ++i) { n if (first[i] != a && second[i] != a) { n if (first[i] != b && second[i] != b) { n if (b == -1) n b = second[i]; n else n break; n } n } n if (i == m) { n puts( YES ); n return; n } n } n puts( NO ); n } n int main() { solve(); } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int x, y; n cin >> x >> y; n if (((x < y) ? x : y) % 2) n cout << Akshat ; n else n cout << Malvika ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int P = 10, N = 1e5 + 10; n int inverse(int a, int m) { n int m0 = m, t, q; n int x0 = 0, x1 = 1; n if (m == 1) return 0; n while (a > 1) { n q = a / m; n t = m; n m = a % m, a = t; n t = x0; n x0 = x1 - q * x0; n x1 = t; n } n if (x1 < 0) x1 += m0; n return x1; n } n int fact[N], ifact[N], pot[N][P]; n vector primes(int n) { n vector ans; n for (int d = 2; d * d <= n; d++) n if (n % d == 0) { n ans.push_back(d); n while (n % d == 0) { n n /= d; n } n } n if (n > 1) ans.push_back(n); n return ans; n } n int mod; n vector p; n int expomod(long long int a, long long int e) { n int ans = 1; n while (e) { n if (e & 1) ans = ans * a % mod; n e /= 2; n a = a * a % mod; n } n return ans; n } n int comb(int m, int n) { n int ans = (long long int)fact[m] * ifact[n] % mod * ifact[m - n] % mod; n for (int i = 0; i < (int)(((int)(p).size())); i++) { n int pp = pot[m][i] - pot[n][i] - pot[m - n][i]; n if (pp) ans = (long long int)ans * expomod(p[i], pp) % mod; n } n return ans; n } n int go(int n, int bal) { n long long int ans = 0; n for (int x = 0, y = bal; x + y <= n; x++, y++) { n ans += (long long int)comb(n, x) * comb(n - x, y) % mod; n if (ans >= mod) ans -= mod; n } n return ans; n } n int main() { n int n, l, r; n cin >> n >> mod >> l >> r; n p = primes(mod); n fact[0] = ifact[0] = 1; n for (int i = 1; i <= n; i++) { n int d = -1; n for (int j = 0; j < (int)(((int)(p).size())); j++) n if (i % p[j] == 0) { n d = j; n break; n } n if (d == -1) n fact[i] = i; n else { n fact[i] = fact[i / p[d]]; n for (int j = 0; j < (int)(((int)(p).size())); j++) n pot[i][j] = pot[i / p[d]][j] + (j == d); n } n ifact[i] = inverse(fact[i], mod); n } n for (int i = 0; i < (int)(n); i++) { n fact[i + 1] = (long long int)fact[i] * fact[i + 1] % mod; n ifact[i + 1] = (long long int)ifact[i] * ifact[i + 1] % mod; n for (int j = 0; j < (int)(((int)(p).size())); j++) n pot[i + 1][j] += pot[i][j]; n } n long long int ans = 0; n for (int i = 0; i < (int)(2); i++) { n ans += go(n, l + i); n ans -= go(n, r + 1 + i); n } n ans %= mod; n if (ans < 0) ans += mod; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[101][101]; n int main() { n long long n, m; n cin >> n >> m; n long long mn = min(m, n); n cout << mn + 1 << endl; n for (long long i = 0; i <= mn; i++) n cout << i << << (mn - i) % (mn + 1) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n char _; n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } n long long fpow(long long b, long long exp, long long mod) { n if (exp == 0) return 1; n long long t = fpow(b, exp / 2, mod); n if (exp & 1) return t * t % mod * b % mod; n return t * t % mod; n } n int num_boxes, req, start, vals[55], dp[55][2005]; n char type[55]; n int solve(int box, int sum) { n if (sum >= req) return 0; n if (dp[box][sum] != -1) return dp[box][sum]; n int res = INT_MAX; n for (int i = 1; i <= num_boxes; i++) n if (vals[i] > vals[box] && type[i] != type[box]) n if (solve(i, sum + vals[i]) != INT_MAX) n res = min(res, abs(i - box) + solve(i, sum + vals[i])); n return dp[box][sum] = res; n } n int main() { n scanf( %d %d %d , &num_boxes, &start, &req); n for (int i = 1; i <= num_boxes; i++) scanf( %d , &vals[i]); n for (int i = 1; i <= num_boxes; i++) scanf( %c , &type[i]); n memset(dp, -1, sizeof dp); n int res = solve(start, vals[start]); n for (int i = 1; i <= num_boxes; i++) n if (solve(i, vals[i]) != INT_MAX) n res = min(res, abs(i - start) + solve(i, vals[i])); n printf( %d n , (res == INT_MAX ? -1 : res)); n } n "} +{"func_code_string": "#include n using namespace std; n template n void maxE(T& a, const T& b) { n a = max(a, b); n } n template n void minE(T& a, const T& b) { n a = min(a, b); n } n template n ostream& operator<<(ostream& out, const vector& t_) { n out << [ ; n for (auto i : t_) out << i << , ; n out << ] ; n return out; n } n template n ostream& operator<<(ostream& out, const pair& rhs) { n out << ( << rhs.first << , << rhs.second << ) ; n return out; n } n int gcd(int a, int b) { n while (a && b) a > b ? a %= b : b %= a; n return a + b; n } n map t; n void proc(int l, int c) { n if (0) n cout << proc n << l n << << l << n << c n << << c << << endl; n if (t.find(l) == t.end()) { n t[l] = c; n if (0) cout << init0 << endl; n } else if (t[l] > c) { n if (0) cout << relax1 << endl; n t[l] = c; n } n vector > tmp; n for (auto i : t) tmp.push_back(i); n for (auto i : tmp) { n int g = gcd(i.first, l); n if (t.find(g) == t.end() || t[g] > i.second + c) { n if (0) n cout << relax2 n << i n << << i << n << g n << << g << n << l n << << l << n << c n << << c << n << i.nd + c n << << i.second + c << << endl; n t[g] = i.second + c; n } n } n } n int main() { n int n; n assert(scanf( %d , &n) == 1); n int l[n]; n for (int i = 0; i < int(n); ++i) assert(scanf( %d , l + i) == 1); n int c[n]; n for (int i = 0; i < int(n); ++i) assert(scanf( %d , c + i) == 1); n for (int i = 0; i < int(n); ++i) proc(l[i], c[i]); n if (t.find(1) == t.end()) n printf( -1 n ); n else n printf( %d n , t[1]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long read() { n char x = getchar(); n long long ans = 0; n while (!isdigit(x)) x = getchar(); n while (isdigit(x)) ans = ans * 10 + x - 0 , x = getchar(); n return ans; n } n long long in[250005], now, n, vis[250005], dp[250005][2]; n vector > E[250005]; n void add_edge(long long u, long long v, long long w) { n E[u].push_back(make_pair(v, w)); n } n bool cmp(pair x, pair y) { n return in[x.first] > in[y.first]; n } n struct node { n long long siz, sum; n priority_queue q1, q2; n void pop(long long x) { n q2.push(x); n siz--; n sum -= x; n } n void push(long long x) { n q1.push(x); n siz++; n sum += x; n } n void init() { n while (!q1.empty() && !q2.empty() && q1.top() == q2.top()) n q1.pop(), q2.pop(); n } n void pop() { n init(); n siz--; n sum -= q1.top(); n q1.pop(); n } n long long top() { n init(); n return q1.top(); n } n } P[250005]; n void erase(long long u) { n for (long long i = 0; i < E[u].size(); i++) { n long long v = E[u][i].first, w = E[u][i].second; n if (in[v] <= now) break; n P[v].push(w); n } n } n void dfs(long long u, long long pre) { n vis[u] = now; n long long tot = 0; n long long num = in[u] - now; n while (P[u].siz > num) P[u].pop(); n for (long long i = 0; i < E[u].size(); i++) { n long long v = E[u][i].first, w = E[u][i].second; n if (in[v] <= now) break; n if (v == pre) continue; n dfs(v, u); n } n vector tmp1, tmp2; n for (long long i = 0; i < E[u].size(); i++) { n long long v = E[u][i].first, w = E[u][i].second; n if (v == pre) continue; n if (in[v] <= now) break; n long long tmp = dp[v][1] + w - dp[v][0]; n if (tmp <= 0) { n num--, tot += dp[v][1] + w; n continue; n } n tot += dp[v][0]; n P[u].push(tmp), tmp2.push_back(tmp); n } n while (P[u].siz && P[u].siz > num) { n tmp1.push_back(P[u].top()); n P[u].pop(); n } n dp[u][0] = tot + P[u].sum; n while (P[u].siz && P[u].siz > num - 1) { n tmp1.push_back(P[u].top()); n P[u].pop(); n } n dp[u][1] = tot + P[u].sum; n for (long long i = 0; i < tmp1.size(); i++) P[u].push(tmp1[i]); n for (long long i = 0; i < tmp2.size(); i++) P[u].pop(tmp2[i]); n } n signed main() { n cin >> n; n long long tot = 0; n for (long long i = 1; i < n; i++) { n long long u = read(), v = read(), w = read(); n add_edge(u, v, w); n add_edge(v, u, w); n tot += w; n } n cout << tot << ; n for (long long i = 1; i <= n; i++) in[i] = E[i].size(); n for (long long i = 1; i <= n; i++) sort(E[i].begin(), E[i].end(), cmp); n vector > V; n for (long long i = 1; i <= n; i++) V.push_back(make_pair(in[i], i)); n sort(V.begin(), V.end()); n long long pos = 0; n for (now = 1; now < n; now++) { n while (pos < V.size() && V[pos].first == now) erase(V[pos].second), pos++; n tot = 0; n for (long long j = pos; j < V.size(); j++) { n if (vis[V[j].second] == now) continue; n dfs(V[j].second, 0); n tot += dp[V[j].second][0]; n } n cout << tot << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, a[1024], b[1024], c[1024], t[4], dd, d, have[1024]; n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n bool flag = 0; n for (int i = 0; i < n; i++) { n cin >> b[i]; n if (b[i] != a[i]) { n c[d] = i; n d++; n } else { n have[a[i]]++; n have[b[i]]++; n } n } n dd = 0; n for (int i = 1; i <= n; i++) { n if (have[i] == 0) { n t[dd] = i; n dd++; n } n } n if (d == 1) { n a[c[0]] = t[0]; n } else { n int br = 0, br1 = 0; n for (int i = 0; i < 2; i++) { n if (a[c[i]] != t[i]) br++; n if (b[c[i]] != t[i]) br1++; n } n if (br == 1 && br1 == 1) { n a[c[0]] = t[0]; n a[c[1]] = t[1]; n } else { n a[c[0]] = t[1]; n a[c[1]] = t[0]; n } n } n for (int i = 0; i < n - 1; i++) { n cout << a[i] << ; n } n cout << a[n - 1] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100005; n int n, s; n long long a[maxn], b[maxn], c[maxn]; n vector p[2]; n bool cmp1(int i, int j) { return b[i] - c[i] > b[j] - c[j]; } n bool cmp2(int i, int j) { return c[i] - b[i] > c[j] - b[j]; } n int main() { n scanf( %d%d , &n, &s); n long long tot = 0, A = 0, B = 0, v1 = 0, v2 = 0; n p[0].clear(); n p[1].clear(); n for (int i = 0; i < n; i++) { n scanf( %I64d%I64d%I64d , a + i, b + i, c + i); n tot += a[i]; n if (b[i] > c[i]) { n p[0].push_back(i); n A += a[i] * b[i]; n v1 += a[i]; n } else { n p[1].push_back(i); n B += a[i] * c[i]; n v2 += a[i]; n } n } n sort(p[0].begin(), p[0].end(), cmp1); n sort(p[1].begin(), p[1].end(), cmp2); n long long ans = 0; n long long c1 = v1 / s + (v1 % s ? 1 : 0); n long long c2 = v2 / s + (v2 % s ? 1 : 0); n tot = tot / s + (tot % s ? 1 : 0); n if (c1 + c2 > tot) { n long long tmp = A + B; n long long now = v1 % s; n for (int i = p[0].size() - 1; i >= 0; i--) { n now -= a[p[0][i]]; n long long cnt = a[p[0][i]]; n if (now < 0) cnt = a[p[0][i]] + now; n tmp += (c[p[0][i]] - b[p[0][i]]) * cnt; n if (now <= 0) break; n } n ans = max(ans, tmp); n tmp = A + B; n now = v2 % s; n for (int i = p[1].size() - 1; i >= 0; i--) { n now -= a[p[1][i]]; n long long cnt = a[p[1][i]]; n if (now < 0) cnt = a[p[1][i]] + now; n tmp += (b[p[1][i]] - c[p[1][i]]) * cnt; n if (now <= 0) break; n } n ans = max(ans, tmp); n } else n ans = A + B; n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = 2.0 * acos(0.0); n const int INF = 1000 * 1000 * 1000; n const int maxn = 1100; n int W, H, N, M, cnt, tot; n char g[maxn][maxn]; n int upp[maxn][maxn], lf[maxn][maxn]; n bool can; n void play(int x, int y) { n if (x == N || y == M) return; n bool r, d; n if (y + 1 < M && upp[x][y + 1] >= H) n r = true; n else n r = false; n if (x + 1 < N && lf[x + 1][y] >= W) n d = true; n else n d = false; n if (r && d) n can = false; n else if (r) { n cnt += H; n play(x, y + 1); n } else if (d) { n cnt += W; n play(x + 1, y); n } n } n int solve(int maxVal, int coefh, int coefw, int sx, int sy) { n for (int len = 1; len <= maxVal; len++) { n W += (coefw); n H += (coefh); n bool all = true; n for (int k = 0; k < H && all; k++) n for (int t = 0; t < W && all; t++) { n if (g[k + sx][t + sy] != X ) all = false; n } n if (!all) continue; n can = true; n cnt = H * W; n play(sx + H - 1, sy + W - 1); n if (can && cnt == tot) return H * W; n } n return -1; n } n int main() { n ios_base::sync_with_stdio(false); n int i, j, k; n cin >> N >> M; n int sx = -1, sy; n tot = 0; n W = H = 0; n for (int i = 0; i < N; i++) n for (int j = 0; j < M; j++) { n cin >> g[i][j]; n if (g[i][j] == X ) tot++; n if (g[i][j] == X && sx == -1) { n sx = i, sy = j; n } n } n memset(upp, 0, sizeof upp); n memset(lf, 0, sizeof lf); n for (int i = 0; i < M; i++) upp[0][i] = (g[0][i] == X ? 1 : 0); n for (int i = 0; i < N; i++) lf[i][0] = (g[i][0] == X ? 1 : 0); n for (int i = 0; i < N; i++) n for (int j = 0; j < M; j++) { n if (i != 0 && g[i][j] == X ) upp[i][j] = upp[i - 1][j] + 1; n if (j != 0 && g[i][j] == X ) lf[i][j] = lf[i][j - 1] + 1; n } n int w = 0, h = 0; n for (int i = sy; i < M && g[sx][i] == X ; i++) w++; n for (int i = sx; i < N && g[i][sy] == X ; i++) h++; n int coefh = 0, coefw = 0; n int ans; n W = w, H = 0; n ans = solve(h, 1, 0, sx, sy); n W = 0, H = h; n int ans2 = solve(w, 0, 1, sx, sy); n if (ans == -1 || (ans2 != -1 && ans2 < ans)) ans = ans2; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int k; n int l; n cin >> k >> l; n int u[k]; n int y[l]; n for (int i = 0; i < k; i++) { n cin >> u[i]; n } n for (int i = 0; i < l; i++) { n cin >> y[i]; n } n long long int h = 0; n long long int v = 0; n int f = 0; n int g = 0; n int p = 0; n while (p != k || g != l) { n if (v == h && v == 0) { n v += y[g]; n h += u[p]; n g++; n p++; n } else if (v > h) { n h += u[p]; n p++; n } else if (v < h) { n v += y[g]; n g++; n } else { n f++; n h = 0; n v = 0; n } n } n cout << f + 1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, k, x = 1; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> k; n m = k * (5 + (n - 1) * 6); n cout << m << endl; n while (n--) { n cout << x * k << << (x + 1) * k << << (x + 2) * k << n << (x + 4) * k << endl; n x += 6; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 3e5 + 5; n const long double PI = 3.1415926535; n const long double eps = 1e-07; n const long long INF = 1e18; n const int inf = 1e9; n const long long M = 305; n const string IO[2]{ NO n , YES n }; n const string io[2]{ No n , Yes n }; n struct STree { n int start; n vector t; n STree(int n) { n start = 1; n while (start < n) start *= 2; n t = vector(2 * start, inf); n } n int min(int v, int l, int r, int ql, int qr) { n if (l > qr || r < ql) return inf; n if (l >= ql && r <= qr) return t[v]; n int c = (l + r) / 2; n return std::min(min(2 * v, l, c, ql, qr), min(2 * v + 1, c + 1, r, ql, qr)); n } n void upd(int v, int l, int r, int p, int x) { n if (l > p || r < p) return; n if (l == r) { n t[v] = x; n return; n } n int c = (l + r) / 2; n upd(2 * v, l, c, p, x); n upd(2 * v + 1, c + 1, r, p, x); n t[v] = std::min(t[2 * v], t[2 * v + 1]); n } n }; n void solve() { n int m; n cin >> m; n vector x(m); n for (int i = 0; i < m; ++i) cin >> x[i]; n sort(x.begin(), x.end()); n auto last = unique(x.begin(), x.end()); n x.erase(last, x.end()); n m = x.size(); n int a, b; n cin >> b >> a; n int n = b - a + 1; n STree st = STree(n); n int start = st.start; n vector maxx(n, 1); n for (auto& nx : x) { n int fa = ((a - 1) / nx) * nx + nx; n for (int i = fa; i <= b; i += nx) maxx[i - a] = max(maxx[i - a], nx - 1); n } n st.upd(1, 0, start - 1, n - 1, 0); n for (int i = b - 1; i >= a; --i) { n int x = i - a; n int cw = maxx[x]; n int ans = 1 + st.min(1, 0, start - 1, x + 1, x + cw); n st.upd(1, 0, start - 1, x, ans); n } n cout << st.min(1, 0, start - 1, 0, 0) << n ; n } n signed main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n int t = 1; n while (t--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n vector a(n); n for (int i = 0; i < n; ++i) cin >> a[i]; n for (int j = 0; j < m; ++j) { n vector indx; n for (int i = 0; i < n; ++i) { n if (a[i][j] == # ) indx.push_back(i); n } n for (int i = 1; i < indx.size(); ++i) { n if (a[indx[i]] != a[indx[0]]) { n cout << No ; n return 0; n } n } n } n cout << Yes ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2 * 1e5 + 100; n vector Prime; n int main() { n Prime.clear(); n int n, k; n scanf( %d%d , &n, &k); n int flag = 1; n for (int i = 2; flag && i <= n; i++) { n if (n % i == 0) { n while (n % i == 0) { n Prime.push_back(i); n n /= i; n } n if (n == 1) { n flag = 0; n } n if (n < i && n > 1) { n flag = 0; n Prime.push_back(n); n } n } n } n if (Prime.size() < k) { n cout << -1 << endl; n } else { n for (int i = 0; i < k - 1; i++) { n cout << Prime[i] << ; n } n int ans = 1; n for (int i = k - 1; i < Prime.size(); i++) { n ans *= Prime[i]; n } n if (ans != 1) { n cout << ans << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[10]; n int n; n int notzero[12], cnt[12], ten[10], ans; n int main() { n ten[0] = 1; n for (int i = 1; i < 8; ++i) ten[i] = 10 * ten[i - 1]; n scanf( %d , &n); n for (int i = 1; i <= n; ++i) { n scanf( %s , s); n int len = strlen(s); n notzero[s[0] - a ] = 1; n for (int j = 0; j < len; ++j) cnt[s[j] - a ] += ten[len - j - 1]; n } n int zero = -1; n for (int i = 0; i < 10; ++i) { n if (notzero[i] == 0) { n if (zero == -1 || cnt[i] > cnt[zero]) zero = i; n } n } n vector v; n for (int i = 0; i < 10; ++i) { n if (zero != i) v.push_back(cnt[i]); n } n sort(v.begin(), v.end()); n for (int i = 0; i < 9; ++i) { n ans += (9 - i) * v[i]; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool a[4]; n int main() { n int n; n string s; n int cz = 0; n int c1 = 0; n int c0 = 0; n cin >> s; n for (int i = 0; i < s.length(); ++i) n if (s[i] == 0 ) n ++c0; n else if (s[i] == 1 ) n ++c1; n else if (s[i] == ? ) n ++cz; n n = s.length(); n if (c0 + cz > c1) a[0] = true; n if (c1 + cz > c0 + 1) a[3] = true; n if (s.length() % 2 == 0) { n int p = s.length() / 2; n if (abs(c0 - p) + abs(c1 - p) <= cz) { n if (s[n - 1] == 1 || s[n - 1] == ? && c1 < p) a[1] = true; n if (s[n - 1] == 0 || s[n - 1] == ? && c0 < p) a[2] = true; n } n } else { n int p = s.length() / 2; n if (abs(c0 - p) + abs(c1 - (p + 1)) <= cz) { n if (s[n - 1] == 1 || s[n - 1] == ? && c1 < p + 1) a[1] = true; n if (s[n - 1] == 0 || s[n - 1] == ? && c0 < p) a[2] = true; n } n } n if (a[0]) cout << 00 << endl; n if (a[1]) cout << 01 << endl; n if (a[2]) cout << 10 << endl; n if (a[3]) cout << 11 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, k; n cin >> n >> k; n long long v[n + 10]; n for (long long i = 0; i < n; i++) { n cin >> v[i]; n } n sort(v, v + n); n k--; n long long div = k / n; n long long cnt = 0; n long long val = v[div]; n for (long long i = 0; i < n; i++) { n if (v[i] == val) cnt++; n if (v[i] < val) k = k - n; n } n long long amt = cnt; n long long now = k / amt; n cout << val << << v[now] << endl; n } n "} +{"func_code_string": "#include n using namespace std; n struct atom { n long long f, w, where; n void scan() { scanf( %I64d%I64d , &f, &w); } n } x[310000]; n priority_queue A, B; n int compare(atom k1, atom k2) { n return k1.f > k2.f || (k1.f == k2.f && k1.where < k2.where); n } n int n, pre, ans, where; n long long rem; n void insert(long long k1) { n if (!B.empty()) { n long long k2 = B.top(); n if (k2 > k1) { n A.push(-k2); n B.pop(); n B.push(k1); n rem += k2 - k1; n return; n } n } n A.push(-k1); n pre++; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) x[i].scan(), x[i].where = i; n n++; n x[n] = (atom){0, 0, n}; n sort(x + 1, x + n + 1, compare); n pre = 0, ans = 0, where = 0; n long long rem = 0; n for (int i = 1; i <= n; i++) n if (x[i].where == 1) where = i; n ans = where; n pre = where; n for (int i = 1; i < where; i++) A.push(-(x[i].w - x[i].f + 1)); n for (int i = where + 1; i <= n; i++) { n rem += x[i - 1].f - x[i].f; n if (i - 1 != where) insert(x[i - 1].w - x[i - 1].f + 1); n while (!A.empty()) { n long long k1 = -A.top(); n if (k1 <= rem) { n rem -= k1; n pre--; n A.pop(); n } else n break; n } n ans = min(ans, pre); n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, x, y, z; n string str[5][200]; n int blcks[5], whites[5]; n int ara[] = {0, 1, 2, 3}; n int main() { n cin >> n; n for (int i = 0; i < 4; i++) { n for (int j = 0; j < n; j++) cin >> str[i][j]; n int tmp = 0; n for (int j = 0; j < n; j++) { n for (int k = 0; k < n; k++) { n if ((j + k) % 2 == 0) { n if (str[i][j][k] == 0 ) n blcks[i]++; n else n whites[i]++; n } else { n if (str[i][j][k] == 1 ) n blcks[i]++; n else n whites[i]++; n } n } n } n } n int ans = 100000000; n do { n int tmp1 = whites[ara[0]] + blcks[ara[1]] + whites[ara[2]] + blcks[ara[3]]; n int tmp2 = whites[ara[1]] + blcks[ara[0]] + whites[ara[3]] + blcks[ara[2]]; n ans = min(ans, tmp1); n ans = min(ans, tmp2); n } while (next_permutation(ara, ara + 4)); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct SegTree { n int sz; n vector dat; n SegTree(int _sz = 1) { n sz = 1; n while (sz < _sz) sz <<= 1; n dat.resize(sz << 1); n } n void upd(int pos, int val) { n pos += sz - 1; n dat[pos] = val; n while (pos > 1) { n pos >>= 1; n dat[pos] = max(dat[pos << 1], dat[pos << 1 | 1]); n } n } n int qry(int id, int l, int r, int ql, int qr) { n if (qr < l || r < ql) return 0; n if (ql <= l && r <= qr) return dat[id]; n return max(qry(id << 1, l, l + r >> 1, ql, qr), n qry(id << 1 | 1, (l + r >> 1) + 1, r, ql, qr)); n } n int qry(int l, int r) { return qry(1, 1, sz, l, r); } n } segx, segy; n int n, m, V; n set> tph, thp; n void plant(int p, int h) { n vector> v; n for (auto it = thp.begin(); it != thp.end() && it->first < h; it++) { n v.emplace_back(it->second, it->first); n } n thp.emplace(h, p); n tph.emplace(p, h); n v.emplace_back(p, h); n reverse(v.begin(), v.end()); n for (auto p : v) { n segx.upd(p.first, 0); n } n for (auto p : v) { n int lis = segx.qry(p.first + 1, n) + 1; n segx.upd(p.first, lis); n segy.upd(p.second, lis); n } n } n void cutdown(int id) { n vector> v; n for (auto it = tph.begin(); id--; it++) { n if (id) n v.emplace_back(it->first, it->second); n else { n thp.erase(make_pair(it->second, it->first)); n segx.upd(it->first, 0); n segy.upd(it->second, 0); n tph.erase(it); n } n } n reverse(v.begin(), v.end()); n for (auto p : v) { n segy.upd(p.second, 0); n } n for (auto p : v) { n int lis = segy.qry(p.second + 1, V) + 1; n segx.upd(p.first, lis); n segy.upd(p.second, lis); n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> m; n segx = SegTree(n); n segy = SegTree(V = m + 10); n while (m--) { n int typ, x, y; n cin >> typ >> x; n if (typ == 1) { n cin >> y; n plant(x, y + m); n } else { n cutdown(x); n } n cout << segx.qry(1, n) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n int n, k; n cin >> n >> k; n string s; n cin >> s; n string res = ; n for (int i = 0; i < n; i++) { n if ((s[i] - a ) >= ( z - s[i])) { n if ((s[i] - a ) <= k) { n k -= (s[i] - a ); n res += a ; n } else { n res += (char)(s[i] - k); n k = 0; n } n } else { n if (( z - s[i]) <= k) { n k -= ( z - s[i]); n res += z ; n } else { n res += (char)(s[i] + k); n k = 0; n } n } n } n if (k != 0) { n cout << -1; n } else { n cout << res; n } n } n "} +{"func_code_string": "#include n using namespace std; n int parent[300005], maxLen[300005]; n int findRoot(int u) { n int root = u; n while (parent[root] != root) { n root = parent[root]; n } n while (parent[u] != root) { n int y = parent[u]; n parent[u] = root; n u = y; n } n return root; n } n void unionNum(int u, int v) { n int ru = findRoot(u), rv = findRoot(v); n if (ru == rv) return; n if (maxLen[ru] > maxLen[rv]) { n parent[rv] = ru; n maxLen[ru] = max(maxLen[ru], maxLen[ru] / 2 + maxLen[rv] / 2 + n maxLen[ru] % 2 + maxLen[rv] % 2 + 1); n } else { n swap(ru, rv); n parent[rv] = ru; n maxLen[ru] = max(maxLen[ru], maxLen[ru] / 2 + maxLen[rv] / 2 + n maxLen[ru] % 2 + maxLen[rv] % 2 + 1); n } n } n int visited[300005] = {0}; n bool nVis(int &i, int n) { n while (i <= n && visited[i] == 1) i++; n if (i <= n) return true; n return false; n } n void dfs(int node, vector child[]) { n map v1, v2, d1, d2; n stack myStack; n myStack.push(node); n v1[node] = 1; n d1[node] = 0; n visited[node] = 1; n while (!myStack.empty()) { n int y = myStack.top(); n myStack.pop(); n for (size_t i = 0; i < child[y].size(); i++) { n if (v1[child[y][i]] == 0) { n v1[child[y][i]] = 1; n d1[child[y][i]] = d1[y] + 1; n myStack.push(child[y][i]); n visited[child[y][i]] = 1; n } n } n } n for (map::iterator it = d1.begin(); it != d1.end(); it++) { n if (d1[node] < it->second) { n node = it->first; n } n } n myStack.push(node); n d2[node] = 0; n v2[node] = 1; n while (!myStack.empty()) { n int y = myStack.top(); n myStack.pop(); n parent[y] = node; n for (size_t i = 0; i < child[y].size(); i++) { n if (v2[child[y][i]] == 0) { n v2[child[y][i]] = 1; n d2[child[y][i]] = d2[y] + 1; n maxLen[node] = max(maxLen[node], d2[child[y][i]]); n myStack.push(child[y][i]); n } n } n } n } n int main() { n int n, m, q, a, b; n scanf( %d%d%d , &n, &m, &q); n for (int i = 0; i <= n; i++) { n parent[i] = i; n maxLen[i] = 0; n } n vector child[n + 1]; n for (int i = 0; i < m; i++) { n scanf( %d%d , &a, &b); n child[a].push_back(b); n child[b].push_back(a); n } n int i = 1; n while (nVis(i, n)) { n dfs(i, child); n } n while (q--) { n int type; n scanf( %d , &type); n if (type == 1) { n scanf( %d , &a); n printf( %d n , maxLen[findRoot(a)]); n } else { n scanf( %d%d , &a, &b); n unionNum(a, b); n } n } n } n "} +{"func_code_string": "#include n int n, m; n struct Matrix { n long long a[2][2]; n } mt[205]; n Matrix mult(Matrix x, Matrix y) { n Matrix c; n for (int i = 0; i < 2; i++) n for (int j = 0; j < 2; j++) c.a[i][j] = 0; n for (int i = 0; i < 2; i++) n for (int j = 0; j < 2; j++) n for (int k = 0; k < 2; k++) n c.a[i][j] = ((long long)c.a[i][j] + (long long)x.a[i][k] * y.a[k][j]) % n 1000000007; n return c; n } n void init(long long lim) { n mt[0].a[0][0] = 0; n mt[0].a[0][1] = 1; n mt[0].a[1][0] = 1; n mt[0].a[1][1] = 1; n long long t = 2; n for (int i = 1; t <= lim; i++, t <<= 1) { n mt[i] = mult(mt[i - 1], mt[i - 1]); n } n } n Matrix calc(long long b) { n Matrix res; n res.a[0][0] = 1; n res.a[0][1] = 0; n res.a[1][0] = 0; n res.a[1][1] = 1; n for (int i = 0; b; i++) { n if (b & 1) res = mult(res, mt[i]); n b >>= 1; n } n return res; n } n long long a1[800005], a2[800005], sum[800005]; n Matrix prev[800005]; n void update(int p) { n a1[p] = n (a1[p << 1] * prev[p << 1].a[0][0] + a2[p << 1] * prev[p << 1].a[0][1] + n a1[(p << 1) + 1] * prev[(p << 1) + 1].a[0][0] + n a2[(p << 1) + 1] * prev[(p << 1) + 1].a[0][1]) % n 1000000007; n a2[p] = n (a1[p << 1] * prev[p << 1].a[1][0] + a2[p << 1] * prev[p << 1].a[1][1] + n a1[(p << 1) + 1] * prev[(p << 1) + 1].a[1][0] + n a2[(p << 1) + 1] * prev[(p << 1) + 1].a[1][1]) % n 1000000007; n } n void pushdown(int p) { n prev[p << 1] = mult(prev[p << 1], prev[p]); n prev[(p << 1) + 1] = mult(prev[(p << 1) + 1], prev[p]); n prev[p].a[0][0] = 1; n prev[p].a[0][1] = 0; n prev[p].a[1][0] = 0; n prev[p].a[1][1] = 1; n update(p); n } n void merge(int p, int l, int r, int gl, int gr, Matrix val) { n if (l == gl && r == gr) { n if (l == r) { n prev[p] = mult(prev[p], val); n } else { n prev[p] = mult(prev[p], val); n pushdown(p); n } n return; n } n pushdown(p); n int mid = (l + r) >> 1; n if (gr <= mid) n merge(p << 1, l, mid, gl, gr, val); n else if (gl > mid) n merge((p << 1) + 1, mid + 1, r, gl, gr, val); n else n merge(p << 1, l, mid, gl, mid, val), n merge((p << 1) + 1, mid + 1, r, mid + 1, gr, val); n update(p); n } n long long query(int p, int l, int r, int gl, int gr) { n if (l != r) { n pushdown(p); n } n if (l == gl && r == gr) { n return (a1[p] * prev[p].a[0][0] + a2[p] * prev[p].a[0][1]) % 1000000007; n } n int mid = (l + r) >> 1; n if (gr <= mid) n return query(p << 1, l, mid, gl, gr); n else if (gl > mid) n return query((p << 1) + 1, mid + 1, r, gl, gr); n else n return (query(p << 1, l, mid, gl, mid) + n query((p << 1) + 1, mid + 1, r, mid + 1, gr)) % n 1000000007; n update(p); n } n int it[800005]; n void build(int p, int l, int r) { n prev[p].a[0][0] = 1; n prev[p].a[0][1] = 0; n prev[p].a[1][0] = 0; n prev[p].a[1][1] = 1; n if (l == r) { n if (it[l] == 1) n a1[p] = a2[p] = 1; n else { n Matrix r = calc(it[l] - 1); n a1[p] = (r.a[0][0] + r.a[0][1]) % 1000000007; n a2[p] = (r.a[1][0] + r.a[1][1]) % 1000000007; n } n return; n } n int mid = (l + r) >> 1; n build(p << 1, l, mid); n build((p << 1) + 1, mid + 1, r); n update(p); n } n int main() { n scanf( %d%d , &n, &m); n init(10000000000000000ll); n for (int i = 1; i <= n; i++) scanf( %d , &it[i]); n build(1, 1, n); n for (int i = 1; i <= m; i++) { n int tp; n scanf( %d , &tp); n if (tp == 1) { n int l, r, x; n scanf( %d%d%d , &l, &r, &x); n merge(1, 1, n, l, r, calc(x)); n } else { n int l, r; n scanf( %d%d , &l, &r); n printf( %I64d n , query(1, 1, n, l, r) % 1000000007); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int sum[1000005]; n int main() { n int n, x; n cin >> n; n for (int i = 0; i < n; ++i) n for (int j = 0; j < n; ++j) { n scanf( %d , &x); n if (i == j) sum[i] = x; n } n int all = 0; n for (int i = 0; i < n; ++i) all += sum[i]; n int q, tipo; n cin >> q; n while (q--) { n scanf( %d , &tipo); n if (tipo == 3) { n printf( %d , all % 2); n } else { n scanf( %d , &x); n x--; n if (sum[x] == 0) { n sum[x] = 1; n ++all; n } else { n sum[x] = 0; n --all; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int t; n cin >> t; n while (t--) { n long long int n, s = 0; n cin >> n; n long long int* arr = new long long int[n]; n for (long long int i = 0; i < n; i++) { n cin >> arr[i]; n s += arr[i]; n } n if (s == 0) n cout << NO n << n ; n else if (s > 0) { n cout << YES n << n ; n sort(arr, arr + n, greater()); n for (long long int i = 0; i < n; i++) cout << arr[i] << ; n cout << n ; n } else { n cout << YES n << n ; n sort(arr, arr + n); n for (long long int i = 0; i < n; i++) cout << arr[i] << ; n cout << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 20, S = (1 << 16) + 10, V = 2048; n bitset dp[S]; n int a[N], id[N]; n priority_queue > q; n int main() { n int n, k, v = 0; n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; ++i) scanf( %d , &a[i]), v += a[i]; n dp[0][0] = 1; n int u = (1 << n) - 1; n for (int s = 0; s <= u; ++s) { n for (int i = v / k; i >= 1; --i) n if (dp[s][i * k]) dp[s][i] = 1; n for (int i = 1; i <= n; ++i) n if (!(s >> i - 1 & 1)) dp[s | (1 << i - 1)] |= dp[s] << a[i]; n } n puts(dp[u][1] ? YES : NO ); n if (!dp[u][1]) return 0; n int c = 1e9; n for (int s = u, j = 1; s;) n for (int t = j, ok = 0; !ok; t *= k, c -= !ok) n for (int i = 1; i <= n; ++i) { n if (t < a[i]) continue; n if ((s >> i - 1 & 1) && dp[s ^ (1 << i - 1)][t - a[i]]) { n id[i] = c, s ^= 1 << i - 1, j = t - a[i], ok = 1; n break; n } n } n for (int i = 1; i <= n; ++i) q.push(make_pair(-(id[i] - c), a[i])); n while (q.size() > 1) { n pair x = q.top(); n q.pop(); n pair y = q.top(); n q.pop(); n printf( %d %d n , x.second, y.second); n int v = x.second + y.second, u = 0; n while (v % k == 0) v /= k, ++u; n q.push(make_pair(-(-x.first + u), v)); n } n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /stack:200000000 ) n #pragma GCC optimize( Ofast ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n using namespace std; n long long n, k, s, h[200005]; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> n >> k >> s; n h[0] = 1; n if (k * (n - 1) < s || k > s) { n cout << NO ; n return 0; n } n long long t = s / k, z = s % k; n for (long long i = 1; i <= z; i++) { n if (h[i - 1] + t + 1 <= n) { n h[i] = h[i - 1] + t + 1; n } else n h[i] = h[i - 1] - t - 1; n } n for (long long i = z + 1; i <= k; i++) { n if (h[i - 1] + t <= n) { n h[i] = h[i - 1] + t; n } else n h[i] = h[i - 1] - t; n } n cout << YES n ; n for (long long i = 1; i <= k; i++) cout << h[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x3f3f3f3f; n inline int Read() { n int x = 0, f = 1; n char c = getchar(); n while (c > 9 || c < 0 ) { n if (c == - ) f = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n x = x * 10 + c - 0 ; n c = getchar(); n } n return x * f; n } n struct EDGE { n int from, to, w, next; n } E[400005]; n int n, m; n int HEAD[200005]; n int dep[200005], CENT; n int pa[200005][50], maxx[200005][50]; n void ADD(int from, int to, int w) { n E[CENT].from = from; n E[CENT].to = to; n E[CENT].w = w; n E[CENT].next = HEAD[from]; n HEAD[from] = CENT++; n } n void DFS(int u, int f) { n pa[u][0] = f; n for (int i = HEAD[u]; i != -1; i = E[i].next) { n int to = E[i].to; n if (to != f) { n dep[to] = dep[u] + 1; n maxx[to][0] = E[i].w; n DFS(to, u); n } n } n } n int maxh; n void deal() { n int j; n for (j = 1; (1 << j) < n; j++) n for (int i = 1; i <= n; i++) { n int t = pa[i][j - 1]; n pa[i][j] = pa[pa[i][j - 1]][j - 1]; n maxx[i][j] = max(maxx[i][j - 1], maxx[t][j - 1]); n } n maxh = j - 1; n } n int swim(int x, int k, int &ma) { n ma = 0; n for (int i = 0; i <= maxh; i++) { n if (k >> i & 1) { n ma = max(ma, maxx[x][i]); n x = pa[x][i]; n } n } n return x; n } n int LCA(int x, int y) { n if (dep[x] > dep[y]) swap(x, y); n int ans = 0; n y = swim(y, dep[y] - dep[x], ans); n if (x == y) return ans; n for (int i = maxh; i >= 0; i--) { n if (pa[x][i] != pa[y][i]) { n ans = max(ans, max(maxx[x][i], maxx[y][i])); n x = pa[x][i], y = pa[y][i]; n } n } n return max(ans, max(maxx[x][0], maxx[y][0])); n } n const int N = 200005; n struct edge { n int from, to, w, next; n int ty; n bool operator<(const edge a) const { return w < a.w; } n }; n int pre[N], head[N]; n int cnt; n edge e[200005 + 5]; n void add(int from, int to, int w) { n e[cnt].from = from; n e[cnt].to = to; n e[cnt].w = w; n e[cnt].next = head[from]; n e[cnt].ty = 0; n head[from] = cnt++; n } n int find(int x) { n if (x == pre[x]) return x; n return pre[x] = find(pre[x]); n } n void Kruskal() { n for (int i = 1; i <= n; ++i) pre[i] = i; n sort(e, e + cnt); n for (int i = 0; i < cnt; ++i) { n int u = find(e[i].from); n int v = find(e[i].to); n if (u != v) { n pre[u] = v; n ADD(e[i].from, e[i].to, e[i].w); n ADD(e[i].to, e[i].from, e[i].w); n e[i].ty = 1; n } n } n } n int main() { n while (scanf( %d %d , &n, &m) != EOF) { n CENT = cnt = 0; n for (int i = 1; i <= n; i++) head[i] = HEAD[i] = -1; n for (int i = 1; i <= m; i++) { n int u = Read(), v = Read(), w = Read(); n add(u, v, w); n } n Kruskal(); n DFS(1, -1); n deal(); n int ans = 0; n for (int i = 0; i < cnt; i++) { n if (!e[i].ty) { n int u = e[i].from, v = e[i].to; n int minn = LCA(u, v); n if (minn == e[i].w) ans++; n } n } n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n pair a[200005]; n signed main() { n long long n, j; n cin >> n >> j; n j %= 2 * n; n long long x0, y0; n cin >> x0 >> y0; n for (long long i = 0; i < n; i++) { n cin >> a[i].first >> a[i].second; n } n for (long long i = 1; i <= j; i++) { n x0 = 2 * a[(i - 1) % n].first - x0; n y0 = 2 * a[(i - 1) % n].second - y0; n } n cout << x0 << << y0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int T; n cin >> T; n while (T--) { n long long x, y; n cin >> x >> y; n if (y % x == 0LL) { n cout << x << n ; n } else if (x > y) { n cout << x + y << n ; n } else { n cout << (y / x) * x + (y - (y / x) * x) / 2 << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn=1e5+10; n n int a[maxn]; n int f[maxn]; n int n,m,gcnt,ans; n n int main() n { n scanf( %d ,&n); n for (int i=1;i<=n;i++) scanf( %d ,&a[i]),f[i]=n+1; n gcnt=1; n for (int i=2,prevmin=0;i<=n;i++) n { n if (a[i-1]!=a[i]) gcnt++; n f[a[i-1]]=min(f[a[i]]-1+(a[i-1]==a[i]),prevmin); n prevmin=min(prevmin,f[a[i-1]]); n } n ans=n; n for (int i=0;i<=n;i++) ans=min(ans,f[i]+gcnt); n printf( %d n ,ans); n } n n "} +{"func_code_string": "#include n using namespace std; n char s[2005]; n const int mod = 1e9 + 7; n int n, k, t[2005]; n int a[2005][2005], b[2005][2005]; n int mp(const int &a, const int &b) { return (int)(1ll * a * b % mod); } n int add(const int &a, const int &b) { return (a + b) % mod; } n int main() { n scanf( %d %d %s , &n, &k, s); n int i, j, u, v, d, e; n for (i = 0; i < n; i++) t[i + 1] = s[i] - a ; n for (i = 0; i <= n + 1; i++) a[i][0] = 1; n for (i = n; i > 0; i--) { n v = n - i; n for (j = 0; j <= k; j++) { n b[i][j] = add(b[i + 1][j], mp(t[i], a[i + 1][j])); n a[i][j] = add(a[i][j], b[i][j]); n for (u = 0; u <= v / 2; u++) { n e = j - (v - u + 1) * (u + 1); n if (e < 0) break; n if (2 * u == v) n a[i][j] = add(mp(25 - t[i + u], a[i + u + 1][e]), a[i][j]); n else { n a[i][j] = add(mp(25 - t[i + u], a[i + u + 1][e]), a[i][j]); n a[i][j] = add(mp(25 - t[i + v - u], a[i + v - u + 1][e]), a[i][j]); n } n } n } n } n printf( %d n , a[1][k]); n } n "} +{"func_code_string": "#include n using namespace std; n bool isPrime(int n) { n if (n <= 1) return false; n if (n <= 3) return true; n if (n % 2 == 0 || n % 3 == 0) return false; n for (int i = 5; i * i <= n; i = i + 6) n if (n % i == 0 || n % (i + 2) == 0) return false; n return true; n } n int nextPrime(int N) { n if (N <= 1) return 2; n int prime = N; n bool found = false; n while (!found) { n prime++; n if (isPrime(prime)) found = true; n } n return prime; n } n long long int powerexp(long long int x, long long int n) { n long long int result = 1; n while (n) { n if (n & 1) result = result * x % 1000000007; n n = n / 2; n x = x * x % 1000000007; n } n return result; n } n int gcd(int a, int b) { n if (a == 0) return b; n if (b == 0) return a; n if (a == b) return a; n if (a > b) return gcd(a - b, b); n return gcd(a, b - a); n } n int largest_divisor(long long int n) { n long long int i; n for (i = n / 2; i >= 1; i--) { n if (n % i == 0) { n return i; n } n } n return 0; n } n bool checkPalindrome(string str) { n int n = str.length(); n int count = 0; n for (int i = 0; i < n / 2; ++i) n if (str[i] != str[n - i - 1]) ++count; n return (count <= 1); n } n bool countDivisors(long long int n) { n int cnt = 0; n for (int i = 3; i <= sqrt(n); i = i + 2) { n if (n % i == 0) { n return true; n } n } n return false; n } n long long int factorial(long long int n) { n if (n == 0) return 0; n return n * factorial(n - 1); n } n long long int lcm(long long int a, long long int b) { n return (a / gcd(a, b)) * b; n } n void fastIO() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n } n int main() { n long long int t = 1; n while (t--) { n long long int n; n cin >> n; n long long int a[n]; n long long int z = 0, p = 0, neg = 0; n long long int res = 0; n for (long long int i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] == 0) { n res++; n z++; n } else if (a[i] > 0) { n res = res + (a[i] - 1); n p++; n } else { n res = res + (-1 - a[i]); n neg++; n } n } n if (neg % 2 == 1 && z == 0) { n res += 2; n } n cout << res << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = (int)2e9; n int main() { n int k, n, m, q; n cin >> k >> n >> m >> q; n map> rec; n vector art(n); n map> b; n for (int(i) = (int)(0); (i) < (int)n; ++(i)) cin >> art[i]; n sort(art.begin(), art.end()); n string s; n getline(cin, s); n for (int(i) = (int)(0); (i) < (int)m; ++(i)) { n getline(cin, s); n int p = s.find( : ); n string ar = s.substr(0, p); n s = s.substr(p + 2, s.size()); n s += , ; n while (s != ) { n p = s.find( ); n string t = s.substr(0, p); n s = s.substr(p + 1, s.size()); n p = s.find( , ); n string t2 = s.substr(0, p); n s = s.substr(p + 2, s.size()); n int col = atoi(t2.c_str()); n rec[ar][t] = col; n } n } n for (int(i) = (int)(0); (i) < (int)q; ++(i)) { n int t; n cin >> t; n string st; n cin >> st; n b[t][st]++; n for (map>::iterator it1 = rec.begin(); n it1 != rec.end(); ++it1) { n bool ok = true; n for (map::iterator it2 = it1->second.begin(); n it2 != it1->second.end(); ++it2) { n if (b[t].find(it2->first) == b[t].end() || n b[t][it2->first] < it2->second) { n ok = false; n break; n } n } n if (ok) { n for (map::iterator it2 = it1->second.begin(); n it2 != it1->second.end(); ++it2) { n b[t][it2->first] -= it2->second; n if (b[t][it2->first] == 0) b[t].erase(it2->first); n } n b[t][it1->first]++; n break; n } n } n } n for (int(i) = (int)(1); (i) < (int)k + 1; ++(i)) { n cout << b[i].size() << n ; n for (map::iterator it = b[i].begin(); it != b[i].end(); ++it) n if (it->second) cout << it->first << << it->second << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mx = 3005; n const int N = 100005; n int n, a[mx][mx], b[mx][mx], ans[N]; n pair t[N]; n inline int check(int lx, int rx, int ly, int ry) { n int cnt = b[rx][ry]; n if (lx) cnt -= b[lx - 1][ry]; n if (ly) cnt -= b[rx][ly - 1]; n if (lx && ly) cnt += b[lx - 1][ly - 1]; n int need = (rx - lx + 1) * (ry - ly + 1); n if (cnt != need) return -1; n if (ly) n if (a[rx][ly] == a[rx][ly - 1]) return -1; n if (lx) n if (a[lx][ry] == a[lx - 1][ry]) return -1; n for (int i = lx; i <= rx; i++) n if (a[i][ry] == a[i][ry + 1]) return false; n for (int i = ly; i <= ry; i++) n if (a[rx][i] == a[rx + 1][i]) return false; n return true; n } n int main() { n int n; n scanf( %d , &n); n for (int q = (0); q <= ((n)-1); q++) { n int x1, y1, x2, y2; n scanf( %d%d%d%d , &x1, &y1, &x2, &y2); n for (int i = x1; i < x2; i++) n for (int j = y1; j < y2; j++) a[i][j] = q + 1, b[i][j] = 1; n t[q] = make_pair(x1, y1); n } n for (int i = (0); i <= ((mx)-1); i++) n for (int j = (0); j <= ((mx)-1); j++) { n if (i - 1 >= 0) b[i][j] += b[i - 1][j]; n if (j - 1 >= 0) b[i][j] += b[i][j - 1]; n if (i - 1 >= 0 && j - 1 >= 0) b[i][j] -= b[i - 1][j - 1]; n } n random_shuffle(t, t + n); n for (int q = (0); q <= ((n)-1); q++) { n int si = t[q].first, sj = t[q].second; n int ei = si, ej = sj; n while (ei < mx && ej < mx) { n int ch = check(si, ei, sj, ej); n if (ch == -1) break; n if (ch == 1) { n for (int i = si; i <= ei; i++) n for (int j = sj; j <= ej; j++) ans[a[i][j]] = 1; n vector res; n for (int i = 0; i < N; i++) n if (ans[i]) res.push_back(i); n printf( YES %d n , (int)((res).end() - (res).begin())); n for (int i = (0); i <= (((int)((res).end() - (res).begin())) - 1); n i++) { n if (i) printf( ); n printf( %d , res[i]); n } n puts( ); n exit(0); n } n ei++; n ej++; n } n } n puts( NO ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n n #ifndef ONLINE_JUDGE n #include Mohit.h n #endif n n typedef long long ll; n typedef long double ld; n #define endl n n #define rep(i,n) for(ll i = 0; i < (n); ++i) n #define repA(i, a, n) for(ll i = a; i <= (n); ++i) n #define repD(i, a, n) for(ll i = a; i >= (n); --i) n #define trav(a, x) for(auto& a : x) n #define all(x) x.begin(), x.end() n #define ff first n #define ss second n #define pb push_back n typedef vector vll; n typedef vector> vpl; n const ld PI = 4*atan((ld)1); n const ll INF = 1e18; n const ll mod = 1e9+7; n n int main() n { n ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); n ll tt=1; n cin >> tt; n repA(qq,1,tt){ n ll n; cin >> n; n vll a(n); n rep(i,n){ n cin >> a[i]; n } n n ll ans = INF; n ll s1=a[0],s2=0,c1=1,c2=0; n ll m1=a[0],m2=INF; n n repA(i,1,n-1){ n if(i&1){ n m2 = min(m2,a[i]); s2 += a[i]; n ll t1 = (s2-m2)+(n-(c2))*m2; n ll t2 = (s1-m1)+(n-(c1-1))*m1; n ans = min(ans,t1+t2); n c2++; n }else{ n m1 = min(m1,a[i]); s1 += a[i]; n ll t1 = (s1-m1)+(n-(c1))*m1; n ll t2 = (s2-m2)+(n-(c2-1))*m2; n ans = min(ans,t1+t2); n c1++; n } n } n n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n long long n, z = 0; n cin >> n; n long long a[n], b[n]; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n } n for (long long i = 0; i < n; i++) { n cin >> b[i]; n } n vector neg, pos; n for (long long i = 0; i < n; i++) { n if (a[i] == b[i]) z++; n if ((a[i] - b[i]) >= 0) n pos.push_back(a[i] - b[i]); n else n neg.push_back(b[i] - a[i]); n } n if (!pos.empty()) sort(pos.begin(), pos.end()); n if (!neg.empty()) sort(neg.begin(), neg.end()); n long long ans = 0, cnt = 0, j = (long long)neg.size() - 1, n k = (long long)pos.size() - 1; n ans += (k * (k + 1)) / 2; n ans -= (z * (z - 1)) / 2; n while (j >= 0 && !pos.empty()) { n if (k >= 0 && neg[j] < pos[k]) { n cnt++; n k--; n } else { n ans += cnt; n j--; n } n } n cout << ans << endl; n return; n } n int main() { n long long t; n t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e5 + 10; n int a[MAXN]; n bool mark[MAXN]; n void add(int v, int u) { n while (mark[u] == false) { n cout << v << << u << endl; n mark[u] = true; n v = a[v]; n u = a[u]; n } n } n int dfs(int x) { n int ret = 1; n mark[x] = true; n if (mark[a[x]] == false) ret += dfs(a[x]); n return ret; n } n int main() { n ios::sync_with_stdio(false); n int n; n cin >> n; n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int i = 1; i <= n; i++) n if (a[i] == i) { n cout << YES << endl; n for (int j = 1; j <= n; j++) n if (j != i) cout << i << << j << endl; n return 0; n } n int p = -1; n for (int i = 1; i <= n; i++) n if (mark[i] == false) { n int x = dfs(i); n if (x % 2) { n cout << NO << endl; n return 0; n } else if (x == 2) n p = i; n } n if (p == -1) { n cout << NO << endl; n return 0; n } n fill(mark, mark + MAXN, false); n cout << YES << endl; n cout << p << << a[p] << endl; n mark[p] = mark[a[p]] = true; n for (int i = 1; i <= n; i++) n if (!mark[i]) add(p, i); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void task(); n int main() { n srand(time(0)); n task(); n return 0; n } n const int INF = 0x3f3f3f3f; n const int N = 1e6 + 10; n const int M = 1e7 + 100; n const int OLOLO = 0xFFFFFFFF; n int n, k; n long long int cnt[N]; n set vals; n long long int ans; n vector masks; n void task() { n cin >> n >> k; n for (int i = 0; i < n; ++i) { n int a; n cin >> a; n ++cnt[a]; n vals.insert(a); n } n for (int i = 0; i < (1 << 14); ++i) { n if (__builtin_popcount(i) == k) { n masks.push_back(i); n } n } n for (int val : vals) { n for (int mask : masks) { n int result = val & (mask ^ OLOLO); n result |= (val ^ OLOLO) & mask; n if (result < N) { n if (val == result) { n ans += cnt[val] * (cnt[val] - 1); n } else { n ans += cnt[val] * cnt[result]; n } n } n } n } n cout << ans / 2; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int mx = 0, a = 0, n; n string s; n cin >> n; n while (cin >> s) { n for (char c : s) n if (isupper(c)) a++; n mx = max(mx, a), a = 0; n } n cout << mx << endl; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void ckmax(T& x, T y) { n x = (y > x ? y : x); n } n template n inline void ckmin(T& x, T y) { n x = (y < x ? y : x); n } n namespace Fread { n const int SIZE = 1 << 21; n char buf[SIZE], *S, *T; n inline char getchar() { n if (S == T) { n T = (S = buf) + fread(buf, 1, SIZE, stdin); n if (S == T) return EOF; n } n return *S++; n } n } // namespace Fread n namespace Fwrite { n const int SIZE = 1 << 21; n char buf[SIZE], *S = buf, *T = buf + SIZE; n inline void flush() { n fwrite(buf, 1, S - buf, stdout); n S = buf; n } n inline void putchar(char c) { n *S++ = c; n if (S == T) flush(); n } n struct NTR { n ~NTR() { flush(); } n } ztr; n } // namespace Fwrite n namespace Fastio { n struct Reader { n template n Reader& operator>>(T& x) { n char c = Fread ::getchar(); n T f = 1; n while (c < 0 || c > 9 ) { n if (c == - ) f = -1; n c = Fread ::getchar(); n } n x = 0; n while (c >= 0 && c <= 9 ) { n x = x * 10 + (c - 0 ); n c = Fread ::getchar(); n } n x *= f; n return *this; n } n Reader& operator>>(char& c) { n c = Fread ::getchar(); n while (c == n || c == ) c = Fread ::getchar(); n return *this; n } n Reader& operator>>(char* str) { n int len = 0; n char c = Fread ::getchar(); n while (c == n || c == ) c = Fread ::getchar(); n while (c != n && c != ) { n str[len++] = c; n c = Fread ::getchar(); n } n str[len] = 0 ; n return *this; n } n Reader() {} n } cin; n const char endl = n ; n struct Writer { n template n Writer& operator<<(T x) { n if (x == 0) { n Fwrite ::putchar( 0 ); n return *this; n } n if (x < 0) { n Fwrite ::putchar( - ); n x = -x; n } n static int sta[45]; n int top = 0; n while (x) { n sta[++top] = x % 10; n x /= 10; n } n while (top) { n Fwrite ::putchar(sta[top] + 0 ); n --top; n } n return *this; n } n Writer& operator<<(char c) { n Fwrite ::putchar(c); n return *this; n } n Writer& operator<<(char* str) { n int cur = 0; n while (str[cur]) Fwrite ::putchar(str[cur++]); n return *this; n } n Writer& operator<<(const char* str) { n int cur = 0; n while (str[cur]) Fwrite ::putchar(str[cur++]); n return *this; n } n Writer() {} n } cout; n } // namespace Fastio n const int MAXN = 1e5; n const int MOD = 1e9 + 7; n inline int mod1(int x) { return x < MOD ? x : x - MOD; } n inline int mod2(int x) { return x < 0 ? x + MOD : x; } n inline void add(int& x, int y) { x = mod1(x + y); } n inline void sub(int& x, int y) { x = mod2(x - y); } n int n, goal, a[MAXN + 5]; n int pw2[MAXN + 5]; n int dp[MAXN + 5][2][2][2]; n inline int calc0(int i, int have_1) { n if (have_1) assert(i); n return have_1 ? pw2[i - 1] : pw2[i]; n } n inline int calc1(int i, int have_1) { n if (have_1) assert(i); n return have_1 ? pw2[i - 1] : 0; n } n int main() { n Fastio ::cin >> n >> goal; n for (int i = 1; i <= n; ++i) { n Fastio ::cin >> a[i]; n } n pw2[0] = 1; n for (int i = 1; i <= n; ++i) pw2[i] = pw2[i - 1] * 2 % MOD; n dp[0][0][0][0] = 1; n for (int i = 1; i <= n; ++i) { n for (int have_r1 = 0; have_r1 <= 1; ++have_r1) { n for (int have_b1 = 0; have_b1 <= 1; ++have_b1) { n for (int s = 0; s <= 1; ++s) n if (dp[i - 1][have_r1][have_b1][s]) { n if (a[i] != 1) { n add(dp[i][have_r1][have_b1][s], n (long long)dp[i - 1][have_r1][have_b1][s] * n calc1(i - 1, have_b1) % MOD); n add(dp[i][have_r1 | 1][have_b1][s ^ 1], n (long long)dp[i - 1][have_r1][have_b1][s] * n calc0(i - 1, have_b1) % MOD); n } n if (a[i] != 0) { n add(dp[i][have_r1][have_b1][s], n (long long)dp[i - 1][have_r1][have_b1][s] * n calc1(i - 1, have_r1) % MOD); n add(dp[i][have_r1][have_b1 | 1][s ^ 1], n (long long)dp[i - 1][have_r1][have_b1][s] * n calc0(i - 1, have_r1) % MOD); n } n } n } n } n } n int ans = 0; n for (int have_r1 = 0; have_r1 <= 1; ++have_r1) { n for (int have_b1 = 0; have_b1 <= 1; ++have_b1) { n add(ans, dp[n][have_r1][have_b1][goal]); n } n } n Fastio ::cout << ans << Fastio ::endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool debug = 0; n int n, m, k; n int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; n long long ln, lk, lm; n int x[105], y[105], r[105]; n string vs[2]; n void add(int id, int i, int x) { n string str = (((1-abs((t- ; n str += to_string(i); n str += )))+abs((abs((t- ; n str += to_string(i); n str += ))-1)))* ; n str += to_string(x); n str += ) ; n if (vs[id] == ) n vs[id] = str; n else { n vs[id] = ( + vs[id] + + + str + ) ; n } n } n void fmain() { n scanf( %d , &n); n for (int(i) = 0; (i) < (int)(2); (i)++) vs[i] = ; n for (int(i) = 0; (i) < (int)(n); (i)++) { n scanf( %d%d%d , x + i, y + i, r + i); n add(0, i + 1, x[i] / 2); n add(1, i + 1, y[i] / 2); n } n for (int(i) = 0; (i) < (int)(2); (i)++) cout << vs[i] << endl; n } n int main() { n fmain(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int bit(int x, int i) { return (x >> i) & 1; } n inline int two(int x) { return 1 << x; } n int n, s[110], m, team[110], dp[20][1 << 20]; n char op[110]; n bool vis[20][1 << 20]; n int go(int mi, int ban) { n if (mi == m) return 0; n int &ret = dp[mi][ban]; n if (vis[mi][ban]) return ret; n vis[mi][ban] = 1; n ret = -514514514; n for (int i = 0; i < (int)(n); i++) n if (!bit(ban, i)) { n int now = go(mi + 1, ban | two(i)); n int str = (op[mi] == p ? s[i] : 0); n if (mi + 1 < m && team[mi + 1] != team[mi]) n now = str - now; n else n now = str + now; n ret = max(ret, now); n } n return ret; n } n int main() { n scanf( %d , &(n)); n for (int i = 0; i < (int)(n); i++) scanf( %d , &(s[i])); n scanf( %d , &(m)); n for (int i = 0; i < (int)(m); i++) scanf( %c %d , op + i, team + i); n sort(s, s + n, greater()); n n = m; n int ans = go(0, 0); n if (team[0] == 2) ans *= -1; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a[3], ans; n cin >> a[0] >> a[1] >> a[2]; n sort(a, a + 3); n ans = (a[1] - a[0]) + (a[2] - a[1]); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, numero; n cin >> n; n if (n < 10) n cout << n; n else { n n -= 9; n if (n < 181) { n if (n % 2 == 0) { n n /= 2; n n -= 1; n n %= 10; n cout << n; n } else { n n = (n + 1) / 2; n cout << ((n - 1) / 10) + 1; n } n } else { n n -= 180; n numero = ((n - 1) / 3) + 1; n numero += 99; n n = n % 3; n switch (n) { n case 0: n cout << numero % 10; n break; n case 1: n cout << numero / 100; n break; n default: n cout << (numero % 100) / 10; n break; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, p[3000], k, m = 0, c; n int main() { n cin >> n; n for (int i = 1; i <= n; i++) cin >> p[i]; n for (int i = 1; i <= n; i++) { n k = p[i]; n c = 1; n while (k > 0) { n c++; n k = p[k]; n } n m = max(c, m); n } n cout << m; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n char st[200010]; n cin >> n >> st; n queue d, r; n for (int i = 0; i < n; i++) { n if (st[i] == D ) n d.push(i); n else n r.push(i); n } n while (!r.empty() && !d.empty()) { n int R = r.front(), D = d.front(); n if (R < D) { n r.pop(); n d.pop(); n r.push(n + R); n } else { n d.pop(); n r.pop(); n d.push(n + D); n } n } n if (!r.empty()) n cout << R << endl; n else n cout << D << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long w, h; n cin >> w >> h; n long long res = 0; n if (w == 1 || h == 1) { n cout << 0 << endl; n return 0; n } n for (long long i = 1; i < h; i++) { n for (long long j = 1; j < w; j++) res += min(i, h - i) * min(j, w - j); n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ; n long long n, k; n cin >> n >> k; n priority_queue, greater> priq; n long long cur = 0, co = 0; n map ma; n while (n > 0) { n if (n % 2) { n ma[cur]++; n co++; n } n n /= 2; n cur++; n } n if (co > k) { n cout << No << endl; n return 0; n } n for (long long i = 63; i >= -63; i--) { n long long temp = ma[i] + co; n if (temp <= k) { n co += ma[i]; n ma[i - 1] += (2 * ma[i]); n ma[i] = 0; n } else { n break; n } n } n for (long long i = 63; i >= -63; i--) n for (long long j = 0; j < ma[i]; j++) { n priq.push(i); n } n while (priq.size() < k) { n long long x = priq.top(); n priq.pop(); n priq.push(x - 1); n priq.push(x - 1); n } n vector ans; n cout << Yes << endl; n while (!priq.empty()) { n long long x = priq.top(); n ans.push_back(x); n priq.pop(); n } n sort(ans.begin(), ans.end(), greater()); n for (long long i = 0; i < ans.size(); i++) cout << ans[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string start[1791791]; n string fin[1791791]; n pair diffs[1791791]; n int is_in(string a, string b) { n string s = a + # + b; n int n = (int)s.length(); n vector pi(n); n for (int i = 1; i < n; ++i) { n int j = pi[i - 1]; n while (j > 0 && s[i] != s[j]) j = pi[j - 1]; n if (s[i] == s[j]) ++j; n pi[i] = j; n } n for (int i = (int)a.length(); i < pi.size(); ++i) { n if (pi[i] == a.length()) { n return i - 2 * (int)a.length(); n } n } n return -1; n } n int main() { n ios_base::sync_with_stdio(0); n int n; n cin >> n; n for (int i = 0; i < n; ++i) { n cin >> start[i]; n } n for (int i = 0; i < n; ++i) { n cin >> fin[i]; n } n for (int i = 0; i < n; ++i) { n int first_diff = -1; n for (int ii = 0; ii < start[i].length(); ++ii) { n if (start[i][ii] != fin[i][ii]) { n first_diff = ii; n break; n } n } n int last_diff = -1; n for (int ii = 0; ii < start[i].length(); ++ii) { n if (start[i][ii] != fin[i][ii]) { n last_diff = ii; n } n } n diffs[i] = {first_diff, last_diff}; n } n int one_with_diff = -1; n for (int i = 0; i < n; ++i) { n if (diffs[i].first != -1) { n one_with_diff = i; n break; n } n } n for (int i = 0; i < n; ++i) { n if (diffs[i].first != -1 && diffs[one_with_diff].first != -1 && n i != one_with_diff) { n if (diffs[i].second - diffs[i].first != n diffs[one_with_diff].second - diffs[one_with_diff].first) { n cout << NO ; n return 0; n } n for (int ii = 0; ii <= diffs[i].second - diffs[i].first; ++ii) { n if (start[i][diffs[i].first + ii] != n start[one_with_diff][diffs[one_with_diff].first + ii] || n fin[i][diffs[i].first + ii] != n fin[one_with_diff][diffs[one_with_diff].first + ii]) { n cout << NO ; n return 0; n } n } n } n } n int same_pref_len = 0; n for (int pref_len = 1;; ++pref_len) { n char pref = # ; n bool ok = 1; n for (int i = 0; i < n; ++i) { n if (diffs[i].first != -1) { n if (diffs[i].first < pref_len) { n ok = 0; n break; n } n if (pref == # ) { n pref = start[i][diffs[i].first - pref_len]; n } else { n if (pref != start[i][diffs[i].first - pref_len]) { n ok = 0; n break; n } n } n } n } n if (!ok) { n break; n } n same_pref_len += 1; n } n int same_suff_len = 0; n for (int suff_len = 1;; ++suff_len) { n char suff = # ; n bool ok = 1; n for (int i = 0; i < n; ++i) { n if (diffs[i].first != -1) { n if (diffs[i].second + suff_len >= start[i].length()) { n ok = 0; n break; n } n if (suff == # ) { n suff = start[i][diffs[i].second + suff_len]; n } else { n if (suff != start[i][diffs[i].second + suff_len]) { n ok = 0; n break; n } n } n } n } n if (!ok) { n break; n } n same_suff_len += 1; n } n string from, to; n for (int i = 0; i < n; ++i) { n if (diffs[i].first != -1) { n from = ; n for (int j = diffs[i].first - same_pref_len; n j <= diffs[i].second + same_suff_len; ++j) { n from += start[i][j]; n } n to = ; n for (int j = diffs[i].first - same_pref_len; n j <= diffs[i].second + same_suff_len; ++j) { n to += fin[i][j]; n } n break; n } n } n for (int i = 0; i < n; ++i) { n if (diffs[i].first == -1) { n if (is_in(from, start[i]) != -1) { n cout << NO ; n return 0; n } n } else { n if (is_in(from, start[i]) != diffs[i].first - same_pref_len) { n cout << NO ; n return 0; n } n } n } n cout << YES << endl; n cout << from << endl; n cout << to << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n int dist[10010], DD[30][30]; n int s[10010]; n vector all; n vector a; n queue q; n int dp[1 << 20]; n int n; n void calc(int x) { n memset(dist, -1, sizeof(dist)); n q.push(x), dist[x] = 0; n while (!q.empty()) { n int x = q.front(); n q.pop(); n for (int i = 0; i < all.size(); i++) { n int del = all[i]; n if (x - del > 0 && dist[x - del] == -1) { n dist[x - del] = dist[x] + 1; n q.push(x - del); n } n if (x + del <= n + 1 && dist[x + del] == -1) { n dist[x + del] = dist[x] + 1; n q.push(x + del); n } n } n } n } n void chmin(int &x, int y) { x = min(x, y); } n int main() { n int k, l; n scanf( %d%d%d , &n, &k, &l); n for (int i = 0; i < k; i++) { n int x; n scanf( %d , &x); n s[x] = 1; n } n while (l--) { n int x; n scanf( %d , &x); n all.push_back(x); n } n for (int i = n + 1; i >= 1; i--) { n s[i] ^= s[i - 1]; n } n for (int i = 1; i <= n + 1; i++) { n if (s[i]) a.push_back(i); n } n for (int i = 0; i < a.size(); i++) { n int x = a[i]; n calc(x); n for (int j = 0; j < a.size(); j++) { n DD[i][j] = dist[a[j]]; n } n } n int N = a.size(); n memset(dp, 0x3f, sizeof(dp)); n dp[0] = 0; n for (int mask = 0; mask < (1 << N) - 1; mask++) { n if (dp[mask] == INF) continue; n int x = 0; n while (mask >> x & 1) x++; n for (int y = x + 1; y < N; y++) { n if (mask >> y & 1) continue; n if (DD[x][y] == -1) continue; n chmin(dp[mask | 1 << x | 1 << y], dp[mask] + DD[x][y]); n } n } n printf( %d n , dp[(1 << N) - 1] == INF ? -1 : dp[(1 << N) - 1]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct debugger { n template n debugger& operator,(const T& v) { n cerr << v << ; n return *this; n } n } dbg; n int inf = (1 << 20); n int dp[(1 << 21) + 10]; n void F(int x, int y) { n x += inf; n y += inf; n dp[x]++; n if (x == y) return; n dp[y]++; n while (x / 2 != y / 2) { n if (x % 2 == 0) dp[x + 1]++; n if (y % 2 == 1) dp[y - 1]++; n x /= 2; n y /= 2; n } n return; n } n int ar[400010]; n int n, k; n int func(int x) { n int sm = 0; n x += inf; n while (x > 1) { n sm += dp[x]; n x /= 2; n } n return sm; n } n int chk(int x) { n int sm = 0; n for (int i = x; i <= ar[n - 1]; i += x) sm += func(i); n if (sm == n) return 1; n return 0; n } n int main() { n cin >> n >> k; n for (int i = (0), _n = (n); i < _n; i++) cin >> ar[i]; n sort(ar, ar + n); n if (ar[0] <= k) { n cout << ar[0] << endl; n return 0; n } n for (int i = (0), _n = (n); i < _n; i++) F(ar[i] - k, ar[i]); n int rs = k; n for (int i = (2), _n = (ar[0]); i <= _n; i++) n if (chk(i)) rs = i; n cout << rs << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, n, i, j, k, tmp; n int a, b, c; n cin >> a >> b >> c; n int p; n if ((c - b + a) % 2 != 0) { n printf( Impossible n ); n return 0; n } n p = (c - b + a) / 2; n int count1 = 0; n if (p == 0) { n count1++; n } n if (a - p == 0) { n count1++; n } n if (b - (a - p) == 0) { n count1++; n } n if (p >= 0 && a - p >= 0 && b - (a - p) >= 0 && count1 <= 1) { n cout << a - p << << b - (a - p) << << p << endl; n } else { n printf( Impossible n ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n, k; n cin >> n >> k; n map m; n int c[7000][2]; n int a[n + 1]; n int b[n + 1]; n int mx; n for (int i = 0; i < n; i++) { n cin >> a[i]; n m[a[i]]++; n mx = max(mx, m[a[i]]); n } n if (mx > k) { n cout << NO << endl; n return 0; n } n int x = 0; n for (auto i : m) { n c[i.first][0] = x; n x = x + i.second; n } n cout << YES << endl; n for (int i = 0; i < n; i++) { n cout << (c[a[i]][0] % k) + 1 << ; n c[a[i]][0]++; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n double n, m, a, b, x = 1000000, y; n cin >> n >> m; n while (n--) { n cin >> a >> b; n y = a / b; n x = min(x, y); n } n printf( %.8lf n , m * x); n } n "} +{"func_code_string": "#include n using namespace std; n long long bigmod(long long p, long long e, long long M) { n long long ret = 1; n for (; e > 0; e >>= 1) { n if (e & 1) ret = (ret * p) % M; n p = (p * p) % M; n } n return ret; n } n long long extended(long long a, long long b, long long &x, long long &y) { n a = abs(a); n b = abs(b); n long long g, x1, y1; n if (!b) { n x = 1; n y = 0; n g = a; n return g; n } n g = extended(b, a % b, x1, y1); n x = y1; n y = x1 - (a / b) * y1; n return g; n } n long long modinverse(long long a, long long M) { return bigmod(a, M - 2, M); } n long long bpow(long long p, long long e) { n long long ret = 1; n for (; e > 0; e >>= 1) { n if (e & 1) ret = (ret * p); n p = (p * p); n } n return ret; n } n int toInt(string s) { n int sm; n stringstream ss(s); n ss >> sm; n return sm; n } n int toLlint(string s) { n long long int sm; n stringstream ss(s); n ss >> sm; n return sm; n } n string convertInt(long long number) { n if (number == 0) return 0 ; n string temp = ; n string returnvalue = ; n while (number > 0) { n temp += number % 10 + 48; n number /= 10; n } n for (int i = 0; i < temp.length(); i++) n returnvalue += temp[temp.length() - i - 1]; n return returnvalue; n } n long long ncr[1001][1001]; n void NCR() { n for (int i = 1; i <= 1000; i++) { n ncr[i][i] = 1; n ncr[i][0] = 1; n for (int r = 1; r < i; r++) { n ncr[i][r] = (ncr[i - 1][r] + ncr[i - 1][r - 1]) % 1000000007; n } n } n } n vector vec[100009]; n long long n; n long long dp[100005][2], ar[100009]; n void dfs(int V, int pv) { n dp[V][0] = 1 - ar[V]; n dp[V][1] = ar[V]; n for (int i = 0; i < vec[V].size(); i++) { n long long old[2]; n memset(old, 0, sizeof(old)); n int v = vec[V][i]; n if (v == pv) continue; n old[0] = dp[V][0]; n old[1] = dp[V][1]; n dp[V][0] = dp[V][1] = 0; n dfs(v, V); n dp[V][0] += (old[0] * dp[v][1]) % 1000000007; n dp[V][1] += (old[1] * dp[v][1]) % 1000000007; n dp[V][1] += (old[1] * dp[v][0]) % 1000000007; n dp[V][1] += (old[0] * dp[v][1]) % 1000000007; n dp[V][0] += (old[0] * dp[v][0]) % 1000000007; n } n } n int main() { n cin >> n; n for (int i = 1; i < n; i++) { n int v; n cin >> v; n vec[i].push_back(v); n vec[v].push_back(i); n } n for (int i = 0; i < n; i++) { n int val; n cin >> val; n ar[i] = val; n } n dfs(0, -1); n cout << dp[0][1] % 1000000007 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n vector prim; n const int N = 1e5 + 9; n int n, dp[10000], a[N]; n bool v[100000]; n int pos[100000]; n void pre() { n for (int i = 2; i < 100000; i++) n if (!v[i]) { n prim.push_back(i); n pos[i] = prim.size() - 1; n int k = i << 1; n while (k < 100000) v[k] = 1, k += i; n } n } n int main() { n pre(); n int ans = 1; n cin >> n; n for (int i = 1, now; i <= n; i++) { n cin >> now; n int org = now; n int tmp = 0; n for (int j = 0; j < 100; j++) n if (now % prim[j] == 0) { n while (now % prim[j] == 0) now /= prim[j]; n tmp = max(tmp, dp[j] + 1); n } n if (now > 1) tmp = max(tmp, dp[pos[now]] + 1); n for (int j = 0; j < 100; j++) n if (org % prim[j] == 0) { n while (org % prim[j] == 0) org /= prim[j]; n dp[j] = tmp; n } n if (org > 1) dp[pos[now]] = tmp; n ans = max(ans, tmp); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int power(long long int a, long long int b) { n long long int res = 1; n a %= 1000000007; n assert(b >= 0); n for (; b; b >>= 1) { n if (b & 1) res = res * a % 1000000007; n a = a * a % 1000000007; n } n return res; n } n long long int modInverse(long long int a) { return power(a, 1000000007 - 2); } n const int N = 500023; n bool vis[N]; n vector adj[N]; n void solve() { n long long int n, m; n cin >> n >> m; n string s; n cin >> s; n s = & + s; n map repeat; n for (long long int i = 0; i < m; i++) { n long long int c; n cin >> c; n repeat[c]++; n } n long long int cnt[28] = {0}; n long long int final[28] = {0}; n for (int i = 1; i <= n; i++) { n cnt[s[i] - a ]++; n final[s[i] - a ]++; n for (int j = 0; j < 26; j++) { n final[j] += (cnt[j] * repeat[i]); n } n } n for (int i = 0; i < 26; i++) { n cout << final[i] << ; n } n cout << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int T = 1; n cin >> T; n int t = 0; n while (t++ < T) { n solve(); n } n cerr << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC n << ms n ; n } n "} +{"func_code_string": "#include n using namespace std; n const long double EPS = 1e-9; n long double Dis(long long a, long long Y, long long b, long long YY) { n return sqrt((long double)(b - a) * (b - a) + (Y - YY) * (Y - YY)); n } n struct PT { n long long ID; n long double len, Y; n PT(long long _ID, long double _Y) { n ID = _ID; n Y = _Y; n } n bool operator<(const PT &a) const { return (Y < a.Y); } n }; n vector A, B; n void BinSearch(vector &C, long double val, long long &low, long long &up) { n long long i, med; n up = C.size() - 1; n low = 0; n if (val >= C[up].Y) { n low = max(up - 1, low); n return; n } n if (val <= C[low].Y) { n up = min(low + 1, up); n return; n } n while ((up - low) > 1) { n med = (up + low) / 2; n if (C[med].Y < val) n low = med; n else n up = med; n } n } n int main() { n long long i, n, m, a, b, temp; n cin >> n >> m >> a >> b; n for (i = 0; i < n; i++) { n cin >> temp; n A.push_back(PT(i + 1, temp)); n A[i].len = Dis(0, 0, a, temp); n } n for (i = 0; i < m; i++) { n cin >> temp; n B.push_back(PT(i + 1, temp)); n } n for (i = 0; i < m; i++) { n cin >> temp; n B[i].len = temp; n } n sort(A.begin(), A.end()); n sort(B.begin(), B.end()); n long long ind1, ind2; n long double ans, tmp1, tmp2, mini, tt; n long long l, u; n ans = 1e18; n for (i = 0; i < m; i++) { n tt = ((long double)a * B[i].Y) / ((long double)(b)); n BinSearch(A, tt, l, u); n tmp1 = Dis(a, A[u].Y, b, B[i].Y) + A[u].len; n tmp2 = Dis(a, A[l].Y, b, B[i].Y) + A[l].len; n mini = min(tmp1, tmp2); n if (ans > (B[i].len + mini)) { n if ((tmp1 < tmp2)) n ind1 = A[u].ID, ans = B[i].len + tmp1; n else n ind1 = A[l].ID, ans = B[i].len + tmp2; n ind2 = B[i].ID; n } n } n cout << ind1 << << ind2 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 4000 + 10, MOD = (int)1e9 + 9; n int n, m, b, w, f[MAXN][MAXN]; n int main() { n cin >> n >> w >> b; n m = max(b, w); n f[0][0] = 1; n for (int i = 1; i <= m; ++i) { n for (int j = 1; j <= i; ++j) n f[i][j] = ((long long)f[i - 1][j] * (j + i - 1) + n (long long)f[i - 1][j - 1] * j) % n MOD; n } n int Tohka = 0; n for (int i = 1; i <= min(b, n - 2); ++i) n Tohka = ((long long)Tohka + n (long long)f[w][n - i] * f[b][i] % MOD * (n - i - 1)) % n MOD; n cout << Tohka << endl; n fclose(stdin); n fclose(stdout); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline void read(long long &x) { n long long f = 1; n x = 0; n char c = getchar(); n while (c < 0 || c > 9 ) { n if (c == - ) f = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n x = x * 10 + c - 0 ; n c = getchar(); n } n x *= f; n } n long long fa[200005][21], lg[2 * 200005], deep[200005], dis[200005], w[200005], n t[200005], h[200005], head, n, ans[200005]; n struct yyy { n long long to, z, w; n inline void add(long long x, long long y, long long W) { n to = y; n z = h[x]; n h[x] = head; n w = W; n } n } a[200005 * 2]; n inline void dfs2(long long x, long long pre) { n register long long i; n deep[x] = deep[pre] + 1; n fa[x][0] = pre; n for (i = 1; i <= lg[deep[x]]; i++) fa[x][i] = fa[fa[x][i - 1]][i - 1]; n for (i = h[x]; i; i = a[i].z) n if (a[i].to != pre) dis[a[i].to] = dis[x] + a[i].w, dfs2(a[i].to, x); n } n inline void dfs(long long x, long long pre) { n register long long i; n for (i = h[x]; i; i = a[i].z) n if (a[i].to ^ pre) { n dfs(a[i].to, x); n t[x] += t[a[i].to]; n } n } n inline void init() { n register long long i, j, k; n for (j = 1, k = 1; j <= n; j <<= 1, k++) n for (i = j; i < j * 2; i++) lg[i] = k; n dfs2(1, 0); n } n signed main() { n register long long i, j, x, y; n read(n); n for (i = 1; i <= n; i++) read(w[i]); n for (i = 2; i <= n; i++) { n read(x); n read(y); n a[++head].add(i, x, y); n a[++head].add(x, i, y); n } n init(); n for (i = 2; i <= n; i++) { n x = i; n for (j = lg[deep[i]]; j >= 0; j--) n if (fa[x][j] && dis[i] - dis[fa[x][j]] <= w[i]) x = fa[x][j]; n t[fa[x][0]]--; n t[fa[i][0]]++; n } n dfs(1, 0); n for (i = 1; i <= n; i++) printf( %lld , t[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, x, a[200000]; n long long bs(long long xx, long long yy, long long k) { n long long m = (xx + yy) / 2; n if (yy - xx <= 1) return xx; n if (a[m] <= k) n return bs(m, yy, k); n else n return bs(xx, m, k); n } n int main() { n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n x = 1; n for (int j = 0; j < 31; j++) { n for (int i = 0; i < n; i++) { n if (a[bs(0, n, a[i] - x)] == a[i] - x && n a[bs(0, n, a[i] + x)] == a[i] + x) { n return cout << 3 << endl n << a[i] - x << << a[i] << << a[i] + x, n 0; n } n } n x *= 2; n } n x = 1; n for (int j = 0; j < 31; j++) { n for (int i = 0; i < n; i++) { n if (a[bs(0, n, a[i] - x)] == a[i] - x) { n return cout << 2 << endl << a[i] - x << << a[i], 0; n } n } n x *= 2; n } n cout << 1 << endl << a[0]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void fastIo() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n } n int main() { n fastIo(); n int q; n cin >> q; n while (q--) { n int n; n cin >> n; n string s; n cin >> s; n if (n == 1) { n cout << NO << endl; n } else if (n == 2) { n if (s[0] >= s[1]) n cout << NO << endl; n else { n cout << YES << endl; n cout << 2 << endl; n cout << s[0] << << s[1] << endl; n } n } else { n cout << YES << endl; n cout << 2 << endl; n cout << s[0] << ; n for (int i = 1; i < n; i++) cout << s[i]; n cout << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n string s1, s2; n cin >> s1 >> s2; n bool poss = true; n int change[20][20]; n memset(change, 0, sizeof(change)); n for (int i = 0; i < n; i++) { n if (s1[i] > s2[i]) n poss = false; n else { n if (s1[i] != s2[i]) { n change[s1[i] - 97][s2[i] - 97]++; n } n } n } n if (!poss) { n cout << -1 << endl; n continue; n } n int steps = 0; n for (int i = 0; i < 19; i++) { n int x = -1; n for (int j = 1; j < 20; j++) { n if (change[i][j] > 0) { n steps++; n x = j; n break; n } n } n if (x != -1) { n for (int j = x + 1; j <= 20; j++) { n change[x][j] += change[i][j]; n } n } n } n cout << steps << endl; n } n } n "} +{"func_code_string": "#include n const int inf = 1e9; n const double eps = 1e-9; n const int mod = 1e9 + 7; n using namespace std; n int mypow(int x, int y) { n int res = 1; n for (; y >= 1; y >>= 1) { n if (y & 1) res = (1ll * res * x) % mod; n x = (1ll * x * x) % mod; n } n return res; n } n int32_t main() { n long long n; n int k; n cin >> n >> k; n vector p; n vector al; n long long x = n; n for (long long i = 2; i * i <= x; ++i) { n if (!(x % i)) { n p.push_back(i); n al.push_back(0); n } n int c = 0; n while (!(x % i)) { n al[al.size() - 1]++; n x /= i; n } n } n if (x != 1) { n p.push_back(x); n al.push_back(1); n } n int ans = 1; n for (int o = 0; o < p.size(); ++o) { n vector> dp(k + 1, vector(al[o] + 1, 0)); n dp[0][al[o]] = 1; n for (int i = 1; i <= k; ++i) { n for (int j = 0; j <= al[o]; ++j) { n int s = (1ll * dp[i - 1][j] * mypow(j + 1, mod - 2)) % mod; n for (int h = 0; h <= j; ++h) { n dp[i][h] = (dp[i][h] + s) % mod; n } n } n } n int l = 0; n int r = 1; n for (int j = 0; j <= al[o]; ++j) { n l = (l + (1ll * dp[k][j] * r) % mod) % mod; n r = (1ll * r * (p[o] % mod)) % mod; n } n ans = (1ll * ans * l) % mod; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n bool local = false; n using namespace std; n template n string toString(T x) { n ostringstream sout; n sout << x; n return sout.str(); n } n template n void print(T v) { n cout << ((int)(v).size()) << n ; n for (auto x : v) cout << x << ; n cout << n ; n }; n template n ostream &operator<<(ostream &o, pair x) { n return o << x.first << << x.second; n } n template n istream &operator>>(istream &o, pair &x) { n return o >> x.first >> x.second; n } n template n pair operator+(pair a, pair b) { n a.first += b.first; n a.second += b.second; n return a; n } n template n pair operator-(pair a, pair b) { n a.first -= b.first; n a.second -= b.second; n return a; n } n template n void operator+=(pair &a, pair b) { n a.first += b.first; n a.second += b.second; n } n template n void operator-=(pair &a, pair b) { n a.first -= b.first; n a.second -= b.second; n } n int nint() { n int x; n cin >> x; n return x; n } n double getTime() { return clock() / (double)CLOCKS_PER_SEC; }; n mt19937 rnd(0); n int rand(int n) { return rnd() % n; } n int rand(int l, int r) { return rnd() % (r - l + 1) + l; } n const int mod = 1000000000 + 7; n void initIO() { n if (local) { n freopen( input.txt , r , stdin); n srand((int)time(0)); n rnd.seed((int)time(0)); n } else { n } n { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n }; n } n int m; n int n; n vector > v; n vector v1, v2; n const int K = 19; n bool f(pair a, pair b) { n if (a.first != b.first) return a.first < b.first; n return a.second > b.second; n } n vector > update(vector > v) { n vector > ans; n ans.emplace_back(v[0]); n for (int i = 1; i < ((int)(v).size()); i++) { n pair x = ans.back(); n pair y = v[i]; n if (y.second <= x.second) continue; n ans.emplace_back(y); n } n return ans; n } n int get(int x) { n int p = upper_bound(v1.begin(), v1.end(), x) - v1.begin() - 1; n if (p == -1) return -1; n return p; n } n int ne[K + 1][200500]; n void calc() { n for (int i = 0; i < (n); i++) ne[0][i] = i; n for (int t = 1; t < K; t++) { n for (int i = 0; i < (n); i++) { n int x = v2[ne[t - 1][i]]; n int id = get(x); n x = ne[t - 1][id]; n ne[t][i] = x; n } n } n } n int getans(int x, int y) { n int p = get(x); n if (p == -1) return -1; n int ans = 1; n for (int i = K - 1; i > 0; i--) { n while (1) { n int np = ne[i][p]; n if (p == np) break; n if (v2[np] < y) { n p = np; n ans += (1 << i) - 1; n } else n break; n } n } n if (v2[p] < y) { n p = ne[1][p]; n ans++; n } n if (v[p].second < y) return -1; n return ans; n } n int main() { n initIO(); n cin >> n >> m; n for (int i = 0; i < (n); i++) { n int l, r; n cin >> l >> r; n v.emplace_back(l, r); n } n sort(v.begin(), v.end(), f); n v = update(v); n n = ((int)(v).size()); n for (int i = 0; i < (n); i++) { n v1.emplace_back(v[i].first); n v2.emplace_back(v[i].second); n }; n ; n ; n ; n calc(); n for (int i = 0; i < (m); i++) { n int l, r; n cin >> l >> r; n cout << getans(l, r) << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n map>> comp; n map> Add(long long x) { n if (x == 0) return {}; n if (comp.count(x)) return comp[x]; n long long choose = (x - 1) / 2; n long long diff = min(choose + 1, x - choose); n map> ret = {{diff, 1}}; n for (long long xp : {choose, x - choose - 1}) n for (auto p : Add(xp)) ret[p.first] += p.second; n return comp[x] = ret; n } n long long Solve(long long x, long long seek, long long& cnt) { n long long choose = (x - 1) / 2; n long long diff = min(choose + 1, x - choose); n if (diff == seek) { n return choose + cnt; n } n long long ret = 0; n for (long long xp : {choose, x - choose - 1}) { n long long now = Add(xp)[seek]; n if (now > cnt) { n return ret + Solve(xp, seek, cnt); n } n cnt -= now; n ret += choose + 1; n } n assert(false); n } n int32_t main() { n long long n, k; n cin >> n >> k; n if (k == 1) { n cout << 1 << endl; n return 0; n } n if (k == 2) { n cout << n << endl; n return 0; n } n n -= 2; n k -= 3; n for (auto p : Add(n)) { n if (p.second > k) { n cout << 2 + Solve(n, p.first, k) << endl; n return 0; n } n k -= p.second; n } n assert(false); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void smax(T &a, T b) { n if (a < b) a = b; n } n const double EPS = 1e-9; n vector, int> > adj[100000 + 10]; n long long totSum; n pair, int> edges[100000 + 10]; n int belows[100000 + 10]; n int n; n pair f(int u, int jad) { n long long sum = 0; n int cnts = 0; n for (int i = 0; i < ((int)(adj[u]).size()); ++i) { n int v = adj[u][i].first.first; n int cost = adj[u][i].first.second; n int edge = adj[u][i].second; n if (v == jad) { n continue; n } n pair temp = f(v, u); n int cnt = temp.second; n long long belowSum = temp.first + (long long)cost * cnt; n belows[edge] = cnt; n totSum += cnt * sum; n totSum += cnts * belowSum; n sum += belowSum; n cnts += cnt; n } n cnts++; n totSum += sum; n return make_pair(sum, cnts); n } n inline long long getDollarBabe(long long temp) { return temp * (n - temp); } n int main(int argc, char const *argv[]) { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> n; n for (int i = 0; i < n - 1; ++i) { n int u, v, len; n cin >> u >> v >> len; n if (u > v) { n swap(u, v); n } n u--; n v--; n adj[u].push_back(make_pair(make_pair(v, len), i)); n adj[v].push_back(make_pair(make_pair(u, len), i)); n edges[i] = make_pair(make_pair(u, v), len); n } n totSum = 0; n f(0, -1); n int q; n cin >> q; n while (q--) { n int r, w; n cin >> r >> w; n r--; n int temp = belows[r]; n totSum -= (edges[r].second - w) * getDollarBabe(temp); n edges[r].second = w; n cout << fixed << setprecision(8) n << (double)totSum * 6 / ((long long)(n) * (n - 1)) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000007; n int main() { n int n, m; n scanf( %d %d , &n, &m); n string S; n set H[n]; n set V[m]; n for (int i = 0; i < (n); i++) { n cin >> S; n for (int j = 0; j < (m); j++) n if (S[j] != . ) { n int t = S[j] - 0 ; n int h = (t <= 2); n int v = (t == 1 || t == 4); n H[i].insert((h + j) % 2); n V[j].insert((v + i) % 2); n } n } n bool good = true; n int cnt = m + n; n for (int i = 0; i < (n); i++) { n if (H[i].size() > 1) n good = 0; n else if (H[i].size()) n --cnt; n } n for (int j = 0; j < (m); j++) { n if (V[j].size() > 1) n good = 0; n else if (V[j].size()) n --cnt; n } n if (good) { n int ans = 1; n for (int i = 0; i < (cnt); i++) { n ans += ans; n ans %= 1000003; n } n cout << ans << endl; n } else n cout << 0 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin >> n; n cin.ignore(); n while (n--) { n string str1, str2; n getline(cin, str1); n getline(cin, str2); n bool test = true; n long long j = 0, i = 0; n char last_ch = str1[0]; n while (j < str2.size() && i < str1.size()) { n if (str2[j] == str1[i]) n last_ch = str1[i], i++, j++; n else if (str2[j] == last_ch) { n while (str2[j] == last_ch) j++; n } else { n test = false; n break; n } n } n while (j < str2.size()) { n if (str2[j] != last_ch) { n test = false; n break; n } n j++; n } n if (!test) { n cout << NO << endl; n continue; n } n if (i < str1.size()) { n cout << NO << endl; n continue; n } n cout << YES << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int II() { n int q; n scanf( %d , &q); n return q; n } n void solve() { n long long N, M; n cin >> N >> M; n long long ar[N + 10], br[N + 10], cr[N + 10]; n for (long long i = 1; i <= N; i++) { n cin >> ar[i] >> br[i] >> cr[i]; n } n long long mi = M, mx = M; n ar[0] = 0; n for (long long i = 1; i <= N; i++) { n long long q = ar[i] - ar[i - 1]; n mi = max(mi - q, br[i]); n mx = min(mx + q, cr[i]); n if (mi > cr[i] or mx < br[i]) { n cout << NO << endl; n return; n } n } n cout << YES << endl; n } n int32_t main() { n long long tt; n cin >> tt; n long long cas = 1; n while (tt--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n void winter_is_coming() { n std::ios_base::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n } n int main() { n void winter_is_coming(); n long long a, b, dis, dis2, ans = 0; n cin >> a >> b; n dis = abs(a - b); n dis2 = dis / 2; n dis = dis - dis2; n ans = (dis * (dis + 1) / 2) + (dis2 * (dis2 + 1) / 2); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, fa[100010], siz[100010]; n double ans; n int getfa(int w) { return (w == fa[w]) ? w : fa[w] = getfa(fa[w]); } n struct edg { n int nx, ny, val; n bool operator<(const edg& e) const { return val > e.val; } n } a[100010]; n int main() { n cin >> n >> m; n int b[100010]; n long long tot = 0; n for (int i = 1; i <= n; i++) cin >> b[i]; n for (int i = 0; i < m; i++) { n int x, y; n cin >> x >> y; n a[i] = (edg){x, y, min(b[x], b[y])}; n } n sort(a, a + m); n for (int i = 1; i <= n; i++) fa[i] = i; n for (int i = 1; i <= n; i++) siz[i] = 1; n for (int i = 0; i < m; i++) n if (getfa(a[i].nx) ^ getfa(a[i].ny)) { n int x = a[i].nx, y = a[i].ny; n tot += (long long)a[i].val * siz[fa[x]] * siz[fa[y]]; n siz[fa[x]] += siz[fa[y]]; n fa[fa[y]] = fa[x]; n } n ans = tot; n tot = (long long)n * (n - 1) / 2; n ans /= tot; n printf( %.06lf , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, G[1005][1005], ans = 1000000000; n char str[1005][1005]; n bool vis[1005][1005]; n int dfs(int x, int y, int wx, int wy) { n vis[x][y] = true; n if ((G[x + wx - 1][y + wy] - G[x - 1][y + wy] - G[x + wx - 1][y + 1 - 1] + n G[x - 1][y + 1 - 1]) == wx * wy) n return wx + dfs(x, y + 1, wx, wy); n if ((G[x + wx][y + wy - 1] - G[x + 1 - 1][y + wy - 1] - G[x + wx][y - 1] + n G[x + 1 - 1][y - 1]) == wx * wy) n return wy + dfs(x + 1, y, wx, wy); n return 0; n } n int main() { n memset(vis, false, sizeof(vis)); n scanf( %d%d n , &n, &m); n int flag = 0, px, py; n for (int i = 1; i <= n; i++) scanf( %s , str[i] + 1); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) { n if (str[i][j] == X ) { n if (!flag) { n flag = 1; n px = i; n py = j; n } n G[i][j] = G[i - 1][j] + G[i][j - 1] - G[i - 1][j - 1] + 1; n } else n G[i][j] = G[i - 1][j] + G[i][j - 1] - G[i - 1][j - 1]; n } n int tmp, wx, wy; n for (tmp = px; str[tmp][py] == X ; tmp++) n ; n wx = tmp - px; n for (int i = py; str[px][i] == X ; i++) n if (dfs(px, py, wx, i - py + 1) + wx * (i - py + 1) == G[n][m]) n ans = min(ans, wx * (i - py + 1)); n for (tmp = py; str[px][tmp] == X ; tmp++) n ; n wy = tmp - py; n for (int i = px; str[i][py] == X ; i++) n if (dfs(px, py, i - px + 1, wy) + (i - px + 1) * wy == G[n][m]) n ans = min(ans, (i - px + 1) * wy); n if (ans <= n * m) n printf( %d n , ans); n else n printf( -1 n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n unsigned long long n; n unsigned long long a[100050]; n unsigned long long b[200050]; n scanf( %lld , &n); n for (int i = 0; i < n / 2; i++) scanf( %lld , &a[i]); n b[0] = 0; n b[n - 1] = a[0]; n for (int i = 1; i < n / 2; i++) { n b[n - 1 - i] = min(b[n - i], a[i] - b[i - 1]); n b[i] = a[i] - b[n - 1 - i]; n } n for (int i = 0; i < n; i++) printf( %lld , b[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int arr[100] = {0}, con = 0, d = 0; n ; n string x; n cin >> x; n for (int i = 0; i < x.size(); i++) { n if (x[i] == + ) { n for (int j = 0; j < con; j++) { n arr[d] += (x[i - j - 1] - 48) * pow(10, j); n } n d++; n con = 0; n } else n con++; n } n for (int j = 0; j < con; j++) { n arr[d] += (x[x.size() - j - 1] - 48) * pow(10, j); n } n sort(arr, arr + d + 1); n for (int j = 0; j <= d; j++) { n if (j == d) n cout << arr[j]; n else n cout << arr[j] << + ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(nullptr); n cout.tie(nullptr); n long long t; n cin >> t; n while (t--) { n vector > a(2); n vector ans; n long long n; n string b; n cin >> n >> b; n long long cou = 1; n for (char c : b) { n long long x = c - 0 ; n if (a[x].size() == 0) a[x].push_back(cou++); n ans.push_back(a[x].back()); n a[!x].push_back(a[x].back()); n a[x].pop_back(); n } n cout << cou - 1 << n ; n for (long long i : ans) cout << i << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int comp(long long a, long long b) { return a > b; } n long long arr[100000], cdf[100000]; n int main() { n int i, m; n long long k, n; n cin >> n; n cin >> arr[0]; n for (i = 1; i < n; i++) { n cin >> arr[i]; n } n sort(arr, arr + n, comp); n cdf[0] = arr[0]; n for (i = 1; i < n; i++) { n cdf[i] = arr[i] + cdf[i - 1]; n } n cin >> m; n long long rrr = 0; n for (i = 1; i < n; i++) { n rrr += arr[i] * i; n } n int ll; n for (ll = 0; ll < m; ll++) { n cin >> k; n long long sum = 0LL; n if (k == 1) n cout << rrr << ; n else { n int mm; n long long as, t = 1; n for (as = 1, mm = 1; as < n; as = as + t, mm++) { n t *= k; n sum += (cdf[min(as + t - 1, n - 1)] - cdf[as - 1]) * mm; n } n cout << sum << ; n } n } n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n namespace red { n inline long long read() { n long long x = 0; n char ch, f = 1; n for (ch = getchar(); (ch < 0 || ch > 9 ) && ch != - ; ch = getchar()) n ; n if (ch == - ) f = 0, ch = getchar(); n while (ch >= 0 && ch <= 9 ) { n x = (x << 1) + (x << 3) + ch - 0 ; n ch = getchar(); n } n return f ? x : -x; n } n const long long N = 1e6 + 10, inf = 1e9 + 7, base = 131, mod = 1e9 + 7; n long long n, m, t, ret; n char a[N], b[N], s[N]; n long long nxt[N], f[N], g[N]; n long long pw[N], ha[N], hs[N]; n inline void prepare(char *a, long long *f) { n long long len = max(n, m); n for (long long i = pw[0] = 1; i <= len; ++i) pw[i] = pw[i - 1] * base % mod; n for (long long i = 1; i <= n; ++i) ha[i] = (ha[i - 1] * base + a[i]) % mod; n for (long long i = 1; i <= m; ++i) hs[i] = (hs[i - 1] * base + s[i]) % mod; n for (long long i = 1; i <= n; ++i) { n long long l = i, r = n; n while (l <= r) { n long long t1 = (ha[((l + r) >> 1)] - n ha[i - 1] * pw[((l + r) >> 1) - i + 1] % mod + mod) % n mod; n long long t2 = hs[((l + r) >> 1) - i + 1]; n if (t1 == t2) n f[i] = ((l + r) >> 1) - i + 1, l = ((l + r) >> 1) + 1; n else n r = ((l + r) >> 1) - 1; n } n f[i] = min(f[i], m - 1); n } n } n struct BIT { n long long tr[N]; n BIT() { memset(tr, 0, sizeof(tr)); } n inline void update(long long p, long long k) { n for (p++; p < N; p += p & (-p)) tr[p] += k; n } n inline long long query(long long p) { n long long ret = 0; n for (p++; p; p -= p & (-p)) ret += tr[p]; n return ret; n } n } bit[2]; n inline void main() { n n = read(), m = read(); n scanf( %s%s%s , a + 1, b + 1, s + 1); n prepare(a, f); n reverse(s + 1, s + m + 1); n reverse(b + 1, b + n + 1); n prepare(b, g); n reverse(g + 1, g + n + 1); n for (long long i = n; i; --i) { n bit[0].update(g[i], 1); n bit[1].update(g[i], g[i]); n if (i + m - 1 <= n) { n bit[0].update(g[i + m - 1], -1); n bit[1].update(g[i + m - 1], -g[i + m - 1]); n } n if (!f[i]) continue; n long long v = m - f[i]; n ret += bit[1].query(m) - bit[1].query(v - 1); n ret -= (bit[0].query(m) - bit[0].query(v - 1)) * (v - 1); n } n printf( %lld n , ret); n } n } // namespace red n signed main() { n red::main(); n return 0; n } n "} +{"func_code_string": "#include n #include n #include n #include n #include n using namespace std; n n typedef long long ll; n typedef pair Pii; n typedef vector VPii; n typedef vector Vi; n typedef vector VVi; n typedef vector Vll; n typedef vector VVll; n n const ll INF = 1000000000000000000LL; n n Vi toposort(const VVi& g) { n int n = g.size(); n Vi deg(n); n for (auto& others : g) { n for (int other : others) { n ++deg[other]; n } n } n n queue q; n for (int i = 0; i < n; ++i) { n if (deg[i] == 0) { n q.push(i); n } n } n n Vi result; n while (!q.empty()) { n int x = q.front(); n q.pop(); n n result.push_back(x); n n for (int other : g[x]) { n if (--deg[other] == 0) { n q.push(other); n } n } n } n return result; n } n n Vi findPath(int start, const VVi& rg, Vi& target, const VVi& ban) { n int n = rg.size(); n VVi prev(2, Vi(n, -1)); n prev[0][start] = start; n n queue q; n q.push(make_pair(0, start)); n n int finish = -1; n n while (!q.empty()) { n int d = q.front().first; n int x = q.front().second; n q.pop(); n n if (d == 0) { n if (ban[0][x] == 1) { n continue; n } n for (int y : rg[x]) { n if (ban[1][y] == 1) { n continue; n } n if (target[y] != x && prev[1][y] == -1) { n prev[1][y] = x; n q.push(make_pair(1, y)); n } n } n } else { n int y = target[x]; n if (y == -1) { n finish = x; n break; n } n n if (prev[0][y] == -1) { n prev[0][y] = x; n q.push(make_pair(0, y)); n } n } n } n n if (finish == -1) { n return Vi(); n } n n Vi path; n for (int d = 1, x = finish; x != start; x = prev[d][x], d = 1 - d) { n path.push_back(x); n } n path.push_back(start); n reverse(path.begin(), path.end()); n return path; n } n n int minSeeds(const VVi& g, const VVi& rg, const VVi& ban) { n int n = g.size(); n int seeds = 0; n Vi target(n, -1); n Vi order = toposort(g); n for (int x : order) { n auto path = findPath(x, rg, target, ban); n if (path.empty()) { n ++seeds; n } n assert(path.size() % 2 == 0); n for (int i = 0; i + 1 < path.size(); i += 2) { n int a = path[i]; n int b = path[i + 1]; n target[b] = a; n } n } n return seeds; n } n n Pii nextBan(int currentSeeds, const VVi& g, const VVi& rg, VVi ban) { n int n = g.size(); n for (int d = 0; d < 2; ++d) { n for (int x = 0; x < n; ++x) { n if (ban[d][x] == 1) { n continue; n } n ban[d][x] = 1; n int t = minSeeds(g, rg, ban); n if (t == currentSeeds + 1) { n return make_pair(d, x); n } n ban[d][x] = 0; n } n } n assert(false); n } n n VPii optimalSequence(const VVi& g, const VVi& rg) { n int n = g.size(); n VVi ban(2, Vi(n, 0)); n n int m = minSeeds(g, rg, ban); n VPii result; n n for (int i = 0; i < n - m; ++i) { n auto t = nextBan(m + i, g, rg, ban); n result.push_back(t); n ban[t.first][t.second] = 1; n } n n return result; n } n n Vi optimalPattern(int initial, int n, VPii& cost) { n int k = cost.size(); n VVll dp(k + 1, Vll(n + 1)); n VVi next(k + 1, Vi(n + 1)); n for (int r = k - 1; r >= 0; --r) { n for (int s = initial; s <= n; ++s) { n ll bestScore = 0; n int bestT = -1; n for (int t = max(s, r + 2); t <= n; ++t) { n int c = t - s; n ll score = max(0LL, cost[r].first - ll(c) * cost[r].second) + dp[r + 1][t]; n if (bestT == -1 || score > bestScore) { n bestT = t; n bestScore = score; n } n } n dp[r][s] = bestScore; n next[r][s] = bestT; n } n } n n Vi pattern; n for (int r = 0, s = initial; r < k; s = next[r][s], ++r) { n pattern.push_back(next[r][s] - s); n } n return pattern; n } n n int main() { n int n, m, k; n cin >> n >> m >> k; n n VVi g(n), rg(n); n for (int i = 0; i < m; ++i) { n int x, y; n cin >> x >> y; n --x; --y; n g[x].push_back(y); n rg[y].push_back(x); n } n n VPii cost(k); n for (int i = 0; i < k; ++i) { n cin >> cost[i].first >> cost[i].second; n } n n auto seq = optimalSequence(g, rg); n int initial = n - seq.size(); n n auto patt = optimalPattern(initial, n, cost); n n Vi solution; n int used = 0; n for (int p : patt) { n for (int i = 0; i < p; ++i) { n auto s = seq[used++]; n int sign = s.first == 0 ? -1 : 1; n solution.push_back(sign * (s.second + 1)); n } n solution.push_back(0); n } n n cout << solution.size() << endl; n for (int i = 0; i < solution.size(); ++i) { n if (i != 0) { n cout << ; n } n cout << solution[i]; n } n cout << endl; n }"} +{"func_code_string": "#include n template n inline void SWAP(T &a, T &b) { n T tmp = a; n a = b; n b = tmp; n } n template n inline T ABS(const T &val) { n return val < 0 ? -val : val; n } n template n inline T MAX(const T &a, const T &b) { n return a > b ? a : b; n } n template n inline T MIN(const T &a, const T &b) { n return a < b ? a : b; n } n template n inline T SQR(const T &a) { n return a * a; n } n const int INTinf = 2147483647; n const int nINTinf = 0 - 2147483648; n using namespace std; n int n; n char A[5005][5005]; n bool was[5005]; n bool bad[5005]; n int CY[5005]; n int kon = 0; n int POS = 0; n bool FF = false; n bool G = false; n void rec(const int &x) { n if (bad[x]) return; n if (was[x]) { n POS = x; n FF = true; n } else { n was[x] = true; n for (int i = 0; i != n; i++) { n if (A[x][i]) { n rec(i); n if (FF) { n if (!G) { n CY[kon++] = x; n if (POS == x) G = true; n } n return; n } n } n } n bad[x] = true; n } n } n int main() { n scanf( %d , &n); n for (int i = 0; i != n; i++) { n scanf( %s , A[i]); n for (int j = 0; j != n; j++) { n A[i][j] -= 0 ; n } n } n for (int i = 0; i != n; i++) { n if (!bad[i]) rec(i); n if (FF) break; n } n if (FF) { n reverse(CY, CY + kon); n int ST = CY[0]; n for (int i = 2; i != kon; i++) { n if (A[CY[i]][ST]) { n cout << ST + 1 << << CY[i - 1] + 1 << << CY[i] + 1 << endl; n return 0; n } n } n } else { n cout << -1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e3 + 7; n long long dp[N][N][11][2], n, m, k; n string s, t; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> m >> k >> s >> t; n for (long long l = 1; l <= k; l++) { n for (long long i = 1; i <= n; i++) { n for (long long j = 1; j <= m; j++) { n if (s[i - 1] == t[j - 1]) n dp[i][j][l][0] = n 1 + max(dp[i - 1][j - 1][l - 1][1], dp[i - 1][j - 1][l][0]); n dp[i][j][l][1] = n max(dp[i][j][l][0], max(dp[i - 1][j][l][1], dp[i][j - 1][l][1])); n } n } n } n cout << dp[n][m][k][1]; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long t; n cin >> t; n while (t--) { n long long p, f; n cin >> p >> f; n long long cnt1, cnt2; n cin >> cnt1 >> cnt2; n long long s, w; n cin >> s >> w; n if (s > w) { n swap(s, w); n swap(cnt1, cnt2); n } n long long ans = 0; n for (long long i = 0; i <= min(cnt1, p / s); i++) { n long long cnt = i; n long long tmpp = p - i * s; n cnt += (min(cnt2, tmpp / w)); n long long tmpw = cnt2 - min(cnt2, tmpp / w), tmps = cnt1 - i; n cnt += min(tmps, f / s); n long long tmpf = f - min(tmps, f / s) * s; n cnt += min(tmpw, tmpf / w); n ans = max(ans, cnt); n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline void in(int &n) { n n = 0; n int ch = getchar(); n int sign = 1; n while (ch < 0 || ch > 9 ) { n if (ch == - ) sign = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n n = (n << 3) + (n << 1) + ch - 0 , ch = getchar(); n } n n = n * sign; n } n pair a[100005]; n long long int Fsum[100005], Rsum[100005]; n long long int solve(long long int val, int low, int up) { n int n = up; n while (low < up) { n int mid = low + (up - low) / 2; n if (a[mid].first >= val) { n low = mid + 1; n } else { n up = mid; n } n } n long long int ans = val * (n - low + 1) - Rsum[low]; n return ans; n } n int res[100005]; n int main() { n int n; n long long int A; n int Cf, Cm; n in(n); n cin >> A; n in(Cf); n in(Cm); n long long int m; n cin >> m; n for (int i = 1; i <= n; i++) { n in(a[i].first); n a[i].second = i; n } n sort(a + 1, a + 1 + n); n reverse(a + 1, a + 1 + n); n Fsum[0] = 0; n for (int i = 1; i <= n; i++) { n Fsum[i] = Fsum[i - 1] + a[i].first; n } n Rsum[n + 1] = 0; n for (int i = n; i >= 1; i--) { n Rsum[i] = Rsum[i + 1] + a[i].first; n } n long long int ans = 0; n int X, Y; n if (A * n - Fsum[n] <= m) { n ans = n * Cf + A * Cm; n X = n; n Y = A; n } n for (int i = 1; i <= n; i++) { n int low = a[n].first; n int up = A; n while (low < up) { n int mid = low + (up - low + 1) / 2; n long long int total = A * (i - 1) - Fsum[i - 1] + solve(mid, i, n); n if (total <= m) { n low = mid; n } else { n up = mid - 1; n } n } n long long int total = A * (i - 1) - Fsum[i - 1] + solve(low, i, n); n if (total <= m) { n long long int p = low; n p *= Cm; n long long int curr = (i - 1) * Cf + p; n if (curr >= ans) { n ans = curr; n X = i - 1; n Y = low; n } n } n } n for (int i = 1; i <= n; i++) { n if (i <= X) { n res[a[i].second] = A; n } else { n res[a[i].second] = max(a[i].first, Y); n } n } n printf( %I64d n , ans); n for (int i = 1; i <= n; i++) { n printf( %d , res[i]); n } n printf( n ); n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void chkmin(T1 &x, T2 y) { n if (x > y) x = y; n } n template n inline void chkmax(T1 &x, T2 y) { n if (x < y) x = y; n } n inline int readChar(); n template n inline T readInt(); n template n inline void writeInt(T x, char end = 0); n inline void writeChar(int x); n inline void writeWord(const char *s); n static const int buf_size = 4096; n inline int getChar() { n static char buf[buf_size]; n static int len = 0, pos = 0; n if (pos == len) { n pos = 0, len = fread(buf, 1, buf_size, stdin); n } n if (pos == len) { n return -1; n } n return buf[pos++]; n } n inline int readChar() { n int c = getChar(); n while (c <= 32) { n c = getChar(); n } n return c; n } n template n inline T readInt() { n int s = 1, c = readChar(); n T x = 0; n if (c == - ) s = -1, c = getChar(); n while ( 0 <= c && c <= 9 ) x = x * 10 + c - 0 , c = getChar(); n return s == 1 ? x : -x; n } n static int write_pos = 0; n static char write_buf[buf_size]; n inline void writeChar(int x) { n if (write_pos == buf_size) n fwrite(write_buf, 1, buf_size, stdout), write_pos = 0; n write_buf[write_pos++] = x; n } n template n inline void writeInt(T x, char end) { n if (x < 0) writeChar( - ), x = -x; n char s[24]; n int n = 0; n while (x || !n) s[n++] = 0 + x % 10, x /= 10; n while (n--) writeChar(s[n]); n if (end) writeChar(end); n } n inline void writeWord(const char *s) { n while (*s) writeChar(*s++); n } n struct Flusher { n ~Flusher() { n if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0; n } n } flusher; n const string FILENAME = input ; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n if (n & 1) { n cout << (n / 2 + 1) * (n / 2 + 1) << endl; n } else { n cout << (n / 2 + 1) * (n / 2) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int read(int &x) { return scanf( %d , &x); } n int read(long long &x) { return scanf( %lld , &x); } n int read(double &x) { return scanf( %lf , &x); } n int read(int &x, int &y) { return scanf( %d%d , &x, &y); } n int read(long long &x, long long &y) { return scanf( %lld%lld , &x, &y); } n int read(double &x, double &y) { return scanf( %lf%lf , &x, &y); } n int read(int &x, int &y, int &z) { return scanf( %d%d%d , &x, &y, &z); } n int read(long long &x, long long &y, long long &z) { n return scanf( %lld%lld%lld , &x, &y, &z); n } n int read(double &x, double &y, double &z) { n return scanf( %lf%lf%lf , &x, &y, &z); n } n long long qpow(long long a, long long b, long long mod) { n if (a == 0) return 0; n long long ans = 1; n a %= mod; n while (b) { n if (b & 1) ans = ans * a % mod; n a = a * a % mod; n b >>= 1; n } n return ans % mod; n } n long long inv(long long x, long long mod) { return qpow(x, mod - 2, mod); } n int dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0}; n int mon[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; n const int INF = 0x3f3f3f3f; n const int mod = 1e9 + 7; n const int N = 5e5 + 5; n struct DSU { n int f[N]; n void init(int n) { n for (int i = 0; i <= n; i++) f[i] = i; n } n int fa(int x) { return f[x] == x ? x : f[x] = fa(f[x]); } n void join(int x, int y) { n x = fa(x); n y = fa(y); n if (x != y) f[x] = y; n } n }; n struct CombMath { n long long C[2005][2005]; n void init(int n) { n for (int i = 0; i <= n; i++) C[i][0] = 1; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= n; j++) n C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod; n } n }; n struct _2sat { n vector G[N << 1]; n int dfn[N << 1], low[N << 1], stk[N << 1], color[N << 1]; n int t, tp, scc; n bool vis[N << 1]; n void init(int n) { n for (int i = 0; i <= 2 * n; i++) G[i].clear(); n for (int i = 0; i <= n * 2; i++) dfn[i] = low[i] = color[i] = vis[i] = 0; n t = tp = scc = 0; n } n void add(int x, int xv, int y, int yv) { n x = x * 2 + xv; n y = y * 2 + yv; n G[x ^ 1].push_back(y); n G[y ^ 1].push_back(x); n } n void addmaodun(int x, int xv, int y, int yv) { n x = x * 2 + (xv ^ 1); n y = y * 2 + (yv ^ 1); n G[x ^ 1].push_back(y); n G[y ^ 1].push_back(x); n } n void tarjan(int x) { n dfn[x] = low[x] = ++t; n stk[++tp] = x; n vis[x] = 1; n for (auto v : G[x]) { n if (!dfn[v]) { n tarjan(v); n low[x] = min(low[x], low[v]); n } else if (vis[v]) n low[x] = min(low[x], dfn[v]); n } n if (low[x] == dfn[x]) { n color[x] = ++scc; n vis[x] = 0; n while (stk[tp] != x) { n color[stk[tp]] = scc; n vis[stk[tp--]] = 0; n } n tp--; n } n } n void work(int n) { n for (int i = 0; i < 2 * n; i++) n if (!dfn[i]) tarjan(i); n for (int i = 0; i < n; i++) n if (color[i * 2] == color[i * 2 + 1]) { n puts( -1 ); n return; n } n vector row, col; n for (int i = 0; i < n / 2; i++) { n if (color[i * 2] < color[i * 2 + 1]) { n continue; n } else { n row.push_back(i); n } n } n for (int i = n / 2; i < n; i++) { n if (color[i * 2] < color[i * 2 + 1]) { n continue; n } else { n col.push_back(i - n / 2); n } n } n int sz = row.size() + col.size(); n printf( %d n , sz); n for (auto it : row) printf( row %d n , it); n for (auto it : col) printf( col %d n , it); n } n } twosat; n char s[N]; n int a[2005]; n int g[2005][2005]; n signed main() { n int n; n read(n); n getchar(); n for (int k = 1; k <= 2; k++) { n for (int i = 1; i <= n; i++) { n gets(s + 1); n for (int j = 1; j <= n; j++) { n g[i][j] ^= (s[j] - 0 ); n } n } n } n twosat.init(2 * n); n gets(s + 1); n for (int i = 1; i <= n; i++) a[i] = s[i] - 0 ; n bool ok = 1; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n int n1 = a[i], n2 = a[j]; n int ii = i - 1, jj = j + n - 1; n if (g[i][j] == 1) { n if (n1 == 1 and n2 == 1) { n twosat.G[ii * 2].push_back(jj * 2 + 1); n twosat.G[jj * 2].push_back(ii * 2 + 1); n twosat.G[ii * 2 + 1].push_back(jj * 2); n twosat.G[jj * 2 + 1].push_back(ii * 2); n } else if (n2 == 1) { n twosat.G[ii * 2].push_back(ii * 2 + 1); n } else if (n1 == 1) { n twosat.G[jj * 2].push_back(jj * 2 + 1); n } else { n ok = 0; n } n } else { n if (n1 == 1 and n2 == 1) { n twosat.G[ii * 2].push_back(jj * 2); n twosat.G[ii * 2 + 1].push_back(jj * 2 + 1); n twosat.G[jj * 2].push_back(ii * 2); n twosat.G[jj * 2 + 1].push_back(ii * 2 + 1); n } else if (n2 == 1) { n twosat.G[ii * 2 + 1].push_back(ii * 2); n } else if (n1 == 1) { n twosat.G[jj * 2 + 1].push_back(jj * 2); n } else { n continue; n } n } n } n } n if (!ok) n puts( -1 ); n else { n twosat.work(n * 2); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n FILE *in; n FILE *out; n int n, m, k; n char a[64][64]; n int blocks[64][64]; n int cell[64 * 64][2]; n int dyn[64 * 64][4][2]; n int dir[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; n void fill(int row, int col, int color) { n blocks[row][col] = color; n for (int i = 0; i < 4; i++) { n int nrow = row + dir[i][0]; n if (nrow < 0 || nrow >= n) continue; n int ncol = col + dir[i][1]; n if (ncol < 0 || ncol >= m) continue; n if (a[row][col] == a[nrow][ncol] && blocks[nrow][ncol] == -1) n fill(nrow, ncol, color); n } n } n void getBlocks() { n int nextColor = 0; n memset(blocks, -1, sizeof(blocks)); n for (int i = 0; i < n; i++) { n for (int c = 0; c < m; c++) { n if (a[i][c] != 0 && blocks[i][c] == -1) { n fill(i, c, nextColor); n cell[nextColor][0] = i; n cell[nextColor][1] = c; n nextColor++; n } n } n } n } n int main(void) { n in = stdin; n out = stdout; n fscanf(in, %d %d , &n, &k); n for (int i = 0; i < n; i++) fscanf(in, %s , a[i]); n m = (int)strlen(a[0]); n getBlocks(); n memset(dyn, -1, sizeof(dyn)); n int rem = k, cur = 0; n int bp = 0, dp = 1, cp = 0; n int foundCycle = 0; n while (rem) { n rem--; n cur++; n if (!foundCycle && dyn[bp][dp][cp] != -1) { n foundCycle = 1; n rem %= (cur - dyn[bp][dp][cp]); n } n dyn[bp][dp][cp] = cur; n int row = cell[bp][0], col = cell[bp][1]; n while (1) { n int nrow = row + dir[dp][0]; n if (nrow < 0 || nrow >= n) break; n int ncol = col + dir[dp][1]; n if (ncol < 0 || ncol >= m) break; n if (a[nrow][ncol] != a[row][col]) break; n row = nrow; n col = ncol; n } n int dd = (cp ? ((dp + 1) % 4) : ((dp + 3) % 4)); n while (1) { n int nrow = row + dir[dd][0]; n if (nrow < 0 || nrow >= n) break; n int ncol = col + dir[dd][1]; n if (ncol < 0 || ncol >= m) break; n if (a[nrow][ncol] != a[row][col]) break; n row = nrow; n col = ncol; n } n int nrow = row + dir[dp][0]; n int ncol = col + dir[dp][1]; n if (nrow >= 0 && nrow < n && ncol >= 0 && ncol < m && n a[nrow][ncol] != 0 ) { n bp = blocks[nrow][ncol]; n continue; n } n if (cp == 0) n cp = 1; n else { n cp = 0; n dp = (dp + 1) % 4; n } n } n fprintf(out, %c n , a[cell[bp][0]][cell[bp][1]]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 55, M = 105, T = 20005, K = 20; n const double S = 1e5, inf = 1e9, PI = acos(-1); n template n void read(T &x) { n int sgn = 1; n char ch; n x = 0; n for (ch = getchar(); (ch < 0 || ch > 9 ) && ch != - ; ch = getchar()) n ; n if (ch == - ) ch = getchar(), sgn = -1; n for (; 0 <= ch && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; n x *= sgn; n } n template n void write(T x) { n if (x < 0) n putchar( - ), write(-x); n else if (x < 10) n putchar(x + 0 ); n else n write(x / 10), putchar(x % 10 + 0 ); n } n int n, m, t; n double c, cost[M], dist[N], f[N][T], val[M][T]; n complex w[K][T << 3]; n struct node { n int id, to; n vector vec; n }; n vector g[N]; n vector h[N]; n queue q; n bool vis[N]; n void spfa() { n for (int i = 1; i <= n; i++) dist[i] = inf, vis[i] = false; n dist[n] = true, q.push(n), dist[n] = 0.0; n while (!q.empty()) { n int u = q.front(); n for (int i = 0; i < g[u].size(); i++) { n int v = g[u][i].to; n if (dist[v] > dist[u] + cost[g[u][i].id]) { n dist[v] = dist[u] + cost[g[u][i].id]; n if (!vis[v]) vis[v] = true, q.push(v); n } n } n q.pop(), vis[u] = false; n } n } n void init() { n for (int i = 1, j = 0; i <= (t + 2 << 3); i <<= 1, j++) { n for (int k = 0; k <= i; k++) n w[j][k] = complex(cos(2.0 * k * PI / i), sin(2.0 * k * PI / i)); n } n } n int bitrev[T << 3]; n void dft(complex *x, int len, int ty) { n bitrev[0] = 0; n for (int i = 1; i < len; i++) { n bitrev[i] = bitrev[i >> 1] >> 1; n if (i & 1) bitrev[i] |= (len >> 1); n } n for (int i = 0; i < len; i++) { n if (bitrev[i] < i) swap(x[bitrev[i]], x[i]); n } n for (int i = 1, label = 1; i < len; i <<= 1, label++) { n for (int j = 0; j < len; j += (i << 1)) { n for (int k = 0; k < i; k++) { n complex u = x[j + k], v = x[j + k + i]; n complex r = ty > 0 ? w[label][k] : w[label][(i << 1) - k]; n x[j + k] = u + r * v, x[j + k + i] = u - r * v; n } n } n } n if (ty < 0) { n for (int i = 0; i < len; i++) x[i] /= len; n } n } n complex tmp1[T << 3], tmp2[T << 3], tmp[T << 3]; n void solve(int l, int r) { n int mid = l + r >> 1; n if (l < r) { n solve(mid + 1, r); n int l1 = r - mid, l2 = r - l, len = 1; n while (len <= l1 + l2) len <<= 1; n for (int i = 1; i <= n; i++) { n if (r - l <= 1000) { n for (int j = 0; j < g[i].size(); j++) { n for (int k = l; k <= mid; k++) { n for (int T = mid + 1 - k; T <= r - k; T++) n val[g[i][j].id][k] += g[i][j].vec[T] * f[i][k + T]; n } n } n continue; n } n for (int j = 0; j < len; j++) tmp1[j] = complex(0.0, 0.0); n for (int j = 0; j < r - mid; j++) n tmp1[j] = complex(f[i][mid + 1 + j], 0.0); n dft(tmp1, len, 1); n for (int j = 0; j < g[i].size(); j++) { n for (int k = 0; k < len; k++) tmp2[k] = complex(0.0, 0.0); n for (int k = 0; k <= l2; k++) n tmp2[k] = complex(g[i][j].vec[l2 - k], 0.0); n dft(tmp2, len, 1); n for (int k = 0; k < len; k++) tmp[k] = tmp1[k] * tmp2[k]; n dft(tmp, len, -1); n for (int k = l; k <= mid; k++) n val[g[i][j].id][k] += tmp[k + l2 - mid - 1].real(); n } n } n solve(l, mid); n } else { n for (int i = 1; i <= n; i++) { n for (int j = 0; j < h[i].size(); j++) n f[i][mid] = min(f[i][mid], val[h[i][j]][mid] + cost[h[i][j]]); n } n } n } n int main() { n read(n), read(m), read(t); n scanf( %lf , &c); n for (int i = 1; i <= m; i++) { n int u, v; n vector vec(t + 1); n read(u), read(v); n scanf( %lf , &cost[i]); n for (int j = 1; j <= t; j++) { n int x; n read(x); n vec[j] = x / S; n } n node x = {i, u, vec}; n g[v].push_back(x), h[u].push_back(i); n } n spfa(); n for (int i = 1; i <= n; i++) f[i][t + 1] = dist[i] + c; n for (int i = 1; i <= n; i++) { n for (int j = 0; j <= t; j++) f[i][j] = (i == n) ? 0.0 : inf; n } n for (int i = 1; i <= m; i++) { n for (int j = 0; j <= t; j++) val[i][j] = 0.0; n } n for (int i = 1; i <= n; i++) { n for (int j = 0; j < g[i].size(); j++) { n double x = 0.0; n for (int k = 0; k <= t; k++) n val[g[i][j].id][k] += x * f[i][t + 1], x += g[i][j].vec[t - k]; n } n } n init(); n solve(0, t); n printf( %lf n , f[1][0]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 prng(chrono::steady_clock::now().time_since_epoch().count()); n void testCase(int caseno) { n int n, k, a, b; n cin >> n >> k; n multiset aa; n multiset bb; n int sum = 0; n for (int i = 0; i < n; i++) { n cin >> a; n sum += a; n aa.insert(a); n } n for (int i = 0; i < n; i++) { n cin >> b; n bb.insert(b); n } n for (int i : aa) { n } n for (int i : bb) { n } n int it = 0; n while (*(aa.begin()) < *(--bb.end()) && it < k) { n it++; n sum -= *(aa.begin()); n sum += *(--bb.end()); n aa.insert(*(--bb.end())); n bb.insert(*(aa.begin())); n auto ita = aa.begin(); n auto itb = --bb.end(); n aa.erase(ita); n bb.erase(itb); n } n cout << sum << endl; n } n int main() { n int t; n cin >> t; n for (int i = 0; i < t; i++) { n testCase(i + 1); n } n return 0; n } n "} +{"func_code_string": "#include n const double g = 9.8; n using namespace std; n const long long mod = 998244353; n long long quick(long long prea, long long bbb) { n long long res = 1; n while (bbb) { n if (bbb & 1) res = res * prea % mod; n prea = prea * prea % mod; n bbb >>= 1; n } n return res; n } n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } n pair pp; n const int w = 2e5 + 5; n long long a[w]; n stack s; n int main() { n long long k, m, n, t, i, j; n cin >> n; n for (i = 0; i < n; i++) { n cin >> m; n if (s.empty()) n s.push(m); n else { n if (abs(m - s.top()) % 2 == 0) n s.pop(); n else n s.push(m); n } n } n if (s.size() > 1) n cout << NO << endl; n else n cout << YES << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int a, b, r; n cin >> a >> b >> r; n if (2 * r <= min(a, b)) n cout << First ; n else n cout << Second ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n int a[m]; n for (int i = 0; i < m; i++) { n cin >> a[i]; n if (a[i] > n - i) { n cout << -1 << endl; n return 0; n } n } n long long suf_sum[m + 1]; n suf_sum[m] = 0; n for (int i = m - 1; i >= 0; i--) { n suf_sum[i] = suf_sum[i + 1] + a[i]; n } n if (suf_sum[0] < n) { n cout << -1 << endl; n return 0; n } n for (int i = 0; i < m; i++) { n cout << max((long long)i + 1, n - suf_sum[i] + 1) << ; n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 5, mod = 998244353; n int inv[N], fac[N]; n int ksm(int b, int n) { n int res = 1; n while (n) { n if (n & 1) res = 1ll * res * b % mod; n b = 1ll * b * b % mod; n n >>= 1; n } n return res; n } n void init(int n) { n fac[0] = 1; n for (int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % mod; n inv[n] = ksm(fac[n], mod - 2); n for (int i = n - 1; i >= 0; --i) inv[i] = 1ll * (i + 1) * inv[i + 1] % mod; n } n int C(int n, int m) { n if (n < m || n < 0 || m < 0) return 0; n return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod; n } n int calc(int n, int m, int lim) { n if (n == 0) return 1; n if (n < 0) return 0; n int ans = 0; n for (int i = 0; i <= m; ++i) { n int tmp = 1ll * C(n - lim * i + m - 1, m - 1) * C(m, i) % mod; n if (i & 1) n ans = (ans + mod - tmp) % mod; n else n ans = (ans + tmp) % mod; n } n return ans; n } n signed main() { n int p, s, r, ans = 0; n cin >> p >> s >> r; n init(1e5); n for (int i = r; i <= s; ++i) n for (int j = 1; j <= p; ++j) { n if (i * j + (p - j) * (i - 1) < s) continue; n int tmp = 1ll * calc(s - j * i, p - j, i) * C(p - 1, j - 1) % mod; n ans = (ans + 1ll * tmp * ksm(j, mod - 2)) % mod; n } n cout << 1ll * ans * ksm(C(s - r + p - 1, p - 1), mod - 2) % mod; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const int MOD = 1e9 + 7; n int main() { n cin.tie(0)->sync_with_stdio(0); n int t; n cin >> t; n while (t--) { n string s; n cin >> s; n vector r; n for (string t : { twone , one , two }) { n for (size_t pos = 0; (pos = s.find(t, pos)) != string::npos;) { n s[pos + t.length() / 2] = ? ; n r.push_back(pos + t.length() / 2); n } n } n cout << r.size() << endl; n for (auto rr : r) cout << rr + 1 << ; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int x[2001], y[2001]; n int p[2001], mn[2001]; n int k[2001], c[2001]; n bool used[2001][2001]; n unsigned long long dst[2001][2001]; n unsigned long long dist(int i, int j) { n return (unsigned long long)(k[i] + k[j]) * n (unsigned long long)(abs(x[i] - x[j]) + abs(y[i] - y[j])); n } n void init() { n for (int i = 0; i < n; i++) { n p[i] = i; n mn[i] = c[i]; n } n for (int i = 0; i < n; i++) { n for (int j = i + 1; j < n; j++) { n dst[i][j] = dist(i, j); n dst[j][i] = dst[i][j]; n } n } n } n struct vertex { n unsigned long long len; n int x, y; n vertex(){}; n vertex(unsigned long long _len, int _x, int _y) { n len = _len; n x = _x; n y = _y; n } n bool operator<(vertex b) { return len < b.len; } n }; n bool operator<(const vertex& a, const vertex& b) { return a.len < b.len; } n multiset s; n int get_anc(int x) { n if (x == p[x]) return x; n return p[x] = get_anc(p[x]); n } n void unite(int x, int y) { n x = get_anc(x); n y = get_anc(y); n if (x == y) return; n if (x < y) swap(x, y); n p[x] = y; n mn[y] = min(mn[x], mn[y]); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 0; i < n; i++) { n cin >> x[i] >> y[i]; n } n for (int i = 0; i < n; i++) cin >> c[i]; n for (int i = 0; i < n; i++) cin >> k[i]; n init(); n for (int i = 0; i < n; i++) { n for (int j = i + 1; j < n; j++) { n s.insert(vertex(dst[i][j], i, j)); n } n } n unsigned long long ans = 0; n int conn = 0; n while (!s.empty()) { n vertex cur = *s.begin(); n s.erase(s.begin()); n unsigned long long curlen = cur.len; n int curx = cur.x, cury = cur.y; n if (get_anc(curx) == get_anc(cury)) continue; n if (curlen + min(mn[get_anc(curx)], mn[get_anc(cury)]) > n mn[get_anc(curx)] + mn[get_anc(cury)]) n continue; n unite(curx, cury); n ans += curlen; n used[curx][cury] = used[cury][curx] = 1; n conn++; n } n vector way; n for (int i = 0; i < n; i++) { n int x = get_anc(i); n if (c[i] == mn[x]) { n ans += c[i]; n mn[i] = -1; n way.push_back(i + 1); n } n } n cout << ans << endl; n cout << way.size() << endl; n for (int i = 0; i < way.size(); i++) cout << way[i] << ; n cout << endl; n cout << conn << endl; n for (int i = 0; i < n; i++) { n for (int j = i + 1; j < n; j++) { n if (used[i][j]) cout << i + 1 << << j + 1 << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100007; n int n, k; n int s[N]; n int main() { n scanf( %d %d , &n, &k); n for (int i = 0; i < n; i++) scanf( %d , s + i); n if (k >= n) { n printf( %d n , s[n - 1]); n return 0; n } n int maxi = 0; n while (n < 2 * k) { n maxi = max(s[--n], maxi); n k--; n } n for (int i = 0; i < k; i++) { n maxi = max(s[i] + s[n - i - 1], maxi); n } n printf( %d n , maxi); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n scanf( %d , &n); n printf( %d n , n / 2 - (n % 2 ? 0 : 1)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s, s1; n int main() { n cin >> s; n cin >> s1; n reverse(s.begin(), s.end()); n reverse(s1.begin(), s1.end()); n while (!s.empty() && s[s.size() - 1] == 0 ) s.pop_back(); n while (!s1.empty() && s1[s1.size() - 1] == 0 ) s1.pop_back(); n if (s.size() > s1.size()) n cout << > ; n else if (s1.size() > s.size()) n cout << < ; n else { n int z = 0; n for (int i = s.size() - 1; i >= 0 && z == 0; i--) n if (s[i] > s1[i]) n z = 1; n else if (s1[i] > s[i]) n z = 2; n if (z == 1) n cout << > ; n else if (z == 2) n cout << < ; n else n cout << = ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 105, mod = 1e9 + 7; n int dp[N][N * N]; n bool done[N][N * N]; n int fact[N], inv[N]; n int arr1[N]; n int arr2[N]; n int n, k; n long long m; n inline int add(int a, int b) { n int res = a + b; n if (res >= mod) res -= mod; n return res; n } n inline int mult(int a, int b) { n long long res = a * 1LL * b; n return res % mod; n } n int powmod(int a, long long b) { n int res = 1; n while (b) { n if (b & 1) { n res = mult(res, a); n } n a = mult(a, a); n b >>= 1; n } n return res; n } n int ncr(int n, int r) { n int res = fact[n]; n res = mult(res, inv[r]); n res = mult(res, inv[n - r]); n return res; n } n int solve(int pos, int cnt) { n if (cnt < 0) return 0; n if (pos == n + 1) return (cnt == 0); n if (done[pos][cnt]) return dp[pos][cnt]; n if ((n + 1 - pos) * n < cnt) return 0; n long long p = m / n; n bool b = (pos <= m % n); n if (b) { n for (int i = 0; i <= n; i++) { n dp[pos][cnt] = add(mult(solve(pos + 1, cnt - i), arr2[i]), dp[pos][cnt]); n } n } else { n for (int i = 0; i <= n; i++) { n dp[pos][cnt] = add(mult(solve(pos + 1, cnt - i), arr1[i]), dp[pos][cnt]); n } n } n done[pos][cnt] = true; n return dp[pos][cnt]; n } n int main() { n scanf( %d %I64d %d , &n, &m, &k); n fact[0] = 1, inv[0] = 1; n long long p = m / n; n for (int i = 1; i < N; i++) { n fact[i] = mult(fact[i - 1], i); n inv[i] = powmod(fact[i], mod - 2); n } n for (int i = 0; i <= n; i++) { n arr1[i] = powmod(ncr(n, i), p); n arr2[i] = powmod(ncr(n, i), p + 1); n } n memset(dp, 0, sizeof(dp)); n int ans = solve(1, k); n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n int a[11], b[11]; n scanf( %d %d , &n, &m); n for (int i = 0; i < n; i++) { n scanf( %d , a + i); n } n for (int i = 0; i < m; i++) { n scanf( %d , b + i); n } n sort(a, a + n); n sort(b, b + m); n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (a[i] == b[j]) { n printf( %d n , a[i]); n return 0; n } n } n } n if (a[0] > b[0]) n printf( %d%d n , b[0], a[0]); n else n printf( %d%d n , a[0], b[0]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int in() { n int a; n scanf( %d , &a); n return a; n } n double din() { n double a; n scanf( %lf , &a); n return a; n } n int gcd(int a, int b) { n while (b) { n a %= b; n swap(a, b); n } n return a; n } n int lcm(int a, int b) { return a / gcd(a, b) * b; } n const double eps = 1e-6; n int logbin(int a) { n a--; n int res = 1; n while (a) a >>= 1, res <<= 1; n return res; n } n int binpow(int a, int n) { n int res = 1; n while (n) { n if (n & 1) res *= a; n a *= a; n n >>= 1; n } n return res; n } n vector > g; n vector u; n vector p; n void dfs(int v) { n u[v] = 1; n for (int i = 0; i < g[v].size(); ++i) { n int to = g[v][i]; n if (!u[to]) { n p[to] = v; n dfs(to); n } else { n if (u[to] == 1) { n int vv = v; n while (p[vv] != to) { n u[vv] = 3; n vv = p[vv]; n } n } n } n } n if (u[v] == 1) u[v] = 2; n } n int main() { n int n = in(); n int m = in(), k = in(); n vector > > > g( n n, vector > >()); n for (int i = 0; i < n; ++i) { n string s; n cin >> s; n for (int j = 0; j < m; ++j) { n int u = in(), e = in(), h = in(); n g[i].push_back(make_pair(u, make_pair(e, h))); n } n } n long long res = 0; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < n; ++j) { n if (i == j) continue; n vector > > s, t; n s = g[i]; n t = g[j]; n vector c; n long long r = 0; n for (int y = 0; y < m; ++y) { n int nn = s[y].second.second; n for (int h = 0; h < nn; ++h) { n int buf = t[y].second.first - s[y].first; n if (buf > 0) n c.push_back(buf); n else n break; n } n } n sort((c).rbegin(), (c).rend()); n for (int i = 0; i < min((int)c.size(), k); ++i) { n r += c[i]; n } n res = max(res, r); n } n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool sortinrev(const pair &a, n const pair &b) { n return (a.first > b.first); n } n void solve() { n long long n; n cin >> n; n long long a[n]; n map mp; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n mp[a[i]] = i; n } n long long p = 1; n long long end = n; n while (end != 0) { n long long k = mp[p]; n for (long long i = k; i < end; i++) { n if (a[i] != p) { n cout << No n << n ; n return; n } n p++; n } n end = k; n } n cout << Yes n << n ; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long t = 1; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n vector> q; n int n; n void op(int i, int j) { q.push_back({i, j}); } n void f(int l, int r) { n if (l >= r) return; n int len = (r - l + 1); n if (len % 2 == 0) { n int m = (l + r) / 2; n f(l, m); n f(m + 1, r); n for (int j = 0; j < len / 2; j++) op(l + j, l + len / 2 + j); n } else { n r--; n int m = (l + r) / 2; n f(l, m); n f(m + 1, r); n for (int j = 0; j < len / 2; j++) op(l + j, l + len / 2 + j); n r++; n for (int j = l; j < r; j++) op(j, r); n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n; n int k = log2(n); n k = (1 << k); n f(1, k); n f(n - k + 1, n); n cout << (int)q.size() << n ; n for (auto &it : q) cout << it.first << << it.second << n ; n } n "} +{"func_code_string": "#include n long long n, i, k, j, t, b; n char a[2500]; n bool s; n using namespace std; n int main() { n k = 0; n cin >> n; n for (i = 1; i <= n; i++) { n cin >> a[i]; n if (a[i] == H ) k++; n } n b = n - k; n for (i = n + 1; i <= 2 * n; i++) a[i] = a[i - n]; n for (i = 1; i <= 2 * n; i++) n if (i + k <= 2 * n) { n t = 0; n for (j = i; j < i + k; j++) n if (a[j] != H ) t++; n if (t < b) b = t; n } n cout << b << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin >> n; n cout << ((n % 2) ? black : white n1 2 n ) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int i, n, m, ans, x, l, r, tot, a[1000005], b[1000005], last[1000005], n to[1000005], Next[1000005], q[1000005], y; n inline void add(int x, int y) { n Next[++tot] = last[x]; n last[x] = tot; n to[tot] = y; n } n inline bool check(int x) { n for (int i = 1; i <= n; i++) a[i] = b[i]; n a[x]--; n int rr = r, ll = l; n q[++r] = x; n while (l < r) { n int k = q[++l]; n for (int i = last[k]; i; i = Next[i]) { n a[to[i]]--; n if (!a[to[i]]) q[++r] = to[i]; n } n } n if (r == n) return true; n r = rr, l = ll; n return false; n } n int main() { n scanf( %d%d , &n, &m); n for (i = 1; i <= m; i++) scanf( %d%d , &x, &y), b[y]++, add(x, y); n for (i = 1; i <= n; i++) n if (b[i] == 0) q[++r] = i; n while (l < r) { n int k = q[++l]; n for (int i = last[k]; i; i = Next[i]) { n b[to[i]]--; n if (!b[to[i]]) q[++r] = to[i]; n } n } n if (r == n) return puts( YES ), 0; n for (i = 1; i <= n; i++) { n if (b[i] == 1) { n if (check(i)) return puts( YES ), 0; n } n } n puts( NO ); n } n "} +{"func_code_string": "#include n using namespace std; n vector v, ext; n long long f[20]; n bool vis[20]; n bool chck(long long j) { n while (j) { n if (j % 10 != 4 && j % 10 != 7) break; n j /= 10; n } n return j == 0; n } n int main() { n long long i, n, k, st, sum, j, pre, sz, ans; n f[0] = 1; n for (i = 1; i <= 13; i++) f[i] = f[i - 1] * i; n cin >> n >> k; n if (n <= 13 && k > f[n]) { n cout << -1 << endl; n return 0; n } n for (i = 1; f[i] < k; i++) n ; n st = n - i + 1; n sum = k; n for (j = 1; j <= i; j++) { n for (k = st; k <= n; k++) { n if (!vis[k - st]) { n if (sum - f[i - j] > 0) { n sum -= f[i - j]; n } else { n ext.push_back(k); n vis[k - st] = 1; n break; n } n } n } n } n queue q; n q.push(4); n q.push(7); n v.push_back(4); n v.push_back(7); n while (!q.empty()) { n pre = q.front(); n q.pop(); n if (pre * 10 + 4 <= 5000000000LL) { n q.push(pre * 10 + 4); n q.push(pre * 10 + 7); n v.push_back(pre * 10 + 4); n v.push_back(pre * 10 + 7); n } n } n sz = v.size(); n ans = 0; n for (i = 0; i < sz && v[i] < st; i++) ans++; n for (i = st; i <= n; i++) { n if (chck(i)) { n if (chck(ext[i - st])) ans++; n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n typedef struct val { n long int val, ind; n } va; n int cmp(const void *a, const void *b) { n va ka = *(va *)a; n va kb = *(va *)b; n if (ka.val > kb.val) n return -1; n else n return 1; n } n int a[2009][2009]; n int main() { n va v[2009], ba[2009]; n long int n, m, t1, t2, i, j, ans = 0; n scanf( %ld %ld , &n, &m); n for (i = 0; i < n; i++) { n scanf( %ld , &v[i].val); n v[i].ind = i + 1; n ba[i] = v[i]; n } n for (i = 0; i < m; i++) { n scanf( %ld %ld , &t1, &t2); n a[t1][t2] = 1; n a[t2][t1] = 1; n } n qsort(v, n, sizeof(va), cmp); n for (i = 0; i < n; i++) n for (j = 1; j <= n; j++) n if (a[v[i].ind][j]) { n a[v[i].ind][j] = 0; n a[j][v[i].ind] = 0; n ans += ba[j - 1].val; n } n printf( %ld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int A[1000]; n void quicksort(int l, int r) { n int b = l; n if (r - l < 1) { n return; n } n for (int i = l; i < r; ++i) { n if (A[i] < A[r]) { n swap(A[i], A[b]); n b = b + 1; n } n } n swap(A[r], A[b]); n quicksort(l, b - 1); n quicksort(b + 1, r); n } n int main() { n int r; n cin >> r; n for (int i = 0; i < r; ++i) { n cin >> A[i]; n } n quicksort(0, r - 1); n if (r % 2 > 0) { n cout << A[(r / 2)]; n } else { n cout << min(A[r / 2], A[r / 2 - 1]); n } n return 0; n } n "} +{"func_code_string": "#include n int inp() { n char c = getchar(); n while (c < 0 || c > 9 ) c = getchar(); n int sum = 0; n while (c >= 0 && c <= 9 ) { n sum = sum * 10 + c - 0 ; n c = getchar(); n } n return sum; n } n struct SEG_Tree { n struct SEG { n int l; n int r; n int min; n long long sum; n long long ans; n int lazy; n long long lazy2; n } t[5000010]; n void push_up(int cur) { n t[cur].min = std::min(t[((cur) << 1)].min, t[((cur) << 1 | 1)].min); n t[cur].sum = 0; n if (t[cur].min == t[((cur) << 1)].min) t[cur].sum += t[((cur) << 1)].sum; n if (t[cur].min == t[((cur) << 1 | 1)].min) n t[cur].sum += t[((cur) << 1 | 1)].sum; n } n void push_down(int cur) { n t[((cur) << 1)].min += t[cur].lazy; n t[((cur) << 1 | 1)].min += t[cur].lazy; n t[((cur) << 1)].lazy += t[cur].lazy; n t[((cur) << 1 | 1)].lazy += t[cur].lazy; n t[cur].lazy = 0; n if (t[cur].min == t[((cur) << 1)].min) { n t[((cur) << 1)].ans += t[((cur) << 1)].sum * t[cur].lazy2; n t[((cur) << 1)].lazy2 += t[cur].lazy2; n } n if (t[cur].min == t[((cur) << 1 | 1)].min) { n t[((cur) << 1 | 1)].ans += t[((cur) << 1 | 1)].sum * t[cur].lazy2; n t[((cur) << 1 | 1)].lazy2 += t[cur].lazy2; n } n t[cur].lazy2 = 0; n } n void build(int cur, int l, int r) { n t[cur].l = l; n t[cur].r = r; n if (l == r) { n t[cur].min = l; n t[cur].sum = 1; n return; n } n int mid = (l + r) >> 1; n build(((cur) << 1), l, mid); n build(((cur) << 1 | 1), mid + 1, r); n push_up(cur); n } n void modify(int cur, int l, int r, int c) { n if (t[cur].l > r || t[cur].r < l) return; n if (t[cur].l >= l && t[cur].r <= r) { n t[cur].min += c; n t[cur].lazy += c; n return; n } n push_down(cur); n modify(((cur) << 1), l, r, c); n modify(((cur) << 1 | 1), l, r, c); n push_up(cur); n } n long long query(int cur, int l, int r) { n if (t[cur].l > r || t[cur].r < l) return 0; n if (t[cur].l >= l && t[cur].r <= r) return t[cur].ans; n push_down(cur); n return query(((cur) << 1), l, r) + query(((cur) << 1 | 1), l, r); n } n } t; n std::vector > vec[1200010]; n long long ans[1200010]; n int a[1200010], s1[1200010], s2[1200000]; n signed main() { n int n = inp(); n for (int i = 1; i <= n; i++) a[i] = inp(); n int q = inp(); n for (int i = 1; i <= q; i++) { n int l = inp(); n int r = inp(); n vec[r].push_back(std::make_pair(l, i)); n } n int top1 = 0, top2 = 0; n t.build(1, 1, n); n for (int i = 1; i <= n; i++) { n t.modify(1, 1, n, -1); n while (top1 && a[s1[top1]] > a[i]) { n t.modify(1, s1[top1 - 1] + 1, s1[top1], a[s1[top1]] - a[i]); n top1--; n } n s1[++top1] = i; n while (top2 && a[s2[top2]] < a[i]) { n t.modify(1, s2[top2 - 1] + 1, s2[top2], a[i] - a[s2[top2]]); n top2--; n } n s2[++top2] = i; n t.t[1].ans += t.t[1].sum; n t.t[1].lazy2++; n for (int j = 0; j < vec[i].size(); j++) n ans[vec[i][j].second] = t.query(1, vec[i][j].first, i); n } n for (int i = 1; i <= q; i++) printf( %lld n , ans[i]); n } n "} +{"func_code_string": "#include n using namespace std; n int dp[105][200005]; n int main() { n int n, k; n cin >> n >> k; n int a[n + 1], b[n + 1]; n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int i = 1; i <= n; i++) cin >> b[i]; n int off = 1000 * n; n for (int i = 0; i < 105; i++) n for (int j = 0; j < 200005; j++) dp[i][j] = -INT_MAX; n dp[0][off] = 0; n for (int curr = 1; curr <= n; curr++) { n int bl = a[curr] - b[curr] * k; n for (int bal = off; bal >= -off; bal--) { n dp[curr][bal + off] = n max(dp[curr - 1][bal + off], dp[curr - 1][bal - bl + off] + a[curr]); n } n } n cout << (dp[n][off] ? dp[n][off] : -1) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n string to_string(A* ptr) { n stringstream ss; n ss << 0x << std::setw(16) << std::setfill( 0 ) << std::hex n << (uint64_t)(uintptr_t)ptr; n return ss.str(); n } n string to_string(char c) { return ((string) + c) + ; } n template n string to_string(pair p); n template n string to_string(tuple p); n template n string to_string(tuple p); n string to_string(const string& s) { return + s + ; } n string to_string(const char* s) { return to_string((string)s); } n string to_string(bool b) { return (b ? true : false ); } n string to_string(vector v) { n bool first = true; n string res = { ; n for (int i = 0; i < static_cast(v.size()); i++) { n if (!first) { n res += , ; n } n first = false; n res += to_string(v[i]); n } n res += } ; n return res; n } n template n string to_string(bitset v) { n string res = ; n for (size_t i = 0; i < N; i++) { n res += static_cast( 0 + v[i]); n } n return res; n } n template n string to_string(A v) { n bool first = true; n string res = { ; n for (const auto& x : v) { n if (!first) { n res += , ; n } n first = false; n res += to_string(x); n } n res += } ; n return res; n } n template n string to_string(pair p) { n return ( + to_string(p.first) + , + to_string(p.second) + ) ; n } n template n string to_string(tuple p) { n return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + n to_string(get<2>(p)) + ) ; n } n template n string to_string(tuple p) { n return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + n to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; n } n void debug_out() { cerr << endl; } n template n void debug_out(Head H, Tail... T) { n cerr << << to_string(H); n debug_out(T...); n } n int n, k, m; n void add(int& A, int B) { n A += B; n if (A >= m) A -= m; n } n const int MAXN = 1009; n const int MAXK = 109; n int dp[MAXN][MAXK][2][2]; n long long solve() { n add(dp[0][0][0][0], 1); n for (int cnt_digits = 0, pow10 = 1; cnt_digits < n; n cnt_digits++, pow10 = (10 * pow10) % k) { n for (int rem_x = 0; rem_x < k; rem_x++) { n for (int had_nonzero_y = 0; had_nonzero_y <= 1; had_nonzero_y++) { n for (int x_is_nonzero = 0; x_is_nonzero <= 1; x_is_nonzero++) { n if (dp[cnt_digits][rem_x][had_nonzero_y][x_is_nonzero] == 0) continue; n for (int lead_digit = 0; lead_digit <= 9; lead_digit++) { n int new_rem_x = (pow10 * lead_digit + rem_x) % k; n int new_x_is_nonzero = x_is_nonzero || (lead_digit != 0); n int new_had_nonzero_y = n had_nonzero_y || (new_rem_x == 0 && new_x_is_nonzero); n 42; n 42; n add(dp[cnt_digits + 1][new_rem_x][new_had_nonzero_y] n [new_x_is_nonzero], n dp[cnt_digits][rem_x][had_nonzero_y][x_is_nonzero]); n } n 42; n 42; n } n } n } n } n int result = 0; n int result_sub = 0; n for (int rem_x = 0; rem_x < k; rem_x++) { n add(result, dp[n][rem_x][1][1]); n add(result_sub, dp[n - 1][rem_x][1][1]); n } n int answer = (result - result_sub + m) % m; n return answer; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n int TT; n TT = 1; n for (int ttt = 0; ttt < TT; ttt++) { n cin >> n >> k >> m; n cout << solve() << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s, t, x; n vector lcp; n vector match; n constexpr int mxn = int(2e5) + 10; n int dp[mxn][3]; n int pref[mxn]; n const int mod = 1e9 + 7; n int ans(int start) { n if (dp[start][2] != -1) return dp[start][2]; n if (start >= x.size()) return dp[start][0] = dp[start][1] = dp[start][2] = 0; n if (match[start]) { n dp[start][0] = dp[start][1] = 0; n int st = start + t.size() - 1; n int end = x.size() - 1; n int cnt = end - st + 1; n ans(st + 1); n dp[start][0] += cnt; n dp[start][0] %= mod; n dp[start][0] += pref[st + 1]; n dp[start][0] %= mod; n dp[start][1] += ans(start + 1); n dp[start][1] %= mod; n dp[start][2] = (dp[start][0] + dp[start][1]) % mod; n pref[start] = pref[start + 1] + dp[start][2]; n pref[start] %= mod; n return dp[start][2]; n } n int curr = start; n while (curr < x.size() and not match[curr]) { n curr++; n } n ans(curr); n for (int i = curr - 1; i >= start; i--) { n dp[i][0] = dp[curr][0]; n dp[i][1] = dp[i + 1][2]; n dp[i][2] = dp[i][0] + dp[i][1]; n dp[i][2] %= mod; n pref[i] = pref[i + 1] + dp[i][2]; n pref[i] %= mod; n } n return dp[start][2]; n } n void solve() { n cin >> s >> t; n x = t + # + s; n lcp = vector(x.size()); n match = vector(x.size()); n lcp[0] = 0; n for (int i = 1; i < x.size(); i++) { n int j = lcp[i - 1]; n while (j > 0 and x[j] != x[i]) j = lcp[j - 1]; n if (x[j] == x[i]) j++; n lcp[i] = j; n if (lcp[i] == t.size()) { n match[i - t.size() + 1] = true; n } n } n cout << ans(t.size() + 1); n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n memset(dp, -1, sizeof(dp)); n memset(pref, 0, sizeof(pref)); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int fun(long long int x, long long int y, long long int p) { n long long int s = x / p; n if (x % p) s++; n long long int e = y / p; n return e - s + 1; n } n void solve() { n long long int n, p; n cin >> n >> p; n vector > A(n); n for (int i = 0; i < n; i++) cin >> A[i].first >> A[i].second; n double ans = 0; n for (int i = 0; i < n; i++) { n long long int f = i, s = (i + 1 + n) % n; n long long int s1 = A[f].second - A[f].first + 1, n s2 = A[s].second - A[s].first + 1; n long long int a = fun(A[f].first, A[f].second, p); n long long int b = fun(A[s].first, A[s].second, p); n double up = (s1 - a) * 1.0 * (s2 - b); n double d = s1 * 1.0 * s2 * 1.0; n up = (up * 1.0) / (d * 1.0); n double pro = 1.0 - 1.0 * up; n ans = ans * 1.0 + pro * 2000.0; n } n printf( %f n , ans); n } n int main() { n long long int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, q, sm, mx, x, y, ans; n char a[509][509]; n int rr[509]; n int main() { n scanf( %d%d%d , &n, &m, &q); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) scanf( %c , &a[i][j]); n for (int i = 1; i <= n; i++) { n sm = 0, mx = 0; n for (int j = 1; j <= m; j++) { n if (a[i][j] == 1 ) n sm++; n else n mx = max(mx, sm), sm = 0; n } n mx = max(mx, sm); n rr[i] = mx; n } n for (int i = 1; i <= q; i++) { n scanf( %d%d , &x, &y), sm = 0, ans = 0, mx = 0; n a[x][y] = char(( 1 - a[x][y]) + 0 ); n for (int j = 1; j <= m; j++) { n if (a[x][j] == 1 ) n sm++; n else n mx = max(mx, sm), sm = 0; n } n mx = max(mx, sm); n rr[x] = mx; n for (int j = 1; j <= n; j++) ans = max(ans, rr[j]); n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n const long long INF = 1000 * 1000 * 1000 + 47; n const long long LINF = INF * (long long)INF; n using namespace std; n const int mod = 1000 * 1000 * 1000 + 9; n const int MAX = 100005; n pair pts[MAX]; n int n, k; n struct node { n int x, y, l, r; n int dp0, dp1; n node() { l = r = -1; } n node(pair pt) { n l = r = -1; n x = pt.first, y = pt.second; n dp1 = 1; n dp0 = 0; n } n }; n node treap[MAX]; n int getDp0(int u) { n if (u == -1) return 0; n return treap[u].dp0; n } n int getDp1(int u) { n if (u == -1) return 0; n return treap[u].dp1; n } n void upd(int root) { n if (root == -1) return; n treap[root].dp1 = 1 + getDp0(treap[root].l) + getDp0(treap[root].r); n treap[root].dp0 = max(treap[root].dp1 - 1, n max(getDp0(treap[root].l) + getDp1(treap[root].r), n getDp1(treap[root].l) + getDp0(treap[root].r))); n } n int merge(int l, int r) { n if (l == -1) return r; n if (r == -1) return l; n int root; n if (treap[l].y > treap[r].y) { n root = l; n treap[l].r = merge(treap[l].r, r); n } else { n root = r; n treap[r].l = merge(l, treap[r].l); n } n upd(root); n return root; n } n pair split(int root, int x) { n if (root == -1) return {-1, -1}; n pair res; n if (treap[root].x <= x) { n res = split(treap[root].r, x); n treap[root].r = res.first; n res = {root, res.second}; n } else { n res = split(treap[root].l, x); n treap[root].l = res.second; n res = {res.first, root}; n } n upd(res.first); n upd(res.second); n return res; n } n int main() { n ios_base::sync_with_stdio(0); n int root = -1; n cin >> n >> k; n for (int i = 0; i < k; i++) { n cin >> pts[i].first >> pts[i].second; n } n int a, b, c, d; n cin >> a >> b >> c >> d; n for (int i = k; i < n; i++) { n pts[i].first = ((a * (long long)pts[i - 1].first) + b) % mod; n pts[i].second = ((c * (long long)pts[i - 1].second) + d) % mod; n } n sort(pts, pts + n); n for (int i = 0; i < n; i++) { n treap[i] = node(pts[i]); n root = merge(root, i); n } n int q; n cin >> q; n while (q--) { n int l, r; n cin >> l >> r; n auto roots = split(root, l - 1); n auto roots2 = split(roots.second, r); n cout << ((roots2.first == -1) ? 0 : treap[roots2.first].dp0) << endl; n root = merge(roots.first, merge(roots2.first, roots2.second)); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100000 + 10; n int main() { n long long n; n cin >> n; n if (n % 2 == 0) { n cout << 1ll * n / 2; n return 0; n } n bool flag = true; n for (int i = 3; i <= sqrt(n); i += 2) { n if (n % i == 0) { n cout << 1ll * (n - i) / 2 + 1; n return 0; n } n } n cout << 1 ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2005, maxm = 4000005; n const double pi = 3.141592653589793; n const int dx[] = {-1, -1, -1, 0, 1, 1, 1, 0}; n const int dy[] = {-1, 0, 1, 1, 1, 0, -1, -1}; n int s[maxn][maxn], v[maxn][maxn], f[maxn][maxn]; n int qx[maxm], qy[maxm]; n int n, cir, rec; n double dis(double x, double y) { return sqrt(x * x + y * y); } n int main() { n int i, j, k, a, b, x, y, h, t, tx, ty; n double sumx, sumy, maxd, mind; n scanf( %d , &n); n for (i = 1; i <= n; ++i) n for (j = 1; j <= n; ++j) { n scanf( %d , &x); n if (x == 0) continue; n for (a = -2; a <= 2; ++a) n for (b = -2; b <= 2; ++b) n if (i + a > 0 && i + a <= n && j + b > 0 && j + b <= n) n ++s[i + a][j + b]; n } n for (i = 1; i <= n; ++i) n for (j = 1; j <= n; ++j) { n s[i][j] = s[i][j] > 15 ? 1 : 0; n v[i][j] = s[i][j]; n } n for (i = 1; i <= n; ++i) n for (j = 1; j <= n; ++j) { n if (s[i][j] == 0) continue; n sumx = 0; n sumy = 0; n h = 1; n t = 1; n qx[h] = i; n qy[h] = j; n for (; h <= t; ++h) { n a = qx[h]; n b = qy[h]; n sumx += a; n sumy += b; n for (k = 0; k < 8; ++k) { n x = a + dx[k]; n y = b + dy[k]; n if (v[x][y] == 0) ++f[a][b]; n if (s[x][y] == 1) { n ++t; n qx[t] = x; n qy[t] = y; n s[x][y] = 0; n } n } n } n if (t < 125) continue; n tx = round(sumx / t); n ty = round(sumy / t); n maxd = 0; n for (k = 1; k <= t; ++k) maxd = max(maxd, dis(tx - qx[k], ty - qy[k])); n if (t < 2.5 * maxd * maxd) n ++rec; n else n ++cir; n } n printf( %d %d n , cir, rec); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N; n int A[20]; n void Work1() { printf( %d n%d n , A[0], A[0]); } n void Work2() { printf( %d n%d %d n%d %d n , A[0] * 2, A[0], A[0], A[0], A[0]); } n void Work3() { n int i, i00, i01, i02, i11, i21, i20, i22, i10, i12; n int sum = 0; n for (i = 0; i < 9; ++i) { n sum += A[i]; n } n sum /= 3; n for (i00 = 0; i00 < 9; ++i00) { n swap(A[0], A[i00]); n for (i01 = 1; i01 < 9; ++i01) { n swap(A[1], A[i01]); n for (i02 = 2; i02 < 9; ++i02) { n if (A[0] + A[1] + A[i02] != sum) continue; n swap(A[2], A[i02]); n for (i11 = 3; i11 < 9; ++i11) { n swap(A[3], A[i11]); n for (i21 = 4; i21 < 9; ++i21) { n if (A[1] + A[3] + A[i21] != sum) continue; n swap(A[4], A[i21]); n for (i20 = 5; i20 < 9; ++i20) { n if (A[2] + A[3] + A[i20] != sum) continue; n swap(A[5], A[i20]); n for (i22 = 6; i22 < 9; ++i22) { n if (A[0] + A[3] + A[i22] != sum) continue; n if (A[5] + A[4] + A[i22] != sum) continue; n swap(A[6], A[i22]); n for (i10 = 7; i10 < 9; ++i10) { n if (A[0] + A[i10] + A[5] != sum) continue; n swap(A[7], A[i10]); n for (i12 = 8; i12 < 9; ++i12) { n if (A[7] + A[3] + A[i12] != sum) continue; n if (A[2] + A[i12] + A[6] != sum) continue; n printf( %d n , sum); n printf( %d %d %d n , A[0], A[1], A[2]); n printf( %d %d %d n , A[7], A[3], A[8]); n printf( %d %d %d n , A[5], A[4], A[6]); n return; n } n swap(A[7], A[i10]); n break; n } n swap(A[6], A[i22]); n break; n } n swap(A[5], A[i20]); n break; n } n swap(A[4], A[i21]); n break; n } n swap(A[3], A[i11]); n } n swap(A[2], A[i02]); n break; n } n swap(A[1], A[i01]); n } n swap(A[0], A[i00]); n } n } n void Work4() { n int j, i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14, i15; n int sum = 0; n for (j = 0; j < 16; ++j) { n sum += A[j]; n } n sum /= 4; n for (i0 = 0; i0 < 16; ++i0) { n swap(A[0], A[i0]); n for (i1 = 1; i1 < 16; ++i1) { n swap(A[1], A[i1]); n for (i2 = 2; i2 < 16; ++i2) { n swap(A[2], A[i2]); n for (i3 = 3; i3 < 16; ++i3) { n if (A[0] + A[1] + A[2] + A[i3] != sum) continue; n swap(A[3], A[i3]); n for (i4 = 4; i4 < 16; ++i4) { n swap(A[4], A[i4]); n for (i5 = 5; i5 < 16; ++i5) { n swap(A[5], A[i5]); n for (i6 = 6; i6 < 16; ++i6) { n if (A[0] + A[4] + A[5] + A[i6] != sum) continue; n swap(A[6], A[i6]); n for (i7 = 7; i7 < 16; ++i7) { n swap(A[7], A[i7]); n for (i8 = 8; i8 < 16; ++i8) { n if (A[2] + A[7] + A[5] + A[i8] != sum) continue; n swap(A[8], A[i8]); n for (i9 = 9; i9 < 16; ++i9) { n swap(A[9], A[i9]); n for (i10 = 10; i10 < 16; ++i10) { n if (A[1] + A[4] + A[9] + A[i10] != sum) continue; n swap(A[10], A[i10]); n for (i11 = 11; i11 < 16; ++i11) { n if (A[3] + A[7] + A[9] + A[i11] != sum) continue; n swap(A[11], A[i11]); n for (i12 = 12; i12 < 16; ++i12) { n swap(A[12], A[i12]); n for (i13 = 13; i13 < 16; ++i13) { n if (A[0] + A[12] + A[i13] + A[11] != sum) n continue; n swap(A[13], A[i13]); n for (i14 = 14; i14 < 16; ++i14) { n if (A[12] + A[4] + A[7] + A[14] != sum) n continue; n swap(A[14], A[i14]); n for (i15 = 15; i15 < 16; ++i15) { n if (A[3] + A[14] + A[i15] + A[6] != sum) n continue; n if (A[13] + A[9] + A[5] + A[i15] != sum) n continue; n printf( %d n , sum); n printf( %d %d %d %d n , A[0], A[1], A[2], n A[3]); n printf( %d %d %d %d n , A[12], A[4], A[7], n A[14]); n printf( %d %d %d %d n , A[13], A[9], A[5], n A[15]); n printf( %d %d %d %d n , A[11], A[10], A[8], n A[6]); n return; n } n swap(A[14], A[i14]); n break; n } n swap(A[13], A[i13]); n break; n } n swap(A[12], A[i12]); n } n swap(A[11], A[i11]); n break; n } n swap(A[10], A[i10]); n break; n } n swap(A[9], A[i9]); n } n swap(A[8], A[i8]); n break; n } n swap(A[7], A[i7]); n } n swap(A[6], A[i6]); n break; n } n swap(A[5], A[i5]); n } n swap(A[4], A[i4]); n } n swap(A[3], A[i3]); n break; n } n swap(A[2], A[i2]); n } n swap(A[1], A[i1]); n } n swap(A[0], A[i0]); n } n } n int main() { n int i; n scanf( %d , &N); n for (i = 0; i < N * N; ++i) { n scanf( %d , &A[i]); n } n if (N == 1) n Work1(); n else if (N == 2) n Work2(); n else if (N == 3) n Work3(); n else if (N == 4) n Work4(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1000000; n int T, tot, prod, mn[1000010]; n bool solved[10000][11]; n bitset<1000> b[10000][11]; n vector V, prime; n unordered_map id; n int main() { n scanf( %d , &T); n for (int i = 2; i <= N; i++) n if (!mn[i]) { n if (prime.size() < 1000) prime.push_back(i); n for (int j = i; j <= N; j += i) mn[j] = i; n } n auto get = [&](long long x) { n V.clear(); n int lst = 50; n while (x > 1) { n int c = 0, t = x <= N ? mn[x] : 0; n if (!t) { n for (int i = lst; ~i; i--) { n if (!(x % prime[i])) { n t = prime[i], lst = i; n break; n } n } n } n while (!(x % t)) x /= t, c++; n V.push_back(c); n } n sort(V.begin(), V.end(), greater()); n int z = prod = 1; n for (int i = 0; i < V.size(); i++) { n prod *= V[i] + 1; n for (int j = 0; j < V[i]; j++) z *= prime[i]; n } n return z; n }; n for (int i = 1; i <= N; i++) { n if (i == get(i)) id[i] = ++tot; n } n function solve = [&](int x, int step) { n int y = get(x); n if (prod >= 1000) return; n if (!id.count(x)) id[x] = ++tot; n int $ = id[x]; n if (solved[$][step]) return; n solved[$][step] = 1; n if (!step) { n b[$][step][prod] = 1; n return; n } n vector V2 = V; n for (int i = 0; i < V2.size(); i++) { n int v = get(x / prime[i]); n solve(v, step - 1), b[$][step] |= b[id[v]][step - 1]; n v = get(1LL * x * prime[i]); n if (v <= N * 100) solve(v, step - 1), b[$][step] |= b[id[v]][step - 1]; n } n int v = get(1LL * x * prime[V2.size()]); n if (v <= N * 100) solve(v, step - 1), b[$][step] |= b[id[v]][step - 1]; n }; n for (int i = 1; i <= N; i++) n if (id[i]) { n for (int j = 0; j <= 10; j++) solve(i, j); n } n while (T--) { n int x, y, ans = INT_MAX; n scanf( %d %d , &x, &y); n x = get(x), y = get(y); n for (int i = 0; i <= 10; i++) { n for (int j = 0; j <= 10; j++) n if (i + j < ans) { n if ((b[id[x]][i] & b[id[y]][j]).any()) ans = min(ans, i + j); n } n } n assert(ans <= 10); n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[100005][2]; n int dp[100005][3]; n enum direction { n n, n l, n r, n }; n int main() { n int N; n cin >> N; n for (size_t i = 1; i <= N; i++) { n cin >> a[i][0] >> a[i][1]; n dp[i][n] = dp[i][l] = dp[i][r] = 0; n } n a[0][0] = -1e18; n a[0][1] = 0; n dp[0][l] = dp[0][r] = dp[0][n] = 0; n a[N + 1][0] = 1e18; n a[N + 1][1] = 0; n for (size_t i = 0; i <= N; i++) { n if (a[i + 1][0] - a[i][0] > a[i + 1][1] + a[i][1]) { n dp[i + 1][l] = 1 + max(max(dp[i][l], dp[i][r]), dp[i][n]); n dp[i + 1][n] = max(max(dp[i][l], dp[i][r]), dp[i][n]); n } else if (a[i + 1][0] - a[i][0] > a[i + 1][1]) { n dp[i + 1][l] = 1 + max(dp[i][l], dp[i][n]); n dp[i + 1][n] = max(dp[i][l], max(dp[i][n], dp[i][r])); n } n if (a[i + 2][0] - a[i + 1][0] > a[i + 2][1] + a[i + 1][1]) { n dp[i + 1][r] = 1 + max(max(dp[i][l], dp[i][r]), dp[i][n]); n dp[i + 1][n] = max(max(dp[i][l], dp[i][r]), dp[i][n]); n } else if (a[i + 2][0] - a[i + 1][0] > a[i + 1][1]) { n dp[i + 1][r] = 1 + max(dp[i][r], max(dp[i][n], dp[i][l])); n dp[i + 1][n] = max(max(dp[i][n], dp[i][r]), dp[i][l]); n } n if (!(a[i + 2][0] - a[i + 1][0] > a[i + 1][1]) && n !(a[i + 1][0] - a[i][0] > a[i + 1][1])) { n dp[i + 1][n] = max(max(dp[i][l], dp[i][r]), dp[i][n]); n } n } n cout << max(max(dp[N][1], dp[N][0]), dp[N][2]); n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n const long long inf = 0x3f3f3f3f; n const long long llinf = 1e18; n const long long nax = 0; n int n, m; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(); n cout.tie(); n cin >> n >> m; n vector a(n + 5), b(m + 5); n int maks1 = 0, mins1 = inf, mins2 = inf; n for (int i = 0; i < n; ++i) { n cin >> a[i]; n maks1 = max(maks1, a[i]); n mins1 = min(mins1, a[i]); n } n for (int i = 0; i < m; ++i) { n cin >> b[i]; n mins2 = min(mins2, b[i]); n } n if (max(mins1 * 2, maks1) < mins2) { n cout << max(mins1 * 2, maks1) << n ; n } else n cout << -1 << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int a[3]; n int main() { n cin >> a[0] >> a[1] >> a[2]; n sort(a + 0, a + 3); n int res = 0; n while ((a[0] + a[1]) <= a[2]) { n a[0]++; n res++; n } n cout << res; n } n "} +{"func_code_string": "#include n #include n using namespace std; n n #define ll long long n #define ld long double n n #define rep(i,a,b) for(ll i=a;i=b;i--) n n #define err() cout<< ================================== < n #define V vector n #define S set n #define VV vector n #define Vpll vector n #define VVpll vector n n #define endl n n n const ll logN = 20; n const ll N=100005; n const ll M = 1000000007; n const ll M2=998244353 ; n const ll INF = 1e12; n #define PI 3.14159265 n #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) n ll pow1(ll a,ll b){ n ll res=1; n while(b>0){ n if(b&1){ n res=(res*a)%M; n } n a=(a*a)%M; n b>>=1; n } n return res%M; n } n n mapmp; n V a; n ll n; n void recur(ll depth,ll ind1=0, ll ind2=n-1 ) n { n if(ind1>ind2)return; n ll mx_ind; n ll mx=LLONG_MIN; n rep(i,ind1,ind2+1) n { n if(a[i]>mx) n { n mx=a[i]; n mx_ind=i; n } n } n mp[mx_ind]=depth; n recur(depth+1,ind1,mx_ind-1); n recur(depth+1,mx_ind+1,ind2); n return; n } n n n int main() n { n fast; n n #ifndef ONLINE_JUDGE n freopen( ../input.txt , r , stdin); n freopen( ../output.txt , w , stdout); n #endif n n ll T=1; n cin>>T; n while(T--) n { n cin>>n; n a=V(n); n rep(i,0,n)cin>>a[i]; n recur(0); n for(auto it:mp) n cout< n using namespace std; n template n void _R(T &x) { n cin >> x; n } n void _R(int &x) { scanf( %d , &x); } n void _R(long long &x) { scanf( %lld , &x); } n void _R(double &x) { scanf( %lf , &x); } n void _R(char &x) { scanf( %c , &x); } n void _R(char *x) { scanf( %s , x); } n void R() {} n template n void R(T &head, U &...tail) { n _R(head); n R(tail...); n } n template n void _W(const T &x) { n cout << x; n } n void _W(const int &x) { printf( %d , x); } n void _W(const long long &x) { printf( %lld , x); } n void _W(const double &x) { printf( %.16f , x); } n void _W(const char &x) { putchar(x); } n void _W(const char *x) { printf( %s , x); } n template n void _W(const pair &x) { n _W(x.first); n putchar( ); n _W(x.second); n } n template n void _W(const vector &x) { n for (auto i = x.begin(); i != x.end(); _W(*i++)) n if (i != x.cbegin()) putchar( ); n } n void W() {} n template n void W(const T &head, const U &...tail) { n _W(head); n putchar(sizeof...(tail) ? : n ); n W(tail...); n } n int MOD = 1e9 + 7; n void ADD(long long &x, long long v) { n x = (x + v) % MOD; n if (x < 0) x += MOD; n } n const int SIZE = 1e6 + 10; n int cnt[101][26]; n char an[101]; n pair, pair> e[10000]; n int en; n void query(int l, int r) { n W( ? , l, r); n fflush(stdout); n int num = (r - l + 1); n memset((cnt), 0, sizeof((cnt))); n for (int i = (1); i <= (num * (num + 1) / 2); ++i) { n string s; n R(s); n if (((int)(s).size()) <= (num + 1) / 2) { n for (char c : s) { n cnt[((int)(s).size())][c - a ]++; n } n } n } n int m = (num + 1) / 2; n for (int i = m - 1; i >= 1; i--) { n for (int j = 0; j < (26); ++j) cnt[i + 1][j] -= cnt[i][j]; n } n for (int i = 1; i < m; i++) { n for (int j = 0; j < (26); ++j) cnt[i][j] -= cnt[i + 1][j]; n } n string ret; n for (int i = (1); i <= (m); ++i) { n for (int j = 0; j < (26); ++j) { n if (cnt[i][j]) { n cnt[i][j]--; n ret += a + j; n break; n } n } n } n for (int i = m; i >= 1; i--) { n for (int j = 0; j < (26); ++j) { n if (cnt[i][j]) { n cnt[i][j]--; n ret += a + j; n break; n } n } n } n int ll = 0, rr = num - 1; n while (ll <= rr) { n if (ll == rr) { n an[l] = ret[ll]; n } else { n e[en++] = make_pair(make_pair(l, r), make_pair(ret[ll], ret[rr])); n } n ll++; n rr--; n l++; n r--; n } n } n int main() { n int n; n R(n); n if (n == 1) { n query(1, 1); n } else if (n % 2 == 0) { n query(1, n - 1); n query(n / 2, n - 1); n query(n / 2, n); n } else { n query(1, n); n query(1, n / 2); n query(1, n / 2 + 1); n } n for (int i = 0; i < (1000); ++i) { n for (int j = 0; j < (en); ++j) { n if (an[e[j].first.first]) { n an[e[j].first.second] = (int)e[j].second.second + n (int)e[j].second.first - an[e[j].first.first]; n } n if (an[e[j].first.second]) { n an[e[j].first.first] = (int)e[j].second.second + n (int)e[j].second.first - an[e[j].first.second]; n } n } n } n W( ! , string(an + 1)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void MACRO_VAR_Scan(T& t) { n cin >> t; n } n template n void MACRO_VAR_Scan(First& first, Rest&... rest) { n cin >> first; n MACRO_VAR_Scan(rest...); n } n template n void MACRO_VEC_ROW_Init(int n, T& t) { n t.resize(n); n } n template n void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) { n first.resize(n); n MACRO_VEC_ROW_Init(n, rest...); n } n template n void MACRO_VEC_ROW_Scan(int p, T& t) { n cin >> t[p]; n } n template n void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) { n cin >> first[p]; n MACRO_VEC_ROW_Scan(p, rest...); n } n void _main(); n signed main() { n cin.tie(0); n ios::sync_with_stdio(false); n _main(); n } n inline long long toInt(std::string s) { n long long v; n std::istringstream sin(s); n sin >> v; n return v; n } n template n inline string toString(T x) { n ostringstream sout; n sout << x; n return sout.str(); n } n template n inline T sqr(T x) { n return x * x; n } n template n inline void chmin(A& a, B b) { n if (a > b) a = b; n } n template n inline void chmax(A& a, B b) { n if (a < b) a = b; n } n long long qp(long long a, long long b) { n long long ans = 1ll; n do { n if (b & 1) ans = 1ll * ans * a; n a = 1ll * a * a; n } while (b >>= 1); n return ans; n } n long long qpmod(long long a, long long b, long long mo) { n long long ans = 1ll; n do { n if (b & 1) ans = 1ll * ans * a % mo; n a = 1ll * a * a % mo; n } while (b >>= 1); n return ans; n } n inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } n inline bool valid(int x, int h) { return 0 <= x && x < h; } n const double EPS = 1e-8; n const double PI = acos(-1.0); n const int INF = (int)(1e9) + 7; n const long long MOD = (long long)(1e9) + 7; n const long long MOD2 = (long long)(1e18) + 9; n const long long INF2 = (long long)(1e18); n const long long INTMAX = (0x7FFFFFFFL); n const long long LLMAX = (0x7FFFFFFFFFFFFFFFL); n const int N4 = (int)1e4 + 10; n const int N5 = (int)1e5 + 10; n const int N9 = (int)1e9; n int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; n int dy[8] = {0, 1, 0, -1, -1, -1, 1, 1}; n struct uf_tree { n std::vector parent; n int __size; n uf_tree(int size_) : parent(size_, -1), __size(size_) {} n void unite(int x, int y) { n if ((x = find(x)) != (y = find(y))) { n if (parent[y] < parent[x]) std::swap(x, y); n parent[x] += parent[y]; n parent[y] = x; n __size--; n } n } n bool is_same(int x, int y) { return find(x) == find(y); } n int find(int x) { return parent[x] < 0 ? x : parent[x] = find(parent[x]); } n int size(int x) { return -parent[find(x)]; } n int size() { return __size; } n }; n long long digitsum(long long x) { n long long dig; n long long summ = 0; n while (x) { n dig = x % 10; n summ = summ + dig; n x = x / 10; n } n return summ; n } n long long ret, cnt, cur, ans, f; n void an(long long x, long long y) { cout << x << << y << endl; } n void _main() { n long long n, m, k; n MACRO_VAR_Scan(n, m, k); n ; n if (k < n) { n an(k + 1, 1); n return; n } n long long ok = 0, ng = n / 2; n while (ng - ok > 1) { n long long mi = (ng + ok) / 2; n if (n + mi * 2 * (m - 1) <= k) n ok = mi; n else n ng = mi; n } n k -= n - 1 + ok * 2 * (m - 1); n int x = n - ok * 2, y = 2; n if (k <= m - 1) { n an(x, k + 1); n return; n } else { n an(x - 1, m - (k - (m - 1)) + 1); n return; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int MX = 300300; n int t, n, m, i, k[MX], c[MX]; n long long r; n int main() { n cin >> t; n while (t--) { n int n, x, sum = 0, ctr = 0; n cin >> n >> x; n int arr[n]; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n sum += arr[i]; n ctr += (arr[i] == x); n } n if (ctr == n) n cout << 0 << n ; n else if (ctr >= 1 || sum == n * x) n cout << 1 << n ; n else n cout << 2 << n ; n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int a, b; n scanf( %d%d , &a, &b); n int c = 0; n while (b) { n c *= 10; n c += b % 10; n b /= 10; n } n printf( %d n , c + a); n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int x = 0, fu = 0; n char ch = getchar(); n for (; ch < 48 || ch > 57; ch = getchar()) fu |= (ch == - ); n for (; ch > 47 && ch < 58; ch = getchar()) x = x * 10 + ch - 0 ; n return fu ? -x : x; n } n int n, mx = -1000000000, mn = 1000000000, ans = 1, tmp, no; n set s; n char S[20]; n int main() { n for (n = read(), s.insert(mx), s.insert(mn); n--;) { n scanf( %s , S), tmp = read(); n if (S[1] == D ) n s.insert(tmp), no += (tmp > mx && tmp < mn); n else { n if (tmp < mx || tmp > mn) return puts( 0 ), 0; n ans = (tmp > mx && tmp < mn) ? (ans << 1) % 1000000007 : ans; n s.erase(tmp), no = 0; n set::iterator it = s.lower_bound(tmp); n mn = *it, --it, mx = *it; n } n } n printf( %d n , (int)(1LL * ans * (no + 1) % 1000000007)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n char a[111][111]; n for (long long i = 1; i <= 3; i++) n for (long long j = 1; j <= 3; j++) cin >> a[i][j]; n if (a[1][1] == a[3][3] && a[3][2] == a[1][2] && a[3][1] == a[1][3] && n a[2][3] == a[2][1]) n cout << YES ; n else n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int tree[500000]; n int a[100000], pos[100001]; n void update(int node, int l, int r, int pos, int u) { n if (l == r) { n tree[node] += u; n return; n } n int mid = (l + r) / 2; n if (pos <= mid) n update(2 * node, l, mid, pos, u); n else n update(2 * node + 1, mid + 1, r, pos, u); n tree[node] = tree[2 * node] + tree[2 * node + 1]; n } n int query(int node, int l, int r, int ql, int qr) { n if (ql > r || qr < l) return 0; n if (ql <= l && qr >= r) return tree[node]; n int mid = (l + r) / 2; n return query(2 * node, l, mid, ql, qr) + n query(2 * node + 1, mid + 1, r, ql, qr); n } n int main() { n int i, j, k; n int n, res = 0; n scanf( %d , &n); n for (i = 0; i < n; i++) scanf( %d , &a[i]); n for (i = 0; i < n; i++) { n scanf( %d , &j); n pos[j] = i; n } n for (i = 0; i < n; i++) { n if (query(1, 0, n, pos[a[i]] + 1, n)) res++; n update(1, 0, n, pos[a[i]], 1); n } n printf( %d , res); n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int ans; n int a[400050]; n int back[400050]; n vector edge[400050]; n int main() { n ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); n cin >> n >> m; n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int i = 1, u, v; i <= m; i++) { n cin >> u >> v; n edge[v].push_back(u); n } n for (auto iter : edge[a[n]]) back[iter]++; n for (int i = n - 1; i >= 1; i--) { n if (back[a[i]] == n - i - ans) n ans++; n else { n for (auto iter : edge[a[i]]) back[iter]++; n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n pair p; n void sort() { n int temp = 0; n if (p.first < p.second) { n temp = p.first; n p.first = p.second; n p.second = temp; n } n } n int main() { n int n; n cin >> n; n for (int i = 0; i < n; i++) { n int op = 0; n cin >> p.first >> p.second; n if (p.first == p.second) n op = 1; n else { n if (p.first % p.second == 0) n op = p.first / p.second; n else { n while (p.first % p.second != 0) { n sort(); n op += p.first / p.second; n p.first = p.first % p.second; n } n } n } n cout << op << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, a, b, finish1 = INFINITY, finish2 = INFINITY, start1 = 0, n start2 = 0, mx = 0; n scanf( %lld , &n); n for (int i = 1; i <= n; i++) { n scanf( %lld %lld , &a, &b); n start2 = max(start2, a); n finish1 = min(finish1, b); n } n scanf( %lld , &n); n for (int i = 1; i <= n; i++) { n scanf( %lld %lld , &a, &b); n start1 = max(start1, a); n finish2 = min(finish2, b); n } n mx = max(mx, start1 - finish1); n mx = max(mx, start2 - finish2); n if (mx <= 0) n printf( 0 n ); n else n printf( %lld n , mx); n return 0; n } n "} +{"func_code_string": "#include n int x[100001] = {0}; n int main() { n int i, n; n scanf( %d , &n); n for (int i = 1; i <= n; ++i) { n scanf( %d , &x[i]); n } n int sum = 0; n int cn = 0; n for (i = 0; i < n; i++) { n sum = sum + x[i] - x[i + 1]; n if (sum < 0) { n do { n cn++; n sum++; n } while (sum < 0); n } n } n printf( %d , cn); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n, m; n scanf( %d%d , &n, &m); n int a[n], b[m], i, j; n for (i = 0; i < n; i++) scanf( %d , &a[i]); n for (i = 0; i < m; i++) scanf( %d , &b[i]); n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n if (b[j] == a[i]) printf( %d , a[i]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const ll mod = 1e9 + 7; n const int maxn = 1e5 + 5, maxa = 71, lim = 1 << 19; n ll ev[maxn], od[maxn], dp[2][lim]; n int n, a, f[lim], comp[maxa]; n vector p; n int calc_msk(int x) { n int msk = 0, b = 1; n for (int y : p) { n while (x % (y * y) == 0) x /= y * y; n msk = (x % y == 0) * b + msk; n b *= 2; n } n return msk; n } n int main() { n ios_base::sync_with_stdio(0); n for (int i = (2); i < (maxa); i++) n for (int j = i + i; j < maxa; j += i) comp[j] = 1; n for (int i = (2); i < (maxa); i++) n if (!comp[i]) p.push_back(i); n ev[0] = ev[1] = 1; n for (int i = (2); i < (maxn); i++) ev[i] = ev[i - 1] * 2 % mod; n od[0] = 0; n od[1] = 1; n for (int i = (2); i < (maxn); i++) od[i] = od[i - 1] * 2 % mod; n cin >> n; n for (int i = (0); i < (n); i++) { n cin >> a; n f[calc_msk(a)]++; n } n dp[0][0] = 1; n for (int i = (1); i < (maxa); i++) { n int x = calc_msk(i); n for (int msk = (0); msk < (lim); msk++) n dp[i & 1][msk] = n (dp[i & 1 ^ 1][msk] * ev[f[x]] + dp[i & 1 ^ 1][msk ^ x] * od[f[x]]) % n mod; n f[x] = 0; n } n cout << (dp[maxa & 1 ^ 1][0] + mod - 1) % mod << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 100000 + 10; n int leaf[M]; n vector adj[M]; n int childnum[M]; n void dfs(int cur, int par) { n for (int i = 0; i < adj[cur].size(); i++) { n int nxt = adj[cur][i]; n if (nxt != par) { n childnum[cur]++; n dfs(nxt, cur); n } n } n } n bool ok = true; n long long int coef[M]; n long long int thres = 1e16 + 10; n void dfs1(int cur, int par) { n coef[cur] = childnum[par] * coef[par]; n if (coef[cur] > thres) { n ok = false; n return; n } n for (int i = 0; i < adj[cur].size(); i++) { n int nxt = adj[cur][i]; n if (nxt != par) { n dfs1(nxt, cur); n } n } n } n vector leafnode; n long long int gcd(long long int x, long long int y) { n return y == 0 ? x : gcd(y, x % y); n } n int main() { n int n; n cin >> n; n long long int s = 0; n for (int i = 1; i <= n; i++) { n cin >> leaf[i]; n s = s + leaf[i]; n } n for (int i = 0; i < n - 1; i++) { n int u, v; n cin >> u >> v; n adj[u].push_back(v); n adj[v].push_back(u); n } n for (int i = 2; i <= n; i++) { n if (adj[i].size() == 1) { n leafnode.push_back(i); n } n } n dfs(1, 0); n coef[0] = 1; n childnum[0] = 1; n dfs1(1, 0); n long long int minv = -1; n for (int i = 0; i < leafnode.size(); i++) { n int curleaf = leafnode[i]; n long long int x = leaf[curleaf]; n long long int k = coef[curleaf]; n long long int v = k * x; n if (minv == -1) { n minv = v; n } else { n minv = min(minv, v); n } n } n if (!ok) { n cout << s << endl; n } else { n long long int lcm = 1; n for (int i = 0; i < leafnode.size(); i++) { n int curleaf = leafnode[i]; n long long int k = coef[curleaf]; n long long int d = gcd(lcm, k); n lcm = lcm * k / d; n if (lcm > minv) { n ok = false; n break; n } n } n if (!ok) { n cout << s << endl; n } else { n lcm = minv / lcm * lcm; n long long int ans = 0; n for (int i = 0; i < leafnode.size(); i++) { n int curleaf = leafnode[i]; n long long int k = coef[curleaf]; n long long int x = lcm / k; n long long int val = leaf[curleaf] - x; n ans = ans + val; n } n cout << ans << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int m, n; n cin >> m >> n; n cout << ((m % 2) ? m * (n / 2) + (n % 2) * (m / 2) n : n * (m / 2) + (m % 2) * (n / 2)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n long long a[300000]; n int main() { n while (cin >> n) { n for (int i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n long long ans = 0; n for (int i = 0; i < n; i++) { n int x = (i == n - 1 ? -1 : 0); n ans += (x + i + 2) * a[i]; n } n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool check(const string &str) { n vector vec{ ABSINTH , BEER , BRANDY , CHAMPAGNE , GIN , RUM , n SAKE , TEQUILA , VODKA , WHISKEY , WINE }; n for (int i = 0; i < (int)vec.size(); ++i) { n if (str == vec[i]) return true; n } n return false; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int n; n cin >> n; n int cnt = 0; n for (int i = 0; i < n; ++i) { n string str; n cin >> str; n if (isdigit(str[0])) { n int num = stoi(str); n if (num < 18) ++cnt; n } else { n if (check(str)) ++cnt; n } n } n cout << cnt << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n, m; n cin >> n >> m; n vector > a(n), b(m); n for (int i = 0; i < n; i++) { n a[i].resize(m); n for (int j = 0; j < m; j++) cin >> a[i][j]; n } n for (int j = 0; j < m; j++) { n b[j].resize(n); n for (int i = 0; i < n; i++) cin >> b[j][i]; n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (a[i][0] == b[j][0]) { n swap(a[0], a[i]); n swap(b[0], b[j]); n break; n } n } n } n for (int j = 0; j < n; j++) { n for (int i = 0; i < n; i++) { n if (a[i][0] == b[0][j]) { n for (auto x : a[i]) cout << x << ; n cout << n ; n break; n } n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int yy[100005], id; n int n, m; n int st[100005 * 4], lz[100005 * 4]; n int a[100005]; n int l[305], r[305]; n inline void pu(int rt) { st[rt] = max(st[2 * rt + 1], st[2 * rt + 2]); } n void pd(int rt, int l, int r, int m) { n if (lz[rt]) { n int t = lz[rt]; n lz[2 * rt + 1] += t; n lz[2 * rt + 2] += t; n st[2 * rt + 1] += t; n st[2 * rt + 2] += t; n lz[rt] = 0; n } n } n void build(int rt, int l, int r) { n lz[rt] = 0; n if (l == r) { n st[rt] = a[l]; n return; n } n int mid = (l + r) / 2; n build(2 * rt + 1, l, mid); n build(2 * rt + 2, mid + 1, r); n pu(rt); n } n void ud(int rt, int l, int r, int ul, int ur, int dt) { n if (l > ur || r < ul) return; n if (ul <= l && r <= ur) { n lz[rt] += dt; n st[rt] += dt; n return; n } n int mid = (l + r) / 2; n pd(rt, l, r, mid); n ud(2 * rt + 1, l, mid, ul, ur, dt), ud(2 * rt + 2, mid + 1, r, ul, ur, dt); n pu(rt); n } n int query(int rt, int l, int r, int ql, int qr) { n if (l > qr || r < ql) return -(0x3f3f3f3f); n if (ql <= l && r <= qr) return st[rt]; n int mid = (l + r) / 2; n pd(rt, l, r, mid); n return max(query(2 * rt + 1, l, mid, ql, qr), n query(2 * rt + 2, mid + 1, r, ql, qr)); n } n void init() {} n int main() { n cin >> n >> m; n int ans = -(0x3f3f3f3f), p = -1; n int mmx = -(0x3f3f3f3f), mmn = (0x3f3f3f3f); n for (int i = (1); i <= (n); i++) { n scanf( %d , a + i); n mmx = max(a[i], mmx), mmn = min(a[i], mmn); n } n if (m == 0) { n printf( %d n0 , mmx - mmn); n return 0; n } n for (int i = (0); i < (m); i++) scanf( %d%d , l + i, r + i); n build(0, 1, n); n for (int i = (1); i <= (n); i++) { n for (int j = (0); j < (m); j++) { n if (l[j] == i) { n ud(0, 1, n, l[j], r[j], -1); n } else if (i - 1 == r[j]) { n ud(0, 1, n, l[j], r[j], 1); n } n } n int mx = query(0, 1, n, 1, n); n int nowmin = query(0, 1, n, i, i); n if (mx - nowmin > ans) { n ans = mx - nowmin; n p = i; n } n } n for (int i = (0); i < (m); i++) { n if (p >= l[i] && p <= r[i]) { n yy[id++] = i + 1; n } n } n printf( %d n%d n , ans, id); n for (int i = (0); i < (id); i++) printf( %d , yy[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 10; n const int INF = 2147000000; n int n, k; n int a[maxn][maxn]; n int b[maxn], vis[maxn]; n int ans = INF; n int make(int num) { n int res = 0; n for (int i = 1; i <= k; i++) { n int c = b[i]; n res = res * 10 + a[num][c]; n } n return res; n } n void solve() { n int Max = -INF, Min = INF; n for (int i = 1; i <= n; i++) { n int res = make(i); n Max = max(Max, res); n Min = min(Min, res); n } n ans = min(ans, Max - Min); n } n void dfs(int cur) { n if (cur == k + 1) { n solve(); n return; n } n for (int i = 1; i <= k; i++) { n if (!vis[i]) { n vis[i] = 1; n b[cur] = i; n dfs(cur + 1); n vis[i] = 0; n } n } n } n int main() { n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= k; j++) { n char c; n scanf( %c , &c); n a[i][j] = c - 0 ; n } n } n memset(vis, 0, sizeof(vis)); n dfs(1); n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int m, n, arr[2000][2000], temp[2000][2000]; n char ctrl(int i) { n for (int j = 1; j <= n; j++) n if (arr[i][j] and arr[i][j] != temp[i][j]) return 0; n return 1; n } n char solve(int a, int b, int c, int d, int ttt = 0) { n if (ttt) ttt = 3; n for (int i = 1; i <= m; i++) { n if (i & 1) { n for (int j = 1; j <= n; j++) n if (j & 1) n temp[i][j] = a; n else n temp[i][j] = b; n if (ctrl(i)) continue; n for (int j = 1; j <= n; j++) n if (j & 1) n temp[i][j] = b; n else n temp[i][j] = a; n if (ctrl(i)) continue; n return 0; n } else { n for (int j = 1; j <= n; j++) n if (j & 1) n temp[i][j] = c; n else n temp[i][j] = d; n if (ctrl(i)) continue; n for (int j = 1; j <= n; j++) n if (j & 1) n temp[i][j] = d; n else n temp[i][j] = c; n if (ctrl(i)) continue; n return 0; n } n } n while (ttt--) { n for (int i = 1; i <= m; i++) n for (int j = 1; j <= n; j++) arr[j][m - i + 1] = temp[i][j]; n swap(m, n); n for (int i = 1; i <= m; i++) n for (int j = 1; j <= n; j++) temp[i][j] = arr[i][j]; n } n for (int i = 1; i <= m; i++) { n for (int j = 1; j <= n; j++) cout << temp[i][j]; n cout << endl; n } n return 1; n } n int main() { n ios_base::sync_with_stdio(false); n cin >> m >> n; n char c; n for (int i = 1; i <= m; i++) n for (int j = 1; j <= n; j++) { n cin >> c; n arr[i][j] = c - 0 ; n } n if (solve(1, 2, 3, 4)) return 0; n if (solve(1, 3, 2, 4)) return 0; n if (solve(1, 4, 2, 3)) return 0; n if (solve(2, 3, 1, 4)) return 0; n if (solve(2, 4, 1, 3)) return 0; n if (solve(3, 4, 1, 2)) return 0; n for (int i = 1; i <= m; i++) n for (int j = 1; j <= n; j++) temp[j][m - i + 1] = arr[i][j]; n swap(m, n); n for (int i = 1; i <= m; i++) n for (int j = 1; j <= n; j++) arr[i][j] = temp[i][j]; n if (solve(1, 2, 3, 4, 1)) return 0; n if (solve(1, 3, 2, 4, 1)) return 0; n if (solve(1, 4, 2, 3, 1)) return 0; n if (solve(2, 3, 1, 4, 1)) return 0; n if (solve(2, 4, 1, 3, 1)) return 0; n if (solve(3, 4, 1, 2, 1)) return 0; n cout << 0 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n struct Data { n int r, c, v; n bool operator<(const Data &r) const { return v < r.v; } n }; n vector > mat, ans; n Data sorteds[1001000]; n int mR[1001000], mC[1001000]; n map, vector > mr, mc; n void recursiveFix(int rr, int cc) { n vector &vv = mr[pair(rr, mat[rr][cc])]; n vector t = vv; n for (int j = int(0); j < int(vv.size()); j++) { n ans[rr][vv[j]] = ans[rr][cc]; n } n vv.clear(); n vector &vv2 = mc[pair(cc, mat[rr][cc])]; n vector t2 = vv2; n for (int j = int(0); j < int(vv2.size()); j++) { n ans[vv2[j]][cc] = ans[rr][cc]; n } n vv2.clear(); n for (int j = int(0); j < int(t2.size()); j++) recursiveFix(t2[j], cc); n for (int j = int(0); j < int(t.size()); j++) recursiveFix(rr, t[j]); n } n int main() { n int N, M; n while (scanf( %d %d , &N, &M) != EOF) { n int c = 0; n vector t(M + 1); n mr.clear(), mc.clear(); n mat.clear(); n ans.clear(); n mat.push_back(t); n ans.push_back(t); n for (int i = int(1); i < int(N + 1); i++) { n mat.push_back(t); n ans.push_back(t); n for (int j = int(1); j < int(M + 1); j++) { n scanf( %d , &mat[i][j]); n sorteds[c++] = Data{i, j, mat[i][j]}; n ans[i][j] = 1; n mr[pair(i, mat[i][j])].push_back(j); n mc[pair(j, mat[i][j])].push_back(i); n } n } n sort(sorteds, sorteds + c); n memset(mR, 0, sizeof(mR)); n memset(mC, 0, sizeof(mC)); n int prev = -1; n priority_queue q; n for (int i = int(0); i < int(c); i++) { n if (prev != sorteds[i].v) { n while (!q.empty()) { n int rr = q.top().r, cc = q.top().c; n recursiveFix(rr, cc); n q.pop(); n } n } n int r = sorteds[i].r, c = sorteds[i].c; n ans[r][c] = 0; n if (mat[r][mR[r]] == mat[r][c]) n ans[r][c] = max(ans[r][c], ans[r][mR[r]]); n else n ans[r][c] = max(ans[r][c], ans[r][mR[r]] + 1); n if (mat[mC[c]][c] == mat[r][c]) n ans[r][c] = max(ans[r][c], ans[mC[c]][c]); n else n ans[r][c] = max(ans[r][c], ans[mC[c]][c] + 1); n q.push(Data{r, c, ans[r][c]}); n mR[r] = c; n mC[c] = r; n prev = sorteds[i].v; n } n while (!q.empty()) { n int rr = q.top().r, cc = q.top().c; n recursiveFix(rr, cc); n q.pop(); n } n for (int i = int(0); i < int(N); i++) { n for (int j = int(0); j < int(M); j++) n printf( %d%c , ans[i + 1][j + 1], n [j == M - 1]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct EDGE { n EDGE(int _v, int _cap, int _edgeidx) : v(_v), cap(_cap), edgeidx(_edgeidx) {} n int v; n int cap; n int edgeidx; n }; n int DEBUG = 0; n const int MAXN = 200001; n vector edge[MAXN]; n int in[MAXN], total[MAXN], dir[MAXN]; n int mark[MAXN]; n int main(int argc, char **argv) { n DEBUG = (argc >= 2) ? atoi(argv[1]) : 0; n int n, m; n cin >> n >> m; n memset(total, 0, sizeof(total)); n memset(in, 0, sizeof(in)); n memset(mark, 0, sizeof(mark)); n for (int i = 1; i <= m; i++) { n int a, b, c; n cin >> a >> b >> c; n edge[a].push_back(EDGE(b, c, i)); n edge[b].push_back(EDGE(a, c, -i)); n total[a] += c; n total[b] += c; n } n if (DEBUG) { n for (int i = 1; i <= m; i++) { n printf( total[%d]= %d , i, total[i]); n } n printf( n ); n } n queue que; n mark[1] = 1; n que.push(1); n while (!que.empty()) { n int u = que.front(); n que.pop(); n mark[u] = 1; n if (DEBUG) { n printf( nu= %d n , u); n } n for (int i = 0; i < edge[u].size(); i++) { n int edgeidx = edge[u][i].edgeidx; n int v = edge[u][i].v; n int cap = edge[u][i].cap; n if (DEBUG) { n printf( u= %d, v= %d, edgeidx= %d, cap= %d, mark[%d]= %d n , u, v, n edgeidx, cap, v, mark[v]); n } n if (mark[v] == 0) { n in[v] += cap; n if (total[v] == 2 * in[v] && v != n) { n if (DEBUG) { n printf( que.push(%d) n , v); n } n que.push(v); n } n dir[abs(edgeidx)] = ((edgeidx < 0) ? 1 : 0); n } n } n if (DEBUG) { n printf( que.size()= %d n , que.size()); n } n } n for (int i = 1; i <= m; i++) { n cout << dir[i] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1.0e-8; n const int maxn = 1e6 + 10; n const int maxm = 300; n const int turn[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; n long long mod = 1e9 + 7; n vector tree[10005]; n int ans[10005]; n int anser = 0; n void dfs(int x, int pre, int c) { n int cur = c; n if (c != ans[x]) { n anser++, cur = ans[x]; n } n int len = tree[x].size(); n for (int i = 0; i < len; i++) { n int to = tree[x][i]; n if (to == pre) { n continue; n } n dfs(to, x, cur); n } n } n int main() { n int n; n int now; n cin >> n; n for (int i = 2; i <= n; i++) { n cin >> now; n tree[now].push_back(i); n tree[i].push_back(now); n } n for (int i = 1; i <= n; i++) { n cin >> ans[i]; n } n dfs(1, 0, 0); n cout << anser << endl; n } n "} +{"func_code_string": "#include n clock_t t = clock(); n namespace my_std { n using namespace std; n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n template n inline T rnd(T l, T r) { n return uniform_int_distribution(l, r)(rng); n } n template n inline bool chkmax(T &x, T y) { n return x < y ? x = y, 1 : 0; n } n template n inline bool chkmin(T &x, T y) { n return x > y ? x = y, 1 : 0; n } n template n inline void read(T &t) { n t = 0; n char f = 0, ch = getchar(); n double d = 0.1; n while (ch > 9 || ch < 0 ) f |= (ch == - ), ch = getchar(); n while (ch <= 9 && ch >= 0 ) t = t * 10 + ch - 48, ch = getchar(); n if (ch == . ) { n ch = getchar(); n while (ch <= 9 && ch >= 0 ) t += d * (ch ^ 48), d *= 0.1, ch = getchar(); n } n t = (f ? -t : t); n } n template n inline void read(T &t, Args &...args) { n read(t); n read(args...); n } n char __sr[1 << 21], __z[20]; n int __C = -1, __zz = 0; n inline void Ot() { fwrite(__sr, 1, __C + 1, stdout), __C = -1; } n inline void print(register int x) { n if (__C > 1 << 20) Ot(); n if (x < 0) __sr[++__C] = - , x = -x; n while (__z[++__zz] = x % 10 + 48, x /= 10) n ; n while (__sr[++__C] = __z[__zz], --__zz) n ; n __sr[++__C] = n ; n } n void file() {} n inline void chktime() {} n long long ksm(long long x, int y) { n long long ret = 1; n for (; y; y >>= 1, x = x * x) n if (y & 1) ret = ret * x; n return ret; n } n } // namespace my_std n using namespace my_std; n int n; n int a[505050]; n namespace BIT { n int tr[505050]; n void add(int x, int w) { n ++x; n x = n - x + 2; n while (x <= n + 1) chkmax(tr[x], w), x += x & -x; n } n int query(int x) { n ++x; n x = n - x + 2; n int res = -1e9; n while (x) chkmax(res, tr[x]), x -= x & -x; n return res; n } n void clear() { n for (int i = (1); i <= (n + 1); i++) tr[i] = -1e9; n } n } // namespace BIT n struct hh { n int k; n long long b; n int l, r; n const int q(long long x) const { n x = x * k + b; n return max(1ll * l, min(x, 1ll * r)); n } n const hh operator+(const hh &x) const { n hh res; n res.k = k * x.k, res.b = b * x.k + x.b; n long long L = x.q(l), R = x.q(r); n if (L > R) swap(L, R); n res.l = L, res.r = R; n return res; n } n }; n struct hhh { n hh a, b; n int tp; n const hhh operator+(const hhh &x) { n return tp ? (hhh){a + x.b, b + x.a, x.tp ^ 1} n : (hhh){a + x.a, b + x.b, x.tp}; n } n pair q(long long l, long long r) { n return tp ? make_pair(b.q(r), a.q(l)) : make_pair(a.q(l), b.q(r)); n } n }; n hhh tr[505050 << 2]; n void pushup(int k) { tr[k] = tr[k << 1 | 1] + tr[k << 1]; } n void build(int k, int l, int r) { n if (l == r) n return tr[k] = n (hhh){(hh){-1, a[l], 0, a[l] - 1}, (hh){-1, a[l], 1, a[l]}, 1}, n void(); n int mid = (l + r) >> 1; n build(k << 1, l, mid), build(k << 1 | 1, mid + 1, r), pushup(k); n } n int query(int k, int l, int r, int x, long long &L, long long &R) { n if (r <= x) { n pair xx = tr[k].q(L, R); n if (xx.first <= xx.second) return tie(L, R) = xx, l; n if (l == r) return L = R = -1, l + 1; n int mid = (l + r) >> 1; n int res = query(k << 1 | 1, mid + 1, r, x, L, R); n return L == -1 ? res : query(k << 1, l, mid, x, L, R); n } n int mid = (l + r) >> 1; n if (x <= mid) return query(k << 1, l, mid, x, L, R); n int res = query(k << 1 | 1, mid + 1, r, x, L, R); n return L == -1 ? res : query(k << 1, l, mid, x, L, R); n } n int qL(int x, long long l, long long r) { return query(1, 1, n, x, l, r); } n int dp[505050]; n namespace Q2 { n long long dB; n int tp; n map w; n multiset s; n void clear() { n dB = 0, tp = 1; n w.clear(), s.clear(); n } n void insert(long long B, int W) { n B = (B - dB) * tp; n if (w.find(B) == w.end()) n w[B] = W, s.insert(W); n else if (w[B] < W) n s.erase(s.find(w[B])), s.insert(W), w[B] = W; n } n void maintain(long long a) { n tp *= -1, dB = a - dB; n for (auto it = w.begin(); it != w.end();) { n long long b = it->first * tp + dB; n if (b < 1 || b >= a) n s.erase(s.find(it->second)), w.erase(it++); n else n break; n } n int c = 0; n for (auto it = w.rbegin(); it != w.rend();) { n long long b = it->first * tp + dB; n if (b < 1 || b >= a) n s.erase(s.find(it->second)), it++, c++; n else n break; n } n while (c--) w.erase(prev(w.end())); n } n void add(long long B) { n B = (B - dB) * tp; n auto it = w.find(B); n if (it == w.end()) return; n s.erase(s.find(it->second)), s.insert(it->second + 1); n ++w[B]; n } n int mx() { return s.size() ? *(s.rbegin()) : -1e9; } n } // namespace Q2 n void work() { n read(n); n for (int i = (1); i <= (n); i++) read(a[i]); n BIT::clear(); n Q2::clear(); n BIT::add(0, 0); n build(1, 1, n); n for (int i = (1); i <= (n); i++) { n int p = qL(i, 1, a[i] - 1); n dp[i] = BIT::query(p - 1) + i - 1; n Q2::maintain(a[i]); n if (a[i] % 2 == 0) Q2::add(a[i] / 2); n chkmax(dp[i], Q2::mx() + i - 1); n if (a[i] % 2 == 0) { n p = qL(i, a[i] / 2, a[i] / 2); n int w = BIT::query(p - 1) + 1; n chkmax(dp[i], w + i - 1); n Q2::insert(a[i] / 2, w); n } n BIT::add(i, dp[i] - i); n } n print(n + n - dp[n]); n } n int main() { n file(); n int T; n read(T); n while (T--) work(); n Ot(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int hell = 1000000007; n void solve() { n long long int n, m; n cin >> n >> m; n vector used(3 * n + 5, 0); n vector mx; n long long int ctr = 1; n for (long long int i = 1; i <= m; i++) { n long long int u, v; n cin >> u >> v; n if (!used[u] and !used[v]) { n mx.push_back(i); n used[u] = used[v] = 1; n } n } n if ((long long int)((mx).size()) >= n) { n cout << Matching n ; n for (long long int i = 0; i < n; i++) cout << mx[i] << ; n cout << n ; n } else { n cout << IndSet n ; n long long int ctr = n; n for (long long int i = 1; i <= 3 * n; i++) { n if (!used[i]) { n cout << i << ; n ctr--; n } n if (!ctr) break; n } n cout << n ; n } n } n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long int t; n cin >> t; n for (long long int i = 0; i < t; i++) solve(); n cerr << Time elapsed : << clock() * 1000.0 / CLOCKS_PER_SEC << ms n << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n vector S; n vector N, L, R; n vector E; n pair> merge(int l, int r, int mid, n pair> L, n pair> R) { n int ll = L.second.first, lr = L.second.second; n int rl = R.second.first, rr = R.second.second; n long long ls = L.first, rs = R.first; n long long sum = ls + rs; n int lw = ll, rw = rr; n int lLength = mid - l + 1, rLength = r - (mid + 1) + 1; n if (lr && rl && N[mid + 1] >= N[mid]) { n if (ll == lLength) lw += rl; n if (rr == rLength) rw += lr; n if (ll != lLength && rl != rLength) n sum += (long long)(lr + rl) * (lr + rl - 1) / 2; n } else { n if (ll != lLength) sum += (long long)(lr) * (lr - 1) / 2; n if (rr != rLength) sum += (long long)(rl) * (rl - 1) / 2; n } n return {sum, {lw, rw}}; n } n pair> getVal(int lq, int rq, int l = 0, int r = n - 1, n int index = 0) { n if (l == r) return {0, {1, 1}}; n if (lq == l && rq == r && E[index]) return {S[index], {L[index], R[index]}}; n int mid = (l + r) >> 1; n if (rq <= mid) { n return getVal(lq, rq, l, mid, 2 * index + 1); n } else if (lq > mid) { n return getVal(lq, rq, mid + 1, r, 2 * index + 2); n } n auto lv = getVal(lq, mid, l, mid, 2 * index + 1); n auto rv = getVal(mid + 1, rq, mid + 1, r, 2 * index + 2); n auto ret = merge(lq, rq, mid, lv, rv); n if (l == lq && r == rq) { n E[index] = true; n S[index] = ret.first, L[index] = ret.second.first, n R[index] = ret.second.second; n } n return ret; n } n void update(int lq, int rq, int l = 0, int r = n - 1, int index = 0) { n if (l == r) return; n E[index] = false; n int mid = (l + r) >> 1; n if (rq <= mid) { n return update(lq, rq, l, mid, 2 * index + 1); n } else if (lq > mid) { n return update(lq, rq, mid + 1, r, 2 * index + 2); n } n update(lq, mid, l, mid, 2 * index + 1); n update(mid + 1, rq, mid + 1, r, 2 * index + 2); n return; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int q; n cin >> n >> q; n N = vector(n); n S = vector(4 * n + 1); n L = R = vector(4 * n + 1); n E = vector(4 * n + 1, false); n for (auto &it : N) cin >> it; n int cmd, x, y; n for (int qq = 0; qq < q; qq++) { n cin >> cmd >> x >> y; n if (cmd == 1) { n N[x - 1] = y; n update(x - 1, x - 1); n } else { n x--, y--; n auto res = getVal(x, y); n auto sum = res.first; n int l = res.second.first, r = res.second.second; n if (l == (y - x + 1)) n sum += (long long)(l) * (l - 1) / 2; n else n sum += ((long long)(l) * (l - 1) + (long long)(r) * (r - 1)) / 2; n sum += (y - x + 1); n cout << sum << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 505; n int n, in[N], out[N], w[N], s[N], v[N]; n vector st[N << 1]; n int f1[N][N << 1], f2[N][N << 1]; n int dfs(int x, int S) { n if (S < 0) return 0; n if (~f1[x][S]) return f1[x][S]; n f2[x][out[x] + 1] = 0; n for (int i = out[x]; i >= in[x]; i--) { n f2[x][i] = f2[x][i + 1]; n for (int j = 0; j < st[i].size(); j++) { n int p = st[i][j]; n if (out[p] > out[x] || p == x) continue; n f2[x][i] = max(f2[x][i], dfs(p, min(S - w[p], s[p])) + f2[x][out[p]]); n } n } n return f1[x][S] = f2[x][in[x]] + v[x]; n } n int main() { n int S; n scanf( %d%d , &n, &S); n for (int i = 1; i <= n; i++) { n scanf( %d%d%d%d%d , &in[i], &out[i], &w[i], &s[i], &v[i]); n st[in[i]].push_back(i); n } n memset(f1, -1, sizeof f1); n in[0] = 0; n out[0] = 2 * n + 1; n printf( %d n , dfs(0, S)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void fr(int &a, bool f = 0, char ch = getchar()) { n for (a = 0; ch < 0 || ch > 9 ; ch = getchar()) ch == - ? f = 1 : 0; n for (; ch >= 0 && ch <= 9 ; ch = getchar()) a = a * 10 + ch - 0 ; n a = f ? -a : a; n } n int fr() { n int a; n return fr(a), a; n } n const int N = 12; n int arr[(1 << N) + 10], a[(1 << N) + 10], ans[(1 << N) + 10], p[(1 << N) + 10]; n int tmp[(1 << N) + 10]; n bool visval[(1 << N) + 10], vispos[(1 << N) + 10]; n struct OI { n int RP, score; n } CSPS2021, NOIP2021; n int main() { n CSPS2021.RP++, CSPS2021.score++, NOIP2021.RP++, NOIP2021.score++, 392699; n srand(time(0)); n int n = fr(), xsum = 0, tot = 1 << n; n for (int i = 0; i < (1 << n); i++) fr(a[i]), xsum ^= a[i], arr[i] = i; n if (xsum) return puts( Fou ), 0; n puts( Shi ); n for (int i = 0; i < (1 << n); i++) { n int pos = rand() % tot, arrpos = arr[pos]; n if (pos != tot - 1) arr[pos] = arr[tot - 1]; n tot--, tmp[0] = 0; n bool flag = 0; n for (int j = 0; j < (1 << n); j++) n if (vispos[j] == 0 && visval[arrpos ^ a[j]] == 0) { n flag = visval[arrpos ^ a[j]] = vispos[j] = 1, ans[j] = arrpos, n p[arrpos ^ a[j]] = j; n break; n } else if (vispos[j] == 0) n tmp[++tmp[0]] = j; n if (flag == 0) { n int j = tmp[rand() % tmp[0] + 1]; n vispos[p[arrpos ^ a[j]]] = 0; n arr[tot++] = ans[p[arrpos ^ a[j]]], ans[j] = arrpos; n vispos[j] = 1; n visval[ans[j] ^ a[j]] = 1; n p[ans[j] ^ a[j]] = j; n i--; n } n } n for (int i = 0; i < (1 << n); i++) printf( %d , ans[i] ^ a[i]); n puts( ); n for (int i = 0; i < (1 << n); i++) printf( %d , ans[i]); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int ans[2020], cnt = 0, k; n int main() { n cin >> k; n k++; n ans[++cnt] = -1; n while (k >= 1e6 - 1) { n k -= 1e6 - 1; n ans[++cnt] = 1e6 - 1 + 1; n } n ans[++cnt] = k + 1; n cout << cnt << endl; n for (int i = 1; i <= cnt; i++) cout << ans[i] << ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n std::ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long f = 0, j, q = 1, i, n; n while (q--) { n long long y, k = 1, x, M, s; n cin >> n >> M >> s >> f; n unordered_map > m; n for (i = 0; i < M; i++) { n long long X, Y, Z; n cin >> X >> Y >> Z; n m.insert(make_pair(X, make_pair(Y, Z))); n } n if (s < f) { n while (s != f) { n if (m.count(k)) { n if ((s >= m[k].first && s <= m[k].second) || n (s + 1 >= m[k].first && s + 1 <= m[k].second)) n cout << X ; n else { n cout << R ; n s++; n } n } else { n cout << R ; n s++; n } n k++; n } n } else { n while (s != f) { n if (m.count(k)) { n if ((s >= m[k].first && s <= m[k].second) || n (s - 1 >= m[k].first && s - 1 <= m[k].second)) n cout << X ; n else { n cout << L ; n s--; n } n } else { n cout << L ; n s--; n } n k++; n } n } n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string ch1, ch2, ch3; n getline(cin, ch1); n getline(cin, ch2); n for (int s = 0; s < ch1.size(); s++) { n if (ch1[s] != ch2[s]) { n ch3 += 1 ; n } else { n ch3 += 0 ; n } n } n cout << ch3 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n long long n, k; n cin >> n >> k; n long long l = 0; n long long r = n; n while (l != r) { n long long mid = (l + r) / 2; n if (mid * (mid + 1) / 2 - (n - mid) < k) n l = mid + 1; n else n r = mid; n } n cout << n - l; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Solve { n bool mark[(int)(3e5 + 10)]; n vector> ed[(int)(3e5 + 10)]; n vector mtch; n int n, m, T; n void go() { n T = 0; n input(); n find_mx_match(); n if (T >= 2 * n) n prnt_match(); n else n prnt_ind(); n } n void input() { n cin >> n >> m; n for (int i = 0; i < m; i++) { n int u, v; n cin >> u >> v; n u--, v--; n ed[u].push_back({v, i + 1}); n ed[v].push_back({u, i + 1}); n } n } n void find_mx_match() { n for (int i = 0; i < 3 * n; i++) { n if (mark[i]) continue; n for (auto x : ed[i]) { n if (mark[x.first]) continue; n mark[x.first] = mark[i] = true; n mtch.push_back(x.second); n T += 2; n break; n } n } n } n void prnt_match() { n cout << Matching n ; n int I = 0; n for (auto x : mtch) { n if (I == n) break; n cout << x << ; n I++; n } n cout << endl; n } n void prnt_ind() { n cout << IndSet n ; n for (int I = 0, J = 0; I < 3 * n && J < n; I++) { n if (!mark[I]) { n cout << I + 1 << ; n J++; n } n } n cout << endl; n } n void clear() { n T = 0; n for (int i = 0; i < 3 * n; i++) mark[i] = false; n for (int i = 0; i < 3 * n; i++) ed[i].clear(); n n = -1, m = -1; n mtch.clear(); n } n } S; n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL), cout.tie(NULL); n int T; n cin >> T; n while (T--) { n S.go(); n S.clear(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ; n long long t; n cin >> t; n while (t--) { n long long n, x, m, i, flag = 0, a, b, l, r, sum = 2, ones = 0, zero = 0, n output = 0, j; n vector > v; n cin >> n >> m; n long long arr[n + 1][m + 1]; n for (i = 1; i <= n; i++) { n for (j = 1; j <= m; j++) { n cin >> arr[i][j]; n } n } n a = 0; n sum = 2; n flag = 0; n while (flag == 0) { n for (i = 1; i <= n; i++) { n for (j = 1; j <= m; j++) { n if ((i + j == sum) || (i + j == n + m - a)) n v.push_back(make_pair(i, j)); n } n } n while (v.size() > 0) { n i = v[v.size() - 1].first; n j = v[v.size() - 1].second; n if (arr[i][j] == 0) n zero++; n else n ones++; n v.pop_back(); n } n output = output + min(zero, ones); n zero = 0; n ones = 0; n a++; n sum++; n if (sum == n + m - a) n break; n else if (sum > (n + m - a)) n break; n } n cout << output << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int t; n cin >> t; n while (t--) { n long long int c, m, x; n cin >> c >> m >> x; n long long int y = c + m + x; n y = y / 3; n long long int ans = 0; n if (c >= 1 && m >= 1) { n long long int v = min(c, m); n ans = min(v, y); n } n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n struct Edge { n int t, next; n Edge() {} n Edge(int a, int b) : t(a), next(b) {} n }; n Edge e[200005]; n int head[100005]; n vector g[100005]; n queue bel[100005]; n int d[100005], scc_cnt; n namespace Graph { n int dfn[100005], low[100005], dfs_cnt; n int st[100005], top; n bool in[100005]; n int id[100005]; n void dfs(int x) { n dfn[x] = low[x] = ++dfs_cnt; n st[++top] = x; n in[x] = 1; n for (int i = head[x]; i; i = e[i].next) { n int u = e[i].t; n if (!dfn[u]) { n dfs(u); n low[x] = min(low[x], low[u]); n } else if (in[u]) n low[x] = min(low[x], dfn[u]); n } n if (low[x] >= dfn[x]) { n scc_cnt++; n int t; n do { n t = st[top--]; n in[t] = 0; n id[t] = scc_cnt; n bel[scc_cnt].push(t); n } while (t != x); n } n } n void build(int n) { n for (int i = 1; i <= n; i++) n if (!dfn[i]) dfs(i); n for (int i = 1; i <= n; i++) n for (int j = head[i]; j; j = e[j].next) n if (id[i] != id[e[j].t]) { n int u = id[i], v = id[e[j].t]; n g[u].push_back(v); n d[v]++; n } n } n } // namespace Graph n bool ask(int x, int y) { n printf( ? %d %d n , x, y); n fflush(stdout); n scanf( %d , &x); n return x; n } n queue q; n void erase(int x) { n for (int i = 0; i < g[x].size(); i++) { n int u = g[x][i]; n d[u]--; n if (!d[u]) q.push(u); n } n } n int solve(int n) { n int ans = 0; n for (int i = 1; i <= scc_cnt; i++) n if (!d[i]) { n if (!ans) n ans = bel[i].front(); n else n q.push(i); n } n while (!q.empty()) { n int t = q.front(), x = bel[t].front(); n if (ask(ans, x)) { n bel[t].pop(); n if (!bel[t].size()) { n erase(t); n q.pop(); n } n } else { n int p = Graph::id[ans]; n bel[p].pop(); n if (!bel[p].size()) n erase(p); n else n q.push(p); n ans = x; n q.pop(); n } n } n return ans; n } n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n int x, y; n scanf( %d%d , &x, &y); n e[i] = Edge(y, head[x]); n head[x] = i; n } n Graph::build(n); n printf( ! %d n , solve(n)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int d[66000], s[66000]; n int que[66000]; n bool f[66000]; n int n, m; n vector > res; n int biton(int x, int k) { return (x | (1 << k)); } n int Minus(int x, int y) { n int z = 0; n for (int i = 0; i < 17; i++) { n int u = ((x >> i) & 1); n int v = ((y >> i) & 1); n if (u != v) z = biton(z, i); n } n return z; n } n int main() { n ios::sync_with_stdio(false); n cin >> n; n for (int i = 0; i < n; i++) cin >> d[i] >> s[i]; n for (int i = 0; i < n; i++) n if (d[i] == 1) { n f[i] = true; n m++; n que[m] = i; n } n while (m > 0) { n int u = que[m]; n if (d[u] == 0) { n m--; n continue; n } n int v = s[u]; n res.push_back(make_pair(u, v)); n s[v] = Minus(s[v], u); n d[v]--; n m--; n if (d[v] == 1 && f[v] == false) { n f[v] = true; n m++; n que[m] = v; n } n } n cout << res.size() << n ; n for (int i = 0; i < res.size(); i++) n cout << res[i].first << << res[i].second << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[200005]; n int main() { n int t; n cin >> t; n while (t--) { n memset(a, 0, sizeof(a)); n int n; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n sort(a, a + n); n if (a[0] != a[n - 1]) { n printf( 1 n ); n } else { n printf( %d n , n); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void _fill_int(int* p, int val, int rep) { n int i; n for (i = 0; i < rep; i++) p[i] = val; n } n signed long long GETi() { n signed long long i; n scanf( %lld , &i); n return i; n } n int N, M; n int A[10000], B[10000]; n int T[4][10000]; n void solve() { n int f, i, j, k, l, x, y; n cin >> N >> M; n for (i = 0; i < N; i++) A[i] = 1 << 29; n for (i = 0; i < M; i++) { n cin >> T[0][i] >> T[1][i] >> T[2][i] >> T[3][i]; n T[1][i]--; n T[2][i]--; n } n for (i = M - 1; i >= 0; i--) { n if (T[0][i] == 1) { n for (j = T[1][i]; j <= T[2][i]; j++) A[j] -= T[3][i]; n } else { n for (j = T[1][i]; j <= T[2][i]; j++) A[j] = min(A[j], T[3][i]); n } n } n int ng = 0; n memmove(B, A, sizeof(A)); n for (i = 0; i < M; i++) { n int y = -1 << 29; n if (T[0][i] == 1) n for (j = T[1][i]; j <= T[2][i]; j++) B[j] += T[3][i]; n else { n for (j = T[1][i]; j <= T[2][i]; j++) y = max(y, B[j]); n if (y != T[3][i]) ng = 1; n } n } n if (ng) n (void)printf( NO n ); n else { n (void)printf( YES n ); n for (i = 0; i < N; i++) (void)printf( %d , A[i]); n (void)printf( n ); n } n } n int main(int argc, char** argv) { n if (argc > 1) freopen(argv[1], r , stdin); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, t; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> t; n while (t--) { n cin >> n; n if (n == 1) { n cout << -1 << endl; n continue; n } n string ans = 2 ; n for (int i = 1; i < n; i++) ans += 3 ; n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int MinDist(int n, int k, const string& s) { n int first_cow_pos = 0; n while (first_cow_pos < n && s[first_cow_pos] == 1 ) { n ++first_cow_pos; n } n int last_cow_pos = first_cow_pos; n int rooms = 1; n while (rooms < k + 1) { n ++last_cow_pos; n if (s[last_cow_pos] == 0 ) { n ++rooms; n } n } n int farmer_pos = first_cow_pos; n int delta = last_cow_pos - first_cow_pos; n for (int i = first_cow_pos + 1; i <= last_cow_pos; ++i) { n if (s[i] == 0 && i - first_cow_pos < delta && last_cow_pos - i < delta) { n delta = max(i - first_cow_pos, last_cow_pos - i); n farmer_pos = i; n } n } n --rooms; n for (++first_cow_pos; first_cow_pos < n; ++first_cow_pos) { n if (s[first_cow_pos] == 1 ) { n continue; n } n while (rooms < k + 1 && last_cow_pos < n) { n ++last_cow_pos; n if (last_cow_pos == n) { n break; n } n if (s[last_cow_pos] == 0 ) { n ++rooms; n } n } n if (last_cow_pos == n) { n break; n } n int npos = max(farmer_pos, first_cow_pos); n int cur_delta = max(farmer_pos - first_cow_pos, last_cow_pos - farmer_pos); n while (npos < last_cow_pos) { n ++npos; n if (s[npos] == 1 ) { n continue; n } n if (npos - first_cow_pos < cur_delta && last_cow_pos - npos < cur_delta) { n cur_delta = max(npos - first_cow_pos, last_cow_pos - npos); n farmer_pos = npos; n } else if (npos - first_cow_pos >= cur_delta) { n break; n } n } n delta = min(delta, cur_delta); n --rooms; n } n return delta; n } n int MinDistSlow(int n, int k, const string& s) { n int result = n; n for (int fcp = 0; fcp < n; ++fcp) { n if (s[fcp] == 1 ) { n continue; n } n int lcp = fcp; n int rooms = 1; n while (rooms < k + 1 && lcp < n) { n ++lcp; n if (lcp == n) { n break; n } n if (s[lcp] == 0 ) { n ++rooms; n } n } n if (lcp == n) { n break; n } n for (int fp = fcp; fp <= lcp; ++fp) { n if (s[fp] == 1 ) { n continue; n } n int delta = max(fp - fcp, lcp - fp); n if (delta < result) { n result = delta; n } n } n } n return result; n } n int main() { n int n, k; n cin >> n >> k; n string s; n char buffer[1000000]; n scanf( %s , buffer); n s = buffer; n int delta = MinDist(n, k, s); n cout << delta << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1e9; n const long long INF = 1e18; n long long n, sum, ans; n long long a[200010]; n struct BIT { n long long tree[600010]; n BIT() { memset(tree, 0, sizeof(tree)); } n void update(long long i, long long x) { n while (i <= 600000) { n tree[i] += x; n i += i & -i; n } n } n long long sum(long long i) { n long long ret = 0; n while (i) { n ret += tree[i]; n i -= i & -i; n } n return ret; n } n } t1, t2; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n ; n cin >> n; n for (long long i = 1; i <= n; i++) { n cin >> a[i]; n ans += (i - 1) * a[i] - t1.sum(a[i]); n long long x = sum; n for (long long j = a[i]; j <= 300000; j += a[i]) { n t1.update(j, a[i]); n x -= (j / a[i]) * a[i] * (t2.sum(j + a[i] - 1) - t2.sum(j - 1)); n } n ans += x; n sum += a[i]; n t2.update(a[i], 1); n cout << ans << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n struct city_t : array, 4> { n int n, k, m, p; n city_t() { cin >> n >> k, m = n / 2, p = n - 2; } n void hotel(int i, int j) { n if (!(*this)[i][j] && k > 0) (*this)[i][j] = true, k--; n } n void solve() { n if (k % 2) hotel(1, m); n for (int i = 1; i < 3 && k > 0; i++) n for (int u = 1, v = p; v > u && k > 0; u++, v--) hotel(i, u), hotel(i, v); n hotel(1, m), hotel(2, m); n } n void write() { n cout << YES ; n for (int i = 0; i < 4; i++) { n cout << n ; n for (int j = 0; j < n; j++) n if ((*this)[i][j]) n cout << # ; n else n cout << . ; n } n } n }; n int main() { n ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr); n city_t city; n city.solve(), city.write(); n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void smin(T &a, T b) { n if (a > b) a = b; n } n template n inline void smax(T &a, T b) { n if (a < b) a = b; n } n int V, E, src, tar; n int head[60000], work[60000], dis[60000]; n int to[2000000], cap[2000000], nxt[2000000]; n int q[60000], qf, qb; n void init(int n) { n memset(head, -1, sizeof(int) * n); n V = n; n E = 0; n } n void add_edge(int u, int v, int c) { n to[E] = v; n cap[E] = c; n nxt[E] = head[u]; n head[u] = E++; n to[E] = u; n cap[E] = 0; n nxt[E] = head[v]; n head[v] = E++; n } n bool bfs() { n memset(dis, -1, sizeof(dis)); n qf = qb = 0; n q[qb++] = src; n dis[src] = 0; n while (qf < qb && dis[tar] == -1) { n int u = q[qf++]; n for (int i = head[u]; i >= 0; i = nxt[i]) { n int v = to[i]; n if (dis[v] == -1 && cap[i] > 0) { n dis[v] = dis[u] + 1; n q[qb++] = v; n } n } n } n return dis[tar] >= 0; n } n int dfs(int u, int &bot) { n int v, bot1, delta; n if (u == tar) return bot; n for (int &i = work[u]; i >= 0; i = nxt[i]) { n v = to[i]; n if (dis[v] != dis[u] + 1 || cap[i] == 0) continue; n bot1 = min(bot, cap[i]); n if (delta = dfs(v, bot1)) { n cap[i] -= delta; n cap[i ^ 1] += delta; n bot = bot1; n return delta; n } n } n return 0; n } n int dinic() { n int ans = 0, delta, bot; n while (bfs()) { n memcpy(work, head, sizeof(int) * V); n delta = 0x3f3f3f3f; n while (delta = dfs(src, bot = 0x3f3f3f3f)) ans += delta; n } n return ans; n } n int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1}; n int n, m, dst[33][33][33][33]; n char grid[33][33]; n int c[2], x[2][33 * 33], y[2][33 * 33], t[2][33 * 33]; n bool can(long long mid) { n int A = c[0], nm = n * m; n src = A * 2 + 2 * nm, tar = src + 1; n init(tar + 10); n for (int i = (0); i < (A); i++) add_edge(src, i, 1); n for (int i = (0); i < (A); i++) add_edge(A + 2 * nm + i, tar, 1); n for (int i = (0); i < (nm); i++) add_edge(A + i, A + nm + i, 1); n for (int r = (0); r < (2); r++) n for (int k = (0); k < (A); k++) n for (int i = (0); i < (n); i++) n for (int j = (0); j < (m); j++) { n if (grid[i][j] == # ) continue; n int xx = x[r][k], yy = y[r][k], tt = t[r][k]; n if (dst[xx][yy][i][j] < 1000 && n (long long)dst[xx][yy][i][j] * tt <= mid) { n if (!r) n add_edge(k, A + i * m + j, 1); n else n add_edge(A + nm + i * m + j, k + A + 2 * nm, 1); n } n } n return dinic() == A; n } n int main() { n ; n scanf( %d%d%d%d , &n, &m, &c[0], &c[1]); n for (int i = (0); i < (n); i++) scanf( %s , grid[i]); n int u, v, w; n scanf( %d%d%d , &u, &v, &w); n u--; n v--; n for (int i = (0); i < (2); i++) n for (int j = (0); j < (c[i]); j++) { n scanf( %d%d%d , &x[i][j], &y[i][j], &t[i][j]); n x[i][j]--; n y[i][j]--; n } n if (c[0] < c[1]) { n x[0][c[0]] = u; n y[0][c[0]] = v; n t[0][c[0]++] = w; n } else { n x[1][c[1]] = u; n y[1][c[1]] = v; n t[1][c[1]++] = w; n } n if (c[0] != c[1]) { n puts( -1 ); n return 0; n } n memset(dst, 0x3f, sizeof(dst)); n for (int i = (0); i < (n); i++) n for (int j = (0); j < (m); j++) { n if (grid[i][j] == # ) continue; n qb = qf = 0; n q[qb++] = i; n q[qb++] = j; n dst[i][j][i][j] = 0; n while (qb > qf) { n u = q[qf++]; n v = q[qf++]; n for (int k = (0); k < (4); k++) { n int uu = u + dx[k], vv = v + dy[k]; n if ((uu < 0 || vv < 0 || uu >= n || vv >= m)) continue; n if (grid[uu][vv] == # ) continue; n if (dst[i][j][uu][vv] > dst[i][j][u][v] + 1) { n dst[i][j][uu][vv] = dst[i][j][u][v] + 1; n q[qb++] = uu; n q[qb++] = vv; n } n } n } n } n long long st = -1, ed = (1LL << 40), mid; n while (st + 1 < ed) { n mid = (st + ed) >> 1; n if (can(mid)) n ed = mid; n else n st = mid; n } n if (ed == (1LL << 40)) n puts( -1 ); n else n printf( %I64d n , ed); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, k, x, y, z; n int main() { n cin >> n >> k >> m; n if (m <= k) n cout << m << endl; n else if (m <= n) n cout << k << endl; n else { n long long tmp = n + k; n cout << tmp - m << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector E[3010]; n int mark[3010]; n int c, f; n bool find(int i, int p) { n if (mark[i] == 1) { n c = i; n f = 1; n return true; n } n mark[i] = 1; n for (vector::iterator to = E[i].begin(); to < E[i].end(); to++) { n if (*to != p && find(*to, i)) { n if (f) mark[i] = 2; n if (i == c) f = 0; n return true; n } n } n return false; n } n int ans[3010]; n void bfs(int i) { n queue v; n v.push(i); n while (!v.empty()) { n int to = v.front(); n v.pop(); n for (vector::iterator at = E[to].begin(); at < E[to].end(); at++) { n if (ans[*at] > ans[to] + 1) { n ans[*at] = ans[to] + 1; n v.push(*at); n } n } n } n } n int main() { n int n; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n int a, b; n scanf( %d%d , &a, &b); n a--; n b--; n E[a].push_back(b); n E[b].push_back(a); n } n find(0, -1); n for (int i = 0; i < 3010; i++) ans[i] = 10000000; n for (int i = 0; i < n; i++) n if (mark[i] == 2) { n ans[i] = 0; n bfs(i); n } n for (int i = 0; i < n; i++) printf( %d , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( unroll-loops ) n int main() { n std::ios::sync_with_stdio(false); n std::cin.tie(nullptr); n int n, k; n std::cin >> n >> k; n int64_t s1 = 0; n int s2 = 0; n for (int i = 0; i < k; ++i) { n int a, b; n std::cin >> a >> b; n s1 += b; n s2 = (s2 + 1ll * a * b) % n; n } n if (s1 > n) { n std::cout << -1 << n ; n } else if (s1 < n) { n std::cout << 1 << n ; n } else if (1ll * n * (n - 1) / 2 % n == s2) { n std::cout << 1 << n ; n } else { n std::cout << -1 << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n vector a(26), a2(26), a3(26); n string s1, s2, s3; n char ss1[100001], ss2[100001], ss3[100001]; n scanf( %s%s%s , ss1, ss2, ss3); n s1 = ss1; n s2 = ss2; n s3 = ss3; n for (int i = 0; i < s1.size(); i++) a[s1[i] - a ]++; n for (int i = 0; i < s2.size(); i++) a2[s2[i] - a ]++; n for (int i = 0; i < s3.size(); i++) a3[s3[i] - a ]++; n int max1 = 0, max2 = 0; n int ma2 = 100000; n for (int i = 0; i < 26; i++) n if (a2[i]) ma2 = min(ma2, a[i] / a2[i]); n for (int i = 0; i <= ma2; i++) { n int r = 100000; n for (int j = 0; j < 26; j++) n if (a3[j]) r = min(r, (a[j] - i * a2[j]) / a3[j]); n if (r + i > max1 + max2) max1 = i, max2 = r; n } n for (int i = 0; i < max1; i++) printf( %s , ss2); n for (int i = 0; i < max2; i++) printf( %s , ss3); n for (int i = 0; i < 26; i++) a[i] -= (a2[i] * max1 + a3[i] * max2); n for (int i = 0; i < 26; i++) { n while (a[i] > 0) { n printf( %c , i + a ); n a[i]--; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 501; n int dp[N][N][2]; n char a[N][N]; n const int MOD = 1e9 + 7; n void add(int &a, int b) { n a += b; n if (a >= MOD) a -= MOD; n if (a < 0) a += MOD; n } n int mul(int a, int b) { return (long long)a * b % MOD; } n int power(int a, int b) { n int ans = 1; n while (b > 0) { n if (b & 1) ans = mul(ans, a); n a = mul(a, a); n b >>= 1; n } n return ans; n } n int main() { n int n, m; n cin >> n >> m; n for (int i = 1; i <= n; i++) { n cin >> (a[i] + 1); n } n for (int x2 = 1; x2 <= n; x2++) { n for (int x1 = n; x1 >= 1; x1--) { n for (int y1 = m; y1 >= 1; y1--) { n int x2cc = x2 % 2; n int y2 = n + m - x2 - x1 - y1 + 2; n dp[x1][y1][x2cc] = 0; n if (x1 > x2 || y1 > y2) continue; n if (y2 < 1 || y2 > m) continue; n if (x1 == x2 && y1 == y2) { n dp[x1][y1][x2cc] = 1; n continue; n } n if ((x2 == x1 + 1 && y1 == y2) || (x1 == x2 && y2 == y1 + 1)) n if (a[x1][y1] == a[x2][y2]) { n dp[x1][y1][x2cc] = 1; n continue; n } n if (x1 < n) { n if (x2 > 1) n if (a[x1 + 1][y1] == a[x2 - 1][y2]) n add(dp[x1][y1][x2cc], dp[x1 + 1][y1][!x2cc]); n if (y2 > 1) n if (a[x1 + 1][y1] == a[x2][y2 - 1]) n add(dp[x1][y1][x2cc], dp[x1 + 1][y1][x2cc]); n } n if (y1 < m) { n if (x2 > 1) n if (a[x1][y1 + 1] == a[x2 - 1][y2]) n add(dp[x1][y1][x2cc], dp[x1][y1 + 1][!x2cc]); n if (y2 > 1) n if (a[x1][y1 + 1] == a[x2][y2 - 1]) n add(dp[x1][y1][x2cc], dp[x1][y1 + 1][x2cc]); n } n } n } n } n if (a[1][1] != a[n][m]) dp[1][1][n % 2] = 0; n cout << dp[1][1][n % 2] << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, n, x, y, good, bad; n scanf( %d , &t); n while (t--) { n scanf( %d%d%d , &n, &x, &y); n bad = min(n, x + y - 1); n if (x + y <= n) n good = 1; n else n good = min(n, x + y - n + 1); n printf( %d %d n , good, bad); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int gcd(long long int a, long long int b) { n return b ? gcd(b, a % b) : a; n } n long long int lcm(long long int a, long long int b) { n return a * b / gcd(a, b); n } n int n, m, cnt[11][11], a[22], b[22], tr[11], mx; n void bktk(int i) { n if (i == n + 1) { n int ans = 0; n memset(cnt, 0, sizeof(cnt)); n for (int j = 1; j <= m; j++) n cnt[min(tr[a[j]], tr[b[j]])][max(tr[b[j]], tr[a[j]])]++; n for (int j = 1; j <= 6; j++) n for (int k = 1; k <= 6; k++) n if (cnt[j][k]) ans++; n mx = max(ans, mx); n return; n } n for (int j = 1; j <= 6; j++) { n tr[i] = j; n bktk(i + 1); n } n } n int main() { n cin >> n >> m; n if (n < 7) { n cout << m << endl; n return 0; n } n for (int i = 1; i <= m; i++) cin >> a[i] >> b[i]; n bktk(1); n cout << mx << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long q; n cin >> q; n if (q == 1) { n cout << 1 n0 n ; n return 0; n } n long long a = -1, b = -1; n for (long long d = 2; d * d <= q; d++) { n if (q % d) continue; n a = d; n b = q / d; n break; n } n if (a == -1) { n cout << 1 n0 n ; n return 0; n } n for (long long d = 2; d * d <= b; d++) { n if (b % d) continue; n cout << 1 n << a * d << n ; n return 0; n } n cout << 2 n ; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n const int MAX = 5e5 + 10; n const long long MAX2 = 11; n const long long MOD = 1000000007; n const long long MOD2 = 1000000006; n const long long INF = 2e18; n const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; n const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0}; n const double pi = acos(-1); n const double EPS = 1e-9; n const int block = 2000; n long long n, k, ans; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> k; n ans = 1; n for (int i = 2; i <= k; ++i) ans = (ans * k) % MOD; n n -= k; n for (int i = 1; i <= n; ++i) ans = (ans * n) % MOD; n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void main0(); n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n main0(); n return 0; n } n const int dx[8] = {0, 1, -1, 0, 1, 1, -1, -1}; n const int dy[8] = {1, 0, 0, -1, 1, -1, -1, 1}; n const int N = 2e3 + 1; n const int INF = 0x3f3f3f3f; n const long long INFF = 0x3f3f3f3f3f3f3f3f; n const int mod = 998244353; n const double eps = 1e-6; n const double Pi = acos(-1.0); n mt19937 rnd( n (unsigned int)chrono::steady_clock::now().time_since_epoch().count()); n int n, m; n char a[N][N]; n int ans[N][N]; n int vis[N][N], step; n int incyc, cyclen; n pair cycp; n void dfs(int x, int y) { n vis[x][y] = ++step; n int xt = x; n int yt = y; n if (a[x][y] == U ) n xt--; n else if (a[x][y] == D ) n xt++; n else if (a[x][y] == L ) n yt--; n else n yt++; n if ((1 > xt) || (xt > n) || (1 > yt) || (yt > m)) { n vis[x][y] = 0; n ans[x][y] = 1; n return; n } n if (vis[xt][yt]) { n incyc = 1; n cyclen = vis[x][y] - vis[xt][yt] + 1; n vis[xt][yt] = 0; n vis[x][y] = 0; n ans[x][y] = cyclen; n return; n } n if (ans[xt][yt] == 0) { n dfs(xt, yt); n } n if (incyc) n ans[x][y] = cyclen; n else n ans[x][y] = ans[xt][yt] + 1; n if (vis[x][y] == 0) incyc = 0; n vis[x][y] = 0; n } n void main0() { n int T; n cin >> T; n while (T--) { n cin >> n >> m; n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n ans[i][j] = vis[i][j] = 0; n } n } n for (int i = 1; i <= n; ++i) { n cin >> a[i] + 1; n } n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n if (ans[i][j]) continue; n step = 0; n dfs(i, j); n } n } n pair pos = {1, 1}; n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n if (ans[i][j] > ans[pos.first][pos.second]) pos = {i, j}; n } n } n cout << pos.first << << pos.second << << ans[pos.first][pos.second] n << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = int(1e5 + 5); n vector g[N]; n int cnt[N]; n void dfs(int v, int depth = 0) { n cnt[depth]++; n for (int to : g[v]) { n dfs(to, depth + 1); n } n } n int main() { n ios::sync_with_stdio(0); n int n; n cin >> n; n for (int i = 2; i <= n; i++) { n int p; n cin >> p; n g[p].push_back(i); n } n dfs(1); n int res = 0; n for (int i = 0; i <= n; i++) { n res += cnt[i] % 2; n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int ans[110000], add[110000]; n int n, m, a, cnt, me; n char temp[3]; n int main() { n while (~scanf( %d%d , &n, &m)) { n for (int i = 1; i <= n; i++) ans[i] = 1, add[i] = 0; n ; n cnt = 0; n me = 0; n for (int i = 1; i <= m; i++) { n scanf( %s%d , temp, &a); n if (*temp == + ) { n if (!me || (me == a)) n me = a; n else n ans[a] = 0; n add[a] = 1; n if (a != me && !add[me]) ans[me] = 0; n cnt++; n } else { n if (!me) me = a; n if (a != me && add[a] == 0) { n ans[me] = 0; n me = a; n } n if (add[a]) { n add[a] = 0; n cnt--; n } n if (cnt) ans[a] = 0; n } n } n int tt = 0; n bool fi = true; n for (int i = 1; i <= n; i++) n if (ans[i]) tt++; n printf( %d n , tt); n for (int i = 1; i <= n; i++) { n if (ans[i]) { n if (!fi) printf( ); n printf( %d , i); n if (fi) fi = false; n } n } n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string str[1009]; n int n, m; n while (cin >> n >> m) { n for (int i = 0; i < n; i++) cin >> str[i]; n int ret = 0, cury = 0; n for (int i = 0; i < n; i++) { n int right = cury; n if (i % 2 == 0) { n for (int j = 0; j < m; j++) n if (str[i][j] == W ) right = j; n int right1 = cury; n if (i < n - 1) n for (int j = 0; j < m; j++) n if (str[i + 1][j] == W ) right1 = j; n right = max(right, right1); n ret += (right - cury); n cury = right; n } else { n int left = cury, left1 = cury; n for (int j = m - 1; j >= 0; j--) n if (str[i][j] == W ) left = j; n if (i < n - 1) n for (int j = m - 1; j >= 0; j--) n if (str[i + 1][j] == W ) left1 = j; n left = min(left, left1); n ret += (cury - left); n cury = left; n } n } n int row = 0; n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) n if (str[i][j] == W ) row = i; n ret += row; n cout << ret << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dis[3]; n int n; n int main() { n scanf( %d , &n); n scanf( %d %d %d , &dis[0], &dis[1], &dis[2]); n int ans = 0; n n--; n int idx = 0; n while (n--) { n if (dis[idx] < dis[(idx + 1) % 3]) { n ans += dis[idx]; n idx = (idx + 2) % 3; n } else { n ans += dis[(idx + 1) % 3]; n idx = (idx + 1) % 3; n } n } n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n const int maxl = 1000 * 100 + 5; n int n, k; n string s; n int dis[30][maxl]; n int main() { n cin >> n >> k >> s; n memset(dis, -1, sizeof dis); n for (int i = 0; i < 27; i++) { n queue q; n for (int j = 0; j < k; j++) n if (s[j] == (char)(i + a )) { n q.push(j); n dis[i][j] = 0; n } n while (!q.empty()) { n int index = q.front(); n q.pop(); n if (index != 0) n if (dis[i][index - 1] == -1) { n dis[i][index - 1] = dis[i][index] + 1; n q.push(index - 1); n } n if (index != maxl - 1) n if (dis[i][index + 1] == -1) { n dis[i][index + 1] = dis[i][index] + 1; n q.push(index + 1); n } n } n } n for (int j = 0; j < n; j++) { n string tmp; n cin >> tmp; n long long int ans = 0; n for (int i = 0; i < tmp.size(); i++) n ans += (dis[tmp[i] - a ][i] == -1 ? tmp.size() : dis[tmp[i] - a ][i]); n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n string s(200, a ); n cout << s << endl; n for (int i = 0; i < n; i++) { n int u; n cin >> u; n s[u] = s[u] == a ? b : a ; n cout << s << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n vector> gr; n vector used; n vector tin, up; n const long long Nmax = 400000; n long long p[Nmax]; n long long sz[Nmax]; n long long timer = 0; n long long diametr(long long u, vector> gr) { n queue q; n long long n = (long long)(gr.size()); n vector h(n + 1, -1); n q.push(u); n h[u] = 0; n long long ml = u; n while (!q.empty()) { n long long v = q.front(); n q.pop(); n for (long long x : gr[v]) { n if (h[x] == -1) { n h[x] = h[v] + 1; n if (h[x] > h[ml]) ml = x; n q.push(x); n } n } n } n vector prev(n + 1, -1); n h.assign(n + 1, -1); n q.push(ml); n h[ml] = 0; n long long ms = ml; n prev[ml] = ml; n while (!q.empty()) { n long long v = q.front(); n q.pop(); n for (long long x : gr[v]) { n if (prev[x] == -1) { n h[x] = h[v] + 1; n prev[x] = v; n if (h[x] > h[ms]) ms = x; n q.push(x); n } n } n } n vector res; n while (prev[ms] != ms) { n res.push_back(ms); n ms = prev[ms]; n } n res.push_back(ms); n reverse((res).begin(), (res).end()); n return (long long)(res.size()) - 1; n } n long long find(long long x) { n if (p[x] != x) { n p[x] = find(p[x]); n } n return p[x]; n } n void merge(long long x, long long y) { n x = find(x); n y = find(y); n p[y] = x; n } n void restart(long long N) { n for (long long i = 0; i < N; ++i) { n sz[i] = 1; n p[i] = i; n } n } n vector> most; n void dfs(long long u, long long p) { n used[u] = true; n tin[u] = timer++; n up[u] = tin[u]; n for (long long v : gr[u]) { n if (used[v] && v != p) up[u] = min(up[u], tin[v]); n if (!used[v]) { n dfs(v, u); n up[u] = min(up[u], up[v]); n if (tin[u] < up[v]) { n most.emplace_back(u, v); n } else { n merge(u, v); n } n } n } n } n void solve() { n long long n, m; n cin >> n >> m; n gr.resize(n); n tin.assign(n, 0); n up.assign(n, 0); n used.assign(n, 0); n restart(n); n for (long long i = (0); i < (m); ++i) { n long long u, v; n cin >> u >> v; n u--; n --v; n gr[u].push_back(v); n gr[v].push_back(u); n } n dfs(0, -1); n vector> gr2(n); n if (most.empty()) { n cout << 0; n return; n } n for (long long i = (0); i < ((long long)(most.size())); ++i) { n long long u = most[i].first, v = most[i].second; n u = find(u); n v = find(v); n gr2[u].push_back(v); n gr2[v].push_back(u); n } n long long v = most[0].first; n v = find(v); n cout << diametr(v, gr2); n } n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n long long t; n t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC target( sse4 ) n using namespace std; n using ll = long long; n using vi = vector; n using pii = pair; n const int MX = 1e5 + 10; n template n istream &operator>>(istream &is, vector &v) { n for (auto i = begin(v); i != end(v); i++) is >> *i; n return is; n } n template n ostream &operator<<(ostream &os, const vector &v) { n for (auto i = begin(v); i != end(v); i++) n os << *i << (i == end(v) - 1 ? n : ); n return os; n } n template n inline void rd(T &s) { n s = 0; n T t = 1, k = getchar(); n for (; k < 0 || k > 9 ; k = getchar()) n if (k == - ) t = -1; n for (; k >= 0 && k <= 9 ; k = getchar()) n s = (s << 1) + (s << 3) + (k ^ 48); n s *= t; n } n ll n, m, t; n char a[1111][1111]; n ll b[1111][1111]; n ll dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0}; n void solve() { n cin >> n >> m >> t; n for (register ll i = 1, ilen = (ll)(n); i <= ilen; ++i) cin >> (a[i] + 1); n queue q; n for (register ll i = 1, ilen = (ll)(n); i <= ilen; ++i) n for (register ll j = 1, jlen = (ll)(m); j <= jlen; ++j) { n if (a[i][j] == a[i + 1][j] || a[i][j] == a[i - 1][j] || n a[i][j] == a[i][j + 1] || a[i][j] == a[i][j - 1]) n b[i][j] = 1, q.push(make_pair(i, j)); n else n b[i][j] = 2e18; n } n while (q.size()) { n ll x = q.front().first, y = q.front().second; n q.pop(); n for (register ll i = 0, ilen = (ll)(4); i < ilen; ++i) { n ll nx = x + dx[i], ny = y + dy[i]; n if (nx >= 1 && nx <= n && ny >= 1 && ny <= m) { n if (b[x][y] + 1 < b[nx][ny]) q.push(make_pair(nx, ny)); n b[nx][ny] = min(b[nx][ny], b[x][y] + 1); n } n } n } n while (t--) { n ll x, y, p; n cin >> x >> y >> p; n if (p >= b[x][y] && (p - b[x][y]) % 2 == 0) { n if (a[x][y] == 1 ) n cout << 0 << n ; n else n cout << 1 << n ; n } else n cout << a[x][y] << n ; n } n } n signed main() { n ll T = 1; n while (T--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = (int)1e6 + 5; n void compute() { n int n, m; n scanf( %d %d , &n, &m); n vector v(n); n for (int i = 0; i < n; ++i) scanf( %d , &v[i]); n vector > seg(m); n vector > lf(n), rg(n); n for (int i = 0; i < m; ++i) { n scanf( %d%d , &seg[i].first, &seg[i].second); n --seg[i].first; n --seg[i].second; n lf[seg[i].second].push_back(seg[i].first); n rg[seg[i].first].push_back(seg[i].second); n } n vector add(n, 0); n vector ansv(n, -inf); n int mn = v[0]; n for (int i = 0; i < n; ++i) { n ansv[i] = max(ansv[i], v[i] - mn); n for (auto l : lf[i]) { n for (int j = l; j <= i; ++j) { n --add[j]; n mn = min(mn, v[j] + add[j]); n } n } n mn = min(mn, v[i] + add[i]); n } n add = vector(n, 0); n mn = v[n - 1]; n for (int i = n - 1; i >= 0; --i) { n ansv[i] = max(ansv[i], v[i] - mn); n for (auto r : rg[i]) { n for (int j = i; j <= r; ++j) { n --add[j]; n mn = min(mn, v[j] + add[j]); n } n } n mn = min(mn, v[i] + add[i]); n } n int res = *max_element(ansv.begin(), ansv.end()); n vector res2; n for (int i = 0; i < n; ++i) { n if (ansv[i] == res) { n for (int j = 0; j < m; ++j) { n if (!(seg[j].first <= i && seg[j].second >= i)) res2.push_back(j + 1); n } n break; n } n } n printf( %d n%d n , res, (int)res2.size()); n for (auto i : res2) printf( %d , i); n printf( n ); n } n int main() { n compute(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, k; n bool odd = false, even = false; n cin >> n >> k; n if (n & 1) { n if (k > (n / 2 + 1)) { n even = true; n k -= (n / 2 + 1); n } else n odd = true; n } else { n if (k > n / 2) { n even = true; n k -= (n / 2); n } else n odd = true; n } n if (odd) n cout << 2 * k - 1 << endl; n else n cout << 2 * k << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize(3) n using namespace std; n bool Finish_read; n template n inline void read(T &x) { n Finish_read = 0; n x = 0; n int f = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) f = -1; n if (ch == EOF) return; n ch = getchar(); n } n while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); n x *= f; n Finish_read = 1; n } n template n inline void print(T x) { n if (x / 10 != 0) print(x / 10); n putchar(x % 10 + 0 ); n } n template n inline void writeln(T x) { n if (x < 0) putchar( - ); n x = abs(x); n print(x); n putchar( n ); n } n template n inline void write(T x) { n if (x < 0) putchar( - ); n x = abs(x); n print(x); n } n const int maxn = 100005, maxnode = 16500005; n int mx, my, mz, n, m, k, lx, rx, ly, ry, lz, rz, cnt, lc[maxnode], rc[maxnode], n lv[maxnode], rv[maxnode], rt[maxn << 2]; n inline bool Open(int x, int y, int z) { n return lx <= x && x <= rx && ly <= y && y <= ry && lz <= z && z <= rz; n } n inline void update(int &o, int l, int r, int y, int z) { n if (!o) o = ++cnt, rv[o] = mz + 1; n if (lz <= z) rv[o] = min(rv[o], z); n if (z <= rz) lv[o] = max(lv[o], z); n if (l == r) return; n int mid = (l + r) >> 1; n if (y <= mid) n update(lc[o], l, mid, y, z); n else n update(rc[o], mid + 1, r, y, z); n } n inline void modify(int o, int l, int r, int x, int y, int z) { n update(rt[o], 1, my, y, z); n if (l == r) return; n int mid = (l + r) >> 1; n if (x <= mid) n modify(o << 1, l, mid, x, y, z); n else n modify(o << 1 | 1, mid + 1, r, x, y, z); n } n inline bool getans(int o, int l, int r, int yl, int yr, int zl, int zr) { n if (!o) return 1; n if (yl <= l && r <= yr) return lv[o] < zl && zr < rv[o]; n bool res = 1; n int mid = (l + r) >> 1; n if (yl <= mid) res &= getans(lc[o], l, mid, yl, yr, zl, zr); n if (yr > mid) res &= getans(rc[o], mid + 1, r, yl, yr, zl, zr); n return res; n } n inline bool query(int o, int l, int r, int xl, int xr, int yl, int yr, int zl, n int zr) { n if (xl <= l && r <= xr) return getans(rt[o], 1, my, yl, yr, zl, zr); n bool res = 1; n int mid = (l + r) >> 1; n if (xl <= mid) res &= query(o << 1, l, mid, xl, xr, yl, yr, zl, zr); n if (xr > mid) res &= query(o << 1 | 1, mid + 1, r, xl, xr, yl, yr, zl, zr); n return res; n } n inline void solve(int x, int y, int z) { n if (Open(x, y, z)) return (void)puts( OPEN ); n if (query(1, 1, mx, min(lx, x), max(rx, x), min(ly, y), max(ry, y), n min(lz, z), max(rz, z))) n return (void)puts( UNKNOWN ); n return (void)puts( CLOSED ); n } n int main() { n read(mx), read(my), read(mz), read(n), read(m), read(k); n lx = mx, ly = my, lz = mz; n for (int i = 1, x, y, z; i <= n; ++i) { n read(x), read(y), read(z); n lx = min(lx, x), rx = max(rx, x); n ly = min(ly, y), ry = max(ry, y); n lz = min(lz, z), rz = max(rz, z); n } n for (int i = 1, x, y, z; i <= m; ++i) { n read(x), read(y), read(z); n if (Open(x, y, z)) return 0 * puts( INCORRECT ); n modify(1, 1, mx, x, y, z); n } n puts( CORRECT ); n for (int i = 1, x, y, z; i <= k; ++i) n read(x), read(y), read(z), solve(x, y, z); n } n "} +{"func_code_string": "#include n using namespace std; n long long a[(200020)], b[(200020)], close[100][2]; n set > vis; n signed main() { n long long n; n cin >> n; n for (long long i = 1; i <= n; i++) scanf( %lld , &a[i]); n for (long long i = 1; i <= n; i++) b[i] = b[i - 1] + a[i]; n long long ans = 0; n for (long long i = 1; i <= n; i++) { n if (i >= 3) n for (long long k = 0; k < 30; k++) n if (!(a[i] & (1 << k))) { n if (close[k][0] && i - close[k][0] > 1) { n if ((a[i] ^ a[close[k][0]]) == b[i - 1] - b[close[k][0]]) { n if (vis.find(make_pair(close[k][0], i)) != vis.end()) continue; n ans++; n vis.insert(make_pair(close[k][0], i)); n } n } n if (close[k][1] && i - close[k][1] > 1) { n if ((a[i] ^ a[close[k][1]]) == b[i - 1] - b[close[k][1]]) { n if (vis.find(make_pair(close[k][1], i)) != vis.end()) continue; n ans++; n vis.insert(make_pair(close[k][1], i)); n } n } n } n for (long long k = 0; k < 30; k++) { n if (a[i] & (1 << k)) { n close[k][1] = close[k][0]; n close[k][0] = i; n } n } n } n memset(close, 0, sizeof(close)); n for (long long i = n; i >= 1; i--) { n if (n - i + 1 >= 3) n for (long long k = 0; k < 30; k++) n if (!(a[i] & (1 << k))) { n if (close[k][0] && close[k][0] - i > 1) { n if ((a[i] ^ a[close[k][0]]) == b[close[k][0] - 1] - b[i]) { n if (vis.find(make_pair(i, close[k][0])) != vis.end()) continue; n ans++; n vis.insert(make_pair(i, close[k][0])); n } n } n if (close[k][1] && close[k][1] - i > 1) { n if ((a[i] ^ a[close[k][1]]) == b[close[k][1] - 1] - b[i]) { n if (vis.find(make_pair(i, close[k][1])) != vis.end()) continue; n ans++; n vis.insert(make_pair(i, close[k][1])); n } n } n } n for (long long k = 0; k < 30; k++) { n if (a[i] & (1 << k)) { n close[k][1] = close[k][0]; n close[k][0] = i; n } n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, s, i, j, k, a, b, w, l1, l2, c, rt, lw; n double v[109][109], t[109][109], tp, tc, p1, p2, t1, t2; n int main() { n cin >> n >> s; n for (i = 0; i < n; i++) { n cin >> k; n for (j = 0; j < k; j++) cin >> v[i][j] >> t[i][j]; n t[i][k] = 9999999.0; n } n for (i = 0; i < n; i++) { n for (j = i + 1; j < n; j++) { n p1 = p2 = 0.0; n w = lw = c = 0; n t1 = t[i][0]; n t2 = t[j][0]; n for (l1 = l2 = 0;;) { n a = b = 0; n if (t1 > t2) { n tc = t2; n b = 1; n } else { n if (t1 < t2) { n tc = t1; n a = 1; n } else { n tc = t1; n a = b = 1; n } n } n t1 -= tc; n t2 -= tc; n p1 += v[i][l1] * tc; n p2 += v[j][l2] * tc; n if (w == 0) { n if (p1 > p2) { n w = 1; n if (lw == 2) c++; n } n if (p1 < p2) { n w = 2; n if (lw == 1) c++; n } n } else { n if (w == 1) { n if (p1 < p2) { n c++; n w = 2; n } n if (p1 == p2) lw = 1, w = 0; n } else { n if (p1 > p2) { n c++; n w = 1; n } n if (p1 == p2) lw = 2, w = 0; n } n } n if (a == 1) { n l1++; n t1 = t[i][l1]; n } n if (b == 1) { n l2++; n t2 = t[j][l2]; n } n if (p1 >= s || p2 >= s) break; n } n rt += c; n } n } n cout << rt; n } n "} +{"func_code_string": "#include n int main(void) { n double a, v, l, d, w, t = 0; n scanf( %lf%lf%lf%lf%lf , &a, &v, &l, &d, &w); n if (2 * a * d <= w * w || w >= v) { n if (l * a * 2 >= v * v) { n t += v / a; n t += (l - v * v / (2 * a)) / v; n } else { n t += sqrt(2 * l / a); n } n } else if (2 * a * d >= 2 * v * v - w * w) { n t += v / a; n t += (v - w) / a; n t += (d - (2 * v * v - w * w) / (2 * a)) / v; n if (2 * a * (l - d) > v * v - w * w) { n t += (v - w) / a; n t += (l - d - (v * v - w * w) / (2 * a)) / v; n } else { n t += sqrt(2 * (l - d) / a + w * w / (a * a)) - w / a; n } n } else { n t += (sqrt(a * d + w * w / 2) + sqrt(a * d + w * w / 2) - w) / a; n if (2 * a * (l - d) > v * v - w * w) { n t += (v - w) / a; n t += (l - d - (v * v - w * w) / (2 * a)) / v; n } else { n t += sqrt(2 * (l - d) / a + w * w / (a * a)) - w / a; n } n } n printf( %f n , t); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int t; n scanf( %d , &t); n while (t--) { n long long int n, k; n scanf( %lld %lld , &n, &k); n long long int ans = 0; n ans += (n / k) * k; n if (n - ans > k / 2) n ans += k / 2; n else n ans = n; n printf( %lld n , ans); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 105; n int freq[N]; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int n, m; n cin >> n >> m; n for (int i = 0; i < m; i++) { n int type; n cin >> type; n freq[type]++; n } n int start = 1, end = 100; n while (start <= end) { n int mid = (start + end) >> 1; n int persons = 0; n for (int types = 1; types <= 100; types++) { n persons += (freq[types] / mid); n } n if (persons >= n) n start = mid + 1; n else n end = mid - 1; n } n cout << end << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long TC = 1; n while (TC--) { n long long n; n cin >> n; n vector a(n); n for (long long i = 0; i < n; i++) cin >> a[i]; n long long lcnt = 1, rcnt = 1; n for (long long i = 1; i < n; i++) { n if (a[i] > a[i - 1]) n lcnt++; n else n break; n } n for (long long i = n - 1 - 1; i >= 0; i--) { n if (a[i] > a[i + 1]) n rcnt++; n else n break; n } n if ((a[0] >= a[n - 1] && lcnt % 2) || (a[0] <= a[n - 1] && rcnt % 2)) { n cout << Alice n ; n continue; n } else if (lcnt % 2 == 0 && rcnt % 2 == 0) { n cout << Bob n ; n } else { n cout << Alice n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 100005; n const double eps = 1.0e-8; n const double pi = acos(-1.0); n complex p[MAXN], P; n double cross(complex a, complex b) { n return (conj(a) * b).imag(); n } n double check(complex a, complex b) { n double l = 0, r = 1; n complex v = b - a; n for (int i = 0; i < 50; i++) { n double mid = (l + r) * 0.5; n double midd = (mid + r) * 0.5; n complex x = a + v * mid, y = a + v * midd; n if (abs(P - x) + eps < abs(P - y)) { n r = midd; n } else { n l = mid; n } n } n return abs(P - (a + v * l)); n } n int main() { n int n; n cin >> n; n int x, y; n cin >> x >> y; n P = complex(x, y); n for (int i = 0; i < n; i++) { n scanf( %d %d , &x, &y); n p[i] = complex(x, y); n } n p[n] = p[0]; n double r1 = 1.0e20, r2 = 0; n for (int i = 0; i < n; i++) { n r1 = min(r1, check(p[i], p[i + 1])); n r2 = max(r2, abs(P - p[i])); n } n printf( %.10f n , pi * (r2 * r2 - r1 * r1)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 100000; n int f[MAXN + 5]; n int main() { n memset(f, 0, sizeof(f)); n int m = 0, a = 0, r0 = 0, b = 0, ans = 1; n cin >> a >> b >> m >> r0; n f[r0] = 1; n for (int i = 2;; ++i) { n r0 = (a * r0 + b) % m; n ++ans; n if (f[r0] != 0) { n ans = ans - f[r0]; n break; n } n f[r0] = ans; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int n, m, count = 0; n cin >> n >> m; n int x = min(n, m); n n = n - x; n m = m - x; n int rest = (n / 2) + (m / 2); n cout << x << << rest << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int t; n cin >> t; n while (t--) { n unordered_map mp; n int n; n cin >> n; n string arr[n]; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n for (auto c : arr[i]) { n mp[c]++; n } n } n bool ok = true; n for (auto p : mp) { n if (p.second % n != 0) { n ok = false; n break; n } n } n cout << ((ok) ? YES n : NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int a, b, c, l; n cin >> a >> b >> c >> l; n long long int Total = (l + 1) * (l + 2) * (l + 3) / 6; n for (long long int la = 0; la <= l; la++) { n long long int mini = min(a - b - c + la, l - la); n if (mini < 0) continue; n long long int wrong = (mini + 1) * (mini + 2) / 2; n Total -= wrong; n } n for (long long int lb = 0; lb <= l; lb++) { n long long int mini = min(b - a - c + lb, l - lb); n if (mini < 0) continue; n long long int wrong = (mini + 1) * (mini + 2) / 2; n Total -= wrong; n } n for (long long int lc = 0; lc <= l; lc++) { n long long int mini = min(c - b - a + lc, l - lc); n if (mini < 0) continue; n long long int wrong = (mini + 1) * (mini + 2) / 2; n Total -= wrong; n } n cout << Total << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n n const int MAX = 1 << 20; n bitset dpgl, mv, dp[20]; n map to; n char rv[20]; n int cnt[20], le[20], ri[20], n, A, B, b; n n void solve(int ms) { n int L = 1e9, R = -1, tot = 0; n vector tr, chr, oth; n for(int i = 0; i < b; i++) { n if(ms & (1 << i)) { n L = min(L, le[i]); n R = max(R, ri[i]); n tot += cnt[i]; n chr.push_back(i); n if(dp[i][ms ^ (1 << i)]) n dp[i][ms] = dpgl[ms] = 1; n } n else n oth.push_back(i); n } n n if(tot >= ((R - L + 1) * A + B - 1) / B) n mv[ms] = 1; n n if(oth.empty()) n return; n n sort(chr.begin(), chr.end(), [&](int a, int b){ return le[a] < le[b]; }); n int cms = 0; n for(auto c : chr) { n cms |= (1 << c); n if(mv[cms] && dpgl[cms] && dp[oth[0]][ms ^ cms]) { n for(auto tc : oth) n dp[tc][ms] = 1; n return; n } n } n } n n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n n cin >> n >> A >> B; n string s; n cin >> s; n n for(auto &c : s) { n if(!to.count(c)) { n rv[b] = c; n to[c] = b++; n } n } n n for(int i = 0; i < s.size(); i++) { n cnt[to[s[i]]]++; n ri[to[s[i]]] = i; n } n for(int i = s.size() - 1; i >= 0; i--) n le[to[s[i]]] = i; n n dpgl[0] = mv[0] = 1; n for(int i = 0; i < b; i++) { n dp[i][0] = dp[i][1 << i] = 1; n dpgl[1 << i] = 1; n } n n for(int i = 1; i < (1 << b); i++) n solve(i); n n vector ans; n n for(int i = 0; i < b; i++) n if(dp[i][(1 << b) - 1]) n ans.push_back(rv[i]); n n sort(ans.begin(), ans.end()); n n cout << ans.size(); n for(auto &c : ans) n cout << << c; n cout << n ; n n /*for(int i = 0; i < (1 << b); i++) { n for(int j = 0; j < b; j++) n cout << bitset<4>(i) << << j << << dp[j][i] << n ; n } n n cout << n ;*/ n }"} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9+7, M = (1e9+7), MAXN = 1 * 2e5; n int A[MAXN], C[MAXN]; n n n n int64_t modpow(int64_t a, int64_t b) { n int64_t res = 1; n for(; b; b >>= 1) { n if(b&1) n res=res*a%M; n a=a*a%M; n } n return res; n } n void solve() { n const int MOD = M; n int N, M; n cin >> N >> M; n vector G(N); n for(int i = 0; i < N; i++) n cin >> G[i]; n n int cnt = 0; n for(int i = 0; i < N; i++) n cnt += count(G[i].begin(), G[i].end(), # ); n cerr << Count: << cnt << endl; n int64_t x = modpow(2, cnt); n if(cnt == N * M) { n cout << (x - 1 + MOD) % MOD << endl; n } else { n cout << modpow(2, cnt) << endl; n } n } n int main() { n cin.tie(0)->sync_with_stdio(0); n int T; cin >> T; n n while(T--) { n solve(); n } n } n "} +{"func_code_string": " n #include n #include n #include n #include n #include n #include n #include n n std::ifstream fin( input.txt ); n std::ofstream fout( output.txt ); n n int main(){ n std::ios_base::sync_with_stdio(false); n std::cin.tie(NULL); n std::cout.tie(NULL); n std::cout << std::setprecision(6) << std::fixed << n ; n int Q; n std::cin >> Q; n while(Q --){ n int n, m; n std::cin >> n >> m; n int x[n], pos; n long double ans = 0; n for(int i=0; i> x[i]; n n for(pos=n-1; pos>=0 and x[pos] == pos+1; pos--); n n if(pos == -1) ans = 1; n n while(m --){ n int p; n long double prob; n std::cin >> p >> prob; p--; n if(p >= pos){ n ans = 1.0 - (1.0 - ans) * (1.0 - prob); n } n } n std::cout << ans << n ; n } n n return 0; n n }"} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n long long int A[N]; n vector g[N]; n long long int dfs(int x, int p) { n A[x] = 1; n for (int i = 0; i < g[x].size(); ++i) { n int y = g[x][i]; n if (y == p) continue; n A[x] += dfs(y, x); n } n return A[x]; n } n long double E[N]; n void solve(int x, int p) { n long long int n = (long long int)g[x].size(); n for (int i = 0; i < g[x].size(); ++i) { n int y = g[x][i]; n if (y == p) continue; n E[y] = E[x] + 1; n long double med = (A[x] - 1 - A[y]) / (long double)(n - 1); n if (g[x].size() != 1) { n E[y] += (med * (n - 1)) / (2.0); n } n solve(y, x); n } n } n int main(void) { n ios::sync_with_stdio(false); n int n; n cin >> n; n for (int i = 2; i <= n; ++i) { n int x; n cin >> x; n g[x].push_back(i); n g[i].push_back(x); n } n E[1] = 1.0; n dfs(1, -1); n solve(1, -1); n cout.precision(10); n for (int i = 1; i <= n; ++i) { n cout << fixed << E[i] << ; n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 1200; n int x, y; n bool run() { n bool fox = true; n while (1) { n if (fox) { n if (x == 0) { n if (y >= 22) { n y -= 22; n } else { n return false; n } n } else if (x == 1) { n if (y >= 12) { n y -= 12; n } else { n return false; n } n } else { n if (y >= 2) { n x -= 2; n y -= 2; n } else { n return false; n } n } n } else { n if (y >= 22) { n y -= 22; n } else if (y >= 12) { n y -= 12; n if (x == 0) { n return true; n } else { n x--; n } n } else if (y >= 2) { n y -= 2; n if (x < 2) { n return true; n } else { n x -= 2; n } n } else { n return true; n } n } n fox ^= 1; n } n return false; n } n int main() { n scanf( %d%d , &x, &y); n if (run()) { n puts( Ciel ); n } else { n puts( Hanako ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e3 + 5; n const int maxm = 1 << 13; n int n; n long long k; n pair dp[maxn][maxm]; n int pre[maxn][maxm]; n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } n vector v; n void get_div(long long k) { n for (long long i = 1; i * i <= k; i++) { n if (k % i == 0) { n long long j = k / i; n v.push_back(i); n if (i != j) v.push_back(j); n } n } n sort(v.begin(), v.end()); n } n long long a[maxn], c[maxn]; n int main() { n scanf( %d%lld , &n, &k); n get_div(k); n for (int i = 1; i <= n; i++) { n scanf( %lld , &a[i]); n c[i] = gcd(a[i], k); n } n if (k == 1) { n printf( 1 n ); n int p = 1; n long long minn = a[1]; n for (int i = 2; i <= n; i++) { n if (a[i] < minn) minn = a[i], p = i; n } n printf( %d n , p); n return 0; n } n int m = v.size(); n for (int i = 0; i <= n; i++) n for (int j = 0; j < m; j++) dp[i][j] = make_pair((int)1e9, (long long)1e16); n dp[0][0] = make_pair(0, 0); n for (int i = 1; i <= n; i++) n for (int j = 0; j < m; j++) { n if (dp[i][j] > dp[i - 1][j]) { n dp[i][j] = dp[i - 1][j]; n pre[i][j] = j; n } n int t = n lower_bound(v.begin(), v.end(), v[j] / gcd(v[j], c[i])) - v.begin(); n if (dp[i][j] > n make_pair(dp[i - 1][t].first + 1, dp[i - 1][t].second + a[i])) { n dp[i][j] = n make_pair(dp[i - 1][t].first + 1, dp[i - 1][t].second + a[i]); n pre[i][j] = t; n } n } n if (dp[n][m - 1].first > n) n printf( -1 n ); n else { n printf( %d n , dp[n][m - 1].first); n int k = m - 1; n bool first = true; n for (int i = n; i >= 1; i--) { n if (pre[i][k] != k) { n if (first) { n printf( %d , i); n first = false; n } else n printf( %d , i); n } n k = pre[i][k]; n } n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n int dp[1000]; n int mm[200][200]; n int main() { n int i, j, n, m, t; n dp[3] = 3; n for (i = 4; i < 1000; ++i) dp[i] = dp[i - 1] + i - 1; n while (scanf( %d , &n) != EOF) { n for (i = 3; i < 1000; ++i) { n if (dp[i] > n) break; n } n m = i - 1; n printf( %d n , m); n t = 1; n for (i = 1; i < m; ++i) { n for (j = i; j < m; ++j) mm[i][j] = mm[j + 1][i] = t++; n } n for (i = 1; i <= m; ++i) { n for (j = 1; j < m; ++j) printf( %d , mm[i][j]); n printf( n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n #include n #define int long long n #include n #define rep(i,a,b) for(int i=a;i v[N]; n int siz[N]; n int lvl[N]; n n int forefather[N]; n n int tim = 0, st[N], et[N]; n n void dfs(int z,int p = -1,int ff = 0){ n if(p == -1) lvl[z] = 0; n else lvl[z] = lvl[p] + 1; n n if(lvl[z] == 1) ff = z; n forefather[z] = ff; n n st[z] = tim++; n n siz[z] = 1; n for(int x:v[z]){ n if(x == p) continue; n dfs(x,z,ff); n siz[z] += siz[x]; n } n et[z] = tim; n } n n // x is ancestor of y n bool ancestor(int x,int y){ n if(st[y] > st[x] && et[y] <= et[x]){ n return true; n } n return false; n } n n int calc(int x,int y){ n if(y == 0) swap(x,y); n if(x == 0){ n return siz[y] * (siz[0] - siz[forefather[y]]); n } n return siz[x] * siz[y]; n } n n void solve(){ n tim = 0; n int n; n cin >> n; n rep(i,0,n){ n v[i].clear(); n siz[i] = 0; n lvl[i] = 0; n forefather[i] = 0; n } n rep(i,1,n){ n int x,y; n cin >> x >> y; n v[x].pb(y); n v[y].pb(x); n } n n dfs(0); n n int paths = n * (n - 1) / 2; n int donthavezero = 0; n rep(i,1,n){ n if(lvl[i] != 1) continue; n donthavezero += siz[i] * (siz[i] - 1) / 2; n } n cout << donthavezero << ; n paths -= donthavezero; n n int a = 0, b = 0; n n rep(i,1,n){ n if(paths == 0){ n cout << 0 << ; n continue; n } n if(a == 0) swap(a,b); n if(ancestor(i,a) || ancestor(i,b)){ n cout << 0 << ; n continue; n } n if(ancestor(a,i)){ n a = i; n int wont_work = calc(a,b); n cout << paths - wont_work << ; n paths = wont_work; n } n else if(ancestor(b,i)){ n if(forefather[i] == forefather[a]){ n cout << paths << ; n paths = 0; n continue; n } n b = i; n int wont_work = calc(a,b); n cout << paths - wont_work << ; n paths = wont_work; n } n else{ n cout << paths << ; n paths = 0; n } n } n n cout << paths; n n cout << n ; n } n signed main(){ n ios_base::sync_with_stdio(false); n cin.tie(0);cout.tie(0); n n int t=1; n cin>>t; n while(t--) solve(); n return 0; n }"} +{"func_code_string": "#include n using namespace std; n long long ans = -((long long)1 << 62); n int n, u, r; n int a[105]; n int b[105]; n int k[105]; n int p[105]; n void process(int m, int op) { n if (((u - m) & 1) == 0) { n long long an = 0; n for (int i = 1; i <= n; i++) an += a[i] * k[i]; n ans = max(an, ans); n } n if (m == u) { n return; n } n if (op == 0) { n for (int i = 1; i <= n; i++) a[i] ^= b[i]; n process(m + 1, 1); n for (int i = 1; i <= n; i++) a[i] ^= b[i]; n } n vector a1; n a1.push_back(1); n for (int i = 1; i <= n; i++) a1.push_back(a[i]); n for (int i = 1; i <= n; i++) a[i] = a1[p[i]] + r; n process(m + 1, 0); n for (int i = 1; i <= n; i++) a[i] = a1[i]; n } n int main() { n scanf( %d %d %d , &n, &u, &r); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1; i <= n; i++) scanf( %d , &b[i]); n for (int i = 1; i <= n; i++) scanf( %d , &k[i]); n for (int i = 1; i <= n; i++) scanf( %d , &p[i]); n process(0, 0); n printf( %I64d , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n int m; n int k; n vector > A; n cin >> n >> m >> k; n for (int i = 0; i < n; i++) { n vector X; n for (int j = 0; j < m; j++) { n int l; n cin >> l; n X.push_back(l); n } n A.push_back(X); n } n int totalSum = 0; n int changes = 0; n for (int j = 0; j < m; j++) { n int maxSum = 0; n vector maxI; n maxI.push_back(0); n for (int i = 0; i < n; i++) { n if (A[i][j] == 1) { n int sum = 0; n for (int z = i; z < min(i + k, n); z++) { n sum += A[z][j]; n } n if (sum > maxSum) { n maxSum = sum; n for (int elem = 0; elem < maxI.size(); elem++) { n maxI[elem] = i; n } n } else if (sum == maxSum) { n maxI.push_back(i); n } n } n } n int minimumChanges = 10000000; n for (auto elem : maxI) { n int toChange = 0; n for (int i = 0; i < elem; i++) { n if (A[i][j] == 1) { n toChange++; n } n } n if (toChange < minimumChanges) { n minimumChanges = toChange; n } n } n changes += minimumChanges; n totalSum += maxSum; n } n cout << totalSum << << changes; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxh = 200 * 1000 + 5; n struct item { n int pos, hash; n item(int pos, int hash) : pos(pos), hash(hash) {} n }; n bool operator<(item a, item b) { return a.pos < b.pos; } n int n, m, h; n set S[maxh]; n map M; n int pos[maxh]; n int Len[maxh]; n int Base[maxh]; n bool used[maxh]; n long long add(int x, int hash) { n int base = Base[hash]; n set::iterator it = S[base].lower_bound(item(pos[hash], hash)); n if (it == S[base].end()) { n it = S[base].begin(); n } n int nhash = it->hash; n M[x] = nhash; n S[base].erase(it); n long long res = pos[nhash] - pos[hash]; n if (res < 0) { n res += Len[base]; n } n return res; n } n void del(int x) { n int base = Base[M[x]]; n S[base].insert(item(pos[M[x]], M[x])); n } n int main() { n scanf( %d%d%d , &h, &m, &n); n for (int i = 0; i < h; ++i) { n if (used[i]) { n continue; n } n for (int j = i, p = 0; !used[j]; j += m, j %= h, ++p) { n S[i].insert(item(p, j)); n pos[j] = p; n Base[j] = i; n used[j] = 1; n } n Len[i] = (int)S[i].size(); n } n long long res = 0; n for (int i = 0; i < n; ++i) { n char op; n int id; n scanf( n%c %d , &op, &id); n if (op == + ) { n int hash; n scanf( %d , &hash); n res += add(id, hash); n } else { n del(id); n } n } n printf( %I64d n , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long const MAXN = 5e1 + 8; n long long const INF = 3e3 + 8; n long long const delta = 1000000007; n long long a[MAXN]; n long long dp[MAXN][MAXN][INF]; n double calc(long long t, long long n, long long b) { n double ans = t; n for (long long i = b + 1; i <= n; i++) ans /= (double)i; n for (long long i = 1; i <= n - b; i++) ans *= (double)i; n return ans; n } n int main() { n std::ios::sync_with_stdio(0); n ; n cin.tie(0); n cout.tie(0); n long long n; n cin >> n; n for (long long i = 1; i <= n; i++) cin >> a[i]; n long long p; n cin >> p; n cout.precision(10); n cout << fixed; n double ans = 0; n dp[0][0][0] = 1; n for (long long i = 1; i <= n; i++) { n for (long long j = 0; j <= n; j++) { n for (long long k = 0; k < INF; k++) { n dp[i][j][k] = dp[i - 1][j][k]; n if (j && k >= a[i]) dp[i][j][k] += dp[i - 1][j - 1][k - a[i]]; n } n } n } n for (long long i = 1; i <= p; i++) { n for (long long j = 1; j <= n; j++) ans += calc(dp[n][j][i], n, j); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5005; n const int K = 100005; n int n, m, k; n int t, p; n int l[N], c[N], x[K]; n int main() { n scanf( %d%d%d , &n, &m, &k); n x[0] = 0; n for (int i = 1; i <= k; ++i) { n scanf( %d%d%d , &t, &p, &x[i]); n if (t == 1) n l[--p] = i; n else n c[--p] = i; n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) printf( %d , x[max(l[i], c[j])]); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N, K; n long double ans, s; n int R[1000010], data[100010]; n int v[1000010], c[1000010]; n int STv[20][1000010], STc[20][1000010]; n int calcv(int l, int r) { n int delta = r - l + 1; n int t = log(delta) / log(2); n return max(STv[t][l], STv[t][r - (1 << t) + 1]); n } n int calcc(int l, int r) { n int delta = r - l + 1; n int t = log(delta) / log(2); n return min(STc[t][l], STc[t][r - (1 << t) + 1]); n } n int main() { n scanf( %d%d , &N, &K); n for (int i = 1; i <= N; i++) scanf( %d , &v[i]), v[i] *= 100; n for (int i = 1; i <= N; i++) scanf( %d , &c[i]); n for (int i = 1; i <= N; i++) STv[0][i] = v[i], STc[0][i] = c[i]; n for (int step = 1; step <= 19; step++) n for (int i = 1; i <= N; i++) { n STv[step][i] = STv[step - 1][i]; n STc[step][i] = STc[step - 1][i]; n int x = i + (1 << (step - 1)); n if (x <= N) { n STv[step][i] = max(STv[step][i], STv[step - 1][x]); n STc[step][i] = min(STc[step][i], STc[step - 1][x]); n } n } n R[0] = 1; n for (int l = 1; l <= N; l++) { n R[l] = R[l - 1]; n for (int r = max(R[l - 1], l); r <= N; r++) n if (calcv(l, r) <= calcc(l, r)) n R[l] = r; n else n break; n } n for (int l = 1; l <= N; l++) { n if (R[l] < N && min(calcv(l, R[l]), calcc(l, R[l])) < n min(calcv(l, R[l] + 1), calcc(l, R[l] + 1))) n R[l]++; n data[l] = min(calcv(l, R[l]), calcc(l, R[l])); n } n sort(data + 1, data + N + 1); n s = double(K) / (N - K + 1); n for (int l = 1; l + K - 1 <= N; l++) { n s = s / (N - l + 1) * (N - K - l + 2); n ans = ans + data[l] * s; n } n printf( %.15lf , double(ans)); n } n "} +{"func_code_string": "#include n int main() { n int i; n char a[1000]; n gets(a); n for (i = 0; i < strlen(a); i++) { n printf( %c , a[i]); n } n for (i = strlen(a) - 1; i >= 0; i--) { n printf( %c , a[i]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 42, K = 11; n int n, k, cnt, mark[N], nw[K]; n vector v[K], mask[K]; n void do_it(long long u, int x) { n for (int i = 0; i < nw[x] + 1; i++) { n int cnt = i + __builtin_popcountll(u & mask[x].back()); n v[x + 1].push_back((u & (1ll << n) - 1 - mask[x].back()) | mask[x][cnt]); n } n } n int main() { n cin >> n >> k; n for (int i = 0; i < k; i++) { n int x, u; n long long msk = 0; n mask[i].push_back(0); n cin >> x; n for (int j = 0; j < x; j++) { n cin >> u; n u--; n msk |= (1ll << u); n mask[i].push_back(msk); n if (!mark[u]) { n cnt++; n nw[i]++; n mark[u] = 1; n } n } n } n v[0].push_back(0); n for (int i = 0; i < k; i++) { n for (int j = 0; j < v[i].size(); j++) { n do_it(v[i][j], i); n } n } n if (n != cnt && n > 1) return cout << REJECTED << endl, 0; n for (int i = 0; i < v[k].size(); i++) { n int cnt = __builtin_popcountll(v[k][i]); n if ((1ll << cnt) - 1 != v[k][i]) return cout << REJECTED << endl, 0; n } n cout << ACCEPTED << endl; n } n "} +{"func_code_string": "#include n using namespace std; n long long PRIME = 1000000007; n long long n, m, k; n long long maxm = (long long)(-10e13); n long long a[100005][6]; n long long max_in_range[100005][6][20]; n long long ans[6]; n long long times(long long length) { n long long cnt = 0; n while (length >= 2) { n length /= 2; n cnt++; n } n return cnt; n } n void calculate(long long index, long long length) { n long long t = times(length); n for (long long d = 1; d <= m; d++) { n ans[d] = max(max_in_range[index][d][t], n max_in_range[index + length - (1 << t)][d][t]); n } n } n long long query(long long index, long long length) { n long long t = times(length); n long long sum = 0; n for (long long d = 1; d <= m; d++) { n sum += max(max_in_range[index][d][t], n max_in_range[index + length - (1 << t)][d][t]); n } n return sum; n } n long long search(long long index, long long startlength, long long endlength) { n if (startlength == endlength) { n return startlength; n } n if (endlength - startlength == 1) { n if (query(index, endlength) <= k) { n return endlength; n } n return startlength; n } n long long mid = (startlength + endlength) / 2; n long long val = query(index, mid); n if (val > k) { n return search(index, startlength, mid - 1); n } else { n return search(index, mid, endlength); n } n } n void solve() { n cin >> n >> m >> k; n for (long long i = 1; i <= n; i++) { n for (long long j = 1; j <= m; j++) { n cin >> a[i][j]; n } n } n long long maxallowed = 0; n for (long long p = 0; p < 20; p++) { n for (long long i = 1; i <= n; i++) { n long long sum = 0; n for (long long d = 1; d <= m; d++) { n if (p == 0) { n max_in_range[i][d][p] = a[i][d]; n } else if (i + (1 << p) - 1 > n) { n max_in_range[i][d][p] = (long long)(10e13); n } else { n max_in_range[i][d][p] = n max(max_in_range[i][d][p - 1], n max_in_range[i + (1 << (p - 1))][d][p - 1]); n } n sum += max_in_range[i][d][p]; n } n if (sum <= k) { n maxallowed = p; n } n } n } n for (long long i = 1; i <= n; i++) { n long long sum = 0; n for (long long d = 1; d <= m; d++) { n sum += max_in_range[i][d][maxallowed]; n } n if (sum > k) { n continue; n } else { n long long l = search(i, (1 << maxallowed), (1 << (maxallowed + 1)) - 1); n if (l >= maxm) { n calculate(i, l); n maxm = l; n } n } n } n for (long long d = 1; d <= m; d++) { n cout << ans[d] << ; n } n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int max(long long int a, long long int b) { n if (a >= b) n return a; n else n return b; n } n long long int min(long long int a, long long int b) { n if (a >= b) n return b; n else n return a; n } n long long int diff(long long int a, long long int b) { n if (a >= b) n return a - b; n else n return b - a; n } n long long int mod(long long int a) { n if (a >= 0) n return a; n else n return -a; n } n void pairsort(int a[], int b[], int n) { n pair pairt[n]; n for (int i = 0; i < n; i++) { n pairt[i].first = a[i]; n pairt[i].second = b[i]; n } n sort(pairt, pairt + n); n for (int i = 0; i < n; i++) { n a[i] = pairt[i].first; n b[i] = pairt[i].second; n } n } n int gcd(int a, int b) { n if (b == 0) return a; n return gcd(b, a % b); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n char c; n cin >> c; n string s1, s2; n char s[9] = { 6 , 7 , 8 , 9 , T , J , Q , K , A }; n cin >> s1 >> s2; n int ind1, ind2; n if (s1[1] == s2[1]) { n for (int i = 0; i < 9; i++) n if (s[i] == s1[0]) ind1 = i; n for (int i = 0; i < 9; i++) n if (s[i] == s2[0]) ind2 = i; n if (ind1 > ind2) n cout << YES ; n else n cout << NO ; n } else { n if (s1[1] == c) n cout << YES ; n else n cout << NO ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct p { n int x, y, z; n }; n int c[102][102][102] = {0}; n bool ck(int x, int y, int z) { n if (!c[x][y][z]) return false; n if (c[x - 1][y][z] && c[x + 1][y][z]) return true; n if (c[x][y - 1][z] && c[x][y + 1][z]) return true; n if (c[x][y][z - 1] && c[x][y][z + 1]) return true; n if (c[x - 1][y][z] && c[x][y + 1][z] && !c[x - 1][y + 1][z]) return true; n if (c[x - 1][y][z] && c[x][y][z + 1] && !c[x - 1][y][z + 1]) return true; n if (c[x][y - 1][z] && c[x + 1][y][z] && !c[x + 1][y - 1][z]) return true; n if (c[x][y - 1][z] && c[x][y][z + 1] && !c[x][y - 1][z + 1]) return true; n if (c[x][y][z - 1] && c[x + 1][y][z] && !c[x + 1][y][z - 1]) return true; n if (c[x][y][z - 1] && c[x][y + 1][z] && !c[x][y + 1][z - 1]) return true; n return false; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int n, m, k; n cin >> n >> m >> k; n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n string r; n cin >> r; n for (int l = 1; l <= k; ++l) c[i][j][l] = r[l - 1] == 1 ? 1 : 0; n } n } n int ans = 0; n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n for (int l = 1; l <= k; ++l) { n if (ck(i, j, l)) ans++; n } n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int BIT = (1 << 17), M = 110, N = 25; n int n, m, cnt[BIT], a[M]; n long long f[BIT][N], b[N], p[N], year; n void solve(int x) { n memset(f, 0, sizeof(f)); n f[0][0] = 1; n int maxb = (1 << n); n for (int i = 0; i < maxb; i++) { n for (int j = 0; j <= n; j++) { n int y = cnt[i] + 1; n if (b[y]) { n if ((a[b[y]] & i) != a[b[y]]) continue; n if ((1 << (b[y] - 1) & i) == (1 << b[y] - 1)) continue; n f[i | (1 << b[y] - 1)][j] += f[i][j]; n } else { n for (int k = 1; k <= n; k++) { n if (!(i & (1 << k - 1))) { n if ((a[k] & i) != a[k]) continue; n if (k == x) n f[i | (1 << k - 1)][y] += f[i][j]; n else n f[i | (1 << k - 1)][j] += f[i][j]; n } n } n } n } n } n } n int main() { n scanf( %d%lld%d , &n, &year, &m); n year -= 2000; n for (int i = 1; i < BIT; i++) cnt[i] = cnt[i ^ (i & (-i))] + 1; n for (int i = 1; i <= m; i++) { n int x, y; n scanf( %d%d , &x, &y); n a[y] |= (1 << x - 1); n } n for (int i = 1; i <= n; i++) { n solve(i); n long long sum = 0; n for (int j = 1; j <= n; j++) { n if (!b[j] && sum + f[(1 << n) - 1][j] >= year) { n b[j] = i; n p[i] = j; n year -= sum; n break; n } n sum += f[(1 << n) - 1][j]; n } n if (!p[i]) { n puts( The times have changed ); n return 0; n } n } n for (int i = 1; i <= n; i++) printf( %lld , p[i]); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n multiset all[40]; n long long s[40]; n int getpos(int x) { n int ret = 0; n while ((1 << ret) < x) ret++; n return ret; n } n void check() { n long long tot = 0LL; n int ret = 0; n for (int i = 0; i <= 31; i++) { n ret += all[i].size(); n ret -= (all[i].size() && *(all[i].begin()) > 2 * tot); n tot += s[i]; n } n cout << ret << n ; n } n int main() { n int q; n cin >> q; n while (q--) { n string op; n int x; n cin >> op >> x; n int id = getpos(x); n if (op == + ) { n s[id] += x; n all[id].insert(x); n } else { n s[id] -= x; n all[id].erase(all[id].find(x)); n } n check(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, c, r[200001], u, v, i, t, k; n vector graph[200001], ans; n bool dfs(long long x, long long p) { n long long s = 0; n for (auto i : graph[x]) n if (i != p) s += dfs(i, x); n if (r[x] && !s) ans.push_back(x); n return s + (long long)(r[x] && r[p]); n } n int main() { n cin >> n; n for (i = 0; i < n - 1; i++) { n cin >> u >> v >> t, graph[u].push_back(v), graph[v].push_back(u); n if (t == 2) r[u] = 1, r[v] = 1; n } n dfs(1, 0); n for (cout << ans.size() << endl, i = 0; i < ans.size(); i++) n cout << ans[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int n0 = 1003, m = 1e5, mod = 998244353; n int n, k, a[n0], dp[2][n0], b[n0]; n int calc(int gap) { n for (int i = 1; i <= n; i++) n b[i] = upper_bound(a + 1, a + n + 1, a[i] - gap) - a - 1; n memset(&dp, 0, sizeof(dp)); n for (int j = 0; j <= n; j++) dp[0][j] = 1; n for (int i = 1; i <= k; i++) { n dp[i & 1][0] = 0; n for (int j = 1; j <= n; j++) { n int &x = dp[i & 1][j]; n x = dp[i & 1][j - 1] + dp[(i - 1) & 1][b[j]]; n x = (x >= mod) ? (x - mod) : x; n } n } n return dp[k & 1][n]; n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0); n cin >> n >> k; n for (int i = 1; i <= n; i++) cin >> a[i]; n sort(a + 1, a + n + 1); n int res = 0; n for (int gap = 1; gap <= m / (k - 1); gap++) { n res += calc(gap); n if (res >= mod) res -= mod; n } n cout << res; n } n "} +{"func_code_string": "#include n using namespace std; n struct Room { n int length, width, height, total_length; n } room[500]; n struct Wallpaper { n int length, width, price; n } wallpaper[500]; n int main() { n int n, m, i, j, ans, tmp, price, ret; n cin >> n; n for (i = 0; i < n; ++i) { n cin >> room[i].length >> room[i].width >> room[i].height; n room[i].total_length = 2 * (room[i].length + room[i].width); n } n cin >> m; n for (i = 0; i < m; ++i) n cin >> wallpaper[i].length >> wallpaper[i].width >> wallpaper[i].price; n for (ret = i = 0; i < n; ++i) { n for (price = 500 * 500 * 500, ans = j = 0; j < m; ++j) { n tmp = wallpaper[j].length / room[i].height; n tmp *= wallpaper[j].width; n if (tmp == 0) continue; n ans = (room[i].total_length / tmp + n (room[i].total_length % tmp == 0 ? 0 : 1)) * n wallpaper[j].price; n price = min(price, ans); n } n ret += price; n } n cout << ret << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n if (n == 1) n cout << 1; n else if (abs(n - m) > abs(m - 1)) { n cout << m + 1; n } else { n cout << m - 1; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, a, b, diff; n cin >> n >> a >> b; n vector v; n long long int arr[n]; n for (long long int i = 0; i < n; i++) { n cin >> arr[i]; n v.push_back(arr[i]); n } n sort(v.begin(), v.end()); n diff = v[n - a] - v[b - 1]; n if (diff < 0) { n cout << 0 << endl; n } else { n cout << diff << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, q, k; n vector v[1000010]; n int lastans = 0, res[1000010]; n void dfs(int np, int fath, int val) { n res[np] = val; n for (auto &x : v[np]) { n if (x == fath) continue; n dfs(x, np, min(val, x)); n } n } n int main() { n scanf( %d%d , &n, &q); n for (int i = 1, ti, tj; i < n; i++) { n scanf( %d%d , &ti, &tj); n v[ti].push_back(tj); n v[tj].push_back(ti); n } n int a, b; n scanf( %d%d , &a, &b); n b = b % n + 1; n dfs(b, 0, b); n lastans = 0; n k = b; n for (int i = 2, ti, tj; i <= q; i++) { n scanf( %d%d , &ti, &tj); n tj = (tj + lastans) % n + 1; n if (ti == 1) n k = min(k, res[tj]); n else n printf( %d n , lastans = min(k, res[tj])); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[100]; n long long b[100]; n vector pos[101]; n int main() { n long long i, j, k, l, m, n, t; n scanf( %lld , &n); n scanf( %lld , &k); n for (i = 0; i < n; i++) { n scanf( %lld , &a[i]); n pos[a[i]].push_back(i); n } n long long sum = 0, count = 0; n long long flag = 0; n for (i = 1; i <= 100; i++) { n for (j = 0; j < pos[i].size(); j++) { n sum = sum + a[pos[i][j]]; n if (sum > k) { n flag = 1; n break; n } n b[count++] = pos[i][j]; n } n if (flag == 1) break; n } n cout << count << endl; n for (j = 0; j < count; j++) cout << b[j] + 1 << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dx[] = {0, 0, 1, -1, -1, -1, 1, 1}; n int dy[] = {1, -1, 0, 0, -1, 1, 1, -1}; n template n inline T biton(T n, T pos) { n return n | ((T)1 << pos); n } n template n inline T bitoff(T n, T pos) { n return n & ~((T)1 << pos); n } n template n inline T ison(T n, T pos) { n return (bool)(n & ((T)1 << pos)); n } n template n inline T gcd(T a, T b) { n while (b) { n a %= b; n swap(a, b); n } n return a; n } n template n string NumberToString(T Number) { n ostringstream second; n second << Number; n return second.str(); n } n inline int nxt() { n int aaa; n scanf( %d , &aaa); n return aaa; n } n inline long long int lxt() { n long long int aaa; n scanf( %lld , &aaa); n return aaa; n } n inline double dxt() { n double aaa; n scanf( %lf , &aaa); n return aaa; n } n template n inline T bigmod(T p, T e, T m) { n T ret = 1; n for (; e > 0; e >>= 1) { n if (e & 1) ret = (ret * p) % m; n p = (p * p) % m; n } n return (T)ret; n } n int ar[1000010]; n long long F(long long int limit, long long int a, long long int b) { n if (limit < a) return 1LL; n long long int sum = 1LL; n long long int x = 0; n while (true) { n if (x + a > limit) break; n long long int temp = (limit - x) / a; n sum += temp; n long long int r = (a * temp) + x; n if (r - b < 0) break; n temp = (r + b - 1) / b; n temp--; n sum += temp; n r -= temp * b; n x = r; n if (x % a == 0) break; n } n return sum; n } n long long int get(long long int st, long long int len) { n long long int sum = (len * len + len) / 2LL; n sum *= st; n return sum; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n long long n, a, b; n cin >> n >> a >> b; n long long limit = min(a + b - 2, n); n long long sum = 0; n for (long long i = 0; i <= limit; i++) { n sum += F(i, a, b); n } n limit++; n long long int gc = gcd(a, b); n while (limit <= n) { n if (limit % gc == 0) break; n sum += (limit / gc) + 1; n limit++; n } n long long int upperLimit = n; n while (upperLimit >= limit) { n sum += (upperLimit / gc) + 1; n if (upperLimit % gc == 0) break; n upperLimit--; n } n if (upperLimit > limit) { n long long int diff = (upperLimit - limit); n sum += diff; n diff /= gc; n long long int chunk = limit * diff + get(gc, diff - 1); n sum += chunk; n } n cout << sum << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, A[2005], DP[2005]; n inline int ok(int X) { n memset(DP, 0, sizeof(DP)); n int i, j; n long long l1, r1, l2, r2; n for (i = 1; i <= n; i++) DP[i] = i - 1; n for (i = 2; i <= n; i++) n if (abs(A[i] - A[i - 1]) <= X) n DP[i] = 0; n else n break; n for (i = 1; i <= n; i++) n for (j = i + 1; j <= n; j++) { n l1 = (long long)A[i] - (long long)X * (j - i - 1); n r1 = (long long)A[i] + (long long)X * (j - i - 1); n l2 = A[j] - X; n r2 = A[j] + X; n if (!(l2 > r1 || l1 > r2)) DP[j] = min(DP[j], DP[i] + j - i - 1); n } n for (i = 1; i <= n; i++) n if (DP[i] + n - i <= k) return 1; n return 0; n } n int cbin() { n int i, step = (1 << 30); n for (i = -1; step; step >>= 1) n if (!ok(i + step)) i += step; n return ++i; n } n int main() { n scanf( %d%d , &n, &k); n int i; n for (i = 1; i <= n; i++) scanf( %d , &A[i]); n printf( %d n , cbin()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N; n int A[100005]; n int G[100005]; n int m; n int main() { n scanf( %d , &N); n for (int i = 0; i < N; ++i) scanf( %d , &A[i]); n for (int i = 0; i < N; ++i) { n if (i < N / 2) { n if (A[i] - i >= 1) ++G[A[i] - i]; n } else { n if (A[i] - (N - i - 1) >= 1) ++G[A[i] - (N - i - 1)]; n } n } n m = 0; n for (int i = 0; i <= 1e5; ++i) n if (G[i] >= m) m = G[i]; n printf( %d , N - m); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int size = 1007; n const long long modulo = 1000000007; n const long long oo = 1e18; n const double EPS = 1e-13; n const double PI = acos(-1.0); n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int n, m; n cin >> n >> m; n vector > g(n); n vector cost(n), v(n); n for (int i = 0; i < n; i++) cin >> v[i]; n while (m--) { n int a, b; n cin >> a >> b; n --a; n --b; n cost[a] += v[b]; n cost[b] += v[a]; n g[a].push_back(b); n g[b].push_back(a); n } n vector was(n, false); n long long ans = 0; n for (int h = 0; h < n; h++) { n int ver = -1; n for (int i = 0; i < n; i++) n if (!was[i] && (ver < 0 || v[ver] < v[i])) ver = i; n was[ver] = true; n ans += cost[ver]; n for (int i = 0; i < g[ver].size(); i++) { n int to = g[ver][i]; n if (!was[to]) { n cost[ver] -= v[to]; n cost[to] -= v[ver]; n } n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int test, a, sum = 0, wait = 0, counter = 0; n priority_queue, greater > q; n queue qqq; n cin >> test; n int num = test; n while (test--) { n cin >> a; n sum += a; n q.push(a); n qqq.push(a); n } n while (!q.empty()) { n int serve = q.top(); n if (serve >= wait) n counter++; n else { n q.pop(); n continue; n } n wait += serve; n q.pop(); n } n cout << counter << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 3010; n const int M = 11; n const int INF = 1 << 30; n const double EPS = 1e-8; n const int MOD = 1000000007LL; n int n, tot[N]; n vector edge[N], edge2[N]; n int dfs(int u, int fa) { n int num = 0, sz; n sz = edge[u].size(); n for (int i = 0; i < sz; i++) { n int v = edge[u][i]; n if (v == fa) { n continue; n } n num += dfs(v, u); n } n sz = edge2[u].size(); n for (int i = 0; i < sz; i++) { n int v = edge2[u][i]; n if (v == fa) { n continue; n } n num += dfs(v, u) + 1; n } n return num; n } n void init() { n memset(tot, 0, sizeof(tot)); n for (int i = 0; i < n; i++) { n edge[i].clear(); n edge2[i].clear(); n } n for (int i = 1; i < n; i++) { n int u, v; n scanf( %d %d , &u, &v); n u--, v--; n edge[u].push_back(v); n edge2[v].push_back(u); n } n for (int u = 0; u < n; u++) { n int sz; n sz = edge[u].size(); n for (int i = 0; i < sz; i++) { n int v = edge[u][i]; n int num = dfs(v, u); n tot[u] += num; n } n sz = edge2[u].size(); n for (int i = 0; i < sz; i++) { n int v = edge2[u][i]; n int num = dfs(v, u) + 1; n tot[u] += num; n } n } n } n int dfs2(int u, int fa) { n int sz, ret = tot[u]; n sz = edge[u].size(); n for (int i = 0; i < sz; i++) { n int v = edge[u][i]; n if (v == fa) { n continue; n } n ret = min(ret, dfs2(v, u)); n } n sz = edge2[u].size(); n for (int i = 0; i < sz; i++) { n int v = edge2[u][i]; n if (v == fa) { n continue; n } n ret = min(ret, dfs2(v, u)); n } n return ret; n } n void solve() { n int ans = INF; n for (int i = 0; i < n; i++) { n ans = min(ans, tot[i]); n } n for (int i = 0; i < n; i++) { n vector p; n int sz; n sz = edge[i].size(); n for (int j = 0; j < sz; j++) { n int v = edge[i][j]; n p.push_back(dfs2(v, i)); n } n sz = edge2[i].size(); n for (int j = 0; j < sz; j++) { n int v = edge2[i][j]; n p.push_back(dfs2(v, i)); n } n if (p.size() <= 1) { n continue; n } n sort(p.begin(), p.end()); n int tmp = p[0] + p[1] - tot[i]; n ans = min(ans, tmp); n } n cout << ans << endl; n } n int main() { n while (cin >> n) { n init(); n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #define rep(i,a,b) for(int i = (a); i < b; ++i) n #define rrep(i,a,b) for(int i = (b); i --> (a);) n #define trav(x, v) for(auto &x : v) n #define all(v) (v).begin(),(v).end() n #define sz(v) (int)(v).size() n n bool que_big(int s, string x){ n cout << s+1 << << x << endl; n string res; n cin >> res; n return res == yes ; n } n n int main(){ n int n = 200, b = 200; n cin >> n >> b; n n vector ub(n, string(b, 1 )); n string lb(b, 0 ); n deque ko; n rep(i,0,n) ko.push_back(i); n string nxt = string(b, 1 ); n nxt[0] = 0 ; n while(true){ n int s = ko.front(); n if(ub[s] < lb){ n ko.pop_front(); n continue; n } n if(ub[s] == lb){ n cout << 0 << << lb << endl; n return 0; n } n if(que_big(s, nxt)){ n lb = nxt; n rrep(i,0,b){ n if(lb[i]== 0 ){ n lb[i] = 1 ; n nxt[i] = 1 ; n break; n } else { n lb[i] = 0 ; n } n } n } else { n ub[s] = nxt; n ko.pop_front(); n ko.push_back(s); n rep(i,0,b) if(nxt[i] > lb[i]){ n nxt[i] = 0 ; n break; n } n } n } n } n "} +{"func_code_string": "#include n inline long long read() { n long long x = 0, f = 1; n char c = getchar(); n for (; c > 9 || c < 0 ; c = getchar()) { n if (c == - ) f = -1; n } n for (; c >= 0 && c <= 9 ; c = getchar()) { n x = x * 10 + c - 0 ; n } n return x * f; n } n int dp[18][(1 << 18)][2][2]; n bool fan[200005]; n inline void work() { n int n = read(), k = read(); n for (int i = 1; i <= k; i++) { n int x = read(); n fan[x] = 1; n } n memset(dp, -0x3f, sizeof dp); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= (1 << n); j += (1 << i)) { n if (i == 1) { n dp[i][j][fan[j]][fan[j + 1]] = (fan[j] | fan[j + 1]); n dp[i][j][fan[j + 1]][fan[j]] = (fan[j] | fan[j + 1]); n } else { n for (int x1 = 0; x1 < 2; x1++) { n for (int x2 = 0; x2 < 2; x2++) { n for (int y1 = 0; y1 < 2; y1++) { n for (int y2 = 0; y2 < 2; y2++) { n int tmp = n dp[i - 1][j][x1][y1] + dp[i - 1][j + (1 << i - 1)][x2][y2]; n if (x1 | x2) tmp++; n if (y1 | y2) tmp++; n dp[i][j][x1][x2] = std::max(dp[i][j][x1][x2], tmp + (x2 | y1)); n dp[i][j][x1][x2] = std::max(dp[i][j][x1][x2], tmp + (x2 | y2)); n dp[i][j][x1][y1] = std::max(dp[i][j][x1][y1], tmp + (y1 | x2)); n dp[i][j][x1][y2] = std::max(dp[i][j][x1][y2], tmp + (y2 | x2)); n dp[i][j][x2][x1] = std::max(dp[i][j][x2][x1], tmp + (x1 | y1)); n dp[i][j][x2][x1] = std::max(dp[i][j][x2][x1], tmp + (x1 | y2)); n dp[i][j][x2][y1] = std::max(dp[i][j][x2][y1], tmp + (y1 | x1)); n dp[i][j][x2][y2] = std::max(dp[i][j][x2][y2], tmp + (y2 | x1)); n } n } n } n } n } n } n } n int ans = -0x3f3f3f3f; n ans = std::max(ans, dp[n][1][1][1] + 1); n ans = std::max(ans, dp[n][1][0][1] + 1); n ans = std::max(ans, dp[n][1][1][0] + 1); n ans = std::max(ans, dp[n][1][0][0]); n printf( %d n , ans); n } n int main() { n work(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int con = 0; n vector > v; n long long int t[5000][5001]; n vector > > ans(5001); n bool istrue[5001]; n vector a[5001]; n long long int dis[5001]; n int n; n int ppp = 0; n queue q; n void bfs(int src) { n q.push(src); n istrue[src] = true; n dis[src] = 0; n while (!q.empty()) { n int p = q.front(); n q.pop(); n ans[con].push_back({(dis[p] + 1) % 2, p}); n for (auto u : a[p]) { n if (!istrue[u]) { n dis[u] = dis[p] + 1; n if (dis[u] % 2) n v[con].second++; n else n v[con].first++; n istrue[u] = true; n q.push(u); n } else { n if (dis[u] % 2 == dis[p] % 2) { n cout << NO n << n ; n ppp = 1; n return; n } n } n } n } n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int tt = 1; n while (tt--) { n long long int m; n cin >> n >> m; n long long int n1, n2, n3; n cin >> n1 >> n2 >> n3; n for (int i = 0; i < m; i++) { n int x, y; n cin >> x >> y; n a[x].push_back(y); n a[y].push_back(x); n } n for (int i = 1; i <= n; i++) { n if (!istrue[i]) { n v.push_back({1, 0}); n bfs(i); n con++; n } n if (ppp == 1) return 0; n } n memset(t, -1, sizeof(t)); n if (v[0].first <= n2) t[0][v[0].first] = 0; n if (v[0].second <= n2) t[0][v[0].second] = 0; n for (int i = 1; i <= (long long int)v.size() - 1; i++) { n for (int j = 0; j < n2 + 1; j++) { n long long int vv = j - v[i].first; n if (vv >= 0 && t[i - 1][vv] != -1) t[i][j] = vv; n vv = j - v[i].second; n if (vv >= 0 && t[i - 1][vv] != -1) t[i][j] = vv; n } n } n char ss[n + 1]; n if (t[(long long int)v.size() - 1][n2] == -1) n cout << NO n << n ; n else { n cout << YES n << n ; n long long int i = (long long int)v.size() - 1, ind = n2; n while (i != -1) { n long long int pp = ind - t[i][ind], kk = 0; n if (v[i].first == pp) kk = 1; n for (auto u : ans[i]) { n if (u.first == kk) n ss[u.second] = 2 ; n else n ss[u.second] = 1 ; n } n ind = t[i][ind]; n i--; n } n for (int j = 1; j <= n; j++) { n if (ss[j] == 1 ) { n if (n1 == 0) n ss[j] = 3 ; n else n n1--; n } n cout << ss[j]; n } n cout << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int n, m; n cin >> n >> m; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n int k; n cin >> k; n if (k % 2 != (i + j) % 2) k++; n cout << k << ; n } n cout << endl; n } n } n int main() { n int n; n cin >> n; n while (n--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MXN = 5e4 + 5; n const int INF = 1e9; n const long long P = 29; n const long long MOD = 1e9 + 7; n int t; n int main() { n srand(time(0)); n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cout << fixed << setprecision(10); n cin >> t; n while (t--) { n int n, x1, x2, x3; n cin >> n; n cin >> x1 >> x2; n for (int i = 2; i < n; i++) { n cin >> x3; n } n if (x1 + x2 <= x3) n cout << 1 << << 2 << << n << n ; n else n cout << -1 << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int read() { n int x = 0, flag = 1; n char c = getchar(); n while ((c > 9 || c < 0 ) && c != - ) c = getchar(); n if (c == - ) flag = 0, c = getchar(); n while (c <= 9 && c >= 0 ) { n x = (x << 3) + (x << 1) + c - 0 ; n c = getchar(); n } n return flag ? x : -x; n } n const int maxn = 2005; n int f[maxn][maxn]; n char s[maxn][maxn]; n int main() { n int n = read(), m = read(); n for (int i = (1); i <= (int)(n); i++) scanf( %s , s[i] + 1); n for (int i = (1); i <= (int)(2); i++) n for (int j = (1); j <= (int)(m); j++) f[i][j] = 1; n for (int i = (3); i <= (int)(n); i++) n for (int j = (1); j <= (int)(m); j++) { n if (j == 1 || j == m) { n f[i][j] = 1; n continue; n } n if (s[i][j] != s[i - 1][j - 1] || s[i][j] != s[i - 1][j] || n s[i][j] != s[i - 1][j + 1] || s[i][j] != s[i - 2][j]) { n f[i][j] = 1; n continue; n } n int x = 100000; n x = min(x, f[i - 1][j - 1]); n x = min(x, f[i - 1][j]); n x = min(x, f[i - 1][j + 1]); n x = min(x, f[i - 2][j]); n f[i][j] = x + 1; n } n long long ans = 0; n for (int i = (1); i <= (int)(n); i++) n for (int j = (1); j <= (int)(m); j++) ans += f[i][j]; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream& operator<<(ostream& out, pair const& p) { n out << ( << p.first << , << p.second << ) ; n return out; n } n template n ostream& operator<<(ostream& out, vector const& v) { n long long l = v.size(); n for (long long i = 0; i < l - 1; i++) out << v[i] << ; n if (l > 0) out << v[l - 1]; n return out; n } n template n void trace(const char* name, T&& arg1) { n cout << name << : << arg1 << n ; n } n template n void trace(const char* names, T&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n cout.write(names, comma - names) << : << arg1 << | ; n trace(comma + 1, args...); n } n const long long N = 3e5 + 100; n long long MOD; n long long power(long long x, long long t) { n long long ans = 1; n while (t > 0) { n if (t & 1) ans = 1LL * ans * x % MOD; n x = 1LL * x * x % MOD; n t >>= 1; n } n return ans; n } n inline long long sub(long long a, long long b) { n a %= MOD; n b %= MOD; n a = ((a - b) % MOD + MOD) % MOD; n return a; n } n inline long long add(long long a, long long b) { n a %= MOD; n b %= MOD; n a = (a + b) % MOD; n return a; n } n inline long long mul(long long a, long long b) { n a %= MOD; n b %= MOD; n a = (a * b) % MOD; n return a; n } n inline long long inv(long long a) { n a = a % MOD; n a = power(a, MOD - 2); n return a; n } n long long a[N], n, k; n map cnt; n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cin >> n >> MOD >> k; n for (long long i = 1; i <= n; i++) { n long long temp; n cin >> temp; n long long kk = power(temp, 4); n long long k2 = mul(k, temp); n kk = sub(kk, k2); n cnt[kk]++; n } n long long ans = 0; n auto c2 = [](long long a) -> long long { return ((a * (a - 1)) / 2); }; n for (auto i : cnt) { n ans += c2(i.second); n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 200000 + 10; n const long long INF = 2e9 + 10; n long long dic[N], idx[N]; n int main() { n long long n, k, ii; n scanf( %lld%lld , &n, &k); n for (long long i = 0; i <= n; ++i) scanf( %lld , idx + i), dic[i] = idx[i]; n for (long long i = 1; i <= n + 1; ++i) n dic[i] += dic[i - 1] / 2, dic[i - 1] %= 2; n for (long long i = 0; i <= n + 1; ++i) { n if (dic[i]) { n ii = i; n break; n } n } n long long x = 0, ans = 0; n for (long long i = n + 1; i >= 0; --i) { n x = x * 2 + dic[i]; n if (abs(x) > INF) break; n if (i > ii || i == n + 1 || (i == n && x == idx[i])) continue; n if (abs(x - idx[i]) <= k) ++ans; n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool sortmahstyle(const pair &a, const pair &b) { n if (a.first < b.first) return true; n return false; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int n, m; n cin >> n >> m; n long long int hash[n + 1], col[4]; n memset(hash, 0, sizeof(hash)); n while (m--) { n memset(col, 0, sizeof(col)); n long long int inp[3]; n for (long long int i = 0; i < 3; i++) { n cin >> inp[i]; n col[hash[inp[i]]] = 1; n } n for (long long int i = 0; i < 3; i++) { n long long int x = inp[i]; n if (hash[x] == 0) { n for (long long int j = 1; j < 4; j++) { n if (col[j] == 0) { n hash[x] = j; n col[hash[x]] = 1; n break; n } n } n } else { n col[hash[x]] = 1; n } n } n } n for (long long int i = 1; i < n + 1; i++) cout << hash[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n vector a(n), b(n); n set s; n for (int i = 0; i < n; i++) { n cin >> a[i]; n s.insert(a[i]); n } n for (int i = 0; i < n; i++) { n cin >> b[i]; n s.insert(b[i]); n } n long long int count = 0; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n long long int temp = a[i] ^ b[j]; n if (s.find(temp) != s.end()) count++; n } n } n if (count % 2 != 0) n cout << Koyomi << endl; n else n cout << Karen << endl; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[100010]; n int main() { n long long n, pos; n while (cin >> n >> pos) { n for (long long i = 0; i < n; i++) scanf( %I64d , &a[i]); n sort(a, a + n); n long long res1 = 0, res2, res; n if (pos < a[0]) n res1 = a[n - 2] - pos; n else if (a[0] <= pos && pos <= a[n - 2]) n res1 = min((pos - a[0]) * 2 + a[n - 2] - pos, n (a[n - 2] - pos) * 2 + pos - a[0]); n else if (pos > a[n - 2]) n res1 = pos - a[0]; n if (pos < a[1]) n res2 = a[n - 1] - pos; n else if (a[1] <= pos && pos <= a[n - 1]) n res2 = min((pos - a[1]) * 2 + a[n - 1] - pos, n (a[n - 1] - pos) * 2 + pos - a[1]); n else if (pos > a[n - 1]) n res2 = pos - a[1]; n res = min(res1, res2); n if (n == 1) res = 0; n printf( %I64d n , res); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n const int M = 310; n int n, m, s, e0, E; n pair dp[N][M]; n int a[N]; n vector elAtB[N]; n inline int findj(int j0, int val) { n if (j0 >= m) return -1; n vector &v = elAtB[val]; n if (v.size() == 0) return -1; n vector::iterator it = lower_bound(v.begin(), v.end(), j0); n if (it == v.end()) n return -1; n else n return *it; n } n int main() { n cin >> n >> m >> s >> e0; n E = s / e0; n int ost = s - E * e0; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n for (int j = 0; j < m; j++) { n int x; n cin >> x; n elAtB[x].push_back(j); n } n int ans = 0; n for (int i = 0; i <= n; i++) { n for (int e = 0; e <= E; e++) { n dp[i][e] = make_pair(0, 0); n } n } n for (int i = 0; i < n; i++) { n for (int e = 1; e <= E; e++) { n int dol = dp[i][e].first; n int j0 = dp[i][e].second; n int dolnxt = dp[i + 1][e].first; n if (dol > dolnxt) { n dp[i + 1][e] = make_pair(dol, j0); n } n int j = findj(j0, a[i]); n if (j == -1) n continue; n else { n } n dolnxt = dp[i + 1][e - 1].first; n int jnxt = dp[i + 1][e - 1].second; n if (((dol + 1 > dolnxt) || (dol + 1 == dolnxt && j < jnxt)) && n ((i + 1 + j + 1) <= (e - 1) * e0 + ost)) { n dp[i + 1][e - 1] = make_pair(dol + 1, j + 1); n ans = max(ans, dol + 1); n } n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n int main() { n int i, j, k, n; n scanf( %d , &n); n k = sqrt(n); n for (i = k; i >= 1; i--) { n if (n % i == 0) { n j = i; n break; n } n } n printf( %d %d , j, (n / j)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 100005; n long long n, d, b; n long long a[maxn]; n bool f(long long x) { n long long l = 1 + x; n long long r = n - x; n deque> dq; n for (long long i = 1; i <= n; i++) n if (a[i] != 0) dq.push_front({i, a[i]}); n long long t = 1 + x; n while (l <= r) { n long long left = b; n while (left > 0) { n if (dq.empty()) return false; n pair p = dq.back(); n dq.pop_back(); n long long amt = min(p.second, left); n if (p.first - l > t * d) return false; n p.second -= amt; n left -= amt; n if (p.second > 0) dq.push_back(p); n } n l++; n if (l <= r) { n long long right = b; n while (right > 0) { n if (dq.empty()) return false; n pair p = dq.front(); n dq.pop_front(); n long long amt = min(p.second, right); n if (r - p.first > t * d) return false; n p.second -= amt; n right -= amt; n if (p.second > 0) dq.push_front(p); n } n r--; n } n t++; n } n return true; n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> n >> d >> b; n for (long long i = 1; i <= n; i++) cin >> a[i]; n long long l = 0; n long long r = n; n while (r - l > 3) { n long long mid = (r - l) / 2 + l; n if (f(mid)) n r = mid; n else n l = mid; n } n for (long long i = l; i <= r; i++) { n if (f(i)) { n cout << i << n ; n break; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n #pragma GCC optimize( O3 ) n #pragma GCC target( avx ) n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( unroll-loops ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n const int MOD = 1000000007; n const int INF = 1000000009; n const int MAXN = 1000005; n vector split(const string& s, char c) { n vector v; n stringstream ss(s); n string x; n while (getline(ss, x, c)) v.emplace_back(x); n return move(v); n } n template n inline string arrStr(T arr, int n) { n stringstream s; n s << [ ; n for (int i = 0; i < n - 1; i++) s << arr[i] << , ; n s << arr[n - 1] << ] ; n return s.str(); n } n bool is_prime(long long n) { n if (n < 2) return false; n for (long long x = 2; x * x <= n; x++) { n if (n % x == 0) return false; n } n return true; n } n vector get_prime_factors(long long n) { n vector f; n for (long long x = 2; x * x <= n; x++) { n while (n % x == 0) { n f.push_back(x); n n /= x; n } n } n if (n > 1) f.push_back(n); n return f; n } n long long fpow(long long x, long long n) { n long long res = 1; n while (n) { n if (n & 1) { n res = (1LL * res * x) % MOD; n } n x = (1LL * x * x) % MOD; n n >>= 1; n } n return (res % MOD); n } n vector fac, inv; n void create_fac(long long n = MAXN) { n fac.resize(n + 5); n inv.resize(n + 5); n fac[0] = 1; n inv[0] = fpow(fac[0], MOD - 2); n for (long long i = 1; i <= n; i++) { n fac[i] = (fac[i - 1] % MOD * i % MOD) % MOD; n inv[i] = fpow(fac[i], MOD - 2); n } n } n long long binomial_coefficient(long long n, long long r) { n long long res = 1; n res = (res * (fac[n] % MOD)) % MOD; n res = (res * (inv[r] % MOD)) % MOD; n res = (res * (inv[n - r] % MOD)) % MOD; n return res; n } n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); } n long long sceil(long long a, long long b) { return (a + b - 1) / b; } n vector lp; n vector pr; n void sieve(long long n = MAXN) { n lp.resize(n + 1); n pr.clear(); n for (long long i = 2; i <= n; ++i) { n if (lp[i] == 0) { n lp[i] = i; n pr.push_back(i); n } n for (long long j = 0; n j < (long long)pr.size() && pr[j] <= lp[i] && i * pr[j] <= n; ++j) n lp[i * pr[j]] = pr[j]; n } n } n long long extended_euclidean(long long a, long long b, long long& x, n long long& y) { n if (b == 0) { n x = 1; n y = 0; n return a; n } n long long x1, y1; n long long d = extended_euclidean(b, a % b, x1, y1); n x = y1; n y = x1 - y1 * (a / b); n return d; n } n int mod_inv(long long a, long long m) { n long long x, y; n long long g = extended_euclidean(a, m, x, y); n if (g != 1) { n return -1; n } else { n x = (x % m + m) % m; n return x; n } n } n long long solution() { n long long n, k; n cin >> n >> k; n string s; n cin >> s; n long long ans = 0; n if (k <= n) ans = k; n vector f(26, 0); n for (auto c : s) { n f[c - a ]++; n } n long long MX = *max_element(f.begin(), f.end()); n vector v(MX, 0); n for (int times = MX; times > 0; times--) { n for (int i = 0; i < 26; i++) { n v[times - 1] += f[i] / times; n } n } n reverse(v.begin(), v.end()); n 42; n for (long long i = 1; i <= k && i <= n; i++) { n if (k % i == 0) { n long long times = MX - (lower_bound(v.begin(), v.end(), i) - v.begin()); n 42; n 42; n ans = max(ans, times * i); n } n } n return ans; n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n int tt = 1; n cin >> tt; n while (tt--) { n cout << solution() << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int iinf = 1e9 + 10; n const long long inf = 1ll << 60; n const long long mod = 1e9 + 7; n void GG() { n cout << 0 n ; n exit(0); n } n long long mpow(long long a, long long n, long long mo = mod) { n long long re = 1; n while (n > 0) { n if (n & 1) re = re * a % mo; n a = a * a % mo; n n >>= 1; n } n return re; n } n long long inv(long long b, long long mo = mod) { n if (b == 1) return b; n return (mo - mo / b) * inv(mo % b, mo) % mo; n } n const int maxn = 1e6 + 5; n long long dp[2003][22]; n long long fac[200006], ifac[200006]; n inline long long CC(int a, int b) { n a = a + b; n return fac[a] * ifac[b] % mod * ifac[a - b] % mod; n } n int R[2003], C[2003]; n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n ; n fac[0] = ifac[0] = 1; n for (int i = 1; i <= 200006; ++i) { n fac[i] = fac[i - 1] * i % mod; n ifac[i] = inv(fac[i]); n } n int n, m, k, second; n cin >> n >> m >> k >> second; n vector > v; n v.push_back({1, 1}); n v.push_back({n, m}); n for (int i = 0; i < k; ++i) { n int r, c; n cin >> r >> c; n v.push_back({r, c}); n } n sort(v.begin(), v.end()); n for (int i = 1; i <= (int)v.size() - 1; ++i) { n R[i] = v[i].first, C[i] = v[i].second; n dp[i][0] = CC(R[i] - 1, C[i] - 1); n for (int fk = 0; fk < 21; ++fk) { n for (int j = 1; j <= i - 1; ++j) { n if (R[j] <= R[i] && C[j] <= C[i]) { n dp[i][fk] -= dp[j][fk] * CC(R[i] - R[j], C[i] - C[j]) % mod; n if (dp[i][fk] < 0) dp[i][fk] += mod; n dp[i][fk + 1] += dp[j][fk] * CC(R[i] - R[j], C[i] - C[j]) % mod; n if (dp[i][fk + 1] >= mod) dp[i][fk + 1] -= mod; n } n } n } n } n long long re = 0; n for (int fk = 0; fk < 22; ++fk) { n re += dp[(int)v.size() - 1][fk] * second % mod; n second = (second + 1) / 2; n } n cout << re * inv(CC(n - 1, m - 1)) % mod << n ; n } n "} +{"func_code_string": "#include n using namespace std; n struct lem { n long long m; n long long v; n int id; n bool operator<(const lem& other) const { n if (m > other.m) return true; n if (m < other.m) return false; n if (v > other.v) return true; n if (v < other.v) return false; n return id > other.id; n } n }; n int N, K, H; n lem L[100010]; n int asst[100010]; n int tempa[100010]; n bool solve(long double t) { n memset(tempa, 0, sizeof(tempa)); n int start = 0; n for (int k = K; k >= 1; k--) { n bool found = false; n for (int i = (start); i <= (N - 1); i++) { n long double time = n ((long double)k) / ((long double)L[i].v) * ((long double)H); n if (time <= t) { n found = true; n tempa[k] = i; n start = i + 1; n break; n } n } n if (!found) return false; n } n return true; n } n int main() { n cin >> N >> K >> H; n for (int i = 0; i < N; i++) cin >> L[i].m; n for (int i = 0; i < N; i++) cin >> L[i].v; n for (int i = 0; i < N; i++) L[i].id = i + 1; n sort(L, L + N); n long double low = 0.l; n long double high = 1000000000.l; n int times = 100; n while (times--) { n long double t = (low + high) / 2.l; n if (solve(t)) { n for (int i = (1); i <= (K); i++) asst[i] = tempa[i]; n high = t; n } else { n low = t; n } n } n for (int k = (1); k <= (K); k++) { n if (k > 1) cout << ; n cout << L[asst[k]].id; n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 20; n const int inf = 1e9; n int dp[maxn][maxn][maxn]; n int vis[maxn][maxn][maxn]; n int path[maxn][maxn][maxn]; n int n, a, b; n int h[maxn]; n int dfs(int i, int cur, int pre) { n cur = cur < 0 ? 0 : cur; n pre = pre < 0 ? 0 : pre; n if (i == n) { n if (cur == 0) n return 0; n else n return inf; n } n if (vis[i][cur][pre]) return dp[i][cur][pre]; n vis[i][cur][pre] = 1; n int &ans = dp[i][cur][pre]; n ans = inf; n int lb = (pre + b - 1) / b, n hb = max(lb, max((cur + a - 1) / a, (h[i + 1] + b) / b)); n int p; n for (int j = lb; j <= hb; j++) { n int tmp = j + dfs(i + 1, h[i + 1] + 1 - j * b, cur - j * a); n if (ans > tmp) { n ans = tmp; n path[i][cur][pre] = j; n } n } n return ans; n } n void print(int i, int cur, int pre) { n cur = cur < 0 ? 0 : cur; n pre = pre < 0 ? 0 : pre; n if (i == n) return; n int tmp = path[i][cur][pre], cnt = tmp; n while (cnt--) printf( %d , i); n print(i + 1, h[i + 1] + 1 - tmp * b, cur - tmp * a); n } n int main() { n cin >> n >> a >> b; n for (int i = 1; i <= n; i++) cin >> h[i]; n memset(vis, 0, sizeof(vis)); n int ans = dfs(2, h[2] + 1, h[1] + 1); n cout << ans << n ; n print(2, h[2] + 1, h[1] + 1); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s, s1, s2, s3; n int sa[300010][20], lcp[300010], rnk[300010], root[300010], cnt[300010][4], n col[300010], n; n pair, int> q[300010]; n pair > lcp_pair[300010]; n vector ansvec; n long long ans, mod = 1e9 + 7; n int get(int x) { return root[x] = (x == root[x] ? x : get(root[x])); } n void merge(int x, int y) { n root[y] = x; n ans -= (1LL * cnt[y][1] * cnt[y][2] * cnt[y][3]) % mod + n (1LL * cnt[x][1] * cnt[x][2] * cnt[x][3]) % mod; n while (ans < 0) ans += mod; n for (int i = 1; i <= 3; ++i) cnt[x][i] += cnt[y][i]; n ans = (ans + 1LL * cnt[x][1] * cnt[x][2] * cnt[x][3]) % mod; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> s1 >> s2 >> s3; n n = min(s1.size(), min(s2.size(), s3.size())); n s = s1 + 1 + s2 + 2 + s3; n for (int i = 0; i < s1.size(); ++i) col[i] = 1; n for (int i = s1.size() + 1; i < s1.size() + 1 + s2.size(); ++i) col[i] = 2; n for (int i = s.size() - s3.size(); i < s.size(); ++i) col[i] = 3; n for (int i = 0; i < s.size(); ++i) sa[i][0] = s[i]; n for (int i = 1; i < 20; ++i) { n for (int j = 0; j < s.size(); ++j) n if (j + (1 << i - 1) < s.size()) n q[j] = n make_pair(make_pair(sa[j][i - 1], sa[j + (1 << i - 1)][i - 1]), j); n else n q[j] = make_pair(make_pair(sa[j][i - 1], -1), j); n sort(q, q + s.size()); n int cnt = 0; n for (int j = 0; j < s.size(); ++j) { n if (j && q[j].first != q[j - 1].first) ++cnt; n sa[q[j].second][i] = cnt; n } n } n for (int i = 0; i < s.size(); ++i) { n rnk[sa[i][19]] = i; n root[i] = i; n cnt[i][col[i]] = 1; n } n int cnt = 0, index, ii = 0; n for (int i = 0; i < s.size(); ++i) { n index = sa[i][19]; n if (index == s.size() - 1) { n cnt = 0; n continue; n } n while (i + cnt < s.size() && rnk[index + 1] + cnt < s.size() && n s[i + cnt] == s[rnk[index + 1] + cnt]) n ++cnt; n lcp[i] = cnt; n lcp_pair[ii] = make_pair(lcp[i], make_pair(i, rnk[index + 1])); n if (cnt) --cnt; n ++ii; n } n sort(lcp_pair, lcp_pair + s.size() - 1); n reverse(lcp_pair, lcp_pair + s.size() - 1); n for (int i = n, j = 0; i >= 1; --i) { n int x, y; n while (j < s.size() - 1 && lcp_pair[j].first >= i) { n x = get(lcp_pair[j].second.first); n y = get(lcp_pair[j].second.second); n merge(x, y); n ++j; n } n ansvec.push_back(ans); n } n for (int i = ansvec.size() - 1; i >= 0; --i) cout << ansvec[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n vector v; n string s; n const int N = 1000001; n int n; n long long d, arr[N]; n unsigned long long gcd(long long x, long long y) { n if (y == 0) { n return x; n } n return gcd(y, x % y); n } n void gen(long long ind, string t) { n if (ind == s.size()) { n if (t.size() == 3) v.push_back(t); n return; n } n gen(ind + 1, t + s[ind]); n gen(ind + 1, t); n } n long long check() { n long long res = 0; n for (long long i = 0; i < v.size(); ++i) { n if (((v[i][v[i].size() - 1] - 0 ) - (v[i][0] - 0 )) <= d) { n res++; n } n } n return res; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int n, l, r; n bool lie = 0; n cin >> n >> l >> r; n int v[n], s[n]; n for (int i = 1; i <= n; ++i) { n cin >> v[i]; n } n for (int i = 1; i <= n; ++i) { n cin >> s[i]; n } n for (int i = 1; i < l; ++i) { n if (v[i] != s[i]) { n lie = 1; n break; n } n } n if (!lie) { n for (int i = r + 1; i <= n; ++i) { n if (v[i] != s[i]) { n lie = 1; n break; n } n } n } n if (lie) { n cout << LIE n ; n } else { n cout << TRUTH n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1 + 9e6; n const int inf = 0x3f3f3f; n vector dp[24]; n int n; n int a[23]; n vector > pre[23]; n int ans; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(); n cout.tie(); n cin >> n; n for (int i = 0; i < n; ++i) { n cin >> a[i]; n } n for (int i = 0; i < 24; i++) dp[i].resize(1 << n); n for (int i = 1; i < n; ++i) { n for (int j = 0; j < i; ++j) { n for (int k = j; k < i; ++k) { n if (a[j] + a[k] == a[i]) { n pre[i].push_back({j, k}); n } n } n } n } n dp[0][0] = 0; n dp[0][1] = 1; n for (int i = 0; i < n - 1; ++i) { n for (int mask = 0; mask < (1 << n); ++mask) { n if (dp[i][mask]) { n for (int j = 0; j < pre[i + 1].size(); ++j) { n int u = pre[i + 1][j].first; n int v = pre[i + 1][j].second; n if (((mask >> u) & 1) && ((mask >> v) & 1)) { n int bit = mask + (1 << (i + 1)); n dp[i + 1][bit] = 1; n for (int k = 0; k < i + 1; ++k) { n if (((bit >> k) & 1)) { n dp[i + 1][bit ^ (1 << k)] = 1; n } n } n } n } n } n } n } n ans = inf; n for (int mask = 0; mask < (1 << n); ++mask) { n if (dp[n - 1][mask]) { n ans = min(ans, (int)(__builtin_popcount(mask))); n } n } n if (ans == inf) n cout << -1; n else n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string onezero(int n) { n string s = 1 ; n for (int i = 1; i < n; ++i) { n s += 0 ; n } n return s; n } n string findSum(string str1, string str2) { n if (str1.length() > str2.length()) swap(str1, str2); n string str = ; n int n1 = str1.length(), n2 = str2.length(); n reverse(str1.begin(), str1.end()); n reverse(str2.begin(), str2.end()); n int carry = 0; n for (int i = 0; i < n1; i++) { n int sum = ((str1[i] - 0 ) + (str2[i] - 0 ) + carry); n str.push_back(sum % 10 + 0 ); n carry = sum / 10; n } n for (int i = n1; i < n2; i++) { n int sum = ((str2[i] - 0 ) + carry); n str.push_back(sum % 10 + 0 ); n carry = sum / 10; n } n if (carry) str.push_back(carry + 0 ); n reverse(str.begin(), str.end()); n return str; n } n int main() { n ios_base::sync_with_stdio(NULL); n cin.tie(NULL); n cout.tie(NULL); n int l; n string s, ans; n cin >> l >> s; n if (s.size() % l != 0) { n string zero = onezero(l); n for (int i = 0; i < s.size() / l + 1; ++i) { n ans += zero; n } n } else { n string temp = s.substr(0, l); n for (int i = 0; i < s.size() / l; ++i) { n ans += temp; n } n if (ans <= s) { n ans = ; n temp = findSum(temp, 1 ); n if (temp.size() != l) { n temp = onezero(l); n ans = onezero(l); n } n for (int i = 0; i < s.size() / l; ++i) { n ans += temp; n } n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int N = 1e5 + 1; n long long int n, m, i, j, l, k, x, y, a, b, cnt[3], sum[3]; n void solve() { n string s; n cin >> s; n long long int n = s.length(); n long long int lst = 0, maxi = -1; n long long int val = 0; n for (long long int i = 0; i < n; i++) { n if (s[i] == L ) { n val++; n } else { n maxi = max(maxi, val); n val = 0; n } n } n maxi = max(maxi, val); n cout << maxi + 1 << n ; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long int t; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int a[1010], d[1010]; n int main() { n int n; n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n d[a[i]]++; n } n int mx = 0, mxi = 0; n for (int i = 1; i <= n; i++) { n if (d[a[i]] > mx) mx = d[a[i]]; n if (d[a[i]] != 0) { n mxi++; n d[a[i]] = 0; n } n } n cout << mx << << mxi; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n long long answer = 0; n for (int i = s.length() - 1; i > 0; i--) { n string temp = s.substr(i - 1, 2); n if (stoi(temp) % 4 == 0) { n answer += i; n } n } n for (int i = 0; i < s.length(); i++) { n if (stoi(s.substr(i, 1)) % 4 == 0) { n answer++; n } n } n cout << answer; n } n "} +{"func_code_string": "#include n using namespace std; n int c[1005]; n int a[12] = {0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292}; n int main() { n long long n; n while (cin >> n) { n if (n <= 11) { n cout << a[n] << endl; n } else { n long long m; n m = a[11] + (n - 11) * 49; n cout << m << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int ret = 0, flag = 1; n char c = getchar(); n while (c < 0 || c > 9 ) { n if (c == - ) flag = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) ret = ret * 10 + (c ^ 0 ), c = getchar(); n return flag * ret; n } n struct use { n int x, dis; n }; n const int N = 5e3 + 5; n int T, n, d; n vector edge[N]; n int dad[N]; n int build(int x, int dis) { n int sum = 0; n if ((x << 1) <= n) { n edge[x].push_back(x << 1); n sum += dis + 1; n sum += build(x << 1, dis + 1); n } n if ((x << 1 | 1) <= n) { n edge[x].push_back(x << 1 | 1); n sum += dis + 1; n sum += build(x << 1 | 1, dis + 1); n } n return sum; n } n void bfs() { n queue q; n q.push({1, 0}); n int now = 0; n vector p1, p2; n while (q.empty() == 0) { n int x = q.front().x, dis = q.front().dis; n q.pop(); n if (now != dis) { n now = dis, p1.clear(), p2.clear(); n } n for (auto it = edge[x].begin(); it != edge[x].end(); it++) { n int y = *it; n if (edge[y].size() == 0) { n p1.push_back(y); n if (p2.size()) { n edge[p2[0]].push_back(y); n edge[x].erase(it); n return; n } n } n if (edge[y].size() != 2) p2.push_back(y); n q.push({y, dis + 1}); n } n } n } n int main() { n T = read(); n while (T--) { n n = read(), d = read(); n for (int i = 1; i <= n; i++) edge[i].clear(); n int mn = build(1, 0); n int mx = (n - 1) * n / 2; n if (!(mn <= d && d <= mx)) { n printf( NO n ); n continue; n } n int now = mn; n while (now < d) { n bfs(); n now++; n } n for (int i = 1; i <= n; i++) { n for (int j = 0; j < edge[i].size(); j++) dad[edge[i][j]] = i; n } n printf( YES n ); n for (int i = 2; i <= n; i++) printf( %d , dad[i]); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n double ans, m; n int n; n double binpow(double a, int b) { n if (b == 0) n return 1; n else if (b == 1) n return a; n else if (b % 2 == 0) { n double t = binpow(a, b / 2); n return t * t; n } else n return a * binpow(a, b - 1); n } n int main() { n cin >> m >> n; n for (double i = 1; i <= m; i++) { n ans += i * binpow(i / m, n) * (1 - binpow((i - 1) / i, n)); n } n cout << fixed << setprecision(15) << ans; n } n "} +{"func_code_string": "#include n int main() { n int i; n for (i = 0; i < 10; i++) { n printf( ??%d>>%d?? n , i, i); n } n printf( ??>>? n ); n for (i = 0; i < 9; i++) { n printf( %d?<>%d n , i, i + 1); n } n printf( 9?>>?0 n?<>1 n>>?? n ); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long n; n cin >> n; n long long t = n; n vector > laptop; n for (int i = 0; i < n; i++) { n long long temp1, temp2; n cin >> temp1 >> temp2; n laptop.push_back(make_pair(temp1, temp2)); n } n sort(laptop.begin(), laptop.end()); n int cur = laptop[0].second; n for (int i = 1; i < n; ++i) { n if (cur > laptop[i].second) { n cout << Happy Alex n ; n return 0; n } n cur = laptop[i].second; n } n cout << Poor Alex n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e6 + 7, M = 1e9 + 7; n vector primes; n bool isp[N]; n void sieve() { n fill(isp, isp + N, 1); n isp[0] = isp[1] = 0; n for (int i = 2; i * i < N; i++) n if (isp[i]) n for (int j = i * i; j < N; j += i) isp[j] = 0; n for (int i = 2; i < N; i++) n if (isp[i]) primes.push_back(i); n } n vector > factorize(int x) { n vector > ans; n for (int i = 2; i * i <= x; i++) { n int cnt = 0; n while (x % i == 0) cnt++, x /= i; n if (cnt) ans.push_back(make_pair(i, cnt)); n } n if (x > 1) ans.push_back(make_pair(x, 1)); n return ans; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n; n cin >> n; n long long ans = 1; n map fac; n map cnt; n vector > > factors; n int pp[n]; n for (int i = 0; i < n; i++) cin >> pp[i]; n sort(pp, pp + n); n reverse(pp, pp + n); n for (int i = 1; i <= n; i++) { n int p = pp[i - 1]; n if (fac.count(p) == 0) { n ans = (ans * p) % M; n fac[p] = 1; n cnt[p] = 1; n vector > v; n v.push_back(make_pair(p, 1)); n factors.push_back(v); n } else { n vector > pf = factorize(p - 1); n factors.push_back(pf); n for (auto pr : pf) { n int p = pr.first; n int e = pr.second; n int dif = e - fac[p]; n if (dif < 0) continue; n if (dif == 0) { n cnt[p]++; n continue; n } n fac[p] += dif; n cnt[p] = 1; n for (int i = 0; i < dif; i++) ans = (ans * p) % M; n } n } n } n for (auto pf : factors) { n bool found = true; n for (auto pr : pf) { n int p = pr.first; n int e = pr.second; n int mx = fac[p]; n assert(e <= mx); n if (e == mx && cnt[p] == 1) { n found = false; n break; n } n } n if (found) { n ans++; n break; n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n unsigned long long n, k, b1, b2, b[200007], ans, dl, dll[200007], an[200007]; n map a[11]; n int main() { n ios::sync_with_stdio(0); n cout.tie(0); n cin.tie(0); n cin >> n >> k; n for (unsigned long long i = 1; i <= n; i++) { n cin >> b[i]; n b1 = b[i]; n dl = 0; n while (b1 > 0) { n dl++; n b1 = b1 / 10; n } n dll[i] = dl; n b1 = b[i]; n a[dl][b[i] % k]++; n } n for (unsigned long long i = 1; i <= n; i++) { n b1 = 1; n for (unsigned long long j = 1; j <= 10; j++) { n b1 *= 10; n b2 = b[i] * b1; n b2 %= k; n b2 = k - b2; n if (b2 == k) b2 = 0; n if (a[j].find(b2) != a[j].end()) { n ans += a[j][b2]; n if (dll[i] == j && b2 == b[i] % k) ans--; n } n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = int(1e6) + 100; n const long long inf = 1e6; n int n, m; n int a[maxn], cnt[maxn], b[maxn]; n void read() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); n for (int i = 1; i <= n; ++i) b[i] = a[i]; n } n long long POW(long long num, int times) { n long long ans = 1; n while (times) { n if (times & 1) ans = ans * num; n num = num * num; n if (ans >= inf) return inf; n if (num >= inf) num = inf; n times >>= 1; n } n return ans; n } n void solve() { n long long ans = 0; n for (int i = 1; i <= n; ++i) { n int num = a[i]; n a[i] = 1; n long long inv = 1; n for (int j = 2; j * j <= num && num != 1; ++j) n if (num % j == 0) { n int k = 0; n int x = a[i]; n while (num % j == 0) { n k++; n if (k == m) k = 0; n if (k == 0) n a[i] = x; n else n a[i] *= j; n num /= j; n } n int tmp = POW(j, (m - k) % m); n if (tmp == inf) n inv = inf; n else n inv *= tmp; n if (inv >= inf) inv = inf; n } n if (num != 1) a[i] *= num, inv *= POW(num, m - 1); n if (inv < inf) ans += cnt[inv]; n ++cnt[a[i]]; n } n printf( %lld n , ans); n } n int main() { n read(); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MX = 300000; n int n, arr[MX], bit[MX], ans = 0, lis; n void update(int x, int V) { n while (x <= n) { n bit[x] = max(bit[x], V); n x += x & -x; n } n } n int get(int x) { n int ret = 0; n while (x > 0) { n ret = max(ret, bit[x]); n x -= x & -x; n } n return ret; n } n int main() { n scanf( %d , &n); n memset(bit, 0, sizeof(bit)); n for (int j = 1; j <= n; j++) { n scanf( %d , &arr[j]); n lis = get(arr[j]) + 1; n update(arr[j] + 1, lis); n ans = max(ans, lis); n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n priority_queue, std::greater > pqs; n queue q; n stack sta; n set st; n set::iterator P; n long long i, j, n, m, t, k, a, b, c, x, mx, mn; n string s, s1; n char z; n vector > v; n map, long long> mp, pm; n int main() { n ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); n int T = 1; n cin >> T; n while (T--) { n i = j = n = m = t = k = a = b = c = x = mx = mn = 0; n cin >> n >> m; n m += 2 * n; n for (i = 1; i <= n && m; i++) n for (j = i + 1; j <= n && m; j++) cout << i << << j << endl, m--; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Node { n Node *arr[26]; n int state; n bool isEnd = false; n Node() { n for (int i = 0; i < 26; i++) arr[i] = nullptr; n isEnd = true; n } n }; n void insert(const string &s, Node *root) { n Node *curr = root; n for (char c : s) { n if (curr->arr[c - a ] == nullptr) curr->arr[c - a ] = new Node(); n curr = curr->arr[c - a ]; n } n curr->isEnd = true; n } n int find_state(Node *curr, bool leaf = true) { n bool winning = false; n int cnt = 0; n for (int i = 0; i < 26; i++) { n if (curr->arr[i] != nullptr) { n cnt++; n if (find_state(curr->arr[i], leaf) == 0) winning = true; n } n } n if (cnt == 0) winning = leaf; n return curr->state = winning ? 1 : 0; n } n int main() { n int n, k; n cin >> n >> k; n Node *root = new Node(); n for (int i = 0; i < n; i++) { n string s; n cin >> s; n insert(s, root); n } n int st1 = find_state(root, false); n if (k == 1) { n cout << (st1 == 1 ? First : Second ) << endl; n } else { n int st2 = find_state(root, true); n if (st2 == 1 && st1 == 1) { n cout << First << endl; n } else if (st2 == 1 && st1 == 0) { n cout << Second << endl; n } else if (st2 == 0 && st1 == 1) { n cout << (k % 2 == 0 ? Second : First ) << endl; n } else { n cout << Second << endl << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[100005]; n int main() { n int n; n while (cin >> n) { n int ans = 0; n for (int i = 1; i < n; i++) { n int x, y; n cin >> x >> y; n ans += a[x] + a[y]; n a[x]++, a[y]++; n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = pow(10, 9) + 7; n const long long MAX = LONG_LONG_MAX; n void solve() { n int n; n cin >> n; n vector a(n, ); n for (int i = 0; i < n; i += 1) cin >> a[i]; n for (int i = 0; i < n; i += 1) { n for (int j = 0; j < n; j += 1) { n if (a[i][j] == 1 ) { n if (i == n - 1 || j == n - 1) { n continue; n } n if (a[i + 1][j] == 1 || a[i][j + 1] == 1 ) { n continue; n } else { n cout << NO ; n return; n } n } n } n } n cout << YES ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long t = 1; n cin >> t; n while (t > 0) { n solve(); n t--; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int8_t sign(int a, int b, int &c, int x, int y) { n return a * 1LL * x + b * 1LL * y + c < 0LL ? -1 : 1; n } n void solve() { n int x, y, x1, y1; n cin >> x >> y >> x1 >> y1; n int16_t ans = 0; n int16_t n; n cin >> n; n for (int i = 0, u, v, c; i < n; i++) { n cin >> u >> v >> c; n ans += sign(u, v, c, x, y) != sign(u, v, c, x1, y1); n } n cout << ans; n } n int32_t main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int tkd = 1; n while (tkd-- > 0) { n solve(); n } n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:64777216 ) n using namespace std; n template n inline T sqr(T x) { n return x * x; n } n const double pi = acos(-1.0), eps = 1e-9; n const int INF = 1000 * 1000 * 1000, MAXN = 1000005, MOD = 1000000007; n const long long INFL = 1000000000000000000; n long long n, m, cnt[MAXN][26]; n string x, y; n void prepare(string s) { n if ((int)s.size() != 0) { n freopen((s + .in ).c_str(), r , stdin); n freopen((s + .out ).c_str(), w , stdout); n } n } n long long gcd(long long a, long long b) { return (b) ? gcd(b, a % b) : a; } n long long lca(long long a, long long b) { return a / gcd(a, b) * b; } n void get_data() { cin >> n >> m >> x >> y; } n void solve() { n long long L = lca((int)x.size(), (int)y.size()); n long long g = gcd((int)x.size(), (int)y.size()); n long long ans = L; n for (int i = 0; i < (int)y.size(); ++i) cnt[i % g][y[i] - a ]++; n for (int j = 0; j < (int)x.size(); ++j) ans -= cnt[j % g][x[j] - a ]; n cout << ans * (n * (int)x.size() / L); n } n int main() { n prepare( ); n get_data(); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[2004], temp[2004], e[2004], c, cnt; n int n; n int q[27]; n void f(int x) { n cnt++; n if (cnt != n * 3) n printf( %d , x); n else n printf( %d n , x); n int i; n for (i = n - x + 1; i <= n; i++) temp[n - i + 1] = s[i]; n for (i = 1; i < n - x + 1; i++) temp[i + x] = s[i]; n for (i = 1; i <= n; i++) s[i] = temp[i]; n } n int main() { n int t, i, j, k, x, l1, l2, flag, o; n scanf( %d , &t); n scanf( %s , s + 1); n scanf( %s , e + 1); n l1 = strlen(s + 1); n l2 = strlen(e + 1); n if (l1 != l2) { n printf( -1 n ); n return 0; n } n memset(q, 0, sizeof(q)); n for (i = 1; i <= l1; i++) { n q[s[i] - a ]++; n q[e[i] - a ]--; n } n flag = 1; n for (i = 0; i < 26; i++) { n if (q[i]) flag = 0; n } n if (flag == 0) { n printf( -1 n ); n return 0; n } n n = l1; n printf( %d n , n * 3); n cnt = 0; n for (o = 0; o < n; o++) { n f(n); n c = e[n - o]; n for (i = n - o; i >= 0; i--) { n if (s[i] == c) break; n } n f(n - i); n f(1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e9 + 10, MAX = 7e5 + 1e4, MOD = 1e9 + 7, MAXL = 25; n void OUT(long double o, int x) { n cout << fixed << setprecision(x) << o; n return; n } n long long sth[MAX], mah[MAX], reg[MAX], ti[MAX], en[MAX], he[MAX], hh[MAX], n pa[MAX]; n long long la[MAX]; n pair, long long> so[MAX]; n set st; n map mp; n vector, long long> > v[MAX]; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n, m, ans = 0, bo, da, in; n bool inff = 0; n cin >> n >> m >> bo >> in >> da; n st.insert(0); n for (int i = 1; i <= n; i++) { n cin >> mah[i] >> sth[i] >> reg[i]; n if (mah[i] <= da) inff = 1; n hh[i] = sth[i]; n if (hh[i] <= da && (reg[i] != 0 && mah[i] > da)) { n st.insert((da - hh[i]) / reg[i]); n st.insert(((da - hh[i]) / reg[i]) + 1); n } n } n for (int i = 1; i <= m; i++) { n cin >> ti[i] >> en[i] >> he[i]; n so[i] = {{ti[i], en[i]}, he[i]}; n } n so[0].first.first = -1; n sort(so + 1, so + m + 1); n for (int i = 1; i <= m; i++) { n hh[so[i].first.second] = so[i].second; n st.insert(so[i].first.first); n st.insert(so[i].first.first - 1); n if (so[i].second <= da && n (reg[so[i].first.second] != 0 && mah[so[i].first.second] > da)) { n st.insert(so[i].first.first + n ((da - so[i].second) / reg[so[i].first.second])); n st.insert(1 + so[i].first.first + n ((da - so[i].second) / reg[so[i].first.second])); n } n } n for (int i = 1; i <= n; i++) { n if (reg[i] == 0 && hh[i] <= da) inff = 1; n } n if (inff == 1 && in != 0) return cout << -1, 0; n long long cnt = 0, x = 0; n for (int u : st) { n mp[u] = cnt; n cnt++; n } n for (int i = 1; i <= n; i++) { n hh[i] = sth[i]; n la[i] = -1; n if (hh[i] <= da) n x++; n else n la[i] = -2; n if (hh[i] <= da && (reg[i] != 0 && mah[i] > da)) { n pa[mp[1 + ((da - hh[i]) / reg[i])]]--; n la[i] = ((da - hh[i]) / reg[i]); n } n } n for (int i = 1; i <= m; i++) { n v[mp[ti[i]]].push_back({{ti[i], en[i]}, he[i]}); n } n for (int u : st) { n for (pair, long long> w : v[mp[u]]) { n hh[w.first.second] = w.second; n if (la[w.first.second] == -1 || la[w.first.second] >= u) { n if (la[w.first.second] != -1) pa[mp[la[w.first.second] + 1]]++; n if (hh[w.first.second] > da) n x--; n else { n if ((reg[w.first.second] != 0 && mah[w.first.second] > da)) { n pa[mp[1 + u + ((da - hh[w.first.second]) / reg[w.first.second])]]--; n la[w.first.second] = n u + ((da - hh[w.first.second]) / reg[w.first.second]); n } n } n } else { n if (hh[w.first.second] <= da) { n x++; n if (reg[w.first.second] > 0) { n pa[mp[u + 1 + ((da - hh[w.first.second]) / reg[w.first.second])]]--; n la[w.first.second] = n u + ((da - hh[w.first.second]) / reg[w.first.second]); n } else n la[w.first.second] = -1; n } n } n } n x += pa[mp[u]]; n ans = max(ans, (x * bo) + (x * in * u)); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, k; n cin >> n >> k; n long long int res = 1; n if (k == 1) { n cout << n; n } else { n while (res <= n) res = (long long)(res * 2); n cout << res - 1; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = acos(-1); n const int inf = 99999999; n int n; n char c[20]; n int r[20]; n int b[20]; n int dp[1 << 16][123]; n int main() { n int n; n cin >> n; n int maxi = 0; n int ans1 = 0; n int ans2 = 0; n for (int i = 0; i < n; i++) { n cin >> c[i] >> r[i] >> b[i]; n maxi += i; n ans1 += r[i]; n ans2 += b[i]; n } n memset(dp, -1, sizeof(dp)); n dp[0][0] = 0; n for (int i = 1; i < 1 << n; i++) { n for (int j = 0; j < n; j++) { n if (i >> j & 1) { n int R = 0; n int B = 0; n for (int k = 0; k < n; k++) { n if (k != j && i >> k & 1) { n R += c[k] == R ; n B += c[k] == B ; n } n } n R = min(R, r[j]); n B = min(B, b[j]); n for (int k = 0; k <= maxi; k++) { n if (dp[i ^ (1 << j)][k] != -1) { n dp[i][k + R] = max(dp[i][k + R], dp[i ^ (1 << j)][k] + B); n } n } n } n } n } n int ans = max(ans1, ans2); n for (int i = 0; i <= maxi; i++) { n if (dp[(1 << n) - 1][i] != -1) { n ans = min(ans, max(ans2 - dp[(1 << n) - 1][i], ans1 - i)); n } n } n cout << ans + n; n return 0; n } n "} +{"func_code_string": "#include n void output1(int n) { n for (int i = 0; i < n; ++i) { n printf( 10 ); n } n printf( n ); n } n void output2(int m) { n --m; n for (int i = 0; i < m; ++i) { n printf( 01 ); n } n printf( 0 n ); n } n void output3(int n, int m) { n if (n == m + 1) { n --n; n for (int i = 0; i < n; ++i) { n printf( 10 ); n } n printf( 1 n ); n return; n } n int tmp = n - m - 1; n int up = m + 1; n up--; n for (int i = 0; i < up; ++i) { n printf( 1 ); n if (tmp) { n printf( 1 ); n --tmp; n } n printf( 0 ); n } n printf( 1 ); n if (tmp) { n printf( 1 ); n } n printf( n ); n } n int main() { n int n, m; n while (scanf( %d%d , &m, &n) != EOF) { n if (m == n) { n output1(n); n } else if (m == n + 1) { n output2(m); n } else if (n > m && n <= 2 * m + 2) { n output3(n, m); n } else { n printf( -1 n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC target( sse4 ) n const char nl = n ; n using namespace std; n using ll = long long; n using vi = vector; n using vl = vector; n using pii = pair; n using pll = pair; n using str = string; n str to_string(char c) { return str(1, c); } n str to_string(bool b) { return b ? true : false ; } n str to_string(const char* second) { return (str)second; } n str to_string(str second) { return second; } n template n str to_string(complex c) { n stringstream ss; n ss << c; n return ss.str(); n } n str to_string(vector v) { n str res = { ; n for (int i = 0; i < (int)v.size(); i++) res += char( 0 + v[i]); n res += } ; n return res; n } n template n str to_string(bitset b) { n str res = ; n for (int i = 0; i < b.size(); i++) res += char( 0 + b[i]); n return res; n } n template n str to_string(pair p); n template n str to_string(T v) { n bool fst = 1; n str res = { ; n for (const auto& x : v) { n if (!fst) res += , ; n fst = 0; n res += to_string(x); n } n res += } ; n return res; n } n template n str to_string(pair p) { n return ( + to_string(p.first) + , + to_string(p.second) + ) ; n } n void DBG() { cerr << ] << endl; } n template n void DBG(H h, T... t) { n cerr << to_string(h); n if (sizeof...(t)) cerr << , ; n DBG(t...); n } n string c; n int n; n int dp[26][26]; n signed main() { n cin.tie(nullptr); n ios_base::sync_with_stdio(false); n cin >> n; n for (int i = 0; i < 26; i++) { n for (int j = 0; j < 26; j++) { n dp[i][j] = -1e9; n } n } n int ans = 0; n for (int i = 0; i < n; i++) { n cin >> c; n int m = c.length(); n int a = c[0] - a ; n int b = c[m - 1] - a ; n for (int j = 0; j < 26; j++) { n dp[j][b] = max(dp[j][b], dp[j][a] + m); n } n dp[a][b] = max(dp[a][b], m); n } n for (int i = 0; i < 26; i++) { n ans = max(ans, dp[i][i]); n } n cout << ans << nl; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 5100; n const long long M = 15; n const long long mod = 1e9 + 7; n const long long MOD = 998244353; n const long long P = 1336; n const long double eps = 0.000000001; n const long long inf = 1e9; n mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count()); n long long w[N], b[N], a[N], dp[N], u[N]; n vector nom[N]; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n srand(time(0)); n long long n, k, V; n cin >> n >> k >> V; n long long sum = 0; n if (V == 0) { n cout << YES << n ; n cout << inf << 1 2 ; n return 0; n } n for (long long i = 0; i < n; i++) { n cin >> w[i]; n sum += w[i]; n b[i] = w[i] % k; n a[i] = w[i] - b[i]; n if (a[i] > V) a[i] = V / k * k; n } n if (sum < V) { n cout << NO ; n return 0; n } n dp[0] = 1; n for (long long i = 0; i < n; i++) { n for (long long j = k; j >= 0; j--) { n if (dp[j] != 1) continue; n long long per = (j + b[i]) % k; n if (per == 0) per = k; n if (dp[per]) continue; n dp[per] = 2; n for (auto to : nom[j]) { n nom[per].push_back(to); n } n nom[per].push_back(i); n } n for (long long j = k; j >= 0; j--) { n if (dp[j] == 2) dp[j] = 1; n } n } n for (long long i = 0; i < n; i++) { n long long need = (V - a[i]) % k; n if (need == 0) need = k; n if (!dp[need] && need != k) continue; n long long no = -1; n vector > > g; n for (long long j = 0; j < n; j++) { n u[j] = 0; n } n for (auto to : nom[need]) { n u[to] = 1; n } n if (u[i] == 0 && need != k) continue; n long long s = 0; n for (auto to : nom[need]) { n u[to] = 1; n if (to == i) { n s += w[i]; n continue; n } n g.push_back({inf, {to, i}}); n s += w[to]; n } n long long e = -1; n for (long long j = 0; j < n; j++) { n if (u[j]) continue; n e = j; n } n if (s < V) { n need = (V - s) / k; n for (long long j = 0; j < n; j++) { n if (u[j] || j == e) continue; n long long c = w[j] / k; n if (w[j] % k) c++; n if (c) g.push_back({c, {j, e}}); n w[e] += w[j]; n } n long long c = w[e] / k; n if (c < need) continue; n g.push_back({need, {e, i}}); n } n if (s > V) { n need = (s - V) / k; n if (i) n g.push_back({need, {i, 0}}); n else n g.push_back({need, {i, 1}}); n } n cout << YES << n ; n for (auto to : g) { n cout << to.first << << to.second.first + 1 << n << to.second.second + 1 << n ; n } n return 0; n } n cout << NO ; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 500000 + 24; n int a[MAX]; n int main() { n int n, m, ans, tmp, u, v, fc; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n } n m = a[0]; n ans = 0; n for (int i = 0; i < n; i++) { n while (i < n && a[i] == m) { n i++; n } n tmp = 0; n u = i; n if (m == 0) { n while (i + 1 < n && a[i] == 1 && a[i + 1] == 0) { n tmp++; n i += 2; n } n } else { n while (i + 1 < n && a[i] == 0 && a[i + 1] == 1) { n tmp++; n i += 2; n } n } n v = i; n ans = max(ans, tmp); n int j = u; n for (; j < v - tmp; j++) { n a[j] = m; n } n fc = (i < n) ? a[i] : a[n - 1]; n for (; j < v; j++) { n a[j] = fc; n } n m = a[i]; n i--; n } n printf( %d n , ans); n for (int i = 0; i < n - 1; i++) { n printf( %d , a[i]); n } n printf( %d n , a[n - 1]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e5 + 10; n int n, a[maxn], cnt[maxn], mx = 0, last[maxn * 2], ans = 0; n void solve1(int x) { n for (int i = 1; i <= n; i++) last[n - i] = last[n + i] = -1; n last[n] = 0; n int cur = 0; n for (int i = 1; i <= n; i++) { n if (a[i] == x) n cur++; n else if (a[i] == mx) n cur--; n if (last[n + cur] == -1) n last[n + cur] = i; n else n ans = max(ans, i - last[n + cur]); n } n } n void solve2(int x) { n for (int i = 1; i <= n; i++) cnt[i] = 0; n int l = 1, equal = 0; n cnt[a[l]]++; n if (cnt[a[l]] == x) equal++; n for (int i = 2; i <= n; i++) { n cnt[a[i]]++; n if (cnt[a[i]] == x) n equal++; n else if (cnt[a[i]] > x) { n while (cnt[a[i]] > x) { n cnt[a[l]]--; n if (cnt[a[l]] == x - 1) equal--; n l++; n } n } n if (equal >= 2) ans = max(ans, i - l + 1); n } n } n int main() { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n cnt[a[i]]++; n mx = cnt[mx] < cnt[a[i]] ? a[i] : mx; n } n int limt = sqrt(n); n for (int i = 1; i <= n; i++) n if (cnt[i] >= limt && i != mx) solve1(i); n for (int i = 1; i < limt; i++) solve2(i); n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int arr[6]; n for (int i = 0; i < 6; i++) { n cin >> arr[i]; n } n sort(arr, arr + 6); n int tracker[10]; n for (int i = 0; i < 10; i++) { n tracker[i] = 0; n } n for (int i = 0; i < 6; i++) { n tracker[arr[i]]++; n } n int legs = -1; n for (int i = 0; i < 10; i++) { n if (tracker[i] >= 4) { n legs = i; n break; n } n } n if (legs != -1) { n int head1 = -1, head2; n int taken[6]; n int takenCounter = 0; n for (int i = 0; i < 6; i++) { n taken[i] = 0; n } n for (int i = 0; i < 6; i++) { n if (arr[i] == legs) { n taken[i] = 1; n takenCounter++; n } n if (takenCounter == 4) { n break; n } n } n for (int i = 0; i < 6; i++) { n if (taken[i] == 0) { n if (head1 == -1) { n head1 = arr[i]; n } else { n head2 = arr[i]; n } n } n } n if (head1 != head2) { n cout << Bear ; n } else { n cout << Elephant ; n } n } else { n cout << Alien ; n } n } n "} +{"func_code_string": "#include n using namespace std; n string s; n int n, a, b, ans, nr1, nr0, minD; n int main() { n cin >> n >> a >> b; n cin >> s; n a--; n b--; n minD = (int)1e8; n nr1 = (int)1e8; n nr0 = (int)1e8; n for (int i = 0; i < s.size(); i++) { n if (s[i] == s[a]) { n nr1 = i; n if (abs(nr1 - nr0) < minD) minD = abs(nr1 - nr0); n } n if (s[i] == s[b]) { n nr0 = i; n if (abs(nr0 - nr1) < minD) minD = abs(nr0 - nr1); n } n } n cout << minD; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void minn(T& a, T b) { n if (a > b) a = b; n } n template n void maxx(T& a, T b) { n if (a < b) a = b; n } n void debug() { return; } n template n void debug(H a, T... b) { n cerr << a; n debug(b...); n } n void is() { return; } n template n void is(H& a, T&... b) { n cin >> a; n is(b...); n } n void os() { return; } n template n void os(H a, T... b) { n cout << a; n os(b...); n } n const int mod = 1e9 + 7; n const int N = 2e5 + 5; n int n, q; n int nx[N], pr[N], nx100[N]; n void sw(int x, int y) { n swap(nx[x], nx[y]); n pr[nx[x]] = x; n pr[nx[y]] = y; n int k = x; n for (int i = 1; i <= 100; i++) k = pr[k]; n for (int i = 1; i <= 105; i++) { n nx100[k] = x; n x = nx[x]; n k = nx[k]; n } n k = y; n for (int i = 1; i <= 100; i++) k = pr[k]; n for (int i = 1; i <= 105; i++) { n nx100[k] = y; n y = nx[y]; n k = nx[k]; n } n } n void solve() { n is(n, q); n for (int i = 1; i <= n; i++) { n is(nx[i]); n pr[nx[i]] = i; n } n for (int i = 1; i <= n; i++) { n int k = i; n for (int j = 1; j <= 100; j++) { n k = nx[k]; n } n nx100[i] = k; n } n while (q--) { n int t, x, y; n is(t, x, y); n if (t == 2) { n int k = x; n while (y >= 100) { n y -= 100; n k = nx100[k]; n } n while (y--) k = nx[k]; n os(k, n ); n } else { n sw(x, y); n } n } n } n signed main() { n ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); n int T = 1; n while (T--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n const int mod = 1e9 + 7; n int n, m, a[N], t[N], r[N], second[N]; n pair T[2][N * 4]; n pair get_max(int l, int r, int v = 1, int tl = 1, int tr = n) { n if (tl > r || tr < l) return make_pair(-mod, 0); n if (l <= tl && tr <= r) return T[0][v]; n int tm = (tl + tr) / 2; n return max(get_max(l, r, v * 2, tl, tm), n get_max(l, r, v * 2 + 1, tm + 1, tr)); n } n pair get_min(int l, int r, int v = 1, int tl = 1, int tr = n) { n if (tl > r || tr < l) return make_pair(mod, 0); n if (l <= tl && tr <= r) return T[1][v]; n int tm = (tl + tr) / 2; n return min(get_min(l, r, v * 2, tl, tm), n get_min(l, r, v * 2 + 1, tm + 1, tr)); n } n void upd(int p, int v = 1, int tl = 1, int tr = n) { n if (tl == tr) { n T[0][v] = T[1][v] = make_pair(a[p], p); n return; n } n int tm = (tl + tr) / 2; n if (p <= tm) n upd(p, v * 2, tl, tm); n else n upd(p, v * 2 + 1, tm + 1, tr); n T[0][v] = max(T[0][v * 2], T[0][v * 2 + 1]); n T[1][v] = min(T[1][v * 2], T[1][v * 2 + 1]); n } n int main() { n ios_base::sync_with_stdio(0); n cin >> n >> m; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n upd(i); n } n for (int i = 1; i <= m; i++) cin >> t[i] >> r[i]; n for (int i = m; i; i--) second[i] = max(second[i + 1], r[i]); n for (int i = 1; i <= m; i++) { n if (r[i] > second[i + 1]) { n if (t[i] == 1) { n for (int j = r[i]; j > second[i + 1]; j--) { n pair x = get_max(1, j); n swap(a[x.second], a[j]); n upd(x.second); n upd(j); n } n } else { n for (int j = r[i]; j > second[i + 1]; j--) { n pair x = get_min(1, j); n swap(a[x.second], a[j]); n upd(x.second); n upd(j); n } n } n } n } n for (int i = 1; i <= n; i++) cout << a[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1e6 + 3; n const int INFI = 1e9 * 2; n const long long LINFI = 1e17; n const double pi = acos(-1.0); n const int N = 111; n const int M = 222222; n const int move[8][2] = {1, 0, -1, 0, 0, 1, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1}; n int a[N][N]; n int main() { n int n, m; n while (scanf( %d , &n) != EOF) { n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) scanf( %d , &a[i][j]); n if (n == 1) n printf( %d n , 0); n else { n for (int i = 0; i < n; i++) { n m = 0; n for (int j = 0; j < n; j++) n if (i != j) m |= a[i][j]; n printf( %d , m); n } n printf( n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize(2) n using namespace std; n const long long inff = 0x3f3f3f3f3f3f3f3f; n const int N = 5e2 + 8; n int n, kk, a[N], dp[2][N][N]; n int main() { n cin.tie(0); n cout.tie(0); n cin >> n >> kk; n int qw = 0; n dp[qw ^ 1][0][0] = 1; n for (int i(1); i <= (n); ++i) { n scanf( %d , &a[i]); n for (int j(0); j <= (kk); ++j) n for (int k(0); k <= (kk); ++k) dp[qw][j][k] = dp[qw ^ 1][j][k]; n for (int j(kk); j >= (a[i]); --j) n for (int k(kk); k >= (0); --k) n dp[qw][j][k] = max(dp[qw][j][k], dp[qw ^ 1][j - a[i]][k]); n for (int j(kk); j >= (a[i]); --j) n for (int k(kk); k >= (0); --k) n dp[qw][k][j] = max(dp[qw][k][j], dp[qw ^ 1][k][j - a[i]]); n qw ^= 1; n } n qw ^= 1; n int num = 0; n for (int i(0); i <= (kk); ++i) n if (dp[qw][i][kk - i]) num++; n cout << num << endl; n for (int i(0); i <= (kk); ++i) n if (dp[qw][i][kk - i]) printf( %d , i); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s1, s2, s3; n int win(string s1, string s2) { n if (s1 == rock ) { n if (s2 == rock ) return 0; n if (s2 == scissors ) return 1; n if (s2 == paper ) return 2; n } n if (s1 == paper ) { n if (s2 == rock ) return 1; n if (s2 == scissors ) return 2; n if (s2 == paper ) return 0; n } n if (s1 == scissors ) { n if (s2 == rock ) return 2; n if (s2 == scissors ) return 0; n if (s2 == paper ) return 1; n } n } n int main() { n cin >> s1 >> s2 >> s3; n if (win(s1, s2) == 1 && win(s1, s3) == 1) { n cout << F ; n return 0; n } n if (win(s2, s1) == 1 && win(s2, s3) == 1) { n cout << M ; n return 0; n } n if (win(s3, s1) == 1 && win(s3, s2) == 1) { n cout << S ; n return 0; n } n cout << ? ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, a[101]; n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %d , &a[i]); n sort(a, a + n); n int i = 1; n while (a[i] == a[i - 1] && i < n) i++; n if (i == n) n printf( NO n ); n else n printf( %d n , a[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using namespace placeholders; n template n void mini(T &l, T r) { n l = min(l, r); n } n template n void maxi(T &l, T r) { n l = max(l, r); n } n template n void _dbg(const char *sdbg, TH h) { n cerr << sdbg << = << h << n ; n } n template n void _dbg(const char *sdbg, TH h, TA... a) { n while (*sdbg != , ) cerr << *sdbg++; n cerr << = << h << , ; n _dbg(sdbg + 1, a...); n } n template n ostream &operator<<(ostream &os, vector v) { n os << [ ; n for (auto vv : v) os << vv << , ; n return os << ] ; n } n template n ostream &operator<<(ostream &os, pair p) { n return os << ( << p.first << , << p.second << ) ; n } n using llint = long long; n const int B = 1e9 + 7; n int a[40][40]; n llint mem[40], cnt[40]; n void add(llint &a, llint b) { n a = (a + b) % B; n if (a < 0) a += B; n } n void init() { n mem[0] = 1; n cnt[0] = 1; n for (int i = 1; i < 40; ++i) { n int c = 1 << (i - 1); n cnt[i] = cnt[i - 1] * 4 % B; n add(mem[i], mem[i - 1] * 4 % B + 1ll * c * c % B * c % B * 2 % B); n } n } n llint calc(llint a, llint b) { n a %= B, b %= B; n return ((a + b) * (b - a + 1) / 2) % B; n } n pair get(int x, int y, int k, int d) { n llint ret = 0; n int sz = 1 << d; n if (x < y) swap(x, y); n if (x <= 0 || y <= 0 || k <= 0) return make_pair(0, 0); n if (x >= sz) { n llint a = min(k, sz); n llint b = min(y, sz); n ret = calc(1, a) * b % B; n ; n return make_pair(b * calc(1, a) % B, b * a % B); n } n if (d == 0) return make_pair(1 <= k, 1 <= k); n int t = 1 << (d - 1); n auto t1 = get(x, y, k, d - 1); n auto t2 = get(x - t, y, k - t, d - 1); n auto t3 = get(y, y - t, k - t, d - 1); n auto t4 = get(x - t, y - t, k, d - 1); n ; n add(ret, t1.first); n add(ret, t2.first + t2.second * t % B); n add(ret, t3.first + t3.second * t % B); n add(ret, t4.first); n llint c = 0; n add(c, t1.second); n add(c, t2.second); n add(c, t3.second); n add(c, t4.second); n ; n return make_pair(ret, c); n } n llint go(int x1, int y1, int x2, int y2, int k) { n llint ret = 0; n add(ret, get(x2, y2, k, 30).first); n add(ret, -get(x1 - 1, y2, k, 30).first); n add(ret, -get(x2, y1 - 1, k, 30).first); n add(ret, get(x1 - 1, y1 - 1, k, 30).first); n return ret; n } n void run() { n init(); n ; n int q; n scanf( %d , &q); n for (int i = 1; i <= q; ++i) { n int x1, y1, x2, y2, k; n scanf( %d%d%d%d%d , &x1, &y1, &x2, &y2, &k); n printf( %lld n , go(x1, y1, x2, y2, k)); n } n } n int main() { n run(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n const long long up = 2e5 + 5; n pair pt[2005]; n inline bool cmp(const pair& a, const pair& b) { n if (a.first == b.first) return a.second < b.second; n return a.first < b.first; n } n long long fac[up], inv[up], facinv[up], facinv2[up]; n long long pow_mod(long long a, long long k) { n long long res = 1; n while (k) { n if (k & 1) res = (res * a) % mod; n a = (a * a) % mod; n k >>= 1; n } n return res; n } n void init() { n fac[0] = fac[1] = 1; n for (long long i = 2; i < up; ++i) fac[i] = fac[i - 1] * i % mod; n inv[1] = 1, facinv[0] = facinv[1] = 1; n facinv2[0] = facinv2[1] = 1; n for (long long i = 2; i < up; ++i) { n long long t = mod / i, k = mod % i; n inv[i] = i * t * t % mod * inv[k] % mod * inv[k] % mod; n facinv[i] = facinv[i - 1] * inv[i] % mod; n } n } n long long C(long long n, long long m) { n return fac[n] * facinv[n - m] % mod * facinv[m] % mod; n } n long long ans[2005]; n int main() { n init(); n int h, w, k; n cin >> h >> w >> k; n for (long long i = 0; i < k; ++i) cin >> pt[i].first >> pt[i].second; n pt[k].first = h, pt[k].second = w; n ++k; n sort(pt, pt + k, cmp); n for (long long i = 0; i < k; ++i) { n ans[i] = C(pt[i].first + pt[i].second - 2, pt[i].first - 1); n for (long long j = 0; j < i; ++j) { n ans[i] -= ans[j] * n C(pt[i].first - pt[j].first + pt[i].second - pt[j].second, n pt[i].first - pt[j].first) % n mod; n ans[i] = (ans[i] + mod) % mod; n } n } n cout << ans[k - 1] << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int big = ((long long int)1 << 30); n const long long int mod = 1000000007; n int main(void) { n int n, m, ans = 0, i, q, w, gen = 0; n vector kaz; n vector uma; n scanf( %d %d , &n, &m); n m--; n kaz.resize(n); n uma.resize(n + 1); n for (i = 0; i < n; i++) { n scanf( %d , &q); n if (i == m && q != 0) { n ans++; n q = 0; n } n if (i != m && q == 0) { n q = n; n } n kaz[i] = q; n uma[q] = 1; n } n sort(kaz.begin(), kaz.end()); n while (-1) { n for (; gen <= n; gen++) { n if (uma[gen] == 0) { n break; n } n } n if (kaz.back() <= gen) { n break; n } n ans++; n kaz.pop_back(); n uma[gen] = 1; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n const int INF_INT = 0x3f3f3f3f; n const long long INF_LL = 0x7f7f7f7f; n const int MOD = 1e9 + 7; n const double eps = 1e-10; n const double pi = acos(-1); n using namespace std; n const int N = 200200; n int n, m, q; n int u[N], v[N]; n struct Query { n int l, r, s, t, id; n Query(int l, int r, int s, int t, int id) : l(l), r(r), s(s), t(t), id(id) {} n Query() {} n bool operator<(const Query& rhs) const { return l > rhs.l; } n }; n vector qs; n int dp[1010][1010]; n int ans[N]; n int main(int argc, char const* argv[]) { n scanf( %d%d%d , &n, &m, &q); n for (int i = 1; i <= m; i++) scanf( %d%d , &u[i], &v[i]); n for (int i = 1; i <= q; i++) { n int l, r, s, t; n scanf( %d%d , &l, &r); n scanf( %d%d , &s, &t); n qs.emplace_back(l, r, s, t, i); n } n sort(qs.begin(), qs.end()); n memset((dp), (INF_INT), sizeof(dp)); n for (int i = 1; i <= n; i++) dp[i][i] = 0; n int cnt = 0; n for (int i = m; i >= 1; i--) { n dp[u[i]][v[i]] = dp[v[i]][u[i]] = i; n for (int j = 1; j <= n; j++) { n if (j != u[i]) dp[v[i]][j] = min(dp[v[i]][j], dp[u[i]][j]); n if (j != v[i]) dp[u[i]][j] = min(dp[u[i]][j], dp[v[i]][j]); n } n while (cnt < qs.size() && qs[cnt].l >= i) { n ans[qs[cnt].id] = dp[qs[cnt].s][qs[cnt].t] <= qs[cnt].r; n cnt++; n } n } n for (int i = 1; i <= q; i++) puts(ans[i] ? Yes : No ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool deb = false; n int n; n vector p, b; n void init() { n if (!deb) return; n p.resize(n); n for (auto& x : p) cin >> x; n b.resize(n); n for (int i = 0; i < n; ++i) b[p[i]] = i; n } n int get(int i, int j) { n if (deb) return p[i] ^ b[j]; n cout << ? << i << << j << endl; n int x; n cin >> x; n if (x == -1) exit(0); n return x; n } n void ans(int cnt, vector p) { n cout << ! n ; n cout << cnt << endl; n for (int x : p) cout << x << ; n cout << endl; n } n int main() { n cin >> n; n init(); n vector a(n); n for (int i = 0; i < n; ++i) a[i] = get(0, i); n vector x(n); n for (int i = 0; i < n; ++i) x[i] = get(i, 0); n int cnt = 0; n vector pans; n for (int i = 0; i < n; ++i) { n vector b(n); n for (int j = 0; j < n; ++j) b[j] = i ^ a[j]; n vector arr(n); n for (int i : b) n if (i < n) ++arr[i]; n if (count(arr.begin(), arr.end(), 1) != n) continue; n vector p(n); n for (int j = 0; j < n; ++j) p[b[j]] = j; n bool f = true; n for (int j = 0; j < n; ++j) n if ((p[j] ^ b[0]) != x[j]) f = false; n if (f) ++cnt, pans = p; n } n ans(cnt, pans); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n int n, k; n while (cin >> n >> k) { n int r = n, l = 1; n cout << l; n l++; n for (int i = 1; i < k; i++) n if (i % 2) { n cout << << r; n r--; n } else { n cout << << l; n l++; n } n if (k % 2) n for (int i = k; i < n; i++, l++) cout << << l; n else n for (int i = k; i < n; i++, r--) cout << << r; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long m[1000005], n[1000005], w[1000005]; n int main() { n long long a, b, c; n char ch[10]; n while ((scanf( %lld%lld%lld , &a, &b, &c)) != EOF) { n long long t; n scanf( %lld , &t); n long long p = 0, q = 0, r, sum1 = 0, sum2 = 0, f; n for (int i = 0; i < t; i++) { n scanf( %lld , &f); n scanf( %s , ch); n if (ch[0] == U ) n m[p++] = f; n else n n[q++] = f; n } n sort(m, m + p); n sort(n, n + q); n long long i, j; n long long l = 0; n for (i = 0; i < a && i < p; i++) { n sum2 += m[i]; n sum1++; n } n while (m[i]) { n w[l++] = m[i++]; n } n for (i = 0; i < b && i < q; i++) { n sum2 += n[i]; n sum1++; n } n while (n[i]) w[l++] = n[i++]; n sort(w, w + l); n for (int i = 0; i < c && i < l; i++) { n sum2 += w[i]; n sum1++; n } n printf( %lld %lld n , sum1, sum2); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n char s[25][25]; n int c[25][25]; n int chs[1 << 21]; n int dp[1 << 21]; n vector hv; n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < n; ++i) { n scanf( %s , s[i]); n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n scanf( %d , c[i] + j); n } n } n memset(chs, 0x3f, sizeof(chs)); n for (int i = 0; i < n; ++i) { n hv.push_back(1 << i); n for (int j = 0; j < m; ++j) { n chs[1 << i] = min(chs[1 << i], c[i][j]); n } n } n for (int i = 0; i < m; ++i) { n for (int j = 0; j < 26; ++j) { n int num = 0, maxx = 0, sum = 0; n for (int k = 0; k < n; ++k) { n if (s[k][i] == j + a ) { n num |= 1 << k; n maxx = max(maxx, c[k][i]); n sum += c[k][i]; n } n } n if (!num) { n continue; n } n if (chs[num] == 0x3f3f3f3f) { n hv.push_back(num); n } n chs[num] = min(chs[num], sum - maxx); n } n } n memset(dp, 0x3f, sizeof(dp)); n dp[0] = 0; n for (int i = 0; i < (1 << n) - 1; ++i) { n for (int j : hv) { n dp[i | j] = min(dp[i | j], dp[i] + chs[j]); n } n } n printf( %d n , dp[(1 << n) - 1]); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize(2) n using namespace std; n const long long mod = 998244353; n const long long maxn = 3e5 + 10; n long long p[2] = {1000000007, 998244353}; n long long seed[2] = {500000004, 500000004}; n int main() { n int x, a[6]; n scanf( %d , &x); n for (int i = 0; i < 6; i++) n if (x & (1 << i)) n a[i] = 1; n else n a[i] = 0; n swap(a[0], a[4]); n swap(a[2], a[3]); n int y = 0; n for (int i = 0; i < 6; i++) n if (a[i]) y += 1 << i; n printf( %d n , y); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int n; n long long int u; n string s; n int q; n int count(long long int number) { n if (!number) return 0; n int result = 0; n while (number % 2 == 0) { n result++; n number >>= 1; n } n return result; n } n long long int solve(long long int start, string s) { n int tmp = count(n + 1) - 1; n for (int i = 0; i < s.size(); ++i) { n int zeros = count(start); n long long int total = ((long long int)1 << (zeros + 1)) - 1; n if (s[i] == U ) { n if (zeros < tmp) { n long long int tmp_one = start + (total - 1) / 2 + 1; n long long int tmp_two = start - (total - 1) / 2 - 1; n if (count(tmp_one) == zeros + 1) { n start = tmp_one; n } else n start = tmp_two; n } n } else { n if (s[i] == L ) { n if (zeros) { n long long int left = (total - 1) / 2; n start = start - left + ((left - 1) / 2); n } n } else { n if (s[i] == R ) { n if (zeros) { n long long int right = (total - 1) / 2; n start = start + (right - 1) / 2 + 1; n } n } n } n } n } n return start; n } n int main() { n cin >> n >> q; n for (int i = 0; i < q; ++i) { n cin >> u >> s; n cout << solve(u, s) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int boss = 2e5; n map used; n queue q; n int n, k, c[2], a[boss + 10]; n int main() { n int i, answer = 0; n cin >> n >> k; n for (i = 1; i <= n; i++) { n scanf( %d , &a[i]); n if (used[a[i]] || c[a[i] % 2] == n / 2) n q.push(i); n else n used[a[i]] = 1, c[a[i] % 2]++; n } n for (i = 1; i <= k && !q.empty(); i++) { n if (used[i]) continue; n if (c[i % 2] < n / 2) { n c[i % 2]++; n answer++; n a[q.front()] = i; n q.pop(); n } n } n if (!q.empty()) n return printf( -1 ), 0; n else { n cout << answer << endl; n for (i = 1; i <= n; i++) printf( %d , a[i]); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int mx = 2e5 + 10; n int main() { n int n, arr[mx], temp, z = 0; n queue visit; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , &arr[i]); n if (arr[i] == 0) visit.push(i); n } n temp = visit.front(); n visit.pop(); n for (int i = 0; i < n; i++) { n if (arr[i] != 0) { n if (visit.size() > 0) { n if (abs(visit.front() - i) < abs(i - temp)) { n temp = visit.front(); n visit.pop(); n } n } n printf( %d , abs(i - temp)); n } else { n if (i != n - 1) { n if (arr[i + 1] == 0) { n temp = visit.front(); n visit.pop(); n } n } n printf( 0 ); n } n if (i != n - 1) printf( ); n } n } n "} +{"func_code_string": "#include n using namespace std; n template inline int len(const T &a) { return a.size(); } n n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n int tc; n cin >> tc; n while (tc--) { n int n, m; n cin >> n >> m; n vector k(n); n vector c(m); n for (auto &i : k) { n cin >> i; n --i; n } n for (auto &i : c) { n cin >> i; n } n n sort(k.rbegin(), k.rend()); n int ptr = 0; n long long ans = 0; n for (int i = 0; i < n; ++i) { n if (ptr > k[i] || c[k[i]] == c[ptr]) { n ans += c[k[i]]; n } else { n ans += c[ptr++]; n } n } n n cout << ans << n ; n } n return 0; n } n n "} +{"func_code_string": "#include n using namespace std; n const long long N = 610001; n const long long inf = (long long)5e16; n struct node { n long long val, id; n }; n node a[N], b[N]; n bool cmp(node x, node y) { n if (x.val == y.val) return x.id < y.id; n return x.val < y.val; n } n long long n, m, ans[N], pos[N]; n signed main() { n scanf( %lld%lld , &m, &n); n for (long long i = 1; i <= n; i++) { n scanf( %lld , &a[i].val); n a[i].id = i; n } n for (long long i = n + 1; i <= n + n; i++) { n scanf( %lld , &b[i].val); n b[i].id = i - n; n b[i + n].val = b[i].val + m; n b[i + n].id = i - n; n b[i - n].val = b[i].val - m; n b[i - n].id = i - n; n } n sort(a + 1, a + n + 1, cmp); n sort(b + 1, b + 3 * n + 1, cmp); n for (long long i = 1, j = 1; i <= n; i++) { n while (a[i].val >= b[j].val && j <= 3 * n) j++; n ans[0] += a[i].val; n ans[j - i + 1] -= (a[i].val + a[i].val); n } n for (long long i = 1, j = 1; j <= 3 * n; j++) { n ans[max(j - n + 1, 0LL)] -= b[j].val; n while (b[j].val > a[i].val && i <= n) i++; n ans[j - i + 2] += b[j].val + b[j].val; n ans[j + 1] -= b[j].val; n } n long long sum = ans[0], id = 0, mi = inf; n for (long long i = 1; i <= 2 * n + 1; i++) { n sum += ans[i]; n ans[i] += ans[i - 1]; n if (mi > sum) { n mi = sum; n id = i; n } n } n cout << mi << endl; n for (long long i = 1; i <= n; i++) pos[a[i].id] = b[i + id - 1].id; n for (long long i = 1; i <= n; i++) printf( %d , pos[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int k, n, a; n int d[1001]; n bool vis[1001], flag; n int main() { n scanf( %d%d , &n, &k); n int cut = 0; n for (int i = 2; i <= k; i++) { n if (k % i) continue; n int crt = 1; n while (k % i == 0) { n crt *= i; n k /= i; n } n d[cut++] = crt; n } n for (int i = 0; i < n; i++) { n scanf( %d , &a); n for (int j = 0; j < cut; j++) { n if (a % d[j] == 0) { n vis[j] = true; n } n } n } n flag = true; n for (int j = 0; j < cut; j++) { n flag &= vis[j]; n } n if (flag) n printf( Yes n ); n else n printf( No n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int dx[] = {0, 1, -1, 0, 0}; n const int dy[] = {0, 0, 0, 1, -1}; n struct MinCostMaxFlow { n int head[20010], total; n int next[1000010], aim[1000010], flow[1000010], cost[1000010]; n int f[20010], from[20010], p[20010]; n bool v[20010]; n MinCostMaxFlow() : total(1) {} n void Add(int x, int y, int f, int c) { n next[++total] = head[x]; n aim[total] = y; n flow[total] = f; n cost[total] = c; n head[x] = total; n } n void Insert(int x, int y, int f, int c) { n Add(x, y, f, c); n Add(y, x, 0, -c); n } n bool SPFA() { n static queue q; n while (!q.empty()) q.pop(); n memset(f, 0x3f, sizeof(f)); n memset(v, false, sizeof(v)); n f[0] = 0; n q.push(0); n while (!q.empty()) { n int x = q.front(); n q.pop(); n v[x] = false; n for (int i = head[x]; i; i = next[i]) n if (flow[i] && f[aim[i]] > f[x] + cost[i]) { n f[aim[i]] = f[x] + cost[i]; n if (!v[aim[i]]) v[aim[i]] = true, q.push(aim[i]); n from[aim[i]] = x; n p[aim[i]] = i; n } n } n return f[(20010 - 1)] != 0x3f3f3f3f; n } n int EdmondsKarp() { n int re = 0; n while (SPFA()) { n int max_flow = 0x3f3f3f3f; n for (int i = (20010 - 1); i != 0; i = from[i]) n max_flow = ((max_flow) < (flow[p[i]]) ? (max_flow) : (flow[p[i]])); n for (int i = (20010 - 1); i != 0; i = from[i]) { n flow[p[i]] -= max_flow; n flow[p[i] ^ 1] += max_flow; n } n re += f[(20010 - 1)] * max_flow; n } n return re; n } n } solver; n int m, n; n int src[110][110]; n int main() { n cin >> m >> n; n for (int i = 1; i <= m; ++i) n for (int j = 1; j <= n; ++j) scanf( %d , &src[i][j]); n for (int i = 1; i <= m; ++i) n for (int j = 1; j <= n; ++j) { n if (i + j & 1) { n solver.Insert(0, ((i - 1) * n + j), 1, 0); n for (int k = 1; k <= 4; ++k) { n int fx = i + dx[k], fy = j + dy[k]; n if (!fx || !fy || fx > m || fy > n) continue; n solver.Insert(((i - 1) * n + j), ((fx - 1) * n + fy), 1, n src[i][j] != src[fx][fy]); n } n } else n solver.Insert(((i - 1) * n + j), (20010 - 1), 1, 0); n } n cout << solver.EdmondsKarp() << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 2e5 + 51; n struct BIT { n int x[MAXN]; n inline void add(int pos, int val); n inline int query(int pos); n }; n BIT bit; n int n, tp, res, totd, r; n int x[MAXN], d[MAXN], st[MAXN], f[MAXN], g[MAXN]; n long long int dsc[MAXN]; n inline int read() { n register int num = 0, neg = 1; n register char ch = getchar(); n while (!isdigit(ch) && ch != - ) { n ch = getchar(); n } n if (ch == - ) { n neg = -1; n ch = getchar(); n } n while (isdigit(ch)) { n num = (num << 3) + (num << 1) + (ch - 0 ); n ch = getchar(); n } n return num * neg; n } n inline void BIT::add(int pos, int val) { n for (; pos; pos -= pos & -pos) { n x[pos] = max(x[pos], val); n } n } n inline int BIT::query(int pos) { n int res = 0; n for (; pos <= totd; pos += pos & -pos) { n res = max(res, x[pos]); n } n return res; n } n int main() { n n = read(); n for (register int i = 0; i <= n + 1; i++) { n x[i] = read(); n } n for (register int i = 1; i <= n; i++) { n d[i] = read(); n } n for (register int i = 1; i <= n; i++) { n while (tp && x[i] > (long long int)2 * d[st[tp]] + x[f[st[tp]]]) { n tp--; n } n f[i] = st[tp]; n while (tp && (long long int)2 * d[i] + x[f[i]] >= n (long long int)2 * d[st[tp]] + x[f[st[tp]]]) { n tp--; n } n st[++tp] = i; n } n st[tp = 0] = n + 1, res = x[n + 1]; n for (register int i = n; i; i--) { n while (tp && x[i] < x[g[st[tp]]] - (long long int)2 * d[st[tp]]) { n tp--; n } n g[i] = st[tp]; n while (tp && x[g[i]] - (long long int)2 * d[i] <= n x[g[st[tp]]] - (long long int)2 * d[st[tp]]) { n tp--; n } n st[++tp] = i; n } n for (register int i = 1; i <= n; i++) { n if (x[g[i]] - x[f[i]] <= 2 * d[i]) { n return puts( 0 ), 0; n } n } n for (register int i = 1; i <= n; i++) { n res = min(res, x[g[i]] - x[f[i]]); n x[i] - x[f[i]] < (long long int)2 * d[i] n ? dsc[++totd] = (long long int)2 * d[i] + x[f[i]] n : 1; n f[i] == 0 && x[g[i]] - x[i] < (long long int)2 * d[i] ? res = min(res, x[i]) n : 1; n g[i] == n + 1 && x[i] - x[f[i]] < (long long int)2 * d[i] n ? res = min(res, x[n + 1] - x[i]) n : 1; n } n sort(dsc + 1, dsc + totd + 1), n totd = unique(dsc + 1, dsc + totd + 1) - dsc - 1; n for (register int i = 1; i <= n; i++) { n if (x[g[i]] - x[i] < (long long int)2 * d[i]) { n r = lower_bound(dsc + 1, dsc + totd + 1, n x[g[i]] - (long long int)2 * d[i]) - n dsc; n if (r = bit.query(r)) { n res = min(res, x[i] - r); n } n } n if (x[i] - x[f[i]] < (long long int)2 * d[i]) { n r = lower_bound(dsc + 1, dsc + totd + 1, n x[f[i]] + (long long int)2 * d[i]) - n dsc; n bit.add(r, x[i]); n } n } n printf( %.1lf n , res * 0.5); n } n "} +{"func_code_string": "#include n using namespace std; n int T, N, M; n int A[300][300]; n int dx[4] = {0, 1, 0, -1}; n int dy[4] = {1, 0, -1, 0}; n int main() { n scanf( %d , &T); n for (; T--;) { n scanf( %d%d , &N, &M); n bool ok = true; n for (int i = 0; i < N; i++) n for (int j = 0; j < M; j++) { n scanf( %d , &A[i][j]); n int cnt = 0; n for (int r = 0; r < 4; r++) { n int x = i + dx[r], y = j + dy[r]; n if (0 <= x && x < N && 0 <= y && y < M) cnt++; n } n if (A[i][j] > cnt) n ok = false; n else n A[i][j] = cnt; n } n if (ok) { n puts( YES ); n for (int i = 0; i < N; i++) { n for (int j = 0; j < M; j++) n printf( %d%c , A[i][j], j + 1 == M ? n : ); n } n } else n puts( NO ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int r, g, b, w; n cin >> r >> g >> b >> w; n int count = 0; n if (r % 2) count++; n if (g % 2) count++; n if (b % 2) count++; n int m = min(r, min(g, b)); n bool flag; n if (count == 0) n flag = true; n else if (count == 1) { n if (w % 2 == 0) n flag = true; n else n flag = false; n } else if (count == 2) { n if (w % 2 == 0) n flag = false; n else if (m > 0) n flag = true; n else n flag = false; n } else { n flag = true; n } n if (flag) n cout << Yes n ; n else n cout << No n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 55; n int n, k, dp[N][N]; n long long a[N], sum[N], dq; n int main() { n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); n for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i]; n for (int i = 60; i >= 0; i--) { n dq |= (long long)1 << i; n dp[0][0] = 1; n for (int j = 1; j <= n; j++) n for (int l = 1; l <= k; l++) { n dp[j][l] = 0; n for (int o = j - 1; o >= 0; o--) n if (((sum[j] - sum[o]) & dq) == dq) dp[j][l] |= dp[o][l - 1]; n } n if (!dp[n][k]) dq ^= (long long)1 << i; n } n printf( %lld , dq); n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int n; n cin >> n; n vector> a(5, vector(n)); n for (int i = 0; i < n; i++) { n string s; n cin >> s; n vector aa(5); n for (int j = 0; j < s.size(); j++) { n aa[s[j] - a ]++; n } n for (int j = 0; j < 5; j++) { n a[j][i] = 2 * aa[j] - s.size(); n } n } n int ans = 0; n for (int i = 0; i < 5; i++) { n sort(a[i].begin(), a[i].end(), greater()); n long long sum = 0; n int j = 0; n for (; j < n; j++) { n sum += a[i][j]; n if (sum <= 0) { n break; n } n } n ans = max(j, ans); n } n cout << ans << n ; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int t; n cin >> t; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1e9 + 7; n long long n, n2 = 1, a[5010], dat[20010], ans = 0; n vector v, vv[5010]; n map mp; n void build(long long k, long long lb, long long ub) { n if (lb == ub) return; n build(k * 2 + 1, lb, (lb + ub) / 2); n build(k * 2 + 2, (lb + ub) / 2 + 1, ub); n dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]); n } n long long query(long long k, long long lb, long long ub, long long tlb, n long long tub) { n if (ub < tlb || tub < lb) return 2e9; n if (tlb <= lb && ub <= tub) return dat[k]; n return min(query(k * 2 + 1, lb, (lb + ub) / 2, tlb, tub), n query(k * 2 + 2, (lb + ub) / 2 + 1, ub, tlb, tub)); n } n long long dfs(long long lb, long long ub, long long lst) { n if (lb > ub) return 0; n long long ret = ub - lb + 1, mn = query(0, 0, n2 - 1, lb, ub), res = mn - lst; n long long num = mp[mn], n pos = lower_bound(vv[num].begin(), vv[num].end(), lb) - n vv[num].begin(), n pos2 = lower_bound(vv[num].begin(), vv[num].end(), ub + 1) - n vv[num].begin() - 1; n for (long long i = pos; i < pos2; i++) n res += dfs(vv[num][i] + 1, vv[num][i + 1] - 1, mn); n res += dfs(lb, vv[num][pos] - 1, mn) + dfs(vv[num][pos2] + 1, ub, mn); n ret = min(ret, res); n return ret; n } n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n scanf( %I64d , &a[i]); n v.push_back(a[i]); n } n sort(v.begin(), v.end()); n v.erase(unique(v.begin(), v.end()), v.end()); n for (int i = 0; i < v.size(); i++) mp[v[i]] = i; n for (int i = 0; i < n; i++) vv[mp[a[i]]].push_back(i); n while (n2 < n) n2 *= 2; n for (int i = 0; i < 20005; i++) dat[i] = 1e18; n for (int i = 0; i < n; i++) dat[i + n2 - 1] = a[i]; n build(0, 0, n2 - 1); n cout << dfs(0, n - 1, 0) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n n typedef long long ll; n typedef pair pii; n #define FOR(i, n) for(int (i)=0; (i)<(n); (i)++) n #define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++) n #define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--) n template void umin(T& x, const U& y){ x = min(x, (T)y);} n template void umax(T& x, const U& y){ x = max(x, (T)y);} n template void init(vector &v, U x, size_t n) { v=vector(n, (T)x); } n template void init(vector &v, U x, size_t n, W... m) { v=vector(n); for(auto& a : v) init(a, x, m...); } n n const int m = 2e5; n const ll MOD = 1e9+7; n int dp[10][m+1]; n int main(int argc, char** argv) { n ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(15); n if (argc == 2 && atoi(argv[1]) == 123456789) freopen( d: code cpp contests stdin , r , stdin); n int T = 1; n cin >> T; n n FOR(x, 10) dp[x][0] = 1; n FOR1(i, m){ n FOR(x, 9){ n dp[x][i] = dp[x+1][i-1]; n } n dp[9][i] = (dp[1][i-1] + dp[0][i-1]) % MOD; n } n n FOR1(t, T){ n int n, m; n cin >> n >> m; n ll sol = 0; n while(n){ n int d = n%10; n sol += dp[d][m]; n n /= 10; n } n sol %= MOD; n cout << sol << endl; n } n if (argc == 2 && atoi(argv[1]) == 123456789) cout << clock()*1.0/CLOCKS_PER_SEC << sec n ; n return 0; n } n n "} +{"func_code_string": "#include n using namespace std; n long long f[110][2][2]; n int ans[110]; n int n; n long long k; n long long calc(long long x, long long a, long long b) { n if (f[x][a][b] != -1) return f[x][a][b]; n f[x][a][b] = 0; n int y = n - x + 1; n if (x > y) return f[x][a][b] = 1; n for (int i = 0; i < 2; i++) n if (ans[x] == -1 || ans[x] == i) n for (int j = 0; j < 2; j++) n if (ans[y] == -1 || ans[y] == j) n if (i == j || x < y) n if (a || i <= j) n if (b || i + j <= 1) n f[x][a][b] += calc(x + 1, a || (i < j), b || ((i + j) <= 0)); n return f[x][a][b]; n } n int main() { n scanf( %d %I64d , &n, &k); n k++; n memset(f, -1, sizeof(f)); n memset(ans, -1, sizeof(ans)); n if (calc(1, 0, 0) < k) return puts( -1 ), 0; n for (int i = 1; i <= n; i++) { n memset(f, -1, sizeof(f)); n ans[i] = 0; n if (calc(1, 0, 0) < k) { n k -= calc(1, 0, 0); n ans[i] = 1; n } n } n for (int i = 1; i <= n; i++) printf( %d , ans[i]); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int init() { n int now = 0, ju = 1; n char c; n bool flag = false; n while (1) { n c = getchar(); n if (c == - ) n ju = -1; n else if (c >= 0 && c <= 9 ) { n now = now * 10 + c - 0 ; n flag = true; n } else if (flag) n return now * ju; n } n } n inline long long llinit() { n long long now = 0, ju = 1; n char c; n bool flag = false; n while (1) { n c = getchar(); n if (c == - ) n ju = -1; n else if (c >= 0 && c <= 9 ) { n now = now * 10 + c - 0 ; n flag = true; n } else if (flag) n return now * ju; n } n } n char str[200005]; n long long mod; n long long fastpow(long long base, long long power) { n long long ret = 1; n for (; power; power >>= 1) { n if (power & 1) { n ret = (ret * base) % mod; n } n base = (base * base) % mod; n } n return ret; n } n int main() { n long long ans = 0x7fffffffffffll, nowans = 0; n scanf( %s , str + 1); n mod = llinit(); n int n = strlen(str + 1); n for (int i = 1; i <= n; i++) { n nowans *= 10; n nowans %= mod; n nowans += (str[i] - 0 ); n nowans %= mod; n } n ans = min(ans, nowans); n for (int i = 1; i <= n - 1; i++) { n nowans -= (1LL * (str[i] - 0 ) * fastpow(10, n - 1)); n while (nowans < 0) nowans += mod; n nowans %= mod; n nowans *= 10; n nowans %= mod; n nowans += (str[i] - 0 ); n nowans %= mod; n if (str[i + 1] != 0 ) { n ans = min(ans, nowans); n } n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MAXN = +100500; n const long long INF = 1e9; n bool ans[MAXN]; n long long get(long long x) { n long long l = 0, r = INF; n while (l + 1 < r) { n long long m = (l + r) / 2; n if (m * (m + 1) / 2 <= x) { n l = m; n } else { n r = m; n } n } n return l; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long a, b; n cin >> a >> b; n long long cnt = 0; n long long up = get(a + b); n for (long long i = up; i > 0; --i) { n if (a >= i) { n a -= i; n ans[i] = 1; n cnt++; n } n } n cout << cnt << n ; n for (long long i = 1; i <= up; ++i) { n if (ans[i]) { n cout << i << ; n } n } n cout << n << up - cnt << n ; n for (long long i = 1; i <= up; ++i) { n if (!ans[i]) { n cout << i << ; n } n } n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 2e5; n int arr[MAX]; n int main() { n int T; n cin >> T; n while (T--) { n int n; n cin >> n; n for (int i = 0; i < n; i++) { n int c; n cin >> c; n arr[c - 1] = i; n } n int l = arr[0], r = arr[0]; n for (int i = 0; i < n; i++) { n if (arr[i] < l) n l = arr[i]; n else if (arr[i] > r) n r = arr[i]; n if (i == r - l) n cout << 1; n else n cout << 0; n } n cout << n ; n } n } n "} +{"func_code_string": "#include n #include n #include n #include n #include n #include n #include n #include n using namespace std; n const int maxN = 3e5+ 10; n typedef long long int ll; n #define mod 998244353 n ll dp[maxN]; n ll f[maxN]; n string c[maxN]; n int main() n { n n int n,m; n scanf( %d%d ,&n,&m); n f[0]=1; n for(int i=1;i<=n*m;i++) n { n f[i]=f[i-1]*2%mod; n } n dp[0]=dp[1]=0; n for(int i=2;i<=max(n,m);i++) n dp[i]=(dp[i-1]+dp[i-2]*2%mod+f[i-2])%mod; n n for(int i=1;i<=n;i++) n cin>>c[i]; n ll sum=0; n for(int i=1;i<=n;i++) n for(int j=0;j n using namespace std; n int mp[28]; n bool fl[28]; n int main() { n int n, k; n cin >> n >> k; n string s; n cin >> s; n memset(mp, 0, sizeof(mp)); n for (int i = 0; i < s.size(); i++) { n mp[s[i] - a + 1]++; n } n int cnt = 0; n int ans = 0; n for (int i = 1; i <= 26; i++) { n if (mp[i] != 0 && fl[i - 1] == 0) { n ans += i; n cnt++; n fl[i] = 1; n } n if (cnt >= k) break; n } n if (cnt == k) n cout << ans << endl; n else n cout << -1 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n void upd(long long &x, long long y) { x += y; } n struct node { n int nxt; n long long sta, v[10]; n node() { n nxt = 0; n memset(v, 0, sizeof(v)); n } n }; n struct state { n vector nodes; n int head[100007]; n state() { memset(head, -1, sizeof(head)); } n size_t size() const { return nodes.size(); } n void sum() { n for (int i = 0; i < nodes.size(); i++) n for (int j = 1; j <= 9; j++) upd(nodes[i].v[j], nodes[i].v[j - 1]); n } n void update(int at, long long key, long long v) { n int tmp = key % 100007; n for (int i = head[tmp]; i != -1; i = nodes[i].nxt) n if (nodes[i].sta == key) { n upd(nodes[i].v[at], v); n return; n } n node now; n now.nxt = head[tmp]; n head[tmp] = nodes.size(); n now.v[at] = v; n now.sta = key; n nodes.push_back(now); n } n long long find(int at, long long key) { n int tmp = key % 100007; n for (int i = head[tmp]; i != -1; i = nodes[i].nxt) n if (nodes[i].sta == key) return nodes[i].v[at]; n return 0; n } n } f[11][20]; n long long c[2][20], bit[15]; n bitset<200> vis[15], pre[200], tmp; n struct big { n int a[35], len; n void read() { n memset(a, 0, sizeof(a)); n len = 0; n char ch = getchar(); n for (; ch < 0 || ch > 9 ; ch = getchar()) n ; n for (; ch >= 0 && ch <= 9 ; ch = getchar()) a[len++] = ch - 48; n } n long long mod() { n long long ans = 0; n for (int i = 0; i < len; i++) n ans = (10ll * ans + a[i]) % 1000000000000000007ll; n return ans; n } n void plus() { n a[len - 1]++; n for (int i = len - 1; i >= 1; i--) a[i - 1] += a[i] / 10, a[i] %= 10; n if (a[0] > 9) { n a[0] = 1; n for (int i = 1; i <= len; i++) a[i] = 0; n len++; n } n } n } L, R; n int sum[40], times = 0; n void dfs(int dep, int cnt, int sum, long long msk) { n int mx = sum + (18 - cnt) * 9; n tmp = pre[mx >> 1]; n if (sum >> 1) tmp ^= pre[(sum >> 1) - 1]; n if ((vis[dep - 1] & tmp) == tmp) return; n if (dep == 10) { n for (int i = sum >> 1; i >= 0; i--) n if (vis[dep - 1][i]) { n int dif = sum - i - i; n if (dif > 1) { n ::sum[cnt]++; n f[dif][0].update(0, msk, 1); n } n break; n } n return; n } n vis[dep] = vis[dep - 1]; n dfs(dep + 1, cnt, sum, msk); n for (; cnt < 18;) { n vis[dep] |= vis[dep] << dep; n dfs(dep + 1, ++cnt, sum += dep, msk += bit[dep]); n } n } n long long solve(int dif, big lim) { n long long ans = 0, msk = 0; n int len = lim.len; n state *F = f[dif]; n for (int i = 0; i < len; i++) n if (len - i > 18) { n for (int j = 0; j < lim.a[i]; j++) ans += F[len - i - 1].find(9, msk); n } else if (lim.a[i]) { n ans += F[len - i].find(lim.a[i] - 1, msk); n msk += bit[lim.a[i]]; n } n return ans; n } n long long solve2(big lim) { n int len = lim.len; n long long ans = 0; n int part = 0; n for (int i = 0; i < len; i++) { n int odd = lim.a[i] >> 1, even = lim.a[i] - odd; n ans += c[part][len - 1 - i] * odd + c[part ^ 1][len - 1 - i] * even; n part ^= lim.a[i] & 1; n } n return ans; n } n inline long long read() { n long long x = 0; n char ch = getchar(); n for (; ch < 0 || ch > 9 ; ch = getchar()) n ; n for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 - 48 + ch; n return x; n } n int main() { n pre[0][0] = 1; n for (int i = 1; i <= 190; i++) pre[i] = pre[i - 1], pre[i][i] = 1; n c[0][0] = 1; n for (int i = 1; i <= 18; i++) n c[0][i] = c[1][i] = n 5ll * (c[0][i - 1] + c[1][i - 1]) % 1000000000000000007ll; n bit[1] = 1; n for (int i = 2; i < 10; i++) bit[i] = bit[i - 1] << 5; n vis[0].set(0); n dfs(1, 0, 0, 0); n for (int i = 2; i < 10; i++) { n f[i][0].sum(); n for (int j = 0; j < 18; j++) { n state &cur = f[i][j], &nxt = f[i][j + 1]; n for (int id = 0, sz = cur.size(); id < sz; id++) { n int cnt = j; n long long way = cur.nodes[id].v[9]; n long long msk = cur.nodes[id].sta, tmp = msk; n for (int k = 1; k < 10; k++, tmp >>= 5) { n int rem = tmp & 31; n if (!rem) continue; n cnt += rem; n nxt.update(k, msk - bit[k], way); n } n if (cnt < 18) nxt.update(0, msk, way); n } n nxt.sum(); n } n } n int Q = read(); n while (Q--) { n L.read(); n R.read(); n R.plus(); n int k = read(); n long long ans = R.mod() - L.mod(); n if (!k) { n ans -= solve2(R) - solve2(L); n for (int i = 2; i < 10; i += 2) ans -= solve(i, R) - solve(i, L); n } else n for (int i = k + 1; i < 10; i++) ans -= solve(i, R) - solve(i, L); n printf( %lld n , (ans % 1000000000000000007ll + 1000000000000000007ll) % n 1000000000000000007ll); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mod = 1000000007; n vector v(100004); n vector t(100004, 0); n int n; n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n int bsearch(int r, int key) { n int l = -1; n while (r - l > 1) { n int m = (r + l) / 2; n if (t[m] >= key) { n r = m; n } else { n l = m; n } n } n return r; n } n int longest() { n int length = 1; n t[0] = v[0]; n for (int i = 1; i < n; ++i) { n if (v[i] < t[0]) n t[0] = v[i]; n else if (v[i] > t[length - 1]) { n t[length] = v[i]; n length++; n } else { n t[bsearch(length - 1, v[i])] = v[i]; n } n } n return length; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 0; i < n; ++i) { n cin >> v[i]; n } n cout << longest(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map dd; n map tong; n int main() { n long long n; n cin >> n; n string s; n cin >> s; n long long sum = 0; n for (long long i = 0; i < s.size(); i++) { n sum += (s[i] - 0 ); n } n for (long long i = 2; i <= s.size(); i++) { n if (sum % i == 0) { n long long tmp = sum / i, dem = 0; n long long sum1 = 0; n for (long long j = 0; j < s.size(); j++) { n sum1 += (s[j] - 0 ); n if (sum1 == tmp) { n sum1 = 0; n dem++; n } n } n if (dem == i) { n cout << YES ; n return 0; n } n } n } n cout << NO ; n } n "} +{"func_code_string": "#include n #include n #include n using namespace std; n const int N=105; n const int MOD=1000000007; n int n,q; n int c[N]; n int b[N]; n int sb[N],sc[N]; n int l,r; n int solve(int x) n { n static int f[N][N*N],g[N][N*N]; n f[0][0]=g[0][0]=1; n for(int i=1;i<=n;i++) n { n for(int j=0;j=0?g[i-1][j-min(c[i],j)-1]:0)+MOD)%MOD; n g[i][0]=f[i][0]; n for(int j=1;j<=sc[i];j++) n g[i][j]=(g[i][j-1]+f[i][j])%MOD; n } n int ans=0; n for(int j=0;j<=sc[n];j++) n ans=(ans+f[n][j])%MOD; n return ans; n } n unordered_mapres; n int main() n { n scanf( %d ,&n); n for(int i=1;i<=n;i++) n scanf( %d ,&c[i]); n for(int i=1;ir) printf( %d n ,0); n else printf( %d n ,res[x]); n } n return 0; n }"} +{"func_code_string": "#include n using namespace std; n int m = 1e9 + 7; n int p = 31; n int main() { n ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); n ; n long long t = 1; n cin >> t; n while (t--) { n long long w, h; n cin >> w >> h; n long long k1, k2, k3, k4; n cin >> k1; n vector points_h1; n for (int i = 0; i < k1; i++) { n long long x; n cin >> x; n points_h1.push_back(x); n } n cin >> k2; n vector points_h2; n for (int i = 0; i < k2; i++) { n long long x; n cin >> x; n points_h2.push_back(x); n } n cin >> k3; n vector points_v1; n for (int i = 0; i < k3; i++) { n long long x; n cin >> x; n points_v1.push_back(x); n } n cin >> k4; n vector points_v2; n for (int i = 0; i < k4; i++) { n long long x; n cin >> x; n points_v2.push_back(x); n } n long long ans = max({w * (points_v1[points_v1.size() - 1] - points_v1[0]), n w * (points_v2[points_v2.size() - 1] - points_v2[0]), n h * (points_h1[points_h1.size() - 1] - points_h1[0]), n h * (points_h2[points_h2.size() - 1] - points_h2[0])}); n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void read(T &x) { n int f = 0; n x = 0; n char ch = getchar(); n for (; !isdigit(ch); ch = getchar()) f |= (ch == - ); n for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - 0 ; n if (f) x = -x; n } n const int N = 200005; n int a[N], b[N], c[N], ans[N], n, m, cnt, s; n pair, int> x[N]; n int check(int lim) { n priority_queue, vector >, n greater > > n Q; n int cost = 0, rem = 0, id = 0; n for (int i = (cnt); i >= (1); i--) { n if (x[i].second == 0) { n if (!rem) { n if (Q.empty()) return 0; n rem = lim, cost += Q.top().first, id = Q.top().second, Q.pop(); n if (cost > s) return 0; n } n rem--, ans[-x[i].first.second] = id; n } else { n Q.push(make_pair(x[i].first.second, x[i].second)); n } n } n return 1; n } n int main() { n read(n), read(m), read(s); n for (int i = (1); i <= (m); i++) { n read(a[i]); n x[++cnt] = make_pair(make_pair(a[i], -i), 0); n } n for (int i = (1); i <= (n); i++) { n read(b[i]); n } n for (int i = (1); i <= (n); i++) { n read(c[i]); n x[++cnt] = make_pair(make_pair(b[i], c[i]), i); n } n sort(x + 1, x + cnt + 1); n int l = 1, r = m + 1; n while (l < r) { n int mid = (l + r) >> 1; n if (check(mid)) n r = mid; n else n l = mid + 1; n } n if (l == m + 1) n puts( NO ); n else { n puts( YES ); n check(l); n for (int i = (1); i <= (m); i++) { n printf( %d%c , ans[i], n [i == m]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int arr[1001][1001]; n int main() { n int n, m, f1 = 0; n cin >> n >> m; n int cnt = m; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n if (i != j && arr[i][j] == 0) { n arr[i][j] = 1; n arr[j][i] = -1; n cnt--; n } n if (cnt == 0) break; n } n if (cnt > 0) { n f1 = 1; n break; n } n cnt = m; n } n if (f1 == 1) n cout << -1 << endl; n else { n cout << n * m << endl; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) n if (arr[i][j] == 1) cout << i + 1 << << j + 1 << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void print1d(vector &a) { n for (long long int i = 0; i < a.size(); i++) { n cout << a[i] << ; n } n cout << endl; n } n vector divisor(long long int n) { n vector a; n for (long long int i = 1; i * i <= n; i++) { n if (n % i == 0) { n if (n / i == i) n a.push_back(i); n else { n a.push_back(i); n a.push_back(n / i); n } n } n } n return a; n } n bool sortsecond(const pair &a, n const pair &b) { n return a.second < b.second; n } n bool isPrime(long long int n) { n for (long long int i = 2; i * i <= n; i++) { n if (n % i == 0) return false; n } n return true; n } n vector split_string(const string &s, const string &delimiter) { n vector token; n string ans; n size_t end_point, start_point = 0, delim_length = delimiter.length(); n while ((end_point = s.find(delimiter, start_point)) != string::npos) { n ans = s.substr(start_point, end_point - start_point); n start_point = end_point + delim_length; n token.push_back(ans); n } n token.push_back(s.substr(start_point)); n return token; n } n bool is_vowel(const char &a) { n switch (a) { n case a : n case e : n case i : n case o : n case u : n case y : n case A : n case E : n case I : n case O : n case U : n return true; n break; n default: n return false; n break; n } n } n bool sortstring(const string &a, const string &b) { n return a.length() < b.length(); n } n void convert(string &s) { n for (long long int i = 0; i < s.length(); i++) { n if (s[i] >= A && s[i] <= Z ) s[i] = s[i] - A + a ; n if (s[i] == o ) n s[i] = 0 ; n else if (s[i] == l || s[i] == i ) n s[i] = 1 ; n } n } n const long long int K = 998244353; n void solve() { n long long int n; n cin >> n; n string s; n cin >> s; n long long int fir = 0; n long long int las = 0; n char c = s[0]; n long long int k = 0; n for (long long int i = 0; i < n; i++) { n k = i; n if (s[i] == c) n fir++; n else { n break; n } n } n c = s[n - 1]; n for (long long int i = n - 1; i >= k; i--) { n if (s[i] == c) n las++; n else n break; n } n if (s[0] == s[n - 1]) n cout << ((las + 1) * (fir + 1)) % K << endl; n else n cout << (fir + las + 1) % K << endl; n return; n } n int32_t main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n ; n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #define l1 long long int n #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); n #define test l1 t;cin>>t;while(t--) n // Function to check n // if parentheses are balanced n bool isBalanced(string exp) n { n n // Initialising Variables n bool flag = true; n l1 count = 0; n n // Traversing the Expression n for (l1 i = 0; i < exp.length(); i++) { n n if (exp[i] == ( ) { n count++; n } n else { n n // It is a closing parenthesis n count--; n } n if (count < 0) { n n // This means there are n // more Closing parenthesis n // than opening ones n flag = false; n break; n } n } n n // If count is not zero, n // It means there are n // more opening parenthesis n if (count != 0) { n flag = false; n } n n return flag; n } n n int main() n { n fast n test n { n l1 i,l; n string str,str1= ,str2= ; n cin>>str; n l=str.size(); n l1 a=0,b=0,c=0; n for(i=0;i n using namespace std; n int main() { n string s; n cin >> s; n int l = s.size(); n int a[2]; n int b[2]; n a[0] = a[1] = 0; n b[0] = b[1] = 0; n long long ans_odd = 0LL; n long long ans_even = 0LL; n for (int i = 0; i < l; i++) { n ans_odd++; n if (s[i] == a ) { n ans_even += a[1 - i % 2]; n ans_odd += a[i % 2]; n } else { n ans_even += b[1 - i % 2]; n ans_odd += b[i % 2]; n } n a[i % 2] += (s[i] == a ); n b[i % 2] += (s[i] == b ); n } n cout << ans_even << << ans_odd << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin.sync_with_stdio(false); n cout.sync_with_stdio(false); n cin >> n; n vector q(1000100, 0); n for (long long i = 0; i < n; i++) { n long long t; n cin >> t; n q[t]++; n } n long long ans = 0; n for (long long i = 0; (i < 1000100 - 1); ++i) { n if (q[i] % 2 == 1) ans++; n q[i + 1] += q[i] / 2; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n bool chmax(T& a, const T& b) { n return a < b ? (a = b, true) : false; n } n template n bool chmin(T& a, const T& b) { n return b < a ? (a = b, true) : false; n } n int N, Q; n const int MAX_N = 100000; n const int BUCKET = 100, SIZE = 1000; n char S[MAX_N + 17]; n int bucketCnt[BUCKET][10][11][4]; n int getId(char c) { n if (c == A ) return 0; n if (c == C ) return 1; n if (c == G ) return 2; n return 3; n } n void init() { n for (int i = (int)(0); i < (int)(N); i++) { n int bucketL = i / SIZE * SIZE; n for (int j = (int)(1); j < (int)(11); j++) { n bucketCnt[i / SIZE][(i - bucketL) % j][j][getId(S[i])]++; n } n } n } n void change(int idx, char c) { n int bucketL = idx / SIZE * SIZE; n for (int j = (int)(1); j < (int)(11); j++) { n bucketCnt[idx / SIZE][(idx - bucketL) % j][j][getId(S[idx])]--; n } n S[idx] = c; n for (int j = (int)(1); j < (int)(11); j++) { n bucketCnt[idx / SIZE][(idx - bucketL) % j][j][getId(S[idx])]++; n } n } n int getImpact(int l, int r, int M, char e[]) { n int res = 0; n for (int i = (int)(0); i < (int)(BUCKET); i++) { n int bucketL = i * SIZE, bucketR = min(N, (i + 1) * SIZE); n if (r <= bucketL || bucketR <= l) continue; n if (l <= bucketL && bucketR <= r) { n for (int j = (int)(0); j < (int)(min(M, bucketR - bucketL)); j++) { n int x = (bucketL + j - l) % M; n res += bucketCnt[i][j][M][getId(e[x])]; n } n continue; n } n for (int j = (int)(max(bucketL, l)); j < (int)(min(bucketR, r)); j++) { n int x = (j - l) % M; n res += e[x] == S[j]; n } n } n return res; n } n int main() { n scanf( %s , S); n N = strlen(S); n init(); n scanf( %d , &Q); n for (int i = (int)(0); i < (int)(Q); i++) { n int t; n scanf( %d , &t); n if (t == 1) { n int x; n char c[17]; n scanf( %d%s , &x, c); n x--; n change(x, c[0]); n } else { n int l, r; n char e[17]; n scanf( %d%d%s , &l, &r, e); n l--; n int M = strlen(e); n printf( %d n , getImpact(l, r, M, e)); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n int n, k; n cin >> n >> k; n vector v(n); n for (auto &it : v) cin >> it; n int ans = 0; n sort(v.begin(), v.end()); n for (int i = n - 1; i >= n - k; i--) ans += v[i - k] / v[i]; n for (int i = 0; i < n - 2 * k; i++) ans += v[i]; n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, arr[1000], arr2[1000], i = 0; n cin >> n; n while (i < n) { n cin >> arr[i]; n arr2[arr[i]] = i + 1; n i++; n } n sort(arr, arr + n); n for (i = 0; i < n; i++) { n cout << arr2[arr[i]] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 105; n int zy[N][N * N / 2]; n bool dp[N][N * N / 2]; n deque ans; n void dfs(int n, int k) { n if (n == 1) { n ans.push_back(1); n return; n } else { n if (zy[n][k] > 0) { n dfs(n - zy[n][k] + 1, k - zy[n][k]); n int sz = ans.size(); n ans.push_front(zy[n][k] / 2 + sz); n if (zy[n][k] & 1) { n for (int i = (int)1; i <= (int)zy[n][k] / 2 - 2; ++i) { n ans.push_back(sz + zy[n][k] / 2 + i); n ans.push_back(sz + i); n } n ans.push_back(sz + zy[n][k] - 1); n ans.push_back(sz + zy[n][k] / 2 - 1); n ans.push_back(sz + zy[n][k] - 2); n } else { n for (int i = (int)1; i <= (int)zy[n][k] / 2 - 1; ++i) { n ans.push_back(sz + zy[n][k] / 2 + i); n ans.push_back(sz + i); n } n } n } else { n dfs(n + zy[n][k] + 1, k + zy[n][k] * (1 - zy[n][k]) / 2 + 1); n int sz = ans.size(); n if (ans.front() > ans.back()) { n for (int i = (int)1; i <= (int)-zy[n][k] - 1; ++i) n ans.push_back(sz + i); n } else { n for (int i = (int)1; i <= (int)-zy[n][k] - 1; ++i) n ans.push_front(sz + i); n } n } n } n } n int main() { n dp[1][1] = 1; n for (int i = (int)2; i <= (int)100; ++i) { n for (int j = (int)i + 1; j <= (int)i * (i + 1) / 2; ++j) { n for (int k = (int)i; k >= (int)2; --k) { n if (k * (k + 1) / 2 <= j && n dp[i - (k - 1)][j - (k * (k + 1) / 2 - 1)]) { n dp[i][j] = 1; n zy[i][j] = -k; n break; n } n if (k >= 4 && dp[i - k + 1][j - k]) { n dp[i][j] = 1; n zy[i][j] = k; n break; n } n } n } n } n int q, n, k; n cin >> q; n while (q--) { n cin >> n >> k; n if (!dp[n][k]) { n puts( NO ); n } else { n dfs(n, k); n puts( YES ); n while (ans.size()) { n cout << ans.front() << ; n ans.pop_front(); n } n cout << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n char ara[55][55]; n bool ok(int i, int j) { n if (i >= n || j < 0 || j >= n) return false; n if (ara[i][j] == # ) return false; n return true; n } n int main() { n while (cin >> n) { n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n cin >> ara[i][j]; n } n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n if (ara[i][j] == . ) { n if (ok(i + 1, j) && ok(i + 1, j - 1) && ok(i + 1, j + 1) && n ok(i + 2, j)) { n ara[i][j] = ara[i + 1][j] = ara[i + 1][j - 1] = ara[i + 1][j + 1] = n ara[i + 2][j] = # ; n } n } n } n } n bool flag = true; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n if (ara[i][j] == . ) { n flag = false; n } n } n } n cout << (flag ? YES n : NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, first = 0, second = 0, no = 0, spare; n cin >> n; n vector v1; n vector v2; n for (long long i = 0; i < n; i++) { n long long p; n cin >> p; n if (p > 0) { n first += p; n v1.push_back(p); n } else { n second += abs(p); n v2.push_back(abs(p)); n } n if (i == n - 1) spare = p; n } n if (first > second) n cout << first ; n else if (second > first) n cout << second ; n else { n long long q = min(v1.size(), v2.size()); n for (long long i = 0; i < q; i++) { n if (v1[i] > v2[i]) { n cout << first ; n no++; n break; n } else if (v1[i] < v2[i]) { n cout << second ; n no++; n break; n } n } n if (no == 0) { n if (spare > 0) n cout << first ; n else n cout << second ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream& operator<<(ostream& cout, const pair& a) { n return cout << ( << a.first << ; << a.second << ) ; n } n template n ostream& operator<<(ostream& cout, const vector& a) { n if (a.size() == 0) { n return cout << () ; n } n cout << ( << a[0]; n for (int i = 1; i < (int)a.size(); i++) { n cout << ; << a[i]; n } n return cout << ) ; n } n template n ostream& operator<<(ostream& cout, const set& a) { n if (a.size() == 0) { n return cout << {} ; n } n auto it = a.begin(); n cout << { << *it; n ++it; n for (; it != a.end(); ++it) { n cout << ; << *it; n } n return cout << } ; n } n long long a1, a2, a3; n int main() { n cin >> a1; n cin >> a2; n cin >> a3; n cout << min({(a1 + a2) * 2, a1 + a3 + a2, (a1 + a3) * 2, (a2 + a3) * 2}); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int i, n, j; n cin >> n; n int arr[n], a[n]; n set s1, s2; n int flag = 0, p = 0; n for (i = 0; i < n; i++) { n cin >> arr[i]; n a[i] = arr[i]; n s2.insert(arr[i]); n if (arr[i] == 0) flag = 1; n } n sort(a, a + n); n if (flag == 1) { n p == 0; n for (i = 0; i < n; i++) { n s1.clear(); n if (a[i] != 0) { n for (j = 0; j < n; j++) { n int p = (a[i] ^ arr[j]); n s1.insert(p); n } n } n if (s2 == s1) { n p = 1; n cout << a[i] << n ; n break; n } n } n if (p == 0) cout << -1 n ; n } else { n p = 0; n for (i = 1; i < 1025; i++) { n s1.clear(); n for (j = 0; j < n; j++) { n s1.insert(i ^ arr[j]); n } n if (s2 == s1) { n p = 1; n cout << i << n ; n break; n } n } n if (p == 0) cout << -1 n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int ini() { n int x; n scanf( %d , &x); n return x; n } n long long inl() { n long long x; n scanf( %lld , &x); n return x; n } n void file_mamager() {} n int arr[105], mask[105], dp[105][1 << 17]; n pair path[105][1 << 17]; n vector primes; n void gen() { n for (int i = 2; i <= 60; i++) { n bool is = true; n for (int j = 2; j * j <= i; j++) { n if (i % j == 0) { n is = false; n break; n } n } n if (is) primes.push_back(i); n } n } n void bit_rep(int x) { n for (int i = 0; i < 10; i++) cout << ((x >> i) & 1); n cout << n ; n } n int main() { n gen(); n int n = ini(); n for (int i = 1; i <= n; i++) { n for (int j = 0; j < (1 << 17); j++) dp[i][j] = 1e8; n } n for (int i = 1; i <= n; i++) arr[i] = ini(); n for (int i = 1; i <= 60; i++) { n int x = 0, y = i; n for (int j = 0; j < 17; j++) { n if (y % primes[j] == 0) { n x |= (1 << j); n while (y % primes[j] == 0) y /= primes[j]; n } n } n mask[i] = x; n } n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= 60; j++) { n for (int k = 0; k < (1 << 17); k++) { n if ((k & mask[j]) == mask[j]) { n if (dp[i - 1][k ^ mask[j]] + abs(arr[i] - j) < dp[i][k]) { n dp[i][k] = dp[i - 1][k ^ mask[j]] + abs(arr[i] - j); n path[i][k] = {(k ^ mask[j]), j}; n } n } n } n } n } n int mn = 1e8; n int x = (1 << 17) - 1; n for (int k = 0; k < (1 << 17); k++) { n if (dp[n][k] < mn) { n mn = dp[n][k]; n x = k; n } n } n vector ans; n for (int i = n; i >= 1; i--) { n ans.push_back(path[i][x].second); n x = path[i][x].first; n } n reverse(ans.begin(), ans.end()); n for (int xx : ans) cout << xx << ; n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using vi = vector; n using vvi = vector>; n using vl = vector; n using vvl = vector>; n using pi = pair; n using pl = pair; n template n void print(U arr) { n for (auto element : arr) { n cout << element << ; n } n cout << n ; n } n void setup(string s) { n freopen((s + .in ).c_str(), r , stdin); n freopen((s + .out ).c_str(), w , stdout); n } n const int M = 1e9 + 7; n const int mxN = 1e5 + 1; n vvi adj(mxN); n vi lvl(mxN, 0), sub(mxN, 0); n int getSize(int i, int p) { n sub[i] = 1; n for (auto& e : adj[i]) { n if (e != p && !lvl[e]) { n sub[i] += getSize(e, i); n } n } n return sub[i]; n } n ll centroid(int i, int p, int n) { n for (auto& e : adj[i]) { n if (e != p && !lvl[e] && sub[e] > n / 2) return centroid(e, i, n); n } n return i; n } n ll decomp(ll i, ll l) { n ll cent = centroid(i, -1, getSize(i, -1)); n lvl[cent] = l; n for (ll j : adj[cent]) n if (!lvl[j]) decomp(j, l + 1); n return cent; n } n int main(void) { n ios::sync_with_stdio(false); n cin.tie(0); n int n; n cin >> n; n for (ll _ = 0; _ < n - 1; _++) { n int a, b; n cin >> a >> b; n adj[a].push_back(b); n adj[b].push_back(a); n } n decomp(1, 1); n for (ll i = 1; i < n + 1; i++) cout << (char)( A + lvl[i] - 1) << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s; n int l, r; n inline void get() { n l = 1; n r = 2; n printf( ? %d %d n , l, r); n fflush(stdout); n cin >> s; n while (s[0] == y ) { n l <<= 1; n r <<= 1; n printf( ? %d %d n , l, r); n fflush(stdout); n cin >> s; n } n } n int main() { n int mid; n while (1) { n cin >> s; n if (s[0] == e ) { n return 0; n } n get(); n while (l + 1 < r) { n mid = l + r >> 1; n printf( ? %d %d n , l, mid); n fflush(stdout); n cin >> s; n if (s[0] == x ) n r = mid; n else n l = mid; n } n printf( ? %d %d n , 0, l); n fflush(stdout); n cin >> s; n if (s[0] == x ) n printf( ! %d n , l), fflush(stdout); n else n printf( ! %d n , r), fflush(stdout); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dx[] = {0, 0, 1, -1, 1, 1, -1, -1}; n int dy[] = {1, -1, 0, 0, 1, -1, 1, -1}; n char mat[105][105]; n int n, m; n int main() { n scanf( %d %d , &n, &m); n for (int i = 0; i < n; i++) { n scanf( %s , mat[i]); n } n int flag = 0; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (mat[i][j] == * ) continue; n int cnt = 0; n for (int k = 0; k < 8; k++) { n if (i + dx[k] < 0 || j + dy[k] < 0 || i + dx[k] >= n || j + dy[k] >= m) n continue; n if (mat[i + dx[k]][j + dy[k]] == * ) cnt++; n } n int koto; n if (mat[i][j] == . ) n koto = 0; n else n koto = mat[i][j] - 0 ; n if (cnt != koto) flag = 1; n } n } n if (flag == 1) { n cout << NO << endl; n } else n cout << YES << endl; n } n "} +{"func_code_string": "#include n using namespace std; n string s; n void rd() { n cin >> s; n if (s != start ) exit(0); n } n int q(int x, int y) { n cout << ? << x << << y << endl; n cin >> s; n if (s[0] == x ) return 1; n if (s[0] == y ) return 0; n exit(0); n } n int main() { n int i, l, r; n while (1) { n rd(); n if (q(0, 1)) { n cout << ! << 1 << endl; n continue; n } n for (i = 1; 1; i <<= 1) n if (q(i, i + i)) break; n for (l = i + 1, r = i + i; l < r;) { n i = ((long long)l + r) / 2; n if (q(i, r)) n l = i + 1; n else n r = i; n } n cout << ! << l << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct E { n int to, col, time, ind; n E(int to, int col, int time, int ind) n : to(to), col(col), time(time), ind(ind) {} n }; n int n, m, cnt; n vector g[50000]; n int a[50000], b[50000], c[50000], d[50000], t[50000]; n map > colInd; n const int INF = 1e9 + 99; n vector sat[311111], rev[311111], tmp[311111], ord; n bool used[311111]; n int cmp[311111], curCmp; n void dfs1(int v) { n used[v] = true; n for (int to : sat[v]) n if (!used[to]) { n dfs1(to); n } n ord.push_back(v); n } n void dfs2(int v) { n cmp[v] = curCmp; n for (int to : rev[v]) n if (cmp[to] == -1) { n dfs2(to); n } n } n bool solve(int bound) { n for (int i = 0; i < (int)(cnt << 1); ++i) sat[i] = tmp[i]; n for (int i = 0; i < (int)(m); ++i) n if (t[i] > bound) { n sat[i << 1].push_back((i << 1) | 1); n } n for (int i = 0; i < (int)(cnt << 1); ++i) rev[i].clear(); n for (int i = 0; i < (int)(cnt << 1); ++i) n for (int to : sat[i]) { n rev[to].push_back(i); n } n for (int i = 0; i < (int)(cnt << 1); ++i) used[i] = false; n ord.clear(); n for (int i = 0; i < (int)(cnt << 1); ++i) n if (!used[i]) { n dfs1(i); n } n reverse(ord.begin(), ord.end()); n for (int i = 0; i < (int)(cnt << 1); ++i) cmp[i] = -1; n curCmp = 0; n for (int i : ord) n if (cmp[i] == -1) { n dfs2(i); n ++curCmp; n } n for (int i = 0; i < (int)(cnt); ++i) n if (cmp[i << 1] == cmp[(i << 1) | 1]) { n return false; n } n return true; n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < (int)(m); ++i) { n int from, to, c, tt; n scanf( %d%d%d%d , &from, &to, &c, &tt), --from, --to; n g[from].push_back(E(to, c, tt, i)); n g[to].push_back(E(from, c, tt, i)); n t[i] = tt; n } n for (int i = 0; i < (int)(n); ++i) { n a[i] = -1; n for (E e : g[i]) { n auto it = colInd.find(e.col); n if (it != colInd.end()) { n if (a[i] != -1) { n printf( No n ); n return 0; n } n a[i] = it->second.first; n b[i] = e.ind; n c[i] = it->second.second; n d[i] = e.time; n } else { n colInd[e.col] = make_pair(e.ind, e.time); n } n } n colInd.clear(); n } n int lo = 0, hi = 0, mid; n for (int i = 0; i < (int)(n); ++i) n if (a[i] != -1) { n lo = max(lo, min(c[i], d[i])); n hi = max(hi, max(c[i], d[i])); n } n if (hi == 0) { n printf( Yes n0 0 n ); n return 0; n } n cnt = m; n for (int i = 0; i < (int)(n); ++i) n if ((int)g[i].size() > 1) { n for (int j = 0; j < (int)((int)g[i].size() - 1); ++j) { n tmp[g[i][j].ind << 1].push_back((cnt + j) << 1); n tmp[((cnt + j) << 1) | 1].push_back((g[i][j].ind << 1) | 1); n } n for (int j = 0; j < (int)((int)g[i].size() - 2); ++j) { n tmp[(cnt + j) << 1].push_back((cnt + j + 1) << 1); n tmp[((cnt + j + 1) << 1) | 1].push_back(((cnt + j) << 1) | 1); n } n for (int j = 1; j < (int)g[i].size(); ++j) { n tmp[g[i][j].ind << 1].push_back(((cnt + j - 1) << 1) | 1); n tmp[(cnt + j - 1) << 1].push_back((g[i][j].ind << 1) | 1); n } n cnt += (int)g[i].size() - 1; n } n for (int i = 0; i < (int)(n); ++i) n if (a[i] != -1) { n tmp[(a[i] << 1) | 1].push_back(b[i] << 1); n tmp[(b[i] << 1) | 1].push_back(a[i] << 1); n } n while (lo < hi) { n mid = (lo + hi) >> 1; n if (solve(mid)) { n hi = mid; n } else { n lo = mid + 1; n } n } n if (solve(lo)) { n printf( Yes n ); n vector ans; n for (int i = 0; i < (int)(m); ++i) n if (cmp[(i << 1) | 1] < cmp[i << 1]) { n ans.push_back(i); n } n printf( %d %d n , lo, (int)ans.size()); n for (int x : ans) printf( %d , x + 1); n printf( n ); n } else { n printf( No n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int cna, cnb; n bool isha[108]; n bool ishb[108]; n bool vis[108]; n int main() { n cin >> n >> m; n cin >> cna; n int tmp; n for (int i = 0; i < cna; i++) { n scanf( %d , &tmp); n isha[tmp] = 1; n } n cin >> cnb; n for (int i = 0; i < cnb; i++) { n scanf( %d , &tmp); n ishb[tmp] = 1; n } n for (int i = 0; i < n; i++) { n if (!isha[i]) continue; n int x = i % m; n vis[x] = 1; n ishb[x] = 1; n tmp = 0; n while (true) { n tmp = (tmp + n) % m; n x = (i + tmp) % m; n if (vis[x]) break; n vis[x] = 1; n ishb[x] = 1; n } n } n memset(vis, 0, sizeof vis); n for (int i = 0; i < m; i++) { n if (!ishb[i]) continue; n int x = i % n; n isha[x] = 1; n vis[x] = 1; n tmp = 0; n while (true) { n tmp = (tmp + m) % n; n x = (i + tmp) % n; n if (vis[x]) break; n vis[x] = 1; n isha[x] = 1; n } n } n memset(vis, 0, sizeof vis); n for (int i = 0; i < n; i++) { n if (!isha[i]) continue; n int x = i % m; n vis[x] = 1; n ishb[x] = 1; n tmp = 0; n while (true) { n tmp = (tmp + n) % m; n x = (i + tmp) % m; n if (vis[x]) break; n vis[x] = 1; n ishb[x] = 1; n } n } n memset(vis, 0, sizeof vis); n for (int i = 0; i < m; i++) { n if (!ishb[i]) continue; n int x = i % n; n isha[x] = 1; n vis[x] = 1; n tmp = 0; n while (true) { n tmp = (tmp + m) % n; n x = (i + tmp) % n; n if (vis[x]) break; n vis[x] = 1; n isha[x] = 1; n } n } n bool flag = 0; n for (int i = 0; i < n; i++) { n if (!isha[i]) { n cout << No << endl; n return 0; n } n } n for (int i = 0; i < m; i++) { n if (!ishb[i]) { n cout << No << endl; n return 0; n } n } n cout << Yes << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 310; n int g[maxn][maxn]; n int best[maxn]; n int a[maxn]; n int ans[maxn]; n int main() { n int n; n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n int v; n scanf( %d , &v); n g[i][v] = j; n } n } n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n best[i] = 1000; n } n for (int i = 1; i <= n; i++) { n int cura = -1; n int curb = -1; n for (int j = 1; j <= n; j++) n if (a[j] <= i) { n cura = a[j]; n break; n } n for (int j = 1; j <= n; j++) n if (cura != a[j] && a[j] <= i) { n curb = a[j]; n break; n } n for (int j = 1; j <= n; j++) { n int cur = cura; n if (cura == j) cur = curb; n if (cur == -1) continue; n if (g[j][cur] < best[j]) { n best[j] = g[j][cur]; n ans[j] = i; n } n } n } n for (int i = 1; i <= n; i++) { n printf( %d , ans[i]); n if (i != n) n printf( ); n else n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[300010], cnt, fa[300010], siz[300010], ans; n bool tag[300010]; n inline int find(int x) { n while (x ^ fa[x]) x = fa[x] = fa[fa[x]]; n return x; n } n inline void merge(int x, int y) { n x = find(x), y = find(y); n if (x ^ y) fa[x] = y, siz[y] += siz[x]; n } n int main() { n printf( 1 ); n scanf( %d , &n); n for (int i = 1; i <= n; i++) fa[i] = i, siz[i] = 1; n for (int i = 1; i <= n; i++) { n int p; n scanf( %d , &p); n if (a[p - 1]) { n merge(p, p - 1); n } n if (a[p + 1]) { n merge(p, p + 1); n } n a[p] = 1; n printf( %d , a[n] ? i - siz[find(n)] + 1 : i + 1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, k, i; n cin >> n >> k; n if (n % (2 * k + 1) == 0) { n cout << n / (2 * k + 1) << n ; n for (i = k + 1; i <= n; i += (2 * k + 1)) cout << i << ; n } else if (n % (2 * k + 1) < (k + 1)) { n cout << n / (2 * k + 1) + 1 << n ; n for (i = 1; i <= n; i += (2 * k + 1)) cout << i << ; n } else { n cout << n / (2 * k + 1) + 1 << n ; n for (i = k + 1; i <= n; i += (2 * k + 1)) cout << i << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 3e5 + 7, mod = 998244353, inf = 1e18, MAXN = 1e6 + 7; n const double eps = 1e-9; n mt19937 rnd(time(0)); n long long n; n long long cnt[maxn]; n struct state { n long long a, b, d; n state(long long a, long long b, long long d) : a(a), b(b), d(d) {} n state() : a(0), b(0), d(0) {} n }; n vector have; n bool cmp(state p1, state p2) { return p1.d > p2.d; } n vector gr[maxn]; n vector step[maxn]; n void solve() { n cin >> n; n for (long long i = 1; i <= n; ++i) { n long long d; n cin >> d; n long long a = 2 * i; n long long b = a - 1; n have.emplace_back(b, a, d); n } n sort(have.begin(), have.end(), cmp); n vector even; n for (auto v : have) { n even.push_back(v.a); n } n for (long long i = 1; i < n; ++i) { n gr[even[i - 1]].push_back(even[i]); n } n long long size = n; n for (long long i = 0; i < n; ++i) { n --size; n long long d = have[i].d; n long long b = have[i].b; n if (size < d) { n gr[even.back()].push_back(b); n even.push_back(b); n ++size; n } else { n gr[even[i + d - 1]].push_back(b); n } n } n for (long long i = 1; i <= 2 * n; ++i) { n for (auto v : gr[i]) { n cout << i << << v << n ; n } n } n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.precision(20); n cout << fixed; n long long t = 1; n for (long long i = 0; i < t; ++i) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t = 1; n while (t--) { n long long n; n cin >> n; n long long a[n]; n for (int i = 0; i < n; i++) cin >> a[i]; n if (n == 1) { n cout << 1 1 << endl; n cout << 0 << endl; n cout << 1 1 << endl; n cout << 0 << endl; n cout << 1 1 << endl; n cout << -a[0] << endl; n } else { n cout << 1 1 << endl; n cout << -a[0] << endl; n cout << 2 n << << n << endl; n for (int i = 1; i < n; i++) { n cout << a[i] * (n - 1) << ; n } n cout << endl; n cout << 1 n << << n << endl; n cout << 0 ; n for (int i = 1; i < n; i++) cout << -a[i] * n << ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n struct pt { n int x, y; n }; n int h, t, r, n, m; n int w[205][205], unc[205][205], siofdjsodi[205][205]; n basic_string e[205][205], f[205][205], qu; n pt hd[205], td[205]; n void ae(int i, int j, int u, int v) { n if (u + v > r) return; n e[i][j] += {u, v}; n f[u][v] += {i, j}; n unc[i][j]++; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n cerr.tie(nullptr); n cin >> h >> t >> r; n cin >> n; n for (int i = 1; i <= n; i++) cin >> hd[i].x >> hd[i].y; n cin >> m; n for (int i = 1; i <= m; i++) cin >> td[i].x >> td[i].y; n for (int i = 0; i <= r; i++) { n for (int j = 0; i + j <= r; j++) { n for (int x = 1; x <= min(i, n); x++) { n int u = i - x + hd[x].x; n int v = j + hd[x].y; n ae(i, j, u, v); n } n for (int y = 1; y <= min(j, m); y++) { n int u = i + td[y].x; n int v = j - y + td[y].y; n ae(i, j, u, v); n } n } n } n { n w[0][0] = 1; n qu += pt{0, 0}; n size_t qs = 0; n while (qs != qu.size()) { n auto [i, j] = qu[qs++]; n for (auto [x, y] : f[i][j]) { n if (w[x][y] == 0) { n w[x][y] = 1; n siofdjsodi[x][y] = siofdjsodi[i][j] + 1; n qu += {x, y}; n } n } n } n } n qu = {}; n for (int i = 0; i <= r; i++) { n for (int j = 0; i + j <= r; j++) { n if (w[i][j] == 0 && unc[i][j] == 0) { n qu += {i, j}; n } n } n } n size_t qs = 0; n while (qs != qu.size()) { n auto [i, j] = qu[qs++]; n int q = 0; n for (auto [x, y] : e[i][j]) { n q = max(q, siofdjsodi[x][y]); n } n w[i][j] = -1; n siofdjsodi[i][j] = q + 1; n for (auto [x, y] : f[i][j]) { n if (!--unc[x][y]) { n qu += {x, y}; n } n } n } n if (w[h][t] == 1) { n cout << Ivan n ; n cout << siofdjsodi[h][t] << n ; n } else if (w[h][t] == -1) { n cout << Zmey n ; n cout << siofdjsodi[h][t] << n ; n } else { n cout << Draw n ; n } n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:102400000,102400000 ) n using namespace std; n const int inf = 1e9 + 7; n const long long linf = 1e18; n const double pi = acos(-1.0); n int main() { n ios::sync_with_stdio(false); n int t; n cin >> t; n for (int total = 0; total < t; total++) { n int n, p; n cin >> n >> p; n for (int temp = 0; temp < 2 * n + p;) { n for (int i = 1; i <= n; i++) { n if (temp == 2 * n + p) break; n for (int j = i + 1; j <= n; j++) { n temp++; n cout << i << << j << endl; n if (temp == 2 * n + p) break; n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n static struct FastInput { n static constexpr int BUF_SIZE = 1 << 20; n char buf[BUF_SIZE]; n size_t chars_read = 0; n size_t buf_pos = 0; n FILE* in = stdin; n char cur = 0; n inline char get_char() { n if (buf_pos >= chars_read) { n chars_read = fread(buf, 1, BUF_SIZE, in); n buf_pos = 0; n buf[0] = (chars_read == 0 ? -1 : buf[0]); n } n return cur = buf[buf_pos++]; n } n inline void tie(int) {} n inline explicit operator bool() { return cur != -1; } n inline static bool is_blank(char c) { return c <= ; } n inline bool skip_blanks() { n while (is_blank(cur) && cur != -1) { n get_char(); n } n return cur != -1; n } n inline FastInput& operator>>(char& c) { n skip_blanks(); n c = cur; n return *this; n } n inline FastInput& operator>>(string& s) { n if (skip_blanks()) { n s.clear(); n do { n s += cur; n } while (!is_blank(get_char())); n } n return *this; n } n template n inline FastInput& read_integer(T& n) { n n = 0; n if (skip_blanks()) { n int sign = +1; n if (cur == - ) { n sign = -1; n get_char(); n } n do { n n += n + (n << 3) + cur - 0 ; n } while (!is_blank(get_char())); n n *= sign; n } n return *this; n } n template n inline typename enable_if::value, FastInput&>::type operator>>( n T& n) { n return read_integer(n); n } n inline FastInput& operator>>(__int128& n) { return read_integer(n); } n template n inline typename enable_if::value, FastInput&>::type n operator>>(T& n) { n n = 0; n if (skip_blanks()) { n string s; n (*this) >> s; n sscanf(s.c_str(), %lf , &n); n } n return *this; n } n } fast_input; n static struct FastOutput { n static constexpr int BUF_SIZE = 1 << 20; n char buf[BUF_SIZE]; n size_t buf_pos = 0; n static constexpr int TMP_SIZE = 1 << 20; n char tmp[TMP_SIZE]; n FILE* out = stdout; n inline void put_char(char c) { n buf[buf_pos++] = c; n if (buf_pos == BUF_SIZE) { n fwrite(buf, 1, buf_pos, out); n buf_pos = 0; n } n } n ~FastOutput() { fwrite(buf, 1, buf_pos, out); } n inline FastOutput& operator<<(char c) { n put_char(c); n return *this; n } n inline FastOutput& operator<<(const char* s) { n while (*s) { n put_char(*s++); n } n return *this; n } n inline FastOutput& operator<<(const string& s) { n for (int i = 0; i < (int)s.size(); i++) { n put_char(s[i]); n } n return *this; n } n template n inline char* integer_to_string(T n) { n char* p = tmp + TMP_SIZE - 1; n if (n == 0) { n *--p = 0 ; n } else { n bool is_negative = false; n if (n < 0) { n is_negative = true; n n = -n; n } n while (n > 0) { n *--p = (char)( 0 + n % 10); n n /= 10; n } n if (is_negative) { n *--p = - ; n } n } n return p; n } n template n inline typename enable_if::value, char*>::type stringify(T n) { n return integer_to_string(n); n } n inline char* stringify(__int128 n) { return integer_to_string(n); } n template n inline typename enable_if::value, char*>::type stringify( n T n) { n sprintf(tmp, %.17f , n); n return tmp; n } n template n inline FastOutput& operator<<(const T& n) { n auto p = stringify(n); n for (; *p != 0; p++) { n put_char(*p); n } n return *this; n } n } fast_output; n const int N = 1e6 + 3; n vector inq[N]; n int main() { n ios::sync_with_stdio(false); n fast_input.tie(0); n int n, m, q; n fast_input >> n >> m >> q; n vector> edge(n + 1); n vector> edges; n for (int i = 0; i < m; i++) { n int u, v, w; n fast_input >> u >> v >> w; n edges.emplace_back(u, v, w); n edge[u].emplace_back(i); n } n priority_queue> pq; n const long long inf = 1e18; n vector d(n + 1, inf); n d[1] = 0; n pq.emplace(d[1], 1); n while ((int)pq.size()) { n auto x = pq.top(); n pq.pop(); n if (-x.first != d[x.second]) continue; n int v = x.second; n for (auto& x : edge[v]) { n int u = get<1>(edges[x]); n if (d[u] > d[v] + get<2>(edges[x])) { n d[u] = d[v] + get<2>(edges[x]); n pq.emplace(-d[u], u); n } n } n } n vector add(m); n for (int i = 0; i < m; i++) { n auto& x = edges[i]; n add[i] = get<2>(x) - (d[get<1>(x)] - d[get<0>(x)]); n } n int up = 0; n while (q--) { n int type; n fast_input >> type; n if (type == 1) { n int v; n fast_input >> v; n if (up) { n vector dist(n + 1, (int)1e9); n dist[1] = 0; n inq[0].emplace_back(1); n for (int i = 0; i <= up; i++) { n for (int j = 0; j < (int)inq[i].size(); j++) { n int v = inq[i][j]; n if (dist[v] != i) continue; n for (auto& x : edge[v]) { n int u = get<1>(edges[x]); n if (dist[u] > dist[v] + add[x]) { n dist[u] = dist[v] + add[x]; n if (dist[u] <= up) inq[dist[u]].emplace_back(u); n } n } n } n inq[i].clear(); n } n for (int i = 1; i <= n; i++) d[i] = min(d[i] + dist[i], inf); n for (int i = 0; i < m; i++) { n auto& x = edges[i]; n add[i] -= (dist[get<1>(x)] - dist[get<0>(x)]); n } n up = 0; n } n if (d[v] != inf) n fast_output << d[v] << n ; n else n fast_output << -1 n ; n } else { n int foo; n fast_input >> foo; n for (int i = 0; i < foo; i++) { n int x; n fast_input >> x; n --x; n add[x]++; n } n up += foo; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000007; n long long ksm(long long a, long long b) { n long long res = 1; n a %= mod; n assert(b >= 0); n for (; b; b >>= 1) { n if (b & 1) res = res * a % mod; n a = a * a % mod; n } n return res; n } n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n const int N = 1e5; n int n, t, p[N], pos[N], tmp[N]; n int main() { n scanf( %d , &t); n while (t--) { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &p[i]); n tmp[i] = 0; n pos[p[i]] = i; n } n bool f = false; n for (int i = 1; i <= n; i++) { n if (tmp[pos[i]]) { n continue; n } else { n tmp[pos[i]] = i; n int x = i + 1; n for (int j = pos[i] + 1, x = i + 1; j <= n; j++) { n if (tmp[j]) break; n tmp[j] = x++; n } n i = x - 1; n } n } n for (int i = 1; i <= n; i++) { n if (p[i] == tmp[i]) continue; n f = true; n break; n } n if (f) n puts( NO ); n else n puts( YES ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void debug(T1 e) { n cout << e << endl; n } n template n void debug(T1 e1, T2 e2) { n cout << e1 << t << e2 << endl; n } n template n void debug(T1 e1, T2 e2, T3 e3) { n cout << e1 << t << e2 << t << e3 << endl; n } n template n void debug(T1 e1, T2 e2, T3 e3, T4 e4) { n cout << e1 << t << e2 << t << e3 << t << e4 << endl; n } n template n void debug(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) { n cout << e1 << t << e2 << t << e3 << t << e4 << t << e5 << endl; n } n template n void debug(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) { n cout << e1 << t << e2 << t << e3 << t << e4 << t << e5 << t n << e6 << endl; n } n template n void debug(vector > e, int row, int col) { n int i, j; n for (i = 0; i < row; i++) { n for (j = 0; j < col; j++) cout << e[i][j] << ; n cout << endl; n } n cout << endl; n } n template n void debug(vector > e, int row, int col) { n int i, j; n for (i = 0; i < row; i++) { n for (j = 0; j < col; j++) cout << e[i][j]; n cout << endl; n } n cout << endl; n } n template n void debug(T e[110][110], int row, int col) { n int i, j; n for (i = 0; i < row; i++) { n for (j = 0; j < col; j++) cout << e[i][j] << ; n cout << endl; n } n } n template n string toString(T n) { n ostringstream oss; n oss << n; n oss.flush(); n return oss.str(); n } n int toInt(string s) { n int r = 0; n istringstream sin(s); n sin >> r; n return r; n } n bool isVowel(char ch) { n ch = tolower(ch); n if (ch == a || ch == e || ch == i || ch == o || ch == u ) n return true; n return false; n } n bool isUpper(char c) { return c >= A && c <= Z ; } n bool isLower(char c) { return c >= a && c <= z ; } n int n; n int arr[2000]; n int main() { n int n; n while (cin >> n) { n int i; n for (i = 1; i <= n; i++) cin >> arr[i]; n if (n % 2 == 0 || n == 1) { n cout << -1 << endl; n continue; n } n int ans = 0; n for (i = n - 1; i > 1; i -= 2) { n int ma = max(arr[i], arr[i + 1]); n arr[i] = 0; n arr[i + 1] = 0; n arr[i / 2] -= ma; n arr[i / 2] = max(0, arr[i / 2]); n ans += ma; n } n ans += arr[1]; n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int read() { n char c = getchar(); n int d = 0, f = 1; n for (; c < 0 || c > 9 ; c = getchar()) n if (c == - ) f = -1; n for (; c >= 0 && c <= 9 ; d = d * 10 + c - 48, c = getchar()) n ; n return d * f; n } n int r, d, n; n const int N = 100001; n struct xint { n int x, y, r; n } a[N]; n int main() { n r = read(), d = read(), n = read(); n int ans = 0; n for (int i = 1; i <= n; ++i) { n a[i].x = read(), a[i].y = read(), a[i].r = read(); n int dis = a[i].x * a[i].x + a[i].y * a[i].y; n if (dis >= (r - d + a[i].r) * (r - d + a[i].r) && r >= a[i].r && n dis <= (r - a[i].r) * (r - a[i].r)) n ans++; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const double PI = acos(-1.0); n const double E = exp(1); n const double EPS = 1e-5; n const int maxn = 2000 + 5; n int n, m; n char mp[maxn][maxn] = {0}; n int dx[] = {1, 0, 0, -1}; n int dy[] = {0, 1, -1, 0}; n int cnt = 0; n bool check(int x, int y) { n if (x < 0 || x >= m || y < 0 || y >= n || mp[x][y] != . ) return false; n return true; n } n void dfs(int x, int y) { n if (!check(x, y)) return; n int num = 0; n int dir; n for (int i = 0; i < (4); i++) { n int xx = x + dx[i]; n int yy = y + dy[i]; n if (check(xx, yy)) { n dir = i; n num++; n } n } n if (num == 1) { n if (dir == 0) { n mp[x][y] = ^ ; n mp[x + dx[dir]][y + dy[dir]] = v ; n } else if (dir == 1) { n mp[x][y] = < ; n mp[x + dx[dir]][y + dy[dir]] = > ; n } else if (dir == 2) { n mp[x][y] = > ; n mp[x + dx[dir]][y + dy[dir]] = < ; n } else if (dir == 3) { n mp[x][y] = v ; n mp[x + dx[dir]][y + dy[dir]] = ^ ; n } n cnt += 2; n for (int i = 0; i < (4); i++) dfs(x + dx[i] + dx[dir], y + dy[i] + dy[dir]); n } n } n int main(void) { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> m >> n; n for (int i = 0; i < (m); i++) cin >> mp[i]; n for (int i = 0; i < (m); i++) n for (int j = 0; j < (n); j++) { n if (mp[i][j] == * ) cnt++; n dfs(i, j); n } n if (cnt != m * n) n puts( Not unique ); n else n for (int i = 0; i < (m); i++) cout << mp[i] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using LL = long long; n using pss = pair; n using pis = pair; n const int maxn = 300300; n int n; n LL val[maxn], mask[maxn], sum; n signed main() { n while (cin >> n) { n sum = 0; n for (int i = 1; i <= n; i++) { n cin >> val[i] >> mask[i]; n sum += val[i]; n } n for (int i = 1; i <= n; i++) { n if (sum < 0) { n val[i] = -val[i]; n } n } n LL ret = 0; n for (int k = 0; k < 62; k++) { n LL tot = 0; n for (int i = 1; i <= n; i++) { n if (mask[i] == (1LL << k)) { n tot += val[i]; n } n } n if (tot > 0) ret |= (1LL << k); n for (int i = 1; i <= n; i++) { n if ((1LL << k) & mask[i]) { n mask[i] ^= (1LL << k); n if (tot > 0) { n val[i] = -val[i]; n } n } n } n } n cout << ret << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void __f(const char* name, Arg1&& arg1) { n cerr << name << : << arg1 << std::endl; n } n template n void __f(const char* names, Arg1&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n cerr.write(names, comma - names) << : << arg1 << | ; n __f(comma + 1, args...); n } n bool isprime(int n) { n for (int i = 2; i * i <= n; i++) n if (n % i == 0) return false; n return true; n } n int main() { n int n; n scanf( %d , &n); n int ans = 0; n if (n <= 3) n ans = 1; n else if (n % 2 == 0) n ans = 2; n else if (isprime(n)) n ans = 1; n else if (isprime(n - 2)) n ans = 2; n else n ans = 3; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, x[500005]; n char c[500005]; n int a[20]; n int q, w, e; n int main() { n cin.tie(0); n cout.tie(0); n ios_base::sync_with_stdio(false); n cin >> n; n for (int i = 0; i < 10; i++) a[i] = 2; n for (int i = 0; i < n; i++) { n cin >> c[i] >> x[i]; n } n for (int i = 0; i < 10; i++) { n int k = (1 << i); n for (int j = 0; j < n; j++) { n if (c[j] == | ) { n if (x[j] & k) { n a[i] = 1; n } n } else if (c[j] == & ) { n if (!(x[j] & k)) { n a[i] = 0; n } n } else { n if (x[j] & k) { n if (a[i] == 0) n a[i] = 1; n else if (a[i] == 1) n a[i] = 0; n else if (a[i] == 2) n a[i] = 3; n else n a[i] = 2; n } n } n } n } n for (int i = 0; i < 10; i++) { n if (a[i] != 0) q += (1 << i); n if (a[i] == 3) w += (1 << i); n if (a[i] == 1) e += (1 << i); n } n cout << 3 n ; n cout << & << q << n ; n cout << ^ << w << n ; n cout << | << e << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool prime[100001]; n bool ispoweroftwo(long long int x) { return x && !(x & (x - 1)); } n long long int xorcal(long long int n) { n if (n % 4 == 0) return n; n if (n % 4 == 1) return 1; n if (n % 4 == 2) return n + 1; n if (n % 4 == 3) return 0; n } n void sieve(long long int n) { n memset(prime, true, sizeof(prime)); n prime[0] = false; n prime[1] = false; n for (long long int i = 2; i * i <= n; i++) { n if (prime[i] == true) { n for (long long int j = i * i; j <= n; j += i) { n prime[j] = false; n } n } n } n } n bool isprime(long long int n) { n if (n <= 1) return false; n if (n <= 3) return true; n if (n % 2 == 0 or n % 3 == 0) return false; n for (long long int i = 5; i * i <= n; i += 6) { n if (n % i == 0 or n % (i + 2) == 0) return false; n } n return true; n } n long long int modinverse(long long int a, long long int m) { n long long int m0 = m; n long long int y = 0, x = 1; n if (m == 1) return 0; n while (a > 1) { n long long int q = a / m; n long long int t = m; n m = a % m; n a = t; n t = y; n y = x - q * y; n x = t; n } n if (x < 0) x += m0; n return x; n } n long long int gcd(long long int a, long long int b) { n if (a == 0) { n return b; n } n return (b % a, a); n } n long long int power(long long int A, long long int B) { n if (A == 0) return 0; n if (B == 0) return 1; n long long int y; n if (B % 2 == 0) { n y = power(A, B / 2); n y = (y * y) % 1000000007; n } else { n y = A % 1000000007; n y = (y * power(A, B - 1) % 1000000007) % 1000000007; n } n return (long long int)((y + 1000000007) % 1000000007); n } n int main() { n ios_base::sync_with_stdio(false); n long long int n; n cin >> n; n string s; n cin >> s; n char f[10]; n for (long long int i = 1; i < 10; i++) { n cin >> f[i]; n } n long long int fl = 0; n for (long long int i = 0; i < n; i++) { n if (s[i] < f[s[i] - 0 ]) { n s[i] = f[s[i] - 0 ]; n fl = 1; n } else if (fl == 1 and s[i] > f[s[i] - 0 ]) { n break; n } n } n cout << s << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n int n, m, pnt[N], vis[N]; n long long vsum[N], esum[N], vcnt[N]; n pair, pair > edge[N]; n vector edge2[N]; n int find(int x) { n if (x != pnt[x]) pnt[x] = find(pnt[x]); n return pnt[x]; n } n void dfs(int u, int root) { n vis[u] = root; n vsum[u] = vcnt[u]; n for (int i = 0; i < (int)(edge2[u]).size(); ++i) { n int v = edge2[u][i]; n if (vis[v]) continue; n dfs(v, root); n vsum[u] += vsum[v]; n } n } n void solve() { n int u, v, w; n m = n - 1; n memset(esum, 0, sizeof(esum)); n for (int i = 0; i < n; ++i) { n vcnt[i] = 1; n pnt[i] = i; n } n for (int i = 0; i < m; ++i) { n scanf( %d%d%d , &u, &v, &w); n edge[i] = make_pair(make_pair(w, i), make_pair(u - 1, v - 1)); n } n sort(edge, edge + m); n for (int i = 0; i < m; ++i) { n int j = i + 1; n for (; j < m; ++j) n if (edge[i].first.first != edge[j].first.first) break; n set s; n for (int k = i; k < j; ++k) { n s.insert(find(edge[k].second.first)); n s.insert(find(edge[k].second.second)); n } n vector vt((s).begin(), (s).end()); n for (int k = 0; k < (int)(vt).size(); ++k) { n vsum[vt[k]] = vis[vt[k]] = 0; n edge2[vt[k]] = vector(); n } n for (int k = i; k < j; ++k) { n int p = find(edge[k].second.first); n int q = find(edge[k].second.second); n edge2[p].push_back(q); n edge2[q].push_back(p); n } n for (int k = 0; k < (int)(vt).size(); ++k) { n if (vis[vt[k]]) continue; n dfs(vt[k], vt[k] + 1); n } n for (int k = i; k < j; ++k) { n int p = find(edge[k].second.first); n int q = find(edge[k].second.second); n long long c = min(vsum[p], vsum[q]); n esum[edge[k].first.second] = 2 * c * (vsum[vis[p] - 1] - c); n } n for (int k = i; k < j; ++k) { n int p = find(edge[k].second.first); n int q = find(edge[k].second.second); n pnt[p] = q; n vcnt[q] += vcnt[p]; n } n i = j - 1; n } n long long ans = 0; n int ct = 0; n for (int i = 0; i < m; ++i) { n if (ans < esum[i]) { n ans = esum[i]; n ct = 1; n } else if (ans == esum[i]) { n ct++; n } n } n printf( n %I64d n %d n , n ans, ct); n bool first = true; n for (int i = 0; i < m; ++i) { n if (esum[i] != ans) continue; n if (!first) n printf( ); n else n first = false; n printf( %d , i + 1); n } n puts( ); n } n int main() { n while (scanf( %d , &n) != EOF) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n bool v[60], h[60]; n int a, b, n; n while (cin >> n) { n memset(v, false, sizeof(v)); n memset(h, false, sizeof(h)); n for (int i = 1; i <= n * n; i++) { n cin >> a >> b; n if (i == 1) { n cout << 1; n h[a] = true; n v[b] = true; n } else if (h[a] == false && v[b] == false) { n h[a] = true; n v[b] = true; n cout << << i; n } n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream &operator<<(ostream &os, pair &m) { n os << [ << m.first << << m.second << ] ; n return os; n } n int n; n vector v; n bool func(int k) { n int x = k - 1, y = n - 1; n for (int i = x; i >= 0; --i) { n if (2 * v[x] > v[y]) return false; n x--, y--; n } n return true; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0), cout.tie(0); n cin >> n; n v.resize(n); n for (int i = 0; i < n; ++i) cin >> v[i]; n sort(begin(v), end(v)); n int lo = 0, hi = n / 2, ans = 0; n while (lo <= hi) { n int mid = (lo + hi) / 2; n if (func(mid)) { n ans = mid; n lo = mid + 1; n } else n hi = mid - 1; n } n cout << n - ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, k; n vector v[1000010]; n vector vv; n bool visit[1000010] = {0}; n int t, tt; n int res = 0; n void dfs(int x) { n visit[x] = 1; n t++; n for (int i = 0; i < v[x].size(); i++) { n int xi = v[x][i]; n if (!visit[xi]) dfs(xi); n } n } n int main() { n scanf( %d%d%d , &n, &m, &k); n for (int i = 0; i < m; i++) { n int x, y; n scanf( %d%d , &x, &y); n x--, y--; n v[x].push_back(y); n v[y].push_back(x); n } n for (int i = 0; i < n; i++) { n if (!visit[i]) { n t = 0; n dfs(i); n vv.push_back(min(t, k)); n } n } n if (k == 1) { n cout << max(0, (int)(vv.size() - 2)); n return 0; n } n sort(vv.begin(), vv.end()); n reverse(vv.begin(), vv.end()); n tt = vv[0]; n for (int i = 1; i < vv.size(); i++) { n if (tt) n tt += vv[i] - 2; n else { n tt++; n res++; n } n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 4000 + 1; n const int sq = 100; n const long long int mod = 1e9 + 7; n const long long int inf = 4000 + 1; n unordered_map dp; n int ps[N], n; n inline int get(int l, int r) { return ps[r] - ps[l]; } n int solve(int l, int r, int k, bool bol) { n if (r - l < k || l >= r || r > n || l < 0) return 0; n if (r - l == k && bol) return get(l, r); n if (r - l == k) return -get(l, r); n long long int key = l * N * sq * 2 + r * sq * 2 + k * 2 + bol; n if (dp.count(key)) return dp[key]; n int ans, x, y; n if (bol) { n x = solve(l + k, r, k, 0) + get(l, l + k); n y = solve(l + k + 1, r, k + 1, 0) + get(l, l + k + 1); n ans = max(x, y); n } else { n x = solve(l, r - k, k, 1) - get(r - k, r); n y = solve(l, r - k - 1, k + 1, 1) - get(r - k - 1, r); n ans = min(x, y); n } n return dp[key] = ans; n } n int main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n dp.rehash(16e6); n scanf( %d , &n); n for (int i = 0; i < n; i++) { n int x; n scanf( %d , &x); n ps[i + 1] = ps[i] + x; n } n printf( %d n , solve(0, n, 1, 1)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void enable_comma() {} n string tostring(char c); n string tostring(long long x); n template n string tostring(pair p); n template n string tostring(vector v); n string tostring(char c) { n string s = ; n s += c; n return s; n } n string tostring(string s) { return + s + ; } n string tostring(char *c) { return tostring((string)c); } n string tostring(long long x) { n if (x < 0) return - + tostring(-x); n if (x > 9) n return tostring(x / 10) + tostring(char( 0 + x % 10)); n else n return tostring(char( 0 + x)); n } n string tostring(int x) { return tostring((long long)x); } n string tostring(unsigned long long x) { n if (x > 9) n return tostring((long long)(x / 10)) + tostring(char( 0 + x % 10)); n else n return tostring(char( 0 + x)); n } n string tostring(unsigned x) { return tostring((long long)x); } n string tostring(double x) { n static char res[114]; n sprintf(res, %lf , x); n return tostring(res); n } n string tostring(long double x) { return tostring((double)x); } n template n string tostring(pair p) { n return ( + tostring(p.first) + , + tostring(p.second) + ) ; n } n template n string tostring(vector v) { n string res = { ; n for (int i = (0); i <= ((int)v.size() - 1); i++) { n res += tostring(v[i]); n res += i == (int)v.size() - 1 ? } : , ; n } n if (res == { ) res += } ; n return res; n } n template n string tostring(A a, int L, int R) { n string res = { ; n for (int i = (L); i <= (R); i++) { n res += tostring(a[i]); n res += i == R ? } : , ; n } n if (res == { ) res += } ; n return res; n } n string tostrings() { return ; } n template n string tostrings(Head H, Tail... T) { n return tostring(H) + + tostrings(T...); n } n long long read() { n long long x = 0, f = 0; n char ch = getchar(); n while (!isdigit(ch)) f = ch == - , ch = getchar(); n while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar(); n return f ? -x : x; n } n template n void ckmax(T &x, const T y) { n if (x < y) x = y; n } n template n void ckmin(T &x, const T y) { n if (x > y) x = y; n } n const int N = 500005 * 2; n int n, m, q; n int p[N]; n pair e[N], t[N]; n int ti[N]; n namespace S { n int fa[N]; n void init() { iota(fa, fa + N, 0); } n int getf(int x) { return fa[x] == x ? x : fa[x] = getf(fa[x]); } n } // namespace S n int cnt; n int fa[N], val[N]; n vector son[N]; n int vis[N]; n int I[N], O[N], ii[N]; n int anc[N][20], dep[N]; n int Time = 0; n void dfs(int x, int d = 1) { n vis[x] = 1; n anc[x][0] = fa[x]; n for (int i = (1); i <= (19); i++) anc[x][i] = anc[anc[x][i - 1]][i - 1]; n dep[x] = d; n I[x] = ++Time; n ii[Time] = x; n for (auto y : son[x]) dfs(y, d + 1); n O[x] = Time; n } n int pmax(int x, int y) { return p[x] > p[y] ? x : y; } n namespace seg { n const int S = N * 4; n int mx[S]; n void pushup(int rt) { n int ls = rt << 1, rs = ls | 1; n mx[rt] = pmax(mx[ls], mx[rs]); n } n void build(int rt, int L, int R) { n if (L == R) { n mx[rt] = ii[L]; n return; n } n int mid = (L + R) >> 1, ls = rt << 1, rs = ls | 1; n build(ls, L, mid); n build(rs, mid + 1, R); n pushup(rt); n } n int query(int rt, int L, int R, int xL, int xR) { n if (R < xL || L > xR) return 0; n if (xL <= L && R <= xR) return mx[rt]; n int mid = (L + R) >> 1, ls = rt << 1, rs = ls | 1; n return pmax(query(ls, L, mid, xL, xR), query(rs, mid + 1, R, xL, xR)); n } n void update(int rt, int L, int R, int x) { n if (L == R) { n mx[rt] = 0; n return; n } n int mid = (L + R) >> 1, ls = rt << 1, rs = ls | 1; n if (x <= mid) n update(ls, L, mid, x); n else n update(rs, mid + 1, R, x); n pushup(rt); n } n } // namespace seg n void solve() { n n = read(), m = read(), q = read(); n for (int i = (1); i <= (n); i++) p[i] = read(); n for (int i = (1); i <= (m); i++) { n int x = read(), y = read(); n e[i] = make_pair(x, y); n ti[i] = q + 1; n } n for (int i = (1); i <= (q); i++) { n int tp = read(), x = read(); n t[i] = make_pair(tp, x); n if (tp == 2) ti[x] = i; n } n vector id(m); n iota(id.begin(), id.end(), 1); n sort(id.begin(), id.end(), [&](int x, int y) { return ti[x] > ti[y]; }); n cnt = n; n S::init(); n for (auto i : id) { n int x = e[i].first, y = e[i].second; n int fx = S::getf(x), fy = S::getf(y); n if (fx != fy) { n int f = ++cnt; n fa[fx] = fa[fy] = S::fa[fx] = S::fa[fy] = f; n val[f] = ti[i]; n son[f] = {fx, fy}; n enable_comma(); n } n } n for (int i = (cnt); i >= (1); i--) n if (!vis[i]) dfs(i); n seg::build(1, 1, cnt); n for (int i = (1); i <= (q); i++) { n int tp = t[i].first, x = t[i].second; n if (tp == 1) { n for (int j = (19); j >= (0); j--) n if (val[anc[x][j]] > i) x = anc[x][j]; n int res = seg::query(1, 1, cnt, I[x], O[x]); n printf( %d n , p[res]); n p[res] = 0; n seg::update(1, 1, cnt, I[res]); n } else { n } n } n } n int main() { n int T = 1; n while (T--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void init() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n } n void skipInputLine() { cin.ignore(numeric_limits::max(), n ); } n template n TYPE readNum() { n TYPE item; n cin >> item; n return item; n } n template n COLLECTION readNums(size_t count) { n COLLECTION collection; n typename COLLECTION::value_type item; n for (size_t i = 0; i < count; i++) { n cin >> item; n collection.insert(item); n } n return collection; n } n template n void writeNums(const COLLECTION &collection) { n for (auto item : collection) { n cout << item << ; n } n cout << endl; n } n struct Datum { n Datum() {} n Datum(uint32_t _x, uint32_t _count) : x(_x), count(_count) {} n uint32_t x; n uint32_t count; n }; n void pass(const vector &data, uint32_t k, vector &ranges) { n uint32_t idx_left = 0, idx_right = 0; n uint32_t left_value = 0; n while (idx_left < data.size() && idx_right < data.size()) { n while (idx_right < data.size()) { n if (idx_right + 1 < data.size() && n data[idx_right + 1].x <= data[idx_left].x + k) { n idx_right++; n } else { n break; n } n } n ranges.push_back( n Datum(data[idx_left].x, data[idx_right].count - left_value)); n left_value = data[idx_left].count; n idx_left++; n } n } n uint32_t calc(uint32_t n, uint32_t k) { n map xs; n for (size_t i = 0; i < n; i++) { n uint32_t x; n cin >> x; n xs[x]++; n } n skipInputLine(); n skipInputLine(); n uint32_t cumulative = 0; n vector data(xs.size()); n uint32_t index = 0; n for (map::const_iterator it = xs.begin(); it != xs.end(); n it++) { n cumulative += it->second; n data[index++] = Datum(it->first, cumulative); n } n xs.clear(); n uint32_t width = data[data.size() - 1].x - data[0].x + 1; n if (width <= 2 * (k + 1)) { n return n; n } n vector ranges; n ranges.reserve(2 * data.size()); n pass(data, k, ranges); n data.clear(); n map best_sums; n uint32_t bs = 0; n for (size_t i = 0; i < ranges.size(); i++) { n const Datum &range = ranges[i]; n bs = max(bs, range.count); n best_sums[range.x] = bs; n } n uint32_t best_sum = 0; n for (size_t i = 1; i < ranges.size(); i++) { n const Datum &range = ranges[i]; n uint32_t sum = range.count; n int32_t x = int32_t(range.x) - int32_t(k + 1); n if (x < 0) { n x = 0; n } n map::const_iterator it = best_sums.upper_bound(x); n if (it != best_sums.cbegin()) { n it--; n best_sum = max(best_sum, sum + it->second); n } n } n return best_sum; n } n int main() { n init(); n uint32_t t = readNum(); n for (uint32_t i = 0; i < t; i++) { n uint32_t n, k; n cin >> n >> k; n uint32_t res = calc(n, k); n cout << res << n ; n } n cout << flush; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long read() { n register long long x = 0, f = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (isdigit(ch)) { n x = (x << 1) + (x << 3) + (ch ^ 48); n ch = getchar(); n } n return x * f; n } n const long long N = 1e5 + 10; n const long long M = N; n const long long INF = 1e16; n struct edge { n long long u, v, w, next; n bool operator<(const edge &x) const { return w < x.w; } n } e[M << 1]; n long long head[N], cnt; n void add(long long u, long long v, long long w = 0) { n e[++cnt] = (edge){u, v, w, head[u]}; n head[u] = cnt; n } n long long n, m, k, ans = INF; n long long dis[N], s[N], from[N]; n bool vis[N]; n struct node { n long long u, d; n bool operator<(const node &x) const { return d > x.d; } n }; n priority_queue q; n void Dij() { n for (long long i = 1; i <= n; i++) from[i] = vis[i] = 0, dis[i] = INF; n for (long long i = 1; i <= k; i++) n from[s[i]] = s[i], dis[s[i]] = 0, q.push((node){s[i], 0}); n while (!q.empty()) { n long long u = q.top().u; n q.pop(); n if (vis[u]) continue; n vis[u] = 1; n for (long long i = head[u]; i; i = e[i].next) { n long long v = e[i].v; n if (vis[v]) continue; n if (dis[v] > dis[u] + e[i].w) { n dis[v] = dis[u] + e[i].w; n from[v] = from[u]; n q.push((node){v, dis[v]}); n } n } n } n } n long long fa[N]; n long long find(long long x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } n void krus() { n for (long long i = 1; i <= cnt; i++) { n e[i].w += dis[e[i].u] + dis[e[i].v]; n e[i].u = from[e[i].u], e[i].v = from[e[i].v]; n } n sort(e + 1, e + cnt + 1); n for (long long i = 1; i <= cnt; i++) { n long long fx = find(e[i].u), fy = find(e[i].v); n if (fx == fy) continue; n ans += e[i].w; n fa[fx] = fy; n } n } n signed main() { n n = read(), m = read(); n for (long long i = 1; i <= n; i++) fa[i] = i; n for (long long i = 1; i <= m; i++) { n long long u = read(), v = read(), w = read(); n add(u, v, w), add(v, u, w); n } n s[k = 1] = 1; n Dij(); n k = read(); n for (long long i = 1; i <= k; i++) { n s[i] = read(); n ans = min(ans, dis[s[i]]); n } n Dij(); n krus(); n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n string s; n int n; n while (cin >> n) { n cin >> s; n int gold = 0, cnt = 0, prev = 0, ans = 0; n for (auto ch : s) { n if (ch == G ) n gold++, cnt++; n else n prev = cnt, cnt = 0; n ans = max(ans, prev + cnt + 1); n } n ans = min(ans, gold); n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int t; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> t; n while (t--) { n int a, b, c; n cin >> a >> b >> c; n if (c == 0) { n if (a <= b) n cout << 0 << endl; n else n cout << 1 << endl; n continue; n } else if (a + c <= b) { n cout << 0 << endl; n continue; n } n int res; n if (a == b) { n res = c / 2; n if (c % 2 == 1) res++; n } else if (a > b) { n if (b + c < a) n res = c + 1; n else if (b + c == a) n res = c; n else { n if ((b + c - a) % 2 == 1) n res = (b + c - a) / 2 + 1 + a - b; n else n res = (b + c - a) / 2 + a - b; n } n } else { n if ((a + c - b) % 2 == 1) n res = (a + c - b) / 2 + 1; n else n res = (a + c - b) / 2; n } n cout << res << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n std::cin >> n; n bool letters[26]; n bool d = false; n int extra = 0; n for (int i = 0; i < 26; i++) { n letters[i] = true; n } n char action; n string input = ; n for (int i = 0; i < n; i++) { n cin >> action; n cin >> input; n if (action == ! ) { n for (int j = 0; j < 26; j++) { n if (strchr(input.c_str(), j + a ) == NULL) { n letters[j] = false; n } n } n if (d == true) extra++; n } n if (action == . ) { n for (int j = 0; j < 26; j++) { n if (strchr(input.c_str(), j + a ) != NULL) { n letters[j] = false; n } n } n } n if (action == ? ) { n letters[input[0] - a ] = false; n if (d == true && i < n - 1) extra++; n } n if (d == false) { n int truec = 0; n for (int j = 0; j < 26; j++) { n if (letters[j] == true) { n truec++; n } n } n if (truec == 1) { n d = true; n } n } n } n cout << extra << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 100010; n int n, m; n struct road { n int to, th; n bool f; n } in; n struct dot { n int come_road; n int come_point; n bool func; n } r[M]; n vector work[M]; n vector not_work[M]; n vector rw[M]; n vector rnw[M]; n bool vis[M]; n int d[M]; n int broken_road[M]; n bool inq[M]; n int tot, u; n int input() { n int ans = 0; n char ch; n while (1) { n ch = getchar(); n if (ch == || ch == n ) return ans; n ans *= 10; n ans += ch - 0 ; n } n return ans; n } n void output(int out) { n if (out == 0) { n putchar( 0 ); n return; n } n char ans[10]; n int cnt = 0; n while (out) { n ans[cnt++] = out % 10 + 0 ; n out /= 10; n } n for (int i = cnt - 1; i >= 0; i--) putchar(ans[i]); n } n int main() { n while (~scanf( %d%d , &n, &m)) { n tot = 0; n memset(broken_road, 0x3f, sizeof(broken_road)); n memset(vis, 0, sizeof(vis)); n memset(d, 0x3f, sizeof(d)); n for (int i = 1; i <= n; i++) { n work[i].clear(); n not_work[i].clear(); n rw[i].clear(); n rnw[i].clear(); n } n int x, y, fun; n getchar(); n for (int i = 0; i < m; i++) { n x = input(); n y = input(); n fun = input(); n in.to = y; n in.th = i; n if (!fun) { n in.f = 0; n not_work[x].push_back(in); n in.to = x; n rnw[y].push_back(in); n } else { n tot++; n in.f = 1; n work[x].push_back(in); n in.to = x; n rw[y].push_back(in); n } n } n memset(inq, 0, sizeof(inq)); n inq[1] = 1; n d[1] = 0; n queue q; n q.push(1); n broken_road[1] = 0; n while (!q.empty()) { n u = q.front(); n q.pop(); n inq[u] = 0; n int v; n for (int i = 0; i < work[u].size(); i++) { n v = work[u][i].to; n if (d[u] + 1 < d[v] || n (d[u] + 1 == d[v] && broken_road[u] < broken_road[v])) { n d[v] = d[u] + 1; n r[v].come_point = u; n r[v].come_road = work[u][i].th; n r[v].func = 1; n broken_road[v] = broken_road[u]; n if (!inq[v]) { n q.push(v); n inq[v] = 1; n } n } n } n for (int i = 0; i < rw[u].size(); i++) { n v = rw[u][i].to; n if (d[u] + 1 < d[v] || n (d[u] + 1 == d[v] && broken_road[u] < broken_road[v])) { n d[v] = d[u] + 1; n r[v].come_point = u; n r[v].come_road = rw[u][i].th; n r[v].func = 1; n broken_road[v] = broken_road[u]; n if (!inq[v]) { n q.push(v); n inq[v] = 1; n } n } n } n for (int i = 0; i < not_work[u].size(); i++) { n v = not_work[u][i].to; n if (d[u] + 1 < d[v] || n (d[u] + 1 == d[v] && broken_road[u] + 1 < broken_road[v])) { n d[v] = d[u] + 1; n r[v].come_point = u; n r[v].come_road = not_work[u][i].th; n r[v].func = 0; n broken_road[v] = broken_road[u] + 1; n if (!inq[v]) { n q.push(v); n inq[v] = 1; n } n } n } n for (int i = 0; i < rnw[u].size(); i++) { n v = rnw[u][i].to; n if (d[u] + 1 < d[v] || n (d[u] + 1 == d[v] && broken_road[u] + 1 < broken_road[v])) { n d[v] = d[u] + 1; n r[v].come_point = u; n r[v].come_road = rnw[u][i].th; n r[v].func = 0; n broken_road[v] = broken_road[u] + 1; n if (!inq[v]) { n q.push(v); n inq[v] = 1; n } n } n } n } n int p = n; n while (p != 1) { n vis[r[p].come_road] = 1; n if (r[p].func) n tot--; n else n tot++; n p = r[p].come_point; n } n output(tot); n puts( ); n for (int i = 1; i <= n; i++) { n for (int j = 0; j < work[i].size(); j++) { n if (!vis[work[i][j].th]) { n output(i); n putchar( ); n output(work[i][j].to); n putchar( ); n puts( 0 ); n } n } n for (int j = 0; j < not_work[i].size(); j++) { n if (vis[not_work[i][j].th]) { n output(i); n putchar( ); n output(not_work[i][j].to); n putchar( ); n puts( 1 ); n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n void solve(int tc) { n int n, k; n cin >> n >> k; n string s; n cin >> s; n for (int i = k; i < s.size(); i++) { n if (s[i] == ? ) { n if (s[i - k] != ? ) { n s[i] = s[i - k]; n } n } else { n if (s[i - k] == ? ) { n s[i - k] = s[i]; n } else { n if (s[i] != s[i - k]) { n cout << NO << endl; n return; n } n } n } n } n int count = 0; n int free = 0; n for (int i = 0; i < s.size(); i++) { n if (i >= k) { n if (s[i - k] == ? ) { n free--; n } else { n count -= ((s[i - k] == 1 ) ? 1 : 0); n } n } n if (s[i] == ? ) { n free++; n } else { n count += ((s[i] == 1 ) ? 1 : 0); n } n if (i >= k - 1) { n if (count > k / 2 || count + free < k / 2) { n cout << NO << endl; n return; n } n } n } n cout << YES << endl; n } n int main() { n int t; n cin >> t; n for (int i = 1; i <= t; i++) { n solve(i); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double pi = 3.14159265359; n inline long long add(long long a, long long b, long long m) { n if ((a + b) >= m) return (a + b) % m; n return a + b; n } n inline long long mul(long long a, long long b, long long m) { n if ((a * b) < m) return a * b; n return (a * b) % m; n } n long long power(long long x, long long y, long long m) { n long long res = 1; n x = x % m; n if (x == 0) return 0; n while (y > 0) { n if (y & 1) res = (res * x) % m; n y = y >> 1; n x = (x * x) % m; n } n return res; n } n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n int main() { n ios_base::sync_with_stdio; n cin.tie(0); n cout.tie(0); n int t = 1, n; n cin >> t; n while (t--) { n string s; n cin >> n; n cin >> s; n string ans; n int i = 0; n for (; i < s.length(); i++) { n if (s[i] == 0 ) { n ans.push_back(s[i]); n } else { n break; n } n } n string ans2; n for (int i = s.length() - 1; i > -1; i--) { n if (s[i] == 1 ) { n ans2.push_back(s[i]); n } else { n break; n } n } n if (ans.length() + ans2.length() == s.length()) { n cout << s << endl; n } else n cout << ans << 0 << ans2 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const int N = 1e2 + 5; n int ans[N][N][N]; n bool was[N][N][N]; n vector > adj[N]; n bool calc(int x, int y, int pr) { n if (was[x][y][pr]) return ans[x][y][pr]; n was[x][y][pr] = 1; n for (auto to : adj[x]) { n if (to.second >= pr && !calc(y, to.first, to.second)) { n ans[x][y][pr] = 1; n break; n } n } n return ans[x][y][pr]; n } n int main() { n ios ::sync_with_stdio(0), cin.tie(0); n int n, m; n cin >> n >> m; n for (int i = 1; i <= m; ++i) { n int u, v; n char c; n cin >> u >> v >> c; n adj[u].push_back({v, c - a }); n } n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= n; ++j) { n if (!calc(i, j, 0)) n cout << B ; n else n cout << A ; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int v[2000]; n int a, b, n, res; n int main() { n scanf( %d %d %d , &n, &a, &b); n for (int i = 0; i < n; i++) scanf( %d , &v[i]); n sort(v, v + n); n int res = v[b] - v[b - 1]; n cout << res << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxsize = 100000 + 9; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int T; n T = 1; n while (T--) { n long long i, j, k, m, n, flag = 0; n vector v; n string s; n cin >> n >> s; n for (i = 0; i < n; i++) { n if (s[i] == 2 ) { n v.push_back(2); n } n if (s[i] == 3 ) { n v.push_back(3); n } n if (s[i] == 4 ) { n v.push_back(3); n v.push_back(2); n v.push_back(2); n } n if (s[i] == 5 ) { n v.push_back(5); n } n if (s[i] == 6 ) { n v.push_back(5); n v.push_back(3); n } n if (s[i] == 7 ) { n v.push_back(7); n } n if (s[i] == 8 ) { n v.push_back(7); n v.push_back(2); n v.push_back(2); n v.push_back(2); n } n if (s[i] == 9 ) { n v.push_back(7); n v.push_back(3); n v.push_back(3); n v.push_back(2); n } n } n sort(v.begin(), v.end()); n for (i = v.size() - 1; i >= 0; i--) { n cout << v[i]; n } n cout << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, s = 0; n cin >> n; n if (n >= 1 && n <= 100) { n if (n == 1) n cout << 1; n else { n while (1) { n if (n == 2) { n s = s + 5; n break; n } n s = s + (n * 2) + (n - 2) * 2; n n = n - 1; n } n cout << s; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n using namespace std::chrono; n long long gcd(long long a, long long b) { n if (b == 0) { n return a; n } else { n return gcd(b, a % b); n } n } n void change(map &m, long long n) { n long long i; n for (long long i = 1; i < n + 1; i++) { n if (m[i] == 1) n m.erase(i); n else n m[i]--; n } n return; n } n void solve() { n long long n, i, l, t; n cin >> n >> t; n string ans = ; n map m; n for (long long i = 0; i < t; i++) { n cin >> l; n m[l]++; n if ((long long)m.size() == n) { n ans += 1 ; n change(m, n); n } else { n ans += 0 ; n } n } n cout << ans; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n ; n long long t = 1; n while (t--) { n solve(); n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, a[101][101] = {0}, d = 0; n cin >> n; n for (long long int i = 1; i <= n; i++) { n long long int x1, x2, y1, y2; n cin >> x1 >> y1 >> x2 >> y2; n for (long long int j = x1; j <= x2; j++) { n for (long long int k = y1; k <= y2; k++) { n d++; n } n } n } n cout << d << endl; n } n "} +{"func_code_string": "#include n using namespace std; n long long getLL() { n long long ret = 0; n char c; n while (1) { n c = getchar(); n if (c >= 0 && c <= 9 ) break; n } n while (1) { n ret = ret * 10 + c - 0 ; n c = getchar(); n if (c < 0 || c > 9 ) break; n } n return ret; n } n int getInt() { n int ret = 0; n char c; n while (1) { n c = getchar(); n if (c >= 0 && c <= 9 ) break; n } n while (1) { n ret = ret * 10 + c - 0 ; n c = getchar(); n if (c < 0 || c > 9 ) break; n } n return ret; n } n const double eps = 1e-10; n int dcmp(double x) { return (x < -eps) ? -1 : (x > eps); } n struct Point { n double x, y; n int who; n Point() {} n Point(double _x, double _y, int _who) : x(_x), y(_y), who(_who){}; n bool operator<(const Point &b) const { n if (dcmp(x - b.x) == 0) return y < b.y; n return x < b.x; n } n Point operator-(const Point &b) const { return Point(x - b.x, y - b.y, 0); } n double operator*(const Point &b) const { return x * b.y - y * b.x; } n } A[1020304]; n int n, Stack[1020304], can[1020304], sameas[1020304]; n int main() { n cin >> n; n for (int i = 1; i <= n; ++i) { n double r, s; n scanf( %lf%lf , &r, &s); n A[i] = Point(10000.0 / r, 10000.0 / s, i); n } n sort(A + 1, A + n + 1); n int Top = 0; n vector ans; n for (int i = 1; i <= n; ++i) { n if (i > 1 && dcmp(A[i].x - A[i - 1].x) == 0) continue; n while (Top > 1 && n (dcmp((A[i] - A[Stack[Top]]) * (A[i] - A[Stack[Top - 1]])) > 0)) n --Top; n Stack[++Top] = i; n } n for (int i = 1; i <= Top; ++i) n if (i == 1 || dcmp(A[Stack[i]].y - A[Stack[i - 1]].y) < 0) n can[Stack[i]] = true; n for (int i = 1; i <= n; ++i) { n if (dcmp(A[i].x - A[i - 1].x) == 0 && dcmp(A[i].y - A[i - 1].y) == 0) n can[i] |= can[i - 1]; n if (can[i]) ans.push_back(A[i].who); n } n sort(ans.begin(), ans.end()); n for (auto x : ans) printf( %d , x); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 12; n int p[1 << N], q[1 << N], a[1 << N], pos[1 << N], ans[1 << N]; n void do_swap(int x, int y) { n int val = (p[x] ^ q[x] ^ a[x]); n if (!val) { n return; n } n int idx = pos[a[x] ^ q[x]]; n swap(pos[p[x]], pos[p[idx]]); n swap(p[x], p[idx]); n swap(q[y], q[idx]); n do_swap(idx, y); n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n, i, j, k, l = 0; n cin >> n; n n = (1 << n); n for (i = 0; i < n; i++) { n cin >> a[i]; n l ^= a[i]; n p[i] = q[i] = pos[i] = i; n } n if (l) { n cout << Fou ; n return 0; n } n for (i = 0; i + 1 < n; i++) { n do_swap(i, i + 1); n } n cout << Shi n ; n for (i = 0; i < n; i++) { n cout << p[i] << ; n } n cout << n ; n for (i = 0; i < n; i++) { n cout << q[i] << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long r, d, n; n vector> data; n const long double pi = 3.1415926535897932; n long long per(vector x, vector y) { n long long su = 0; n for (long long(i) = 0; (i) < (5); (i)++) { n su += x[i] * y[i]; n } n return su; n } n long double pere(vector x, vector y) { n long double su = per(x, y); n su /= sqrt(per(x, x)) * sqrt(per(y, y)); n su = acos(su); n return su; n } n int main() { n cin >> n; n data.resize(n); n for (long long(i) = 0; (i) < (n); (i)++) { n for (long long(j) = 0; (j) < (5); (j)++) { n data[i].resize(5); n cin >> data[i][j]; n } n } n if (n > 32) { n cout << 0; n return 0; n } n vector result; n for (long long(i) = 0; (i) < (n); (i)++) { n bool mark = false; n for (long long(j) = 0; (j) < (n); (j)++) { n if (mark) { n break; n } n for (long long(l) = 0; (l) < (n); (l)++) { n if (i == j || j == l || i == l) { n continue; n } n vector x, y; n x.resize(5); n y.resize(5); n for (long long(h) = 0; (h) < (5); (h)++) { n x[h] = data[j][h] - data[i][h]; n y[h] = data[l][h] - data[i][h]; n } n if (pere(x, y) < pi / 2) { n mark = true; n break; n } n } n } n if (!mark) { n result.push_back(i); n } n } n cout << result.size() << endl; n for (long long(i) = 0; (i) < (result.size()); (i)++) { n cout << result[i] + 1 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n long long n; n cin >> n; n long long ans = 0, turn = 1; n while (n > 0) { n if (n % 2) { n n--; n if (turn % 2) { n ans++; n } n } else { n if ((n / 2) % 2 == 0 && (n / 2) != 2) { n n--; n if (turn % 2) { n ans++; n } n } else { n if (turn % 2) { n ans += (n / 2); n } n n /= 2; n } n } n turn++; n } n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n using namespace chrono; n const int infinity = (int)1e9 + 42; n const int64_t llInfinity = (int64_t)1e18 + 256; n const int module = (int)1e9 + 7; n const long double eps = 1e-8; n mt19937_64 randGen(system_clock().now().time_since_epoch().count()); n inline void raiseError(string errorCode) { n cerr << Error : << errorCode << endl; n exit(42); n } n inline basic_string arith(int64_t n, int64_t base, int64_t step) { n basic_string res; n for (int64_t i = 0; i < n; i++) { n res += base; n base += step; n } n return res; n } n inline int64_t ask(basic_string b) { n cout << b.size(); n for (int64_t i : b) { n cout << << i; n } n cout << endl; n int64_t x; n cin >> x; n if (x == -2) { n exit(42); n } n if (x == -1) { n exit(0); n } n return x; n } n inline void simpleGuess(int64_t l, int64_t r, int64_t knt, int64_t att) { n for (int64_t i = 0; i < att; i++) { n if (r - l + 1 <= knt) { n ask(arith(r - l + 1, l, 1)); n exit(42); n } n int64_t delta = (r - l + 1 - knt) / (knt + 1); n int64_t mod = (r - l + 1 - knt) % (knt + 1); n int64_t val = l; n basic_string bounds; n bounds += l - 1; n for (int64_t i = 1; i <= knt; i++) { n int64_t add = delta + (i <= mod); n val += add; n bounds += val; n val++; n } n bounds += r + 1; n int64_t q = ask(bounds.substr(1, knt)); n l = bounds[q] + 1; n r = bounds[q + 1] - 1; n } n exit(42); n } n signed main() { n ios_base::sync_with_stdio(false); n if (ask({204761410474}) == 0) { n if (ask({2046}) == 0) { n if (ask({6}) == 0) { n if (ask({2}) == 0) { n ask({1}); n } else { n ask(arith(3, 3, 1)); n } n } else { n int64_t q = ask({14, 30, 62, 126, 254, 510, 1022}); n int64_t w = (8 << q) - 1; n ask(arith(w, w, 1)); n } n } else { n int64_t base1 = 20468427, step1 = 100020001; n int64_t w1 = ask(arith(2047, base1, step1)); n if (w1 == 0) { n int64_t base2 = 16382, step2 = 10001; n int64_t w2 = n ask(basic_string{4094, 8190} + arith(2045, base2, step2)); n if (w2 <= 2) { n int64_t abase = (2048 << w2) - 1; n ask(arith(abase, abase, 1)); n } else { n ask(arith(10000, base2 + (w2 - 3) * step2 + 1, 1)); n } n } else { n simpleGuess(base1 + (w1 - 1) * step1 + 1, base1 + w1 * step1 - 1, 10000, n 2); n } n } n } else { n simpleGuess(204761410475, 10004205361450474, 10000, 4); n } n return 42; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, i, f = 0, se = 0, so = 0, sume = 0, sumo = 0, c = 0, x, y; n cin >> n; n long long int a[n]; n for (i = 0; i < n; i++) cin >> a[i]; n for (i = 0; i < n; i++) { n if (i % 2) n so += a[i]; n else n se += a[i]; n } n for (i = 0; i < n; i++) { n if (i % 2) { n x = so - sumo - a[i] + sume; n y = se - sume + sumo; n sumo += a[i]; n } else { n x = so - sumo + sume; n y = se - sume + sumo - a[i]; n sume += a[i]; n } n if (x == y) c++; n } n cout << c << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int dividers[60]; n int main() { n long long int n, k; n cin >> n >> k; n if (k == 1) { n cout << Yes ; n return 0; n } n if (k == 2 && n == 1) { n cout << Yes ; n return 0; n } n if (n <= k) { n cout << No ; n return 0; n } n if (k > 50) { n cout << No ; n return 0; n } n long long int c = n + 1; n for (int i = 2; i <= k; i++) { n if (c % i != 0) { n cout << No ; n return 0; n } n } n cout << Yes ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 2e3 + 5; n char a[MAX][MAX]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0), cout.tie(0); n int n, m, k; n cin >> n >> m >> k; n for (int i = (1); i <= (n); ++i) n for (int j = (1); j <= (m); ++j) cin >> a[i][j]; n int ans = 0; n for (int i = (1); i <= (n); ++i) { n int cnt = 0; n for (int j = (1); j <= (m); ++j) { n if (a[i][j] == . ) n ++cnt; n else { n if (cnt >= k) ans += cnt - k + 1; n cnt = 0; n } n } n if (cnt >= k) ans += cnt - k + 1; n } n if (k > 1) { n for (int i = (1); i <= (m); ++i) { n int cnt = 0; n for (int j = (1); j <= (n); ++j) { n if (a[j][i] == . ) n ++cnt; n else { n if (cnt >= k) ans += cnt - k + 1; n cnt = 0; n } n } n if (cnt >= k) ans += cnt - k + 1; n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int oo = 10000000; n int n, m, x, y, a, b; n int vabs(int t) { return (t > 0) ? t : (-t); } n int calc(int cx, int cy) { n int dx = vabs(cx - x); n int dy = vabs(cy - y); n if (dx == 0 && dy == 0) return 0; n if (dx % a != 0 || dy % b != 0) return oo; n int ca = dx / a, cb = dy / b; n if (vabs(ca - cb) % 2 != 0) return oo; n if (ca < cb && cx - a < 1 && cx + a > n) return oo; n if (ca > cb && cy - b < 1 && cy + b > m) return oo; n return max(ca, cb); n } n int main() { n while (cin >> n) { n cin >> m >> x >> y >> a >> b; n int ans = oo; n ans = min(ans, calc(1, 1)); n ans = min(ans, calc(1, m)); n ans = min(ans, calc(n, 1)); n ans = min(ans, calc(n, m)); n if (ans == oo) n cout << Poor Inna and pony! << endl; n else n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e10; n void solve() { n long long n, c; n cin >> n >> c; n long long a[n], b[n]; n for (long long i = 0; i < n; i++) { n cin >> a[i] >> b[i]; n } n long long low = -1, high = -1; n for (long long i = 1; i <= 100000; i++) { n long long cnt = 0; n for (long long j = 0; j < n; j++) { n cnt++; n cnt += (a[j] * i) / b[j]; n } n if (cnt > c) break; n if (cnt < c) continue; n if (cnt == c) { n if (low == -1) low = i; n high = i; n } n } n if (high == -1) n cout << 0; n else n cout << high - low + 1; n } n int32_t main() { n long long t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n, x; n std::cin >> n >> x; n std::vector data; n int counter = 0; n for (int i = 0; i != n; i++) { n int temp; n std::cin >> temp; n data.push_back(temp); n } n std::sort(data.begin(), data.end()); n if (std::find(data.begin(), data.end(), x) != data.end()) { n auto it = std::find(data.begin(), data.end(), x); n counter++; n data.erase(it); n } n for (int i = 0; i < x; i++) { n if (std::find(data.begin(), data.end(), i) == data.end()) { n data.push_back(i); n counter++; n } n } n std::cout << counter << std::endl; n return 0; n } n "} +{"func_code_string": " n #include n n #define ll long long n #define sz(x) ((int) (x).size()) n #define all(x) (x).begin(), (x).end() n #define vi vector n #define pii pair n #define rep(i, a, b) for(int i = (a); i < (b); i++) n using namespace std; n template n using minpq = priority_queue, greater>; n n struct pt { n ll x, y; n pt(ll x = 0, ll y = 0) : x(x), y(y) {} n pt operator-(const pt &o) const { n return pt(x - o.x, y - o.y); n } n ll cross(const pt &o) const { n return x * o.y - y * o.x; n } n bool operator<(const pt &o) const { n return cross(o) > 0; n } n }; n n struct dsu { n vi a; n dsu(int n) { n a.assign(n, -1); n } n int trace(int x) { n return a[x] < 0 ? x : a[x] = trace(a[x]); n } n void join(int x, int y) { n if((x = trace(x)) == (y = trace(y))) return; n if(a[x] > a[y]) swap(x, y); n a[x] += a[y]; n a[y] = x; n } n }; n n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int n; n cin >> n; n vi a(n + 1); n vector p(n + 1); n rep(i, 1, n + 1) { n cin >> p[i].x >> p[i].y >> a[i]; n } n int idx = -1; n rep(i, 1, n + 1) { n if(a[i] != i && (idx == -1 || p[i].y < p[idx].y)) { n idx = i; n } n } n if(idx == -1) { n cout << 0 << n ; n return 0; n } n vi balls; n rep(i, 1, n + 1) { n if(i != idx && a[i] != i) { n balls.push_back(i); n } n } n sort(all(balls), [&](int i, int j) { n return p[i] - p[idx] < p[j] - p[idx]; n }); n dsu D(n + 1); n rep(i, 1, n + 1) D.join(i, a[i]); n int k = sz(balls); n vector ops; n auto pass = [&](int i, int j) { n swap(a[i], a[j]); n ops.push_back({i, j}); n }; n rep(i, 0, k - 1) { n if(D.trace(balls[i]) != D.trace(balls[i + 1])) { n pass(balls[i], balls[i + 1]); n D.join(balls[i], balls[i + 1]); n } n } n while(a[idx] != idx) { n pass(idx, a[idx]); n } n n cout << sz(ops) << n ; n for(auto &pa : ops) { n cout << pa.first << << pa.second << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, a[102400], i, j, o = 0, l = 0, ma, k = 0; n cin >> n; n for (i = 0; i < n; i++) cin >> a[i]; n for (i = 1; i < n; i++) { n if (a[i] + k < a[i - 1]) { n o += a[i - 1] - (a[i] + k); n k += a[i - 1] - (a[i] + k); n a[i] = a[i - 1]; n } else { n if (a[i] < a[i - 1]) { n k = a[i - 1] - a[i]; n a[i] = a[i - 1]; n } else n k = 0; n } n } n cout << o << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100110; n const int maxm = 100010; n char s[maxn][5]; n long long sum[maxm * 4][5][11]; n int n; n void init() { n for (int i = 1; i < maxn; i++) n for (int z = 2; z <= 6; z++) { n int tp = i % (2 * (z - 1)); n if (tp == 0) n s[i][z - 2] = 2; n else if (tp <= z) n s[i][z - 2] = tp; n else n s[i][z - 2] = 2 * z - tp; n } n } n void build(int pos, int l, int r) { n for (int i = 2; i <= 6; i++) n for (int j = 0; j <= 10; j++) sum[pos][i - 2][j] = 0; n if (l == r) return; n int mid = (l + r) >> 1; n build((pos << 1), l, mid); n build(((pos << 1) | 1), mid + 1, r); n } n void insert(int pos, int l, int r, int i, int a) { n if (i < l || i > r) return; n if (l == r) { n for (int z = 2; z <= 6; z++) n for (int j = 0; j <= 10; j++) n sum[pos][z - 2][j] = (long long)s[i + j][z - 2] * a; n return; n } n int mid = (l + r) >> 1; n insert((pos << 1), l, mid, i, a); n insert(((pos << 1) | 1), mid + 1, r, i, a); n for (int z = 2; z <= 6; z++) n for (int j = 0; j <= 10; j++) n sum[pos][z - 2][j] = n sum[(pos << 1)][z - 2][j] + sum[((pos << 1) | 1)][z - 2][j]; n } n long long search(int pos, int l, int r, int x, int y, int z, int offset) { n if (y < l || r < x) return 0; n if (x <= l && r <= y) return sum[pos][z - 2][offset]; n int mid = (l + r) >> 1; n return search((pos << 1), l, mid, x, y, z, offset) + n search(((pos << 1) | 1), mid + 1, r, x, y, z, offset); n } n int main() { n init(); n while (~scanf( %d , &n)) { n build(1, 1, n); n for (int i = 1; i <= n; i++) { n int a; n scanf( %d , &a); n insert(1, 1, n, i, a); n } n int m; n scanf( %d , &m); n while (m-- > 0) { n int t, p, v, l, r, z; n scanf( %d , &t); n if (t == 1) { n scanf( %d%d , &p, &v); n insert(1, 1, n, p, v); n } else { n scanf( %d%d%d , &l, &r, &z); n int offset = 0; n if (s[l][z - 2] <= s[l + 1][z - 2]) { n if (s[l][z - 2] == 1) n offset = 0; n else n offset = z - s[l][z - 2] + z - 1; n } else { n offset = s[l][z - 2] - 1; n } n cout << search(1, 1, n, l, r, z, offset) << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n string s; n cin >> n; n getline(cin, s); n for (int i = 0; i < n; ++i) { n getline(cin, s); n int len = s.length(); n if (len < 5) n cout << OMG>.< I don t know! << endl; n else { n string prefix(s.substr(0, 5)); n string suffix(s.substr(len - 5, 5)); n if (prefix == miao. && suffix == lala. ) n cout << OMG>.< I don t know! << endl; n else if (prefix == miao. ) n cout << Rainbow s << endl; n else if (suffix == lala. ) n cout << Freda s << endl; n else n cout << OMG>.< I don t know! << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const int inf = 2e9 + 5; n const int N = 1e5; n int cost[26]; n map m[26]; n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n for (int i = 0; i < 26; i++) cin >> cost[i]; n string s; n cin >> s; n long long n = s.length(), sum = 0; n long long ans = 0; n for (int i = 0; i < n; i++) { n ans += m[s[i] - a ][sum]; n sum += cost[s[i] - a ]; n m[s[i] - a ][sum] += 1; n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void prv(vector v) { n int n = v.size(); n for (int i = 0; i < n; i++) cout << v[i] << ; n } n void swap(long long int &a, long long int &b) { n int tm = a; n a = b; n b = tm; n } n bool comp(const pair &p1, const pair &p2) { n if (p1.first > p2.first) n return 1; n else n return 0; n } n const int N = 3e5 + 5; n void findPrefix(string pattern, int m, int prefArray[]) { n int length = 0; n prefArray[0] = 0; n for (int i = 1; i < m; i++) { n if (pattern[i] == pattern[length]) { n length++; n prefArray[i] = length; n } else { n if (length != 0) { n length = prefArray[length - 1]; n i--; n } else n prefArray[i] = 0; n } n } n } n int kmpPattSearch(string mainString, string pattern) { n int n, m, i = 0, j = 0, fr = 0; n n = mainString.size(); n m = pattern.size(); n int prefixArray[m]; n findPrefix(pattern, m, prefixArray); n while (i < n) { n if (mainString[i] == pattern[j]) { n i++; n j++; n } n if (j == m) { n fr++; n j = prefixArray[j - 1]; n } else if (i < n && pattern[j] != mainString[i]) { n if (j != 0) n j = prefixArray[j - 1]; n else n i++; n } n } n return fr; n } n string crts(int d, int m, int y) { n string t; n t.clear(); n while (y != 0) { n t.push_back(y % 10 + 0 ); n y = y / 10; n } n t.push_back( - ); n while (m != 0) { n t.push_back(m % 10 + 0 ); n m = m / 10; n } n if (t.size() == 6) t.push_back( 0 ); n t.push_back( - ); n while (d != 0) { n t.push_back(d % 10 + 0 ); n d = d / 10; n } n if (t.size() == 9) t.push_back( 0 ); n reverse((t).begin(), (t).end()); n return t; n } n void solve() { n string s, ans; n cin >> s; n int mx = 0; n for (int i = 2013; i < 2016; ++i) { n for (int j = 1; j <= 12; j++) { n int k; n if (j == 2) n k = 28; n else if (j == 1 || j == 3 || j == 5 || j == 7 || j == 8 || j == 10 || n j == 12) n k = 31; n else n k = 30; n for (int l = 1; l <= k; l++) { n string t; n int frq; n t = crts(l, j, i); n frq = kmpPattSearch(s, t); n if (frq > mx) { n mx = frq; n ans = t; n } n } n } n } n cout << ans; n } n signed int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t = 1; n while (t--) { n solve(); n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = acos(-1.0); n template n T SQR(const T &a) { n return a * a; n } n void run() { n char str[1000100]; n scanf( %s , str); n int n = strlen(str); n int m; n cin >> m; n int A[10001]; n int B[10001]; n map res; n char pat[100]; n for (int i = (0), ei = (m); i < ei; i++) { n scanf( %s , pat); n int mask = 0; n for (int j = (0), ej = (strlen(pat)); j < ej; j++) n mask |= 1 << (pat[j] - a ); n B[i] = A[i] = mask; n } n sort(B, B + m); n int Pos[26] = {0}; n for (int i = (0), ei = (26); i < ei; i++) Pos[i] = -1; n int mask = 0, curr; n pair P[26]; n str[n] = z + 1; n for (int i = (0), ei = (n); i < ei; i++) { n mask |= 1 << (str[i] - a ); n Pos[str[i] - a ] = i; n for (int j = (0), ej = (26); j < ej; j++) { n P[j].first = Pos[j]; n P[j].second = j; n } n sort(P, P + 26); n curr = mask; n int next = 1 << (str[i + 1] - a ); n if (binary_search(B, B + m, mask) && (mask & next) == 0) res[mask]++; n for (int j = (0), ej = (25); j < ej; j++) n if (P[j].first != -1) { n curr &= ~(1 << P[j].second); n if (binary_search(B, B + m, curr) && (curr & next) == 0) res[curr]++; n } n } n for (int i = (0), ei = (m); i < ei; i++) printf( %d n , res[A[i]]); n } n int main() { n run(); n return 0; n } n "} +{"func_code_string": "#include n n #define st first n #define nd second n #define pb push_back n #define BOOST ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); n #define PI 3.14159265359 n n using namespace std; n n typedef long long ll; n constexpr ll MOD = 1000000007, sup = 29; n constexpr ll MOD_1 = 1234567891, sup_1 = 1009; n constexpr ll MOD_2 = 1000000009, sup_2 = 107; n constexpr int MXN = 200000+10, CZAPA = (1<<18), INF = 1000000000; n n int n, m; n n struct tree{ n pair tab[2*CZAPA+10]; n n void add(int leaf, int x){ n int v = leaf + CZAPA; n tab[v] = {x, x}; n v /= 2; n while(v >= 1){ n tab[v].st = min(tab[2*v].st, tab[2*v+1].st); n tab[v].nd = max(tab[2*v].nd, tab[2*v+1].nd); n v /= 2; n } n } n n pair query(int a, int b, int v, int p, int q){ n if(q < a || b < p) n return {INF, -INF}; n if(p >= a && q <= b) n return tab[v]; n int mid = (p+q)/2; n pair x = query(a, b, 2*v, p, mid), y = query(a, b, 2*v+1, mid+1, q); n return {min(x.st, y.st), max(x.nd, y.nd)}; n } n n pair query(int a, int b){ n return query(a+CZAPA, b+CZAPA, 1, CZAPA, 2*CZAPA-1); n } n }; n n tree T; n n int tab[MXN]; n n n int main(){ n BOOST; n n int t; n cin>> t; n T.add(0, 0); n while(t--){ n string s; n cin>> n >> m >> s; n for(int i=1; i<=n; i++){ n tab[i] = tab[i-1]; n if(s[i-1] == - ) n tab[i]--; n else n tab[i]++; n T.add(i, tab[i]); n //cout<< tab[i] << ; n } n //cout<< n ; n while(m--){ n int a, b; n cin>> a >> b; n pair x = T.query(0, a-1); n int sum = tab[b] - tab[a-1]; n pair y = T.query(b+1, n); n if(y.st == INF){ n cout<< abs(x.st-x.nd)+1 << n ; n continue; n } n y.st -= sum; n y.nd -= sum; n pair ans = {min(x.st, y.st), max(x.nd, y.nd)}; n cout<< abs(ans.st-ans.nd)+1 << n ; n //cout<< x.st << ~ << x.nd << , << y.st << ~ << y.nd << n ; n } n } n n n n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int s = 0, w = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) w = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 , ch = getchar(); n return s * w; n } n const int inf = 2e9 + 7; n double eps = 1e-6; n const int mod = 1e9 + 9; n const int N = 1e3 + 10; n const double pi = acos(-1.0); n long long power(long long a, long long b) { n long long res = 1; n while (b) { n if (b & 1) res = res * a % mod; n a = a * a % mod; n b >>= 1; n } n return res; n } n long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); } n long long exgcd(long long a, long long b, long long& x, long long& y) { n long long c; n return !b ? (x = 1, y = 0, a) n : (c = exgcd(b, a % b, y, x), y -= (a / b) * x, c); n } n long long INV(long long a) { n long long x, y; n exgcd(a, mod, x, y); n x %= mod; n if (x < 0) x += mod; n return x; n } n int n; n long long dp[N][N][11]; n struct AC { n int tr[N][26], tot; n int fail[N]; n int tr2[N][26]; n int Len[N]; n bool key[N]; n int insert(char s[]) { n int u = 0; n for (int i = 1; s[i]; i++) { n int c = s[i] - a ; n if (!tr[u][c]) tr[u][c] = ++tot; n Len[tr[u][c]] = Len[u] + 1; n u = tr[u][c]; n } n key[u] = 1; n return u; n } n void build() { n for (int i = 0; i <= tot; ++i) n for (int j = 0; j <= 3; ++j) tr2[i][j] = tr[i][j]; n queue q; n for (int i = 0; i <= 25; ++i) n if (tr[0][i]) q.push(tr[0][i]); n while (!q.empty()) { n int u = q.front(); n q.pop(); n for (int i = 0; i <= 25; ++i) { n if (tr[u][i]) { n fail[tr[u][i]] = tr[fail[u]][i], q.push(tr[u][i]); n } else n tr[u][i] = tr[fail[u]][i]; n } n } n } n int dfs(int u, int len, int k) { n bool ok = key[u]; n int now = u; n while (1) { n now = fail[now]; n if (Len[now] >= k && key[now]) { n ok |= 1; n break; n } n if (now == 0) break; n } n if (ok) k = 0; n if (!u) return 0; n if (dp[u][len][k] != -1) return dp[u][len][k]; n if (len == n) { n bool ok = key[u]; n int now = u; n while (1) { n now = fail[now]; n if (Len[now] >= k && key[now]) { n ok |= 1; n break; n } n if (now == 0) break; n } n return dp[u][len][k] = ok; n } n long long& res = dp[u][len][k] = 0; n for (int i = 0; i <= 3; i++) { n if (tr2[u][i]) n res += dfs(tr2[u][i], len + 1, k + 1); n else { n int now = u; n while (1) { n now = fail[now]; n if (Len[now] >= k && tr2[now][i]) { n res += dfs(tr2[now][i], len + 1, k + 1); n break; n } n if (now == 0) break; n } n } n } n res %= mod; n return res; n } n int work() { n memset(dp, -1, sizeof(dp)); n long long res = 0; n for (int i = 0; i <= 3; i++) res += dfs(tr[0][i], 1, 1); n res %= mod; n return res; n } n } ac; n char s[N]; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int m; n cin >> n >> m; n map mp; n mp[ A ] = a ; n mp[ C ] = b ; n mp[ T ] = c ; n mp[ G ] = d ; n for (int i = 1; i <= m; ++i) { n cin >> s + 1; n for (int i = 1; i <= strlen(s + 1); ++i) s[i] = mp[s[i]]; n ac.insert(s); n } n ac.build(); n cout << ac.work() << n ; n } n "} +{"func_code_string": "#include n using namespace std; n struct edge { n long long to, cost; n edge() {} n edge(long long a, long long b) { to = a, cost = b; } n }; n const long long dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1}; n const long long mod = 1000000007; n struct mint { n long long x = 0; n mint(long long y = 0) { n x = y; n if (x < 0 || x >= mod) x = (x % mod + mod) % mod; n } n mint(const mint& ope) { x = ope.x; } n mint operator-() { return mint(-x); } n mint operator+(const mint& ope) { return mint(x) += ope; } n mint operator-(const mint& ope) { return mint(x) -= ope; } n mint operator*(const mint& ope) { return mint(x) *= ope; } n mint operator/(const mint& ope) { return mint(x) /= ope; } n mint& operator+=(const mint& ope) { n x += ope.x; n if (x >= mod) x -= mod; n return *this; n } n mint& operator-=(const mint& ope) { n x += mod - ope.x; n if (x >= mod) x -= mod; n return *this; n } n mint& operator*=(const mint& ope) { n x *= ope.x, x %= mod; n return *this; n } n mint& operator/=(const mint& ope) { n long long n = mod - 2; n mint mul = ope; n while (n) { n if (n & 1) *this *= mul; n mul *= mul; n n >>= 1; n } n return *this; n } n mint inverse() { return mint(1) / *this; } n bool operator==(const mint& ope) { return x == ope.x; } n bool operator!=(const mint& ope) { return x != ope.x; } n }; n mint modpow(mint a, long long n) { n if (n == 0) return mint(1); n if (n % 2) n return a * modpow(a, n - 1); n else n return modpow(a * a, n / 2); n } n istream& operator>>(istream& is, mint& ope) { n long long t; n is >> t, ope.x = t; n return is; n } n ostream& operator<<(ostream& os, mint& ope) { return os << ope.x; } n ostream& operator<<(ostream& os, const mint& ope) { return os << ope.x; } n vector fact, fact_inv; n void make_fact(int n) { n fact.resize(n + 1), fact_inv.resize(n + 1); n fact[0] = mint(1); n for (long long i = (1); (i) <= (n); (i)++) fact[i] = fact[i - 1] * mint(i); n fact_inv[n] = fact[n].inverse(); n for (long long i = (n - 1); (i) >= (0); (i)--) n fact_inv[i] = fact_inv[i + 1] * mint(i + 1); n } n mint comb(long long n, long long k) { n if (n < 0 || k < 0 || n < k) return mint(0); n return fact[n] * fact_inv[k] * fact_inv[n - k]; n } n mint perm(long long n, long long k) { return comb(n, k) * fact[k]; } n vector prime; n void make_prime(int n) { n prime.resize(n + 1); n for (long long i = (2); (i) <= (n); (i)++) { n if (prime[i]) continue; n for (int j = i; j <= n; j += i) prime[j] = i; n } n } n bool exceed(long long x, long long y, long long m) { return x >= m / y + 1; } n void mark() { cout << * << endl; } n void yes() { cout << YES << endl; } n void no() { cout << NO << endl; } n long long sgn(long long x) { n if (x > 0) return 1; n if (x < 0) return -1; n return 0; n } n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } n long long digitnum(long long x, long long b = 10) { n long long ret = 0; n for (; x; x /= b) ret++; n return ret; n } n long long digitsum(long long x, long long b = 10) { n long long ret = 0; n for (; x; x /= b) ret += x % b; n return ret; n } n string lltos(long long x) { n string ret; n for (; x; x /= 10) ret += x % 10 + 0 ; n reverse(ret.begin(), ret.end()); n return ret; n } n long long stoll(string& s) { n long long ret = 0; n for (auto c : s) ret *= 10, ret += c - 0 ; n return ret; n } n template n void uniq(T& vec) { n sort(vec.begin(), vec.end()); n vec.erase(unique(vec.begin(), vec.end()), vec.end()); n } n template n pair& operator+=(pair& s, const pair& t) { n s.first += t.first, s.second += t.second; n return s; n } n template n pair& operator-=(pair& s, const pair& t) { n s.first -= t.first, s.second -= t.second; n return s; n } n template n pair operator+(const pair& s, const pair& t) { n return pair(s.first + t.first, s.second + t.second); n } n template n pair operator-(const pair& s, const pair& t) { n return pair(s.first - t.first, s.second - t.second); n } n template n ostream& operator<<(ostream& os, vector& vec) { n for (int i = 0; i < vec.size(); i++) n os << vec[i] << (i + 1 == vec.size() ? : ); n return os; n } n template n ostream& operator<<(ostream& os, deque& deq) { n for (int i = 0; i < deq.size(); i++) n os << deq[i] << (i + 1 == deq.size() ? : ); n return os; n } n template n ostream& operator<<(ostream& os, pair& pair_var) { n os << ( << pair_var.first << , << pair_var.second << ) ; n return os; n } n template n ostream& operator<<(ostream& os, const pair& pair_var) { n os << ( << pair_var.first << , << pair_var.second << ) ; n return os; n } n template n ostream& operator<<(ostream& os, map& map_var) { n for (typename map::iterator itr = map_var.begin(); itr != map_var.end(); n itr++) { n os << ( << itr->first << , << itr->second << ) ; n itr++; n if (itr != map_var.end()) os << , ; n itr--; n } n return os; n } n template n ostream& operator<<(ostream& os, set& set_var) { n for (typename set::iterator itr = set_var.begin(); itr != set_var.end(); n itr++) { n os << *itr; n ++itr; n if (itr != set_var.end()) os << ; n itr--; n } n return os; n } n template n ostream& operator<<(ostream& os, multiset& set_var) { n for (typename multiset::iterator itr = set_var.begin(); n itr != set_var.end(); itr++) { n os << *itr; n ++itr; n if (itr != set_var.end()) os << ; n itr--; n } n return os; n } n template n void outa(T a[], long long s, long long t) { n for (long long i = s; i <= t; i++) { n cout << a[i]; n if (i < t) cout << ; n } n cout << endl; n } n void dump_func() { cout << endl; } n template n void dump_func(Head&& head, Tail&&... tail) { n cout << head; n if (sizeof...(Tail) > 0) cout << ; n dump_func(std::move(tail)...); n } n long long n; n long long a[150005]; n bool check(long long i) { n if (i <= 0 || i >= n) return true; n if (i % 2) n return a[i] < a[i + 1]; n else n return a[i] > a[i + 1]; n } n int main(void) { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n; n for (long long i = (1); (i) <= (n); (i)++) cin >> a[i]; n set S; n set > ans; n for (long long i = (1); (i) <= (n - 1); (i)++) n if (!check(i)) S.insert(i); n if (((long long)(S).size()) > 4) { n dump_func(0); n return 0; n } n set T; n for (auto x : S) { n T.insert(x); n T.insert(x + 1); n } n for (auto x : T) { n for (long long i = (1); (i) <= (n); (i)++) { n if (i == x) continue; n swap(a[i], a[x]); n bool flag = true; n for (auto y : S) flag &= check(y); n for (long long j = (-1); (j) <= (1); (j)++) n flag &= check(i + j), flag &= check(x + j); n if (flag) { n long long u = i, v = x; n if (u > v) swap(u, v); n ans.insert(pair(u, v)); n } n swap(a[i], a[x]); n } n } n dump_func(((long long)(ans).size())); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const long long LINF = 0x3f3f3f3f3f3f3f3fLL; n const double PI = acos(-1.0); n const double EPS = 1e-8; n const int MOD = 998244353; n template n void cmin(T &x, T y) { n if (y < x) x = y; n } n template n void cmax(T &x, T y) { n if (y > x) x = y; n } n long long qpow(long long x, long long n, long long mod = MOD) { n long long res = 1; n while (n) { n if (n & 1) res = res * x % mod; n x = x * x % mod; n n >>= 1; n } n return res; n } n namespace Solver { n void InitOnce() {} n int n, m, k; n int u[200005]; n int v[200005]; n int deg[200005]; n vector > G[200005]; n void Read() { n int res = scanf( %d%d%d , &n, &m, &k); n if (res == -1) exit(0); n for (int i = 1; i <= n; ++i) G[i].clear(); n for (int i = 1; i <= m; ++i) { n scanf( %d%d , &u[i], &v[i]); n G[u[i]].emplace_back(v[i], i); n G[v[i]].emplace_back(u[i], i); n } n for (int i = 1; i <= n; ++i) deg[i] = G[i].size(); n } n bool vis[200005]; n int ans[200005]; n bool inQ[200005]; n queue Q; n void delEdge(int u, int v, int id) { n if (vis[id]) return; n vis[id] = 1; n --deg[u]; n --deg[v]; n if (inQ[v] == 0 && deg[v] < k) { n Q.push(v); n inQ[v] = 1; n } n } n void delEdge2(int u, int v, int id) { n if (vis[id]) return; n vis[id] = 1; n --deg[u]; n --deg[v]; n if (inQ[u] == 0 && deg[u] < k) { n Q.push(u); n inQ[u] = 1; n } n if (inQ[v] == 0 && deg[v] < k) { n Q.push(v); n inQ[v] = 1; n } n } n void Solve() { n memset(vis, 0, sizeof(vis)); n memset(ans, 0, sizeof(ans)); n memset(inQ, 0, sizeof(inQ)); n for (int i = 1; i <= n; ++i) { n if (deg[i] < k) { n Q.push(i); n inQ[i] = 1; n } n } n int cur = n; n while (!Q.empty()) { n int u = Q.front(); n Q.pop(); n --cur; n for (pair &p : G[u]) { n int v = p.first, id = p.second; n delEdge(u, v, id); n } n } n for (int i = 1; i <= n; ++i) { n if (deg[i]) assert(deg[i] >= k); n } n ans[m] = cur; n for (int i = m - 1; i >= 0; --i) { n int de = i + 1; n delEdge2(u[de], v[de], de); n while (!Q.empty()) { n int u = Q.front(); n Q.pop(); n --cur; n for (pair &p : G[u]) { n int v = p.first, id = p.second; n delEdge(u, v, id); n } n } n ans[i] = cur; n } n for (int i = 1; i <= n; ++i) { n assert(deg[i] == 0); n assert(inQ[i] == 1); n } n for (int i = 1; i <= m; ++i) assert(vis[i] == 1); n for (int i = 1; i <= m; ++i) printf( %d n , ans[i]); n return; n } n } // namespace Solver n int main() { n Solver::InitOnce(); n while (true) { n Solver::Read(); n Solver::Solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1e9 + 7; n const long long INF = 1e18; n const string nl = n ; n int32_t main() { n ios::sync_with_stdio(0); n cin.tie(nullptr); n long long n, k; n cin >> n >> k; n vector a(n); n for (auto& i : a) { n cin >> i; n } n vector pref(n); n long long sum = 0, ans = 0; n bool ok = 0; n map cnt; n cnt[0] = 1; n for (long long i = 0; i < n; ++i) { n if (a[i] > k) { n ++sum; n } else if (a[i] < k) { n --sum; n } n if (a[i] == k) { n ok = 1; n } n if (ok) { n ans += cnt[sum] + cnt[sum - 1]; n } else { n ++cnt[sum]; n } n } n cout << ans << nl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c, cc = 0; n cin >> a >> b >> c; n if (a < 0 || b < 2 || c < 4) n cout << 0 << endl; n else { n while (a >= 1 && b >= 2 && c >= 4) { n cc++; n a--; n b -= 2; n c -= 4; n } n cout << cc * 7 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector v[100001]; n int main() { n int n; n cin >> n; n for (long long i = 1; i < n; i++) { n long long a, b; n cin >> a >> b; n v[a].push_back(b); n v[b].push_back(a); n } n for (long long i = 1; i <= n; i++) { n if (v[i].size() == 2) { n cout << NO ; n return 0; n } n } n cout << YES ; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma GCC optimize( -Ofast ) n #pragma GCC optimize( trapv ) n #pragma GCC target( n sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native ) n #pragma GCC optimize( -ffast-math ) n #pragma GCC optimize( -funroll-loops ) n #pragma GCC optimize( -funroll-all-loops,-fpeel-loops,-funswitch-loops ) n const int N = 1e3 + 40; n const int MAXK = 12; n const long long int INF = 1000000000000000000; n const int RANDOM = n chrono::high_resolution_clock::now().time_since_epoch().count(); n long long int expo_pow(long long int x, long long int y) { n if (y == 0) return 1; n y = y % ((1000000007) - 1); n x %= (1000000007); n if (y == 0) y = (1000000007) - 1; n long long int res = 1; n while (y) { n if (y & 1) res = (res * x) % (1000000007); n x = (x * x) % (1000000007); n y >>= 1; n } n return res; n } n long long int modInverse(long long int a, long long int m = (1000000007)) { n return expo_pow(a, m - 2); n } n void solve() { n int n; n cin >> n; n vector> cnt(n + 2); n map ones; n map t; n for (long long int i = (1); i < (n + 1); i++) { n int tp, w; n cin >> tp >> w; n if (w) ones[tp]++; n t[tp]++; n } n for (auto x : t) { n cnt[x.second].push_back(ones[x.first]); n } n priority_queue> pq; n long long int ans = 0; n long long int fo = 0; n set second; n for (long long int i = (1); i < (n + 1); i++) { n if (1) second.insert(i); n for (long long int j = (0); j < (cnt[i].size()); j++) { n pq.push(make_pair(cnt[i][j], i)); n } n } n while (second.size()) { n if (pq.empty()) break; n int x = pq.top().second; n auto it = second.upper_bound(x); n if (it == second.begin()) { n pq.pop(); n continue; n } n it--; n ans += *it; n fo += min(*it, pq.top().first); n pq.pop(); n second.erase(*it); n } n cout << ans << << fo << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int T = 1; n cin >> T; n while (T--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n long n, k, iters, p[10000], q[1000], rp[1000], ar[200000], ar1[20000]; n long ans; n bool not_same() { n for (int i = 1; i <= n; i++) n if (ar[i] != q[i]) return true; n return false; n } n int main() { n ios_base::sync_with_stdio(0); n cin >> n >> k; n for (int i = 1; i <= n; i++) cin >> p[i]; n for (int i = 1; i <= n; i++) cin >> q[i]; n for (int i = 1; i <= n; i++) rp[p[i]] = i; n long tf = 0; n for (int i = 1; i <= n; i++) n if (rp[i] != p[i]) tf = 1; n ans = 0; n for (int i = 1; i <= n; i++) ar[i] = i; n iters = 0; n while (not_same()) { n ++iters; n for (int i = 1; i <= n; i++) ar1[i] = ar[p[i]]; n for (int i = 1; i <= n; i++) ar[i] = ar1[i]; n if (iters > k) break; n } n if (iters <= k && iters % 2 == k % 2) ans = 1; n for (int i = 1; i <= n; i++) ar[i] = i; n iters = 0; n while (not_same()) { n ++iters; n for (int i = 1; i <= n; i++) ar1[i] = ar[rp[i]]; n for (int i = 1; i <= n; i++) ar[i] = ar1[i]; n if (iters > k) break; n } n if (iters <= k && iters % 2 == k % 2) ans = 1; n long fl = 0; n for (int i = 1; i <= n; i++) n if (q[i] != i) fl = 1; n if (fl == 0) ans = 0; n if (tf == 0 && k > 1) ans = 0; n if (ans) n cout << YES << endl; n else n cout << NO << endl; n cin.get(); n cin.get(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a, b, ans = 6; n int len[15], last[15]; n void dfs(int x, int va) { n if (x == 7) { n ans = min(ans, va); n return; n } n for (int i = 1; i <= va; i++) { n if (last[i] >= len[x]) { n last[i] -= len[x]; n dfs(x + 1, va); n last[i] += len[x]; n } n } n last[va + 1] = n - len[x]; n dfs(x + 1, va + 1); n } n int main() { n scanf( %d%d%d , &n, &a, &b); n for (int i = 1; i <= 4; i++) len[i] = a; n for (int i = 5; i <= 6; i++) len[i] = b; n dfs(1, 0); n printf( %d , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n vector s; n set ss; n string a, b, res; n int n, cnt_a = 0, cnt_b = 0; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a; n ss.insert(a); n s.push_back(a); n } n if (ss.size() == 1) n cout << s[0] << endl; n else { n sort(s.begin(), s.end()); n a = s[0]; n b = s[n - 1]; n for (int i = 0; i < n; i++) { n if (s[i].compare(a) == 0) n cnt_a++; n else n cnt_b++; n } n res = (cnt_a > cnt_b) ? a : b; n cout << res << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n int x, y; n while (t--) { n cin >> x >> y; n if (y <= sqrt(x)) { n if (x % 2 == 0 && y % 2 == 0) n cout << YES << endl; n else if (x % 2 == 1 && y % 2 == 1) n cout << YES << endl; n else n cout << NO << endl; n } else n cout << NO << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1000003; n long double pi = 3.1415926536; n const int mx = 1000003; n long long gcd(long long x, long long y) { n if (y == 0) return x; n return gcd(y, x % y); n } n long long bp(long long a, long long b) { n long long ans = 1; n while (b > 0) { n if (b & 1) ans = (ans * a) % mod; n a = (a * a) % mod; n b >>= 1; n } n return ans; n } n long long p(long long n) { n for (long long i = 2; i * i <= n; i++) { n if (n % i == 0) { n return n / i; n } n } n return 1; n } n void solve() { n long long a, d, x, i = 1; n cin >> a >> d; n x = a++; n while ((a % i) <= d) { n x = (a - (a % i)); n i *= 10; n } n cout << x - 1; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int a, b; n cin >> a >> b; n if (a == 0 && b == 0) { n cout << 1; n } n if (a == 0 && b != 0) { n for (int i = b + 1; i > 0; i--) { n cout << i << ; n } n } n if (b == 0 && a != 0) { n for (int i = 1; i <= a + 1; i++) { n cout << i << ; n } n } n int z = a + b + 1; n if (a != 0 && b != 0) { n a++; n b++; n int m = 0; n int n = 0; n while (a--) { n m = z - a; n cout << m << ; n } n while (b > 1) { n b--; n cout << b << ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long qitaceruts(long long num) { n long long n = 0, d, p = 1; n while (num > 0) { n d = num % 10; n num = num / 10; n if (d != 0) { n n = (d * p) + n; n p *= 10; n } n } n return n; n } n int main() { n long long a, b, c1, c2; n cin >> a >> b; n c1 = a + b; n a = qitaceruts(a); n b = qitaceruts(b); n c1 = qitaceruts(c1); n if (a + b == c1) { n cout << YES n ; n } else { n cout << NO n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s1, s2; n int main() { n int n, i, j; n scanf( %d , &n); n cin >> s1 >> s2; n int ans = 0; n for (i = 0; i < (n / 2); i++) { n j = n - i - 1; n map mp; n mp[s1[i]]++; n mp[s1[j]]++; n mp[s2[i]]++; n mp[s2[j]]++; n int len = mp.size(); n if (len == 4) n ans += 2; n else if (len == 3) n ans += 1 + (s1[i] == s1[j]); n else if (len == 2) n ans += (mp[s1[i]] != 2); n } n if ((n % 2) && (s1[n / 2] != s2[n / 2])) ans++; n printf( %d , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cout.tie(0); n int n; n cin >> n; n vector in(n + 1); n for (int i = 0; i < n; i++) { n int a; n cin >> a; n in[a] = true; n } n vector b(n); n for (int i = 0; i < n; i++) { n cin >> b[i]; n } n int ind = 0; n int next_ = 1; n vector c = b; n for (; next_ <= n; ind++) { n int t = ind - n - 1; n if (t >= 0 && t < n) { n in[b[ind - n - 1]] = true; n } n if (c[ind % n] == next_) { n next_++; n c[ind % n] = -1; n continue; n } n if (c[ind % n] == -1 && in[next_]) { n next_++; n continue; n } n c[ind % n] = -1; n if (ind - next_ + 1 < n) { n next_ = 1; n } n } n cout << ind - n << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n long long L[500005]; n char ch[500005]; n class segtree { n public: n long long seg[(1 << 19) * 2]; n long long lazy[(1 << 19) * 2]; n void lazy_evaluate(int k) { n if (k * 2 + 2 >= (1 << 19) * 2) return; n lazy[k * 2 + 2] += lazy[k]; n lazy[k * 2 + 1] += lazy[k]; n seg[k * 2 + 2] += lazy[k]; n seg[k * 2 + 1] += lazy[k]; n lazy[k] = 0; n } n long long update(int beg, int end, int idx, int lb, int ub, long long num) { n if (ub < beg || end < lb) { n return seg[idx]; n } n if (beg <= lb && ub <= end) { n lazy[idx] += num; n seg[idx] += num; n return seg[idx]; n } n if (lazy[idx]) { n lazy_evaluate(idx); n } n return seg[idx] = n min(update(beg, end, idx * 2 + 1, lb, (lb + ub) / 2, num), n update(beg, end, idx * 2 + 2, (lb + ub) / 2 + 1, ub, num)); n } n long long query(int beg, int end, int idx, int lb, int ub) { n if (ub < beg || end < lb) { n return 1500000000000000000LL; n } n if (beg <= lb && ub <= end) { n return seg[idx]; n } n if (lazy[idx]) { n lazy_evaluate(idx); n } n return min(query(beg, end, idx * 2 + 1, lb, (lb + ub) / 2), n query(beg, end, idx * 2 + 2, (lb + ub) / 2 + 1, ub)); n } n } kaede; n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %lld , &L[i]); n scanf( %s , &ch); n long long cur = 0; n long long ans = 0; n bool ok = 0; n for (int i = 0; i < n; i++) { n if (ch[i] == L ) n ans += L[i]; n else if (ch[i] == W ) n ans += L[i] * 3LL; n else n ans += L[i] * 5LL; n } n vector vec; n int lasw, lasg; n for (int i = 0; i < n; i++) { n if (ch[i] == G ) { n cur += L[i]; n kaede.update(i, i, 0, 0, (1 << 19) - 1, cur); n vec.push_back(L[i]); n lasg = i; n continue; n } n if (ch[i] == W ) { n cur += L[i]; n lasw = i; n ok = 1; n kaede.update(i, i, 0, 0, (1 << 19) - 1, cur); n vec.push_back(L[i]); n continue; n } n if (ch[i] == L ) { n if (cur >= L[i]) { n cur -= L[i]; n kaede.update(i, i, 0, 0, (1 << 19) - 1, cur); n vec.push_back(L[i]); n continue; n } else { n long long need = L[i] - cur; n if (ok) { n ans += 3LL * need; n vec[lasw] += need; n } else { n ans += 5LL * need; n vec[lasg] += need; n } n cur = 0; n vec.push_back(L[i]); n kaede.update(i, i, 0, 0, (1 << 19) - 1, cur); n continue; n } n } n } n for (int i = n - 1; i >= 0; i--) { n if (ch[i] == L ) continue; n if (ch[i] == W ) continue; n long long mn = kaede.query(i, n - 1, 0, 0, (1 << 19) - 1); n if (2LL * vec[i] <= mn) { n kaede.update(i, n - 1, 0, 0, (1 << 19) - 1, -2LL * vec[i]); n ans -= 4LL * vec[i]; n } else { n kaede.update(i, n - 1, 0, 0, (1 << 19) - 1, -mn); n ans -= 2LL * mn; n } n } n for (int i = n - 1; i >= 0; i--) { n if (ch[i] == L ) continue; n if (ch[i] == G ) continue; n long long mn = kaede.query(i, n - 1, 0, 0, (1 << 19) - 1); n if (2LL * vec[i] <= mn) { n kaede.update(i, n - 1, 0, 0, (1 << 19) - 1, -2LL * vec[i]); n ans -= 2LL * vec[i]; n } else { n kaede.update(i, n - 1, 0, 0, (1 << 19) - 1, -mn); n ans -= 1LL * mn; n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1e9 + 7; n const int INF = 0x3f3f3f3f; n const int MAXN = 3e6 + 3; n bool appear[MAXN]; n int ans[MAXN]; n signed main() { n int cnt = 1; n int n, x; n scanf( %d%d , &n, &x); n int now = 0; n appear[0] = true; n appear[x] = true; n for (int i = 1; i < (1 << n); ++i) { n if (appear[i]) continue; n appear[i ^ x] = true; n ans[cnt++] = i; n } n printf( %d n , cnt - 1); n for (int i = 1; i < cnt; ++i) printf( %d , ans[i] ^ ans[i - 1]); n } n "} +{"func_code_string": "#include n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n using namespace std; n void JIZZ(string output = ) { n cout << output; n exit(0); n } n const long double PI = 3.14159265358979323846264338327950288; n const long double eps = 1e-13; n const long long mod = 1e9 + 7; n long long a[200005], pre[200005]; n vector good; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int n; n long long k; n cin >> n >> k; n for (int i = 1; i <= n; ++i) cin >> a[i]; n for (int i = 1; i <= n; ++i) pre[i] = pre[i - 1] + a[i]; n for (int i = 1; i <= n; ++i) n if (a[i] > 1) good.push_back(i); n good.push_back(n + 1); n if (0) { n long long ans = 0; n for (int i = 1; i <= n; ++i) { n long long s = 0, p = 1; n for (int j = i; j <= n; ++j) { n if (((long double)p) * a[j] > 2e18) break; n p *= a[j], s += a[j]; n if (s * k == p) cout << i << << j << endl, ++ans; n } n } n cout << ans << endl; n } n long long ans = 0; n for (int i = 1; i <= n; ++i) { n long long p = a[i], s = a[i]; n int now = i; n auto ptr = upper_bound(good.begin(), good.end(), i); n if (s * k <= p && p <= (s + *ptr - now) * k && p % k == 0) ++ans; n while (p <= 2e18) { n if (*ptr == n + 1) break; n if (((long double)p) * a[*ptr] > 2e18) break; n p *= a[*ptr]; n s += pre[*ptr] - pre[now]; n now = *ptr; n ++ptr; n if (s * k <= p && p <= (s + *ptr - now - 1) * k && p % k == 0) ++ans; n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n long long N, Q; n long long A[1100100], a, b; n vector > qu[1100100]; n long long sol[1100100], dp[1100100]; n long long solve(long long I, long long b) { n if (I > N) return 0; n long long ret = A[I]; n return ret += solve(I + b, b); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> N; n for (long long I = 1; I <= N; I++) cin >> A[I]; n cin >> Q; n for (long long q = 1; q <= Q; q++) { n cin >> a >> b; n qu[b].push_back(pair(a, q)); n } n for (long long b = 1; b <= N; b++) { n if (b < 300) { n for (long long I = N; I >= 1; I--) { n dp[I] = A[I]; n if (I + b <= N) dp[I] += dp[I + b]; n } n for (typeof((qu[b]).begin()) it = (qu[b]).begin(); it != (qu[b]).end(); n it++) n sol[it->second] = dp[it->first]; n } else { n for (typeof((qu[b]).begin()) it = (qu[b]).begin(); it != (qu[b]).end(); n it++) n sol[it->second] = solve(it->first, b); n } n } n for (long long q = 1; q <= Q; q++) cout << sol[q] << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 100000 + 10; n int n, m; n pair s[MAX]; n pair ans; n void update(long long a, long long b) { n if (b <= 0) return; n if (a > ans.first) { n ans.first = a; n ans.second = b; n } else if (a == ans.first) n ans.second += b; n } n void work1() { n int i, mi = n, mm = 0; n long long num = 0; n for ((i) = (1); (i) <= (m); ++(i)) n if (s[i].first == 0) { n ++num; n mi = min(mi, s[i].second); n mm = max(mm, s[i].second); n } n long long num_mi = 0, num_mm = 0; n for ((i) = (1); (i) <= (m); ++(i)) { n if (s[i].first == 0 && s[i].second == mi) ++num_mi; n if (s[i].first == 0 && s[i].second == mm) ++num_mm; n } n if (mm == mi) { n update(0, num * (num - 1) * (num - 2) / 6); n return; n } n num -= num_mi; n num -= num_mm; n update((mm - mi) * 2, (num_mi - 1) * num_mi / 2 * num_mm + n (num_mm - 1) * num_mm / 2 * num_mi + n num * num_mi * num_mm); n } n int cmp(pair a, pair b) { n if (a.second != b.second) n return a.second < b.second; n else n return a.first < b.first; n } n void work2() { n sort(s + 1, s + m + 1, cmp); n int i; n long long num0 = 0; n for ((i) = (1); (i) <= (m); ++(i)) n if (s[i].first == 0) ++num0; n int largb = 0, numb = 0, tmp = num0; n for ((i) = (1); (i) <= (m); ++(i)) n if (s[i].first == 0) { n --tmp; n if (largb != s[i].second) n update(2LL * n + 2 * largb - 2 * s[i].second, (long long)tmp * numb); n } else if (s[i].second == largb) n ++numb; n else if (s[i].second > largb) n largb = s[i].second, numb = 1; n int smallb = n + 1; n numb = 0; n tmp = num0; n for (i = m; i >= 1; --i) n if (s[i].first == 0) { n --tmp; n if (smallb != s[i].second) n update(2LL * n - 2 * smallb + 2 * s[i].second, (long long)tmp * numb); n } else if (s[i].second == smallb) n ++numb; n else if (s[i].second < smallb) n smallb = s[i].second, numb = 1; n map hash; n for ((i) = (1); (i) <= (m); ++(i)) n if (s[i].first == 0) hash[s[i].second]++; n tmp = 0; n for ((i) = (1); (i) <= (m); ++(i)) { n if (s[i].first == 0) n ++tmp; n else { n long long u = hash[s[i].second]; n long long now = (long long)tmp * (num0 - tmp) + n (long long)u * (u - 1) / 2 + (tmp - u) * u; n update(2LL * n, now); n } n } n } n void work() { n work1(); n work2(); n } n int main() { n int i; n scanf( %d%d , &n, &m); n for ((i) = (1); (i) <= (m); ++(i)) scanf( %d%d , &s[i].first, &s[i].second); n work(); n for ((i) = (1); (i) <= (m); ++(i)) s[i].first ^= 1; n work(); n cout << ans.second << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n if (n == 1) n cout << 1 << endl; n else n cout << (n / 2) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 200005; n const int inf = 1e9 + 7; n int main() { n int n; n scanf( %d , &n); n while (n--) { n int x; n scanf( %d , &x); n if (x <= 3 || x == 5 || x == 7 || x == 11) n puts( -1 ); n else { n int ans = 0, tg = x & 3; n if (!tg) ans = max(ans, x / 4); n if (tg == 2) ans = max(ans, 1 + (x - 6) / 4); n if (tg == 1) ans = max(ans, 1 + (x - 9) / 4); n if (tg == 3) ans = max(ans, 2 + (x - 15) / 4); n printf( %d n , ans); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int Maxn = ((int)1e5) + 100; n int arr[Maxn], n; n map num, numL, numR; n long long Solve(int a[]) { n int l = 0, r = n - 1; n while (a[l] == a[r] && l < r) ++l, --r; n if (l >= r) return n * 1ll * (n + 1) / 2; n for (int(i) = (l); (i) <= (r); ++(i)) num[a[i]] += 1; n int odds = 0, key = -1; n for (auto it = num.begin(); it != num.end(); ++it) n if ((it->second) & 1) odds += 1, key = it->first; n if (odds > 1) return 0; n int oks = 0, l2 = l - 1; n while (oks < num.size()) { n numL[a[++l2]] += 1; n int _a = numL[a[l2]] << 1; n int _b = _a - 2, _c = num[a[l2]]; n if (_a >= _c && _b < _c) ++oks; n } n oks = 0; n int r2 = r + 1; n while (oks < num.size()) { n numR[a[--r2]] += 1; n int _a = numR[a[r2]] << 1; n int _b = _a - 2, _c = num[a[r2]]; n if (_a >= _c && _b < _c) ++oks; n } n int mid = (r + l) >> 1; n if (l2 <= mid && (!(n & 1) || a[mid] == key)) { n int g, h; n if (n & 1) n g = mid - 1, h = mid + 1; n else n g = mid, h = mid + 1; n while (a[g] == a[h]) --g, ++h; n l2 = g, r2 = h; n } n long long sum = 0; n sum += (l + 1) * 1ll * (n - l2); n sum += (n - r) * 1ll * (r2 + 1); n sum -= (l + 1) * 1ll * (n - r); n return sum; n } n int main() { n iostream::sync_with_stdio(false); n cin >> n; n for (int(i) = (0); (i) <= (n - 1); ++(i)) cin >> arr[i]; n cout << Solve(arr) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1e9; n const long long INF = 1e18; n const int M = 1e9 + 7; n const int maxn = 1e6; n int b[maxn], c[maxn]; n signed main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cout.setf(ios::fixed); n cout.precision(10); n int m, k, n, s; n cin >> m >> k >> n >> s; n vector a(m); n for (int i = 0; i < m; ++i) { n cin >> a[i]; n } n for (int i = 0; i < s; ++i) { n int x; n cin >> x; n ++b[x]; n } n int res = inf; n int l = 0, r = 0, cnt = 0; n int L = 0, R = 0; n while (r < m) { n while (r < m && cnt < s) { n if (c[a[r]] < b[a[r]]) { n ++cnt; n } n ++c[a[r]]; n ++r; n } n while (l < m && cnt == s) { n int tl = l / k, tr = (r - 1) / k; n int tot; n if (tl == tr) { n tot = 0; n } else { n tot = r - tl * k - k; n } n if (tot < res) { n L = l; n R = r - 1; n res = tot; n } n c[a[l]]--; n if (c[a[l]] < b[a[l]]) { n --cnt; n } n ++l; n } n } n if ((m - res) / k < n) { n cout << -1 << endl; n } else { n cout << res << endl; n for (int i = R; i >= L - L % k; --i) { n if (res == 0) break; n if (!b[a[i]]) { n cout << i + 1 << ; n --res; n } else { n --b[a[i]]; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100007; n const int maxv = 100000; n long long fac[maxn], fac2[maxn]; n map, int> save; n int cnt; n long long mypow(int base, int n) { n if (n == 0) return 1; n long long t = mypow(base, n / 2); n t = (t * t) % 1000000007; n if (n & 1) n return (t * base) % 1000000007; n else n return t; n } n long long C(int n, int k) { n long long res = fac[n] * fac2[k] % 1000000007; n res = res * fac2[n - k] % 1000000007; n return res; n } n long long solve(int f, int n) { n if (f == 1) return (n == 1); n if (f == n) return 1; n if (f > n) return 0; n if (save.count(pair(f, n))) return save[pair(f, n)]; n long long res = 0; n for (int i = 2; i * i <= n; i++) n if (n % i == 0) { n int x = i; n res = (res + solve(f, n / x)) % 1000000007; n if (i * i == n) continue; n x = n / i; n res = (res + solve(f, n / x)) % 1000000007; n } n save[pair(f, n)] = n (C(n - 1, f - 1) - res + 1000000007) % 1000000007; n return save[pair(f, n)]; n } n int main() { n fac[0] = 1; n for (int i = 1, _c = maxv; i <= _c; i++) fac[i] = fac[i - 1] * i % 1000000007; n for (int v = 0, _c = maxv; v <= _c; v++) n fac2[v] = mypow(fac[v], 1000000007 - 2); n int q, f, n; n scanf( %d , &q); n for (int i = 0, _a = (q); i < _a; ++i) { n scanf( %d%d , &n, &f); n printf( %I64d n , solve(f, n)); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, i, j, s1 = 1, s2 = 1, d = 0; n cin >> n >> m; n if (n == 1 && m == 1) { n cout << 0 << endl; n cout << 1 << << 1 << endl; n cout << 1 << << 1 << endl; n exit(0); n } n if (n == 1 && m == 2) { n cout << 0 << endl; n cout << 1 << << 1 << endl; n cout << 1 << << 2 << endl; n cout << 1 << << 1 << endl; n exit(0); n } n if (n == 2 && m == 1) { n cout << 0 << endl; n cout << 1 << << 1 << endl; n cout << 2 << << 1 << endl; n cout << 1 << << 1 << endl; n exit(0); n } n if (n == 1) { n cout << 1 << endl; n cout << n << << m << << 1 << << 1 << endl; n for (i = 1; i <= m; i++) { n cout << 1 << << i << endl; n } n cout << 1 << << 1; n exit(0); n } n if (m == 1) { n cout << 1 << endl; n cout << n << << m << << 1 << << 1 << endl; n for (i = 1; i <= n; i++) { n cout << i << << 1 << endl; n } n cout << 1 << << 1; n exit(0); n } n if (n % 2 != 0 && m % 2 != 0) { n cout << 1 << endl; n cout << n << << m << << 1 << << 1 << endl; n for (i = 1; i <= n; i++) { n if (d == 0) { n for (j = 1; j <= m; j++) { n cout << i << << j << endl; n } n d = 1; n } else { n for (j = m; j >= 1; j--) { n cout << i << << j << endl; n } n d = 0; n } n } n cout << 1 << << 1; n } else { n cout << 0 << endl; n cout << 1 << << 1 << endl; n if (n % 2 == 0) { n s2++; n for (i = 1; i <= n; i++) { n if (d == 0) { n for (j = 2; j <= m; j++) { n cout << i << << j << endl; n } n d = 1; n } else { n for (j = m; j >= 2; j--) { n cout << i << << j << endl; n } n d = 0; n } n } n for (i = n; i >= 1; i--) { n cout << i << << 1 << endl; n } n } else { n s2++; n for (i = 1; i <= m; i++) { n if (d == 0) { n for (j = 2; j <= n; j++) { n cout << j << << i << endl; n } n d = 1; n } else { n for (j = n; j >= 2; j--) { n cout << j << << i << endl; n } n d = 0; n } n } n for (i = m; i >= 1; i--) { n cout << 1 << << i << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n char T[1 << 21]; n int n, m, ar[21][21]; n int U[21], V[21], P[21], way[21], minv[21]; n int hungarian(int n, int m, int ar[21][21]) { n memset(way, 0, sizeof(way)), memset(U, 0, sizeof(U)), memset(V, 0, sizeof(V)), n memset(P, 0, sizeof(P)); n int i, j, i0, i1, j0, j1, x, y, cur, delta, used, lim = (1 << (m + 1)) - 1; n for (i = 1; i <= n; i++) { n used = 0; n P[0] = i, j0 = 0; n for (j = 0; j <= m; j++) minv[j] = (1 << 27); n do { n used |= (1 << j0); n i0 = P[j0], j1 = 0, delta = (1 << 27), x = (used | 1) ^ lim; n while (x) { n y = (-x & x); n j = T[y]; n x ^= y; n cur = ar[i0][j] - U[i0] - V[j]; n if (cur < minv[j]) { n minv[j] = cur; n way[j] = j0; n } n if (minv[j] < delta) { n delta = minv[j]; n j1 = j; n } n } n for (j = 0; j <= m; j++) { n if (used & (1 << j)) { n U[P[j]] += delta; n V[j] -= delta; n } else n minv[j] -= delta; n } n j0 = j1; n } while (P[j0] != 0); n do { n j1 = way[j0]; n P[j0] = P[j1]; n j0 = j1; n } while (j0 != 0); n } n return -V[0]; n } n int fri[21][21], sat[21][21]; n int main() { n int i, j, k, x, res, lim, mask; n for (i = 0; i < 21; i++) T[1 << i] = i; n while (scanf( %d , &n) != EOF) { n for (i = 0; i < n; i++) { n for (j = 0; j < n; j++) { n scanf( %d , &fri[i][j]); n } n } n for (i = 0; i < n; i++) { n for (j = 0; j < n; j++) { n scanf( %d , &sat[i][j]); n } n } n res = 0, lim = 1 << n; n for (mask = 0; mask < lim; mask++) { n if (__builtin_popcount(mask) == (n >> 1)) { n for (i = 0; i < n; i++) { n for (j = 0; j < n; j++) { n if (mask & (1 << i)) n ar[i + 1][j + 1] = -fri[i][j]; n else n ar[i + 1][j + 1] = -sat[i][j]; n } n } n x = -hungarian(n, n, ar); n if (x > res) res = x; n } n } n printf( %d n , res); n } n return 0; n } n "} +{"func_code_string": "#include n int n, m; n int map[1010][1010]; n int strpnt[1001000][2]; n int q[1001000][2]; n int qs, qe; n int stn; n int ans; n int gcd(int x, int y) { n if (y == 0) return x; n return gcd(y, x % y); n } n int main() { n int i, j, k, l, t; n scanf( %d%d , &n, &m); n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n scanf( %d , &map[i + 1][j + 1]); n } n } n n += 2; n m += 2; n k = 0; n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n if (map[i + 1][j + 1] == 1) { n t = 0; n t += map[i][j + 1]; n t += map[i + 1][j]; n t += map[i + 1][j + 2]; n t += map[i + 2][j + 1]; n if (t == 1 || t == 3) { n k++; n } n if (t == 0) { n printf( -1 ); n return 0; n } n } n } n } n if (k != 0 && k != 2) { n printf( -1 ); n return 0; n } n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n if (map[i + 1][j + 1] == 1) { n t = 0; n t += map[i][j + 1]; n t += map[i + 1][j]; n t += map[i + 1][j + 2]; n t += map[i + 2][j + 1]; n if (t != 2 || (!(((map[i][j + 1] == 1 && map[i + 2][j + 1] == 1) || n (map[i + 1][j] == 1 && map[i + 1][j + 2] == 1))))) { n strpnt[stn][0] = i; n strpnt[stn][1] = j; n stn++; n } n } n } n } n if (stn < 2) { n printf( -1 ); n return 0; n } n for (i = 1; i < stn; i++) { n strpnt[i][0] -= strpnt[0][0]; n if (strpnt[i][0] < 0) strpnt[i][0] = -strpnt[i][0]; n strpnt[i][1] -= strpnt[0][1]; n if (strpnt[i][1] < 0) strpnt[i][1] = -strpnt[i][1]; n ans = gcd(strpnt[i][0], ans); n ans = gcd(strpnt[i][1], ans); n } n if (ans < 2) { n printf( -1 ); n return 0; n } n t = 0; n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n if (map[i][j] == 1) { n t = 1; n break; n } n } n if (t == 1) break; n } n qe = 1; n q[0][0] = i; n q[0][1] = j; n map[i][j] = 0; n for (qs = 0; qs < qe; qs++) { n if (map[q[qs][0] + 1][q[qs][1]] == 1) { n map[q[qs][0] + 1][q[qs][1]] = 0; n q[qe][0] = q[qs][0] + 1; n q[qe][1] = q[qs][1]; n qe++; n } n if (map[q[qs][0] - 1][q[qs][1]] == 1) { n map[q[qs][0] - 1][q[qs][1]] = 0; n q[qe][0] = q[qs][0] - 1; n q[qe][1] = q[qs][1]; n qe++; n } n if (map[q[qs][0]][q[qs][1] + 1] == 1) { n map[q[qs][0]][q[qs][1] + 1] = 0; n q[qe][0] = q[qs][0]; n q[qe][1] = q[qs][1] + 1; n qe++; n } n if (map[q[qs][0]][q[qs][1] - 1] == 1) { n map[q[qs][0]][q[qs][1] - 1] = 0; n q[qe][0] = q[qs][0]; n q[qe][1] = q[qs][1] - 1; n qe++; n } n } n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n if (map[i][j] == 1) { n printf( -1 ); n return 0; n } n } n } n for (i = 2; i <= ans; i++) { n if (ans % i == 0) printf( %d , i); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long in() { n int32_t x; n scanf( %d , &x); n return x; n } n inline string getStr() { n char ch[1000000]; n scanf( %s , ch); n return ch; n } n const long long MOD = 1e9 + 7; n const long long base = 29; n const long long MAX_N = 3e5 + 1; n inline long long divide(long long a, long long b) { return (a + b - 1) / b; } n vector g[MAX_N]; n long long deg[MAX_N]; n bool vis[MAX_N]; n long long res[MAX_N]; n inline void dfs(long long node, long long part) { n if (vis[node] == true) return; n res[node] = part; n long long cnt = 0; n for (long long i = 0; i < g[node].size(); i++) { n long long u = g[node][i]; n if (res[node] == res[u]) cnt++; n } n if (cnt > 1) { n res[node] ^= 1; n dfs(node, res[node]); n vis[node] = false; n return; n } n vis[node] = true; n for (long long pt = 0; pt < g[node].size(); pt++) { n long long u = g[node][pt]; n if (res[u] == res[node]) { n dfs(u, res[u]); n vis[node] = 0; n return; n } n } n vis[node] = false; n } n int32_t main() { n long long n = in(), m = in(); n for (long long i = 0; i < m; i++) { n long long v = in(), u = in(); n deg[v]++, deg[u]++; n g[v].push_back(u); n g[u].push_back(v); n } n for (long long i = 1; i <= n; i++) res[i] = 1; n for (long long i = 1; i <= n; i++) { n dfs(i, res[i]); n } n for (long long i = 1; i <= n; i++) cout << res[i]; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n string s; n cin >> s; n int res = 0; n for (int i = 0; i < n; i++) { n res++; n if (i == n - 1) break; n if (s[i] != s[i + 1]) { n i++; n } n } n cout << res << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int n, x, y, z, x_, y_, z_; n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n cin >> x_ >> y_ >> z_; n x += x_; n z += z_; n y += y_; n } n if (x != 0 || y != 0 || z != 0) n cout << NO << endl; n else n cout << YES << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct IInt { n int z; n }; n bool cmp(int a, int b) { return a < b; } n bool operator<(IInt a, IInt b) { return a.z > b.z; } n int main() { n int n, m, x, i, ans, ans1; n IInt t; n scanf( %d%d , &n, &m); n vector q; n priority_queue w; n for (i = 0; i < m; i++) { n scanf( %d , &x); n q.push_back(x); n t.z = x; n w.push(t); n } n make_heap(q.begin(), q.end(), cmp); n ans = ans1 = 0; n for (i = 0; i < n; i++) { n ans += q[0]; n q[0]--; n make_heap(q.begin(), q.end(), cmp); n } n for (i = 0; i < n; i++) { n t = w.top(); n w.pop(); n ans1 += t.z; n if (t.z == 1) { n continue; n } else { n t.z--; n w.push(t); n } n } n printf( %d %d n , ans, ans1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2005, M = 2000010; n const long long MOD = 1E9 + 7; n long long Pow(long long a, long long b) { n long long c = 1; n for (; b; a = a * a % MOD, b >>= 1) n if (b & 1) c = c * a % MOD; n return c; n } n struct Node { n int x, y; n bool operator<(const Node &a) const { n return (x != a.x) ? (x < a.x) : (y < a.y); n } n } p[N]; n int h, w, n, m; n long long fac[M], fac_inv[M]; n long long f[N]; n void Init() { n fac[0] = 1; n for (int i = 1; i <= m; ++i) fac[i] = fac[i - 1] * i % MOD; n fac_inv[m] = Pow(fac[m], MOD - 2); n for (int i = m; i; --i) fac_inv[i - 1] = fac_inv[i] * i % MOD; n return; n } n inline long long F(int a, int b) { n return fac[a + b] * fac_inv[a] % MOD * fac_inv[b] % MOD; n } n int main() { n scanf( %d%d%d , &h, &w, &n); n m = h + w; n Init(); n for (int i = 1; i <= n; ++i) scanf( %d%d , &p[i].x, &p[i].y); n sort(p + 1, p + n + 1); n for (int i = 1; i <= n; ++i) { n f[i] = F(p[i].x - 1, p[i].y - 1); n for (int j = 1; j < i; ++j) n if (p[j].y <= p[i].y) n f[i] = (f[i] + MOD - f[j] * F(p[i].x - p[j].x, p[i].y - p[j].y) % MOD) % n MOD; n } n long long res = F(h - 1, w - 1); n for (int i = 1; i <= n; ++i) n res = (res + MOD - f[i] * F(h - p[i].x, w - p[i].y) % MOD) % MOD; n printf( %lld n , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000000000; n const int MOD = 1000000007; n signed main() { n cin.tie(0), cout.tie(0); n ios::sync_with_stdio(0); n int n, k; n cin >> n >> k; n int a, b, c, d; n cin >> a >> b >> c >> d; n if (k < n + 1 || n <= 4) n cout << -1 << n , exit(0); n else { n cout << a << << c << ; n for (int i = 1; i <= n; i++) n if (i != a && i != b && i != c && i != d) cout << i << ; n cout << d << << b << n ; n cout << c << << a << ; n for (int i = 1; i <= n; i++) n if (i != a && i != b && i != c && i != d) cout << i << ; n cout << b << << d << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int h1, a1, c1, h2, a2; n int move_counter = 0; n vector move; n cin >> h1 >> a1 >> c1 >> h2 >> a2; n while (h2 > 0) { n if (h2 - a1 <= 0) { n move.push_back( S ); n ++move_counter; n break; n } else { n if (h1 - a2 <= 0) { n h1 += c1; n move.push_back( H ); n ++move_counter; n } else { n h2 -= a1; n move.push_back( S ); n ++move_counter; n } n h1 -= a2; n } n } n cout << move_counter << n ; n for (const auto it : move) { n if (it == H ) n cout << HEAL << n ; n else n cout << STRIKE << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k, x[1010], dp[1010][1010], sm[1010]; n long long solve(long long gap) { n dp[0][0] = 1, x[0] = -200000; n for (long long i = 1; i <= k; ++i) { n for (long long j = 0; j <= n; ++j) n sm[j] = j == 0 ? dp[i - 1][j] : (dp[i - 1][j] + sm[j - 1]) % 998244353; n long long pos = 0; n for (long long j = 1; j <= n; ++j) { n while (x[j] - x[pos + 1] >= gap) pos++; n dp[i][j] = sm[pos]; n } n } n long long sum = 0; n for (long long i = 1; i <= n; ++i) sum = (sum + dp[k][i]) % 998244353; n return sum; n } n int32_t main() { n cin.tie(0), cout.sync_with_stdio(0); n cin >> n >> k; n for (long long i = 1; i <= n; ++i) cin >> x[i]; n sort(x + 1, x + 1 + n); n long long dis = 100000 / (k - 1), pre = solve(1), ans = 0; n for (long long i = 2; i <= dis + 5; ++i) { n long long now = solve(i); n ans = (ans + (pre - now + 998244353) * (i - 1)) % 998244353; n pre = now; n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int arr[1000]; n int num; n cin >> num; n for (int i = 0; i < num; i++) { n cin >> arr[i]; n arr[num + i] = arr[i]; n } n int ans = 360; n for (int i = 0; i < num; i++) { n int temp = 0; n for (int j = i; j < num * 2; j++) { n temp += arr[j]; n ans = min(ans, abs(360 - 2 * temp)); n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a, b; n char s[1000005]; n int arr[205]; n int main() { n scanf( %d%d%d%s , &n, &a, &b, s); n int i, j, len = strlen(s), tag; n if (len > n * b || len < n * a) { n puts( No solution ); n return 0; n } n int eve = len / n; n for (i = 0; i < n; i++) { n arr[i] = eve; n } n eve = len % n; n for (i = 0; i < eve; i++) arr[i]++; n for (i = tag = 0; i < n; i++) { n for (j = 0; j < arr[i]; j++) printf( %c , s[tag++]); n puts( ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char instr[51], outstr[51] = {}, ch; n int n, i; n cin >> instr; n cin >> n; n for (i = 0; i < strlen(instr); i++) { n if (instr[i] < 97) instr[i] += 32; n } n for (i = 0; i < strlen(instr); i++) { n ch = instr[i]; n if (int(ch) < (n + 97)) { n outstr[i] = ch - 32; n } else { n outstr[i] = ch; n } n } n cout << outstr; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n int N, M; n cin >> N >> M; n vector arr(N + 2); n arr[0] = 1; n for (int i = 0; i < N; ++i) cin >> arr[i + 1]; n arr[N + 1] = 1; n int q = M, w = M; n int r = 0; n while (q > 0 || w < N + 1) { n int s = arr[q] + arr[w]; n if (s == 2) r += s - (q == 0) - (w == N + 1) - (w == q); n if (q > 0) q--; n if (w < N + 1) w++; n } n cout << r << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long a, b, c, d = 0, e = 0, f = 0, g = 0, i, j, k = 1, l = 1, r = 1, n n[300001], m[300001], q, u, v, w, y, z[400001], h[400001], n p[500001]; n string s, t, x; n cin >> a >> b >> c; n for (i = 1; i <= a; i++) { n cin >> d >> e; n f += (d - g) / c; n g = d + e; n } n cout << f + ((b - g) / c); n } n "} +{"func_code_string": "#include n using namespace std; n long long int d[300002]; n int safe[300002]; n bool solve() { n long long int n, k, l, i; n cin >> n >> k >> l; n for (i = 1; i <= n; i++) cin >> d[i]; n int tide, dir, mtide; n tide = k; n dir = -1; n for (i = 1; i <= n; i++) { n if (d[i] + k <= l) n tide = k, dir = -1; n else if (d[i] > l) n return false; n else { n mtide = l - d[i]; n if (tide + dir <= mtide) { n tide += dir; n if (tide == 0) dir = 1; n } else if (dir == -1 && mtide < tide - 1) { n tide = mtide; n if (tide == 0) dir = 1; n } else n return false; n } n } n return true; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t, i; n cin >> t; n while (t--) { n if (solve()) n cout << Yes n ; n else n cout << No n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n long long int a[n]; n unordered_map mp; n for (int i = 0; i < n; i++) { n cin >> a[i]; n mp[a[i]]++; n } n if (mp.size() == 1) n cout << NO << endl; n else { n cout << YES << endl; n int f = -1, s = -1; n for (int i = 1; i < n; i++) { n if (a[i] != a[0]) { n f = i; n break; n } n } n for (int i = 1; i < n; i++) { n if (a[i] != a[f]) n cout << i + 1 << << f + 1 << endl; n else n cout << 1 << << i + 1 << endl; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long MAX = 2e5 + 10; n int n; n string s, xx = RGB ; n int getID(char c) { n if (c == R ) n return 1; n else if (c == G ) n return 2; n return 3; n } n int last[4]; n int dp[MAX][4][4][4]; n int mn = 1e9; n vector v, ans; n int tokyoGhoul(int cur, int cnt) { n if (cur == n) { n if (cnt < mn) { n mn = cnt; n ans = v; n } n return cnt; n } n int &ret = dp[cur][last[0]][last[1]][last[2]]; n if (~ret) return ret; n ret = 1e18; n for (int i = 0; i < xx.size(); i++) { n int id = getID(xx[i]); n int prev = last[id]; n char ch = xx[i]; n if (prev == -1 || (cur - prev) != 1) { n v.push_back(ch); n last[id] = cur; n if (xx[i] != s[cur]) n ret = min(ret, tokyoGhoul(cur + 1, cnt + 1)); n else n ret = min(ret, tokyoGhoul(cur + 1, cnt)); n last[id] = prev; n v.pop_back(); n } n } n return ret; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n >> s; n vector vv; n int cnt = 0, cnt2 = 0; n string s1 = , s2 = ; n for (int j = 0; j < 3; j++) { n cnt = 0, s1 = ; n s1 += xx[j]; n if (s[0] != s1[0]) cnt++; n for (int i = 1; i < n; i++) { n if (s[i] == s1[i - 1]) { n cnt++; n bool f = 1; n for (int j = 0; j < xx.size(); j++) { n if (s1[i - 1] != xx[j] && (i + 1 == n || s[i + 1] != xx[j])) { n s1 += xx[j]; n f = 0; n break; n } n } n if (f) n for (int j = 0; j < xx.size(); j++) { n if (s[i - 1] != xx[j]) { n s1 += xx[j]; n break; n } n } n } else n s1 += s[i]; n } n if (cnt < mn) { n mn = cnt; n s2 = s1; n } n } n cout << mn << endl; n for (auto i : s2) cout << i; n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n template n T min(T a, T b, T c) { n return min(a, min(b, c)); n } n template n T max(T a, T b, T c) { n return max(a, max(b, c)); n } n int r, c, k, n, a[15][15]; n int main() { n scanf( %d%d%d%d , &r, &c, &n, &k); n for (int i = (1); i <= (n); ++i) { n int x, y; n scanf( %d%d , &x, &y); n a[x][y] = 1; n } n int ans = 0; n for (int x1 = (1); x1 <= (r); ++x1) { n for (int y1 = (1); y1 <= (c); ++y1) { n for (int x2 = (x1); x2 <= (r); ++x2) { n for (int y2 = (y1); y2 <= (c); ++y2) { n int sum = 0; n for (int x = (x1); x <= (x2); ++x) { n for (int y = (y1); y <= (y2); ++y) sum += a[x][y]; n } n if (sum >= k) ++ans; n } n } n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 5010, inf = 0x7fffffff; n bool has[maxn][maxn], flag = 0; n int sum[maxn][maxn], n, m, l[10], r[10], req; n long long ans; n void init() { n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n sum[i][j] = n sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (has[i][j] == 1); n } n int calculate(int x1, int y1, int x2, int y2) { n return sum[x2][y2] - sum[x1][y2] - sum[x2][y1] + sum[x1][y1]; n } n void work(int up, int down, int left, int right, bool dir) { n if (left == right || up == down) return; n if (left + 1 == right && up + 1 == down) { n ans += calculate(up, left, down, right) == req; n return; n } n if (dir == 0) { n int mid = (left + right) >> 1; n work(up, down, left, mid, dir ^ 1); n work(up, down, mid, right, dir ^ 1); n for (int i = up; i < down; i++) { n l[0] = r[0] = mid; n for (int k = 1; k <= req + 1; k++) l[k] = left, r[k] = right; n for (int j = i + 1; j <= down; j++) { n for (int k = 1; k <= req + 1; k++) n while (calculate(i, l[k], j, mid) >= k) l[k]++; n for (int k = 1; k <= req + 1; k++) n while (calculate(i, mid, j, r[k]) >= k) r[k]--; n for (int k = 0; k <= req; k++) n ans += (l[k] - l[k + 1]) * (r[req - k + 1] - r[req - k]); n } n } n } else { n int mid = (up + down) >> 1; n work(up, mid, left, right, dir ^ 1); n work(mid, down, left, right, dir ^ 1); n for (int i = left; i < right; i++) { n l[0] = r[0] = mid; n for (int k = 1; k <= req + 1; k++) l[k] = up, r[k] = down; n for (int j = i + 1; j <= right; j++) { n for (int k = 1; k <= req + 1; k++) n while (calculate(l[k], i, mid, j) >= k) l[k]++; n for (int k = 1; k <= req + 1; k++) n while (calculate(mid, i, r[k], j) >= k) r[k]--; n for (int k = 0; k <= req; k++) n ans += (l[k] - l[k + 1]) * (r[req - k + 1] - r[req - k]); n } n } n } n } n int main() { n while (scanf( %d%d%d , &n, &m, &req) == 3) { n memset(has, 0, sizeof(has)); n ans = 0; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) scanf( %1d , &has[i][j]); n init(); n work(0, n, 0, m, n < m); n printf( %I64d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, ta, tb; n cin >> a >> ta >> b >> tb; n int t, m; n char c; n cin >> t >> c >> m; n m += 60 * t; n int cur = 5 * 60; n int res = 0; n while (cur < 24 * 60) { n if (min(cur + tb, m + ta) > max(cur, m)) ++res; n cur += b; n } n cout << res; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 100000007; n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n long long powmod(long long a, long long b) { n long long res = 1; n a %= mod; n assert(b >= 0); n for (; b; b >>= 1) { n if (b & 1) res = res * a % mod; n a = a * a % mod; n } n return res; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n vector nums(n); n for (int i = 0; i < n; i++) cin >> nums[i]; n double all = 0; n sort(nums.rbegin(), nums.rend()); n for (int i = 1; i < n; i++) all += nums[i]; n all = 1.0 * all / (n - 1) + nums[0]; n printf( %.8lf n , all); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n string res = ; n cin >> n; n int arr[2004] = {0}; n for (int i = 0; i < n; ++i) { n cin >> arr[i]; n } n int now_rejt = 0; n int mesto = 1; n for (int i = 0; i < n; ++i) { n now_rejt = arr[i]; n mesto = 1; n for (int j = 0; j < n; ++j) { n if (now_rejt < arr[j]) { n ++mesto; n } n } n stringstream ss; n ss << mesto; n string strmesto; n ss >> strmesto; n res = res + + strmesto; n } n res.erase(0, 1); n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map>> answers; n int main() { n int t; n cin >> t; n for (int i = 0; i < t; i++) { n int bus, tram, money; n cin >> bus >> tram >> money; n string s; n cin >> s; n int cur = s.size() - 2; n while (true) { n char cur_char = s[cur]; n if (cur_char == A ) { n if (bus > money) { n cout << cur + 2 << n ; n break; n } n money -= bus; n } n if (cur_char == B ) { n if (tram > money) { n cout << cur + 2 << n ; n break; n } n money -= tram; n } n while (cur >= 0 && s[cur] == cur_char) { n cur -= 1; n } n if (cur == -1) { n cout << 1 << n ; n break; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int GCD(int x, int y) { return !y ? x : GCD(y, x % y); } n int LCM(int x, int y) { return x * y / GCD(x, y); } n long long ceilDivision(long long dividend, long long divisor) { n return (dividend + divisor - 1) / divisor; n } n bool check(pair right, pair left) { n return ((left.second > right.second) || n (left.second == right.second && left.first > right.first)); n } n int main() { n long long r, avg, sum = 0, target, counter = 0; n int n, pointer = 0; n cin >> n >> r >> avg; n vector > arr(n); n target = avg * n; n for (int i = 0; i < n; i++) n cin >> arr[i].first >> arr[i].second, sum += arr[i].first; n if (sum < target) { n sort(arr.begin(), arr.end(), check); n target -= sum; n while (target) { n if (arr[pointer].first < r) n counter += (min(target, r - arr[pointer].first) * arr[pointer].second), n target -= min(target, r - arr[pointer].first); n pointer++; n } n } n cout << counter << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector> dir_graph; n vector vis, order; n void dfs(int i) { n vis[i] = true; n for (int j = 0; j < dir_graph[i].size(); j++) { n if (!vis[dir_graph[i][j]]) { n dfs(dir_graph[i][j]); n } n } n order.push_back(i); n } n int main() { n int cases; n cin >> cases; n while (cases--) { n int n, m; n cin >> n >> m; n dir_graph = vector>(n); n order.clear(); n vis = vector(n); n vector> edges; n int type, s, d; n for (int i = 0; i < m; i++) { n cin >> type >> s >> d; n s--; n d--; n if (type == 1) dir_graph[s].push_back(d); n edges.push_back({s, d}); n } n for (int i = 0; i < n; i++) { n if (!vis[i]) { n dfs(i); n } n } n vector pos(n); n reverse(order.begin(), order.end()); n for (int i = 0; i < n; ++i) { n pos[order[i]] = i; n } n bool hasCycle = false; n for (int i = 0; i < n; i++) { n for (int j = 0; j < dir_graph[i].size(); j++) { n if (pos[i] > pos[dir_graph[i][j]]) { n hasCycle = true; n break; n } n } n } n if (hasCycle) n cout << NO << endl; n else { n cout << YES n ; n for (int i = 0; i < edges.size(); i++) { n if (pos[edges[i].first] < pos[edges[i].second]) { n cout << edges[i].first + 1 << << edges[i].second + 1 << endl; n } else { n cout << edges[i].second + 1 << << edges[i].first + 1 << endl; n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char ch[] = { B , u , l , b , a , s , a , u , r }; n map mp; n string ss; n int n, k, i, cnt = 100000; n cin >> ss; n for (i = 0; i < ss.size(); i++) { n mp[ss[i]]++; n } n for (i = 0; i < 9; i++) { n k = mp[ch[i]]; n if (ch[i] == u || ch[i] == a ) k = k / 2; n cnt = min(cnt, k); n } n cout << cnt << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n cin >> n; n if (n % 2 == 0) n printf( -1 n ); n else { n for (k = 0; k < n; k++) printf( %d , ((n / 2 + 1 - k) + n) % n); n cout << endl; n for (k = 0; k < n; k++) printf( %d , ((n / 2 + 2 * k) + n) % n); n cout << endl; n for (k = 0; k < n; k++) printf( %d , k); n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n int n; n int arr1[10]; n int arr2[100005]; n pair diffs[600005]; n int cnts[100005]; n int main() { n while (scanf( %d , arr1) == 1) { n for (int i = 1; i < 6; ++i) { n scanf( %d , arr1 + i); n } n scanf( %d , &n); n for (int i = 0; i < n; ++i) { n scanf( %d , arr2 + i); n } n int idx = 0; n for (int i = 0; i < 6; ++i) { n for (int j = 0; j < n; ++j) { n diffs[idx].first = arr2[j] - arr1[i]; n diffs[idx].second = j; n ++idx; n } n } n sort(diffs, diffs + idx); n memset(cnts, 0, sizeof(cnts)); n int cnt = 0; n int j = 0; n int ans = INF; n for (int i = 0; i < 5 * n; ++i) { n if (i && --cnts[diffs[i - 1].second] <= 0) { n --cnt; n } n while (cnt < n && j < 6 * n) { n if (cnts[diffs[j].second]++ == 0) { n ++cnt; n } n ++j; n } n if (cnt >= n) { n ans = min(ans, diffs[j - 1].first - diffs[i].first); n } n } n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char a; n cin >> a; n string str1, str2; n cin >> str1 >> str2; n int b1, b2; n switch (str1[0]) { n case T : n b1 = 10; n break; n case J : n b1 = 11; n break; n case Q : n b1 = 12; n break; n case K : n b1 = 13; n break; n case A : n b1 = 14; n break; n default: n b1 = str1[0] - 0 ; n } n switch (str2[0]) { n case T : n b2 = 10; n break; n case J : n b2 = 11; n break; n case Q : n b2 = 12; n break; n case K : n b2 = 13; n break; n case A : n b2 = 14; n break; n default: n b2 = str2[0] - 0 ; n } n if (str1[1] == a) n if (str2[1] != str1[1]) { n cout << YES ; n } else { n if (b1 > b2) { n cout << YES ; n } else n cout << NO ; n } n else { n if (str2[1] == str1[1]) { n if (b1 > b2) { n cout << YES ; n } else n cout << NO ; n } else { n cout << NO ; n }; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5001; n int n, m, x, y, c[N], p[N], A; n int main() { n cin >> n >> m; n for (int i = 1; i <= n; i++) p[i] = N; n while (m-- && cin >> x >> y) c[x]++, p[x] = min(p[x], (y + n - x) % n); n for (int i = 1; i <= n; i++) { n A = 0; n for (int j = 1; j <= n; j++) n if (c[j]) A = max(A, (j + n - i) % n + (c[j] - 1) * n + p[j]); n cout << A << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 50; n int n, q; n int lca[N][25], mark[N], sum[N], h[N], a[N][4]; n vector adj[N]; n map > m; n void DFS(int v, int p, int hi) { n h[v] = hi; n lca[v][0] = p; n for (auto u : adj[v]) { n if (u == p) continue; n DFS(u, v, hi + 1); n } n } n void dfs_sum(int v, int p) { n sum[v] += mark[v]; n for (auto u : adj[v]) { n if (u == p) continue; n dfs_sum(u, v); n sum[v] += sum[u]; n } n m[p][v] = sum[v]; n } n void LCA() { n for (int j = 1; j <= 20; j++) n for (int i = 1; i <= n; i++) lca[i][j] = lca[lca[i][j - 1]][j - 1]; n } n int find_par(int v, int k) { n for (int j = 0; j <= 20; j++) { n if (k & (1 << j)) v = lca[v][j]; n } n return v; n } n int find_lca(int u, int v) { n v = find_par(v, h[v] - h[u]); n if (v == u) return u; n for (int j = 20; j >= 0; j--) { n if (lca[u][j] != lca[v][j]) { n u = lca[u][j]; n v = lca[v][j]; n } n } n return lca[u][0]; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(); n cin >> n; n for (int i = 1; i < n; i++) { n cin >> a[i][0] >> a[i][1]; n adj[a[i][0]].push_back(a[i][1]); n adj[a[i][1]].push_back(a[i][0]); n } n DFS(n - 1, 0, 1); n LCA(); n cin >> q; n for (int i = 0; i < q; i++) { n int u, v; n cin >> u >> v; n if (h[u] > h[v]) swap(u, v); n int lca = find_lca(u, v); n mark[u]++; n mark[v]++; n mark[lca] -= 2; n } n dfs_sum(n - 1, 0); n for (int i = 1; i < n; i++) { n cout << max(m[a[i][0]][a[i][1]], m[a[i][1]][a[i][0]]) << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n const long long maxn = 1e5 + 5; n void solve() { n long long k; n cin >> k; n long long first = pow(2, 17); n cout << 2 << << 3 << n ; n cout << first + k << << first << << 0 << n n << k << << first + k << << k; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long tc = 1; n while (tc--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 6; n int n, m, k; n int s[N], c[N]; n bool vis[N]; n int fir[N]; n long long ans = 1e15; n void can(int u) { n long long rep = 0; n for (int i = 1; i <= n;) { n if (fir[i + u] == i) { n return; n } n rep += c[u]; n if (i + u > n) { n break; n } n i = fir[i + u]; n } n ans = min(ans, rep); n } n int main() { n scanf( %d%d%d , &n, &m, &k); n for (int i = 1; i <= m; i++) { n scanf( %d , &s[i]); n vis[s[i] + 1] = 1; n } n for (int i = 1; i <= k; i++) { n scanf( %d , &c[i]); n } n for (int i = 1; i <= n; i++) { n if (vis[i]) { n fir[i] = fir[i - 1]; n } else { n fir[i] = i; n } n } n if (!fir[1]) { n printf( -1 n ); n return 0; n } n for (int i = 1; i <= k; i++) { n can(i); n } n if (ans == 1e15) { n printf( -1 n ); n } else { n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int where[26][26]; n int n, dp[(1 << 23) + 5], d[35]; n bool fdp[(1 << 23) + 5]; n int rec(int mask) { n if (fdp[mask]) return dp[mask]; n int next = 0; n for (int i = n - 1; i >= 0; --i) { n if (mask & (1 << i)) { n next = i; n break; n } n } n next++; n fdp[mask] = 1; n if (next == n) return dp[mask] = __builtin_popcount(mask); n int make = d[next + 1]; n dp[mask] = 30; n int valid = 0; n for (int i = 0; i < n; ++i) { n if (mask & (1 << i)) { n int j = where[next + 1][i + 1]; n if (d[i + 1] < make and j) { n j--; n if (mask & (1 << j)) valid = 1; n } n } n } n if (valid) { n dp[mask] = rec(mask | (1 << next)); n for (int i = 0; i < next; ++i) { n if (mask & (1 << i)) n dp[mask] = min(dp[mask], rec((mask ^ (1 << i)) | (1 << next))); n } n } n return dp[mask]; n } n int main() { n cin >> n; n for (int i = 1; i <= n; ++i) { n cin >> d[i]; n } n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= n; ++j) { n int f = d[i] - d[j]; n for (int k = 1; k <= n; ++k) { n if (d[k] == f) { n where[i][j] = k; n } n } n } n } n int ans = rec(1); n if (ans == 30) ans = -1; n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n long long a, b, p, q, ay, by, tx, g, l, ty, x, y, n = 15, d, m, tot, last, lst2; n map wow; n long long shob[104]; n vector all; n char c; n int setbit(int n, int pos) { return n | (1 << (pos)); } n int isbit(int n, int pos) { return n & (1 << (pos)); } n int how(int a, long long &x) { n int ret = 0, boom = 1, wow = 0; n while (a > 0) { n ret++; n int md = a % 7; n wow = boom * md + wow; n boom *= 10; n a /= 7; n } n x = wow; n return ret; n } n int Bboom(int n, int len, int mask, int A) { n if (len > b) { n return 0; n } n int now = n, ans = 0; n for (int i = 0; i < 7; i++) { n if (isbit(mask, i) == 0) { n now = n * 10 + i; n if (len == b && now <= y) { n ans++; n } else if (len < b && now <= y && isbit(mask, i) == 0) { n ans += Bboom(now, len + 1, setbit(mask, i), A); n } n } n } n return ans; n } n int Aboom(int n, int len, int mask) { n if (len > a) { n return 0; n } n int now = n, ans = 0; n for (int i = 0; i < 7; i++) { n if (isbit(mask, i) == 0) { n now = n * 10 + i; n if (len == a && now <= x) { n ans += Bboom(0, 1, setbit(mask, i), now); n } else if (len < a && now <= x) { n ans += Aboom(now, len + 1, setbit(mask, i)); n } n } n } n return ans; n } n int main() { n cin >> n >> m; n n--; n m--; n a = max(how(n, x), 1); n b = max(how(m, y), 1); n if (a + b > 7) { n cout << 0 << endl; n } else { n n = a + b; n p = x; n q = y; n cout << Aboom(0, 1, 0); n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = (long long)1e9 + 7; n const long long inf = (long long)1e16; n const long double eps = 1e-12; n const long long N = (int)1e5 + 5; n const long long LOGN = 19; n const long double PI = 3.14159265358979323846; n inline long long mul(long long a, long long b, long long m = mod) { n return (long long)(a * b) % m; n } n inline long long add(long long a, long long b, long long m = mod) { n a += b; n if (a >= m) a -= m; n if (a < 0) a += m; n return a; n } n inline long long power(long long a, long long b, long long m = mod) { n if (b == 0) return 1; n if (b == 1) return (a % m); n long long x = power(a, b / 2, m); n x = mul(x, x, m); n if (b % 2) x = mul(x, a, m); n return x; n } n bool check(string& k) { n int l = 0, r = k.size() - 1; n while (l < r) { n if (k[l] != k[r]) { n return false; n } n l++; n r--; n } n return true; n } n bool poss(string& k) { n map mp; n int num = 0; n for (int i = 0; i < k.length(); i++) { n if (mp.find(k[i]) == mp.end()) { n mp[k[i]]++; n num++; n } n } n if (num == 1) return false; n return true; n } n int rec(string& s) { n int n = s.length(); n if (!poss(s)) return -1; n if (!check(s)) return 0; n string k; n for (int i = 0; i < n / 2; i++) { n k += s[i]; n } n bool ok = check(k); n if (!ok) { n if (n & 1) return 2; n return 1; n } n int ret = rec(k); n if (ret == -2) { n if (n & 1) return 2; n return 1; n } n if (ret == -1) { n if (n & 1) return -2; n return -1; n } n return ret; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n if (0) { n freopen( C: Users Dishant Desktop Collection-DEV c++ input.txt , r , n stdin); n freopen( C: Users Dishant Desktop Collection-DEV c++ output.txt , w , n stdout); n } n string s; n cin >> s; n int n = s.length(); n int ans = rec(s); n if (ans <= -1) { n cout << Impossible ; n } else n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, k; n cin >> n >> k; n if (n / k % 2) n printf( YES n ); n else n printf( NO n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int maxx(int fd, int sd) { return (fd > sd) ? fd : sd; } n int minn(int fd, int sd) { return (fd < sd) ? fd : sd; } n long long nod(long long a, long long b) { n if (a < b) { n return nod(b, a); n } n if (b == 0) { n return a; n } n return nod(b, a % b); n } n long long nok(long a, long b) { n long long result = (long long)a * (long long)b; n result = result / nod(a, b); n return result; n } n int main() { n long long n, k; n long long overallNOK = 1LL; n scanf( %I64d %I64d , &n, &k); n for (int i = 0; i < n; ++i) { n long long c; n scanf( %I64d , &c); n overallNOK = nok(nod(k, c), overallNOK); n } n printf( %s , (overallNOK % k == 0) ? Yes : No ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000007; n long long powmod(long long a, long long b) { n long long res = 1; n a %= mod; n assert(b >= 0); n for (; b; b >>= 1) { n if (b & 1) res = res * a % mod; n a = a * a % mod; n } n return res; n } n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n const int maxx = 10005; n const int INF = 0x3f3f3f3f; n int n, m, k; n int vis[maxx]; n int ans = 0, cnt = 0, pos = 0; n int l = 0, r = 0; n string a, b; n string s1, s2; n int main() { n scanf( %d%d , &n, &m); n cin >> a >> b; n if (n > m + 1) { n printf( NO n ); n return 0; n } n int fk = 0; n int tag = 0; n for (int i = 0; i < n; i++) { n if (a[i] == * ) { n tag = 1; n continue; n } n if (tag == 0) n s1.push_back(a[i]); n else n s2.push_back(a[i]); n } n if (tag) { n fk = 0; n for (int i = 0; i < ((int)(s1).size()); i++) { n if (b[i] != s1[i]) fk = 1; n } n for (int i = ((int)(s2).size()) - 1; i >= 0; i--) { n if (b[m - ((int)(s2).size()) + i] != s2[i]) { n fk = 1; n } n } n } else { n if (n != m) n fk = 1; n else { n for (int i = 0; i < n; i++) { n if (a[i] != b[i]) { n fk = 1; n break; n } n } n } n } n if (a == * ) fk = 0; n if (fk) n printf( NO n ); n else n printf( YES n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct edge { n int b; n bool x; n edge *next; n } E[100010], *rt[100010]; n int o = 0; n int mi = 100000000; n int N; n void addedge(int a, int b) { n edge *p = &E[o++]; n p->b = b; n p->x = false; n p->next = rt[a]; n rt[a] = p; n p = &E[o++]; n p->b = a; n p->x = true; n p->next = rt[b]; n rt[b] = p; n } n int S[10010]; n bool jud[10010]; n void init() { n for (int i = 1; i <= N; i++) { n jud[i] = false; n S[i] = 0; n } n } n void pdfs(int n) { n jud[n] = true; n for (edge *p = rt[n]; p != NULL; p = p->next) { n int b = p->b; n if (!jud[b]) { n pdfs(b); n S[n] += S[b]; n if (p->x) S[n]++; n } n } n } n void dfs(int n, int s0, int s1) { n jud[n] = true; n int b, s, t0, t1; n for (edge *p = rt[n]; p != NULL; p = p->next) { n b = p->b; n if (!jud[b]) { n s = S[n]; n mi = min(mi, s + s0); n t0 = s + s0 - S[b]; n if (p->x) n s = S[n] - 1; n else n s = S[n] + 1; n mi = min(mi, s + s1); n t1 = s + s1 - S[b]; n s = S[n] - (p->x == true); n mi = min(mi, s + s0); n t1 = min(t1, s + s0 - S[b]); n dfs(b, t0, t1); n } n } n } n int main() { n o = 0; n int i, j, k; n int a, b, s; n scanf( %d , &N); n if (N == 1) { n printf( 0 n ); n return 0; n } n for (i = 0; i <= N; i++) { n rt[i] = NULL; n } n for (i = 1; i < N; i++) { n scanf( %d%d , &a, &b); n addedge(a, b); n } n for (i = 1; i <= N; i++) { n init(); n pdfs(i); n for (j = 0; j <= N; j++) jud[j] = false; n dfs(i, 0, 0); n } n printf( %d n , mi); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n long long h[100000], ans[100000]; n cin >> n; n for (int i = 0; i < n; i++) cin >> h[i]; n ans[n - 1] = 0; n for (int i = n - 2; i >= 0; i--) { n if (h[i] <= h[i + 1]) n ans[i] = h[i + 1] - h[i] + 1; n else n ans[i] = 0; n h[i] = max(h[i], h[i + 1]); n } n for (int i = 0; i < n; i++) cout << ans[i] << ; n } n "} +{"func_code_string": "#include n int inp() { n char c = getchar(); n while (c < 0 || c > 9 ) c = getchar(); n int sum = 0; n while (c >= 0 && c <= 9 ) { n sum = sum * 10 + c - 0 ; n c = getchar(); n } n return sum; n } n int root[1000010]; n struct President_Tree { n int lc[10000000], rc[10000000]; n long long k[10000000], b[10000000]; n int cnt; n void push_up(int cur) { n k[cur] = k[lc[cur]] + k[rc[cur]]; n b[cur] = b[lc[cur]] + b[rc[cur]]; n } n void insert(int &cur, int last, int x, int kc, int bc, int l, int r) { n cur = ++cnt; n if (l == r) { n k[cur] = k[last] + kc; n b[cur] = b[last] + bc; n return; n } n int mid = (l + r) >> 1; n if (x <= mid) { n insert(lc[cur], lc[last], x, kc, bc, l, mid); n rc[cur] = rc[last]; n } else { n lc[cur] = lc[last]; n insert(rc[cur], rc[last], x, kc, bc, mid + 1, r); n } n push_up(cur); n } n long long query(int cur, int last, int ql, int qr, long long x, int l, n int r) { n if (l > qr || r < ql) return 0; n if (l >= ql && r <= qr) return x * (k[cur] - k[last]) + (b[cur] - b[last]); n int mid = (l + r) >> 1; n return query(lc[cur], lc[last], ql, qr, x, l, mid) + n query(rc[cur], rc[last], ql, qr, x, mid + 1, r); n } n } t; n int main() { n int n = inp(); n for (int i = 1; i <= n; i++) { n int xl = inp(); n int xr = inp(); n int yl = inp(); n int k = inp(); n int b = inp(); n int yr = inp(); n t.insert(root[i], root[i - 1], 0, 0, yl, 0, 1e9); n t.insert(root[i], root[i], xl + 1, k, b - yl, 0, 1e9); n t.insert(root[i], root[i], xr + 1, -k, yr - b, 0, 1e9); n } n int m = inp(); n long long lastans = 0; n while (m--) { n int l = inp(); n int r = inp(); n int x = (inp() + lastans) % 1000000000; n lastans = t.query(root[r], root[l - 1], 0, x, x, 0, 1e9); n printf( %lld n , lastans); n } n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int a, int b) { n while (b) { n int temp = b; n b = a % b; n a = temp; n } n return a; n } n int main() { n int a, b, n, counting = 0, GCD; n scanf( %d %d %d , &a, &b, &n); n while (1) { n counting++; n GCD = gcd(a, n); n if (n < GCD) break; n n = n - GCD; n counting++; n GCD = gcd(b, n); n if (n < GCD) break; n n = n - GCD; n } n printf( %d n , counting % 2); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long date(int y, int m, int d) { n if (m < 3) y--, m += 12; n return (long long)365 * y + y / 4 - y / 100 + y / 400 + (153 * m - 457) / 5 + n d - 306; n } n int main() { n int y1, y2, m1, m2, d1, d2; n scanf( %d:%d:%d , &y1, &m1, &d1); n scanf( %d:%d:%d , &y2, &m2, &d2); n printf( %lld n , llabs(date(y1, m1, d1) - date(y2, m2, d2))); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 Rand(time(0)); n long long rnd(long long a) { return Rand() % a; } n long long rnd(long long a, long long b) { return Rand() % (b - a + 1) + a; } n double rnd_01d() { return (double)Rand() / (1ll << 32); } n double rnd_d(double r) { return rnd_01d() * r; } n const long long inf = 1e9 + 7; n void run() { n long long n; n cin >> n; n vector h(n); n for (long long i = 0; i < n; ++i) cin >> h[i]; n long long l = -1, r = 1e9 + 3; n while (r - l > 1) { n long long mid = (l + r) / 2; n vector b; n copy(begin(h), end(h), back_inserter(b)); n bool bad = false; n for (long long i = n - 1; i >= 2; --i) { n if (b[i] < mid) bad = true; n long long d = min(b[i] - mid, h[i]) / 3; n b[i - 1] += d; n b[i - 2] += 2 * d; n } n if (b[1] < mid || b[0] < mid || bad) n r = mid; n else n l = mid; n } n cout << l << endl; n } n signed main() { n cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0); n cout.precision(5); n long long t = 1; n cin >> t; n while (t--) { n run(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int minimum(int x, int y) { return (x < y ? x : y); } n template n struct even { n bool operator()(const type &x, const type &y) const { return x % 2 == 0; } n }; n template n struct odd { n bool operator()(const type &x, const type &y) const { return x % 2 != 0; } n }; n bool flusher(int x) { n string s; n cout << x << endl; n fflush(stdout); n cin >> s; n return s == yes ; n } n long long int magic(string s) { n long long int sum = 0; n for (int i = 0; i < s.size(); i++) { n sum += s[i] - 0 ; n } n return sum; n } n long long int binaryToInt(string s) { n long long int n = s.length(); n long long int res = 0; n long long int base = 1; n for (long long int i = n - 1; i >= 0; i--) { n if (s[i] == 1 ) { n res += base; n } n base *= 2; n } n return res; n } n int main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n int n, k; n cin >> n >> k; n int length = n * 2 + 1; n int res = 0; n int x[length]; n for (int i = 0; i < length; i++) { n cin >> x[i]; n } n for (int i = 1; i < length; i += 2) { n if (x[i] - 1 > x[i - 1] && x[i] - 1 > x[i + 1]) { n x[i]--; n res++; n } n if (res == k) { n break; n } n } n for (int i = 0; i < length; i++) { n cout << x[i] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n cout << (n * 3) / 2 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 50; n long long kol, sum, id, ans; n string s; n vector a; n int main() { n cin >> s; n ans = 0; n sum = 0; n for (int i = 0; i < s.size(); i++) { n if (s[i] == v ) { n id += 1; n if (i == s.size() - 1) { n sum += id - 1; n } n } else { n if (id != 0) { n sum += id - 1; n id = 0; n } n a.push_back(sum); n kol += 1; n } n } n if (a.size() == 0) { n cout << 0; n return 0; n } n for (int i = 0; i < a.size(); i++) { n ans += a[i] * (sum - a[i]); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(NULL); n int n, x; n cin >> n; n while (n--) { n cin >> x; n if (x < 3 || x == 4 || x == 5 || x == 8 || x == 11) n cout << NO << endl; n else n cout << YES << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, k; n int ans = 0; n cin >> n >> m >> k; n int t; n for (int i = 0; i < n; ++i) { n cin >> t; n if (t == 1) { n if (m == 0) n ++ans; n else n --m; n } else { n if (m + k == 0) n ++ans; n else { n if (k) n --k; n else n --m; n } n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 300005; n const int MAXINT = 1073741823; n vector neighbors[MAXN]; n int a[MAXN]; n int greater_right[MAXN]; n int greater_left[MAXN]; n int less_right[MAXN]; n int less_left[MAXN]; n int dp[MAXN]; n stack s; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int n; n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) { n while (!s.empty() && a[s.top()] < a[i]) s.pop(); n greater_left[i] = (s.empty() ? -1 : s.top()); n s.push(i); n } n stack().swap(s); n for (int i = 0; i < n; i++) { n while (!s.empty() && a[s.top()] > a[i]) s.pop(); n less_left[i] = (s.empty() ? -1 : s.top()); n s.push(i); n } n stack().swap(s); n for (int i = n - 1; i >= 0; i--) { n while (!s.empty() && a[s.top()] < a[i]) s.pop(); n greater_right[i] = (s.empty() ? -1 : s.top()); n s.push(i); n } n stack().swap(s); n for (int i = n - 1; i >= 0; i--) { n while (!s.empty() && a[s.top()] > a[i]) s.pop(); n less_right[i] = (s.empty() ? -1 : s.top()); n s.push(i); n } n for (int i = 0; i < n; i++) { n if (greater_left[i] != -1) neighbors[greater_left[i]].push_back(i); n if (greater_right[i] != -1) neighbors[i].push_back(greater_right[i]); n if (less_left[i] != -1) neighbors[less_left[i]].push_back(i); n if (less_right[i] != -1) neighbors[i].push_back(less_right[i]); n } n fill(dp, dp + n, MAXINT); n dp[0] = 0; n for (int i = 0; i < n; i++) n for (int j : neighbors[i]) dp[j] = min(dp[j], dp[i] + 1); n cout << dp[n - 1]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void __f(const char* name, Arg1&& arg1) { n cerr << name << : << arg1 << std::endl; n } n template n void __f(const char* names, Arg1&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n cerr.write(names, comma - names) << : << arg1 << | ; n __f(comma + 1, args...); n } n const int N = 2e5 + 5; n int n; n vector adj[N]; n int root; n int degree[N], removed[N], level[N]; n void dfs(int u, int p) { n for (auto v : adj[u]) { n if (v == p) continue; n level[v] = level[u] + 1; n dfs(v, u); n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ; n cin >> n; n for (int i = 1; i <= n; i++) { n int x; n cin >> x; n if (x == 0) { n root = i; n continue; n } n adj[x].push_back(i); n adj[i].push_back(x); n degree[i]++, degree[x]++; n } n if (n % 2 == 0) { n cout << NO n ; n return 0; n } n dfs(root, 0); n set > s; n for (int i = 1; i <= n; i++) { n if (degree[i] % 2 == 0) s.insert({level[i], i}); n } n vector ans; n while (!s.empty()) { n auto top = *s.rbegin(); n s.erase(prev(s.end())); n int node = top.second; n for (auto v : adj[node]) { n if (removed[v]) continue; n degree[v]--; n if (degree[v] % 2 == 1) { n s.erase(s.find({level[v], v})); n } else { n s.insert({level[v], v}); n } n } n ans.push_back(node); n removed[node] = 1; n } n if (ans.size() == n) { n cout << YES n ; n for (auto i : ans) cout << i << n ; n } else n cout << NO n ; n return 0; n } n "} +{"func_code_string": "#include n using ll = long long; n using ld = long double; n using ull = unsigned long long; n using namespace std; n const int N = 2e5 + 2, mod = 998244353; n int n, m, d[N][20]; n pair dist[N][2]; n vector g[2][N]; n struct State { n int d, ver, B; n bool operator<(const State& oth) const { return d > oth.d; } n }; n struct State1 { n int B, A, ver; n bool operator<(const State1& oth) const { n return B > oth.B || (B == oth.B && A > oth.A); n } n }; n void solve1() { n priority_queue pq; n for (int i = (1); i <= (n); ++i) dist[i][0] = dist[i][1] = {1e9, 1e9}; n dist[1][0] = {0, 0}; n pq.push({0, 0, 1}); n while (!pq.empty()) { n State1 cur = pq.top(); n pq.pop(); n int side = cur.B & 1; n if (pair(cur.B, cur.A) != dist[cur.ver][side]) continue; n for (int v : g[side][cur.ver]) n if (dist[v][side].first > cur.B || n (dist[v][side].first == cur.B && dist[v][side].second > cur.A + 1)) { n dist[v][side] = {cur.B, cur.A + 1}; n pq.push({cur.B, cur.A + 1, v}); n } n if (dist[cur.ver][side ^ 1].first > cur.B + 1 || n (dist[cur.ver][side ^ 1].first == cur.B + 1 && n dist[cur.ver][side ^ 1].second > cur.A)) { n dist[cur.ver][side ^ 1] = {cur.B + 1, cur.A}; n pq.push({cur.B + 1, cur.A, cur.ver}); n } n } n pair ans = dist[n][0]; n if (dist[n][1].first < ans.first || n (dist[n][1].first == ans.first && dist[n][1].second < ans.second)) n ans = dist[n][1]; n assert(ans.first != 1e9 && ans.second != 1e9); n int res = 1; n for (int i = (1); i <= (ans.first); ++i) res = res * 2LL % mod; n cout << (res + ans.second - 1) % mod; n } n void solve() { n int LG = 32 - __builtin_clz(m); n assert(LG <= 19); n priority_queue pq; n pq.push({0, 1, 0}); n for (int i = (1); i <= (n); ++i) n for (int j = (0); j <= (19); ++j) d[i][j] = 1e9; n d[1][0] = 0; n while (!pq.empty()) { n State cur = pq.top(); n pq.pop(); n if (cur.d != d[cur.ver][cur.B]) continue; n for (int v : g[cur.B & 1][cur.ver]) n if (d[v][cur.B] > cur.d + 1) { n d[v][cur.B] = cur.d + 1; n pq.push({d[v][cur.B], v, cur.B}); n } n if (cur.B < LG) { n if (d[cur.ver][cur.B + 1] > cur.d + (1 << cur.B)) { n d[cur.ver][cur.B + 1] = cur.d + (1 << cur.B); n pq.push({d[cur.ver][cur.B + 1], cur.ver, cur.B + 1}); n } n } n } n int ans = 1e9; n for (int i = (0); i <= (LG); ++i) n if (ans > d[n][i]) ans = d[n][i]; n if (ans == 1e9) n solve1(); n else n cout << ans; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cin >> n >> m; n for (int i = (1); i <= (m); ++i) { n int u, v; n cin >> u >> v; n g[0][u].emplace_back(v); n g[1][v].emplace_back(u); n } n solve(); n return 0; n } n "} +{"func_code_string": "#include n #include n #include n #include n n using ll = long long; n const int maxn = 5007; n ll t, n, S[maxn], ans[maxn]; n ll res; n n int main(int argc, char *argv[]) { n std::ios::sync_with_stdio(false); n std::cin.tie(0); n std::cin >> t; n while (t--) { n res = 0; n std::cin >> n; n for (ll i = 0; i < n; i++) { n std::cin >> S[i]; n ans[i] = 0; n } n for (ll i = 0; i < n; i++) { n ll temp = ans[i]; n if (temp < S[i]-1){ n res += S[i] - 1 - temp; n temp += S[i] - 1 - temp; n } n ans[i+1] += temp - S[i] + 1; n if (i+2 < n) { n for (int j = i+2; j < std::min(n,i+S[i]+1); j++) { n ans[j]++; n } n } n } n std::cout << res << n ; n } n }"} +{"func_code_string": "#include n using namespace std; n int n, k, pos; n long long a[200005], sum[200005], ans; n vector vec; n int main() { n cin.tie(0), ios::sync_with_stdio(0); n cin >> n >> k; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n sum[i] = a[i]; n sum[i] += sum[i - 1]; n if (a[i] > 1) vec.push_back(i); n } n a[n + 1] = 1; n vec.push_back(n + 1); n for (int i = 1; i <= n; i++) { n pos = i; n long long tich = a[i]; n while (1) { n int it = lower_bound(vec.begin(), vec.end(), pos + 1) - vec.begin(); n int l = pos, r = vec[it] - 1, mid; n if (tich % k == 0) { n long long val = tich / k; n while (l < r) { n mid = (l + r) / 2; n if (sum[mid] - sum[i - 1] >= val) n r = mid; n else n l = mid + 1; n } n if (l >= pos && sum[l] - sum[i - 1] == val) { n ans++; n } n } n long long amount = LLONG_MAX / a[vec[it]]; n if (tich >= amount) break; n tich *= a[vec[it]]; n pos = vec[it]; n if (pos == n + 1) break; n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int a[300000]; n int ans[300000]; n map m; n int gcd(int a, int b) { n if (b == 0) n return a; n else n return gcd(b, a % b); n } n int main() { n int n; n scanf( %d , &n); n for (int i = 0; i < n * n; i++) { n scanf( %d , &a[i]); n m[a[i]]++; n } n sort(a, a + n * n); n int k = 0; n for (int i = n * n - 1; i >= 0; i--) { n if (m[a[i]] > 0) { n ans[k++] = a[i]; n for (int j = 0; j < k; j++) { n m[gcd(a[i], ans[j])] -= 2; n } n } n } n for (int i = 0; i < k - 1; i++) { n printf( %d , ans[i]); n } n printf( %d , ans[k - 1]); n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector> v1; n int main() { n long long int n, i, A[300005], minn, t1, a1, i1; n cin >> n; n for (i = 1; i <= n; i++) { n cin >> A[i]; n v1.push_back(make_pair(A[i], i)); n } n minn = 10000000000; n for (i = 2; i <= n; i++) { n t1 = min(A[1], A[i]) / (i - 1); n if (t1 < minn) minn = t1; n } n for (i = n - 1; i >= 1; i--) { n t1 = min(A[n], A[i]) / (n - i); n if (t1 < minn) minn = t1; n } n sort(v1.begin(), v1.end()); n a1 = v1[0].first; n i1 = v1[0].second; n for (i = 1; i < v1.size(); i++) { n t1 = min(a1, v1[i].first) / (abs(i1 - v1[i].second)); n if (t1 < minn) minn = t1; n } n cout << minn << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 2e5 + 10; n const long long oo = 1e18; n char s[maxN]; n long long cost[maxN][2]; n int main() { n int test; n scanf( %d , &test); n while (test--) { n int n, a, b; n scanf( %d%d%d%*c , &n, &a, &b); n gets(s); n cost[0][0] = b; n cost[0][1] = oo; n for (int i = 0; i < n; i++) { n if (s[i] == 0 ) { n cost[i + 1][0] = min(cost[i][0] + a + b, cost[i][1] + a * 2 + b); n cost[i + 1][1] = min(cost[i][0] + 2 * (a + b), cost[i][1] + a + b * 2); n } else { n cost[i + 1][1] = cost[i][1] + a + b * 2; n cost[i + 1][0] = oo; n } n } n printf( %lld n , cost[n][0]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[100001], g[100001], h[100001], m; n set events[100001]; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) events[i].clear(); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]), events[a[i]].insert(i); n m = 0; n bool ok = true; n for (int i = 1; i <= n; ++i) n if (!events[i].empty()) n if (events[i].find(i) == events[i].end()) { n ok = false; n break; n } n if (!ok) { n printf( -1 n ); n return 0; n } n for (int i = 1; i <= n; i++) n if (!events[i].empty()) { n h[++m] = i; n for (set::iterator itr = events[i].begin(); itr != events[i].end(); n ++itr) n g[*itr] = m; n } n printf( %d n , m); n for (int i = 1; i <= n; i++) printf( %d , g[i]); n printf( n ); n for (int i = 1; i <= m; i++) printf( %d , h[i]); n printf( n ); n } n "} +{"func_code_string": "#include n using namespace std; n long long a,b,c,d,e,i,j,ii,jj,zx,xc,tes,t,f[200009],A[200009],B[200009],rg[200009][20],rgx[200009][20],lf[200009][20],lfx[200009][20],P[200009],pas; n stack st; n set s; n set ::iterator it,lft,rgt; n long long uprg(long long q, long long w){ n if(q>=w) return 0; n long long jm=0; n long long h=0; n for(h=18; h>=0; h--){ n if(rg[q][h]!=0&&rg[q][h]=0; h--){ n if(lf[w][h]!=0&&lf[w][h]>q){ n jm+=lfx[w][h]; n w=lf[w][h]; n } n } n jm+=lfx[w][0]; n return jm; n } n long long fun(long long q, long long w){ n if(q>=w) return 0; n long long jm=0; n long long h=0; n for(h=18; h>=0; h--){ n if(rg[q][h]!=0&&rg[q][h]<=w){ n jm+=rgx[q][h]; n q=rg[q][h]; n } n } n if(q==w) return jm; n jm+=uplf(q,w); n return jm; n } n int main(){ n ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0); n cin>>a>>tes; n for(i=1; i<=a; i++) cin>>f[i]; n for(i=1; i<=a; i++) cin>>A[i]; n for(i=1; i<=a; i++) cin>>B[i]; n while(st.size()) st.pop(); n st.push(a+1); n f[a+1]=a+2; n for(i=a; i>=1; i--){ n while(st.size()>0&&f[st.top()]0&&f[st.top()]>c; n if(c==1){ n cout< n using namespace std; n int solve(int n, int m, int k) { n if (n > m) return 0; n if (n == 0) return min(m + 1, (1 << (k + 1))); n if ((1 << k) & n) { n int c = solve(n - (1 << k), m - (1 << k), k - 1); n if (c == (1 << k)) n return (1 << (k + 1)); n else n return c; n } else { n int z = solve(n, m - (1 << k), k - 1); n if (z == (1 << k)) n return 2 * z; n else { n int c = solve(n, m, k - 1); n if (c == (1 << k)) n return (1 << k) + z; n else n return c; n } n } n } n void solve() { n int n, m; n cin >> n >> m; n cout << solve(n, m, 29) << n ; n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int t; n cin >> t; n while (t--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n bool f = 0; n const double eps = 1e-8; n int n; n struct point { n double x, y; n } p[100010]; n inline int rd() { n int x = 0; n bool f = 0; n char c = getchar(); n while (!isdigit(c)) { n if (c == - ) f = 1; n c = getchar(); n } n while (isdigit(c)) { n x = (x << 1) + (x << 3) + (c ^ 48); n c = getchar(); n } n return f ? -x : x; n } n inline bool valid(double x) { n double l = -(double)1e18, r = (double)1e18, dlt; n for (register int i = 1; i <= n; ++i) { n if (p[i].y > x + x) return 0; n dlt = sqrt(p[i].y * (2 * x - p[i].y)); n l = max(l, p[i].x - dlt); n r = min(r, p[i].x + dlt); n } n return (r - l + eps >= 0.0); n } n int main() { n n = rd(); n for (register int i = 1; i <= n; ++i) { n p[i].x = (double)rd(); n p[i].y = (double)rd(); n if (p[i].y < 0.0) f = 1; n } n if (f == 1) n for (register int i = 1; i <= n; ++i) { n p[i].y = -p[i].y; n if (p[i].y < 0.0) { n puts( -1 ); n return 0; n } n } n int t = 0; n register double l = 0.0, r = (double)1e18, mid; n while (t <= 300) { n mid = (l + r) / 2.0; n ++t; n valid(mid) ? r = mid : l = mid; n } n printf( %.10lf , l); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const long long inf = 2e9 + 10; n template n static void relax(T1 &x, T2 y) { n if (x > y) x = y; n } n template n static void gain(T1 &x, T2 y) { n if (x < y) x = y; n } n long long powmod(long long a, long long b) { n long long res = 1; n while (b) { n if (b & 1) res = (res * a) % mod; n a = (a * a) % mod; n b >>= 1; n } n return res; n } n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n inline void add(int &x, int y) { n x += y; n if (x >= mod) x -= mod; n } n inline void sub(int &x, int y) { n x -= y; n if (x < 0) x += mod; n } n const int maxl = 2e3 + 3; n int m, d; n string a, b; n int dp[maxl][maxl][2]; n int solve(string s) { n int n = (int)s.length(); n for (int(i) = 0; (i) < (int)(n + 1); ++(i)) n for (int(j) = 0; (j) < (int)(m); ++(j)) n for (int(k) = 0; (k) < (int)(2); ++(k)) dp[i][j][k] = 0; n dp[0][0][1] = 1; n for (int(i) = 0; (i) < (int)(n); ++(i)) n for (int(j) = 0; (j) < (int)(m); ++(j)) n for (int(k) = 0; (k) < (int)(2); ++(k)) n for (int dgt = 0; dgt <= (k ? int(s[i] - 0 ) : 9); ++dgt) { n if ((i & 1) && dgt != d) continue; n if (!(i & 1) && dgt == d) continue; n int ni = i + 1; n int nj = ((j * 10 + dgt) % m); n int nk = k && (dgt == int(s[i] - 0 )); n add(dp[ni][nj][nk], dp[i][j][k]); n } n int ans = 0; n for (int(k) = 0; (k) < (int)(2); ++(k)) add(ans, dp[n][0][k]); n return ans; n } n bool ok(string s) { n int n = (int)s.length(); n int rem = 0; n for (int(i) = 0; (i) < (int)(n); ++(i)) { n int dgt = int(s[i] - 0 ); n if ((i & 1) && dgt != d) return false; n if (!(i & 1) && dgt == d) return false; n rem = (rem * 10 + dgt) % m; n } n return !rem; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cin >> m >> d; n cin >> a; n cin >> b; n int ans = 0; n add(ans, solve(b)); n sub(ans, solve(a)); n add(ans, ok(a)); n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[200010]; n int main() { n cin.tie(0); n ios_base::sync_with_stdio(false); n int n; n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n int f = 0; n for (int i = 1; i < n; i++) n if (a[i] != a[i - 1]) { n f = 1; n break; n } n if (f == 0) { n if (a[0] == 0) { n cout << YES << endl; n for (int i = 0; i < n; i++) cout << 1 << ; n exit(0); n } n cout << NO << endl; n exit(0); n } n long long mx = 0, mxer = 0; n for (int i = 0; i < n; i++) n if (a[i] > mx) mx = a[mxer = i]; n while (true) { n int x = mxer - 1; n if (x < 0) x += n; n if (a[x] == a[mxer]) n mxer = x; n else n break; n } n int flag = 1; n for (int i = 1; i < n; i++) { n int x = mxer - 1; n if (x < 0) x += n; n if (flag && a[x] == 0) { n a[x] += a[mxer]; n flag = 0; n } n a[x] += a[mxer]; n mxer = x; n } n cout << YES << endl; n for (int i = 0; i < n; i++) cout << a[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int(a), int(b)) { return ((a) % (b) ? gcd((b), (a) % (b)) : (b)); } n long long lgcd(long long(a), long long(b)) { n return ((a) % (b) ? gcd((b), (a) % (b)) : (b)); n } n int lcm(int a, int b) { return (a) / gcd((a), (b)) * b; } n long long llcm(long long a, long long b) { return (a) / lgcd((a), (b)) * b; } n int n, m, ans[100010], crime[100010], notcrime[100010]; n int main() { n memset(ans, 0, sizeof(ans)); n memset(crime, 0, sizeof(crime)); n memset(notcrime, 0, sizeof(notcrime)); n scanf( %d%d , &n, &m); n getchar(); n for (int i = 1; i <= n; i++) { n char c; n int temp; n scanf( %c%d , &c, &temp); n getchar(); n if (c == + ) { n crime[temp]++; n ans[i] = temp; n } else { n notcrime[temp]++; n ans[i] = -temp; n } n } n int nnc = 0; n for (int i = 1; i <= n; i++) nnc += notcrime[i]; n int nc = 0; n bool cc[100010]; n memset(cc, false, sizeof(cc)); n for (int i = 1; i <= n; i++) { n if (crime[i] + nnc - notcrime[i] == m) { n cc[i] = true; n nc++; n } n } n for (int i = 1; i <= n; i++) { n if (ans[i] > 0) { n if (cc[((ans[i]) > 0 ? (ans[i]) : -(ans[i]))]) { n if (nc > 1) n printf( Not defined n ); n else n printf( Truth n ); n } else n printf( Lie n ); n } else { n if (cc[((ans[i]) > 0 ? (ans[i]) : -(ans[i]))]) { n if (nc == 1) n printf( Lie n ); n else n printf( Not defined n ); n } else n printf( Truth n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int dx[] = {-1, 0, 1, 0}; n const int dy[] = {0, -1, 0, 1}; n const int dx8[] = {-1, 0, 1, 0, 1, 1, -1, -1}; n const int dy8[] = {0, -1, 0, 1, 1, -1, 1, -1}; n void solve() { n long long n; n cin >> n; n vector a(n); n vector> dp(n, vector(n)); n vector> sum(n, vector(n)); n for (long long i = 0; i < n; i++) cin >> a[i]; n sort(a.begin(), a.end()); n vector s(n), l(n); n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < n; j++) { n if (a[i] >= 2 * a[j]) { n l[i] = j; n s[i]++; n } n } n } n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < n; j++) { n if (j == 0) { n dp[i][j] = 1; n long long x = i - 1 >= 0 ? sum[i - 1][j] : 0; n sum[i][j] = x + dp[i][j]; n sum[i][j] %= 998244353; n continue; n } n if (s[i] - j + 1 > 0) { n dp[i][j] = n (dp[i][j - 1] * (s[i] - j + 1)) % 998244353 + sum[l[i]][j - 1]; n dp[i][j] %= 998244353; n } else n dp[i][j] = 0; n long long x = i - 1 >= 0 ? sum[i - 1][j] : 0; n sum[i][j] = x + dp[i][j]; n sum[i][j] %= 998244353; n } n } n cout << dp[n - 1][n - 1] << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n template n struct link_cut_tree { n bool connected(node* u, node* v) { return lca(u, v) != NULL; } n int depth(node* u) { n access(u); n return get_sz(u->ch[0]); n } n node* get_root(node* u) { n access(u); n while (u->ch[0]) u = u->ch[0], u->push(); n return access(u), u; n } n node* ancestor(node* u, int k) { n k = depth(u) - k; n assert(k >= 0); n for (;; u->push()) { n int sz = get_sz(u->ch[0]); n if (sz == k) return access(u), u; n if (sz < k) n k -= sz + 1, u = u->ch[1]; n else n u = u->ch[0]; n } n assert(0); n } n node* lca(node* u, node* v) { n if (u == v) return u; n access(u); n access(v); n if (!u->p) return NULL; n u->splay(); n return u->p ?: u; n } n void link(node* u, node* v) { n make_root(v); n access(u); n set_link(v, u, 0); n v->update(); n } n void cut(node* u) { n access(u); n u->ch[0]->p = NULL; n u->ch[0] = NULL; n u->update(); n } n void cut(node* u, node* v) { cut(depth(u) > depth(v) ? u : v); } n void make_root(node* u) { n access(u); n u->reverse(); n access(u); n assert(!u->ch[0] && !u->ch[1]); n } n void access(node* u) { n for (node *v = u, *pre = NULL; v; v = v->p) { n v->splay(); n if (pre) v->update_vsub(pre, false); n if (v->ch[1]) v->update_vsub(v->ch[1], true); n v->ch[1] = pre; n v->update(); n pre = v; n } n u->splay(); n assert(!u->ch[1]); n } n node* operator[](int i) { return &data[i]; } n int operator[](node* i) { return i - &data[0]; } n vector data; n link_cut_tree(int n) : data(n) {} n }; n template n struct splay_tree { n pnode ch[2], p; n splay_tree() { ch[0] = ch[1] = p = NULL; } n int dir() { n if (!p) return -2; n if (p->ch[0] == this) return 0; n if (p->ch[1] == this) return 1; n return -1; n } n bool is_root() { return dir() < 0; } n friend void set_link(pnode u, pnode v, int d) { n if (v) v->p = u; n if (d >= 0) u->ch[d] = v; n } n void rotate() { n assert(!is_root()); n int x = dir(); n pnode g = p; n set_link(g->p, static_cast(this), g->dir()); n set_link(g, ch[x ^ 1], x); n set_link(static_cast(this), g, x ^ 1); n g->update(); n } n void splay() { n const pnode& self = static_cast(this); n while (!is_root() && !p->is_root()) { n p->p->push(), p->push(), self->push(); n dir() == p->dir() ? p->rotate() : self->rotate(); n self->rotate(); n } n if (!is_root()) p->push(), self->push(), self->rotate(); n self->push(); n self->update(); n } n }; n template n struct splay_tree_lct : splay_tree { n splay_tree_vchs vnode; n using splay_tree::ch; n bool rev; n splay_tree_vchs* root; n splay_tree_lct() : splay_tree() { n root = NULL; n rev = 0; n } n void update() {} n void push() { n if (rev) { n if (ch[0]) ch[0]->reverse(); n if (ch[1]) ch[1]->reverse(); n rev = 0; n } n } n void rotate() { n swap(vnode, this->p->vnode); n splay_tree::rotate(); n } n void splay() { n auto v = &vnode; n bool r = !v->key; n splay_tree::splay(); n if (r && v->key) { n if (v->p) v->p->ch[v->p->ch[1] == &v->key->vnode] = v; n if (v->ch[0]) v->ch[0]->p = v; n if (v->ch[1]) v->ch[1]->p = v; n v->key = static_cast(this); n } n } n void reverse() { n rev ^= 1; n swap(ch[0], ch[1]); n } n void update_vsub(pnode v, bool add) { n auto& u = root; n if (add) { n v->vnode = splay_tree_vchs(v); n if (!u) { n u = &v->vnode; n return; n } n while (u->ch[1]) u = u->ch[1]; n u->ch[1] = &v->vnode; n u->ch[1]->p = u; n u = u->ch[1]; n u->splay(); n } else { n auto x = &v->vnode; n x->splay(); n if (!x->ch[0]) { n u = x->ch[1]; n } else if (!x->ch[1]) { n u = x->ch[0]; n } else { n u = x->ch[0]; n u->p = NULL; n while (u->ch[1]) u = u->ch[1]; n u->ch[1] = x->ch[1]; n x->ch[1]->p = u; n u->splay(); n } n if (u) u->p = NULL; n x->key = NULL; n } n } n }; n const int inf = -1e8; n template n struct splay_tree_vchs : splay_tree*> { n using splay_tree*>::ch; n pnode key; n int x; n array y; n splay_tree_vchs(){}; n splay_tree_vchs(const pnode& key) n : splay_tree*>(), key(key) { n build(); n } n void build() { n x = key->x; n y[0] = key->pp[0]; n y[1] = 0; n y[2] = key->pp[1]; n y[3] = inf; n } n void update() { n build(); n for (int c = 0; c < 2; ++c) n if (ch[c]) { n x = max(x, ch[c]->x); n for (int i = 0; i < 4; i += 2) { n if (ch[c]->y[i] > y[i]) { n y[i + 1] = y[i]; n y[i] = ch[c]->y[i]; n if (ch[c]->y[i + 1] > y[i + 1]) y[i + 1] = ch[c]->y[i + 1]; n } else if (ch[c]->y[i] > y[i + 1]) n y[i + 1] = ch[c]->y[i]; n } n } n } n void push() {} n }; n const array ainf = {0, inf, 0, inf}; n struct node : splay_tree_lct> { n bool val, len, sval; n int slen; n int x; n array pp; n node() : splay_tree_lct() { n val = len = sval = 0; n slen = x = 0; n pp = ainf; n } n void update() { n splay_tree_lct::update(); n x = 0; n sval = val; n slen = len; n array up = ainf, dw = ainf; n array v1 = {0, inf}, v2 = v1; n bool upsval = val; n int upslen = len; n bool dwsval = val; n int dwslen = len; n if (ch[0]) { n x = max(x, ch[0]->x); n up = ch[0]->pp; n sval ^= ch[0]->sval; n slen += ch[0]->slen; n upsval ^= ch[0]->sval; n upslen += ch[0]->slen; n } n if (ch[1]) { n x = max(x, ch[1]->x); n dw = ch[1]->pp; n sval ^= ch[1]->sval; n slen += ch[1]->slen; n dwsval ^= ch[1]->sval; n dwslen += ch[1]->slen; n } n if (root) { n x = max(x, root->x); n v1[0] = root->y[0]; n v1[1] = root->y[2]; n v2[0] = root->y[1]; n v2[1] = root->y[3]; n } n pp[0] = up[0], pp[1] = up[1]; n pp[2] = dw[2], pp[3] = dw[3]; n for (int i = 0; i < 2; ++i) { n x = max(x, len + max({up[2 + i] + dw[i ^ val], up[2 + i] + v1[i ^ val], n dw[i] + v1[i ^ val], v1[i] + v2[i ^ val]})); n pp[i ^ upsval] = max(pp[i ^ upsval], upslen + max(dw[i], v1[i])); n pp[2 + (i ^ dwsval)] = n max(pp[2 + (i ^ dwsval)], dwslen + max(up[2 + i], v1[i])); n } n } n void push() { splay_tree_lct::push(); } n void reverse() { n splay_tree_lct::reverse(); n swap(pp[0], pp[2]); n swap(pp[1], pp[3]); n } n }; n int main() { n ios_base::sync_with_stdio(0), cin.tie(0); n int n; n cin >> n; n link_cut_tree lct(2 * n); n vector>> adj(n); n for (int i = 1, u, v, w; i < n; ++i) { n cin >> u >> v >> w; n --u, --v; n adj[u].push_back({v, w, i}); n adj[v].push_back({u, w, i}); n } n function dfs = [&](int u, int p) { n for (auto [v, w, i] : adj[u]) n if (v != p) { n dfs(v, u); n lct[n + i]->val = w; n lct[n + i]->len = true; n lct[n + i]->update(); n lct.link(lct[u], lct[n + i]); n lct.link(lct[n + i], lct[v]); n } n }; n dfs(0, -1); n int q; n cin >> q; n for (int i = 0, u; i < q; ++i) { n cin >> u; n lct.access(lct[n + u]); n lct[n + u]->val ^= 1; n lct[n + u]->update(); n cout << lct[n + u]->x << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map > m; n long long int lol(long long int a, long long int r) { n if (a >= 0 && r <= 0) return a; n if (a <= 0 && r >= 0) return a; n return a % r; n } n int main() { n long long int a, b; n cin >> a >> b; n string s; n cin >> s; n long x = 0; n long y = 0; n if (a == 0 && b == 0) { n cout << Yes << endl; n return 0; n } n for (long i = 0; i < s.size(); i++) { n if (s[i] == L ) x--; n if (s[i] == R ) x++; n if (s[i] == U ) y++; n if (s[i] == D ) y--; n } n long p = 2; n long w = 0; n long q = 0; n int d = 0; n for (long i = 0; i < s.size(); i++) { n if (s[i] == L ) w--; n if (s[i] == R ) w++; n if (s[i] == U ) q++; n if (s[i] == D ) q--; n long long int u = a - w; n long long int e = b - q; n if (x != 0) { n if (y != 0) { n long long int v = u / x; n long long int z = e / y; n if (v == z && v >= 0 && u % x == 0 && e % y == 0) d = 1; n } else { n long long int v = a / x; n if (e == 0 && v >= 0 && u % x == 0) d = 1; n } n } else { n if (y != 0) { n long long int z = e / y; n if (z >= 0 && u == 0 && e % y == 0) d = 1; n } else { n if (u == 0 && e == 0) d = 1; n } n } n } n if (d == 1) n cout << Yes << endl; n else n cout << No << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int V = 100100; n int l[V], r[V], a[V], ret, n; n int main() { n while (~scanf( %d , &n)) { n ret = 0; n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1; i <= n; i++) l[i] = r[i] = i; n for (int i = 1; i <= n; i++) { n while (l[i] != 1 && a[l[i] - 1] < a[i]) l[i] = l[l[i] - 1]; n if (l[i] != 1) ret = max(ret, a[i] ^ a[l[i] - 1]); n } n for (int i = n; i >= 1; i--) { n while (r[i] != n && a[r[i] + 1] < a[i]) r[i] = r[r[i] + 1]; n if (r[i] != n) ret = max(ret, a[i] ^ a[r[i] + 1]); n } n printf( %d n , ret); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 17; n int n; n vector adj[(1 << MAX_N) + 9]; n bool used[(1 << MAX_N) + 9]; n int cnt[(1 << MAX_N) + 9]; n vector vRoot; n vector ans; n void buildCnt(int x) { n used[x] = true; n cnt[x] = 1; n for (int y : adj[x]) { n if (!used[y]) { n buildCnt(y); n cnt[x] += cnt[y]; n } n } n used[x] = false; n } n void findRoot(int x, vector& vRoot) { n used[x] = true; n for (int y : adj[x]) { n if (!used[y]) { n findRoot(y, vRoot); n } n } n if ((1 << n) - 2 - cnt[x] == (1 << n - 1) - 1) { n vRoot.push_back(x); n } else { n for (int y : adj[x]) { n if (!used[y]) { n if (cnt[y] == (1 << n - 1) - 1) { n vRoot.push_back(x); n break; n } n } n } n } n used[x] = false; n } n bool checkTree1(int x, int depth) { n used[x] = true; n bool result = false; n if (cnt[x] != (1 << depth) - 1) { n result = false; n } else if (depth == 1) { n result = true; n } else { n result = true; n for (int y : adj[x]) { n if (!used[y]) { n if (!checkTree1(y, depth - 1)) { n result = false; n break; n } n } n } n } n used[x] = false; n return result; n } n int checkTree2(int x, int depth) { n used[x] = true; n int result = -1; n if (cnt[x] != (1 << depth) - 2) { n result = -1; n } else if (depth == 2) { n result = x; n } else { n vector> children; n for (int y : adj[x]) { n if (!used[y]) { n children.push_back(make_pair(cnt[y], y)); n } n } n sort(children.begin(), children.end()); n if (children.size() == 2) { n int tmp = checkTree2(children[0].second, depth - 1); n if (tmp != -1 && checkTree1(children[1].second, depth - 1)) { n result = tmp; n } else { n result = -1; n } n } else if (children.size() == 3) { n if (checkTree1(children[0].second, depth - 2) && n checkTree1(children[1].second, depth - 2) && n checkTree1(children[2].second, depth - 1)) { n result = x; n } else { n result = -1; n } n } else { n result = -1; n } n } n used[x] = false; n return result; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n; n for (int i = 1; i <= (1 << n) - 3; i++) { n int x; n int y; n cin >> x >> y; n adj[x].push_back(y); n adj[y].push_back(x); n } n buildCnt(1); n findRoot(1, vRoot); n for (int root : vRoot) { n buildCnt(root); n int x = checkTree2(root, n); n if (x != -1) { n ans.push_back(x); n } n } n sort(ans.begin(), ans.end()); n cout << ans.size() << n ; n for (int x : ans) { n cout << x << ; n } n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, maxx, idx, max1, s; n int main(int argc, char *argv[]) { n pair a[10000]; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i].first; n a[i].second = 0; n } n maxx = 0; n max1 = 0; n for (int i = 0; i < n; i++) { n if (a[i].first > maxx) { n max1 = maxx; n maxx = a[i].first; n idx = i; n } else if (max1 < a[i].first) n max1 = a[i].first; n } n cout << idx + 1 << << max1 << endl; n return EXIT_SUCCESS; n } n "} +{"func_code_string": "#include n using namespace std; n long long z, mn, mx, sum, ans, k, pos, pos1, r, xx, yy, zz, n, m, x, y; n vector v; n bool OK[1000002], KO[1000002], zoom; n int b[100003], c[100002]; n map mp, mr; n set st; n int main() { n cin >> n; n for (int i = 0; i < n; ++i) { n cin >> x >> y >> k; n cout << ((k + 1) / 2 * x) - (k / 2 * y) << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main(void) { n long long int n = 0ll, k = 0ll, p = 0ll, pn = 0ll, even = 0ll, odd = 0ll; n while (cin >> n) { n cin >> k >> p; n if (k == 0) { n for (long long int i = 0; i < p; i++) { n cin >> pn; n cout << . ; n } n cout << endl; n } else { n if (n % 2 == 0) { n if (k >= (n >> 1)) { n even = 2; n k -= (n >> 1); n odd = n + 1 - (k << 1); n } else { n odd = n + 1; n even = n + 2 - (k << 1); n } n for (int i = 0; i < p; i++) { n cin >> pn; n if (pn % 2 == 0) { n if (pn >= even) { n cout << X ; n } else { n cout << . ; n } n } else { n if (pn >= odd) { n cout << X ; n } else { n cout << . ; n } n } n } n cout << endl; n } else { n n--; n k--; n if (k >= (n >> 1)) { n even = 2; n k -= (n >> 1); n odd = n + 1 - (k << 1); n } else { n odd = n + 1; n even = n + 2 - (k << 1); n } n for (int i = 0; i < p; i++) { n cin >> pn; n if (pn == n + 1) { n cout << X ; n } else if (pn % 2 == 0) { n if (pn >= even) { n cout << X ; n } else { n cout << . ; n } n } else { n if (pn >= odd) { n cout << X ; n } else { n cout << . ; n } n } n } n cout << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map mp; n int fin(int rem) { n for (auto p : mp) { n if (p.first >= rem) return p.first; n } n return -1; n } n int main() { n long long ans = 0, rem = 0, p, x, y, n, RES = 1e9; n cin >> n >> x >> y; n long long a[] = {x, x, x, x, y, y}; n sort(a, a + 6); n do { n mp.clear(); n ans = 0; n for (int i = 0; i < 6; ++i) { n if ((x = fin(a[i])) == -1) { n ++ans; n ++mp[n - a[i]]; n } else { n ++mp[x - a[i]]; n if (!--mp[x]) mp.erase(x); n } n } n RES = min(RES, ans); n } while (next_permutation(a, a + 6)); n cout << RES; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 2000005; n template n void read(T &x) { n x = 0; n int f = 1; n char c = getchar(); n for (; !isdigit(c); c = getchar()) n if (c == - ) f = -f; n for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; n x *= f; n } n template n void write(T x) { n if (x < 0) x = -x, putchar( - ); n if (x > 9) write(x / 10); n putchar(x % 10 + 0 ); n } n template n void writeln(T x) { n write(x); n puts( ); n } n int n, m1, m2, m, t; n int x1[MAXN], x2[MAXN]; n int mid1[MAXN], mid2[MAXN]; n int pos1[MAXN], pos2[MAXN]; n int dp[3][MAXN], path[3][MAXN], pos[MAXN]; n int main() { n read(n), read(m1), read(m2), read(t); n for (int i = 1; i <= m1; i++) read(x1[i]); n for (int i = 1; i <= m2; i++) read(x2[i]); n pos[++m] = 0; n int p1 = 1, p2 = 1; n while (p1 <= m1 || p2 <= m2) { n if (p1 > m1) n pos[++m] = x2[p2++] + 1; n else if (p2 > m2) n pos[++m] = x1[p1++] + 1; n else { n int Min = min(x1[p1], x2[p2]); n pos[++m] = Min + 1; n if (Min == x1[p1]) p1++; n if (Min == x2[p2]) p2++; n } n } n if (pos[m] != n + 1) pos[++m] = n + 1; n p1 = 1; n for (int i = 1; i <= m1; i++) { n while (x1[i] > pos[p1]) p1++; n if (pos[p1] > x1[i]) mid1[p1] = x1[i]; n pos1[p1] += x1[i] == pos[p1]; n } n p2 = 1; n for (int i = 1; i <= m2; i++) { n while (x2[i] > pos[p2]) p2++; n if (pos[p2] > x2[i]) mid2[p2] = x2[i]; n pos2[p2] += x2[i] == pos[p2]; n } n memset(dp, -1, sizeof(dp)); n dp[1][1] = 0; n for (int i = 1; i <= m - 1; i++) { n if (dp[1][i] != -1 && pos2[i] == 0) { n int tmp = min(dp[1][i], t); n if (tmp > dp[2][i]) { n dp[2][i] = tmp; n path[2][i] = 1; n } n } n if (dp[2][i] != -1 && pos1[i] == 0) { n int tmp = min(dp[2][i], t); n if (tmp > dp[1][i]) { n dp[1][i] = tmp; n path[1][i] = 1; n } n } n if (dp[1][i] != -1) { n int tmp = dp[1][i]; n if (pos1[i + 1] == 0 && mid1[i + 1] == 0) tmp += pos[i + 1] - pos[i]; n if (pos1[i + 1] == 0 && mid1[i + 1] != 0) { n tmp += mid1[i + 1] - pos[i] - 1; n if (tmp < t) n tmp = -1; n else n tmp -= t; n if (tmp != -1) tmp += pos[i + 1] - mid1[i + 1] + 1; n } n if (pos1[i + 1] != 0 && mid1[i + 1] == 0) { n tmp += pos[i + 1] - pos[i] - 1; n if (tmp < t) n tmp = -1; n else n tmp -= t; n if (tmp != -1) tmp += 1; n } n if (pos1[i + 1] != 0 && mid1[i + 1] != 0) { n tmp += mid1[i + 1] - pos[i] - 1; n if (tmp < t) n tmp = -1; n else n tmp -= t; n if (tmp != -1) tmp += pos[i + 1] - mid1[i + 1]; n if (tmp < t) n tmp = -1; n else n tmp -= t; n if (tmp != -1) tmp += 1; n } n dp[1][i + 1] = tmp; n } n if (dp[2][i] != -1) { n int tmp = dp[2][i]; n if (pos2[i + 1] == 0 && mid2[i + 1] == 0) tmp += pos[i + 1] - pos[i]; n if (pos2[i + 1] == 0 && mid2[i + 1] != 0) { n tmp += mid2[i + 1] - pos[i] - 1; n if (tmp < t) n tmp = -1; n else n tmp -= t; n if (tmp != -1) tmp += pos[i + 1] - mid2[i + 1] + 1; n } n if (pos2[i + 1] != 0 && mid2[i + 1] == 0) { n tmp += pos[i + 1] - pos[i] - 1; n if (tmp < t) n tmp = -1; n else n tmp -= t; n if (tmp != -1) tmp += 1; n } n if (pos2[i + 1] != 0 && mid2[i + 1] != 0) { n tmp += mid2[i + 1] - pos[i] - 1; n if (tmp < t) n tmp = -1; n else n tmp -= t; n if (tmp != -1) tmp += pos[i + 1] - mid2[i + 1]; n if (tmp < t) n tmp = -1; n else n tmp -= t; n if (tmp != -1) tmp += 1; n } n dp[2][i + 1] = tmp; n } n } n if (dp[1][m] == -1 && dp[2][m] == -1) { n printf( No n ); n return 0; n } n printf( Yes n ); n int px, py; n if (dp[1][m] == -1) n py = 2, px = m; n else n py = 1, px = m; n static int shifts[MAXN], cnts = 0; n static int x[MAXN], y[MAXN], cnt = 0; n int now = 0; n while (px != 1 || py != 1) { n if (path[py][px]) { n cnt += now; n int tx = pos[px] - dp[py][px]; n for (int i = 1; i <= now; i++) { n tx += t; n x[cnt - i + 1] = tx; n y[cnt - i + 1] = py; n } n py = 3 - py; n now = 0; n shifts[++cnts] = pos[px]; n } else { n if (py == 1) n now += mid1[px] != 0, now += pos1[px] != 0; n else n now += mid2[px] != 0, now += pos2[px] != 0; n px = px - 1; n } n } n cnt += now; n int tx = 0; n for (int i = 1; i <= now; i++) { n tx += t; n x[cnt - i + 1] = tx; n y[cnt - i + 1] = py; n } n writeln(cnts); n reverse(shifts + 1, shifts + cnts + 1); n for (int i = 1; i <= cnts; i++) printf( %d , shifts[i]); n printf( n ); n writeln(cnt); n reverse(x + 1, x + cnt + 1); n reverse(y + 1, y + cnt + 1); n for (int i = 1; i <= cnt; i++) printf( %d %d n , x[i], y[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int sum[100005]; n int main() { n int h1, h2, a, b, k, x; n cin >> h1 >> h2 >> a >> b; n int num = h1 + a * 8; n if (num >= h2) n x = 0; n else if (a <= b) n x = -1; n else { n x = 1; n num -= b * 12; n for (int i = 1;; i++) { n num += a * 12; n if (num >= h2) n break; n else { n x++; n num -= b * 12; n } n } n } n cout << x << endl; n return 0; n } n "} +{"func_code_string": "#include n const int N = 200010; n const long long INF = 1ll << 60; n const int inf = 0x3f3f3f3f; n class SegmentTree { n public: n SegmentTree() {} n void Init(int n, int v[]) { n n_ = n; n Build(1, n, 1, v); n } n void ChangeSingle(int l, int r, int rt, int id, int x) { n if (l == r) { n min_[rt] = std::pair(x, l); n return; n } n int m = (l + r) >> 1; n if (id <= m) { n ChangeSingle(l, m, rt << 1, id, x); n } else { n ChangeSingle(m + 1, r, rt << 1 | 1, id, x); n } n Up(rt); n } n std::pair MinInterval(int l, int r, int rt, int L, int R) { n if (L > R) { n return std::pair(inf, inf); n } n if (L <= l && r <= R) { n return min_[rt]; n } n int m = (l + r) >> 1; n std::pair ans(inf, inf); n if (L <= m) { n ans = std::min(ans, MinInterval(l, m, rt << 1, L, R)); n } n if (R > m) { n ans = std::min(ans, MinInterval(m + 1, r, rt << 1 | 1, L, R)); n } n return ans; n } n n private: n void Build(int l, int r, int rt, int v[]) { n if (l == r) { n min_[rt].first = v[l]; n min_[rt].second = l; n return; n } n int m = (l + r) >> 1; n Build(l, m, rt << 1, v); n Build(m + 1, r, rt << 1 | 1, v); n Up(rt); n } n void Up(int rt) { min_[rt] = std::min(min_[rt << 1], min_[rt << 1 | 1]); } n int n_; n std::pair min_[N << 2 | 1]; n } seg; n int t; n int n, m; n int a[N]; n int b[N]; n std::multiset se[N]; n int pre[N]; n int v[N]; n int main() { n scanf( %d , &t); n while (t--) { n scanf( %d , &n); n for (int i = 0; i < n; ++i) { n se[i].clear(); n pre[i] = 0; n } n for (int i = 1; i <= n; ++i) { n scanf( %d%d , &a[i], &b[i]); n se[a[i]].insert(b[i]); n } n if (n == 1) { n printf( 0 n ); n continue; n } n for (int i = 0; i < n; ++i) { n pre[i] = (i == 0 ? se[i].size() : pre[i - 1] + se[i].size()); n v[i] = (se[i].size() ? (*se[i].begin()) : inf); n } n seg.Init(n - 1, v); n int id_st = n - 1; n while (id_st >= 0 && pre[id_st] > id_st) { n --id_st; n } n int num = 0; n int num_last = 0; n int num2 = 0; n long long ans = 0ll; n while (num < n) { n int inc = 0; n for (int i = num_last; i <= num; ++i) { n if (se[i].size()) { n inc += se[i].size(); n se[i].clear(); n } n } n num_last = num + 1; n if (inc) { n num += inc; n continue; n } else { n while (id_st >= num + 1 && pre[id_st] + num2 > id_st) { n --id_st; n } n std::pair x = seg.MinInterval(1, n - 1, 1, id_st + 1, n - 1); n ans += x.first; n int id = x.second; n se[id].erase(se[id].begin()); n if (se[id].size()) { n seg.ChangeSingle(1, n - 1, 1, id, *se[id].begin()); n } else { n seg.ChangeSingle(1, n - 1, 1, id, inf); n } n ++num2; n ++num; n } n } n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n, k; n scanf( %d %d , &n, &k); n printf( %d n , 6 * n * k - k); n for (int i = 0; i < n; ++i) { n printf( %d %d %d %d n , 6 * i * k + k, 6 * i * k + 2 * k, 6 * i * k + 3 * k, n 6 * i * k + 5 * k); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long t, fact[405], inv[405], dp[405][405], ans[405], n, dp2[405]; n long long p; n long long exp(long long x, long long k) { n if (k == 0) return 1; n if (k % 2 == 1) return x * exp(x, k - 1) % p; n long long y = exp(x, k / 2); n return y * y % p; n } n int main() { n cin >> t >> p; n fact[0] = 1; n for (int i = 1; i < 405; ++i) { n fact[i] = i * fact[i - 1] % p; n inv[i] = exp(i, p - 2); n } n dp[0][0] = 1; n for (int i = 0; i <= 399; ++i) n for (int k = 1; k <= 400; ++k) n for (int j = 0; j <= 400 - k; ++j) n dp[j + k][i + 1] = (dp[j + k][i + 1] + fact[k] * dp[j][i]) % p; n dp2[1] = dp2[2] = 1; n for (int i = 3; i <= 400; ++i) { n dp2[i] = fact[i]; n for (int j = 1; j < i; ++j) n dp2[i] = (p + dp2[i] - dp2[j] * fact[i - j] % p) % p; n } n for (int i = 1; i <= 400; ++i) { n ans[i] = fact[i]; n for (int j = 3; j < i; ++j) ans[i] = (ans[i] + p - dp[i][j] * ans[j]) % p; n for (int j = 1; j <= i - 1; ++j) n ans[i] = (ans[i] + p - 2 * dp2[j] * fact[i - j] % p) % p; n ans[2] = 2; n } n for (int i = 0; i < t; ++i) { n int x; n cin >> x; n cout << ans[x] << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n struct Amulet { n char p[2][2]; n void Read() { cin >> p[0][0] >> p[0][1] >> p[1][0] >> p[1][1]; } n Amulet Rotate() const { n Amulet ret(*this); n ret.p[0][0] = this->p[0][1]; n ret.p[0][1] = this->p[1][1]; n ret.p[1][0] = this->p[0][0]; n ret.p[1][1] = this->p[1][0]; n return ret; n } n }; n bool Equiv(Amulet const& a1, Amulet const& a2) { n return a1.p[0][0] == a2.p[0][0] && a1.p[0][1] == a2.p[0][1] && n a1.p[1][0] == a2.p[1][0] && a1.p[1][1] == a2.p[1][1]; n } n bool operator==(Amulet const& a1, Amulet const& a2) { n Amulet tmp(a1); n for (int i = 0; i < 4; ++i) { n if (Equiv(tmp, a2)) return true; n tmp = tmp.Rotate(); n } n return false; n } n int main() { n vector v; n int n; n cin >> n; n for (int i = 0; i < n; ++i) { n Amulet a; n a.Read(); n vector::iterator it = find(v.begin(), v.end(), a); n if (it == v.end()) { n v.push_back(a); n } n char dummy; n cin >> dummy >> dummy; n } n cout << v.size() << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n cin >> n >> k; n cout << (n / k + 1) * k; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n int a; n int id; n bool operator<(const node &b) const { n if (a != b.a) n return a < b.a; n else n return id > b.id; n } n }; n struct node que[305]; n bool vis[305]; n int main() { n int t, n, m; n scanf( %d , &t); n while (t--) { n memset(vis, 0, sizeof(vis)); n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n scanf( %d , &que[i].a); n que[i].id = i; n } n sort(que + 1, que + m + 1); n long long ans = 0; n for (int i = 1; i <= m; i++) { n for (int j = 1; j < que[i].id; j++) ans += vis[j]; n vis[que[i].id] = 1; n } n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n cin >> n >> k; n int ara[2 * n + 1], count = 0; n for (int i = 0; i <= 2 * n; i++) { n cin >> ara[i]; n } n for (int i = 0; count < k; i++) { n if (ara[i] + 1 < ara[i + 1] && ara[i + 1] - 1 > ara[i + 2]) { n ara[i + 1]--; n count++; n } n } n for (int i = 0; i < 2 * n; i++) { n cout << ara[i] << ; n } n cout << ara[2 * n] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n string s; n cin >> s; n set ss; n for (char c : s) ss.insert(c); n if (ss.size() < n) n cout << NO << endl; n else { n cout << YES << endl; n int vis[30]; n memset(vis, 0, sizeof vis); n string res = ; n for (char c : s) { n if (n == 1) n res += c; n else { n if (res.size() > 0 and !vis[c - a ]) { n n--; n vis[c - a ] = 1; n cout << res << endl; n res = string(1, c); n } else { n vis[c - a ] = 1; n res += c; n } n } n } n cout << res << endl; n } n return 0; n } n "} +{"func_code_string": "#include n long long stk[300001][3], top = 1, n, m, best = 1, nownum, K, B; n long long eval(long long x) { n return (K + stk[x][0]) * stk[x][2] + B + stk[x][1]; n } n double intersect(long long x, long long y) { n return (double)(stk[x][0] - stk[y][0]) / (stk[y][1] - stk[x][1]); n } n bool comp(long long x) { n return eval(top) * (stk[top][2] - stk[top - 1][2]) >= n (eval(top - 1) - eval(top)) * (x - stk[top][2]); n } n signed main() { n scanf( %I64d%I64d , &nownum, &m); n --nownum; n for (long long i = 1, opt, k, b, s; i <= m; i++) { n scanf( %I64d , &opt); n if (opt == 1) { n scanf( %I64d , &k); n top = 1; n K = B = 0; n stk[top][0] = 0; n stk[top][1] = 0; n stk[top][2] = 0; n nownum += k; n } else if (opt == 2) { n scanf( %I64d , &k); n if (eval(top) == 0) { n nownum += k; n goto loop; n } n while (top > 1 && comp(nownum + 1)) --top; n ++top; n stk[top][0] = -K; n stk[top][1] = -B; n stk[top][2] = nownum + 1; n nownum += k; n } else { n scanf( %I64d%I64d , &b, &s); n K += s; n B += b; n while (top > 1 && eval(top - 1) <= eval(top)) --top; n } n loop: n printf( %I64d %I64d n , stk[top][2] + 1, eval(top)); n } n } n "} +{"func_code_string": "#include n using namespace std; n int to[55][35][35][4][3]; n int dx[] = {0, 1, 0, -1}; n int dy[] = {1, 0, -1, 0}; n int Sign(int x) { return x > 0 ? 1 : x < 0 ? -1 : 0; } n int main() { n int n, b; n cin >> n >> b; n ++b; n for (int i = 0; i < b; ++i) { n for (int j = 0; j < b; ++j) { n for (int d = 0; d < 4; ++d) { n int nx = i + dx[d], ny = j + dy[d]; n to[0][i][j][d][0] = nx; n to[0][i][j][d][1] = ny; n to[0][i][j][d][2] = d; n } n } n } n for (int i = 0; i < n; ++i) { n int x0, y0, x1, y1; n cin >> x0 >> y0 >> x1 >> y1; n int dx = Sign(x1 - x0), dy = Sign(y1 - y0); n int dd = 0; n for (int j = 0; j < 4; ++j) { n if (dx == ::dx[j] && dy == ::dy[j]) { n dd = j; n break; n } n } n while (x0 != x1 || y0 != y1) { n for (int j = 0; j < 4; ++j) { n to[0][x0][y0][j][0] = x0 + dx; n to[0][x0][y0][j][1] = y0 + dy; n to[0][x0][y0][j][2] = dd; n } n x0 += dx; n y0 += dy; n } n for (int j = 0; j < 4; ++j) { n to[0][x0][y0][j][0] = x0 + dx; n to[0][x0][y0][j][1] = y0 + dy; n to[0][x0][y0][j][2] = dd; n } n } n for (int i = 1; i < 55; ++i) { n for (int x = 0; x < b; ++x) { n for (int y = 0; y < b; ++y) { n for (int j = 0; j < 4; ++j) { n int nx = to[i - 1][x][y][j][0], ny = to[i - 1][x][y][j][1], n dd = to[i - 1][x][y][j][2]; n if (nx < 0 || nx >= b || ny < 0 || ny >= b) { n to[i][x][y][j][0] = nx; n to[i][x][y][j][1] = ny; n to[i][x][y][j][2] = -1; n } else { n to[i][x][y][j][0] = to[i - 1][nx][ny][dd][0]; n to[i][x][y][j][1] = to[i - 1][nx][ny][dd][1]; n to[i][x][y][j][2] = to[i - 1][nx][ny][dd][2]; n } n } n } n } n } n int q; n cin >> q; n for (int i = 0; i < q; ++i) { n int x, y; n char d; n long long t; n cin >> x >> y >> d >> t; n int dir = 0; n if (d == L ) { n dir = 3; n } else if (d == R ) { n dir = 1; n } else if (d == D ) { n dir = 2; n } else { n dir = 0; n } n for (int j = 0; t; ++j, t >>= 1) { n if (t & 1) { n int nx = to[j][x][y][dir][0]; n int ny = to[j][x][y][dir][1]; n dir = to[j][x][y][dir][2]; n x = nx; n y = ny; n } n if (x < 0 || x >= b || y < 0 || y >= b) { n break; n } n } n x = max(0, min(x, b - 1)); n y = max(0, min(y, b - 1)); n cout << x << << y << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k, p, x; n cin >> n >> k >> p; n int impair(k - p); n vector pai, imp; n for (int i = 0; i < n; ++i) { n cin >> x; n if (x & 1) n imp.push_back(x); n else n pai.push_back(x); n } n int avpair(pai.size()), avimpair(imp.size()); n avimpair -= impair; n if (avimpair < 0 || (avpair + (avimpair >> 1)) < p || (avimpair & 1)) { n cout << NO ; n return 0; n } n cout << YES n ; n vector > res; n res.resize(k); n int iimp(0), ipai(0); n for (int i = 0; i < impair; ++i) res[i].push_back(imp[iimp++]); n for (int i = impair; i < k; ++i) n if (ipai < pai.size()) n res[i].push_back(pai[ipai++]); n else { n res[i].push_back(imp[iimp++]); n res[i].push_back(imp[iimp++]); n } n while (ipai < pai.size()) res[0].push_back(pai[ipai++]); n while (iimp < imp.size()) res[0].push_back(imp[iimp++]); n for (int i = 0; i < k; ++i) { n cout << res[i].size() << ; n for (int j = 0; j < res[i].size(); ++j) cout << res[i][j] << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int x; n cin >> x; n cout << 25; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void read(T &x) { n x = 0; n bool f = false; n char ch = getchar(); n while (!isdigit(ch)) { n f |= ch == - , ch = getchar(); n } n while (isdigit(ch)) { n x = (x << 1) + (x << 3) + (ch ^ 48); n ch = getchar(); n } n x = f ? -x : x; n return; n } n template n inline void write(T x) { n if (x < 0) x = -x, putchar( - ); n if (x > 9) write(x / 10); n putchar(x % 10 ^ 48); n return; n } n const int N = 1e3 + 5, MOD = 998244353; n int n, m, val[N], dp[N], Ans, C[N][N]; n int main() { n read(n); n for (int i = 1; i <= n; i++) read(val[i]), C[i][i] = C[i][0] = 1; n for (int i = 1; i <= n; i++) n for (int j = 1; j < i; j++) n C[i][j] = (C[i - 1][j - 1] + C[i - 1][j] > +MOD n ? C[i - 1][j - 1] + C[i - 1][j] - MOD n : C[i - 1][j - 1] + C[i - 1][j]); n dp[n + 1] = 1; n for (int i = n; i >= 1; i--) { n if (val[i] <= 0) continue; n for (int j = val[i] + i + 1; j <= n + 1; j++) n dp[i] = (dp[i] + 1ll * dp[j] * C[j - i - 1][val[i]] % MOD > +MOD n ? dp[i] + 1ll * dp[j] * C[j - i - 1][val[i]] % MOD - MOD n : dp[i] + 1ll * dp[j] * C[j - i - 1][val[i]] % MOD); n } n for (int i = 1; i <= n; i++) n Ans = (Ans + dp[i] > +MOD ? Ans + dp[i] - MOD : Ans + dp[i]); n write(Ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n t mag(t a) { n return a > 0 ? a : -a; n } n template n T cdiv(T num, U den) { n return (num / den) + ((num % den) > 0); n } n std::ifstream term( /dev/tty ); n std::string tempstring; n using ll = int_fast64_t; n using ii = pair; n using vi = vector; n using vl = vector; n using vii = vector; n const int &sij = 400010; n const ll &mod = 998244353ll; n int n; n ll add(ll a, ll b) { return (a + b) % mod; } n int esc(int tcase) { n cin >> n; n vi vec(n); n for (auto &e : vec) cin >> e; n vl dp0(201), sdp0(201), dp1(201), sdp1(201); n for (int i = 1; i <= 200; i++) { n if (vec.back() == -1 or i == vec.back()) dp0[i] = 1; n } n partial_sum(dp0.begin(), dp0.end(), sdp0.begin(), add); n partial_sum(dp1.begin(), dp1.end(), sdp1.begin(), add); n ; n auto get0 = [&](int l, int r) -> ll { n if (r < l) return 0; n return (sdp0[r] - sdp0[l - 1] + mod) % mod; n }; n auto get1 = [&](int l, int r) -> ll { n if (r < l) return 0; n return (sdp1[r] - sdp1[l - 1] + mod) % mod; n }; n for (auto i = n - 2; i >= 0; i--) { n vl ndp0(201), ndp1(201); n for (int x = 1; x <= 200; x++) { n if (vec[i] == -1 or x == vec[i]) { n ndp0[x] = (get0(1, x - 1) + get1(1, x - 1)) % mod; n ndp1[x] = (get1(x + 1, 200) + get1(x, x) + get0(x, x)) % mod; n } n } n partial_sum(ndp0.begin(), ndp0.end(), sdp0.begin(), add); n partial_sum(ndp1.begin(), ndp1.end(), sdp1.begin(), add); n ; n ; n ; n } n cout << get1(1, 200) << n ; n return 0; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int tc = 1; n for (int i = 1; i <= tc; i++) esc(i); n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1 << 28; n const long long LINF = 1ll << 61; n inline long long getnum() { n register long long r = 0; n register bool ng = 0; n register char c; n c = getchar(); n while (c != - && (c < 0 || c > 9 )) c = getchar(); n if (c == - ) ng = 1, c = getchar(); n while (c != && c != n ) r = r * 10 + c - 0 , c = getchar(); n if (ng) r = -r; n return r; n } n template n inline void putnum(T x) { n if (x < 0) putchar( - ), x = -x; n register short a[20] = {}, sz = 0; n while (x > 0) a[sz++] = x % 10, x /= 10; n if (sz == 0) putchar( 0 ); n for (int i = sz - 1; i >= 0; i--) putchar( 0 + a[i]); n } n inline void putsp() { putchar( ); } n inline void putendl() { putchar( n ); } n inline char mygetchar() { n register char c = getchar(); n while (c == || c == n ) c = getchar(); n return c; n } n const int dx[] = {1, -1, 0, 0}; n const int dy[] = {0, 0, 1, -1}; n const int maxn = 1700; n int w, h, c[maxn][maxn], ans[12345]; n bool g[maxn][maxn], ng[2][maxn][maxn], vis[maxn][maxn], p; n void color(int x, int y, int id) { n c[x][y] = id; n for (int i = 0; i < 4; i++) { n int nx = x + dx[i], ny = y + dy[i]; n if (nx > 0 && nx <= w && ny > 0 && ny <= h && g[nx][ny] && c[nx][ny] == 0) { n color(nx, ny, id); n } n } n } n void dfs(int x, int y) { n vis[x][y] = 1; n for (int i = 0; i < 4; i++) { n int nx = x + dx[i], ny = y + dy[i]; n if (nx > 0 && nx <= w && ny > 0 && ny <= h && g[nx][ny] && !vis[nx][ny]) { n dfs(nx, ny); n } n } n } n void getsmaller() { n p ^= 1; n for (int i = 1; i <= w; i++) { n for (int j = 1; j <= h; j++) { n ng[p][i][j] = ng[p ^ 1][i][j]; n for (int k = 0; k < 4; k++) { n if (!ng[p ^ 1][i + dx[k]][j + dy[k]]) { n ng[p][i][j] = 0; n } n } n } n } n } n void getbigger() { n p ^= 1; n for (int i = 1; i <= w; i++) { n for (int j = 1; j <= h; j++) { n ng[p][i][j] = ng[p ^ 1][i][j]; n for (int k = 0; k < 4; k++) { n if (ng[p ^ 1][i + dx[k]][j + dy[k]]) { n ng[p][i][j] = 1; n } n } n } n } n } n void see() { n for (int i = 1; i <= w; i++) { n for (int j = 1; j <= h; j++) { n putnum(g[i][j] & (!vis[i][j])), putsp(); n } n putendl(); n } n putendl(); n } n int main() { n w = getnum(), h = getnum(); n for (int i = 1; i <= w; i++) { n for (int j = 1; j <= h; j++) { n g[i][j] = getnum(); n } n } n int id = 0; n for (int i = 1; i <= w; i++) { n for (int j = 1; j <= h; j++) { n if (g[i][j] && c[i][j] == 0) { n id++; n color(i, j, id); n } n } n } n for (int i = 1; i <= w; i++) n for (int j = 1; j <= h; j++) ng[p][i][j] = g[i][j]; n getsmaller(); n getsmaller(); n getsmaller(); n getbigger(); n getbigger(); n getbigger(); n getbigger(); n getbigger(); n for (int i = 1; i <= w; i++) { n for (int j = 1; j <= h; j++) { n g[i][j] &= !ng[p][i][j]; n } n } n for (int i = 1; i <= w; i++) n for (int j = 1; j <= h; j++) ng[p][i][j] = g[i][j]; n getsmaller(); n getbigger(); n for (int i = 1; i <= w; i++) n for (int j = 1; j <= h; j++) g[i][j] = ng[p][i][j]; n for (int i = 1; i <= w; i++) { n for (int j = 1; j <= h; j++) { n if (g[i][j] && !vis[i][j]) { n ans[c[i][j]]++; n dfs(i, j); n } n } n } n sort(ans + 1, ans + id + 1); n putnum(id), putsp(), putendl(); n for (int i = 1; i <= id; i++) putnum(ans[i]), putsp(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n class Solve { n public: n int num; n int inputNum[2005]; n int inversion[2005][2]; n int sequence[2005]; n n public: n Solve() { n num = 0; n memset(inputNum, 0, sizeof(inputNum)); n memset(inversion, 0, sizeof(inversion)); n memset(sequence, 0, sizeof(sequence)); n } n void stat() { n for (int i = 0; i < num; ++i) { n for (int j = 0; j < i; ++j) { n if (inputNum[j] < inputNum[i]) { n ++inversion[i][0]; n } n } n } n for (int i = 0; i < num; ++i) { n for (int j = i + 1; j < num; ++j) { n if (inputNum[i] > inputNum[j]) { n ++inversion[i][1]; n } n } n } n } n void calculate() { n for (int i = 0; i < num; ++i) { n if (inversion[i][0] < inversion[i][1]) { n sequence[i] = -inputNum[i]; n } else { n sequence[i] = inputNum[i]; n } n } n } n int getResult() { n int total = 0; n for (int i = 0; i < num; ++i) { n for (int j = i + 1; j < num; ++j) { n if (sequence[i] > sequence[j]) { n ++total; n } n } n } n return total; n } n void readData() { n cin >> num; n for (int i = 0; i < num; ++i) { n cin >> inputNum[i]; n if (inputNum[i] < 0) { n inputNum[i] = -1 * inputNum[i]; n } n } n } n int facade() { n readData(); n stat(); n calculate(); n return getResult(); n } n }; n int main() { n Solve solve; n cout << solve.facade() << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, x, y; n cin >> n >> m; n y = 3 * m; n x = 2 * n; n for (int i = 6; i <= x && i <= y; i += 6) { n if (x <= y) n x += 2; n else n y += 3; n } n cout << max(x, y); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 505; n bool arr[N][N]; n int dp[N][N]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int n, m, k; n cin >> n >> m >> k; n for (int i = 1; i <= n; i++) { n string s; n cin >> s; n for (int j = 1; j <= m; j++) { n arr[i][j] = (int)(s[j - 1] - 0 ); n } n } n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n if (arr[i][j] && arr[i - 1][j] && arr[i + 1][j] && arr[i][j - 1] && n arr[i][j + 1]) { n dp[i][j] = 1; n } n } n } n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n dp[i][j] += dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]; n } n } n long long int ans = 0; n for (int a = 2; a < n; a++) { n for (int b = a; b < n; b++) { n int ptr = 1; n for (int c = 2; c < m; c++) { n while (ptr < m && n (dp[a - 1][c - 1] - dp[b][c - 1] - dp[a - 1][ptr] + dp[b][ptr] < n k)) { n ptr++; n } n ans += (m - ptr); n } n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n static long long mi[400005][20]; n static bool mark[400005][20]; n static long long psum[400005]; n long long f(int x, int k) { n if (k == 0) return psum[x]; n if (mark[x][k]) return mi[x][k]; n mark[x][k] = 1; n return mi[x][k] = min(f(x, k - 1), f(x + (1 << (k - 1)), k - 1)); n } n long long qry(int l, int r) { n int t = r - l + 1; n int lg = 31 - __builtin_clz(t); n return min(f(l, lg), f(r - (1 << lg) + 1, lg)); n } n int main() { n long long n, a, b, c, d, start, len; n scanf( %lld %lld %lld %lld %lld %lld %lld , &n, &a, &b, &c, &d, &start, &len); n vector > v; n for (long long i = 0; i < n; i++) { n long long x, y; n scanf( %lld %lld , &x, &y); n v.push_back(make_pair(y, x)); n } n if (v[0].first == 0) n psum[0] = -d; n else n psum[0] = c; n for (int i = 1; i < n; i++) { n if (v[i].first) n psum[i] = psum[i - 1] + c; n else n psum[i] = psum[i - 1] - d; n } n psum[n] = 1000000000000000000; n vector t; n t.push_back(0); n for (int i = 0; i < n; i++) { n t.push_back(v[i].second + 1); n if (v[i].second - len + 1 >= 0) t.push_back(v[i].second - len + 1); n } n sort(t.begin(), t.end()); n int l = 0, r = 0; n long long at = start; n for (int i = 0; i < t.size(); i++) { n while (l < v.size() && v[l].second < t[i]) { n if (v[l].first) n at += a; n else n at -= b; n if (at < 0) { n printf( -1 n ); n return 0; n } n l++; n } n while (r < v.size() && v[r].second < t[i] + len) r++; n long long low = qry(l, r - 1) - (l > 0 ? psum[l - 1] : 0) + at; n if (low >= 0) { n printf( %lld n , t[i]); n return 0; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int get() { n char ch; n while (ch = getchar(), (ch < 0 || ch > 9 ) && ch != - ) n ; n if (ch == - ) { n int s = 0; n while (ch = getchar(), ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 ; n return -s; n } n int s = ch - 0 ; n while (ch = getchar(), ch >= 0 && ch <= 9 ) s = s * 10 + ch - 0 ; n return s; n } n const int mo = 1e9 + 7; n const int N = 2e6 + 5; n int cnt[N]; n int val[N]; n int lst[N]; n int pri[N], k; n int n; n int tim[N]; n bool bz[N]; n int main() { n n = get(); n for (int i = 1; i <= n; i++) { n int x = get(); n cnt[x]++; n } n lst[1] = 1; n for (int i = 2; i <= 2e6; i++) { n if (!lst[i]) pri[++k] = lst[i] = i; n for (int j = 1; j <= k; j++) { n if (1ll * pri[j] * i > 2e6) break; n lst[i * pri[j]] = pri[j]; n if (i % pri[j] == 0) break; n } n } n for (int i = 1; i <= 2e6; i++) val[i] = 1; n int C = 0; n for (int i = 2e6; i >= 2; i--) { n for (int T = 1; T <= cnt[i]; T++) { n if (val[i] < i) n bz[i] = 1, tim[i] = 1, val[i] = i; n else { n bz[i - 1] = 1; n int x = i - 1; n while (x > 1) { n int v = lst[x]; n int t = 1; n while (x % v == 0) { n x /= v; n t = t * v; n } n if (t > val[v]) { n val[v] = t; n tim[v] = 1; n } else if (val[v] == t) n tim[v]++; n } n } n } n } n for (int i = 1; i <= 2e6; i++) n if (bz[i]) { n bool can = 1; n for (int x = i; x > 1;) { n int v = lst[x], t = 1; n for (; x % v == 0;) x /= v, t *= v; n if (val[v] == t && tim[v] == 1) can = 0; n } n if (can) { n C = 1; n break; n } n } n int ans = 1; n for (int i = 1; i <= 2e6; i++) ans = 1ll * ans * val[i] % mo; n ans = (ans + C) % mo; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool vis[50]; n bool OK(vector > v) { n for (int i = 0; i < (int)v.size(); i++) n if ((int)v[i].size() > 3) return 1; n return 0; n } n int Find(vector > v, int x) { n for (int i = 0; i < (int)v.size(); i++) n if (find(v[i].begin(), v[i].end(), x) != v[i].end()) return i; n return -1; n } n int main() { n int n, q, x, y, ex, ey, c = 0; n scanf( %d %d , &n, &q); n if (n % 3) { n cout << -1; n return 0; n } n vector > v(n / 3); n while (q--) { n scanf( %d %d , &x, &y); n vis[x] = 1, vis[y] = 1; n ex = Find(v, x), ey = Find(v, y); n if (ex != -1) n v[ex].insert(y); n else if (ey != -1) n v[ey].insert(x); n else { n if (c == n / 3) { n cout << -1; n return 0; n } n v[c].insert(x), v[c].insert(y), c++; n } n } n if (OK(v)) { n cout << -1; n return 0; n } n c = 1; n for (int i = 0; i < (int)v.size(); i++) { n for (int j = 0; j < 3 - (int)v[i].size(); j++) { n for (int k = c; k < n + 1; k++) n if (!vis[k]) { n v[i].insert(k); n c = k + 1; n j--; n break; n } n } n } n for (int i = 0; i < (int)v.size(); i++) { n for (set::iterator it = v[i].begin(); it != v[i].end(); it++) n printf( %d , *it); n printf( n ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long w1, h1, w2, h2; n cin >> w1 >> h1 >> w2 >> h2; n long long ans = h1 + h2 + 2; n ans += h1 + h2 + 2 + (w1 - w2); n ans += w1 + w2; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100005; n vector cnt[N]; n int res[N]; n int main() { n int n; n while (cin >> n) { n for (int i = 1; i < N; i++) cnt[i].clear(); n for (int i = 1; i <= n; i++) { n int v; n cin >> v; n cnt[v].push_back(i); n } n bool ok = true; n for (int i = 1; i < N; i++) { n if (i > 1 && cnt[i].size() > cnt[i - 1].size()) ok = false; n for (int j = 0; j < cnt[i].size(); j++) { n res[cnt[i][j]] = j + 1; n } n } n if (!ok) { n printf( %d n , -1); n } else { n printf( %d n , cnt[1].size()); n for (int i = 1; i <= n; i++) printf( %d%c , res[i], i == n ? n : ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n while (n--) { n int a, s, d; n cin >> a >> s >> d; n if (a > s) swap(a, s); n if (a > d) swap(a, d); n if (s > d) swap(s, d); n if (s == d) { n cout << YES << endl; n cout << a << << a << << d << endl; n } else { n cout << NO << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1005; n const int INF = 1e9; n pair NULLPOINT = make_pair(INF, INF); n int n; n int gcd(int x, int y) { n while (y) { n int t = x; n x = y; n y = t % y; n } n return x; n } n struct Line { n int x, y, xx, yy; n pair slope() { n pair ret = {x - xx, y - yy}; n if (ret.second < 0) { n ret.first *= -1; n ret.second *= -1; n } n int g = gcd(abs(ret.first), ret.second); n ret.first /= g, ret.second /= g; n return ret; n } n pair intersect(const Line &l) const { n long long den = n 1LL * (x - xx) * (l.y - l.yy) - 1LL * (y - yy) * (l.x - l.xx); n if (den == 0) return NULLPOINT; n long long c1 = 1LL * x * yy - 1LL * y * xx; n long long c2 = 1LL * l.x * l.yy - 1LL * l.y * l.xx; n long long ix = c1 * (l.x - l.xx) - (x - xx) * c2; n long long iy = c1 * (l.y - l.yy) - (y - yy) * c2; n if (ix % den != 0) return NULLPOINT; n if (iy % den != 0) return NULLPOINT; n ix /= den; n iy /= den; n if (ix < min(x, xx) || ix > max(x, xx) || ix < min(l.x, l.xx) || n ix > max(l.x, l.xx)) n return NULLPOINT; n if (iy < min(y, yy) || iy > max(y, yy) || iy < min(l.y, l.yy) || n iy > max(l.y, l.yy)) n return NULLPOINT; n return pair(ix, iy); n } n }; n Line lines[N]; n int main() { n scanf( %d , &n); n for (int i = 0; i < n; ++i) { n scanf( %d %d %d %d , &lines[i].x, &lines[i].y, &lines[i].xx, &lines[i].yy); n } n long long ans = 0; n for (int i = 0; i < n; ++i) { n pair slope = lines[i].slope(); n if (slope.first == 0) n ans += abs((lines[i].y - lines[i].yy) / slope.second) + 1; n else n ans += abs((lines[i].x - lines[i].xx) / slope.first) + 1; n } n set> intersects; n intersects.insert(NULLPOINT); n for (int i = 0; i < n; ++i) { n set> lineIntersects; n lineIntersects.insert(NULLPOINT); n for (int j = 0; j < n; ++j) { n pair p = lines[i].intersect(lines[j]); n lineIntersects.insert(p); n intersects.insert(p); n } n ans -= lineIntersects.size() - 1; n } n ans += intersects.size() - 1; n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n int main() { n long long n, k; n scanf( %lld%lld , &n, &k); n if (k < 2) { n printf( %lld , n); n return 0; n } n long long s = 1; n while (s - 1 < n) s *= 2; n printf( %lld , s - 1); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n cin.sync_with_stdio(0); n cin.tie(0); n cin.exceptions(cin.failbit); n int n; n cin >> n; n vector a(n); n long long s = 0; n for (int i = 0; i < n; i++) { n cin >> a[i]; n s += a[i]; n } n sort(a.begin(), a.end()); n reverse(a.begin(), a.end()); n if (s % 2 == 1) { n cout << NO << endl; n return 0; n } n if (a[0] <= s / 2) { n cout << YES << endl; n } else { n cout << NO << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 160; n const int mod = 1e9 + 7; n int n, m, f[N][N][2][2], ans; n void inc(int& a, int b) { n if (a += b, a >= mod) a -= mod; n } n int main() { n scanf( %d %d , &n, &m); n for (int i = 1; i <= m; ++i) n for (int j = i; j <= m; ++j) { n f[i][j][1][1] = 1; n } n for (int h = 1; h <= n; ++h) { n int tot = 0; n for (int i = 1; i <= m; ++i) n for (int j = 1; j <= m; ++j) n for (int kl = 0; kl <= 1; ++kl) n for (int kr = 0; kr <= 1; ++kr) { n inc(tot, f[i][j][kl][kr]); n } n inc(ans, (long long)tot * (n + 1 - h) % mod); n if (h == n) break; n for (int j = 1; j <= m; ++j) n for (int i = 1; i < j; ++i) n for (int kr = 0; kr <= 1; ++kr) { n inc(f[i + 1][j][0][kr], (f[i][j][0][kr] + f[i][j][1][kr]) % mod); n } n for (int i = 1; i <= m; ++i) n for (int j = m; j > i; --j) n for (int kl = 0; kl <= 1; ++kl) { n inc(f[i][j - 1][kl][0], (f[i][j][kl][0] + f[i][j][kl][1]) % mod); n } n for (int j = 2; j <= m; ++j) n for (int i = j; i > 1; --i) n for (int kr = 0; kr <= 1; ++kr) { n inc(f[i - 1][j][1][kr], f[i][j][1][kr]); n } n for (int i = 1; i <= m - 1; ++i) n for (int j = i; j < m; ++j) n for (int kl = 0; kl <= 1; ++kl) { n inc(f[i][j + 1][kl][1], f[i][j][kl][1]); n } n } n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 1e5 + 5; n char a[MAX_N]; n int main() { n int N; n cin >> N; n scanf( %s , a + 1); n int cnt = 0; n for (int i = 1; i <= N; i++) { n if (a[i] == S && a[i] >= 2 && a[i - 1] == G ) { n cnt++; n } n } n if (a[N] == G ) cnt++; n int len = 0, prelen = (cnt >= 2), ans = 0; n for (int i = 1; i <= N; i++) { n if (a[i] == G ) { n len++; n ans = max(ans, len + prelen); n } n if (a[i] == S ) { n if (2 <= i && i <= N - 1 && a[i - 1] == G && a[i + 1] == G ) { n if (cnt == 2) { n prelen = len; n } else if (cnt >= 3) { n prelen = len + 1; n } n } else { n prelen = (cnt >= 2); n } n len = 0; n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int t, a[4][200010], len; n string s; n bool check(int x) { n for (int i = x; i <= len; i++) n if (a[1][i] - a[1][i - x] && a[2][i] - a[2][i - x] && a[3][i] - a[3][i - x]) n return 1; n return 0; n } n int main() { n scanf( %d , &t); n while (t--) { n cin >> s; n len = s.size(); n s += s[s.size() - 1]; n for (int i = len; i >= 1; i--) { n s[i] = s[i - 1]; n } n int l = 1, r = len; n for (int i = 1; i <= len; i++) { n if (s[i] == 1 ) { n a[1][i] = a[1][i - 1] + 1; n a[2][i] = a[2][i - 1]; n a[3][i] = a[3][i - 1]; n } n if (s[i] == 2 ) { n a[1][i] = a[1][i - 1]; n a[2][i] = a[2][i - 1] + 1; n a[3][i] = a[3][i - 1]; n } n if (s[i] == 3 ) { n a[1][i] = a[1][i - 1]; n a[2][i] = a[2][i - 1]; n a[3][i] = a[3][i - 1] + 1; n } n } n if (!a[1][len] || !a[2][len] || !a[3][len]) { n puts( 0 ); n continue; n } n while (l + 1 < r) { n int mid = (l + r) >> 1; n if (check(mid)) n r = mid; n else n l = mid; n } n cout << r << endl; n memset(a, 0, sizeof(a)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double EPS = 1e-10; n const long double INF = (int)1e9 + 34; n const int N = (int)1e6 + 34; n void ret(int x) { n cout << x; n exit(0); n } n int n, k; n int a[N]; n int b[N], len; n bool u[N]; n int main() { n scanf( %d%d , &n, &k); n for (int i = 0; i < n; i++) scanf( %d , a + i); n srand(3431); n sort(a, a + n); n a[n] = 100000000; n int lst = a[0]; n b[len++] = a[0]; n for (int i = 1; i < n; i++) n if (a[i + 1] - lst >= k) { n b[len++] = lst = a[i]; n } n int mn = a[0]; n for (int i = 0; i < n; i++) mn = min(mn, a[i]); n vector v; n for (int i = 0; i < 30; i++) v.push_back(a[abs((rand() << 16) ^ rand()) % n]); n for (int i = 1; i <= 1000000; i++) n for (int j = 0; !u[i] && j < (int)v.size(); j++) n if (v[j] % i > k) u[i] = true; n int l1 = -1; n int pr; n bool fail; n for (int d = mn; d >= 0; d--) { n if (u[d]) continue; n fail = false; n for (int i = 0; !fail && i < len; i++) n if (b[i] % d > k) fail = true; n if (!fail) { n pr = d; n break; n } n l1 = d; n } n for (int d = pr; d >= 0; d--) { n if (u[d]) continue; n fail = false; n for (int i = n - 1; !fail && i >= 0; i--) n if (a[i] % d > k) fail = true; n if (!fail) { n pr = d; n break; n } n l1 = d; n } n cout << pr; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n long long n, cnt1 = 0, cnt2 = 0, l, r; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> l >> r; n cnt1 += l; n cnt2 += r; n } n cout << min(cnt1, n - cnt1) + min(cnt2, n - cnt2); n } n "} +{"func_code_string": "#include n using namespace std; n long long int Mmax(long long int a, long long int b) { n if (a > b) return a; n return b; n } n long long int Mmin(long long int a, long long int b) { n if (a < b) return a; n return b; n } n long long int nod(long long int a, long long int b) { n while (a && b) { n if (a > b) n a %= b; n else n b %= a; n } n return Mmax(a, b); n } n long long int nok(long long int a, long long int b) { n return a * b / nod(a, b); n } n bool IsPrime(long long int x) { n if (x < 2) return false; n long long int X = sqrt(x), i; n for (i = 2; i <= X; i++) n if (x % i == 0) return false; n return true; n } n void hanoi(int n, int A, int C, int B) { n if (n == 1) { n cout << n << << A << << C << endl; n } else { n hanoi(n - 1, A, B, C); n cout << n << << A << << C << endl; n hanoi(n - 1, B, C, A); n } n } n string pr2(string a, int d) { n if (d == 0) return 0 ; n string b; n long long int sz = a.size(), i, prenos = 0; n for (i = 0; i < sz; i++) { n b[i] = a[i]; n } n for (i = sz - 1; i > -1; i--) { n a[i] = ((b[i] - 0 ) * d + prenos) % 10 + 0 ; n prenos = ((b[i] - 0 ) * d + prenos) / 10; n } n if (prenos) a = char(prenos + 0 ) + a; n return a; n } n string sum(string a, string b) { n bool carry = false; n long long int i, sz1, sz2, maxsz, minsz; n string c, d; n sz1 = a.size(); n sz2 = b.size(); n maxsz = max(sz1, sz2); n minsz = min(sz1, sz2); n while (sz1 < maxsz) { n sz1++; n a = 0 + a; n } n while (sz2 < maxsz) { n sz2++; n b = 0 + b; n } n for (i = maxsz - 1; i > -1; i--) { n d = char((a[i] + b[i] - 96 + carry) % 10 + 48) + d; n if (a[i] + b[i] - 96 + carry > 9) n carry = true; n else n carry = false; n } n if (carry == true) d = char( 1 ) + d; n return d; n } n string pr(string a, string b) { n string res = 0 , p, p2; n int sz = a.size(), x = 0; n for (sz = a.size(); sz > 0; sz--, x++) { n int d = a[sz - 1] - 0 ; n a = a.erase(sz - 1, 1); n p2 = pr2(b, d); n p2 += p; n res = sum(res, p2); n p += 0 ; n } n return res; n } n bool vesokosna(long long int x) { n return (x % 4 == 0 && x % 100 || x % 400 == 0); n } n long long int reverse(long long int x) { n long long int mirror = 0; n while (x) { n mirror = mirror * 10 + x % 10; n x /= 10; n } n return mirror; n } n long long int ost(string x, long long int k) { n long long int num = 0, i, sz = x.size(); n for (i = 0; i < sz; i++) { n num = num * 10; n num += x[i] - 0 ; n num %= k; n } n return num; n } n bool can[128][128]; n vector ans; n int main() { n char last; n int k, i, j, sz2 = 1; n cin >> k; n string q; n cin >> q; n int sz = q.size(); n if (sz < k) { n cout << NO n ; n return 0; n } n string help; n help += q[0]; n ans.push_back(help); n last = q[0]; n for (i = 1; i < sz; i++) { n if (sz2 == k) break; n bool can = true; n ; n for (j = 0; j < sz2; j++) n if (q[i] == ans[j][0]) can = false; n if (can) { n string help; n help += q[i]; n last = q[i]; n ans.push_back(help); n sz2++; n } else n ans.back() += q[i]; n } n if (sz2 == k) { n cout << YES n ; n for (; i < sz; i++) { n ans.back() += q[i]; n } n for (i = 0; i < sz2; i++) cout << ans[i] << endl; n return 0; n } n cout << NO n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void prints(T&&...) {} n template n void printe(T&&...) {} n template n void printw(T&&...) {} n template n void printew(T&&...) {} n template n void printb(T&&...) {} n template n void printd(T&&...) {} n template n void printde(T&&...){}; n template n istream& operator>>(istream& in, vector& v) { n for (auto& e : v) { n in >> e; n } n return in; n } n int main() { n int n; n cin >> n; n vector s(n); n cin >> s; n int k = 0; n bool pr; n for (int i = 0; i < n; i++) { n if (s[i] == 1 ) { n k++; n pr = true; n } else { n break; n } n } n if (k == n) { n cout << YES ; n return 0; n } n int l = 0; n for (int i = 0; i < n; i++) { n if (s[i] == 0 ) { n l++; n pr = false; n } else { n break; n } n } n if (l == n) { n cout << YES ; n return 0; n } n int m; n m = max(l, k); n for (int i = 0; i < n; i = i + m) { n if (s[i] == 1 && pr) { n for (int j = 0; j < m; j++) { n if (s[j + i] != 1 ) { n cout << NO ; n return 0; n } n } n pr = false; n continue; n } n if (s[i] == 0 && !pr) { n for (int j = 0; j < m; j++) { n if (s[j + i] != 0 ) { n cout << NO ; n return 0; n } n } n pr = true; n continue; n } n cout << NO ; n return 0; n } n cout << YES ; n } n "} +{"func_code_string": "#include n using namespace std; n const int nax = 505; n int n; n char grid[nax][nax]; n int cc[nax][nax]; n int cc_size[nax * nax]; n int when_added[nax * nax]; n const int dx[4] = {-1, 1, 0, 0}; n const int dy[4] = {0, 0, -1, 1}; n const char EMPTY = . ; n bool inside(int x, int y) { return 0 <= min(x, y) && max(x, y) < n; } n void dfs(int x, int y, int which_cc) { n cc[x][y] = which_cc; n ++cc_size[which_cc]; n for (int i = 0; i < 4; ++i) { n int x2 = x + dx[i]; n int y2 = y + dy[i]; n if (inside(x2, y2) && grid[x2][y2] == EMPTY && cc[x2][y2] == 0) n dfs(x2, y2, which_cc); n } n } n void add(int x, int y, int& answer, int current_time) { n if (inside(x, y) && grid[x][y] == EMPTY) { n int id = cc[x][y]; n if (when_added[id] != current_time) { n when_added[id] = current_time; n answer += cc_size[id]; n } n } n } n int main() { n int k; n scanf( %d%d , &n, &k); n for (int i = 0; i < n; ++i) scanf( %s , grid[i]); n int how_many_cc = 0; n for (int x = 0; x < n; ++x) n for (int y = 0; y < n; ++y) n if (grid[x][y] == EMPTY && cc[x][y] == 0) dfs(x, y, ++how_many_cc); n int cur_time = 1; n int best_answer = 0; n for (int y_low = 0; y_low + k <= n; ++y_low) { n for (int x = 0; x < k; ++x) n for (int y = y_low; y < y_low + k; ++y) --cc_size[cc[x][y]]; n for (int x_low = 0; x_low + k <= n; ++x_low) { n int answer = k * k; n for (int x = x_low; x < x_low + k; ++x) { n add(x, y_low - 1, answer, cur_time); n add(x, y_low + k, answer, cur_time); n } n for (int y = y_low; y < y_low + k; ++y) { n add(x_low - 1, y, answer, cur_time); n add(x_low + k, y, answer, cur_time); n } n ++cur_time; n best_answer = max(best_answer, answer); n if (x_low + k != n) { n for (int y = y_low; y < y_low + k; ++y) { n ++cc_size[cc[x_low][y]]; n --cc_size[cc[x_low + k][y]]; n } n } n } n for (int x = n - k; x < n; ++x) n for (int y = y_low; y < y_low + k; ++y) ++cc_size[cc[x][y]]; n } n printf( %d , best_answer); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1000000000; n const int maxn = 100010; n int a[maxn]; n int max(int a, int b) { return a > b ? a : b; } n int min(int a, int b) { return a > b ? b : a; } n int main() { n int n, l, r, i, j; n string s; n while (cin >> n) { n for (i = 0; i < n; i++) cin >> a[i]; n cin >> s; n l = -inf, r = inf; n for (i = 4; i < n; i++) { n if (s[i] == 1 ) { n int maxi = -inf; n for (j = i; j >= i - 4; j--) { n maxi = max(maxi, a[j]); n } n int cnt = 0; n for (j = i; j >= i - 4; j--) { n if (s[j] == 0 ) cnt++; n } n if (cnt == 4) { n l = max(l, maxi + 1); n } n } else if (s[i] == 0 ) { n int mina = inf; n for (j = i; j >= i - 4; j--) { n mina = min(mina, a[j]); n } n int cnt = 0; n for (j = i; j >= i - 4; j--) { n if (s[j] == 1 ) cnt++; n } n if (cnt == 4) { n r = min(r, mina - 1); n } n } n } n cout << l << << r << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long i, j, k, n, v[200010], m, a, b, x, y, h, w, l, p, ans, numitor, aux, n mini, sum, poz; n string s1, s2, second; n char c; n map mip; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> n >> x; n for (long long i = 1; i <= n; i++) { n cin >> v[i]; n if (v[i] < x) n v[i] = -1; n else if (v[i] > x) n v[i] = 1; n else { n v[i] = 0; n poz = i; n } n } n mip[0] = 1; n sum = 0; n for (long long i = 1; i <= n; i++) { n sum += v[i]; n if (i >= poz) { n if (mip.find(sum) != mip.end()) ans += mip[sum]; n if (mip.find(sum - 1) != mip.end()) ans += mip[sum - 1]; n } else { n mip[sum] += 1; n v[i] = sum; n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n int n, ex, ey, sx[N], sy[N]; n char s[N]; n inline bool check(int m) { n for (int i = 1; i + m - 1 <= n; i++) { n int decx = sx[n] - sx[i + m - 1] + sx[i - 1]; n int decy = sy[n] - sy[i + m - 1] + sy[i - 1]; n int nedx = ex - decx; n int nedy = ey - decy; n if (abs(nedx) + abs(nedy) <= m && !(m - abs(nedx) - abs(nedy) & 1)) n return 1; n } n return 0; n } n int main() { n scanf( %d%s%d%d , &n, s + 1, &ex, &ey); n for (int i = 1; i <= n; i++) { n sx[i] = sx[i - 1] + (s[i] == L ? -1 : (s[i] == R ? 1 : 0)); n sy[i] = sy[i - 1] + (s[i] == D ? -1 : (s[i] == U ? 1 : 0)); n } n int l = 0, r = n, mid, ans = -1; n while (l <= r) { n mid = l + r >> 1; n if (check(mid)) { n ans = mid; n r = mid - 1; n } else { n l = mid + 1; n } n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c, d, i, j, x, y = 0, w, z = 0, e; n cin >> a >> b >> c >> d; n if (d % c != 0) { n cout << 0; n return 0; n } n w = d / c; n if (c == d) { n if (c >= a && c <= b) n cout << 1; n else n cout << 0; n return 0; n } n for (i = 1; i <= sqrt(w); i++) { n if (w % i == 0) { n x = w / i; n e = 0; n for (j = 2; j <= i; j++) { n if (i % j == 0 && x % j == 0) { n e = 1; n break; n } n } n if (e == 0) { n if (i * c >= a && i * c <= b && x * c >= a && x * c <= b) y++; n } n } n } n cout << y * 2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e6 + 5; n int tree[4 * MAXN], n, m, a[MAXN], size = 0, less1[MAXN]; n vector del, nums; n void initialize(int l, int r, int node) { n tree[node] = r - l + 1; n if (r == l) return; n int mid = (l + r) / 2; n initialize(l, mid, 2 * node); n initialize(mid + 1, r, 2 * node + 1); n } n int elim(int node) { n while (node >= 1) { n tree[node]--; n node /= 2; n } n } n void find(int l, int r, int sum, int node) { n if (l == r) { n nums[l] = -2; n elim(node); n return; n } n int mid = (l + r) / 2; n if (tree[2 * node] >= sum) n find(l, mid, sum, 2 * node); n else n find(mid + 1, r, sum - tree[2 * node], 2 * node + 1); n } n int main() { n ios_base::sync_with_stdio(0); n cin >> n >> m; n for (int i = 0; i < m; ++i) { n cin >> a[i]; n } n for (int i = 0; i < MAXN; ++i) less1[i] = 0; n for (int i = 0; i < m - 1; ++i) n for (int k = a[i]; k < a[i + 1]; ++k) less1[k] = i + 1; n for (int i = a[m - 1]; i < MAXN; ++i) less1[i] = m; n for (int i = 0; i < n; ++i) { n int x; n cin >> x; n if (x == -1) { n del.push_back(less1[size]); n size -= less1[size]; n } else { n nums.push_back(x); n size++; n } n } n if (nums.size() == 0) { n cout << Poor stack! << endl; n return 0; n } n initialize(0, nums.size() - 1, 1); n for (int i = 0; i < del.size(); ++i) n for (int j = del[i] - 1; j >= 0; --j) find(0, nums.size() - 1, a[j], 1); n int ct = 0; n for (int i = 0; i < nums.size(); ++i) { n if (nums[i] != -2) { n cout << nums[i]; n ++ct; n } n } n if (ct == 0) cout << Poor stack! ; n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const long long INFF = 0x3f3f3f3f3f3f3f3f; n const double pi = acos(-1.0); n const double eps = 1e-9; n const long long mod = 1e9 + 7; n int read() { n int x = 0, f = 1; n char ch = getchar(); n while (ch< 0 | ch> 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n return x * f; n } n void Out(int aa) { n if (aa > 9) Out(aa / 10); n putchar(aa % 10 + 0 ); n } n int n, t; n int f[55], s[55], p[55]; n double dp[55][5005]; n bool check(double mid) { n for (int i = n; i >= 1; i--) { n for (int j = t + 1; j <= 5000; j++) dp[i + 1][j] = mid; n for (int j = 0; j <= t; j++) { n double t1 = (dp[i + 1][j + f[i]] + f[i]) * p[i] / 100; n double t2 = (dp[i + 1][j + s[i]] + s[i]) * (100 - p[i]) / 100; n dp[i][j] = min(mid, t1 + t2); n } n } n return dp[1][0] < mid; n } n int main() { n n = read(), t = read(); n for (int i = 1; i <= n; i++) f[i] = read(), s[i] = read(), p[i] = read(); n double l = 0, r = 1e12; n for (int i = 0; i < 100; i++) { n double mid = (l + r) / 2; n if (check(mid)) n r = mid; n else n l = mid; n } n printf( %.10f n , l); n return 0; n } n "} +{"func_code_string": "#include n #include n #include n n using namespace std; n n #define int long long n n void solve() { n int n; n vector vect; n cin >> n; n for (int i = 0; i < n; i++) { n long long x; n cin >> x; n vect.push_back(x); n } n sort(vect.begin(), vect.end()); n long long res = 0; n long long now = 0; n for (int i = n - 2; i >= 0; i--) { n res -= now - (n - i - 2) * vect[i]; n now += vect[i + 1]; n } n cout << res << n ; n } n n signed main() n { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n int t; n cin >> t; n for (int i = 0; i < t; i++) n solve(); n return 0; n } n "} +{"func_code_string": " n // Problem : B. Tree Array n // Contest : Codeforces - Codeforces Round #728 (Div. 1) n // URL : https://codeforces.com/contest/1540/problem/B n // Memory Limit : 256 MB n // Time Limit : 2000 ms n // Powered by CP Editor (https://github.com/cpeditor/cpeditor) n n #include n n using namespace std; n n int N; n long long pas[205][205]; n const long long MOD = 1e9+7; n long long cache[205][205]; n vector graph[205]; n int par[205]; n bool vis[205]; n n long long add(long long a, long long b){ n return (a + b) % MOD; n } n n long long mult(long long a, long long b){ n return a * b % MOD; n } n n long long qikpow(long long b, long long e){ n if(!e){ n return 1; n } n long long ret = qikpow(b, e / 2); n ret = mult(ret, ret); n if(e & 1){ n ret = mult(ret, b); n } n return ret; n } n n long long sub(long long a, long long b){ n return ((a - b) % MOD + MOD ) % MOD; n } n n long long divd(long long a, long long b){ n return mult(a, qikpow(b, MOD - 2)); n } n n void dfs1(int n){ n for(int e : graph[n]){ n if(e != par[n]){ n par[e] = n; n dfs1(e); n } n } n } n n int dfs2(int n, int p){ n int sz = 1; n for(int e : graph[n]){ n if(!vis[e] && p != e){ n sz += dfs2(e, n); n } n } n return sz; n } n n int main(){ n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> N; n for(int i = 0; i <= N; i++){ n pas[i][0] = 1; n for(int j = 1; j <= i; j++){ n pas[i][j] = add(pas[i-1][j], pas[i-1][j-1]); n } n } n for(int i = 1; i < N; i++){ n int a, b; n cin >> a >> b; n graph[a].emplace_back(b); n graph[b].emplace_back(a); n } n long long ans = 0; n for(int n = 1; n <= N; n++){ n fill(par, par+1+N, 0); n dfs1(n); n vis[n] = 1; n for(int k = n+1; k <= N; k++){ n int cur = k, len = 0; n while(cur != n){ n vis[cur] = 1; n len++; n cur = par[cur]; n } n cur = k; n for(int t = len; t; t--){ n int s = dfs2(cur, 0); n //cout << s << n ; n long long tot = divd(s, N); n if(t == len){ n ans = add(ans, tot); n } n else{ n /* n long long p = 1;//qikpow(divd(1, 2), len); n cout << p << << pas[len - 1][len - t] << n ; n p = mult(p, divd(pas[len - 1][len - t], pas[len][len-t])); n cout << n << << k << << cur << n ; n cout << p << << tot << n ; n ans = add(ans, mult(p, tot)); n */ n //cout << n << << k << << cur << n ; n //cout << tot << n ; n if(!cache[len][t]){ n for(int c = 0; c < t; c++){ n cache[len][t] = add(cache[len][t], mult(pas[c+len-t-1][len-t-1], qikpow(divd(1, 2), c+len-t))); n //cout << mult(mult(pas[c+len-t-1][len-t-1], qikpow(divd(1, 2), c+len-t)), tot) << n ; n } n } n ans = add(mult(tot, cache[len][t]), ans); n n } n cur = par[cur]; n } n cur = k; n while(cur != n){ n vis[cur] = 0; n cur = par[cur]; n } n } n vis[n] = 0; n } n cout << ans; n }"} +{"func_code_string": "#include n using namespace std; n int read() { n int a = 0; n char c = getchar(); n bool f = 0; n while (!isdigit(c)) { n f = c == - ; n c = getchar(); n } n while (isdigit(c)) { n a = a * 10 + c - 48; n c = getchar(); n } n return f ? -a : a; n } n const int _ = 1e5 + 11; n vector nxt[_][2]; n int N, C[_], ans; n long long num; n void addEd(int a, int b, int c) { nxt[a][c].push_back(b); } n int deg[_], dst[_], seq[_], cseq; n unsigned long long arr[_][50]; n void build(int fir) { n memset(deg, 0, sizeof(deg)); n cseq = 0; n for (int i = 1; i <= N + 8; ++i) { n for (auto t : nxt[i][0]) deg[t] += dst[t] == dst[i]; n for (auto t : nxt[i][1]) deg[t] += dst[t] == dst[i] + 1; n } n queue q; n q.push(fir); n while (!q.empty()) { n int t = q.front(); n q.pop(); n seq[++cseq] = t; n for (int l = 0; l < 2; ++l) n for (auto p : nxt[t][l]) n if (dst[p] == dst[t] + l && !--deg[p]) q.push(p); n } n } n void solve(int size, vector node, int fir, int mx) { n memset(arr, 0, sizeof(arr)); n for (int i = 0; i < node.size(); ++i) n arr[node[i]][i >> 6] |= 1ull << (i & 63); n for (int i = 1; i <= cseq; ++i) { n int t = seq[i]; n for (int l = 0; l < 2; ++l) n for (auto p : nxt[t][l]) n if (dst[p] == dst[t] + l) n for (int r = 0; r < 50; ++r) arr[p][r] |= arr[t][r]; n } n long long cnt = 0; n int val = node.size(); n for (int i = 1; i <= N && val == node.size(); ++i) n if (dst[i] == mx) { n int num = 0; n for (int j = 0; j < 50; ++j) { n num += __builtin_popcountll(arr[i][j]); n } n val = min(val, num); n } n if (val == node.size()) --mx; n for (int i = 1; i <= N; ++i) n if (dst[i] > mx) n cnt += node.size(); n else if (dst[i] == mx) { n int num = 0; n for (int j = 0; j < 50; ++j) { n num += __builtin_popcountll(arr[i][j]); n } n cnt += node.size() - num; n } n if (ans < mx) { n ans = mx; n num = 0; n } n if (ans == mx) num += cnt; n } n int main() { n ios::sync_with_stdio(0); n cin >> N; n for (int i = 1; i <= N; ++i) { n char c; n cin >> c; n C[i] = c - a + 1; n addEd(i, N + C[i], 0); n addEd(N + C[i], i, 1); n } n for (int i = 2; i <= N; ++i) { n addEd(i - 1, i, 1); n addEd(i, i - 1, 1); n } n for (int i = 1; i <= 8; ++i) { n memset(dst, 0x3f, sizeof(dst)); n dst[N + i] = 0; n deque q; n q.push_back(N + i); n int mx = 0; n while (!q.empty()) { n int t = q.front(); n q.pop_front(); n if (t <= N) mx = max(mx, dst[t]); n for (auto r : nxt[t][0]) n if (dst[r] > dst[t]) { n dst[r] = dst[t]; n q.push_front(r); n } n for (auto r : nxt[t][1]) n if (dst[r] > dst[t] + 1) { n dst[r] = dst[t] + 1; n q.push_back(r); n } n } n vector node; n build(N + i); n for (int j = 1; j <= N; ++j) n if (C[j] == i) { n node.push_back(j); n if (node.size() == 64 * 50) { n solve(64 * 50, node, N + i, mx); n node.clear(); n } n } n if (node.size()) solve(node.size(), node, N + i, mx); n } n cout << ans << << num / 2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int64_t ans, n, k, m, r[100005]; n char s[100005], t[100005]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int64_t tt; n cin >> tt; n while (tt--) { n cin >> n; n cin >> s; n cin >> t; n vector ans; n m = n - 1; n int i = 0, j = n - 1; n while (i < j) { n r[m--] = i; n i++; n r[m--] = j; n j--; n } n if (i == j) r[m] = i; n m = 0; n for (int i = n - 1; i >= 0; i--) { n if ((s[r[i]] - 0 + m) % 2 == t[i] - 0 ) ans.push_back(1); n ans.push_back(i + 1); n m++; n } n cout << (int)ans.size() << ; n for (auto i : ans) cout << i << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector a; n int k, t, n, mx; n string s; n int main() { n cin >> n >> k; n cin >> s; n for (int i = 0; i < s.size(); i++) n if (s[i] == . ) a.push_back(i); n for (int i = 0; i < a.size() - 1; i++) mx = max(mx, a[i + 1] - a[i]); n if (mx > k) n cout << NO ; n else n cout << YES ; n } n "} +{"func_code_string": "#include n using namespace std; n int w; n long long n, k; n pair o = {0, 0}; n pair csop(long long kezd, long long kim) { n long long sum = 0, kov = kezd + k; n if (kezd <= kim && kim <= kov) { n kov++; n } n sum = (kov - kezd) * (kov - kezd - 1) / 2; n if (log(k) + log(kezd) < 42.0) { n sum += kezd * (kov - kezd); n } else { n sum = 2e18; n } n if (kezd <= kim && kim < kov) { n sum -= kim; n } n return {sum, kov}; n } n pair calc(long long ert) { n if (ert <= k * (k + 1) / 2) { n return {1, k * (k + 1) / 2}; n } n long long kis = ert / k - k / 2; n auto s = calc(kis); n long long fi = s.first, se = s.second; n long long s2 = kis, kor = 0, ert2 = 0; n s2 -= (fi - 1) * (k + 1), kor += fi - 1, ert2 = (fi - 1) * (k + 1); n long long ss = (s2 + k - 2) / k; n kor += ss, ert2 += ss * k; n ert2++, kor++; n if (ert2 >= se) { n ert2++; n } n auto cs = csop(ert2, se); n if (cs.first < ert) { n ert2 = cs.second, kor++; n cs = csop(ert2, se); n } n return {kor, cs.first}; n } n int main() { n ios_base::sync_with_stdio(false); n cin >> w; n while (w--) { n cin >> n >> k; n if (n <= k) { n cout << n << n ; n continue; n } n if (k == 2 && n <= 5) { n cout << n << n ; n continue; n } n auto s = calc(n); n if (s.second == n) { n cout << s.first * (k + 1) << n ; n } else { n long long fi = s.first, ans = fi * (k + 1); n n -= fi * (k + 1) - 1; n ans += (k + 1) * (n / k) + n % k; n if (n % k == 0) { n ans--; n } n cout << ans << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int cl[5000010], cr[5000010], ld[5000010], sl = 1; n bool yz[5000010]; n void pushd(int x) { n if (cl[x] == 0) { n cl[x] = ++sl; n yz[cl[x]] = 1; n } n if (cr[x] == 0) { n cr[x] = ++sl; n yz[cr[x]] = 1; n } n yz[x] = 0; n if (ld[x] == 0) return; n ld[cl[x]] = ld[cr[x]] = ld[x]; n ld[x] = 0; n } n vector cf[50010], ve[5000010]; n void addqj(int i, long long l, long long r, long long L, long long R, int x) { n if (R <= l || r <= L) return; n if (L <= l && r <= R) { n ld[i] = x; n cf[x].push_back(i); n return; n } n long long m = (l + r) >> 1; n pushd(i); n addqj(cl[i], l, m, L, R, x); n addqj(cr[i], m, r, L, R, x); n } n void link(int x, int y) { n if (yz[x] && yz[y]) { n if (ld[x] < ld[y]) n ve[x].push_back(y); n else n ve[y].push_back(x); n return; n } n link(yz[x] ? x : cl[x], yz[y] ? y : cl[y]); n link(yz[x] ? x : cr[x], yz[y] ? y : cr[y]); n } n int find(int i, long long l, long long r, long long x) { n if (yz[i]) return i; n long long m = (l + r) >> 1; n return x < m ? find(cl[i], l, m, x) : find(cr[i], m, r, x); n } n int lx[50010], fa[5000010], ans[50010]; n long long A[50010], B[50010]; n int getv(int x) { return x == fa[x] ? x : fa[x] = getv(fa[x]); } n void merge(int x, int y) { n x = getv(x); n y = getv(y); n if (x != y) fa[x] = y; n } n int main() { n int n, m; n scanf( %d%d , &n, &m); n ld[1] = m + 1; n yz[1] = 1; n for (int i = 1; i <= m; i++) { n char zf[10]; n scanf( %s%lld%lld , zf, &A[i], &B[i]); n lx[i] = zf[0] == b ? 0 : 1; n if (lx[i] == 0) addqj(1, 0, (1ll << n), A[i], B[i] + 1, i); n } n for (int i = 1; i <= sl; i++) { n fa[i] = i; n if (!yz[i]) link(cl[i], cr[i]); n } n for (int i = 1; i <= sl; i++) { n if (ld[i] != m + 1) continue; n for (int j = 0; j < ve[i].size(); j++) merge(i, ve[i][j]); n } n for (int i = m; i >= 1; i--) { n if (lx[i]) n ans[i] = (getv(find(1, 0, (1ll << n), A[i])) == n getv(find(1, 0, (1ll << n), B[i]))); n else { n for (int x = 0; x < cf[i].size(); x++) { n int u = cf[i][x]; n for (int y = 0; y < ve[u].size(); y++) merge(u, ve[u][y]); n } n } n } n for (int i = 1; i <= m; i++) { n if (lx[i]) printf( %d n , ans[i]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 15; n long long Get_Num(int num[], int b, int n) { n long long number = 0; n long long in = 1; n for (int i = n - 1; i >= 0; i--) { n number += num[i] * in; n in = in * b; n } n return number; n } n int main() { n int x[N], y[N]; n int b; n int n; n long long X, Y; n cin >> n >> b; n for (int i = 0; i < n; i++) { n cin >> x[i]; n } n X = Get_Num(x, b, n); n cin >> n >> b; n for (int i = 0; i < n; i++) { n cin >> y[i]; n } n Y = Get_Num(y, b, n); n if (X == Y) { n printf( = n ); n } else if (X > Y) { n printf( > n ); n } else { n printf( < n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n long n, m; n cin >> n >> m; n long sum = 0; n if (n == 1 || n == 2) { n if (n == 1) n cout << 0 << endl; n else n cout << m << endl; n } else { n cout << 2 * m << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n long long n, m; n int k; n int mpow(int a, long long b) { n int c = 1; n for (; b; b >>= 1, a = 1ll * a * a % mod) n if (b & 1) c = 1ll * c * a % mod; n return c; n } n int main() { n scanf( %lld%lld%d , &n, &m, &k); n if ((n + m) & 1) n if (k == -1) { n printf( 0 n ); n return 0; n } n int tmp = mpow(2, n - 1); n printf( %d n , mpow(tmp, m - 1)); n } n "} +{"func_code_string": "#include n using namespace std; n int tt(char p) { n int s; n if (p == > ) n s = 8; n else if (p == < ) n s = 9; n else if (p == + ) n s = 10; n else if (p == - ) n s = 11; n else if (p == . ) n s = 12; n else if (p == , ) n s = 13; n else if (p == [ ) n s = 14; n else n s = 15; n return s; n } n int main() { n string x; n int t = 0; n int q = x.length() - 1; n cin >> x; n for (int i = 0; i < x.length(); ++i) { n t = (t * 16 + tt(x[i])) % 1000003; n } n cout << t; n return 0; n } n "} +{"func_code_string": "#include n template n inline T MIN(T a, T b) { n return a < b ? a : b; n } n template n inline T MAX(T a, T b) { n return a > b ? a : b; n } n using namespace std; n void reop() { freopen( input.txt , r , stdin); } n int a[100001] = {0}; n int ans = 0, curans = 0; n bool test(int div, int n, int start) { n int prev = start; n for (int i = 2; i < n; ++i) { n if (a[i] == prev + div) n prev = a[i]; n else if (a[i] + 1 == prev + div) { n prev = a[i] + 1; n curans++; n } else if (a[i] - 1 == prev + div) { n prev = a[i] - 1; n curans++; n } else n return false; n } n ans = MIN(ans, curans); n return true; n } n int main() { n int n; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n if (n == 1 || n == 2) { n cout << 0; n return 0; n } n ans = 1000000007; n for (int i = -1; i <= 1; ++i) { n for (int j = -1; j <= 1; ++j) { n curans = 0; n int div = a[1] + j - (a[0] + i); n if (j) curans++; n if (i) curans++; n test(div, n, a[1] + j); n } n } n cout << (ans == 1000000007 ? -1 : ans); n return 0; n } n "} +{"func_code_string": "#include n #define int long long n #define pii pair n #define F first n #define S second n #define pi acos(-1.0) n #define pb push_back n #define sf(x) scanf( %lld ,&x) n #define pf(x) printf( %lld ,&x) n using namespace std; n const int mod=1e9+7; n int a1[2000],ar[2000],ff[2000] ; n mapmp,mk ; n int bigmod(int a , int b) n { n if(b==0) return 1 ; n int x = bigmod(a,b/2) ; n x=((x%mod)*(x%mod))%mod ; n if(b%2) x=((x%mod)*(a%mod))%mod ; n return x ; n } n int ncr(int a , int b) n { n int p=(ff[a-b]*ff[b])%mod ; n p=(ff[a]*bigmod(p,mod-2)) ; p%=mod ; n return p ; n } n int32_t main() n { n ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ; n ff[0]=1 ; ff[1]=1 ; n for(int i = 2 ; i <= 1000 ; i++) ff[i]=(ff[i-1]*i)%mod ; n int t ; cin>>t ; n while(t--) n { n int n,k,mx=0 ; cin>>n>>k ; mp.clear() ; mk.clear() ; n setst ; n for(int i = 1 ; i <= n ; i++){cin>>ar[i] ; mp[ar[i]]++ ; a1[i]=ar[i] ; } n sort(a1+1,a1+n+1) ; reverse(a1+1,a1+n+1) ; n // for(int i = 1 ; i <= n ; i++) cout< n using namespace std; n const int N = 2e5 + 2, M = 1e9 + 7; n int tt = 1, n, k; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> tt; n while (tt--) { n cin >> n; n if (n == 1) { n cout << a n ; n continue; n } n string second = , ans = ; n for (int i = 0; i < n / 2 - 1; i++) second += a ; n ans += a + second + b + second; n if (n & 1) ans += c ; n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e5 + 7; n const long long inf = 1e17 + 7; n pair a[maxn]; n pair A[maxn]; n pair, pair > S[maxn]; n int pos; n inline long long elf(pair z, long long x) { n return z.first * x + z.second; n } n inline long long earl(pair z, long long v) { n long long a = z.first, b = z.second; n long long x = (v - b) / a; n if (a * x >= v - b) return x; n return x + 1; n } n inline long double intx(pair l1, n pair l2) { n long long a1 = l1.first, a2 = l2.first, b1 = l1.second, b2 = l2.second; n return (long double)(b2 - b1) / (long double)(a1 - a2); n } n void ins(long long a, long long b) { n while (pos >= 2 && intx(S[pos].first, S[pos - 1].first) >= n intx(make_pair(a, b), S[pos].first)) n pos--; n S[pos].second.second = ceil(intx(S[pos].first, make_pair(a, b))) - 1; n pos++; n S[pos] = n make_pair(make_pair(a, b), n make_pair(ceil(intx(S[pos - 1].first, make_pair(a, b))), inf)); n } n int main() { n int n; n long long s; n scanf( %d %lld , &n, &s); n for (int i = 1; i <= n; i++) { n scanf( %lld %lld , &a[i].first, &a[i].second); n } n sort(a + 1, a + n + 1); n a[0].first = -1; n long long cur = -1; n long long best = inf; n int idx = 0; n for (int i = n; i >= 0; i--) { n if (a[i].first != cur) { n if (cur > 0) { n idx++; n A[idx] = make_pair(cur, best); n } n cur = a[i].first; n best = inf; n } n best = min(best, a[i].second); n } n n = idx; n for (int i = 1; i <= n; i++) a[i] = A[i]; n best = inf; n idx = 0; n for (int i = 1; i <= n; i++) { n if (a[i].second >= best) continue; n idx++; n A[idx] = a[i]; n best = min(best, a[i].second); n } n n = idx; n reverse(A + 1, A + n + 1); n long long ans = inf; n pos = 1; n S[pos] = make_pair(make_pair(A[1].first, 0), make_pair(0, inf)); n int fp = 1; n for (int i = 2; i <= n; i++) { n while (fp < pos && elf(S[fp].first, S[fp].second.second) < A[i].second) n fp++; n long long cx = earl(S[fp].first, A[i].second); n long long fcx = elf(S[fp].first, cx); n ins(A[i].first, fcx - A[i].second - A[i].first * cx); n fp = min(fp, pos); n } n for (int i = 1; i <= pos; i++) { n ans = min(ans, earl(S[i].first, s)); n } n printf( %lld n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 3; n const long long int M = 1000000007; n void solve() { n string s; n cin >> s; n int n = s.length(); n for (int i = 0; i < n - 1; ++i) { n s += 0 ; n } n long long int ans = 0; n for (int i = 0; i < 2 * (n - 1) + 1; ++i) { n ans += ans + s[i] - 0 ; n ans %= M; n } n cout << ans; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n solve(), cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct like { n int id; n int change = 0; n }; n int main() { n int n, s, max = 0, idmax = 0, count = 0, k = 0; n cin >> n; n like *A = new like[n]; n for (int i = 0; i < n; i++) { n cin >> s; n k = 1; n for (int j = 0; j < count; j++) { n if (A[j].id == s) { n A[j].change++; n k = 0; n if (A[j].change > max) { n max = A[j].change; n idmax = A[j].id; n } n } n } n if (k == 1) { n A[count].id = s; n A[count].change++; n if (A[count].change > max) { n max = A[count].change; n idmax = A[count].id; n } n count++; n } n } n cout << idmax << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int H[100000][5], V[100000][5]; n long long dp[32]; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n, m; n cin >> n >> m; n for (int i = 1; i < m; ++i) n for (int j = 0; j < n; ++j) cin >> H[i][j]; n for (int i = 0; i < m; ++i) n for (int j = 0; j < n; ++j) cin >> V[i][j]; n for (int i = 1; i < (1 << n); ++i) dp[i] = 1e18; n const int sz = 1 << n; n for (int i = 1; i < m; ++i) { n for (int j = 0; j < sz; ++j) { n for (int k = 0; k < n; ++k) { n if (!(j & (1 << k))) { n auto &t = dp[j | (1 << k)]; n const auto &nt = dp[j] + H[i][k]; n if (nt < t) t = nt; n } n } n for (int k = 0; k < n; ++k) { n if ((((j >> k)) ^ ((j >> ((k + 1) % n)))) & 1) dp[j] += V[i][k]; n } n } n } n cout << dp[sz - 1] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int arr[100000], arr1[100000], arr2[100000]; n int main() { n int n, flag = 0; n cin >> n; n multiset m; n multiset::iterator it; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n m.insert(arr[i]); n if (i == 0) n arr1[i] = arr[i]; n else n arr1[i] = arr1[i - 1] + arr[i]; n } n for (int i = n - 1; i >= 0; i--) { n if (i == n - 1) n arr2[n - 1 - i] = arr[i]; n else n arr2[n - 1 - i] = arr2[n - 2 - i] + arr[i]; n } n if (arr1[n - 1] % 2 != 0) n cout << NO ; n else { n long long int sum = arr1[n - 1] / 2; n it = m.find(arr[0]); n m.erase(it); n if (arr1[0] == sum || arr2[0] == sum) flag = 1; n if (!flag) { n for (int i = 1; i < n - 1; i++) { n if (m.find(sum - arr1[i - 1]) != m.end()) { n flag = 1; n break; n } n if (!flag) { n int low = i + 1, high = n - 1; n while (low < high) { n int mid = low + (high - low + 1) / 2; n if (arr1[mid] - arr1[i] + arr1[i - 1] > sum) n high = mid - 1; n else n low = mid; n } n if (arr1[low] - arr1[i] + arr1[i - 1] == sum) { n flag = 1; n break; n } n } n it = m.find(arr[i]); n m.erase(it); n } n } n m.clear(); n if (!flag) { n for (int i = 0; i < n; i++) m.insert(arr[i]); n it = m.find(arr[n - 1]); n m.erase(it); n for (int i = 1; i < n - 1; i++) { n if (m.find(sum - arr2[i - 1]) != m.end()) { n flag = 1; n break; n } n int low = i + 1, high = n - 1; n while (low < high) { n int mid = low + (high - low + 1) / 2; n if (arr2[mid] - arr2[i] + arr2[i - 1] > sum) n high = mid - 1; n else n low = mid; n } n if (arr2[low] - arr2[i] + arr2[i - 1] == sum) { n flag = 1; n cout << i << endl; n break; n } n it = m.find(arr[n - 1 - i]); n m.erase(it); n } n } n if (flag) n cout << YES ; n else n cout << NO ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const ll MOD = 1e9 + 7; n void dfs(int node, vector>>& adj, vector& vu, n ll& cnt) { n for (auto& p : adj[node]) { n if (!vu[p.first] and p.second == 0) { n vu[p.first] = true; n ++cnt; n dfs(p.first, adj, vu, cnt); n } n } n } n ll getPow(ll a, ll p) { n ll ret = 1, cp = a; n while (p) { n if (p & 1) ret = (ret * cp) % MOD; n p >>= 1; n cp = (cp * cp) % MOD; n } n return ret; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n, k, a, b, c; n cin >> n >> k; n vector>> adj(n + 1); n for (int i = 1; i < n; ++i) { n cin >> a >> b >> c; n adj[a].emplace_back(b, c); n adj[b].emplace_back(a, c); n } n vector vu(n + 1); n ll ans = getPow(n, k); n for (int i = 1; i <= n; ++i) { n if (!vu[i]) { n ll tmp = 1; n vu[i] = true; n dfs(i, adj, vu, tmp); n ans = (ans - getPow(tmp, k)) % MOD; n } n } n cout << (ans + MOD) % MOD; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, v[5000]; n char a[5000][5050]; n bool dfs(int x, int from) { n v[x] = 1; n for (int y = 0; y < n; y++) n if (a[x][y] == 1 ) { n if (!v[y]) { n if (dfs(y, x)) return true; n } else { n if (a[y][from] == 1 ) { n printf( %d %d %d n , y + 1, from + 1, x + 1); n return true; n } n } n } n return false; n } n int main() { n scanf( %d , &n); n gets(a[0]); n for (int i = 0; i < n; i++) gets(a[i]); n for (int i = 0; i < n; i++) n if (!v[i]) n if (dfs(i, -1)) return 0; n puts( -1 ); n } n "} +{"func_code_string": "#include n const double EPS = 0.0000000001; n const long long mod1 = 998244353; n const long long mod2 = 1000000007; n const long long mod3 = 1000000009; n const long long mod4 = 998244353; n const long long inf = 10000000000000000; n using namespace std; n signed main() { n cin.tie(0); n cout.tie(0); n std::ios_base::sync_with_stdio(0); n long long n, a; n cin >> n >> a; n long long matrix[a][n]; n for (long long i = 0; i < a; i++) { n for (long long z = 0; z < n; z++) { n char c; n cin >> c; n matrix[i][z] = (c - 0 ); n } n } n bool used[a]; n for (long long i = 0; i < a; i++) { n bool p = 0; n for (long long z = 0; z < n; z++) { n if (!matrix[i][z]) p = 1; n } n used[i] = p; n } n long long c = 0; n long long x = 1; n long long maxi = -1; n for (long long i = 0; i < a; i++) { n if (used[i]) { n c++; n continue; n } n maxi = max(maxi, c); n c = 0; n } n maxi = max(maxi, c); n cout << maxi; n } n "} +{"func_code_string": "#include n using namespace std; n pair x[1024], y[1024]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> x[i].first >> x[i].second; n y[i].first = x[i].first; n y[i].second = x[i].second; n } n sort(x, x + n, [](const pair& a, const pair& b) { n return a.first < b.first || (a.first == b.first && a.second < b.second); n }); n sort(y, y + n, [](const pair& a, const pair& b) { n return a.second < b.second || (a.second == b.second && a.first < b.first); n }); n string ans = ; n int r = 0, c = 0; n for (int i = 0; i < n; i++) { n if (x[i] != y[i]) { n cout << NO << endl; n ans = ; n break; n } else { n ans += string(x[i].first - r, R ); n ans += string(x[i].second - c, U ); n r = x[i].first; n c = x[i].second; n } n } n if (!ans.empty()) { n cout << YES << endl << ans << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[123456]; n int main() { n scanf( %s , s); n stack > st; n int best = 0, rr = -1; n int sqb = 0; n for (int i = 0; s[i]; ++i) { n if (s[i] == ( || s[i] == [ ) { n st.push(make_pair(i, sqb)); n sqb = 0; n } else if (s[i] == ) ) { n if (st.size() > 0 && s[st.top().first] == ( ) { n sqb += st.top().second; n if (best < sqb) { n best = sqb; n rr = i; n } n st.pop(); n } else { n stack >().swap(st); n sqb = 0; n } n } else if (s[i] == ] ) { n if (st.size() > 0 && s[st.top().first] == [ ) { n sqb += st.top().second + 1; n if (best < sqb) { n best = sqb; n rr = i; n } n st.pop(); n } else { n stack >().swap(st); n sqb = 0; n } n } n } n s[rr + 1] = 0; n int ll = rr; n stack out; n for (int i = rr; i >= 0; --i) { n if (s[i] == ) || s[i] == ] ) { n out.push(i); n } else if (s[i] == ( ) { n if (out.size() > 0 && s[out.top()] == ) ) { n ll = i; n out.pop(); n } else n break; n } else if (s[i] == [ ) { n if (out.size() > 0 && s[out.top()] == ] ) { n ll = i; n out.pop(); n } else n break; n } n } n while (out.size() > 0) { n ll = out.top() + 1; n out.pop(); n } n printf( %d n , best); n puts(s + ll); n return 0; n } n "} +{"func_code_string": "#include n template n struct modnum { n static constexpr int MOD = MOD_; n static_assert(MOD_ > 0, MOD must be positive ); n n private: n using ll = long long; n int v; n static int minv(int a, int m) { n a %= m; n assert(a); n return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a); n } n n public: n modnum() : v(0) {} n modnum(ll v_) : v(int(v_ % MOD)) { n if (v < 0) v += MOD; n } n explicit operator int() const { return v; } n friend std::ostream& operator<<(std::ostream& out, const modnum& n) { n return out << int(n); n } n friend std::istream& operator>>(std::istream& in, modnum& n) { n ll v_; n in >> v_; n n = modnum(v_); n return in; n } n friend bool operator==(const modnum& a, const modnum& b) { n return a.v == b.v; n } n friend bool operator!=(const modnum& a, const modnum& b) { n return a.v != b.v; n } n modnum inv() const { n modnum res; n res.v = minv(v, MOD); n return res; n } n friend modnum inv(const modnum& m) { return m.inv(); } n modnum neg() const { n modnum res; n res.v = v ? MOD - v : 0; n return res; n } n friend modnum neg(const modnum& m) { return m.neg(); } n modnum operator-() const { return neg(); } n modnum operator+() const { return modnum(*this); } n modnum& operator++() { n v++; n if (v == MOD) v = 0; n return *this; n } n modnum& operator--() { n if (v == 0) v = MOD; n v--; n return *this; n } n modnum& operator+=(const modnum& o) { n v += o.v; n if (v >= MOD) v -= MOD; n return *this; n } n modnum& operator-=(const modnum& o) { n v -= o.v; n if (v < 0) v += MOD; n return *this; n } n modnum& operator*=(const modnum& o) { n v = int(ll(v) * ll(o.v) % MOD); n return *this; n } n modnum& operator/=(const modnum& o) { return *this *= o.inv(); } n friend modnum operator++(modnum& a, int) { n modnum r = a; n ++a; n return r; n } n friend modnum operator--(modnum& a, int) { n modnum r = a; n --a; n return r; n } n friend modnum operator+(const modnum& a, const modnum& b) { n return modnum(a) += b; n } n friend modnum operator-(const modnum& a, const modnum& b) { n return modnum(a) -= b; n } n friend modnum operator*(const modnum& a, const modnum& b) { n return modnum(a) *= b; n } n friend modnum operator/(const modnum& a, const modnum& b) { n return modnum(a) /= b; n } n }; n int main() { n using namespace std; n ios_base::sync_with_stdio(false), cin.tie(nullptr); n using num = modnum; n int Q; n cin >> Q; n string A; n cin >> A; n vector dp(int(A.size()) + 1, num(1)); n Q--; n while (Q--) { n string B; n cin >> B; n vector ndp(int(B.size()) + 1, num(0)); n int Asize = int(A.size()); n int Bsize = int(B.size()); n int L = max(Asize + 1, Bsize + 1); n A.resize(L + 1, $ ); n B.resize(L + 1, % ); n dp.resize(L + 1, num(0)); n ndp.resize(L, num(0)); n vector, 2>> pref_dp(L); n pref_dp[0][0][0]++; n for (int i = 0; i < L; i++) { n for (int z : {0, 1}) { n pref_dp[i][1][z] += dp[i] * pref_dp[i][0][z]; n } n if (i + 1 == L) break; n for (int z : {0, 1}) { n pref_dp[i + 1][z][1] += pref_dp[i][z][1]; n if (A[i + z] == B[i]) { n pref_dp[i + 1][z][0] += pref_dp[i][z][0]; n } else if (A[i + z] < B[i]) { n pref_dp[i + 1][z][1] += pref_dp[i][z][0]; n } n } n } n bool suff_less = true; n num ways_suff = num(0); n num ways_suff_less = num(0); n for (int i = L - 1; i >= 0; i--) { n ways_suff += dp[i + 1]; n if (suff_less) { n ways_suff_less += dp[i + 1]; n } n if (A[i] < B[i + 1]) { n ways_suff_less = ways_suff; n } else if (A[i] > B[i + 1]) { n ways_suff_less = 0; n } n if (A[i + 1] != B[i + 1]) { n suff_less = A[i + 1] < B[i + 1]; n } n ndp[i] += ways_suff_less * pref_dp[i][0][0]; n ndp[i] += suff_less * pref_dp[i][1][0]; n ndp[i] += ways_suff * pref_dp[i][0][1]; n ndp[i] += pref_dp[i][1][1]; n } n A.resize(Asize); n B.resize(Bsize); n dp.resize(Asize + 1); n ndp.resize(Bsize + 1); n A = std::move(B); n dp = std::move(ndp); n } n num ans = accumulate(dp.begin(), dp.end(), num(0)); n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dx[] = {0, 0, 1, -1}; n int dy[] = {-1, 1, 0, 0}; n template n T power(T N, T P) { n return (P == 0) ? 1 : N * power(N, P - 1); n } n template n T gcd(T a, T b) { n if (b == 0) return a; n return gcd(b, a % b); n } n struct debugger { n template n debugger& operator,(const T& v) { n cerr << v << ; n return *this; n } n } dbg; n void make_unique(vector& a) { n sort(a.begin(), a.end()); n a.erase(unique(a.begin(), a.end()), a.end()); n } n int on(int n, int pos) { return n = n | (1 << pos); } n void off(int& n, int pos) { n = n & ~(1 << pos); } n bool check(int n, int pos) { return (bool)(n & (1 << pos)); } n const int N = 1e5 + 10; n const int M = 64; n int id, cnt[M * N], a[N * M][5]; n int new_node() { n for (int i = 0; i < 3; i++) { n a[id][i] = -1; n } n cnt[id] = 0; n return id++; n } n vector bit(70); n void make(long long int x) { n bit.clear(); n int i = 0; n while (x) { n bit.push_back(x % 2); n x /= 2LL; n i++; n } n while (i < M - 1) { n bit.push_back(0LL); n i++; n } n reverse(bit.begin(), bit.end()); n } n void add(long long int x) { n make(x); n int cur = 0, typ; n for (int i = 0; i < M; i++) { n typ = bit[i]; n if (a[cur][typ] == -1) { n a[cur][typ] = new_node(); n } n cur = a[cur][typ]; n ++cnt[cur]; n } n } n void del(long long int x) { n make(x); n int cur = 0, typ; n for (int i = 0; i < M; i++) { n typ = bit[i]; n cur = a[cur][typ]; n --cnt[cur]; n } n } n long long int query(long long int x) { n make(x); n int cur = 0, typ; n long long int ans = 0LL; n for (int i = 0; i < M; i++) { n typ = bit[i]; n if (cnt[a[cur][!typ]] > 0) { n ans += (1LL << (M - i - 2)); n cur = a[cur][!typ]; n } else { n if (a[cur][typ] == -1) return ans; n cur = a[cur][typ]; n } n } n return ans; n } n long long int arr[N]; n int main() { n int n; n while (scanf( %d , &n) != EOF) { n id = 0; n new_node(); n for (__typeof(n) i = 1; i <= n; i++) { n scanf( %lld , &arr[i]); n } n long long int xr = 0LL; n for (int i = n; i >= 1; i--) { n xr ^= arr[i]; n add(xr); n } n long long int mx = 0LL; n long long int nw = 0LL; n mx = max(mx, query(nw)); n for (int i = 1; i <= n; i++) { n nw ^= arr[i]; n mx = max(mx, query(nw)); n del(xr); n xr ^= arr[i]; n } n printf( %lld n , mx); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t > 0) { n t--; n string s, x; n cin >> s; n x.push_back(s[0]); n for (int i = 1; i < s.size(); i++) { n if (i % 2 != 0) x.push_back(s[i]); n } n cout << x << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int q = 1, i, j; n while (q--) { n int n, r; n cin >> r >> n; n vector t(n + 1), x(n + 1), y(n + 1); n t[0] = 0, x[0] = 1, y[0] = 1; n for (i = 1; i < (n + 1); i++) { n cin >> t[i] >> x[i] >> y[i]; n } n vector dp(n + 1, INT_MIN), pref(n + 1, INT_MIN); n dp[0] = 0; n for (i = 1; i < (n + 1); i++) { n dp[i] = 1 + pref[max(i - 2 * r, 0)]; n for (j = max(0, i - 2 * r + 1); j < (i); j++) { n if (t[i] - t[j] >= abs(x[i] - x[j]) + abs(y[i] - y[j])) { n dp[i] = max(dp[i], dp[j] + 1); n } n } n pref[i] = max({dp[i], pref[i - 1], 0}); n } n cout << pref[n] << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n int n, m, a; n cin >> n >> m; n int l = 1, mx = 0; n for (int i = 0; i < n; i++) { n cin >> a; n if ((a + m - 1) / m >= mx) { n mx = (a + m - 1) / m; n l = i + 1; n } n } n cout << l << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long const M = 2000 + 10, M2 = 1e7 + 10, mod = 1e9 + 7, inf = 1e9 + 10, n sq = 450; n long long a[M][M], ro[M], col[M], all[M]; n int32_t main() { n long long n, ans = 0; n cin >> n; n for (long long i = 1; i <= n; i++) { n string x; n cin >> x; n for (long long j = 0; j < x.size(); j++) { n a[i][j + 1] = x[j] - 0 ; n } n } n for (long long i = 1; i <= n; i++) { n for (long long j = n; j > i; j--) { n long long good = col[j] xor ro[i]; n long long need = good xor a[i][j]; n ro[i] = ro[i] xor need; n all[i] = all[i] xor need; n col[j] = col[j] xor need; n all[j] = all[j] xor need; n ans += need; n } n } n for (long long i = 1; i <= n; i++) col[i] = 0, ro[i] = 0; n for (long long i = n; i >= 1; i--) { n for (long long j = 1; j < i; j++) { n long long good = col[j] xor ro[i]; n long long need = good xor a[i][j]; n ro[i] = ro[i] xor need; n all[i] = all[i] = all[i] xor need; n col[j] = col[j] xor need; n all[j] = all[j] xor need; n ans += need; n } n } n for (long long i = 1; i <= n; i++) { n ans += all[i] xor a[i][i]; n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e18; n int32_t main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long n, m; n cin >> n >> m; n long long a[n], b[m]; n for (long long i = 0; i < n; ++i) { n cin >> a[i]; n } n for (long long i = 0; i < m; ++i) { n cin >> b[i]; n } n long long ans = INF; n for (long long i = 0; i < n; ++i) { n long long res = -INF; n for (long long j = 0; j < n; ++j) { n if (i != j) { n for (long long k = 0; k < m; ++k) { n res = max(res, a[j] * b[k]); n } n } n } n ans = min(ans, res); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 5; n int n, x[maxn], y[maxn]; n int solve(set >& a, set >& b) { n set >::iterator itl = a.begin(), itd = b.begin(), it1; n set >::reverse_iterator itr = a.rbegin(), itu = b.rbegin(), n it2; n set > f, s; n bool chk = false; n for (int i = 0; i < a.size() - 1; ++i) { n if (next(itl)->first > itl->first + 1) { n chk = true; n for (it1 = a.begin(); it1 != next(itl); ++it1) { n f.insert({x[it1->second], it1->second}); n } n } else if (next(itd)->first > itd->first + 1) { n chk = true; n for (it1 = b.begin(); it1 != next(itd); ++it1) { n f.insert({x[it1->second], it1->second}); n } n } else if (next(itr)->first + 1 < itr->first) { n chk = true; n for (it2 = a.rbegin(); it2 != next(itr); ++it2) { n f.insert({x[it2->second], it2->second}); n } n } else if (next(itu)->first + 1 < itu->first) { n chk = true; n for (it2 = b.rbegin(); it2 != next(itu); it2++) { n f.insert({x[it2->second], it2->second}); n } n } n if (chk) { n for (auto u : f) { n s.insert({y[u.second], u.second}); n b.erase({y[u.second], u.second}); n a.erase(u); n } n return solve(a, b) + solve(f, s); n } n itl++; n itr++; n itd++; n itu++; n } n return 1; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> n; n set > xs, ys; n for (int i = 0; i < n; ++i) { n cin >> x[i] >> y[i]; n xs.insert({x[i], i}); n ys.insert({y[i], i}); n } n cout << solve(xs, ys); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int t = 1, i, j, n; n long long int p, q, temp, arr[90]; n for (j = 0; j < t; j++) { n scanf( %lld %lld , &p, &q); n scanf( %d , &n); n for (i = 0; i < n; i++) scanf( %lld , &arr[i]); n for (i = 0; i < n; i++) { n if (p / q < arr[i]) { n printf( NO n ); n break; n } n p = p - (q * arr[i]); n if (p == 0 && i != n - 1) { n printf( NO n ); n break; n } n if (i != n - 1) { n temp = p; n p = q; n q = temp; n } n } n if (p == 0 && i == n) n printf( YES n ); n else if (i == n) n printf( NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int bits = 1000; n bitset node[4 * 100060]; n long long int leftOver[4 * 100060]; n int n; n int treeSize[100060]; n vector adj[100060]; n int dfsOrder[100060]; n int o = 1; n void dfs(int curr = 1, int par = -1) { n treeSize[curr] = 1; n dfsOrder[curr] = o++; n for (int nxt : adj[curr]) { n if (nxt != par) { n dfs(nxt, curr); n treeSize[curr] += treeSize[nxt]; n } n } n } n int m; n bitset rotate(std::bitset b, unsigned k) { n b = b << (k) | b >> (m - (k)); n b = b | (b >> m); n return b; n } n void build(int pos, int bit, int id = 1, int l = 1, int r = n) { n if (l == r) { n node[id][bit] = 1; n return; n } n int mid = (l + r) >> 1; n if (pos <= mid) n build(pos, bit, id << 1, l, mid); n else n build(pos, bit, (id << 1) + 1, mid + 1, r); n node[id] = node[id << 1] | node[(id << 1) + 1]; n } n void push(int id) { n if (leftOver[id] > 0) { n leftOver[id << 1] = (leftOver[id] + leftOver[id << 1]) % m; n leftOver[(id << 1) + 1] = (leftOver[id] + leftOver[(id << 1) + 1]) % m; n leftOver[id] = 0; n } n } n void add(int val, int L, int R, int id = 1, int l = 1, int r = n) { n if (L <= l && r <= R) { n leftOver[id] = (leftOver[id] + val) % m; n return; n } n push(id); n int mid = (l + r) >> 1; n if (L <= mid) add(val, L, R, id << 1, l, mid); n if (R > mid) add(val, L, R, (id << 1) + 1, mid + 1, r); n node[id] = rotate(node[id << 1], leftOver[id << 1]) | n rotate(node[(id << 1) + 1], leftOver[(id << 1) + 1]); n } n bitset ans; n void query(int qL, int qR, int id = 1, int l = 1, int r = n) { n if (qL <= l && qR >= r) { n ans = ans | rotate(node[id], leftOver[id]); n return; n } n push(id); n int mid = (l + r) >> 1; n if (qL <= mid) query(qL, qR, id << 1, l, mid); n if (qR > mid) query(qL, qR, (id << 1) + 1, mid + 1, r); n node[id] = rotate(node[id << 1], leftOver[id << 1]) | n rotate(node[(id << 1) + 1], leftOver[(id << 1) + 1]); n } n vector primes; n vector sieve(int limit) { n vector primes; n bool in[limit + 1]; n memset(in, true, sizeof(in)); n for (int i = 2; i <= limit; i++) { n if (in[i]) { n primes.push_back(i); n for (int j = i; j <= limit; j += i) in[j] = false; n } n } n return primes; n } n int a[100060]; n int aTemp[100060]; n int addBrute(int l, int r, int x) { n for (int i = l; i < r + 1; i++) a[i] = (a[i] + x) % m; n } n bitset findBrute(int l, int r) { n bitset temp = 0; n for (int i = l; i < r + 1; i++) temp[a[i] % m] = 1; n return temp; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int q; n cin >> n >> m; n primes = sieve(m); n for (int i = 0; i < n; i++) cin >> a[i + 1]; n for (int i = 0; i < n - 1; i++) { n int x, y; n cin >> x >> y; n adj[x].push_back(y); n adj[y].push_back(x); n } n dfs(); n for (int i = 0; i < n; i++) { n build(dfsOrder[i + 1], a[i + 1] % m); n } n for (int i = 1; i < n + 1; i++) { n aTemp[dfsOrder[i]] = a[i]; n } n for (int i = 1; i < n + 1; i++) { n a[i] = aTemp[i]; n } n cin >> q; n for (int i = 0; i < q; i++) { n int t, v; n cin >> t >> v; n if (t == 1) { n int x; n cin >> x; n add(x % m, dfsOrder[v], dfsOrder[v] + treeSize[v] - 1); n } else { n ans = 0; n query(dfsOrder[v], dfsOrder[v] + treeSize[v] - 1); n int k = 0; n for (int j = 0; j < primes.size(); j++) { n if (primes[j] < m) { n if (ans[primes[j]]) { n k++; n } n } n } n cout << k << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n struct seg { n vector t; n int n; n seg(int n = 0) : t(2 * n), n(n) {} n int query(int l, int r) { n int ans = 0; n for (l += n, r += n; l < r; l >>= 1, r >>= 1) { n if (l & 1) ans += t[l++]; n if (r & 1) ans += t[--r]; n } n return ans; n } n void update(int p, int v) { n for (t[p += n] += v; p > 1; p >>= 1) { n t[p >> 1] = t[p] + t[p ^ 1]; n } n } n }; n seg s[4][11][10]; n void modify(int p, int c, int m) { n for (int i = 1; i <= 10; i++) { n s[c][i][p % i].update(p, m); n } n } n void convert(string& s) { n for (char& c : s) { n switch (c) { n case A : n c = 0; n break; n case T : n c = 1; n break; n case C : n c = 2; n break; n case G : n c = 3; n break; n } n } n } n int main() { n string k; n cin >> k; n convert(k); n for (int i = 0; i < 4; i++) { n for (int j = 1; j <= 10; j++) { n for (int l = 0; l < j; l++) { n s[i][j][l] = seg(k.size()); n } n } n } n for (int i = 0; i < k.size(); i++) { n modify(i, k[i], 1); n } n int q; n cin >> q; n while (q--) { n int op; n cin >> op; n if (op == 1) { n int x; n string c; n cin >> x >> c; n convert(c); n x--; n modify(x, k[x], -1); n k[x] = c[0]; n modify(x, k[x], 1); n } else { n int l, r; n cin >> l >> r; n l--; n string e; n cin >> e; n convert(e); n int a = 0; n for (int i = l; i < l + e.size(); i++) { n a += s[e[i - l]][e.size()][i % e.size()].query(l, r); n } n cout << a << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int d4i[4] = {-1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1}; n const int d8i[8] = {-1, -1, 0, 1, 1, 1, 0, -1}, n d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1}; n void DBG() { cout << ] << endl; } n template n void DBG(H h, T... t) { n cout << to_string(h); n if (sizeof...(t)) cout << , ; n DBG(t...); n } n template n bool umin(T& a, const T& b) { n return b < a ? a = b, 1 : 0; n } n template n bool umax(T& a, const T& b) { n return a < b ? a = b, 1 : 0; n } n int n; n vector> cards[(long long)(200002)], n need[(long long)(200002)]; n vector> valid[(long long)(200002)]; n void prepare() { n for (int i = (1), _c = (n); i <= _c; ++i) { n vector cnt(4, 0); n sort((cards[i]).begin(), (cards[i]).end(), n [](pair a, pair b) { n return a.first < b.first || n (a.first == b.first && a.second > b.second); n }); n for (auto j : cards[i]) { n if (j.first == 1 && cnt[j.first] >= 3) continue; n if (j.first == 2 && cnt[j.first] >= 1) continue; n if (j.first == 3 && cnt[j.first] >= 1) continue; n need[i].push_back(j); n ++cnt[j.first]; n } n } n for (int i = (1), _c = (n); i <= _c; ++i) { n for (int j = (0), _c = ((1ll << (((int)((need[i]).size())))) - 1); j <= _c; n ++j) { n long long cost = 0, ma = 0, dame = 0; n for (int k = (0), _c = (((int)((need[i]).size())) - 1); k <= _c; ++k) { n if ((((j) >> (k)) & 1ll)) { n cost += need[i][k].first; n dame += need[i][k].second; n umax(ma, need[i][k].second); n } n } n if (cost <= 3) { n int bonus = __builtin_popcountll(j); n valid[i].push_back({bonus, dame, ma}); n } n } n } n } n long long dp[(long long)(200002)][11]; n void test_case() { n cin >> n; n for (int i = (1), _c = (n); i <= _c; ++i) { n int k; n cin >> k; n cards[i].assign(k, {0, 0}); n for (int j = (0), _c = (k - 1); j <= _c; ++j) n cin >> cards[i][j].first >> cards[i][j].second; n } n prepare(); n for (auto i : valid[1]) umax(dp[1][i[0]], i[1]); n for (int i = (1), _c = (n - 1); i <= _c; ++i) n for (int j = (0), _c = (10); j <= _c; ++j) n if (dp[i][j] || j == 0) { n for (auto k : valid[i + 1]) { n int nxtNum = j + k[0]; n if (nxtNum < 10) n umax(dp[i + 1][nxtNum], dp[i][j] + k[1]); n else n umax(dp[i + 1][nxtNum % 10], dp[i][j] + k[1] + k[2]); n } n } n long long ans = 0; n for (int i = (0), _c = (10); i <= _c; ++i) umax(ans, dp[n][i]); n cout << ans << n ; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n auto time = clock(); n int test = 1; n while (test--) { n test_case(); n } n cerr << [It took << fixed << setprecision(3) n << double(clock() - time) / CLOCKS_PER_SEC << s] n << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void Get(int &T) { n char C; n bool F = 0; n for (; C = getchar(), C < 0 || C > 9 ;) n if (C == - ) F = 1; n for (T = C - 0 ; C = getchar(), C >= 0 && C <= 9 ; T = T * 10 + C - 0 ) n ; n F && (T = -T); n } n int N; n void Init() { Get(N); } n int T[55][55]; n void Mul(int A[][55], int B[][55], int N, int K, int M) { n for (int i = 1; i <= N; i++) n for (int j = 1; j <= M; j++) { n T[i][j] = 0; n for (int k = 1; k <= K; k++) (T[i][j] ^= (A[i][k] & B[k][j])); n } n for (int i = 1; i <= N; i++) n for (int j = 1; j <= M; j++) A[i][j] = T[i][j]; n } n int A[55][55]; n int B[55][55]; n int T2[55][55]; n void Pow(int X[][55], long long P) { n for (int i = 1; i <= N; i++) n for (int j = 1; j <= N; j++) T2[i][j] = (i == j); n for (; P; P >>= 1) { n if (P & 1) Mul(T2, X, N, N, N); n Mul(X, X, N, N, N); n } n for (int i = 1; i <= N; i++) n for (int j = 1; j <= N; j++) X[i][j] = T2[i][j]; n } n long long Factor[100005]; n int FactorTop; n bool I() { n for (int i = 1; i <= N; i++) n for (int j = 1; j <= N; j++) n if (B[i][j] != (i == j)) return 0; n return 1; n } n bool Check() { n for (int i = 1; i <= N; i++) n for (int j = 1; j <= N; j++) B[i][j] = A[i][j]; n Pow(B, (1ll << N) - 1); n int Ans = I(); n if (Ans == 0) return 0; n for (int k = 1; k <= FactorTop; k++) { n for (int i = 1; i <= N; i++) n for (int j = 1; j <= N; j++) B[i][j] = A[i][j]; n Pow(B, ((1ll << N) - 1) / Factor[k]); n int Ans = I(); n if (Ans == 1) return 0; n } n return 1; n } n void Debug() { n FactorTop = 0; n long long X = 1ll << N; n X--; n Factor[0] = 1; n for (long long i = 2; i * i <= X; i++) { n for (;; X /= i) { n if (X % i != 0) break; n Factor[++FactorTop] = i; n } n } n if (X > 1) Factor[++FactorTop] = X; n for (int i = 1; i < N; i++) A[i + 1][i] = 1; n for (;;) { n for (int i = 1; i <= N; i++) A[i][N] = rand() & 1; n int Ans = Check(); n if (Ans) break; n } n } n void Work() { Debug(); } n void Output() { n for (int i = N; i >= 1; i--) printf( %d , A[i][N]); n puts( ); n for (int i = N; i >= 1; i--) printf( %d , 1); n puts( ); n } n int main() { n srand(time(0)); n Init(); n Work(); n Output(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long t; n long long n; n long long tmp; n long long gcd(long long a, long long b) { n long long temp; n if (a < b) { n temp = a; n a = b; n b = temp; n } n while (b != 0) { n temp = a % b; n a = b; n b = temp; n } n return a; n } n long long lcm(long long a, long long b) { n long long temp_lcm; n temp_lcm = a * b / gcd(a, b); n return temp_lcm; n } n int main() { n cin >> t; n while (t--) { n cin >> n; n if (n % 2 == 0) { n long long a, b; n tmp = n / 2; n while (tmp--) { n cin >> a >> b; n cout << b << << -a << ; n } n cout << endl; n } else { n long long a, b, c; n tmp = (n - 2) / 2; n while (tmp--) { n cin >> a >> b; n cout << b << << -a << ; n } n cin >> a >> b >> c; n tmp = lcm(a, b); n tmp = lcm(tmp, c); n cout << tmp / a << << tmp / b << << -2 * tmp / c; n cout << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n int max = 0, min = 0; n int a[m], b[m]; n for (int i = 0; i < m; i++) { n cin >> a[i]; n b[i] = a[i]; n } n sort(a, a + m, greater()); n for (int i = 0; i < n; i++) { n if (a[0] != 0) { n max = max + a[0]; n a[0] = a[0] - 1; n sort(a, a + m, greater()); n } else { n break; n } n } n sort(b, b + m); n int i = 0, k = 0; n while (i != n) { n if (b[k] != 0) { n min = min + b[k]; n b[k] = b[k] - 1; n } else { n k++; n min = min + b[k]; n b[k] = b[k] - 1; n } n i++; n } n cout << max << << min; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool isPrime[1000005] = {false}; n vector SPF(1000005); n long long int fastPower(long long int a, long long int b) { n if (b == 0) return 1; n long long int prod = 1; n while (b > 0) { n if (b & 1) prod = prod * a; n b = b >> 1; n a = a * a; n } n return prod; n } n void sieve() { n int i; n for (i = 2; i < 1000005; ++i) isPrime[i] = 1; n for (i = 2; i * i < 1000005; ++i) { n if (isPrime[i]) { n for (int j = i * i; j < 1000005; j += i) isPrime[j] = 0; n } n } n } n void printa(bool f) { n if (f) n cout << YES ; n else n cout << NO ; n cout << n ; n } n bool flip(bool f) { n if (f) return 0; n return 1; n } n void solve() { n long long int i, n; n cin >> n; n vector a(n); n for (i = 0; i < n; ++i) cin >> a[i]; n sort(a.begin(), a.end()); n long long int s = 0, m = a[n - 1]; n for (i = 0; i < n - 1; ++i) s += a[i]; n cout << abs(m - s) + 1 << n ; n } n int main() { n int tc = 1; n while (tc--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int m, n, p, count = 0; n cin >> m >> n; n if (m % n == 0) n cout << m / n; n else { n count = count + (m / n); n m = m % n; n for (;;) { n if (m > n) { n if (m % n == 0) { n count += m / n; n break; n } n m = m - n; n count++; n } else if (n > m) { n if (n % m == 0) { n count += n / m; n break; n } n n = n - m; n count++; n } n } n cout << count; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 5; n const int MAXM = 20; n int n, m; n int a[MAXN], b[MAXM]; n int num[MAXM]; n char ans[MAXN][MAXM]; n set states[MAXM]; n int getState(int mask, int num[MAXM]) { n int res = mask; n for (int i = 0; i < n; ++i) { n res = res * MAXN + num[i]; n } n return res; n } n bool dfs(int j, int lastState = 0) { n if (j == m) { n for (int i = 0; i < n; ++i) { n if (num[i] != a[i]) { n return false; n } n } n return true; n } n if (j) { n if (states[j].find(lastState) != states[j].end()) { n return false; n } n states[j].insert(lastState); n } n int origin[MAXM]; n memcpy(origin, num, sizeof(num)); n for (int k = 0; k < (1 << n); ++k) { n int cnt = 0; n for (int i = 0; i < n; ++i) { n if (k & (1 << i)) { n ans[i][j] = * ; n if (i == 0 || ans[i - 1][j] == . ) { n ++cnt; n } n } else { n ans[i][j] = . ; n } n } n if (cnt != b[j]) { n continue; n } n for (int i = 0; i < n; ++i) { n if (ans[i][j] == * ) { n if (j == 0 || ans[i][j - 1] == . ) { n ++num[i]; n } n } n } n bool valid = true; n for (int i = 0; i < n; ++i) { n if (num[i] > a[i]) { n valid = false; n break; n } n if (ans[i][j] == * ) { n if (a[i] - num[i] > (m - j - 1) / 2) { n valid = false; n break; n } n } else { n if (a[i] - num[i] > (m - j) / 2) { n valid = false; n break; n } n } n } n if (valid) { n if (dfs(j + 1, getState(k, num))) { n return true; n } n } n memcpy(num, origin, sizeof(origin)); n } n return false; n } n int main() { n while (cin >> n >> m) { n for (int i = 0; i < n; ++i) { n cin >> a[i]; n } n for (int i = 0; i < m; ++i) { n cin >> b[i]; n } n for (int i = 0; i < n; ++i) { n states[i].clear(); n } n memset(num, 0, sizeof(num)); n dfs(0); n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n cout << ans[i][j]; n } n cout << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100500; n const int INF = 2 * (1e9); n int n, m; n vector > edge[N]; n vector > delay[N]; n int dist[N]; n int main() { n cin.sync_with_stdio(false); n cin >> n >> m; n for (int i = 0; i < m; i++) { n int from, to, len; n cin >> from >> to >> len; n from--; n to--; n edge[from].push_back(make_pair(to, len)); n edge[to].push_back(make_pair(from, len)); n } n for (int i = 0; i < n; i++) { n int num; n cin >> num; n int cur; n for (int j = 0; j < num; j++) { n cin >> cur; n if (j == 0 or delay[i].back().second != cur) n delay[i].push_back(make_pair(cur, cur + 1)); n else n delay[i].back().second++; n } n } n for (int i = 0; i < n; i++) dist[i] = INF; n dist[0] = 0; n if (delay[0].size() >= 1 and delay[0][0].first == 0) n dist[0] = delay[0][0].second; n set > dijkstra; n dijkstra.insert(make_pair(dist[0], 0)); n for (int i = 0; i < n; i++) { n if (dijkstra.empty()) break; n pair now = *dijkstra.begin(); n dijkstra.erase(now); n for (const pair &next : edge[now.second]) { n int arrival = next.first; n int tm = next.second + now.first; n int idx = lower_bound(delay[arrival].begin(), delay[arrival].end(), n make_pair(tm, INF)) - n delay[arrival].begin(); n if (idx > 0 and arrival != n - 1) { n idx--; n if (delay[arrival][idx].first <= tm and tm < delay[arrival][idx].second) n tm = delay[arrival][idx].second; n } n if (dist[arrival] > tm) { n dijkstra.erase(make_pair(dist[arrival], arrival)); n dist[arrival] = tm; n dijkstra.insert(make_pair(dist[arrival], arrival)); n } n } n } n if (dist[n - 1] == INF) dist[n - 1] = -1; n cout << dist[n - 1] << endl; n return 0; n } n "} +{"func_code_string": "#include n #include n #include n #include n const int Maxn=200000; n const int Inf=0x3f3f3f3f; n int n; n int a[Maxn+5]; n std::vector v_lis[Maxn+5]; n struct Segment_Tree{ n struct Segment_Node{ n int minn,maxn; n int lazy; n }seg[Maxn<<2|5]; n void update_tag(int root,int a){ n seg[root].lazy+=a; n seg[root].minn+=a,seg[root].maxn+=a; n } n void push_up(int root){ n seg[root].minn=std::min(seg[root<<1].minn,seg[root<<1|1].minn); n seg[root].maxn=std::max(seg[root<<1].maxn,seg[root<<1|1].maxn); n } n void push_down(int root){ n if(seg[root].lazy==0){ n return; n } n update_tag(root<<1,seg[root].lazy); n update_tag(root<<1|1,seg[root].lazy); n seg[root].lazy=0; n } n void update(int l,int r,int v,int root=1,int left=0,int right=n){ n if(l>right||r=right){ n update_tag(root,v); n return; n } n push_down(root); n int mid=(left+right)>>1; n update(l,r,v,root<<1,left,mid); n update(l,r,v,root<<1|1,mid+1,right); n push_up(root); n } n int query_min(int l,int r,int root=1,int left=0,int right=n){ n if(l>right||r=right){ n return seg[root].minn; n } n push_down(root); n int mid=(left+right)>>1; n return std::min(query_min(l,r,root<<1,left,mid),query_min(l,r,root<<1|1,mid+1,right)); n } n int query_max(int l,int r,int root=1,int left=0,int right=n){ n if(l>right||r=right){ n return seg[root].maxn; n } n push_down(root); n int mid=(left+right)>>1; n return std::max(query_max(l,r,root<<1,left,mid),query_max(l,r,root<<1|1,mid+1,right)); n } n }seg_1,seg_2; n int ans[Maxn+5]; n int main(){ n scanf( %d ,&n); n for(int i=1;i<=n;i++){ n scanf( %d ,&a[i]); n v_lis[a[i]].push_back(i); n } n for(int i=1;i<=n;i++){ n seg_1.update(i>>1,(n-1)>>1,1); n seg_2.update((i+1)>>1,n>>1,1); n } n for(int i=1;i<=n;i++){ n for(int j=0;j<(int)v_lis[i].size();j++){ n int pos=v_lis[i][j]; n int pos_1_max=seg_1.query_max(pos>>1,(n-1)>>1); n int pos_1_min=seg_1.query_min(0,(pos>>1)-1); n int pos_2_max=seg_2.query_max((pos+1)>>1,n>>1); n int pos_2_min=seg_2.query_min(0,(pos-1)>>1); n ans[pos]=std::max(std::max((pos_2_max-pos_2_min)>>1,(pos_1_max-pos_1_min)>>1), n std::max((pos_2_max-pos_1_min-1)>>1,(pos_1_max-pos_2_min-1)>>1)); n } n for(int j=0;j<(int)v_lis[i].size();j++){ n seg_1.update(v_lis[i][j]>>1,(n-1)>>1,-2); n seg_2.update((v_lis[i][j]+1)>>1,n>>1,-2); n } n for(int j=0;j<(int)v_lis[i].size();j++){ n int pos=v_lis[i][j]; n int pos_1_min=seg_1.query_min(pos>>1,(n-1)>>1); n int pos_1_max=seg_1.query_max(0,(pos>>1)-1); n int pos_2_min=seg_2.query_min((pos+1)>>1,n>>1); n int pos_2_max=seg_2.query_max(0,(pos-1)>>1); n ans[pos]=std::max(ans[pos],std::max( n std::max((pos_2_max-pos_2_min)>>1,(pos_1_max-pos_1_min)>>1)-1, n std::max((pos_2_max-pos_1_min-1)>>1,(pos_1_max-pos_2_min-1)>>1))); n } n } n for(int i=1;i<=n;i++){ n printf( %d ,ans[i]); n } n puts( );; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector V[100005]; n int main() { n int N, M, K, ans = 1; n scanf( %d%d%d , &N, &M, &K); n for (int i = 1; i <= N; ++i) { n int c; n scanf( %d , &c); n V[c].push_back(i); n } n for (int c = 1; c <= M; ++c) { n int L = V[c].size(), rem = 0, st = 0; n for (int j = 1; j < L; ++j) { n rem += V[c][j] - V[c][j - 1] - 1; n while (rem > K) { n rem -= V[c][st + 1] - V[c][st] - 1; n ++st; n } n ans = max(ans, j - st + 1); n } n } n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n using namespace std; n int main() { n string s; n cin >> s; n string h = s.substr(0, 2); n int hour = atoi(h.c_str()); n string m = s.substr(3, 2); n int minute = atoi(m.c_str()); n long long time = 60 * hour + minute; n long long add; n cin >> add; n long long sum = time + add; n long long n = sum % (24 * 60); n cout << setfill( 0 ) << setw(2) << right << (n / 60); n cout << : ; n cout << setfill( 0 ) << setw(2) << right << (n % 60) << endl; n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[7]; n int b[7]; n int main() { n string s; n int k; n cin >> s >> k; n int kol = 0; n for (int i = 0; i < s.length(); i++) { n if (s[i] == 0 ) { n kol++; n } n } n if (kol < k) { n cout << s.length() - 1; n } else { n kol = 0; n int res = 0; n for (int i = s.length() - 1; i >= 0; i--) { n if (s[i] == 0 ) { n kol++; n } else { n res++; n } n if (kol == k) { n cout << res; n return 0; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s1[5010], s2[5010], str[5010]; n int num[30]; n int len1, len2; n int dfs(int k, int m) { n if (!s1[k]) return m; n for (int i = 0; i < 26; i++) n if (num[i] && (m || (i >= s2[k] - a ))) { n str[k] = i + a ; n num[i]--; n if (dfs(k + 1, m || (i > s2[k] - a ))) return 1; n num[i]++; n } n return 0; n } n int main() { n while (EOF != scanf( %s %s , s1, s2)) { n memset(num, 0, sizeof(num)); n len1 = strlen(s1), len2 = strlen(s2); n for (int i = 0; i < len1; i++) num[s1[i] - a ]++; n if (!dfs(0, 0)) n printf( -1 n ); n else { n printf( %s n , str); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Rectangle { n int x1; n int x2; n int y1; n int y2; n Rectangle() {} n Rectangle(int a, int b, int c, int d) { n x1 = a; n y1 = b; n x2 = c; n y2 = d; n if (x1 > x2) { n swap(x1, x2); n } n if (y1 > y2) { n swap(y1, y2); n } n } n bool operator<(Rectangle r) const { n if (x1 != r.x1) { n return x1 < r.x1; n } else if (x2 != r.x2) { n return x2 < r.x2; n } else if (y1 != r.y1) { n return y1 < r.y1; n } else { n return y2 < r.y2; n } n } n }; n int Area(Rectangle r) { return (r.x2 - r.x1) * (r.y2 - r.y1); } n set rec; n set lines; n int main() { n int W, H, N; n scanf( %d , &W); n ; n scanf( %d , &H); n ; n scanf( %d , &N); n ; n rec.insert(Rectangle(0, 0, W, H)); n for (int(n) = 0; n < (int)N; n++) { n int a, b, c, d; n scanf( %d , &a); n ; n scanf( %d , &b); n ; n scanf( %d , &c); n ; n scanf( %d , &d); n ; n lines.insert(Rectangle(a, b, c, d)); n } n for (int(n) = 0; n < (int)N; n++) { n for (__typeof(rec).begin() t = rec.begin(); t != rec.end(); t++) { n Rectangle r = *t; n for (__typeof(lines).begin() it = lines.begin(); it != lines.end(); n it++) { n if (it->x1 == it->x2) { n if (r.x1 < it->x1 && it->x2 < r.x2 && r.y1 == it->y1 && n r.y2 == it->y2) { n lines.erase(lines.find(*it)); n rec.erase(*t); n rec.insert(Rectangle(r.x1, r.y1, it->x2, r.y2)); n rec.insert(Rectangle(it->x2, r.y1, r.x2, r.y2)); n goto end; n } n } else if (it->y1 == it->y2) { n if (r.y1 < it->y1 && it->y2 < r.y2 && r.x1 == it->x1 && n r.x2 == it->x2) { n lines.erase(lines.find(*it)); n rec.erase(*t); n rec.insert(Rectangle(r.x1, r.y1, r.x2, it->y1)); n rec.insert(Rectangle(r.x1, it->y1, r.x2, r.y2)); n goto end; n } n } n } n } n end: n int sol = 42; n } n vector res; n for (__typeof(rec).begin() it = rec.begin(); it != rec.end(); it++) { n res.push_back(Area(*it)); n } n sort(res.begin(), res.end()); n for (__typeof(res).begin() it = res.begin(); it != res.end(); it++) { n printf( %d , *it); n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e3 + 10; n long long q, x, v, u, w, ans; n map len; n int main() { n cin >> q; n for (int i = 1; i <= q; i++) { n cin >> x >> v >> u; n if (x == 1) { n cin >> w; n while (v != u) { n if (v > u) { n len[v] += w; n v = v / 2; n } else { n len[u] += w; n u = u / 2; n } n } n } else { n ans = 0; n while (v != u) { n if (v > u) { n ans += len[v]; n v = v / 2; n } else { n ans += len[u]; n u = u / 2; n } n } n cout << ans << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1000000000000000000ll; n long long x[6], y[6]; n int main() { n ios_base::sync_with_stdio(0); n int n; n cin >> n; n for (int i = 0; i < n; i++) cin >> x[i] >> y[i]; n if (n == 1) { n cout << -1 << endl; n return 0; n } n if (n == 2) { n if (x[0] == x[1] || y[0] == y[1]) { n cout << -1 << endl; n return 0; n } n long long s = (abs(x[0] - x[1]) * abs(y[0] - y[1])); n cout << s << endl; n return 0; n } n long long X = 0, Y = 0; n for (int i = 1; i < n; i++) { n X = max(X, abs(x[0] - x[i])); n Y = max(Y, abs(y[0] - y[i])); n } n cout << X * Y << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const long long LINF = 0x3f3f3f3f3f3f3f3f; n const int MOD = (int)1e9 + 7; n const int N = (int)3e5 + 7; n char read_char() { n char c; n for (;;) { n c = getchar(); n if (c >= A && c <= Z ) return c; n } n } n long long powmod(long long a, long long b) { n long long res = 1; n a %= MOD; n for (; b; b >>= 1) { n if (b & 1) res = res * a % MOD; n a = a * a % MOD; n } n return res; n } n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n long long add(long long a, long long b) { n a = ((a + b) % MOD + MOD) % MOD; n return a; n } n long long mul(long long a, long long b) { return a * b % MOD; } n int n, p, cnt[N], tmp[N]; n pair a[N]; n void Init() { n memset(cnt, 0, sizeof(cnt)); n for (int i = (0); i < (n); ++i) { n int u, v; n scanf( %d%d , &u, &v); n if (u > v) swap(u, v); n a[i].first = u, a[i].second = v; n cnt[u]++; n cnt[v]++; n } n for (int i = (1); i < (n + 1); ++i) tmp[i] = cnt[i]; n sort(tmp + 1, tmp + n + 1); n sort(a, a + n); n } n int Solve() { n long long ans = 0; n for (int i = n, j = 1; j < i; i--) { n while (tmp[j] + tmp[i] < p && j < i) j++; n ans += i - j; n } n for (int i = 0, j; i < n; i = j) { n j = i + 1; n while (j < n && a[i] == a[j]) j++; n int u = a[i].first, v = a[i].second; n if (cnt[u] + cnt[v] >= p && cnt[u] + cnt[v] - (j - i) < p) { n ans--; n } n } n return !printf( %lld n , ans); n } n int main() { n while (~scanf( %d%d , &n, &p)) { n Init(); n Solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map s; n long long n, b[500005], c[500005]; n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n long long x; n cin >> x; n s[x]++; n } n long long m, mx1 = 0, mx2 = 0, index = 1; n cin >> m; n for (int i = 0; i < m; i++) { n cin >> b[i]; n } n for (int i = 0; i < m; i++) { n cin >> c[i]; n } n for (int i = 0; i < m; i++) { n if (s[b[i]] > mx1) { n mx1 = s[b[i]]; n index = i + 1; n } n } n for (int i = 0; i < m; i++) { n if (s[b[i]] == mx1) { n if (s[c[i]] > mx2) { n index = i + 1; n mx2 = s[c[i]]; n } n } n } n cout << index << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 1010; n const double EPS = 0.0000001; n struct Point { n int x, y; n Point() {} n Point(int a, int b) : x(a), y(b) {} n }; n int n; n long long k; n Point centers[MAX_N]; n int radii[MAX_N]; n double GetDist(int x1, int y1, int x2, int y2) { n return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); n } n void AddEvents(vector > &events, double ang1, double ang2) { n for (int i = 0; i < 3; ++i) { n events.push_back(make_pair(ang1 + i * 2 * M_PI + EPS, 1)); n events.push_back(make_pair(ang2 + i * 2 * M_PI - EPS, -1)); n } n } n int main() { n cin >> n >> k; n for (int i = 1; i <= n; ++i) { n int x, y; n cin >> x >> y >> radii[i]; n centers[i] = Point(x, y); n } n int best = 0; n for (int i = 1; i <= n; ++i) { n vector > events; n int cnt = 0; n for (int j = 1; j <= n; ++j) { n if (i != j) { n double ang = n atan2(centers[j].y - centers[i].y, centers[j].x - centers[i].x); n double d = n GetDist(centers[i].x, centers[i].y, centers[j].x, centers[j].y); n double u1 = asin((radii[i] - radii[j]) / d); n double u2 = asin((radii[i] + radii[j]) / d); n AddEvents(events, ang + u1 - M_PI / 2, ang + u2 - M_PI / 2); n AddEvents(events, ang - u2 + M_PI / 2, ang - u1 + M_PI / 2); n } n } n sort(events.begin(), events.end()); n for (size_t j = 0; j < events.size(); ++j) { n cnt += events[j].second; n if (cnt < 0) { n cnt = 0; n } n best = max(best, cnt); n } n } n long long sol = k * (k + 1) / 2 + (k + 1) * best + (n - best); n cout << sol << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long calc(const long long &x, const long long &pow, const long long &pp) { n long long res = 1, tmp = (x % pp); n long long cur = pow; n while (cur > 0) { n if (cur % 2 == 0) { n tmp = (tmp * tmp) % pp; n cur = cur / 2; n } else { n res = (res * tmp) % pp; n cur = cur - 1; n } n } n return res; n } n int obr() { n long long k, l, r, p; n cin >> k >> l >> r >> p; n long long ans; n if (p == 2) { n cout << (1 - (k % 2)) << endl; n return 0; n } n if (k == 1) n ans = 2 % p; n else { n long long st_l = calc(2, l, p - 1), st_r = calc(2, r + 1, p - 1); n long long rev_2 = (p + 1) / 2; n long long ch = (calc(k, st_r, p) + p - 1) % p; n long long zn = (calc(k, st_l, p) + p - 1) % p; n if (k % p == 0) zn = ch = p - 1; n if (zn == 0) { n ch = calc(2, r - l + 1, p); n } else { n zn = calc(zn, p - 2, p); n ch = (ch * zn) % p; n } n if (k % 2) { n long long to_div = calc(rev_2, r - l, p); n ch = (ch * to_div) % p; n } n ans = ch; n } n cout << ans << endl; n return 0; n } n int main() { n ios_base::sync_with_stdio(false); n int t; n cin >> t; n for (int i = 1; i <= t; ++i) obr(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int x[500010], y[500010]; n bitset<2010 * 2> A[2010]; n void Work() { n for (int i = 1; i <= n; i++) { n int t = i; n for (int j = i + 1; j <= n; j++) n if (A[j][i]) t = j; n swap(A[i], A[t]); n for (int j = 1; j <= n; j++) n if (A[j][i] && j != i) A[j] ^= A[i]; n } n for (int i = 1; i <= m; i++) n if (A[y[i]][x[i] + n]) n puts( NO ); n else n puts( YES ); n } n void Init() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n scanf( %d%d , &x[i], &y[i]); n A[x[i]][y[i]] = 1; n } n for (int i = 1; i <= n; i++) A[i][i + n] = 1; n } n int main() { n Init(); n Work(); n return 0; n } n "} +{"func_code_string": "#include n const int MAXN = 60; n int n, P, A[MAXN]; n const int mod = 1000000007; n void reduce(int& x) { x += x >> 31 & mod; } n int mul(int a, int b) { return (long long)a * b % mod; } n int pow(int a, int b, int res = 1) { n for (; b; b >>= 1, a = mul(a, a)) n if (b & 1) res = mul(res, a); n return res; n } n int dp[MAXN][MAXN][MAXN]; n int main() { n std::ios_base::sync_with_stdio(false), std::cin.tie(0); n std::cin >> n >> P; n for (int i = 1; i <= n; ++i) std::cin >> A[i]; n dp[0][0][0] = 1; n for (int i = 1; i <= n; ++i) n for (int j = 0; j <= i; ++j) n for (int k = 0; k <= i; ++k) n if (dp[i - 1][j][k]) { n if (A[i] == 0 || A[i] == -1) { n int t = pow(2, i - 1 - (!!k), dp[i - 1][j][k]); n reduce(dp[i][j + 1][k] += t - mod); n if (k) reduce(dp[i][j][k] += t - mod); n } n if (A[i] == 1 || A[i] == -1) { n int t = pow(2, i - 1 - (!!j), dp[i - 1][j][k]); n reduce(dp[i][j][k + 1] += t - mod); n if (j) reduce(dp[i][j][k] += t - mod); n } n } n int ans = 0; n for (int i = 0; i <= n; ++i) n for (int j = 0; j <= n; ++j) n if ((i + j & 1) == P) reduce(ans += dp[n][i][j] - mod); n std::cout << ans << std::endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char s[200001], t1[200001]; n long long n, x, y, t, con = 0; n cin >> n >> x >> y; n getchar(); n gets(s); n t = n - x; n for (long long i = t; s[i] != 0 ; i++) { n if (i == n - 1 - y && s[i] != 1 ) con++; n if (i != n - 1 - y && s[i] != 0 ) con++; n } n cout << con << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int k, r; n cin >> k >> r; n int n = 1; n while (true) { n if ((k * n - r) % 10 == 0 || (k * n) % 10 == 0) { n cout << n << n ; n return 0; n } n n++; n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n template n struct rge { n c b, e; n }; n template n rge range(c h, c n) { n return {h, n}; n } n template n auto dud(c* r) -> decltype(cerr << *r); n template n char dud(...); n struct muu { n template n muu& operator<<(const c&) { n return *this; n } n muu& operator()() { return *this; } n }; n const int N = 1e5 + 7; n long long tab[N]; n int n; n long long inf = 1e18; n void fail() { n printf( No n ); n exit(0); n } n int main() { n scanf( %d , &n); n for (int i = 2; i <= n; i += 2) scanf( %lld , tab + i); n long long sum = 0; n for (int i = 2; i <= n; i += 2) { n long long nsum = inf; n for (int d = 1; d * d <= tab[i]; ++d) { n if (tab[i] % d == 0) { n long long a = (tab[i] / d) - d; n long long b = (tab[i] / d) + d; n if (a % 2 == 0 && b % 2 == 0) { n if (a * a > 4 * sum) { n nsum = min(nsum, (b * b) / 4); n } n } n } n } n (muu() << __FUNCTION__ << # << 67 << : ) << i << << nsum; n if (nsum == inf) fail(); n tab[i - 1] = nsum - sum - tab[i]; n sum = nsum; n } n printf( Yes n ); n for (int i = 1; i <= n; ++i) printf( %lld , tab[i]); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 3e5 + 50; n vector e[N]; n int dp[N], res, deg[N]; n void dfs(int u, int pre) { n dp[u] = deg[u]; n for (int v : e[u]) { n if (v == pre) continue; n dfs(v, u); n res = max(res, dp[u] + dp[v]); n dp[u] = max(dp[u], dp[v] + deg[u] - 2 + 1); n } n } n int main() { n int t; n scanf( %d , &t); n while (t--) { n int n; n scanf( %d , &n); n for (int i = 1; i <= n; i++) e[i].clear(), deg[i] = 0; n for (int i = 0; i < n - 1; i++) { n int u, v; n scanf( %d%d , &u, &v); n e[u].push_back(v); n e[v].push_back(u); n deg[u]++; n deg[v]++; n } n res = 0; n dfs(1, 0); n printf( %d n , res); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n const int maxN = (int)1e6 + 10; n vector g[maxN]; n int p[maxN]; n int a[maxN]; n long long s = 0; n long long tr[maxN]; n set all; n void dfs(int v) { n tr[v] = a[v]; n for (int to : g[v]) { n dfs(to); n tr[v] += tr[to]; n } n if (s % tr[v] == 0) { n all.insert(tr[v]); n } n } n int val[maxN]; n const int mod = (int)1e9 + 7; n int sum(int a, int b) { n int s = a + b; n if (s >= mod) s -= mod; n return s; n } n set ok; n long long id[maxN]; n long long sm[maxN]; n map f; n int dp[maxN]; n int main() { n ios_base::sync_with_stdio(false); n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n s += a[i]; n } n for (int i = 1; i < n; i++) { n cin >> p[i]; n g[p[i]].push_back(i + 1); n } n dfs(1); n int sz = 1; n int oth = 1; n for (long long t : all) { n memset(sm, 0, sizeof sm); n bool can = true; n for (int i = n; i >= 1; i--) { n if (sm[i] + a[i] > t) { n can = false; n break; n } n if (sm[i] + a[i] == t) { n continue; n } n if (i == 1) { n can = false; n break; n } n sm[p[i - 1]] += (sm[i] + a[i]); n } n if (can) { n f[t] = oth; n oth++; n ok.insert(t); n } n } n for (long long x : ok) { n int id = f[x]; n dp[id] = 1; n for (long long y : ok) { n if (y >= x) continue; n if (x % y == 0) dp[id] = sum(dp[id], dp[f[y]]); n } n } n cout << dp[f[s]]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const long long LINF = 0x3f3f3f3f3f3f3f3f; n const int MOD = (int)1e9 + 7; n const int N = (int)2e5 + 7; n int tree[N << 1]; n void update(int x, int n) { n x += n; n if (tree[x]) return; n while (x) { n tree[x]++; n x >>= 1; n } n } n int query(int l, int r, int n) { n int re = 0; n l += n, r += n; n while (l <= r) { n if (l & 1) re += tree[l++]; n if (~r & 1) re += tree[r--]; n l >>= 1, r >>= 1; n } n return re; n } n pair p[N]; n vector x; n int l[N]; n int main() { n int n; n scanf( %d , &n); n for (int i = (0); i < (n); ++i) { n scanf( %d%d , &p[i].first, &p[i].second); n x.push_back(p[i].first); n } n sort((x).begin(), (x).end()); n sort(p, p + n); n for (int i = (0); i < (n); ++i) { n p[i].first = lower_bound((x).begin(), (x).end(), p[i].first) - x.begin(); n swap(p[i].first, p[i].second); n } n sort(p, p + n); n long long ans = 0; n for (int i = n - 1, j; i >= 0; i = j) { n for (j = i; j >= 0 && p[i].first == p[j].first; j--) n ; n int z = 0; n for (int k = (j + 1); k < (i + 1); ++k) { n l[k] = query(z, p[k].second - 1, n); n update(p[k].second, n); n z = p[k].second + 1; n } n for (int k = (j + 1); k < (i + 1); ++k) { n ans += (long long)(l[k] + 1) * (query(p[k].second + 1, n, n) + 1); n } n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n double l, p, q; n cin >> l >> p >> q; n double qq = l / (p + q) * p; n cout << setiosflags(ios::fixed); n cout << setprecision(4) << qq; n } n "} +{"func_code_string": "#include n using namespace std; n long long exp(long long x, long long y) { n x %= 1000000007; n long long res = 1; n while (y) { n if (y & 1) res = res * x % 1000000007; n x = x * x % 1000000007; n y >>= 1; n } n return res; n } n long long fact(long long n) { n long long res = 1; n for (long long i = 2; i <= n; ++i) (res *= i) %= 1000000007; n return res; n } n bool isprime(long long n) { n for (long long i = 2; i * i <= n; ++i) n if (n % i == 0) return 0; n return 1; n } n int main() { n int n, m; n cin >> n >> m; n const long long inf = 1e17; n vector sum(n), pre(n), s(n); n vector t(n); n for (int i = 0; i < n; ++i) { n int x; n cin >> x; n long long val = -inf; n long long mx = -inf; n vector v1, v2; n for (int j = 0; j < x; ++j) { n long long k; n cin >> k; n val = max(k, val + k); n mx = max(mx, val); n v1.push_back(k); n v2.push_back(k); n } n t[i] = mx; n for (int j = 1; j < x; ++j) v1[j] += v1[j - 1]; n for (int j = x - 2; j >= 0; --j) v2[j] += v2[j + 1]; n sum[i] = v1[x - 1]; n pre[i] = *max_element(v1.begin(), v1.end()); n s[i] = *max_element(v2.begin(), v2.end()); n } n long long to = -inf; n vector v(m + 1); n for (int i = 1; i <= m; ++i) { n cin >> v[i]; n to = max(to, t[v[i] - 1]); n } n long long dp[m + 1][3]; n memset(dp, 0, sizeof(dp)); n for (int i = 1; i <= m; ++i) { n dp[i][0] = s[v[i] - 1]; n dp[i][1] = max(dp[i - 1][0] + sum[v[i] - 1], dp[i - 1][1] + sum[v[i] - 1]); n dp[i][2] = max(dp[i - 1][0] + pre[v[i] - 1], dp[i - 1][1] + pre[v[i] - 1]); n } n long long ans = -inf; n for (int i = 1; i <= m; ++i) ans = max(ans, dp[i][2]); n cout << max(ans, to); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = -1; n struct disk { n long long L; n double p; n disk(long long L = 0, double p = 0.) : L(L), p(p) {} n }; n bool operator<(disk a, disk b) { n return (a.L * a.p * (1 - b.p)) > (b.L * b.p * (1 - a.p)); n } n int n; n vector P; n int main() { n while (cin >> n) { n P.resize(n); n for (int i = (0); i < (int)(n); i++) n scanf( %lld %lf , &P[i].L, &P[i].p), P[i].p /= 100; n sort(P.begin(), P.end()); n double ans = 0., E = 0.; n for (int i = ((int)n) - 1; i >= 0; i--) { n disk D = P[i]; n ans += D.L * (1 + E * D.p); n E = D.p * E + (1 - D.p) * (E + 1); n } n printf( %.6f n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long i, n, now, ans, hh, m, p = 1000000009; n int main() { n scanf( %lld , &n); n if (n == 2) { n puts( 10 ); n return 0; n } n m = n / 2; n now = 4; n hh = 1; n for (i = 3; i <= m; i++) { n now = now * 2 % p; n hh = hh * (now - 3) % p; n ans = (ans + hh) % p; n } n ans = ans * 4 + 6; n ans %= p; n ans = ans * ans % p; n ans++; n ans = ans * 2 % p; n printf( %lld , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int m(int x, int md) { return (((x) % md) + md) % md; } n void solve() { n int n; n cin >> n; n vector a(n); n for (int i = 0; i < n; i++) cin >> a[i]; n set st; n for (int r = 0; r < n; r++) { n st.insert(m(r + a[r], n)); n } n if (st.size() == n) n cout << YES n ; n else n cout << NO n ; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int T; n cin >> T; n for (int testcase = 1; testcase <= T; testcase++) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct event { n int pos, type, p; n event(int pos = 0, int type = -1, int p = 0) : pos(pos), type(type), p(p) {} n bool operator<(const event &e) const { n if (pos == e.pos) return type < e.type; n return pos < e.pos; n } n }; n const int maxE = 5e5 + 10; n event E[maxE]; n int cnt[111]; n double fpow(double a, int n) { n double r = 1; n for (; n; n = n >> 1) { n if (n & 1) r *= a; n a = a * a; n } n return r; n } n int main() { n memset((cnt), (0), sizeof(cnt)); n int n, m, x, h, l, r, sz = 0, b, z; n scanf( %d%d , &n, &m); n for (int _n(n), i(0); i < _n; i++) { n scanf( %d%d%d%d , &x, &h, &l, &r); n l = 100 - l; n r = 100 - r; n E[sz++] = event(x - h, 0, l); n E[sz++] = event(x, 0, -1 - l); n E[sz++] = event(x + 1, 0, r); n E[sz++] = event(x + h + 1, 0, -1 - r); n } n for (int _n(m), i(0); i < _n; i++) { n scanf( %d%d , &b, &z); n E[sz++] = event(b, z); n } n sort(E, E + sz); n double expectation = 0, pro = 0; n for (int _n(sz), i(0); i < _n; i++) { n if (E[i].type == 0) { n if (E[i].p >= 0) { n cnt[E[i].p]++; n } else n cnt[-E[i].p - 1]--; n } else { n pro = 1; n for (int _n(101), i(0); i < _n; i++) pro *= fpow(0.01 * i, cnt[i]); n expectation += pro * E[i].type; n } n } n printf( %.7f n , expectation); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 100011; n const long long INF = (1 << 29) + 123; n const long long MOD = 1000000007; n const long double PI = 4 * atan((long double)1); n int fenw[2 * MAX_N]; n int n; n void mod(int i, int v) { n while (i <= n) { n fenw[i] += v; n i += i & -i; n } n } n int query(int i) { n int sum = 0; n while (i > 0) { n sum += fenw[i]; n i -= i & -i; n } n return sum; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n; n vector > p; n int x[n], v[n]; n for (int i = 0; i < n; i++) cin >> x[i]; n for (int i = 0; i < n; i++) { n cin >> v[i]; n p.push_back(make_pair(v[i], x[i])); n } n unordered_map m; n int rev_map[n]; n sort(x, x + n); n for (int i = 0; i < n; i++) { n m[x[i]] = i + 1; n rev_map[i] = x[i]; n } n for (int i = 0; i < n; i++) { n p[i].second = m[p[i].second]; n } n sort(p.begin(), p.end()); n long long ans = 0; n for (int i = 0; i < n; i++) { n int q = query(p[i].second); n ans += 1LL * q * rev_map[p[i].second - 1]; n ans -= n 1LL * ((n - i - 1) - (p[i].second - 1 - q)) * rev_map[p[i].second - 1]; n mod(p[i].second, 1); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long V[10005], O[10005], F[1005][10005]; n int c[1005], cost[1005]; n int n, W, B, X; n struct Queue { n int p[1005], q[1005]; n long long maxp[1005], maxq[1005]; n void clear() { n *p = 0; n *q = 0; n maxp[0] = maxq[0] = -1; n } n void add(int x) { n q[++*q] = x; n maxq[*q] = max(maxq[(*q) - 1], V[x]); n } n void del() { n if (*p) n --*p; n else { n for (; *q; --*q) ++*p, maxp[*p] = max(maxp[(*p) - 1], V[p[*p] = q[*q]]); n --*p; n } n } n long long ask() { return max(maxp[*p], maxq[*q]); } n } G; n int main() { n scanf( %d%d%d%d , &n, &W, &B, &X); n for (int i = 1; i <= n; i++) scanf( %d , &c[i]); n for (int i = 1; i <= n; i++) scanf( %d , &cost[i]); n memset(F, -1, sizeof(F)); n F[0][0] = W; n int sum = 0; n for (int i = 1; i <= n; i++) { n sum += c[i]; n for (int j = 0; j <= sum; j++) { n for (int k = max(j - c[i], 0); k <= j; k++) n if (F[i - 1][k] >= 1ll * cost[i] * (j - k)) n F[i][j] = max(F[i][j], F[i - 1][k] - 1ll * cost[i] * (j - k)); n if (F[i][j] != -1) { n F[i][j] += X; n F[i][j] = min(F[i][j], W + 1ll * j * B); n } n } n } n for (int k = sum; k >= 0; k--) n if (F[n][k] >= 0) { n printf( %d n , k); n return 0; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, p1 = 0, p2 = 0; n cin >> n; n int mid[1000], index = 0; n for (int i = 0; i < n; i++) { n int a; n cin >> a; n if (a % 2 == 0) { n for (int j = 1; j <= (a / 2); j++) { n int t; n cin >> t; n p1 += t; n } n for (int j = 1; j <= (a / 2); j++) { n int t; n cin >> t; n p2 += t; n } n } else { n for (int j = 1; j <= (a / 2); j++) { n int t; n cin >> t; n p1 += t; n } n cin >> mid[index++]; n for (int j = 1; j <= (a / 2); j++) { n int t; n cin >> t; n p2 += t; n } n } n } n sort(mid, mid + index); n for (int i = index - 1; i >= 0; i--) { n if (((index - 1) % 2 == 0 && i % 2 == 0) || n ((index - 1) % 2 == 1 && i % 2 == 1)) n p1 += mid[i]; n else n p2 += mid[i]; n } n cout << p1 << << p2 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 6010; n vector a[N]; n int L[N], cnt, r[N], n, res = 0; n void Refresh() { n L[0] = cnt = 0; n for (int i = 1; i <= n + 1; i++) L[i] = 10000000; n } n void DFS(int u, int p) { n int Oldval, Oldid, Oldcnt = cnt; n if (cnt == 0 || r[u] > L[cnt]) n L[++cnt] = r[u]; n else { n Oldid = lower_bound(L, L + n + 1, r[u]) - L; n Oldval = L[Oldid]; n L[Oldid] = r[u]; n } n res = max(res, cnt); n for (int i = 0; i < a[u].size(); i++) { n int v = a[u][i]; n if (v != p) DFS(v, u); n } n if (Oldcnt != cnt) n L[cnt--] = 10000000; n else n L[Oldid] = Oldval; n } n int main() { n ios_base::sync_with_stdio(0); n int u, v; n cin >> n; n for (int i = 1; i <= n; i++) cin >> r[i]; n for (int i = 1; i < n; i++) { n cin >> u >> v; n a[u].push_back(v); n a[v].push_back(u); n } n for (int i = 1; i <= n; i++) { n Refresh(); n DFS(i, 0); n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long pow1(int a, int b) { n long long res = 1; n for (int i = 1; i <= b; i++) res *= a; n return res; n } n int main() { n int n; n cin >> n; n long long sum = 2 * (pow1(2, n) - 1); n cout << sum << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int gcd(long long int a, long long int b) { n if (b == 0) n return a; n else n return gcd(b, a % b); n } n bool sortbysec(const pair &a, const pair &b) { n return (a.second < b.second); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n std::cout.precision(12); n int t; n cin >> t; n while (t--) { n bool f = 0; n int n, m; n cin >> n >> m; n char a[n][m]; n char ans[n][m]; n vector> v[26]; n int ma = -1; n int r, c; n for (long long int i = 0; i < n; i++) { n for (long long int j = 0; j < m; j++) { n cin >> a[i][j]; n ans[i][j] = . ; n if (a[i][j] >= 97 && a[i][j] <= z ) { n v[a[i][j] - a ].push_back({i + 1, j + 1}); n if (a[i][j] - a > ma) { n ma = a[i][j] - a ; n r = i + 1; n c = j + 1; n } n } n } n } n vector> start[ma + 1], end[ma + 1]; n for (long long int i = 0; i < ma + 1; i++) { n if (v[i].size() == 0) { n start[i].push_back({r, c}); n end[i].push_back({r, c}); n } else if (v[i].size() == 1) { n ans[v[i][0].first - 1][v[i][0].second - 1] = a + i; n start[i].push_back({v[i][0].first, v[i][0].second}); n end[i].push_back({v[i][0].first, v[i][0].second}); n } else { n if (v[i][1].first == v[i][0].first) { n int mi = m + 6, m = 0; n for (int j = 0; j < v[i].size(); j++) { n if (v[i][j].first != v[i][0].first) { n f = 1; n break; n } n mi = min(mi, v[i][j].second); n m = max(m, v[i][j].second); n } n if (f == 1) break; n for (int j = mi - 1; j < m; j++) { n ans[v[i][0].first - 1][j] = a + i; n } n start[i].push_back({v[i][0].first, mi}); n end[i].push_back({v[i][0].first, m}); n } else if (v[i][1].second == v[i][0].second) { n int mi = n + 6, m = 0; n for (int j = 0; j < v[i].size(); j++) { n if (v[i][j].second != v[i][0].second) { n f = 1; n break; n } n mi = min(mi, v[i][j].first); n m = max(m, v[i][j].first); n } n if (f == 1) break; n for (int j = mi - 1; j < m; j++) { n ans[j][v[i][0].second - 1] = a + i; n } n start[i].push_back({mi, v[i][0].second}); n end[i].push_back({m, v[i][0].second}); n } else { n f = 1; n break; n } n } n } n for (long long int i = 0; i < n; i++) { n for (long long int j = 0; j < m; j++) { n if (a[i][j] != ans[i][j]) { n f = 1; n break; n } n } n if (f == 1) break; n } n if (f == 0) { n cout << YES n ; n cout << ma + 1 << endl; n for (long long int i = 0; i < ma + 1; i++) n cout << start[i][0].first << << start[i][0].second << n << end[i][0].first << << end[i][0].second << endl; n } else { n cout << NO n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; n const long long linf = 4000000000000000000LL; n const long long inf = 998244353; n const long double pi = 3.1415926535; n void pv(vector a) { n for (auto& x : a) cout << x << ; n cout << n ; n } n void pv(vector a) { n for (auto& x : a) cout << x << ; n cout << n ; n } n void pv(vector> a) { n for (int i = (0); i < (int(a.size())); ++i) { n cout << i << n ; n pv(a[i]); n cout << n ; n } n } n void pv(vector> a) { n for (int i = (0); i < (int(a.size())); ++i) { n cout << i << n ; n pv(a[i]); n } n cout << n ; n } n void pv(vector a) { n for (auto& x : a) cout << x << n ; n cout << n ; n } n void build_primes(vector& primes, int size) { n vector visited; n visited.resize(size, 0); n for (int i = (2); i < (size); ++i) { n if (visited[i] == 0) { n primes.push_back(i); n int a = i; n while (a < size) { n visited[a] = 1; n a += i; n } n } n } n } n vector> matrix_mult(vector>& a, n vector>& b) { n int n = a.size(); n vector> answer; n answer.resize(n); n for (int i = 0; i < n; i++) answer[i].resize(n, 0); n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n for (int k = 0; k < n; k++) n answer[i][j] = (answer[i][j] + a[i][k] * b[k][j]) % inf; n } n } n return answer; n } n int modInverse(int a, int m) { n int m0 = m; n int y = 0, x = 1; n if (m == 1) return 0; n while (a > 1) { n int q = a / m; n int t = m; n m = a % m, a = t; n t = y; n y = x - q * y; n x = t; n } n if (x < 0) x += m0; n return x; n } n long long power(long long x, long long y) { n long long k = 1LL << 60; n long long z = 1; n while (k != 0) { n z *= z; n z %= inf; n if (y >= k) { n z *= x; n z %= inf; n y -= k; n } n k >>= 1; n } n return z; n } n struct point { n long double x, y; n bool operator<(const point& rhs) const { n if (x == rhs.x) return y < rhs.y; n return x < rhs.x; n } n }; n struct pt { n long long x, y; n bool operator<(const point& rhs) const { n if (x == rhs.x) return y < rhs.y; n return x < rhs.x; n } n }; n long double area(point x, point y, point z) { n return (x.y * y.x + y.y * z.x + z.y * x.x - x.x * y.y - y.x * z.y - n z.x * x.y) / n 2.0; n } n bool clockwise(point x, point y, point z) { return area(x, y, z) > 0; } n long double area(pt x, pt y, pt z) { n return (x.y * y.x + y.y * z.x + z.y * x.x - x.x * y.y - y.x * z.y - n z.x * x.y) / n 2.0; n } n bool clockwise(pt x, pt y, pt z) { return area(x, y, z) > 0; } n long long gcd(long long a, long long b) { n if (a > b) swap(a, b); n if (a == 0) return b; n return gcd(a, b % a); n } n int popcount(long long a) { n int count = 0; n while (a) { n count += (a & 1); n a >>= 1; n } n return count; n } n long long choose(long long n, long long r) { n long long p = 1, k = 1; n if (n - r < r) r = n - r; n if (r != 0) { n while (r) { n p *= n; n k *= r; n long long m = gcd(p, k); n p /= m; n k /= m; n n--; n r--; n } n } else n p = 1; n return p; n } n vector prefix_hash(string& a, vector& powers) { n int n = int(a.size()); n vector prefix(n + 1); n for (int i = (0); i < (n); ++i) n prefix[i + 1] = (prefix[i] + powers[i] * (a[i] - a + 1)) % inf; n return prefix; n } n struct custom_hash { n static uint64_t splitmix64(uint64_t x) { n x += 0x9e3779b97f4a7c15; n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; n x = (x ^ (x >> 27)) * 0x94d049bb133111eb; n return x ^ (x >> 31); n } n uint64_t operator()(uint64_t x) const { n static const uint64_t FIXED_RANDOM = n chrono::steady_clock::now().time_since_epoch().count(); n return splitmix64(x + FIXED_RANDOM); n } n }; n struct custom_hash_fast { n uint64_t operator()(uint64_t x) const { n static const uint64_t FIXED_RANDOM = n chrono::steady_clock::now().time_since_epoch().count(); n x ^= FIXED_RANDOM; n return x ^ (x >> 16); n } n }; n void setIO(string second) { n ios_base::sync_with_stdio(0); n cin.tie(0); n } n int main() { n setIO( ); n int testc; n cin >> testc; n while (testc--) { n int n; n cin >> n; n string a; n cin >> a; n int i = n - 1; n for (; i >= 0; i--) n if ((a[i] - 0 ) & 1) break; n if (i == -1) { n cout << -1 << n ; n continue; n } n int j = 0; n for (; j < i; j++) { n if ((a[j] - 0 ) % 2 == 1) break; n } n if (j == i) { n cout << -1 << n ; n continue; n } n cout << a[j] << a[i] << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n, m, k; n cin >> n >> m >> k; n int cardsPlayer = n / k; n double maxCard; n int jokerMax = min(m, cardsPlayer); n maxCard = ceil((m - jokerMax) / (k - 1.0)); n if (jokerMax - maxCard > 0) n cout << jokerMax - maxCard << endl; n else n cout << 0 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n typedef struct { n long long j, x1, x2; n } inter; n struct comp1 { n bool operator()(const inter& a, const inter& b) const { return a.x1 < b.x1; }; n }; n struct comp2 { n bool operator()(const inter& a, const inter& b) const { n return (a.x2 == b.x2) ? (a.x1 < b.x1) : (a.x2 < b.x2); n }; n }; n void solve() { n long long n; n cin >> n; n vector a(n), b(n), m(n); n unordered_map> dsize; n for (long long i = 0; i < (n); i++) { n cin >> a[i] >> b[i] >> m[i]; n dsize[a[i] + b[i] - m[i]].push_back(i); n } n long long c = 0; n vector ea(n); n for (auto& x : dsize) { n multiset inter1; n multiset inter2; n for (auto& i : x.second) { n long long eamax = min(m[i], a[i]); n long long eamin = max(m[i] - b[i], 0LL); n inter1.insert(inter{i, a[i] - eamax, a[i] - eamin}); n inter2.insert(inter{i, a[i] - eamax, a[i] - eamin}); n } n auto p1 = inter1.begin(); n while (!inter2.empty()) { n long long targ = inter2.begin()->x2; n while ((p1 == inter1.end()) ? false : (p1->x1 <= targ)) { n inter2.erase(*p1); n ea[p1->j] = a[p1->j] - targ; n p1++; n } n c++; n } n } n cout << c << endl; n for (long long i = 0; i < (n); i++) n cout << ea[i] << << m[i] - ea[i] << endl; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n ifstream ifs; n if ( [0]) cin.rdbuf((ifs = ifstream( )).rdbuf()); n ; n ofstream ofs; n if ( [0]) cout.rdbuf((ofs = ofstream( )).rdbuf()); n ; n ofstream lfs; n if ( [0]) clog.rdbuf((lfs = ofstream( )).rdbuf()); n ; n int t; n cin >> t; n for (int i = 1; i <= t; i++) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n long long a[2000], dp[2000]; n long long qmod(long long y) { n long long res = 1, two = (long long)2; n for (; y; y >>= 1) { n if (y & 1) res = res * two % mod; n two = two * two % mod; n } n return res; n } n int main() { n long long x, y; n int cnt = 0; n scanf( %lld%lld , &x, &y); n if (y % x) return 0 * puts( 0 ); n for (long long i = 1; i <= sqrt(y); ++i) { n if (y % i == 0) { n if (i % x == 0) a[++cnt] = i; n if (i * i != y && y / i % x == 0) a[++cnt] = y / i; n } n } n sort(a + 1, a + 1 + cnt); n for (int i = cnt; i > 0; --i) { n dp[i] = qmod(y / a[i] - 1); n for (int j = i + 1; j <= cnt; ++j) n if (a[j] % a[i] == 0) dp[i] = ((dp[i] - dp[j]) % mod + mod) % mod; n } n printf( %lld n , dp[1]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 200005; n const int inf = 214748364; n int n, m, g[21][1 << 20], f[maxN], v[maxN], s[maxN]; n int cost(int a, int b) { n for (int i = m; i >= 0; --i) { n if ((a & ((1 << i) - 1)) == (b >> (m - i))) return m - i; n } n } n void init() { n char c[25]; n scanf( %d , &n); n for (int i = 1; i <= n; ++i) { n scanf( %s , c + 1); n m = strlen(c + 1); n for (int j = 1; j <= m; ++j) v[i] = (v[i] << 1) + c[j] - 48; n } n s[1] = m; n for (int i = 2; i <= n; ++i) s[i] = s[i - 1] + cost(v[i - 1], v[i]); n } n void work() { n int ans = inf; n for (int i = 0; i <= m; ++i) n for (int j = 0; j <= (1 << m) - 1; ++j) g[i][j] = inf; n g[0][0] = 0; n f[1] = m; n for (int i = 2; i <= n; ++i) { n f[i] = inf; n for (int j = 0; j <= m; ++j) { n int tmp = s[i - 1] + g[j][v[i] >> (m - j)] + m - j; n f[i] = ((f[i]) < (tmp) ? (f[i]) : (tmp)); n } n for (int j = 0; j <= m; ++j) n g[j][v[i - 1] & ((1 << j) - 1)] = n ((g[j][v[i - 1] & ((1 << j) - 1)]) < (f[i] - s[i]) n ? (g[j][v[i - 1] & ((1 << j) - 1)]) n : (f[i] - s[i])); n } n for (int i = 1; i <= n; ++i) n ans = ((ans) < (f[i] + s[n] - s[i]) ? (ans) : (f[i] + s[n] - s[i])); n printf( %d n , ans); n } n int main() { n init(); n work(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline void Input_Output() {} n const double eps = 0.000001; n const long double pi = acos(-1); n const int maxn = 1e7 + 9; n const int mod = 1e9 + 7; n const long long MOD = 1e18 + 9; n const long long INF = 1e18 + 123; n const int inf = 2e9 + 11; n const int mxn = 1e6 + 9; n const int N = 6e5 + 123; n const int K = 80; n const int pri = 997; n const int Magic = 2101; n const int dx[] = {-1, 0, 1, 0}; n const int dy[] = {0, -1, 0, 1}; n int n, m, k, x; n vector state; n int ids[(1 << 8)]; n struct Mat { n long long d[K][K]; n Mat(long long val = INF) { n for (int i = 0; i < K; ++i) n for (int j = 0; j < K; ++j) d[i][j] = INF; n for (int i = 0; i < K; ++i) d[i][i] = val; n } n Mat operator+(Mat &b) { n Mat res; n for (int i = 0; i < K; ++i) n for (int j = 0; j < K; ++j) n for (int k = 0; k < K; ++k) n res.d[i][j] = min(res.d[i][j], d[i][k] + b.d[k][j]); n return res; n } n void print() { n for (int i = 0; i < K; ++i) { n for (int j = 0; j < K; ++j) { n if (d[i][j] == INF) { n cout << bd ; n continue; n } n cout << d[i][j] << ; n } n cout << n ; n } n } n }; n Mat make_matrix(vector &c) { n assert((int)(c.size()) == k); n Mat res; n for (int id = 0; id < (int)(state.size()); ++id) { n int msk = state[id]; n if (msk % 2 == 0) { n int nmsk = msk / 2; n res.d[id][ids[nmsk]] = 0; n continue; n } n for (int i = 0; i < k; ++i) { n int nmsk = (msk >> 1); n if (nmsk & (1 << i)) { n continue; n } n nmsk |= (1 << i); n res.d[id][ids[nmsk]] = min(res.d[id][ids[nmsk]], c[i]); n } n } n return res; n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n cin >> x >> k >> n >> m; n for (int msk = 0; msk < (1 << k); ++msk) { n ids[msk] = -1; n if (__builtin_popcount(msk) != x) { n continue; n } n ids[msk] = (int)(state.size()); n state.push_back(msk); n } n vector c(k); n for (auto &e : c) cin >> e; n vector pos = {0, n - x}; n vector > spec(m); n for (auto &it : spec) { n cin >> it.first >> it.second; n it.first--; n for (int i = 0; i <= k; ++i) { n int s = it.first - i; n s = max(s, 0); n s = min(s, n - x); n pos.push_back(s); n } n } n sort(pos.begin(), pos.end()); n pos.resize(unique(pos.begin(), pos.end()) - pos.begin()); n vector Pw; n Pw.push_back(make_matrix(c)); n int bit = 0; n while ((1 << bit) <= n) { n ++bit; n Pw.push_back(Pw.back() + Pw.back()); n } n Mat cur = 0; n for (int it = 0; it + 1 < (int)(pos.size()); ++it) { n int l = pos[it], r = pos[it + 1]; n vector nc = c; n for (auto s : spec) { n if (s.first > l && s.first <= l + k) { n nc[s.first - l - 1] += s.second; n } n } n if (nc != c) { n Mat cn = make_matrix(nc); n cur = cur + cn; n } else { n int dif = r - l; n for (int i = 0; i < (int)(Pw.size()); ++i) { n if (dif & (1 << i)) { n cur = cur + Pw[i]; n } n } n } n } n int fin = (1 << x) - 1; n fin = ids[fin]; n assert(fin != -1); n cout << cur.d[fin][fin] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool vis[2][100005]; n char c[2][100005]; n int main() { n queue > > q; n bool flag = 0; n int n, k; n cin >> n >> k; n scanf( %s%s , c[0], c[1]); n q.push(make_pair(0, make_pair(0, 0))); n while (!q.empty()) { n int x = q.front().first, y = q.front().second.first, n de = q.front().second.second; n q.pop(); n if (y >= n) { n flag = 1; n break; n } n if (vis[x][y] || de > y) continue; n vis[x][y] = 1; n if (y - 1 >= 0 && c[x][y - 1] != X && y - 1 >= de + 1 && !vis[x][y - 1]) { n q.push(make_pair(x, make_pair(y - 1, de + 1))); n } n if (y + 1 >= n || (c[x][y + 1] != X && !vis[x][y + 1])) { n q.push(make_pair(x, make_pair(y + 1, de + 1))); n } n if (y + k >= n || (c[x ^ 1][y + k] != X && !vis[x ^ 1][y + k])) { n q.push(make_pair(x ^ 1, make_pair(y + k, de + 1))); n } n } n if (flag) n cout << YES ; n else n cout << NO ; n } n "} +{"func_code_string": "#include n int n, k, ans; n long long s[200005], a[200005], b[200005]; n void neg() { n for (int i = 0; i <= n; i++) { n a[i] = -a[i]; n b[i] = -b[i]; n } n } n void trans() { n b[n]--; n b[0] += 2; n for (int i = 1; i < n; i++) b[i]++; n for (int i = 0; i < n; i++) { n b[i + 1] += b[i] / 2; n b[i] %= 2; n } n } n void print(long long x[]) { n for (int i = 0; i <= n; i++) printf( %I64d , x[i]); n printf( n ); n } n int main() { n scanf( %d %d , &n, &k); n for (int i = 0; i <= n; i++) scanf( %I64d , &a[i]); n for (int i = 0; i < n; i++) { n b[i] += a[i]; n b[i + 1] += b[i] / 2; n b[i] %= 2; n if (b[i] < 0) { n b[i + 1]--; n b[i] += 2; n } n } n b[n] += a[n]; n if (b[n] < 0) neg(); n trans(); n for (int i = n; i >= 0; i--) { n if (s[i + 1] == 10ll * k + 1) n s[i] = 10ll * k + 1; n else n s[i] = s[i + 1] * 2 + b[i]; n if (s[i] > 10ll * k) s[i] = 10ll * k + 1; n } n for (int i = 0; i <= n; i++) { n if (i == n && llabs(s[i] - a[i]) <= k && s[i] != a[i]) ans++; n if (i != n && llabs(s[i] - a[i]) <= k) ans++; n if (b[i]) break; n } n printf( %d n , ans); n scanf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n long long int n, k, sum = 0; n cin >> n >> k; n long long int a[n]; n for (long long int i = 0; i < n; i++) cin >> a[i]; n string s; n cin >> s; n vector v; n v.push_back(a[0]); n for (long long int i = 1; s[i]; i++) { n if (s[i] == s[i - 1]) n v.push_back(a[i]); n else { n sort(v.rbegin(), v.rend()); n for (long long int i = 0; i < k && i < v.size(); i++) { n sum += v[i]; n } n v.clear(); n v.push_back(a[i]); n } n } n sort(v.rbegin(), v.rend()); n for (long long int i = 0; i < k && i < v.size(); i++) sum += v[i]; n cout << sum; n } n "} +{"func_code_string": "#include n using namespace std; n int a[10]; n int main() { n int T;scanf( %d ,&T); n while(T--) { n int sum = 0; n for(int i = 1;i <= 3;i++) { n scanf( %d ,&a[i]); n sum += a[i]; n } n if(sum % 9 == 0) { n if(a[1] >= sum / 9 && a[2] >= sum / 9 && a[3] >= sum / 9) { n printf( YES n ); n } else { n printf( NO n ); n } n } else { n printf( NO n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long int; n using ld = long double; n using vi = vector; n using vll = vector; n using vd = vector; n using vvi = vector; n int ctoi(char c) { return c - 0 ; } n int slen(string s) { return s.length(); } n int vsize(vi a) { return (int)a.size(); } n int in() { n int x; n cin >> x; n return x; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int N; n cin >> N; n vi d(N); n for (auto& x : d) cin >> x; n int mn = abs(d[N - 1] - d[0]); n int a = N - 1, b = 0; n for (int i = 1; i < N; i++) { n if (abs(d[i] - d[i - 1]) < mn) { n mn = abs(d[i] - d[i - 1]); n a = i; n b = i - 1; n } n } n cout << a + 1 << << b + 1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int result = 0; n for (int i = 0; i < n; i++) { n int k, a; n cin >> k >> a; n long x = k * a; n int c = 0; n if (a % 4 == 0) a--; n while (a) { n a /= 4; n c++; n } n result = (((result) < (k + c)) ? (k + c) : (result)); n } n cout << result; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, m; n cin >> n >> m; n long long x; n for (int i = 0; i < m; i++) { n cin >> x; n if (x > n) n cout << 0 << endl; n else { n if (x % 2 == 1) n cout << x / 2 + 1 << endl; n else { n long long a = x, b, c = n; n while (1) { n if (a % 2 == 1) break; n b = a + (c - a / 2); n a = b; n } n cout << a / 2 + 1 << endl; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x3f3f3f3f; n const int maxn = 100010; n int x0[maxn], x1[maxn], d[maxn], c[maxn]; n int main() { n int n, m, y0, y1; n scanf( %d %d %d %d , &n, &m, &y0, &y1); n for (int i = 0; i < n; ++i) { n scanf( %d , &x0[i]); n } n memset(d, -1, sizeof(d)); n for (int i = 0; i < m; ++i) { n scanf( %d , &x1[i]); n } n int p = 0, k = 0, last = -1; n for (int i = 0; i < n; ++i) { n while (p < m && abs(x0[i] - x1[p]) > abs(x0[i] - x1[p + 1])) ++p; n if (last < p || abs(x0[i - 1] - x1[p]) == abs(x0[i] - x1[p])) n ++k, last = p; n else if (p < m && abs(x0[i] - x1[p]) == abs(x0[i] - x1[p + 1])) n ++k, last = ++p; n else n last = p; n } n printf( %d n , n - k); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string a; n cin >> a; n long long int x = a.length(); n std::vector v; n long long int c = 0; n long long int d = 0; n for (long long int i = 0; i < x; i++) { n if (a[i] == b ) { n d++; n } n if (a[i] == a ) { n if (d > 0 && c > 0) { n v.push_back(c); n d = 0; n c = 0; n } n c++; n d = 0; n } n } n if (c > 0) v.push_back(c); n long long int res = 1; n for (long long int i = 0; i < v.size(); i++) { n res = (res * (v[i] + 1)) % 1000000007; n } n cout << res - 1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[16], b[16]; n int main() { n double cnt = 0; n ios::sync_with_stdio(false); n cin >> n; n for (register int i = 0; i < n; i++) cin >> a[i]; n for (register int i = 0; i < n; i++) cin >> b[i]; n for (register int i = 0; i < 1e6; ++i) { n register bool f = false; n for (register int j = 0; !f && j < n; ++j) f |= i % a[j] == b[j]; n cnt += f; n } n cout.setf(ios::fixed, ios::floatfield); n return (cout << setprecision(7) << cnt / 1e6 << endl) && 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k1, k2; n long long a[1005]; n long long b[1005]; n void ReadData() { n cin >> n >> k1 >> k2; n for (long long i = 1; i <= n; i++) cin >> a[i]; n for (long long i = 1; i <= n; i++) cin >> b[i]; n } n long long c[1005]; n void process() { n long long k = k1 + k2; n priority_queue heap; n for (long long i = 1; i <= n; i++) { n c[i] = abs(a[i] - b[i]); n heap.push(c[i]); n } n while (k--) { n long long tmp = heap.top(); n heap.pop(); n tmp--; n heap.push(abs(tmp)); n } n long long res = 0; n while (!heap.empty()) { n long long tmp = heap.top(); n heap.pop(); n res += tmp * tmp; n } n cout << res; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n ReadData(); n process(); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1002, M = 10002; n pair dp[N][M]; n map di; n bool vis[N][M]; n int nxt[N][M]; n long long a[N], b[N], k; n int T[M][N]; n int n; n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n int main() { n scanf( %d %lld , &n, &k); n for (int i = 0; i < n; ++i) { n scanf( %lld , b + i); n a[i] = gcd(b[i], k); n } n if (k == 1) return printf( %d n%ld n , 1, min_element(b, b + n) - b + 1), 0; n vector divisor; n for (long long i = 1; i * i <= k; ++i) n if (k % i == 0) { n divisor.push_back(i); n divisor.push_back(k / i); n } n sort(divisor.begin(), divisor.end()); n divisor.resize(unique(divisor.begin(), divisor.end()) - divisor.begin()); n int m = divisor.size(); n for (int i = 0; i < m; ++i) di[divisor[i]] = i; n for (int i = 0; i < m; ++i) n for (int j = 0; j < n; ++j) n T[i][j] = di[divisor[i] / gcd(divisor[i], a[j])]; n nxt[n][0] = -1; n dp[n][0] = {0, 0}; n for (int i = 1; i < m; ++i) dp[n][i] = {n + 1, 0}; n for (int i = 0; i < m; ++i) n for (int j = n - 1; j >= 0; --j) { n pair ans1 = dp[j + 1][i]; n pair ans2 = dp[j + 1][T[i][j]]; n ans2.first += 1; n ans2.second += b[j]; n if (ans1 <= ans2) { n nxt[j][i] = nxt[j + 1][i]; n dp[j][i] = ans1; n } else { n nxt[j][i] = j; n dp[j][i] = ans2; n } n } n pair ans = dp[0][m - 1]; n if (ans.first > n) return puts( -1 ), 0; n printf( %d n , ans.first); n int pos = 0; n int nx = m - 1; n while (pos != -1) { n if (nxt[pos][nx] != pos) n pos = nxt[pos][nx]; n else { n nx = T[nx][pos]; n printf( %d , pos + 1); n pos += 1; n } n } n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n int n; n cin >> n; n int a[100005]; n for (int i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n if (n == 1) { n cout << -1 << endl; n return 0; n } n bool flag = true; n for (int i = 1; i < n; i++) flag = flag && (a[0] == a[i]); n if (flag) { n cout << 1 << endl; n cout << a[0] << endl; n return 0; n } n if (n == 2) { n if ((a[0] + a[1]) % 2 == 0) n cout << 3 << endl; n else n cout << 2 << endl; n cout << 2 * a[0] - a[1] << ; n if ((a[0] + a[1]) % 2 == 0) cout << (a[1] + a[0]) / 2 << ; n cout << 2 * a[1] - a[0] << ; n return 0; n } n flag = true; n for (int i = 2; i < n; i++) flag = flag && (a[1] - a[0] == a[i] - a[i - 1]); n if (flag) { n cout << 2 << endl; n cout << 2 * a[0] - a[1] << ; n cout << 2 * a[n - 1] - a[n - 2] << endl; n return 0; n } n vector diff; n set di; n for (int i = 1; i < n; i++) { n diff.push_back(a[i] - a[i - 1]); n di.insert(a[i] - a[i - 1]); n } n if (di.size() != 2) { n cout << 0 << endl; n return 0; n } n sort(diff.begin(), diff.end()); n int chan = diff[n - 2]; n if (chan != 2 * diff[0]) { n cout << 0 << endl; n return 0; n } n for (int i = n - 3; i >= 0; i--) { n if (diff[i] == chan || diff[i] != diff[0]) { n cout << 0 << endl; n return 0; n } n } n for (int i = 1; i < n; i++) { n if (a[i] - a[i - 1] == chan) { n if ((a[i] + a[i - 1]) % 2 == 0) { n cout << 1 << endl; n cout << (a[i] + a[i - 1]) / 2 << endl; n return 0; n } else { n cout << 0 << endl; n return 0; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector fib(46, -1); n int adv_fib(int n) { n if (n == 0 || n == 1) { n return 1; n } else if (fib[n] == -1) { n return fib[n] = adv_fib(n - 1) + adv_fib(n - 2); n } else { n return fib[n]; n } n } n int main() { n int n, curr = 1; n cin >> n; n for (int i = 1; i <= n; i++) { n if (adv_fib(curr) == i) { n cout << O ; n curr++; n } else { n cout << o ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n long long i, j, k, l, m, n, t, a[211111], b[211111], c[111111], d, s; n string p[111111], q[111111]; n int main() { n cin >> n; n for (i = 1; i <= n; i++) scanf( %I64d , &a[i]); n for (i = 1; i <= n; i++) scanf( %I64d , &b[i]); n i = 1; n j = 1; n while (i <= n) { n while (a[i] != b[j] && j <= n) j++; n if (j <= n) n i++; n else n break; n } n if (i > n) { n cout << 0; n return 0; n } n cout << n - i + 1; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector v(n); n for (auto &x : v) cin >> x; n int mine = *min_element(v.begin(), v.end()); n vector temp; n for (int i = 0; i < n; i++) { n if (v[i] == mine) temp.push_back(i); n } n for (int i = 0; i < temp.size() - 1; i++) temp[i] = temp[i + 1] - temp[i]; n cout << *min_element(temp.begin(), temp.end() - 1) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 50; n int n, a[maxn], ans, maxx = 0; n int main() { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n maxx = max(maxx, a[i]); n } n cout << maxx; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9 + 7; n const long long INFL = 1e18 + 123; n const double PI = atan2(0, -1); n mt19937 tw(960172); n long long rnd(long long x, long long y) { n static uniform_int_distribution d; n return d(tw) % (y - x + 1) + x; n } n const int MAXV = 1e6 + 5; n int real_dist[289][289]; n string encoded = n B:5GiO9T[SJLjS9XhW9T;XhSJLKLYO:PJD8TKLJP9PJX:KjS9XKSJTKS[GiOiSYOEOKP:XJ] n hSJTHX]OiSkS;@hSZKYO:P:O9PJX:OkSKWJDWKWOHKi;VSJX]SlOkSKT;KjS9XKSJTKS; n LWOYOkKYBiOkS7TKSHKjK9PiJ[OiSkSlJYO:P:S9XlJ9G7GHCGKH2S>FKXO9HjSWKYO:KZO9P: n KjS7TWGiOiSEO9ThSXOiSk?WKYO:DjS9D9HFKHKYGXB8TiOkS;KjSISJHHKjK9P4KjGWGiOi? n XOiSk?iK9DkS5G7GHCGKdFjSJH9LiK9T9@WKYO:DjS9D9P7GXGiKW7EKiK9O9DICWKWOH; n 7HHKjK9 n WK6GFKHKDGHKjKDKWOfKY>6?FC5CG:VKjSVOGKWOYO4GWGiOUKYOUO8?FGFK7GRBGKW? n XOUC5G7GHC3OFCWKWO3GFKHKTGiO3Ge>eBU>5CU6B:5CFGiFW?6GFK4KFGHK4GW?X? n gBGCW7EGX?WCFCWKG>6GFKXFWGXFi:5C5GgBSBXCGKWO4GWGUKjB5G7GH34Gh> n gBGCGBFCWKGB7GXJW7e>eBU>5;eFWKjF8C7GXGH>6GFKXFWGXFH?eBgB7?F65C7GDGXFU>6? n FCU>iB5G7GX>gBGCGFFK8>F:D:U6T>5?D2S>fBF;6Ge>gBG>hBFCG>6GDGe: n 5C5GSBFG4GfB5G73e>gBG76GF7F;S>U>g:U:EG5C7GH>6GVFW;U>6?FCC>6;e:5C5;fB5G7;5? n F77GB:D:U6T>U>6GW;F?5?FGF7e>gBG;6GF;FCD:f:5?e:R>5?FBF7V6e>eBU>D;U>6?F?e: n 5C5;gBG7e:f:U6B:5Gg:36T:fBd>F:e:574;fB53e>FBF:S>U>V:fBF>V:U>6?C:e:5Ce> n gBeB36T6e:S>eBV>5?F7e>g:6GT6e>eBU2e>C:S>U>U:U>6?U>eB4?F:f:U6B:5?5?6GeBf> n eBgBD:e:5Cf>gBfBU6e>e>D:E6T>e:fBe6B:D:U6gBU6e>eBg:S>U>f:5CD:5C5?D: n 5GHCU6B6S:E:e2C:S>T>S:U>C:e:f:36T6e>e:f6e:T6e>T2C:S>f:e:f:U6e>e:36g>g:f> n eBD:e:f>g:S>U>U>C:T:36T64?U6e>4?D:f>e:5C5?D:5GgB5CV:f>U>6?g6T:S>5?f:5?U> n eBgBU64;B6D:U:f:D:f:U6BC5?eBgBECU>6?6;S>f23G7Gg:5GiK7?D236S:D:S:36e:E: n T6T2C:U:U6e>e:g>e>D:f:S>U>S:36TBf:SBU>eBgBU6DC5?e>U>g6T:3?fBU>6?g:V2C>U6e> n eF6?eBgFg:5CD:5G7Gg:5GHCgB6?eBg:5C5Ce>D:fF6?eFg:gBGC7?eFE:D23?UBf:5C5? n DJ7GgBGC7K7?FGFGU>6CSFXGHC5GiOHCU636D:C6D6B6S:S2C:S:S6T>D:S:36e:D: n D6T636T6E6B6S:U6T:D:U>U6e:SBU>D:T6e:B6D>T>T6e:S:3;S6D:S:36g:D:U6U6B:V6eBg: n 5?e>FCf:f>D:U:S>U>E:C2S:g:D:U:d:5?e>D:h636C>D:D>e>D:U67?f:5?e>g:S>U>h:f:F: n GC5GgBFGYGg:36B6T:S6D6B6U>S:D:46S>T:D:T6TBf:f:S>T6T>e6D6B64?T6e:e:f>e>D:7? n g:f>e>E:T6g>f>e>U>UB46d:D:T6DCf:f>4?D:5;S>6C5CU>6K7C5Cg:5?U>5?6;U:S:ECf:5? n UB5CgBg:E?S636g:e:U>f:f:SG6C5CgBFCU>6?F?e>57DG7G7?FG6PHCU6D2S>D6D:D62? n U6T6e6B:D6f:D:e>7?T>E6e>T6TBD:D6B>T6BBUBf:fBg:UG6?U>U>4;S:d:TBg>e>6?h6B:f: n D:eBf:S:UFg:UFU:6?6G7?6?YGg>6CT>6?U>5GU>U:SBf:SFg:7C5CGC5KV6T6d:DB5?U> n 5CUFgBU>5?gJ7?gBFKg>eFTFFGXGFGgRYGg:C636D2S:S6D>T6D6B>C2d:S>e:D:4?D:T2d:D: n T6V:S6D6g:D:U6gBf:f>eFg>T>T6e>S63BU:f:f>e>D?C2U>e:D:7?U>f:g:S>h:5G6? n 6C5CVGg:f>E:g>e>U>V>T6T:7?U>g:3?6C5CU>8;D:TBU:UB5?U>f:HC6?6C5C7?eBgB8?g>W> n HGFG7GGC;PHCU:T6c:S>U6e:g>e:C:V:3BU>eBf:DFg:f>SBU:f>D?U6e:DCU:5?eB7Cf: n fBHCg>g:eBV>D67?4?5Cg>eJV:3?eBf:TGg>6CECU>6;SFHG6?6GGOHC5C5;ECfB6?E?g:e> n UGg>FCUBFG7C5?gGf:S>7?4?5G6?U>fKGCFG7CUGgBGCF?eBV?gKHGFGXKWGg:C:S>e2T>S6T: n E6E:e:E:U>3?B6S:S>D:e>R>C:S>U:S6T:f:U>f6e:S:36T6e:e>S:U>F6T>T>5736T6e:E: n U6B6S:S>D:T>U:S6e>U>e>D:U6T>g:U>57e:T6e>e:B6D:f>T>e:e:D:U6T6BBD:S:T> n e6T6T6B:DB5;D:U6e>D2S:SBD:f>CBg:5?e>6SYGg:D:D:46T:S6B>C636C>T6e>T>D:D:5; n 36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2S>C2C>D:e:e:S>D?T6U>D:D:h:U:U6F:S:h:3? n 6?FCf:UCU6T:46U:S>D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5?eBW>e>D:8?e> n W6FGFK7C5GkK7?D6C2S6B:D:C:U:S636E6B>D:U:U6eBU6T:B>T6T:3;D:C:3?T6e63?5?eBU> n 7?U:U:S:E:C2g:e>e>U>UFE6c:U:U6DCf:f>4;D:D?TBFC5GgB5K7?e>f64?U>f:5;U:S:DCf: n 5;DB5CgBg:UCT6D6g:e6g>g:5?TG6C5CgBF?U>f:UCfBE;DK7GHC7GGTYGg:T6S>D2U:U:3? n T6T63;C:E25?U>e:7?D:E2e>T6TFU:U:SBD:SBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5? n U>eFU>e:DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e:4;SBDCgB5? n eJg>gBf:5K6?U>5O7C5KfJWGHCWG7K7?D2C6T>S:56S6T:e6T>e6S:U>E6B6D:f:U>E:U:D:e: n 46S6T>U:U>T>D:T6T6BBfBU>f:f:S:U>fBT6T>e>e6S:D6B6D:g:D:e:U:S:f:U>f:f:S>EC5? n 6CT>f>e>gBE:T6T>g>U>f>e:f>e>D:V2C:S>T>T:S:D:D27?f:f>e>g:S>U>V6T>566C5CU>6? n YGg:S6D:U:T6B:T6U>C:U>T6e6T:D6B6TBf:e:T6T6D:e6B:T6T6S6e:f:D:e>D:7?g:e>e: n E6e:T:f>T6T>UBT6D:D6B6e:D2C:3?D:3?e>U>5CU>UJ7CfBg:T>U>e>6;S:S6e:T64?UBf: n fBg:E?36T:D6e:U:S:f:3?e:S:U>DCU>e>F?T6473?6G7?6?eK7?D:B:S6C:C2S6T646S6T6D: n e:S6D6B6U:S:C:D6B:D>C2C6T>D:T:S>e:D:T64?e:S:D:U2C:d:e:D:T6T6V6D:S6D6BBU:S: n D>D2SBD:5?U>f:f>7?U>f:S>T6e>e>S636TBU:S>T6U>f:f:SFU6B6d:S:d:U:S:UFg>U>f: n fBU6e>eFU>TBTF6?6C5CgRYGg:C6T6T:U:36e>e6T6e>S:d>U6e:D62?U>U:f:C:f:V:36e>g: n S>U6eBf:D:eFgBU>U:5?S:SBf:U:f>T6D?S:U6e:D67?T>f:g:S>E23G6?U>5CVG6?6?U>g: n eBg>V>D6e>7?T>g:e>6Cf:U>8;D2SBU6U:5?U:S:HCg>6Cf:7?eBg>V6e>W>HG6?6GGCYGg: n 36B6T6S6T6B:U:S6D:46S>T>D:f:DBU6T:S>T6e:d6T6B:4?T647e:5Cf:D:7?U:U:S>E:S6g: n f>eBU>TB46d>D:f:DCf:5?D;U>5;S>FG6?U>5K7?e>f64?U>g:5;U:S>DCf:5;DB5GgBf:E?S: n 36g:47U>6?U:SG6C5GgBU?gBg:E?eB67DKHG6?6G7PHCU6C6e:B:T6D2d6C6B:d6C:U:e:S:S: n V6B6D:D:C:3BT6D2SBD:C>BBU>U>f:D?T6S636e636d:S:U:U6e:h6C>e:S:SFU>T> n DBS6TFU6gBgB6?U>8?D:T:B>T6e:SBT6T6DBU:S>C2g>g:5?eJV:T62;S>2?e>e>UJg>g>g: n 5Ge:f:SJg:fFDBGCGG6?6WkK7?T6B:E:S6e:3BT:C:T>36T6dBU6T>E?D:e:S:U:S6V6T636U: n 36F:7?e>6?fJg>T:T6TBD6T>T:5?U>eBE?36e>T6T>g>D:e:W>e:8?DC5CGC6?fGg:f>E:f>e: n U>h:e:D:g>D:V:CCgB5GgB8;S:C>T6FBf:fBg:7?g:fB5?iB5?U>ICU>i:7GWKGG6?7?D6e:5? n F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:5CE:U>fBFB5C6>F6S:S>U>D:6;fB5GR>5?3CG:S> n U>g:dBU6T:f:U>e>5CE:U>VB57T6B:D:S>T>5CG>V:U>6?F6T>eBV>5?F>g6B:D:U6e6e:f>3? n 6>C6T6e>e:G:T>U>V6D:f:f>eBV:e>D:U6T>fK7?T:S>e6S>T6T6T2D:S:T:U>4?S6B:S>E6S: n S>36C:D>T6T6e>U>U:S>D:D:f:3;S:B6D:U6D:T>e6D6D2S:V:U:S6B:SBD:D:U>B6SBT:U>U> n g:D:h:D:e6S:C2S:S>C2C6T>D:T:S6U:U6e:SFU:S:d>e:d:S:S>UF5;U:U6eBS6T6BFU6TB3> n 6?FCf:5WkK7?U>U>E:e>e:SB4:D:3Bf:5?eBU>U>F?C6c:e:U6T6h>e:S>h:U6F:7?6? n FCfJV6R:S6SBT6DBD:5?e>eBUCf:gBU>U>8?g:f:W>D:8?DCGCWG6?gGU6D6E6U>T>D:h>e:S: n h:U:F:CC5C5Gg>I?U>DFU>FFgBgB7?I?FC5C5GiBU>U>IC5Ci:WKWOHGFKYGg:C2S6D6S636C: n D:B6D:D:S:U6D6D2S>T6T6S:C2C:d636C:e:S:T6e:e:S>D:g:U6T:S:46S6U:U:S:D:DBD: n S6D6D23?T6T:d6363;S>5?eBU>eFg>e>U6e:D:e:f6D6B64?T6e:D>e>U>U6D?C2C6U6T6U: n U6e:CCf>e>U>5;D:T6D?T>473GgB7?gB6PHCU:S6e:S6D6T6d:D2S:e:S>T6e:D:S6g:C:T6S: n C2CBD6T6S>36C>SBf:U>D:ECf:D:D:d6B:T6S>U:S:U6h:S:e:D:SBD:S63BT63FU:6?gBU>g> n HCU:f>C:f:D:eBD:D6B>D6BBT6g>e>g:eJV6S:d6B>3?U>e:SFU:U>T6eFf:D:eJg>eFTFFC7? n FCgRYGg:D:D:46T:S6B>C636C>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C: n C2S>C2C>D:e:T:S:D?T6U>D:D:h:U:T6F:S6h:3?6?6?f:UCU6T:46U:S:D:V:S6C6g:D:E62? n f>e>U>8?D:3BD:5BU>U>U>8?5?f>e>W>e:D:8?e>W6FGFG6C5C;PHCU:T6d6S>U6D:V:T6B:V: n CBU>e:f:DFU6T>S>D:T:C?U6D:D?D:47cB5Cf:f>8?U:U6S>V:36g:d:f>U:SJV:3?e:f:TCU> n f>D;S>4;SFFG6?6C5O7?e>e64?T>f:D?U6T:DCU:5;C>6Cg>e>gGf:S6h:375?6?U>fG6?6Cg> n T?eBf:D?e>T?DKHGFG7G6PHCU6C6B:36T6D:e:C:C2d636U6e:f:S:g:S646U:S>DBT6D:DBU: n S>DB5CU>f:ECU6e:D:f6D62?T>U>g:U:h63>e:f:SFg>eBUBU6eFU>FGgB6?6GHCU>T>SBf:5? n eBe:D:UFg>eBT6gB7?g>eJV:S64?T>4?6?e>UJ7CgB7?gFg:5CfJgBgFeJHCGGFGHWkK7?T:D: n E6d>e:SB4:D:3BT64;dBU>U>E?C6c6d:U6T6h>e:S:h:U6F:7?6?6?fJV6R:S6SBT6DBD:5?e> n e>UCT6gBU>U>8?g:f:W>D:8?DCGCGC6?gGU6D6E6U>T>D:h>e:S:h:U:F:CC5C5Cg>I?U>DFU> n FFgBgBg>I?FC5C5CiBU>U>IC5Ci:WKWKGGFG7?D2S:e>F>57T>e>SBe>gBR>5767D:e:5;e> n 675;e:fBE6T>e>V>5?F>F2C:S>D:U>6;fB5CS>5?4CW:S:U>g:R>E6D:e:f:e:fBU:U>UB57T: n S:36TBfB5CW>g>U>5?V6T>e>g>5?V>g:S:U>U6e6S:U>e>F>36S6e:3?V:S:U>g:D:e:f>e> n V6e>U>U6e>eK7?D236S:D:S636d:E:T6T2C:U:T6T:S:g>e>D:U:S:U>S636SBU:S>T>e>U> n U6DC5?e>U>f6T:3?f>U>f:f:V2C>T6T:SFg>e>UBT6TBD:5CgBg:fBHCgB6?eBf:fB5Ce:D: n eFg>eBf:gB6?6?eFE:C23?T>e:f>e>DJ7CgB6?6Gf:f>eFU>fBSFGCGC5C7SYGg:S6B: n U6S6T63Bf:S:S>36T6d>T6T>DCU:f6S>U:S:V6T636U636V:g>e>g:eJ7Cf:f:UBD:D>T:6?U> n 5?D?36e>T6T>g:D:T6h>T6h:4C5C7?5CfK7?5CV:5Cf:fBh:f:D:g:D:h>DCgBFCfB8;S:C> n D6VBf:fBU:7?f:f>e>8Cf:fB8?U>W:7GWG6G7?kK7?D6C2S6B:D:C6U:S636E6B>D:U: n T6TBU6T:B>T6T:3;D:C63?T6e63?f>e>U>7?U:U:S:E:C2g:e>e>U>UFE6c:U:T6DCf:f>4;D: n D?TB6C5CgB5K7?e>f64?U>f:5;U:S:DCf:5;DB5CgBg:UCT6T6g:e6g>f:f>TG6C5CgBF?U>f: n UCf>E;DG7GGC7GFTYGg:T:3>D:f:S:4?U>D64;D2g:U>f>T67?e>E:g:e>UFf:S:TFg:eBD> n 6Cg>e>VG6?5?T>5;U6CCUBfB6?U>8;DBU>f>TJ7?5CgFU:fBD:GG7C5C7GYGgBgBeFg>6CfF5? n T>fJ7?5GU:6GGCgB5Oh>D:DCUBeB6Cf:fNHG6GGCgJg>6CfFU>fJfJXG7GWGHK7?D:U>eBd> n U6e>U:4;eB57U>6>E:T6T>f:f>F>E:U>e>T6e>U>S:U>eBD6B6T6eBfBV:5?g:T>g6fBT6D:e> n e6U>B:T6T>D6D:e:U>e:5?V:S:f:S:CC5?5Ge>e>e:fBE6e:U>T:U>fBf:D:e>D:V:S>f6T>e: n C2C:D:U>D2C:S>g:S6T>g:U>U:U>5CU>U6;PHCU>D:5?D>e>T67?U>U:V6e>BBg>e>gJ7?eBD> n 6?U>E?e>T647T6C?ECgBFCfBYGgB5Cf:h:f:F:DG6?6GgJV6eBg>e>F;f:D:TCg> n TCfF7GWG6G7SYGgBF?4G7C5CWC5Cf:E;f:TCgJGCGK7ChGU>U:F:D?7C5C7?U?4Cf: n fBgG7C5ChG6?V?UGXOHGXGFTYGg:T6S>D2U:U:3?T6T63;C:E25?U>e:7?D:E2e>T6TFU:U: n SBD:SBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5?U>eFU>e:DFf:DJg>GC7GgB7CYGg:fBD> n 6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e>4;SBDCgB5?eJg>gBf:fJ6?U>5O7C5KfJWGHCWG7K7?D: n E:U>R:E:S>e6d6T>e6e:EB56D:D:T6T>5:E6D:f:D:S:e>e:f>S>D:C2C:T>T>E:e:57S:U: n fBC2S:S:e6e:36C:D:U6T:f:D:S>f:U>T6T:S:4?e:fBS>T:S>U>46S6e>U:U>T>T6T:S: n 36V6D:T:U>S:T636S6gBT6T:S:U6B:D:V6e>U6g>e>U>f:YGg:S:e>D>57T6eBTBe>eBT>U: n 67B:f:D>e>675;D:5Cf6T6eBg>U>V>D:U:C2C:g>6;f:5GT>U>5CU6S>U:SBT>U6B:f:4?D: n 5Cf:S>V:S>g>T6T>fFgB5CU>g>T>6?f6T6eB6?U>g>e:e>U:S6D?S:S>f>T>S>T636CCg:e>U: n 3?D:f:e6B:47DCg>e>6CUGg:36C:e6T>B6D:U6E:e:E6T>e>D2S:S:U:e>S>D:S>U:B6D:f>T> n e>e:S>U:C23?e>S:U>V6T>e>5;D:U6T:E6T:D2S:SBU:S>UBS6e>U>eBg>T6T>7?U>5;e>T6e> n e>S6D:fBU>e>e:U>g:U:SB46S6e:e>T6e>T63Fg>U>g:UFe:f:SBD:f>BBGCg>e>6OHCU6T: n eBC:E6e:S:R6D:U:T:U>E:36T>f6C:D:E2S6T6E6S:S>U:U:D:U6T6T:CBD:46S6e:S6T:U> n S6S6B:5;T:D:36D:V6D6e:56D:V>e:f:f>T6D?T6T>C:D6B:D:U6B6S:U6T:D:d:e:S>U:h6C: n D>T>D>D:U>T6h>e:e:S>F:U:36h:S:F25C5Cg>e>kK7?e:D:U:U6B:U6E>D:f>T6e6T:U6B: n UBT:e:U6S:D:e6B:T6T6S6e:5?D:e>T:h:f6T>e:U6e>T:U>T6D:UBT6D:D6B:f:D2C:37D:C? n eBU>5Cf>TJg>e>V:T:D:e:5;C:T6e:T6e:UBf:U>g:E?36T:D6e:U:S>g:3?e:S:U>D;U> n T6TCU6D;3?6G7Cg>4PHCU>S:e:T>D6e:e:E:e:f:T>e>e:D2S>g>e>T>T:S:SBD6T:D>T>e> n eBf:S>g:EC5?e>U>f6T>e>5?U>D:f:h:T:e:D2SBf:S:SBT6TFU>6?eB7?g>HCgB6?e>f:f: n 5CT:D:DBf>eBf:gBU>6?eJV6S:e:e>4?U6eBUFgBU>U>gFf:f:eJg>DFUFgBWGFCgNHCU646D: n C6D6B:S:S2C:S:S6T>D:S:36e:D:D6T636T6E6B6S:U6T:D:U>U6e:SBU>D:T6e:B6D>T>T6e: n S:3;S6D:S:36g:D:U6U6B:V6eBg:5?e>FCf:f>D:U:S>U>E:C2S:g:D:U:d:5?e>D:h:36C>D: n D>e>D:f:7?f:5?e>g:S>U>h:f:g:GC5GgBFCkK7?e6e:T:e:D6T>U>S:T>U>T>g:T>U6BBf:f: n e>T6T>4;D6T>5?T>f:e>6?D:U>7?g:f>e>E:T:g>f>e>U6TFU>e:T>U6BCf:f>4?D:4;SBGCU> n gBFK7C5Cg:5?U>5?4;U:S:ECf:5?UB5Cg:f:UCU6S:g:e:fBg:S>UG6C5Cg:ECU>5?D?eBE? n UK7?FCGKGTYGg:T>D>f:U6B:5?V6D:5;T6f:D:U>D27CU>f:T6T6eFU6B:eBD6T>D:5?g:S> n VGFCU>e>4;S6e:T>e>e>D:8;T>D:U>DFU:e:DBU6D>36FC7?eBGCYG7?gBU>U>U>gFU:S:SBU: n SBU:5C5CU>5Oh:364;C>T>gBU6eJg>fBf:UFg:U>fBD:fFeJWGgBWK7CU6S>gB7G4ChB5CF7E? n 6GF;FChJW>fBgB7:6GWBh>gBGCdB5CFGDCGG3GT:f:5C57dFhBFCW75C7;GKe:5C5GF:FCU> n fBgB3?6CGCcB5GCCG6T6e>e:U64CGK4GfB5G7GR>5?FG3C7G3GV6e>eBU>D>gB6;7G3;T>U>6? n eJe>5C5GS>eBgB4?FGd>T6B:D:S:HCU:e:5?F:5;U>U>C>e:f>eB5;77T6e:5;R:f65;S:e>T: n U>U>VB5CE:U6B:S>T:E6f6T>eBS>e>3?66C:D:f>eBU6T6e:f>e>eBU6T:f>f:S:S>U6BBD:e> n 6:E6D:f:U6D:T>U>e>E:U:C:36T64;e:f:4?F:D2S6e:4;G:D:U>g2C6T64;T>f:S>U>g:D: n 5PHCf>e>e:S>f:U6e6S:S:d>U>5?e:S>eBV2S6T>D:36DBf:U6eBU>U>SBU>U>6?D?C6C2C6e: n D:e>e:U6T6e>h>U>e:S>eFU>D:UBS6BFU6gBgB7?U>8;36S:S:S6S6BBT6D2SBD:D>B6g:f:5? n TJg>e:3?e>3?e>eBgJ6?g:f:5Ge:S:SJg:fFDBGCWG6?FSYGg:D:D:46T:S6B>C636C>T6e>T> n D:D:5;36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2C>C2C>D:e:e:S>D?T6U>D:D:h:U:U6F: n C:h:3?6?FCf:UCU6T:46U:S:D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5?eBW>T> n D:8?e>W6FGFK7C5G;PHCf:U:f6D>T>D:V6D6T6g:e>D>g:e:UFU6B>D:e:D:C?T>D:5; n S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJg:e>g:e:E?e:S:C;U:SCUF6GFC5C5O7?D:e6R>U: n S:E?T>T64;S63;DF6?gBU>gGU:U6V6477?5?g:UCeBU>U>U?g>e:fGg>V?DGHK7G7GFTYGg>e> n e>S:f:U64;R:S62?U>g:5?e>e>h6C2U:U>D:DFf:U6eFU>DBSFgBgBg>UCD2T6D63;D:3;S>g: n f:f:8?UB5?e>eJgBU>UFe:SJg:7G7G7CgBI?D:C>C>e:T:SFf:U6TFU>TBS67?6?6?fN7?e:C? n eBCC5C5C5OhB7?6?6K5?e>eN7?6KUFXGXGGCGK7?D6D:U>R:E:S:e6d6T>e6e:EB56C:D:U6T> n 5:E6D:e:D:S:e>e:f>S>D6D2S6S>T>E:e:f6S:U:fBC2C:S>e6e:36C:D:U6T:f:D:S:f:U: n U6e:S64?e:fBS>T:S:U>46S6T>U:U>T>T6T:S:36V6D:T:U>S:C:36D6gBT6T:S>E6B6D:V6T> n E65?eBU>e>kK7?D6C2S6B:D:C:U:S636E6B>D:U:U6eBU6T:B>T6T:3;D:C:3?T6e63?5?eBU> n 7?U:U:S:E:C2g:e>e>U>UFE6c:U:U6DCf:f>4;D:D?TBFC5GgB5K7?e>f64?U>f:5;U:S:DCf: n 5;DB5CgBg:UCT6D6g:e6g>g:5?TG6C5CgBF?U>f:UCfBE;DK7GHC7GGTYGg:T6S>D2U:U:3? n T6T63;C:E25?U>e:7?D:E2e>T6TFU:U:SBD:CBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5? n U>eFU>T:DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e:4;SBDCgB5? n eJg>g>f:5K6?U>5O7C5KfJWGHCWG7OHCU:U>eBS>T6e>T:d:S>f:U>F>D:D6T>e:T:E>46T:S: n U6e>T>T6T:T>U:S6D2SBU>E6e:U:D:f6T>T636S:3;U>C:D6T>E2C6T6E:T6g>f>e:U6e:DCf: n eBT:S:S6T>E2S:D:D6D:U>e:D:e:C:h:S>U:D:T>T6D:36V>S6D6B:V:C2C:h:D:V6gB5?eBf: n YGg:e6e:E6e:D:D:4:S6T:T>e:g6D2S6T>C6T6e6B6S:d:D:D:f>e>T6e:S:S:S6V6T2C:S>D: n S:e:E:C636SBT>T6D2S64;S:S>e2C64;T>e>e>T:SFU:S:E6T636T6e636C:e:S:T6D>T:D: n T6D?T6T6f:U6U6T6T6D?V>T:D:47D:C2C?D:47cBgBg>U>5PHCU:S>T:T>T6S:f6E:D:f:U:5? n D:S:S6V:e>T>D2S>UBT6S:fBU:f>D:U>U:S:D?e>S:S>g6T6e>U:S:T636h:U>D:S:SFU6T> n UB36e>C6gBg>e>U>8?U>U:e>D6e>TBT6B:fBU6e>D:e>f:D:eJV:C:4?T>T>e>T6TJ6?e>f: n DFD:U:CBD:DFDBGCgB6?gNHCU636D:C6D6B6S:S2C:S:S6T>D:S:36e:C:D6T636T6E6B6S: n U6T:D:U>U6T:SBU:D:S6e:B6D>T>T6e:S63;S6D:S:36g:D:U6U6B:V6eBg:f>e>FCU6T>D:U: n S>D:E:C2S:g:D:E:d:5?e:D:h636C>D:D>e>D:T67?f:5?e:g:S>U:h:f:F:GC5CgBFCkK7? n T6T:U6T:D:D:E6C6T6U:e>U:U6T6TB46D:T:S6B:3;D:D:5;S:e64?e>e>T:h6C636C:E6S:U: n U>D:D:TFU:e:U6T6D?e:S:37D2C?DB5C5Cf>eJV6B6T6T6D6D23;D:364;S6d2CBU>U>f: n TCT6T6V6e6g:f:f:TCfBU>U>E;U6T6TCU>E;3G7G7CgBFTYGg>T6e>T6D:f:3;D2S>e:S>T65? n D:T6h6D:T6S>D2SBD6T:S>36CBSFg:f>D:UCT:D6T:d6B:T6S>g:S:U6h:S:e:D:SBD:S63Fe: n 3Jg:7?6CU>g>I?D:e>D:e:D:SBD:D6B>D6BBS67?e>g:fJV6S:e6B>3?U>e:SFU:U>T6eJ5?D: n eN7?eJUFFG7?FCgVkK7?U>T>E:e:e:SBT:C:TBU:f>eBU:S>D?D:e:T:U:36h:e:S6V6T:F:7? n U>g:fJg>T:T6TBD6T>T>5?U6e>TCU:fBU:S>h:U>D6W>T68?DCgB7?6?gGg:f>E:f>e:S>h:e: n D2g:D:V:CCg:5CfBI?T>DBD:FFg>eBU>8?5?g:eBiBf:S>ICf:i:GCWGFGFCkK7?T6T6T2S:D: n 36E6C2C6U:S>U:U6T6eBD2C:S:S6S62;D:364;S:d23?e>eBU:h:D6D6B:E6B6U6T>T>D:UFU: n d:U6T6D?e:e:37D:D?DB5C5Gg>eJg:S:T2d:D:U64;D:C:3?T6e63BfBU>g:UCU6D2V6e2g:f: n 5?UCfBfBU>F;U>U6TCU>E;3G7GHCgB7?D2S>fBF;6Ge>gBF>hBFCG>6GDGe: n fB5GSBFG4GfB5C73e>gBF76GF7F;S:U>g:U:EG5C7GG>6GVFW;U>5?FCC>6;e:fB5;fB5C775? n 677GB6D:U6T>U>6GW;F?5?6GF7e>gBF;6GF;FCD:e:5?e:R>5?FBF7V6T>eBU>D;U>5?F;e: n fB5;gBF7e:T6T6B:DJ7?D2C6T>S:56S6T:e6T>e6S:U>E6B6D:f:U>E:U:D:e:46S6T>U:U>T> n D:T6T6BBfBU>f:f:S:U>fBT6T>e>e6S:D6B6D:g:D:e:U:S:f:U>f:f:S:EC5?6CT>f>e>gBE: n T6T>g>U>f>e:f>e>D:V2C:S>T>T:S:D:D27?f:f>e>V:S:U>V6T>566C5CU>5?YGg:S6D:U: n T6B:T6U>C:U>T6e6T:D6B6TBf:e:T6T6D:e6B:T6T6S6e:f:D:e:C:7?g:e>e:E6e:T:f>T6T> n UBT6D:D6B6e:C2C:3;D:3?e>U>5?T>UJ7CfBg:T>U>e>6;S:S6e:T64?UBf:fBU:E?36T:D6e: n U:S:U63?T:S:D:D?U:S:E?T6473?6Gg>6?eK7?D:B:S6C:C2S6T646S6T6D:e:S6C6B6U:S:C: n D6B6D>C2C6T>D:T:S>T:D:T64?e:S:D:T2C:d:e:D:T6T6V6D:S6C6BBU:S:D>C2CBD:f>U>f: n U>7?U>f:S>T6T>e>S636SBU:S>T6U>f:f:SFU6B6d:S:d:T:S:TFg>U>f:fBT6T:SFU:TBDB6? n 6C5?gRYGg:C6T6T:U:36T>e6T6e>S:d>U6T:D62?U>U:f:C:e:V:36T>g:S>U6e>f:D:eFgBU> n U:f>S:SBf:U:f>T6D?S:U6T:D67?T>f:V6S:E23C6?U>5?VG6?6?U>g:e>g>V>D6T>7?T>g:e> n 6Cf:U>8;D2SBU6U:f>U:S:HCg>6Cf:h:e>U:V6T:W:GG6?6GFCYGg:36B6T6S6D6B6U:S6D: n 46S>T:D:T6DBU6T:S>T6T:d6D6B64?T6e6e:f>e:D:7?U:U:S:E:S6g:f>e>U>TB46d:D: n T6DCf:f>4;D:5;S>6C5?U>5K7?e>f64?U>f:5;U:S:DCf:5;DB5CgBf:E?S636g:e6U>f:U: n SG6C5CgBE?U>g:E?e>57DG7G6?6G6PHCU6C6e:B:T6D2d6C6B:d6C:U:e:S:S:V6B6D:D:C: n 3BT6D2SBD:C>BBU>U>f:D?T6S636d636d:S:U:U6e:h6C>e:S:SFU>T>DBS6SFU6gBgB6?U>8? n D:T:B>T6T:SBT6T6DBU:S>C2g>g:5?eJV:T62;S>2?e>e>UJg>g>g:5Ge:e:SJg:fFDBGCGG6? n 6WkK7?T6B:E:S6e:3BT:C:T>36T6dBU6T>D?D:e:S:U:S6V6T636U636F:7?e>g:fJg>T: n T6TBD6T>T:5?U>e>D?36e>T6T>g:D:T6W>T68?DC5C7?6?fGg:f>E:f>e:U>h:e:D:g:D:V: n CCgB5CfB8;S:C>D6FBf:fBU:7?f:f>e>iBf:U>ICU>i:7GWGFG6?;PHCU:D6e:S>T>T6g>T:D: n V6S>T>g>D:fFg:f>S>f:U6D?T>T62?T64;DCg:5CfBHCg>f>e>V:T6g>5C5?eBgJV6d>g>D: n ECf:f:D?U>TCfF7?FG6G6OHC5C6;5CgBU>F?f>e:CCf:E?UFFC5G7?gGU:U:g:4;7CU>6? n UG6C5CfBVCgBU>gG6?T?UGFKHGHGFCU6eB5?F;6CU>6CE>h>FCWB5G3Ce>U>5CTB6G4CeB5? n 67U>6C53fB57F;T6T>U>g:EGfB7GF>5GFBF;U>e>6?TB57e>U>57T>e>g:5?g:7GC2C:D:U:g> n 6CW;6;5?gBF;T>gB57fB5;FCD:S:f:e>d:5C6>57V:D:e>e:37D:e:5?e:U>5?gB5;f:S:f:S: n 3RYGg:U>eBU>T6e>TBf:S>f>U>V6e>T6T>DCU:f>T>U:S:V6e>T>56T:V>g>e>g:eJ7Cf:f: n UBD:f>S>6?U>5?D?U>e>T6T>F:D6B6h>T67?5C5C7?5CfK7?5CV:5Cf:fBh:f:D:F:D:h> n DCgBFCfB8;S>U>B:VBf:fBU:W6f:D:e>8Cf:fB8?U>W:7GWG6G7?kK7?e6T:U6D:C:D:U:36T: n U6e:D:U:S6DBU6S:D6T6363;C:D6e6B:d64?U>e:S>7?U:S:S6E2S:D6e>T6T>DFU6T:U:S64; n S6D62;D6B?TBgB5?eBfJ7?T>f6S>U:S:5;S:C2d:C23;DBf:fBU:UCU6T6E2d6g>e:U6D?T>e: n D:D?U:S:UCf:E?DC7GgB7CETYGg:T6T>T:U:S:3?U6D:5;S:U:U>U>T67?T>U:e:T6TFU:S: n SBD2SBD>6?g>T>VG6?U>T>4;S6e:DBf>e>U:8;S>U>U>TFU6e:DFU:DBD6GC7CfB7CYGg>gBT> n g>U>fFU>T:SBU6SFU:6C5Cg>5Oh:D:4;3BeBgBf:eJg>eBf:DJg>U>fFU:SJfJWG7CWG7SYGg: n S6B:U6S6T63BU:S:S>36T6d>T6T>DCU6e6S>U:S:V6T636U:36V:g>e>g>eJ7?e:f:DBD:D>D: n 6?U>5?D?36e>T6T>g>D:e:h>e:h:4C5C7C5CfK7?e>V65Cf:fBh:f:D:g:D:h>DCgBFCfB8;S: n C>T6VBf:fBf:7?g:fBf:8C5?gB8?U>W:7GWG7G7?;PHCU:D:f6T>T>D6V6D6T6V6e>S>g:e: n UFU6B>D:e:D:C?T>D64;S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJV6e>g:e:E?e:S:C;U: n SCUF6GFC5C5O7?D:e6R>U:S:E?T>U:4;S:3;DF6?gBU>gGU>U6V:477?5?g:UCeBU>U>U?g>e: n fGg>V?DGHK7G7GFCU6eBeB57fBe:5?6:V>5?F>gBDCS>e>e>C>5CdBT>eBg6e:f>67gB6357D: n D:e>U64Ce>gB7:fBEBF7D:f:f>D>g:S:e>e:U>fBg6e:5;gBS636S:D:U:fBF75;e:5C57S:U> n 6;fB575?36T6T:S>T>e>EB53E6S:S:U>D7T:f:f:S6e>e>U>6;U>T6T>e:DRYGg:E:U>46T: n S6B>C636D>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C:C2S>C2C>D:e:T:S:D? n T6U>D:D:h:U:T6F:S6h:3?6?6?f:UCU6T:46U:S:D:V:S:C6g:D:E62?f>e>U>8?U:3BD:5BU> n U>U>8?5?f>e>W>e:D:8?e>W6FGFG6C5C;PHCU:T6e6S>U6D:V:T6B:V:CBU>e:f:DFU6T>S>D: n T:C?U6D:D?D:47cB5Cf:f>8?U:U6S>V:36g:d:f>U:SJV:3?e:f:TCU>f>D;S>4;SFFG6? n 6C5O7?e>e64?T>f:D?U6T:DCU:5;C>6Cg>e>gGf:T6h:375?6?U>fG6?6Cg>T?eBf:D?e:T? n DKHGFG7GVGg:S>fBg:6Ge>eBG>hBgBG>6?DGD:5Cf:TBFG4Gf:5G7;e>eBG;6?F7g2S>U:S:f: n EG5C5GH>6?VF7;S>6?U>E>6;D:5Cf>f:5G7;U>F7U>e:D6B6T>g>6G7;F?U>FG6;e>eBG?6?F; n gBC:f:D:eBT>U>VBg666e>T6TBE;S>6?U>D:5Cf:D:f>eBf:D:e>UFg:36T:fBd>F:e:574; n fB53e>FBF:S>U>U6fBF>V:U>6?C:e:5Ce>gBeB36T6T:S>TBV>5?F7e>g:6GS6e>e>U2e>C:S> n U>U:U>6?U>eB4?F:f:D6B64?e>6GdBT>eBgBD:e:5Cf>gBeBU6e:S:D:E6T>e:fBe6B:D: n T6gBT6e>e>F:S>U>f:5CD:5Cf:D:e>HCU6e>fBW:5;eBU>C>e:5?d>576;U6e>6;R:f65;S>e> n T:T>U>V>5?E:U6B:e>T:E6f6T>eBS>e>3?66D:D:f>d>E6T6e:f:e:eBU6e:f>g:S:S:D6BBD: n e>6:E6D:f:U6D:T>U>e>E:U:D:36e:4;T:f:e>V:D2S6e:4;F:C:U>g2S6T64;U>f:S>U>f:D: n eK7?eBf:5;5?D:5?T:g:5CF>eBc>S>D:5?E>fB4?S>f:f:D:f>e6T>e:5?D2S>D:5;4CT>gBU> n eBF>57T:S:f:E>e2S:D:5;C:S:U>e:UBgBU6T>U:D6h:f>F7f:e:U>5?D:f>e:T>e:5?U:S6e: n eBT6e>E:e:U636e:S>e:36S6eBS6D:eFU>eBU>e>6?f:DNHCU>V>fBd>V:eBf:4;fB5;f>FBF: n U:S>g:fBF>V:U>U>U:e>f:e>gBeBU:36e:fBfBV>5?6;e>g:6GT6T6eB5;f>C:T:S>U:U>U>U> n e>6?g>D:5?e:DC5?6GeBf>e>eBE:e:f:f>gBfBf:U6e>D:h:T>f:fBe>T6B:U:gBU6T6eBV:S: n S>h:f:g:g:5GgBf:HCU6e6e:5:e6D:U>C>S:U>S>e6g2S6T6e:S:f2e6S6e>T6D:T>U>e>E: n U6T6B:U:U:f6T>eBC:e:e>F6B:D:U>S>D2C6T6e:S:e>T6D:f>e:f:S>D:eBU>e>F:U:D:f: n U2C:S>f:e:U:U:S>D:D23;S6T:e:E:T:D2S:3?V:S>D:f:36T64;S>f:3CU>g:fBfK7? n eBeBf6fBe:e>V:V>f>V>g>DCC:e>D:U>5CdBT:e>g>e:e>6?g>6;f:e>D2S>5?5Ce>fBV:f> n fB6;D:e:S>V>g:C:e>DBU:fBg>T:f>U>5CU6e:fB7?gB6;5?f:fBU>S:T>5Cf>5?f>U>f:S: n SFU>T>fBf:U>f:36TFF?U>f:SBU6T>DBD:fBTF7?eB5C7SYGg:f>g:4CU>D:5?E?e:5?f> n TBE2S>g:3?6?VBE:S>eBV:D:fBf:e>e:S>e:36eF6Gh:U>g>U>e:f>D:D:U6D?f>D2S:f:V6S: n f:U6e:T6eB5?D:5CUGFC5?5?e:f:5?V6D:U>U:T>f:U>U>U6T>8;T6e>U:e6e>U6B:hBT:U: n S6g:S6T:E2S:F:7Gg:5G7?YGg:S:e>U>U6T:e>fBD:f>T:f6U:C:e:UB4?e6U2S:D:f6S:e:U: n S>e:U:D:U6B:h>7;S>f:T6e>S:U:D2S>DBT:E6C:S:f6B:S:37T:d>e>U>f:S>UJgBU>V>D:f: n S>g6B:T6T6S6e:U>U6T>D:E?C:T>T6T:T>T6D23;E:U636D;U6B64;S6474?6CU>6?TGg:36C: n e6T>B6D:U:E:e:E6T>e>D2S:S>U>e>S>S:S:U:B6D:f>T>e>e:S:U>D23?5?T>U>U6T>T>5?D: n S:f:E6T:D2S:SBD:S>UBT6T>U>e>gBU6e>7?g>6;e:f:U>5?C:D:e>T>eBf:U>e>g:SB46S6e: n e>T6e>e:3Ff:U>T6eFf:D:eBD:e>BBFC7?eBgNHCU6T:fBT>F:e:e>d:U>f:e>gBV:C:U>6;T> n U>V6T:f:E:e:eBg>g>U>U:f:f:3FU>E:e:5?e:f>gBe:T:S>5;e>U:C:U>h:U:5?F:T>g>f>6? n 6?D:UCf:fBT>U:S>U>V:S:e>g:f>U>4?f>eBU6h6T>TBfBU>T>gBU68C5?f>eBW>f:D:h:e> n F6FGFGg:5CU6S>FCWGiFWC7GGK4KFGHKEKWCY?6CGCW7EGX?WCFCWKWB7GGKiJWKXFi> n 5C5G7GRBXCGKWO4GWGUKjB5G7GH7EK7?6CGCWFFGWKGB7GXJW;e>eBgB57dFWKjF8C7GXGH> n 6GFKXFWGXFH?eBgB7?F:FCGGUGXFf>6?FGFBjB6G7G8>gBGCGFFKHBF:D:f:U>ECU:eB5GF; n 5G5?6?F:gB5CVB7GUGe>eB5GC>5C4GU>fBg:5?6?F;7G775;D:U>g>U24Ce>gBG>gBVFF7T:f: n 5CTB7?e>eB5;gBgB77e>5;6C36D:U:D:E6fBF75;e:5C57e:f>67gB635?C6T6e>e> n eB5CUFF7U:S>eBf>U;f:5?F;S:e>e>f>6;U6T6e>D2SNHCf>U>gBT>g>e>e:S:U>U>5?gFV>D: n U>g6S>T>V6T6e:f>e>eB5?6?T>U6e:5?UB4:D:S:e:e:f:gBS6B:S>4?5?U>D:U>g:f:5?E:D: n g>e:f:5CU6D?C6T>S>36C:D:U:S:S>f:f:D:e:S:S>U6h>U>U>gBT>D:U>g>hFe:S>eBF:36D: n h:S>V65C5Gg>eB;PHC6?6?g:fBgBU>V6f:U66C5Cg>g:5?FGE:D>f>e:S>DCgBU>FC5?4; n EC5C5G7?8;B:D:36g>e:g:fBU>U>6K6C5?g:5?VC5?eBE;U6TCUFFGFK7C5Oh6C2d:e:U6T6D? n U>D:E?e:37DFgBgB7?fG6?g:7?6;7?6?FGgG6GgBgBW?g:f:fGgBV?DKHKYG7GHTYGg>e>e>S: n f:U64;R:S62?U>g:5?e>eBh6C2U:U>D:DFf:U6eFU>DBSFgBgB7?UCD2T6D64;D:3;S>g:f:5? n 8?UB5?e>eJgBU>UFe:SJg:7G7GHCgBI?D:C>C>e:e:SFf:U6TFU>TBS67?6?FCfNh>e:C? n eBCC5C5GgNhB7?6?FK5?e>eN7?6KUFXGiKGCWOHCU:D:U>C:U:S:S:R6D:T:e:UBE:36D:f6C: n D:E2C6T6U:S:S>f:f:D:U6T6e:DBD:46S6T:S6T:U>S6S6B:3;e:D:36D:V6T6e:56C:V:e:f: n 5?T6D?T6T>C:D6B6D:E6B6S:U6T:D:d:e:S>D:h:D:D>U>D>D:D:U:hBe:e:S>F:C:36h:S: n F25C5Gg>eBkK7?f:U>V:U>T>U:E:D:f:f:5;U:U6e:UBD:S:U6S:C:4?T>U:f:S:d:5?T>e:S: n h:T6B:T6U6e>T6T>T6D:3Ff:U:U6e:5;S6B:37T6C?UBfB5?e>eJg:C:U:C:D6B64;C: n D6e6B6d6TBf:U>D:UCU:f:U6e:g:e:U6D?U>D:D:D;U:S6TCU:E;3C7GgBgB5PHCf>e>e:S>f: n U6e6S:S:d>U>5?e:S>e>V2S6T>D:36DBf:U6eBU>U>SBU>U>U>D?C6C2C6e:D:e>e:U6T6T6h> n U>e:S>eFU>D:UBS6BFU6gBgBg>U>8;36S:S:S6C6BBT6D2SBD:D>B6g:f:f:TJg>e:3?e>3?e> n e>eJ6?g:f:fFe:S:SJg:fFDBGCGC6?6WkK7?U>U:E:f>T:SBT:D6TBf:4Cf:U>U>D?C:e:f: n S6T6h>T:S>h:e:F65?6?U>fJV:T:36eBT6SBU:U>e>T6TCf:g:U>U>8?e:f:W6D:V6BCGCgB6? n gGU6T6E:U6T:D6h>D:S:h:S:F2dB5Cf:f>I?U:DFU:F>gBg>e>ICgB5Cf:i:U>U:h:S:i: n WKGCGGFCkK7?T6T6T2S:D:36E6C2C6U:S>U:U6T6eBD2C:S:S6S62;D:364;S:d23?e>e>U:h: n C6D6B:E6B6U6T>T>D:TFU:d:U6T6D?e:e:37D:D?DB5C5Cg>eJg:S6T2d:D:U64;D:C:3? n T6e63BfBU>f:UCT6D2V6e2g:f:f>TCfBfBU>E;U>U6TCU>E;3G7GGCgBGTYGg>e>e>S:f:U64; n S:S:3?U>g:5?e>e>h6C6U:U>D:DFf:U6eFU>DBSFgBgBg>UC46T6D23;D:4;S>g:f:f:8?UB5? n e>eJgBU>UFe:SJg:7G7G7CgBI?C6B>C>e:S:SFf:U6TFU>DBS67?6?6?fNh>e:C? n eBCC5C5CfNhB7?6?6K5?e>eN7?6KUFXGXGGCG[;PHCg>eBV:d:5?TFU:S>UBU:f:3Gg:f> n TCD2d:S>g:S:h:e:S>V6D2W>HC5Cg:5Oh6T6e:3BD6T>36FCU>f:SCU:fBU:U>h: n U6T6iBU6ICUGFG7?FC6LV:C:E2eBU6T>h:e:D:V6D6W>TGgB6?eBI?T>DBD:FFg>gBU>8;5?e> n e>9Gg:f>ZGgB9?HKXGFKGC7?D6e:5?F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:fBE:U> n fBFB5C6>F6S:S>T>D:6;fB5CR>5?3CG:S:U>g:dBU6T:f:U>e>5CE:U>UB57S6B:C:S>T>5CG> n V:U>5?F6T>e>V>5?F>g6B6D:U6e6e:f>3?6>C6T6e:e:G:T>U>V6D:e:f>e>V:T>D:U6D:eK7? n D6B:S6C:C2C6T646S6T6D:e:S6S6B:U:S:C:D6B6D>C2C6T>D:T:S>T>D:U64?e:S:D:T2C:d: n e:D:T6T6V6D:S6S6BBU:S:D>C2CBD:fBU>g:U>7?U>f:S>T6T>e>S636SBU:S>T6U>f:f: n SFE6B6d:S:d:e:S>DFg>U>f:fBT6T:SFU:UBCB7?FC5?6SYGg:D:S>D:S6S:C>T6B:T>D:U:S> n T6D:3?D6T:C:D6B6V6S:C:E2C6E:g>e:U6eFg>T6T6D>36T:C:f:D:e:C?D:T>T6D:V6D6C2V: n C2h:4C5?g:5?UGg:e>E6e>T6T>V6T636U636V:3?U>5?T>8;C:D>36EBf:U>D:h:e:T:S>h> n T6T>8?U>W:7GFC5G6?kK7?T6T6T2S:D:36E6C2C6U:S>U:U6T6TBD2C:S:S6C62;D:364;S: n d23?e>e>T:h:D6D6B6E6B6U6T>T:D:TFU:d:U6T6D?e:T:37D6C?DB5C5Cf>eJg:S:T2d:D: n T64;D:C63?T6e63Bf>U>f:UCU6D2V6e2g:f:f:UCfBf>U>E;U:T6TCU>E;3G7G7CgBFTYGg:T: n C>C:f:S64;T:364;D6g:U>e>T6h:S:E:U6T:DFf:S6TFU6TB3>gBg>e>UCf:e:C:4;D23?D>e> n f:D:8;DBU>e>TJg:f>UFD:TBD67G7C5CgBICU>U>SBU:f>TFf:S:TFg:eBD65C6?U>5Oh>D:C? n DBdB5Cf:fN7C5C6?UJU>f>TFU:UJUFXG7GGC7SYGg:C636D2S:S6S>D6D6B>C2d:S>T>D:4?D: n S2d:D:T6V:S6S6g:D:E6g>g:f>eFg:S>T6T>S63BU:f:f>e:D?C2U>T>D:7?U>f:V:S:h:4C7? n 6C5?VGg:U:E:g>e>U>V>T6T:7?U>V:3?6C5?U>8;D:CBU:EBfBU>f:HC6?6C5?h>e>U>8?5?W: n WGFG7GFGHCU:5?gBW>g>eBg>SBU>6C4?F7g:f:e>g:d>5;g6e>U>U>eBg>F>e>E>V:C:e:S>U: n 6;eB5?d:5Cc>F:T6T>U>4?F:f:e>V:S:e>T:f>eB6;D:S6B:SBU>fBG>E:U>e>V:S>f:E:e:U> n g:C2C:D:5;U>6?d:E>T6S:U6e666C:D:f6T:S:5?f:f>e:U>D:U:CTYGg>e:5?e:U:f:4?T6e> n 4?eBE:5?U>e:7?D:f:e>T6TFU:f:eBC:DBeF6?gBU>VGg:U>U:3;S>f2SBg>e>g:8?e>5?U> n eFT>T6DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBS:CFf:7C5C7?5Oh:e>47SBDCgB5?eJE> n g>e:UJ6?U>5O7C5KfJWGHCWG7WkK7?U>T>E:d:e:SBD:C:DBU:f:dBU:U>D?D2d:S:U:S6h:e: n S>V6D2F:7?5?g:fJg:S6T63BD6T>365?U>e:SCU:fBU:U>h:U6T6W>T68?DCFC7?6?gGg:S: n E2e>T6T>h:e:D:V6D6V:CCgB5?eBICU>DBD:FFg>gBU>8;5?e>e>iBf:U>ICfBi: n GKWGFGFCLTYGg>U:4;DBf:U:h:U:S:h:TBDB5?5?UJg:SBD>U>U>TCf:U:E?D:C;3G6G6? n 5CICU>e:T6h:D:V62?6?g>TNh:4C5?5?UCU>e>T?e>D?TJGKGCFGFSHCU>4;dBf>e>UCf:f:E? n D:D?TBGC7CfB7Lg>e:h:C;FCFCg>gG5?gBg>eC5C5?UCf:fCUKYKGKHKWGg:eBeB57eBe:f: n E6U>e>U>gBDCS:S>e>4:e>dBD:T>U:e:f:5;gBg6e:36D:T>e6d>S:U>F:U>EB53C6T6T>U>g: n S:S>e>U>U>g:S:e>f>D:D:D:36V6T>53e6S6e>e:S6T:f:U>f6e:D6C2C:SBU>e>TB57T6B:S: n TBD7T6e:f>B6S:SBT:f>D:f:f:U6TNHCU:U>g>d>V>T>5;4;f:5;5?UFF6T>U>e6fBF>V:S>6? n U>T>5C5?5Ce:S6T6D:eBTBV>U>F;e>e:6?36e>T64;5?D6T>U>g:e>6?U6eBT:e:f:D:T6D?e> n 6?dBT6eBg>E:D:5Cf>eBe:E:T:C2C:h:U:f>g>e6D:D:S:hFD:e>e:F2S>U:E6S:V:5Cf:f>e: n HCU6S6e:5:e6D:T>C>S:U>S>e6g2C6T6e:S:f2e6S6e>T6D:T>U>e>E:U6T6B:D:U6f6T>eBC: n e:e>F6B:D:T>S>D2C6T6e:S:e>T6D:f>e:f:S:D:eBU:e>F:U6D:f:U2C:S>f:e:U:U:S>D: n C23;S6T:e:E:D:D2S:3?V:S>D:f:36T64;S>f63CU>f:fBfK7?T>e>57e>T:f:U6T:e>T>fB4? n S:S>e>E6e:d>C:D:U>T:f:5?U>f:e>D:D:D:4;R:S6T:U:T>U>57D2S6e:V>f:S:S>eBD:T>U> n S:SBf:U>U>U:D:h6C:e6e6B6S:S>C6T6e>T>T:S:U6T6T:CFU:e>e>e:e:S:S:SF5; n U6T6eBS6B:SFU6eBD>6?6?f:fRYGg>g>eBe>T6eBU>e:S>g:U>F>T>U6e>4;e:E>46e:S>U6e> n U>T6T:U>g:S:D2SFE>U6e>U:D:f6T>e:36e:3;U>C:T6T>E2C6T6F:T6h>5?e>U6e:TCT:eBe: n C:T6T>E2S:D:D6D:U>4?D:e:S:h:S>f:D:T>T6D:36V>S6D6B:W>D2C:8?D:h:gB6?eBf:kK7? n 5;f>V:f>T>U>E>T:f>f>5;g:U6D:fBT:f:f6S:T64?T>U>e>e>f:5?T6e:S:h:f6T>e>U:e>e> n V>T6B:UFf>U:U6D:5;S:e:47T:D?fBf:5?e>eJg>e>V:U:D:D:5;C:T:d:e:f:UBf:S>U:UCU: n f:f:f:g:D:U6D?V>e:C:E;U:36TCU:C;3C5GgBgBfK7?T>S>e6S>T6T6T2D:S:T:U>4?S6B:S> n E6S:S>36C:D>T6T6e>U>U:S>D:D:U:3;S:B6D:U6D:T>e6D6D2S:V:U:S6B:SBD:D:U>B6SBT: n U>U>g:D:h:D:e6S:C2S:S>C2C6T>D:T:S6U:U6e:SFU:S:d>e:d:S:S>TF5;U: n U6eBS6T6BFU6TB3>6?FCf:5SYGg>V>g>T>g>T>e>d:U:f>5?fFV:D:U64;T>U>V6S:f:g>T> n eB6?5?U:f:f:S>UFU>E:T:f>e:e>g>T:e:36D?5?U:D:U6h:e:5?F6T>V:4?6?eBf:UCf:f>T> n U:S:U6V:C:e>g:e>U:e>5?D:U>8?U:UBg>U>U>U6e>8Gf>5?D:W:e>D2h:e:W6FGgB7C5C; n PHCf:5?e>f>U6eBVBT:S>g>U>g:S:f:DFf>e>f:36T>E?U6e>6?T>e:S>fBU6e>8?6;S6e:V: n D:f:T6e:U6BJg>f:S:f:D?D:S>47B:e6CB6Gg:5CfN7CU>e>T:S:S>D?D2S:5;C:e:S:5?g:S> n gGf:S>g:e:e>6?D:UCg:U>U:C;S>T63;S:C;DGHC5G7C5PHCU:S>e:T:T6T:f:E6T:f:T>e:T: n U:S:g>D:T:S6S6TBT6T:e>D:D>T>f:U>D:EC4?36T:d6S:T:S>T:S:D2h:T:T:S:SBD: n 36DBD6CBT:6?gBU>g>H?U6e:D6T:36eBD6C:S>36CBS:f>e>U6eJV:S:e:S>e>e>e:SFf: n U6T6TFU:D:TFU>TFTFFC7?FCg>D2S>6CGKEGiBFCG;VCGKW;FGiJiB5C7GH> n GKiF8C7GWGdBFCGKDGHKDKU>5?FC574K8GWGX;FGH?XO5?6GFK7:FGfB5C7G3C7GWG3GFGTGH: n e:5?e>V:EGXOEK6GFGHKdBFCGKDGHKDKh:fB5GgBC>6GF;GKD?e>gB7?eJ5? n 6GFKdB5C7GCCGKcBC:S>D:f:7?D2S:e>F>57T>e>SBe>gBR>5767D:e:5;e>675;e:fBE6T>e> n V>5?F>F2C:S>D:U>6;fB5CS>5?4CW:S:U>g:R>E6D:e:f:e:fBU>U>UB57T:S:36TBfB5CW>g> n U>5?V6T>e>g>5?VBg:S:U>U6e6S:U>e>F>36S6e:3?V:S:U>g:D:e>g>e>V6e>U>U6T>eK7? n D236S:D:S636d:E:T6T2C:U:T6T:S:g>e>D:U:S:U>S636SBU:S>T>e>U>U6DC5?e>U>f6T:3? n f>U>f:f:V2C>T6T:SFg>e>UBT6TBD:5CgBg:fBHCgB6?eBf:fB5Ce:D:eFg>eBf:gB6?6?eFE: n C23?T>e:f>e>DJ7CgB6?6Gf:f>eFU>fBSFGCGC5C7SYGg:S6B:U6S6T63Bf:S:S>36T6d>T6T> n DCU:f6S>U:S:V6T636U636V:g>e>g:eJ7Cf:f:UBD:D>T:6?U>5?D?36e>T6T>g:D:T6h>T6h: n 4C5C7?5CfK7?5CV:5Cf:fBh:f:D:g:D:h>DCgBFCfB8;S:C>D6VBf:fBU:7?f:f>e>8Cf:fB8? n U>W:7GWG6G7?kK7?D6C2S6B:D:C6U:S636E6B>D:U:T6TBU6T:B>T6T:3;D:C63?T6e63?f>e> n U>7?U:U:S:E:C2g:e>e>U>UFE6c:U:T6DCf:f>4;D:D?TB6C5CgB5K7?e>f64?U>f:5;U:S: n DCf:5;DB5CgBg:UCT6T6g:e6g>f:f>TG6C5CgBF?U>f:UCf>E;DG7GGC7GVGg:S>e:57f>D:f> n T:V:5?F>eBc>S:D:e>U>fBd>S>e:f:D:f>e6T>e:5;C2C:D:5?5CT>gBU:eBE>5;D:S:f:E> n e2S:D:e:C:S:U>e:U>gBT6T>D6T67?g>F;f:f:U>5?C:U>e:T>e>5?U:S:f:SBT6e>E:e: n U636S:S>e636S6eBT6D:eBU>e>T>e>g:e>DJ7?D:E:U>R:E:S>e6d6T>e6e:EB56D:D:T6T>5: n E6D:e:D:S:e>e:f>S>D6C2C6T>T>E:e:f6S:U:fBC2C:S:e6e:36C:D:U6T:f:D:S:f:U:T6T: n S64?e:fBS>T:S:U>46S6T>U:U>T>T6T:S:36V6D:T:U>S:D636C6gBT6T:S:E6B6D:V6T>U6f> n e>U>e:YGg:S:e>D>57T6e>TBe>eBT>U:67B:e:D>e>675;D:fBf6T6e>g>U>V>D:T:C2C:g>6; n f:5CT>U>5CU6S:U:SBT>U6B:e:4?D:fBf:S>U:S>f>T6T>eFgB5CU>g>T>5?f6T6e>6?U>g>e: n e>U:S6D?S:S>f>T>S:T636CCg:e>U:3;C:e:e6B6474Cg>e>gBUGg:36C:e6T>B6D:T6E:e: n E6T>e>C2C:S:U:e>S>D:S:U:B6D:e>T>e:e:S:D:C23?e>S:U>U6T>e>5;D:T6T:E6T:C2C: n SBU:S:U>S6T>U>e>U>T6T>7?U>5;e>T6T>e>S6D:eBU>e>e:U>f:U:SB46S6e:e:T6T:S63Fg> n U>f:UBT6e:SBD:e>BB6?g>e>gNHCU6T:eBC:E6e:S:R6D:U:T:U>E:36T>f6C:D:E2S6T6E6S: n S>U:U:D:U6T6T:CBD:46S6T:S6T:U>S6S6B:3;T:D:36D:V6D6e:56D:V>e:f:f>T6D?T6T>C: n D6B6D:U6B6S:U6T:D:d:e:S>T:h6C:D>T>D>D:U>T6h>e:e:S>F:D:36h:S:F25C5Cg>e>kK7? n e:D:U:U6B:U6E>D:f>T6e6T:U6B:UBT:e:U6S:D:e6B:T6T6S6e:5?D:e:S:h:f6T>e:U6e>T: n U>T6D:UBT6D:D6B:f:C2C:37D:C?eBU>5?e>TJg>e>V:T:D:e:5;C:T6e:T6e:UBf:U>U:E? n 36T:D6e:U:S:U63?T:S:D:D;U:S6TCU6D;3?6GgBg>4PHCU>S:e:T>D6e:e:E:e:f:T>e>e: n D2S>g>e>T>T:S:SBD6T:D>T>e>eBf:S>U:EC5?e>U>f6T>e>5?U>D:f:h:T:e:D2SBU:S: n SBT6TFU>6?eBg>g>HCgB6?e>f:f:5CT:D:DBf>eBf:gBU>6?eJV6S:e:e>4?U6e>TFg>U>U: n fFf:U6eJg>DFUFgBGCFCgNHCU646D:C6D6B:S:S2C:S:S6T>D:C:36e:D:D6T636S6E6B6S: n U6T:D:U:U6e:SBU>D:T6T:B6D>T>T6T:S:3;S6D:C:36g:D:T6E6B6V6e>g:5?e:ECf:f>D:U: n S:U>E:C2C:g:D:U:d:f>e>D:h:36C>D:D>T>D:U:7?f:f>e>V:S:D:h:e:V6FC5GgB5CkK7? n e6e:T:e:D6T>U>S:T>U>T>g:T:U6BBf:f:e>T6T>4;D6T>5?T>f:e>5?D:U>7?g:f>e>E:T:g> n f>e>U6TFU>e:T:U6BCf:f>4;D:4;SBFCU>gB5K7C5Cg:5?U>5?4;U:S:ECf:5?UB5Cg:f: n UCU6S:g:e:f>g:S>UG6C5Cg:E?U>f:C?e>E?DK7?FC7G7?D:5GFCW? n GGgBGGVB8CWGiFFKDG5CgBFGdFGKEG5GFCG;gBGGF76GF;W?f:fBgBW:VK6GHKWBFKWFW? n gB5CGCdFF;5CgBF3fB5C77FC7;HKT6T>U>g>U>GGi?G?FC7GW7fB7GF76GF;WGU>e>6?5;4? n FGGBF;h>U>5C57D;U>5?F;5?gBF;7GF767B6T6e:DNHCU>gB5GeBf:5Cf>4?eB6;gBG:U>U: n fB5?f>VBE:f>e>f:5CfBD:f>fBU:S:U6eFgBV:5?g>U>6;eBf:D:e>4;gBS>U:fB56T:S:V>f: n 6Cg>e>g:e>TG6?5Gf>e>e:fBV6e>U>E:U>gB5?U>5?T>h>eBg:S>f>T6T>D:F:T636S:h>T6T> n 7?U>g:gBFCfBg:YGg:5;f>F:U:T>U>D>D:f>e:57U6T6e:U>T:e6U2S:D:e:S>U:U:S>T:f:D: n S6B:g:f6S>e:T6e>S:U:C2C:DBe:E6T6S:f6B:S:d6T:3?f>U>e:S>TFg>T>V:D:D:S:f6B: n T6T6S6e:U>T6T>D6D?D:f:T6T:f:T6D23;E:T6363;D6B6D?T64;3?gBU>g>4PHCU>e:f:f>D: n e>e:V:U>g>e>e>D:D:e:g>fBe>S6e:fBD:e>e>T6e>U:f:U:C:EC5CT>eBf:e:U>U>T:S:D:h> n e:D:D:eBD2S:UBD:U>T:6?g>T>g>HCg>g>f:U:U>fBD:S>e>T6eBU>f>e>U:eJV6T>f:D>U>U> n T6SFf:S>T63FU:D:TBD6BFTFFCg>FCgNHCU6D:S>T:D2S:D>e6S>e:D:E:T:C2C:4?T:U:D:D: n S:E2S:D:D6D:U>U:S:U:SFg>U6e:U>C:U:T>f:D:e:3;D:S:C2C:U:36S6V:S6g:f>e>g>e> n TGg:eBU:e>T6T>V6T6D:U6D:V>4?U>5?T>h6B:T:C:U>T6T>T6g:U6T>T6h>e:U>h:D: n F6gBFCgBg:kK7?e:U>V:f:S>U:E:T:f:f:5;e:U6S:fBD:S:U6S:S>4;S>U:f6e:d:5?T>e:S: n h:T6B:T6U6e>T6T>T6D:3Ff:U:U6S:5;S6B:47T6D?UBfB5?e>eJg:C:U:C:D6B64?D:D6e6B: n d6TBf:U>D:UCD:f:E6e:g:e>g:D?T>D:U>D;f:U6TCU:E;3C7GgBgBETYGgBf:5?f:D:5?4; n U6eBf>eBD:5?D:f:h:U>f:T>U6eBD:f>e>B:TBeFg:fBU>UCf>D:f>4;S>f6e>g>e:U6h>e:f: n D:eBS:C2CFe:DJg>7?6GgBg>ICU:5?U:f:D:eFU:U:SBC:SBe:7C5?g:5KV6e>f2SB4?U>5? n TFD>U:S:fJ5?U>eN7?eJUFFGHCGCgVkK7?V>fBU>e:e>eBf:S>fBU>g:eBf:S>DCU:f>T>U:C: n h:e>T:F6e:V>7CU>g:5K7Cf:f:UBD:f>T>6?U:5?TCU>fBf:S>W:U:36h>T68?EGgB7?FCgK7? n 5CV:5Cf:eBh:f:D6V:D:h>DCg>FCfBI?T>UBC:VF6?eBU>i:5?U6eB8Cf:eBICg:8? n HCWGFKGCkK7?e6T:U6D:C:D:U:36T:U6e:D:U:S6DBU6S:D6T6363;C:D6e6B:d64?U>e:S>7? n U:S:S6E2S:D6e>T6T>DFU6T:U:S64;S6D62;D6B?TBgB5?eBfJ7?T>f6S>U:S:5;S:C2d:C23; n DBf:fBU:UCU6T6E2d6g>e:U6D?T>e:D:E?U:S:UCf:E?DC7GgB7C5?D:5G5GF;6G5?FCG> n hBFCWB7GUGeB5C5CRBFG4GfB5G775?6CG;7GG7F;U>U>5CF6EG5C7GH>6GVFW;U>6?6CSB7?e> n 5C57gB6G735?F77GD:D:e>U>D:6GW;F?5?FGF3e>gBG76GF7FCD:f:f>e:dB5CVFF7V:e>e>g: n U;f>6?67e:5C5;gBG;g:C2C:T6TNHCU>V>gBC:U>e:S:R6D:U:e:UBE:36T>f6C:D:E2S6T6U: n S:S>f:f:D:U6T6T6DBD:46S6e:S6T:U>S6C6B64?e:D:36D:V6T6e:56D:V>e:f:f:U6D?T6T> n C:D6B:D:U6B6S:U6T:D:d:T:S:T:7?D:D>U>D>D:U>D:hBe>T:S:F:T636h:S:F25C5C5?e> n kK7?e6e:U:e:D:U>E>S:S>U>T>g:S6T6TBT:f:e:36e>4;D6T>5?T>f:S>e>T6T:h:f6T6eBE: n D:f>T6T:D6BFU>e:S6T6D?D:e>47B:f6DB5Cf:f>eJg>e>T:f:C:f:4;D2S>5?D:f:S:f>U:S: n UCU6S:g:e:e:f:U:UCg:f>U:C;S>T63;T6C;3G7C5CgBfK7?D:B:S6C:C2S6T646S6T6D:e: n S6D6B6U6S:C:D6B:D>C2C6T>D:T:S>e:D:T64?T:S6D:U2C:d:e:D:T6D6V6D:S6D6BBU:S:D> n D2SBD:5?U>f:f>7?D:e:S>T6T:S>S636TBU:S>S6U>f:U:SFU6B6d:S:d:U:S:UFg>U>f: n UBU6e>TFU>TBTF6?6C5CgRYGg:E:U>T:T:S>e>C6S>D>T:f>T>D:D:4;B:S:T6D2S:V:S:S> n V6e:U>g:f:f:TFE6C6B:S>C6T>T>e:S:S:C?T:U>D:D:h:U6T6F:36h:3?6?6?f:UCD2C:D:D: n D636V:T6B:V6D6564?e>e>T:8?D:DBD:EBU>U>U>8?5?e>e>W>D:U>8?e>h:FGFG6C5C;PHC5; n U>g:D:S>U:V:36e:U6e:D>g:S:DFE:S:D6e:364;C:U6e6B:37DCU>f:S>8;T:C:T6E2S: n D6eBU6T>DFU6T:U:S64;S6D6B;U6RCUFgB6?eBfNh:S:f:S:U:S64;S:C2d:C237DFg:fBU> n UCU6T:E2d6g>e:U6D?T>e:D:T?g:S:fGg:UCECGGgB7CECU6eB6G7?GK5C5GXB8G7GXBGCUKU> n FG6?dFWKEK6?FKH75C5GX;GCW;77eBg>e>V:VKFGFKYBGChJH?eBGCgBTBG?U>FG6;6? n FKH7gBW3gBS>U:S:fBU>GKH?WCgBWKG75C5GX;GCW;7GS>6?U>5?dBgBWF7;G:5Cf:f>U? n eBGCg:U>FG67U>6;5?T636S:UVkK7?T:f:f>g>D:5C4;f:5Ce>4Cg:U>U:C?fBg>g:S>6?h>D: n 5C7?eBg:5?6?U>fJgBV>U>FCe>eB6?U>f>T6TCe>g:U>U:8?e>6?W6eB66DCGCgB6?gG6?6? n fBg:eBg>h>D:5C7?eBg:fB6Cf:fBI?U6eFg:g>gBg>e>IGgB6Cf:i:5?U:G:U:i: n WKGCGGFCkK7?D6S:S:e:D2S>U>S:S>E:D>f:S>T63BU:f:e>D6e>4;D2S>5?D:f:S>g>T6T>7? n f:U6eBE:D:g>e:e>U:SFE:e:S>T6CCU:f>4?D:f6BB7Cf:fB6K7?e>e:5?T>f:4;U6S>ECU:5; n S>5Cg>e:UCT6B:g:d:eBf:D:TG6?5Cg>DCU>6?5;S>E;UG7C5CGGFTYGg:T:U>S>f:S64;T:S> n 4;T:g>U>e>T6h6S:U>U6D:DFf:S6eFU6TBS>gBg>e>UCT:T6B:5;D64?T>e:f:D:8;TBU>e> n TJg:U>UFD:SBD27G7C5CgBI?D:D>S>D:T:CFf:T6TFU6TB365?6?U>fNh>D:C?DBdB5Cf: n fN7C5?6?UJU>e>eFU6eJUFXG7GGC7CU6B:f>6G4CW>5?F7E?6GF75CWFW>eBgBF:6GWBh> n gBGCR>5?FG3C7G3GD:f:f>e:dFhBFCW75C7;GKe:5C5CF65CT>eBgBe>gBGCeB5GCC76T6T:S: n f:4CGK4GfB5G7GS>5?FG4C7G3GV6e>e>U>4:fB576G3;S>U>f:UFe:5C5CU>eBgB4?FGS>e> n T636S:7?D:5C6Gi>F?5GgBTB5?FC4CF;G?g:5CG7d>6;F?eB5CE>fBgBGBFCV>g:S>5Cf>4:6; n fB5GdB5CDCG:U>U>6;4CV:f:5?V>5?5GF:5?VB77B:e>T:S>C>5CG>V:U>6?V:U>fBFB5C6> n g6D:D:f>f6f>6?3CG>T6e:5?f:W>T>gBW6e:f:f>gBV>D:f>T636SGg:5G6?F?FCU>FCU>7? n FGWB5G3CeBU>FCTB6GECeB6?67U>6C53fB57F;U6eBU>g6EGfB7GVB5GGBF;f>e>6?TB57e>U> n F7T>e>g:5?g>7GD2S>D:U:V:6CW;6;5?gBF;U>6C57fB57FCT:S:f:5?d:5C6>57V:D:5?e: n 37D:e:5?e:U>5CgB5?g:S>g:T63J7?eBhB6G4Ch>5G67E?6GF;6CWFW>g>eBW:6GWBh>gBgBe> n 5C6?3C7G3Ge:D:5?6?eFhBFCG75C7;GKe:f:5Gg:6CT>f>eBe>gBgBeB5CECW:36e:f:5? n 5CGK4GfB5C5GT>5?6?4C7G4GV6T6eBU>V>fB676G3;T:S>g>UFe:f:5GU>e>eB6?6?5?U6eBf> n T67?D:5;5?F>5;U>gBRBe>gBdB5;77e:f:57d>675;e:5CE:U>fBFB5C6>F:S:S>f>D:6; n fB5GR>5?3CG:S>U>g:dBU6T:f:U>e>5CE:U>VB57T6B:U:S>T>5CG>V:U>6?F6T>eBV>5?F> n g6B:D:U6e:e:f>3?6>C6T6e>e:G:T>U>V6D:f:f>eBV>e>D:5?U>TGg:5G5G6;6G5?5CG> n hB6CWB7CUGT>5CU>TBFG4Gf>5C7;5?5CG;7CG767T>U6eBg:EG5C6GG>6CVFG;T>5?eBUB7?T> n 5CU>g>6G7;f>6;gBe>D2S>U>g>6GG;F?f>6Gg:e>fBF?6CF;6CD:e:S>eBfBfBVF67F:e>D: n fBU;e>6?e>T:fBU>U>6?fBg:S>6?gNHCU>6C7?EGgBU>F;VC5?F;6CfFV6eB7?e>GChFV> n eB5Gf>U>6G4?5C3?B:5?D:5C5K8?gB7;gB576CD:U>g:5;6CT6e>6?f:e>6?e:5?d:U>e:36e> n ECFGFCECe:5?FCf:U>gBe>fB4?F:D:U6eBh>f:5;g>33S:f:S>VFC:e>e:U6e:f>T6e>U> n gBU6eB6?HCU6e>5CVBg:f>5CeFU>6Cd>6;g:T>5?g>5C5;g6e>U>V:e>5?F>eBU>F6T>e:S> n VBG?eB6?d:5Cc>F:T6eBU>d>F:T>e>V:S>e>e:f>TB5;D:U6B:fFfFgBWBE:f>eBW:S>f:E:e: n U>g:D2S>D:5;T>fBe:E>C:S:U6e666D:D:57T:S:f>e:f:f:5?D:5CECU6B:T>57fBS:U>F:V> n 5?6:fB3CS6e>eBT>5CdBT>e>g6S:U>6;fB5;57B:D:U6e:5Ce>gBF:fBEBF;D:e:5?4:f6S6e> n e>T>eBg>f:f:gBS:U>D2S>g>gBF;5;f:fB5;S:U>5;fB5?6?D:S:f:S>C:e:U>5;E2S:S> n DB47D:f:5CT6T>5?U>5;S>5?g:S>6K7?D:f>6GeBW>5?5;4?gB675CWFW>T>gBh6fBVBh:f>6? n T>5?5G5C7CeBD6e:5?DBTBV>5?F;5?6;7GS:e>eBg65CT>T>gBg>g>FCU>fB5CV:f:f:36D?e> n 6GdBT>eBgBU>e>5C5?6CeBf:T:S>U6V:fBf>6Gf:C:U>g:hFe:eB5GF:T>U>g>5CU: n 5C5CU6eBHCU:5?6CW:5?fBU>C>e:5?eB5;7;U6e>F;R:f65;S>e>T:U>U>VB5CE:U6B:eBf: n E6f6T>eBS>e>3?66D:D:f>eBU6T6e:f>e>eBU6e:f>g:S:S>U6BBD:e>6:E6D:f:U6D:T>U>e> n E:U:D:36e>4?e:f:5?V:D2S6e>5;G:D:U>g2S6T64;U>f:S>U>6?D:fK7?5G6?F?5CU>6?U:g> n 5GVB5G3Ce>T>FCE>5C4CT>g>g>U>6?5;fB5;5?D6eBU>5;4Ce>gBV>fBVBF7e:e:f>VB57e>T> n 5?T>e>g>e>fB6CU:U>f>D2h:fBF75;e:fB5?T:f>5?fB5;5?f:T6T>gFf:5CU>5?f:C:e>eB5; n D:e:5CS:T>eFf>5CU>5?6Cg:S:C:5GHKYOVKIKWKi? n hGXOiCiKIS9GGKHKYBXO9KIGHKjKEKWKiOgKjOUO6CGCWKW7EOIKiK9@ n WKYCjSFCWKWOXBiK7GGKHKUGXKjKDKWOfKj>6?FGFC7:VKjSVOGKWOYO4GWGiOUKYOUO8? n FGFK7GdFHKXCYOUC6G7GXGDSFGWKWO3GFKHKTGiODGe>eBgB5Cg:T> n FCWGiBWC7G7GeFFCGGEKWCY?6?FCW74CG?WC5CFGVB7G7GiJWKWBh>eB5G6CC>G? n 6GFK4GFGUGX>fBgBG;EK7?6?FCWFFGFKG>6CWFG;S>eBf>e:RBFGXBh>gBGCG>gB6GWFFGGB7; n T>U>6?V:FCGCUGXBf:5?FCVBjBgB7GH:f>6?VB6GGB56D:U:D:UGg>fB5GF;5G5?6?V: n fB5CfB7GUGe>eB5GD:5?4GU>U>g>5?6?F?7G7;5?D:U>g>f6d>e:f>V>gBVFF7T6e:5?fB7?e> n eB5?gBgB7;e>e>6?D:U>g>D:V2T>575;S:e>e:e:f:5;gBg6e>D2S6e:TBfB5CfFF;f:S> n eBfBU;f:5?F?S:S>eBf:5?U:f:5CU6eRYG6CgBgBU>6C5?e>T>U>UB6?6GgBU>gB7;S>e>g: n U6e:6C5?eB6?6?U>g:5?FCgFE6T:S:S>f:f>gBe:S>eBEC6?gBU>gB7?g:5?V>D:7?4?6?FGg: n UC46D:T>D:36D:g>e:S>g:f:E:4?e>eBg:8CgBUBgBUBU>gB7C8G5?eB5GW>D:U>8? n eBW6FGFK7C5GkK7?f:f:U6e>U>D:E6T6T6f>e>g:U6e:5C46D:e:S6B:3?U>D:5?e>e64?e> n eBf:h6C636C:U:S:f:U>D:D:UFf>e:U6e:E?e:S>47D2C?DB5C5Gg>eJV6B6T6T6D6D23;D: n 364;S:d2CBU>U>g:TCf:U6g:f6g:f:5?UCgBU>U>F;U6T6TCU>E;3G7GHCgBGTYG6C5?5?e:g> n g:5;e:e>4CfBf:5?eB5?h6D:f:T>D:UFg>g:5CU>DBeFg>gBU>UCD:D6T63?T>f:S>g:e: n U68Cf>5?eB5GU>D:UFe:SJg:7C7GgBgBI?D2S>D:e:D:SFU:U6eBD:3BS:7?5?g:fN7?5?4? n eBDCfB5?eJg>g:f:fJ5?T>eN7?5KUFWGHCGC7WkK7CgBgBU>5C5?eBD>U>DB6?6CfBU>gBF?S: n d>f:U6e:7C5?eB7?g:V>7?6?6?gJV2S:S6BBf:UBU>5?e>e>TC6?gBU>gB8?g:5?W>D:8? n DCGCGC6?gGE636U:U>D:D:h>e:S>h:U6F:CC5C5Cf>ICgBUFgBVFgBgBgBICFC5C5CiBU>U> n IC5Ci:WKWKGGFGLTYG6?6?5;fBg>U>h6f:T67CfFgB5?6?gJV:DBfBU>e>TCg>U>VCf>D; n 4GFG6?6CI?C>U6D:h>T:h:4?gBg>eN7CEC5?6?gGgB5CU?e:E?DJWKGCGGFS8;T62;4?e:f: n TCg:U>UCU>D;SB7G7C5C6L6?f:8?E;FCGCgB6LFC7G7CfC5?6?UCU>fCUOYKWKHKWGg:T> n eB57eBe:f:E6U>e>U>gBDCS:S>eB4:e>dBD:T>U:e:f:5;gBg6e:36D:U:e6d>S:U>E:U> n EB53C6T6e:U>g:S:S>e>U>U>g:S:e>f>D:D:U:36V6T>53e6S6T>e:S6T:f:U>f6e: n D6D2S6SBT>e>TB57T6B:S>TBD7T6e:5?B6T:SBT:f>D:f:5?T6eRYGg:D:D:46T:S6B>C636C> n T6e>T>D:D:5;36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2C>C2C>D:e:e:S>D?T6U>D:D:h: n U:U6F:C:h:3?6?FCf:UCU6T:46U:S:D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5? n eBW>T>D:8?e>W6FGFK7C5G;PHCf:U:f6D>T>D:V6D6T6g:e>D>g:e:UFU6B>D:e:D:C?T>D:5; n S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJg:e>g:e:E?e:S:C;U:SCUF6GFC5C5O7?D:e6R>U: n S:E?T>T64;S63;DF6?gBU>gGU:U6V6477?5?g:UCeBU>U>U?g>e:fGg>V?DGHK7G7GgK7?fB5? n F;5?U>6?U:f:5CfB5G4?e>T>5?E:U>4?S>U:f>U>6?5;U>U:5?D:U>D:5;d>D:f>T>eBF> n e6T6S:U6gB5;e>T>5?D:D:U>e>TB6?U:U>D:D:h:T:57U2S:D:e>D:f:e:D:T:e>U:S6D2SFf: n 5CU>e:f:S>e:SB47D2S6eBS:C:eFf:eBU>5?g:f:UNHCf>V>gBT>g>e>e:S:U>U>5?gFV>D:U> n f6S>T>V6T6e:f>e>eB5?6?T>U6e:f:UB4:D:S:e:e:f:gBS6B:S:4?5?U>D:U>g:f:5?E:D:g> n e:f:f:U6D?C6T>S>36C:D:U:S:S>f:f:D:e:S:S:S67?U>U>gBT>D:U>U>hFe:S>e>F:36D:h: n S>V65C5C5?e>kK7?f:5?U:5?U:U>E>e:e>fBf>7;T6e:UBT:f:5;C:e>4?U:U>6CfBf:T>e>e: n f:h6f6T6eBU>T>5?U6D:D:SFfBf:T6e:E?T>eB57S:f:DB5Cf:f>eJV:e>T:U6B:f:4;D6T>5? n T>f:S:U>U:S:TCf:e:6?f:e:f:U>UCh:U>U>D;S6T64;36D;3G7C5CgBfK7?T:S>e6S> n T6T6T2D:S:T:U>4?S6B:S>E6S:S>36C:D>T6T6e>U>U:S>D:D:f:3;S:B6D:U6D:T>e6D6D2S: n V:U:S6B:SBD:D:U>B6TBT:U>U>f:D:h:C:e6S:C2S:S>C2C6T>D:T:S6U:U6T:SFU:S:d>e:d: n S:S>UF5;U:U6eBS6T6BFU6TB3>6?6Cf:5SYGg>U>fBT>f>e>e>S:T>U>f>gBU>D:U>5;S:T> n U6T6e:g>e>eBg:f:U>g:f:f:UFE6D6S:S>T:f>U>e:S:S:C?f>U>D:U>h:U6e:F:D:h>4?6?6? n f:UC46D:T:D:36D:V:S:S>V6T:E:4?e>e>T:8?U>UBU>UBU>U>U>8C5?e>e>W>D:D:8?e> n W6FGFG6C5C;PHC6?U>g>U>eBg:V>D:5?f:5;U>g:e>UFU:S:U6e>D:5?T>U:f:S:3;ECU>f:S> n 8;e6B:U6U6e>T6eBU6T:3Ff:U:U6e:5;S6B:C;U6SCUFgB6?eBfNh6D:U:C:U6B:5;C: n T6e6B637TFg:f>D:UCU:f:U6e:g:e:U6D?U>D:D:T?g:S:eGg:U?DCGGgB7CETYG6C5?5?e>g> n g:5;e:e>4CfB5?5?e:5?h6T:f>T>D:SFg>g:UBU>UBeFg>eBU>UCT:D6T:4?T>f>e>g:D: n U68Cf>5?e:5GU>D:TFe:SJg:7C5GgBgBI?D:e>T:e:D2SFU:U6DBD:TBS:7?U>g:fN7?5?4? n eBDCf:5?eJ6?g:U:fJ5?T6eN7?UJUF7GHCGC7SYGg>U>U>D:f>e:S>C:D:D>f:fBU>D:U>6;B: n S:U6D2S6g>e:S>g:f:E:g:f:5?UFE6C6B6S>T6T>U>e:S:S>D?f:U>D:U>h:U6e:F:36h:3?6? n FCf:UCD2C:D:D:C:36V:S6B:V6T6563?e>eBU:8?U>DBU>EBU>U>g>8C5?e>eBW>D:D:8?e> n W6FGFK7C5G;PHC6?6?f:5Cg>U>V:f:e:6CfB7?f:5?eFE:U>5?T:S>DCg>U>FCfB5;4C5CU>6? n 8;T:D6T>g>T>6?f>U>U6eJ6C5?f:5?TCf>eBE;T6D?DFFGgB7C5Oh:S:e:f:T:U6B?U:D:E?T> n 47SBgBg:5?fG6?f:7?5;6?6?eBgG7CgBg:U?f:f:SCU>U?DKHCWG7G7?D6eB5GF;6G5?6CG> n hBFCWB7GUGe>5C5GRBFG4GfB5C775?6CG;7GG7F;T>U>g>F6EG5C7GG>6GVFW;U>5?FCSB7?e> n 5C57gB6G735?677GS:D:U:U>D:6GW;F?5?6GF3e>gBF76GF7FCD:e:5?e:dB5CVFF7V:e>eBf: n U;f>6?F7e:fB5;gBF7f6D2S6S:UJ7?D6D:U>R:E:S:e6d6T>e6e:EB56S:D:U6T>5:E6D:e:D: n S:e>e:f>S>D6D2S6S>T>E:e:f6S:U:fBC2C:S>e6e:36S:D:U6T>f:T:S:f:U:U6e:S64?e: n fBS>T:S:U>46S6T>U:U>e>T6T:S:36V6D:T:U>S:C:36D6gBT6T:S>E6B6T>V6T>E:5?eBU>e> n YGg:e:U>F:U:S>U:D>D:f>e:57U6T6S:U>T:e6U2S:D:e:S>U:U:S:T:f:D:S6B:g:f6S>e: n T6e>S:U:C2C:DBe:E6T6S:f6B6T:d6T:3?f>U>e:S>TFg>T>V:D:D:S:f6B:T6T6S6e:U>T6T> n D6D?D:f:T6T:U:S6D23;E:C6364;D6B6D?T64;3?gBU>g>eK7?T>S>e6S>T6T6T2D:S:T:U>4? n S6B:S:E6S:S>36C:D>T6T6e>U>U:S>D:D:D:3;S:B6D:T6D:T>e6D6C2C6V:U:S6B:SBD:D:U> n B6TBT:U>U>U:D:h:D:e6S:C2C:S>C2C6T>D:T:S6U:T6T:SFU:S:d>e:d:S:S:SF5;U: n T6TBS6C6BFU6TB3>6?6?f:fRYGg:D:U:T:U:C:e>d6T6e>e:eBU6D:D:3;T>U:U6B:e:V:C:e> n g:e>U6e:f:D:TFU>E:D:f>S:S>f:D:T:C2C?e:U6D:D:h:S:f:F2S:E64?6?U>f:UCf:f:T> n U6S:U:V:36T>g:S>U6T>f>T6T>8;D6TBU:U:U>U:S:8CU>f>T6W6T:D6V6S6W6FG6?6C5?YGg: n C2S6D6S636S:D:B6D:D:S:U6D6D2S>D6T6S:C2C:d636S:e:S:U:e:e:S:D:g:T6D:S:46S6U: n U:S:D:CBD:S6D6D23?T6T:d6363;S>5?e>U>eFg:S:U6e:D:T6e6D6B64?T6e6D>e>U>T6D? n C2C:U6T:U:U6T:CCf>e>U>4;D:T6D?T>473GgB6?gB6PHCU:S:e:S:T6T6e6C6S:d:T>f:e:S: n S:V2S6T:D:36DBT6T6eBD:T>SBU>U>U:D?C6C2C6e6C:e:e:U6T6T:h:T>e:S:SFU>D: n DBS6BFU6gBgBg>U>8;36S:S:S6S6BBT6D2SBD:C>B6g:f:f>TJV:S:3;S>3?e>e>TJg>g:f: n fFe:S:SJg:fFDBGCGC6?6WkK7?U:S>U:S6e>DBT6B:U>D:U:dBU6T:C?S6T:C:U6B:V6S:D: n E2C:F:7?e>U6eJV:T6S:D>36T:C:5?D:e:C?D:T>T6D:V6D6C2W>D28?DC5Cg:5?fGU6T>U6T> n T6D:V6T636U636F:CCU>5?e>8;C:T>36EBf:U>D:h:e:T:S>iBU6T>ICU>i:7GGC5G6?;PHCf: n U:f6T>T>D:V:D6T:g:e>U>g:D:UFU6T>T:e:D2C?T>D:3;S:47DCf:5?e>8?U:T:S:V6S:U: n fBf:S>UJg:e>g:D:E?e:T6C;U:SCUF6?FC5C5O7?e>f6e>U>D:E?T>T62?T64;DF6?eBg>gGU: n U6V6477?U>g:UCfBf>T>V?g>D:fGg>T?DGFK7G7GFCU:5GFCW?FCgBGCV>7? n FGhFFKDC5CfBFCSB6GECeB6?6;gBGCF7gB6;F?U:fBU>V6EGfB7GVB5GGBF;f>e>6?eFF; n 5CfBF7U>fBg65Cg:GGD6T>D:U>U:6CW;6;5?gBF7U>6C53fB57FCT:S:f:5?4?FGFB5;g>T>5? n e:D7T:f:5;e>U>5?6C5;g:S6D2S6DRYGg>gB5GeBf:5Cf>e>eBg>gBW:U>U:fB5?e:UBE:f:e> n g:5CfBE:f:fBg>e:U6eFg>U6e>U>U>6;S>f:D:e:C?gBT>U:fBF6T6S:V>U:7C5C5?g:5?UGg: n eBf:e>T6T>V6e>T>56T:V>5?U>5?T>8?eBg>S>fBf:U>D:W:e:D:S6h>T6T>8?U>h:7GFC5G6? n kK7?5;f>V:U>T>U>E:D:f:f:5;U:U6e:UBD:S:U6S:C:4?T>U:f:S:d:5?T>e:S:h:T6B: n T6U6e>T6T>T6D:3Ff:U:U6e:5;S6B:37T6C?UBfB5?e>eJg:C:U:C:D6B64;C:D6e6B6d6TBf: n U>D:UCU:f:U6e:g:f:U6D?U>D:D:D;U:S6TCU:E;3C7GgBgBETYGg>e:f>e:U:e:4;U6T>5?e> n f:U>T>e:h:T>f:T6T6TFU:e:eBD6TBT>g>g>T>UCf>D:S>4;S:f:D>e>e:D68?e>U>T>eFU6D: n DFD:DBT67C7CfBgBICU:U>T:U:D:TFU:S:SBD2SBD:5C5?U:5Oh:T>4;CBeBfBf:eJg>e:f: n DJU>U>TFU:SJUFWG7CGC7SYGg:D:S>D:S6S:C>T6B:T>D:U:S>T6D:3?D6T:C:D6B6V6S:C: n E2C:E:g>e:U6eFg:T6T6D>36T:C:f:D:e:C?D:T>T6D:V6D:C2V:C2h:4C5?g:5?UGg:S>E6e> n T6T>V6T636U636V:3?U>5?T>8;C:D>36EBf:U>D:h:e:U:S:h>T6T>8?U>W:7GFC5G6?;PHCf: n U>g:U>T>U:V:D:f:g:5?T>g:e:UFE:S>U:e:C:D?T>U:5;S:3;ECfB5?e>8;S:C:D6V6e> n E6eBU:U>DJg:f>g:e:E?e:S:C;U6SCUF6GFC5C5Oh:36e:S:U:S6D?T>D64;S627TFg>gBU> n fGU:f:V64;7?5?g:UCeBU>U>U?g:e:fGg>V?DGHK7G7GFCU:5G5GF;5G5?6?F:gB5CVB7GUGe> n eB5CC>5C4GU>fBg:5?6?F;7G775;D:U>fBU24Ce>gBG>gBVFF7T:f:fBTB7?e>eB5;gBgB77e> n 5;6C36D:T>D:E6fBF75;e:5C57e:f>67gB635?C6T6T>e>eB5CUFF7U:S>e>f>U;f:5?6;S:e> n e>f>6;U6T6T6D2SRYGg>V>gBD:f>e:S>C:D:D>f:fBU>D:U>5;B:S:U6D2S6g>e:S>g:f:E:g: n f:f:UFE6C6B6S>T6T>U>e:S:S:CCf:U>D:U>h:U6e:F:36h:3?6?6?g:UCD2C:D:D:C636g: n S6B:V6T6563?e>e>e:HCU>DBU>EBU>gBU>8C5?e>e>W>D:D:8?e>W6FGFGFC5C;PHCf:f:f6e> n U:D:V:T6S:g>TBg>e:f:UFE6T>e>D:S:C?U:D:E?T>47dB5Cf:f>8;T:D2S>V:C:g:e:U>U: n SJg>4?e:f:UCU>e>D;S64;3FFG6?6C5Oh:S:d6e:S:T6C?U6D:D?D:47B>gBg>e>fGg:T6h: n 475?6?g>gG6?gBg>T?e:f:D?D:T?DKHGFG7G6PHCU:S:S:B:T6D2d6C6B6d:D:f:e:S:S: n V6B6D:D:C63BT6D2SBD:D>BBU>U>U:D?D6S636e636d:S:U:T6T:h:D>e:S:SFU>T: n DBS6DFU6gBgBg>U>8?D:S:B>T6T:SBT6D6CBU:S>C2g>f:f>eJg:S62;S>2?e>e>eJg>g>f: n fFe:U:SJg:fFDBGCGC6?6K7?T>gB7C4ChBfBF7E?6?F;FCgJW:fBgBU:6GWBh> n eBGCeBfBFGDCFG3?S:f:U>5?dFhBgBW75C5;GCD:5Cf:f:FCU:fBgB5?5CGCe:5Gd>U6T6D:e: n 5;4CGC4Gf:5G7CT>U>FG4C5G3?66e>T6T>V>g>6;7C37T>U>e>gJT>5C5?U6eBg>T:e>f>e> n T6T:S67?D6e:5?F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:5CE:U>fBFB5C6>F6T:S>U>D:6; n fB5GR>5?3CG:S>U>f:dBU6T:f:U>e>5CE:U>VB57T6B:D:e>D>5CG>V:U>6?F6T>eBV>5?F> n g6B:D:T6e6e:f>3?6>C:T6e>e:G:e>U>V:D:f:f>eBV:e>D:T6T>TGg:eB5CF;5Cf>6?F:f> n 5CUB6GDCe>eB5CD:5?4CT>U>g:f>6?F;gB675;D:U>U>f6d>e:f>F>fBFBF7T6e:5?UB6;e> n eB5?U>fBg:e>e>6?D:D:D:D:V2T>575;S:e>e:T:f:5;fBf6e>D2S6e:TBe>5CUB57U:S>e> n eBD7T:f:5?S:S>eBf:5?U:f:f:T6TNHCfB7C5G5Cf:5Gg:5?eB7;gBGBU>g:5Cf:5?VBE:5? n eBe:5CgBd:f>eBf:S>U6eBTBg:5Cg6U>63fBS>D:5?e:gBS>f:fBT6T:f:U>f:6Cg:S:D2S:D? n d>5G4?S>f:fBT6e>U>S:U>eBf:36e:S>V>eB67U>d:T6T>D:EBB6T:S>F:T6T>h>U>6?U>f:S> n T6YGg>F?6CW>6?fBgBTBf>6C5CF;7;f:U>6?d>6;6;e>f:f>fBgBUB5CV>g:S6e>e>V:6; n fB5Ce>5C3CG:T:S>gB5CV:f:U>g>e>5?f:f>5C6?T6e:S:SFU>5CG>V:U>U>g:T>f>T>5?V>g> n T6B:U:E?f>6?4?V>U6D:f:5;G:T>T>67T>D:E?f>4?e>eBU>U>TGg:eBeB57eBe:f:E6U>e>U> n gBDCS:S>eB4:e>dBD:T>U:e:f:5;gBg6e:36D:U>e6d>S:U>F:U>EB53C6T6e>U>g:S:S>e>U> n U>g:S:e>f>D:D:U:36V6T>53e6S6e>e:S6T:f:U>f6e:D6D2S:SBU>e>TB57T6B:S>TBD7T6e: n 5?B6T:SBT:f>D:f:5?U6eNHCfBhB7CeBhBfB5;4?g>6?FCgJW:U>g:f6fBVBh:e>6? n fBfB5GECFCe>T6e:S>gBTBV>f>6;5?5;7CC:e>D:5?FCU:U>g:6?5?FCU:fBf>f:f:S>U6D?e> n 6CdBT:e>g:U>T>5C5?5Ce>U:e:36T>7?g>g>7Ce:D:U6e>hJT>eBU>F6e>U6V:f>g:5CU>6?e> n kK7?5?FCUB6?g:5GfFf>eB5Cg>7;S>6?UB4C5;6;D:fB6?f:5ChBfBU>D:e>T6eBh>G?e:5?f> n U>4?E2S:f:SF5Cg:S>5?5?T>eBf:S>U:T>fBU6e>TJgBgBUBE:S>eB5;T6e>g>T>U>e6e:U6B: n UCf>eB5?U>S:f:D:E?W6D:U>47B:e:e6S:4;5C7?eBg>eK7?T>eB57f>e:f>V:V:f>V>fB4?S: n f>e>U>U>d>S:e:f>T:f>5;U>U:f:e:D:D:5?5CD:f>T:e>E>e:C:S:U6V>f:S:T>e>D:D:U>T: n T>f>f:U>D:f>7;g:57U2S:D:5?C:T>e:D:T>e>T:S:D2SFU:e>f>e:U:S:S:SB47D2S6eBD6C: n eBT:eBeB5?g:5CgJ7?D6D:U>R:E:S:e6d6T>e6e:EB56S:D:U6T>5:E6D:f:D:S:e>e:f>S>D: n D2S:S>T>E:e:f6S:U:fBC2S:S>e6e:36S:D:U6T:f:T:S>f:U>U6e:S>6?e:fBS>S:S:U> n 46S6e>U:U>e>T6T:S:36V6D:T:U>S:S:36T6gBT6S:S>U6B:U>V6e>E:6?eBU>FCYGg:e:5?F> n 5;U>fBT>e>g>eB5;77T:f:5?T>g65;e:eBf:U>fBgB5CV>g:e:S>U6g6f:U>fBT>5?5CW:C:U> n gBeBU6T:f:5?e>5Cf:U:5Cf>5?eBU6eFV:e>V>V6T:f:f6T>T>6?5?f:f>T>U>U6B?e:f>5?V> n U:U6e>DCh>T>U>6;D6e:E?T>6;4GgB7?eBW6B: n 5GGKiCXOFGHKiFIKiKjFXOgOFCGKWO4KiOVOGKWKY;FGHKi?XOi?iC5C7GHCG> n hOWKYOjFXO8O9D7GWGiKdFXCFCGKW;GKWKY;WGX?YOe>gB7?6GSBXO9DiGWGXOi;FGHKi?XOi? n iKgBFCWGF34GWGiJi?8?6GFK77gC7GWGi;FCGKW;HKi7F;e:5?eBgBU6B:f>6G4CW>5?67E? n 6GF75CWFW>e>gBG:6GWBh>gBFCR>5?6G3C7G4GD:e:5?e:eFhBFCG75C7;GKf:fB5GF65CT>e> n gBe>gBFC3C5CCC76S:f:S>f:5CGK4G5C5C7GS>5?6G4C7GDGV6T>5CU>4:fB576G4;S:U>g: n UFf:fB5Ge>e>6G4?6GS>T:S:36T6HCU6B6S:E:e2S:S:T>S>U>C:e:f636S:f>e:57e:T6T> n U2S:S:f:f:U>U6T:S:36g>g:f>e>D:f:fBV:S:U>U>C:T636S:5?T6T>f>U>f>e:f>e>D: n eFgB5CV:f>U>5?g6T:S:5?f:fBg>e>U>U64;B:D:U>U>D:T6T6BCf>e>U>5;D:e>6;S: n f23CgBg:fBfK7?D:S6e:T:36T:d:E6e:U:S>S:T636S:g>T>T:S:S6T>36T:S:S:S>f>T6T> n D6DC5?T>U>e6S>T:f>U:S:f:V:S6T636S>D6B6TBT6TBU>f:fBU:f:HCg>6?T:f:U>5CD:D:S> n T:SBf:g>e>g:eFE2S:T6T>f:D:e:CBU:D:T6TFf:D:eFU:SBCB5C7?5CUNHCU646D:C6D6B:T: n S2C:S:S6T>D:C636d:D:D6T636S6E6B6T:U6T>T:U:T6T:SBU>D:T6T:B6D>T>T6T:S:3;S6D: n C636g:D:T6E6B6V6e>f:f>e:ECf:f>D:U:S:U>E:C2C:g:D:U:d:f>e>D:h:36S>D:T>T:D:T: n 7?f:f>e>V:S:D:h:T:V66C5CgB5?kK7?D6S:S:e:D2S:U>S:S>E:D>f:S:T63Bf:f:e>D6T>4; n D2S:5?D:f:T>f>T6T>7?g:f:e>E:D:g>e:e>U:SFE:e:S:T6CCU:f>4;C:e6BB6Cf: n fB5K7C5Cf:5?T>5?5;U6S:ECU:5?T>5Cg>e:UCT6B:g:d:e>f:D:TG6?5Cg>D?T>f:4;S:D; n DG7C5C7GgK7?D236T:C:S636d:D:S6T2S:U>T6T:S6g:S:D:U:S:D>S636SBU:S>S>e>U> n T6DCf:e:D:e6D:3?e>U>f:U:V2S>T6T:SFg>e>UBT6TBD:5CgBf:fBHCU>f>SBf:f>eBe:D: n TFg>eBT6gB6?g>eFE:C23?T>d:f>e:DJ7CgB6?gFf:f>eFU>fBSFGC7C5C7SYGg:C6S>46T: n S6B>C636D>C6e:T>D:D:4;36S6T6D6D2V:S6B:V6D656g:f:f>TFU:C:C2C>C2C>D:e:e:S>D? n C6U>D:D:h:U:U6F:C:h:3?6?6Cf:UCU6T:46U:S:D:V:S:S6g:D:E62?5?eBU>8;T:3BD:5BU> n U>f:8?5?5?eBW>T>D:8?e>W6FGFG7C5C7?D:5?gBWB6?eB6?dFfB7G4?F76;f>e>6;4CF;6;5? n gBF>eB6?6>5?FBW:D:e>eBU>G?5GFCd>FC3CW>e:fBg:4?F:f>e>F:e:fBU>gBUFF736S:T> n UBfB6GXBV>gB5CW:eB5?F>5?VB7;S6T>f:f6U>6Cc>FBT:S:f:U6V:S:U>g>U>e>gB5?V>U6T> n D6T62PHCU>e:5?e:D:f:4?U6e>f>eBD:f:D:e:7?T>f:e>T6TBD:f:e>B:TBeBf:fBU:UG6?U> n U>4;S>f6eBg>e>g:h>e:f:D:eBS:C2CFf:DFg>6?6Gg>6?YGg>6CT>6?U>5GU>U:SBS:SFf: n 7C5C7?5KV6e>e2SB4?U>5?TFD>U:S:UJ6?U>5Kg>eFTFFGHCFGgRYGg:E:T>D:S6S:S>T6B:T> n D:U:S>T6D:3?D6T:C:D6B6V6S:C:E2S:E:g>e:U6eFg>T6T6D>36T:C:f:D:e:C?D:T>T6D: n V6D6C2V:C2h:4C5?g:5?UGg:e>E6e>T6T>V6T636U636V:3?U>5?T>8?D:D>36EBf:U>D:h:e: n T:S:h>T6T>8?U>h:7GFC5G6?;PHCU:D:e:T>T6T6g>D:S>V6T>T>e>e:DFg:e>T:U:D:D? n T6T64;364;dBgBf:eBHCg>e:e:V6D:U:3?f:f>TJV6e>e>e:D?D:T:C?T:3;CF7G6? n 5G6OHCfB5;eBf>e>E?e:T64?D6D?TB6?6Cf>gGU:S:V62;5C5?U:UCf:f>U:SCf>e>E?T6T? n UGHG6GHGFCU6eBeB57fBe:5?6:V>5?F>gBDCS>e>e>C>5CdBT>e>g6e:f>67gB6357T:D:T> n U64Ce>gB6:fBEBF7D:e:f>D>g:S:e>e:U>fBg6e:f:gBC636C:U>U:fBF75;e:fB57S:U>5; n fB575?36S6T:S>T>e>EB53E6T:S:T>D7T>f:f:T6T>e>U>5;U:T6T:T6DRYGg:E:U>46T:S6B> n C636D>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C:C2C>C2C>D:e:T:S:D?T6U> n D:D:h:U:T6F:C6h:3?6?6?f:UCU6T:46U:S:D:V:S:C6g:D:E62?f>e>U>8?U:3BD:5BU>U>U> n 8?5?f>e>W>T:D:8?e>W6FGFG6C5CHCU6e>5CUBF;f:5CdF5C5GdBg:G;S>5?U:4CG;F?U>6GV: n f:5CWBgBGB56T>T6T>U>G?6?FGdBgBDGV6e>g>e>dBV:S>5?f>U>6GV>eBF>e:T:C2C: n eBfBFGVBh>eBFCV:f:5ChBgBWB57S:U:S:5;e>eB4CEBB:e:D:4?W6e>g>e:T>5?U:S:f:f>U: n S:U>DCU6B:T>57fBS:U>E:V>5?6:fB3CT6T>e>D>5CdBT>e>g6S:U>5;fB5757B6T>T6e:4Ce> n gBF:fBUBF7D:e:f>4:f6T6T>e>e>e>g:e:f:gBS:D:C2C:g:fBF75;e:fB5;S:U>5?fB5;5?D: n T6T:S>C:e:U>57E2C:e:DB5;D:e>g>S:f>e>U>5;S>f:U:S:UJ7?D:f>5GT>V:5?e6d:U>g6f> n FBV>D:fBV2T>E>V6e:f:T:e>eBe>g>S>D2S:f>T>C>E:e:f6e:f6gBB:S:S>e6f>C:D:U>U:U: n 5?D:U>fBU6T6T:C23;S:fBR>C:S:U>D:S:e>e:f>S>T:S6B:S:V:T>U:fBT:36D:U:VBS6S> n eB56T>D:V>e>U6e>e>U:S:YGg:5?U>V>g:S>g:TBU>6Cd:53f6e:S>g>d>5;g6e>U>U:S>f:E: n e:U>g:36e>e>V:6;eB5?e:5Cd>F:T6T>g>d:56T:S>V6T6T>e:U>4C5?D:e:S:CFU>fBG>U:U> n e>g:S>f:U:f:U>g>T6D:U:5;D:f>S:U>D6B:f:e:E6B6T>57D:e:E?e:5?e:fBU>U:dK7?eBe> n 57fBT:5?U:V>5?V>fB3CS>U6eBU>5CdBT>e>e>T:f>U:fB5;5?T6B:U>6?5Ce>gBV:fBUBF;D: n D:5?V>f6S:U6e>T>e>e>f:fBgBf:S>U:U:7?gBF;5?f:f:5?S:U>U>fB5?6?U>D:f:SFU:e>U> n 5;f:D2S>TB5;D:D:5CT6T:5GU>UBfBU>6?5?UJ7?D:E:U>R:E:S>e6d6T>e6e:EB56T>D:U6T> n 5:E6D:e:D:S:e>e:f>S>D6D2S6e>T>E:e:f6S:U:fBC2C:S>e6e:36S:D:U6T>f:T:S:f:U: n U6e:S64?e:fBS>T:S:U>46S6T>U:U>e>T6T:S:36V6D:T:U>S:D:36D6gBT6T:S>E6B6T>V6T> n U:5?eBU>e>YGg:5;5?E>5;U:fBTBe>fBeBf:77S>g:S>e>675;T:fBf:U:fBgBfBV>U:e: n 36eBg>6;f>5CT>f>5CV:S:U6eBeBU6S>f:3?T>6Cf>U>f>e>5?D:U>eFgB5CV>g>U>5?e6T:e> n 6?f>gBg>e>U6T6D?e:e>5?U>e:U6B:DCh>e>U64;D:e>4;S:5;5Gg:5?gB6PHCU>fBU:6?e:S> n g>h:U>g>f:4?36eBU6gBgB4?S6e:5CT:S>5?U:f:U6e:U6B:ECFGU>eBf>e:U>f:S:S>D:h>f: n 36T>UBD6e>U>T:U:D:5?g:S>g>HC7?g>g:U>U>gBD:S>e>T:e>f>e>e>D:eJV:D:f>T:E:f> n D2SF5;T:T6DBD6D:e>36SBSFFCU>FCgNHCU6T:f>e>D:U:f>5;S>f:T>E>T6S:f>4;g:E>46T: n S>E6T:U>T6e:U>T:S:D2SFfFV6e>U:D:f6T>T:36e:3;T>C6S6T>E2S:T6F:U6f:f>e>U6e> n TC5?eBe:S>U6eBE2S:D:D6D:U>e>D:e:S>h6S:e:D:T:T:D:36V>S:C6B:W:D2C:V6D:F:gB6? n eBg:HCU6B6S:E:e2S:S:T>S>U>C:e:f636S:f>e:57e6T6T>U2S:S:f:e:U>U6T:S:36g>g:e> n e>D:f:e>V:S6T>U>C:T636S:5;S6T>e:U>e>e:f>e>D:fFgBfBV:U>U>e>g6S:S:f:e:f>g>e: n U>U64;B:D:U:U>D:T6T6B?U>T:D:5?D:S:5;S:f23CgBg:5Cf:S> n FKWGiCXK7GXKhFIGiK9KWOUKFG7GWK4KXOVKFKWGX?7GXKW;GKW?iC6?6G7GH> n hOGKYOiFWOiJiC7GFGXG4KW?FG7GW76GFGH;WGH?YOf:fBgB7CTBXK9DXCWGHKi;6GHKW;GKW? n iKgB5CGCF7ECWKXFW?8CgBFGF3U?gBFCW7FC7GW;HKW;G;S:f:5?UJ7?eB7GFK5G6?FG6; n EC5GG?7GX>gBg>6Gg:6ChFV>6C5C4?FG6GS>6C4Gf:e>g:5CfFh>FC7;gBG75Ge>U>5Cf> n 7GeBg>6GD:f>e>fB6?EGW:S:U6e:EC5CFK4CeB5?6Gf:5CgBT>gB5Gg:D:e>eBVB5G77eB4?U: n fBU>5>S:D:e>V>f:fB6CgB5?U>5?T>U6;PHC5?gB7?g>eBg>7?U>6?6?F?eBg>e>gJ7?eBg>6? n U>E?eBg>67e>D?FCgBFCfBYGgB5Cf:h:5CF:EG6?6GgJ6?gBg>e>F;f:D:TCg> n TG6G7GWG6G7SYGgBF?4G7C5CWC5Cf:E;f:TCgJGCGK7ChGU>6?F:E?7C5C7?U?2Cf: n fBfG7C5ChG6?V?UGXOHGXGVGg:5G5CF;5?f>6?F:g:5CVB5G4?e>eB5?D>fB4?S>f:f:U>6? n 57U>g65;D:U>D:f:4CT>gBE>eB6>57T:S:f:UB57e>T>5;D:U>U:e>U>6CT6D:36D:g:f> n F7f6e:U>5;D:f>e6T>e:5?D6B6T6eBf:5CU>e6U:C:e:S>33S:T6T>S:D:eBf>e>U>e:U6e: n UNHCU>gB5C4Cg:fBg:E?5?F;gBFBV:f:fBf:6CWBV>eB5Cf:fBgBe>eB4?S:S:U:5CfFh>gB7; n fB576?D:U>f:5;gBS:f:fBU:S>5?f:5?e>f>e:D6e:DC5CFC4Ce:5?6CU:U>gBe>eB5?V:D: n T6T>h>e>6;f:47T6T>T>VB36T>T6V6e:f>U:D:g>gBf:eBf:HCU6e:U>F>f:S>f:TBT>gBd: n 53f6T:S:f>e>57f6e:U>U:S>f:E:e:U>V636S:U>g:6;eB5?T:5?d>V:S6T>U>d:56T:S: n U6T6T>e>U>eB5;D:e:D:DFg>fBW>E:U>e>g6S>e:U:e:f>g>T6T>D64;D:f>S:U>D6B6T:e: n U6B6T>4;D:e>6?e:f:e:fBf:f:dK7?eB5?F;5CU>6?U:f>5CUB5GdBe>T>5CE:U>4?T>U>g>U> n 6?5;eBU:5?D6T>U>5;d>D:f>T>eBF>e6T6e:U6VB57e>T>5?S>D:f>e>eB6?U:U>D:D:h:T: n 57U2S:D:e>D:f:e:D:U:e>f:T6D2SFf:5CU:e>f:C:e:SBe:D2S:fBS:S>eFf:5CU>5?g:f: n URYGgB7C5G5Cf:5Gg>5?eB7;gBG:U>g:5C5;5?VBE:5?eBf:5CgBD:f>fBg:S>U6eFUBg:5Cg> n U>6;eBe>D:5?4;gBS>f:fB56T:S:V>f:7C6?e>g:f:TCf>5G4?S>f:fBV6e>U>E:U>fB5?U>e: n S>h>eB6;S>f>T6T>D:F:T636S:W>T6T>8?U>7?gBFC5Cf:kK7?F?6CW>g>fBgBUBU>6C5?F;f: n f:U>gBf>5;g6e>U:5?eBg>f:eBf>6?U6e:S>7?6;eB5?f:5Ce>g>T6S>UF5?V:f:T>67S>U64; n f>DC6Cg:5?eBfJ7CfBh>U>U>T>6;S>f:e:e:5?gBf:eBU:UCU>6?U:f>g>D:U6D;U>T6B:E?U: n C:UCf:D?DC5GgB7CfK7?eBe>57e:T:f:U6U6e>U>eBd:S:S>e:U:T>d:B:T6T>D:f:e:D:U:e> n T6D:364?e>C:U>T:S>E:e:D6B6T6V>e6S:C:e>36T:D>S:DBf>f:U>D:U:7?U:5;T6T6D:e> n 36T:S:C:S>e:U:S:U6SFU6e>T:S:e>T:S6BBe6T:C2SBT636SFU:SBDB5?g:5? n URYGgBhB6CeBf>fB5?4?e>6?gBVBU:U>g:5?f>VBE:e>e>g:fBfBf:e>f>f>e:S6eFgBV:f>g> n U>5;f>f:D:D:D?gBT:U:f:V6S>f:V:f:g>5C5?e:5?UG6?5Cf>e>e:f:V6T>U>U:T>g>5?U>U> n T>8?e>g>U:f>g>U6D:hBT>U:36h>T6T6h:D:h:7GgB5G6?;PHC5?gBfB6?e:5?gFf>eB6?g>g: n S>e>UF6C5?6;D:fBF?e:5?6?D:f>T>gBU6eBHCG?e:5?g>U>U>e:f:f:SJ6?g:S>e>E;36eB5; n S>e:TB7Gg:5G6OHGgB5Cf>e>eBE?T6e>67D:5?e>6?6?e>gGU>eBV:d>eB5?D:U?U6e:U6B?T: n S:4;C2C;TGHC5GHGg:S>FKFKW?GKFCWGXB8GWGiFHKgK5GFGFGdFWKEK6GFKH;FCGGX?HKX;W? n gBgBFG7:VKFGHKYBGKhJi?gBGCGGdFHC5CFGF;7GGKH7FCW;HKU>U>5CgBC>GKi? n WCFCWKW75C7GX;GKW;WGU>6?6C5;4GFGhJW;h>5C5C77g?6CGCG35?FGF77GX;7?T6T>f:fJ7? n eBhB7GT>gB5?e6d:U>g:5?gFV>D:fBV2T>E>V6e:f:T>e>eB4?6?S>D2S:f:U>C>E:e:57e: n f6gBB:S:S:f:5?D:D:U>f:f:5?D:U>fBU6T6T6D23;S:fBR>C:S>U>D:S:e>e:f>S>T:C6B6T: n g:U>U>gBT:36D:T>VFS:S>e>56T:D:V>e>U6e>e>e:S>YGg:5;5?F>5;U>gBTBe>eBeBf:77e: n f:f>d>675;D:5Cf:U:fBgBfBV>D:S:S:f>V:6;f:5GT>U>4CE2S>U:SBeBU6S:f:5?T>5Cf:S> n V:U>e>T6T:SFU>5CE>V:S>6?f6T6eBg>U>V>e6T:D6B6D?e:e>5?U>T6T6D:D?W6T>U>47B:f: n e6e:4?eBg>e>U>TGg:S>S>e2T>S6e:E6E:e:E:U>3?B:U:S:D:e>R>C:S>U:S6T:f:U>f6e: n S636S:f:d>S:U>F6T>T>5736T6T:E:U6B6T:S>D:e>U:T6e>U>e:D:T6T:g:T>57e:S6e>e: n B6D:f>T>e:e:D:T6D6BBD:S:T>e6T:D6B6DB5;D:T6T>D2S>eBD:f>eBf:f>e>UNHCU>V>gBd> n U>eB5;T:eBU:f>VBE:U>U>f6S>D>E:U6e>U:e>eBf:5?eBU6T6T6eB4:D:S>e:T:f:fBS6B:e> n 4;f>D:D:U>V6e:f:U>D:6?e:f:f:T6D?C6T>T>36D:D:E6S:S>U:U:D:f:S>e:C6h:T>U>U>T> n U:D:D:hBe:S:S:V:36T>h:S>g:5C5Cf>e>kK7?F?gBW>U>eBg>U>D:5?e:57U:f:e>UBT> n e6U2S>D:f:S>g:U:S>e:5?D:T6B:h6f:S>f:T6e>S:U>D2S>DBe:E6e:S:f6B:U:37e:C?gBU> n f:S>TJV:T>V>D6T:S:f6B:T6T6S6e:UBU6T>D:D?D:f>T6T:f>T6D23;E:T636C;U6B6TCU6D? n 4?6CU>g>4PHC5G5CF;e>f>g:f6U:eBf>fB4?e:S:5?V:e>e>C:U:SBU:f:U>U>g>eBU:S>D:D? n e>S:U>f:T>U>5;U:36T:h>f:e:S6eBD:U>TBS>UF5?g>eBU>U>8?U>5;e:T6T6eBD6T:D>T>e> n e:g>D:f:fJg:e>e>e>4?e:e:SF5;f>D6TFe>D2SJg:DFDBgB7?6?gNHCU>V>gBC:U>e:S:R6D: n U:e:UBE:36T>f6C:D:E2S6T6U:S:S>f:f:D:U6T6T6DBD:46S6e:S6T:U>S6C6B64?e:D:36D: n V6T6e:56T:V>e:f:f:U6D?T6T>C:D6B:D:U6B6S:U6T:D:d:T:S:T:7?D:D>U>D>D:U>D:hBe> n T:S:F:T636h:S:F25C5C5?e>kK7?F?FCV:5?g>U>E>e:e>fBf>7;T6e>eBT:f:5;C:e>4?U:U> n 6CfBf:e>e>D:e:h:f6T:e>U>T>5?U:T:D2SFgBf:T6e:C?T>eB57S>5;fB5CU>5?eJg>e>U:f: n D:e:3?D6T>5?T>f:T>f>U6e>UGg:e:6?f:f:5?e:UCh>g>U6D;e>T6B?U:D;3G7?6GgB6?D: n 5GGKHCXOFGFKjFIKHKjFXGgOgBWKGC4KiOVOGCWOY;FGFKj?XGi?H;5G7C5CG> n hOWKWOkFXG8OYC5GXG7GdFXCgBWKG;GCWOY;7Gi77GeBg>e>6GTBXOYCiG7GiOX;FGFKj?XGi? n HKeBGCgBF;4G7GiJH?X>FG6?6;gC5GXG77gBWKG3gBG7F;f:D:e>gRYGg:f>6?4CW>U>F?E?6? n F?5CfFW6eBg>4;6GWBh>eBGCV>U>FG6C5G5?e:f:D:eFfFhBgBW?5C5?GCD:5Cf:E?5CU6eBg> n 7?eBGCg:5GE:5?6?U>f:UC5CGC4Gf:5G7CV>U>FG6C5G5?V>f>T6T>8;f:5C6?5;U>U:S:8GU> n 5Cf:W6eBg>66e>W>FG6?6C5?YGg:S:e>D>57T6eBTBe>eBT>U:67B:f:D>e>675;D: n 5Cf6T6eBg>U>V>D:U:C2C:g:6;f:5GT>U>5CU6S>U:SBT>U6B:f:4?D:5Cf:T>V:S>g>T6T> n fFg>5CU>g:S>6?f6T6eB6?U>g>e:e>U:S6D?S:S>f>T>S>T636CCg:e>U:3?D:f:f6B:57DCg> n e>6C5PHCU>f>g:eBT>e:f6U>eBf>f>5CD:S>f:V:e>eBD:U>UBT:e:5Cf:f>e:U>U:S:D?d>S: n S>g:U:fBf:S6T6T>h>f>D:S>eFU6T>gBS>e>U6gBg>e>U>8;T>U:e:36e>TBT6S:fBU:f>D:e: n f:U:TJV:T>4?U>T>e>T6TJ6?e:f:DFe:S:SBD2SFDBGCgB6?gVkK7?g>eBfBU6eBUB4?e>6?U> n U>f:U6eBE?f>VBE:e>e>V6T>U>U:S>g:5?e>U6eJVBV:U>g>U>5;f:U>D:e:D?U>T6T6e>V6B: n e:W6e:V>DC5Cg:5?fGf>5?f>T6e:f>V6T>U>U:S>g:fBU>f:e>8;S:f>T6f:f:U:C:h>D:U: n C2i:U6T:h:36i:7GGC5G6?;PHC5;f>g>5?T>g>VBe>eBg>f>6?e:D:fFf>6?5;D:f:E?T:f>4? n U>6?eBf:f:e>8?6;f:5CV>U>5Cf:f:S:SJg>f>e:D:E?D:f:E;S>5;fF6?6?5C5O7C5Cf>g>T> n U>E?T6e>4?U>6?e>6?e>e>gGU:e>g>4?5?U>U:UCg:5?T:S?e>D:D?U6R?DGFG6G7Gg: n 36eB6GW?GK5C7GXB8GWGXBGKUK5?FGFGdFWKEK6GFKH75C7GX;GKW;W?eBgB6?F: n VKFGHKYBGKhJi?gBGCGGRBG?5?FGF76GFKH;FCW;HKS>U>f:fBD>GKi?WCFCWKW75C7GX;GKW; n WGU>6?6C57dBFCWFW;h:5C5Cg:U?gBGCG;5?FGF77GX357e>U:S:fJ7?D2C6T>S:56T6e:d6T> n e6S:U>U6B:f>e:T>E:U6D:f:46T6e>U>U>U>D:f:D6BBU>E:e:5;S:U>fBT6e:S:e6S:T6B:U> n g:D:5?F:eBf:U>6?U:S:ECU:fBT>U:S>U>E:S6e>g:U>U>e:5?e:D:V2S:S>e>U:S>U:C27?f: n 5?e:W>e>D:V6e>56FG6?U>5CYGg:S:T>F6e6S>D:4:S6e:T:e:f6D2S:f>C6T6e6B:S:d6C:D: n f:e:T6e:S:S:D6V6T2C:S>D:S:e:E:C:36TBT:T6D2S64;S6S>e2S:5;U>e>e>U:SFU6S: n E6T636T6e:36C:e:S:T6D>T>D:f:D?C6T6U:U6U6e:U:C?U>T>D:47e:D2C?D:47cBgB6?U>5? n D:5GGGiCFK6GHCh>7GFKhFGKUKFC5GWKTBFGEKgB7G7;6CGCW;GKG?FCU> n 6G7CF6EG5C7GXB7GhJW;5?6?FGdFG?5C5GF76G6GH;5GF?WGD:fBg>U>4:6GW;F?5?FGF75? n 6CG;7GG7FCe:f:5C6;4CFGVFW;g>eB5G6;U?g>FCW?eB5C5;FCG7g2S>g>T6TFg:5GHGFKFK7? n FK7?VGFKX?7GXFhB7?FKW>GG8KhBGGFG4?FG7G3C7GDK5?eB7?F;4K8CWGH?7GX;GK5CgBFGF> n 7GeB6?FKc>gBFC3GFCTGi:S>g:5?f6EGWOEG5GFCGK4?FG7G3C7GDKh>U>5C5GTB5GG76GD?f: n 5GgBSFe:fB5GeB5?6GEC7GDC36eBf>T67?eBWCGGiFWC6GHG4KFGHKEGW?X?FCgBW7EGX? n WCFCGCWB6GGGVFWGXFiBf:5GFGTBXCGKWK4GWGUKjB5C5GH;EGh>6CgBGBFCGCGB7GWJW? n U6eB5C5?eFWKjF8C7G7GH>6GFGVFWGXFH?e>eB7?g:6CGGDGXFf>U>FCV>iB5C5GX> n gBgBhFFGgFV6B:5Cg>4?D:5G5GF;6G5?FCG>hBFCWB7GUGeB5C5GRBFG4GfB5G775?6CG; n 7GG7F;U>U>6CF6EG5C7GH>6GVFW;U>6?FCSB7?e>5C57gB6G735?F77Ge>D:5?U>D:6GW;F?5? n FGF3e>gBG76GF7FCD:f:5?e:dB5CVFF7V:e>eBg:U;f>6?F7e:5C5;gBG?g>D2S>6?gFg: n 5G8GHGEG8G6GW;VCGGW?WG7Oi>6G7?F>GKiF8C6GWG4G6GWKUGWKDGe>6?eBG;4K8GGGX;FGG? n XKf>6GgBW>WGg>6G7?DCFGXG3CFGCCW>g:S>6?g:EGXKEK6CFGHCdB6CGKDGGKDGW:fBU> n gBUB7CG?HGD;fBg:5C5OfBFGgBe>5C7?4?FG5Cg:36eBFCHCU>FGWG6KHC7?FKEO7GFKEG7CH? n eBWGg:VKWCH?gB7GXB6?FGiF6GWFF:5Gg:5GfFjGFCWGEC7GDGh:5?FC5?EGh> n eBFGVBfBFGFB5G6B57eBU6eB6C5KHK7KhB5GFKWB5?FCGB6CWFF7e:5?eB7;6C5GDCVFS>5CU> n g>X:fBgBU>eB5CF>eBV>gBU6B:5GFCU6eB6GG?GC5C6GWB8?FGWBFGECf>6GFCeF7GECeB6? n F7fB6GF;gB7?F;e>gBU>g>VKgBGGVB5GGBF;f>eB7?TBF;f>gBF7U>gBg:5Cg67GS:5?D: n 5CVBGCW?7;5CgBW7U>6C53fB57FCT:S>g:5?d>6CGB5;V:U>5?e:D7e:f:5?e>U>5;gB5;5?5? n D2S>6CU6B:f>6G4CW>5?F7E?6GF75CWFW>eBgBG:6GWBh>gBFCR>5?FG3C7G4GD:f:5?e: n eFhBFCG75C7;GKf:fB5GF65CT>eBgBe>gBGC4C5CCC76e>g:S>g:5CGK4G5C5C7GS>5? n 6G3C7GDGV6T>5CU>4:fB576G4;S>U>g:UFe:5C5Gf>e>6G4?6GS>eBg:36eB7?D:5CFGiBW? n 6G6GeFFCGG4GW?X?g>FCW;4CG?WC5CFGF>6G6GXFWGhBh:eB5Gg:E>G?6GFK4GFGUGX>fBgBG; n 4Gh>g>FChBFCFKW>6CWFG7S>5CU6eBTBFGXBh>gBGCW>gB6GWFFGGB7;T>U>6?e65C7CDGXBU: n 5?FC5?iBfB7Gi:f>6?gB6GW>U>6CU6B:ECU:5GFGW?5G6C7?V:gB5GgB7GUG5?eBFKC>5C4GU> n gBg:5?6?F;7G7;5?D:fB7CU24Ce>gBG>gBVFF7e:f:5CUB7?e>eB5;gBgB77eB5;FC36T>6?D: n E6fBF75;e:5C5;e:f>67gB635?S6T6eBgBeB5CUFF7U:S>eB6?U;f:5?F;S>e>e>5?6;U6e>6? n D2SJ7?5GHGFK6G7?FG6?EC6GH?7GXFhBg>FKW:6GhFh>FCFC4?FG6G3C7G4Gf:eB7?6? n dFhBFCG;6CG;GKeBfB5Cg>7GeBg>6Ge>gBFCeB6CEGW6S>6Cg:3;4CGK4GfB5C7Gf> n 5C6G4C7G3GV>T>e>FCVB5G776G4?U:fBgBUFf:fB5GU>f>gB6C6G5?T>FGg:36HC5GiGgB7G7? n eB7?5KgBFG4?F76;5?eB7;EGF?7;fBgBG>eB6?6>5?FBV>D:5?eBUBXC5CGC4?6G3CW:f:5Cf: n 4?F:f>eBG:e:fBU>fBUB6;36e>5CUBfF7GhFV>5C5GW>e>6?F>5?VB67T6e>eBh6U>6Cc>FBT: n S>g:U6V:S:U>g>T>e>g>f>gBU6eB6CU62 ; n map inds = { n {0ull, 0}, {1ull, 1}, {2ull, 173}, {3ull, 223}, n {4ull, 247}, {5ull, 259}, {6ull, 268}, {7ull, 274}, n {8ull, 277}, {9ull, 278}, {10ull, 279}, {11ull, 280}, n {12ull, 281}, {13ull, 282}, {14ull, 283}, {15ull, 284}, n {16ull, 285}, {17ull, 286}, {18ull, 287}, {19ull, 288}, n {24ull, 2}, {25ull, 96}, {26ull, 128}, {27ull, 142}, n {28ull, 151}, {29ull, 157}, {30ull, 161}, {31ull, 162}, n {32ull, 163}, {33ull, 164}, {34ull, 165}, {35ull, 166}, n {36ull, 167}, {37ull, 168}, {38ull, 169}, {39ull, 170}, n {40ull, 171}, {41ull, 172}, {48ull, 174}, {49ull, 193}, n {50ull, 202}, {51ull, 208}, {52ull, 212}, {53ull, 213}, n {54ull, 214}, {55ull, 215}, {56ull, 216}, {57ull, 217}, n {58ull, 218}, {59ull, 219}, {60ull, 220}, {61ull, 221}, n {62ull, 222}, {72ull, 224}, {73ull, 231}, {74ull, 235}, n {75ull, 237}, {76ull, 238}, {77ull, 239}, {78ull, 240}, n {79ull, 241}, {80ull, 242}, {81ull, 243}, {82ull, 244}, n {83ull, 245}, {84ull, 246}, {96ull, 248}, {97ull, 250}, n {98ull, 251}, {99ull, 252}, {100ull, 253}, {101ull, 254}, n {102ull, 255}, {103ull, 256}, {104ull, 257}, {105ull, 258}, n {120ull, 260}, {121ull, 261}, {122ull, 262}, {123ull, 263}, n {124ull, 264}, {125ull, 265}, {126ull, 266}, {127ull, 267}, n {144ull, 269}, {145ull, 270}, {146ull, 271}, {147ull, 272}, n {148ull, 273}, {168ull, 275}, {169ull, 276}, {553ull, 3}, n {554ull, 50}, {555ull, 67}, {556ull, 76}, {557ull, 82}, n {558ull, 85}, {559ull, 86}, {560ull, 87}, {561ull, 88}, n {562ull, 89}, {563ull, 90}, {564ull, 91}, {565ull, 92}, n {566ull, 93}, {567ull, 94}, {568ull, 95}, {577ull, 97}, n {578ull, 108}, {579ull, 114}, {580ull, 118}, {581ull, 119}, n {582ull, 120}, {583ull, 121}, {584ull, 122}, {585ull, 123}, n {586ull, 124}, {587ull, 125}, {588ull, 126}, {589ull, 127}, n {601ull, 129}, {602ull, 133}, {603ull, 134}, {604ull, 135}, n {605ull, 136}, {606ull, 137}, {607ull, 138}, {608ull, 139}, n {609ull, 140}, {610ull, 141}, {625ull, 143}, {626ull, 144}, n {627ull, 145}, {628ull, 146}, {629ull, 147}, {630ull, 148}, n {631ull, 149}, {632ull, 150}, {649ull, 152}, {650ull, 153}, n {651ull, 154}, {652ull, 155}, {653ull, 156}, {673ull, 158}, n {674ull, 159}, {675ull, 160}, {1106ull, 175}, {1107ull, 181}, n {1108ull, 184}, {1109ull, 185}, {1110ull, 186}, {1111ull, 187}, n {1112ull, 188}, {1113ull, 189}, {1114ull, 190}, {1115ull, 191}, n {1116ull, 192}, {1130ull, 194}, {1131ull, 195}, {1132ull, 196}, n {1133ull, 197}, {1134ull, 198}, {1135ull, 199}, {1136ull, 200}, n {1137ull, 201}, {1154ull, 203}, {1155ull, 204}, {1156ull, 205}, n {1157ull, 206}, {1158ull, 207}, {1178ull, 209}, {1179ull, 210}, n {1180ull, 211}, {1659ull, 225}, {1660ull, 226}, {1661ull, 227}, n {1662ull, 228}, {1663ull, 229}, {1664ull, 230}, {1683ull, 232}, n {1684ull, 233}, {1685ull, 234}, {1707ull, 236}, {2212ull, 249}, n {12720ull, 4}, {12721ull, 24}, {12722ull, 33}, {12723ull, 38}, n {12724ull, 41}, {12725ull, 42}, {12726ull, 43}, {12727ull, 44}, n {12728ull, 45}, {12729ull, 46}, {12730ull, 47}, {12731ull, 48}, n {12732ull, 49}, {12744ull, 51}, {12745ull, 56}, {12746ull, 59}, n {12747ull, 60}, {12748ull, 61}, {12749ull, 62}, {12750ull, 63}, n {12751ull, 64}, {12752ull, 65}, {12753ull, 66}, {12768ull, 68}, n {12769ull, 69}, {12770ull, 70}, {12771ull, 71}, {12772ull, 72}, n {12773ull, 73}, {12774ull, 74}, {12775ull, 75}, {12792ull, 77}, n {12793ull, 78}, {12794ull, 79}, {12795ull, 80}, {12796ull, 81}, n {12816ull, 83}, {12817ull, 84}, {13273ull, 98}, {13274ull, 101}, n {13275ull, 102}, {13276ull, 103}, {13277ull, 104}, {13278ull, 105}, n {13279ull, 106}, {13280ull, 107}, {13297ull, 109}, {13298ull, 110}, n {13299ull, 111}, {13300ull, 112}, {13301ull, 113}, {13321ull, 115}, n {13322ull, 116}, {13323ull, 117}, {13826ull, 130}, {13827ull, 131}, n {13828ull, 132}, {25440ull, 176}, {25441ull, 177}, {25442ull, 178}, n {25443ull, 179}, {25444ull, 180}, {25464ull, 182}, {25465ull, 183}, n {292561ull, 5}, {292562ull, 13}, {292563ull, 17}, {292564ull, 18}, n {292565ull, 19}, {292566ull, 20}, {292567ull, 21}, {292568ull, 22}, n {292569ull, 23}, {292585ull, 25}, {292586ull, 27}, {292587ull, 28}, n {292588ull, 29}, {292589ull, 30}, {292590ull, 31}, {292591ull, 32}, n {292609ull, 34}, {292610ull, 35}, {292611ull, 36}, {292612ull, 37}, n {292633ull, 39}, {292634ull, 40}, {293114ull, 52}, {293115ull, 53}, n {293116ull, 54}, {293117ull, 55}, {293138ull, 57}, {293139ull, 58}, n {305281ull, 99}, {305282ull, 100}, {6728904ull, 6}, {6728905ull, 8}, n {6728906ull, 9}, {6728907ull, 10}, {6728908ull, 11}, {6728909ull, 12}, n {6728928ull, 14}, {6728929ull, 15}, {6728930ull, 16}, {6729457ull, 26}, n {154764793ull, 7}}; n void solve() { n vector bits; n for (char c : encoded) { n int cur = c; n if (c > ) { n --cur; n } n cur -= 50; n for (int j = 0; j < 6; ++j) { n bits.push_back(cur & (1 << j)); n } n } n int c = 0; n for (int i = 0; i < 289; ++i) { n for (int j = 0; j < 289; ++j) { n for (int k = 0; k < 4; ++k) { n real_dist[i][j] |= bits[c++] << k; n } n } n } n vector sieve(MAXV); n for (int i = 2; i < MAXV; ++i) { n if (!sieve[i]) { n sieve[i] = i; n for (long long j = (long long)i * i; j < MAXV; j += i) { n sieve[j] = i; n } n } n } n function get_ind = [&](int a) { n vector pows; n map cnt; n int tmp = a; n while (tmp > 1) { n int div = sieve[tmp]; n cnt[div]++; n tmp /= div; n } n for (pair p : cnt) { n pows.push_back(p.second); n } n sort(pows.begin(), pows.end()); n unsigned long long h = 0; n for (int num : pows) { n h = h * 23 + num; n } n return inds[h]; n }; n int t; n cin >> t; n for (int i = 0; i < t; ++i) { n int a, b; n cin >> a >> b; n int ind1 = get_ind(a); n int ind2 = get_ind(b); n cout << real_dist[ind1][ind2] << n ; n } n } n int main() { n cerr << fixed << setprecision(15); n cout << fixed << setprecision(15); n ios::sync_with_stdio(false); n int tests = 1; n for (int it = 1; it <= tests; ++it) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long t; n cin >> t; n while (t--) { n long long a, b, c, i, j; n cin >> a >> b >> c; n string f, s, third; n if (a) { n s = string(a + 1, 0 ); n } n if (c) { n f = string(c + 1, 1 ); n } n if (b) { n bool flag; n if (a == 0 && c) { n flag = true; n for (i = 0; i < b; i++) { n if (flag) { n third += 0 ; n flag = false; n } else { n third += 1 ; n flag = true; n } n } n cout << f << third << endl; n continue; n } n if (c) { n b--; n } n flag = true; n for (i = 0; i < b; i++) { n if (flag) { n third += 1 ; n flag = false; n } else { n third += 0 ; n flag = true; n } n } n if (a == 0 && c == 0) { n if (b & 1) n third += 0 ; n else n third += 1 ; n } n } n cout << f << s << third << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s1, s2; n cin >> s1 >> s2; n for (int i = 0; i < s1.size(); i++) { n s1[i] = tolower(s1[i]); n s2[i] = tolower(s2[i]); n } n if (s1 < s2) { n cout << -1; n } else if (s2 < s1) { n cout << 1; n } else { n cout << 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const float pi = acos(-1.0); n const int maxn = 1e5 + 5; n int c[maxn]; n long long a[5][maxn], b[maxn]; n vector vec[maxn]; n void dfs(int u, int fa) { n for (auto p : vec[u]) { n if (p != fa) { n c[p] = 6 - c[u] - c[fa]; n dfs(p, u); n } n } n } n int main() { n int u, v; n int t, n; n cin >> n; n for (int i = 1; i <= 3; i++) n for (int j = 1; j <= n; j++) cin >> a[i][j]; n int fu, fv; n for (int i = 1; i <= n - 1; i++) { n cin >> u >> v; n vec[u].push_back(v); n vec[v].push_back(u); n } n int cnt = 0, cnt1 = 0; n for (int i = 1; i <= n; i++) { n if (vec[i].size() == 2) { n cnt++; n } n if (vec[i].size() == 1) { n fv = i; n cnt1++; n } n } n if (cnt != n - 2 && cnt1 != 2) { n puts( -1 ); n return 0; n } n long long res = 1e17, ans = 0; n ; n for (int i = 1; i <= 3; i++) { n for (int j = 1; j <= 3; j++) { n if (i == j) continue; n fu = vec[fv][0]; n c[fu] = i, c[fv] = j; n dfs(fu, fv); n ans = 0; n for (int k = 1; k <= n; k++) ans += a[c[k]][k]; n if (ans < res) { n res = ans; n for (int k = 1; k <= n; k++) { n b[k] = c[k]; n } n } n } n } n printf( %lld n , res); n for (int i = 1; i <= n; i++) cout << b[i] << ; n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a, b, d[500], s; n int main() { n scanf( %d , &n); n for (int i = 1; i <= 2 * n; i++) scanf( %d , &d[i]); n for (int i = 1; i <= 2 * n; i++) n for (int j = 1; j <= 2 * n; j++) n if (d[i] == d[i + (2 * j - 1)]) s++; n printf( %d , s); n scanf( ); n } n "} +{"func_code_string": "#include n template n T Min(const T &a, const T &b) { n return a < b ? a : b; n } n template n T Max(const T &a, const T &b) { n return a > b ? a : b; n } n template n bool Chkmin(T &a, const T &b) { n return a > b ? a = b, 1 : 0; n } n template n bool Chkmax(T &a, const T &b) { n return a < b ? a = b, 1 : 0; n } n struct fast_input { n static const int L = 1 << 15 | 1; n char buf[L], *l, *r; n fast_input() { l = r = buf; } n void Next(char &c) { n if (l == r) r = (l = buf) + fread(buf, 1, L, stdin); n c = l == r ? (char)EOF : *l++; n } n template n void operator()(T &x) { n char c, f = 0; n for (Next(c); !isdigit(c); Next(c)) n if (c == - ) f = 1; n for (x = 0; isdigit(c); Next(c)) x = x * 10 + c - 0 ; n if (f) x = -x; n } n } input; n const int N = 1000 + 3; n const int M = 100000 + 7; n const int MOD = 998244353; n int n, m, a[N], f[N][N], ans[M], b[M]; n int Power(int x, int y) { n int ret = 1; n while (y) { n if (y & 1) ret = 1LL * x * ret % MOD; n x = 1LL * x * x % MOD, y >>= 1; n } n return ret; n } n int main() { n int x, y, z; n input(n), input(m); n for (int i = (1), i_end = (n); i <= i_end; ++i) input(a[i]), b[a[i]] = 1; n std::sort(a + 1, a + n + 1); n ans[0] = 1; n for (int i = (m + 1), i_end = (n); i <= i_end; ++i) n ans[0] = 1LL * ans[0] * i % MOD; n for (int i = (2), i_end = (n - m); i <= i_end; ++i) n ans[0] = 1LL * ans[0] * Power(i, MOD - 2) % MOD; n int maxans = 0; n while (ans[maxans++]) { n x = 0; n for (int i = (1), i_end = (n); i <= i_end; ++i) n x |= (a[i] - maxans + 1 >= 0 && b[a[i] - maxans + 1]); n if (!x) { n ans[maxans] = ans[maxans - 1]; n continue; n } n f[0][0] = 1, x = 0; n for (int j = (1), j_end = (n); j <= j_end; ++j) { n for (int k = (1), k_end = (m); k <= k_end; ++k) { n while (a[j] - a[x + 1] >= maxans) ++x; n f[j][k] = (f[j - 1][k] + f[x][k - 1]) % MOD; n } n f[j][0] = f[j - 1][0]; n } n ans[maxans] = f[n][m]; n } n int ret = 0; n for (int i = (1), i_end = (maxans - 2); i <= i_end; ++i) n ret = (ret + 1LL * (ans[i] - ans[i + 1]) * i) % MOD; n printf( %d n , (ret + MOD) % MOD); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct S { n long long prime; n int q, h, ji; n }; n S xxx[300000]; n priority_queue sum[4]; n bool biao[300000]; n bool operator<(const S &a, const S &b) { return a.prime > b.prime; } n int main() { n int x, y; n cin >> x; n for (int a = 0; a < x; a++) { n cin >> xxx[a].prime; n xxx[a].ji = a; n } n for (int a = 0; a < x; a++) cin >> xxx[a].q; n for (int a = 0; a < x; a++) cin >> xxx[a].h; n for (int a = 0; a < x; a++) { n sum[xxx[a].q].push(xxx[a]); n sum[xxx[a].h].push(xxx[a]); n } n cin >> y; n while (y--) { n cin >> x; n while (!sum[x].empty() && biao[sum[x].top().ji]) sum[x].pop(); n if (sum[x].empty()) n cout << -1 ; n else { n cout << sum[x].top().prime; n biao[sum[x].top().ji] = 1; n sum[x].pop(); n } n y == 0 ? cout << endl : cout << ; n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n using namespace std; n long long n, m, a, b, c, k, temp, x, y; n const int MAXN = 1e5 + 11, mod = 1e9 + 7; n inline long long max(long long a, long long b) { return ((a > b) ? a : b); } n inline long long min(long long a, long long b) { return ((a > b) ? b : a); } n inline vector read(int n) { n vector v(n); n for (int i = 0; i < v.size(); i++) cin >> v[i]; n return v; n } n long long setbits(long long n) { n if (n % 4 == 0) return n; n if (n % 4 == 1) return 1; n if (n % 4 == 2) return n + 1; n if (n % 4 == 3) return 0; n return 1e18; n } n long long getxor(long long x, long long m) { n return setbits(x + m - 1) ^ setbits(x - 1); n } n void sol() { n cin >> n; n long long txor = 0; n for (int i = 0; i < n; i++) { n cin >> x >> m; n txor = txor ^ getxor(x, m); n } n if (txor) n cout << tolik ; n else n cout << bolik ; n return; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int test = 1; n for (int i = 1; i <= test; i++) sol(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a[101], dif[100], i, unique[101], c = 0; n int min = 0, n, dif1, dif2; n cin >> n; n for (i = 0; i < n; i++) { n cin >> a[i]; n } n sort(a, a + n); n unique[c] = a[0]; n c++; n for (i = 1; i < n; i++) { n if (a[i] != a[i - 1]) { n unique[c] = a[i]; n c++; n } n } n if (c >= 4) { n cout << -1; n } else if (c == 1) { n cout << 0 << endl; n } else if (c == 2) { n if ((unique[1] - unique[0]) % 2) { n cout << unique[1] - unique[0]; n } else { n cout << (unique[1] - unique[0]) / 2; n } n } else { n if (unique[2] - unique[1] == unique[1] - unique[0]) { n cout << unique[2] - unique[1]; n } else { n cout << -1 << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n; n int k; n long long a[100050]; n int main() { n cin >> n >> k; n for (int i = 1; i <= k; i++) cin >> a[i]; n long long A = 1, B = 0, C = 0; n for (int i = 1; i <= k; i++) { n if (n - n % a[i] > C) { n A = 1ll * i, B = n / a[i]; n C = n - n % a[i]; n } n } n cout << A << << B; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, q, A[100005 * 3], B[100005 * 3], ans[100005]; n int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } n vector > G[100005]; n vector E[100005]; n pair SL(pair a) { n int t = gcd(abs(a.first), abs(a.second)); n a.first /= t, a.second /= t; n return a; n } n int tr[100005]; n void upd(int u, int v) { n for (; u <= n; u += u & -u) tr[u] += v; n } n int qry(int u) { n int r = 0; n for (; u; u -= u & -u) r += tr[u]; n return r; n } n map, int> mAp; n int main() { n scanf( %d , &n); n for (int i = (1), LIM = (n); i <= LIM; i++) { n int K; n scanf( %d , &K); n for (int j = (0), LIM = (K - 1); j <= LIM; j++) { n scanf( %d%d , &A[j], &B[j]); n if (j) G[i].push_back(SL(make_pair(A[j] - A[j - 1], B[j] - B[j - 1]))); n } n G[i].push_back(SL(make_pair(A[0] - A[K - 1], B[0] - B[K - 1]))); n } n scanf( %d , &q); n for (int i = (1), LIM = (q); i <= LIM; i++) { n scanf( %d%d , &A[i], &B[i]); n E[B[i]].push_back(i); n } n for (int i = (1), LIM = (n); i <= LIM; i++) { n for (auto u : G[i]) { n int t = mAp[u]; n upd(t + 1, 1), upd(i + 1, -1); n mAp[u] = i; n } n for (int u : E[i]) ans[u] = qry(A[u]); n } n for (int i = (1), LIM = (q); i <= LIM; i++) printf( %d n , ans[i]); n } n "} +{"func_code_string": "#include n using namespace std; n inline int inp() { return 0; } n inline int inp(bool& A) { n if (cin >> A) return 1; n return -1; n } n inline int inp(char& A) { return scanf( %c , &A); } n inline int inp(int& A) { return scanf( %d , &A); } n inline int inp(float& A) { n if (cin >> A) return 1; n return -1; n } n inline int inp(long long& A) { return scanf( %I64d , &A); } n inline int inp(double& A) { return scanf( %lf , &A); } n inline int inp(char* A) { return scanf( %s , A); } n inline int inp(string& A) { n if (cin >> A) return 1; n return -1; n } n template n inline int inp(Front& A, Queue&... B) { n return inp(A) + inp(B...); n } n inline int oup() { return 0; } n inline int oup(bool A) { n if (cout << A) return 1; n return -1; n } n inline int oup(char A) { return printf( %c , A); } n inline int oup(int A) { return printf( %d , A); } n inline int oup(float A) { n if (cout << A) return 1; n return -1; n } n inline int oup(long long A) { return printf( %I64d , A); } n inline int oup(double A) { return printf( %lf , A); } n inline int oup(char* A) { return printf(A); } n inline int oup(const char* A) { return printf( %s , A); } n inline int oup(string& A) { n if (cout << A) return 1; n return -1; n } n template n inline int oup(Front A, Queue... B) { n return oup(A) + oup(B...); n } n template n inline void remax(T& A, T B) { n if (A < B) A = B; n } n template n inline void remin(T& A, T B) { n if (A > B) A = B; n } n string ToString(long long num) { n string ret; n do { n ret += ((num % 10) + 0 ); n num /= 10; n } while (num); n reverse(ret.begin(), ret.end()); n return ret; n } n long long ToNumber(string s) { n long long r = 0, p = 1; n for (int i = s.size() - 1; i >= 0; --i) r += (s[i] - 0 ) * p, p *= 10; n return r; n } n long long Gcd(long long a, long long b) { n while (a %= b ^= a ^= b ^= a) n ; n return b; n } n long long Power(long long base, long long power) { n long long ret = 1; n while (power) { n if (power & 1) ret *= base; n power >>= 1; n base *= base; n } n return ret; n } n long long PowerMod(long long base, long long power, long long mod) { n if (!power) return 1; n if (power & 1) return (base * PowerMod(base, power - 1, mod)) % mod; n return PowerMod((base * base) % mod, power >> 1, mod); n } n int Log(long long num, long long base) { n int ret = 0; n while (num) { n ++ret; n num /= base; n } n return ret; n } n int Count(long long mask) { n int ret = 0; n while (mask) { n if (mask & 1) ++ret; n mask >>= 1; n } n return ret; n } n inline void run() { n in:; n int n, m, k; n if (inp(n, m, k) != 3) return; n vector a(m), b(m), c(m); n long long ans = 0; n for (int i = 0; i < m; ++i) inp(a[i], b[i], c[i]); n while (k--) { n int tmp; n inp(tmp); n for (int i = 0; i < m; ++i) n if (tmp >= a[i] && tmp <= b[i]) ans += (long long)c[i] + tmp - a[i]; n } n oup(ans, n ); n goto in; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr), cout.tie(nullptr); n run(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s, ss; n int idx; n int main() { n cin >> s; n for (int i = 0; i < s.length(); i++) { n if (s[i] == . ) { n idx = i; n break; n } n } n if (s[idx - 1] != 9 ) { n if (s[idx + 1] < 5 ) { n ss = s.substr(0, idx); n } else { n ss = s.substr(0, idx); n ss[ss.length() - 1]++; n } n } else if (s[idx - 1] == 9 ) { n cout << GOTO Vasilisa. ; n } n cout << ss; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, i, k, x; n string s; n int main() { n cin >> n >> k >> s; n for (i = 0; i < n; i++) { n if (s[i] == # ) n x++; n else n x = 0; n if (x == k) { n cout << NO ; n return 0; n } n } n cout << YES ; n } n "} +{"func_code_string": "#include n using namespace std; n struct Node { n int u; n map child; n }; n vector grafo; n int win[100005], lose[100005]; n void addTrie(int u, string &s) { n for (char c : s) { n if (grafo[u].child.count(c) == 0) { n Node novo; n novo.u = grafo.size(); n grafo[u].child[c] = grafo.size(); n grafo.push_back(novo); n } n u = grafo[grafo[u].child[c]].u; n } n } n void solve(int u) { n if (grafo[u].child.size() == 0) { n win[u] = 0; n lose[u] = 1; n } n for (pair par : grafo[u].child) { n int v = par.second; n solve(v); n win[u] = (win[u] || !win[v]); n lose[u] = (lose[u] || !lose[v]); n } n } n int main() { n ios::sync_with_stdio(false); n Node root; n root.u = 0; n grafo.push_back(root); n int n, k; n cin >> n >> k; n for (int i = 0; i < n; i++) { n string s; n cin >> s; n addTrie(0, s); n } n solve(0); n int w = win[0], l = lose[0]; n if (w == 0) n cout << Second << endl; n else if (w == 1 && l == 1) n cout << First << endl; n else if (w == 1 && l == 0 && k % 2 != 0) n cout << First << endl; n else n cout << Second << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n using v2d = vector >; n template n bool uin(T &a, T b) { n return a > b ? (a = b, true) : false; n } n template n bool uax(T &a, T b) { n return a < b ? (a = b, true) : false; n } n mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); n const int maxN = 2e5 + 10; n const long long inf = 1e18; n int n; n long long k, a[maxN]; n bool check(long long d) { n long long c = 1, x = d - 1, y = 0, sum = 0; n bool ovf = 0; n for (int i = n; i; i--) { n if (a[i] > 0 && (ovf || (long double)sum + (long double)c * a[i] > inf)) { n return 1; n } n if (a[i] > 0) { n sum += c * a[i]; n } n if (sum >= k) { n return 1; n } n x++; n y++; n if ((long double)c * x / y > inf) { n ovf = 1; n } else { n __int128 tmp = c; n tmp *= x; n tmp /= y; n c = tmp; n } n } n return sum >= k; n } n void solve() { n cin >> n >> k; n for (int i = 1; i <= (int)(n); ++i) { n cin >> a[i]; n } n if (*max_element(a + 1, a + n + 1) >= k) { n cout << 0; n return; n } n long long l = 0, r = inf; n while (r - l > 1) { n long long mid = (l + r) / 2; n if (check(mid)) { n r = mid; n } else { n l = mid; n } n } n cout << r; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n int T = 1; n while (T--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int qr() { n int f = 0, fu = 1; n char c = getchar(); n while (c < 0 || c > 9 ) { n if (c == - ) fu = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n f = (f << 3) + (f << 1) + c - 48; n c = getchar(); n } n return f * fu; n } n const int N = 2e5 + 10; n int a[N], n, k, T; n pair b[N]; n int main() { n T = qr(); n while (T--) { n n = qr(), k = qr(); n for (register int i = 1; i <= n; ++i) a[i] = qr(); n for (register int i = 1; i <= n; ++i) qr(); n sort(a + 1, a + n + 1); n int m = 0; n for (register int i = 1; i <= n; ++i) { n b[++m] = {a[i], 0}; n int j = i; n while (a[j] == a[i]) b[m].second++, j++; n i = j - 1; n } n for (register int i = 1; i <= m; ++i) b[i].second += b[i - 1].second; n if (k * 2 >= a[n] - a[1]) { n printf( %d n , n); n continue; n } n vector st(m + 1); n int ans = 0; n for (int i = 1, j = 1; i <= m; i++) { n while (b[i].first - b[j].first > k) j++; n st[i] = max(st[i - 1], b[i].second - b[j - 1].second); n ans = max(ans, b[i].second - b[j - 1].second + st[j - 1]); n } n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[1000006]; n map, long long> mp; n int main() { n long long n, k; n cin >> n >> k; n if (k == 0 && n != 1) { n cout << No solution ; n return 0; n } n if (n == 1) { n cout << k; n return 0; n } n if (k != 1) { n cout << k - 1; n for (int i = 0; i < n - 2; i++) cout << 0; n cout << 1; n return 0; n } n if (k == 1) { n cout << 9; n for (int i = 0; i < n - 2; i++) cout << 0; n cout << 1; n return 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int64_t k; n cin >> k; n int64_t r = 2, c = 3; n cout << r << << c << endl; n int64_t arr[2][3]; n int64_t ones = ((int64_t)1 << 18) - 1; n arr[0][0] = ones; n arr[0][1] = ((int64_t)1 << 17); n arr[0][2] = 0; n arr[1][0] = k; n arr[1][1] = ones; n arr[1][2] = k; n for (int64_t i = 0; i < r; i++) { n for (int64_t j = 0; j < c; j++) { n cout << arr[i][j] << ; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a[2][2]; n cin >> a[0][0] >> a[0][1] >> a[1][0] >> a[1][1]; n int n[2]; n if (!a[0][0] && !a[1][0] && !a[0][1] && !a[1][1]) { n cout << 0 ; n return 0; n } n for (int i = 0; 1; i++) { n int temp = i * (i - 1) / 2; n if (temp == a[0][0]) { n n[0] = i; n break; n } n if (temp > a[0][0]) { n cout << Impossible ; n return 0; n } n } n for (int i = 0; 1; i++) { n int temp = i * (i - 1) / 2; n if (temp == a[1][1]) { n n[1] = i; n break; n } n if (temp > a[1][1]) { n cout << Impossible ; n return 0; n } n } n if (n[0] == 0) n if (a[0][1] || a[1][0]) n[0] = 1; n if (n[1] == 0) n if (a[0][1] || a[1][0]) n[1] = 1; n if ((a[0][1] + a[1][0]) != n[0] * n[1]) { n cout << Impossible ; n return 0; n } n int base = n[1]; n while (1) { n if (a[0][1] > base) { n cout << 0 ; n n[0]--; n a[0][1] -= base; n } else { n for (int i = 0; i < base - a[0][1]; ++i) cout << 1 ; n if (n[0] > 0) { n cout << 0 ; n n[0]--; n } n for (int i = 0; i < a[0][1]; ++i) cout << 1 ; n for (int i = 0; i < n[0]; ++i) cout << 0 ; n break; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n = 0; n long long moves = 0; n cin >> n; n vector arr(n, 0); n for (int i = 0; i < n; i++) cin >> arr[i]; n long long last = arr[0]; n long long min = INT_MAX; n bool found = false; n for (int i = 1; i < n; i++) { n if (arr[i] < arr[i - 1]) { n if (arr[i] < min) { n min = arr[i]; n found = true; n } n } n if (arr[i] > arr[i - 1] || i + 1 == n) { n if (found) { n moves += last - min; n found = false; n } n min = INT_MAX; n last = arr[i]; n } n } n cout << moves << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long a, b, r; n int main() { n ios_base::sync_with_stdio(0); n cin >> a >> b >> r; n if (min(a, b) >= 2 * r) n cout << First << endl; n else n cout << Second << endl; n cin.get(); n cin.get(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n struct ma : array { n T &operator[](size_t n) { return (*static_cast *>(this))[n]; } n }; n template n string to_str(const T &a) { n ostringstream os; n os << a; n return os.str(); n } n template <> n string to_str(const long double &a) { n ostringstream os; n os.precision(10); n os.setf(ios::fixed); n os << a; n return os.str(); n } n template n T from_str(const string &s) { n istringstream is; n T val; n is >> val; n return val; n } n int cond = (long long)0; n map > nei; n int dat[(int)1e5 + 11]; n void solve() { n int n, m; n scanf( %d%d , &n, &m); n for (auto i = (0); i < (m); ++i) { n scanf( %d , &dat[i]); n } n long long turn = 0; n for (auto i = (0); i < (m - 1); ++i) { n int a = dat[i], b = dat[i + 1]; n turn += abs(a - b); n if (a != b) { n nei[a].push_back(b); n nei[b].push_back(a); n } n } n long long res = turn; n for (auto &it : (nei)) { n auto kol = it.second; n sort((kol).begin(), (kol).end()); n int mid = kol.size() / 2; n long long cand1 = 0; n long long cand2 = 0; n for (auto &jt : (kol)) { n cand1 += abs(it.first - jt); n cand2 += abs(jt - kol[mid]); n } n res = min(res, turn + cand2 - cand1); n } n cout << res << endl; n } n void brute() {} n void gen(int i, int n, int k) {} n int main(int argc, char **argv) { n ios::sync_with_stdio(false); n vector args; n int nr_test = -1; n int t = 1; n for (auto i = (1); i <= (argc - 1); ++i) args.push_back(argv[i]); n for (auto &it : (args)) n if (it == q ) cond = 10000000; n for (auto &it : (args)) n if (it == all ) t = 1000; n for (auto &it : (args)) n if (atoi(it.c_str()) > 0) nr_test = atoi(it.c_str()); n for (auto &it : (args)) n if (it == b ) { n brute(); n return 0; n } n for (auto &it : (args)) n if (it == g && args.size() >= 4) { n gen(atoi(args[1].c_str()), atoi(args[2].c_str()), atoi(args[3].c_str())); n return 0; n } n for (auto i = (1); i <= (t); ++i) { n if (nr_test == -1 || i <= nr_test) solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n vector v; n int n, d, p = 0, cnt = 0, mx = -1; n cin >> n >> d >> s; n for (int i = 0; i < n; i++) n if (s[i] == 1 ) v.push_back(i); n for (int i = 1; i < v.size(); i++) { n if (v[i] - v[i - 1] > mx) mx = v[i] - v[i - 1]; n } n if (mx > d) { n cout << -1; n return 0; n } n while (p < n - 1) { n p += d; n while (s[p] == 0 ) p--; n cnt++; n } n cout << cnt; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Hill { n int Lid, Mid, Rid; n long long Lv, Mv, Rv; n bool valid; n Hill() : valid(false) {} n Hill(int Lid, int Mid, int Rid, long long Lv, long long Mv, long long Rv) n : Lid(Lid), Mid(Mid), Rid(Rid), Lv(Lv), Mv(Mv), Rv(Rv), valid(true) {} n int Len() const { return valid ? Rid - Lid + 1 : 0; } n Hill operator+(const Hill B) const { n Hill Ans; n if (Rv == B.Lv) return Ans; n if (Rv < B.Lv) { n if (Mid == Rid) n return Hill(Lid, B.Mid, B.Rid, Lv, B.Mv, B.Rv); n else n return Hill(Rid, B.Mid, B.Rid, Rv, B.Mv, B.Rv); n } else { n if (B.Mid == B.Lid) n return Hill(Lid, Mid, B.Rid, Lv, Mv, B.Rv); n else n return Hill(Lid, Mid, B.Lid, Lv, Mv, B.Lv); n } n } n bool operator<(const Hill B) const { return Len() < B.Len(); } n void show() { n if (valid) n printf( A[%d]=%d A[%d]=%d A[%d]=%d n , Lid, int(Lv), Mid, int(Mv), Rid, n int(Rv)); n else n printf( ERROR! n ); n } n }; n Hill CLeft(const Hill A, const Hill B) { n if (!B.valid || B.Lv == A.Rv) return A; n if (A.Mid == A.Rid) { n if (B.Lv > A.Rv) n return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv); n else if (B.Lid == B.Mid) n return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv); n else n return Hill(A.Lid, A.Mid, B.Lid, A.Lv, A.Mv, B.Lv); n } else { n if (B.Lv < A.Rv) { n if (B.Lid == B.Mid) n return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv); n else n return Hill(A.Lid, A.Mid, B.Lid, A.Lv, A.Mv, B.Lv); n } else n return A; n } n } n Hill CRight(const Hill A, const Hill B) { n if (!A.valid || A.Rv == B.Lv) return B; n if (B.Mid == B.Lid) { n if (A.Rv > B.Lv) n return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv); n else if (A.Rid == A.Mid) n return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv); n else n return Hill(A.Rid, B.Mid, B.Rid, A.Rv, B.Mv, B.Rv); n } else { n if (A.Rv < B.Lv) { n if (A.Rid == A.Mid) n return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv); n else n return Hill(A.Rid, B.Mid, B.Rid, A.Rv, B.Mv, B.Rv); n } else n return B; n } n } n struct Segment { n Hill L, M, R; n bool pure; n Segment() {} n Segment(Hill L, Hill M, Hill R, bool pure) : L(L), M(M), R(R), pure(pure) {} n Segment operator+(const Segment B) const { n Segment Ans; n Ans.L = pure ? CLeft(L, B.L) : L; n Ans.R = B.pure ? CRight(R, B.R) : B.R; n Hill CM = M < B.M ? B.M : M; n Ans.M = R + B.L; n if (Ans.M < CM) Ans.M = CM; n Ans.pure = Ans.M.Len() == Ans.R.Rid - Ans.L.Lid + 1; n return Ans; n } n void Add(const long long D) { n L.Lv += D; n L.Mv += D; n L.Rv += D; n M.Lv += D; n M.Mv += D; n M.Rv += D; n R.Lv += D; n R.Mv += D; n R.Rv += D; n } n void show() { n L.show(); n M.show(); n R.show(); n } n }; n Segment S[300001 << 2]; n long long Add[300001 << 2]; n int mm[300001 << 2]; n void PushUp(int rt) { S[rt] = S[rt << 1] + S[rt << 1 | 1]; } n void PushDown(int rt) { n int ls = rt << 1, rs = ls | 1; n if (Add[rt]) { n Add[ls] += Add[rt]; n Add[rs] += Add[rt]; n S[ls].Add(Add[rt]); n S[rs].Add(Add[rt]); n Add[rt] = 0; n } n } n void Build(int l, int r, int rt) { n if (l == r) { n int v; n scanf( %d , &v); n Hill tempH(l, l, l, v, v, v); n S[rt] = Segment(tempH, tempH, tempH, true); n return; n } n int m = mm[rt] = (l + r) >> 1; n Build(l, m, rt << 1); n Build(m + 1, r, rt << 1 | 1); n PushUp(rt); n Add[rt] = 0; n } n void Update(const int L, const int R, const long long D, const int l, n const int r, const int rt) { n if (L <= l && r <= R) { n Add[rt] += D; n S[rt].Add(D); n return; n } n const int m = mm[rt]; n PushDown(rt); n if (L <= m) Update(L, R, D, l, m, rt << 1); n if (R > m) Update(L, R, D, m + 1, r, rt << 1 | 1); n PushUp(rt); n } n void Search(int l, int r, int rt) { n if (l == r) { n printf( %d , int(S[rt].L.Lv)); n return; n } n PushDown(rt); n int m = (l + r) >> 1; n Search(l, m, rt << 1); n Search(m + 1, r, rt << 1 | 1); n } n int main() { n int n, m; n while (~scanf( %d , &n)) { n Build(1, n, 1); n scanf( %d , &m); n for (int i = 0; i < m; ++i) { n static int l, r, d; n scanf( %d%d%d , &l, &r, &d); n Update(l, r, d, 1, n, 1); n printf( %d n , S[1].M.Len()); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n pair > A[2003 * 2003], B[2003 * 2003]; n pair a[2003], b[2003]; n int m, n, r, s, x, y, i, j, asd; n long long t1, t2, mn; n bool h; n int main() { n cin >> m; n for (i = 1; i <= m; i++) { n cin >> a[i].first; n t1 += a[i].first; n a[i].second = i; n } n cin >> n; n for (i = 1; i <= n; i++) { n cin >> b[i].first; n t2 += b[i].first; n b[i].second = i; n } n for (i = 1; i <= m; i++) n for (j = i + 1; j <= m; j++) n A[++r] = make_pair(a[i].first + a[j].first, make_pair(i, j)); n for (i = 1; i <= n; i++) n for (j = i + 1; j <= n; j++) n B[++s] = make_pair(b[i].first + b[j].first, make_pair(i, j)); n sort(a + 1, a + m + 1); n sort(b + 1, b + n + 1); n sort(A + 1, A + r + 1); n sort(B + 1, B + s + 1); n if (t1 < t2) { n h = 1; n swap(t1, t2); n swap(m, n); n swap(r, s); n swap(a, b); n swap(A, B); n } n mn = t1 - t2; n for (i = j = 1; i <= m; i++) { n while (abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first)) > n abs(t1 - a[i].first + b[j + 1].first - n (t2 - b[j + 1].first + a[i].first)) && n j < n) n j++; n if (mn > n abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first))) { n mn = abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first)); n asd = 1; n x = i; n y = j; n } n } n for (i = j = 1; i <= r && s; i++) { n while (abs(t1 - A[i].first + B[j].first - (t2 - B[j].first + A[i].first)) > n abs(t1 - A[i].first + B[j + 1].first - n (t2 - B[j + 1].first + A[i].first)) && n j < s) n j++; n if (mn > n abs((t1 - A[i].first + B[j].first) - (t2 - B[j].first + A[i].first))) { n mn = abs((t1 - A[i].first + B[j].first) - (t2 - B[j].first + A[i].first)); n asd = 2; n x = i; n y = j; n } n } n cout << mn << endl << asd << endl; n if (asd == 1) { n if (!h) n cout << a[x].second << << b[y].second; n else n cout << b[y].second << << a[x].second; n } else if (asd) { n if (!h) { n cout << A[x].second.first << << B[y].second.first << endl; n cout << A[x].second.second << << B[y].second.second; n } else { n cout << B[y].second.first << << A[x].second.first << endl; n cout << B[y].second.second << << A[x].second.second; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, i, j, n, x, y; n cin >> x >> y; n bool c = 0; n char a; n for (i = 0; i < x; i++) { n for (j = 0; j < y; j++) { n cin >> a; n if (a != W && a != B && a != G ) c = 1; n } n } n if (c) n puts( #Color ); n else n puts( #Black&White ); n return 0; n } n "} +{"func_code_string": "#include n double const EPS = 3e-8; n using namespace std; n template n T gcd(T a, T b) { n return (b != 0 ? gcd(b, a % b) : a); n } n template n T lcm(T a, T b) { n return (a / gcd(a, b) * b); n } n struct debugger { n template n debugger& operator,(const T& v) { n cerr << v << t ; n return *this; n } n } dbg; n template n ostream& operator<<(ostream& o, const pair& p) { n return o << ( << p.first << , << p.second << ) ; n } n template n ostream& operator<<(ostream& o, const vector& v) { n o << [ ; n for (__typeof((v).end()) it = (v).begin(); it != (v).end(); ++it) n o << *it << , ; n return o << ] ; n } n template n ostream& operator<<(ostream& o, const set& v) { n o << [ ; n for (__typeof((v).end()) it = (v).begin(); it != (v).end(); ++it) n o << *it << , ; n return o << ] ; n } n template n inline bool read(T& x) { n int c = getchar(); n int sgn = 1; n while (~c && c < 0 || c > 9 ) { n if (c == - ) sgn = -1; n c = getchar(); n } n for (x = 0; ~c && 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; n x *= sgn; n return ~c; n } n int dx[] = {1, 0, -1, 0}; n int dy[] = {0, 1, 0, -1}; n const int NX = 1e6 + 10; n int fromFront[NX], fromBack[NX]; n string a, b; n void solve(int cs) { n cin >> a >> b; n int asz = a.size(); n int bsz = b.size(); n int backIdx = bsz - 1; n int cur = 0; n for (int i = asz - 1; i >= 0; i--) { n if (backIdx >= 0 && a[i] == b[backIdx]) { n backIdx--; n cur++; n } n fromBack[i] = cur; n } n int frontIdx = 0; n cur = 0; n for (int i = 0; i < asz; i++) { n if (frontIdx < bsz && a[i] == b[frontIdx]) { n frontIdx++; n cur++; n } n fromFront[i] = cur; n } n int low = 0, high = 0; n int ans = 0; n while (high < asz) { n int f = 0, b = 0; n if (low > 0) f = fromFront[low - 1]; n if (high + 1 < asz) b = fromBack[high + 1]; n if (f + b >= bsz) { n ans = max(ans, high - low + 1); n } else { n while (f + b < bsz && low <= high) { n low++; n f = fromFront[low - 1]; n if (high + 1 < asz) b = fromBack[high + 1]; n } n } n high++; n } n printf( %d n , ans); n } n int main() { n int t = 1; n for (int cs = 1; cs <= t; cs++) solve(cs); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n, k; n while (~scanf( %d%d , &n, &k)) { n int ant[55] = {0}; n int temp = 0; n int count = k; n for (int i = 1; i <= n; i++) { n scanf( %d , &ant[i - 1]); n if (i == k) temp = ant[i - 1]; n } n if (temp) n for (int i = k + 1; i <= n; i++) { n if (ant[i - 1] >= temp) n count++; n else n break; n } n else n for (int i = k; i >= 1; i--) { n if (!ant[i - 1]) count--; n } n printf( %d n , count); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void err(istream_iterator it) {} n template n void err(istream_iterator it, T a, Args... args) { n cerr << << *it << = << a; n err(++it, args...); n } n template n inline void min_self(T& x, U y) { n if (y < x) x = y; n } n template n inline void max_self(T& x, U y) { n if (x < y) x = y; n } n template n ostream& operator<<(ostream& out, pair pair) { n return out << ( << pair.first << , << pair.second << ) ; n } n template n ostream& operator<<(ostream& out, vector vec) { n out << ( ; n for (auto& v : vec) out << v << , ; n return out << ) ; n } n template n ostream& operator<<(ostream& out, set vec) { n out << ( ; n for (auto& v : vec) out << v << , ; n return out << ) ; n } n template n ostream& operator<<(ostream& out, map vec) { n out << ( ; n for (auto& v : vec) out << [ << v.first << , << v.second << ] ; n return out << ) ; n } n template n istream& operator>>(istream& in, pair& a) { n return in >> a.first >> a.second; n } n template n istream& operator>>(istream& in, vector& a) { n for (A& i : a) in >> i; n return in; n } n long long XX[4] = {-1, 0, 1, 0}; n long long YY[4] = {0, -1, 0, 1}; n void solve() { n long long n, res = 0; n cin >> n; n vector> a(n); n for (long long i = 0; i <= n - 1; i++) cin >> a[i]; n sort(a.begin(), a.end()); n long long maxi = a[0].second; n for (long long i = 1; i <= n - 1; i++) { n if (a[i].second < maxi && a[i].first > a[i - 1].first) { n res++; n } n max_self(maxi, a[i].second); n } n cout << res << n ; n return; n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int N, K; n cin >> N >> K; n double res = 0; n long double t1x, t1y, t2x, t2y; n cin >> t1x >> t1y; n for (int i = 1; i < N; ++i) { n t2x = t1x; n t2y = t1y; n cin >> t1x >> t1y; n res += sqrt((t1x - t2x) * (t1x - t2x) + (t1y - t2y) * (t1y - t2y)); n } n printf( %.15lf n , res * K / 50); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100005; n int down[N], sz[N], up[N], n; n vector > adj[N]; n void dfs(int s, int p) { n sz[s] = 1; n for (auto it : adj[s]) { n if (it.first != p) { n dfs(it.first, s); n sz[s] += sz[it.first]; n if (it.second) n down[s] += sz[it.first]; n else n down[s] += down[it.first]; n } n } n } n void dfs2(int s, int p) { n for (auto it : adj[s]) { n if (it.first != p) { n if (it.second) n up[it.first] = n - sz[it.first]; n else n up[it.first] = down[s] - down[it.first] + up[s]; n dfs2(it.first, s); n } n } n } n int main() { n int i; n scanf( %d , &n); n for (i = 0; i < n - 1; i++) { n int a, b, c, te; n bool flag = true; n scanf( %d%d%d , &a, &b, &c); n while (c > 0) { n if (c % 10 == 4 || c % 10 == 7) n ; n else n flag = false; n c /= 10; n } n adj[a - 1].push_back(make_pair(b - 1, flag)); n adj[b - 1].push_back(make_pair(a - 1, flag)); n } n long long ans = 0; n dfs(0, -1); n dfs2(0, -1); n for (i = 0; i < n; i++) { n long long temp = up[i] + down[i]; n ans += temp * (temp - 1); n } n cout << ans; n } n "} +{"func_code_string": "#include n double p[1010][1010]; n int a[1010]; n int n, m; n int main() { n double t, ans; n int i, j, x, y; n scanf( %d%d , &n, &m); n for (i = 1; i <= n; i++) scanf( %d , &a[i]); n for (i = 1; i <= n; i++) n for (j = 1; j <= n; j++) n if (a[i] > a[j]) n p[i][j] = 1; n else n p[i][j] = 0; n for (i = 1; i <= m; i++) { n scanf( %d%d , &x, &y); n p[x][y] = 0.5; n p[y][x] = 0.5; n for (j = 1; j <= n; j++) n if ((j != x) && (j != y)) { n t = (p[j][x] + p[j][y]) * 0.5; n p[j][x] = t; n p[x][j] = 1 - t; n p[j][y] = t; n p[y][j] = 1 - t; n } n } n ans = 0; n for (i = 1; i <= n - 1; i++) n for (j = i + 1; j <= n; j++) ans += p[i][j]; n printf( %.10lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int one, two, three, four; n bool check(deque x) { n int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0; n for (int i = 0; i < x.size(); i++) { n if (x[i] == 0) cnt1++; n if (x[i] == 1) cnt2++; n if (x[i] == 2) cnt3++; n if (x[i] == 3) cnt4++; n } n if (cnt1 == one && cnt2 == two && cnt3 == three & cnt4 == four) { n for (int i = 0; i + 1 < x.size(); i++) { n if (abs(x[i] - x[i + 1]) != 1) return 0; n } n cout << YES << n ; n for (int i : x) cout << i << ; n exit(0); n } n return 0; n } n deque merge(deque x, deque y) { n for (int i : y) x.push_back(i); n return x; n } n void go2(pair a, pair b, deque ans) { n deque ans2 = ans; n if (a.first < b.first) { n for (int i = 0; i < a.first; i++) { n ans.push_back(b.second); n ans.push_back(a.second); n } n ans.push_back(b.second); n } else { n for (int i = 0; i < b.first; i++) { n ans.push_back(a.second); n ans.push_back(b.second); n } n if (a.first != b.first) ans.push_back(a.second); n } n check(ans); n ans = ans2; n if (a.first <= b.first) { n for (int i = 0; i < a.first; i++) { n ans.push_back(b.second); n ans.push_back(a.second); n } n if (a.first != b.first) ans.push_back(b.second); n } else { n for (int i = 0; i < b.first; i++) { n ans.push_back(a.second); n ans.push_back(b.second); n } n if (a.first != b.first) ans.push_back(a.second); n } n ans = ans2; n deque zl; n if (a.first < b.first) { n for (int i = 0; i < a.first; i++) { n zl.push_back(b.second); n zl.push_back(a.second); n } n zl.push_back(b.second); n } else { n for (int i = 0; i < b.first; i++) { n zl.push_back(a.second); n zl.push_back(b.second); n } n if (a.first != b.first) zl.push_back(a.second); n } n check(merge(zl, ans)); n zl.clear(); n if (a.first <= b.first) { n for (int i = 0; i < a.first; i++) { n zl.push_back(b.second); n zl.push_back(a.second); n } n if (a.first != b.first) zl.push_back(b.second); n } else { n for (int i = 0; i < b.first; i++) { n zl.push_back(a.second); n zl.push_back(b.second); n } n if (a.first != b.first) zl.push_back(a.second); n } n check(merge(zl, ans)); n } n void go3(pair a, pair b, pair c, deque cur) { n deque ans; n if (a.first <= b.first) { n for (int i = 0; i < a.first; i++) { n ans.push_back(a.second); n ans.push_back(b.second); n } n go2(pair(b.first - a.first, b.second), c, merge(cur, ans)); n go2(pair(b.first - a.first, b.second), c, merge(ans, cur)); n ans.clear(); n for (int i = 0; i < a.first; i++) { n ans.push_back(b.second); n ans.push_back(a.second); n } n go2(pair(b.first - a.first, b.second), c, merge(cur, ans)); n go2(pair(b.first - a.first, b.second), c, merge(ans, cur)); n } n ans.clear(); n if (c.first <= b.first) { n for (int i = 0; i < c.first; i++) { n ans.push_back(c.second); n ans.push_back(b.second); n } n go2(a, pair(b.first - c.first, b.second), merge(cur, ans)); n go2(a, pair(b.first - c.first, b.second), merge(ans, cur)); n ans.clear(); n for (int i = 0; i < c.first; i++) { n ans.push_back(b.second); n ans.push_back(c.second); n } n go2(a, pair(b.first - c.first, b.second), merge(cur, ans)); n go2(a, pair(b.first - c.first, b.second), merge(ans, cur)); n } n } n void go4(int a, int b, int c, int d) { n if (a <= b) { n deque lul; n for (int i = 0; i < a; i++) { n lul.push_back(0); n lul.push_back(1); n } n go3(pair(b - a, 1), pair(c, 2), pair(d, 3), n lul); n lul.clear(); n for (int i = 0; i < a; i++) { n lul.push_back(1); n lul.push_back(0); n } n go3(pair(b - a, 1), pair(c, 2), pair(d, 3), n lul); n } n if (d <= c) { n deque lul; n for (int i = 0; i < d; i++) { n lul.push_back(3); n lul.push_back(2); n } n go3(pair(a, 0), pair(b, 1), pair(c - d, 2), n lul); n lul.clear(); n for (int i = 0; i < d; i++) { n lul.push_back(2); n lul.push_back(3); n } n go3(pair(a, 0), pair(b, 1), pair(c - d, 2), n lul); n } n } n int main() { n cin >> one >> two >> three >> four; n go4(one, two, three, four); n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long range(long long L) { n switch (L & 3) { n case 0: n return L; n case 1: n return 1; n case 2: n return L + 1; n case 3: n return 0; n } n } n int main() { n for (int N; cin >> N;) { n long long sum = 0; n for (int i = 0; i < (int)(N); ++i) { n long long m, x; n cin >> x >> m; n long long b = range(x - 1); n long long a = range(x + m - 1); n sum ^= b; n sum ^= a; n } n if (sum == 0) n cout << bolik << endl; n else n cout << tolik << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct trie { n char ch; n int son, next, father, suffix; n vector danger; n int sum; n }; n trie a[205]; n int now, m; n void clear(int x) { n a[x].son = a[x].next = 0; n a[x].danger.clear(); n } n void insert(char *s, int l, int t, int x) { n if (!a[x].son) { n a[x].son = ++m; n clear(m); n a[m].father = x; n a[m].ch = s[t]; n if (t + 1 == l) n a[m].danger.push_back(now); n else n insert(s, l, t + 1, m); n return; n } n int i = a[x].son; n while (1) { n if (!a[i].next || a[i].ch == s[t]) break; n i = a[i].next; n } n if (a[i].ch == s[t] && t + 1 == l) n a[i].danger.push_back(now); n else if (a[i].ch == s[t]) n insert(s, l, t + 1, i); n else { n a[i].next = ++m; n clear(m); n a[m].father = x; n a[m].ch = s[t]; n if (t + 1 == l) n a[m].danger.push_back(now); n else n insert(s, l, t + 1, m); n } n } n int q[205]; n int child(int x, char ch) { n for (int i = a[x].son; i; i = a[i].next) n if (a[i].ch == ch) return (i); n if (x == 1) return (1); n return (child(a[x].suffix, ch)); n } n void build_trie() { n int l, r; n l = r = 1; n q[1] = 1; n while (l <= r) { n int x = q[l++]; n for (int i = a[x].son; i; i = a[i].next) q[++r] = i; n } n a[1].suffix = 1; n for (int i = 2; i <= r; i++) { n int x = q[i]; n if (a[x].father == 1) { n a[x].suffix = 1; n continue; n } n a[x].suffix = child(a[a[x].father].suffix, a[x].ch); n for (int j = 0; j < (int)a[a[x].suffix].danger.size(); j++) n a[x].danger.push_back(a[a[x].suffix].danger[j]); n } n } n int n, base, k; n void read(char *s) { n int l; n scanf( %d , &l); n s[l] = 0 ; n for (int i = 0; i < l; ++i) { n int a; n scanf( %d , &a); n s[i] = a + a ; n } n } n int v[205]; n char l[205], r[205], s[205]; n const int MOD = 1000000007; n int curl; n char cur[205]; n int f[205][205][505]; n int dp(int i, int state, int sum, bool cmp, bool first) { n if (sum > k) { n return 0; n } n if (i == 0) { n return 1; n } n if (!first && !cmp && f[i][state][sum] != -1) { n return f[i][state][sum]; n } n int ret = 0; n int r = cur[curl - i] - a ; n for (int d = first; d < base; ++d) { n if (cmp && d > r) { n continue; n } n int nstate = child(state, d + a ), nsum = sum + a[nstate].sum; n bool ncmp = cmp && d == r; n ret += dp(i - 1, nstate, nsum, ncmp, false); n if (ret >= MOD) { n ret -= MOD; n } n } n if (!cmp && !first) { n f[i][state][sum] = ret; n } n return ret; n } n int cal(char *s) { n int l = strlen(s); n curl = l; n for (int i = 0; i < l; ++i) { n cur[i] = s[i]; n } n int ret = 0; n while (curl) { n ret += dp(curl, 1, 0, curl == l, true); n --curl; n if (ret >= MOD) { n ret -= MOD; n } n } n return ret; n } n int check(char *s) { n int sum = 0, cur = 1, l = strlen(s); n for (int i = 0; i < l; ++i) { n cur = child(cur, s[i]); n sum += a[cur].sum; n } n return sum <= k; n } n int main() { n memset(f, -1, sizeof(f)); n scanf( %d%d%d , &n, &base, &k); n read(l), read(r); n clear(m = 1); n for (int i = 0; i < n; i++) { n read(s); n scanf( %d , v + i); n now = i; n insert(s, strlen(s), 0, 1); n } n build_trie(); n for (int i = 1; i <= m; ++i) { n a[i].sum = 0; n for (int j = 0; j < (int)a[i].danger.size(); ++j) { n a[i].sum += v[a[i].danger[j]]; n } n } n long long ansl = cal(l), ansr = cal(r); n cout << ((ansr - ansl + check(l)) % MOD + MOD) % MOD << endl; n return 0; n } n "} +{"func_code_string": "#include n #include n #include n #define ff first n #define ss second n #define pb push_back n #define mp make_pair n #define ba back n #define ppb pop_back n #define eb emplace_back n #define eps 1e-6 n #define vec vector n #define sz(x) (int((x.size()))) n #define all(x) (x).begin(),(x).end() n #define FAST ios_base :: sync_with_stdio (false); cin.tie (NULL) n #define ll long long n #define loop(i,s,n) for(int i=s;i>n; n ll a[n]; n ll sum=0; n loop(i,0,n){ n cin>>a[i]; n sum+=a[i]; n } n sort(a,a+n); n ll mx=a[n-1],mn=a[0]; n ll z=(n-1)-sum%(n-1); n if(z==(n-1)){ n z=0; n } n sum+=z; n if(mx<=sum/(n-1)){ n cout<>t; n while(t--){ n solve(); n } n }"} +{"func_code_string": "#include n using namespace std; n int read() { n int x; n scanf( %d , &x); n return x; n } n const int N = 1123456; n int a[N]; n vector v[N]; n int c[N]; n priority_queue q[N]; n void dfs(int x, int t) { n c[x] = t; n q[t].push(a[x]); n for (int i = 0; i < v[x].size(); i++) { n int to = v[x][i]; n if (!c[to]) { n dfs(to, t); n } n } n } n int main() { n int n, m, i, j, x, y; n n = read(); n m = read(); n for (i = 1; i <= n; i++) { n a[i] = read(); n } n for (i = 1; i <= m; i++) { n x = read(); n y = read(); n v[x].push_back(y); n v[y].push_back(x); n } n int cnt = 1; n for (i = 1; i <= n; i++) { n if (!c[i]) { n dfs(i, cnt++); n } n } n for (i = 1; i <= n; i++) { n printf( %d , q[c[i]].top()); n q[c[i]].pop(); n } n } n "} +{"func_code_string": "#include n using namespace std; n stack > a; n int main() { n int n, m = 0, i = 1; n cin >> n; n while (n--) { n int b, c; n char d, e, f[40]; n scanf( ); n scanf( %c , &d); n scanf( %d%c%d , &b, &e, &c); n gets(f); n b %= 12; n if (f[1] == p ) b += 12; n if (m) { n if ((b < a.top().first) || (b == a.top().first && c < a.top().second)) n ; n else n m--; n if (b == a.top().first && c == a.top().second) n i++; n else n i = 1; n } n if (i > 10) { n m++; n i -= 10; n } n a.push({b, c}); n m++; n } n cout << m << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 100010; n const long long inf = 1e9 + 7; n long long n, a[maxn]; n long long minv = inf; n long long sum[3]; n int main() { n scanf( %I64d , &n); n for (long long i = 1; i <= n; i++) { n scanf( %I64d , &a[i]); n minv = min(minv, a[i]); n } n for (long long i = 1; i <= n; i++) a[i] -= minv; n for (long long i = 1; i <= n; i++) sum[a[i]]++; n sort(a + 1, a + n + 1); n if (a[n] < 2) { n printf( %I64d n , n); n for (long long i = 1; i <= n; i++) printf( %I64d , a[i] + minv); n return 0; n } else { n long long temp = min(sum[0], sum[2]); n long long temp2 = sum[1] >> 1; n if (temp > temp2) { n sum[1] += (temp << 1); n sum[0] -= temp; n sum[2] -= temp; n } else { n temp = temp2; n sum[1] -= (temp << 1); n sum[0] += temp; n sum[2] += temp; n } n printf( %I64d n , n - (temp << 1)); n for (long long i = 0; i < 3; i++) n for (long long j = 1; j <= sum[i]; j++) printf( %I64d , i + minv); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long gcd(long long a, long long b) { n return b == 0 ? a : gcd(b, a % b); n } n inline long long lcm(long long a, long long b) { return a * b / gcd(a, b); } n long long n, k, x, type(1), amt, box; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n >> k; n for (int i = 1; i <= k; i++) { n cin >> x; n if (x * (n / x) > amt) { n amt = x * (n / x); n box = n / x; n type = i; n } n } n cout << type << << box << endl; n } n "} +{"func_code_string": "#include n using namespace std; n void debug_out() { cerr << endl; } n void clock_out() { n cerr << nTime Elapsed : << 1.0 * clock() / CLOCKS_PER_SEC << s n ; n } n void fileio() { n freopen( /home/dwai/Desktop/cp/input.txt , r , stdin); n freopen( /home/dwai/Desktop/cp/output.txt , w , stdout); n freopen( /home/dwai/Desktop/cp/debug.txt , w , stderr); n } n void ofileio() { n freopen( input.txt , r , stdin); n freopen( output.txt , w , stdout); n } n template n void debug_out(Head H, Tail... T) { n cerr << << H; n debug_out(T...); n } n int IT_MAX = 1 << 20; n const long long MOD = 1000000007; n const int INF = 0x3f3f3f3f; n const long long LL_INF = 0x3f3f3f3f3f3f3f3f; n const double PI = acos(-1); n const double ERR = 1e-10; n int main() { n 42; n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n srand(time(NULL)); n long long n, m; n cin >> n >> m; n long long a[n], b[m]; n long long i; n long long mn = 0, mx = 0; n for (i = 0; i < n; i++) { n cin >> a[i]; n if (i == 0) { n mx = a[i]; n mn = a[i]; n } else n mx = max(mx, a[i]); n mn = min(mn, a[i]); n } n long long ans = mn * 2; n for (i = 0; i < n; i++) { n if (a[i] > ans) ans = a[i]; n } n for (i = 0; i < m; i++) { n cin >> b[i]; n if (b[i] <= ans) return cout << -1, 0; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N, K; n int T[200005]; n vector danger; n vector > v; n bool cf(pair x, pair y) { n return x.second * y.first > y.second * x.first; n } n int main() { n scanf( %d %d , &N, &K); n for (int i = 0; i < N; i++) { n scanf( %d , &T[i]); n if (T[i] < 0) { n danger.push_back(i); n } n } n if (danger.size() > K) n puts( -1 ); n else { n int change = danger.size() * 2; n K -= danger.size(); n for (int i = 0; i < (int)danger.size(); i++) { n if (i == danger.size() - 1) n v.push_back(make_pair(N - danger[i] - 1, 1)); n else n v.push_back(make_pair(danger[i + 1] - danger[i] - 1, 2)); n } n sort(v.begin(), v.end(), cf); n int idx = 0; n while (idx < v.size()) { n if (K - v[idx].first >= 0) { n K -= v[idx].first; n change -= v[idx].second; n } n idx++; n } n printf( %d n , change); n } n return 0; n } n "} +{"func_code_string": "#include n #define ff first n #define ss second n #define ll long long n #define ld long double n #define pb push_back n #define eb emplace_back n #define mp make_pair n #define mt make_tuple n #define pii pair n #define pll pair n #define vi vector n #define vl vector n #define vii vector n #define sws ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); n #define endl n n #define teto(a, b) ((a+b-1)/(b)) n using namespace std; n n // Extra n #define forn(i, n) for(int i = 0; i < (int)n; i++) n #define forne(i, a, b) for(int i = a; i <= b; i++) n #define all(x) x.begin(), x.end() n #define dbg(msg, var) cout << msg << << var << endl; n // n n const int MAX = 200010; n const ll MOD = (int)1e9 +7; n const int INF = 1e9; n const ll LLINF = 0x3f3f3f3f3f3f3f3f; n const ld EPS = 1e-8; n n int n, l, r, s; n vector> tab; n vector> btab; n n int dp(int idx, int soma) { n if(soma > s) return 0; n if(idx >= n) { n return (soma == s); n } n if(btab[idx][soma]) return tab[idx][soma]; n n // cout << idx << << soma << endl; n int res = 0; n int pega = dp(idx+1, soma + idx+1); n int npega = dp(idx+1, soma); n n if(npega >= pega) { n res = npega; n } n else { n res = pega; n } n n btab[idx][soma] = true; n return tab[idx][soma] = res; n } n n vi solve(vi vals, int sz, bool& ruim) { n int t = vals.size(); n vi foi(n+1, 0); n forn(i, t) n foi[vals[i]] = 1; n n ruim = false; n while(t < sz and !ruim) { n bool brk = false; n forne(i, 1, n) { n if(!foi[i]) continue; n forne(j, 1, i-1) { n if(j == i-j) continue; n if(!foi[j] and !foi[i-j]) { n foi[i] = 0; n foi[j] = 1; foi[i-j] = 1; n t++; n brk = true; n break; n } n } n if(brk) break; n } n if(!brk) ruim = true; n } n n return foi; n } n n int32_t main() { n // sws; n int t; n cin >> t; n n while(t--) { n cin >> n >> l >> r >> s; n n tab.assign(n, vector(s+1, -1)); n btab.assign(n, vector(s+1, 0)); n n bool win = dp(0, 0); n if(win) { n vi vals, p(n+1, -1); n set pos; n forne(i, 1, n) pos.insert(i); n n int idx = 0, soma = 0; n while(idx < n) { n if(dp(idx+1, soma)) { n idx++; n } n else { n soma += idx+1; n vals.pb(idx+1); n idx++; n } n } n n if(vals.size() > (r-l+1)) { n cout << -1 << endl; n continue; n } n n bool ruim; n // for(auto val : vals) cout << val << ; n // cout << endl; n n vi foi = solve(vals, (r-l+1), ruim); n // cout << ruim = << ruim << endl; n n // forne(i, 1, n) cout << foi[i] << ; n // cout << endl; n n if(ruim) cout << -1 << endl; n else { n int id1 = 1, id2 = 1; n forne(i, 1, n) { n if(l <= i and i <= r) { n while(id1 <= n and !foi[id1]) id1++; n cout << id1 << ; n id1++; n } n else { n while(id2 <= n and foi[id2]) id2++; n cout << id2 << ; n id2++; n } n } n cout << endl; n } n n } n else { n cout << -1 << endl; n } n } n n // verificar limites, long long n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC optimization( unroll-loops ) n std::pair DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}, n {-1, 1}, {-1, -1}, {1, 1}, {1, -1}}; n using namespace std; n const long long mod = 998244353; n long long nop = 70; n vector primes(nop + 1, 1); n void sieve() { n primes[1] = primes[0] = 0; n for (long long i = 2; i * i <= nop; i++) { n if (primes[i]) { n for (long long j = i * i; j <= nop; j += i) { n primes[j] = 0; n } n } n } n } n long long gcd(long long a, long long b) { n if (b > a) swap(b, a); n if (b == 0) return a; n return gcd(b, a % b); n } n void extgcd(long long a, long long b, long long& x, long long& y) { n if (a == 0) { n x = a; n y = b; n return; n } n extgcd(b % a, a, x, y); n long long y1 = y, x1 = x; n x = y1 - (b / a) * x1; n y = x1; n } n long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } n long long bexp(long long num, long long e) { n long long ans = 1; n while (e > 0) { n if (e & 1) { n ans *= num; n } n num *= num; n e >>= 1; n } n return ans; n } n long long mexp(long long num, long long e) { n long long ans = 1; n while (e > 0) { n if (e & 1) { n ans = (ans * num) % mod; n } n num *= num; n num %= mod; n e >>= 1; n } n return ans % mod; n } n long long modinv(long long a) { n a %= mod; n return mexp(a, mod - 2); n } n void solve() { n long long n, k; n cin >> n >> k; n string s; n cin >> s; n sort(s.begin(), s.end()); n vector cnt(26, 0); n for (long long i = 0; i < (n); i++) { n cnt[s[i] - a ]++; n } n int first = -1, last = -1, nod = 0; n for (long long i = 0; i < (26); i++) { n if (cnt[i]) { n nod++; n if (first == -1) first = i; n last = i; n } n } n if (cnt[first] < k) { n cout << s[k - 1] << n ; n return; n } n string worst = ; n worst += char( a + first); n if (nod >= 3 || (nod == 2 && cnt[first] > k)) { n for (long long i = k; i < n; i++) { n worst += s[i]; n } n } else { n for (long long i = k; i < n; i++) { n worst += s[i]; n i += (k - 1); n } n } n cout << worst << n ; n } n int main() { n cin.tie(0); n cout.tie(0); n ios::sync_with_stdio(0); n int t = 1; n cin >> t; n for (long long T = 1; T <= (t); T++) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char str[100010]; n int ct[100010][4]; n int main() { n int N, x[5], R, L, M; n scanf( %s , str); n N = strlen(str); n for (int i = 1; i <= N; i++) { n for (int j = 0; j < 3; j++) ct[i][j] = ct[i - 1][j]; n ct[i][str[i - 1] - x ]++; n } n scanf( %d , &M); n for (int i = 0; i < M; i++) { n scanf( %d%d , &L, &R); n L--; n if (R - L < 3) { n puts( YES ); n continue; n } n for (int j = 0; j < 3; j++) x[j] = ct[R][j] - ct[L][j]; n if (x[0] <= x[1] && x[1] <= x[2] && x[2] - x[0] <= 1) n puts( YES ); n else if (x[1] <= x[2] && x[2] <= x[0] && x[0] - x[1] <= 1) n puts( YES ); n else if (x[2] <= x[0] && x[0] <= x[1] && x[1] - x[2] <= 1) n puts( YES ); n else n puts( NO ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 5; n int n, a[maxn]; n struct node { n int pre; n bool flag; n int other; n } num[2 * maxn]; n int main(int argc, char const *argv[]) { n while (cin >> n) { n bool flag = true; n for (int i = 0; i <= n; i++) { n cin >> a[i]; n if (a[i] != 1) flag = false; n } n if (flag == true) { n cout << perfect << endl; n continue; n } n bool temp = false; n bool ans = false; n int cnt = 1; n for (int i = 0; i <= n; i++) { n if (i > 0 && a[i] > 1 && a[i - 1] > 1 && ans == false) { n ans = true; n int par = cnt - 1; n int k = a[i]; n k--; n while (k--) { n num[cnt].pre = par; n num[cnt].other = par - 1; n num[cnt].flag = true; n cnt++; n } n num[cnt].pre = num[cnt].other = par; n num[cnt].flag = true; n cnt++; n } else { n int par = cnt - 1; n int k = a[i]; n while (k--) { n num[cnt].pre = par; n num[cnt].flag = false; n cnt++; n } n } n } n if (ans == false) { n cout << perfect << endl; n continue; n } n cout << ambiguous << endl; n for (int i = 1; i < cnt; i++) cout << num[i].pre << ; n cout << endl; n for (int i = 1; i < cnt; i++) { n if (num[i].flag == false) n cout << num[i].pre; n else n cout << num[i].other; n cout << ; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int mymax(int x) { n int max = 0; n while (x) { n int s = x % 10; n if (s > max) max = s; n x /= 10; n } n return max; n } n int zh(int x, int n) { n int s = 0, p = 1; n while (x) { n s += x % 10 * p; n x /= 10; n p *= n; n } n return s; n } n int main() { n int a, b; n cin >> a >> b; n int n = max(mymax(a), mymax(b)) + 1; n int num = zh(a, n) + zh(b, n); n int j = 0; n while (num) { n int s = num % n; n num /= n; n j++; n } n cout << j << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n class Constellation { n static const long long N = 100010; n inline long long sign(long long x) { return x > 0 ? 1 : x == 0 ? 0 : -1; } n struct point { n long long x, y, num; n } b[N]; n long long n; n long long cross(const point &a, const point &b, const point &c) { n return sign((b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x)); n } n bool contain(const point &a, const point &b, const point &c, const point &p) { n long long v1 = cross(a, b, p), v2 = cross(b, c, p), v3 = cross(c, a, p); n return v1 * v2 >= 0 && v2 * v3 >= 0 && v3 * v1 >= 0; n } n n public: n void solve() { n cin >> n; n for (long long i = 1; i <= n; ++i) cin >> b[i].x >> b[i].y; n long long p1 = 1, p2 = 2, p3 = 0; n for (long long i = 3; i <= n; ++i) n if (cross(b[p1], b[p2], b[i])) { n p3 = i; n break; n } n for (long long i = 1; i <= n; ++i) n if (i != p1 && i != p2 && i != p3 && contain(b[p1], b[p2], b[p3], b[i])) { n if (cross(b[p1], b[p2], b[i])) n p3 = i; n else n p2 = i; n } n cout << p1 << << p2 << << p3 << endl; n } n } T; n int main() { T.solve(); } n "} +{"func_code_string": "#include n double eps = 1e-9; n using namespace std; n int main() { n std::ios::sync_with_stdio(false); n int x, y, z, w, b, a; n cin >> x >> y >> z >> w >> b >> a; n cout << (2 * (2 * x + a + y) * (z + y) - (a * a + b * b + y * y + z * z)) / 2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dirx[] = {1, 0, -1, 0}; n int diry[] = {0, 1, 0, -1}; n int a; n vector graph[100005]; n int dist[100005]; n bool visit[100005]; n int cnt = 0; n bool flag = false; n int dfs(int u, int par) { n visit[u] = true; n for (int i = 0; i < graph[u].size(); i++) { n if (!visit[graph[u][i]]) dist[u] += dfs(graph[u][i], u); n } n if (dist[u] != 0 && (dist[u] + 1) % 2 == 0) { n cnt++; n dist[u] = 0; n return 0; n } else n return 1; n } n int main() { n scanf( %d , &a); n int x, y; n int start = 0; n for (int i = 0; i < a - 1; i++) { n scanf( %d %d , &x, &y); n start = x; n graph[x].push_back(y); n graph[y].push_back(x); n } n if (a % 2 == 1) { n cout << -1 << endl; n return 0; n } n dfs(start, 0); n cout << cnt - 1 << endl; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:167772160000 ) n using namespace std; n long long dp[5100][5100]; n long long x[5100]; n int a[5100], b[5100], c[5100], d[5100]; n int main() { n int leftminright = 0; n int n, s, e; n cin >> n >> s >> e; n s--; n e--; n for (int i = 0; i < n; i++) cin >> x[i]; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) cin >> b[i]; n for (int i = 0; i < n; i++) cin >> c[i]; n for (int i = 0; i < n; i++) cin >> d[i]; n x[n] = 0; n for (int i = 0; i < n + 2; i++) n for (int j = 0; j < n + 2; j++) dp[i][j] = 1E18; n dp[0][0] = 0; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n if (i != 0) { n if (j == 0 && leftminright != 1) continue; n } n if (i == s) { n leftminright--; n long long now = dp[i][j]; n now += d[i]; n dp[i + 1][j + 1] = n min(dp[i + 1][j + 1], n now + (x[i + 1] - x[i]) * ((j + 1) * 2 + leftminright)); n now -= d[i]; n now += c[i]; n if (j + leftminright + 1 > 0) n dp[i + 1][j] = min(dp[i + 1][j], n now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); n leftminright++; n continue; n } n if (i == e) { n leftminright++; n long long now = dp[i][j]; n now += b[i]; n dp[i + 1][j] = n min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); n now -= b[i]; n now += a[i]; n if (j == 0) { n leftminright--; n continue; n } n dp[i + 1][j - 1] = n min(dp[i + 1][j - 1], n now + (x[i + 1] - x[i]) * (2 * (j - 1) + leftminright)); n leftminright--; n continue; n } n long long now = dp[i][j]; n now += b[i]; n now += d[i]; n dp[i + 1][j + 1] = n min(dp[i + 1][j + 1], n now + (x[i + 1] - x[i]) * ((j + 1) * 2 + leftminright)); n now -= d[i]; n now += c[i]; n if (j + leftminright > 0) n dp[i + 1][j] = n min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); n now -= b[i]; n now += a[i]; n now -= c[i]; n now += d[i]; n if (j > 0) n dp[i + 1][j] = n min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); n now -= d[i]; n now += c[i]; n if (j > 0 && j + leftminright > 0) n dp[i + 1][j - 1] = n min(dp[i + 1][j - 1], n now + (x[i + 1] - x[i]) * ((j - 1) * 2 + leftminright)); n } n if (i == s) leftminright--; n if (i == e) leftminright++; n } n cout << dp[n][0]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = acos(-1.0); n const double EPS = 1e-8; n const long long INF = 0x3f3f3f3f3f3f3f3f; n inline long long readll() { n long long x(0), op(1); n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) op = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); n return x * op; n } n const int sz = 2e5 + 9; n long long a[sz], n; n long long solve(long long a, long long b) { n if (a == 0 || a == b) return 0; n int l = 1, r = n; n if (b) { n if (b < a) n l = b + 1; n else n r = b - 1; n } n return (a - l + 1) * (r - a + 1); n } n int main() { n n = readll(); n for (int i = 1; i < n + 1; ++i) a[i] = readll(); n a[0] = a[n + 1] = 0; n long long ans = 0; n for (int i = 0; i < n + 1; ++i) { n ans += solve(a[i], a[i + 1]); n ans += solve(a[i + 1], a[i]); n } n cout << ans / 2 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int max_n = 200222, inf = 1000111222; n int n, m, a[max_n]; n bool check(int cnt) { n long long sum = 0; n int last = 1; n for (int i = 0; i < n; ++i) { n if (i % cnt == 0) --last; n if (a[i] + last < 0) break; n sum += (a[i] + last); n } n return sum >= m; n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < n; ++i) scanf( %d , &a[i]); n sort(a, a + n); n reverse(a, a + n); n int l = 0, r = n + 1; n while (r - l > 1) { n int mid = (l + r) / 2; n if (check(mid)) n r = mid; n else n l = mid; n } n if (r > n) n puts( -1 ); n else n printf( %d n , r); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long t[4 * 100100], dp[100100], a[100100], b[100100]; n long long K = 1, n, m; n void build() { n while (K < m + 2) K <<= 1; n } n long long query(long long l, long long r) { n long long ans = 0; n for (l += K - 1, r += K + 1; l ^ r ^ 1; l >>= 1, r >>= 1) { n if (~l ^ 1) ans = ((ans) >= (t[l + 1]) ? (ans) : (t[l + 1])); n if (r ^ 1) ans = ((ans) >= (t[r - 1]) ? (ans) : (t[r - 1])); n } n return ans; n } n void update(long long id, long long v) { n for (t[id += K] = v, id >>= 1; id >= 1; id >>= 1) n t[id] = max(t[id << 1 | 1], t[id << 1]); n } n long long get_id(long long x) { n long long l = 1, r = m, mid; n while (l < r) { n mid = (l + r + 1) >> 1; n if (b[mid] > x) n r = mid - 1; n else n l = mid; n } n return l; n } n void unique() { n m = 1; n for (long long i = 2; i <= n; i++) n if (b[i] != b[m]) b[++m] = b[i]; n } n void input() { n scanf( %I64d , &n); n for (long long i = 1, r, h; i <= n; i++) { n scanf( %I64d%I64d , &r, &h); n a[i] = b[i] = r * r * h; n } n return; n } n void init() { n sort(b + 1, b + n + 1); n unique(); n build(); n return; n } n void work() { n for (long long i = 1; i <= n; i++) { n long long id = get_id(a[i]); n dp[i] = query(1, id - 1) + a[i]; n update(id, dp[i]); n } n return; n } n void output() { n printf( %.15lf , query(1, m) * M_PI); n return; n } n int main() { n input(); n init(); n work(); n output(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, c[100005], visit[100005], tp = 0; n vector a[100005], ans; n bool ok[100005]; n void dfs(int u) { n visit[u] = tp; n for (int i = 0; i < a[u].size(); i++) { n int v = a[u][i]; n if (ok[v]) continue; n if (visit[v] == tp) { n cout << -1; n exit(0); n } else n dfs(v); n } n ans.push_back(u); n ok[u] = 1; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> n >> k; n for (int i = 1; i <= k; i++) cin >> c[i]; n for (int i = 1; i <= n; i++) { n int t; n cin >> t; n while (t--) { n int u; n cin >> u; n a[i].push_back(u); n } n } n for (int i = 1; i <= k; i++) { n if (!visit[c[i]]) { n tp++; n dfs(c[i]); n } n } n cout << ans.size() << n ; n for (int i = 0; i < ans.size(); i++) cout << ans[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n; n cin >> n; n long long int sum = n * (n - 1) / 2; n if (n == 0) { n cout << 0; n return 0; n } n if ((n % 2 == 0 && n % 4 != 0) || (n % 2 == 1 && n % 4 != 3)) n cout << 1; n else n cout << 0; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream &operator<<(ostream &os, const pair &p) { n return os << ( << p.first << , << p.second << ) ; n } n template n ostream &operator<<(ostream &os, const vector &v) { n os << { ; n typename vector::const_iterator it; n for (it = v.begin(); it != v.end(); it++) { n if (it != v.begin()) os << , ; n os << *it; n } n return os << } ; n } n template n ostream &operator<<(ostream &os, const set &v) { n os << [ ; n typename set::const_iterator it; n for (it = v.begin(); it != v.end(); it++) { n if (it != v.begin()) os << , ; n os << *it; n } n return os << ] ; n } n template n ostream &operator<<(ostream &os, const map &v) { n os << [ ; n typename map::const_iterator it; n for (it = v.begin(); it != v.end(); it++) { n if (it != v.begin()) os << , ; n os << it->first << = << it->second; n } n return os << ] ; n } n int n, m; n string hor, ver; n int give_dir(char ch) { n if (ch == > || ch == v ) n return 1; n else n return -1; n } n bool valid(int x, int y) { n if (x < 0 || y < 0 || x >= n || y >= m) return false; n return true; n } n void dfs(int x, int y, vector > &visited) { n visited[x][y] = true; n int nx, ny; n nx = x + give_dir(ver[y]); n ny = y + give_dir(hor[x]); n if (valid(nx, y) && !visited[nx][y]) dfs(nx, y, visited); n if (valid(x, ny) && !visited[x][ny]) dfs(x, ny, visited); n } n int main() { n cin >> n >> m; n cin >> hor >> ver; n for (int k = 0; k < (n); k++) { n for (int l = 0; l < (m); l++) { n vector > visited(n, vector(m, false)); n dfs(k, l, visited); n for (int i = 0; i < (n); i++) { n for (int j = 0; j < (m); j++) { n if (!visited[i][j]) { n cout << NO << endl; n return 0; n } n } n } n } n } n cout << YES << endl; n return 0; n } n "} +{"func_code_string": "#include n template n void cxk(T& a, T b) { n a = a > b ? a : b; n } n template n void cnk(T& a, T b) { n a = a < b ? a : b; n } n long long gi() { n long long x = 0, f = 1; n char ch = getchar(); n while (!isdigit(ch)) f ^= ch == - , ch = getchar(); n while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); n return f ? x : -x; n } n int col[200010], f[200010][2][2][2], p2[400010]; n void inc(int& x, int y) { n x = x + y >= 1000000007 ? x + y - 1000000007 : x + y; n } n int main() { n int n = gi(), p = gi(); n for (int i = 1; i <= n; ++i) col[i] = gi(); n p2[0] = 1; n for (int i = 1; i <= n + n; ++i) p2[i] = 2 * p2[i - 1] % 1000000007; n f[1][0][0][0] = 1; n for (int i = 1; i <= n; ++i) n for (int j = 0; j < 2; ++j) n for (int k = 0; k < 2; ++k) n for (int l = 0; l < 2; ++l) n if (f[i][j][k][l]) { n if (col[i] != 1) { n inc(f[i + 1][1][k][!l], n 1ll * p2[i - 1 - !!k] * f[i][j][k][l] % 1000000007); n if (k) n inc(f[i + 1][j][k][l], n 1ll * p2[i - 2] * f[i][j][k][l] % 1000000007); n } n if (col[i] != 0) { n inc(f[i + 1][j][1][!l], n 1ll * p2[i - 1 - !!j] * f[i][j][k][l] % 1000000007); n if (j) n inc(f[i + 1][j][k][l], n 1ll * p2[i - 2] * f[i][j][k][l] % 1000000007); n } n } n int ans = 0; n for (int i = 0; i < 2; ++i) n for (int j = 0; j < 2; ++j) inc(ans, f[n + 1][i][j][p]); n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #define me(a, b) memset(a, b, sizeof(a)) n #define IOS() ios::sync_with_stdio(false), cin.tie(0) n #define endl n n n typedef long long ll; n typedef pair pll; n typedef pair pii; n const int INF = 0x3f3f3f3f; n const int maxn = 2e5 + 5; n const ll mod = 1e9 + 7; n n int cnt[26]; n int n, k; n vector ans; n int check() n { n ans.clear(); n int sum = 0; n for(int i = 0; i < 26; ++i) { n int r = cnt[i] % k; n if(r){ n ans.push_back(pii(i, k - r)); n sum += k - r; n } n } n return sum; n } n n void solve() n { n me(cnt, 0); n string s; n cin >> n >> k >> s; n for(char &c : s) n ++cnt[c - a ]; n if(check() == 0) { n cout << s << endl; n return ; n } n for(int i = s.size()-1; i >= 0; --i) { n char &c = s[i]; n --cnt[c - a ]; n for(int j = s[i] - a + 1; j < 26; ++j) { n c = j + a ; n ++cnt[j]; n int sum = s.size()-i-1 - check(); n --cnt[j]; n if(sum >= 0 && sum % k == 0) { n string t; n for(int p = 0; p <= i; ++p) n t.push_back(s[p]); n t.append(sum, a ); n for(pii p : ans) { n t.append(p.second, p.first+ a ); n } n cout << t << endl; n return ; n } n n } n } n cout << -1 n ; n } n n n int main() n { n IOS(); n int T; n cin >> T; n while(T--) n solve(); n return 0; n }"} +{"func_code_string": "#include n using namespace std; n int f[100001], g[100001], h[100001]; n int n, cnt; n bool work() { n cnt = -1; n for (int i = 0; i < n; ++i) { n if (g[i] != -1) { n if (f[i] != i) return false; n } else { n if (g[f[i]] == -1) { n g[i] = ++cnt; n h[cnt] = f[i]; n g[f[i]] = cnt; n } else { n if (h[g[f[i]]] != f[i]) return false; n h[g[f[i]]] = f[i]; n g[i] = g[f[i]]; n } n } n } n return true; n } n int main() { n cin >> n; n for (int i = 0; i < n; ++i) cin >> f[i]; n for (int i = 0; i < n; ++i) --f[i]; n for (int i = 0; i < n; ++i) g[i] = h[i] = -1; n if (work()) { n cout << ++cnt << endl; n for (int i = 0; i < n; ++i) cout << ++g[i] << ; n cout << endl; n for (int i = 0; i < cnt; ++i) cout << ++h[i] << ; n } else n cout << -1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n; n cin >> n; n cout << n / 2 + 1; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxl = 200005; n int T, n, mk, seq[maxl]; n char s[maxl]; n inline char read() { n char ch = getchar(); n while (ch != < && ch != > ) ch = getchar(); n return ch; n } n int main() { n scanf( %d , &T); n while (T--) { n scanf( %d , &n); n mk = 0; n memset(seq, 0, sizeof(seq)); n for (register int i = 1; i < n; i++) s[i] = read(); n s[0] = > ; n s[n] = < ; n for (register int i = n; i; i--) n if (s[i - 1] == > && s[i] == < ) seq[i] = ++mk; n mk = n; n for (register int i = 1, j, tmp; i <= n; i++) { n if (seq[i]) continue; n if (s[i - 1] == > ) n seq[i] = mk--; n else { n for (j = i; s[j] != > && j < n; j++) n ; n tmp = j; n for (; j >= i; j--) seq[j] = mk--; n i = tmp; n } n } n for (register int i = 1; i <= n; i++) printf( %d , seq[i]); n printf( n ); n memset(seq, 0, sizeof(seq)); n mk = 0; n for (register int i = 1; i <= n; i++) n if (s[i - 1] == > && s[i] == < ) seq[i] = ++mk; n mk = n; n for (register int i = n, j, tmp; i; i--) { n if (seq[i]) continue; n if (s[i] == < ) n seq[i] = mk--; n else { n for (j = i; s[j - 1] != < && j > 1; j--) n ; n tmp = j; n for (; j <= i; j++) seq[j] = mk--; n i = tmp; n } n } n for (register int i = 1; i <= n; i++) printf( %d , seq[i]); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ifstream in( date.in ); n ofstream out( date.out ); n long long nr2, k, rez[4001], con = 0, nr, n, pli[4001], plp[4001], inc[4001], n i, j; n cin >> n; n for (i = 1; i <= n; i++) cin >> pli[i] >> plp[i] >> inc[i]; n for (i = 1; i <= n; i++) { n nr = nr2 = 0; n if (inc[i] >= 0) { n rez[++con] = i; n nr = pli[i]; n for (j = i + 1; nr > 0 && j <= n; j++) { n if (inc[j] >= 0) { n inc[j] -= nr--; n } else { n if (pli[j]) { n inc[j] -= nr; n pli[j] = 0; n nr2 = plp[j]; n for (k = j + 1; k <= n; k++) inc[k] -= nr2; n } n } n } n } else { n if (pli[i]) { n pli[i] = 0; n nr2 = plp[i]; n for (k = i + 1; k <= n; k++) inc[k] -= nr2; n } n } n } n cout << con << n ; n for (j = 1; j <= con; j++) cout << rez[j] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1000000007; n const int N = 128; n int num[N]; n int main() { n int n; n cin >> n; n for (int i = 1; i <= n; ++i) { n cin >> num[i]; n } n int m; n cin >> m; n for (int i = 0; i < m; ++i) { n int x, y; n cin >> x >> y; n num[x - 1] += y - 1; n num[x + 1] += num[x] - y; n num[x] = 0; n } n for (int i = 1; i <= n; ++i) { n cout << num[i] << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int p[3010000], n; n int main() { n scanf( %d , &n); n for (int i = 1; i < n + 1; i++) p[i] = i; n for (int i = 2; i < n + 1; i++) { n int s = p[i - 1], ns; n for (int j = i - 1; j <= n + i - 2; j += i) { n ns = p[j + i]; n if (j + i <= n + i - 2) n p[j + i] = s; n else n p[n + i - 1] = s; n s = ns; n } n } n for (int i = 1; i < n + 1; i++) printf( %d , p[n - 1 + i]); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int arr[101]; n int n; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n } n sort(arr, arr + n); n for (int i = 0; i < n; i++) { n cout << arr[i] << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 100; n long long arr[N], d[N], tree[N << 2], mx[N << 2]; n void build(int rt, int l, int r) { n if (l == r) { n tree[rt] = mx[rt] = arr[l]; n return; n } n int m = (l + r) / 2; n build(rt << 1, l, m); n build(rt << 1 | 1, m + 1, r); n tree[rt] = tree[rt << 1] + tree[rt << 1 | 1]; n mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]); n } n void update(int L, int R, int rt, int l, int r) { n if (mx[rt] <= 2) return; n if (l == r) { n tree[rt] = mx[rt] = d[tree[rt]]; n return; n } n int m = (l + r) >> 1; n if (L <= m) update(L, R, rt << 1, l, m); n if (R > m) update(L, R, rt << 1 | 1, m + 1, r); n tree[rt] = tree[rt << 1] + tree[rt << 1 | 1]; n mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]); n } n long long query(int L, int R, int rt, int l, int r) { n if (L <= l && r <= R) { n return tree[rt]; n } n int m = (l + r) >> 1; n long long ans = 0; n if (L <= m) ans += query(L, R, rt << 1, l, m); n if (R > m) ans += query(L, R, rt << 1 | 1, m + 1, r); n return ans; n } n int main() { n ios::sync_with_stdio(false); n int n, m, t, l, r; n for (int i = 1; i < N; i++) { n for (int j = i; j < N; j += i) d[j]++; n } n cin >> n >> m; n for (int i = 1; i <= n; i++) cin >> arr[i]; n build(1, 1, n); n while (m--) { n cin >> t >> l >> r; n if (t == 1) n update(l, r, 1, 1, n); n else n cout << query(l, r, 1, 1, n) << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int a[] = {0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, n 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, n 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, n 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, n 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, n 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2}; n int main() { n int n; n cin >> n; n cout << a[n]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline bool fs(T &x) { n int c = getchar(); n int sgn = 1; n while (~c && c < 0 || c > 9 ) { n if (c == - ) sgn = -1; n c = getchar(); n } n for (x = 0; ~c && 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; n x *= sgn; n return ~c; n } n int main() { n long long int n, m, cnt = 0; n fs(n); n fs(m); n for (long long int i = 1; i * i <= m; i++) { n if (m % i == 0 && m / i <= n) { n if (m / i != i) cnt++; n cnt++; n } n } n cout << cnt << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int solve(vector > v, int price) { n if (v.size() < 2) return 0; n vector p, b; n for (int i = 0; i < v.size(); i++) n p.push_back(v[i].first), b.push_back(v[i].second); n int amx[v.size()]; n amx[0] = b[0]; n for (int i = 1; i < b.size(); i++) amx[i] = max(amx[i - 1], b[i]); n int ans = 0; n for (int i = 0; i < v.size(); i++) { n int id = upper_bound(p.begin(), p.begin() + i, price - p[i]) - p.begin(); n id--; n if (id < 0 || id >= v.size()) continue; n if (id != i) ans = max(ans, b[i] + amx[id]); n } n return ans; n } n int main() { n int i, j, k; n int n, m; n int c, d; n int x, y; n char ch; n cin >> n >> c >> d; n int mc = 0, md = 0; n vector > coins, diamonds; n for (i = 0; i < n; i++) { n cin >> x >> y >> ch; n if (ch == C ) { n if (c >= y) mc = max(mc, x), coins.push_back({y, x}); n } else { n if (d >= y) md = max(md, x), diamonds.push_back({y, x}); n } n } n int ans = 0; n if (mc > 0 && md > 0) ans = mc + md; n sort(coins.begin(), coins.end()); n sort(diamonds.begin(), diamonds.end()); n ans = max(ans, solve(coins, c)); n ans = max(ans, solve(diamonds, d)); n printf( %d , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int _, n; n char s[100005]; n int main() { n scanf( %d , &_); n while (_--) { n scanf( %d , &n); n s[0] = a ; n scanf( %s , s + 1); n int p = -1; n for (int i = n; i >= 1; i--) { n if (s[i] == 0 ) { n p = i; n break; n } n } n bool f = 0; n for (int i = 1; i <= n; i++) { n if (s[i] == 1 ) { n if (s[i + 1] == 0 ) n f = 1; n else n f = 0; n if (i < p) { n continue; n } n printf( 1 ); n } else { n if (f) { n printf( 0 ); n i = p; n continue; n } n printf( 0 ); n } n } n puts( ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, ans, notOK; n map M; n int main() { n cin >> n; n for (int i = 0, x; i < n; i++) cin >> x, M[x]++; n for (map::iterator it = M.begin(); it != M.end(); it++) { n if (it->first) { n if (it->second == 2) n ans++; n else if (it->second > 2) n notOK = 1; n } n } n cout << (notOK ? -1 : ans); n } n "} +{"func_code_string": "#include n using namespace std; n vector cr1[27]; n vector cr2[27]; n int s1[27]; n int s2[27]; n struct node { n int x; n int y; n }; n int main() { n int n; n cin >> n; n char c; n for (int i = 0; i < n; i++) { n cin >> c; n if (c == ? ) { n s1[26]++; n cr1[26].push_back(i); n } else { n s1[c - a ]++; n cr1[c - a ].push_back(i); n } n } n for (int i = 0; i < n; i++) { n cin >> c; n if (c == ? ) { n s2[26]++; n cr2[26].push_back(i); n } else { n s2[c - a ]++; n cr2[c - a ].push_back(i); n } n } n int cnt = 0; n vector nd; n for (int i = 0; i < 26; i++) { n int x = s1[i] - 1; n int y = s2[i] - 1; n while (x >= 0 && y >= 0) { n node n1; n n1.x = cr1[i][x]; n n1.y = cr2[i][y]; n nd.push_back(n1); n cnt++; n x--; n y--; n } n if (x >= 0 && y < 0) { n node n1; n while (x >= 0 && s2[26] > 0) { n n1.x = cr1[i][x]; n n1.y = cr2[26][s2[26] - 1]; n nd.push_back(n1); n cnt++; n s2[26]--; n x--; n } n } else if (x < 0 && y >= 0) { n node n1; n while (y >= 0 && s1[26] > 0) { n n1.x = cr1[26][s1[26] - 1]; n n1.y = cr2[i][y]; n nd.push_back(n1); n cnt++; n s1[26]--; n y--; n } n } n } n while (s1[26] > 0 && s2[26] > 0) { n node n1; n n1.x = cr1[26][s1[26] - 1]; n n1.y = cr2[26][s2[26] - 1]; n nd.push_back(n1); n cnt++; n s1[26]--; n s2[26]--; n } n cout << cnt << endl; n for (int i = 0; i < nd.size(); i++) n cout << nd[i].x + 1 << << nd[i].y + 1 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n void actionFun() { n long long n; n cin >> n; n long long c = 2; n for (int i = 0; i < n; i++) { n cout << c << ; n ++c; n } n cout << endl; n return; n } n int main() { n int t; n cin >> t; n while (t--) { n actionFun(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n while (~scanf( %d , &n)) { n int cnt = 0; n for (int i = 1; i < n; i++) { n for (int j = i + 1; j < n; j++) { n int sum = i * i + j * j; n if (sum <= n * n) { n if ((int)sqrt(sum) * (int)sqrt(sum) == sum) cnt++; n } n } n } n printf( %d n , cnt); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int k[1005], n, i, j; n long long kx[1005]; n int main() { n cin >> n; n for (i = 1; i <= n; i++) cin >> k[i]; n kx[1] = 2; n for (i = 2; i <= n; i++) { n if (k[i] == i) n kx[i] = 2; n else { n for (j = k[i]; j < i; j++) kx[i] = (kx[i] + kx[j]) % 1000000007; n kx[i] = (kx[i] + 2) % 1000000007; n } n } n long long ans = 0; n for (i = 1; i <= n; i++) ans = (ans + kx[i]) % 1000000007; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false), cin.tie(NULL); n long long n; n cin >> n; n vector a(n); n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n if (n == 1) { n cout << YES ; n return 0; n } n vector v; n long long cnt0 = 1; n for (int i = 1; i < n; i++) { n if (a[i] != a[i - 1]) { n v.push_back(cnt0); n cnt0 = 1; n } else n cnt0++; n if (i == n - 1) { n v.push_back(cnt0); n } n } n long long cnt = 1; n for (int i = 0; i < v.size(); i++) { n if (v[i] == v[i + 1]) cnt++; n } n if (cnt == v.size()) n cout << YES ; n else n cout << NO ; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma GCC push_options n #pragma GCC optimize( unroll-loops ) n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long int INF = 10e18; n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n long long a[n], b[n], c[n]; n for (long long i = 0; i < n; i++) { n cin >> a[i] >> b[i]; n } n for (long long i = 1; i <= n; i++) { n c[i % n] = max(0ll, a[i % n] - b[i - 1]); n } n long long sum = accumulate(c, c + n, 0ll); n long long res = INF; n for (long long i = 0; i < n; i++) { n res = min(res, sum + a[i] - c[i]); n } n cout << res << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int contrib[312345] = {0}; n bool in_set[312345] = {0}; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n, k; n cin >> n >> k; n vector ans; n int cnt = 0; n for (int i = 1; i <= n / 2; i++) { n if (cnt + contrib[i] <= k) { n ans.push_back(i); n in_set[i] = true; n cnt += contrib[i]; n for (int j = i + i; j <= n; j += i) contrib[j]++; n } else { n while (cnt + contrib[i] > k) { n cnt -= contrib[ans.back()]; n for (int j = ans.back() + ans.back(); j <= n; j += ans.back()) n contrib[j]--; n in_set[ans.back()] = false; n ans.pop_back(); n } n ans.push_back(i); n in_set[i] = true; n cnt += contrib[i]; n for (int j = i + i; j <= n; j += i) contrib[j]++; n } n if (cnt == k) break; n } n priority_queue > pq; n for (int i = n / 2 + 1; i <= n; i++) { n if (in_set[i]) continue; n pq.push(make_pair(contrib[i], i)); n } n while (!pq.empty()) { n while (!pq.empty() && cnt + pq.top().first > k) pq.pop(); n if (pq.empty()) break; n cnt += pq.top().first; n ans.push_back(pq.top().second); n pq.pop(); n } n if (cnt != k) { n cout << No << endl; n return 0; n } n cout << Yes << endl; n cout << ans.size() << endl; n for (int i = 0; i < ans.size(); i++) { n if (i) cout << ; n cout << ans[i]; n } n cout << endl; n } n "} +{"func_code_string": "#include n #pragma GCC optimize(2) n using namespace std; n void qread(int &x) { n int neg = 1; n x = 0; n char c = getchar(); n while (c < 0 || c > 9 ) { n if (c == - ) neg = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) x = 10 * x + c - 0 , c = getchar(); n x *= neg; n } n const int maxn = 200005; n char c[maxn]; n int n, m; n string s, t; n int main() { n scanf( %d%d , &n, &m); n scanf( %s , c); n s = c; n scanf( %s , c); n t = c; n bool ok = false; n for (int(i) = 0; (i) < n; i++) n if (s[i] == * ) ok = true; n if (!ok) { n puts(s == t ? YES : NO ); n return 0; n } n int pre = 0, suf = 0; n while (s[pre] != * && s[pre] == t[pre]) pre++; n while (s[n - suf - 1] != * && s[n - suf - 1] == t[m - suf - 1]) suf++; n if (s[pre] == * && s[n - suf - 1] == * && pre - 1 < m - suf) n puts( YES ); n else n puts( NO ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n if (n == 1) { n cout << -1 << endl; n return 0; n } n cout << n << << n + 1 << << n * (n + 1) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using int64 = long long; n using pii = pair; n using vchar = vector; n using vvchar = vector; n using vint = vector; n using vint64 = vector; n using vvint = vector; n using vbool = vector; n using vpii = vector; n template n T sqr(T x) { n return x * x; n } n template n T gcd(T a, T b) { n return b == 0 ? a : gcd(b, a % b); n } n pair solveD(vvint g, int k) { n enum { NOT_VISITED, STARTED, FINISHED }; n const int n = g.size(); n vint depth(n, -1); n depth[0] = 0; n vint parent(n, -1); n vint loopState(n, NOT_VISITED); n pair result; n result.first = 0; n std::function DFS = [&](int v) { n loopState[v] = STARTED; n const int previous = parent[v]; n if (result.first != 0) return; n int backVertex = -1; n int backDepth = -1; n for (auto to : g[v]) { n if (to == previous) continue; n if (loopState[to] == STARTED && depth[to] > backDepth) { n backVertex = to; n backDepth = depth[to]; n } n } n if (backVertex != -1) { n vint loop; n for (int u = v; u != backVertex; u = parent[u]) { n loop.push_back(u); n } n loop.push_back(backVertex); n reverse(std::begin(loop), std::end(loop)); n assert(depth[v] - depth[backVertex] + 1 == loop.size()); n const int loopLength = loop.size(); n if (loopLength > k) { n result.first = 1; n for (int i = 0; i < loop.size(); i += 2) { n result.second.push_back(loop[i]); n } n result.second.resize((k + 1) / 2); n } else { n result.first = 2; n result.second = loop; n } n return; n } n for (auto to : g[v]) { n if (loopState[to] == NOT_VISITED) { n parent[to] = v; n depth[to] = depth[v] + 1; n DFS(to); n if (result.first != 0) return; n } n } n loopState[v] = FINISHED; n }; n DFS(0); n if (result.first != 0) { n return result; n } n vint colors(n, -1); n std::function biColor = [&](int v, int color) { n colors[v] = color; n for (auto to : g[v]) { n if (colors[to] == -1) { n biColor(to, 1 - color); n } n } n }; n biColor(0, 0); n int colorCount[2] = {0}; n for (int i = 0; i < n; ++i) { n colorCount[colors[i]]++; n } n const int bestColor = colorCount[0] > colorCount[1] ? 0 : 1; n result.first = 1; n for (int i = 0; i < n; ++i) { n if (colors[i] == bestColor) { n result.second.push_back(i); n } n } n result.second.resize((k + 1) / 2); n return result; n } n int main() { n int T = 1; n std::ios::sync_with_stdio(false); n while (T--) { n int n; n cin >> n; n ; n int m; n cin >> m; n ; n int k; n cin >> k; n ; n vvint g(n); n while (m--) { n int u; n cin >> u; n ; n int v; n cin >> v; n ; n u--, v--; n g[u].push_back(v); n g[v].push_back(u); n } n auto result = solveD(g, k); n assert(result.first == 1 || result.first == 2); n cout << result.first << endl; n for (int& v : result.second) { n v++; n } n if (result.first == 2) { n cout << result.second.size() << endl; n } n std::copy(std::begin(result.second), std::end(result.second), n ostream_iterator(cout, )); n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[500000]; n int mina, maxa; n int n, k; n long long sum = 0; n bool check(int c) { n sum = 0; n for (int i = 0; i < n; i++) { n if (a[i] + c < mina) { n sum += mina - c - a[i]; n } else { n break; n } n } n if (sum > k) return false; n return true; n } n bool checkp(int c) { n sum = 0; n for (int i = 0; i < n; i++) { n if (a[i] - c > maxa) { n sum += a[i] - c - maxa; n } n } n if (sum > k) return false; n return true; n } n int main() { n scanf( %d %d , &n, &k); n long long sum = 0; n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n sum += a[i]; n } n if (sum % n == 0) { n mina = maxa = sum / n; n } else { n mina = sum / n; n maxa = sum / n + 1; n } n sort(a, a + n); n int ll = 0, rr = 1000000000; n while (ll != rr) { n int mid = (ll + rr) / 2; n if (check(mid)) { n rr = mid; n } else { n ll = mid + 1; n } n } n int lll = 0, rrr = 1000000000; n while (lll != rrr) { n int mid = (lll + rrr) / 2; n if (checkp(mid)) { n rrr = mid; n } else { n lll = mid + 1; n } n } n printf( %lld , (long long)lll + ll + maxa - mina); n scanf( %d , &n); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, s, f, i; n cin >> n >> m >> s >> f; n long long t; n map> h; n pair R; n for (i = 0; i < m; i++) { n cin >> t >> R.first >> R.second; n h[t] = R; n } n i = 1; n if (s < f) n while (s != f) { n if (h.find(i) == h.end()) { n cout << R ; n s++; n } else { n if ((h[i].first <= s && s <= h[i].second) || n (h[i].first <= s + 1 && s + 1 <= h[i].second)) { n cout << X ; n } else { n cout << R ; n s++; n } n } n i++; n } n else { n while (s != f) { n if (h.find(i) == h.end()) { n cout << L ; n s--; n } else { n if ((h[i].first <= s && s <= h[i].second) || n (h[i].first <= s - 1 && s - 1 <= h[i].second)) { n cout << X ; n } else { n cout << L ; n s--; n } n } n i++; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int d[n]; n int total = 0; n for (int i = 0; i < n; i++) { n cin >> d[i]; n total += d[i]; n } n int s, t; n cin >> s >> t; n if (s == t) { n cout << 0; n return 0; n } n if (s > t) swap(s, t); n int ans = 0; n for (int i = s; i < t; i++) { n ans += d[i - 1]; n } n cout << min(ans, total - ans); n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, Q; n double sy, l[200100], r[200100], sum[200100], zl, zr, x, y, ans; n struct Node { n double x, y; n } bj[2][200100], tmp, L, R; n inline bool lef(Node u, Node v, Node w) { n if (u.x == v.x) return w.x < u.x; n double t; n t = v.x - (v.x - u.x) * (v.y - w.y) / (v.y - u.y); n return w.x < t; n } n inline double ask(int u) { n double p, q; n if (bj[0][u].x == x) n p = x; n else { n p = x - (x - bj[0][u].x) * (y - sy) / y; n } n if (bj[1][u].x == x) n q = x; n else { n q = x - (x - bj[1][u].x) * (y - sy) / y; n } n return max((double)0, min(q, zr) - max(p, zl)); n } n int main() { n int i, j, p, q, mid, a, b; n cin >> sy >> zl >> zr >> n; n L.y = R.y = sy, L.x = zl, R.x = zr; n for (i = 1; i <= n; i++) { n scanf( %lf%lf , &l[i], &r[i]); n sum[i] = sum[i - 1] + r[i] - l[i]; n bj[0][i].y = 0, bj[0][i].x = l[i]; n bj[1][i].y = 0, bj[1][i].x = r[i]; n } n cin >> m; n for (i = 1; i <= m; i++) { n scanf( %lf%lf , &x, &y); n ans = 0; n tmp.x = x, tmp.y = y; n for (p = 1, q = n; p < q;) { n mid = ((p + q) >> 1); n if (lef(tmp, bj[0][mid], L)) n q = mid; n else n p = mid + 1; n } n a = p - 1; n for (p = 1, q = n; p < q;) { n mid = ((p + q) >> 1); n if (!lef(tmp, bj[1][mid], R)) n p = mid + 1; n else n q = mid; n } n b = p; n printf( %.10f n , ask(a) + ask(b) * (a != b) + n max((double)0, sum[b - 1] - sum[a]) * (y - sy) / y); n } n } n "} +{"func_code_string": "#include n using namespace std; n #pragma warning(disable : 4996) n const int MAX_N = 1000009; n const long long mod = 998244353; n long long modpow(long long a, long long b, long long m) { n long long p = 1, q = a; n for (int i = 0; i < 32; i++) { n if ((b / (1LL << i)) % 2 == 1) { n p *= q; n p %= m; n } n q *= q; n q %= m; n } n return p; n } n long long N, fact[MAX_N], factinv[MAX_N]; n void init() { n fact[0] = 1; n for (int i = 1; i <= 1000000; i++) fact[i] = (1LL * fact[i - 1] * i) % mod; n for (int i = 0; i <= 1000000; i++) factinv[i] = modpow(fact[i], mod - 2, mod); n } n long long ncr(long long n, long long r) { n if (r < 0 || n < r) return 0; n return (fact[n] * factinv[r] % mod) * factinv[n - r] % mod; n } n int main() { n cin >> N; n init(); n long long V1 = modpow(modpow(3, N, mod), N, mod) - n modpow((modpow(3, N, mod) - 3LL + mod), N, mod); n V1 += mod; n V1 *= 2LL; n V1 %= mod; n long long V2 = 0; n for (int i = 1; i <= N; i++) { n long long E1 = ncr(N, i); n long long E2 = modpow(3, N - i, mod); n long long E3 = (E2 + mod - 1) % mod; n E2 = modpow(E2, N, mod); n E3 = modpow(E3, N, mod); n if (i % 2 == 1) V2 += E1 * (E2 - E3 + mod); n if (i % 2 == 0) V2 -= E1 * (E2 - E3 + mod); n while (V2 < 0) V2 += mod * mod; n V2 %= mod; n } n V2 *= 3LL; n V2 %= mod; n cout << (V1 - V2 + mod) % mod << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double pi = 4 * atan((long double)1); n const long long mod = 1e9 + 7; n const long long inf = 922337203685477; n const long long nax = 1e5 + 5; n long long n, p, m; n long long d[nax], t[nax]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cin >> n >> p >> m; n for (long long i = 1; i <= n; i++) { n cin >> d[i] >> t[i]; n } n d[0] = 1; n d[n + 1] = m + 1; n long long cur = 0, ans = 0; n for (long long i = 1; i <= n + 1; i++) { n long long dif = 0; n if (cur > 0) { n dif = cur / p; n } n long long minus = d[i] - d[i - 1] - dif; n if (minus < 0) { n minus = 0; n } n ans += minus; n cur -= (d[i] - d[i - 1]) * p; n cur += t[i]; n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 10; n const int SIZ_TREE = 3e5 + 10; n int n, m; n struct Node { n int u, v; n Node(int U = 0, int V = 0) { n u = U, v = V; n if (u < v) swap(u, v); n } n bool operator<(const Node A) const { n if (u < A.u || (u == A.u && v < A.v)) return true; n return false; n } n }; n vector f[N], ans[2]; n vector edg; n map col; n bool v[N], opr[N], flag1, flag2, add[N]; n int cnt_p, cnt_opr; n void init() { n char s; n int x, y; n scanf( %d %d , &n, &m); n for (int i = 1; i <= m; i++) { n scanf( %d %d , &x, &y); n while ((s = getchar()) == ) n ; n f[y].push_back(x); n f[x].push_back(y); n edg.push_back(Node(x, y)); n col[Node(x, y)] = (s == R ? false : true); n } n } n bool dfs(int x) { n v[x] = true; n cnt_p++; n cnt_opr += opr[x]; n for (int i = 0; i < f[x].size(); i++) { n int y = f[x][i]; n if (v[y]) { n if ((col[Node(x, y)] ^ opr[x] ^ opr[y]) == true) return false; n } else { n opr[y] = col[Node(x, y)] ^ opr[x]; n if (!dfs(y)) return false; n } n } n return true; n } n void add_ans(int x, bool s1, int s2) { n if (add[x]) return; n opr[x] ^= s1; n add[x] = true; n if (opr[x]) ans[s2].push_back(x); n for (int i = 0; i < f[x].size(); i++) add_ans(f[x][i], s1, s2); n } n bool solve(int sign) { n memset(opr, 0, sizeof(opr)); n memset(v, 0, sizeof(v)); n memset(add, 0, sizeof(add)); n for (int i = 1; i <= n; i++) n if (!v[i]) { n cnt_opr = cnt_p = 0; n if (!dfs(i)) return false; n add_ans(i, (cnt_opr * 2 > cnt_p), sign); n } n return true; n } n void print(int s) { n printf( %d n , ans[s].size()); n for (int i = 0; i < ans[s].size(); i++) printf( %d , ans[s][i]); n printf( n ); n } n void work() { n flag1 = solve(0); n for (int i = 0; i < edg.size(); i++) col[edg[i]] = (!col[edg[i]]); n flag2 = solve(1); n if (!flag1 && !flag2) n printf( -1 n ); n else if (flag1 && !flag2) n print(0); n else if (!flag1 && flag2) n print(1); n else if (ans[0].size() < ans[1].size()) n print(0); n else n print(1); n } n int main() { n init(); n work(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1e6 + 3; n long long power(long long base, long long exp) { n long long ans = 1; n while (exp) { n if (exp & 1) ans = (ans * base) % MOD; n base = (base * base) % MOD; n exp >>= 1; n } n return ans; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n long long n, k; n cin >> n >> k; n if (n <= 63 && k > (1LL << n)) { n cout << 1 << << 1; n return 0; n } n long long v2 = 0; n int digits = __builtin_popcountll(k - 1); n v2 = k - 1 - digits; n long long ntmp = n % (MOD - 1); n if (ntmp < 0) ntmp += (MOD - 1); n long long ktmp = k % (MOD - 1); n if (ktmp < 0) ktmp += (MOD - 1); n long long v2tmp = v2 % (MOD - 1); n if (v2tmp < 0) v2tmp += (MOD - 1); n long long exponent = ntmp * (ktmp - 1) - v2tmp; n exponent %= (MOD - 1); n if (exponent < 0) exponent += MOD - 1; n long long denom = power(2, exponent); n long long numpart = 0; n if (k - 1 >= MOD) { n numpart = 0; n } else { n long long prod = 1; n long long ntmp2 = power(2, ntmp); n prod = power(2, v2tmp); n prod = power(prod, MOD - 2); n if (prod < 0) prod += MOD; n for (long long y = 1; y <= k - 1; y++) { n prod = (prod * (ntmp2 - y)) % MOD; n } n numpart = prod; n } n long long num = (denom - numpart) % MOD; n num %= MOD; n denom %= MOD; n if (num < 0) num += MOD; n if (denom < 0) denom += MOD; n cout << num << << denom; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ; n long long n, k, i; n cin >> n >> k; n vector > v; n long long a[n], b[n]; n long long x, y; n for (i = 0; i < n; i++) cin >> a[i]; n for (i = 0; i < n; i++) cin >> b[i]; n for (i = 0; i < n; i++) { n x = a[i] - b[i]; n v.push_back(make_pair(x, i)); n } n sort(v.begin(), v.end()); n i = 0; n y = 0; n while (i < n) { n if (i < k || v[i].first <= 0) n y = y + a[v[i].second]; n else if (i >= k && v[i].first > 0) n break; n ++i; n } n while (i < n) { n y = y + b[v[i].second]; n ++i; n } n cout << y; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long s, x; n cin >> s >> x; n long long ans = __builtin_popcountll(x); n ans = 1LL << ans; n if (s == x) ans -= 2; n for (int i = 0; i < 60; i++) { n if (x & (1LL << i)) s -= 1LL << i; n } n for (int i = 0; i < 60; i++) { n int j = i + 1; n if ((s & (1LL << j)) && !(x & (1LL << i))) s -= 1LL << j; n } n if (s != 0) n puts( 0 ); n else n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, tmp; n bool ok = 1; n int ar[5]; n memset(ar, 0, sizeof(ar)); n scanf( %d , &n); n for (int i = 0; i < n; ++i) { n scanf( %d , &tmp); n tmp /= 25; n if (!ok) continue; n if (tmp == 1) { n ar[1]++; n } else if (tmp == 2) { n if (ar[1] > 0) { n ar[1]--; n ar[2]++; n } else n ok = 0; n } else if (tmp == 4) { n if (ar[1] > 0 && ar[2] > 0) { n ar[1]--; n ar[2]--; n ar[4]++; n } else if (ar[1] > 2) { n ar[1] -= 3; n ar[4]++; n } else n ok = 0; n } n } n if (ok) n cout << YES << endl; n else n cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Que { n int a, b, w; n } Q[300010]; n bool operator<(Que a, Que b) { return a.b < b.b; } n int n, i, m, Lim, j; n long long ans[301000], w[301000], s[301000]; n int main() { n scanf( %d , &n); n for (i = 0; i < n; i++) scanf( %I64d , &w[i]); n scanf( %d , &m); n for (i = 0; i < m; i++) scanf( %d%d , &Q[i].a, &Q[i].b), Q[i].a--, Q[i].w = i; n sort(Q, Q + m); n Lim = (int)sqrt(n); n for (i = 0; i < m; i++) { n if (Q[i].b > Lim) { n long long tmp = 0; n for (j = Q[i].a; j < n; j += Q[i].b) tmp += w[j]; n ans[Q[i].w] = tmp; n } else { n memset(s, 0, sizeof(s)); n for (j = n - 1; j >= 0; j--) s[j] = w[j] + s[j + Q[i].b]; n j = i; n do { n ans[Q[j].w] = s[Q[j].a]; n j++; n } while (Q[j].b == Q[j - 1].b); n i = j - 1; n } n } n for (i = 0; i < m; i++) printf( %I64d n , ans[i]); n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 1000000 + 5; n const long long DIFF = 2000; n const long long mod = 1000000000 + 7; n long long dp[DIFF + 5][DIFF + 5]; n char s[maxn]; n int main() { n dp[0][0] = 1; n for (int i = 1; i <= DIFF; dp[i][0] = dp[i - 1][1], i++) n for (int j = 1; j <= i; j++) n dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j + 1]) % mod; n long long n, m; n scanf( %I64d%I64d%s , &n, &m, s); n long long len = strlen(s), diff = 0, Min = 0, ans = 0; n for (long long i = 0; i < len; i++) { n diff += (s[i] == ( ? 1 : -1); n Min = min(Min, diff); n } n for (long long i = 0; i <= n - m; i++) n for (long long j = 0; j <= i; j++) n if (j + Min >= 0 && j + diff >= 0 && j + diff <= n - m) n ans = (ans + (dp[i][j] * dp[n - m - i][j + diff]) % mod) % mod; n printf( %I64d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int x, y, a, b, i, c = 0, j = 0; n cin >> x >> y; n a = 240 - y; n for (i = 1; c <= a; i++) { n c = c + (5 * i); n j++; n } n if (j - 1 <= x) { n cout << j - 1 << endl; n } else { n cout << x << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long mx = (1 << 22); n long long f[mx], ans[mx]; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long n; n cin >> n; n long long a[n]; n for (long long i = 0; i < n; i++) cin >> a[i]; n memset(ans, -1, sizeof(ans)); n for (long long i = 0; i < n; i++) { n f[a[i]]++; n ans[a[i]] = a[i]; n } n for (long long j = 0; j < 22; j++) n for (long long i = 0; i < mx; i++) n if (i & (1 << j)) { n f[i] += f[i ^ (1 << j)]; n if (f[i ^ (1 << j)]) ans[i] = ans[i ^ (1 << j)]; n } n for (long long i = 0; i < n; i++) { n long long p = (mx - 1) & (~a[i]); n cout << ans[p] << ; n } n cout << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n struct node { n int x, y, c; n } s[2005], tmp[2005]; n int n, k, l, cx, cy; n int lx[2005], ly[2005], bk[2005]; n multiset t[2005]; n namespace Tree { n int mn[8005], mx[8005], sum[8005], lzy[8005]; n inline void pushtag(int p, int l, int r, int val) { n mx[p] = mn[p] = lzy[p] = val; n sum[p] = 1ll * (ly[r + 1] - ly[l]) * val % mod; n } n inline void down(int p, int l, int mid, int r) { n pushtag(p << 1, l, mid, lzy[p]); n pushtag(p << 1 | 1, mid + 1, r, lzy[p]); n lzy[p] = -1; n } n void insert(int p, int id, int val, int l, int r) { n if (l == r) n return mx[p] = mn[p] = val, n sum[p] = 1ll * (ly[id + 1] - ly[id]) * val % mod, void(); n const int mid = l + r >> 1; n if (id <= mid) n insert(p << 1, id, val, l, mid); n else n insert(p << 1 | 1, id, val, mid + 1, r); n mn[p] = min(mn[p << 1], mn[p << 1 | 1]); n mx[p] = max(mx[p << 1], mx[p << 1 | 1]); n sum[p] = (sum[p << 1] + sum[p << 1 | 1]) % mod; n } n void qmin(int p, int val, int l, int r, int L, int R) { n if (L >= l && R <= r) { n if (mx[p] <= val) n return; n else if (mn[p] >= val) n pushtag(p, L, R, val); n else { n const int mid = L + R >> 1; n if (~lzy[p]) down(p, L, mid, R); n qmin(p << 1, val, l, r, L, mid); n qmin(p << 1 | 1, val, l, r, mid + 1, R); n mn[p] = min(mn[p << 1], mn[p << 1 | 1]); n mx[p] = max(mx[p << 1], mx[p << 1 | 1]); n sum[p] = (sum[p << 1] + sum[p << 1 | 1]) % mod; n } n return; n } n const int mid = L + R >> 1; n if (~lzy[p]) down(p, L, mid, R); n if (l <= mid) qmin(p << 1, val, l, r, L, mid); n if (r > mid) qmin(p << 1 | 1, val, l, r, mid + 1, R); n mn[p] = min(mn[p << 1], mn[p << 1 | 1]); n mx[p] = max(mx[p << 1], mx[p << 1 | 1]); n sum[p] = (sum[p << 1] + sum[p << 1 | 1]) % mod; n } n } // namespace Tree n int main() { n scanf( %d%d%d , &n, &k, &l); n lx[++cx] = 0; n ly[++cy] = 0; n lx[++cx] = l + 1; n ly[++cy] = l + 1; n int ans = 0; n for (int i = 1; i <= n; ++i) n scanf( %d%d%d , &s[i].x, &s[i].y, &s[i].c), lx[++cx] = ++s[i].x, n ly[++cy] = ++s[i].y; n sort(lx + 1, lx + cx + 1); n cx = unique(lx + 1, lx + cx + 1) - lx - 1; n sort(ly + 1, ly + cy + 1); n cy = unique(ly + 1, ly + cy + 1) - ly - 1; n for (int i = 1; i <= n; ++i) n s[i].x = lower_bound(lx + 1, lx + cx + 1, s[i].x) - lx, n s[i].y = lower_bound(ly + 1, ly + cy + 1, s[i].y) - ly, tmp[i] = s[i]; n sort(s + 1, s + n + 1, n [](const node &a, const node &b) { return a.x < b.x; }); n sort(tmp + 1, tmp + n + 1, n [](const node &a, const node &b) { return a.y < b.y; }); n for (int u = 1; u < cx; ++u) { n memset(bk, 0, sizeof(bk)); n memset(Tree::lzy, -1, sizeof(Tree::lzy)); n for (int i = 1, j = 1, p = 1, cnt = 0; i < cy; ++i) { n while (j <= n && tmp[j].y <= i) { n if (tmp[j].x <= u) n ++j; n else { n if (!bk[tmp[j].c]) ++cnt; n ++bk[tmp[j++].c]; n } n } n while (cnt == k) { n if (tmp[p].x <= u) n ++p; n else { n --bk[tmp[p].c]; n if (!bk[tmp[p++].c]) --cnt; n } n } n Tree::insert(1, i, ly[tmp[p - 1].y], 1, cy - 1); n } n for (int i = 1; i <= k; ++i) t[i].clear(); n for (int i = 1; i <= n; ++i) n if (s[i].x > u) t[s[i].c].insert(s[i].y); n for (int d = cx - 1, i = n; d > u; --d) { n (ans += 1ll * (lx[d + 1] - lx[d]) * (lx[u + 1] - lx[u]) % mod * n Tree::sum[1] % mod) %= mod; n while (i && s[i].x >= d) { n auto it = t[s[i].c].find(s[i].y); n int pre = it == t[s[i].c].begin() ? 0 : *prev(it); n int nxt = next(it) == t[s[i].c].end() ? cy : *next(it); n t[s[i].c].erase(it); n if (s[i].y < nxt) Tree::qmin(1, ly[pre], s[i].y, nxt - 1, 1, cy - 1); n --i; n } n } n } n return printf( %d n , ans), 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void upd1(T1& a, const T2& b) { n a = a < b ? a : b; n } n template n inline void upd2(T1& a, const T2& b) { n a = a > b ? a : b; n } n template n inline bool equ(const T& a, const T& b) { n return !memcmp(&a, &b, sizeof a); n } n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n struct ano { n operator long long() { n long long x = 0, y = 0, c = getchar(); n while (c < 48) y = c == 45, c = getchar(); n while (c > 47) x = x * 10 + c - 48, c = getchar(); n return y ? -x : x; n } n } buf; n const int p = 1e9 + 7; n const int N = 1e6 + 5; n int w[N], a[N], l[N], r[N]; n long long cal(long long a, long long n, long long d) { n return (a * n + n * (n - 1) / 2 % p * d) % p; n } n int main() { n int n = buf, m = buf; n for (int i = 1; i <= n; ++i) w[i] = buf; n w[n + 1] = 1 << 30; n int j = 0; n for (int i = 1; i <= n + 1; ++i) { n while (j > 0 && w[a[j]] <= w[i]) r[a[j--]] = i - 1; n l[i] = a[j] + 1; n a[++j] = i; n } n long long ans = 0; n for (int i = 1; i <= n; ++i) { n int a = i - l[i] + 1; n int b = r[i] - i + 1; n int c = (min(a, b) - 1) / (m - 1); n long long s = cal(m, c, m - 1); n int v = (c + 1) * (m - 1) + 1; n if (max(a, b) >= v) { n long long d = (max(a, b) - v) / (m - 1); n s += ((d + 1) * min(a, b)) % p; n v += (d + 1) * (m - 1); n } n v = a + b - v; n if (v >= 1) s += cal(v, (v - 1) / (m - 1) + 1, 1 + p - m); n ans += w[i] * s % p; n } n cout << ans % p << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 105, maxm = 5005; n const double eps = 1e-9; n int N, M, m, X[maxm], Y[maxm], Z[maxm]; n double f[maxn][maxn], p[maxn]; n int main() { n scanf( %d%d , &N, &M); n for (int i = 1; i <= M; i++) { n scanf( %d%d%d , &X[i], &Y[i], &Z[i]); n if (X[i] > 1 && X[i] < N) f[X[i]][X[i]]++, f[X[i]][Y[i]]--; n if (Y[i] > 1 && Y[i] < N) f[Y[i]][Y[i]]++, f[Y[i]][X[i]]--; n } n f[1][N + 1] = 1, f[1][1] = 1; n f[N][N + 1] = 0, f[N][N] = 1; n for (int i = 1; i <= N; i++) { n if (abs(f[i][i]) < eps) n for (int j = i + 1; j <= N; j++) n if (abs(f[j][i]) > eps) { n for (int k = i; k <= N + 1; k++) f[i][k] += f[j][k]; n break; n } n for (int j = i + 1; j <= N; j++) n if (abs(f[j][i]) > eps) { n double r(f[j][i] / f[i][i]); n for (int k = i; k <= N + 1; k++) f[j][k] -= f[i][k] * r; n } n } n for (int i = N; i; i--) n if (abs(f[i][i]) > eps) { n p[i] = f[i][N + 1]; n for (int j = i + 1; j <= N; j++) p[i] -= f[i][j] * p[j]; n p[i] /= f[i][i]; n } n double rate(1.0 / 0), ans(0); n for (int i = 1; i <= M; i++) rate = min(rate, Z[i] / abs(p[X[i]] - p[Y[i]])); n for (int i = 1; i <= M; i++) { n if (X[i] == 1) ans += p[1] - p[Y[i]]; n if (Y[i] == 1) ans += p[1] - p[X[i]]; n } n printf( %.7f n , isfinite(rate) ? ans * rate : 0); n for (int i = 1; i <= M; i++) n printf( %.7f n , isfinite(rate) ? (p[X[i]] - p[Y[i]]) * rate : 0); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int a1[4] = {1, -1, 0, 0}, a2[4] = {0, 0, 1, -1}; n struct ww { n int a, b; n } g[1610 * 1610], h[1610 * 1610]; n int i, j, k, n, m, s, l, r; n int a[1610][1610], f[1610][1610], d[1610][1610], F[1610][1610], n ans[1610 * 1610]; n inline void bfs(int x, int y) { n int i; n g[l = r = 1].a = x, g[1].b = y; n f[x][y] = 1; n for (; l <= r; l++) { n int X = g[l].a, Y = g[l].b; n for (i = 0; i <= 3; i++) { n int A = X + a1[i], B = Y + a2[i]; n if (a[A][B] && !f[A][B]) { n f[A][B] = 1; n g[++r].a = A, g[r].b = B; n } n } n } n } n inline int cal(int x, int y) { n int l, r, i; n h[l = r = 1].a = x, h[1].b = y, d[x][y] = 0, F[x][y] = 1; n for (; l <= r; l++) { n int X = h[l].a, Y = h[l].b; n if (d[X][Y] == d[h[r].a][h[r].b] && l < r - 5) break; n for (i = 0; i <= 3; i++) { n int A = X + a1[i], B = Y + a2[i]; n if (a[A][B] && !F[A][B]) { n F[A][B] = 1; n h[++r].a = A, h[r].b = B; n d[A][B] = d[X][Y] + 1; n } n } n } n int D = d[h[r].a][h[r].b]; n if (D <= 10) n for (i = 1; i <= r; i++) F[h[i].a][h[i].b] = 0; n return D > 10; n } n int main() { n scanf( %d%d , &n, &m); n for (i = 1; i <= n; i++) n for (j = 1; j <= m; j++) scanf( %d , &a[i][j]); n for (i = 1; i <= n; i++) n for (j = 1; j <= m; j++) n if (a[i][j] && !f[i][j]) { n bfs(i, j); n s = cal(i, j); n for (k = r; k > 1; k--) { n int A = g[k].a, B = g[k].b; n if (!F[A][B]) s += cal(A, B); n } n ans[++*ans] = s; n } n sort(ans + 1, ans + *ans + 1); n printf( %d n , *ans); n for (i = 1; i <= *ans; i++) printf( %d , ans[i]); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n; n scanf( %d , &n); n int i = 1; n while ((i * (i + 1) / 2) <= n) { n if ((i * (i + 1) / 2) == n) { n printf( YES ); n return 0; n } n i++; n } n printf( NO ); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 123, inf = 1e9 + 123, mod = 1e9 + 7; n const long long INF = 1e18; n int n, a[N]; n int main() { n cin.tie(0); n cout.tie(0); n ios_base::sync_with_stdio(0); n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n } n sort(a + 1, a + n + 1); n reverse(a + 1, a + n + 1); n int mn = inf; n for (int i = 1; i <= n; i++) { n if (a[i] + 1 < mn) { n a[i]++; n mn = a[i]; n } else { n if (a[i] < mn) { n mn = a[i]; n } else if (a[i] - 1 < mn && a[i] > 1) { n mn = a[i] - 1; n a[i]--; n } n } n } n set st; n for (int i = 1; i <= n; i++) { n st.insert(a[i]); n } n cout << st.size(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void rd(T &x) { n x = 0; n int f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) n x = (x << 3) + (x << 1) + ch - 0 , ch = getchar(); n x *= f; n } n const int maxn = 1e5 + 5; n int n, m; n int ans[maxn]; n struct node { n int x, op, id; n bool operator<(const node &b) const { return x == b.x ? id < b.id : x < b.x; } n } p[maxn]; n struct segment_tree { n int op[maxn << 2], tag[maxn << 2]; n void pushdown(int u) { n if (tag[u]) { n op[u << 1] = op[u << 1 | 1] = 1; n tag[u << 1] = tag[u << 1 | 1] = tag[u]; n tag[u] = 0; n } n if (op[u] == -1) { n op[u << 1] *= -1; n op[u << 1 | 1] *= -1; n op[u] = 1; n } n } n void build(int u, int l, int r) { n op[u] = 1; n if (l == r) return (void)(op[u] = p[l].op); n int mid = l + r >> 1; n build(u << 1, l, mid); n build(u << 1 | 1, mid + 1, r); n } n void cover(int u, int l, int r, int ql, int qr, int v) { n if (ql <= l && r <= qr) return (void)(op[u] = 1, tag[u] = v); n int mid = l + r >> 1; n pushdown(u); n if (ql <= mid) cover(u << 1, l, mid, ql, qr, v); n if (qr > mid) cover(u << 1 | 1, mid + 1, r, ql, qr, v); n } n void change(int u, int l, int r, int ql, int qr) { n if (ql <= l && r <= qr) return (void)(op[u] *= -1); n int mid = l + r >> 1; n pushdown(u); n if (ql <= mid) change(u << 1, l, mid, ql, qr); n if (qr > mid) change(u << 1 | 1, mid + 1, r, ql, qr); n } n void query(int u, int l, int r) { n if (l == r) { n int res = tag[u] ? tag[u] * op[u] : op[u]; n ans[p[l].id] = res * p[l].x; n return; n } n int mid = l + r >> 1; n pushdown(u); n query(u << 1, l, mid); n query(u << 1 | 1, mid + 1, r); n } n } seg; n int main() { n rd(n), rd(m); n for (int i = (1); i <= (n); ++i) { n int x; n rd(x); n p[i] = (node){abs(x), x > 0 ? 1 : -1, i}; n } n sort(p + 1, p + n + 1); n seg.build(1, 1, n); n while (m--) { n char s[5]; n int x; n scanf( %s , s); n rd(x); n if (s[0] == < ) { n if (x < 0) { n int pos = (lower_bound(p + 1, p + n + 1, (node){abs(x) + 1, 0, 0}) - p); n if (pos <= n) seg.cover(1, 1, n, pos, n, 1); n } else { n int pos = (lower_bound(p + 1, p + n + 1, (node){abs(x), 0, 0}) - p); n if (pos <= n) seg.cover(1, 1, n, pos, n, 1); n if (pos > 1) seg.change(1, 1, n, 1, pos - 1); n } n } else { n if (x > 0) { n int pos = (lower_bound(p + 1, p + n + 1, (node){abs(x) + 1, 0, 0}) - p); n if (pos <= n) seg.cover(1, 1, n, pos, n, -1); n } else { n int pos = (lower_bound(p + 1, p + n + 1, (node){abs(x), 0, 0}) - p); n if (pos <= n) seg.cover(1, 1, n, pos, n, -1); n if (pos > 1) seg.change(1, 1, n, 1, pos - 1); n } n } n } n seg.query(1, 1, n); n for (int i = (1); i <= (n); ++i) printf( %d , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int pic[610][610]; n int ABS(int x) { n if (x < 0) return -x; n return x; n } n int main(int argc, char const *argv[]) { n int q; n scanf( %d , &q); n for (int i = 0; i < q; i++) { n int n, m, pix = 0, sum1 = 0, sum2 = 0; n scanf( %d%d , &n, &m); n for (int k = 0; k < n; k++) n for (int j = 0; j < m; j++) { n scanf( %d , &pic[k][j]); n } n int dif = 0; n for (int j = 0; j < m; j++) n dif = dif + ABS(pic[n / 2][j] - pic[n / 2 - 1][j]); n if (dif < 6000) n printf( NO n ); n else n printf( YES n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 4e5 + 50; n int n, m, a[N], b[N]; n vector G[N]; n int in[N], out[N], tim, dep[N]; n int mn[20][N], lg[N], p[N], k; n void dfs(int u, int f) { n dep[u] = dep[f] + 1; n in[u] = ++tim; n mn[0][p[u] = ++k] = u; n for (int v : G[u]) n if (v != f) dfs(v, u), mn[0][++k] = u; n out[u] = tim; n } n int chk(int x, int y) { return dep[x] < dep[y] ? x : y; } n int LCA(int x, int y) { n x = p[x], y = p[y]; n if (x > y) swap(x, y); n int z = lg[y - x + 1]; n return chk(mn[z][x], mn[z][y - (1 << z) + 1]); n } n int D(int x, int y) { return dep[x] + dep[y] - 2 * dep[LCA(x, y)]; } n struct lll { n int x, y, o; n lll(int _x = 0, int _y = 0, int _o = 0) { x = _x, y = _y, o = _o; } n friend lll operator+(const lll &a, const lll &b) { n if (!a.o) return a; n if (!b.o) return b; n if (!a.x) return b; n if (!b.x) return a; n lll t = b; n int A = D(a.x, t.x), B = D(a.x, t.y), C = D(t.x, t.y); n if (A + B == C) n t = lll(t.x, t.y, 1); n else if (B + C == A) n t = lll(a.x, t.x, 1); n else if (A + C == B) n t = lll(a.x, t.y, 1); n else n return lll(0, 0, 0); n A = D(a.y, t.x), B = D(a.y, t.y), C = D(t.x, t.y); n if (A + B == C) n t = lll(t.x, t.y, 1); n else if (B + C == A) n t = lll(a.y, t.x, 1); n else if (A + C == B) n t = lll(a.y, t.y, 1); n else n return lll(0, 0, 0); n return t; n } n }; n namespace SGT { n const int N = ::N << 2; n lll t[N]; n void up(int x) { t[x] = t[x << 1] + t[x << 1 | 1]; } n void build(int x, int l, int r) { n if (l == r) return t[x] = lll(b[l], b[l], 1), void(); n build(x << 1, l, ((l + r) >> 1)), build(x << 1 | 1, ((l + r) >> 1) + 1, r); n up(x); n } n void mdf(int x, int l, int r, int p, int v) { n if (l == r) return t[x] = lll(v, v, 1), void(); n if (p <= ((l + r) >> 1)) n mdf(x << 1, l, ((l + r) >> 1), p, v); n else n mdf(x << 1 | 1, ((l + r) >> 1) + 1, r, p, v); n up(x); n } n int ask(int x, int l, int r, lll z) { n if (l == r) { n lll y = z + t[x]; n if (y.o) return l + 1; n return l; n } n lll y = z + t[x << 1]; n if (!y.o) return ask(x << 1, l, ((l + r) >> 1), z); n return ask(x << 1 | 1, ((l + r) >> 1) + 1, r, y); n } n } // namespace SGT n int main() { n cin >> n; n for (int i = 1; i <= n; i++) scanf( %d , &a[i]), b[a[i]] = i; n for (int i = 2, x; i <= n; i++) scanf( %d , &x), G[x].push_back(i); n dfs(1, 0); n for (int i = 2; i <= k; i++) lg[i] = lg[i >> 1] + 1; n for (int i = 1; (1 << i) <= k; i++) n for (int j = 1; j + (1 << i) - 1 <= k; j++) n mn[i][j] = chk(mn[i - 1][j], mn[i - 1][j + (1 << i - 1)]); n SGT ::build(1, 0, n - 1); n cin >> m; n while (m--) { n int o, x, y; n scanf( %d , &o); n if (o == 1) { n scanf( %d%d , &x, &y); n swap(a[x], a[y]); n x = a[x], y = a[y]; n swap(b[x], b[y]); n SGT ::mdf(1, 0, n - 1, x, b[x]); n SGT ::mdf(1, 0, n - 1, y, b[y]); n } n if (o == 2) cout << SGT ::ask(1, 0, n - 1, lll(0, 0, 1)) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, k; n cin >> n >> k; n char def = a ; n int pos = 0; n string ans = ; n for (int i = 0; i < n; i++) { n ans += def + pos; n pos = (pos + 1) % k; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mod = 1000000007LL; n long long base = 10000007; n long long large = 1000000000000000000LL; n class UnionFind { n private: n vector p, rank; n n public: n UnionFind(int n) { n rank.assign(n, 0); n p.assign(n, 0); n for (int i = 0; i < n; i++) { n p[i] = i; n } n } n int findSet(int i) { return (p[i] == i) ? i : (p[i] = findSet(p[i])); } n bool isSameSet(int i, int j) { return findSet(i) == findSet(j); } n void unionSet(int i, int j) { n if (!isSameSet(i, j)) { n int x = findSet(i), y = findSet(j); n if (rank[x] > rank[y]) { n p[y] = x; n } else { n p[x] = y; n if (rank[x] == rank[y]) { n rank[y]++; n } n } n } n } n }; n vector > > adj; n int n, m; n vector, int> > e; n vector dp; n void dfs(int u, int pa, int val) { n dp[u] = val; n for (int j = 0; j < (int)adj[u].size(); j++) { n int v = adj[u][j].first; n int d = adj[u][j].second; n if (v != pa) { n dfs(v, u, val ^ d); n } n } n } n int main() { n cin >> n >> m; n UnionFind uf(n); n adj.assign(n, vector >()); n for (int i = 0; i < m; i++) { n int x, y, z; n scanf( %d%d%d , &x, &y, &z); n x--; n y--; n if (uf.isSameSet(x, y)) { n e.push_back(pair, int>(pair(x, y), z)); n } else { n uf.unionSet(x, y); n adj[x].push_back(pair(y, z)); n adj[y].push_back(pair(x, z)); n } n } n dp.assign(n, 0); n dfs(0, -1, 0); n vector mask; n for (int i = 0; i < (int)e.size(); i++) { n int x = e[i].first.first; n int y = e[i].first.second; n int z = e[i].second; n int lo = dp[x] ^ dp[y] ^ z; n mask.push_back(lo); n } n int cur = 0; n for (int l = 30; l >= 0; l--) { n int c = -1; n for (int i = cur; i < (int)mask.size(); i++) { n if (mask[i] & (1 << l)) { n c = i; n break; n } n } n if (c == -1) continue; n swap(mask[cur], mask[c]); n for (int i = cur + 1; i < (int)mask.size(); i++) { n if (mask[i] & (1 << l)) mask[i] ^= mask[cur]; n } n cur++; n } n vector basis; n for (int i = 0; i < cur; i++) { n basis.push_back(mask[i]); n } n int l = 30; n int dis = dp[n - 1]; n for (int i = 0; i < (int)basis.size(); i++) { n while (((1 << l) & basis[i]) == 0) l--; n if ((1 << l) & dis) dis ^= basis[i]; n } n cout << dis << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int input[100000]; n int output[100000]; n pair, int> queries[100000]; n int blockSize; n bool mo_compare(pair, int>& x, pair, int>& y) { n int firstBlockIndex = x.first.first / blockSize; n int secondBlockIndex = y.first.first / blockSize; n if (firstBlockIndex == secondBlockIndex) { n return x.first.second < y.first.second; n } n return firstBlockIndex < secondBlockIndex; n } n void inline removeElement(unordered_map& lookup, int val, n int& result) { n unordered_map::iterator itr = lookup.find(val); n if (itr != lookup.end()) { n if (itr->first == itr->second) { n result--; n } n itr->second--; n if (itr->first == itr->second) { n result++; n } n } else { n lookup[val]--; n } n } n void inline addElement(unordered_map& lookup, int val, int& result) { n unordered_map::iterator itr = lookup.find(val); n if (itr != lookup.end()) { n if (itr->first == itr->second) { n result--; n } n itr->second++; n if (itr->first == itr->second) { n result++; n } n } else { n lookup[val]++; n if (val == 1) { n result++; n } n } n } n int main() { n cin.tie(NULL); n int n, m; n cin >> n >> m; n blockSize = static_cast(sqrt(n)); n for (int i = 0; i < n; i++) { n cin >> input[i]; n } n for (int i = 0; i < m; i++) { n pair, int>& query = queries[i]; n cin >> query.first.first >> query.first.second; n query.first.first--; n query.first.second--; n query.second = i; n } n sort(queries, queries + m, mo_compare); n unordered_map lookup; n int result = 0; n int prev_l = 0, prev_r = -1, left, right, index; n unordered_map::iterator itr; n for (int i = 0; i < m; i++) { n left = queries[i].first.first; n right = queries[i].first.second; n index = queries[i].second; n while (left > prev_l) { n removeElement(lookup, input[prev_l], result); n prev_l++; n } n while (left < prev_l) { n prev_l--; n addElement(lookup, input[prev_l], result); n } n while (right < prev_r) { n removeElement(lookup, input[prev_r], result); n prev_r--; n } n while (right > prev_r) { n prev_r++; n addElement(lookup, input[prev_r], result); n } n output[index] = result; n } n for (int i = 0; i < m; i++) { n cout << output[i] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N, M, K; n char a[1001], b[1001]; n int mem[1001][1001][11][2]; n int main() { n scanf( %d %d %d , &N, &M, &K); n scanf( %s %s , a, b); n memset(mem, 0, sizeof(mem)); n int ans = 0; n for (int i = 1; i <= N; i++) { n for (int j = 1; j <= M; j++) { n for (int k = 1; k <= K; k++) { n if (a[i - 1] == b[j - 1]) { n mem[i][j][k][1] = n max(mem[i - 1][j - 1][k][1] + 1, mem[i - 1][j - 1][k - 1][0] + 1); n mem[i][j][k][0] = n max(mem[i][j][k][1], n max(max(mem[i - 1][j][k][1], mem[i - 1][j][k][0]), n max(mem[i][j - 1][k][1], mem[i][j - 1][k][0]))); n } else { n mem[i][j][k][1] = 0; n mem[i][j][k][0] = max(max(mem[i - 1][j][k][1], mem[i - 1][j][k][0]), n max(mem[i][j - 1][k][1], mem[i][j - 1][k][0])); n } n if (k == K) { n ans = max(ans, max(mem[i][j][k][0], mem[i][j][k][1])); n } n } n } n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long k, n, m; n int answ = 1; n bool flag = 0; n int main() { n cin >> n >> m; n k = 2; n for (int i = 2; i <= m; i++) k = (k * 2) % 1000000009; n if (k > n) { n for (int i = 1; i <= n; i++) answ = (answ * (k - i)) % 1000000009; n cout << answ; n } else n cout << 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double pi = acos(-1.0); n long long int path[100001]; n long long int dist[100001]; n void shortest_path(vector> v[], n long long int start) { n long long int i; n for (i = 0; i < 100001; i++) dist[i] = 1e18 + 1; n priority_queue q; n q.push(start); n dist[start] = 0; n while (!q.empty()) { n long long int x = q.top(); n q.pop(); n for (i = 0; i < v[x].size(); i++) { n if (dist[v[x][i].first] > dist[x] + v[x][i].second) { n dist[v[x][i].first] = dist[x] + v[x][i].second; n path[v[x][i].first] = x; n q.push(v[x][i].first); n } n } n } n } n void solve() { n long long int ver, edge, i, x, y, w, start = 1; n cin >> ver >> edge; n vector> v[ver + 1]; n vector ans; n for (i = 0; i < edge; i++) { n cin >> x >> y >> w; n v[x].push_back(make_pair(y, w)); n v[y].push_back(make_pair(x, w)); n } n shortest_path(v, start); n if (dist[ver] == 1e18 + 1) n cout << -1 n << n ; n else { n cout << 1 ; n while (ver != 1) { n ans.push_back(ver); n ver = path[ver]; n } n for (i = ans.size() - 1; i >= 0; i--) { n cout << ans[i] << ; n } n cout << n ; n } n } n void fast() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n } n int main() { n fast(); n int t = 1; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = int64_t; n template n ostream& operator<<(ostream& _s, pair _t) { n _s << ( << _t.first << , << _t.second << ) ; n return _s; n } n template n istream& operator>>(istream& _s, pair& _t) { n _s >> _t.first >> _t.second; n return _s; n } n template n ostream& operator<<(ostream& _s, vector _t) { n for (int i = 0; i < (int)(_t.size()); i++) _s << (i ? : ) << _t[i]; n return _s; n } n template n istream& operator>>(istream& _s, vector& _t) { n for (int i = 0; i < (int)(_t.size()); i++) _s >> _t[i]; n return _s; n } n vector val, comp, z, cont; n int Time, ncomps; n template n int dfs(int j, G& g, F f) { n int low = val[j] = ++Time, x; n z.push_back(j); n for (auto& e : g[j]) n if (comp[e] < 0) low = min(low, val[e] ?: dfs(e, g, f)); n if (low == val[j]) { n do { n x = z.back(); n z.pop_back(); n comp[x] = ncomps; n cont.push_back(x); n } while (x != j); n f(cont); n cont.clear(); n ncomps++; n } n return val[j] = low; n } n template n void scc(G& g, F f) { n int n = g.size(); n val.assign(n, 0); n comp.assign(n, -1); n Time = ncomps = 0; n for (int i = 0; i < (int)(n); i++) n if (comp[i] < 0) dfs(i, g, f); n } n void tassert(bool cond) { n if (!cond) { n while (1 < 2) { n } n } n } n void answer(int x) { n cout << ! << (x + 1) << endl; n cout << flush; n exit(0); n } n bool ask(int a, int b) { n cout << ? << (a + 1) << << (b + 1) << endl; n cout << flush; n int res; n cin >> res; n if (res == -1) { n exit(123); n } n return bool(res); n } n int main() { n int n, m; n cin >> n >> m; n vector> g(n); n for (int i = 0; i < (int)(m); i++) { n int x, y; n cin >> x >> y; n g[x - 1].push_back(y - 1); n } n vector> comps; n scc(g, [&](vector& v) { comps.push_back(v); }); n vector> cg(ncomps); n for (int a = 0; a < (int)(n); a++) { n for (int b : g[a]) { n if (comp[a] != comp[b]) { n cg[comp[a]].insert(comp[b]); n } n } n } n vector indeg(ncomps, 0); n for (int aa = 0; aa < (int)(ncomps); aa++) { n for (int bb : cg[aa]) { n indeg[bb]++; n } n } n unordered_set heads; n for (int aa = 0; aa < (int)(ncomps); aa++) { n if (indeg[aa] == 0) { n heads.insert(aa); n } n } n int head = *heads.begin(); n int cap = comps[head].back(); n comps[head].pop_back(); n auto update = [&](int aa) { n if (comps[aa].size() == 0) { n heads.erase(aa); n for (int bb : cg[aa]) { n tassert(comps[bb].size() > 0); n indeg[bb]--; n if (indeg[bb] == 0) { n heads.insert(bb); n } n } n } n }; n while (true) { n assert(heads.size()); n if (heads.size() == 1) { n answer(cap); n } n auto head2it = heads.begin(); n if (head == (*head2it)) { n head2it++; n } n int head2 = *head2it; n tassert(!cg[head].count(head2)); n int cap2 = comps[head2].back(); n comps[head2].pop_back(); n bool ok = ask(cap, cap2); n if (!ok) { n update(head); n head = head2; n cap = cap2; n } else { n update(head2); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n unsigned long long n; n cin >> n; n vector a(n); n for (unsigned long long i = 0; i < n; i++) cin >> a[i]; n unsigned long long total = 0; n for (unsigned long long i = 0; i < n; i++) total += a[i]; n vector f; n unsigned long long zd = total; n for (unsigned long long i = 2; (i * i) <= zd; i++) { n if (zd % i == 0) { n f.push_back(i); n while (zd % i == 0) { n zd /= i; n } n } n } n if (zd != 1) f.push_back(zd); n if (total == 1) { n cout << -1 << n ; n return 0; n } n unsigned long long is = 900000000000000000; n for (unsigned long long i = 0; i < f.size(); i++) { n unsigned long long x = f[i]; n unsigned long long temp = 0; n vector> z; n unsigned long long tt = 0; n for (unsigned long long j = 0; j < n; j++) { n tt += a[j] % x; n z.push_back(make_pair(j, a[j] % x)); n if (tt >= x) { n unsigned long long left = 0; n unsigned long long right = 0; n unsigned long long Sr = 0; n unsigned long long Sl = 0; n z[z.size() - 1].second -= (tt - x); n for (unsigned long long k = 0; k < z.size(); k++) { n right += n (unsigned long long)z[k].first * (unsigned long long)z[k].second; n } n Sr = x; n unsigned long long ttt = 900000000000000000; n for (unsigned long long k = 0; k < z.size(); k++) { n unsigned long long t2 = 0; n right -= ((unsigned long long)z[k].first * n (unsigned long long)z[k].second); n left += ((unsigned long long)z[k].first * n (unsigned long long)z[k].second); n Sr -= z[k].second; n Sl += z[k].second; n t2 += (right - Sr * z[k].first) + (Sl * z[k].first - left); n ttt = min(ttt, t2); n } n temp += ttt; n z.clear(); n tt %= x; n z.push_back(make_pair(j, tt)); n } n } n is = min(is, temp); n } n cout << is << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, cnt[200005 * 5], E2[200005], f[200005 * 5]; n signed main() { n scanf( %d , &n); n int mx = 0; n for (int i = 1; i <= n; i++) { n int x; n scanf( %d , &x); n cnt[x]++; n mx = max(mx, x); n } n E2[0] = 1; n for (int i = 1; i < 200005; i++) E2[i] = E2[i - 1] * 2 % 1000000007; n for (int i = mx; i >= 2; i--) { n int tot = 0; n for (int j = i; j <= mx; j += i) tot += cnt[j]; n f[i] = 1ll * tot * E2[tot - 1] % 1000000007; n for (int j = i + i; j <= mx; j += i) n f[i] = (f[i] - f[j] + 1000000007) % 1000000007; n } n int ans = 0; n for (int i = 2; i <= mx; i++) n ans = (ans + 1ll * f[i] * i % 1000000007) % 1000000007; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ld = long double; n using pii = pair; n constexpr int MAXN = 100005; n int n; n string type[MAXN], word[MAXN]; n bitset<30> to_bs(const string& s) { n bitset<30> res; n for (char c : s) { n res[c - a ] = true; n } n return res; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n; n bitset<30> all = to_bs( abcdefghijklmnopqrstuvwxyz ); n int ans = 0; n for (int i = 0; i < n; ++i) { n cin >> type[i] >> word[i]; n bitset<30> cur = to_bs(word[i]); n if (type[i][0] == ! ) { n if (all.count() <= 1) { n ans += 1; n } n all = all & cur; n } else if (type[i][0] == . ) { n all = all & cur.flip(); n } else { n if (all.count() == 1) ans += 1; n all.reset(word[i][0] - a ); n } n } n cout << max(0, ans - 1) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 10; n bool lucky[10010]; n int n, m; n int a[N]; n int t[N + N]; n void init() { n memset(lucky, false, sizeof(lucky)); n lucky[0] = true; n for (int i = 1; i <= 10000; i++) n if (i % 10 == 4 || i % 10 == 7) lucky[i] = lucky[i / 10]; n } n void update(int i, int v) { n if (!v) return; n i += n; n while (i >= 1) { n t[i] += v; n i >>= 1; n } n } n int query(int Left, int Right) { n int res = 0; n Left += n; n Right += n; n while (Left <= Right) { n if (Left % 2) res += t[Left]; n if ((~Right) % 2) res += t[Right]; n Left = (Left + 1) >> 1; n Right = (Right - 1) >> 1; n } n return res; n } n int main() { n init(); n scanf( %d%d , &n, &m); n memset(t, 0, sizeof(t)); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n update(i, lucky[a[i]]); n } n char x[10]; n int Left, Right, temp; n while (m--) { n scanf( %s , &x); n if (strcmp(x, count ) == 0) { n scanf( %d%d , &Left, &Right); n Left--; n Right--; n printf( %d n , query(Left, Right)); n } else { n scanf( %d%d%d , &Left, &Right, &temp); n Left--; n Right--; n for (int i = Left; i <= Right; i++) { n a[i] += temp; n update(i, lucky[a[i]] - lucky[a[i] - temp]); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double pi = acos(-1.0), eps = 1e-8; n const int inf = ~0U >> 2; n int mod = 1e9 + 7; n int Pow(int x, long long t) { n int r = 1; n for (; t; t >>= 1, x = (long long)x * x % mod) n if (t & 1) r = (long long)r * x % mod; n return r; n } n const int N = 101010; n int n, K; n struct P { n long long x, y; n void in() { cin >> x >> y; } n P(long long _x = 0, long long _y = 0) { x = _x, y = _y; } n double dis() { return sqrt(x * x + y * y); } n long long operator^(const P& b) { return x * b.y - y * b.x; } n P operator-(const P& b) { return P(x - b.x, y - b.y); } n } p[N << 1], q; n long long mul(P& o, P& a, P& b) { return (a - o) ^ (b - o); } n bool in(P q) { n double a = 0; n for (int i = 0; i < n; ++i) { n long long aera = mul(q, p[i], p[i + 1]); n double disa = (p[i] - q).dis(), disb = (p[i + 1] - q).dis(), n disc = (p[i] - p[i + 1]).dis(); n double angle = acos(((disa) * (disa) + (disb) * (disb) - (disc) * (disc)) / n 2.0 / disa / disb); n if (aera > 0) n a += angle; n else n a -= angle; n } n return fabs(a) >= 1; n } n long long wk() { n q.in(); n if (!in(q)) return 0; n long long ans = (long long)n * (n - 1) * (n - 2) / 6; n for (int i = 0, j = 1; i < n; ++i) { n while (mul(p[i], p[j], q) <= 0) ++j; n int del = (j + n - i) % n; n int rm = n - del; n ans -= (long long)rm * (rm - 1) / 2; n } n return ans; n } n int main() { n cin >> n; n for (int i = 0; i < n; ++i) p[i].in(), p[i + n] = p[i]; n cin >> K; n for (int i = 0; i < K; ++i) cout << wk() << endl; n return 0; n } n "} +{"func_code_string": "#include n n using namespace std; n n bool palindrome(const string &s) { n int n = s.length(); n for(int i = 0; i < n; i++) { n if(s[i] != s[n - i - 1]) return false; n } n return true; n } n n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int te; n cin >> te; n while(te--) { n string s; n cin >> s; n if(!palindrome(s + a )) { n cout << YES n << s << a << n ; n }else if(!palindrome( a + s)) { n cout << YES n << a << s << n ; n }else { n cout << NO n ; n } n } n }"} +{"func_code_string": "#include n const long double PI(acosl(-1.0)); n long double eps = 1e-9; n using namespace std; n using namespace std; n const int N = 1000000; n int main() { n std::ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n vector > p(n); n int s = 0; n for (int i(0); i < n; i++) { n int x; n cin >> x; n s += x; n p[i] = {x, i + 1}; n } n sort(++p.begin(), p.end()); n reverse(++p.begin(), p.end()); n vector > ans; n int j = 1; n int i = 0; n while (j < n) { n while (j < n && p[i].first > 0) { n ans.push_back({p[i].second, p[j].second}); n p[i].first--; n j++; n } n i++; n if (i == j) break; n } n if (j < n) { n cout << -1; n return 0; n } n cout << ans.size() << endl; n for (int i(0); i < ans.size(); i++) n cout << ans[i].first << << ans[i].second << n ; n } n "} +{"func_code_string": "#include n using namespace std; n template n void CIN(T &a) { n cin >> a; n } n template n void CIN(T &a, T &b) { n cin >> a >> b; n } n template n void CIN(T &a, T &b, T &c) { n cin >> a >> b >> c; n } n template n void CIN(T &a, T &b, T &c, T &d) { n cin >> a >> b >> c >> d; n } n template n void PI(T a) { n cout << a << endl; n } n template n void PI(T a, T b) { n cout << a << << b << endl; n } n template n void PIS(T a) { n cout << a << ; n } n template n T abs(T a) { n return a < 0 ? -a : a; n } n const int N = 10000010; n long long n, x, y, dx, dy, t; n int b[6][6] = {{2, 1, 1, 0, 1, 0}, {1, 2, 0, 1, 1, 0}, {1, 1, 1, 0, 1, 0}, n {1, 1, 0, 1, 1, 0}, {0, 0, 0, 0, 1, 1}, {0, 0, 0, 0, 0, 1}}; n struct matrix { n long long a[6][6]; n matrix() { memset(a, 0, sizeof(a)); } n void init() { n int i, j; n for (i = 0; i < (int)(6); ++i) n for (j = 0; j < (int)(6); ++j) a[i][j] = b[i][j]; n } n void unit() { n memset(a, 0, sizeof(a)); n int i; n for (i = 0; i < (int)(6); ++i) a[i][i] = 1; n } n matrix operator*(const matrix &b) const { n matrix ret; n int i, j, k; n for (i = 0; i < (int)(6); ++i) n for (j = 0; j < (int)(6); ++j) n for (k = 0; k < (int)(6); ++k) { n ret.a[i][j] += a[i][k] * b.a[k][j]; n ret.a[i][j] %= n; n } n return ret; n } n matrix Pow(long long k) { n matrix ret, p = *this; n ret.unit(); n while (k) { n if (k & 1) ret = ret * p; n k >>= 1; n p = p * p; n } n return ret; n } n } mx; n int main() { n CIN(n); n CIN(x, y, dx, dy); n CIN(t); n mx.init(); n mx = mx.Pow(t); n long long ex = mx.a[0][0] * x + mx.a[0][1] * y + mx.a[0][2] * dx + n mx.a[0][3] * dy + mx.a[0][5]; n long long ey = mx.a[1][0] * x + mx.a[1][1] * y + mx.a[1][2] * dx + n mx.a[1][3] * dy + mx.a[1][5]; n ex %= n; n if (ex <= 0) ex += n; n ey %= n; n if (ey <= 0) ey += n; n PI(ex, ey); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c; n cin >> a >> b >> c; n int max = 0; n int n[100]; n n[0] = a * b + c, n[1] = a * b * c, n[2] = a + b * c, n[3] = a + b + c, n n[4] = a * (b + c), n[5] = (a + b) * c; n for (int i = 0; i < 6; i++) { n if (n[i] > max) max = n[i]; n } n cout << max << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n n typedef long long Int; n typedef pair PII; n typedef vector VInt; n n #define FOR(i, a, b) for(i = (a); i < (b); ++i) n #define RFOR(i, a, b) for(i = (a) - 1; i >= (b); --i) n #define EACH(it, a) for(auto it = (a).begin(); it != (a).end(); ++it) n #define CLEAR(a, b) memset(a, b, sizeof(a)) n #define SIZE(a) int((a).size()) n #define ALL(a) (a).begin(),(a).end() n #define MP make_pair n n int f(VInt p, VInt s) n { n int n = SIZE(p); n int left = 0, right = n - 1; n int res = 0; n VInt used(n, 0); n while(left < right) n { n int cnt = 0; n int flips = 0; n int l = left; n int r = right + 1; n while(l >= left || r <= right) n { n if(l >= left) n { n int a = left; n ++left; n if(used[a] == 0) n { n int b = p[a]; n used[a] = used[b] = 1; n ++cnt; n flips += s[a]; n if(b > r) return -1; n r = b; n if(l >= r) return -1; n } n } n if(r <= right) n { n int a = right; n --right; n if(used[a] == 0) n { n int b = p[a]; n used[a] = used[b] = 1; n ++cnt; n flips += s[a]; n if(b < l) return -1; n l = b; n if(l >= r) return -1; n } n } n } n res += min(flips, cnt - flips); n } n return res; n } n n void SolveTest(int test) n { n int n; n cin >> n; n int i, j; n VInt p(n + n); n VInt s(n + n); n FOR(i, 0, n) n { n int a, b; n cin >> a >> b; n --a; n --b; n p[a] = b; n p[b] = a; n s[a] = 0; n s[b] = 1; n } n n cout << f(p, s) << endl; n } n n int main() n { n int T, t; n T = 1; n //cin >> T; n FOR(t, 0, T) SolveTest(t); n return 0; n };"} +{"func_code_string": "#include n using namespace std; n const int N = 55; n const int MOD = 1e9 + 7; n struct Node { n int op, x, y, d; n Node() {} n Node(int _op, int _x, int _y, int _d) { op = _op, x = _x, y = _y, d = _d; } n bool operator<(const Node &cur) const { return d > cur.d; } n }; n priority_queue que; n int dist[2][N][N], n, m, nx, ny; n long long ans[2][N][N], C[N][N]; n void init() { n int i, j; n memset(C, 0, sizeof(C)); n for (i = 0; i < N; i++) { n C[i][0] = 1; n for (j = 1; j <= i; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD; n } n } n int main() { n int i, j, tmp; n init(); n while (scanf( %d%d , &n, &m) != EOF) { n for (i = 1, nx = ny = 0; i <= n; i++) { n scanf( %d , &tmp); n if (tmp == 50) n nx++; n else n ny++; n } n memset(dist, 0x3f, sizeof(dist)); n memset(ans, 0, sizeof(ans)); n while (!que.empty()) que.pop(); n dist[1][0][0] = 0; n ans[1][0][0] = 1; n que.push(Node(1, 0, 0, 0)); n while (!que.empty()) { n Node cur = que.top(); n que.pop(); n if (cur.d > dist[cur.op][cur.x][cur.y]) continue; n for (i = 0; i <= nx; i++) n for (j = 0; j <= ny; j++) { n if (i + j == 0 || 50 * i + 100 * j > m) continue; n if (cur.op == 0 && cur.x >= i && cur.y >= j) { n if (dist[1][cur.x - i][cur.y - j] >= cur.d + 1) { n if (dist[1][cur.x - i][cur.y - j] > cur.d + 1) { n ans[1][cur.x - i][cur.y - j] = 0; n dist[1][cur.x - i][cur.y - j] = cur.d + 1; n que.push(Node(1, cur.x - i, cur.y - j, cur.d + 1)); n } n ans[1][cur.x - i][cur.y - j] += n ans[0][cur.x][cur.y] * C[cur.x][i] % MOD * C[cur.y][j] % MOD; n ans[1][cur.x - i][cur.y - j] %= MOD; n } n } n if (cur.op == 1 && cur.x + i <= nx && cur.y + j <= ny) { n if (dist[0][cur.x + i][cur.y + j] >= cur.d + 1) { n if (dist[0][cur.x + i][cur.y + j] > cur.d + 1) { n ans[0][cur.x + i][cur.y + j] = 0; n dist[0][cur.x + i][cur.y + j] = cur.d + 1; n que.push(Node(0, cur.x + i, cur.y + j, cur.d + 1)); n } n ans[0][cur.x + i][cur.y + j] += ans[1][cur.x][cur.y] * n C[nx - cur.x][i] % MOD * n C[ny - cur.y][j] % MOD; n ans[0][cur.x + i][cur.y + j] %= MOD; n } n } n } n } n if (dist[0][nx][ny] == 0x3f3f3f3f) { n printf( -1 n0 n ); n } else { n printf( %d n%I64d n , dist[0][nx][ny], ans[0][nx][ny]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n bool chmax(T &a, const T &b) { n if (a < b) { n a = b; n return 1; n } n return 0; n } n template n bool chmin(T &a, const T &b) { n if (a > b) { n a = b; n return 1; n } n return 0; n } n template n ostream &operator<<(ostream &os, const vector &t) { n os << [ ; n for (__typeof((t).begin()) it = (t).begin(); it != (t).end(); it++) { n if (it != t.begin()) os << , ; n os << *it; n } n os << ] ; n return os; n } n template n ostream &operator<<(ostream &os, const set &t) { n os << { ; n for (__typeof((t).begin()) it = (t).begin(); it != (t).end(); it++) { n if (it != t.begin()) os << , ; n os << *it; n } n os << } ; n return os; n } n template n ostream &operator<<(ostream &os, const pair &t) { n return os << ( << t.first << , << t.second << ) ; n } n template n pair operator+(const pair &s, const pair &t) { n return pair(s.first + t.first, s.second + t.second); n } n template n pair operator-(const pair &s, const pair &t) { n return pair(s.first - t.first, s.second - t.second); n } n namespace geom { n enum { TRUE = 1, FALSE = 0, BORDER = -1 }; n const long double INF = 1e8; n long double EPS = 1e-6; n const long double PI = 3.1415926535897932384626; n inline int sig(const long double &x) { n return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); n } n inline int less(const long double &x, const long double &y) { n return sig(x - y) ? x < y : BORDER; n } n inline long double norm(const complex &p) { n return p.real() * p.real() + p.imag() * p.imag(); n } n inline long double inp(const complex &a, n const complex &b) { n return (conj(a) * b).real(); n } n inline long double outp(const complex &a, n const complex &b) { n return (conj(a) * b).imag(); n } n inline complex unit(const complex &p) { n return p / abs(p); n } n inline complex proj(const complex &s, n const complex &t) { n return t * inp(s, t) / norm(t); n } n inline int ccw(const complex &s, const complex &t, n const complex &p, int adv = 0) { n int res = sig(outp(t - s, p - s)); n if (res || !adv) return res; n if (sig(inp(t - s, p - s)) < 0) return -2; n if (sig(inp(s - t, p - t)) < 0) return 2; n return 0; n } n } // namespace geom n using namespace geom; n int f = 0; n namespace std { n bool operator<(const complex &a, const complex &b) { n return sig(a.real() - b.real()) ? a.real() < b.real() n : a.imag() + EPS < b.imag(); n } n bool operator==(const complex &a, const complex &b) { n return abs(a - b) < EPS; n } n istream &operator>>(istream &is, complex &p) { n long double x, y; n is >> x >> y; n p = complex(x, y); n return is; n } n } // namespace std n int n, m; n complex p, q, v, w; n long double vmax, ct; n long double dist(complex v, complex wind, n long double t) { n if (abs(v) > EPS) v = unit(v); n long double l = 0, r = 1e10; n for (int _ = 0; _ < (int)(100); _++) { n long double mid = (l + r) / 2; n long double vx = v.real() * mid; n long double vy = v.imag() * mid; n if ((vx * vx + vy * vy) <= vmax * vmax) n l = mid; n else n r = mid; n } n return abs(v * l) * t; n } n int check(long double t) { n complex s = n q + v * min(t, ct) + w * max(t - ct, 0); n complex vec = p - s; n return dist(vec, v, min(t, ct)) + n dist(vec, w, max(t - ct, 0)) >= n abs(vec); n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> q >> p; n cin >> vmax >> ct; n cin >> v >> w; n long double l = 0, r = 1e10; n for (int _ = 0; _ < (int)(100); _++) { n long double mid = (l + r) / 2; n if (check(mid)) n r = mid; n else n l = mid; n } n printf( %.20f n , (double)l); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n long long a[305], Lcm; n long long sol(long long x) { n long long cnt = 0; n for (long long i = 2; i * i <= x; i++) { n if (x % i == 0) { n cnt += 2; n if (i * i == x) cnt--; n } n } n return cnt; n } n int main() { n int T; n cin >> T; n while (T--) { n int ok = 1; n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %lld , &a[i]); n sort(a, a + n); n if (n == 1) n Lcm = a[0] * a[0]; n else n Lcm = a[0] * a[n - 1]; n for (int i = 1; i < (n + 1) / 2; i++) { n if (a[i] * a[n - 1 - i] != Lcm) { n ok = 0; n break; n } n } n if (ok && sol(Lcm) == n) n printf( %lld n , Lcm); n else n puts( -1 ); n } n } n "} +{"func_code_string": "#include n using namespace std; n char ch[100001]; n int per[100001]; n bool is[100001]; n bool vis[100001]; n bool mem[100001]; n bool have[100001]; n vector V; n int main() { n int i, j; n int a, b; n int n, m; n cin >> n >> m; n for (i = 0; i < m; i++) { n cin >> ch[i] >> per[i]; n have[per[i]] = true; n } n V.clear(); n memset(is, true, sizeof is); n for (i = 0; i < m; i++) { n if (ch[i] == + ) { n if (!vis[per[i]] && i) is[per[i]] = false; n if (V.size()) { n is[per[i]] = false; n } else { n for (j = i - 1; j >= 0; j--) { n if (per[i] != per[j]) is[per[j]] = false; n if (mem[j]) break; n } n mem[i - 1] = true; n } n V.push_back(per[i]); n } else { n if (!vis[per[i]]) { n for (j = i - 1; j >= 0; j--) { n is[per[j]] = false; n if (mem[j]) break; n } n mem[i - 1] = true; n if (V.size()) is[per[i]] = false; n } else if (V.size() == 1) { n if (V[0] == per[i]) n V.clear(); n else { n int num = per[i]; n V.erase(std::remove(V.begin(), V.end(), num), V.end()); n is[num] = false; n } n } else if (V.size()) { n int num = per[i]; n V.erase(std::remove(V.begin(), V.end(), num), V.end()); n is[num] = false; n } n } n if (!vis[per[i]]) vis[per[i]] = true; n } n vector res; n res.clear(); n for (i = 1; i <= n; i++) { n if (!have[i]) { n res.push_back(i); n } else { n if (is[i]) res.push_back(i); n } n } n int sz = res.size(); n cout << sz << endl; n for (i = 0; i < sz; i++) cout << res[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const long long inf = 2e18; n struct custom_hash { n static uint64_t splitmix64(uint64_t x) { n x += 0x9e3779b97f4a7c15; n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; n x = (x ^ (x >> 27)) * 0x94d049bb133111eb; n return x ^ (x >> 31); n } n size_t operator()(uint64_t x) const { n static const uint64_t FIXED_RANDOM = n chrono::steady_clock::now().time_since_epoch().count(); n return splitmix64(x + FIXED_RANDOM); n } n }; n int add(int a, int b) { n int res = (a + b) % mod; n if (res < 0) res += mod; n return res; n } n int mult(int a, int b) { n int res = (a * 1LL * b) % mod; n if (res < mod) res += mod; n return res; n } n int power(int a, int b) { n int res = 1; n while (b) { n if ((b % 2) == 1) res = mult(res, a); n a = mult(a, a); n b /= 2; n } n return res; n } n template n string to_string(pair p); n template n string to_string(tuple p); n template n string to_string(tuple p); n string to_string(const string &s) { return + s + ; } n string to_string(const char *s) { return to_string((string)s); } n string to_string(bool b) { return (b ? true : false ); } n string to_string(char c) { return to_string(string(1, c)); } n string to_string(vector v) { n bool first = true; n string res = { ; n for (int i = 0; i < static_cast(v.size()); i++) { n if (!first) { n res += , ; n } n first = false; n res += to_string(v[i]); n } n res += } ; n return res; n } n template n string to_string(bitset v) { n string res = ; n for (size_t i = 0; i < N; i++) { n res += static_cast( 0 + v[i]); n } n return res; n } n template n string to_string(A v) { n bool first = true; n string res = { ; n for (const auto &x : v) { n if (!first) { n res += , ; n } n first = false; n res += to_string(x); n } n res += } ; n return res; n } n template n string to_string(pair p) { n return ( + to_string(p.first) + , + to_string(p.second) + ) ; n } n template n string to_string(tuple p) { n return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + n to_string(get<2>(p)) + ) ; n } n template n string to_string(tuple p) { n return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + n to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; n } n void dbg() { cout << endl; } n template n void dbg(Head H, Tail... T) { n cout << << to_string(H); n dbg(T...); n } n void solve() { n int n; n cin >> n; n vector v(n); n for (int i = 0; i < n; i++) { n cin >> v[i]; n } n vector dp(1 << 22, 0); n for (int i = 0; i < n; i++) { n dp[v[i]] = v[i]; n } n for (int mask = 1; mask < (1 << 22); mask++) { n for (int i = 0; i < 22; i++) { n if (mask & (1 << i)) { n dp[mask] = max(dp[mask], dp[mask ^ (1 << i)]); n } n } n } n for (int i = 0; i < n; i++) { n int no = ((1 << 22) - 1) & (~v[i]); n if (dp[no]) { n cout << dp[no] << ; n } else { n cout << -1 ; n } n } n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cout << fixed << setprecision(10); n int t = 1; n for (int i = 1; i <= t; i++) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n #define ll long long n #define ld long double n #define For(i,x,y) for(ll i = (x);i <= (y);++i) n #define FOr(i,x,y) for(ll i = (x);i >= (y);--i) n #define fi first n #define se second n #define pa pair n #define mk make_pair n #define pb push_back n #define clr(a,b) memset(a,b,sizeof(a)) n #define cpy(a,b) memcpy(a,b,sizeof(b)) n #define y1 y11111111111111111111 n #define debug puts( @@@@@@@@@@@@@@@@@@@@ ) n #define NO puts( NO ) n #define YES puts( YES ) n #define Yes puts( Yes ) n #define No puts( No ) n inline ll read() n { n ll x = 0,f = 1;char ch = getchar(); n while(ch < 0 || ch > 9 ){if(ch == - )f = -1;ch = getchar();} n while(ch >= 0 && ch <= 9 ){x = x*10+ch- 0 ;ch = getchar();} n return x*f; n } n char s[999]; n int main() n { n while (scanf( %s ,s)!=EOF) n { n if (s[1]== s ) puts( NO ),fflush(stdout); n } n }"} +{"func_code_string": "#include n using namespace std; n int n; n double s; n vector E[100005]; n int dist[100005], pa[100005]; n int dfs(int u, int p, int d) { n dist[u] = d; n int ans = u; n for (int v : E[u]) { n if (v == p) continue; n int tmp = dfs(v, u, d + 1); n pa[v] = u; n if (dist[ans] < dist[tmp]) ans = tmp; n } n return ans; n } n int main() { n scanf( %d%lf , &n, &s); n for (int i = 0; i < n - 1; i++) { n int u, v; n scanf( %d%d , &u, &v); n E[u].push_back(v); n E[v].push_back(u); n } n if (n == 2) { n printf( %.10lf n , s); n return 0; n } n int l = 0; n for (int i = 1; i <= n; i++) { n if (E[i].size() == 1) l++; n } n printf( %.10lf n , 2.0 * s / l); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long mk[100000]; n int main() { n long a, b, m, r0, r; n cin >> a >> b >> m >> r0; n for (long i = 0; i < m; i++) mk[i] = -1; n r = (a * r0 + b) % m; n mk[r] = 1; n long k = 1; n while (true) { n k++; n r = (a * r + b) % m; n if (mk[r] == -1) n mk[r] = k; n else { n cout << k - mk[r]; n return 0; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, maxi = 2, ans = 2; n int a[100005]; n vector num; n int main() { n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n if (n < 3) { n cout << n; n return 0; n } n for (int i = 2; i < n; i++) { n if (a[i] == a[i - 1] + a[i - 2]) { n ans++; n maxi = max(maxi, ans); n } else n ans = 2; n } n cout << maxi; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dx[] = {+1, -1, +0, +0}; n int dy[] = {+0, +0, +1, -1}; n int fx[] = {+0, +0, +1, -1, -1, +1, -1, +1}; n int fy[] = {-1, +1, +0, +0, +1, +1, -1, -1}; n int hr[] = {-2, -2, -1, +1, +2, +2, -1, +1}; n int hc[] = {+1, -1, +2, +2, -1, +1, -2, -2}; n const int MAXN = 1e5 + 9; n int main() { n int i, j, k, l, m, n, tc, t, mx, ans, total = 0; n cin >> n >> m; n mx = -9999; n ans = -1; n for (int i = 0; i < (int)n; i++) { n cin >> k; n t = k / m; n if (k % m) t++; n if (t >= mx) { n mx = t; n ans = i + 1; n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100010; n const int mod = 1e9 + 7; n long long dp[maxn] = {0, 1, 2, 3, 5, 8}; n int main() { n for (int i = 6; i < maxn; i++) dp[i] = (dp[i - 1] + dp[i - 2]) % mod; n int n, m; n cin >> n >> m; n cout << (2 * (dp[n] + dp[m] - 1)) % mod << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int Set(int N, int pos) { return N = N | (1 << pos); } n int reset(int N, int pos) { return N = N & ~(1 << pos); } n bool check(long long N, int pos) { return (bool)(N & (1LL << pos)); } n int n, m, l, r; n string s; n char c1, c2; n int main() { n cin >> n >> m; n cin >> s; n for (int i = 1; i <= m; i++) { n cin >> l >> r >> c1 >> c2; n l--, r--; n for (int j = l; j <= r; j++) { n if (s[j] == c1) s[j] = c2; n } n } n cout << s << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n set g; n g.insert(s); n int n = s.size(); n for (int k = 0; k < s.size(); k++) { n string s1 = ; n s1 += s[n - 1]; n for (int i = 0; i < s.size() - 1; i++) { n s1 += s[i]; n } n s = s1; n g.insert(s); n } n cout << g.size(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mod = 1000000007; n vector parent(200005), Size(200005, 1); n long long answer = 0; n long long find_set(long long n) { n if (parent[n] == n) n return n; n else n return find_set(parent[n]); n } n void add_edge(long long a, long long b) { n long long A = find_set(a); n long long B = find_set(b); n if (Size[A] >= Size[B]) { n answer -= ((Size[A] * (Size[A] - 1)) / 2); n answer -= ((Size[B] * (Size[B] - 1)) / 2); n Size[A] += Size[B]; n Size[B] = 0; n parent[B] = A; n answer += ((Size[A] * (Size[A] - 1)) / 2); n } else { n answer -= ((Size[B] * (Size[B] - 1)) / 2); n answer -= ((Size[A] * (Size[A] - 1)) / 2); n Size[B] += Size[A]; n Size[A] = 0; n parent[A] = B; n answer += ((Size[B] * (Size[B] - 1)) / 2); n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long N, Q, p, q, r; n cin >> N >> Q; n if (N == 1) { n for (long long i = 1; i <= Q; i++) cout << 0 ; n return 0; n } n for (long long i = 1; i <= N; i++) parent[i] = i; n vector>> G; n for (long long i = 1; i < N; i++) { n cin >> p >> q >> r; n G.push_back({r, {p, q}}); n } n sort(G.begin(), G.end()); n vector final_ans(N + 1); n long long ptr = 0; n for (long long i = 1; i <= N;) { n if (G[ptr].first == i) { n add_edge(G[ptr].second.first, G[ptr].second.second); n ptr++; n } else { n final_ans[i] = answer; n i++; n } n } n while (Q--) { n long long k; n cin >> k; n cout << final_ans[k] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n map isolados; n long long n, k, i, j, prox, qtd, x, resp; n bool first = true; n while (cin >> n >> k) { n resp = 0; n isolados.clear(); n prox = -1; n first = true; n for (i = 0; i < k; i++) { n cin >> qtd; n for (j = 0; j < qtd; j++) { n cin >> x; n if (x == 1) prox = 1; n if (x == prox && first == true) { n prox++; n } else if (j == 0) { n isolados[x] = 0; n } else { n isolados[x] = 1; n } n } n if (prox != -1) first = false; n } n for (prox; prox <= n; prox++) { n resp += isolados[prox] + 1; n } n cout << resp << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, sti[101], i, x, ans; n cin >> n; n memset(sti, 0, sizeof(sti)); n for (i = 1; i <= n; i++) { n cin >> x; n sti[x]++; n } n ans = 0; n for (i = 1; i <= 100; i++) { n ans += 2 * (sti[i] / 4); n sti[i] %= 4; n ans += sti[i] / 2; n } n cout << ans / 2 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n double a[4010]; n int main() { n cin >> n; n n *= 2; n for (int i = 1; i <= n; ++i) cin >> a[i]; n for (int i = 1; i <= n; ++i) a[i] = a[i] - int(a[i]); n int cnt = 0; n for (int i = 1; i <= n; ++i) n if (abs(a[i] - 0) <= 0.0000001) cnt++; n double sum = 0; n for (int i = 1; i <= n; ++i) sum += a[i]; n double res = 1000000001; n for (int i = 0; i <= cnt; ++i) res = min(res, abs(n / 2 - sum - i)); n printf( %.3f , res); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a[100005]; n int n, i; n scanf( %d , &n); n for (i = 0; i < n; i++) { n scanf( %d , &a[i]); n } n sort(a, a + n); n if (a[n - 1] == 1) { n for (i = 0; i < n - 1; i++) { n printf( %d , a[i]); n } n puts( 2 ); n } else { n printf( 1 ); n for (i = 0; i < n - 1; i++) { n printf( %d , a[i]); n } n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long solve(long long a, long long b, long long c) { n long long a1 = a - c; n a1 *= a1; n long long b1 = c - b; n b1 *= b1; n long long c1 = b - a; n c1 *= c1; n return a1 + b1 + c1; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t; n t = 1; n cin >> t; n while (t--) { n long long a, b, c; n cin >> a >> b >> c; n vector arr(a, 0), arr1(b, 0), arr2(c, 0); n for (int i = 0; i < a; i++) { n cin >> arr[i]; n } n for (int i = 0; i < b; i++) { n cin >> arr1[i]; n } n for (int i = 0; i < c; i++) { n cin >> arr2[i]; n } n sort((arr).begin(), (arr).end()); n sort((arr1).begin(), (arr1).end()); n sort((arr2).begin(), (arr2).end()); n long long ans = 4 * (1e18); n vector::iterator it; n it = unique((arr).begin(), (arr).end()); n arr.resize(distance(arr.begin(), it)); n it = unique((arr1).begin(), (arr1).end()); n arr1.resize(distance(arr1.begin(), it)); n it = unique((arr2).begin(), (arr2).end()); n arr2.resize(distance(arr2.begin(), it)); n a = arr.size(); n b = arr1.size(); n c = arr2.size(); n for (int i = 0; i < a; i++) { n long long in = n lower_bound((arr1).begin(), (arr1).end(), arr[i]) - arr1.begin(); n vector a1; n vector b1; n if (in == b) { n a1.push_back(arr1[in - 1]); n } else { n a1.push_back(arr1[in]); n if (in < b - 1) { n a1.push_back(arr1[in + 1]); n } n if (in > 0) { n a1.push_back(arr1[in - 1]); n } n } n in = lower_bound((arr2).begin(), (arr2).end(), arr[i]) - arr2.begin(); n if (in == c) { n b1.push_back(arr2[in - 1]); n } else { n b1.push_back(arr2[in]); n if (in < c - 1) { n b1.push_back(arr2[in + 1]); n } n if (in > 0) { n b1.push_back(arr2[in - 1]); n } n } n for (int j = 0; j < a1.size(); j++) { n for (int l = 0; l < b1.size(); l++) { n long long k = solve(arr[i], a1[j], b1[l]); n ans = min(k, ans); n } n } n } n for (int i = 0; i < b; i++) { n long long in = n lower_bound((arr).begin(), (arr).end(), arr1[i]) - arr.begin(); n vector a1; n vector b1; n if (in == a) { n a1.push_back(arr[in - 1]); n } else { n a1.push_back(arr[in]); n if (in < a - 1) { n a1.push_back(arr[in + 1]); n } n if (in > 0) { n a1.push_back(arr[in - 1]); n } n } n in = lower_bound((arr2).begin(), (arr2).end(), arr1[i]) - arr2.begin(); n if (in == c) { n b1.push_back(arr2[in - 1]); n } else { n b1.push_back(arr2[in]); n if (in < c - 1) { n b1.push_back(arr2[in + 1]); n } n if (in > 0) { n b1.push_back(arr2[in - 1]); n } n } n for (int j = 0; j < a1.size(); j++) { n for (int l = 0; l < b1.size(); l++) { n long long k = solve(arr1[i], a1[j], b1[l]); n ans = min(k, ans); n } n } n } n for (int i = 0; i < c; i++) { n long long in = n lower_bound((arr1).begin(), (arr1).end(), arr2[i]) - arr1.begin(); n vector a1; n vector b1; n if (in == b) { n a1.push_back(arr1[in - 1]); n } else { n a1.push_back(arr1[in]); n if (in < b - 1) { n a1.push_back(arr1[in + 1]); n } n if (in > 0) { n a1.push_back(arr1[in - 1]); n } n } n in = lower_bound((arr).begin(), (arr).end(), arr2[i]) - arr.begin(); n if (in == a) { n b1.push_back(arr[in - 1]); n } else { n b1.push_back(arr[in]); n if (in < a - 1) { n b1.push_back(arr[in + 1]); n } n if (in > 0) { n b1.push_back(arr[in - 1]); n } n } n for (int j = 0; j < a1.size(); j++) { n for (int l = 0; l < b1.size(); l++) { n long long k = solve(arr2[i], a1[j], b1[l]); n ans = min(k, ans); n } n } n } n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct group { n int sz; n vector worst, best; n group(vector& a) n : sz(1), worst(a.begin(), a.end()), best(a.begin(), a.end()) {} n bool operator<(const group& a) const { n for (int i = 0; i < best.size(); i++) n if (best[i] >= a.worst[i]) return false; n return true; n } n struct group& operator+=(const group& a) { n sz += a.sz; n for (int i = 0; i < best.size(); i++) { n best[i] = max(best[i], a.best[i]); n worst[i] = min(worst[i], a.worst[i]); n } n return *this; n } n }; n set positions; n int main() { n int n, k; n scanf( %d %d , &n, &k); n while (n--) { n vector skills(k, 0); n for (int i = 0; i < k; i++) scanf( %d , &skills[i]); n group player = group(skills); n auto f = positions.lower_bound(player), l = positions.upper_bound(player); n while (f != l) { n player += *f; n f = positions.erase(f); n } n positions.insert(f, player); n printf( %d n , positions.rbegin()->sz); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e5 + 10, STAN = (1 << 30) - 1; n struct QJ { n int l, r, q; n } q[MAXN]; n int n, m; n struct Seg { n int water[MAXN * 4], sh[MAXN * 4]; n bool fir[MAXN * 4]; n Seg() { n memset(water, 0, sizeof(water)); n memset(fir, 0, sizeof(fir)); n } n int _st, _ed, _x, _t; n void _insert(int num, int l, int r) { n if (_st <= l && r <= _ed) { n water[num] |= _x; n return; n } n int mid = (l + r) >> 1; n if (_st <= mid) _insert(num << 1, l, mid); n if (_ed >= mid + 1) _insert(num << 1 | 1, mid + 1, r); n } n int _swim(int num, int l, int r, int now) { n int x; n now |= water[num]; n if (l == r) { n if (!fir[num]) { n sh[num] = now; n fir[num] = true; n } else n sh[num] &= now; n return now; n } n int mid = (l + r) >> 1; n if (_t <= mid) n now = _swim(num << 1, l, mid, now); n else n now = _swim(num << 1 | 1, mid + 1, r, now); n if (!fir[num]) { n sh[num] = now; n fir[num] = true; n } else n sh[num] &= now; n return now; n } n int _check(int num, int l, int r) { n if (l == r) return sh[num]; n if (_st <= l && r <= _ed) return sh[num]; n int mid = (l + r) >> 1; n int ans = STAN; n if (_st <= mid) ans &= _check(num << 1, l, mid); n if (_ed >= mid + 1) ans &= _check(num << 1 | 1, mid + 1, r); n return ans; n } n inline void Insert(int l, int r, int q) { n _st = l, _ed = r, _x = q; n _insert(1, 1, n); n } n inline int Swim(int t) { n _t = t; n return _swim(1, 1, n, 0); n } n inline bool Check(int l, int r, int q) { n _st = l; n _ed = r; n return _check(1, 1, n) == q; n } n } T; n int a[MAXN]; n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n scanf( %d%d%d , &q[i].l, &q[i].r, &q[i].q); n T.Insert(q[i].l, q[i].r, q[i].q); n } n for (int i = 1; i <= n; i++) a[i] = T.Swim(i); n for (int i = 1; i <= m; i++) n if (!T.Check(q[i].l, q[i].r, q[i].q)) { n printf( NO n ); n return 0; n } n printf( YES n ); n for (int i = 1; i <= n; i++) printf( %d , a[i]); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n pair a[5003]; n vector color[5003]; n int ans[5003]; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n, k, i, j; n cin >> n >> k; n for (i = 0; i < n; i++) { n cin >> a[i].first; n a[i].second = i; n } n sort(a, a + n); n for (i = 0; i < n; i++) { n color[i % k].push_back(a[i].first); n ans[a[i].second] = (i % k); n } n for (i = 0; i < k; i++) { n for (j = 1; j < color[i].size(); j++) { n if (color[i][j] == color[i][j - 1]) { n cout << NO ; n return 0; n } n } n } n cout << YES n ; n for (i = 0; i < n; i++) { n cout << (ans[i] + 1) << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void enable_comma() {} n string tostring(char c) { n string s = ; n s += c; n return s; n } n string tostring(string s) { return + s + ; } n string tostring(const char *c) { return tostring((string)c); } n string tostring(long long x) { n if (x < 0) return - + tostring(-x); n if (x > 9) n return tostring(x / 10) + tostring(char( 0 + x % 10)); n else n return tostring(char( 0 + x)); n } n string tostring(int x) { return tostring((long long)x); } n string tostring(unsigned long long x) { n if (x > 9) n return tostring((long long)(x / 10)) + tostring(char( 0 + x % 10)); n else n return tostring(char( 0 + x)); n } n string tostring(unsigned x) { return tostring((long long)x); } n string tostring(double x) { n static char res[114]; n sprintf(res, %lf , x); n string s = tostring(res); n return s.substr(1, (int)s.size() - 2); n } n string tostring(long double x) { return tostring((double)x); } n template n string tostring(pair p) { n return ( + tostring(p.first) + , + tostring(p.second) + ) ; n } n template n string tostring(T v) { n string res = ; n for (auto p : v) res += (res.size() ? , : { ) + tostring(p); n return res.size() ? res + } : {} ; n } n template n string tostring(A *a, int L, int R) { n return tostring(vector(a + L, a + R + 1)); n }; n template n string tostring(A a, int L, int R) { n return tostring(a.data(), L, R); n } n string tostrings() { return ; } n template n string tostrings(Head H, Tail... T) { n return tostring(H) + + tostrings(T...); n } n long long read() { n long long x = 0, f = 0; n char ch = getchar(); n while (!isdigit(ch)) f = ch == - , ch = getchar(); n while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar(); n return f ? -x : x; n } n template n void ckmax(T &x, const T y) { n if (x < y) x = y; n } n template n void ckmin(T &x, const T y) { n if (x > y) x = y; n } n const int N = 100005; n struct op { n int tp; n long long a, b; n }; n vector res; n int a[60]; n set S; n long long gao(int tp, long long a, long long b) { n (!(S.count(a) && S.count(b)) ? cout << Assertion failed! << endl n << function: << __FUNCTION__ << endl n << line: << 149 << endl n << expression: n << S.count(a) && S.count(b) << endl, n exit(3), 0 : 1); n res.push_back({tp, a, b}); n long long res = tp ? a ^ b : a + b; n S.insert(res); n (!(0 <= res && res <= 5000000000000000000LL) n ? cout << Assertion failed! << endl n << function: << __FUNCTION__ << endl n << line: << 153 << endl n << expression: n << 0 <= res && res <= 5000000000000000000LL << endl, n exit(3), 0 : 1); n return res; n } n int Log(long long x) { n int ans = 0; n while (x > 1) { n ans++; n x >>= 1; n } n return ans; n } n int main() { n long long x = read(); n srand(time(NULL)); n S.clear(); n res.clear(); n S.insert(x); n while (x > 1) { n vector v = {x}; n while (1) { n int p = (int)v.size() - 1; n while (p > 0 && rand() % 5 != 0) p--; n long long a = v.back(), b = gao(0, a, a), c = gao(0, v[p], b); n if (Log(b) != Log(c)) { n v.push_back(c); n continue; n } else { n long long t = b ^ c; n for (int i = ((int)v.size() - 1); i >= (0); i--) { n if (Log(t) == Log(v[i] * 2)) t ^= v[i] * 2; n if (Log(t) == Log(v[i])) t ^= v[i]; n } n if (~t & 1) { n v.push_back(c); n continue; n } n t = gao(1, b, c); n for (int i = ((int)v.size() - 1); i >= (0); i--) { n if (Log(t) == Log(v[i] * 2)) t = gao(1, t, v[i] * 2); n if (Log(t) == Log(v[i])) t = gao(1, t, v[i]); n } n (!(Log(t) < Log(x)) ? cout << Assertion failed! << endl n << function: << __FUNCTION__ << endl n << line: << 198 << endl n << expression: n << Log(t) < Log(x) << endl, n exit(3), 0 : 1); n x = t; n break; n } n } n } n printf( %d n , (int)res.size()); n for (auto v : res) printf( %I64d %c %I64d n , v.a, +^ [v.tp], v.b); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC target( avx2 ) n #pragma GCC optimization( O3 ) n #pragma GCC optimization( unroll-loops ) n using namespace std; n const long long N = 1e5 + 10; n const long double Pie = acos(-1); n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n long long arr[n]; n for (long long i = 0; i < n; i++) cin >> arr[i]; n for (long long i = 0; i < n; i++) { n if (i % 2 == 0) { n if (arr[i] >= 0) n cout << arr[i] << ; n else n cout << -1 * arr[i] << ; n } else if (i % 2 == 1) { n if (arr[i] <= 0) n cout << arr[i] << ; n else n cout << -1 * arr[i] << ; n } n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const int maxn = 200005; n vector g[maxn]; n int dis[maxn]; n int pa[maxn]; n set> st; n void dfs(int now, int pre = 0) { n if (dis[now] > 2) { n st.insert({dis[now], now}); n } n for (auto &i : g[now]) { n if (i ^ pre) { n pa[i] = now; n dis[i] = dis[now] + 1; n dfs(i, now); n } n } n } n void go() { n int n; n cin >> n; n for (int i = 0; i < n - 1; i++) { n int x, y; n cin >> x >> y; n g[x].push_back(y); n g[y].push_back(x); n } n dfs(1); n int ans = 0; n while (st.size()) { n auto x = *(--st.end()); n int v = pa[x.second]; n st.erase({dis[v], v}); n for (auto &i : g[v]) { n st.erase({dis[i], i}); n } n ans++; n } n cout << ans << n ; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int c = 0; n int t; n if (!c) { n t = 1; n } else { n cin >> t; n } n while (t--) { n go(); n } n } n "} +{"func_code_string": "#include n using namespace std; n long long int newarr[1005]; n long long int dp[1005][1005]; n long long int n, k; n long long int solution(long long int index, long long int m) { n if (m < 0) m += k; n if (index >= n && m != 0) n return 0; n else if (m == 0) n return 1; n else if (dp[index][m] != -1) n return dp[index][m]; n else { n long long int x = solution(index + 1, m); n long long int y = solution(index + 1, m - newarr[index]); n if (x > 0) x = 1; n if (y > 0) y = 1; n if (m >= newarr[index]) { n dp[index + 1][m - newarr[index]] = y; n } n dp[index + 1][m] = x; n return x + y; n } n } n int32_t main() { n memset(dp, -1, sizeof(dp)); n cin >> n; n cin >> k; n long long int arr[n]; n long long int ctr = 0; n for (long long int i = 0; i < n; i++) { n cin >> arr[i]; n } n if (n > k) { n cout << YES n ; n } else { n for (long long int i = 0; i < n; i++) { n newarr[i] = arr[i] % k; n if (newarr[i] == 0) ctr++; n } n long long int x = solution(0, k); n if (x > 0 || ctr > 0) n cout << YES n ; n else n cout << NO ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int bas = 23333; n const long long mod = 9999999999973ll; n int N, M, S[26], L[555]; n char C[255][255]; n long long H[26], W[255][255][255], G[555]; n int manacher(int n) { n int k = 0, m = 0, res = 0; n memset(L, 0, sizeof(L)); n for (int i = 1; i <= n; i++) { n if (G[i] == -1) { n continue; n } n int l = (m > i) ? min(L[2 * k - i], m - i) : 1; n while (G[i - l] != -1 && G[i + l] != -1 && G[i - l] == G[i + l]) { n l++; n } n if (l + i > m) { n m = l + i; n k = i; n } n L[i] = l; n res += l; n } n return (res - N - 1) >> 1; n } n int main() { n scanf( %d%d n , &N, &M); n long long h = 1; n for (int i = 0; i < 26; i++) { n h = h * bas % mod; n H[i] = h; n } n for (int i = 1; i <= N; i++) { n scanf( %s , C[i] + 1); n for (int j = 1; j <= M; j++) { n C[i][j] -= a ; n W[i][j][j] = H[C[i][j]]; n for (int k = j - 1; k > 0; k--) { n W[i][k][j] = W[i][k + 1][j] + H[C[i][k]]; n if (W[i][k][j] >= mod) { n W[i][k][j] -= mod; n } n } n memset(S, 0, sizeof(S)); n int cnt = 0; n for (int k = j; k > 0; k--) { n S[C[i][k]]++; n if (S[C[i][k]] & 1) { n cnt++; n } else { n cnt--; n } n if (cnt > 1) { n W[i][k][j] = -1; n } n } n } n } n long long ANS = 0; n for (int j = 1; j <= M; j++) { n for (int k = j; k <= M; k++) { n memset(G, 0, sizeof(G)); n G[0] = -1; n G[(N + 1) << 1] = -1; n for (int i = 1; i <= N; i++) { n G[i << 1] = W[i][j][k]; n } n ANS += manacher((N << 1) | 1); n } n } n printf( %lld , ANS); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n typedef long long lo; n typedef vector vl; n typedef vector vll; n typedef vector vvl; n template n ostream &operator<<(ostream &o, vector v) { n if (v.size() > 0) o << v[0]; n for (unsigned i = 1; i < v.size(); i++) o << << v[i]; n return o << n ; n } n template n ostream &operator<<(ostream &o, pair p) { n return o << ( << p.first << , << p.second << ) ; n } n template n istream &operator>>(istream &in, vector &v) { n for (unsigned i = 0; i < v.size(); i++) in >> v[i]; n return in; n } n template n istream &operator>>(istream &in, pair &p) { n in >> p.first; n in >> p.second; n return in; n } n string s; n lo len[203][2]; n lo dp[203][203][203][2]; n lo cal(string &t) { n for (lo i = t.size(); i > 0; i--) { n if (s.substr(0, i) == t.substr(t.size() - i, i)) return i; n } n return 0; n } n void add(lo &a, lo b) { n a += b; n if (a >= 1000000007) a -= 1000000007; n if (a < 0) a += 1000000007; n } n int main() { n std::ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cout.precision(20); n lo n, ssz; n cin >> n >> s; n ssz = s.size(); n if (s[0] == ( ) n len[0][0] = 1; n else n len[0][1] = 1; n string pref; n for (lo i = (0); i < (lo)ssz; i++) { n pref += s[i]; n pref += ( ; n len[i + 1][0] = cal(pref); n pref.pop_back(); n pref += ) ; n len[i + 1][1] = cal(pref); n pref.pop_back(); n } n dp[0][0][0][0] = 1; n for (lo i = (0); i < (lo)2 * n; i++) { n for (lo(j) = 0; (j) < (n + 1); (j)++) { n for (lo(pos) = 0; (pos) < (ssz + 1); (pos)++) { n for (lo(f) = 0; (f) < (2); (f)++) { n if (dp[i][j][pos][f] == 0) continue; n if (j + 1 <= n) n add(dp[i + 1][j + 1][len[pos][0]][f | (len[pos][0] == ssz)], n dp[i][j][pos][f]); n if (j > 0) n add(dp[i + 1][j - 1][len[pos][1]][f | (len[pos][1] == ssz)], n dp[i][j][pos][f]); n } n } n } n } n lo ans = 0; n for (lo i = (0); i < (lo)ssz + 1; i++) add(ans, dp[2 * n][0][i][1]); n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void checkMax(T& a, const T& b) { n if (a < b) a = b; n } n template n inline void checkMin(T& a, const T& b) { n if (a > b) a = b; n } n const int kMod = 1000000007; n template n inline void addMod(U& x, const V y) { n x += y; n if (x >= kMod) { n x -= kMod; n } n } n template n struct CombinationTable { n CombinationTable() { init(); } n static long long table[N + 1][N + 1]; n static void init() { n table[0][0] = 1; n for (int i = 1; i <= N; ++i) { n table[i][0] = table[i][i] = 1; n for (int j = 1; j < i; ++j) { n table[i][j] = table[i - 1][j] + table[i - 1][j - 1]; n } n } n } n }; n template n long long CombinationTable::table[N + 1][N + 1]; n CombinationTable<40> comb_tbl; n long long n, t; n void go() { n if ((t & -t) != t) { n puts( 0 ); n return; n } n ++n; n int tt = 1; n while (t >>= 1) ++tt; n int num_one; n long long tmp = n; n do { n num_one += (tmp & 1); n } while (tmp >>= 1); n long long ans = (tt == num_one); n for (int n___LINE__ = (50), i = 0; i < n___LINE__; ++i) { n if (n & 1) { n --num_one; n if (num_one <= tt && i >= 0 && tt >= num_one && tt - num_one <= i) { n ans += comb_tbl.table[i][tt - num_one]; n } n } n n >>= 1; n } n if (tt == 1) --ans; n cout << ans << endl; n } n int main() { n cin >> n >> t; n go(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[100069], f[100069], p10[10]; n int main() { n long long t, rr, k, i, p, z, pp, ppp, zzz; n p10[0] = 1; n for (i = 1; i < 10; i++) { n p10[i] = p10[i - 1] * 10; n } n for (i = 1; 1; i++) { n f[i] = f[i - 1]; n for (k = i; k > 0; k /= 10) { n f[i]++; n } n a[i] = a[i - 1] + f[i]; n if (a[i] > 1000000000) { n break; n } n } n scanf( %lld , &t); n for (rr = 0; rr < t; rr++) { n scanf( %lld , &k); n p = lower_bound(a, a + 21837, k) - a; n pp = k - a[p - 1]; n for (i = 1; i <= 5; i++) { n if (pp <= 9 * p10[i - 1] * i) { n z = (pp - 1) / i + p10[i - 1]; n ppp = i - (pp - 1) % i; n break; n } n pp -= 9 * p10[i - 1] * i; n } n for (; ppp > 1; ppp--, z /= 10) n ; n zzz = z % 10; n printf( %lld n , zzz); n } n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream& operator<<(ostream& out, const pair p) { n out << ( << p.first << , << p.second << ) ; n return out; n } n template n ostream& operator<<(ostream& out, const vector& v) { n for (auto a : v) out << a << ; n return out; n } n template n ostream& operator<<(ostream& out, const set& S) { n for (auto a : S) cout << a << ; n return out; n } n template n ostream& operator<<(ostream& out, const multiset& S) { n for (auto a : S) cout << a << ; n return out; n } n template n ostream& operator<<(ostream& out, const map& M) { n for (auto m : M) cout << ( << m.first << -> << m.second << ) ; n return out; n } n template n pair operator+(pair a, pair b) { n return make_pair(a.first + b.first, a.second + b.second); n } n template n pair operator-(pair a, pair b) { n return make_pair(a.first - b.first, a.second - b.second); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int n; n cin >> n; n cout << n + n / 2 << endl; n return 0; n } n "} +{"func_code_string": "#include n inline long long rd() { n long long _x = 0; n int _ch = getchar(), _f = 1; n for (; !isdigit(_ch) && (_ch != - ) && (_ch != EOF); _ch = getchar()) n ; n if (_ch == - ) { n _f = 0; n _ch = getchar(); n } n for (; isdigit(_ch); _ch = getchar()) _x = _x * 10 + _ch - 0 ; n return _f ? _x : -_x; n } n void write(long long _x) { n if (_x >= 10) n write(_x / 10), putchar(_x % 10 + 0 ); n else n putchar(_x + 0 ); n } n inline void wrt(long long _x, char _p) { n if (_x < 0) putchar( - ), _x = -_x; n write(_x); n if (_p) putchar(_p); n } n int n, m; n char s[1005][1005]; n bool flag1, flag2; n bool vis[1005][1005]; n void dfs(int x, int y) { n if (vis[x][y] || s[x][y] != # || x == 0 || y == 0 || x == n + 1 || n y == m + 1) n return; n vis[x][y] = 1; n dfs(x + 1, y), dfs(x, y + 1); n dfs(x - 1, y), dfs(x, y - 1); n } n int main() { n n = rd(), m = rd(); n for (int i = 1; i <= n; i++) { n scanf( %s , s[i] + 1); n } n for (int i = 1; i <= n; i++) { n bool tag = 0; n for (int j = 1; j <= m; j++) { n if (s[i][j] == # ) tag = 1; n } n flag1 |= !tag; n } n for (int i = 1; i <= m; i++) { n bool tag = 0; n for (int j = 1; j <= n; j++) { n if (s[j][i] == # ) tag = 1; n } n flag2 |= !tag; n } n if (((!flag1) && (flag2)) || ((flag1) && (!flag2))) { n printf( -1 n ); n return 0; n } n bool flag = 0; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n if (s[i][j] == # ) { n int t = j; n while (s[i][t] == # ) t++; n for (int k = t; k <= m; k++) n if (s[i][k] == # ) flag = 1; n } n } n } n for (int i = 1; i <= m; i++) { n for (int j = 1; j <= n; j++) { n if (s[j][i] == # ) { n int t = j; n while (s[t][i] == # ) t++; n for (int k = t; k <= n; k++) n if (s[k][i] == # ) flag = 1; n } n } n } n if (flag) { n printf( -1 n ); n return 0; n } n int cnt = 0; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) n if (s[i][j] == # && !vis[i][j]) { n dfs(i, j); n cnt++; n } n } n wrt(cnt, n ); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, l, r; n cin >> n >> l >> r; n long long int dp[n][3]; n long long int a = r / 3 - (l - 1) / 3; n long long int b = (r + 2) / 3 - (l + 1) / 3; n long long int c = (r + 1) / 3 - l / 3; n dp[0][0] = r / 3 - (l - 1) / 3; n dp[0][1] = (r + 2) / 3 - (l + 1) / 3; n dp[0][2] = (r + 1) / 3 - l / 3; n for (int i = 1; i < n; i++) { n dp[i][0] = n (dp[i - 1][0] * a + dp[i - 1][1] * c + dp[i - 1][2] * b) % 1000000007; n dp[i][1] = n (dp[i - 1][0] * b + dp[i - 1][1] * a + dp[i - 1][2] * c) % 1000000007; n dp[i][2] = n (dp[i - 1][0] * c + dp[i - 1][1] * b + dp[i - 1][2] * a) % 1000000007; n } n cout << dp[n - 1][0]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, n, a[1000], d; n cin >> t; n while (t--) { n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n sort(a, a + n); n d = 0; n for (int i = 1; i < n; i++) { n if (a[i] - a[i - 1] <= 1) { n d++; n } n } n if (d) n cout << 2 << endl; n else n cout << 1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int p[100]; n char mm[100]; n int main() { n while (scanf( %d , &n) != EOF) { n scanf( %s , &mm); n int len = strlen(mm); n m = 0; n for (int i = 0; i < len; ++i) m = m * 10 + (mm[i] - 0 ); n if (n == 0) { n if (strlen(mm) != 1) n puts( WRONG_ANSWER ); n else if (m == 0) n puts( OK ); n else n puts( WRONG_ANSWER ); n } else { n if (mm[0] == 0 ) { n puts( WRONG_ANSWER ); n return 0; n } n int x = n; n memset(p, 0, sizeof(p)); n while (x > 0) { n p[x % 10]++; n x /= 10; n } n int now = 0; n for (int i = 1; i <= 9; ++i) n if (p[i]) { n now = i; n p[i]--; n break; n } n for (int i = 0; i <= 9; ++i) { n while (p[i]) { n now = now * 10 + i; n p[i]--; n } n } n if (now == m) n puts( OK ); n else n puts( WRONG_ANSWER ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MX_N = 3e5 + 5; n const int MX_M = 3e5 + 5; n int N, M, D[MX_N]; n vector> al[MX_N]; n int vis[MX_N], sumD; n vector edges; n void dfs(int u, int p = 0, int pe = 0) { n vis[u] = 1; n for (auto v : al[u]) n if (!vis[v.first]) { n dfs(v.first, u, v.second); n } n if (D[u]) edges.push_back(pe), D[p] ^= 1; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> N >> M; n for (int i = (1); i <= (N); ++i) { n cin >> D[i]; n if (D[i] >= 0) sumD += D[i]; n } n for (int i = (1); i <= (M); ++i) { n int U, V; n cin >> U >> V; n al[U].emplace_back(V, i); n al[V].emplace_back(U, i); n } n for (int i = (1); i <= (N); ++i) n if (D[i] == -1) { n if (sumD & 1) n D[i] = 1, ++sumD; n else n D[i] = 0; n } n if (sumD & 1) n cout << -1; n else { n dfs(1); n cout << ((int)(edges).size()) << n ; n sort(edges.begin(), edges.end()); n for (int& e : edges) cout << e << ; n } n } n "} +{"func_code_string": "#include n long long RemoveZeros(long long a) { n long long temp; n long long x = 0; n long long i = 10; n while (a > 0) { n if (a % 10 != 0) { n temp = (a % 10) * i; n x += temp; n i *= 10; n } n a /= 10; n } n return x / 10; n } n using namespace std; n int main() { n long long a, b, c; n cin >> a >> b; n c = a + b; n long long a1 = RemoveZeros(a); n long long b1 = RemoveZeros(b); n long long c1 = RemoveZeros(c); n if (a1 + b1 == c1) n cout << YES ; n else n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using li = long long; n using ld = long double; n using pii = pair; n const int INF = 1e9 + 13; n const int N = 2e5 + 13; n const int M = 1e9 + 7; n const int B = 600; n const int A = 256; n const ld e = 1e-8; n const int LOGN = 20; n mt19937 rnd(time(0)); n void solve() { n int n, m; n cin >> n >> m; n vector a(n, false); n for (int i = 0; i < m; i++) { n int x, y, z; n cin >> x >> y >> z; n y--; n a[y] = true; n } n int v = -1; n for (int i = 0; i < n; i++) n if (!a[i]) v = i; n for (int i = 0; i < n; i++) { n if (i != v) cout << v + 1 << << i + 1 << n ; n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int t = 1; n cin >> t; n while (t--) solve(); n } n "} +{"func_code_string": "#include n #pragma GCC optimize 03 n using namespace std; n const int N = 1e5 + 5; n const int mod = 1e9 + 7; n const int inf = 1e9 + 9; n pair ans[1004]; n signed main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n string s; n cin >> s; n int c1 = 0, c2 = 0; n for (int i = 0; i < s.length(); i++) { n if (s[i] == 0 ) { n if (c1 == 0) { n c1 = 1; n ans[i].first = 3, ans[i].second = 1; n } else { n c1 = 0; n ans[i].first = 1, ans[i].second = 1; n } n } else { n if (c2 == 0) { n c2 = 1; n ans[i].first = 1, ans[i].second = 3; n } else { n c2 = 0; n ans[i].first = 1, ans[i].second = 1; n } n } n } n for (int i = 0; i < s.length(); i++) n cout << ans[i].first << << ans[i].second << n ; n return 0; n } n "} +{"func_code_string": "#include n const int MAX_N = 1e5 + 5; n int n, m; n char str[MAX_N], nxt[256]; n bool chk[256], vis[256], not_root[256], flag; n std::vector ans; n void dfs(char c) { n if (!vis[c]) { n vis[c] = true; n ans.push_back(c); n if (nxt[c]) dfs(nxt[c]); n } else n flag = true; n } n int main() { n scanf( %d , &n); n while (n--) { n scanf( %s , str); n m = strlen(str); n for (int i = 0; i < m; ++i) chk[str[i]] = true; n for (int i = 0; i + 1 < m; ++i) { n if (nxt[str[i]] == 0) n nxt[str[i]] = str[i + 1]; n else if (nxt[str[i]] != str[i + 1]) { n printf( NO n ); n return 0; n } n not_root[str[i + 1]] = true; n } n } n for (char i = a ; i <= z ; ++i) n if (!not_root[i] && chk[i]) dfs(i); n for (char i = a ; i <= z ; ++i) flag |= chk[i] != vis[i]; n if (flag) { n printf( NO n ); n return 0; n } n for (char c : ans) printf( %c , c); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6; n int A[5]; n int main() { n ios_base::sync_with_stdio(0); n int a, b, n, T, cas = 0; n cin >> T; n while (T--) { n cin >> A[0] >> A[1] >> A[2]; n int cnt = 0; n sort(A, A + 3, greater()); n for (int i = 0; i < 3; ++i) { n if (A[i]) A[i]--, cnt++; n } n if (A[0] && A[1]) A[0]--, A[1]--, cnt++; n if (A[0] && A[2]) A[0]--, A[2]--, cnt++; n if (A[1] && A[2]) A[1]--, A[2]--, cnt++; n if (A[0] && A[1] && A[2]) { n ++cnt; n } n cout << cnt << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct S { n int a, b; n S() {} n S(int _a, int _b) { n a = _a; n b = _b; n } n const bool operator<(const S &o) const { return a < o.a; } n }; n string exm; n inline void exf(void) { n cout << exm << n ; n exit(0); n } n template n inline void showAll(vector &v, string sep = ) { n for (T &here : v) cout << here << sep; n } n template n inline void showAll(T arr[], int st, int end, string sep = ) { n for (int i = st; i <= end; i++) cout << arr[i] << sep; n } n template n inline vector int_seperation(T N, int d = 10) { n vector v; n while (N) { n v.push_back(N % d); n N /= d; n } n reverse(v.begin(), v.end()); n return v; n } n const int SIZE = 500009; n char s[SIZE], t[SIZE]; n int main() { n int n, k; n scanf( %d %d , &n, &k); n scanf( %s %s , s + 1, t + 1); n long long INF = 1e18, ans = 0, diff = 0; n for (int i = 1; i <= n; i++) { n diff = 2 * diff + (t[i] - s[i]); n diff = min(diff, INF); n ans += min(diff + 1, (long long)k); n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void qmax(int &x, int y) { n if (x < y) x = y; n } n void qmin(int &x, int y) { n if (x > y) x = y; n } n inline long long read() { n char s; n long long k = 0, base = 1; n while ((s = getchar()) != - && s != EOF && !(isdigit(s))) n ; n if (s == EOF) exit(0); n if (s == - ) base = -1, s = getchar(); n while (isdigit(s)) { n k = k * 10 + (s ^ 0 ); n s = getchar(); n } n return k * base; n } n inline void write(int x) { n static char cnt, num[15]; n cnt = 0; n if (!x) { n printf( 0 ); n return; n } n for (; x; x /= 10) num[++cnt] = x % 10; n for (; cnt; putchar(num[cnt--] + 48)) n ; n } n const int maxn = 2020; n int n, k; n char ch[maxn][maxn]; n int a[maxn][maxn], Max; n char d[maxn + maxn]; n bool vis[maxn][maxn]; n int main() { n n = read(); n k = read(); n for (int i = 1; i <= n; i++) { n scanf( %s , ch[i] + 1); n } n if (k >= (2 * n - 1)) { n for (int i = 1; i <= n + n - 1; i++) putchar( a ); n return 0; n } n memset(a, 0x3f3f, sizeof(a)); n a[1][1] = 1; n if (ch[1][1] == a ) a[1][1] = 0; n for (int l = 2; l <= n + n; l++) { n for (int i = 1, j; i <= n; i++) { n j = l - i; n if (j <= 0) break; n if (j > n) continue; n if (i > n) continue; n if (j + 1 <= n) qmin(a[i][j + 1], a[i][j] + (ch[i][j + 1] != a )); n if (i + 1 <= n) qmin(a[i + 1][j], a[i][j] + (ch[i + 1][j] != a )); n if (a[i][j] <= k) Max = max(Max, l); n } n } n if (Max == n + n) { n for (int i = 1; i <= n + n - 1; i++) putchar( a ); n return 0; n } n bool flag = false; n if (!Max) Max = 2, vis[1][1] = true, d[2] = ch[1][1], flag = true; n for (int i = 1, j; i <= n; i++) { n j = Max - i; n if (j <= 0) break; n if (j > n) continue; n if (a[i][j] <= k) vis[i][j] = true; n } n for (int l = Max; l <= n + n; l++) { n char z = z ; n for (int i = 1, j; i <= n; i++) { n j = l - i; n if (j <= 0) break; n if (j > n) continue; n if (!vis[i][j]) continue; n if (j + 1 <= n) z = min(z, ch[i][j + 1]); n if (i + 1 <= n) z = min(z, ch[i + 1][j]); n } n d[l + 1] = z; n for (int i = 1, j; i <= n; i++) { n j = l - i; n if (j <= 0) break; n if (j > n) continue; n if (!vis[i][j]) continue; n if (j + 1 <= n && ch[i][j + 1] == z) vis[i][j + 1] = true; n if (i + 1 <= n && ch[i + 1][j] == z) vis[i + 1][j] = true; n } n } n if (flag) Max--; n for (int i = 2; i <= Max; i++) d[i] = a ; n for (int i = 2; i <= n + n; i++) { n putchar(d[i]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long read() { n long long a = 0; n char c = getchar(); n while (c > 9 || c < 0 ) c = getchar(); n while ( 0 <= c && c <= 9 ) { n a = a * 10 + c - 48; n c = getchar(); n } n return a; n } n struct data { n long long x, y, c; n data(long long X = 0, long long Y = 0, long long C = 0) { n x = X; n y = Y; n c = C; n } n } w[2005], e[2005]; n long long n, k, L; n bool cmp(data a, data b) { return a.x < b.x; }; n bool cmp2(data a, data b) { return a.y < b.y; } n long long nxt[2005], f[2005]; n multiset Set[2005]; n long long sum[2005 << 2], Max[2005 << 2], tag[2005 << 2]; n void pushup(long long x) { n sum[x] = (sum[(x << 1)] + sum[(x << 1 | 1)]) % 1000000007; n assert(Max[(x << 1)] <= Max[(x << 1 | 1)]); n Max[x] = Max[(x << 1 | 1)]; n } n void build(long long x, long long l, long long r) { n tag[x] = 0; n if (l == r) { n sum[x] = f[l] * (e[l].y - e[l - 1].y) % 1000000007; n Max[x] = f[l]; n return; n } n build((x << 1), l, ((l + r) >> 1)); n build((x << 1 | 1), ((l + r) >> 1) + 1, r); n pushup(x); n } n void ptag(long long x, long long l, long long r, long long v) { n assert(Max[x] <= v); n sum[x] = v * (e[r].y - e[l - 1].y) % 1000000007; n tag[x] = Max[x] = v; n } n void pushdown(long long x, long long l, long long r) { n if (tag[x]) { n ptag((x << 1), l, ((l + r) >> 1), tag[x]); n ptag((x << 1 | 1), ((l + r) >> 1) + 1, r, tag[x]); n tag[x] = 0; n } n } n void chkmax(long long x, long long l, long long r, long long b, long long e, n long long v) { n if (r < b || l > e) return; n if (l == r && Max[x] > v) return; n if (Max[x] <= v && b <= l && r <= e) { n ptag(x, l, r, v); n return; n } n bool flag = (v > Max[(x << 1)]); n pushdown(x, l, r); n chkmax((x << 1), l, ((l + r) >> 1), b, e, v); n if (flag) chkmax((x << 1 | 1), ((l + r) >> 1) + 1, r, b, e, v); n pushup(x); n } n signed main() { n n = read(); n k = read(); n L = read(); n for (long long i = 1; i <= n; ++i) { n w[i].x = read() + 1; n w[i].y = read() + 1; n w[i].c = read(); n e[i] = w[i]; n } n sort(w + 1, w + 1 + n, cmp); n sort(e + 1, e + 1 + n, cmp2); n e[n + 1].y = L + 1; n w[n + 1].x = w[n + 2].x = L + 1; n w[n + 1].y = L + 1; n long long ans = 0; n for (long long i = n; i; --i) { n long long tmp = (w[i].x - w[i - 1].x); n if (!tmp) continue; n multiset S; n S.clear(); n for (long long i = 1; i <= k; ++i) { n S.insert(L + 1), nxt[i] = L + 1; n Set[i].clear(); n Set[i].insert(L + 1); n Set[i].insert(0); n } n for (long long j = n; j; --j) { n if (e[j].x >= w[i].x) { n S.erase(S.find(nxt[e[j].c])); n nxt[e[j].c] = e[j].y; n S.insert(nxt[e[j].c]); n Set[e[j].c].insert(e[j].y); n } n f[j] = (*(--S.end())); n } n build(1, 1, n); n for (long long j = n + 1; j > i; --j) { n if (w[j].c) { n assert(Set[w[j].c].find(w[j].y) != Set[w[j].c].end()); n Set[w[j].c].erase(Set[w[j].c].find(w[j].y)); n multiset::iterator it = --Set[w[j].c].upper_bound(w[j].y), n ir = it; n ++ir; n long long ll = lower_bound(e, e + 1 + n, data(0, *it, 0), cmp2) - e; n if (ll) assert(e[ll].y != e[ll - 1].y); n chkmax(1, 1, n, ll + 1, n, *ir); n } n long long res = ((L + 1) * e[n].y - sum[1] + 1000000007) % 1000000007; n ans = n (ans + (res * tmp % 1000000007 * (w[j].x - w[j - 1].x))) % 1000000007; n } n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC target( sse4 ) n using namespace std; n using ii = pair; n using ll = long long; n const int N = 1e5 + 5; n const int mod = 1e9 + 7; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int a, b; n cin >> a >> b; n vector ans1, ans2; n ll limit = 0; n for (; limit * (limit + 1) / 2 <= a + b; limit++) n ; n cerr << limit << n ; n for (int i = --limit; i >= 1; i--) { n if (a >= b) n ans1.push_back(i), a -= i; n else n ans2.push_back(i), b -= i; n } n cout << ans1.size() << n ; n for (auto x : ans1) cout << x << ; n cout << n ; n cout << ans2.size() << n ; n for (auto x : ans2) cout << x << ; n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 10; n int t; n int n; n struct node { n long long id, val; n bool flag; n friend bool operator<(node a, node b) { n if (a.val == b.val) return a.flag == false; n return a.val > b.val; n } n }; n int main() { n while (~scanf( %d , &n)) { n priority_queue q; n long long num; n scanf( %lld , &num); n node nxt; n nxt.id = 1, nxt.val = num, nxt.flag = false; n q.push(nxt); n long long ans = 0; n for (int i = 2; i <= n; ++i) { n scanf( %lld , &num); n nxt.flag = false; n if (q.top().val < num) { n node now = q.top(); n q.pop(); n ans = ans + num - now.val; n if (now.flag) { n now.flag = false; n q.push(now); n } n nxt.flag = true; n } n nxt.id = i; n nxt.val = num; n q.push(nxt); n } n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7, inf = 1061109567; n const long long infll = 4557430888798830399; n const int N = 2e5 + 5; n int n, q, a[N], cnt[N]; n bool last[N], first[N]; n vector app[N]; n bool start[N]; n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> q; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) app[a[i]].push_back(i); n for (int i = 0; i < N; i++) n if (app[i].size()) { n first[app[i][0]] = 1; n last[app[i].back()] = 1; n } n int thing = 0; n memset(start, 0, sizeof start); n start[0] = 1; n for (int i = 0; i < n; i++) { n if (first[i]) thing++; n if (last[i]) thing--; n if (!thing) start[i + 1] = 1; n } n int ans = 0; n int cur = 0; n while (cur < n) { n int nxt = n - 1; n for (int i = cur + 1; i < n; i++) n if (start[i]) { n nxt = i - 1; n break; n } n int lolMax = 0; n for (int i = cur; i < nxt + 1; i++) { n cnt[a[i]]++; n lolMax = max(lolMax, cnt[a[i]]); n } n ans += lolMax; n for (int i = cur; i < nxt + 1; i++) cnt[a[i]]--; n cur = nxt + 1; n } n cout << n - ans; n return 0; n } n "} +{"func_code_string": "#include n const int MAXN = (int)1e5 + 5; n const int MODN = (int)1e9 + 7; n int inf = 0x3f3f3f3f; n using namespace std; n char str[MAXN]; n int num[MAXN]; n int a[MAXN]; n int vis[MAXN]; n int main() { n int n, m; n while (scanf( %d , &n) != EOF) { n memset(vis, 0, sizeof(vis)); n int sum = 0; n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n sum += a[i]; n } n int it = sum * 2 / n; n for (int i = 0; i < n; i++) { n if (vis[i] == 0) { n vis[i] = 1; n printf( %d , i + 1); n for (int j = 0; j < n; j++) { n if (vis[j] == 0 && a[j] + a[i] == it) { n vis[j] = 1; n printf( %d n , j + 1); n break; n } n } n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int cntinv(vector &a) { n int n = a.size(); n int ans = 0; n for (int i = 0; i < n; ++i) { n for (int j = i + 1; j < n; ++j) { n if (a[j] < a[i]) ans++; n } n } n return ans; n } n int main(int argc, char const *argv[]) { n int n; n scanf( %d , &n); n vector a(n); n for (int i = 0; i < n; ++i) { n scanf( %d , &a[i]); n } n int pv = (cntinv(a) & 1); n int m; n scanf( %d , &m); n while (m--) { n int l, r, swaps; n scanf( %d , &l); n scanf( %d , &r); n l--; n r--; n swaps = (r - l + 1) >> 1; n int cur = pv; n if (swaps & 1) cur = 1 - cur; n if (cur) n printf( odd n ); n else n printf( even n ); n pv = cur; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int a[100010], d[100010]; n int main() { n int ans = 1, i, j; n int temp; n int dlen = 0, mx = 0; n while (~scanf( %d , &n)) { n for (i = 0; i != n; ++i) { n dlen = mx = 0; n scanf( %d , &temp); n for (j = 2; j * j <= temp; j++) { n if (temp % j == 0) { n d[dlen++] = j; n if (a[j] + 1 > mx) mx = a[j] + 1; n while (temp % j == 0) temp /= j; n } n } n if (temp > 1) { n d[dlen++] = temp; n if (a[temp] + 1 > mx) mx = a[temp] + 1; n } n for (j = 0; j != dlen; j++) a[d[j]] = mx; n if (ans < mx) ans = mx; n } n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct UF { n vector par, sz; n UF(int n) { n sz.resize(n); n par.resize(n); n for (int i = 0; i < n; i++) sz[i] = 1, par[i] = i; n } n int find(int x) { n if (par[x] == x) return x; n return par[x] = find(par[x]); n } n void unite(int x, int y) { n x = find(x); n y = find(y); n if (x == y) return; n if (sz[x] > sz[y]) swap(x, y); n sz[y] += sz[x]; n par[x] = y; n } n bool same(int x, int y) { return find(x) == find(y); } n }; n int main() { n int i, j, n, m1, m2; n cin >> n >> m1 >> m2; n UF uf1(n), uf2(n); n for (i = 0; i < m1; i++) { n int a, b; n cin >> a >> b; n a--; n b--; n uf1.unite(a, b); n } n for (i = 0; i < m2; i++) { n int a, b; n cin >> a >> b; n a--; n b--; n uf2.unite(a, b); n } n vector> p; n for (i = 0; i < n; i++) { n for (j = 0; j < n; j++) { n if (!uf1.same(i, j)) p.push_back({i, j}); n } n } n int ans = 0; n vector> ansv; n for (i = 0; i < p.size(); i++) { n int x = p[i].first, y = p[i].second; n if (!uf1.same(x, y) && !uf2.same(x, y)) { n uf1.unite(x, y); n uf2.unite(x, y); n ans++; n ansv.push_back({x, y}); n } n } n cout << ans << endl; n for (auto p : ansv) cout << p.first + 1 << << p.second + 1 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = (int)1e6 + 100; n const long long inf = (1ll << 60); n const int mod2 = (int)998244353; n const int mod = (int)1e9 + 7; n int n, m; n vector b; n vector c; n void add(long long x) { n for (int i = 0; i < b.size(); i++) { n if (c[i] & x) { n x ^= b[i]; n } n } n if (x > 0) { n long long y = 1; n while (!(x & y)) y *= 2; n for (int i = 0; i < b.size(); i++) { n if (b[i] & y) { n b[i] ^= x; n } n } n b.push_back(x); n c.push_back(y); n } n } n long long d[maxn]; n int u[maxn]; n vector > g[maxn]; n vector ord; n void dfs(int v) { n u[v] = 1; n ord.push_back(v); n for (auto to : g[v]) { n if (u[to.first] == 0) { n d[to.first] = d[v] ^ to.second; n dfs(to.first); n } else if (u[to.first] == 1) { n add(d[v] ^ d[to.first] ^ to.second); n } n } n u[v] = 2; n } n void solve() { n cin >> n >> m; n for (int i = 0; i < m; i++) { n long long x, y, z; n cin >> x >> y >> z; n g[x].push_back({y, z}); n g[y].push_back({x, z}); n } n long long ans = 0; n for (int i = 1; i <= n; i++) { n if (u[i]) continue; n b.clear(); n c.clear(); n ord.clear(); n dfs(i); n long long sz = ord.size(); n long long C = sz * (sz - 1) / 2; n C %= mod; n for (int j = 1; j < b.size(); j++) C = (C * 2) % mod; n for (int j = 0; j <= 60; j++) { n int ok = 0; n long long cur = (1ll << j); n for (long long x : b) { n if (x & cur) { n ok = 1; n } n } n if (ok) { n ans = (ans + cur % mod * C % mod) % mod; n } else { n long long cnt = 0; n for (int v : ord) { n if (d[v] & cur) { n cnt++; n } n } n long long cur_ans = cnt * (sz - cnt) % mod; n cur_ans = (cur % mod * cur_ans) % mod; n for (int j = 0; j < b.size(); j++) { n cur_ans = (cur_ans * 2) % mod; n } n ans += cur_ans; n ans %= mod; n } n } n } n cout << ans << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t = 1; n for (int i = 1; i <= t; i++) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int X = 0, w = 1; n char c = getchar(); n while (c < 0 || c > 9 ) { n if (c == - ) w = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) X = X * 10 + c - 0 , c = getchar(); n return X * w; n } n const int N = 1000 + 10; n int n, m, a[N]; n double f[N][N]; n int main() { n n = read(), m = read(); n for (register int i = 1; i <= n; ++i) a[i] = read(); n for (register int i = 1; i <= n; ++i) n for (register int j = 1; j <= n; ++j) f[i][j] = (a[i] > a[j]); n while (m--) { n int x = read(), y = read(); n for (register int i = 1; i <= n; ++i) { n f[x][i] = f[y][i] = (f[x][i] + f[y][i]) / 2; n f[i][x] = f[i][y] = 1 - f[x][i]; n } n f[x][y] = f[y][x] = 0.5; n } n double ans = 0; n for (register int i = 1; i <= n; ++i) n for (register int j = i + 1; j <= n; ++j) ans += f[i][j]; n printf( %.9lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char orz[500001]; n int gg[500001]; n int t; n int main() { n cin >> t; n while (t--) { n int n, q; n scanf( %d%d , &n, &q); n scanf( %s , orz + 1); n int rrr = 1; n for (int i = 1; i <= n; i++) { n if (orz[i] == + ) n gg[i] = gg[i - 1] + 1 * rrr; n else n gg[i] = gg[i - 1] - 1 * rrr; n rrr *= -1; n } n while (q--) { n int l, r; n scanf( %d%d , &l, &r); n int eee = abs(gg[r] - gg[l - 1]); n if (eee != 0) { n if (eee % 2 == 1) eee = 1; n if (eee % 2 == 0) eee = 2; n } n cout << eee << endl << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n struct debugger { n template n debugger& operator,(const T& v) { n cerr << v << ; n return *this; n } n } dbg; n void solve() { n int n, m; n cin >> n >> m; n for (int i = 0; i < 200; i++) cout << 9 ; n cout << endl; n for (int i = 0; i < 200; i++) cout << 9 ; n for (int i = 0; i < 199; i++) cout << 0 ; n cout << 1 ; n } n int main() { n ios_base::sync_with_stdio(false); n int t = 1, num = 1; n while (t--) { n ; n ; n solve(); n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1e9 + 7; n vector> mul(vector> A, n vector> B) { n int n = A.size(); n vector> res(n, vector(n)); n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n for (int k = 0; k < n; k++) { n res[i][j] = (res[i][j] + A[i][k] * B[k][j]) % MOD; n } n } n } n return res; n } n vector> mexp(vector> M, long long e) { n if (e == 1) return M; n if (e % 2) return mul(M, mexp(M, e - 1)); n vector> R = mexp(M, e / 2); n return mul(R, R); n } n int main() { n long long n, m; n cin >> n >> m; n if (m > n) { n cout << 1 << endl; n return 0; n } n vector> M(m, vector(m)); n M[0][0] = M[0][m - 1] = 1; n for (int i = 1; i < m; i++) M[i][i - 1] = 1; n vector> R = mexp(M, n - m + 1); n long long res = 0; n for (int i = 0; i < m; i++) res = (res + R[0][i]) % MOD; n cout << res << endl; n } n "} +{"func_code_string": "#include n using vi = std::vector; n using vvi = std::vector; n using pii = std::pair; n using vpii = std::vector; n using vvpii = std::vector; n using namespace std; n const long long int N = 2e6 + 10; n const long long int inf = 1e18 + 10; n const long double Pi = 3.14159265; n long long int n; n vi a; n long long int f(vi &a) { n long long int n = a.size(); n if (a.empty() == 1) return 0; n if (a.back() == 0) return a.size(); n long long int hig = 0; n for (long long int i = 0; i <= n - 1; i++) { n hig = max(hig, (long long int)log2(a[i])); n } n vi l, r; n for (long long int i = 0; i <= n - 1; i++) { n if ((long long int)log2(a[i]) < hig) n l.emplace_back(a[i]); n else n r.emplace_back(a[i] ^ (1 << (long long int)log2(a[i]))); n } n if (!(l.size() < r.size())) swap(l, r); n a = vi(); n if (l.size() == 0) return f(r); n return 1 + max(f(l), f(r)); n } n void solve() { n cin >> n; n a.resize(n); n for (long long int i = 1; i <= n; i++) cin >> a[i - 1]; n sort(a.begin(), a.end()); n cout << (a.size() - f(a)); n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n solve(); n return 0; n long long int xx = 0; n long long int t; n cin >> t; n while (t--) { n ; n solve(); n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[610000], i, j, k, l, n, m, p[610000], t, last, o, r, mid; n char c[610000]; n bool check(int mid) { n int tmp = 1e9, res = 0; n p[0] = mid; n m = last; n for (i = 1; i <= n; ++i) { n p[i] = p[i - 1] + a[i]; n if (p[i] == 0 && p[i - 1] == -1) m = max(m, i); n } n if (m == 0) return 1; n for (i = 1; i <= m; ++i) { n if (p[i - 1] == 0 && p[i] == -1) { n o = i; n tmp = min(tmp, res + (m - i) * 2); n } n if (p[i - 1] == -1 && p[i] == 0) { n if (i == m) tmp = min(tmp, res + m - o); n res += (i - o) * 2; n } n res++; n } n tmp = min(tmp, res - 1); n return tmp + 1 <= t; n } n int main() { n scanf( %d%d%s , &n, &t, c + 1); n for (i = 1; i <= n; ++i) a[i] = c[i] == H ? -1 : c[i] == S ? 1 : 0; n for (i = 1; i <= n; ++i) { n if (a[i] == -1) r++, last = i; n if (a[i] == 1) l--; n } n l += r; n if (l < 0) l = 0; n if (last > t) { n printf( -1 n ); n exit(0); n } n while (l <= r) { n mid = (l + r) / 2; n if (check(mid)) n r = mid - 1; n else n l = mid + 1; n } n printf( %d n , r + 1); n } n "} +{"func_code_string": "#include n using namespace std; n const int max_n = 2005; n string str[max_n]; n int dp[max_n][max_n][4]; n inline void solve() { n register int n, m, i, j, k; n long long ans = 0; n cin >> n >> m; n for (i = 0; i < n; ++i) cin >> str[i]; n for (i = 0; i < n; ++i) { n dp[i][0][0] = 1; n for (j = 1; j < m; ++j) { n if (str[i][j] == str[i][j - 1]) n dp[i][j][0] = dp[i][j - 1][0] + 1; n else n dp[i][j][0] = 1; n } n } n for (i = 0; i < n; ++i) { n dp[i][m - 1][1] = 1; n for (j = m - 2; j >= 0; --j) { n if (str[i][j] == str[i][j + 1]) n dp[i][j][1] = dp[i][j + 1][1] + 1; n else n dp[i][j][1] = 1; n } n } n for (j = 0; j < m; ++j) dp[0][j][2] = 1; n for (i = 1; i < n; ++i) { n for (j = 0; j < m; ++j) { n if (str[i][j] == str[i - 1][j]) n dp[i][j][2] = min(dp[i][j][0], min(dp[i][j][1], dp[i - 1][j][2] + 1)); n else n dp[i][j][2] = 1; n } n } n for (j = 0; j < m; ++j) dp[n - 1][j][3] = 1; n for (i = n - 2; i >= 0; --i) { n for (j = 0; j < m; ++j) { n if (str[i][j] == str[i + 1][j]) n dp[i][j][3] = min(dp[i][j][2], dp[i + 1][j][3] + 1); n else n dp[i][j][3] = 1; n ans += dp[i][j][3]; n } n } n ans += m; n cout << ans << endl; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[111111], b[111111]; n vector id[111111]; n int main() { n int N, M; n cin >> N >> M; n for (int i = 1; i <= N; i++) id[i].clear(); n for (int i = 0; i < M; i++) scanf( %d , a + i); n long long tot = 0; n for (int i = 1; i < M; i++) { n if (a[i] == a[i - 1]) continue; n id[a[i]].push_back(a[i - 1]); n id[a[i - 1]].push_back(a[i]); n tot += abs(a[i] - a[i - 1]); n } n long long d = 0; n for (int i = 1; i <= N; i++) { n sort(id[i].begin(), id[i].end()); n long long s = 0; n int k = id[i].size() / 2; n for (int j = 0; j < id[i].size(); j++) n s += abs(id[i][j] - id[i][k]) - abs(id[i][j] - i); n if (d > s) d = s; n } n cout << tot + d << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e5 + 5; n vector tim(N), pos(N), cur(N); n n int main() { n long long T, n, act, start, des, dir, ans, startTime; n cin>>T; n for(long long t = 1; t <= T; ++t) { n tim[0] = pos[0] = start = des = act = ans = startTime = 0; n cin>>n; n for(long long i = 1; i <= n; ++i) { n cin>>tim[i]>>pos[i]; n if(tim[i] >= act) { n cur[i] = des; n startTime = tim[i]; n act = tim[i] + abs(des - pos[i]); n start = des; n des = pos[i]; n } else { n dir = (start <= des) ? 1 : -1; n cur[i] = start + dir * (tim[i] - startTime); n } n } n cur[n+1] = des; n for(long long i = 1; i <= n; ++i) { n if(min(cur[i],cur[i+1]) <= pos[i] && pos[i] <= max(cur[i],cur[i+1])) { n ans += 1; n } n } n cout< n using namespace std; n int max_can; n pair red, blue; n int main() { n scanf( %d%d%d%d%d , &max_can, &red.first, &blue.first, &red.second, n &blue.second); n long long ans = 0; n int sq = (int)sqrt(max_can); n if (red.second >= sq) { n for (int cnt = 0;; ++cnt) { n if (red.second * cnt > max_can) break; n int can = max_can - red.second * cnt; n ans = max(ans, n cnt * 1ll * red.first + (can / blue.second) * 1ll * blue.first); n } n printf( %I64d n , ans); n return 0; n } else if (blue.second >= sq) { n for (int cnt = 0;; ++cnt) { n if (blue.second * cnt > max_can) break; n int can = max_can - blue.second * cnt; n ans = max(ans, n cnt * 1ll * blue.first + (can / red.second) * 1ll * red.first); n } n printf( %I64d n , ans); n return 0; n } else { n if (red.first * 1ll * blue.second < blue.first * 1ll * red.second) n swap(red, blue); n for (int cnt = 0; cnt <= sq; ++cnt) { n int weight = blue.second * cnt; n if (weight > max_can) break; n int can = max_can - weight; n ans = max(ans, n blue.first * 1ll * cnt + (can / red.second) * 1ll * red.first); n } n printf( %I64d n , ans); n return 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long read() { n long long x = 0, f = 0; n char ch = getchar(); n while (!isdigit(ch)) f |= (ch == - ), ch = getchar(); n while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); n return f ? -x : x; n } n inline void write(long long x) { n if (x < 0) x = -x, putchar( - ); n if (x >= 10) write(x / 10); n putchar(x % 10 + 0 ); n } n long long n, a[200005], tot[200005], tong[105], mx, mxat, now; n signed main() { n n = read(); n for (register long long i = 1; i <= n; i++) { n a[i] = read(); n now = a[i]; n while (now && now % 2 == 0) { n tot[i]++; n now /= 2; n } n tong[tot[i]]++; n if (tong[tot[i]] > mx) mx = tong[tot[i]], mxat = tot[i]; n } n write(n - mx); n puts( ); n for (register long long i = 1; i <= n; i++) n if (tot[i] != mxat) write(a[i]), putchar( ); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int loop, cnt = 1, max = 1; n scanf( %d , &loop); n int arr[loop]; n for (int i = 0; i < loop; i++) scanf( %d , &arr[i]); n for (int i = 1; i < loop; i++) { n if (arr[i - 1] >= arr[i]) { n cnt = 1; n } n if (arr[i - 1] < arr[i]) { n cnt++; n } n if (max < cnt) max = cnt; n } n printf( %d , max); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n multiset ms; n const int MAXN = 1000000; n int pos[MAXN], a[MAXN], b[MAXN], st[MAXN]; n int n, i, j, k, ans; n int main() { n scanf( %d , &n); n for (i = 1; i <= n; ++i) { n scanf( %d , &a[i]); n pos[a[i]] = i; n } n for (j = 1; j <= n; ++j) { n scanf( %d , &b[j]); n int diff = j - pos[b[j]]; n st[j] = diff; n ms.insert(diff); n } n for (i = 0; i < n; ++i) { n ans = n; n multiset::iterator it = ms.lower_bound(i); n if (it != ms.end()) ans = min(ans, abs(*(it)-i)); n if (it != ms.begin()) ans = min(ans, abs(*(--it) - i)); n cout << ans << endl; n ms.erase(ms.find(st[i + 1])); n int num = b[i + 1]; n ms.insert((i + n + 1) - pos[num]); n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( unroll-loops ) n using namespace std; n const long long N = 1000 + 5, L = 12, inf = LLONG_MAX; n long long n, m, k; n long long a[N][N], par[N * N], sz[N * N], res[N][N], hh, cnt; n bool mark[N][N], vis[N][N]; n long long mp[N * N]; n vector > vec, all; n set s; n long long H[] = {0, 0, -1, 1}; n long long G[] = {1, -1, 0, 0}; n inline void er(long long x) { n mp[x]--; n if (mp[x] == 0) { n s.erase(-x); n } n return; n } n inline void ad(long long x) { n mp[x]++; n if (mp[x] == 1) { n s.insert(-x); n } n return; n } n long long find(long long a) { n if (par[a] == a) return a; n return par[a] = find(par[a]); n } n inline void _union(long long a, long long b) { n a = find(a); n b = find(b); n if (a == b) return; n if (sz[a] < sz[b]) swap(a, b); n er(sz[a]); n er(sz[b]); n par[b] = a; n sz[a] += sz[b]; n ad(sz[a]); n return; n } n void dfs(long long x, long long y) { n vis[x][y] = 1; n all.push_back({x, y}); n for (long long k = 0; k < 4; k++) { n long long i = x + H[k], j = y + G[k]; n if (i >= 0 && j >= 0 && i < n && j < m) { n if (!vis[i][j] && a[i][j] >= hh) { n dfs(i, j); n } n } n } n return; n } n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(nullptr); n cout.tie(nullptr); n ; n cin >> n >> m >> k; n for (long long i = 0; i < n * m; i++) par[i] = i, sz[i] = 1; n s.insert(-1); n mp[1] = n * m; n for (long long i = 0; i < n; i++) n for (long long j = 0; j < m; j++) { n cin >> a[i][j]; n vec.push_back({a[i][j], i * m + j}); n } n sort(vec.begin(), vec.end(), greater >()); n long long ans = -1, xx = -1, yy = -1; n for (auto p : vec) { n long long x = p.second / m, y = p.second % m, h = p.first; n mark[x][y] = 1; n for (long long k = 0; k < 4; k++) { n long long i = x + H[k], j = y + G[k]; n if (i >= 0 && j >= 0 && i < n && j < m && mark[i][j]) { n _union(i * m + j, p.second); n } n } n if (k % h == 0) { n long long mx = sz[find(p.second)]; n if (mx >= k / h) { n ans = mx; n hh = h; n xx = x; n yy = y; n break; n } n } n } n if (ans == -1) return cout << NO n , 0; n dfs(xx, yy); n cout << YES n ; n long long sum = 0; n for (auto p : all) { n res[p.first][p.second] = hh; n sum += hh; n if (sum == k) break; n } n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < m; j++) cout << res[i][j] << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m; n long long dp[1501][1501]; n long long a[1510][1501]; n long long func(long long here, long long here1) { n if (here1 > m) return -999999999999999; n if (here1 < 1) return -999999999999999; n if (here == n + 1) return 0; n long long &ret = dp[here][here1]; n if (ret != -1) return ret; n ret = -999999999999999; n if (here % 2) { n ret = max(ret, func(here, here1 + 1)); n ret = max(ret, func(here + 1, here1 - 1) + a[here][here1]); n } else { n ret = max(ret, func(here, here1 - 1)); n ret = max(ret, func(here + 1, here1 + 1) + a[here][here1]); n } n return ret; n } n int main() { n memset(dp, -1, sizeof(dp)); n scanf( %lld %lld , &n, &m); n for (int i = 1; i <= n; i++) { n for (int y = 1; y <= m; y++) { n scanf( %lld , &a[i][y]); n a[i][y] += a[i][y - 1]; n } n } n printf( %lld n , func(1, 1)); n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, i, j, k, mod, dp[605][605], rd[605], xs[605][605], ans = 1; n vector ts, bi[605], nrd, ncd; n long long gcd(long long x, long long y) { n if (y == 0) return x; n return gcd(y, x % y); n } n long long lcm(long long x, long long y) { return x / gcd(x, y) * y; } n void dfs(int x) { n int i; n rd[x] = -1; n ts.push_back(x); n for (i = 0; i < bi[x].size(); i++) { n rd[bi[x][i]]--; n if (!rd[bi[x][i]]) { n dfs(bi[x][i]); n } n } n } n int main() { n ios_base::sync_with_stdio(0); n cin >> n >> m >> mod; n for (i = 1; i <= m; i++) { n int x, y; n cin >> x >> y; n bi[x].push_back(y); n rd[y]++; n } n for (i = 1; i <= n; i++) { n if (rd[i] == 0) nrd.push_back(i); n if (bi[i].size() == 0) ncd.push_back(i); n } n for (i = 0; i < nrd.size(); i++) { n dfs(nrd[i]); n dp[nrd[i]][nrd[i]] = 1; n } n for (i = 0; i < ts.size(); i++) { n for (j = 0; j < ts.size(); j++) { n for (k = 0; k < bi[ts[j]].size(); k++) { n dp[ts[i]][bi[ts[j]][k]] += dp[ts[i]][ts[j]]; n dp[ts[i]][bi[ts[j]][k]] %= mod; n } n } n } n for (i = 0; i < nrd.size(); i++) { n for (j = 0; j < ncd.size(); j++) { n xs[i][j] = dp[nrd[i]][ncd[j]]; n } n } n long long cnt = 0; n for (i = 0; i < ncd.size(); i++) { n for (j = i + 1; j < nrd.size(); j++) { n while (xs[j][i]) { n long long t = -xs[i][i] / xs[j][i]; n for (k = i; k < nrd.size(); k++) { n xs[i][k] += t * xs[j][k]; n xs[i][k] %= mod; n xs[i][k] += mod; n xs[i][k] %= mod; n } n for (k = i; k < nrd.size(); k++) { n swap(xs[i][k], xs[j][k]); n } n cnt++; n } n } n } n if (cnt & 1) ans = mod - 1; n for (i = 0; i < nrd.size(); i++) { n ans *= xs[i][i]; n ans %= mod; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n string s; n cin >> s; n char zero = 0 ; n s = 00 + s; n long long n = (long long)s.size(); n for (long long i = 0; i < n - 2; i++) { n long long temp = 100 * (s[i] - zero); n for (long long j = i + 1; j < n - 1; j++) { n temp += (10 * (s[j] - zero)); n for (long long k = j + 1; k < n; k++) { n temp += (s[k] - zero); n if (temp % 8 == 0) { n cout << YES << n ; n cout << temp << n ; n return 0; n } n temp -= (s[k] - zero); n } n temp -= (10 * (s[j] - zero)); n } n } n cout << NO << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int Q; n cin >> Q; n while (Q--) { n long long n, a, b, ans; n cin >> n >> a >> b; n double x = b / 2.0; n if (x > a) { n ans = a * n; n cout << ans << endl; n } else { n if (n % 2 == 0) { n ans = n / 2 * b; n cout << ans << endl; n } else { n ans = (n - 1) / 2 * b + a; n cout << ans << endl; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream& operator<<(ostream& out, pair const& p) { n out << ( << p.first << , << p.second << ) ; n return out; n } n template n ostream& operator<<(ostream& out, vector const& v) { n int l = v.size(); n for (int i = 0; i < l - 1; i++) out << v[i] << ; n if (l > 0) out << v[l - 1]; n return out; n } n template n void trace(const char* name, T&& arg1) { n cout << name << : << arg1 << endl; n } n template n void trace(const char* names, T&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n cout.write(names, comma - names) << : << arg1 << | ; n trace(comma + 1, args...); n } n const int N = 100100; n int pt; n bool cmp(const int& i, const int& j) { n if (i < pt and j < pt) { n return i < j; n } else if (i > pt and j > pt) { n return i < j; n } else { n return i > j; n } n } n vector nxt[N]; n int a[N]; n int b[N]; n int lft[N]; n int rgt[N]; n pair tosort[N]; n bool importance(const int& i, const int& j) { return tosort[i] < tosort[j]; } n vector face[N]; n vector g[N]; n map, int> id; n set > used; n void buildFace(int from, int to, int f) { n face[f].push_back(to); n used.insert(make_pair(from, to)); n pt = to; n vector& v = nxt[to]; n int nxt = *upper_bound(v.begin(), v.end(), from, cmp); n if (used.count(make_pair(to, nxt))) return; n buildFace(to, nxt, f); n } n int vis[N]; n int usd[N]; n int sz[N]; n int lvl[N]; n void dfs(int x, int h) { n sz[x] = 1; n vis[x] = h; n for (auto it = (g[x]).begin(); it != (g[x]).end(); ++it) { n if (usd[*it]) continue; n if (vis[*it] == h) continue; n dfs(*it, h); n sz[x] += sz[*it]; n } n } n int findCentroid(int x, int n, int prev) { n for (auto it = (g[x]).begin(); it != (g[x]).end(); ++it) { n if (vis[*it] != vis[x] or *it == prev) continue; n if (sz[*it] > n / 2) return findCentroid(*it, n, x); n } n return x; n } n void decompose(int x, int h) { n dfs(x, h); n int c = findCentroid(x, sz[x], -1); n lvl[c] = h; n usd[c] = 1; n for (auto it = (g[c]).begin(); it != (g[c]).end(); ++it) { n if (!usd[*it]) decompose(*it, h + 1); n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int n, m; n cin >> n >> m; n if (m == 0) { n cout << 1 << endl; n return 0; n } n if (m == 1) { n cout << 1 2 << endl; n return 0; n } n nxt[1].push_back(n); n nxt[n].push_back(1); n for (int i = 2; i <= n; i++) { n nxt[i].push_back(i - 1); n nxt[i - 1].push_back(i); n } n for (int i = 0; i < m; i++) { n cin >> a[i] >> b[i]; n if (a[i] < b[i]) swap(a[i], b[i]); n id[make_pair(a[i], b[i])] = id[make_pair(b[i], a[i])] = i; n nxt[a[i]].push_back(b[i]); n nxt[b[i]].push_back(a[i]); n } n for (int i = 1; i <= n; i++) { n pt = i; n sort(nxt[i].begin(), nxt[i].end(), cmp); n } n int cur = 0; n for (int i = 0; i < m; i++) { n if (!used.count(make_pair(a[i], b[i]))) { n face[++cur].push_back(a[i]); n buildFace(a[i], b[i], cur); n for (int j = 1; j < face[cur].size(); j++) { n int x = face[cur][j - 1], y = face[cur][j]; n if (x - 1 != y and !(x == 1 and y == n)) { n int k = id[make_pair(x, y)]; n if (x > y) n lft[k] = cur; n else n rgt[k] = cur; n } n } n } n if (!used.count(make_pair(b[i], a[i]))) { n face[++cur].push_back(b[i]); n buildFace(b[i], a[i], cur); n for (int j = 1; j < face[cur].size(); j++) { n int x = face[cur][j - 1], y = face[cur][j]; n if (x - 1 != y and !(x == 1 and y == n)) { n int k = id[make_pair(x, y)]; n if (x > y) n lft[k] = cur; n else n rgt[k] = cur; n } n } n } n int x = lft[i], y = rgt[i]; n assert(x > 0 and y > 0); n g[x].push_back(y); n g[y].push_back(x); n } n for (int i = 1; i <= cur; i++) { n int mx = 0, smx = 0; n for (int j = 1; j < face[i].size(); j++) { n int x = face[i][j]; n if (x > mx) { n smx = mx; n mx = x; n } else if (x > smx) n smx = x; n } n tosort[i] = make_pair(mx, smx); n } n vector faces; n for (int i = 1; i <= cur; i++) faces.push_back(i); n sort(faces.begin(), faces.end(), importance); n decompose(1, 1); n for (int x : faces) { n cout << lvl[x] << ; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k, x, a, b, i, j, m[1000005], f[1000005]; n multiset s; n pair d[1000005]; n vector v; n int main() { n ios::sync_with_stdio(0); n cin >> n >> k >> x; n while (i < n) { n cin >> m[i]; n i++; n } n i = 0; n while (i < k) { n cin >> d[i].first; n d[i].second = i + 1; n i++; n } n i = 0; n sort(m, m + n); n sort(d, d + k); n s.insert(1000000001); n while (i < n) { n if (x * m[i] + x < i + 1) n return cout << -1, 0; n else n f[i] = x * m[i] + x - i - 1, s.insert(f[i]); n i++; n } n i = 0; n while (i < n + 1) { n while (j < k && a < *s.begin()) { n if (x * d[j].first + x >= i + a + 1) a++, v.push_back(d[j].second); n j++; n } n s.erase(s.lower_bound(f[i])); n i++; n } n i = 0; n cout << a << endl; n while (i < a) { n cout << v[i] << ; n i++; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int i, count = 0; n string str; n cin >> str; n int len = str.size(); n for (i = 0; i < len; i++) { n if (str[i] == W && str[i + 1] == U && str[i + 2] == B ) { n i += 2; n if (count > 0) cout << ; n } else { n cout << str[i]; n count = 1; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 2e9; n int32_t main() { n cin.tie(0)->sync_with_stdio(0); n long long n, m; n string s, t; n cin >> n >> m >> s >> t; n vector pi(m, 0), nxt(m, 0); n for (long long i = 1; i < m; i++) { n { n t[i] = char( 0 + (t[i] - 0 ) ^ 1); n long long j = pi[i - 1]; n while (j > 0 and t[i] != t[j]) { n j = pi[j - 1]; n } n if (t[i] == t[j]) j++; n nxt[i] = j; n t[i] = char( 0 + (t[i] - 0 ) ^ 1); n } n { n long long j = pi[i - 1]; n while (j > 0 and t[i] != t[j]) { n j = pi[j - 1]; n } n if (t[i] == t[j]) j++; n pi[i] = j; n } n } n s = # + s; n long long dp[n + 1][m][n - m + 2]; n fill(**dp, **dp + sizeof dp / sizeof(long long), inf); n dp[0][0][0] = 0; n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < m; j++) { n for (long long k = 0; k < n - m + 2; k++) { n if (dp[i][j][k] == inf) continue; n if (j == m - 1) { n dp[i + 1][pi.back()][k + 1] = min(dp[i + 1][pi.back()][k + 1], n dp[i][j][k] + (s[i + 1] != t[j])); n } else { n dp[i + 1][j + 1][k] = n min(dp[i + 1][j + 1][k], dp[i][j][k] + (s[i + 1] != t[j])); n } n dp[i + 1][nxt[j]][k] = n min(dp[i + 1][nxt[j]][k], dp[i][j][k] + (s[i + 1] == t[j])); n } n } n } n for (long long i = 0; i < n - m + 2; i++) { n long long mn = inf; n for (long long j = 0; j < m; j++) { n mn = min(mn, dp[n][j][i]); n } n if (mn == inf) mn = -1; n cout << mn << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n vector>> v; n for (int i = 0; i < n; i++) { n int a, b; n cin >> a >> b; n v.push_back(make_pair(a, make_pair(b, i))); n } n sort(v.begin(), v.end()); n int g[100001]{}, r = v[0].second.first; n g[v[0].second.second] = 1; n for (int i = 1; i < n; i++) { n if (v[i].first > r) break; n g[v[i].second.second] = 1; n r = max(r, v[i].second.first); n } n bool ans = true; n for (int i = 0; i < n && ans; i++) ans &= g[i]; n if (ans) { n cout << -1 << n ; n continue; n } n for (int i = 0; i < n; i++) cout << g[i] + 1 << ; n cout << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n char A[300]; n int cnt[5]; n char data[5] = ACGT ; n int main() { n int n; n scanf( %d , &n); n scanf( %s , A); n for (int i = 0; A[i]; i++) { n if (A[i] == A ) n cnt[0]++; n else if (A[i] == C ) n cnt[1]++; n else if (A[i] == G ) n cnt[2]++; n else if (A[i] == T ) n cnt[3]++; n else n cnt[4]++; n } n int big = 0, dif = 0; n ; n for (int i = 0; i < 4; i++) big = max(big, cnt[i]); n for (int i = 0; i < 4; i++) { n cnt[i] = big - cnt[i]; n dif += cnt[i]; n } n if (dif > cnt[4]) { n printf( === ); n return 0; n } n if ((cnt[4] - dif) % 4 != 0) { n printf( === ); n return 0; n } n int flag = 0; n for (int i = 0; A[i]; i++) { n if (A[i] == ? ) { n flag = 0; n for (int j = 0; j < 4; j++) { n if (cnt[j] > 0) { n A[i] = data[j]; n cnt[j]--; n flag = 1; n break; n } n } n if (flag == 0) { n for (int j = 0; j < 4; j++) cnt[j]++; n i--; n } n } n } n printf( %s , A); n } n "} +{"func_code_string": "#include n using namespace std; n int a[2]; n string ans[2] = { Vladik , Valera }; n int main() { n cin >> a[0] >> a[1]; n int turn = 0; n int sub = 1; n while (true) { n if (a[turn] - sub >= 0) { n a[turn] -= sub; n } else { n break; n } n sub++; n turn = 1 - turn; n } n cout << ans[turn] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, loc[250] = {}, isi[250] = {}, idx = 0; n int kosong() { n for (int i = 0, _n = (n); i < _n; i++) n if (isi[i] == -1) return i; n return -111; n } n int main() { n memset(isi, -1, sizeof isi); n scanf( %d %d , &n, &m); n for (int i = 0, _n = (m); i < _n; i++) { n int a; n scanf( %d , &a); n for (int j = 0, _n = (a); j < _n; j++) { n int x; n scanf( %d , &x); n x--; n isi[x] = idx; n loc[idx] = x; n idx++; n } n } n vector > ans; n for (int i = 0, _n = (idx); i < _n; i++) n if (isi[i] != i) { n if (isi[i] == -1) { n ans.push_back(make_pair(loc[i], i)); n isi[loc[i]] = -1; n loc[i] = i; n isi[i] = i; n } else { n int k = kosong(); n ans.push_back(make_pair(i, k)); n isi[k] = isi[i]; n loc[isi[i]] = k; n isi[i] = -1; n i--; n } n } n printf( %d n , ans.size()); n for (int i = 0, _n = (ans.size()); i < _n; i++) n printf( %d %d n , ans[i].first + 1, ans[i].second + 1); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n using namespace std; n template n void dbg(const char* xn, T x) { n if (0) cout << xn << : << x << n ; n } n template n void dbg(const char* xn, T x, TA... t) { n while (*xn != , ) n if (0) cout << *xn++; n if (0) cout << : << x << , ; n dbg(xn + 1, t...); n } n template n inline bool upd_max(T& x, T y) { n return y > x ? x = y, true : false; n } n template n inline bool upd_min(T& x, T y) { n return y < x ? x = y, true : false; n } n const int N = 1000007; n long long n, m1 = 0, m0 = 0, n1 = 0, n0 = 0; n string A, B; n void solve() { n cin >> n; n cin >> A; n A = # + A; n cin >> B; n B = # + B; n for (long long i = 1; i <= (n); ++i) { n if (A[i] == 1 ) n ++n1; n else if (A[i] == 0 ) n ++n0; n if (A[i] == 1 && B[i] == 0 ) ++m1; n if (A[i] == 0 && B[i] == 0 ) ++m0; n } n cout << m1 * n0 + m0 * n1 - m1 * m0; n } n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout << fixed << setprecision(10); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int sz = 5005; n long long int x[sz]; n long long int a[sz]; n long long int b[sz]; n long long int c[sz]; n long long int d[sz]; n int n, s, e; n const long long int Max = 1e16; n long long int dp[sz][sz]; n long long int jumpl(int i) { return x[i] + c[i]; } n long long int jumpr(int i) { return -x[i] + d[i]; } n long long int landfr(int i) { return -x[i] + b[i]; } n long long int landfl(int i) { return x[i] + a[i]; } n long long int calc(int ch, int pl, int pr) { n if (pl < 0 || pr < 0) { n return Max; n } n if (dp[ch][pl] != 0) { n return dp[ch][pl]; n } n if (ch == 0) { n if (s == 0) { n return calc(ch + 1, pl, pr + 1) + jumpr(ch); n } else if (e == 0) { n return calc(ch + 1, pl + 1, pr) + landfr(ch); n } n return calc(ch + 1, pl + 1, pr + 1) + landfr(ch) + jumpr(ch); n } n if (ch == n - 1) { n if (s == n - 1 && (pl == 1 && pr == 0)) { n return jumpl(ch); n } else if (e == n - 1 && (pl == 0 && pr == 1)) { n return landfl(ch); n } else if (pl == pr && pl == 1) { n return landfl(ch) + jumpl(ch); n } else { n return Max; n } n } else if (pl == 0 && pr == 0) { n return Max; n } n long long int m; n if (ch == s) { n m = min(calc(ch + 1, pl - 1, pr) + jumpl(ch), n calc(ch + 1, pl, pr + 1) + jumpr(ch)); n dp[ch][pl] = m; n return m; n } n if (ch == e) { n m = min(calc(ch + 1, pl, pr - 1) + landfl(ch), n calc(ch + 1, pl + 1, pr) + landfr(ch)); n dp[ch][pl] = m; n return m; n } n m = calc(ch + 1, pl + 1, pr + 1) + jumpr(ch) + landfr(ch); n m = min(m, calc(ch + 1, pl - 1, pr - 1) + jumpl(ch) + landfl(ch)); n if (pr > 0) { n m = min(m, calc(ch + 1, pl, pr) + jumpr(ch) + landfl(ch)); n } n if (pl > 0) { n m = min(m, calc(ch + 1, pl, pr) + jumpl(ch) + landfr(ch)); n } n dp[ch][pl] = m; n return m; n } n int main() { n ios::sync_with_stdio(false); n cin >> n >> s >> e; n --s, --e; n for (int i = 0; i < n; ++i) { n cin >> x[i]; n } n for (int i = 0; i < n; ++i) { n cin >> a[i]; n } n for (int i = 0; i < n; ++i) { n cin >> b[i]; n } n for (int i = 0; i < n; ++i) { n cin >> c[i]; n } n for (int i = 0; i < n; ++i) { n cin >> d[i]; n } n cout << calc(0, 0, 0) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 200005; n int x[maxn], n, m; n int main() { n int ans = 0, use = 0; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> m; n x[m] = 0; n } n for (int i = 1; i <= n; i++) { n cin >> m; n x[m] = i; n } n for (int i = 1; x[i] <= n && i <= n && x[i + 1] == x[i] + 1; i++) use = i + 1; n if (use && x[use] == n) { n m = 0; n for (int i = use + 1; i <= n; i++) m = max(m, x[i] - (i - use - 1)); n if (!m) { n cout << n - use << n ; n return 0; n } n } n if (x[1] && x[1] < n) { n for (int i = 2; i <= n; i++) x[i] = max(0, x[i] - x[1]); n ans += x[1]; n x[1] = 0; n } n if (x[1] == n) { n m = 0; n for (int i = 2; i <= n; i++) m = max(m, x[i] - (i - 2)); n if (m) { n cout << ans + 2 * n << n ; n return 0; n } else { n cout << ans + n - 1 << n ; n return 0; n } n } n m = 0; n for (int i = 2; i <= n; i++) m = max(m, x[i] - (i - 1)); n cout << ans + m + n << n ; n return 0; n } n "} +{"func_code_string": "#include n const long long int mod = 1000000007; n using namespace std; n void toh_chaliye_shuru_karte_hain() {} n void code_samapti_ki_ghoshna() {} n long long int power(long long int a, long long int b, long long int modi) { n a %= modi; n long long int res = 1; n while (b) { n if (b % 2) { n res = (res * a) % modi; n } n b /= 2; n a = (a * a) % modi; n } n return res; n } n int main() { n toh_chaliye_shuru_karte_hain(); n ios::sync_with_stdio(0); n cin.tie(0); n int n, x1, y1, x2, y2; n cin >> n >> x1 >> y1 >> x2 >> y2; n if (x1 == 0 && x2 == 0 || x1 == n && x2 == n) { n cout << abs(y1 - y2) << n ; n } else if (y1 == 0 && y2 == 0 || y1 == n && y2 == n) { n cout << abs(x1 - x2) << n ; n } else { n int ans = 0; n ans += min(n - y1 + n - y2, y1 + y2); n ans += min(n - x1 + n - x2, x1 + x2); n cout << ans << n ; n } n code_samapti_ki_ghoshna(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct segment_change { n static const int SENTINEL = numeric_limits::min(); n int to_set; n segment_change(int _to_set = SENTINEL) : to_set(_to_set) {} n bool has_set() const { return to_set != SENTINEL; } n void reset() { to_set = SENTINEL; } n bool has_change() const { return has_set(); } n segment_change combine(const segment_change &other) const { n return other.has_set() ? other : *this; n } n }; n struct segment { n int first; n segment(int _first = -1) : first(_first) {} n void apply(int, const segment_change &change) { n if (change.has_set()) first = change.to_set; n } n void join(const segment &other) { n if (first < 0) first = other.first; n } n void join(const segment &a, const segment &b) { n *this = a; n join(b); n } n }; n pair right_half[32]; n struct seg_tree { n int tree_n = 0; n vector tree; n vector changes; n seg_tree(int n = -1) { n if (n >= 0) init(n); n } n void init(int n) { n tree_n = 1; n while (tree_n < n) tree_n *= 2; n tree.assign(2 * tree_n, segment()); n changes.assign(tree_n, segment_change()); n } n void build(const vector &initial) { n int n = initial.size(); n init(n); n assert(n <= tree_n); n for (int i = 0; i < n; i++) tree[tree_n + i] = initial[i]; n for (int position = tree_n - 1; position > 0; position--) n tree[position].join(tree[2 * position], tree[2 * position + 1]); n } n void push_down(int position, int length) { n if (!changes[position].has_change()) return; n if (2 * position < tree_n) { n changes[2 * position] = changes[2 * position].combine(changes[position]); n changes[2 * position + 1] = n changes[2 * position + 1].combine(changes[position]); n } n tree[2 * position].apply(length / 2, changes[position]); n tree[2 * position + 1].apply(length / 2, changes[position]); n changes[position].reset(); n } n void push_all(int a, int b) { n assert(0 <= a && a < b && b <= tree_n); n a += tree_n; n b += tree_n - 1; n for (int up = 31 - __builtin_clz(tree_n); up > 0; up--) { n int x = a >> up, y = b >> up; n push_down(x, 1 << up); n if (x != y) push_down(y, 1 << up); n } n } n void join_and_apply(int position, int length) { n tree[position].join(tree[2 * position], tree[2 * position + 1]); n tree[position].apply(length, changes[position]); n } n void join_all(int a, int b) { n assert(0 <= a && a < b && b <= tree_n); n a += tree_n; n b += tree_n - 1; n int length = 1; n while (a > 1) { n a /= 2; n b /= 2; n length *= 2; n join_and_apply(a, length); n if (a != b) join_and_apply(b, length); n } n } n template n void process_range(int a, int b, bool needs_join, T_range_op &&range_op) { n if (a == b) return; n push_all(a, b); n int original_a = a, original_b = b; n int length = 1, r_size = 0; n for (a += tree_n, b += tree_n; a < b; a /= 2, b /= 2, length *= 2) { n if (a & 1) range_op(a++, length); n if (b & 1) right_half[r_size++] = {--b, length}; n } n for (int i = r_size - 1; i >= 0; i--) n range_op(right_half[i].first, right_half[i].second); n if (needs_join) join_all(original_a, original_b); n } n segment query(int a, int b) { n assert(0 <= a && a <= b && b <= tree_n); n segment answer; n process_range(a, b, false, n [&](int position, int) { answer.join(tree[position]); }); n return answer; n } n void update(int a, int b, const segment_change &change) { n assert(0 <= a && a <= b && b <= tree_n); n process_range(a, b, true, [&](int position, int length) { n tree[position].apply(length, change); n if (position < tree_n) n changes[position] = changes[position].combine(change); n }); n } n }; n static segment v_half[32]; n struct ordered_path_heavy_light { n int n = 0; n bool vertex_mode; n vector> adj; n vector parent, depth, subtree_size; n vector chain_root, chain_size; n vector chain_up_tree, chain_down_tree; n ordered_path_heavy_light() {} n ordered_path_heavy_light(int _n, bool _vertex_mode) { n init(_n, _vertex_mode); n } n void init(int _n, bool _vertex_mode) { n n = _n; n vertex_mode = _vertex_mode; n adj.assign(n, {}); n parent.resize(n); n depth.resize(n); n subtree_size.resize(n); n chain_root.resize(n); n chain_size.assign(n, 0); n chain_up_tree.assign(n, {}); n chain_down_tree.assign(n, {}); n } n void add_edge(int a, int b) { n adj[a].push_back(b); n adj[b].push_back(a); n } n void dfs(int node, int par) { n parent[node] = par; n depth[node] = par < 0 ? 0 : depth[par] + 1; n subtree_size[node] = 1; n if (par >= 0) n adj[node].erase(find(adj[node].begin(), adj[node].end(), par)); n for (int &child : adj[node]) { n dfs(child, node); n subtree_size[node] += subtree_size[child]; n } n sort(adj[node].begin(), adj[node].end(), n [&](int a, int b) { return subtree_size[a] > subtree_size[b]; }); n } n void chain_dfs(int node, bool heavy) { n chain_root[node] = heavy ? chain_root[parent[node]] : node; n chain_size[chain_root[node]]++; n bool heavy_child = true; n for (int child : adj[node]) { n chain_dfs(child, heavy_child); n heavy_child = false; n } n } n void build(const segment &initial) { n parent.assign(n, -1); n for (int i = 0; i < n; i++) n if (parent[i] < 0) { n dfs(i, -1); n chain_dfs(i, false); n } n for (int i = 0; i < n; i++) n if (chain_root[i] == i) { n chain_up_tree[i].init(chain_size[i]); n chain_down_tree[i].init(chain_size[i]); n vector initial_segs(chain_size[i], initial); n chain_up_tree[i].build(initial_segs); n chain_down_tree[i].build(initial_segs); n } n } n segment _query_up_tree(int root, int start, int end) { n int size = chain_size[root]; n return chain_up_tree[root].query(size - end, size - start); n } n void _update_up_tree(int root, int start, int end, n const segment_change &change) { n int size = chain_size[root]; n chain_up_tree[root].update(size - end, size - start, change); n } n void _update_both_trees(int root, int start, int end, n const segment_change &change) { n _update_up_tree(root, start, end, change); n chain_down_tree[root].update(start, end, change); n } n segment query_path(int u, int v) { n segment u_half; n int v_size = 0; n while (chain_root[u] != chain_root[v]) { n bool pull_u = depth[chain_root[u]] > depth[chain_root[v]]; n int pull_node = pull_u ? u : v; n int root = chain_root[pull_node]; n int end = depth[pull_node] - depth[root] + 1; n if (pull_u) { n u_half.join(_query_up_tree(root, 0, end)); n u = parent[root]; n } else { n v_half[v_size++] = chain_down_tree[root].query(0, end); n v = parent[root]; n } n } n bool pull_u = depth[u] > depth[v]; n int pull_node = pull_u ? u : v; n int ancestor = pull_u ? v : u; n int root = chain_root[pull_node]; n int start = depth[ancestor] - depth[root] + (vertex_mode ? 0 : 1); n int end = depth[pull_node] - depth[root] + 1; n if (pull_u) n u_half.join(_query_up_tree(root, start, end)); n else n v_half[v_size++] = chain_down_tree[root].query(start, end); n for (int i = v_size - 1; i >= 0; i--) u_half.join(v_half[i]); n return u_half; n } n void update_path(int u, int v, const segment_change &change) { n while (chain_root[u] != chain_root[v]) { n if (depth[chain_root[u]] > depth[chain_root[v]]) swap(u, v); n int root = chain_root[v]; n _update_both_trees(root, 0, depth[v] - depth[root] + 1, change); n v = parent[root]; n } n if (depth[u] > depth[v]) swap(u, v); n int root = chain_root[v]; n _update_both_trees(root, depth[u] - depth[root] + (vertex_mode ? 0 : 1), n depth[v] - depth[root] + 1, change); n } n }; n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int N; n cin >> N; n ordered_path_heavy_light HLD(N, false); n vector> T1(N - 1); n for (int i = 0; i < N - 1; i++) { n int a, b; n cin >> a >> b; n a--; n b--; n HLD.add_edge(a, b); n T1[i] = {a, b}; n } n HLD.build(segment()); n for (int e = 0; e < N - 1; e++) n HLD.update_path(T1[e].first, T1[e].second, segment_change(e)); n vector> adj(N); n vector degree(N, 0); n for (int i = 0; i < N - 1; i++) { n int a, b; n cin >> a >> b; n a--; n b--; n adj[a].push_back(b); n adj[b].push_back(a); n degree[a]++; n degree[b]++; n } n queue leaves; n for (int i = 0; i < N; i++) n if (degree[i] == 1) leaves.push(i); n cout << N - 1 << n ; n while (!leaves.empty()) { n int leaf = leaves.front(); n leaves.pop(); n if (degree[leaf] == 0) break; n int parent = -1; n for (int neighbor : adj[leaf]) n if (degree[neighbor] != 0) parent = neighbor; n assert(parent >= 0); n int first_edge = HLD.query_path(leaf, parent).first; n assert(first_edge >= 0); n int x = T1[first_edge].first, y = T1[first_edge].second; n HLD.update_path(x, y, segment_change(-1)); n degree[leaf]--; n degree[parent]--; n if (degree[parent] == 1) leaves.push(parent); n cout << x + 1 << << y + 1 << << leaf + 1 << << parent + 1 n << n ; n } n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:268435456 ) n using namespace std; n const string IN_NAME = input.txt ; n const string OUT_NAME = output.txt ; n template n T abs(T &x) { n return ((x) >= 0) ? (x) : (-(x)); n } n template n T sqr(T &x) { n return (x) * (x); n } n template n T min(T &a, T &b) { n return ((a) < (b)) ? (a) : (b); n } n template n T max(T &a, T &b) { n return ((a) > (b)) ? (a) : (b); n } n int n, m; n struct tree { n int x, h, pL, pR; n tree() {} n bool operator<(const tree &t) const { return x < t.x; } n }; n struct mush { n int x, z; n mush() {} n bool operator<(const mush &t) const { return x < t.x; } n }; n tree a[100010]; n mush b[100010], tmpb[100010]; n int binSearch(int x) { n if (x < b[0].x) return -1; n if (x > b[m - 1].x) return -m - 1; n int left = 0, right = m - 1; n while (right - left > 1) { n int mid = (left + right) >> 1; n if (b[mid].x == x) return mid; n if (b[mid].x < x) n left = mid + 1; n else n right = mid - 1; n } n for (int i = max(0, left - 4); i < min(m - 1, right + 3); i++) { n if (b[i].x < x && x < b[i + 1].x) return -(i + 1) - 1; n } n return right; n } n double d[100010]; n double db[100010]; n int dk; n void multQuery(int left, int right, double p) { n if (left > right) return; n int L = left / dk + 1; n int R = right / dk - 1; n if (L > R) { n for (int i = left; i <= right; i++) d[i] *= p; n } else { n for (int i = left; i < L * dk; i++) d[i] *= p; n for (int j = L; j <= R; j++) db[j] *= p; n for (int i = (R + 1) * dk; i <= right; i++) d[i] *= p; n } n } n double getQuery(int index) { return d[index] * db[index / dk]; } n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < n; i++) n scanf( %d%d%d%d , &a[i].x, &a[i].h, &a[i].pL, &a[i].pR); n for (int i = 0; i < m; i++) scanf( %d%d , &tmpb[i].x, &tmpb[i].z); n sort(a, a + n); n sort(tmpb, tmpb + m); n int newM = 0; n for (int i = 0; i < m; i++) { n if (i == 0 || tmpb[i - 1].x < tmpb[i].x) { n b[newM].x = tmpb[i].x; n b[newM].z = tmpb[i].z; n newM++; n } else { n b[newM - 1].z += tmpb[i].z; n } n } n m = newM; n for (int i = 0; i < n; i++) a[i].x *= 2; n for (int i = 0; i < n; i++) a[i].h *= 2; n for (int i = 0; i < m; i++) b[i].x *= 2; n dk = (int)sqrt(m + 1e-9); n for (int i = 0; i < m + 5; i++) { n d[i] = db[i] = 1; n } n for (int i = 0; i < n; i++) { n int leftIndex = binSearch(a[i].x - a[i].h - 1); n int rightIndex = binSearch(a[i].x + a[i].h + 1); n int thisLeftIndex = binSearch(a[i].x - 1); n int thisRightIndex = binSearch(a[i].x + 1); n leftIndex = ~leftIndex; n rightIndex = ~rightIndex; n thisLeftIndex = ~thisLeftIndex; n thisRightIndex = ~thisRightIndex; n multQuery(leftIndex, thisLeftIndex - 1, 1.0 - a[i].pL / 100.0); n multQuery(thisRightIndex, rightIndex - 1, 1.0 - a[i].pR / 100.0); n } n double result = 0; n for (int i = 0; i < m; i++) { n result += getQuery(i) * b[i].z; n } n printf( %.12f , result); n } n "} +{"func_code_string": "#include n using namespace std; n const double pi = acos(0.0) * 2.0; n const double eps = 1e-12; n const int step[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; n template n inline T abs1(T a) { n return a < 0 ? -a : a; n } n template n inline T max1(T a, T b, T c = -1234567, T d = -1234567) { n T ans = a > b ? a : b; n if (c != -1234567) ans = max1(ans, c); n if (d != -1234567) ans = max1(ans, d); n return ans; n } n template n inline T min1(T a, T b, T c = -1234567, T d = -1234567) { n T ans = a < b ? a : b; n if (c != -1234567) ans = min(ans, c); n if (d != -1234567) ans = min(ans, d); n return ans; n } n template n inline T gcd1(T a, T b) { n if (a < b) swap(a, b); n if (a % b == 0) return b; n return gcd1(b, a % b); n } n template n inline T lb(T num) { n return num & (-num); n } n inline int jud(double a, double b) { n if (abs1(a - b) < eps) return 0; n if (a < b) return -1; n return 1; n } n template n inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) { n if (na == 1) return 0; n int be = 0, en = na - 1; n if (*a <= *(a + na - 1)) { n if (f_lb == 0) n while (be < en) { n int mid = (be + en + 1) / 2; n if (jud(*(a + mid), val) != 1) n be = mid; n else n en = mid - 1; n } n else n while (be < en) { n int mid = (be + en) / 2; n if (jud(*(a + mid), val) != -1) n en = mid; n else n be = mid + 1; n } n if (f_small && jud(*(a + be), val) == 1 && be != 0) be--; n if (!f_small && jud(*(a + be), val) == -1 && be != na - 1) be++; n } else { n if (f_lb) n while (be < en) { n int mid = (be + en + 1) / 2; n if (jud(*(a + mid), val) != -1) n be = mid; n else n en = mid - 1; n } n else n while (be < en) { n int mid = (be + en) / 2; n if (jud(*(a + mid), val) != 1) n en = mid; n else n be = mid + 1; n } n if (!f_small && jud(*(a + be), val) == -1 && be != 0) be--; n if (f_small && jud(*(a + be), val) == 1 && be != na - 1) be++; n } n return be; n } n inline int bitnum(unsigned long long nValue) { n nValue = ((0xaaaaaaaaaaaaaaaaull & nValue) >> 1) + n (0x5555555555555555ull & nValue); n nValue = ((0xccccccccccccccccull & nValue) >> 2) + n (0x3333333333333333ull & nValue); n nValue = ((0xf0f0f0f0f0f0f0f0ull & nValue) >> 4) + n (0x0f0f0f0f0f0f0f0full & nValue); n nValue = ((0xff00ff00ff00ff00ull & nValue) >> 8) + n (0x00ff00ff00ff00ffull & nValue); n nValue = ((0xffff0000ffff0000ull & nValue) >> 16) + n (0x0000ffff0000ffffull & nValue); n nValue = ((0xffffffff00000000ull & nValue) >> 32) + n (0x00000000ffffffffull & nValue); n return nValue; n } n long long pow(long long n, long long m, long long mod = 0) { n long long ans = 1; n long long k = n; n while (m) { n if (m & 1) { n ans *= k; n if (mod) ans %= mod; n } n k *= k; n if (mod) k %= mod; n m >>= 1; n } n return ans; n } n const int maxn = 200110; n char str[maxn]; n int f[maxn]; n int cntwen = 0, cnt = 0, st1 = 0; n int main() { n scanf( %s , str); n int l = strlen(str); n bool st = (str[0] >= A && str[0] <= J ); n for (int i = 0; i < l; i++) { n if (str[i] >= A && str[i] <= J ) { n if (f[str[i] - A ] == 0) cnt++; n f[str[i] - A ]++; n } n if (str[i] == ? ) cntwen++; n } n int ans = 1; n for (int i = 0; i < cnt; i++) ans *= 10 - i; n if (st) { n ans /= 10; n ans *= 9; n } n if (str[0] == ? ) ans *= 9, cntwen--; n printf( %d , ans); n for (int i = 0; i < cntwen; i++) printf( 0 ); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n string toString(T x) { n if (x == 0) return 0 ; n bool negative = x < 0; n string res; n while (x) { n res.push_back( 0 + x % 10); n x /= 10; n } n if (negative) res.push_back( - ); n reverse(res.begin(), res.end()); n return res; n } n template n T gcd(T a, T b) { n return a == 0 ? b : gcd(b % a, a); n } n template n T lcm(T a, T b) { n return a / gcd(a, b) * b; n } n int main() { n string s; n cin >> s; n vector a(s.length() / 2); n int m; n cin >> m; n for (int i = 0; i < m; i++) { n int t; n cin >> t; n t--; n a[t]++; n } n int l = s.length() / 2; n vector r(l); n int carry = 0; n for (int i = 0; i < l; i++) { n int t = a[i] + carry; n carry = t % 2; n r[i] = carry; n } n for (int i = 0; i < l; i++) { n if (r[i]) { n cout << s[s.length() - 1 - i]; n } else { n cout << s[i]; n } n } n if (s.length() % 2 == 1) { n cout << s[l]; n l++; n } n for (int i = (s.length() + 1) / 2; i < s.length(); i++) { n if (r[s.length() - 1 - i]) { n cout << s[s.length() - 1 - i]; n } else { n cout << s[i]; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, k, key, MK, MKEY; n int MAP[110][110]; n int ii, jj; n void dfssolve(int pos, int step) { n int temp[110]; n int cnt, i, j; n if (pos > n) { n key = 1; n k = k < step ? k : step; n return; n } n cnt = 0; n for (i = 1; i <= m; ++i) { n temp[i] = MAP[pos][i]; n if (MAP[pos][i] != MAP[pos - 1][i]) { n cnt++; n MAP[pos][i] = MAP[pos - 1][i]; n } n } n if (step + cnt <= k) dfssolve(pos + 1, step + cnt); n cnt = 0; n for (i = 1; i <= m; ++i) { n if (temp[i] == MAP[pos - 1][i]) { n cnt++; n MAP[pos][i] = MAP[pos - 1][i] & 1; n } n } n if (step + cnt <= k) dfssolve(pos + 1, step + cnt); n for (i = 1; i <= m; ++i) MAP[pos][i] = temp[i]; n } n void dfssolveup(int pos, int step) { n int cnt, i, j; n int temp[110]; n if (pos < 1) { n MKEY = 1; n MK = step < MK ? step : MK; n return; n } n cnt = 0; n for (i = 1; i <= m; ++i) { n temp[i] = MAP[pos][i]; n if (MAP[pos][i] != MAP[pos + 1][i]) { n cnt++; n MAP[pos][i] = MAP[pos + 1][i]; n } n } n if (step + cnt <= k) dfssolveup(pos - 1, step + cnt); n cnt = 0; n for (i = 1; i <= m; ++i) { n if (temp[i] == MAP[pos + 1][i]) { n cnt++; n MAP[pos][i] = MAP[pos + 1][i] & 1; n } n } n if (step + cnt <= k) dfssolveup(pos - 1, step + cnt); n for (i = 1; i <= m; ++i) MAP[pos][i] = temp[i]; n } n void dfs(int pos, int step) { n if (k < step) return; n if (pos == m) { n dfssolve(2, step); n MAP[1][pos] ^= 1; n dfssolve(2, step + 1); n MAP[1][pos] ^= 1; n } else { n dfs(pos + 1, step); n MAP[1][pos] ^= 1; n dfs(pos + 1, step + 1); n MAP[1][pos] ^= 1; n } n } n int main() { n cin >> n >> m >> k; n key = 0; n if (n < m) { n for (ii = 1; ii <= n; ++ii) n for (jj = 1; jj <= m; ++jj) cin >> MAP[jj][ii]; n swap(n, m); n } else { n for (ii = 1; ii <= n; ++ii) n for (jj = 1; jj <= m; ++jj) cin >> MAP[ii][jj]; n } n if (n <= k) { n dfs(1, 0); n } else { n for (ii = 1; ii <= n; ++ii) { n MK = 10; n MKEY = 0; n dfssolveup(ii - 1, 0); n if (MKEY) { n dfssolve(ii + 1, MK); n } n } n } n if (key) n cout << k << endl; n else n cout << -1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n const long long N = 1e5 + 5; n long long ans = 1e18; n map mp; n void solve(long long n, long long cnt) { n if (!n) { n cout << cnt; n exit(0); n } n string s = to_string(n); n sort(s.rbegin(), s.rend()); n solve(n - (s[0] - 0 ), cnt + 1); n } n inline long long solve() { n long long n; n cin >> n; n solve(n, 0); n cout << ans; n return 0; n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n long long t = 1; n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, m, t, d; n cin >> n >> m; n map mp; n set > st; n vector a(n), c(n); n for (int i = 0; i < n; i++) { n cin >> a[i]; n mp[i] = a[i]; n } n for (int i = 0; i < n; i++) { n cin >> c[i]; n st.insert({c[i], i}); n } n for (int i = 0; i < m; i++) { n cin >> t >> d; n long long cost = 0; n t--; n if (st.size() == 0) n cout << 0 << endl; n else { n if (mp[t] != 0) { n if (mp[t] > d) { n mp[t] -= d; n cout << (long long)d * c[t] << endl; n d = 0; n } else if (mp[t] == d) { n mp[t] -= d; n cout << (long long)d * c[t] << endl; n d = 0; n st.erase({c[t], t}); n } else { n cost += (long long)mp[t] * c[t]; n d -= mp[t]; n mp[t] = 0; n st.erase({c[t], t}); n } n } n if (d > 0) { n while (d > 0 && st.size() > 0) { n pair now = *st.begin(); n if (mp[now.second] > d) { n mp[now.second] -= d; n cout << (long long)cost + d * now.first << endl; n d = 0; n } else if (mp[now.second] == d) { n mp[now.second] -= d; n cout << (long long)cost + d * now.first << endl; n d = 0; n st.erase(st.begin()); n } else { n cost += (long long)mp[now.second] * now.first; n d -= mp[now.second]; n mp[now.second] = 0; n st.erase(st.begin()); n } n } n if (d > 0) { n cout << 0 << endl; n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void pri(deque arr) { n for (int i : arr) cout << i << ; n cout << endl; n } n int main() { n string s; n cin >> s; n int n = s.size(); n if (n <= 3) { n cout << s[0] << endl; n return 0; n } n deque a1; n deque b1; n deque c1; n int as[n + 2]; n int bs[n + 2]; n int cs[n + 2]; n memset(as, 0, sizeof as); n memset(bs, 0, sizeof bs); n memset(cs, 0, sizeof cs); n as[0] = 0; n bs[0] = 0; n cs[0] = 0; n for (int i = 0; i < n; i++) { n if (s[i] == a ) { n a1.push_back(i); n as[i + 1]++; n } else if (s[i] == b ) { n b1.push_back(i); n bs[i + 1]++; n } else { n c1.push_back(i); n cs[i + 1]++; n } n as[i + 1] += as[i]; n bs[i + 1] += bs[i]; n cs[i + 1] += cs[i]; n } n int lim = -10; n int mx = 1000006; n string ans = ; n while (true) { n int a = lim; n int b = lim; n int c = lim; n if (a1.size() > 1) { n a = a1[a1.size() - 1] - a1[0]; n } n if (b1.size() > 1) { n b = b1[b1.size() - 1] - b1[0]; n } n if (c1.size() > 1) { n c = c1.back() - c1.front(); n } n int x = max(max(a, b), c); n if (x == lim) break; n int az = mx, bz = mx, cz = mx; n if (a1.size() > 0) { n az = as[a1[a1.size() - 1] + 1] - as[a1[0]]; n } n if (b1.size() > 0) { n bz = bs[b1[b1.size() - 1] + 1] - bs[b1[0]]; n } n if (c1.size() > 0) { n cz = cs[c1[c1.size() - 1] + 1] - cs[c1[0]]; n } n if (x > a) { n a = lim; n az = mx; n } n if (x > b) { n b = lim; n bz = mx; n } n if (x > c) { n c = lim; n cz = mx; n } n x += min(min(az, bz), cz); n a += az; n b += bz; n c += cz; n if (x == a) { n ans += a ; n while (b1.size() > 0 && b1[0] < a1[0]) b1.pop_front(); n while (b1.size() > 0 && b1[b1.size() - 1] > a1[a1.size() - 1]) n b1.pop_back(); n while (c1.size() > 0 && c1[0] < a1[0]) c1.pop_front(); n while (c1.size() > 0 && c1[c1.size() - 1] > a1[a1.size() - 1]) n c1.pop_back(); n a1.pop_front(); n a1.pop_back(); n } else if (x == b) { n ans += b ; n while (a1.size() > 0 && a1[0] < b1[0]) a1.pop_front(); n while (a1.size() > 0 && a1[a1.size() - 1] > b1[b1.size() - 1]) n a1.pop_back(); n while (c1.size() > 0 && c1[0] < b1[0]) c1.pop_front(); n while (c1.size() > 0 && c1[c1.size() - 1] > b1[b1.size() - 1]) n c1.pop_back(); n b1.pop_front(); n b1.pop_back(); n } else { n ans += c ; n while (b1.size() > 0 && b1[0] < c1[0]) b1.pop_front(); n while (b1.size() > 0 && b1[b1.size() - 1] > c1[c1.size() - 1]) n b1.pop_back(); n while (a1.size() > 0 && a1[0] < c1[0]) a1.pop_front(); n while (a1.size() > 0 && a1[a1.size() - 1] > c1[c1.size() - 1]) n a1.pop_back(); n c1.pop_front(); n c1.pop_back(); n } n } n string aux = ans; n reverse(aux.begin(), aux.end()); n if (c1.size() > 0) { n ans += c ; n } else { n if (b1.size() > 0) { n ans += b ; n } else { n if (a1.size()) { n ans += a ; n } n } n } n ans += aux; n if (ans.size() >= (int)n / 2) n cout << ans; n else n cout << IMPOSSIBLE ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n T modulo(T x, T p) { n if (x >= 0) return x % p; n return p + x % p; n } n template n T gcd(T a, T b) { n if (b == 0) return a; n return gcd(b, a % b); n } n template n T lcm(T a, T b) { n return a * b / gcd(a, b); n } n int dfs_paths( n int u, int prev, vector > > &G, n long long &cur, n priority_queue > > &pqw) { n long long paths, total = 0, profit; n for (pair e : G[u]) { n if (e.second == prev) continue; n paths = dfs_paths(e.second, u, G, cur, pqw); n profit = e.first * paths - (e.first / 2) * paths; n pqw.push({profit, {e.first, paths}}); n cur += e.first * paths; n total += paths; n } n return max(1ll, total); n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int t; n cin >> t; n while (t--) { n long long n, S; n cin >> n >> S; n vector > > G(n); n int u, v; n long long w; n for (int i = 0; i < n - 1; i++) { n cin >> u >> v >> w; n u--; n v--; n G[u].push_back({w, v}); n G[v].push_back({w, u}); n } n long long cur = 0; n priority_queue > > pqw; n dfs_paths(0, -1, G, cur, pqw); n long long moves = 0, mult; n pair > e; n while (cur > S) { n e = pqw.top(); n pqw.pop(); n w = e.second.first / 2; n mult = e.second.second; n cur -= e.first; n pqw.push({w * mult - (w / 2) * mult, {w, mult}}); n moves++; n } n cout << moves << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int long long l1, l2, r1, r2, k, ans, l, r; n cin >> l1; n cin >> r1; n cin >> l2; n cin >> r2; n cin >> k; n l = max(l1, l2); n r = min(r1, r2); n if (r - l < 0) { n cout << 0 << endl; n return 0; n } n ans = r - l + 1; n if (k >= l && k <= r) ans--; n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n clock_t __stt; n inline void TStart() { __stt = clock(); } n inline void TReport() { n cerr << fixed << setprecision(3) << nCurrent Case Taken Time : n << (double)(clock() - __stt) / CLOCKS_PER_SEC << sec n ; n } n template n T MIN(T a, T b) { n return a < b ? a : b; n } n template n T MAX(T a, T b) { n return a > b ? a : b; n } n template n T ABS(T a) { n return a > 0 ? a : (-a); n } n template n void UMIN(T &a, T b) { n if (b < a) a = b; n } n template n void UMAX(T &a, T b) { n if (b > a) a = b; n } n int n, m, p[100005], s[100005], b[100005], inc[100005], pref[100005]; n struct ele { n int A, B, C, id; n void set(int _A, int _B, int _C, int _id) { n A = _A; n B = _B; n C = _C; n id = _id; n } n } es[100005], et[100005]; n struct qry { n int Al, Ar, B, C; n void set(int _Al, int _Ar, int _B, int _C) { n Al = _Al; n Ar = _Ar; n B = _B; n C = _C; n } n } qs[100005], qt[100005]; n namespace BIT { n int arr[300005]; n void add(int p, int v = 1) { n ++p; n while (p <= 300002) { n arr[p] += v; n p += (p & (-p)); n } n } n void clr(int p) { n ++p; n while (p <= 300002) { n arr[p] = 0; n p += (p & (-p)); n } n } n int sum(int p) { n int r = 0; n ++p; n while (p) { n r += arr[p]; n p -= (p & (-p)); n } n return r; n } n } // namespace BIT n bool cmpB(ele a, ele b) { return a.B < b.B; } n bool cmpC(ele a, ele b) { return a.C < b.C; } n bool cmpBq(qry a, qry b) { return a.B < b.B; } n bool cmpCq(qry a, qry b) { return a.C < b.C; } n vector vs; n int id(int v) { return lower_bound(vs.begin(), vs.end(), v) - vs.begin(); } n int res[100005]; n void solve2d(ele *E, int ec, qry *Q, int qc) { n int i, j, k; n sort(E, E + ec, cmpB); n sort(Q, Q + qc, cmpBq); n reverse(Q, Q + qc); n reverse(E, E + ec); n j = 0; n for (i = 0; i < ec; ++i) { n int cB = E[i].B; n while (j < qc && Q[j].B >= cB) { n BIT::add(Q[j].Al, 1); n BIT::add(Q[j].Ar + 1, -1); n ++j; n } n res[E[i].id] += BIT::sum(E[i].A); n } n for (i = 0; i < qc; ++i) { n BIT::clr(Q[i].Al); n BIT::clr(Q[i].Ar + 1); n } n } n void solve(int cl, int cr, int ql, int qr, int el, int er) { n if (ql > qr || el > er) return; n int i, j, k; n if (cl == cr) { n solve2d(es + el, er - el + 1, qs + ql, qr - ql + 1); n return; n } n memcpy(et + el, es + el, sizeof(ele) * (er - el + 1)); n memcpy(qt + ql, qs + ql, sizeof(qry) * (qr - ql + 1)); n int cM = ((long long)cl + (long long)cr) / 2ll, qM, eM; n for (qM = ql; qM <= qr; ++qM) { n if (qt[qM].C <= cM && (qM == qr || qt[qM + 1].C > cM)) break; n } n if (qt[ql].C > cM) qM = ql - 1; n for (eM = el; eM <= er; ++eM) { n if (et[eM].C <= cM && (eM == er || et[eM + 1].C > cM)) break; n } n if (et[el].C > cM) eM = el - 1; n if (er > eM && qM >= ql) solve2d(et + eM + 1, er - eM, qt + ql, qM - ql + 1); n solve(cl, cM, ql, qM, el, eM); n solve(cM + 1, cr, qM + 1, qr, eM + 1, er); n } n int main() { n int i, j, k; n scanf( %d%d , &n, &m); n for (i = 0; i < n; ++i) scanf( %d , p + i); n for (i = 0; i < n; ++i) scanf( %d , s + i); n for (i = 0; i < n; ++i) scanf( %d , b + i); n for (i = 0; i < m; ++i) scanf( %d , inc + i); n for (i = 0; i < m; ++i) scanf( %d , pref + i); n for (i = 0; i < n; ++i) { n qs[i].Al = p[i]; n qs[i].Ar = s[i]; n vs.push_back(p[i]); n vs.push_back(s[i]); n qs[i].B = b[i] - p[i]; n qs[i].C = b[i] + p[i]; n } n for (j = 0; j < m; ++j) { n es[j].A = inc[j]; n vs.push_back(inc[j]); n es[j].B = pref[j] - inc[j]; n es[j].C = pref[j] + inc[j]; n es[j].id = j; n } n sort(vs.begin(), vs.end()); n vs.erase(unique(vs.begin(), vs.end()), vs.end()); n for (i = 0; i < n; ++i) { n qs[i].Al = id(qs[i].Al); n qs[i].Ar = id(qs[i].Ar); n } n for (j = 0; j < m; ++j) { n es[j].A = id(es[j].A); n } n sort(es, es + m, cmpC); n sort(qs, qs + n, cmpCq); n solve(0, (int)2e9 + 5, 0, n - 1, 0, m - 1); n for (i = 0; i < m; ++i) { n printf( %d , res[i]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n scanf( %d , &t); n while (t--) { n long long x1, y1, x2, y2; n scanf( %lld%lld%lld%lld , &x1, &y1, &x2, &y2); n long long lenx = abs(x1 - x2); n long long leny = abs(y1 - y2); n long long ans = lenx + leny; n if (lenx && leny) ans += 2; n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n; n cin >> n; n cout << n % 2; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n while (cin >> n) { n vector vec; n for (long long i = 2; i * i <= n; i++) { n while (n % i == 0) { n vec.push_back(i); n n /= i; n } n } n if (n > 1) { n vec.push_back(n); n } n if (vec.size() < 2) { n printf( 1 n0 n ); n } else if (vec.size() == 2) { n printf( 2 n ); n } else { n printf( 1 n%lld n , vec[0] * vec[1]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, num, cnt; n int dat[1009][1009], ans[1000009]; n bool vis[1009][1009]; n int dx[4] = {-1, 0, 1, 0}; n int dy[4] = {0, 1, 0, -1}; n int wall[4] = {8, 4, 2, 1}; n void dfs(int x, int y) { n if (vis[x][y] || x < 0 || x > n || y < 0 || y > m) return; n vis[x][y] = 1; n num++; n for (int i = 0; i < 4; i++) { n if ((dat[x][y] & wall[i]) || n (dat[x + dx[i]][y + dy[i]] & wall[(i + 2) % 4])) n continue; n dfs(x + dx[i], y + dy[i]); n } n } n int main() { n cin >> n >> m; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n cin >> dat[i][j]; n } n } n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n if (!vis[i][j]) { n num = 0; n dfs(i, j); n ans[++cnt] = num; n } n } n } n sort(ans + 1, ans + 1 + cnt); n for (int i = cnt; i > 0; i--) cout << ans[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, m, ind, sum = 0; n cin >> n; n long long mas[n]; n for (long long i = 0; i < n; i++) { n cin >> mas[i]; n sum += mas[i]; n } n cin >> m; n long long arr[m]; n sort(mas, mas + n); n for (long long i = 0; i < m; i++) { n cin >> arr[i]; n cout << sum - mas[n - arr[i]] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, nxt[200010], a[200010], sz[200010][31]; n long long ans = 0; n map mp; n inline char gc() { n static char *S, *T, buf[1 << 16]; n if (T == S) { n T = (S = buf) + fread(buf, 1, 1 << 16, stdin); n if (T == S) return EOF; n } n return *S++; n } n inline int read() { n int x = 0, f = 1; n char ch = gc(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = gc(); n } n while ( 0 <= ch && ch <= 9 ) x = x * 10 + ch - 0 , ch = gc(); n return x * f; n } n inline int check(int l, int r) { n int res = 0; n for (int i = 0; i <= 30; ++i) res |= ((sz[r][i] - sz[l - 1][i]) > 0) << i; n return res; n } n int main() { n n = read(); n for (int i = 1; i <= n; ++i) { n a[i] = read(), nxt[i] = mp[a[i]], mp[a[i]] = i; n for (int j = 0; j <= 30; ++j) { n sz[i][j] = sz[i - 1][j]; n if (a[i] & (1 << j)) sz[i][j]++; n } n } n for (int i = 1; i <= n; ++i) { n int l = max(nxt[i] + 1, 1), r = i, nowl = i; n while (l <= r) { n int mid = l + r >> 1; n if (check(mid, i) == a[i]) n nowl = mid, r = mid - 1; n else n l = mid + 1; n } n l = i, r = n; n int nowr = i; n while (l <= r) { n int mid = l + r >> 1; n if (check(i, mid) == a[i]) n nowr = mid, l = mid + 1; n else n r = mid - 1; n } n ans += 1ll * (i - nowl + 1) * (nowr - i + 1); n } n printf( %I64d n , 1ll * n * (n + 1) / 2 - ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, t, twoc, onec, opt, old; n int main() { n cin >> n; n cin >> t; n if (t == 1) n onec++; n else n twoc++; n old = t; n for (int i = 1; i < n; i++) { n cin >> t; n if (t == 1) { n if (old == 2) n onec = 1; n else n onec++; n } else { n if (old == 1) n twoc = 1; n else n twoc++; n } n opt = max(opt, min(onec, twoc)); n old = t; n } n cout << opt * 2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int ar[1000001]; n int main() { n int n, k; n cin >> n >> k; n if (k == n) { n cout << -1 << endl; n return 0; n } n if (k == n - 1) { n for (int i = 0; i < n; i++) cout << i + 1 << ; n cout << endl; n return 0; n } n for (int i = 2; i <= k + 1; i++) ar[i] = i; n ar[1] = k + 2; n ar[n] = 1; n for (int i = k + 2; i < n; i++) ar[i] = i + 1; n for (int i = 1; i <= n; i++) cout << ar[i] << ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int pow(int a, int b, int c) { n int ret = 1; n for (; b; b >>= 1, a = 1LL * a * a % c) n if (b & 1) ret = 1LL * ret * a % c; n return ret; n } n const int N = 2e3 + 10, M = 4.05e6 + 10; n int h[N], g[N], p[M], n1[M], ee, low[N], dfn[N], dfntot, vis[N], n, m, st[N], n top, id[N], tot, sz[N], ans, dp[N], ok[N]; n pair e[M]; n void ae(int *A, int x, int y) { n p[ee] = y; n n1[ee] = A[x]; n A[x] = ee++; n } n void tarjan(int u, int fa) { n vis[u] = 1; n low[u] = dfn[u] = ++dfntot; n st[++top] = u; n for (int i = h[u]; ~i; i = n1[i]) n if (p[i] != fa) { n if (!vis[p[i]]) n tarjan(p[i], u), low[u] = min(low[u], low[p[i]]); n else n low[u] = min(low[u], dfn[p[i]]); n if (low[p[i]] > dfn[u]) { n ++tot; n while (st[top] != p[i]) id[st[top--]] = tot, sz[tot]++; n id[st[top--]] = tot; n sz[tot]++; n } n } n } n void dfs(int u, int fa) { n dp[u] = sz[u]; n for (int i = g[u]; ~i; i = n1[i]) n if (p[i] != fa) { n dfs(p[i], u); n dp[u] += dp[p[i]]; n } n } n int main() { n scanf( %d%d , &n, &m); n memset(h, -1, sizeof(h)); n memset(g, -1, sizeof(g)); n int x, y; n for (int i = 1; i <= m; i++) scanf( %d%d , &x, &y), ae(h, x, y), ae(h, y, x); n for (int i = 1; i <= n; i++) n if (!vis[i]) tarjan(i, 0); n ++tot; n while (top) id[st[top--]] = tot, sz[tot]++; n for (int i = 1; i <= n; i++) n for (int j = h[i]; ~j; j = n1[j]) n if (id[i] != id[p[j]]) ae(g, id[i], id[p[j]]); n for (int i = 1; i <= tot; i++) ans += sz[i] * (sz[i] - 1); n int ret = 0; n for (int i = 1; i <= tot; i++) { n int tmp = 0; n dfs(i, 0); n for (int j = 1; j <= tot; j++) tmp += (dp[j] - sz[j]) * sz[j]; n for (int j = 0; j <= n; j++) ok[j] = 0; n ok[0] = 1; n for (int k = g[i]; ~k; k = n1[k]) n for (int j = n; j >= dp[p[k]]; j--) ok[j] |= ok[j - dp[p[k]]]; n int mx = 0; n for (int j = 0; j <= n; j++) n if (ok[j]) mx = max(mx, j * (n - sz[i] - j)); n ret = max(ret, tmp + mx); n } n printf( %d n , n + ans + ret); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int m = 1000000007; n long long int n1, n2 = 0, sum = 0; n long long int gcd(long long int a, long long int b) { n return (b == 0) ? a : gcd(b, a % b); n } n bool compare(pair p1, pair p2) { n if (p1.second != p2.second) { n return p1.second > p2.second; n } else n return p1.first < p2.first; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long int t = 1; n while (t--) { n long long int n; n cin >> n; n bool prime[n + 2]; n memset(prime, true, sizeof(prime)); n for (long long int p = 2; p * p <= n + 1; p++) { n if (prime[p] == true) { n for (long long int i = p * p; i <= n + 1; i += p) prime[i] = false; n } n } n if (n > 2) n cout << 2 << n ; n else n cout << 1 << n ; n for (long long int i = 2; i < n + 2; i++) { n if (prime[i]) n cout << 1 << ; n else n cout << 2 << ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937_64 mt(time(0)); n set > dp[49]; n void insert(set >& table, long long a, long long b) { n if (table.empty()) { n table.insert({a, b}); n return; n } n auto it = table.lower_bound({b, LLONG_MAX}); n while (it != table.begin()) { n it--; n if (it->second < a) break; n a = min(it->first, a); n b = max(it->second, b); n if (it == table.begin()) { n table.erase(it); n break; n } else { n table.erase(it++); n } n } n table.insert({a, b}); n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cout.precision(10); n cout << fixed; n long long n; n cin >> n; n for (int i = 0; i <= min(48LL, n); i++) { n for (int j = 0; j <= 8 && i + j <= n; j++) { n int tmp = i * 9 + j * 4; n long long a = tmp / 49; n long long b = n - i - j + tmp / 49; n insert(dp[tmp % 49], a, b); n } n } n long long ret = 0; n for (int i = 0; i < 49; i++) { n for (auto item : dp[i]) { n ret += item.second - item.first + 1; n } n } n cout << ret << endl; n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n, i; n long long cnt[5] = {0}; n char ch; n scanf( %d , &n); n getchar(); n cnt[0] = 1; n for (i = 0; i < n; i++) { n scanf( %c , &ch); n if (ch == a ) { n cnt[1] = (cnt[1] + cnt[0]) % 1000000007; n } else if (ch == b ) { n cnt[2] = (cnt[2] + cnt[1]) % 1000000007; n } else if (ch == c ) { n cnt[3] = (cnt[3] + cnt[2]) % 1000000007; n } else if (ch == ? ) { n cnt[3] = (3 * cnt[3] % 1000000007 + cnt[2]) % 1000000007; n cnt[2] = (3 * cnt[2] % 1000000007 + cnt[1]) % 1000000007; n cnt[1] = (3 * cnt[1] % 1000000007 + cnt[0]) % 1000000007; n cnt[0] = 3 * cnt[0] % 1000000007; n } n } n printf( %lld n , cnt[3]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using namespace std; n struct node { n int l, m, r; n }; n node t[3000005]; n int arr[300005], n, m; n long long a[300005]; n int sign(long long x) { n if (x > 0) return 1; n if (x < 0) return -1; n return 0; n } n void cal(int x, int l, int r) { n int m = (l + r) / 2; n t[x].m = max(t[x * 2].m, t[x * 2 + 1].m); n t[x].l = t[x * 2].l; n t[x].r = t[x * 2 + 1].r; n if (!!a[m] && !!a[m + 1] && sign(a[m]) >= sign(a[m + 1])) { n t[x].m = max(t[x].m, t[x * 2].r + t[x * 2 + 1].l); n if (t[2 * x].m == m - l + 1) t[x].l = t[2 * x].l + t[2 * x + 1].l; n if (t[2 * x + 1].m == r - m) t[x].r = t[2 * x].r + t[2 * x + 1].r; n } n } n void build(int x, int l, int r) { n if (l == r) { n int tmp = !!a[l]; n t[x] = {tmp, tmp, tmp}; n return; n } n int m = (l + r) / 2; n build(x * 2, l, m); n build(x * 2 + 1, m + 1, r); n cal(x, l, r); n } n void update(int x, int l, int r, int pos, int d) { n if (l == r) { n a[pos] += d; n int tmp = !!a[pos]; n t[x] = {tmp, tmp, tmp}; n return; n } n int m = (l + r) / 2; n if (pos <= m) n update(x * 2, l, m, pos, d); n else n update(x * 2 + 1, m + 1, r, pos, d); n cal(x, l, r); n } n int main() { n cin >> n; n for (int i = 0; i < n; i++) scanf( %d , &arr[i]); n for (int i = 0; i + 1 < n; i++) a[i] = arr[i + 1] - arr[i]; n if (n > 1) build(1, 0, n - 2); n cin >> m; n while (m--) { n int l, r, d; n scanf( %d%d%d , &l, &r, &d); n if (n == 1) { n printf( %d n , 1); n continue; n } n if (l > 1) update(1, 0, n - 2, l - 2, d); n if (r < n) update(1, 0, n - 2, r - 1, -d); n printf( %d n , t[1].m + 1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = int(1e9); n const int MOD = INF + 7; n const long long INFll = 1ll * INF * INF; n const long double ldINF = 1e+018; n const long double EPS = 0.000000001; n const int MAXN = 150; n const int N = 100001; n const int seg[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6}; n struct feature { n int b, i, r; n }; n bool comp(feature x, feature y) { n return x.r > y.r || (x.r == y.r && x.b < y.b); n } n int t[1001000]; n int cur = 0; n int query(int l, int r) { n int res = 0; n for (l += cur, r += cur; l < r; l >>= 1, r >>= 1) { n if (l & 1) res = max(res, t[l++]); n if (r & 1) res = max(res, t[--r]); n } n return res; n } n void modify(int p, int value) { n t[p += cur] = value; n while (p > 1) { n p >>= 1; n t[p] = max(t[p << 1], t[p << 1 | 1]); n } n } n int main() { n ios_base::sync_with_stdio(0); n int n; n cin >> n; n vector v(n); n for (int i = 0; i < n; i++) cin >> v[i].r; n for (int i = 0; i < n; i++) cin >> v[i].b; n for (int i = 0; i < n; i++) cin >> v[i].i; n vector b; n for (int i = 0; i < n; i++) b.push_back(v[i].b); n sort(b.begin(), b.end()); n map m; n m[b[0]] = 0; n for (int i = 1; i < n; i++) n if (b[i] != b[i - 1]) m[b[i]] = ++cur; n cur++; n for (int i = 0; i < n; i++) v[i].b = m[v[i].b]; n int ans = 0; n sort(v.begin(), v.end(), comp); n for (int i = 0; i < n; i++) { n int d = query(v[i].b + 1, cur); n if (d > v[i].i) { n ans++; n } n modify(v[i].b, max(t[v[i].b + cur], v[i].i)); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long int t = 1; n while (t--) { n long long int n, d = 0, r = 0; n cin >> n; n string s; n cin >> s; n char x; n for (long long int i = 0; i < s.length(); i++) { n if (s[i] == R ) { n if (d) { n d--; n } else { n s += R ; n r++; n } n } else { n if (r) { n r--; n } else { n s += D ; n d++; n } n } n x = s[i]; n if (d == n || r == n) { n break; n } n } n cout << x << endl; n } n return 0; n } n "} +{"func_code_string": "#include n #define fasterio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) n #define X first n #define Y second n #define forn(i, n) for(int i=0;i<(n);i++) n #define pb push_back n using namespace std; n typedef long long ll; n typedef pair pii; n const int inf = 0x3f3f3f3f; n const long long mod = 1e9+7; n const long long maxn = 100010; n n int gao (int x1, int y1, int x2, int y2, int xf, int yf) { n auto abs = [&](int a, int b){return a>b?a-b:b-a;}; n int ans = abs(x1, x2) + abs(y1, y2); n n if (x1 == x2 && y1 == y2) { n return ans; n } else if (x1 == x2 && x2 == xf) { // on the same x axis n if ((y1>t; n while(t--) { n int xa, ya, xb, yb, xf, yf; n cin>>xa>>ya>>xb>>yb>>xf>>yf; n n if(xa==xb && ya==yb) { n cout<<0< n using namespace std; n int l_f, l_h; n long long int dp[101][101][11][11]; n int getans(int f, int h, int k1, int k2) { n int x = 0, y = 0; n if ((f + h) == 0) return 1; n if (dp[f][h][k1][k2] != -1) return dp[f][h][k1][k2]; n if (f > 0 && k1 > 0) x = getans(f - 1, h, k1 - 1, l_h); n if (h > 0 && k2 > 0) y = getans(f, h - 1, l_f, k2 - 1); n return dp[f][h][k1][k2] = (x + y) % 100000000; n } n int main() { n int t = 1; n while (t--) { n int n1, n2; n cin >> n1 >> n2 >> l_f >> l_h; n memset(dp, -1, sizeof(dp)); n int ans = getans(n1, n2, l_f, l_h); n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n cin >> n; n map mp; n map::iterator it; n for (int i = 0; i < n; ++i) { n string x, y; n cin >> x >> y; n it = mp.begin(); n bool found = false; n for (; it != mp.end(); ++it) { n if (it->second == x) { n it->second = y; n found = true; n } n } n if (!found) mp[x] = y; n } n cout << mp.size() << endl; n it = mp.begin(); n for (; it != mp.end(); it++) cout << it->first << << it->second << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n pair h[100010], h1[100010]; n long long cnt[100010], pre[100010], sum[100010]; n int num[100010], mx[100010], n, tt, t1; n inline int rd() { n int x = 0; n char ch = getchar(); n for (; ch < 0 || ch > 9 ; ch = getchar()) n ; n for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; n return x; n } n inline int gcd(int x, int y) { return (!y) ? x : gcd(y, x % y); } n inline long long calc(long long l, long long r) { n return (l + r) * (r - l + 1) / 2; n } n inline long long anol_gcd(long long n, long long a, long long b, long long c) { n if (n < 0) return 0; n if (!a) return (b / c) * (n + 1); n if (a >= c || b >= c) n return (a / c) * n * (n + 1) / 2 + (b / c) * (n + 1) + n anol_gcd(n, a % c, b % c, c); n long long hh = (a * n + b) / c; n return n * hh - anol_gcd(hh - 1, c, c - b - 1, a); n } n inline long long gao(int x, int y, long long mid) { n if (!cnt[x] || !cnt[y]) return 0; n mid -= pre[y - 1] - pre[x]; n if (mid < 0) return 0; n long long mn = (mid - cnt[y] * y) / x; n mn = max(mn, 0LL); n if (mn >= cnt[x]) return cnt[x] * cnt[y]; n long long res = mn * cnt[y]; n mn++; n long long mx = mid / x; n mx = min(mx, cnt[x]); n if (mn <= mx) res += anol_gcd(mx - mn, x, mid - mx * x, y); n return res; n } n inline long long check(long long mid) { n long long res = 0; n int now = 1; n for (int i = 1; i <= 100000; i++) { n now = max(now, i); n long long hh = min(mid / i, cnt[i]); n if (cnt[i]) res += calc(cnt[i] - hh + 1, cnt[i]); n while (now + 1 <= 100000 && pre[now + 1] - pre[i - 1] <= mid) now++; n res += (sum[now] - sum[i]) * cnt[i]; n mx[i] = now; n } n for (int i = 1; i <= 100000; i++) n for (int j = mx[i] + 1; j <= min(mx[i + 1] + 1, 100000); j++) n res += gao(i, j, mid); n return res; n } n int main() { n n = rd(); n for (int i = 1; i <= n; i++) num[i] = rd(); n cnt[num[1]]++; n h[tt = 1] = pair(1, num[1]); n for (int i = 2; i <= n; i++) { n t1 = tt; n for (int j = 1; j <= t1; j++) n h1[j] = h[j], h1[j].second = gcd(h1[j].second, num[i]); n h1[++t1] = pair(1, num[i]); n tt = 0; n for (int j = 1; j <= t1;) { n int k = j, now = 0; n for (; k <= t1 && h1[k].second == h1[j].second; k++) now += h1[k].first; n h[++tt] = pair(now, h1[j].second); n j = k; n } n for (int j = 1; j <= tt; j++) cnt[h[j].second] += h[j].first; n } n for (int i = 1; i <= 100000; i++) n pre[i] = pre[i - 1] + cnt[i] * i, sum[i] = sum[i - 1] + cnt[i]; n long long all = (long long)n * (n + 1) / 2; n all = all * (all + 1) / 2; n all = (all + 1) / 2; n long long l = 0, r = (long long)n * (n + 1) / 2 * 100000; n while (l < r) { n long long mid = (l + r) >> 1; n if (check(mid) >= all) n r = mid; n else n l = mid + 1; n } n printf( %lld n , l); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int w[505], p[1005], t[5001], was[105]; n int main() { n int a, b, c, d, f = 0, n, m, x, y, i, j; n memset(was, 0, sizeof was); n memset(t, 0, sizeof t); n scanf( %d %d , &n, &m); n for (a = 1; a <= n; a++) scanf( %d , &w[a]); n for (a = 1; a <= m; a++) scanf( %d , &p[a]); n t[1] = p[1]; n d = 2; n for (a = 2; a <= m; a++) { n y = 0; n for (i = 1; i < d; i++) { n if (t[i] == p[a]) { n for (b = i; b > 1; b--) { n t[b] = t[b - 1]; n f += w[t[b]]; n } n t[1] = p[a]; n y = 1; n break; n } n } n if (y == 0) { n for (b = d; b > 1; b--) { n t[b] = t[b - 1]; n f += w[t[b]]; n } n t[1] = p[a]; n d++; n } n } n printf( %d n , f); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n const int maxn = 4001; n long long dp[maxn], c[maxn][maxn], s[maxn][maxn], sum[maxn]; n long long pow(int k) { n if (k == 0) return 1LL; n if (k == 1) return 2LL; n long long ans = pow(k >> 1); n ans *= ans; n if (k % 2) ans *= 2LL; n return (ans % 1000000007); n } n void pre() { n c[0][0] = c[1][0] = c[1][1] = 1LL; n s[1][0] = 0; n s[1][1] = 1LL; n for (int i = 2; i <= n; i++) { n c[i][0] = 1LL; n s[i][0] = 0; n for (int j = 1; j <= i; j++) { n c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000007; n s[i][j] = (j * s[i - 1][j] + s[i - 1][j - 1]) % 1000000007; n } n } n for (int i = 1; i <= n; i++) n for (int j = 0; j <= i; j++) sum[i] = (sum[i] + s[i][j]) % 1000000007; n } n int main() { n cin >> n; n pre(); n dp[1] = 1; n dp[2] = 3; n for (int i = 3; i <= n; i++) { n dp[i] = 1; n for (int j = 1; j <= n - 1; j++) n dp[i] = (dp[i] + (dp[j] + sum[j]) * c[i - 1][j]) % 1000000007; n } n if (dp[n] < 0) dp[n] += 1000000007; n printf( %I64d n , dp[n]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, a[101], m; n int main() { n m = 101; n cin >> n >> k; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n if (k % a[i] == 0) m = min(m, k / a[i]); n } n cout << m; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int cnt[50]; n int main() { n int n, k; n cin >> n >> k; n int aa; n for (int i = 0; i < n; i++) { n int tmp = 0; n for (int j = k - 1; j >= 0; j--) { n scanf( %d , &aa); n tmp += (aa << j); n } n cnt[tmp]++; n } n if (cnt[0]) { n cout << YES ; n return 0; n } n int tot = (1 << k) - 1; n for (int i = 1; i <= tot; i++) { n if (cnt[i]) { n for (int j = 1; j <= tot; j++) { n if (cnt[j] && (i & j) == 0) { n cout << YES ; n return 0; n } n } n } n } n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline void read(int &x) { n x = 0; n int f = 1; n char c = getchar(); n while (c > 9 || c < 0 ) { n if (c == - ) f = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) n x = (x << 1) + (x << 3) + (c ^ 48), c = getchar(); n x *= f; n } n const int maxn = 100100; n struct node { n int v, nxt; n } e[maxn]; n int head[maxn], tot; n inline void add(int x, int y) { n tot++; n e[tot].v = y; n e[tot].nxt = head[x]; n head[x] = tot; n } n struct AA { n int s, num; n }; n map h; n vector ask[maxn]; n set hip[maxn]; n int n, q, s, t, cnt, name[maxn], dep[maxn], son[maxn], size[maxn], ans[maxn]; n bool vis[maxn]; n char ch[30]; n inline void dfs1(int x, int fa) { n size[x] = 1; n dep[x] = dep[fa] + 1; n for (int i = head[x]; i; i = e[i].nxt) { n int v = e[i].v; n if (v == fa) continue; n dfs1(v, x); n size[x] += size[v]; n if (son[x] == 0 || size[v] > size[son[x]]) son[x] = v; n } n } n inline void calc(int x, int fa) { n hip[dep[x]].insert(name[x]); n for (int i = head[x]; i; i = e[i].nxt) { n int v = e[i].v; n if (v == fa || vis[v]) continue; n calc(v, x); n } n } n inline void dfs2(int x, int fa, int keep) { n for (int i = head[x]; i; i = e[i].nxt) { n int v = e[i].v; n if (v == fa || v == son[x]) continue; n dfs2(v, x, 0); n } n if (son[x]) dfs2(son[x], x, 1), vis[son[x]] = true; n calc(x, fa); n vis[son[x]] = false; n for (int i = 0; i < ask[x].size(); i++) { n if (dep[x] + ask[x][i].s <= n) n ans[ask[x][i].num] = hip[dep[x] + ask[x][i].s].size(); n } n if (!keep) { n for (int i = dep[x]; !hip[i].empty(); i++) { n hip[i].clear(); n } n } n } n int main() { n read(n); n for (int i = 1; i <= n; i++) { n scanf( %s , ch); n if (h.find(ch) == h.end()) h[ch] = ++cnt; n name[i] = h[ch]; n read(s), add(s, i); n } n read(q); n AA tmp; n for (int i = 1; i <= q; i++) { n read(s), read(t); n tmp.s = t; n tmp.num = i; n ask[s].push_back(tmp); n } n dep[0] = -1; n dfs1(0, 0); n dfs2(0, 0, 1); n for (int i = 1; i <= q; i++) printf( %d n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector v[250005]; n int visited[250005]; n int n, m, x, y; n void zero() { n for (int i = 0; i <= n + 2; i++) { n visited[i] = 0; n v[i].clear(); n } n } n void bipartite(int u) { n if (visited[u] == 1) { n x++; n } else if (visited[u] == 2) { n y++; n } n for (int i = 0; i < v[u].size(); i++) { n int a = v[u][i]; n if (visited[a] == 0 && visited[u] == 1) { n visited[a] = 2; n bipartite(a); n } else if (visited[a] == 0 && visited[u] == 2) { n visited[a] = 1; n bipartite(a); n } n } n } n int main() { n int i, a, b, t; n scanf( %d , &t); n while (t--) { n scanf( %d %d , &n, &m); n zero(); n for (i = 1; i <= m; i++) { n scanf( %d %d , &a, &b); n v[a].push_back(b); n v[b].push_back(a); n } n visited[1] = 1; n x = 0; n y = 0; n bipartite(1); n printf( %d n , min(x, y)); n if (x <= y) { n for (i = 1; i <= n; i++) { n if (visited[i] == 1) { n printf( %d , i); n } n } n } else { n for (i = 1; i <= n; i++) { n if (visited[i] == 2) { n printf( %d , i); n } n } n } n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC optimize( unroll-loops ) n using namespace std; n using ll = long long; n using db = long double; n using ii = pair; n const int N = 1e7 + 5, LG = 19, MOD = 1e9 + 7; n const int SQ = 225; n const long double EPS = 1e-7; n int fast(int b, int e) { n int res = 1; n for (; e; e >>= 1, b = 1ll * b * b % MOD) n if (e & 1) res = 1ll * res * b % MOD; n return res; n } n vector adj[10005]; n int n, k; n map> mat; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> n >> k; n vector deg(n + 1); n for (int i = 1; i <= k; i++) n for (int j = i + 1; j <= k; j++) { n adj[j].push_back(i); n deg[j]++; n deg[i]++; n } n for (int i = k + 1; i <= n; i++) { n for (int j = 0; j < k; j++) { n int x; n cin >> x; n adj[i].push_back(x); n deg[i]++; n deg[x]++; n } n } n for (int i = 1; i <= n; i++) { n mat[i][i] = deg[i]; n for (auto x : adj[i]) { n mat[i][x] = MOD - 1; n mat[x][i] = MOD - 1; n } n } n ll ans = 1; n for (int i = n; i >= 2; --i) { n ll v = mat[i][i]; n ll inv = fast(MOD - v, MOD - 2); n ans = 1ll * ans * v % MOD; n for (auto j : adj[i]) { n ll coff = inv * mat[j][i] % MOD; n for (auto k : adj[i]) { n mat[j][k] = (mat[j][k] + mat[i][k] * coff) % MOD; n } n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000007; n long long powermodm(long long x, long long n, long long M) { n long long result = 1; n while (n > 0) { n if (n % 2 == 1) result = (result * x) % M; n x = (x * x) % M; n n = n / 2; n } n return result; n } n long long power(long long _a, long long _b) { n long long _r = 1; n while (_b) { n if (_b % 2 == 1) _r = (_r * _a); n _b /= 2; n _a = (_a * _a); n } n return _r; n } n long long gcd(long long a, long long b) { n if (a == 0) return b; n return gcd(b % a, a); n } n long long lcm(long long a, long long b) { n return (max(a, b) / gcd(a, b)) * min(a, b); n } n long long modInverse(long long x) { return powermodm(x, mod - 2, mod); } n long long fact[100005]; n long long ncrmodm(long long n, long long r, long long m) { n return (fact[n] * (modInverse(fact[n - r]) * modInverse(fact[r])) % m) % m; n } n void init_fact() { n fact[0] = 0; n for (long long i = 1; i < 100001; i++) fact[i] = fact[i - 1] * i; n } n void write(long long a[], long long n) { n for (long long i = 0; i < n; i++) cout << a[i] << ; n cout << endl; n } n void show(vector v) { n for (long long i = 0; i < v.size(); i++) cout << v[i] << ; n cout << endl; n } n vector > vec; n vector visited; n void dfs(int x, int p = -1) { n visited[x] = 1; n for (int i = 0; i < vec[x].size(); i++) { n if (p == vec[x][i]) continue; n if (!visited[vec[x][i]]) { n visited[vec[x][i]] = 1; n dfs(vec[x][i], x); n } n } n } n bool prime[100000]; n void seive() { n int n = 100000; n memset(prime, true, sizeof(prime)); n for (int p = 2; p * p <= n; p++) { n if (prime[p] == true) { n for (int i = p * p; i <= n; i += p) prime[i] = false; n } n } n } n void solve() { n long long n, k; n cin >> n >> k; n long long a[n]; n long long ma = -INT_MAX, mi = INT_MAX; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n ma = max(ma, a[i]); n mi = min(mi, a[i]); n } n if (k % 2) { n for (long long i = 0; i < n; i++) { n cout << ma - a[i] << ; n } n cout << endl; n } else { n for (long long i = 0; i < n; i++) { n cout << -mi + a[i] << ; n } n cout << endl; n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t = 1; n cin >> t; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void extgcd(long long a, long long b, long long& x, long long& y) { n if (b == 0) { n assert(a == 1); n x = 1, y = 0; n return; n } n extgcd(b, a % b, y, x); n y -= a / b * x; n } n int inv(int a, int c) { n long long x, y; n extgcd(a, c, x, y); n return (x % c + c) % c; n } n long long modpow(long long a, int b, int c) { n long long res = 1; n for (; b; b >>= 1) { n if (b & 1) res = res * a % c; n a = a * a % c; n } n return res; n } n const int MAXN = 100005, MAXT = 262150; n int num[10], tot, n, m, Q, tn; n struct Value { n int cnt[10]; n long long rest; n void clear() { n memset(cnt, 0, sizeof(cnt)); n rest = 1; n } n Value() { clear(); } n Value& operator*=(int x) { n for (int i = 0; i < tot; i++) n while (x % num[i] == 0) x /= num[i], ++cnt[i]; n rest = rest * x % m; n return *this; n } n Value& operator/=(int x) { n for (int i = 0; i < tot; i++) n while (x % num[i] == 0) x /= num[i], --cnt[i]; n rest = rest * inv(x, m) % m; n return *this; n } n Value& operator*=(const Value& v) { n for (int i = 0; i < tot; i++) cnt[i] += v.cnt[i]; n rest = rest * v.rest % m; n return *this; n } n long long get_val() { n long long res = rest; n for (int i = 0; i < tot; i++) res = res * modpow(num[i], cnt[i], m) % m; n return res; n } n } tag[MAXT]; n long long sum[MAXT]; n void build(int l = 1, int r = tn, int k = 1) { n if (l == r) return; n int mid = (l + r) >> 1; n build(l, mid, k << 1); n build(mid + 1, r, k << 1 | 1); n sum[k] = (sum[k << 1] + sum[k << 1 | 1]) % m; n } n void pushdown(int k) { n int flag = 1; n for (int i = 0; i < tot; i++) n if (tag[k].cnt[i]) { n flag = 0; n break; n } n if (flag && tag[k].rest == 1) return; n int ls = k << 1, rs = k << 1 | 1; n tag[ls] *= tag[k], tag[rs] *= tag[k]; n long long v = tag[k].get_val(); n (sum[ls] *= v) %= m, (sum[rs] *= v) %= m; n tag[k].clear(); n } n void mul(int a, int b, int x, int l = 1, int r = tn, int k = 1) { n if (a > r || b < l) return; n if (a <= l && b >= r) { n tag[k] *= x, (sum[k] *= x) %= m; n return; n } n pushdown(k); n int mid = (l + r) >> 1; n mul(a, b, x, l, mid, k << 1); n mul(a, b, x, mid + 1, r, k << 1 | 1); n sum[k] = (sum[k << 1] + sum[k << 1 | 1]) % m; n } n void divi(int a, int x, int l = 1, int r = tn, int k = 1) { n if (l == r) { n tag[k] /= x; n sum[k] = tag[k].get_val(); n return; n } n int mid = (l + r) >> 1; n pushdown(k); n if (a <= mid) n divi(a, x, l, mid, k << 1); n else n divi(a, x, mid + 1, r, k << 1 | 1); n sum[k] = (sum[k << 1] + sum[k << 1 | 1]) % m; n } n int query(int a, int b, int l = 1, int r = tn, int k = 1) { n if (a > r || b < l) return 0; n if (a <= l && b >= r) return sum[k]; n pushdown(k); n int mid = (l + r) >> 1; n return (query(a, b, l, mid, k << 1) + query(a, b, mid + 1, r, k << 1 | 1)) % n m; n } n void pre() { n int kk = m; n for (int i = 2; i * i <= kk; i++) n if (kk % i == 0) { n while (kk % i == 0) kk /= i; n num[tot++] = i; n } n if (kk > 1) num[tot++] = kk; n } n int main() { n scanf( %d%d , &n, &m); n pre(); n for (tn = 1; tn < n; tn <<= 1) n ; n for (int i = 1; i <= n; i++) { n scanf( %lld , &sum[i + tn - 1]); n tag[i + tn - 1] *= sum[i + tn - 1]; n sum[i + tn - 1] %= m; n } n build(); n scanf( %d , &Q); n while (Q--) { n int a, b, c, d; n scanf( %d%d%d , &a, &b, &c); n if (a == 1) { n scanf( %d , &d); n mul(b, c, d); n } else if (a == 2) n divi(b, c); n else n printf( %d n , query(b, c)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = acos(-1); n const double eps = 1e-9; n const int inf = 2000000000; n const long long infLL = 9000000000000000000; n inline bool checkBit(long long n, int i) { return n & (1LL << i); } n inline long long setBit(long long n, int i) { return n | (1LL << i); } n inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); } n int dx4[] = {0, 0, +1, -1}; n int dy4[] = {+1, -1, 0, 0}; n int dx8[] = {+1, 0, -1, 0, +1, +1, -1, -1}; n int dy8[] = {0, +1, 0, -1, +1, -1, +1, -1}; n inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } n inline bool isLeapYear(long long year) { n return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0); n } n inline bool isIntege(double num) { return (num == (int)num); } n inline bool collinear(int x1, int y1, int x2, int y2, int x3, int y3) { n return (y1 - y2) * (x1 - x3) == (y1 - y3) * (x1 - x2); n } n inline double coDist(double x1, double y1, double x2, double y2) { n return sqrt(((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2))); n } n inline double TriangleAreaWithSide(double a, double b, double c) { n double s = (a + b + c) / 2; n double area = sqrt(s * (s - a) * (s - b) * (s - c)); n return area; n } n inline double area3(double x1, double y1, double x2, double y2, double x3, n double y3) { n double A = abs((x1 * y2 + x2 * y3 + x3 * y1) - (y1 * x2 + y2 * x3 + y3 * x1)); n A /= 2.0; n return A; n } n inline long double degreetoradian(long double x) { n long double val = PI * x; n val /= (180.0); n return val; n } n inline void normal(long long &a) { n a %= 1000000007; n (a < 0) && (a += 1000000007); n } n template n inline T gcd(T a, T b) { n T c; n while (b) { n c = b; n b = a % b; n a = c; n } n return a; n } n inline long long modMul(long long a, long long b) { n a %= 1000000007, b %= 1000000007; n normal(a), normal(b); n return (a * b) % 1000000007; n } n inline long long modAdd(long long a, long long b) { n a %= 1000000007, b %= 1000000007; n normal(a), normal(b); n return (a + b) % 1000000007; n } n inline long long modSub(long long a, long long b) { n a %= 1000000007, b %= 1000000007; n normal(a), normal(b); n a -= b; n normal(a); n return a; n } n inline long long modPow(long long b, long long p) { n long long r = 1; n while (p) { n if (p & 1) r = modMul(r, b); n b = modMul(b, b); n p >>= 1; n } n return r; n } n inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); } n inline long long modDiv(long long a, long long b) { n return modMul(a, modInverse(b)); n } n inline bool equalTo(double a, double b) { n if (fabs(a - b) <= eps) n return true; n else n return false; n } n inline bool notEqual(double a, double b) { n if (fabs(a - b) > eps) n return true; n else n return false; n } n inline bool lessThan(double a, double b) { n if (a + eps < b) n return true; n else n return false; n } n inline bool lessThanEqual(double a, double b) { n if (a < b + eps) n return true; n else n return false; n } n inline bool greaterThan(double a, double b) { n if (a > b + eps) n return true; n else n return false; n } n inline bool greaterThanEqual(double a, double b) { n if (a + eps > b) n return true; n else n return false; n } n inline string to_s(int t) { n stringstream ss; n ss << t; n return ss.str(); n } n struct edge { n int p, q, w; n }; n bool cmp(edge &a, edge &b) { return a.w < b.w; } n template n ostream &operator<<(ostream &os, const pair &p) { n return os << ( << p.first << , << p.second << ) ; n } n template n ostream &operator<<(ostream &os, const vector &v) { n os << { ; n for (auto it = v.begin(); it != v.end(); ++it) { n if (it != v.begin()) os << , ; n os << *it; n } n return os << } ; n } n template n ostream &operator<<(ostream &os, const set &v) { n os << [ ; n for (auto it = v.begin(); it != v.end(); ++it) { n if (it != v.begin()) os << , ; n os << *it; n } n return os << ] ; n } n template n ostream &operator<<(ostream &os, const multiset &v) { n os << [ ; n for (auto it = v.begin(); it != v.end(); ++it) { n if (it != v.begin()) os << , ; n os << *it; n } n return os << ] ; n } n template n ostream &operator<<(ostream &os, const map &v) { n os << [ ; n for (auto it = v.begin(); it != v.end(); ++it) { n if (it != v.begin()) os << , ; n os << it->first << = << it->second; n } n return os << ] ; n } n clock_t tStart = clock(); n void faltu() { cerr << n ; } n template n void faltu(T a[], int n) { n for (int i = 0; i < n; ++i) cerr << a[i] << ; n cerr << n ; n } n template n void faltu(T arg, const hello &...rest) { n cerr << arg << ; n faltu(rest...); n } n const int mx = 1e5 + 5; n bool cnt[mx]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n int n, k; n cin >> n >> k; n long long g; n cin >> g; n for (int i = 1; i < n; i++) { n long long x; n cin >> x; n g = gcd(x, g); n } n vector st; n for (long long i = 0, j = 0; i < k; i++, j += g) { n int z = j % k; n if (!cnt[z]) st.emplace_back(z), cnt[z] = 1; n } n cout << st.size() << n ; n for (int i = 0; i < k; i++) { n if (cnt[i]) cout << i << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1 << 18; n const int MOD = 2013265921, MAX = MOD / 2; n const int gen = 440564289; n long long power(long long x, int n) { n if (n <= 1) return n ? x : 1LL; n long long t = power(x, n / 2); n if (n & 1) n return (t * t % MOD) * x % MOD; n else n return t * t % MOD; n } n long long tmp[maxn]; n void DFT(long long *a, long long x, int n) { n if (n == 1) { n a[0] %= MOD; n if (a[0] < 0) a[0] += MOD; n return; n } n for (int i = 0; i < n; i++) tmp[i] = a[i]; n for (int i = 0; i < n; i++) a[i % 2 ? n / 2 + i / 2 : i / 2] = tmp[i]; n long long *a1 = a, *a2 = a + n / 2, xx = x * x % MOD; n DFT(a1, xx, n / 2); n DFT(a2, xx, n / 2); n long long now = 1; n for (int i = 0; i < n / 2; i++, now = now * x % MOD) { n long long val = now * a2[i] % MOD; n tmp[i] = a1[i] + val - MOD; n tmp[i + n / 2] = a1[i] - val; n } n for (int i = 0; i < n; i++) a[i] = (tmp[i] < 0 ? tmp[i] + MOD : tmp[i]); n } n void mul(long long *a, long long *b, long long *c, int n) { n long long x = power(gen, (1 << 27) / n), xinv = power(x, n - 1); n long long ninv = power(n, MOD - 2); n DFT(a, x, n); n DFT(b, x, n); n for (int i = 0; i < n; i++) c[i] = a[i] * b[i] % MOD; n DFT(c, xinv, n); n for (int i = 0; i < n; i++) { n c[i] = c[i] * ninv % MOD; n if (c[i] > MAX) c[i] -= MOD; n } n } n int n, m, Q, L; n char s[maxn], t[maxn]; n unsigned long long sbit[maxn], tbit[maxn]; n int match(int x, int y, int len) { n int ret = 0; n for (; len >= 64; len -= 64, x += 64, y += 64) n ret += __builtin_popcountll(sbit[x] ^ tbit[y]); n if (len) n ret += n __builtin_popcountll((sbit[x] << (64 - len)) ^ (tbit[y] << (64 - len))); n return ret; n } n long long *poly[maxn], a[maxn], b[maxn]; n void precal() { n n = strlen(s), m = strlen(t); n for (int i = 0; i < n; i++) n for (int j = 0; j < 64 && i + j < n; j++) n if (s[i + j] == 1 ) sbit[i] |= (1ULL << j); n for (int i = 0; i < m; i++) n for (int j = 0; j < 64 && i + j < m; j++) n if (t[i + j] == 1 ) tbit[i] |= (1ULL << j); n L = n * sqrt(150 * log2(n) / Q); n int n2 = 1; n while (n2 < L + m) n2 *= 2; n for (int i = 0; i < n; i += L) { n poly[i / L] = new long long[n2]; n memset(a, 0, sizeof(a)); n memset(b, 0, sizeof(b)); n for (int j = 0; j < L && i + j < n; j++) a[j] = (s[i + j] == 0 ? -1 : 1); n for (int j = 0; j < m; j++) b[m - 1 - j] = (t[j] == 0 ? -1 : 1); n mul(a, b, poly[i / L], n2); n } n } n int main() { n scanf( %s%s%d , s, t, &Q); n precal(); n while (Q--) { n int x, y, l; n scanf( %d%d%d , &x, &y, &l); n if (l <= L) { n printf( %d n , match(x, y, l)); n continue; n } n int ans = 0; n if (x % L) { n int l2 = L - x % L; n ans += match(x, y, l2); n x += l2; n y += l2; n l -= l2; n } n if ((x + l) % L) { n int l2 = (x + l - 1) % L + 1; n ans += match(x + l - l2, y + l - l2, l2); n l -= l2; n } n if (!l) { n printf( %d n , ans); n continue; n } n for (int i = x, j = y; l; i += L, j += L, l -= L) n ans += (L - poly[i / L][m - 1 - j]) / 2; n printf( %d n , ans); n } n } n "} +{"func_code_string": "#include n using namespace std; n int arr[503][503]; n int main() { n int n, k; n cin >> n >> k; n int p = 1; n for (int i = 1; i <= n; i++) { n for (int j = 1; j < k; j++) { n arr[i][j] = p++; n } n } n for (int i = 1; i <= n; i++) { n for (int j = k; j <= n; j++) { n arr[i][j] = p++; n } n } n int sum = 0; n for (int i = 1; i <= n; i++) { n sum += arr[i][k]; n } n cout << sum << endl; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n cout << arr[i][j] << ; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n std::istream& operator>>(std::istream& i, pair& p) { n i >> p.first >> p.second; n return i; n } n template n std::istream& operator>>(std::istream& i, vector& t) { n for (auto& v : t) { n i >> v; n } n return i; n } n template n std::ostream& operator<<(std::ostream& o, const pair& p) { n o << p.first << << p.second; n return o; n } n template n std::ostream& operator<<(std::ostream& o, const vector& t) { n if (t.empty()) o << n ; n for (size_t i = 0; i < t.size(); ++i) { n o << t[i] << n [i == t.size() - 1]; n } n return o; n } n template n using minheap = priority_queue, greater>; n template n using maxheap = priority_queue, less>; n template n bool in(T a, T b, T c) { n return a <= b && b < c; n } n unsigned int logceil(int first) { n return 8 * sizeof(int) - __builtin_clz(first); n } n namespace std { n template n struct hash> { n hash t; n hash u; n size_t operator()(const pair& p) const { n return t(p.first) ^ (u(p.second) << 7); n } n }; n } // namespace std n template n T bsh(T l, T h, const F& f) { n T r = -1, m; n while (l <= h) { n m = (l + h) / 2; n if (f(m)) { n l = m + 1; n r = m; n } else { n h = m - 1; n } n } n return r; n } n template n double bshd(double l, double h, const F& f, double p = 1e-9) { n unsigned int r = 3 + (unsigned int)log2((h - l) / p); n while (r--) { n double m = (l + h) / 2; n if (f(m)) { n l = m; n } else { n h = m; n } n } n return (l + h) / 2; n } n template n T bsl(T l, T h, const F& f) { n T r = -1, m; n while (l <= h) { n m = (l + h) / 2; n if (f(m)) { n h = m - 1; n r = m; n } else { n l = m + 1; n } n } n return r; n } n template n double bsld(double l, double h, const F& f, double p = 1e-9) { n unsigned int r = 3 + (unsigned int)log2((h - l) / p); n while (r--) { n double m = (l + h) / 2; n if (f(m)) { n h = m; n } else { n l = m; n } n } n return (l + h) / 2; n } n template n T gcd(T a, T b) { n if (a < b) swap(a, b); n return b ? gcd(b, a % b) : a; n } n template n class vector2 : public vector> { n public: n vector2() {} n vector2(size_t a, size_t b, T t = T()) n : vector>(a, vector(b, t)) {} n }; n template n class vector3 : public vector> { n public: n vector3() {} n vector3(size_t a, size_t b, size_t c, T t = T()) n : vector>(a, vector2(b, c, t)) {} n }; n template n class vector4 : public vector> { n public: n vector4() {} n vector4(size_t a, size_t b, size_t c, size_t d, T t = T()) n : vector>(a, vector3(b, c, d, t)) {} n }; n template n class vector5 : public vector> { n public: n vector5() {} n vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T()) n : vector>(a, vector4(b, c, d, e, t)) {} n }; n class vowels { n public: n void solve(istream& cin, ostream& cout) { n int N; n cin >> N; n vector D(1 << 24, 0); n for (int i = 0; i < N; ++i) { n string S; n cin >> S; n int u = 0; n for (char c : S) u |= (1 << (c - a )); n u ^= (1 << 24) - 1; n D[u]++; n } n for (int i = 0; i < 24; ++i) { n for (int j = 0; j < (1 << 24); ++j) { n if (j & (1 << i)) D[j ^ (1 << i)] += D[j]; n } n } n int ans = 0; n for (int i = 0; i < (1 << 24); ++i) { n ans ^= (N - D[i]) * (N - D[i]); n } n cout << ans << endl; n } n }; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n vowels solver; n std::istream& in(std::cin); n std::ostream& out(std::cout); n solver.solve(in, out); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 310, INF = (1 << 27); n int d[MAXN][MAXN]; n int all[20][MAXN][MAXN]; n int ans[MAXN][MAXN]; n int main() { n ios::sync_with_stdio(false); n int n, m; n cin >> n >> m; n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) d[i][j] = INF; n for (int i = 0; i < n; i++) d[i][i] = 0; n for (int i = 0; i < m; i++) { n int x, y, w1, w2; n cin >> x >> y >> w1 >> w2; n x--; n y--; n w1 = -w1; n w2 = -w2; n d[x][y] = w1; n d[y][x] = w2; n } n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) all[0][i][j] = ans[i][j] = d[i][j]; n for (int k = 0; k < n; k++) n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) d[i][j] = min(d[i][j], d[i][k] + d[k][j]); n bool hasNeg = false; n for (int i = 0; i < n; i++) n if (d[i][i] < 0) hasNeg = true; n if (!hasNeg) { n cout << 0 << endl; n return 0; n } n int ind; n for (ind = 1; (1 << ind) < n; ind++) { n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) { n all[ind][i][j] = INF; n for (int k = 0; k < n; k++) n all[ind][i][j] = n min(all[ind][i][j], all[ind - 1][i][k] + all[ind - 1][k][j]); n } n } n ind--; n int length = 1; n while (ind >= 0) { n int tmp[MAXN][MAXN]; n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) { n tmp[i][j] = INF; n for (int k = 0; k < n; k++) n tmp[i][j] = min(tmp[i][j], ans[i][k] + all[ind][k][j]); n } n hasNeg = false; n for (int i = 0; i < n; i++) n if (tmp[i][i] < 0) hasNeg = true; n if (!hasNeg) { n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) ans[i][j] = tmp[i][j]; n length += (1 << ind); n } n ind--; n } n cout << length + 1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e6 + 7; n const int mod = 51123987; n const int inv2 = mod + 1 >> 1; n struct Edge { n int to, last, v; n } E[maxn]; n int fa[maxn]; n int len[maxn]; n int dep[maxn]; n int head[maxn]; n int tot; n int last; n int cnt; n int n; n char s[maxn]; n int pre[maxn]; n long long suf[maxn]; n void Init() { n for (int i = 0; i <= tot; ++i) { n fa[i] = len[i] = dep[i] = 0; n head[i] = 0; n } n cnt = 0; n fa[last = 0] = fa[tot = 1] = 1; n len[1] = -1; n } n int Getfail(int x, int ed) { n while (s[ed] ^ s[ed - len[x] - 1]) x = fa[x]; n return x; n } n int Check(int x, int v) { n for (int i = head[x], y; y = E[i].to, i; i = E[i].last) n if (E[i].v == v) return E[i].to; n return 0; n } n void Adde(int x, int y, int z) { n E[++cnt] = (Edge){y, head[x], z}; n head[x] = cnt; n } n void Extend(int x, int ed) { n int p = Getfail(last, ed); n int np = Check(p, x); n if (!np) { n np = ++tot; n int pp = Getfail(fa[p], ed); n fa[np] = Check(pp, x); n Adde(p, np, x); n len[np] = len[p] + 2; n dep[np] = dep[fa[np]] + 1; n } n last = np; n } n int main() { n Init(); n scanf( %d , &n); n scanf( %s , s + 1); n for (int i = 1; i <= n; ++i) Extend(s[i] - a , i), pre[i] = dep[last]; n Init(); n reverse(s + 1, s + n + 1); n for (int i = 1; i <= n; ++i) n Extend(s[i] - a , i), suf[n - i + 1] = dep[last]; n for (int i = n; i; --i) suf[i] += suf[i + 1], suf[i] %= mod; n int ans = 0; n for (int i = 1; i <= n; ++i) (ans += 1LL * pre[i] * suf[i + 1] % mod) %= mod; n int sum = 1LL * suf[1] * (suf[1] - 1) / 2 % mod; n ans = (sum - ans) % mod; n ans < 0 ? ans += mod : 0; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool vis[200005]; n vector v[200005], ak, d1, dn; n vector bfs(int n) { n queue q; n vector dis(200005); n q.push(n); n vis[n] = true; n dis[n] = 0; n while (!q.empty()) { n int x = q.front(); n q.pop(); n for (int i = 0; i < v[x].size(); i++) { n int u = v[x][i]; n if (vis[u] == false) { n vis[u] = true; n dis[u] = dis[x] + 1; n q.push(u); n } n } n } n return dis; n } n bool cmp(int x, int y) { return d1[x] < d1[y]; } n int main() { n int n, m, k, n1, n2, sp, ans = 0; n scanf( %d %d %d , &n, &m, &k); n for (int i = 0; i < k; i++) { n scanf( %d , &sp); n ak.push_back(sp); n } n for (int i = 0; i < m; i++) { n scanf( %d %d , &n1, &n2); n v[n1].push_back(n2); n v[n2].push_back(n1); n } n d1 = bfs(1); n memset(vis, false, sizeof(vis)); n dn = bfs(n); n sort(ak.begin(), ak.end(), cmp); n for (int i = 1; i < ak.size(); i++) { n int x = ak[i - 1]; n int y = ak[i]; n ans = max(ans, d1[x] + 1 + dn[y]); n } n ans = min(ans, d1[n]); n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 1050; n pair a[MAX_N]; n int cnt[MAX_N]; n int sub[MAX_N]; n map ids; n int inds[MAX_N]; n int id = 0; n int countplz(int f0, int f1) { n memset((sub), 0, sizeof(sub)); n ++sub[a[f0].second]; n ++sub[a[f1].second]; n int ans = 2; n while (true) { n int fnval = a[f0].first + a[f1].first; n auto it = ids.find(fnval); n if (it == ids.end()) { n return ans; n } n int fnid = it->second; n int fn = inds[fnid]; n int rest = cnt[fnid] - sub[fnid]; n if (rest <= 0) { n return ans; n } n ++ans; n sub[fnid]++; n f0 = f1; n f1 = fn; n } n } n int main() { n int n; n cin >> n; n for (int i = 0; i < n; ++i) { n int x; n cin >> x; n if (ids.count(x) == 0) { n ids[x] = id; n inds[id] = i; n ++id; n } n a[i] = make_pair(x, ids[x]); n cnt[ids[x]]++; n } n int maxs = 2; n if (ids.count(0) > 0) { n maxs = max(maxs, cnt[ids[0]]); n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < n; ++j) { n if (i == j || (a[i].first == a[j].first && a[i].first == 0)) { n continue; n } n maxs = max(maxs, countplz(i, j)); n } n } n cout << maxs << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n class TaskB { n public: n long long dist(pair f, pair s) { n return (f.first - s.first) * (f.first - s.first) + n (f.second - s.second) * (f.second - s.second); n } n void solve(std::istream& cin, std::ostream& cout) { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n vector > v(3); n set > st; n for (long long i = 0; i < 3; i++) { n cin >> v[i].first >> v[i].second; n } n vector > ans; n if (1 || dist(v[1], v[2]) <= dist(v[0], v[1]) + dist(v[0], v[2])) { n ans.push_back({v[1].first + v[2].first - v[0].first, n v[1].second + v[2].second - v[0].second}); n } n if (1 || dist(v[0], v[2]) <= dist(v[2], v[1]) + dist(v[1], v[0])) { n ans.push_back({v[0].first + v[2].first - v[1].first, n v[0].second + v[2].second - v[1].second}); n } n if (1 || dist(v[1], v[0]) <= dist(v[2], v[1]) + dist(v[0], v[2])) { n ans.push_back({v[1].first + v[0].first - v[2].first, n v[1].second + v[0].second - v[2].second}); n } n cout << ans.size() << endl; n for (long long i = 0; i < ans.size(); i++) n cout << ans[i].first << << ans[i].second << endl; n } n }; n int main() { n TaskB solver; n std::istream& in(std::cin); n std::ostream& out(std::cout); n solver.solve(in, out); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n string a, b; n set A, B; n queue qA, qB; n map > q; n vector > resp; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n >> a >> b; n for (int i = 0; i < n; ++i) { n if (a[i] == ? ) n qA.push(i); n else { n q[a[i]].push(i); n A.insert(i); n } n } n for (int i = 0; i < n; ++i) { n if (b[i] == ? ) n qB.push(i); n else n B.insert(i); n } n for (int i = 0; i < n; ++i) { n if (!q[b[i]].empty()) { n resp.push_back({q[b[i]].front(), i}); n B.erase(i); n A.erase(q[b[i]].front()); n q[b[i]].pop(); n } n } n while (!qA.empty() && !B.empty()) { n auto it = B.begin(); n resp.push_back({qA.front(), *it}); n qA.pop(); n B.erase(it); n } n while (!qB.empty() && !A.empty()) { n auto it = A.begin(); n resp.push_back({*it, qB.front()}); n qB.pop(); n A.erase(it); n } n while (!qA.empty() && !qB.empty()) { n resp.push_back({qA.front(), qB.front()}); n qA.pop(); n qB.pop(); n } n cout << (int)resp.size() << n ; n for (auto x : resp) cout << x.first + 1 << << x.second + 1 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n int n; n double p[111]; n cin >> n; n for (int i = 0; i < n; i++) cin >> p[i]; n sort(p, p + n); n double ans = p[n - 1], notAns = 1 - p[n - 1]; n for (int i = n - 2; i >= 0 && ans < notAns; i--) { n ans = ans * (1 - p[i]) + notAns * p[i]; n notAns *= (1 - p[i]); n } n printf( %.12lf n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1e18; n long long first, T, mt; n long long t[2], p[2], a[2]; n long long get(long long ile, long long czas) { n if (ile == 0) { n return 0; n } n if (min(ile * mt, ile * t[1]) > czas) { n return inf; n } n if (ile * mt <= czas) { n return 0; n } n long long st = 0, en = ile, mid = (st + en) / 2, res = inf; n while (st <= en) { n long long il = min(ile, mid * a[1]); n if (il * t[1] + (ile - il) * mt <= czas) { n res = min(res, mid); n en = mid - 1; n } else { n st = mid + 1; n } n mid = (st + en) / 2; n } n return res * p[1]; n } n int main() { n scanf( %lld%lld%lld , &first, &T, &mt); n for (int i = 0; i < 2; i++) { n scanf( %lld%lld%lld , a + i, t + i, p + i); n } n if (t[0] > t[1]) { n swap(a[0], a[1]); n swap(t[0], t[1]); n swap(p[0], p[1]); n } n if (min(mt, t[0]) * first > T) { n printf( -1 n ); n return 0; n } n if (mt * first <= T) { n printf( 0 n ); n return 0; n } n long long res = inf; n for (long long i = 0; (i - 1) * a[0] * t[0] + 1 <= T; i++) { n long long ile = min(first, a[0] * i); n long long cena = i * p[0] + get(first - ile, T - ile * t[0]); n res = min(res, cena); n } n printf( %lld n , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, T, i, n, k, d, ans, val; n cin >> T; n vector id(pow(10, 6) + 1, 0); n for (t = 0; t < T; t++) { n cin >> n >> k >> d; n vector v(n); n for (i = 0; i < n; i++) cin >> v[i]; n ans = n; n val = 0; n for (i = 0; i < d; i++) { n id[v[i]]++; n if (id[v[i]] == 1) val++; n } n ans = val; n for (i = d; i < n; i++) { n id[v[i - d]]--; n if (id[v[i - d]] == 0) val--; n id[v[i]]++; n if (id[v[i]] == 1) val++; n ans = min(val, ans); n } n for (i = n - d; i < n; i++) id[v[i]] = 0; n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n const int dx[] = {1, 0, -1, 0}; n const int dy[] = {0, 1, 0, -1}; n using namespace std; n const int MAXN = 55; n int n; n int a[2][MAXN]; n int asum[2][MAXN]; n int b[MAXN]; n int main() { n cin.tie(0); n ios::sync_with_stdio(false); n cin >> n; n for (int j = 0; j < 2; j++) n for (int i = 0; i < n - 1; i++) cin >> a[j][i]; n for (int i = 0; i < n; i++) cin >> b[i]; n for (int i = 1; i < n; i++) asum[0][i] = asum[0][i - 1] + a[0][i - 1]; n for (int i = n - 2; i >= 0; i--) asum[1][i] = asum[1][i + 1] + a[1][i]; n vector length; n for (int i = 0; i < n; i++) length.push_back(asum[0][i] + asum[1][i] + b[i]); n sort(length.begin(), length.end()); n cout << length[0] + length[1] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n int num[N], tot; n int main() { n int n, a1 = 2, a2 = 1, ans = 1; n cin >> n; n while (a1 - a2 <= n) { n if (n % (a1 - a2) == 0) ans = a1 - a2; n a1 *= 4; n a2 *= 2; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int k; n int values[107]; n int n = 0; n int ans[107][107]; n int cmb[107]; n int main() { n int i, j, base; n cin >> k; n for (i = 3; i <= 100; i++) values[i] = i * (i - 1) * (i - 2) / 6; n for (i = 2; i <= 100; i++) cmb[i] = i * (i - 1) / 2; n i = 3; n while (values[i] < k) i++; n if (values[i] > k) i--; n k -= values[i]; n n = i; n for (i = 1; i <= n; i++) n for (j = 1; j <= n; j++) n if (i != j) ans[i][j] = 1; n while (k) { n for (i = 2; cmb[i] < k; i++) n ; n if (cmb[i] > k) i--; n k -= cmb[i]; n n++; n for (j = 1; j <= i; j++) ans[n][j] = ans[j][n] = 1; n } n cout << n << n ; n for (i = 1; i <= n; i++) { n for (j = 1; j <= n; j++) cout << ans[i][j]; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mx = 200, my = 200, tim = 50, mo = 1000000007; n const int d[8][2] = {1, 2, -1, 2, 1, -2, -1, -2, 2, 1, -2, 1, -2, -1, 2, -1}; n int x, y, n, bfs[mx * my * 4][2], a[mx * 2][my * 2], i, l, r, xx, yy, n cnt[tim + 10]; n long long K; n int main() { n scanf( %I64d%d , &K, &n); n for (i = 1; i <= n; ++i) scanf( %d%d , &x, &y), a[x + mx][y + my] = -1; n a[mx][my] = 1; n bfs[l = r = 1][0] = mx; n bfs[1][1] = my; n while (l <= r) { n x = bfs[l][0]; n y = bfs[l++][1]; n if (a[x][y] == K + 1 || a[x][y] == tim + 1) break; n for (i = 0; i < 8; ++i) { n xx = x + d[i][0]; n yy = y + d[i][1]; n if (!a[xx][yy]) { n a[xx][yy] = a[x][y] + 1; n cnt[a[xx][yy]]++; n bfs[++r][0] = xx; n bfs[r][1] = yy; n } n } n } n if (K <= tim || cnt[tim + 1] == 0) n printf( %d n , r); n else { n long long p = K - tim, u = p, v = p + 1; n if (u % 2 == 0) n u /= 2; n else n v /= 2; n printf( %d n , n (u % mo * (v % mo) % mo * 28 % mo + p % mo * cnt[tim + 1] % mo + r) % n mo); n } n } n "} +{"func_code_string": "#include n using namespace std; n struct treenode { n long long a, b, c; n treenode(long long a, long long b, long long c) : a(a), b(b), c(c) {} n }; n int n, mm, s[111111], m[111111], r[111111], zero[111111], *add; n vector tree1[4 * 111111], tree2[4 * 111111], *tree; n set > seg; n void mergetrees(vector &v1, vector &v2, n vector &res) { n for (int i = 0, j = 0;;) { n if (v1[i].a > v2[j].a) n res.push_back(treenode(v1[i].a, n v1[i].b + v2[j].b + v2[j].c * (v1[i].a - v2[j].a), n v2[j].c + v1[i].c)); n else n res.push_back(treenode(v2[j].a, n v2[j].b + v1[i].b + v1[i].c * (v2[j].a - v1[i].a), n v1[i].c + v2[j].c)); n if (v1[i].a == 2000000000) break; n if (v1[i + 1].a > v2[j + 1].a) n j++; n else if (v1[i + 1].a < v2[j + 1].a) n i++; n else n i++, j++; n } n } n void build(int node, int vl, int vr) { n if (vl == vr) { n tree[node].push_back(treenode(0, add[vl], r[vl])); n if (r[vl]) n tree[node].push_back(treenode((m[vl] - add[vl]) / r[vl] + 1, m[vl], 0)); n tree[node].push_back(treenode(2000000000, r[vl] ? m[vl] : add[vl], 0)); n } else { n build(node * 2, vl, (vl + vr) / 2); n build(node * 2 + 1, (vl + vr) / 2 + 1, vr); n mergetrees(tree[node * 2], tree[node * 2 + 1], tree[node]); n } n } n long long getsum(int t, int node, int vl, int vr, int l, int r) { n if (l > vr || r < vl) n return 0; n else if (vl >= l && vr <= r) { n vector &v = tree[node]; n int l = 0, r = (int)v.size() - 1; n while (l != r) { n if (v[(l + r) / 2 + 1].a > t) n r = (l + r) / 2; n else n l = (l + r) / 2 + 1; n } n return tree[node][l].b + tree[node][l].c * (t - tree[node][l].a); n } else { n return getsum(t, node * 2, vl, (vl + vr) / 2, l, r) + n getsum(t, node * 2 + 1, (vl + vr) / 2 + 1, vr, l, r); n } n } n inline long long getdif(int tnow, int tprev, int l, int r) { n if (tprev == -1) n tree = tree2; n else n tree = tree1; n return getsum((tprev == -1) ? tnow : tnow - tprev, 1, 0, n - 1, l - 1, r - 1); n } n int main() { n cin >> n; n for (int i = 0; i < n; i++) scanf( %d%d%d , &s[i], &m[i], &r[i]); n cin >> mm; n tree = tree1; n add = zero; n build(1, 0, n - 1); n tree = tree2; n add = s; n build(1, 0, n - 1); n seg.insert(make_pair(1, -1)); n seg.insert(make_pair(n + 1, -1)); n for (int i = 0; i < mm; i++) { n int tt, ll, rr; n scanf( %d%d%d , &tt, &ll, &rr); n auto j = seg.upper_bound(make_pair(ll, 2000000000)); n j--; n long long ans = 0; n bool flag = true; n for (; j->first <= rr;) { n auto next = j; n next++; n ans += getdif(tt, j->second, max(j->first, ll), min(next->first - 1, rr)); n int l1 = j->first, t1 = j->second; n seg.erase(j); n if (l1 < ll) seg.insert(make_pair(l1, t1)); n if (flag) seg.insert(make_pair(ll, tt)), flag = false; n if (next->first - 1 > rr) seg.insert(make_pair(rr + 1, t1)); n j = next; n } n printf( %I64d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ld = long double; n using ii = pair; n using vi = vector; n using vb = vector; n using vvi = vector; n using vii = vector; n using vvii = vector; n constexpr int INF = 2000000000; n constexpr ll LLINF = 9000000000000000000; n struct ConvexHullSet { n struct Line { n ld a, b; n mutable ld x; n bool type; n bool operator<(const Line &rhs) const { n return type || rhs.type ? x < rhs.x : a < rhs.a; n } n ld intersect(const Line &rhs) const { n return ld(b - rhs.b) / ld(rhs.a - a); n } n }; n set lines; n static constexpr ld MAX = std::numeric_limits::max(); n ld query(ld x) { n auto it = lines.lower_bound(Line{0.0, 0.0, x, true}); n return (it != lines.end() ? it->a * x + it->b : -1e300); n } n void adjust(set::iterator it) { n if (it != lines.end()) n it->x = next(it) != lines.end() ? it->intersect(*next(it)) : MAX; n if (it != lines.begin()) n prev(it)->x = it != lines.end() ? it->intersect(*prev(it)) : MAX; n } n void insert(ld a, ld b) { n Line ln = Line{a, b, 0.0, false}; n auto it1 = lines.lower_bound(ln); n if (it1 != lines.end() && it1->a == a) { n if (it1->b >= b) return; n it1 = lines.erase(it1); n adjust(it1); n } n ln.x = it1 != lines.end() ? ln.intersect(*it1) : MAX; n while (it1 != lines.end() && ln.x >= it1->x) { n it1 = lines.erase(it1); n ln.x = it1 != lines.end() ? it1->intersect(ln) : MAX; n adjust(it1); n } n while (it1 != lines.begin()) { n --it1; n ld nx = it1->intersect(ln); n if (nx >= it1->x) return; n if (it1 != lines.begin() && prev(it1)->x >= nx) { n it1 = lines.erase(it1); n adjust(it1); n } else n break; n } n it1 = lines.insert(ln).first; n adjust(it1); n } n }; n constexpr int L = 0, R = 1000000; n vector solve(vii &pairs, int s) { n vector d(R - L + 1, 1e300); n sort(pairs.begin(), pairs.end()); n ConvexHullSet chs; n for (int i = 0, p = L; p <= R; ++p) { n while (i < (int)pairs.size() && pairs[i].first == p) { n int x = pairs[i].first, v = pairs[i].second; n ld a = 1.0 / ld(s - v) - ld(v) / (ld(s - v) * ld(s + v)); n ld b = -ld(x) / ld(s - v) + ld(x) / ld(s + v) + n ld(v) * ld(x) / (ld(s - v) * ld(s + v)); n chs.insert(-a, -b); n ++i; n } n d[p] = -chs.query(p); n } n return d; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n int n, s; n cin >> n >> s; n vi x(n, 0), v(n, 0), t(n, 0); n ld lr = 1e300, rr = 1e300; n int minl = R + 1, maxr = L - 1; n for (int i = 0; i < n; ++i) { n cin >> x[i] >> v[i] >> t[i]; n if (t[i] == 1) { n lr = min(lr, ld(x[i]) / ld(v[i])); n if (x[i] < minl) minl = x[i]; n } else { n rr = min(rr, ld(R - x[i]) / ld(v[i])); n if (x[i] > maxr) maxr = x[i]; n } n } n cerr << lr = << lr << , rr = << rr << endl; n vector lp, rp; n { n vii pairs[2]; n for (int i = 0; i < n; ++i) pairs[t[i] - 1].push_back({x[i], v[i]}); n for (ii &pr : pairs[1]) pr.first = R - pr.first; n lp = solve(pairs[0], s); n rp = solve(pairs[1], s); n reverse(rp.begin(), rp.end()); n } n ld ans = max(lr, rr); n for (int p = L; p <= R; ++p) n ans = min(ans, max(min(lr, lp[p]), min(rr, rp[p]))); n printf( %.10lf n , double(ans)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0), cin.tie(0); n int n, m; n cin >> n >> m; n vector> adj(n); n for (int i = 0, u, v; i < m; ++i) { n cin >> u >> v; n --u, --v; n adj[u].push_back(v); n adj[v].push_back(u); n } n set go; n queue q; n for (int i = 0; i < n; ++i) go.insert(i); n int ans = 0; n for (int x = 0; x < n; ++x) n if (go.find(x) != go.end()) { n ++ans; n go.erase(x); n q.push(x); n while (!q.empty()) { n int u = q.front(); n q.pop(); n vector add; n for (auto v : adj[u]) n if (go.find(v) != go.end()) { n go.erase(v); n add.push_back(v); n } n for (auto v : go) q.push(v); n go.clear(); n for (auto v : add) go.insert(v); n } n } n cout << ans - 1 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct edge { n int v, w; n edge* next; n }; n const int N = 100010; n int n, p, ordcnt; n bool vis[N], cut[N]; n int ord[N], sum[N], mex[N], q[N], dep[N], digit[N], rdigit[N], rprod[N], n prod[N]; n edge* g[N]; n void add_edge(int u, int v, int w); n void calc_order(int u); n void calc_sum(int u); n void dfs(int u); n long long calc(int u); n int rev(int a); n void ex_gcd(int a, int b, int& x, int& y); n int main() { n long long ans = 0; n scanf( %d%d , &n, &p); n for (int rep = 1; rep < n; ++rep) { n int u, v, w; n scanf( %d%d%d , &u, &v, &w); n add_edge(u, v, w); n add_edge(v, u, w); n } n prod[0] = 1; n rprod[0] = 1; n rprod[1] = rev(10); n for (int i = 1; i <= n; ++i) prod[i] = 10LL * prod[i - 1] % p; n for (int i = 2; i <= n; ++i) n rprod[i] = (long long)rprod[1] * rprod[i - 1] % p; n calc_order(0); n memset(cut, 0, sizeof(cut)); n for (int i = 0; i < n; ++i) { n int u = ord[i]; n dep[u] = 0; n digit[u] = 0; n rdigit[u] = 0; n dfs(u); n ans += calc(u); n cut[u] = true; n for (edge* p = g[u]; p; p = p->next) n if (!cut[p->v]) ans -= calc(p->v); n ans -= 1; n ; n } n printf( %lld n , ans); n return 0; n } n int rev(int a) { n int x, y; n ex_gcd(a, p, x, y); n if (x < 0) x += p; n return x; n } n void ex_gcd(int a, int b, int& x, int& y) { n if (b == 0) { n x = 1; n y = 0; n return; n } n ex_gcd(b, a % b, y, x); n y -= a / b * x; n } n long long calc(int u) { n int ql = 0, qr = 1; n long long ret = 0; n map mp; n q[0] = u; n while (ql < qr) { n int v = q[ql++]; n vis[v] = true; n map::iterator it = mp.find(rdigit[v]); n if (it != mp.end()) n ++it->second; n else n mp.insert(make_pair(rdigit[v], 1)); n for (edge* p = g[v]; p; p = p->next) n if (!vis[p->v] && !cut[p->v]) q[qr++] = p->v; n } n for (int i = 0; i < qr; ++i) vis[q[i]] = false; n for (int i = 0; i < qr; ++i) { n int key = (long long)-digit[q[i]] * rprod[dep[q[i]]] % p; n if (key < 0) key += p; n map::iterator it = mp.find(key); n if (it != mp.end()) { n ; n ret += it->second; n } n } n return ret; n } n void dfs(int u) { n vis[u] = true; n for (edge* p = g[u]; p; p = p->next) n if (!vis[p->v] && !cut[p->v]) { n dep[p->v] = dep[u] + 1; n rdigit[p->v] = ((long long)prod[dep[u]] * p->w + rdigit[u]) % ::p; n digit[p->v] = (digit[u] * 10LL + p->w) % ::p; n dfs(p->v); n } n vis[u] = false; n } n void calc_order(int u) { n calc_sum(u); n int s = sum[u], ql = 0, qr = 1; n q[0] = u; n while (ql < qr) { n int v = q[ql++]; n vis[v] = true; n mex[v] = max(mex[v], s - sum[v]); n if (mex[v] < mex[u]) u = v; n for (edge* p = g[v]; p; p = p->next) n if (!vis[p->v] && !cut[p->v]) q[qr++] = p->v; n } n for (int i = 0; i < qr; ++i) vis[q[i]] = false; n ord[ordcnt++] = u; n cut[u] = true; n for (edge* p = g[u]; p; p = p->next) n if (!cut[p->v]) calc_order(p->v); n } n void calc_sum(int u) { n vis[u] = true; n mex[u] = 0; n sum[u] = 1; n for (edge* p = g[u]; p; p = p->next) n if (!vis[p->v] && !cut[p->v]) { n calc_sum(p->v); n sum[u] += sum[p->v]; n mex[u] = max(mex[u], sum[p->v]); n } n vis[u] = false; n } n void add_edge(int u, int v, int w) { n static edge pool[N * 2]; n static edge* p = pool; n ++p; n p->v = v; n p->w = w; n p->next = g[u]; n g[u] = p; n } n "} +{"func_code_string": "#include n using namespace std; n n #define fastIO ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); n #define endl n n #define lli long long int n #define ld long double n #define p_b push_back n #define m_p make_pair n #define fs first n #define sc second n #define sz(x) ((lli)x.size()) n #define all(x) x.begin(),x.end() n const lli mod = 1e9 + 7; n const lli N = 1e6 + 5; n /*****************************************************/ n lli t,n,m,a[N]={0},target; n bool dp[105][200005],vis[105][200005]; n lli F(lli idx,lli ss) n { n if(vis[idx][ss]) n return dp[idx][ss]; n vis[idx][ss]=true; n if(idx>n) n { n if(ss==target) n return dp[idx][ss]=true; n return dp[idx][ss]=false; n } n bool ret=F(idx+1,ss),ret1=F(idx+1,ss+a[idx]); n if(ret || ret1) n return dp[idx][ss]=true; n return dp[idx][ss]=false; n } n int main() n { n fastIO n lli i,j,k,x,y; n lli ss=0; n cin>>n; n for(i=1;i<=n;i++) n { n cin>>a[i]; n ss+=a[i]; n } n if(ss%2!=0) n { n cout<< 0 ; n return 0; n } n target=ss/2; n memset(vis,false,sizeof vis); n memset(dp,false,sizeof dp); n if(F(1,0)==false) n { n cout<< 0 ; n return 0; n } n while(1) n { n for(i=1;i<=n;i++) n { n if(a[i]%2!=0) n { n cout<< 1 n < n using namespace std; n int time_to_minute(int h, int m) { return h * 60 + m; } n void minute_to_time(int t, int& h, int& m) { n h = t / 60; n m = t % 60; n } n int main() { n ios_base::sync_with_stdio(false); n int h, m, a; n cin >> h; n cin.ignore(1); n cin >> m >> a; n minute_to_time((time_to_minute(h, m) + a) % (24 * 60), h, m); n cout << (h < 10 ? 0 : ) << h << : << (m < 10 ? 0 : ) << m; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n int n, BIT[N]; n void update(int idx, int val) { n while (idx <= n) { n BIT[idx] = max(val, BIT[idx]); n idx += idx & -idx; n } n } n int get(int idx) { n int ret = 0; n while (idx > 0) { n ret = max(BIT[idx], ret); n idx -= idx & -idx; n } n return ret; n } n int main() { n scanf( %d , &n); n int ans = 0; n for (int i = 0, x; i < n; ++i) { n scanf( %d , &x); n update(x, get(x) + 1); n } n printf( %d n , get(n)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int iinf = 1e9 + 7; n const long long linf = 1ll << 60; n const double dinf = 1e60; n template n inline void scf(T &x) { n bool f = 0; n x = 0; n char c = getchar(); n while ((c < 0 || c > 9 ) && c != - ) c = getchar(); n if (c == - ) { n f = 1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n x = x * 10 + c - 0 ; n c = getchar(); n } n if (f) x = -x; n return; n } n template n void scf(T1 &x, T2 &y) { n scf(x); n return scf(y); n } n template n void scf(T1 &x, T2 &y, T3 &z) { n scf(x); n scf(y); n return scf(z); n } n template n void scf(T1 &x, T2 &y, T3 &z, T4 &w) { n scf(x); n scf(y); n scf(z); n return scf(w); n } n inline char mygetchar() { n char c = getchar(); n while (c == || c == n ) c = getchar(); n return c; n } n template n void chkmax(T &x, const T &y) { n if (y > x) x = y; n return; n } n template n void chkmin(T &x, const T &y) { n if (y < x) x = y; n return; n } n const int N = 510; n const int M = 110; n int n, m, k; n double A[N][N + N]; n double w[M][M], p[N][N]; n bool f[N]; n vector trap; n double beg[N]; n void calc_w() { n for (int i = (1); i <= (n); ++i) { n A[i][i] = 1.0; n if (!f[i]) n for (int j = (1); j <= (n); ++j) n if (i != j) A[i][j] = -p[i][j]; n A[i][i + n] = 1.0; n } n for (int row = 1, col = 1; row <= n; ++row) { n int pivot = row; n for (int i = (row + 1); i <= (n); ++i) n if (fabs(A[i][col]) > fabs(A[pivot][col])) pivot = i; n if (fabs(A[pivot][col]) <= 1e-6) continue; n swap(A[pivot], A[row]); n double foo = A[row][col]; n for (int i = (1); i <= (n + n); ++i) A[row][i] /= foo; n for (int i = (1); i <= (n); ++i) n if (i != row) { n foo = A[i][col]; n for (int j = (1); j <= (n + n); ++j) A[i][j] -= foo * A[row][j]; n } n ++col; n } n for (int i = 0; i < (m); ++i) n for (int j = 0; j < (m); ++j) { n int u = trap[i], v = trap[j]; n for (int k = (1); k <= (n); ++k) w[i][j] += p[u][k] * A[k][v + n]; n } n for (int i = 0; i < (m); ++i) beg[i] = A[1][trap[i] + n]; n return; n } n void TZL() { n static int g[N][N], deg[N]; n memset((g), (0), sizeof((g))); n memset((deg), (0), sizeof((deg))); n scf(n, m, k); n for (int i = (1); i <= (n); ++i) { n scf(f[i]); n if (f[i]) trap.push_back(i); n } n for (int i = 0; i < (m); ++i) { n int u, v; n scf(u, v); n g[u][v]++; n g[v][u]++; n deg[u]++; n deg[v]++; n } n m = (int)trap.size(); n for (int i = (1); i <= (n); ++i) n for (int j = (1); j <= (n); ++j) p[i][j] = (1.0 * g[i][j]) / (1.0 * deg[i]); n return calc_w(); n } n struct mat { n double num[M][M]; n mat() { memset((num), (0), sizeof((num))); } n mat(int x) { n memset((num), (0), sizeof((num))); n for (int i = 0; i < (M); ++i) num[i][i] = x; n } n mat(double a[][M]) { n for (int i = 0; i < (M); ++i) n for (int j = 0; j < (M); ++j) num[i][j] = a[i][j]; n } n double &operator()(int i, int j) { return num[i][j]; } n double operator()(int i, int j) const { return num[i][j]; } n friend mat operator*(const mat &a, const mat &b) { n mat c; n for (int i = 0; i < (M); ++i) n for (int j = 0; j < (M); ++j) n for (int k = 0; k < (M); ++k) c(i, j) += a(i, k) * b(k, j); n return c; n } n } g; n mat kiss_me(mat a, int n) { n mat ret = mat(1); n while (n) { n if (n & 1) ret = ret * a; n a = a * a; n n >>= 1; n } n return ret; n } n void RANK1() { n g = mat(w); n g = kiss_me(g, k - 2); n double ans = 0.0; n for (int i = 0; i < (m); ++i) ans += beg[i] * g(i, m - 1); n printf( %.12f n , ans); n return; n } n int main() { n TZL(); n RANK1(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n long long dis[100010]; n vector mom[100010]; n vector > vertex[100010]; n set q; n void readin() { n scanf( %d%d , &n, &m); n int u, v, c; n for (int i = 0; i < m; ++i) { n scanf( %d%d%d , &u, &v, &c); n vertex[u].push_back(make_pair(v, c)); n vertex[v].push_back(make_pair(u, c)); n } n int cnt; n for (int i = 1; i <= n; ++i) { n scanf( %d , &cnt); n while (cnt--) { n scanf( %d , &v); n mom[i].push_back(v); n } n } n } n void spfa() { n int u, v, c, nt, sz; n vector::iterator low; n memset(dis, -1, sizeof(dis)); n while (!q.empty()) q.clear(); n q.insert(1); n dis[1] = 0; n while (!q.empty()) { n u = *q.begin(); n q.erase(u); n if (u == n) continue; n nt = dis[u]; n low = lower_bound(mom[u].begin(), mom[u].end(), nt); n for (; low != mom[u].end(); low++) { n if (*low == nt) n nt++; n else if (*low > nt) n break; n } n sz = vertex[u].size(); n for (int i = 0; i < sz; ++i) { n v = vertex[u][i].first; n c = vertex[u][i].second; n if (dis[v] == -1 || dis[v] > nt + c) { n dis[v] = nt + c; n q.insert(v); n } n } n } n } n int main() { n readin(); n spfa(); n printf( %I64d , dis[n]); n } n "} +{"func_code_string": "#include n using namespace std; n static const int INF = 500000000; n template n void debug(T a, T b) { n for (; a != b; ++a) cerr << *a << ; n cerr << endl; n } n int n; n pair, int> es[5005]; n vector > g[5005]; n int size[5005]; n int cut[5005]; n int prep(int v, int p) { n size[v] = 1; n for (int i = 0; i < g[v].size(); ++i) { n int to = g[v][i].first; n if (to == p || cut[to]) continue; n size[v] += prep(to, v); n } n return size[v]; n } n int type; n int cost[2], root[2], all[2]; n void dfs(int v, int p) { n int maxi = 0; n for (int i = 0; i < g[v].size(); ++i) { n int to = g[v][i].first; n if (to == p || cut[to]) continue; n maxi = max(maxi, size[to]); n dfs(to, v); n } n if (max(maxi, all[type] - size[v]) < cost[type]) { n cost[type] = max(maxi, all[type] - size[v]); n root[type] = v; n } n } n long long int tot; n int dfs2(int v, int p) { n size[v] = 1; n for (int i = 0; i < g[v].size(); ++i) { n int to = g[v][i].first; n if (to == p || cut[to]) continue; n size[v] += dfs2(to, v); n tot += size[to] * (all[type] - size[to]) * (long long int)g[v][i].second; n tot += size[to] * (long long int)all[type ^ 1] * g[v][i].second; n } n return size[v]; n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n - 1; ++i) { n int a, b, c; n scanf( %d%d%d , &a, &b, &c); n --a; n --b; n g[a].push_back(make_pair(b, c)); n g[b].push_back(make_pair(a, c)); n es[i] = make_pair(make_pair(a, b), c); n } n long long int ans = 1e18; n for (int i = 0; i < n - 1; ++i) { n int a = es[i].first.first, b = es[i].first.second; n tot = 0; n cost[0] = cost[1] = INF; n type = 0; n cut[b] = 1; n all[0] = prep(a, b); n all[1] = n - all[0]; n dfs(a, b); n dfs2(root[0], -1); n type = 1; n cut[b] = 0; n cut[a] = 1; n all[1] = prep(b, a); n dfs(b, a); n dfs2(root[1], -1); n cut[a] = 0; n tot += all[0] * all[1] * (long long int)es[i].second; n ans = min(ans, tot); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int t; n cin >> t; n while (t--) { n vector> st, re; n int a, b; n int n; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a >> b; n st.emplace_back(a, b); n re.emplace_back(b, a); n } n sort(st.begin(), st.end()); n sort(re.begin(), re.end()); n cout << max(st[n - 1].first - re[0].first, 0) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1000000007; n long long a[1100][1100]; n long long b[1100][1100]; n long long A(int n, int k); n long long B(int n, int k); n long long A(int n, int k) { n if (a[n][k] != -1) { n return a[n][k]; n } n if (n < k) { n return a[n][k] = 0; n } n if (n == 1) { n return a[n][k] = (k == 0); n } n if (n == 2) { n return a[n][k] = (k != 1); n } n long long ret = A(n - 1, k); n ret += A(n - 1, k + 1) * (k + 1) - B(n - 1, k + 1) + B(n - 1, k) - n B(n - 1, k + 1) + B(n - 1, k); n ret += A(n - 1, k) * (n - 1 - k); n ret -= A(n - 1, k) - A(n - 2, k) - B(n - 1, k); n if (k > 0) { n ret += A(n - 1, k - 1) - A(n - 2, k - 1) - B(n - 1, k - 1); n } n ret -= A(n - 1, k) - A(n - 2, k) - B(n - 1, k); n if (k > 0) { n ret += A(n - 1, k - 1) - A(n - 2, k - 1) - B(n - 1, k - 1); n } n ret -= A(n - 2, k); n if (k > 1) { n ret += A(n - 2, k - 2); n } n return a[n][k] = (ret % inf + inf) % inf; n } n long long B(int n, int k) { n if (b[n][k] != -1) { n return b[n][k]; n } n if (n < k) { n return (b[n][k] = 0); n } n if (n == 1) { n return b[n][k] = 0; n } n if (n == 2) { n return b[n][k] = (k == 2); n } n if (k == 0) { n return b[n][k] = 0; n } n if (k == 1) { n return b[n][k] = n ((A(n - 1, 0) - A(n - 2, 0) + B(n - 1, 1)) % inf + inf) % inf; n } n return b[n][k] = (A(n - 2, k - 2) + B(n - 1, k) + A(n - 1, k - 1) - n B(n - 1, k - 1) - A(n - 2, k - 1)) % n inf; n } n int main() { n memset(a, -1, sizeof(a)); n memset(b, -1, sizeof(b)); n int n, k; n cin >> n >> k; n cout << A(n, k) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-8; n const double pi = acos(-1.0); n struct Q { n int a, b, c; n Q(int a, int b, int c) : a(a), b(b), c(c) {} n bool operator<(const Q& o) const { n if (a == o.a) return c < o.c; n return a < o.a; n } n }; n vector > ans; n set q; n int in[100000]; n int main() { n int n, i, a, b; n scanf( %d , &n); n for (i = 0; i < n; ++i) { n scanf( %d%d , &a, &b); n in[i] = a; n if (a) q.insert(Q(a, b, i)); n } n while (!q.empty()) { n Q u = *(q.begin()); n q.erase(q.begin()); n int cur = u.c; n ans.push_back(make_pair(u.b, u.c)); n in[u.b]--; n in[u.c]--; n u = *q.lower_bound(Q(in[u.b] + 1, 0, u.b)); n q.erase(u); n u.a--; n u.b ^= cur; n if (u.a) q.insert(u); n } n printf( %d n , ans.size()); n for (i = 0; i < ans.size(); ++i) n printf( %d %d n , ans[i].first, ans[i].second); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int pos[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; n int n; n char s[510][510]; n int v[510][510]; n vector > vec, ans; n int operator*(const pair &a, const pair &b) { n return a.first * b.second - a.second * b.first; n } n pair operator-(const pair &a, const pair &b) { n return make_pair(a.first - b.first, a.second - b.second); n } n pair stk[250010]; n int main() { n while (1) { n ans.clear(); n scanf( %d , &n); n if (n == 0) break; n for (int i = n; i >= 1; i--) scanf( %s , s[i] + 1); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= n; j++) v[i][j] = s[i][j] - 0 ; n vec.clear(); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n int cnt = 0; n for (int k = -1; k <= 0; k++) { n for (int l = -1; l <= 0; l++) { n cnt += v[i + k][j + l]; n } n } n if (cnt == 1) { n if (v[i][j] == 1) n vec.push_back(make_pair(i, j)); n else if (v[i - 1][j] == 1) n vec.push_back(make_pair(i - 2, j)); n else if (v[i][j - 1] == 1) n vec.push_back(make_pair(i, j - 2)); n else n vec.push_back(make_pair(i - 2, j - 2)); n } n } n } n for (auto &x : vec) swap(x.first, x.second); n sort(vec.begin(), vec.end()); n int top = 0; n for (auto &x : vec) { n while (top > 1 && (stk[top] - stk[top - 1]) * (x - stk[top]) >= 0) top--; n stk[++top] = x; n } n for (int i = 1; i <= top; i++) ans.push_back(stk[i]); n reverse(vec.begin(), vec.end()); n top = 0; n for (auto &x : vec) { n while (top > 1 && (stk[top] - stk[top - 1]) * (x - stk[top]) >= 0) top--; n stk[++top] = x; n } n for (int i = 2; i < top; i++) ans.push_back(stk[i]); n printf( %d n , ans.size()); n for (auto &x : ans) printf( %d %d n , x.first, x.second); n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC target( avx2 ) n #pragma GCC optimization( O3 ) n #pragma GCC optimization( unroll-loops ) n using namespace std; n const int mod = 1e9 + 7; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n long long n, m, a, b, i, j; n cin >> n; n deque dq, tmp; n long long ar[n], ans[n]; n set s; n for (i = 0; i < n; i++) { n cin >> a; n ar[a - 1] = i; n ans[i] = 0; n } n a = n, b = 0; n for (i = 0; i < n; i++) { n a = min(a, ar[i]); n b = max(b, ar[i]); n if (b - a == i) ans[i] = 1; n } n for (i = 0; i < n; i++) cout << ans[i]; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long n, p, b = 0; n cin >> n >> p; n vector v; n for (int i = 0; i < n; ++i) { n string s; n cin >> s; n if (s == half ) { n v.push_back(0); n } else n v.push_back(1), b++; n } n reverse(v.begin(), v.end()); n long long at = 0; n for (int i = 0; i < n; ++i) { n at *= 2; n at += v[i]; n } n cout << (at * p) - (b * p / 2) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 1005; n vector v[MAX]; n int dp[105][MAX]; n int main() { n ios::sync_with_stdio(false); n int n, t; n cin >> n >> t; n for (int i = 0; i < n; i++) { n int t, p; n cin >> t >> p; n v[t].push_back(p); n } n for (int i = 0; i < MAX; i++) { n sort(v[i].begin(), v[i].end()); n v[i].push_back(0); n reverse(v[i].begin(), v[i].end()); n for (int j = 1; j < v[i].size(); j++) v[i][j] += v[i][j - 1]; n } n for (int i = 1; i <= t; i++) n for (int j = 1; j < MAX; j++) n for (int k = 0; k < min((int)v[i].size(), j + 1); k++) n dp[i][j] = n max(dp[i][j], dp[i - 1][min(MAX - 1, (j - k) * 2)] + v[i][k]); n cout << dp[t][1] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long M = 7e2 + 5; n const long long mod = 1e9 + 7; n char sz[M]; n long long a[M], js; n inline long long read() { n register long long x = 0, y = 1; n register char c = getchar(); n while (!isdigit(c)) { n if (c == - ) y = 0; n c = getchar(); n } n while (isdigit(c)) { n x = x * 10 + (c ^ 48); n c = getchar(); n } n return y ? x : -x; n } n long long f[M][M][10]; n long long dfs(long long pos, long long limit, long long sum, long long l) { n if (!pos) return !sum % mod; n if (!limit && ~f[pos][sum][l]) return f[pos][sum][l] % mod; n long long up = limit ? a[pos] : 9; n long long cnt = 0; n for (long long i = 0; i <= up; i++) n cnt = (cnt + dfs(pos - 1, limit && i == up, sum - (i >= l), l)) % mod; n if (!limit) f[pos][sum][l] = cnt; n return cnt % mod; n } n signed main() { n scanf( %s , sz + 1); n memset(f, -1, sizeof(f)); n long long len = strlen(sz + 1); n for (long long i = 1; i <= len; i++) a[i] = sz[len - i + 1] - 0 ; n a[0] = 0; n for (long long i = 1; i <= 9; i++) n for (long long j = 1, puz = 1; j <= len; n j++, puz = (10ll * puz + 1ll) % mod) n js = (js + dfs(len, 1, j, i) * puz % mod) % mod; n printf( %lld n , js); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n int A[n][m], B[n][m], C[n][m]; n vector a, b; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n cin >> A[i][j]; n a.push_back(A[i][j]); n } n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n cin >> B[i][j]; n b.push_back(B[i][j]); n } n } n sort(a.begin(), a.end()); n sort(b.begin(), b.end()); n for (int i = 0; i < a.size(); i++) { n if (a[i] != b[i]) { n cout << NO << endl; n return 0; n } n } n if (n >= m) { n for (int i = 0; i < n; i++) { n long long x = 0; n for (int j = 0; j < min(i + 1, m); j++) { n x ^= (long long)(A[i - j][j] ^ B[i - j][j]); n } n if (x) { n cout << NO << endl; n return 0; n } n } n for (int i = 0; i < m - 1; i++) { n long long x = 0; n for (int j = 1; j + i < m; j++) { n x ^= (long long)(A[n - j][j + i] ^ B[n - j][j + i]); n } n if (x) { n cout << NO << endl; n return 0; n } n } n } else { n for (int i = 0; i < m; i++) { n long long x = 0; n for (int j = 0; j < min(i + 1, n); j++) { n x ^= (long long)(A[j][i - j] ^ B[j][i - j]); n } n if (x) { n cout << NO << endl; n return 0; n } n } n for (int i = 0; i < n - 1; i++) { n long long x = 0; n for (int j = 1; j + i < n; j++) { n x ^= (long long)(A[j + i][m - j] ^ B[j + i][m - j]); n } n if (x) { n cout << NO << endl; n return 0; n } n } n } n cout << YES << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int n, q; n int x[100100], y[100100]; n bool ans[100100]; n int par[100100], sz[100100]; n int distToPar[100100]; n int getpar(int now) { return (par[now] == now) ? now : getpar(par[now]); } n bool getdist(int now) { n bool ret = (par[now] == now) ? 0 : (getdist(par[now]) ^ distToPar[now]); n return ret; n } n stack, bool> > prevStat; n map, int> mp; n vector, pair > > opSeg; n vector > add[400400]; n void addSeg(int tl, int tr, pair val, int l, int r, int k) { n if (tl > r || l > tr) return; n if (tl <= l && r <= tr) { n add[k].push_back(val); n return; n } n int mid = (l + r) >> 1; n addSeg(tl, tr, val, l, mid, k + k); n addSeg(tl, tr, val, mid + 1, r, k + k + 1); n } n bool isBipar = 1; n void addEdge(pair now) { n int u = now.first, v = now.second; n int pu = getpar(u), pv = getpar(v); n if (pu == pv) { n prevStat.push(make_pair(make_pair(-1, -1), isBipar)); n if ((getdist(u) ^ getdist(v)) == 0) { n isBipar = 0; n } n return; n } n if (sz[pu] > sz[pv]) swap(u, v), swap(pu, pv); n prevStat.push(make_pair(make_pair(pu, sz[pu]), isBipar)); n distToPar[pu] = getdist(u) ^ getdist(v) ^ 1; n par[pu] = pv; n sz[pv] += sz[pu]; n } n void undo() { n int pos = prevStat.top().first.first, presz = prevStat.top().first.second, n preIsBipar = prevStat.top().second; n prevStat.pop(); n if (pos >= 0) { n sz[pos] = presz; n sz[par[pos]] -= sz[pos]; n par[pos] = pos; n } n isBipar = preIsBipar; n } n void solve(int l, int r, int k) { n for (int i = 0; i < (int)add[k].size(); i++) { n addEdge(add[k][i]); n } n if (l == r) { n ans[l] = isBipar; n } else { n int mid = (l + r) >> 1; n solve(l, mid, k + k); n solve(mid + 1, r, k + k + 1); n } n for (int i = 0; i < (int)add[k].size(); i++) undo(); n } n int main() { n ios::sync_with_stdio(false); n cin >> n >> q; n for (int i = 0; i < q; i++) { n cin >> x[i] >> y[i]; n x[i]--, y[i]--; n if (x[i] > y[i]) swap(x[i], y[i]); n } n for (int i = 0; i < n; i++) par[i] = i, sz[i] = 1; n for (int i = 0; i < q; i++) { n pair now = make_pair(x[i], y[i]); n if (!mp.count(now) || mp[now] < 0) { n mp[now] = i; n } else { n opSeg.push_back(make_pair(make_pair(mp[now], i), now)); n mp[now] = -1; n } n } n for (map, int>::iterator it = mp.begin(); it != mp.end(); n it++) { n if (it->second >= 0) { n opSeg.push_back(make_pair(make_pair(it->second, q), it->first)); n } n } n for (int i = 0; i < (int)opSeg.size(); i++) { n addSeg(opSeg[i].first.first, opSeg[i].first.second - 1, opSeg[i].second, 0, n q - 1, 1); n } n solve(0, q - 1, 1); n for (int i = 0; i < q; i++) cout << (ans[i] ? YES : NO ) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n string s; n cin >> s; n int count = 0; n for (int i = 0; i < n - 1; i++) { n if (s[i] == s[i + 1]) { n count++; n } n } n cout << count; n } n "} +{"func_code_string": "#include n using namespace std; n stringstream ans; n int final_sum; n string print_line(string a0) { n int S = 0; n for (int i = 0; i < a0.size() - 1; i++) { n int digit = a0[i] - 0 ; n S += digit; n ans << digit << + ; n } n int digit = a0[a0.size() - 1] - 0 ; n S += digit; n ans << digit << endl; n final_sum = S; n return to_string(S); n } n void print289(string a0) { print_line(print_line(print_line(a0))); } n void print999(string a0, int S, int offset = 0) { n ans.str( ); n int i = 0; n int nz = 0; n int dt = 0; n int ddd = 0; n while (i < offset) { n ans << a0[i] << + ; n dt = 10 * dt + a0[i] - 0 ; n ddd += a0[i] - 0 ; n i++; n } n for (i += 1; i < a0.size() - 1; i += 2) { n int a = a0[i - 1] - 0 ; n int b = a0[i] - 0 ; n int dt = 10 * a + b - a - b; n S += dt; n ans << a << b << + ; n if (S >= 1000) break; n } n if (S < 1000 && i < a0.size()) { n int a = a0[i - 1] - 0 ; n int b = a0[i] - 0 ; n int dt = 10 * a + b - a - b; n S += dt; n ans << a << b; n } n i++; n for (i; i < a0.size() - 1; i++) ans << a0[i] << + ; n for (i; i < a0.size(); i++) ans << a0[a0.size() - 1]; n ans << endl; n print_line(print_line(to_string(S))); n } n bool is_close(int S) { n if (S == 0) return true; n int div = 1; n while (S / div > 0) div *= 10; n if (S * 10 == div) return true; n return div - S < 1000; n } n bool is_mega_close(int S) { n if (S == 0) return true; n int div = 1; n while (S / div > 0) div *= 10; n if (S * 10 == div) return true; n return S - (div / 10) < 100; n } n void print(string a0, int S, int offset = 0) { n ans.str( ); n int i = 0; n int nz = 0; n int dt = 0; n int ddd = 0; n while (i < offset) { n ans << a0[i] << + ; n dt = dt * 10 + a0[i]; n ddd += a0[i] - 0 ; n i++; n } n if (!is_close(S)) { n for (i += 2; i < a0.size() - 2; i += 3) { n int a = a0[i - 2] - 0 ; n int b = a0[i - 1] - 0 ; n int c = a0[i] - 0 ; n int dt = 100 * a + 10 * b + c - a - b - c; n S += dt; n ans << a << b << c << + ; n if (is_close(S)) break; n } n if (i < a0.size() - 2) i++; n } n if (!is_mega_close(S)) n for (i += 2; i < a0.size() - 2; i += 3) { n int a = a0[i - 2] - 0 ; n int b = a0[i - 1] - 0 ; n int c = a0[i] - 0 ; n int dt = 9 * a; n S += dt; n ans << a << b << + << c << + ; n if (is_mega_close(S)) break; n } n if (i >= a0.size() - 2) n i -= 2; n else n i++; n for (i; i < a0.size() - 1; i++) ans << a0[i] << + ; n for (i; i < a0.size(); i++) ans << a0[a0.size() - 1]; n ans << endl; n print_line(print_line(to_string(S))); n } n int main() { n int n; n cin >> n; n string a0; n cin >> a0; n int S = 0; n for (int i = 0; i < a0.size(); i++) { n int digit = a0[i] - 0 ; n S += digit; n } n if (S < 199) { n print289(a0); n cout << ans.str(); n return 0; n } n if (S < 1000) { n print999(a0, S); n int k = 1; n while (final_sum > 9 && k < 2) print999(a0, S, k++); n if (false && n == 155096) { n cout << k << endl; n cout << final_sum << endl; n return 0; n } n cout << ans.str(); n return 0; n } n print(a0, S); n int k = 1; n while (final_sum > 9 && k < 3) print(a0, S, k++); n cout << ans.str(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline T read() { n T s = 0, f = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (isdigit(ch)) { n s = (s << 3) + (s << 1) + ch - 48; n ch = getchar(); n } n return s * f; n } n template n inline void print(T x) { n if (x < 0) putchar( - ), x = -x; n if (x > 9) print(x / 10); n putchar(x % 10 + 0 ); n } n const int N = 2e5 + 100; n const int mod = 1e9 + 7; n long long h[N], w[N], sum[N]; n struct Segment { n static const int maxn = 2e5 + 100; n struct star { n long long lsum, rsum, sum; n } s[maxn << 2]; n void pushup(int node, int l, int r) { n int mid = l + r >> 1; n s[node].lsum = n max(s[node << 1].lsum, h[l] + sum[mid - 1] - sum[l - 1] + n s[node << 1 | 1].lsum - h[mid + 1] + w[mid]); n s[node].lsum = max(s[node].lsum, h[l] + h[mid + 1] + sum[mid] - sum[l - 1]); n s[node].rsum = n max(s[node << 1 | 1].rsum, n h[r] + sum[r - 1] - sum[mid] + s[node << 1].rsum - h[mid] + w[mid]); n s[node].rsum = max(s[node].rsum, h[r] + h[mid] + sum[r - 1] - sum[mid - 1]); n s[node].sum = max(s[node << 1].rsum + s[node << 1 | 1].lsum - h[mid] - n h[mid + 1] + w[mid], n max(s[node << 1].sum, s[node << 1 | 1].sum)); n s[node].sum = max(s[node].sum, max(s[node].lsum, s[node].rsum)); n s[node].sum = max(s[node].sum, h[r] + h[l] + sum[r - 1] - sum[l - 1]); n s[node].sum = max( n s[node].sum, max(s[node << 1].rsum - h[mid] + h[mid + 1] + w[mid], n s[node << 1 | 1].lsum - h[mid + 1] + h[mid] + w[mid])); n s[node].sum = max(s[node].sum, h[mid] + h[mid + 1] + w[mid]); n } n void build(int node, int l, int r) { n if (l == r) { n s[node].lsum = s[node].rsum = h[l]; n s[node].sum = 0; n return; n } n int mid = l + r >> 1; n build(node << 1, l, mid); n build(node << 1 | 1, mid + 1, r); n pushup(node, l, r); n } n star query(int node, int l, int r, int L, int R) { n if (L == l && R == r) { n return s[node]; n } n int mid = l + r >> 1; n if (R <= mid) n return query(node << 1, l, mid, L, R); n else if (L > mid) n return query(node << 1 | 1, mid + 1, r, L, R); n else { n star lnode = query(node << 1, l, mid, L, mid); n star rnode = query(node << 1 | 1, mid + 1, r, mid + 1, R); n star now; n now.lsum = max(lnode.lsum, h[L] + sum[mid - 1] - sum[L - 1] + rnode.lsum - n h[mid + 1] + w[mid]); n now.lsum = max(now.lsum, h[L] + h[mid + 1] + sum[mid] - sum[L - 1]); n now.rsum = max(rnode.rsum, h[R] + sum[R - 1] - sum[mid] + lnode.rsum - n h[mid] + w[mid]); n now.rsum = max(now.rsum, h[R] + h[mid] + sum[R - 1] - sum[mid - 1]); n now.sum = max(lnode.rsum + rnode.lsum - h[mid] - h[mid + 1] + w[mid], n max(lnode.sum, rnode.sum)); n now.sum = max(now.sum, max(now.lsum, now.rsum)); n now.sum = max(now.sum, h[L] + h[R] + sum[R - 1] - sum[L - 1]); n now.sum = max(now.sum, max(lnode.rsum - h[mid] + h[mid + 1] + w[mid], n rnode.lsum - h[mid + 1] + h[mid] + w[mid])); n now.sum = max(now.sum, h[mid] + h[mid + 1] + w[mid]); n return now; n } n } n } tree; n int main() { n int n = read(), m = read(); n for (int i = 1; i <= n; ++i) { n w[i] = read(); n w[i + n] = w[i]; n sum[i] = sum[i - 1] + w[i]; n } n for (int i = 1; i <= n; ++i) { n h[i] = read(); n h[i] = h[i] + h[i]; n h[i + n] = h[i]; n } n for (int i = n + 1; i <= n + n; ++i) { n sum[i] = sum[i - 1] + w[i]; n } n tree.build(1, 1, n + n); n for (int i = 1; i <= m; ++i) { n int l = read(), r = read(); n int lc, rc; n if (r >= l) n lc = r + 1, rc = l + n - 1; n else n lc = r + 1, rc = l - 1; n printf( %lld n , tree.query(1, 1, n + n, lc, rc).sum); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, a[1001000], cnt[1001000], z[1001000]; n int main() { n ios::sync_with_stdio(false); n memset(cnt, 0, sizeof(cnt)); n memset(z, 0, sizeof(z)); n cin >> n >> m; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n if (a[i] <= m) cnt[a[i]]++; n } n int ans = 0, flag = 0; n for (int i = 1; i <= m; i++) { n if (cnt[i]) { n for (int k = 1; k * i <= m; k++) z[k * i] += cnt[i]; n } n } n for (int i = 1; i <= m; i++) { n if (z[i] > ans) { n ans = z[i]; n flag = i; n } n } n cout << (flag == 0 ? 1 : flag) << << ans << endl; n for (int i = 1; i <= n; i++) { n if (flag % a[i] == 0 && flag != 0) cout << i << ; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n signed long long int n, m, k, x, y; n signed long long int ct[3], myct; n int main() { n cin >> n >> m >> k >> x >> y; n signed long long int f1, q, val, rem = k; n if (n == 1) { n f1 = m; n q = rem / f1; n rem -= q * f1; n myct = q; n ct[1] = q; n ct[2] = q; n if (y <= rem) myct++; n if (rem != 0) ct[1]++; n cout << ct[1] << << ct[2] << << myct << n ; n return 0; n } else if (n == 2) { n f1 = 2 * m; n q = rem / f1; n rem -= q * f1; n myct = q; n ct[1] = ct[2] = q; n if (((x - 1) * m + y) <= rem) myct++; n if (rem != 0) ct[1]++; n cout << ct[1] << << ct[2] << << myct << n ; n return 0; n } n f1 = ((n - 2) * m * 2) + (2 * m); n q = rem / f1; n rem -= q * f1; n ct[0] = 2 * q; n ct[1] = q; n ct[2] = q; n int grp = -1; n if (x == 1) { n myct = q; n grp = 1; n } else if (x == n) { n myct = q; n grp = 2; n } else { n myct = 2 * q; n grp = 0; n } n int stp = 0; n if (rem > 0 && rem <= m) { n ct[1]++; n if (((x - 1) * m + y) <= rem) myct++; n } else if (rem > m && rem <= (n - 1) * m) { n ct[0]++; n ct[1]++; n if (((x - 1) * m + y) <= rem) myct++; n } else if (rem > (n - 1) * m && rem <= n * m) { n ct[0]++; n ct[1]++; n stp = 3; n if (rem == n * m) ct[2]++; n if (((x - 1) * m + y) <= rem) myct++; n } else if (rem > n * m && rem <= f1) { n ct[0] += 2; n ct[1]++; n ct[2]++; n myct++; n stp = 4; n if (x == 1 || x == n) { n } else { n rem -= n * m; n val = (n - x - 1) * m + y; n if (val <= rem) myct++; n } n } n signed long long int mini = ct[0], maxi = ct[0]; n for (int i = 1; i < 3; i++) { n mini = min(mini, ct[i]); n maxi = max(maxi, ct[i]); n } n cout << maxi << << mini << << myct << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, mncnt = 1000000000, cnt; n string a; n string c = ACTG ; n cin >> n >> a; n for (int i = 0; i <= n - 4; i++) { n cnt = 0; n string b = a.substr(i, 4); n for (int j = 0; j < 4; j++) { n int x = c[j] - A ; n int y = b[j] - A ; n if (abs(y - x) <= 13) n cnt += abs(y - x); n else n cnt += 26 - (abs(y - x)); n } n mncnt = min(mncnt, cnt); n } n cout << mncnt << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int a[12][12], nxt[110]; n int id(int x, int y) { n if (x & 1) return (10 - x) * 10 + 11 - y; n return (10 - x) * 10 + y; n } n double dp[120]; n int main() { n for (int i = 1; i <= 10; i++) n for (int j = 1; j <= 10; j++) a[i][j] = id(i, j); n for (int i = 1; i <= 10; i++) { n for (int j = 1, k; j <= 10; j++) { n scanf( %d , &k); n nxt[a[i][j]] = a[i - k][j]; n } n } n for (int i = 1; i < 6; i++) dp[100 - i] = 6; n for (int i = 94; i; i--) { n double x = 0; n for (int j = 1; j <= 6; j++) { n x += min(dp[i + j], dp[nxt[i + j]]); n } n dp[i] = x / 6 + 1; n } n printf( %.10f n , dp[1]); n } n "} +{"func_code_string": "#include n using namespace std; n struct data { n int x, h, p; n } a[100005]; n int n, x[100005], kq[100005], st[4 * 100005]; n void update(int id, int l, int r, int p, int v) { n if (l > p || r < p) return; n if (l == p && l == r) { n st[id] = v; n return; n } n int m = (l + r) >> 1; n update(id << 1, l, m, p, v); n update((id << 1) + 1, m + 1, r, p, v); n st[id] = max(st[id << 1], st[(id << 1) + 1]); n } n int getmax(int id, int l, int r, int d, int c) { n if (l > c || r < d) return 0; n if (l >= d && r <= c) return st[id]; n int m = (l + r) >> 1; n return max(getmax((id << 1), l, m, d, c), n getmax((id << 1) + 1, m + 1, r, d, c)); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 1; i <= n; ++i) { n cin >> a[i].x >> a[i].h; n a[i].p = i; n a[i].h = a[i].x + a[i].h - 1; n } n sort(a + 1, a + n + 1, [](data a, data b) { return a.x < b.x; }); n for (int i = n; i >= 1; --i) { n x[i] = a[i].x; n int pos = upper_bound(x + i + 1, x + n + 1, a[i].h) - x - 1; n int t = getmax(1, 1, n, i + 1, pos); n if (t < i) t = i; n kq[a[i].p] = t - i + 1; n update(1, 1, n, i, t); n } n for (int i = 1; i <= n; ++i) cout << kq[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int now[15][3], ans[15][3], nA, nB, nC, minN = 12, cnt, t[13]; n void dfs(int a, int b, int c, int num, int jw, int cou, bool ifA, bool ifB) { n if (!a && !b && !c && !jw) { n minN = num; n cnt = cou; n memcpy(ans, now, sizeof(now)); n return; n } n if (a % 10 + b % 10 - c % 10 + jw == 0 && c) n dfs(a / 10, b / 10, c / 10, num, 0, cou + 1, a ? 0 : 1, b ? 0 : 1); n else if (a % 10 + b % 10 - c % 10 + jw == 10 && c) n dfs(a / 10, b / 10, c / 10, num, 1, cou + 1, a ? 0 : 1, b ? 0 : 1); n else { n if (minN - ++num <= 0) return; n now[num][2] = ++cou; n if (!ifA && c) { n now[num][0] = 1; n now[num][1] = (c % 10 - b % 10 - jw + 10) % 10; n bool f = ifB; n if (!b) ifB = 1; n dfs(a, b / 10, c / 10, num, (now[num][1] + b % 10 + jw - c % 10) / 10, n cou, ifA, ifB); n ifB = f; n } n if (!ifB && c) { n now[num][0] = 2; n now[num][1] = (c % 10 - a % 10 + 10 - jw) % 10; n bool f = ifA; n if (a == 0) ifA = 1; n dfs(a / 10, b, c / 10, num, (now[num][1] + a % 10 + jw - c % 10) / 10, n cou, ifA, ifB); n ifA = f; n } n now[num][0] = 3; n now[num][1] = (a % 10 + b % 10 + jw) % 10; n if (!a) ifA = 1; n if (!b) ifB = 1; n dfs(a / 10, b / 10, c, num, (a % 10 + b % 10 + jw - now[num][1]) / 10, cou, n ifA, ifB); n } n } n int main() { n int a, b, c; n bool f; n scanf( %d+%d=%d , &a, &b, &c); n dfs(a, b, c, 0, 0, 0, 0, 0); n int p = 1; n while (p <= minN && ans[p][0] - 1) p++; n for (int i = 1; i <= cnt; i++) n if (p <= minN && ans[p][2] == i) { n t[i] = ans[p++][1]; n while (p <= minN && ans[p][0] - 1) p++; n } else { n t[i] = a % 10; n a /= 10; n } n f = 0; n for (int i = cnt; i; i--) n if (f || t[i]) { n putchar(t[i] + 0 ); n f = 1; n } n putchar( + ); n p = 1; n while (p <= minN && ans[p][0] - 2) p++; n for (int i = 1; i <= cnt; i++) n if (p <= minN && ans[p][2] == i) { n t[i] = ans[p++][1]; n while (p <= minN && ans[p][0] - 2) p++; n } else { n t[i] = b % 10; n b /= 10; n } n f = 0; n for (int i = cnt; i; i--) n if (f || t[i]) { n putchar(t[i] + 0 ); n f = 1; n } n putchar( = ); n p = 1; n while (p <= minN && ans[p][0] - 3) p++; n for (int i = 1; i <= cnt; i++) n if (p <= minN && ans[p][2] == i) { n t[i] = ans[p][1]; n p++; n while (p <= minN && ans[p][0] - 3) p++; n } else { n t[i] = c % 10; n c /= 10; n } n f = 0; n for (int i = cnt; i; i--) n if (f || t[i]) { n putchar(t[i] + 0 ); n f = 1; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int mas[1010][1010]; n int main() { n int N, K; n cin >> N >> K; n for (int i = 1; i <= N; i++) { n int k = 0; n for (int j = 1; j <= N; j++) { n if (k == K) n break; n else if (i == j) n continue; n else if (mas[j][i] || mas[i][j]) n continue; n else { n mas[i][j] = 1; n k++; n } n } n if (k < K) { n cout << -1 << endl; n return 0; n } n } n int cnt = 0; n for (int i = 1; i <= N; i++) { n for (int j = 1; j <= N; j++) { n if (mas[i][j]) cnt++; n } n } n cout << cnt << endl; n for (int i = 1; i <= N; i++) { n for (int j = 1; j <= N; j++) { n if (mas[i][j]) cout << i << << j << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, k, mod = 1e9 + 7; n map mp; n string s; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n srand(time(0)); n cin >> n >> k; n vector a(n + 2); n vector b(k + 2); n for (long long i = 1; i <= n; ++i) cin >> a[i], a[i] -= i; n a[0] = -2e9; n a[n + 1] = 2e9; n b[k + 1] = n + 1; n for (long long i = 1; i <= k; ++i) cin >> b[i]; n long long ans = 0; n for (long long i = 0; i <= k; ++i) { n long long l = b[i]; n long long r = b[i + 1]; n if (a[l] > a[r]) { n cout << -1; n exit(0); n } n vector v; n for (long long j = l + 1; j < r; ++j) { n if (a[j] > a[r] || a[j] < a[l]) continue; n auto x = upper_bound(v.begin(), v.end(), a[j]); n if (x == v.end()) n v.push_back(a[j]); n else n *x = a[j]; n } n ans += r - l - 1 - v.size(); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int N, K, M, S; n int arr[500000]; n int raito[500005]; n int seen[500005]; n int bucket[500005]; n int shift[500005]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> M >> K >> N >> S; n for (int i = 0; i < M; i++) { n cin >> arr[i]; n } n int t; n for (int i = 0; i < S; i++) { n cin >> t; n bucket[t]++; n } n for (int i = 0; i < 500005; i++) seen[i] = -1; n for (int i = M - 1; i >= 0; i--) { n raito[i] = seen[arr[i]]; n seen[arr[i]] = i; n } n int maxima = 0; n for (int i = 0; i < 500005; i++) { n if (bucket[i] == 0) continue; n int cur = seen[i]; n int p = 1; n while (cur != -1 && p < bucket[i]) { n cur = raito[cur]; n p++; n } n if (cur == -1) { n cout << -1; n return 0; n } n shift[i] = cur; n maxima = max(maxima, cur); n } n vector adj; n for (int i = 0; i < M;) { n int total = i / K + 1 + ((M - 1) - (maxima + 1) + 1) / K; n if (total >= N) { n int extra = K - S; n for (int j = i; j <= maxima; j++) { n if (extra <= 0 && bucket[arr[j]] == 0) { n adj.push_back(j + 1); n } else if (bucket[arr[j]] == 0) { n extra--; n } else { n bucket[arr[j]]--; n } n } n cout << adj.size() << n ; n for (int j = 0; j < adj.size(); j++) { n cout << adj[j] << ; n } n return 0; n } n if (i + 1 == M) break; n int pp = 0; n if (bucket[arr[i]] != 0) { n shift[arr[i]] = raito[shift[arr[i]]]; n maxima = max(maxima, shift[arr[i]]); n if (shift[arr[i]] == -1) { n cout << -1; n return 0; n } n } n i++; n } n cout << -1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 400010; n int n; n int fa[MAXN][21]; n int dep[MAXN]; n int LCA(int x, int y) { n if (dep[x] < dep[y]) swap(x, y); n for (int i = 20; i >= 0; i--) { n if (dep[x] - (1 << i) >= dep[y]) { n x = fa[x][i]; n } n } n if (x == y) return x; n for (int i = 20; i >= 0; i--) { n if (fa[x][i] != fa[y][i]) { n x = fa[x][i]; n y = fa[y][i]; n } n } n return fa[x][0]; n } n int main() { n scanf( %d , &n); n int L, R; n L = R = 1; n int mx = 0; n int p; n for (int i = 2; i <= n; i++) { n scanf( %d , &p); n fa[i][0] = p; n dep[i] = dep[p] + 1; n for (int j = 1; j <= 20; j++) { n fa[i][j] = fa[fa[i][j - 1]][j - 1]; n } n int z = LCA(i, L); n int ans1 = dep[i] + dep[L] - 2 * dep[z]; n z = LCA(i, R); n int ans2 = dep[i] + dep[R] - 2 * dep[z]; n if (ans1 > ans2 && ans1 > mx) { n mx = ans1; n R = i; n } n if (ans2 >= ans1 && ans2 > mx) { n L = i; n mx = ans2; n } n if (i == n) n printf( %d n , mx); n else n printf( %d , mx); n } n } n "} +{"func_code_string": "#include n using namespace std; n #pragma GCC optimize( Ofast,no-stack-protector ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n #pragma GCC optimize( unroll-loops ) n long long fun(long long n, long long m, long long mid) { n long long val = 0; n for (long long i = 1; i <= n; i++) val += min(m, (mid - 1) / i); n return val; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n long long tst = 1; n for (long long tt = 1; tt <= tst; tt++) { n long long n, m, k; n cin >> n >> m >> k; n long long l = 1, r = (n * m) + 1; n while (l < r) { n long long mid = (l + r) / 2; n if (fun(n, m, mid) < k) n l = mid + 1; n else n r = mid; n } n cout << l - 1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } n int main() { n long long a, b; n while (cin >> a >> b) { n long long suma = 0, sumb = 0; n long long ca = 0, cb = 0; n long long limit = lcm(a, b); n long long now = 0, prev = 0; n while (now <= limit) { n if (now % b != 0 || (now % a == 0 && a > b)) { n suma += now - prev; n } else { n sumb += now - prev; n } n prev = now; n now = min(a * (ca + 1), b * (cb + 1)); n if (now % a == 0) ca++; n if (now % b == 0) cb++; n } n cout << (suma == sumb ? Equal : suma > sumb ? Dasha : Masha ) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, dp[2000 + 10][2000 + 10]; n bool v[2000 + 10][2000 + 10]; n vector vec[2000 + 10]; n int solve(int curr, int kk) { n if (kk > k) return 0; n if (kk == k) return 1; n if (v[curr][kk]) return dp[curr][kk]; n for (int i = 0; i < vec[curr].size(); i++) { n dp[curr][kk] += (solve(vec[curr][i], kk + 1)) % 1000000007; n dp[curr][kk] %= 1000000007; n } n v[curr][kk] = true; n return dp[curr][kk]; n } n int main() { n ios::sync_with_stdio(false), cin.tie(0); n cin >> n >> k; n for (int i = 1; i <= n; i++) { n for (int j = i; j <= n; j += i) { n if (!(j % i)) vec[i].push_back(j); n } n } n cout << solve(1, 0) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[100005]; n int dp[302][100005]; n int main() { n ios::sync_with_stdio(0); n int n, q; n cin >> n; n for (int i = 1; i <= n; ++i) cin >> a[i]; n cin >> q; n memset(dp, 0, sizeof(dp)); n for (int k = min(300, n); k >= 1; --k) { n for (int i = n; i >= 1; --i) { n if (i + a[i] + k > n) n dp[k][i] = 1; n else n dp[k][i] = 1 + dp[k][i + a[i] + k]; n } n } n while (q--) { n int p, k; n cin >> p >> k; n if (k <= 300) n cout << dp[k][p] << endl; n else { n int ans = 0; n while (p <= n) { n p = p + a[p] + k; n ans++; n } n cout << ans << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, ans = 0, minm; n long long A[10 * 100000 + 6]; n unordered_map M; n long long pos, neg, cc = 0, k = 0; n int main() { n scanf( %lld , &n); n for (int i = 1; i <= n; ++i) { n scanf( %lld , &A[i]); n M[A[i] - i]++; n ans += abs(A[i] - i); n if (A[i] <= i) n neg++; n else n pos++; n } n minm = ans; n for (long long i = 1, j = n; i <= n - 1; ++i, --j) { n if (A[j] - j - cc <= 0) n --neg; n else n --pos; n ans -= abs(A[j] - j - cc); n ans += A[j]; n ++pos; n M[A[j] + cc]++; n M[A[j] - j]--; n ++cc; n ans -= pos; n ans += neg; n pos -= M[cc]; n neg += M[cc]; n if (ans <= minm) { n minm = ans; n k = i; n } n } n printf( %lld %lld n , minm, k); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[200005], ans1 = 1, ans2 = 0; n int main() { n int n, b, b1; n scanf( %d , &n); n for (int i = 1; i <= n; ++i) { n scanf( %d , &a[i]); n } n sort(a + 1, a + 1 + n); n b1 = 0; n for (int i = 2; i <= n; ++i) { n b = a[i] - a[i - 1]; n if (b == 0) { n continue; n } else if (b == 1) { n if (b1 == 2) { n ans1++; n b1 = 0; n } else if (b1 == 1) { n b1 = 2; n } else if (b1 == 0) { n b1 = 1; n } n } else if (b == 2) { n if (b1 == 0) { n b1 = 2; n } else if (b1 >= 1) { n b1 = 0; n ans1++; n } n } else { n b1 = 0; n ans1++; n } n } n for (int i = 1; i <= n; ++i) { n b = a[i] - a[i - 1]; n if (i == 1) { n a[i]--; n ans2++; n continue; n } n if (b >= 1) ans2++; n if (b == 0 && a[i] != a[i + 1]) { n ans2++; n a[i]++; n } else if (b == 1 && a[i] == a[i + 1] - 1) { n continue; n } else if (b == 1 && a[i] == a[i + 1] - 2) { n continue; n } else if (b == 1 && a[i] != a[i + 1]) { n a[i]++; n } else if (b >= 2) { n a[i]--; n } n } n printf( %d %d n , ans1, ans2); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main(int argc, const char* argv[]) { n int cases; n cin >> cases; n while (cases--) { n int num; n scanf( %d , &num); n vector > coords; n pair z(0, 0); n coords.push_back(z); n for (int i = 0; i < num; ++i) { n int x, y; n scanf( %d%d , &x, &y); n coords.push_back({x, y}); n } n sort(coords.begin(), coords.end()); n string out; n bool ok = true; n for (int i = 1; i <= num; ++i) { n int diffx = coords[i].first - coords[i - 1].first; n int diffy = coords[i].second - coords[i - 1].second; n if (diffx < 0 || diffy < 0) { n ok = false; n break; n } n while (diffx--) out += R ; n while (diffy--) out += U ; n } n if (ok) { n cout << YES << endl; n cout << out << endl; n } else { n cout << NO << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 110; n int a[M]; n int main() { n int n, cnt = 0; n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , a + i); n if (a[i] % 2 == 0) cnt++; n } n if (n % 2 == 0) { n printf( No n ); n return 0; n } n if (a[1] % 2 == 0 || a[n] % 2 == 0) { n printf( No n ); n return 0; n } else { n printf( Yes n ); n return 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n T mulmod(T a, T b) { n if (b == 0) return 0; n if (b == 1) return a; n T x = mulmod(a, b >> 1); n x = (x + x) % 1000000007; n if (b & 1) x = (x + a) % 1000000007; n return x; n } n template n T larger(T a, T b) { n return (a > b ? a : b); n } n template n T smaller(T a, T b) { n return (a < b ? a : b); n } n template n T gcd(T a, T b) { n if (b == 0) return a; n return gcd(b, a % b); n } n template n T lcm(T a, T b) { n return (a * b) / gcd(a, b); n } n template n string converter(T n) { n stringstream x; n x << n; n return x.str(); n } n template n T pw(T a, T b) { n if (b == 0) return 1; n T x = pw(a, b >> 1); n x = mulmod(x, x); n if (b & 1) x = mulmod(x, a); n return x; n } n template n void deb(T1 e1) { n cout << e1 << endl; n } n template n void deb(T1 e1, T2 e2) { n cout << e1 << << e2 << endl; n } n template n void deb(T1 e1, T2 e2, T3 e3) { n cout << e1 << << e2 << << e3 << endl; n } n template n void deb(T1 e1, T2 e2, T3 e3, T4 e4) { n cout << e1 << << e2 << << e3 << << e4 << endl; n } n template n void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) { n cout << e1 << << e2 << << e3 << << e4 << << e5 << endl; n } n template n void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) { n cout << e1 << << e2 << << e3 << << e4 << << e5 << << e6 n << endl; n } n void letsgo() { n long long int a, b, x, n; n cin >> a >> b >> n >> x; n if (a == 1) { n cout << (x + (n % 1000000007 * b) % 1000000007) % 1000000007; n return; n } n long long int aN = pw(a, n); n long long int ans = (aN * x) % 1000000007; n long long int z = ((aN - 1 + 1000000007) % 1000000007 * b) % 1000000007; n z = (z * pw(a - 1, 1000000007 - 2ll)) % 1000000007; n cout << (ans + z) % 1000000007; n } n int main() { n letsgo(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x3f3f3f3f; n const double eps = 1e-8; n const double PI = acos(-1.0); n const int maxn = 200 + 10; n char str[maxn]; n struct TwoSat { n int n; n vector G[maxn * 2]; n bool mark[maxn * 2]; n int S[maxn * 2], c; n bool isv[maxn]; n int sz; n bool dfs(int x) { n if (mark[x ^ 1]) return false; n if (mark[x]) return true; n if (x / 2 < xi) { n int id = str[x / 2] - a ; n if (isv[id] != (x & 1)) return false; n tmp[x / 2] = str[x / 2]; n } else if (x / 2 == xi) { n int t = get_min(str[xi] - a , (x & 1) ? true : false); n if (t == -1) return false; n tmp[x / 2] = t + a ; n } else { n int t = get_min(-1, (x & 1) ? true : false); n if (t == -1) return false; n tmp[x / 2] = t + a ; n } n mark[x] = true; n S[c++] = x; n for (int i = 0; i < G[x].size(); i++) n if (!dfs(G[x][i])) return false; n return true; n } n void init(int n, char *s) { n this->n = n; n for (int i = 0; i < n * 2; i++) G[i].clear(); n memset(mark, false, sizeof(mark)); n sz = strlen(s); n for (int i = 0; i < sz; i++) isv[i] = s[i] == V ? true : false; n } n void add_clause(int x, int xval, int y, int yval) { n x = x * 2 + xval; n y = y * 2 + yval; n G[x ^ 1].push_back(y); n G[y ^ 1].push_back(x); n } n int get_min(int pos, bool c) { n for (int i = pos + 1; i < sz; i++) { n if (c == isv[i]) return i; n } n return -1; n } n char ans[maxn], tmp[maxn]; n int xi; n void solve() { n bool OK = false; n for (int pos = 0; pos <= n; pos++) { n for (int x = 0; x <= 1; x++) { n xi = pos; n bool ok = false; n memset(mark, false, sizeof(mark)); n strcpy(tmp, str); n if (pos < n) { n int t = get_min(str[pos] - a , (x & 1) ? true : false); n if (t == -1) continue; n tmp[pos] = t + a ; n } n for (int i = pos + 1; i < n; i++) tmp[i] = a ; n c = 0; n for (int i = 0; i < n; i++) { n int x1 = (i << 1) | (isv[tmp[i] - a ]); n if (!dfs(x1)) { n ok = true; n break; n } n } n if (n == 200) { n } n if (ok) continue; n OK = true; n tmp[n] = 0; n if (ans[0] == 0) n strcpy(ans, tmp); n else if (strcmp(tmp, ans) < 0) n strcpy(ans, tmp); n } n } n if (OK) n printf( %s n , ans); n else n printf( -1 n ); n } n } sat; n int main() { n int n, m; n while (~scanf( %s , str)) { n scanf( %d%d , &n, &m); n sat.init(n, str); n for (int i = 0, x, y, xval, yval; i < m; i++) { n char t1[5], t2[5]; n scanf( %d%s%d%s , &x, t1, &y, t2); n xval = t1[0] == V ? 1 : 0; n yval = t2[0] == V ? 1 : 0; n --x; n --y; n sat.add_clause(x, xval ^ 1, y, yval); n } n scanf( %s , str); n sat.solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int thien, n, tt, h; n string s; n int main() { n cin >> tt; n for (int ii = 1; ii <= tt; ii++) { n cin >> n; n thien = 0; n h = 0; n for (int i = 1; i <= n; i++) { n cin >> s; n if (s.length() % 2 != 0) thien++; n for (int j = 0; j < s.length(); j++) n if (s[j] == 1 ) h++; n } n if (h % 2 != 0 && thien == 0) n cout << n - 1 << endl; n else n cout << n << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 300010; n int p1[maxn], p2[maxn], q[maxn]; n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 0; i < n; i++) { n scanf( %d , &p1[i]); n p1[i]--; n p2[p1[i]] = i; n q[i] = n; n } n for (int i = 0; i < m; i++) { n int x, y; n scanf( %d%d , &x, &y); n x--; n y--; n x = p2[x]; n y = p2[y]; n if (x > y) swap(x, y); n q[x] = min(q[x], y); n } n int r = n - 1; n long long ans = 0; n for (int i = n - 1; i >= 0; i--) { n r = min(q[i] - 1, r); n ans += r - i + 1; n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[200001]; n const double esl = 1e-11; n double cal(double x) { n double t = 0; n double ans = 0; n for (int i = 1; i <= n; i++) { n if (t + a[i] - x < 0) { n ans = max(ans, t); n t = 0; n } else { n t += ((double)a[i] - x); n ans = max(ans, t); n } n } n ans = max(ans, t); n double t1 = 0; n for (int i = 1; i <= n; i++) { n if (t1 + a[i] - x > 0) { n ans = max(ans, -t1); n t1 = 0; n } else { n t1 += ((double)a[i] - x); n ans = max(ans, -t1); n } n } n ans = max(ans, -t1); n return ans; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n } n double l = -(1e5); n double r = 1e5; n for (int i = 1; i <= 500; i++) { n double d = (2.0 * l + r) / 3; n double c = (2.0 * r + l) / 3; n if (cal(d) > cal(c)) { n l = d; n } else n r = c; n } n printf( %.10f , cal(l)); n return 0; n } n "} +{"func_code_string": "#include n const int N = 5e4 + 10; n int n, m; n std::vector a[N]; n int sx[N], sy[N]; n int main() { n int T; n scanf( %d , &T); n while (T--) { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; ++i) { n a[i].resize(m + 2); n getchar(); n for (int j = 1; j <= m; ++j) scanf( %c , &a[i][j]); n } n int cnt_x = 0, cnt_y = 0, p_x = 1, p_y = 1; n for (int i = 1; i <= n; ++i) { n int sum = 0; n for (int j = 1; j <= m; ++j) sum += (a[i][j] == * ); n sx[i] = sum; n } n for (int i = 1; i <= m; ++i) { n int sum = 0; n for (int j = 1; j <= n; ++j) sum += (a[j][i] == * ); n sy[i] = sum; n } n int ans = 0x3f3f3f3f; n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) { n int now = n + m - sx[i] - sy[j]; n if (a[i][j] == . ) --now; n ans = std::min(ans, now); n } n printf( %d n , ans); n for (int i = 1; i <= n; ++i) a[i].clear(), sx[i] = 0; n for (int i = 1; i <= m; ++i) sy[i] = 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n auto clk = clock(); n mt19937_64 rang( n chrono::high_resolution_clock::now().time_since_epoch().count()); n void test_case() { n long long int n; n cin >> n; n long long int a[n + 1]; n long long int t = -1, b = -1, c = -1; n for (long long int i = 1; i <= n; i++) { n cin >> a[i]; n } n for (long long int i = 2; i <= n - 1; i++) { n for (long long int j = i - 1; j >= 1; j--) { n if (a[j] < a[i]) { n t = j; n break; n } n } n for (long long int j = i + 1; j <= n; j++) { n if (a[j] < a[i]) { n c = j; n break; n } n } n if (t != -1 && c != -1) { n b = i; n break; n } n t = -1, c = -1; n } n if (b != -1) { n cout << YES << endl; n cout << t << << b << << c << endl; n } else n cout << NO << endl; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n srand(chrono::high_resolution_clock::now().time_since_epoch().count()); n cout << fixed << setprecision(10); n long long int t = 1; n cin >> t; n while (t--) { n test_case(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long nthRoot(long long A, long long N) { n float xPre = rand() % 10; n float eps = 1e-3; n float delX = LLONG_MAX; n float xK; n while (delX > eps) { n xK = ((N - 1.0) * xPre + (float)A / pow(xPre, N - 1)) / (float)N; n delX = abs(xK - xPre); n xPre = xK; n } n return ceil(xK); n } n int main() { n long long n; n cin >> n; n char a[] = { c , o , d , e , f , o , r , c , e , s }; n long long in = 0, num; n num = nthRoot(n, 10); n if (pow(num, 10) < n) num++; n for (int i = 0; i <= 10; i++) { n if (pow(num - 1, i) * pow(num, 10 - i) >= n) { n in = i; n } else n break; n } n if (in * (num - 1) + (10 - in) * num - 10 < n - 1) { n for (int i = 0; i < in; i++) { n long long t = num - 1; n while (t--) cout << a[i]; n } n for (int i = in; i < 10; i++) { n long long t = num; n while (t--) cout << a[i]; n } n } else { n for (int i = 0; i < 10; i++) cout << a[i]; n long long t = n - 1; n while (t--) cout << a[9]; n } n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void amin(T& a, const T& b) { n if (a > b) a = b; n } n template n inline void amax(T& a, const T& b) { n if (a < b) a = b; n } n template n inline void rv(vector& v, int n) { n vector(n).swap(v); n for (int i = 0; i < (n); i++) cin >> v[i]; n } n inline void rv(int* v, int n) { n for (int i = 0; i < (n); i++) scanf( %d , &v[i]); n } n inline void rv(long long* v, int n) { n for (int i = 0; i < (n); i++) scanf( %lld , &v[i]); n } n inline vector rvi(int n) { n vector v(n); n for (int i = 0; i < (n); i++) scanf( %d , &v[i]); n return v; n } n inline vector rvl(int n) { n vector v(n); n for (int i = 0; i < (n); i++) scanf( %lld , &v[i]); n return v; n } n inline vector rvs(int n) { n vector v(n); n for (int i = 0; i < (n); i++) scanf( %s , &v[i]); n return v; n } n template n inline void readvv(vector>& v, int m, int n) { n vector>(m).swap(v); n for (int i = 0; i < (m); i++) readv(v[i], n); n } n inline void pvi(vector& v) { n for (int i = 0; i < (v.size()); i++) printf( %d , v[i]); n printf( n ); n } n inline void pvl(vector& v) { n for (int i = 0; i < (v.size()); i++) { n printf( %lld , v[i]); n } n printf( n ); n } n inline void pvs(vector& v) { n for (int i = 0; i < (v.size()); i++) { n printf( %s n , v[i].c_str()); n } n } n int main() { n long long n; n long double s; n cin >> n >> s; n vector> g(n); n for (int i = 0; i < (n - 1); i++) { n long long u, v; n cin >> u >> v; n g[u - 1].push_back(v - 1); n g[v - 1].push_back(u - 1); n } n long double leaves = 0, two = 2; n for (int i = 0; i < (n); i++) { n if (g[i].size() == 1) leaves++; n } n cout << setprecision(20) << endl; n cout << ((two * s) / leaves) << endl; n return 0; n } n "} +{"func_code_string": "#include bits/stdc++.h n using namespace std; n #define all(x) x.begin(),x.end() n #define pb push_back n #define ff first n #define ss second n #define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0) n #define ar array n #define int long long n #define F(i,a,b) for(i=a;i=a;--i) n #define NL cout<< n ; n #define INF LONG_LONG_MAX n #define pii pair n #define vi vector n n typedef long long ll; n typedef long double ld; n const ll mod=1e9+7; n bool comp(ll a,ll b) n { n return a>=1; n } n return res; n } n n ll minm(ll a,ll b){ n if(ab){ return a;} n else return b; n } n n int PHI(int k){ n // This is Euler s Totient Function. n //This function returns no. of coprime numbers to N in range [1,2,....,N] n n int ans=k; n for(int i=2;i*i<=k;++i){ n if(k%i==0){ n ans-=ans/i; n while(k%i==0){ n k/=i; n } n } n } n if(k>1) ans-=ans/k; n return ans; n n n } n n void solve(){ n n int n,i; n cin >> n; n n vectorecells; n vectorocells; n n for(i=1;i<=n;i++){ n for(int j=1;j<=n;j++){ n if((i+j)%2){ n ocells.pb({i,j}); n } n else ecells.pb({i,j}); n } n } n n // 1 even n // 2,3 odd n // if not possible ie all odd are filled, fill 2,3 in even n n int cnt=0; n n while(cnt> a; n n if(a==1){ n // try to fill 2 in odd cell n // if not possible , fill 3 in even n if(ocells.empty()){ n cout<< 3 <>_; n n for(int test_case=1;test_case<=_;++test_case){ n solve(); n } n n n }"} +{"func_code_string": "#include n int main() { n char str[3][100]; n int i; n for (i = 0; i < 3; i++) { n scanf( %s , &str[i][0]); n } n int r = 0, p = 0, s = 0; n for (i = 0; i < 3; i++) { n if (str[i][0] == r ) n r++; n else if (str[i][0] == p ) n p++; n else if (str[i][0] == s ) n s++; n } n char m = a ; n if (r == 1 && s == 2) n m = r ; n else if (s == 1 && p == 2) n m = s ; n else if (p == 1 && r == 2) n m = p ; n if (m != a ) { n for (i = 0; i < 3; i++) { n if (str[i][0] == m) break; n } n if (i == 0) n printf( F ); n else if (i == 1) n printf( M ); n else if (i == 2) n printf( S ); n } else n printf( ? ); n } n "} +{"func_code_string": "#include n using namespace std; n long long int powe(long long int d, long long int s) { n if (s == 1) n return d; n else if (s == 0) n return 1; n else { n long long int u, v = d; n for (u = 1; u < s; u++) { n d = d * v; n } n return d; n } n } n bool isprime(long long int n) { n long long int i; n for (i = 2; i * i <= n; i++) { n if (n % i == 0) { n return false; n } n } n return true; n } n long long int a[2000005], c[10000005]; n int main() { n map b; n long long int i, p, y, mx = -1, j, q; n cin >> p >> y; n for (i = y; i > p; i--) { n q = 1; n for (j = 2; j * j <= i && j <= p; j++) { n if (i % j == 0) { n q = 0; n break; n } n } n if (q == 1) { n cout << i; n return 0; n } n } n cout << -1; n } n "} +{"func_code_string": "#include n using namespace std; n using llint = long long; n using par = pair; n const int MAXN = 200100; n llint w[MAXN]; n vector edges[MAXN]; n int p[MAXN], in[MAXN], out[MAXN], idx[MAXN], id; n void dfs(int u) { n in[u] = ++id; n for (const auto& edge : edges[u]) { n if (edge.first == p[u]) continue; n p[edge.first] = u; n idx[edge.first] = edge.second; n dfs(edge.first); n } n out[u] = id; n } n int next(int u) { return w[idx[u]] == 1 ? p[u] = next(p[u]) : u; } n void toLCA(int u, int v, llint& c) { n if (!u || !c) return; n if (in[u] <= in[v] && out[u] >= out[v]) return; n c /= w[idx[u]]; n toLCA(p[u] = next(p[u]), v, c); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n llint c; n int n, m, u, v; n cin >> n >> m; n for (int i = 1; i < n; ++i) { n cin >> u >> v >> w[i]; n edges[u].emplace_back(v, i); n edges[v].emplace_back(u, i); n } n dfs(1); n while (m--) { n cin >> u; n if (u == 1) { n cin >> u >> v >> c; n toLCA(u, v, c); n toLCA(v, u, c); n cout << c << n ; n } else { n cin >> u >> c; n w[u] = c; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n ll BASE_NUM = 998244353; n class UnionFindTree { n map union_tree_data; n n public: n UnionFindTree() {} n UnionFindTree(vector verticals) { n for (auto v : verticals) { n union_tree_data[v] = v; n } n } n void add_vertical(ll v) { union_tree_data[v] = v; } n void reset() { n for (auto &pair : union_tree_data) { n pair.second = pair.first; n } n } n long long find(long long N) { n if (union_tree_data[N] == N) { n return N; n } else { n return union_tree_data[N] = find(union_tree_data[N]); n } n } n bool same(long long x, long long y) { return find(x) == find(y); } n void union_tree(long long x, long long y) { n x = find(x); n y = find(y); n if (x == y) return; n union_tree_data[x] = y; n } n }; n class edge { n public: n ll from, to, cost; n bool operator<(const edge &another) const { return cost < another.cost; }; n bool operator>(const edge &another) const { return cost > another.cost; }; n }; n class MST { n UnionFindTree uft; n n public: n priority_queue, greater> que; n vector result; n ll cost = 0; n MST(vector &nodes, vector &edges) : uft(nodes) { n for (auto e : edges) { n que.push(e); n } n while (!que.empty()) { n edge e; n e = que.top(); n if (!uft.same(e.from, e.to)) { n uft.union_tree(e.from, e.to); n result.push_back(e); n cost += e.cost; n } n que.pop(); n } n } n }; n int main() { n ll n; n vector> towns; n vector costs; n vector ks; n vector edges; n cin >> n; n for (int i = 0; i < n; i++) { n pair p; n cin >> p.first >> p.second; n towns.push_back(p); n } n for (int i = 0; i < n; i++) { n ll c; n cin >> c; n costs.push_back(c); n } n for (int i = 0; i < n; i++) { n ll k; n cin >> k; n ks.push_back(k); n } n for (int i = 0; i < n; i++) { n for (int j = i + 1; j < n; j++) { n edges.push_back({i, j, n (abs(towns[i].first - towns[j].first) + n abs(towns[i].second - towns[j].second)) * n (ks[i] + ks[j])}); n } n } n for (int i = 0; i < n; i++) { n edges.push_back({i, n, costs[i]}); n } n vector nodes(n + 1); n for (int i = 0; i < n + 1; i++) { n nodes[i] = i; n } n MST mst(nodes, edges); n vector stations; n vector> connections; n for (auto e : mst.result) { n if (e.to == n) { n stations.push_back(e.from); n } else { n connections.push_back(make_pair(e.from, e.to)); n } n } n cout << mst.cost << n ; n cout << stations.size() << n ; n for (int i = 0; i < stations.size(); i++) { n if (i == 0) { n cout << stations[i] + 1; n } else { n cout << << stations[i] + 1; n } n } n cout << n ; n cout << connections.size() << n ; n for (int i = 0; i < connections.size(); i++) { n cout << connections[i].first + 1 << << connections[i].second + 1 n << n ; n } n cout << flush; n return 0; n } n "} +{"func_code_string": "#include n #define fi first n #define se second n #define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++) n #define mk make_pair n #define pii pair n #define pll pair n #define pb push_back n #define IT iterator n #define V vector n #define TP template n #define TPP template n #define SZ(a) ((int)a.size()) n #define all(a) a.begin(), a.end() n #define rep(i, a, b) for (int i = a; i <= b; i++) n #define REP(i, a, b) for (int i = b; i >= a; i--) n #define FOR(i,n) rep(i,1,n) n #define debug(x) cerr << #x << = << x << endl n using namespace std; n typedef unsigned ui; n typedef long long ll; n typedef unsigned long long ull; n typedef double db; n typedef long double ld; n const int N = 3010, size = 1 << 20, mod = 998244353, inf = 2e9; n const ll INF = 1e15; n n // char buf[size],*p1=buf,*p2=buf; n TP void qr(o& x) { n char c = gc; n x = 0; n int f = 1; n while (!isdigit(c)) { n if (c == - ) n f = -1; n c = gc; n } n while (isdigit(c)) n x = x * 10 + c - 0 , c = gc; n x *= f; n } n template void qr(o& x, O& ... y) {qr(x); qr(y...);} n TP void qw(o x) { n if (x / 10) n qw(x / 10); n putchar(x % 10 + 0 ); n } n TP void pr1(o x) { n if (x < 0) n x = -x, putchar( - ); n qw(x); n putchar( ); n } n template void pr1(o x, O ... y) { pr1(x); pr1(y...);} n TP void pr2(o x) { n if (x < 0) n x = -x, putchar( - ); n qw(x); n putchar( n ); n } n template void pr2(o x, O ... y) { pr2(x); pr2(y...);} n n // math n ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); } n ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } n ll power(ll a, ll b = mod - 2, ll p = mod) { n ll c = 1; n while (b) { n if (b & 1) c = c * a % p; n b /= 2; n a = a * a % p; n } n return c; n } n ll exgcd(ll a,ll b,ll &x,ll &y) { n if(!a) {x=0; y=1; return b;} n ll d=exgcd(b%a,a,y,x); x -= b/a*y; n return d; n } n ll INV(ll n,ll p=mod) {ll x,y; exgcd(n,p,x,y); return (x%p+p)%p;} n n TP void cmax(o& x, o y) { n if (x < y) n x = y; n } n TP void cmin(o& x, o y) { n if (x > y) n x = y; n } n TPP void ad(t1& x, t2 y) { n x += y; n if (x >= mod) n x -= mod; n } n TPP void dl(t1& x, t2 y) { n x -= y; n if (x < 0) n x += mod; n } n n int n, m, X[N], Y[N]; n V e[N], g[N], E, P; n bool v[N]; n #define DEBUG n n void dfs(int x) { n int i, y; n while(SZ(g[x])) { n i = g[x].back(); g[x].pop_back(); n if(v[i]) continue; n y = x ^ X[i] ^ Y[i]; n v[i] = 1; dfs(y); n } n P.pb(x); n } n n void check(int s, int w = 0) { n FOR(i, n) g[i] = e[i]; n FOR(i, m) v[i] = 0; n int cnt = 0; n FOR(i, n) if(i ^ s) cnt += SZ(e[i]) & 1; n if(cnt > 1) return ; n P.clear(); dfs(s); n if(SZ(P) + SZ(E) - 1 - (w > 0) != m) return ; n P.pb(-1); n for(int i: E) if(i ^ w) P.pb(X[i] ^ Y[i] ^ s), P.pb(s); n pr2(SZ(P)); n for(int i: P) pr1(i); n exit(0); n } n n void solve() { n qr(n, m); n FOR(i, m) qr(X[i], Y[i]); n FOR(s, n) { n FOR(i, n) e[i].clear(); n P.clear(); E.clear(); n FOR(i, m) { n int x = X[i], y = Y[i]; n if(x == s || y == s) continue; n e[x].pb(i); e[y].pb(i); n } n FOR(i, m) { n int x = X[i], y = Y[i]; n if(x == s || y == s) { n int v = s ^ x ^ y; n if(SZ(e[v]) & 1) e[s].pb(i), e[v].pb(i); n else E.pb(i); n } n } n check(s); n for(int i: E) { n e[X[i]].pb(i); e[Y[i]].pb(i); n check(s, i); n e[X[i]].pop_back(); e[Y[i]].pop_back(); n } n } n puts( 0 ); n } n n int main() { n int T = 1; n // qr(T); n while (T--) n solve(); n return 0; n } n n n "} +{"func_code_string": "#include n using namespace std; n bool found = false; n long long b, A[10000], n, orig_a; n void bfs(long long a, long long k) { n if (found) return; n if (a > b) return; n if (a == b) { n found = true; n n = k; n a = orig_a; n cout << YES << endl; n cout << n + 1 << endl; n cout << a; n for (int i = 0; i < n; i++) { n if (A[i] == 1) { n a = a * 10 + 1; n cout << << a; n } else if (A[i] == 2) { n a = a * 2; n cout << << a; n } n } n cout << endl; n return; n } n A[k] = 2; n bfs(a * 2, k + 1); n A[k] = 1; n bfs((a * 10) + 1, k + 1); n } n int main() { n long long a, c, d, i, j, m; n string s; n cin >> a >> b; n orig_a = a; n bfs(a, 0); n if (!found) cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n class Compare { n public: n bool operator()(pair a, pair b) { n return (a.first + a.second) > (b.first + b.second); n } n }; n int main() { n long long test, x, n, m, k, w, d, f, y; n priority_queue, n vector >, Compare> n pqw; n priority_queue, n vector >, Compare> n pqd; n priority_queue, n vector >, Compare> n pqf; n scanf( %lld%lld%lld%lld%lld%lld%lld , &x, &n, &m, &k, &w, &d, &f); n for (long long i = 0; i < n; i++) { n pqw.push(make_pair(0, w)); n } n for (long long i = 0; i < m; i++) { n pqd.push(make_pair(0, d)); n } n for (long long i = 0; i < k; i++) { n pqf.push(make_pair(0, f)); n } n long long ans = 0; n for (long long i = 0; i < x; i++) { n pair cur = pqw.top(); n pqw.pop(); n pqw.push(make_pair(cur.first + cur.second, cur.second)); n pair curd = pqd.top(); n pqd.pop(); n curd.first = max(cur.first + cur.second, curd.first) + d; n pqd.push(curd); n pair curf = pqf.top(); n pqf.pop(); n curf.first = max(curd.first, curf.first) + f; n pqf.push(curf); n ans = curf.first; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int P = 1e9 + 7; n vector b[200005]; n int L[200005], R[200005], u[200005], v[200005], opt[200005], size[200005]; n int m, n, ql, qr, upd, tot, now, ans, i, x; n struct data { n int cnt, sum; n data() { cnt = 1; } n void multi(int x) { n cnt = 1ll * cnt * x % P; n sum = 1ll * sum * x % P; n } n int renew(int x) { n cnt = 1; n sum = x; n return 0; n } n } a[200005 << 2]; n void DFS(int x, int Fa) { n L[x] = ++tot; n for (int i = 0, y; i < b[x].size(); i++) n if ((y = b[x][i]) != Fa) DFS(y, x); n R[x] = tot; n } n int INV(int a) { n int ret = 1, b = P - 2; n for (; b; b >>= 1, a = 1ll * a * a % P) n if (b & 1) ret = 1ll * ret * a % P; n return ret; n } n inline void down(int x) { n if (a[x].cnt == 1) return; n a[x << 1].multi(a[x].cnt); n a[x << 1 | 1].multi(a[x].cnt); n a[x].cnt = 1; n } n inline void up(int x) { a[x].sum = (a[x << 1].sum + a[x << 1 | 1].sum) % P; } n void Multi(int x, int l, int r) { n if (ql <= l && r <= qr) { n a[x].multi(now); n return; n } n int mid = (l + r) >> 1; n down(x); n if (ql <= mid) Multi(x << 1, l, mid); n if (qr > mid) Multi(x << 1 | 1, mid + 1, r); n up(x); n } n int Update(int x, int l, int r, int pos) { n if (l == r) return (!upd) ? a[x].sum : a[x].renew(now); n int mid = (l + r) >> 1; n down(x); n int ret = (pos <= mid) ? Update(x << 1, l, mid, pos) n : Update(x << 1 | 1, mid + 1, r, pos); n return up(x), ret; n } n void Query(int x, int l, int r) { n if (ql <= l && r <= qr) { n ans = (ans + a[x].sum) % P; n return; n } n int mid = (l + r) >> 1; n down(x); n if (ql <= mid) Query(x << 1, l, mid); n if (qr > mid) Query(x << 1 | 1, mid + 1, r); n } n int main() { n scanf( %d%d , &v[1], &m); n n = 1; n for (i = 1; i <= m; i++) { n scanf( %d%d , &opt[i], &u[i]); n if (opt[i] == 1) scanf( %d , &v[++n]), b[u[i]].push_back(n); n } n DFS(1, 0); n size[n = 1] = 1; n upd = 1; n now = v[1]; n Update(1, 1, tot, L[1]); n for (i = 1; i <= m; i++) n if (opt[i] == 1) { n x = u[i]; n size[++n] = 1; n ql = L[x]; n qr = R[x]; n now = 1ll * (size[x] + 1) * INV(size[x]) % P; n ++size[x]; n Multi(1, 1, tot); n upd = 0; n now = Update(1, 1, tot, L[x]); n now = 1ll * now * INV(v[x]) % P; n now = 1ll * now * v[n] % P; n upd = 1; n Update(1, 1, tot, L[n]); n } else { n x = u[i]; n ans = 0; n ql = L[x]; n qr = R[x]; n Query(1, 1, tot); n upd = 0; n now = Update(1, 1, tot, L[x]); n now = 1ll * now * INV(1ll * v[x] * size[x] % P) % P; n ans = 1ll * ans * INV(now) % P; n printf( %d n , ans); n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000007; n const long double PI = 3.141592653589793; n const long long maxn = 100005; n long long x, y, z, n, k; n void _print(long long t) { cerr << t; } n void _print(string t) { cerr << t; } n void _print(char t) { cerr << t; } n void _print(long double t) { cerr << t; } n void _print(double t) { cerr << t; } n template n void _print(pair p); n template n void _print(vector v); n template n void _print(set v); n template n void _print(map v); n template n void _print(multiset v); n template n void _print(pair p) { n cerr << { ; n _print(p.first); n cerr << , ; n _print(p.second); n cerr << } ; n } n template n void _print(vector v) { n cerr << [ ; n for (T i : v) { n _print(i); n cerr << ; n } n cerr << ] ; n } n template n void _print(set v) { n cerr << [ ; n for (T i : v) { n _print(i); n cerr << ; n } n cerr << ] ; n } n template n void _print(multiset v) { n cerr << [ ; n for (T i : v) { n _print(i); n cerr << ; n } n cerr << ] ; n } n template n void _print(map v) { n cerr << [ ; n for (auto i : v) { n _print(i); n cerr << ; n } n cerr << ] ; n } n void solve() { n string s, t; n cin >> s >> t; n long long f[26]; n memset(f, 0, sizeof(f)); n long long n = (long long)s.size(), m = (long long)t.size(); n vector> v(26); n for (long long i = 0; i <= n - 1; i++) { n f[s[i] - a ]++; n v[s[i] - a ].push_back(i); n } n for (long long i = 0; i <= m - 1; i++) { n if (f[t[i] - a ] == 0) { n cout << -1 << n ; n return; n } n } n long long ans = 1, last = -1; n for (long long i = 0; i <= m - 1; i++) { n long long prev = last; n long long val = t[i] - a ; n long long pos = n lower_bound(v[val].begin(), v[val].end(), last + 1) - v[val].begin(); n if (pos == v[val].size()) { n ans++; n last = v[val][0]; n } else { n last = v[val][pos]; n } n } n cout << ans << n ; n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cout << setprecision(15) << fixed; n long long t; n t = 1; n cin >> t; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n const double eps = 1e-8; n const long long INF = 0x3f3f3f3f; n const int mod = 20000311; n const int maxn = 1e5 + 5; n const int N = 1005; n using namespace std; n int a[maxn] = {0}; n int dp[maxn][305] = {0}; n int n; n int dfs(int p, int k) { n if (p > n) return 0; n if (dp[p][k] != -1) return dp[p][k]; n int num = p + a[p] + k; n return dp[p][k] = dfs(num, k) + 1; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int j = 1; j <= 300; j++) { n for (int i = n; i >= 1; i--) { n int num = i + a[i] + j; n if (num > n) n dp[i][j] = 1; n else n dp[i][j] = dp[num][j] + 1; n } n } n int q; n scanf( %d , &q); n while (q--) { n int p, k; n scanf( %d %d , &p, &k); n if (k >= 300) { n int res = 0; n while (p <= n) { n p = a[p] + k + p; n res++; n } n cout << res << n ; n } else n cout << dp[p][k] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string Max(int n, int s) { n string str = ; n while (s >= 9 && n > 0) { n str += 9 ; n s -= 9; n n--; n } n if (n == 0 && s > 0) return -1 ; n if (n > 0) { n str += char(s + 48); n for (int i = 1; i < n; i++) str += 0 ; n } n return str; n } n int main() { n int n, s; n string str = ; n cin >> n >> s; n if (n * 9 < s) n cout << -1 -1 ; n else if (n > 1 and s == 0) n cout << -1 -1 ; n else if (s == 1) { n cout << 1; n for (int i = 1; i < n; i++) cout << 0; n cout << 1 ; n for (int i = 1; i < n; i++) cout << 0; n } else { n for (int i = Max(n, s).size() - 1; i >= 0; i--) str += Max(n, s)[i]; n if (str[0] == 0 and str.size() > 1) { n str[0] = 1 ; n for (int i = 1; i < str.size(); i++) n if (str[i] > 0 ) { n str[i] = char(int(str[i]) - 1); n break; n } n } n cout << str << << Max(n, s); n } n } n "} +{"func_code_string": "#include n using namespace std; n inline int max3(int a, int b, int c) { return max(a, max(b, c)); } n inline int min3(int a, int b, int c) { return min(a, min(b, c)); } n const int INF = 1e9; n const long long LINF = 1e18; n const double EPS = 1e-6; n const double PI = acos(-1.0); n const int maxn = 150; n int n, m, k; n int a[maxn][maxn][maxn]; n int ans; n int main() { n scanf( %d %d %d n , &n, &m, &k); n char b[maxn]; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n gets(b); n for (int p = 0; p < k; ++p) a[i][j][p] = b[p] == 1 ; n } n if (i < n - 1) gets(b); n } n ans = 0; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n for (int p = 0; p < k; ++p) { n if (!a[i][j][p]) continue; n if ((p > 0 && p < k - 1 && a[i][j][p - 1] && a[i][j][p + 1]) || n (p > 0 && j < m - 1 && a[i][j][p - 1] && a[i][j + 1][p] && n !a[i][j + 1][p - 1]) || n (p > 0 && i < n - 1 && a[i][j][p - 1] && a[i + 1][j][p] && n !a[i + 1][j][p - 1]) || n (j > 0 && j < m - 1 && a[i][j - 1][p] && a[i][j + 1][p]) || n (j > 0 && p < k - 1 && a[i][j - 1][p] && a[i][j][p + 1] && n !a[i][j - 1][p + 1]) || n (j > 0 && i < n - 1 && a[i][j - 1][p] && a[i + 1][j][p] && n !a[i + 1][j - 1][p]) || n (i > 0 && i < n - 1 && a[i - 1][j][p] && a[i + 1][j][p]) || n (i > 0 && j < m - 1 && a[i - 1][j][p] && a[i][j + 1][p] && n !a[i - 1][j + 1][p]) || n (i > 0 && p < k - 1 && a[i - 1][j][p] && a[i][j][p + 1] && n !a[i - 1][j][p + 1])) n ++ans; n } n } n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 1e9 + 7; n const int MAX_N = 1002; n int dp_end[MAX_N][MAX_N]; n int dp_not[MAX_N][MAX_N]; n int main() { n int n; n cin >> n; n for (int i = 1; i <= n; i++) { n dp_end[0][i] = (i + 1) / 2; n dp_not[0][i] = i / 2; n } n for (int i = 1; i <= n; i++) { n for (int j = i; j <= n; j++) { n dp_end[i][j] = 1 + dp_not[i - 1][j] + dp_end[i][j - 1]; n if (i - 1 >= j) { n dp_end[i][j] = n max(dp_end[i][j], 1 + dp_not[i][j - 1] + dp_end[i - 1][j]); n } n dp_end[i][j] %= M; n dp_not[i][j] = dp_end[i][j - 1] + dp_end[i - 1][j]; n dp_not[i][j] %= M; n } n } n cout << dp_end[n][n] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void c_p_c() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n } n int32_t main() { n c_p_c(); n long long n; n string s[222222]; n map check; n cin >> n; n for (long long i = 1; i <= n; i++) { n cin >> ws; n getline(cin, s[i]); n } n for (long long i = n; i >= 1; i--) { n if (!check[s[i]]) { n check[s[i]] = 1; n cout << s[i] << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using std::max; n using std::min; n const int inf = 0x3f3f3f3f, Inf = 0x7fffffff; n const long long INF = 0x3f3f3f3f3f3f3f3f; n __inline__ __attribute__((always_inline)) unsigned int rnd() { n static unsigned int seed = 416; n return seed ^= seed >> 5, seed ^= seed << 17, seed ^= seed >> 13; n } n template n _Tp gcd(const _Tp &a, const _Tp &b) { n return (!b) ? a : gcd(b, a % b); n } n template n __inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) { n return a >= 0 ? a : -a; n } n template n __inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) { n (a < b) && (a = b); n } n template n __inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) { n (b < a) && (a = b); n } n template n __inline__ __attribute__((always_inline)) void read(_Tp &x) { n char ch(getchar()); n bool f(false); n while (!isdigit(ch)) f |= ch == 45, ch = getchar(); n x = ch & 15, ch = getchar(); n while (isdigit(ch)) x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar(); n f && (x = -x); n } n template n __inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) { n read(t); n read(args...); n } n template n __inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b, n const Args &...args) { n return a < b ? min(a, args...) : min(b, args...); n } n template n __inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b, n const Args &...args) { n return a < b ? max(b, args...) : max(a, args...); n } n __inline__ __attribute__((always_inline)) int read_str(char *s) { n char ch(getchar()); n while (ch == || ch == r || ch == n ) ch = getchar(); n char *tar = s; n *tar = ch, ch = getchar(); n while (ch != && ch != r && ch != n && ch != EOF) n *(++tar) = ch, ch = getchar(); n return tar - s + 1; n } n const int N = 100005; n const int MAXN = 10000005; n bool pr[MAXN]; n int _p[MAXN >> 3], _pos; n int md[MAXN]; n void sieve() { n for (int i = 2; i < MAXN; ++i) { n if (!pr[i]) { n _p[++_pos] = i; n md[i] = i; n } n for (int j = 1; j <= _pos && i * _p[j] < MAXN; ++j) { n pr[i * _p[j]] = true; n md[i * _p[j]] = _p[j]; n if (!(i % _p[j])) break; n } n } n } n std::vector p[N], d[N]; n int c[MAXN], cnt[1 << 8], mul[1 << 8]; n int calc(int id) { n int siz = ((int)p[id].size()), ans = 0; n for (int i = 0; i < siz; ++i) mul[1 << i] = p[id][i]; n for (int i = 1; i < 1 << siz; ++i) { n cnt[i] = cnt[i >> 1] + (i & 1); n mul[i] = mul[i ^ ((i) & (-(i)))] * mul[((i) & (-(i)))]; n if (cnt[i] & 1) n ans += c[mul[i]]; n else n ans -= c[mul[i]]; n } n return ans; n } n int a[N]; n int _val[11], _cnt[11], pos, cur_id; n void dfs(int dep, int val) { n if (dep == pos + 1) { n d[cur_id].push_back(val); n return; n } n for (int i = 0; i <= _cnt[dep]; ++i) { n dfs(dep + 1, val); n if (i < _cnt[dep]) val *= _val[dep]; n } n } n bool ban[N], vis[N]; n int deg[N]; n int f(int mid) { n while (ban[mid]) --mid; n if (!mid) return false; n int qwq = 0; n for (int i = 1; i <= mid; ++i) n if (!ban[i]) { n ++qwq; n for (auto it : d[i]) ++c[it]; n } n int ans = 0; n for (int i = 1; i <= mid; ++i) n if (!ban[i] && calc(i) != qwq) ++ans; n for (int i = 1; i <= mid; ++i) n if (!ban[i]) n for (auto it : d[i]) --c[it]; n return ans; n } n std::vector getnodes(int mid) { n while (ban[mid]) --mid; n std::vector nd; n int qwq = 0; n for (int i = 1; i <= mid; ++i) n if (!ban[i]) { n ++qwq; n for (auto it : d[i]) ++c[it]; n } n for (int i = 1; i <= mid; ++i) n if (!ban[i] && calc(i) != qwq) nd.push_back(i); n for (int i = 1; i <= mid; ++i) n if (!ban[i]) n for (auto it : d[i]) --c[it]; n return nd; n } n int main() { n mul[0] = 1; n sieve(); n int n, k; n read(n, k); n for (int i = 1; i <= n; ++i) { n read(a[i]); n ++c[a[i]]; n int cur = a[i], last = 0; n pos = 0; n while (cur > 1) { n if (md[cur] != last) n p[i].push_back(md[cur]), _val[++pos] = md[cur], _cnt[pos] = 1; n else n ++_cnt[pos]; n last = md[cur]; n cur /= last; n } n cur_id = i; n dfs(1, 1); n } n for (int j = 1; j <= _pos; ++j) n for (int i = (MAXN - 1) / _p[j]; i >= 1; --i) c[i] += c[i * _p[j]]; n std::vector nd; n for (int i = 1; i <= n; ++i) { n if ((deg[i] = calc(i)) <= n - 2) { n nd.push_back(i); n for (int j = 1; j <= n && ((int)nd.size()) < 3; ++j) n if (i != j && gcd(a[i], a[j]) == 1) nd.push_back(j); n break; n } n } n if (nd.empty()) { n std::vector clique, rest; n for (int i = 1; i <= n; ++i) n if (deg[i] == n) n clique.push_back(i); n else n rest.push_back(i); n if (((int)clique.size()) > k) clique.resize(k); n for (int i = 1; i <= n && ((int)clique.size()) < k; ++i) { n if (!vis[i] && deg[i] == n - 1) { n clique.push_back(i); n for (auto it : rest) n if (gcd(a[it], a[i]) == 1) vis[it] = true; n } n } n for (auto it : clique) printf( %d , it); n printf( n ); n return 0; n } n if (k == 3) { n for (auto it : nd) printf( %d , it); n printf( n ); n return 0; n } n for (auto it : nd) ban[it] = true; n for (auto id : nd) n for (auto it : d[id]) --c[it]; n std::vector clique; n for (int i = 1; i <= n; ++i) n if (!ban[i] && ((deg[i] = calc(i)) == n - 3)) clique.push_back(i); n if (((int)clique.size()) >= k) { n clique.resize(k); n for (auto it : clique) printf( %d , it); n printf( n ); n return 0; n } n memset(c, 0, sizeof(c)); n int l = 1, r = n; n while (l < r) { n int mid = (l + r) >> 1; n if (f(mid) + 3 >= k) n r = mid; n else n l = mid + 1; n } n std::vector v1 = getnodes(l - 1); n std::vector v2 = getnodes(l); n std::sort(v1.begin(), v1.end()); n std::vector qwq; n for (auto it : v2) { n auto _ = std::lower_bound(v1.begin(), v1.end(), it); n if (_ == v1.end() || *_ != it) qwq.push_back(it); n } n std::sort(qwq.begin(), qwq.end()); n if (((int)v1.size()) + 3 + 1 == k && ((int)qwq.size()) != 1) n v1.push_back(nd[0]), v1.push_back(nd[1]); n else n v1.push_back(nd[0]), v1.push_back(nd[1]), v1.push_back(nd[2]); n while (((int)v1.size()) < k) { n v1.push_back(qwq.back()); n qwq.pop_back(); n } n for (auto it : v1) printf( %d , it); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void fact(int n) { n const int N = 1e5; n vector arr(N, 0); n int q = 2; n arr[0] = 1; n int len = 1; n int x = 0; n int carry = 0; n while (q <= n) { n x = 0; n carry = 0; n while (x < len) { n arr[x] = arr[x] * q + carry; n carry = arr[x] / 10; n arr[x] = arr[x] % 10; n x++; n } n while (carry) { n arr[len] = carry % 10; n carry = carry / 10; n len++; n } n q++; n } n len--; n for (int i = len; i >= 0; i--) { n cout << arr[i]; n } n return; n } n long long int binary_exp(long long int x, long long int n) { n if (n == 0) { n return 1; n } else if (n == 1) { n return x % 1000000007; n } else { n long long int temp = binary_exp(x, n / 2); n temp = (temp * temp) % 1000000007; n if (n % 2 == 0) { n return temp; n } else { n return ((x % 1000000007) * temp) % 1000000007; n } n } n } n int main() { n int k, r; n cin >> k >> r; n int i = 1; n while (i * k % 10 != r and i * k % 10 != 0) { n i++; n } n cout << i; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool vis[100006]; n int main() { n int n, k; n while (cin >> n >> k) { n memset(vis, false, sizeof(vis)); n int st = 1, ed = 1 + k; n int cnt = 0; n while (cnt < k && st <= ed) { n if (st != ed) n vis[st] = vis[ed] = true, cout << st << << ed << ; n else n vis[st] = true, cout << st << ; n st++, ed--; n cnt++; n } n for (int i = 1; i <= n; i++) { n if (!vis[i]) cout << i << ; n } n puts( ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 500023; n bool vis[N]; n vector adj[N]; n void solve() { n long long int n, m; n cin >> n >> m; n map cntA; n map cntB; n map cntC; n map cntD; n map cntE; n for (long long int i = 0; i < n; i++) { n string s; n cin >> s; n for (int i = 0; i < s.length(); i++) { n if (s[i] == A ) n cntA[i]++; n else if (s[i] == B ) n cntB[i]++; n else if (s[i] == C ) n cntC[i]++; n else if (s[i] == D ) n cntD[i]++; n else if (s[i] == E ) n cntE[i]++; n } n } n long long int ans = 0; n for (int i = 0; i < m; i++) { n long long int c; n cin >> c; n long long int maxi = 0; n maxi = max(max(cntA[i], cntB[i]), cntC[i]); n maxi = max(max(maxi, cntD[i]), cntE[i]); n long long int temp = maxi * c; n ans += temp; n } n cout << ans; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int T = 1; n int t = 0; n while (t++ < T) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, x; n int cnt[100], b[105][105], sol[105][105], c[105][105], a[105][105]; n inline void Mult_Mat(int a[][105], int b[][105]) { n int i, j, k, s; n for (i = 0; i < x; ++i) n for (j = 0; j < x; ++j) { n s = 0; n for (k = 0; k < x; ++k) n s = (1LL * s + 1LL * a[i][k] * b[k][j]) % 1000000007; n c[i][j] = s; n } n for (i = 0; i < x; ++i) n for (j = 0; j < x; ++j) a[i][j] = c[i][j]; n } n inline void Pow_Log(int a[][105], int p) { n int i, j; n for (i = 0; i < x; ++i) sol[i][i] = 1; n while (p) { n if (p & 1) { n --p; n Mult_Mat(sol, a); n } n p >>= 1; n Mult_Mat(a, a); n } n for (i = 0; i < x; ++i) n for (j = 0; j < x; ++j) a[i][j] = sol[i][j]; n } n int main() { n int i, j, B, k, xx; n cin.sync_with_stdio(0); n cin >> n >> B >> k >> x; n for (i = 1; i <= n; ++i) { n cin >> xx; n ++cnt[xx]; n } n for (i = 0; i < x; ++i) n for (j = 0; j < 10; ++j) n b[i][(i * 10 + j) % x] = (b[i][(i * 10 + j) % x] + cnt[j]) % 1000000007; n Pow_Log(b, B); n a[1][0] = 1; n Mult_Mat(a, b); n cout << a[1][k] << n ; n return 0; n } n "} +{"func_code_string": "#include n #define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL); n #define int long long n #define ull unsigned long long n #define FOR(i,a,b) for(int i=a;i n #define deb1(a) cout<> test; n test = 1; n while (test--) { n int n, m; n cin >> n >> m; n string s, t; n cin >> s >> t; n int a[m], b[m]; n j = 0; n for (int i = 0; i < n; ++i) { n if (s[i] == t[j]) { n a[j] = i; n j++; n } n } n j = m - 1; n for (int i = n - 1; i >= 0 ; i--) { n if (s[i] == t[j]) { n b[j] = i; n j--; n } n } n int ans = 0; n for (int i = 0; i < m - 1; ++i) { n ans = max(ans, b[i + 1] - a[i]); n } n cout << ans << endl; n } n n }"} +{"func_code_string": "#include n using namespace std; n const int N = 110; n const int mo = 1e9 + 7; n int n, k, a[N], num[3], nn, f = 0; n long long ans, now[N][N], dp[N][N], aa[N]; n long long po(long long a, long long b) { n if (b == 0) return 1; n if (b == 1) return a; n long long c = po(a, b / 2); n if (b & 1) n return c * c % mo * a % mo; n else n return c * c % mo; n } n long long tmp[N][N]; n void multi(long long a[][N], long long b[][N], int n) { n memset(tmp, 0, sizeof tmp); n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) n for (int k = 0; k < n; k++) n tmp[i][j] = (tmp[i][j] + a[i][k] * b[k][j] % mo) % mo; n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) a[i][j] = tmp[i][j]; n } n long long res[N][N]; n void Pow(long long a[][N], long long n) { n memset(res, 0, sizeof res); n for (int i = 0; i < num[0] + 1; i++) res[i][i] = 1; n while (n) { n if (n & 1) multi(res, a, num[0] + 1); n multi(a, a, num[0] + 1); n n >>= 1; n } n } n int main() { n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]), num[a[i]]++; n if (num[0] < num[1]) { n for (int i = 1; i <= num[0]; i++) n if (!a[i]) nn++; n } else { n swap(num[0], num[1]); n for (int i = n; i >= n - num[0] + 1; i--) n if (a[i]) nn++; n } n for (int j = 0; j <= num[0]; j++) { n now[j][j] += j * (num[0] - j); n now[j][j] += (num[0] - j) * (num[1] - num[0] + j); n now[j][j] += num[0] * (num[0] - 1) / 2ll; n now[j][j] += num[1] * (num[1] - 1) / 2ll; n if (j + 1 <= num[0]) now[j][j + 1] = (j + 1) * (num[1] - (num[0] - j - 1)); n if (j) now[j][j - 1] = (num[0] - j + 1) * (num[0] - j + 1); n } n Pow(now, k); n for (int i = 0; i <= num[0]; i++) ans = (ans + res[i][nn]) % mo; n printf( %lld n , res[num[0]][nn] * po(ans, mo - 2) % mo); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MX = 1000000000; n int n, m, x, i, j, a[5050], f[5050]; n int main() { n scanf( %d%d , &n, &m); n for (i = 3; i <= n; i++) f[i] = f[i - 1] + (i - 1) / 2; n if (f[n] < m) { n puts( -1 ); n return 0; n } n for (i = 3; i <= n; i++) n if (f[i] > m) break; n m -= f[--i]; n for (j = 1; j <= i; j++) a[j] = j; n if (m > 0) { n for (j = 1; j < i; j++) { n x = (i + j - 1) / 2 - j + 1; n if (x == m) { n a[i + 1] = i + j; n break; n } n } n if (j >= i) { n puts( -1~ ); n return 0; n } n ++i; n } n x = a[i] + 1; n for (j = 2; j <= i; j++) n if (a[j] != a[j - 1] + 1) { n x = a[j - 1] + 1; n break; n } n for (++i; i <= n; ++i) { n a[i] = a[i - 1] + x; n if (a[i] > MX) break; n } n if (i <= n) { n puts( -1# ); n return 0; n } n for (i = 1; i <= n; i++) printf( %d , a[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-9; n const int INF = (int)1e9 + 7; n const long long linf = (long long)1e16 + 7; n struct pnt { n double x, y; n pnt(double x, double y) : y(y), x(x) {} n pnt() = default; n }; n int cmp(double a, double b) { n if (abs(a - b) < eps) return 0; n if (a > b) return 1; n return -1; n } n int main() { n int n; n cin >> n; n int ans = 0; n vector a(n); n for (int i = 0; i < n; ++i) cin >> a[i]; n vector cnt0(n + 1); n vector cnt1(n + 1); n for (int i = 0; i < n; ++i) { n if (a[i] == 0) cnt0[i]++; n if (i) cnt0[i] += cnt0[i - 1]; n } n for (int i = n - 1; i >= 0; --i) { n if (a[i] == 1) cnt1[i]++; n if (i != n - 1) cnt1[i] += cnt1[i + 1]; n } n for (int i = 0; i < n; ++i) { n ans = max(ans, cnt0[i] + cnt1[i + 1]); n ans = max(ans, cnt1[i]); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n n using namespace std; n n #define pf printf n #define PF(a) printf( %d n ,(a)) n #define PF2(a,b) printf( %d %d n ,(a), (b)) n #define PF3(a,b,c) printf( %d %d %d n ,(a), (b), (c)) n #define PFL(a) printf( %lld n ,(a)) n #define PFL2(a,b) printf( %lld %lld n ,(a), (b)) n #define PFL3(a,b,c) printf( %lld %lld %lld n ,(a), (b), (c)) n #define get(a) cin>>a n #define sf scanf n #define SF(a) scanf( %d ,&a) n #define SF2(a,b) scanf( %d %d ,&a, &b) n #define SF3(a,b,c) scanf( %d %d %d ,&a, &b, &c) n #define SFL(a) scanf( %lld ,&a) n #define SFL2(a,b) scanf( %lld %lld ,&a, &b) n #define SFL3(a,b,c) scanf( %lld %lld %lld ,&a, &b, &c) n #define gl(a) getline(cin,(a)) n #define gc() getchar() n #define pb push_back n #define m_p make_pair n #define pc() printf( Case %d: ,tt++) n #define tc() cout<< Case < << x << endl; n #define SZ(a) (int)(a).size() n #define all(a) a.begin(),a.end() n #define FF first n #define SS second n #define MAX 2134567891 n #define MOD 1000000007 n #define MM 200005 n #define PI 2*acos(0.0) n #define cond(n,m) (xx>=0 && xx<(n) && yy>=0 && yy<(m)) n n #define mem(a) memset((a),0,sizeof (a)) n #define SET(a) memset((a),-1,sizeof (a)) n #define output freopen( output.txt , w ,stdout); n #define input freopen( input.txt , r ,stdin); n #define I_O ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0) n #define rep(a) for(int i=0;i<(a);i++) n #define FOR(a,b) for(int i=(a);i<(b);i++) n #define REP(a) for(int j=0;j<(a);j++) n #define rev(a) for(int i=(a);i>=0;i--) n #define fr(i,n) for(i=0;i PQ; n typedef pair < ll , ll > pi; n typedef pair < ll, pi > pii; n typedef vector < int > vi; n typedef vector < ll > vl; n typedef vector < string > vs; n n /* n //FUNCTION// n ll bigmod(ll a, ll b, ll c) n { n if(b==0)return 1%c;ll x=bigmod(a,b/2,c);x=(x*x)%c; n if(b%2==1)x=(x*a)%c;return x; n } n ll mod_inverse(ll a, ll mod){return bigmod(a,mod-2,mod);} n ll poww(ll a, ll b) n { n if(b==0)return 1;ll x=poww(a,b/2);x=x*x;if(b%2==1)x=(x*a);return x; n } n n n n ll LCM(ll a, ll b){ return a*b/ __gcd(a,b);} n n int pr = 100005; n vi primelist; n bool a[MM]; n void seive( ) n { n int i,j,k=sqrt(pr); n a[1]=1; n primelist.pb(2); n for(i=4;i<=pr;i+=2)a[i]=1; n for(i=3;i<=k;i+=2)if(!a[i])for(j=i*i;j<=pr;j+=2*i)a[j]=1; n for(i=3;i<=pr;i+=2)if(!a[i])primelist.pb(i); n } n int phi[MM]; n void calculatePhi() { n for (int i = 1; i < MM; i++) { n phi[i] = i; n } n for (int p = 2; p < M; p++) { n if (phi[p] == p) { // p is a prime n for (int k = p; k < M; k += p) { n phi[k] -= phi[k] / p; n } n } n } n } n n ll fact_divs( ll n, ll p) n { n ll cnt=0;while(p<=n){cnt += n/p;n /= p;}return cnt; n } n struct point{double x, y;}; n double area( point A, point B, point C){ n return 0.5*(A.x*(B.y-C.y) - A.y*(B.x-C.x) + B.x*C.y - C.x*B.y); n } n n int Set(int N,int pos){return N=N | (1<>t; n while(t--){ n int n; cin>>n; n int id = 0, mn = MAX; n for(int i=1; i<=n; i++){ n cin>>a[i]; n if(a[i] < mn){ n mn = a[i]; n id = i; n } n } n cout<=1; i--, cnt++){ n cout< n using namespace std; n int main() { n int n, i; n cin >> n; n string s; n map m; n for (i = 0; i < n; i++) { n cin >> s; n m[s[0]]++; n } n int ans = 0, f1, f2; n for (auto it = m.begin(); it != m.end(); it++) { n f1 = it->second / 2; n f2 = it->second - f1; n ans += f1 * (f1 - 1) / 2 + f2 * (f2 - 1) / 2; n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int Read() { n int x = 0; n char ch = getchar(); n while (!isdigit(ch)) ch = getchar(); n while (isdigit(ch)) x = (x << 3) + (x << 1) + ch - 0 , ch = getchar(); n return x; n } n void Write(int x) { n if (x < 0) putchar( - ), x = -x; n if (x == 0) putchar( 0 ); n int stk[55], tp = 0; n while (x) stk[++tp] = x % 10, x /= 10; n for (int i = tp; i; i--) putchar(stk[i] + 0 ); n } n int Add(int a, int b) { n return (a + b >= 998244353) ? a + b - 998244353 : a + b; n } n int Dec(int a, int b) { return (a - b < 0) ? a - b + 998244353 : a - b; } n int mul(int a, int b) { return 1ll * a * b % 998244353; } n unsigned int qpow(unsigned int a, int b) { n unsigned int res = 1; n for (; b; b >>= 1, a = mul(a, a)) n if (b & 1) res = mul(res, a); n return res; n } n namespace NTT { n int sz; n unsigned int w[2500005], w_mf[2500005]; n int mf(int x) { return (1ll * x << 32) / 998244353; } n void init(int n) { n for (sz = 2; sz < n; sz <<= 1) n ; n unsigned int pr = qpow(3, (998244353 - 1) / sz); n w[sz / 2] = 1; n w_mf[sz / 2] = mf(1); n for (int i = 1; i <= sz / 2; i++) n w[sz / 2 + i] = mul(w[sz / 2 + i - 1], pr), n w_mf[sz / 2 + i] = mf(w[sz / 2 + i]); n for (int i = sz / 2 - 1; i; i--) w[i] = w[i << 1], w_mf[i] = w_mf[i << 1]; n } n void ntt(vector& A, int L) { n for (int d = L >> 1; d; d >>= 1) n for (int i = 0; i < L; i += (d << 1)) n for (int j = 0; j < d; j++) { n unsigned int x = A[i + j] + A[i + d + j]; n if (x >= 998244353 * 2) x -= 998244353 * 2; n long long t = A[i + j] + 998244353 * 2 - A[i + d + j], n q = t * w_mf[d + j] >> 32, y = t * w[d + j] - q * 998244353; n A[i + j] = x; n A[i + d + j] = y; n } n for (int i = 0; i < L; i++) n if (A[i] >= 998244353) A[i] -= 998244353; n } n void intt(vector& A, int L) { n for (int d = 1; d < L; d <<= 1) n for (int i = 0; i < L; i += (d << 1)) n for (int j = 0; j < d; j++) { n unsigned int x = A[i + j]; n if (x >= 998244353 * 2) x -= 998244353 * 2; n long long t = A[i + d + j], q = t * w_mf[d + j] >> 32, n y = t * w[d + j] - q * 998244353; n A[i + j] = x + y, A[i + d + j] = x + 2 * 998244353 - y; n } n int k = __builtin_ctz(L); n reverse(A.begin() + 1, A.end()); n for (int i = 0; i < L; i++) { n long long m = -A[i] & (L - 1); n A[i] = (A[i] + m * 998244353) >> k; n if (A[i] >= 998244353) A[i] -= 998244353; n } n } n } // namespace NTT n struct poly { n vector a; n poly(int d = 0, int t = 0) { n a.resize(d + 1); n a[d] = t; n } n int deg() { return a.size() - 1; } n unsigned int& operator[](const int& b) { return a[b]; } n poly extend(int x) { n poly c = *this; n c.a.resize(x + 1); n return c; n } n void resize(int x) { a.resize(x); } n int size() { return a.size(); } n void Get(int n) { n a.resize(n + 1); n for (int i = 0; i <= n; i++) a[i] = Read(); n } n void Print(int n) { n for (int i = 0; i <= n; i++) Write(a[i]), putchar( ); n puts( ); n } n friend poly operator*(poly A, poly B) { n int n = A.deg() + B.deg() + 1, lim = 2; n for (; lim < n; lim <<= 1) n ; n NTT::init(lim); n A.resize(lim); n B.resize(lim); n NTT::ntt(A.a, lim); n NTT::ntt(B.a, lim); n for (int i = 0; i < lim; i++) A[i] = mul(A[i], B[i]); n NTT::intt(A.a, lim); n return A.extend(n - 1); n } n poly inv(poly A) { n int n = A.a.size(), lim = 2; n if (n == 1) return A[0] = qpow(A[0], 998244353 - 2), A; n poly B = A; n B.resize((n + 1) >> 1); n B = inv(B); n for (; lim < (n << 1); lim <<= 1) n ; n NTT::init(lim); n A.resize(lim), B.resize(lim), NTT::ntt(A.a, lim); n NTT::ntt(B.a, lim); n for (int i = 0; i < lim; i++) A[i] = mul(Dec(2, mul(A[i], B[i])), B[i]); n NTT::intt(A.a, lim); n return A.extend(n - 1); n } n poly getinv() { return inv(*this); } n poly getdao() { n poly A = *this, B; n int n = A.a.size(); n B.resize(n); n for (int i = 1; i < n; i++) B[i - 1] = mul(A[i], i); n B[n - 1] = 0; n return B; n } n poly getjf() { n poly A = *this, B; n int n = A.a.size(); n B.resize(n); n for (int i = 1; i < n; i++) B[i] = mul(A[i - 1], qpow(i, 998244353 - 2)); n B[0] = 0; n return B; n } n poly getln() { n poly A = *this; n return (A.getdao() * A.getinv()).extend(A.deg()).getjf(); n } n poly exp(poly A) { n int n = A.a.size(); n if (n == 1) return A[0] = 1, A; n poly B = A; n B.resize((n + 1) >> 1); n B = exp(B); n poly C = B.getln(); n C.resize(n); n for (int i = 0; i < n; i++) C[i] = Dec(A[i], C[i]); n ++C[0]; n return (B * C).extend(n - 1); n } n poly getexp() { return exp(*this); } n poly getmi(int k) { n poly A = *this; n int n = A.a.size(); n poly B = A.getln(); n for (int i = 0; i < n; i++) B[i] = mul(B[i], k); n return B.getexp(); n } n poly sqrt(poly A) { n int n = A.size(), lim = 2; n if (n == 1) return A[0] = 1, A; n poly B = A; n B.resize((n + 1) >> 1); n B = sqrt(B); n poly C = A.extend(n - 1), D = B.getinv(); n for (; lim < (n << 1); lim <<= 1) n ; n NTT::init(lim); n B.resize(lim), C.resize(lim), D.resize(lim), NTT::ntt(B.a, lim); n NTT::ntt(C.a, lim); n NTT::ntt(D.a, lim); n for (int i = 0; i < lim; i++) n B[i] = mul(Add(B[i], mul(C[i], D[i])), 499122177); n NTT::intt(B.a, lim); n return B.extend(n - 1); n } n poly getsqrt() { return sqrt(*this); } n }; n signed main() { n int n = Read(), k = Read(); n poly A, B; n A.resize(k * 3), B.resize(k * 3); n A[0] = 1; n A[1] = 6; n A[2] = 1; n A = A.getsqrt(); n B = A.getinv(); n ++A[1]; n ++A[0]; n for (int i = 0; i <= k; i++) A[i] = 1ll * A[i] * 499122177 % 998244353; n A = A.getmi(n + 1); n A = (A * B).extend(k * 3); n for (int i = 1; i <= k; i++) { n if (i <= n) n printf( %d , A[i]); n else n printf( %d , 0); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, d, a, b; n cin >> n >> d >> a >> b; n vector > v(n); n for (int i = 0; i < n; i++) { n long long x, y; n cin >> x >> y; n v[i].first = x * a + y * b; n v[i].second = i + 1; n } n sort(v.begin(), v.end()); n int ans = 0, sum = 0, pos = 0; n for (int i = 0; i < n; i++) { n if (sum + v[i].first <= d) { n sum += v[i].first; n ans++; n pos = i; n } n } n cout << ans << endl; n if (ans) n for (int i = 0; i <= pos; i++) cout << v[i].second << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n long long x, y, p, q; n cin >> t; n while (t--) { n cin >> x >> y >> p >> q; n long long l = 0, h = 1e9, ans = -1, mid, a, b; n while (l <= h) { n mid = (l + h) / 2; n a = p * mid; n b = q * mid; n if (b >= y && a >= x && b - a >= y - x) { n ans = b - y; n h = mid - 1; n } else n l = mid + 1; n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int mod = 1e9 + 7; n const long long int N = 2 * (1e5); n const long long int maxo = 1e14; n const long long int inf = 1e17; n int main(int argc, char const *argv[]) { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int x0, y0, ax, ay, bx, by; n cin >> x0 >> y0 >> ax >> ay >> bx >> by; n long long int xs, ys, t; n cin >> xs >> ys >> t; n vector > v; n v.push_back({x0, y0}); n for (long long int i = 0; i < 100; i++) { n if (v.back().first > (inf - bx) / (ax)) break; n if (v.back().second > (inf - by) / ay) break; n long long int x1 = v.back().first * ax + bx; n long long int y1 = v.back().second * ay + by; n v.push_back({x1, y1}); n } n long long int n = v.size(); n long long int ans = 0; n for (long long int l = 0; l < n; l++) { n for (long long int r = l; r < n; r++) { n long long int d1 = abs(xs - v[l].first) + abs(ys - v[l].second); n long long int d2 = abs(xs - v[r].first) + abs(v[r].second - ys); n long long int len = n abs(v[l].first - v[r].first) + abs(v[l].second - v[r].second); n if (d1 + len <= t) { n ans = max(ans, r - l + 1); n } n if (d2 + len <= t) { n ans = max(ans, r - l + 1); n } n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n void setIO(string name = ) { n ios_base::sync_with_stdio(0); n cin.tie(0); n if (int((name).size())) { n freopen((name + .in ).c_str(), r , stdin); n freopen((name + .out ).c_str(), w , stdout); n } n } n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } n long long mcm(long long a, long long b) { return (a * b) / gcd(a, b); } n bool prime(long long n, long long i) { n if (i > sqrt(n)) return true; n if (n % i == 0) n return false; n else n return prime(n, i + 1); n } n struct compii { n bool operator()(const pair &a, const pair &b) { n if (a.first == a.second) return a.second < b.second; n return a.first > b.first; n } n }; n bool comp(int a, int b) { return a > b; } n int dx[] = {1, 0, -1, 0}; n int dy[] = {0, 1, 0, -1}; n const int mod = 1e9 + 7; n const long long inf = 1e18; n bool check(string a, string b) { n if (a == rock and b == scissors ) return true; n if (a == paper and b == rock ) return true; n if (a == scissors and b == paper ) return true; n return false; n } n void solve() { n string first, m, second; n cin >> first >> m >> second; n if (check(first, m) and check(first, second)) n cout << F ; n else if (check(m, second) and check(m, first)) n cout << M ; n else if (check(second, first) and check(second, m)) n cout << S ; n else n cout << ? ; n } n int main() { n setIO( ); n int t = 1; n while (t-- > 0) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s = ; n for (int i = 1; i < 1000; i++) { n s += to_string(i); n } n int n; n cin >> n; n cout << s[n - 1]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int adj[8][2] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}, n {-1, -1}, {-1, 1}, {1, 1}, {1, -1}}; n const long long int LLINF = 9e18; n const int INF = 2e9; n const int MOD = 1e9 + 7; n const double EPS = 1e-10; n const double PI = acos(-1); n const int SIZE = 100011; n int N; n int cnt[SIZE]; n map Mp; n string ts[8] = { S , M , L , XL , XXL , XXXL }; n string s; n struct edge { n int v, f, c, u; n }; n vector E[SIZE]; n int st[SIZE], lvl[SIZE]; n void init() { n for (int i = 0; i < SIZE; i++) { n cnt[i] = 0; n E[i].clear(); n } n } n void addedge(int a, int b, int ca, int cb) { n edge A = {a, 0, ca, (int)E[a].size()}; n edge B = {b, 0, cb, (int)E[b].size()}; n E[a].push_back(B); n E[b].push_back(A); n } n bool BFS(int S, int T) { n memset(lvl, -1, sizeof(lvl)); n queue q; n q.push(S); n lvl[S] = 0; n while (!q.empty()) { n int indx = q.front(); n q.pop(); n for (unsigned int i = 0; i < E[indx].size(); i++) { n edge &t = E[indx][i]; n int idx = t.v; n if (lvl[idx] < 0 && t.c > t.f) { n lvl[idx] = lvl[indx] + 1; n q.push(idx); n } n } n } n return lvl[T] >= 0; n } n int DFS(int indx, int T, int flow) { n if (indx == T) return flow; n for (int &i = st[indx]; i < (int)E[indx].size(); i++) { n edge &t = E[indx][i]; n int idx = t.v; n if (lvl[idx] == lvl[indx] + 1 && t.c > t.f) { n int cur = min(flow, t.c - t.f); n int ret = DFS(idx, T, cur); n if (ret > 0) { n t.f += ret; n E[t.v][t.u].f -= ret; n return ret; n } n } n } n return 0; n } n int Dinic(int S, int T) { n int ret = 0; n while (BFS(S, T)) { n memset(st, 0, sizeof(st)); n while (int flow = DFS(S, T, INF)) { n ret += flow; n } n } n return ret; n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n int S = 0, T = SIZE - 1, a; n init(); n for (int i = 1; i <= 6; i++) { n cin >> a; n Mp[ts[i - 1]] = i; n addedge(i, T, 0, a); n } n cin >> N; n for (int i = 1; i <= N; i++) { n cin >> s; n s += , ; n string temp = ; n for (unsigned int j = 0; j < s.size(); j++) { n if (s[j] == , ) { n addedge(i + 6, Mp[temp], 0, 1); n temp.clear(); n cnt[i + 6]++; n } else n temp.push_back(s[j]); n } n addedge(S, i + 6, 0, 1); n } n int ans = Dinic(S, T); n if (ans != N) n cout << NO << endl; n else { n cout << YES << endl; n for (int i = 1; i <= N; i++) { n edge t1, t2; n if (cnt[i + 6] == 1) { n t1 = E[i + 6][0]; n cout << ts[t1.v - 1] << endl; n } else { n t1 = E[i + 6][0]; n t2 = E[i + 6][1]; n if (t1.f == 1) n cout << ts[t1.v - 1] << endl; n else if (t2.f == 1) n cout << ts[t2.v - 1] << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[101]; n int b[101]; n int storage[200001]; n int storage2[200001]; n int* value = storage + 100000; n int* prevalue = storage2 + 100000; n int n, k; n int main() { n scanf( %d%d , &n, &k); n int gtzero = 0, lezero = 0; n for (int i = 0; i < n; i++) scanf( %d , &a[i]); n for (int i = 0; i < n; i++) scanf( %d , &b[i]), b[i] *= k; n for (int i = 0; i < n; i++) { n b[i] = a[i] - b[i]; n if (b[i] > 0) n gtzero += b[i]; n else n lezero += b[i]; n } n for (int i = 0; i < sizeof(storage) / sizeof(int); i++) { n storage[i] = -19200000; n storage2[i] = -19200000; n } n value[0] = prevalue[0] = 0; n for (int i = 0; i < n; i++) { n int C = b[i]; n for (int j = -10000; j <= 10000; j++) { n value[j] = max(prevalue[j], prevalue[j - b[i]] + a[i]); n } n memcpy(storage2, storage, sizeof(storage)); n } n if (value[0] > 0) n printf( %d n , value[0]); n else n printf( -1 n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int num, a1, a2, b1, b2, c1, c2, d, a, b, c; n cin >> num >> a1 >> a2 >> b1 >> b2 >> c1 >> c2; n a = a2; n b = b2; n c = c2; n if (a + b + c == num) n cout << a << << b << << c; n else { n d = a + b + c - num; n if (c - d >= c1) { n c = c - d; n d = 0; n } else { n d = d - c + c1; n c = c1; n } n if (d > 0) n if (b - d >= b1) { n b = b - d; n d = 0; n } else { n d = d - b + b1; n b = b1; n } n if (d > 0) n if (a - d >= a1) { n a = a - d; n d = 0; n } else { n d = d - a + a1; n a = a1; n } n cout << a << << b << << c; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 500005; n const int maxx = 1000005; n int n, x, y, q, l, r; n int a[N]; n struct Tree { n int ans, m, tag; n } tr[maxx * 6]; n void pushdown(int rt) { n int lson = rt << 1; n int rson = rt << 1 | 1; n tr[lson].m += tr[rt].tag; n tr[rson].m += tr[rt].tag; n tr[lson].tag += tr[rt].tag; n tr[rson].tag += tr[rt].tag; n tr[rt].tag = 0; n } n void updata(int rt) { n int lson = rt << 1; n int rson = rt << 1 | 1; n if (tr[lson].m == tr[rson].m) { n tr[rt].m = tr[lson].m; n tr[rt].ans = tr[lson].ans + tr[rson].ans; n } else if (tr[lson].m < tr[rson].m) { n tr[rt].m = tr[lson].m; n tr[rt].ans = tr[lson].ans; n } else { n tr[rt].m = tr[rson].m; n tr[rt].ans = tr[rson].ans; n } n } n void change(int rt, int l, int r, int cl, int cr, int C) { n if (cl <= l && r <= cr) { n tr[rt].m += C; n tr[rt].tag += C; n return; n } n pushdown(rt); n int mid = (l + r) >> 1; n if (cl <= mid) change(rt << 1, l, mid, cl, cr, C); n if (cr > mid) change(rt << 1 | 1, mid + 1, r, cl, cr, C); n updata(rt); n } n void change2(int rt, int l, int r, int x, int C) { n if (l == r) { n tr[rt].ans += C; n return; n } n pushdown(rt); n int mid = (l + r) >> 1; n if (x <= mid) change2(rt << 1, l, mid, x, C); n if (x > mid) change2(rt << 1 | 1, mid + 1, r, x, C); n updata(rt); n } n int query(int rt, int l, int r, int ql, int qr) { n if (ql <= l && r <= qr) { n if (tr[rt].m == 1) return tr[rt].ans; n return 0; n } n pushdown(rt); n int mid = (l + r) >> 1, summ = 0; n if (ql <= mid) summ += query(rt << 1, l, mid, ql, qr); n if (qr > mid) summ += query(rt << 1 | 1, mid + 1, r, ql, qr); n updata(rt); n return summ; n } n int main() { n scanf( %d %d , &n, &q); n for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); n a[0] = maxx; n a[n + 1] = 0; n for (int i = 1; i <= n; ++i) change2(1, 0, maxx, a[i], 1); n for (int i = 1; i <= n + 1; ++i) { n int l = a[i - 1]; n int r = a[i]; n if (l == r) continue; n if (l > r) swap(l, r); n change(1, 0, maxx, l, r - 1, 1); n } n for (int i = 1; i <= q; ++i) { n scanf( %d %d , &x, &y); n l = a[x]; n r = a[x + 1]; n if (l != r) { n if (l > r) swap(l, r); n change(1, 0, maxx, l, r - 1, -1); n } n l = a[x - 1]; n r = a[x]; n if (l != r) { n if (l > r) swap(l, r); n change(1, 0, maxx, l, r - 1, -1); n } n change2(1, 0, maxx, a[x], -1); n change2(1, 0, maxx, y, 1); n a[x] = y; n l = a[x]; n r = a[x + 1]; n if (l != r) { n if (l > r) swap(l, r); n change(1, 0, maxx, l, r - 1, 1); n } n l = a[x - 1]; n r = a[x]; n if (l != r) { n if (l > r) swap(l, r); n change(1, 0, maxx, l, r - 1, 1); n } n printf( %d n , query(1, 0, maxx, 1, maxx - 1)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const int inf = 1e9 + 7; n const ll longinf = 1LL << 60; n const ll mod = 1e9 + 7; n int main() { n int h, w, n, q; n cin >> h >> w >> n >> q; n vector v[h]; n for (int i = (int)(0); i < (int)(n); ++i) { n int x, y; n cin >> x >> y; n --x; n --y; n v[x].push_back(y); n } n for (int i = (int)(0); i < (int)(h); ++i) sort(v[i].begin(), v[i].end()); n vector ok; n ok.push_back(-longinf); n ok.push_back(longinf); n for (int i = (int)(0); i < (int)(q); ++i) { n int x; n cin >> x; n --x; n ok.push_back(x); n } n sort(ok.begin(), ok.end()); n ll pl = 0, pr = 0; n ll dp[2][202020]; n for (int i = (int)(0); i < (int)(2); ++i) n for (int j = (int)(0); j < (int)(202020); ++j) dp[i][j] = longinf; n dp[0][1] = dp[1][1] = 0; n if (v[0].size()) { n pl = v[0][0]; n pr = v[0].back(); n dp[0][1] = 2 * pr - pl; n dp[1][1] = pr; n } n int maxh = 1; n for (int i = (int)(1); i < (int)(h); ++i) { n if (v[i].empty()) { n dp[0][i + 1] = dp[0][i] + 1; n dp[1][i + 1] = dp[1][i] + 1; n continue; n } n int nl = v[i][0], nr = v[i].back(); n auto itr = lower_bound(ok.begin(), ok.end(), pl); n dp[0][i + 1] = min(dp[0][i + 1], dp[0][i] + abs(*itr - pl) + n abs(nr - *itr) + abs(nr - nl) + 1); n dp[1][i + 1] = min(dp[1][i + 1], dp[0][i] + abs(*itr - pl) + n abs(nl - *itr) + abs(nr - nl) + 1); n --itr; n dp[0][i + 1] = min(dp[0][i + 1], dp[0][i] + abs(*itr - pl) + n abs(nr - *itr) + abs(nr - nl) + 1); n dp[1][i + 1] = min(dp[1][i + 1], dp[0][i] + abs(*itr - pl) + n abs(nl - *itr) + abs(nr - nl) + 1); n itr = lower_bound(ok.begin(), ok.end(), pr); n dp[0][i + 1] = min(dp[0][i + 1], dp[1][i] + abs(*itr - pr) + n abs(nr - *itr) + abs(nr - nl) + 1); n dp[1][i + 1] = min(dp[1][i + 1], dp[1][i] + abs(*itr - pr) + n abs(nl - *itr) + abs(nr - nl) + 1); n --itr; n dp[0][i + 1] = min(dp[0][i + 1], dp[1][i] + abs(*itr - pr) + n abs(nr - *itr) + abs(nr - nl) + 1); n dp[1][i + 1] = min(dp[1][i + 1], dp[1][i] + abs(*itr - pr) + n abs(nl - *itr) + abs(nr - nl) + 1); n pl = nl; n pr = nr; n maxh = max(i + 1, maxh); n } n cout << min(dp[0][maxh], dp[1][maxh]) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n int cnt = 0; n cin >> n; n string a; n for (int i = 0; i < n; i++) { n cin >> a; n if (a == Tetrahedron ) n cnt += 4; n else if (a == Cube ) n cnt += 6; n else if (a == Octahedron ) n cnt += 8; n else if (a == Dodecahedron ) n cnt += 12; n else n cnt += 20; n } n cout << cnt; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma comment(linker, /STACK:20000000 ) n string problem_name = a ; n void init() { freopen((problem_name + .in ).c_str(), rt , stdin); } n long long res = 0; n int ms[300100]; n int len; n void mul(int val) { n int p = 0; n for (int i = 0; i < 300000; i++) { n p += ms[i] *= val; n ms[i] = p % 10; n p /= 10; n } n } n int main() { n string s; n cin >> s; n vector u(255, 0); n res = 1; n int zero = 0; n long long col = 10; n int c = 0; n int c2 = 0; n for (int i = 0; i < int((s).size()); i++) { n if (s[i] == ? ) { n c++; n } else if (isalpha(s[i])) { n if (u[s[i]]) continue; n u[s[i]] = 1; n if (col <= 0) { n res = 0; n zero = 1; n break; n } n c2++; n col--; n } n } n if (zero) { n cout << 0; n return 0; n } n if (c) { n if (s[0] == ? ) n ms[c - 1] = 9; n else n ms[c] = 1; n } else n ms[0] = 1; n if (c2) { n for (int i = 10; i > 10 - c2; i--) { n if (i == 10 && isalpha(s[0])) n mul(9); n else n mul(i); n } n } n int len = 300000; n while (!ms[len]) len--; n for (int i = len; i >= 0; i--) printf( %d , ms[i]); n return 0; n } n "} +{"func_code_string": "#include n const long long mod = 1e9 + 7; n using namespace std; n const long long N = 102; n const long long M = 1e4 + 2; n long long dp[N][M], c[N][N], cnt[N]; n signed main() { n long long n, i, j, k, l, ans = 0, type = 0; n cin >> n; n dp[0][0] = 1; n c[0][0] = 1; n for (i = 1; i <= n; i++) { n cin >> j; n if (!cnt[j]) { n type++; n } n cnt[j]++; n for (l = i; l >= 1; l--) { n for (k = 10000; k >= j; k--) { n dp[l][k] += dp[l - 1][k - j]; n if (dp[l][k] > mod) { n dp[l][k] -= mod; n } n } n } n } n if (type <= 2) { n cout << n; n return 0; n } n for (i = 1; i <= 100; i++) { n for (j = 0; j <= i; j++) { n c[j][i] = c[j][i - 1]; n if (j) { n c[j][i] += c[j - 1][i - 1]; n } n c[j][i] %= mod; n } n } n for (i = 1; i <= 100; i++) { n for (j = 1; j <= cnt[i]; j++) { n if (c[j][cnt[i]] == dp[j][i * j]) { n ans = max(ans, j); n } n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int dx[] = {0, 1, -1, 0, 1, -1, -1, 1}; n const int dy[] = {-1, 0, 0, 1, 1, 1, -1, -1}; n const int N = 0; n const int MOD = 0; n const int INF = 1e9 + 10; n const long long int LLINF = 1e18 + 10; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int n, m; n cin >> n >> m; n int v[10010]; n int l, r, x; n for (int i = 1; i <= n; i++) { n cin >> v[i]; n } n int aux; n bool mudou; n int cnt = 0; n while (m--) { n cin >> l >> r >> x; n aux = x - l; n cnt = 0; n for (int i = l; i <= r; i++) { n if (v[i] < v[x]) cnt++; n } n if (cnt == aux) n cout << Yes n ; n else n cout << No n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int suma = 0, sumg = 0, a, g; n char *arr = new char[n]; n for (int i = 0; i < n; i++) { n scanf( %d %d , &a, &g); n if (abs(suma + a - sumg) < abs(sumg + g - suma)) { n suma += a; n arr[i] = A ; n } else { n sumg += g; n arr[i] = G ; n } n } n if (abs(suma - sumg) > 500) n cout << -1 ; n else n for (int i = 0; i < n; i++) cout << arr[i]; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool isPowerOfTwo(int x) { return (x && !(x & (x - 1))); } n bool is_prime(int n) { n if (n == 1) return false; n for (int i = 2; i <= sqrt(n); i++) { n if (n % i == 0) { n return false; n } n } n return true; n } n void solve() { n int n; n cin >> n; n long long int a, b; n cin >> a >> b; n set st; n st.insert(a); n st.insert(b); n for (int i = 2; i * i <= a; i++) { n if (a % i == 0) { n st.insert(i); n st.insert(a / i); n } n } n for (int i = 2; i * i <= b; i++) { n if (b % i == 0) { n st.insert(i); n st.insert(b / i); n } n } n map, long long int> ch; n ch[{a, b}]++; n for (int i = 1; i < n; i++) { n cin >> a >> b; n if (ch[{a, b}] >= 1) continue; n ch[{a, b}]++; n for (auto it = st.begin(); it != st.end();) { n long long int k = *it; n if (a % k == 0 || b % k == 0) { n it++; n } else { n it = st.erase(it++); n } n } n } n if (st.empty()) n cout << -1 ; n else n cout << (*st.begin()); n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using int64 = long long; n int64 bit_count(int64 n) { n int64 a{}; n while (n) { n a += 1; n n >>= 1; n } n return a; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int T; n cin >> T; n while (T--) { n int64 n, m; n cin >> n >> m; n vector P(m); n for (auto &p : P) cin >> p; n auto s = accumulate(begin(P), end(P), 0ll); n if (s < n) { n cout << -1 << n ; n continue; n } n vector F(65); n for (auto p : P) F[bit_count(p) - 1]++; n int64 ans{}; n for (int i = 0, j = -1; i < 64; i++) { n if (j >= 0 and F[i]) { n ans += i - j; n j = -1; n F[i]--; n } n if (n & (1 << i)) { n if (F[i]) { n F[i]--; n } else { n if (j == -1) j = i; n } n } n F[i + 1] += F[i] / 2; n } n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n if (i == 1) n printf( 14 n ); n else { n if (i == 2) n printf( 16 n ); n else n printf( %lld n , (1LL * i * (i + 1) * (i + 1) - (i - 1))); n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast,no-stack-protector ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx ) n #pragma GCC target( avx,tune=native ) n using namespace std; n const int inf = 0x3f3f3f3f; n const double eps = 1e-6; n const int mod = 1000000007; n inline string getstr(string &s, int l, int r) { n string ret = ; n for (int i = l; i <= r; i++) ret.push_back(s[i]); n return ret; n } n int modpow(int x, int y, int md = mod) { n if (y == 0) return 1; n int ret = modpow(x, y >> 1, md); n ret = (long long)ret * ret % md; n if (y & 1) ret = (long long)ret * x % md; n return ret; n } n int n, m, t, ans; n int a[10001]; n int cnt[10005]; n int in[11]; n inline int calc(int use) { n int ret = 1; n for (int i = 1; i <= use; i++) { n ret = (long long)ret * cnt[in[i]] % mod; n } n return ret; n } n void dfs(int use, int last, bitset<128> now) { n ans += calc(use); n if (ans >= mod) ans -= mod; n for (int i = last + 1; i <= m / 2; i++) { n if (cnt[i]) { n if (now[i] || now[m - i]) continue; n bitset<128> bs = n now | (now >> i) | (now << i) | (now >> (m - i)) | (now << (m - i)); n in[use + 1] = i; n dfs(use + 1, i, bs); n } n } n } n bitset<128> bs; n int main() { n bs.reset(); n bs.set(0); n cin >> n >> m >> t; n for (int i = 0; i < t; i++) cin >> a[i], cnt[min(m - a[i] % m, a[i] % m)]++; n dfs(0, 0, bs); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long t; n cin >> t; n while (t--) { n int n; n string a, b; n cin >> n >> a >> b; n vector res; n for (int i = 0; i < n; i++) { n if (a[i] != b[i]) { n if (i != 0) res.push_back(i + 1); n res.push_back(1); n if (i != 0) res.push_back(i + 1); n } n } n cout << res.size() << ; n for (int x : res) { n cout << x << ; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 2 * 1e5 + 5; n const int INF = 1e9; n const int MOD = 1e9 + 7; n int N, K, A[MAX], table[20][MAX]; n int main() { n cin >> N >> K; n for (int i = 0; i < (N); ++i) cin >> A[i]; n for (int i = 0; i < (N); ++i) table[0][i] = A[i]; n vector b(N, 0); n for (int i = 0; i < (N); ++i) { n for (int j = 0; j < (19); ++j) { n table[j + 1][i] = table[j][i] / 2; n b[i]++; n if (table[j + 1][i] == 0) break; n } n } n map m, cost; n int ans = INF; n for (int i = 0; i < (20); ++i) { n for (int j = 0; j < (N); ++j) { n if (b[j] < i) continue; n int num = table[i][j]; n m[num]++; n cost[num] += i; n if (m[num] >= K) ans = min(ans, cost[num]); n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int r, g, b, ck, maximum = 0, temp; n scanf( %d %d %d , &r, &g, &b); n if (r % 2 == 1) r++; n r = r / 2; n if (g % 2 == 1) g++; n g = g / 2; n if (b % 2 == 1) b++; n b = b / 2; n temp = 27 + r * 3; n if (temp > maximum) maximum = temp; n temp = 28 + g * 3; n if (temp > maximum) maximum = temp; n temp = 29 + b * 3; n if (temp > maximum) maximum = temp; n printf( %d n , maximum); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n for (int i = 0; i < s.size(); i++) { n for (char a = a ; a <= z ; a++) { n string t = ; n for (int j = 0; j < i; j++) { n t += s[j]; n } n t += a; n for (int j = i; j < s.size(); j++) { n t += s[j]; n } n string r = t; n reverse(t.begin(), t.end()); n if (r == t) { n cout << r; n return 0; n } n } n } n for (char a = a ; a <= z ; a++) { n string t = s; n t += a; n string r = t; n reverse(t.begin(), t.end()); n if (r == t) { n cout << r; n return 0; n } n } n cout << NA ; n } n "} +{"func_code_string": "#include n using namespace std; n inline void output(long long int x) { n if (x % 2) n cout << x / 2 << n ; n else n cout << x / 2 - 1 << n ; n return; n } n long long int N, K; n int main() { n cin >> N >> K; n if (N >= K) n output(K); n else { n if ((N << 1) - 1 < K) n cout << 0 << n ; n else n output(N - (K - N) + 2); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5005; n const int mod = 1000000007; n int n, a, b, k; n int dp[N][N]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> a >> b >> k; n for (long long i = 1; i <= n; ++i) { n dp[0][i] = i; n } n for (int trip = 1; trip <= k; trip++) { n for (int floor = 1; floor <= n; floor++) { n int d = abs(b - floor); n dp[trip][floor] = dp[trip - 1][min(n, floor + d - 1)] - n dp[trip - 1][max(0, floor - d)] - dp[trip - 1][floor] + n dp[trip - 1][floor - 1]; n while (dp[trip][floor] < 0) dp[trip][floor] += mod; n dp[trip][floor] %= mod; n dp[trip][floor] = (dp[trip][floor] + dp[trip][floor - 1]) % mod; n } n } n cout << (dp[k][a] - dp[k][a - 1] + mod) % mod; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int mdc(int a, int b) { return !b ? a : mdc(b, a % b); } n int main() { n int n, m, x, y, a, b, p, d, x1, y1, x2, y2; n cin >> n >> m >> x >> y >> a >> b; n d = mdc(a, b); n a /= d; n b /= d; n p = min(n / a, m / b); n a *= p; n b *= p; n if (x + a / 2 > n) { n x2 = n; n x1 = n - a; n } else if (x - a / 2 < 0) { n x1 = 0; n x2 = a; n } else { n x2 = x + a / 2; n x1 = x2 - a; n } n if (y + b / 2 > m) { n y2 = m; n y1 = m - b; n } else if (y - b / 2 < 0) { n y1 = 0; n y2 = b; n } else { n y2 = y + b / 2; n y1 = y2 - b; n } n cout << x1 << << y1 << << x2 << << y2 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1e9 + 7; n const long long N = 3e5 + 10; n long long pow(long long a, long long b, long long m) { n long long ans = 1; n while (b) { n if (b & 1) ans = (ans * a) % m; n b /= 2; n a = (a * a) % m; n } n return ans; n } n long long y[5], m[5]; n long long h, a, d; n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n for (long long i = 1; i <= 3; i++) { n cin >> y[i]; n } n for (long long i = 1; i <= 3; i++) { n cin >> m[i]; n } n cin >> h >> a >> d; n long long mn = 1e18; n for (long long i = y[1]; i <= 1000; i++) { n for (long long j = y[2]; j <= 201; j++) { n for (long long k = y[3]; k <= 201; k++) { n long long z = (i - y[1]) * h + (j - y[2]) * a + (k - y[3]) * d; n if (j <= m[3]) { n continue; n } else if (k >= m[2]) { n mn = min(mn, z); n } else { n long long sec_to_take_yong = n (m[1] / (j - m[3])) + (m[1] % (j - m[3]) != 0); n long long sec_to_take_m = (i / (m[2] - k)) + (i % (m[2] - k) != 0); n if (sec_to_take_yong < sec_to_take_m) mn = min(mn, z); n } n } n } n } n cout << mn << endl; n } n "} +{"func_code_string": "#include n using namespace std; n float distance(long long x, long long y, long long a, long long b) { n return sqrt((x - y) * (x - y) + (a - b) * (a - b)); n } n int32_t main() { n float n, x1, y1, x2, y2; n cin >> n >> x1 >> y1 >> x2 >> y2; n if ((x1 == x2 && (x1 == n || x1 == 0)) || n (y1 == y2 && (y1 == 0 || y2 == n))) { n cout << abs(x1 - x2) + abs(y1 - y2); n return 0; n } n long long path1 = 0, path2 = 0; n if (abs(x1 - x2) == n) { n path1 = 2 * n - (y1 + y2); n path2 = y1 + y2; n cout << (path1 > path2 ? path2 : path1) + n; n return 0; n } n if (abs(y1 - y2) == n) { n path1 = 2 * n - (x1 + x2); n path2 = x1 + x2; n cout << (path1 > path2 ? path2 : path1) + n; n return 0; n } n cout << abs(x1 - x2) + abs(y2 - y1); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long a, b, l, r, c, ans; n cin >> a >> b >> l >> r; n c = l % (a + b); n if (c > a) { n ans = 1; n l += (a + b - c + 1); n if (l <= r) ans += min(a, r - l + 1); n if (a > b) { n l += (2 * b); n if (l <= r) ans += min(a - b, r - l + 1); n } n } else { n ans = min(a - c + 1, r - l + 1); n l += (a - c + 1); n if (l <= r) { n ans++; n l += b; n if ((a <= b && a >= r - l + 1) || a > b) ans--; n } n if (l <= r) ans += min(c - 1, r - l + 1); n l += (c - 1); n if (a > b) { n if ((a - c + 1) > (a - b)) { n l += (b - c + 1); n if (l <= r) ans += min(a - b, r - l + 1); n } else { n if (l <= r) ans += min(a - c + 1, r - l + 1); n l += (a - c + 1); n l += (b + b); n if (l <= r) ans += min(c - b - 1, r - l + 1); n } n } n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 998244353; n const int maxn = 1e3 + 10; n int n, m, mp[maxn][maxn], cnt, dx[] = {0, 1, 0, -1}, dy[] = {-1, 0, 1, 0}; n bool vis[maxn][maxn]; n vector ans; n void dfs(int x, int y) { n if (vis[x][y] || x <= 0 || x > n || y <= 0 || y > m) return; n vis[x][y] = 1, ++cnt; n for (int i = 0; i < 4; ++i) n if (!(mp[x][y] & (1 << i))) dfs(x + dx[i], y + dy[i]); n } n void solve() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) scanf( %d , &mp[i][j]); n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) n if (!vis[i][j]) cnt = 0, dfs(i, j), ans.push_back(cnt); n sort(ans.begin(), ans.end()); n for (int i = ans.size() - 1; ~i; --i) printf( %d , ans[i]); n } n int main() { n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, t; n char v[500010]; n vector > inter; n int memo[500010]; n int calcula(int ind) { n int res = 0; n int x = ind; n int ini = 0; n int fim = 0; n bool erro = false; n int lh = -1; n inter.clear(); n for (int i = 0; i < (n); i++) { n if (v[i] == H ) { n x--; n lh = i; n } else if (v[i] == S ) { n x++; n } n if (x == -1 && !erro) { n ini = i; n erro = true; n } n if (x == 0 && erro) { n if (i < n && v[i + 1] == H ) continue; n inter.push_back(make_pair(ini, i)); n erro = false; n } n } n if (x < 0) return false; n if ((int)inter.size() == 0) { n if (lh < t) return true; n return false; n } n int i = 0; n res = inter[0].first; n fim = max(lh, inter[(int)inter.size() - 1].second); n memo[inter.size()] = 0; n int next; n for (int i = (int)inter.size() - 1; i >= 0; i--) { n if (i + 1 < (int)inter.size()) { n next = inter[i + 1].first - 1; n } else { n next = fim; n } n memo[i] = min((inter[i].second - inter[i].first + 1) * 3 - 2 + memo[i + 1] + n (next - inter[i].second), n (fim - inter[i].first + 1) * 2 - 1); n } n res += memo[0]; n if (res <= t) return true; n return false; n } n int main() { n scanf( %d %d , &n, &t); n for (int i = 0; i < (n); i++) { n scanf( %c , &v[i]); n } n int inicio = 0; n int fim = n; n int res = -1; n while (1) { n if (inicio > fim) break; n int meio = (inicio + fim) / 2; n if (calcula(meio)) { n res = meio; n fim = meio - 1; n } else { n inicio = meio + 1; n } n } n printf( %d n , res); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int t = 1, i, n; n scanf( %d , &n); n for (i = 1; i <= n - 1; i++) { n t = (t + i - 1) % n + 1; n printf( %d , t); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Point { n int x, y; n Point(int x = 0, int y = 0) : x(x), y(y) {} n Point operator-(const Point z) const { return Point(x - z.x, y - z.y); } n friend long long Cross(Point a, Point b) { n return 1ll * a.x * b.y - 1ll * a.y * b.x; n } n } a[2010], b[2010]; n bool f[2010]; n char ch[2010]; n int main(int argc, char const *argv[]) { n int n; n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i].x >> a[i].y; n cin >> ch; n int p = 0; n for (int i = 1; i < n; i++) n if (a[i].y < a[p].y || a[i].y == a[p].y && a[i].x < a[p].x) p = i; n f[p] = 1; n cout << p + 1 << ; n for (int i = 0; !i || ch[i - 1]; i++) { n int x = -1; n for (int j = 0; j < n; j++) n if (!f[j]) { n if (x == -1) n x = j; n else if (ch[i] == L ) n if (Cross(a[j] - a[p], a[x] - a[p]) > 0) n x = j; n else n ; n else if (Cross(a[j] - a[p], a[x] - a[p]) < 0) n x = j; n } n cout << x + 1 << ; n f[x] = 1; n p = x; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n typedef pair pii; n typedef long long ll; n typedef unsigned long long ull; n template n bool umax(T& a, const T& b) { n return b <= a ? false : (a = b, true); n } n template n bool umin(T& a, const T& b) { n return b >= a ? false : (a = b, true); n } n template n void V2A(T a[], const vector& b) { n for (int i = 0; i < b.size(); i++) a[i] = b[i]; n } n template n void A2V(vector& a, const T b[]) { n for (int i = 0; i < a.size(); i++) a[i] = b[i]; n } n const double PI = acos(-1.0); n const int INF = 1e9 + 7; n const int maxn = 2e3 + 7; n bool plot[maxn][maxn]; n int r[maxn][maxn]; n int n, m, k; n int check(int row, int col) { n if (col >= 0 && col < m) return true; n return false; n } n int main() { n cin >> n >> m >> k; n for (int i = 0; i < k; i++) { n int x, y; n scanf( %d%d , &x, &y); n x--; n y--; n if (!plot[x][y]) { n printf( %d %d n , x + 1, y + 1); n plot[x][y] = true; n continue; n } n for (int d = 1; d <= 3; d++) { n int Max = min(n, x + d + 1); n for (int row = max(0, x - d); row < Max; row++) { n int t = d - abs(x - row), col1 = y - t, col2 = y + t; n if (check(row, col1)) umax(r[x][y], r[row][col1] - d); n if (check(row, col2)) umax(r[x][y], r[row][col2] - d); n } n } n for (int d = r[x][y] + 1;; d++) { n int Max = min(n, x + d + 1); n bool ok = false; n for (int row = max(0, x - d); row < Max; row++) { n int t = d - abs(x - row), col1 = y - t, col2 = y + t; n if (check(row, col1) && !plot[row][col1]) { n ok = true; n printf( %d %d n , row + 1, col1 + 1); n plot[row][col1] = true; n break; n } n if (check(row, col2) && !plot[row][col2]) { n ok = true; n printf( %d %d n , row + 1, col2 + 1); n plot[row][col2] = true; n break; n } n } n if (ok) { n r[x][y] = d - 1; n break; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n int p, q; n } a[1009]; n bool cmp(node a, node b) { n if (a.p != b.p) return a.p < b.p; n if (a.p == b.p) return a.q > b.q; n } n int main() { n int m, n, i; n scanf( %d%d , &m, &n); n for (i = 1; i <= n; i++) { n scanf( %d%d , &a[i].p, &a[i].q); n } n sort(a + 1, a + 1 + n, cmp); n int sum = m; n for (i = 1; i <= n; i++) { n if (sum > a[i].p) n sum += a[i].q; n else n break; n } n if (i == n + 1) n printf( YES n ); n else n printf( NO n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n int len = s.size(); n cout << s[0]; n int flag = 0; n for (int i = 1; i < len; i++) { n if (s[i] == d && s[i + 1] == o && s[i + 2] == t && n (i + 2 != len - 1)) { n cout << . ; n i += 2; n } else if (s[i] == a && s[i + 1] == t && flag == 0) { n cout << @ ; n i++; n flag = 1; n } else n cout << s[i]; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n cerr.tie(nullptr); n long long n, k, a, z = 0; n cin >> n >> k; n vector x(n), c(n); n for (int i = 0; i < n; i++) cin >> x[i]; n cin >> a; n for (int i = 0; i < n; i++) cin >> c[i]; n multiset ms; n for (int i = 0; i < n; i++) { n ms.insert(c[i]); n while (k < x[i]) { n if (ms.size() == 0) { n cout << -1 n ; n return 0; n } else { n k += a; n z += *ms.begin(); n ms.erase(ms.begin()); n } n } n } n cout << z << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9 * 2; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n string s; n cin >> s; n int l = 0, r = n - 1; n while (l <= n && s[l] == 0 ) l++; n while (r >= 0 && s[r] == 0 ) r--; n int ans; n if (l > r) n ans = n; n else n ans = max(r + 1, n - l) * 2; n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma comment(linker, /stack:200000000 ) n #pragma GCC optimize( Ofast ) n #pragma GCC target( n sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) n #pragma GCC optimize( -ffloat-store ) n const long long INF = 0xFFFFFFFFFFFFFFFL; n const long long N = 1e9 + 7; n vector pri; n void yo(int n) { n bool prime[n + 1]; n memset(prime, true, sizeof(prime)); n for (int p = 2; p * p <= n; p++) { n if (prime[p] == true) { n for (int i = p * p; i <= n; i += p) prime[i] = false; n } n } n for (int p = 2; p <= n; p++) n if (prime[p]) pri.push_back(p); n } n void solve() { n long long n; n cin >> n; n for (long long i = 1; i < 1001; i++) { n if (!binary_search((pri).begin(), (pri).end(), n * i + 1)) { n cout << i; n return; n } n } n } n int32_t main(int32_t argc, char **argv) { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n yo(1000003); n long long t; n t = 1; n while (t--) solve(); n cerr << n n << Time : << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC n << ms n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n scanf( %d%d , &n, &k); n int mat[n + 1][n + 1]; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) mat[i][j] = 0; n } n int br = 0; n for (int i = 1; i <= n; i += 2) { n for (int j = 1, x = i; j <= n && x <= n; j++, x++) { n mat[x][j] = 1; n br++; n } n } n for (int i = 3; i <= n; i += 2) { n for (int h = 1, j = i; h <= n && j <= n; h++, j++) { n mat[h][j] = 1; n br++; n } n } n if (br < k) { n printf( NO ); n return 0; n } n printf( YES n ); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n if (k > 0) { n if (mat[i][j]) { n printf( L ); n k--; n } else n printf( S ); n } else n printf( S ); n } n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int a = 1; n int b = 2; n bool ok = true; n int k; n for (int i = 0; i < n; i++) { n cin >> k; n if (k != a && k != b) { n ok = false; n } else { n if (b == 3 && a == 1) { n a = min(2, k); n b = max(2, k); n } else if (b == 2 && a == 1) { n a = min(3, k); n b = max(3, k); n } else if (b == 3 && a == 2) { n a = min(1, k); n b = max(1, k); n } n } n } n if (ok) { n cout << YES ; n } else { n cout << NO ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5, M = 20; n int n, m, a[N], b[M], ans[M]; n set > use[M + 1]; n void find(int y, vector& current) { n if (y == m) { n for (int i = 0; i < n; i++) n if (a[i] != current[i]) return; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) cout << .* [(bool)(ans[j] & (1 << i))]; n cout << endl; n } n exit(0); n } n if (use[y].find(current) != use[y].end()) return; n for (int i = 0; i < (1 << n); i++) { n if ((((((((i << 1) | i) ^ i) >> 1) >> 0)) & 1) + n (((((((i << 1) | i) ^ i) >> 1) >> 1)) & 1) + n (((((((i << 1) | i) ^ i) >> 1) >> 2)) & 1) + n (((((((i << 1) | i) ^ i) >> 1) >> 3)) & 1) + n (((((((i << 1) | i) ^ i) >> 1) >> 4)) & 1) != n b[y]) n continue; n ans[y] = i; n vector newCur = current; n bool flag = true; n for (int j = 0; j < n; j++) { n if (ans[y] & (1 << j) && (!y || !(ans[y - 1] & (1 << j)))) newCur[j]++; n if (newCur[j] > a[j] || newCur[j] < a[j] - ((m - y) / 2)) { n flag = false; n break; n } n } n if (flag) find(y + 1, newCur); n } n use[y].insert(current); n } n int main() { n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < m; i++) cin >> b[i]; n vector c(n + 1, 0); n find(0, c); n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1100; n int n; n char s[maxn + 10]; n int data[maxn + 10]; n int dp[maxn + 10][2]; n int main() { n cin >> n; n getchar(); n gets(s); n int i; n for (i = 0; s[i]; i++) data[i] = s[i] - 0 ; n if (i == 1) n printf( 0 n ); n else { n int ans1 = 0, ans2 = 0; n for (int j = 0; j < i; j++) { n if ((j & 1) != data[j]) ans1++; n } n for (int j = 0; j < i; j++) { n if ((j & 1) == data[j]) ans2++; n } n printf( %d n , min(ans1, ans2)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 200005; n const int D = 30; n struct node { n int a, b; n }; n vector road[N], h[N]; n vector q[N]; n int n, m, t, fa[N][D + 1], w[N][D + 1], head[N], sum[N], ans[N], g[N]; n int cnt, tot, dep[N], id[N], size[N], c[N]; n int lowbit(int x) { return x & -x; } n void update(int x) { n for (int i = x; i <= n; i += lowbit(i)) { n c[i] += 1; n } n } n int check(int x) { n int tmp = 0; n for (int i = x; i >= 1; i -= lowbit(i)) { n tmp += c[i]; n } n return tmp; n } n struct edge { n int to, nxt; n } e[N * 2]; n void add(int u, int v) { n cnt++; n e[cnt].nxt = head[u]; n e[cnt].to = v; n head[u] = cnt; n } n void dfs1(int u, int deep) { n dep[u] = deep; n id[u] = ++tot; n size[u] = 1; n for (int i = head[u]; i; i = e[i].nxt) { n int v = e[i].to; n if (v == fa[u][0]) continue; n dfs1(v, deep + 1); n size[u] += size[v]; n } n } n void dfs2(int u) { n g[u] = u; n for (int i = 0; i < h[u].size(); i++) { n if (dep[h[u][i]] < dep[g[u]]) g[u] = h[u][i]; n } n for (int i = head[u]; i; i = e[i].nxt) { n int v = e[i].to; n if (v == fa[u][0]) continue; n dfs2(v); n if (dep[g[v]] < dep[g[u]]) g[u] = g[v]; n } n w[u][0] = g[u]; n } n int lca(int x, int y) { n if (dep[x] < dep[y]) swap(x, y); n for (int i = D; i >= 0; i--) { n if (dep[fa[x][i]] >= dep[y]) x = fa[x][i]; n } n if (x == y) return x; n for (int i = D; i >= 0; i--) { n if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i]; n } n return fa[x][0]; n } n node work(int x, int LCA) { n if (x == LCA) return (node){x, 0}; n int tmp = 0; n for (int i = D; i >= 0; i--) n if (dep[w[x][i]] > dep[LCA]) x = w[x][i], tmp += (1 << i); n if (w[x][0] == x) return (node){x, -1}; n return (node){x, tmp}; n } n int main() { n scanf( %d , &n); n for (int i = 2; i <= n; i++) { n scanf( %d , &fa[i][0]); n add(fa[i][0], i); n add(i, fa[i][0]); n } n dfs1(1, 1); n for (int i = 1; i <= D; i++) n for (int j = 1; j <= n; j++) { n fa[j][i] = fa[fa[j][i - 1]][i - 1]; n } n scanf( %d , &m); n for (int i = 1; i <= m; i++) { n int x, y; n scanf( %d%d , &x, &y); n int c = lca(x, y); n if (id[x] > id[y]) swap(x, y); n road[id[x]].push_back(id[y]); n if (dep[c] < dep[x]) h[x].push_back(c); n if (dep[c] < dep[y]) h[y].push_back(c); n } n dfs2(1); n for (int i = 1; i <= n; i++) { n } n for (int i = 1; i <= D; i++) n for (int j = 1; j <= n; j++) { n w[j][i] = w[w[j][i - 1]][i - 1]; n } n scanf( %d , &t); n for (int i = 1; i <= t; i++) { n int x, y; n scanf( %d%d , &x, &y); n int c = lca(x, y); n node A = work(x, c); n node B = work(y, c); n if (A.b == -1 || B.b == -1) { n ans[i] = -1; n continue; n } n if (x == c || y == c) { n ans[i] = A.b + B.b + 1; n continue; n } n ans[i] = A.b + B.b + 2; n x = A.a; n y = B.a; n if (id[x] > id[y]) swap(x, y); n q[id[x] - 1].push_back((node){y, -i}); n q[id[x] + size[x] - 1].push_back((node){y, i}); n } n for (int i = 1; i <= n; i++) { n for (int j = 0; j < road[i].size(); j++) update(road[i][j]); n for (int j = 0; j < q[i].size(); j++) { n int num = (q[i][j].b > 0 ? 1 : -1); n int x = q[i][j].a; n int y = q[i][j].b * num; n sum[y] += num * (check(id[x] + size[x] - 1) - check(id[x] - 1)); n } n } n for (int i = 1; i <= t; i++) { n printf( %d n , ans[i] - (sum[i] > 0)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct prog { n int i; n int cmp; n } a[100005]; n int ans[100005]; n bool cmp(prog a, prog b) { n if (a.cmp == b.cmp) n return a.i < b.i; n else n return a.cmp < b.cmp; n } n int main() { n int n, m; n while (cin >> n >> m) { n priority_queue q; n int i, j; n for (i = 0; i < m; i++) { n a[i].i = i + 1; n a[i].cmp = (int)fabs((m + 1) / 2.0 - i - 1); n } n sort(a, a + m, cmp); n for (i = 0; i < n; i++) { n int k = i % m; n cout << a[k].i << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 3e5 + 11, maxlg = 2e1; n typedef int i_N[maxN]; n typedef long long l_N[maxN]; n int N, M, Q, par[maxN][maxlg], umax[maxN][maxlg], umin[maxN][maxlg]; n vector adj[maxN], pos[maxN]; n vector > query[maxN]; n pair edge[maxN]; n i_N P, depth, mark, F; n l_N cnt, sum, mus, ans; n int lg(int x) { n for (int i = maxlg; i; i--) n if ((1 << i) <= x) return i; n return (1 - 1); n } n int get_root(int u) { n if (P[u] < (1 - 1)) return u; n return P[u] = get_root(P[u]); n } n void join(int u, int v) { n if (P[u] > P[v]) swap(P[u], P[v]); n P[u] += P[v]; n P[v] = u; n } n void dfs(int u) { n for (int i = 1, x = lg(depth[u]); i <= x; i++) { n par[u][i] = par[par[u][i - 1]][i - 1]; n umax[u][i] = max(umax[u][i - 1], umax[par[u][i - 1]][i - 1]); n umin[u][i] = min(umin[u][i - 1], umin[par[u][i - 1]][i - 1]); n } n for (int i = (1 - 1); i < (int)adj[u].size(); i++) { n int v = adj[u][i]; n if (par[v][(1 - 1)]) continue; n par[v][(1 - 1)] = u; n umax[v][(1 - 1)] = max(u, v); n umin[v][(1 - 1)] = min(u, v); n depth[v] = depth[u] + 1; n dfs(v); n } n } n void get(int u, int v, int& x, int& y) { n if (depth[u] < depth[v]) swap(u, v); n for (int i = lg(depth[u]); i >= (1 - 1); i--) n if (depth[u] - (1 << i) >= depth[v]) { n x = min(x, umin[u][i]); n y = max(y, umax[u][i]); n u = par[u][i]; n } n for (int i = lg(depth[u]); i >= (1 - 1); i--) n if (par[u][i] != par[v][i]) { n x = min(x, min(umin[u][i], umin[v][i])); n y = max(y, max(umax[u][i], umax[v][i])); n u = par[u][i]; n v = par[v][i]; n } n if (u != v) { n x = min(x, min(umin[u][(1 - 1)], umin[v][(1 - 1)])); n y = max(y, max(umax[u][(1 - 1)], umax[v][(1 - 1)])); n } n } n void update(long long* bit, int x, int v) { n for (int i = x; i <= N; i |= i + 1) bit[i] += v; n } n long long get_bit(long long* bit, int x) { n long long res = (1 - 1); n for (int i = x; i >= 1; i = (i & (i + 1)) - 1) res += bit[i]; n return res; n } n long long get_bit(long long* bit, int l, int r) { n return get_bit(bit, r) - get_bit(bit, l - 1); n } n int main() { n scanf( %d %d n , &N, &M); n for (int i = 1; i <= M; i++) { n int u, v; n scanf( %d %d n , &u, &v); n edge[i] = pair(u, v); n } n memset(P, -1, sizeof(P)); n for (int i = 1; i <= M; i++) { n int u = edge[i].first, v = edge[i].second; n int r1 = get_root(u), r2 = get_root(v); n if (r1 != r2) { n mark[i] = 1; n join(r1, r2); n adj[u].push_back(v); n adj[v].push_back(u); n } n } n for (int u = 1; u <= N; u++) n if (!par[u][(1 - 1)]) { n par[u][(1 - 1)] = -1; n dfs(u); n } n for (int i = 1; i <= M; i++) n if (!mark[i]) { n int u = edge[i].first, v = edge[i].second; n int x = 1e9, y = (1 - 1); n get(u, v, x, y); n F[x] = y; n } n F[N + 1] = N + 1; n for (int i = N; i >= 1; i--) { n if (F[i] == (1 - 1)) n F[i] = F[i + 1]; n else n F[i] = min(F[i], F[i + 1]); n pos[F[i]].push_back(i); n } n scanf( %d n , &Q); n for (int i = 1; i <= Q; i++) { n int l, r; n scanf( %d %d n , &l, &r); n query[r].push_back(pair(l, i)); n } n for (int i = 1; i <= N; i++) { n update(cnt, i, 1); n update(sum, i, i - 1); n for (int j = (1 - 1); j < (int)pos[i].size(); j++) { n int p = pos[i][j]; n update(cnt, p, -1); n update(sum, p, 1 - p); n update(mus, p, i - p); n } n for (int j = (1 - 1); j < (int)query[i].size(); j++) { n int r = i, l = query[i][j].first, id = query[i][j].second; n long long C = get_bit(cnt, l, r); n long long S = get_bit(sum, l, r); n long long T = get_bit(mus, l, r); n ans[id] += C * i - S + T; n } n } n for (int i = 1; i <= Q; i++) printf( %I64d n , ans[i]); n } n "} +{"func_code_string": "#include n using namespace std; n template n bool smax(T& x, L y) { n return x < y ? (x = y, 1) : 0; n } n template n bool smin(T& x, L y) { n return x > y ? (x = y, 1) : 0; n } n const int maxn = 16; n int n, a[maxn], b[maxn][maxn], ex, x[maxn]; n bool mark[maxn]; n vector > all; n vector todo; n int fond(int x) { n for (int i = 0; i < n * n; i++) n if (!mark[i] && a[i] == x) return i; n return -1; n } n void back(int s = 0) { n if (s == n) { n for (int i = 0, sum = 0; i < n; i++, sum = 0) { n for (int j = 0; j < n; j++) sum += b[j][i]; n if (sum != ex) return; n } n { n int sum = 0; n for (int i = 0; i < n; i++) sum += b[i][i]; n if (sum != ex) return; n } n { n int sum = 0; n for (int i = 0; i < n; i++) sum += b[i][n - i - 1]; n if (sum != ex) return; n } n for (int i = 0; i < n; i++, cout << n ) n for (int j = 0; j < n; j++) cout << b[i][j] << ; n exit(0); n } n if (s == n - 1) { n fill(b[n - 1], b[n - 1] + n, ex); n for (int i = 0; i < n - 1; i++) n for (int j = 0; j < n; j++) b[n - 1][j] -= b[i][j]; n int i = 0; n for (int tmp; i < n; i++) n if (~(tmp = fond(b[n - 1][i]))) n mark[tmp] = 1, todo.push_back(tmp); n else n break; n if (i == n) back(n); n for (auto x : todo) mark[x] = 0; n todo.clear(); n } n for (auto v : all) { n bool reval = 1; n for (auto x : v) n if (mark[x]) { n reval = 0; n break; n } n if (!reval) continue; n do { n for (int i = 0; i < n; i++) b[s][i] = a[v[i]], mark[v[i]] = 1; n back(s + 1); n for (int i = 0; i < n; i++) mark[v[i]] = 0; n } while (next_permutation(v.begin(), v.end())); n } n } n void tof(int idx) { n if (idx == 4 && x[0] + x[1] + x[2] + x[3] != ex) return; n if (idx == 8 && x[4] + x[5] + x[6] + x[7] != ex) return; n if (idx == 12 && x[8] + x[9] + x[10] + x[11] != ex) return; n if (idx == 16 && x[12] + x[13] + x[14] + x[15] != ex) return; n if (idx == 13 && x[0] + x[4] + x[8] + x[12] != ex) return; n if (idx == 14 && x[1] + x[5] + x[9] + x[13] != ex) return; n if (idx == 15 && x[2] + x[6] + x[10] + x[14] != ex) return; n if (idx == 16 && x[3] + x[7] + x[11] + x[15] != ex) return; n if (idx == 13 && x[3] + x[6] + x[9] + x[12] != ex) return; n if (idx == 16 && x[0] + x[5] + x[10] + x[15] != ex) return; n if (idx == 16) { n for (int i = 0; i < n; i++, cout << n ) n for (int j = 0; j < n; j++) cout << x[i * 4 + j] << ; n exit(0); n } n for (int i = 0; !(i >> 4); ++i) n if (!mark[i]) { n x[idx] = a[i], mark[i] = 1; n tof(idx + 1); n mark[i] = 0; n } n } n int main() { n srand(time(0)); n ios::sync_with_stdio(0), cin.tie(); n cin >> n; n for (int i = 0; i < n * n; i++) cin >> a[i], ex += a[i]; n random_shuffle(a, a + n * n); n ex /= n; n cout << ex << n ; n if (n < 4) { n for (int i = 0; i < 1 << n * n; i++) n if (__builtin_popcount(i) == n) { n int sum = 0; n for (int j = 0; j < n * n; j++) sum += (i >> j & 1) * a[j]; n if (sum == ex) { n all.push_back({}); n for (int j = 0; j < n * n; j++) n if (i >> j & 1) all.back().push_back(j); n sort(all.back().begin(), all.back().end()); n } n } n return back(), 0; n } n tof(0); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n set, pair > > s; n vector ed[2][300000]; n int n, m, k; n int a[300000], b[300000]; n long long ans[300000]; n bool add(int x, int y, int dx, int dy) { n pair, pair > g = n make_pair(make_pair(x, y), make_pair(dx, dy)); n if (s.find(g) != s.end()) return false; n s.insert(g); n return true; n } n void go(int x, int y, int dx, int dy, long long t) { n int tt = 1; n int d = x - y + m; n if (dx - dy != 0) { n tt = 0; n d = x + y; n } n bool f = add(x, y, dx, dy); n if (!f) return; n for (int j = 0; j < ed[tt][d].size(); j++) { n int kx = a[ed[tt][d][j]]; n int ky = b[ed[tt][d][j]]; n kx = kx - x; n ky = ky - y; n kx = kx / dx; n ky = ky / dy; n int g = ed[tt][d][j]; n if (ans[g] != -1) continue; n ans[g] = t + min(kx, ky); n } n if (dx == 1 && dy == 1) { n int v = min(n - x, m - y); n x += v; n y += v; n if (x == n && y == m) return; n if (y == m) n go(x, y, 1, -1, t + v); n else n go(x, y, -1, 1, t + v); n } n if (dx == -1 && dy == -1) { n int v = min(x, y); n x -= v; n y -= v; n if (x == 0 && y == 0) return; n if (y == 0) n go(x, y, -1, 1, t + v); n else n go(x, y, 1, -1, t + v); n } n if (dx == 1 && dy == -1) { n int v = min(n - x, y); n x += v; n y -= v; n if (x == n && y == 0) return; n if (y == 0) n go(x, y, 1, 1, t + v); n else n go(x, y, -1, -1, t + v); n } n if (dx == -1 && dy == 1) { n int v = min(x, m - y); n x -= v; n y += v; n if (x == 0 && y == m) return; n if (x == 0) n go(x, y, 1, 1, t + v); n else n go(x, y, -1, -1, t + v); n } n } n int main() { n ios_base::sync_with_stdio(0); n cin >> n >> m >> k; n for (int i = 1; i <= k; i++) ans[i] = -1; n for (int i = 1; i <= k; i++) { n cin >> a[i] >> b[i]; n ed[0][a[i] + b[i]].push_back(i); n ed[1][a[i] - b[i] + m].push_back(i); n } n go(0, 0, 1, 1, 0); n for (int i = 1; i <= k; i++) cout << ans[i] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long read() { n char ch = getchar(); n long long x = 0, f = 1; n while (ch < 0 || ch > 9 ) f = ch == - ? -1 : 1, ch = getchar(); n while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); n return x * f; n } n int main(int argc, char *argv[]) { n ios::sync_with_stdio(false); n cin.tie(0); n long long base = (1LL << 7) - 1; n long long res = 0, cur; n printf( ? ); n for (long long i = (1); i <= (100); i += (1)) printf( %lld , i); n putchar( n ); n fflush(stdout); n cur = read(); n res += (cur >> 7) << 7; n printf( ? ); n for (long long i = (1); i <= (100); i += (1)) printf( %lld , i << 7); n putchar( n ); n fflush(stdout); n cur = read(); n res += cur & base; n printf( ! %lld n , res); n fflush(stdout); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 205, MAXL = 1 << 20; n char qq[MAXL]; n char s[MAX][MAX]; n pair kamo[MAX][MAX]; n vector > R[MAX][MAX]; n int indeg[MAX][MAX]; n int cik[MAX][MAX]; n int imacik[MAX * MAX][10]; n int brred, brstup; n int pr[10], ps[10]; n int bio[MAX][MAX]; n int dokle[MAX][MAX]; n int imaq[MAXL][10]; n int brc = 1; n int Vani(int red, int stup) { n return red < 0 || red >= brred || stup < 0 || stup >= brstup; n } n void Osisaj() { n queue > Q; n for (int i = 0; i < brred; i++) n for (int j = 0; j < brstup; j++) n if (!indeg[i][j]) Q.push(pair(i, j)); n for (; !Q.empty();) { n pair tmp = Q.front(); n bio[tmp.first][tmp.second] = 1; n Q.pop(); n pair nn = kamo[tmp.first][tmp.second]; n indeg[nn.first][nn.second]--; n if (!indeg[nn.first][nn.second]) Q.push(nn); n } n for (int i = 0; i < brred; i++) { n for (int j = 0; j < brstup; j++) { n if (!bio[i][j]) { n int sz = 0; n for (pair tmp = pair(i, j); n tmp != pair(i, j) || !sz; n sz++, tmp = kamo[tmp.first][tmp.second]) { n bio[tmp.first][tmp.second] = 1; n cik[tmp.first][tmp.second] = brc; n imacik[brc][s[tmp.first][tmp.second] - 0 ] = 1; n } n brc++; n } n } n } n } n int Rijesi() { n queue > Q; n memset(dokle, 0, sizeof dokle); n int len = (int)strlen(qq); n for (int i = 0; i <= len; i++) n for (int j = 0; j < 10; j++) imaq[i][j] = 0; n for (int i = len - 1; i >= 0; i--) { n imaq[i][qq[i] - 0 ] = 1; n for (int j = 0; j < 10; j++) imaq[i][j] |= imaq[i + 1][j]; n } n for (int i = 0; i < brred; i++) n for (int j = 0; j < brstup; j++) { n indeg[i][j] = (int)R[i][j].size(); n if (!indeg[i][j]) Q.push(pair(i, j)); n } n for (; !Q.empty();) { n pair tmp = Q.front(); n Q.pop(); n int nd = dokle[tmp.first][tmp.second]; n if (s[tmp.first][tmp.second] == qq[nd]) nd++; n if (nd == len) return 1; n pair nn = kamo[tmp.first][tmp.second]; n dokle[nn.first][nn.second] = max(dokle[nn.first][nn.second], nd); n indeg[nn.first][nn.second]--; n if (!indeg[nn.first][nn.second]) Q.push(nn); n } n for (int i = 0; i < brred; i++) { n for (int j = 0; j < brstup; j++) { n if (cik[i][j]) { n int da = 1; n int indc = cik[i][j]; n for (int k = 0; k < 10; k++) n if (!imacik[indc][k] && imaq[dokle[i][j]][k]) da = 0; n if (da) return 1; n } n } n } n return 0; n } n int main() { n int brq; n scanf( %d%d%d , &brred, &brstup, &brq); n for (int i = 0; i < brred; i++) scanf( %s , s[i]); n for (int i = 0; i < 10; i++) scanf( %d%d , &pr[i], &ps[i]); n for (int i = 0; i < brred; i++) { n for (int j = 0; j < brstup; j++) { n int nr = i + pr[s[i][j] - 0 ]; n int ns = j + ps[s[i][j] - 0 ]; n if (Vani(nr, ns)) n kamo[i][j] = pair(i, j); n else n kamo[i][j] = pair(nr, ns); n indeg[kamo[i][j].first][kamo[i][j].second]++; n R[kamo[i][j].first][kamo[i][j].second].push_back(pair(i, j)); n } n } n Osisaj(); n for (int i = 0; i < brq; i++) { n scanf( %s , qq); n printf( %s n , Rijesi() ? YES : NO ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n struct Segtree { n int N; n vector seg, lazy; n Segtree(int _n) : N(_n) { n seg.resize(4 * N, 0); n lazy.resize(4 * N, 0); n } n T join(T x, T y) { return max(x, y); } n void push(int x, int s, int e) { n if (!lazy[x]) return; n seg[x] = max(seg[x], lazy[x]); n if (s != e) { n lazy[2 * x] = max(lazy[2 * x], lazy[x]); n lazy[2 * x + 1] = max(lazy[2 * x + 1], lazy[x]); n } n lazy[x] = 0; n } n void build(int x, int s, int e) { n if (s == e) { n seg[x] = 0; n return; n } n int mid = (s + e) >> 1; n build(2 * x, s, mid); n build(2 * x + 1, mid + 1, e); n seg[x] = join(seg[2 * x], seg[2 * x + 1]); n } n void update(int x, int s, int e, int l, int r, T val) { n push(x, s, e); n if (s > r || e < l) return; n if (s >= l && e <= r) { n lazy[x] = val; n push(x, s, e); n return; n } n int mid = (s + e) >> 1; n update(2 * x, s, mid, l, r, val); n update(2 * x + 1, mid + 1, e, l, r, val); n seg[x] = join(seg[2 * x], seg[2 * x + 1]); n } n T query(int x, int s, int e, int l, int r) { n push(x, s, e); n if (e < l || s > r) return 0; n if (s >= l && e <= r) { n return seg[x]; n } n int mid = (s + e) >> 1; n return join(query(2 * x, s, mid, l, r), query(2 * x + 1, mid + 1, e, l, r)); n } n void update(int l, int r, T val) { update(1, 0, N - 1, l, r, val); } n T query(int l, int r) { return query(1, 0, N - 1, l, r); } n }; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n, q; n cin >> n >> q; n vector x(q), y(q), d(q), cc(1, 0); n for (int i = 0; i < q; ++i) { n char c; n cin >> x[i] >> y[i] >> c; n d[i] = (c == U ); n cc.push_back(x[i]); n cc.push_back(y[i]); n cc.push_back(n + 1 - x[i]); n cc.push_back(n + 1 - y[i]); n } n sort(cc.begin(), cc.end()); n cc.erase(unique(cc.begin(), cc.end()), cc.end()); n Segtree left(cc.size() + 1), up(cc.size() + 1); n for (int i = 0; i < q; ++i) { n x[i] = lower_bound(cc.begin(), cc.end(), x[i]) - cc.begin(); n y[i] = lower_bound(cc.begin(), cc.end(), y[i]) - cc.begin(); n if (d[i]) { n int id = up.query(y[i], y[i]); n up.update(y[i], y[i], y[i]); n cout << cc[y[i]] - cc[id] << n ; n id = lower_bound(cc.begin(), cc.end(), n + 1 - cc[id]) - cc.begin(); n y[i] = lower_bound(cc.begin(), cc.end(), n + 1 - cc[y[i]]) - cc.begin(); n left.update(y[i], id, x[i]); n } else { n int id = left.query(x[i], x[i]); n left.update(x[i], x[i], x[i]); n cout << cc[x[i]] - cc[id] << n ; n id = lower_bound(cc.begin(), cc.end(), n + 1 - cc[id]) - cc.begin(); n x[i] = lower_bound(cc.begin(), cc.end(), n + 1 - cc[x[i]]) - cc.begin(); n up.update(x[i], id, y[i]); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n void addmod(int &a, long long b) { n a = (a + b); n if (a >= 1000000007) a -= 1000000007; n } n void mulmod(int &a, long long b) { a = (a * b) % 1000000007; } n template n bool domin(T &a, const T &b) { n return a > b ? a = b, 1 : 0; n } n template n bool domax(T &a, const T &b) { n return a < b ? a = b, 1 : 0; n } n int gi() { n int a; n scanf( %d , &a); n return a; n } n long long gll() { n long long a; n scanf( %lld , &a); n return a; n } n int n; n namespace treap { n struct treap { n int val, size, lazy; n long long rnd; n treap *l, *r; n treap() n : val(0), n size(0), n lazy(0), n rnd((((long long)rand()) << 32) | rand()), n l(NULL), n r(NULL) {} n treap(int val) n : val(val), n size(1), n lazy(0), n rnd((((long long)rand()) << 32) | rand()), n l(NULL), n r(NULL) {} n void push() { n if (lazy == 0) return; n val += lazy; n if (l != NULL) l->lazy += lazy; n if (r != NULL) r->lazy += lazy; n lazy = 0; n } n void updateSz() { n size = 1; n if (l != NULL) size += l->size; n if (r != NULL) size += r->size; n } n }; n typedef treap *ptreap; n ptreap root = NULL; n void split(ptreap tp, int key, ptreap &l, ptreap &r) { n if (tp == NULL) { n l = NULL, r = NULL; n return; n } n tp->push(); n if (tp->val < key) n l = tp, split(tp->r, key, tp->r, r); n else n r = tp, split(tp->l, key, l, tp->l); n if (l != NULL) l->updateSz(); n if (r != NULL) r->updateSz(); n } n pair split(int v) { n ptreap l, r; n split(root, v, l, r); n return {l, r}; n } n pair split(ptreap tp, int v) { n ptreap l, r; n split(tp, v, l, r); n return {l, r}; n } n void insert(ptreap &tp, ptreap v) { n if (tp == NULL) { n tp = v; n return; n } n tp->push(); n if (v->rnd < tp->rnd) n insert(v->val > tp->val ? tp->r : tp->l, v); n else n split(tp, v->val, v->l, v->r), tp = v; n tp->updateSz(); n } n void insert(int v) { n ptreap tp = new treap(v); n insert(root, tp); n } n void merge(ptreap &t, ptreap l, ptreap r) { n if (l != NULL) l->push(); n if (r != NULL) r->push(); n if (l == NULL || r == NULL) n t = (l == NULL ? r : l); n else if (l->rnd > r->rnd) n t = l, merge(t->r, l->r, r); n else n t = r, merge(t->l, l, r->l); n if (t != NULL) t->updateSz(); n } n void erase(ptreap &tp, int v) { n if (tp == NULL) return; n tp->push(); n if (v == tp->val) { n merge(tp, tp->l, tp->r); n } else { n erase(v < tp->val ? tp->l : tp->r, v); n tp->updateSz(); n } n } n int getmin(ptreap tp) { n if (tp == NULL) return 0; n tp->push(); n return tp->l == NULL ? tp->val : getmin(tp->l); n } n int getmax(ptreap tp) { n if (tp == NULL) return 0; n tp->push(); n return tp->r == NULL ? tp->val : getmax(tp->r); n } n void recalc(ptreap tp) { n if (tp == NULL) return; n tp->push(); n recalc(tp->l); n recalc(tp->r); n tp->updateSz(); n } n void debug(ptreap &tp) { n if (tp == NULL) return; n tp->push(); n if (tp->l != NULL) debug(tp->l); n cout << << tp->val << : << tp->rnd << : << tp->size << endl; n if (tp->r != NULL) debug(tp->r); n } n } // namespace treap n int main() { n n = gi(); n for (int i = 0; i < n; i++) { n int l = gi(), r = gi(); n auto v = treap::split(l); n auto v2 = treap::split(v.second, r); n if (v2.first != NULL) v2.first->lazy++; n if (v2.second != NULL) { n auto v = treap::getmin(v2.second); n treap::erase(v2.second, v); n } n treap::merge(treap::root, v.first, v2.first); n treap::merge(treap::root, treap::root, v2.second); n treap::insert(l); n } n cout << treap::root->size << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e5 + 10; n int l = 1, r = 0; n int a[MAXN], b[MAXN], now[MAXN], num[MAXN << 1], cnt[MAXN], ans[MAXN]; n map ms; n struct Change { n int p, x, y; n } c[MAXN]; n struct Query { n int l, r, t, id; n bool operator<(const Query &A) const { n if (b[l] == b[A.l]) return b[r] == b[A.r] ? t < A.t : b[r] < b[A.r]; n return b[l] < b[A.l]; n } n } q[MAXN]; n void update(int x, int d) { n int &y = num[x]; n if (y > 0) cnt[y]--; n y += d; n if (y > 0) cnt[y]++; n } n void modify(int p, int d) { n if (l <= p && p <= r) { n update(a[p], -1); n update(d, 1); n } n a[p] = d; n } n int get() { n for (int i = 1;; i++) { n if (!cnt[i]) return i; n } n } n int main() { n int n, m, id = 0, Time = 0, sz = 0; n scanf( %d%d , &n, &m); n int B = 2000; n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n int &t = ms[a[i]]; n if (!t) t = ++sz; n now[i] = a[i] = t; n b[i] = i / B + 1; n } n while (m--) { n int op, x, y; n scanf( %d%d%d , &op, &x, &y); n if (op == 1) n q[++id] = (Query){x, y, Time, id}; n else { n int &t = ms[y]; n if (!t) t = ++sz; n c[++Time] = (Change){x, y = t, now[x]}; n now[x] = y; n } n } n sort(q + 1, q + id + 1); n int v = 0; n for (int i = 1; i <= id; i++) { n while (v < q[i].t) modify(c[v + 1].p, c[v + 1].x), v++; n while (v > q[i].t) modify(c[v].p, c[v].y), v--; n while (l < q[i].l) update(a[l], -1), l++; n while (l > q[i].l) update(a[l - 1], 1), l--; n while (r < q[i].r) update(a[r + 1], 1), r++; n while (r > q[i].r) update(a[r], -1), r--; n ans[q[i].id] = get(); n } n for (int i = 1; i <= id; i++) { n printf( %d n , ans[i]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double PI = 4.0 * atan(1.0); n void EnchomSolve() { n int l; n long double L; n long double ans = 0.0; n long double area; n long double height; n long double help, help2; n scanf( %d , &l); n L = (long double)l; n help = L / sqrt(3.0); n height = sqrt(L * L - help * help); n help = (sqrt(3.0) / 2.0) * L; n area = (help * L) / 2.0; n ans += area * height / 3.0; n scanf( %d , &l); n L = (long double)l; n help = (sqrt(2.0) / 2.0) * L; n height = sqrt(L * L - help * help); n area = L * L; n ans += area * height / 3.0; n scanf( %d , &l); n L = (long double)l; n help = L / (sqrt(2.0 - 2.0 * cos(72.0 * PI / 180.0))); n height = sqrt(L * L - help * help); n help2 = sqrt(help * help - (L / 2.0) * (L / 2.0)); n area = L * help2 / 2.0; n area *= 5.0; n ans += area * height / 3.0; n printf( %.10f n , (double)ans); n return; n } n int main() { n EnchomSolve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c; n cin >> a >> b >> c; n int x = min(a, b / 2); n int y = min(x, c / 4); n cout << y * 7; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct EDGE { n int to, next, w, co; n } e[100000]; n int head[100], top, vis[100000]; n void add(int u, int v, int w, int co) { n e[top].to = v; n e[top].w = w; n e[top].co = co; n e[top].next = head[u]; n head[u] = top++; n } n struct _ { n int max_flow, co; n }; n int dis[100], vvis[100], prep[100], pree[100]; n queue q; n deque node; n void spfa(int s) { n memset(dis, 63, sizeof(dis)); n memset(vvis, 0, sizeof(vvis)); n dis[s] = 0; n q.push(s); n int i; n while (!q.empty()) { n s = q.front(); n q.pop(); n vvis[s] = 0; n int i; n for (i = head[s]; ~i; i = e[i].next) { n if (!e[i].w) continue; n if (dis[s] + e[i].co < dis[e[i].to]) { n dis[e[i].to] = dis[s] + e[i].co; n pree[e[i].to] = i; n prep[e[i].to] = s; n if (vvis[e[i].to]) continue; n vvis[e[i].to] = 1; n q.push(e[i].to); n } n } n } n } n _ dfs(int s, int t, int rest) { n int flow = 998244353, co = 0; n int temp = t; n _ rv; n while (t != s) { n flow = min(flow, e[pree[t]].w); n co += e[pree[t]].co; n t = prep[t]; n } n if (co > 0) flow = min(flow, rest / co); n if (flow == 0) return rv = (_){0, 0}; n t = temp; n while (t != s) { n temp = pree[t]; n e[temp].w -= flow; n e[temp ^ 1].w += flow; n t = prep[t]; n } n rv = (_){flow, co}; n return rv; n } n long long EK(int s, int t, int rest) { n long long sum = 0; n _ _; n while (1) { n spfa(s); n if (dis[t] > 998244353) break; n _ = dfs(s, t, rest); n if (_.max_flow == 0) break; n sum += _.max_flow; n rest -= _.max_flow * _.co; n } n return sum; n } n int main() { n memset(head, 255, sizeof(head)); n int n, k; n scanf( %d%d , &n, &k); n int i, j, t; n for (i = 1; i <= n; i++) { n for (j = 1; j <= n; j++) { n scanf( %d , &t); n if (t) { n add(i, j, t, 0); n add(j, i, 0, 0); n add(i, j, k, 1); n add(j, i, 0, -1); n } n } n } n long long ans = EK(1, n, k); n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct station { n int pos, price; n } a[200003]; n int T[800008], d, n, m; n long long cnt; n bool comp(station A, station B) { return (A.pos < B.pos); } n void Build_MinIT(int, int, int); n int Find_Min(int, int, int, int, int); n int main() { n scanf( %d %d %d , &d, &n, &m); n for (int i = 1; i <= m; i++) scanf( %d %d , &a[i].pos, &a[i].price); n sort(a + 1, a + 1 + m, comp); n a[++m].pos = d; n for (int i = 1; i <= m; i++) { n if (a[i].pos - a[i - 1].pos > n) { n cout << -1; n return 0; n } n } n if (n >= d) { n cout << 0; n return 0; n } n a[200002].price = 1E+9; n Build_MinIT(1, m, 1); n int i = 0, j = 1, t = n; n while (j <= m) { n while (a[i].price < a[j].price && a[j].pos - a[i].pos <= n && j <= m) j++; n if (a[j].pos - a[i].pos <= n) { n cnt += (long long)(a[j].pos - (a[i].pos + t)) * a[i].price; n t = 0; n i = j++; n } else { n int k = Find_Min(i + 1, j - 1, 1, m, 1); n cnt += (long long)(n - t) * a[i].price; n t = a[i].pos + n - a[k].pos; n i = k; n } n } n cout << cnt; n return 0; n } n void Build_MinIT(int L, int R, int v) { n if (L == R) { n T[v] = L; n return; n } n int m = (L + R) / 2; n Build_MinIT(L, m, v * 2); n Build_MinIT(m + 1, R, v * 2 + 1); n T[v] = (a[T[v * 2]].price < a[T[v * 2 + 1]].price ? T[v * 2] : T[v * 2 + 1]); n } n int Find_Min(int l, int r, int L, int R, int v) { n if (l > r) return 200002; n if (l == L && r == R) return T[v]; n int m = (L + R) / 2; n int x = Find_Min(l, min(r, m), L, m, v * 2), n y = Find_Min(max(l, m + 1), r, m + 1, R, v * 2 + 1); n return (a[x].price < a[y].price ? x : y); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n double lo = 0.0, hi = 10000000.0; n for (int i = 1; i <= n; i++) { n int sta; n cin >> sta; n lo = max(lo, (double)10.0 * sta / i); n hi = min(hi, (double)10.0 * (sta + 1) / i); n } n int nextlo = floor(lo * (n + 1) / 10.0); n int nexthi = ceil(hi * (n + 1) / 10.0); n if (nextlo + 1 >= nexthi) { n cout << unique << endl << nextlo << endl; n } else { n cout << not unique << endl; n } n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /stack:102400000,102400000 ) n using namespace std; n int lowbit(int x) { return (x & -x); } n template n T_ f_abs(T_ x) { n return x < 0 ? -x : x; n } n template n T_ f_max(T_ a, T_ b) { n return a > b ? a : b; n } n template n T_ f_min(T_ a, T_ b) { n return a < b ? a : b; n } n template n void chkmax(T_ &a, T_ b) { n if (a == -1 || a < b) a = b; n } n template n void chkmin(T_ &a, T_ b) { n if (a == -1 || a > b) a = b; n } n template n T_ gcd(T_ a, T_ b) { n while (T_ t = a % b) a = b, b = t; n return b; n } n template n void f_swap(T_ &a, T_ &b) { n T_ t = a; n a = b; n b = t; n } n const double eps = 1e-9; n const int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1}, n dy[] = {0, 0, -1, 1, -1, 1, -1, 1}; n const int inf = 0x7fffffff; n const int mod = 1000000007; n const int N = 100003; n const int MAXV = 100003; n int n, m, cnt, who[N], dsu[N]; n bool vis[N], tree[N << 2]; n vector > vt[N], qu[N]; n struct Oper { n int tp, x, y; n bool tag; n Oper() {} n Oper(int tp_, int x_, int y_) { n tp = tp_; n x = x_; n y = y_; n } n } op[N]; n struct Edge { n int to, next; n } edg[MAXV << 1]; n int total, idx, root, first[MAXV]; n int siz[MAXV]; n int dep[MAXV]; n int top[MAXV]; n int fa[MAXV]; n int son[MAXV]; n int id[MAXV]; n void Dfs_1(int u) { n int e, v, i; n siz[u] = 1; n son[u] = 0; n for (e = 0; e < (int)vt[u].size(); ++e) { n v = vt[u][e].first; n i = vt[u][e].second; n op[i].tag = !vis[v]; n } n vis[u] = true; n for (e = first[u]; ~e; e = edg[e].next) { n v = edg[e].to; n if (v != fa[u]) { n fa[v] = u; n dep[v] = dep[u] + 1; n Dfs_1(v); n if (son[u] == 0 || siz[v] > siz[son[u]]) son[u] = v; n siz[u] += siz[v]; n } n } n for (e = 0; e < (int)vt[u].size(); ++e) { n v = vt[u][e].first; n i = vt[u][e].second; n if (op[i].tag && !vis[v]) op[i].tag = false; n } n } n void Dfs_2(int u, int tp) { n id[u] = ++idx; n top[u] = tp; n if (son[u] != 0) Dfs_2(son[u], top[u]); n for (int e = first[u]; ~e; e = edg[e].next) { n int v = edg[e].to; n if (v != son[u] && v != fa[u]) Dfs_2(v, v); n } n } n void BuildChain() { n Dfs_1(root); n Dfs_2(root, root); n } n void Build(int l, int r, int root) { n tree[root] = false; n if (l == r) return; n int mid = ((l + r) >> 1); n Build(l, mid, (root << 1)); n Build(mid + 1, r, (root << 1 | 1)); n } n void Update(int p, int l, int r, int root) { n if (l == r) { n tree[root] = true; n return; n } n int mid = ((l + r) >> 1); n if (p <= mid) n Update(p, l, mid, (root << 1)); n else n Update(p, mid + 1, r, (root << 1 | 1)); n tree[root] = (tree[(root << 1)] && tree[(root << 1 | 1)]); n } n bool Query(int L, int R, int l, int r, int root) { n if (L <= l && r <= R) return tree[root]; n int mid = ((l + r) >> 1); n bool res = true; n if (L <= mid) res = (res && Query(L, R, l, mid, (root << 1))); n if (R > mid) res = (res && Query(L, R, mid + 1, r, (root << 1 | 1))); n return res; n } n bool FindChain(int u, int v) { n int u_top = top[u], v_top = top[v], L, R; n while (u_top != v_top) { n if (dep[u_top] < dep[v_top]) { n f_swap(u_top, v_top); n f_swap(u, v); n } n L = id[u_top]; n R = id[u]; n if (!Query(L, R, 1, idx, 1)) return false; n u = fa[u_top]; n u_top = top[u]; n } n if (u != v) { n if (dep[u] > dep[v]) f_swap(u, v); n L = id[son[u]]; n R = id[v]; n if (!Query(L, R, 1, idx, 1)) return false; n } n return true; n } n void addedge(int from, int to) { n edg[total].to = to; n edg[total].next = first[from]; n first[from] = total++; n } n void Init() { n cnt = 0; n root = n + 1; n total = idx = fa[root] = dep[root] = 0; n for (int i = 1; i <= n + 1; ++i) { n first[i] = -1; n dsu[i] = i; n vt[i].clear(); n vis[i] = false; n } n } n void GetData() { n int tp, x, y; n for (int i = 0; i < m; ++i) { n scanf( %d%d , &tp, &x); n if (tp != 2) scanf( %d , &y); n if (tp == 1) { n dsu[x] = y; n addedge(y, x); n } else if (tp == 2) { n y = -1; n who[++cnt] = x; n qu[cnt].clear(); n } else { n vt[x].push_back(make_pair(who[y], i)); n qu[y].push_back(make_pair(x, i)); n } n op[i] = Oper(tp, x, y); n } n } n void Solve() { n int i, j, tp, p; n bool flag; n for (i = 1; i <= n; ++i) { n if (dsu[i] == i) addedge(n + 1, i); n } n BuildChain(); n Build(1, idx, 1); n for (i = cnt = 0; i < m; ++i) { n tp = op[i].tp; n if (tp == 1) n Update(id[op[i].x], 1, idx, 1); n else if (tp == 2) { n ++cnt; n for (j = 0; j < (int)qu[cnt].size(); ++j) { n p = qu[cnt][j].second; n if (op[p].tag) n flag = FindChain(who[cnt], qu[cnt][j].first); n else n flag = false; n vis[p] = flag; n } n } n } n for (i = 0; i < m; ++i) { n if (op[i].tp == 3) puts(vis[i] ? YES : NO ); n } n } n int main() { n while (~scanf( %d%d , &n, &m)) { n Init(); n GetData(); n Solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int arr[111]; n int main() { n int n; n scanf( %d , &n); n arr[0] = 0; n for (int i = (1); i < (n + 1); ++i) scanf( %d , &arr[i]); n int ans = 0; n if (n % 2 == 0 || n == 1) { n printf( -1 n ); n return 0; n } n for (int i = n; i >= 1; i -= 2) { n int tmp = max(arr[i], arr[i - 1]); n ans += tmp; n arr[i] = arr[i - 1] = 0; n arr[(i - 1) / 2] = max(0, arr[(i - 1) / 2] - tmp); n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n namespace {}; n int sgn(int x) { return x >= 0 ? 1 : -1; } n int arr[200001]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n, k; n cin >> n >> k; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n arr[i] = sgn(arr[i]); n if (arr[i] == -1) k--; n } n if (k < 0) { n cout << -1 n ; n return 0; n } n vector> segs; n int flips = 0; n int curr = 1, c = 0; n for (int i = 0; i < n; i++) { n if (arr[i] == curr) n c++; n else { n flips++; n if (curr == 1 && i - c > 0) segs.emplace_back(c, -2); n c = 1; n curr = arr[i]; n } n } n for (auto seg : segs) { n ; n } n sort(segs.begin(), segs.end()); n ; n for (auto seg : segs) { n if (seg.first > k) break; n k -= seg.first; n flips += seg.second; n } n if (curr == 1 && c > 0) { n if (k >= c) flips--; n } n if (flips < 0) flips = 0; n cout << flips << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct info { n long long fs, sm, id; n } bd[100001]; n int cmp(info a, info b) { return a.fs < b.fs; } n int main() { n ios_base::sync_with_stdio(0); n long long int i, j, x, n, cnt = 0, m, y, k, ans = 0, cf, cm, a, rr1 = 0, l, r, n md, r1, r2, xxx, flg; n cin >> n >> a >> cf >> cm >> m; n long long in[n + 1], bs[n + 1]; n for (i = 1; i <= n; i++) { n cin >> in[i]; n bd[i].fs = a - in[i]; n bd[i].id = i; n bs[i] = a - in[i]; n } n sort(bd + 1, bd + 1 + n, cmp); n sort(bs + 1, bs + 1 + n); n for (i = 2; i <= n; i++) { n bd[i].fs += bd[i - 1].fs; n } n bd[n].sm = 0; n for (i = n - 1; i >= 1; i--) { n x = abs(in[bd[i + 1].id] - in[bd[i].id]); n bd[i].sm = bd[i + 1].sm + x * (n - i); n } n bd[0].fs = bd[0].id = 0; n bd[0].sm = (a - in[bd[1].id]) * n + bd[1].sm; n for (i = 1; i <= n; i++) { n if (bs[i] > 0) break; n cnt++; n } n ans = cnt * cf + cm * in[bd[n].id]; n for (i = n; i >= 0; i--) { n x = m; n y = cnt * cf; n rr1 = cnt; n flg = 0; n if (x >= bd[i].fs) { n flg = 1; n y = i * cf; n x -= bd[i].fs; n rr1 = i; n } n l = i; n r = n; n while (r - l > 1) { n md = (l + r) / 2; n if (bd[md].sm > x) n l = md; n else n r = md; n } n if (bd[l].sm <= x && i != 0) r = l; n x -= bd[r].sm; n if (r == i && flg) { n if (i == n) { n y = a * cm + n * cf; n if (ans <= y) { n ans = y; n r1 = n; n r2 = n + 1; n } n } else { n y += cm * (min(a, in[bd[r].id] + x / (n - r))); n if (ans <= y) { n ans = y; n r1 = i; n xxx = min(a, in[bd[r].id] + x / (n - r)); n r2 = i + 1; n } n } n continue; n } n if (r - 1 > 0) n y += cm * (min(a, min(in[bd[r - 1].id], in[bd[r].id] + x / (n - r + 1)))); n else n y += cm * (min(a, in[bd[r].id] + x / (n - r + 1))); n if (y >= ans) { n ans = y; n r1 = rr1; n r2 = r; n if (r - 1 > 0) n xxx = min(a, min(in[bd[r - 1].id], in[bd[r].id] + x / (n - r + 1))); n else n xxx = min(a, in[bd[r].id] + x / (n - r + 1)); n } n } n for (i = 1; i <= r1; i++) { n in[bd[i].id] = a; n } n for (i = r2; i <= n; i++) { n in[bd[i].id] = xxx; n } n cout << ans << endl; n for (i = 1; i <= n; i++) cout << in[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n vector a(n); n vector b(n); n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n for (int i = 0; i < n; i++) { n cin >> b[i]; n } n long long int cnt = 0; n long long int min_a = *min_element(a.begin(), a.end()); n long long int min_b = *min_element(b.begin(), b.end()); n for (int i = 0; i < n; i++) { n if (a[i] > min_a && b[i] > min_b) { n long long int num; n num = min(a[i] - min_a, b[i] - min_b); n cnt += num; n a[i] -= num; n b[i] -= num; n } n } n for (int i = 0; i < n; i++) { n cnt += (a[i] - min_a); n cnt += (b[i] - min_b); n } n cout << cnt << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n template n string to_string(pair p); n template n string to_string(tuple p); n template n string to_string(tuple p); n string to_string(const string& s) { return + s + ; } n string to_string(const char* s) { return to_string((string)s); } n string to_string(bool b) { return (b ? true : false ); } n string to_string(vector v) { n bool first = true; n string res = { ; n for (int i = 0; i < static_cast(v.size()); i++) { n if (!first) { n res += , ; n } n first = false; n res += to_string(v[i]); n } n res += } ; n return res; n } n template n string to_string(bitset v) { n string res = ; n for (size_t i = 0; i < N; i++) { n res += static_cast( 0 + v[i]); n } n return res; n } n template n string to_string(A v) { n bool first = true; n string res = { ; n for (const auto& x : v) { n if (!first) { n res += , ; n } n first = false; n res += to_string(x); n } n res += } ; n return res; n } n template n string to_string(pair p) { n return ( + to_string(p.first) + , + to_string(p.second) + ) ; n } n template n string to_string(tuple p) { n return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + n to_string(get<2>(p)) + ) ; n } n template n string to_string(tuple p) { n return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + n to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; n } n void debug_out() { cerr << endl; } n template n void debug_out(Head H, Tail... T) { n cerr << << to_string(H); n debug_out(T...); n } n class dsu { n public: n vector p; n int n; n dsu(int _n) : n(_n) { n p.resize(n); n iota(p.begin(), p.end(), 0); n } n inline int get(int x) { return (x == p[x] ? x : (p[x] = get(p[x]))); } n inline bool unite(int x, int y) { n x = get(x); n y = get(y); n if (x != y) { n p[x] = y; n return true; n } n return false; n } n }; n const int MAX = 100010; n int bound[MAX]; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int tt; n cin >> tt; n assert(1 <= tt && tt <= 1000); n int x = 0; n while (tt--) { n int n; n cin >> n; n if (n == 0) { n continue; n } n assert(n >= 1); n vector v(n); n for (int i = 0; i < n; i++) { n cin >> v[i]; n } n sort(v.begin(), v.end()); n v.resize(unique(v.begin(), v.end()) - v.begin()); n n = (int)v.size(); n for (int i = 0; i < n - 1; i++) { n assert(v[i] < v[i + 1]); n } n assert(0 <= v[0]); n assert(v[n - 1] <= 100000); n { n int ptr = -1; n for (int val = 0; val < MAX; val++) { n if (ptr + 1 < n && v[ptr + 1] == val) { n ++ptr; n } n bound[val] = ptr; n } n } n vector> who(1, vector(n, -1)); n vector d(1, dsu(n + 1)); n vector seen; n for (int i = n - 1; i >= 0; i--) { n int start = 0; n int j = 0; n while (start < i) { n if (j == (int)who.size()) { n who.emplace_back(n, -1); n d.emplace_back(n + 1); n } n int finish = i - 1; n int tmp = who[j][i]; n if (tmp != -1) { n int val = v[i] - (v[tmp] - v[i]); n finish = (val < 0 ? -1 : bound[val]); n } n if (start <= finish) { n int pos = d[j].get(start); n while (pos <= finish) { n who[j][pos] = i; n d[j].unite(pos, pos + 1); n pos = d[j].get(pos); n } n start = finish + 1; n } n ++j; n } n int g = 0; n while (g < (int)who.size() && who[g][i] != -1) { n ++g; n } n if (g >= (int)seen.size()) { n seen.resize(g + 1); n } n seen[g] = true; n } n int g = 0; n while (g < (int)seen.size() && seen[g]) { n ++g; n } n x ^= g; n 42; n } n cout << (x > 0 ? YES : NO ) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 5; n long long n, num; n long long a[maxn]; n long long vis[maxn]; n priority_queue pq; n void fnd(long long x) { n if (vis[a[x]] == 0) { n vis[a[x]] = 1; n num++; n fnd(a[x]); n } else n return; n } n int main() { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n } n memset(vis, 0, sizeof(vis)); n for (int i = 1; i <= n; i++) { n num = 1; n if (vis[i] == 0) { n vis[i] = 1; n fnd(i); n pq.push(num); n } n } n long long t = pq.top(); n pq.pop(); n if (!pq.size()) { n cout << t * t << endl; n } else { n t += pq.top(); n pq.pop(); n long long ans = t * t; n while (pq.size()) { n t = pq.top(); n pq.pop(); n ans += t * t; n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 1e5 + 5; n vector adj[maxN]; n int s[maxN], par[maxN]; n void dfs(int n, int p) { n par[n] = p; n for (int i = int(0); i < int((int)adj[n].size()); i++) { n if (adj[n][i] != p) dfs(adj[n][i], n); n } n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0), n cout.precision(15); n int n, tmp; n cin >> n; n for (int i = int(0); i < int(n - 1); i++) { n cin >> tmp; n tmp -= 1; n adj[tmp].push_back(i + 1); n } n dfs(0, -1); n for (int i = int(0); i < int(n); i++) { n cin >> s[i]; n } n long long ans = s[0]; n for (int i = int(0); i < int(n); i++) { n if (s[i] == -1) { n int n = i, tt = s[par[i]]; n int mini = 2000000000; n for (int j = int(0); j < int((int)adj[n].size()); j++) { n if (s[adj[n][j]] < tt) { n cout << -1; n return 0; n } n mini = min(mini, s[adj[n][j]] - tt); n } n if (mini != 2000000000) ans += mini; n for (int j = int(0); j < int((int)adj[n].size()); j++) { n ans += s[adj[n][j]] - tt - mini; n } n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000000001; n const long double EPS = 1e-9; n const int MOD = 1000000007; n const long long LLINF = 1000000000000000001; n const int maxn = 1042; n int n; n int a[maxn]; n char ans[maxn][maxn]; n bool good[maxn]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n for (int j = 1; j <= n; j++) ans[i][j] = . ; n } n bool none = true; n for (int i = 1; i <= n; i++) n if (a[i] != i) none = false; n if (none) n cout << n << n ; n else { n cout << n - 1 << n ; n int mostleft = 1; n while (a[mostleft] == mostleft) { n good[mostleft] = true; n mostleft++; n } n int row = 1; n int z = mostleft; n good[z] = true; n z = a[z]; n while (!good[z]) { n good[z] = true; n char mirror = (z < a[z]) ? / : ; n ans[row][z] = mirror; n ans[row][a[z]] = mirror; n row++; n z = a[z]; n } n good[z] = true; n for (int i = mostleft + 1; i <= n; i++) { n if (a[i] != i && !good[i]) { n int firstrow = row; n z = i; n while (a[z] > z) z = a[z]; n z = a[z]; n good[z] = true; n row++; n z = a[z]; n while (!good[z]) { n good[z] = true; n char mirror = (z < a[z]) ? / : ; n ans[row][z] = mirror; n ans[row][a[z]] = mirror; n row++; n z = a[z]; n } n ans[row - 1][mostleft] = ; n ans[firstrow][mostleft] = / ; n ans[firstrow][a[z]] = / ; n } n } n } n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) cout << ans[i][j]; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int h[n]; n for (int i = 0; i < n; i++) cin >> h[i]; n int max; n int a[n]; n a[n - 1] = 0; n max = h[n - 1]; n for (int i = n - 2; i >= 0; i--) { n if (h[i] > max) { n a[i] = 0; n max = h[i]; n } else { n a[i] = max - h[i] + 1; n } n } n for (int i = 0; i < n; i++) { n printf( %d , a[i]); n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int x = 0, f = 1; n char c; n do c = getchar(), f = c == - ? -1 : f; n while (!isdigit(c)); n do x = (x << 3) + (x << 1) + c - 0 , c = getchar(); n while (isdigit(c)); n return x * f; n } n struct Point { n int x, y, px, py, id; n Point() {} n Point(int x, int y, int px, int py) : x(x), y(y), px(px), py(py) {} n } a[55], ans[100020]; n bool tab[55]; n int b[55][55], d[55][55]; n int n, m, cnt, tmp = 1, num; n inline void Move(Point &a, int x, int y) { n assert(!b[a.x + x][a.y + y]); n b[a.x + x][a.y + y] = b[a.x][a.y]; n b[a.x][a.y] = 0; n ans[++cnt] = Point(a.x, a.y, a.x + x, a.y + y); n a.x += x; n a.y += y; n } n inline void Move_to(Point &a, int pos) { n Move(a, 1, 0); n while (a.y < pos) Move(a, 0, 1); n while (a.y > pos) Move(a, 0, -1); n Move(a, -1, 0); n } n inline void Swap(Point &a, Point &b) { n if (a.id == b.id) return; n if (n == 2) { n if (a.y < b.y) n Move(a, 1, 0), Move(b, 0, -1), Move(a, 0, 1), Move(a, -1, 0); n else n Move(a, 1, 0), Move(b, 0, 1), Move(a, 0, -1), Move(a, -1, 0); n return; n } n Move(a, 1, 0); n Move(b, 1, 0); n Move(b, 1, 0); n int t = a.y; n while (a.y > b.y) Move(a, 0, -1); n while (a.y < b.y) Move(a, 0, 1); n while (b.y > t) Move(b, 0, -1); n while (b.y < t) Move(b, 0, 1); n Move(a, -1, 0); n Move(b, -1, 0); n Move(b, -1, 0); n } n inline void Move1(Point &a, int x) { n while (a.x <= tmp) Move(a, 1, 0); n while (a.y > x) Move(a, 0, -1); n while (a.y < x) Move(a, 0, 1); n while (!b[a.x - 1][a.y]) Move(a, -1, 0); n tmp = max(tmp, a.x); n } n inline void Move2(Point &a, int y) { n while (a.x < y) Move(a, 1, 0); n } n int main() { n n = read(); n m = read(); n if (n == 1) return printf( 0 ), 0; n assert(m <= n); n for (int i = 1; i <= m; i++) { n a[i].x = read(); n a[i].y = read(); n a[i].id = b[a[i].x][a[i].y] = i; n } n for (int i = 1; i <= m; i++) { n a[i].px = read(); n a[i].py = read(); n d[a[i].px][a[i].py] = i; n } n for (int i = 0; i <= n + 1; i++) n b[i][0] = b[0][i] = b[n + 1][i] = b[i][n + 1] = 2147483647; n for (int i = 1; i <= n; i++) n for (int j = n; j >= 1; j--) { n if (!b[i][j]) continue; n int t = b[i][j]; n while (!b[i][a[t].y + 1]) Move(a[t], 0, 1); n } n for (int i = 1; i <= n; i++) n for (int j = 1; j <= n; j++) { n if (!b[i][j]) continue; n num++; n int t = b[i][j]; n assert(a[t].y >= num); n while (a[t].y > num) Move(a[t], 0, -1); n while (a[t].x > 1) Move(a[t], -1, 0); n } n for (int i = 1; i <= n; i++) n for (int j = 1; j <= n; j++) n if (d[i][j] && !tab[j]) { n tab[j] = true; n if (b[1][j]) n Swap(a[b[1][j]], a[d[i][j]]); n else n Move_to(a[d[i][j]], j); n } n for (int j = 1; j <= n; j++) n for (int i = 1; i <= n; i++) n if (d[i][j]) Move1(a[d[i][j]], j); n for (int i = n; i >= 1; i--) n for (int j = n; j >= 1; j--) n if (d[i][j]) Move2(a[d[i][j]], i); n printf( %d n , cnt); n for (int i = 1; i <= cnt; i++) n printf( %d %d %d %d n , ans[i].x, ans[i].y, ans[i].px, ans[i].py); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 50 + 5, maxL = (1 << 20) + 10; n int N, L; n char s[maxn][25]; n bool vis[maxL]; n long double F[maxL], R[25]; n long long dask[maxL]; n bool check(int tt, int k) { n if (dask[tt] & (1LL << k)) n return false; n else n return true; n } n long double dfs(int tt, int g) { n if (g == 0) return 0.0; n if (vis[tt]) return F[tt]; n long double ret = 0.0; n long double step = L - g + 1; n for (int i = 0; i < L; i++) { n if ((1 << i) & tt) continue; n int nt = (1 << i) | tt; n int wq = __builtin_popcountll(dask[nt] ^ dask[tt]); n ret += step * R[g] * wq; n ret += dfs(nt, g - 1); n } n vis[tt] = true; n F[tt] = ret; n return ret; n } n void Prepare() { n memset(dask, 0, sizeof(dask)); n for (int i = (1), _i = (N); i <= _i; i++) n for (int j = (i + 1), _j = (N); j <= _j; j++) { n int same = 0; n for (int k = 0; k < L; k++) n if (s[i][k] == s[j][k]) same |= (1 << k); n dask[same] |= (1LL << j) | (1LL << i); n } n for (int i = (1 << L) - 1; i; i--) n for (int k = 0; k < L; k++) n if (i & (1 << k)) dask[i ^ (1 << k)] |= dask[i]; n } n int main() { n for (; scanf( %d , &N) != EOF;) { n for (int i = (1), _i = (N); i <= _i; i++) scanf( %s , s[i]); n L = strlen(s[1]); n int gg = L; n R[L] = 1.0 / (long double)L; n for (int i = (L - 1), _i = (1); i >= _i; i--) { n gg--; n R[i] = R[i + 1] / (long double)gg; n } n memset(vis, 0, sizeof(vis)); n long double ans = 0.0; n Prepare(); n ans = dfs(0, L); n ans /= (long double)N; n printf( %.15lf n , (double)ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int tot, n; n int vis[110]; n int p[110]; n int dp[2][262144], cs[110][262144], pre[110][262144]; n int have[100]; n int a[110], b[110]; n string print(int sta) { n string x = ; n for (int i = tot - 1; i >= 0; i--) { n if (sta & (1 << i)) n x += 1 ; n else n x += 0 ; n } n return x; n } n int main() { n for (int i = 2; i <= 59; i++) { n if (!vis[i]) p[tot++] = i; n for (int j = i; j <= 59; j += i) vis[j] = 1; n } n for (int i = 1; i <= 59; i++) { n for (int j = 0; j < tot; j++) { n if (i % p[j] == 0) have[i] |= (1 << j); n } n } n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n } n memset(dp, 0x3f, sizeof(dp)); n dp[0][0] = 0; n register int tmp; n register int nowt = 1, pret = 0; n for (int i = 1; i <= n; i++) { n for (int sta = 0; sta < (1 << tot); sta++) { n dp[nowt][sta] = 0x3f3f3f3f; n for (int j = 1; j <= 59; j++) { n if ((have[j] & sta) != have[j]) continue; n tmp = dp[pret][have[j] ^ sta] + abs(j - a[i]); n if (tmp < dp[nowt][sta]) { n dp[nowt][sta] = tmp; n pre[i][sta] = have[j] ^ sta; n cs[i][sta] = j; n } n } n } n nowt ^= 1; n pret ^= 1; n } n int mi = 0x3f3f3f3f; n for (int i = 0; i < (1 << tot); i++) { n mi = min(mi, dp[pret][i]); n } n int pp; n for (int i = 0; i < (1 << tot); i++) { n if (mi == dp[pret][i]) { n pp = i; n for (int now = n; now >= 1; now--) { n b[now] = cs[now][pp]; n pp = pre[now][pp]; n } n for (int now = 1; now <= n; now++) { n printf( %d , b[now]); n } n puts( ); n return 0; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, a, b; n cin >> n >> a >> b; n int c[100]; n for (int i = 0; i < n; i++) cin >> c[i]; n int ans = 0; n int min = a > b ? b : a; n for (int i = 0; i < n / 2; i++) { n if (c[i] == 0 && c[n - 1 - i] == 2 || c[i] == 2 && c[n - 1 - i] == 0) n ans += a; n else if (c[i] == 1 && c[n - 1 - i] == 2 || c[i] == 2 && c[n - 1 - i] == 1) n ans += b; n else if (c[i] == 2 && c[n - 1 - i] == 2) n ans += min * 2; n else if (c[i] == 0 && c[n - 1 - i] == 1 || c[i] == 1 && c[n - 1 - i] == 0) { n cout << -1 << endl; n return 0; n } n } n if (n % 2 == 1 && c[n / 2] == 2) ans += min; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void read(long long a = 0) { n freopen( in , r , stdin); n if (a) freopen( out , w , stdout); n } n long long a[100009 * 10], b[100009 * 10]; n long long n, m; n bool bs(long long num) { n bool vis[100009 * 10] = {}; n long long space = 0; n for (int i = num; i >= 0; i--) { n if (a[i] && !vis[a[i]]) { n vis[a[i]] = 1; n space += b[a[i] - 1]; n } else { n space--; n space = max(space, 0ll); n } n } n for (int i = 1; i <= m; i++) n if (!vis[i]) return 0; n if (space == 0) n return 1; n else n return 0; n } n int main() { n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < m; i++) cin >> b[i]; n long long lo = 0, hi = n + 1; n while (lo < hi) { n long long mid = (lo + hi - 1) >> 1; n if (bs(mid)) n hi = mid; n else n lo = mid + 1; n } n if (hi == n + 1) n cout << -1 ; n else n cout << hi + 1; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 9; n const int N = 4040; n int n, w, b; n long long fac[N], f[N][N], inv[N]; n long long qpow(long long x, long long p) { n long long res = 1ll; n while (p) { n if (p & 1) { n res = (res * x) % mod; n } n x = (x * x) % mod; n p >>= 1; n } n return res; n } n long long INV(long long k) { return qpow(k, mod - 2); } n long long calc(int x, int y) { n return fac[x] * inv[y] % mod * inv[x - y] % mod; n } n void init() { n fac[0] = 1ll; n inv[0] = 1ll; n for (int i = 1; i < N; i++) { n fac[i] = (fac[i - 1] * 1ll * i) % mod; n inv[i] = INV(fac[i]); n } n } n int main() { n scanf( %d%d%d , &n, &w, &b); n init(); n for (int i = 1; i <= n; i++) { n for (int j = i; j < N; j++) { n f[i][j] = (fac[j] * calc(j - 1, i - 1)) % mod; n } n } n long long ans = 0; n for (int i = 1; i < n - 1; i++) { n ans = n (ans + f[n - i][w] * f[i][b] % mod * (1ll * n - 1ll * i - 1ll) % mod) % n mod; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long f(string s, long long m) { n map a; n map::iterator ii; n long long i; n for (i = 0; i < s.size(); i++) { n a[s[i]]++; n } n long long best = 0; n for (ii = a.begin(); ii != a.end(); ii++) best = max(best, ii->second); n long long p = s.size(); n if (best == p && m == 1) return p - 1; n return min(p, best + m); n } n int main() { n string s1, s2, s3; n long long n; n cin >> n; n cin >> s1 >> s2 >> s3; n if (f(s1, n) > f(s2, n) && f(s1, n) > f(s3, n)) { n cout << Kuro ; n return 0; n } n if (f(s2, n) > f(s1, n) && f(s2, n) > f(s3, n)) { n cout << Shiro ; n return 0; n } n if (f(s3, n) > f(s1, n) && f(s3, n) > f(s2, n)) { n cout << Katie ; n return 0; n } n cout << Draw ; n return 0; n } n "} +{"func_code_string": "#include n template n void rd(T &x) { n x = 0; n int f = 1; n char c; n while (!isdigit(c = getchar())) n if (c == - ) f = -1; n do { n x = (x << 3) + (x << 1) + (c ^ 48); n } while (isdigit(c = getchar())); n x *= f; n } n using namespace std; n const int N = 1e5 + 5; n int n, dp[N], s[N], p[N], cnt, tp; n map Map[N]; n int main() { n rd(n); n for (int i = 1; i <= n; i++) { n int v, c, l, r; n rd(v), rd(c), rd(l), rd(r); n if (r + c <= 1e5 && (!l || Map[l].find(r + c) != Map[l].end())) { n int t = Map[l][r + c]; n dp[i] = dp[t] + v; n p[i] = t; n if (!r && dp[i] > dp[tp]) tp = i; n if (dp[i] > dp[Map[l + c][r]]) Map[l + c][r] = i; n } n } n while (tp) s[++cnt] = tp, tp = p[tp]; n printf( %d n , cnt); n for (; cnt > 0; cnt--) printf( %d , s[cnt]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, v1, v2, L; n bool can(double m) { n double bus = 0, nbus = 0; n for (int i = 0; i < (n + k - 1) / k; i++) { n if (i == 0) n bus += m * v2; n else n bus += m * v1; n nbus += m * v1; n if (bus > L) return false; n double sb = (bus - nbus) / (v1 + v2); n bus += sb * v1; n nbus += sb * v1; n } n return true; n } n int main() { n scanf( %d%d%d%d%d , &n, &L, &v1, &v2, &k); n double l = 0, r = (double)L / v2, m; n for (int i = 0; i < 100; i++) { n m = (l + r) / 2.0; n if (can(m)) n l = m; n else n r = m; n } n printf( %.12f , m + (L - m * v2) / v1); n } n "} +{"func_code_string": "#include n using namespace std; n inline long long Calc(const int &x) { n long long res = 0; n for (long long i = 1; i <= x; i *= 10) res += x - i + 1; n return res; n } n inline long long CalcSum(const int &x) { n long long res = 0; n for (long long i = 1; i <= x; i *= 10) n res += 1ll * (x - i + 1) * (x - i + 2) / 2; n return res; n } n inline int Pos(const int &x, const int &k) { n stringstream ss; n ss << x; n string s; n ss >> s; n return s[k - 1] - 0 ; n } n inline int Solve(long long k) { n int l = 1, r = 1000000000; n while (l <= r) { n int mid = (l + r) / 2; n if (CalcSum(mid) >= k) n r = mid - 1; n else n l = mid + 1; n } n k = k - CalcSum(r); n int block = l; n l = 1; n r = block; n while (l <= r) { n int mid = (l + r) / 2; n if (Calc(mid) >= k) n r = mid - 1; n else n l = mid + 1; n } n return Pos(l, k - Calc(r)); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int q; n cin >> q; n while (q--) { n long long k; n cin >> k; n cout << Solve(k) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n const int INF = 1e9; n using namespace std; n void dfs(int v, int p, vector > &graph, vector &sz) { n sz[v] = 1; n for (auto u : graph[v]) n if (u != p) { n dfs(u, v, graph, sz); n sz[v] += sz[u]; n } n } n void dfs(int v, int p, vector > &graph, vector &c, int C) { n c[v] = C; n for (auto u : graph[v]) n if (u != p) { n dfs(u, v, graph, c, C); n } n } n signed main() { n int n; n cin >> n; n vector > graph(n); n for (int i = 0; i < n - 1; i++) { n int a, b; n cin >> a >> b; n a--, b--; n graph[a].push_back(b); n graph[b].push_back(a); n } n vector sz(n); n dfs(0, 0, graph, sz); n vector cen; n long long ans = 0; n for (int i = 0; i < n; i++) { n if ((n - sz[i]) * 2 <= n) { n int t = 1; n for (auto u : graph[i]) { n if (sz[u] < sz[i]) { n if (2 * sz[u] <= n) continue; n t = 0; n } n } n if (t) cen.push_back(i); n } n } n for (int i = 0; i < n; i++) { n ans += 2 * min(sz[i], n - sz[i]); n } n cout << ans << n ; n if (cen.size() == 2) { n int v = cen[0], u = cen[1]; n vector c(n); n dfs(v, u, graph, c, 0); n dfs(u, v, graph, c, 1); n vector p0, p1; n for (int i = 0; i < n; i++) { n if (c[i] == 0) p0.push_back(i); n if (c[i] == 1) p1.push_back(i); n } n vector ans(n); n for (int i = 0; i < n / 2; i++) { n ans[p0[i]] = p1[i]; n ans[p1[i]] = p0[i]; n } n for (int i = 0; i < n; i++) { n cout << ans[i] + 1 << ; n } n return 0; n } else { n dfs(cen[0], cen[0], graph, sz); n int C = 0, idC = 0; n vector c(n); n c[cen[0]] = -1; n int maxsz = 0; n for (auto u : graph[cen[0]]) { n dfs(u, cen[0], graph, c, C); n maxsz = max(maxsz, sz[u]); n if (maxsz == sz[u]) idC = C; n C++; n } n vector > q; n for (int i = 0; i < n; i++) { n if (i != cen[0] && c[i] != idC) q.push_back({c[i], i}); n } n for (int i = 0; i < n; i++) { n if (i != cen[0] && c[i] == idC) q.push_back({INF, i}); n } n q.push_back({INF + 1, cen[0]}); n sort((q).begin(), (q).end()); n vector ans(n); n for (int i = 0; i < n; i++) { n ans[q[i].second] = q[(i + maxsz) % q.size()].second; n } n for (int i = 0; i < n; i++) { n assert(c[ans[i]] != c[i]); n cout << ans[i] + 1 << ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e5; n int n; n double a[MAXN], b[4], t; n int main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n cin >> n; n b[3] = 1; n for (int i = 1; i <= n; i++) { n cin >> t; n b[0] += t; n b[1]++; n if (b[1] * b[2] <= b[0] * b[3]) b[2] = b[0], b[3] = b[1]; n } n cout << fixed << setprecision(10) << b[2] / b[3] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x0f0f0f0f; n template n inline pair MP(S a, T b) { n return make_pair(a, b); n } n template n inline auto LX(T &X) -> decltype((X.first)) { n return X.first; n } n template n inline auto LX(const T &X) -> const decltype((X.first)) { n return X.first; n } n template n inline auto RX(T &X) -> decltype((X.second)) { n return X.second; n } n template n inline auto RX(const T &X) -> const decltype((X.second)) { n return X.second; n } n template n inline void RST(T &a) { n memset(a, 0, sizeof(a)); n } n template n inline void RST1(T &a) { n memset(a, -1, sizeof(a)); n } n template n inline void SINF(T &a) { n memset(a, 0x0f, sizeof(a)); n } n template n inline void RST(S &a, T b) { n fill((T *)a, (T *)a + (sizeof(a) / sizeof(b)), b); n } n template n inline void CLR(T &a) { n a.clear(); n } n template n inline void CPY(S &a, T &b) { n memcpy(a, b, sizeof(a)); n } n template n inline bool chkmin(S &a, T b) { n return b < a ? a = b, 1 : 0; n } n template n inline bool chkmax(S &a, T b) { n return a < b ? a = b, 1 : 0; n } n template n inline T sqr(T x) { n return x * x; n } n template n inline int SZ(T &a) { n return (int)(a.size()); n } n template n inline bool EPT(T &a) { n return a.empty(); n } n template n inline auto FRT(T &a) -> decltype((a.front())) { n return a.front(); n } n template n inline auto FRT(const T &a) -> const decltype((a.front())) { n return a.front(); n } n template n inline auto BK(T &a) -> decltype(a.back()) & { n return a.back(); n } n template n inline auto BK(const T &a) -> const decltype((a.back())) { n return a.back(); n } n template n inline auto TOP(T &a) -> decltype((a.top())) { n return a.top(); n } n template n inline auto TOP(const T &a) -> const decltype((a.top())) { n return a.top(); n } n int n, m, f[1010], g[1010], cnt; n char buf[1010]; n double ans; n void solve(int *c, int n, int m) { n int s = 0; n for (int i = 1; i <= n; i++) n if (c[i]) { n s += c[i] - 1, ans += (double)s * (m - c[i]); n if (!c[i + 1] || c[i + 1] < c[i]) s = 0; n } n s = 0; n for (int i = 1; i <= n; i++) n if (c[i]) { n ans += (double)s * (c[i] - 1); n s += m - c[i]; n if (!c[i + 1] || c[i + 1] > c[i]) s = 0; n } n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) { n scanf( %s , buf + 1); n for (int j = 1; j <= m; j++) n if (buf[j] == X ) f[i] = j, g[j] = i, cnt++; n } n solve(f, n, m); n solve(g, m, n); n ans *= 2; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= i; j++) n ans += 1. * (m - (f[i] ? 1 : 0)) * (m - (f[j] ? 1 : 0)) * (i - j); n for (int i = 1; i <= m; i++) n for (int j = 1; j <= i; j++) n ans += 1. * (n - (g[i] ? 1 : 0)) * (n - (g[j] ? 1 : 0)) * (i - j); n ans *= 2; n ans /= sqr((double)n * m - cnt); n printf( %.10lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int arr[101][1001]; n int n, m; n int g[101][101]; n vector col[1001]; n set row[101]; n bool ans[101][101]; n int main() { n scanf( %d , &n), scanf( %d , &m); n for (int i = 0; i < m; ++i) { n int x, y; n scanf( %d , &x), scanf( %d , &y); n g[x][y] = g[y][x] = 1; n } n for (int i = 1; i <= n; ++i) g[i][i] = true; n for (int i = 1; i <= n; ++i) { n for (int j = i + 1; j <= n; ++j) { n if (g[i][j] && !ans[i][j]) { n for (int k = 0; k < 1001; ++k) n if (col[k].size() == 0) { n arr[i][k] = i; n arr[j][k] = j; n col[k].push_back(i), col[k].push_back(j); n break; n } else { n bool ok = true; n for (int l = 0; l < col[k].size(); ++l) { n int cur = col[k][l]; n if (!g[cur][i] || !g[cur][j]) { n ok = false; n break; n } n } n if (ok) { n arr[i][k] = i; n arr[j][k] = j; n for (int l = 0; l < col[k].size(); ++l) { n int cur = col[k][l]; n ans[cur][i] = ans[i][cur] = ans[j][cur] = ans[cur][j] = true; n } n col[k].push_back(i), col[k].push_back(j); n break; n } n } n ans[i][j] = true; n ans[j][i] = true; n } n } n } n for (int i = 0; i < 1001; ++i) n for (int j = 0; j < col[i].size(); ++j) row[col[i][j]].insert(i); n for (int i = 1; i < 101; ++i) n if (row[i].size() == 0) { n for (int j = 0; j < 1001; ++j) n if (col[j].size() == 0) { n col[j].push_back(i); n row[i].insert(j); n break; n } n } n for (int i = 1; i <= n; ++i) { n printf( %d n , row[i].size()); n for (set::iterator it = row[i].begin(); it != row[i].end(); ++it) n printf( %d %d n , i, (*it) + 1); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, p1, p2; n cin >> n; n cin >> p1; n int a1[p1]; n for (int i = 0; i < p1; i++) cin >> a1[i]; n cin >> p2; n int a2[p2]; n for (int i = 0; i < p2; i++) cin >> a2[i]; n sort(a1, a1 + p1); n sort(a2, a2 + p2); n vector::iterator it; n vector res(100); n it = set_union(a1, a1 + p1, a2, a2 + p2, res.begin()); n res.resize(it - res.begin()); n if (res.size() == n) n cout << I become the guy. ; n else n cout << Oh, my keyboard! ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int v[5], p[5]; n int cnt[5], add[5]; n int getMaxScr(int acc, int tot) { n int MaxScr; n for (int i = 0; i < 6; i++) { n int t = 1 << i; n if (tot >= t * acc) MaxScr = (i + 1) * 500; n } n return MaxScr; n } n bool ok(int m) { n int vScr = 0, pScr = 0; n for (int i = 0; i < 5; i++) { n int MaxScr = getMaxScr(cnt[i] + m * add[i], n + m); n if (v[i] != -1) vScr += MaxScr / 250 * (250 - v[i]); n if (p[i] != -1) pScr += MaxScr / 250 * (250 - p[i]); n } n return vScr > pScr; n } n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n for (int j = 0; j < 5; j++) { n int t; n cin >> t; n if (i == 0) v[j] = t; n if (i == 1) p[j] = t; n if (t != -1) cnt[j]++; n } n } n for (int i = 0; i < 5; i++) n if (v[i] != -1 && p[i] != -1 && p[i] < v[i]) add[i] = 1; n int ans = 0; n while (!ok(ans) && ans < 100000) ans++; n cout << (ans == 100000 ? -1 : ans) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long big = 1000000007; n unsigned long long gcd(unsigned long long a, unsigned long long b) { n if (a == 0) return b; n return gcd(b % a, a); n } n string getbin(unsigned long long x) { n if (x == 0) return 0 ; n string ret = ; n while (x != 0) { n ret = (char)( 0 + x % 2) + ret; n x /= 2; n } n return ret; n } n unsigned long long getdec(string b) { n unsigned long long ret = 0; n for (int i = 0; i < b.size(); i += 1) { n ret *= 2; n ret += b[i] - 0 ; n } n return ret; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n long long n; n cin >> n; n long long s = 0; n vector a(n); n for (int i = 0; i < n; i += 1) cin >> a[i], s += a[i]; n bool b = false; n for (int i = 0; !b && i < n; i += 1) { n if (a[i] > s / 2) b = true; n } n if (b) n cout << T ; n else if (s % 2 == 0) n cout << HL ; n else n cout << T ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int d[10]; n d[0] = 1; n d[1] = 5; n d[2] = 10; n d[3] = 25; n d[4] = 50; n d[5] = 100; n d[6] = 500; n d[7] = 1000; n d[8] = 5000; n d[9] = 10000; n int a[1000009]; n a[0] = 1; n for (int j = 0; j < 10; j++) { n for (int i = 1; i <= 1000000; i++) { n if (i - d[j] >= 0) { n a[i] += a[i - d[j]]; n } n if (a[i] == n) { n printf( %d %d n , i, j + 1); n for (int k = 0; k <= j; k++) { n printf( %d , d[k]); n } n return 0; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n inline long long read() { n long long x = 0, f = 0; n char ch = getchar(); n for (; ch < 0 || ch > 9 ; ch = getchar()) f ^= (ch == - ); n for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; n return f ? -x : x; n } n const long long maxn = 200050; n long long n, head[maxn], cnt = 0, siz[maxn], dep[maxn]; n long long ans = 0, qwq = 0; n struct node { n long long to, nxt; n } e[maxn * 2]; n inline void add(long long u, long long v) { n e[++cnt].to = v; n e[cnt].nxt = head[u]; n head[u] = cnt; n } n void dfs(long long u, long long f, long long d) { n siz[u] = 1; n dep[u] = d; n for (long long i = head[u]; i; i = e[i].nxt) { n long long v = e[i].to; n if (v == f) continue; n dfs(v, u, d + 1); n siz[u] += siz[v]; n } n } n signed main() { n n = read(); n for (long long i = 1, a, b; i < n; ++i) { n a = read(); n b = read(); n add(a, b); n add(b, a); n } n dfs(1, 0, 0); n for (long long i = 1; i <= n; ++i) { n ans += siz[i] * (n - siz[i]); n if (dep[i] & 1) ++qwq; n } n ans += qwq * (n - qwq); n printf( %lld n , ans / 2); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n long double p[N], k[N]; n int par[N]; n vector v[N]; n bool vstd[N]; n void dfs(int node) { n if (vstd[node]) return; n vstd[node] = true; n for (auto u : v[node]) { n if (u != par[node]) { n k[node] += p[u]; n par[u] = node; n dfs(u); n } n } n return; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cout << fixed << setprecision(6); n int n; n cin >> n; n long double tmp = 0.0; n for (int i = 0; i < n; i++) { n cin >> p[i]; n p[i] = 1.0 - p[i]; n tmp += p[i]; n } n for (int i = 1; i < n; i++) { n int a, b; n cin >> a >> b; n v[a].push_back(b); n v[b].push_back(a); n } n long double pmt = 0.0; n dfs(0); n for (int i = 0; i < n; i++) pmt += k[i] * p[i]; n int q; n cin >> q; n while (q--) { n int node; n cin >> node; n tmp -= p[node]; n pmt -= k[node] * p[node]; n if (node) { n pmt -= k[par[node]] * p[par[node]]; n k[par[node]] -= p[node]; n } n cin >> p[node]; n p[node] = 1.0 - p[node]; n tmp += p[node]; n if (node) k[par[node]] += p[node]; n pmt += k[node] * p[node]; n if (node) pmt += k[par[node]] * p[par[node]]; n cout << tmp - pmt << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char next; n long long int neg = 0, pos = 0; n cin >> next; n bool estado = false; n string orden = ; n while (next != = ) { n if (next == ) { n cin >> next; n } n if (next == - ) { n estado = true; n cin >> next; n } n if (next == + ) { n estado = false; n cin >> next; n } n if (next == ? ) { n if (estado) { n orden += - ; n neg++; n } else { n orden += + ; n pos++; n } n } n cin >> next; n } n long long int num; n cin >> num; n long long int coefs[neg + pos]; n if ((neg > ((pos - 1) * num)) || ((pos - neg * num) > num)) { n cout << Impossible ; n return 0; n } n long long int valpos = 0, valneg = 0; n cout << Possible << endl; n if (neg == 0) { n long long int cv = trunc(num / pos); n long long int sum = 0; n for (int i = 0; i < pos; i++) { n coefs[i] = cv; n } n sum = cv * pos - num; n if (sum != 0) { n for (int i = 0; i < pos; i++) { n coefs[i]++; n sum++; n if (sum == 0) break; n } n } n cout << coefs[0]; n for (int i = 1; i < pos; i++) { n cout << + << coefs[i]; n } n cout << = << num; n return 0; n } n if (pos - 1 > neg) { n valpos = 1; n valneg = trunc((pos - 1) / neg); n } else { n valneg = 1; n valpos = trunc(neg / (pos - 1)); n } n int ref; n for (int i = 0; i < orden.size(); i++) { n if (orden[i] == - ) { n coefs[i] = -valneg; n } else n coefs[i] = valpos; n } n coefs[0] = num; n long long int suma = 0; n for (int i = 0; i < neg + pos; i++) { n suma += coefs[i]; n } n suma -= num; n if (suma < 0) { n for (int i = 1; i < neg + pos; i++) { n if (coefs[i] > 0 && (abs(coefs[i]) < num)) { n coefs[i]++; n suma++; n } n if (suma == 0) break; n } n } n if (suma > 0) { n for (int i = 1; i < neg + pos; i++) { n if (coefs[i] < 0 && (abs(coefs[i]) < num)) { n coefs[i]--; n suma--; n } n if (suma == 0) break; n } n } n for (int i = 1; i < neg + pos; i++) { n if (abs(coefs[i]) > num) { n if (coefs[i] < 0) { n suma += -num - coefs[i]; n coefs[i] = -num; n } else { n suma += num - coefs[i]; n coefs[i] = num; n } n } n } n if (suma > 0) { n coefs[0] -= suma; n suma -= suma; n } n if (suma < 0) { n coefs[0] += suma; n suma -= suma; n } n cout << coefs[0]; n for (int i = 1; i < pos + neg; i++) { n if (coefs[i] < 0) n cout << - << abs(coefs[i]); n else n cout << + << coefs[i]; n } n cout << = << suma + num; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n if (n == 1) { n cout << -1; n } else n cout << n << << n + 1 << << n * (n + 1); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, x, y, large = 2000000000, small = -2000000000; n string s1, s2; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> s1 >> x >> s2; n if ((s1 == > && s2 == Y ) || (s1 == <= && s2 == N )) { n if (x >= small) { n small = x + 1; n } n } else if ((s1 == < && s2 == Y ) || (s1 == >= && s2 == N )) { n if (x <= large) { n large = x - 1; n } n } else if ((s1 == >= && s2 == Y ) || (s1 == < && s2 == N )) { n if (x >= small) { n small = x; n } n } else { n if (x <= large) { n large = x; n } n } n } n if (small > large) { n cout << Impossible ; n } else { n cout << small; n } n return (0); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 405; n char mp[30], s[N], a[5], b[5]; n int L, n, m, e[N][N], nxd[30], nxs[30], flg[30], lim[N], tmp[N], mx[2]; n vector ans; n bool chk(int pos, int v, int x, bool ff) { n if (lim[pos] != -1 && lim[pos] != flg[v]) return 0; n for (int i = 1; i <= n; i++) n if (e[x][i] && e[x][i + n]) return 0; n for (int i = 1; i <= n; i++) tmp[i] = (e[x][i] ? 0 : (e[x][i + n] ? 1 : -1)); n if (ff) { n for (int i = 1; i <= n; i++) { n if (pos + i > n) break; n int t = max(lim[pos + i], tmp[pos + i]); n if (t == -1) break; n if (mx[t] < s[pos + i] - a + 1) return 0; n if (mx[t] > s[pos + i] - a + 1) break; n } n } n for (int i = 1; i <= n; i++) { n lim[i] = max(lim[i], tmp[i]); n } n return 1; n } n int main() { n scanf( %s , mp + 1); n L = strlen(mp + 1); n memset(lim, -1, sizeof(lim)); n memset(mx, -1, sizeof(mx)); n for (int i = 1; i <= L; i++) { n flg[i] = mp[i] == V ; n mx[flg[i]] = i; n } n for (int i = 1; i <= L; i++) n for (int j = i + 1; j <= L; j++) n if (flg[i] != flg[j]) { n nxd[i] = j; n break; n } n for (int i = 1; i <= L; i++) n for (int j = i + 1; j <= L; j++) n if (flg[i] == flg[j]) { n nxs[i] = j; n break; n } n cin >> n >> m; n for (int i = 1; i <= m; i++) { n int x, y; n scanf( %d%s%d%s , &x, a, &y, b); n int a1 = a[0] == V , b1 = b[0] == V ; n e[x + a1 * n][y + b1 * n] = 1; n e[y + !b1 * n][x + !a1 * n] = 1; n } n scanf( %s , s + 1); n for (int k = 1; k <= n * 2; k++) n for (int i = 1; i <= n * 2; i++) n for (int j = 1; j <= n * 2; j++) e[i][j] |= (e[i][k] & e[k][j]); n bool ff = 1; n for (int i = 1; i <= n; i++) { n int mn = ff ? s[i] - a + 1 : 1; n if (chk(i, mn, i + flg[mn] * n, ff)) { n ans.push_back(mn); n } else if (mn < L && flg[mn] == flg[mn + 1] && n chk(i, mn + 1, i + flg[mn + 1] * n, 0)) { n ans.push_back(mn + 1), ff = 0; n } else if (nxd[mn] && chk(i, nxd[mn], i + flg[nxd[mn]] * n, 0)) { n ans.push_back(nxd[mn]), ff = 0; n } else if (nxs[mn] && nxs[mn] > nxd[mn] && n chk(i, nxs[mn], i + flg[nxs[mn]] * n, 0)) { n ans.push_back(nxs[mn]), ff = 0; n } else { n return puts( -1 ), 0; n } n } n for (int i = 0; i <= n - 1; i++) printf( %c , ans[i] + a - 1); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps(1e-8); n char s[1000010]; n int n, m, a, b; n vector vec[1000010]; n vector p[1000010]; n int x[1000010], y[1000010], sum[1000010], ans[1000010]; n int Lowbit(int x) { return x & (-x); } n void Update(int pos, int val) { n while (pos > 0) { n sum[pos] += val; n pos -= Lowbit(pos); n } n } n int Query(int pos) { n int ret = 0; n while (pos <= n) { n ret += sum[pos]; n pos += Lowbit(pos); n } n return ret; n } n void Add(int l, int r, int val) { n Update(r, val); n Update(l - 1, -val); n } n int main() { n scanf( %s , s + 1); n for (n = 1; s[n]; n++) n ; n n--; n scanf( %d , &m); n for (int i = 1; i <= m; i++) { n scanf( %d%d , &a, &b); n vec[b].push_back(a); n p[b].push_back(i); n } n int len = 0; n for (int i = 1; i <= n; i++) { n len++; n if (s[i] == ( ) n x[len] = 0; n else n x[len] = 1; n y[len] = i; n if (len >= 2 && x[len] == 1 && x[len - 1] == 0) { n Add(1, y[len - 1], 2); n len -= 2; n } n for (int j = 0; j < (int)vec[i].size(); j++) { n int tmp = vec[i][j]; n ans[p[i][j]] = Query(tmp); n } n } n for (int i = 1; i <= m; i++) printf( %d n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int a, b, c, min_cost, min_a, min_b, min_c; n cin >> a >> b >> c; n if (b % a == 0 && c % b == 0) { n cout << 0 << endl; n cout << a << << b << << c << endl; n } else { n min_cost = 10000000; n int max = 2 * c; n for (int i = 1; i < max; i++) n for (int j = i; j < max; j += i) n for (int k = j; k < max; k += j) n if (k % j == 0 && j % i == 0) { n int cost = abs(a - i) + abs(b - j) + abs(c - k); n if (cost < min_cost) { n min_cost = cost; n min_a = i; n min_b = j; n min_c = k; n } n } n cout << min_cost << endl; n cout << min_a << << min_b << << min_c << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int dp[510][127010],mod,c[510][510],s[127010],jc[510]; n int sol(int n){ n s[0]=dp[n-1][0]; n for(int i=1;i<=n*(n-1)/2;i++)s[i]=(s[i-1]+dp[n-1][i])%mod; n int ans=0; n for(int i=1;i=i)?dp[i-1][j-i]:0))%mod)%mod; n } n for(int i=1;i<=n;i++){ n c[i][0]=1; n for(int j=1;j<=i;j++)c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod; n } n int ans=0; n for(int i=0;i n using namespace std; n const int MAXN = 100010; n vector> adj[10 * MAXN]; n long long dist[10 * MAXN]; n int par[10 * MAXN]; n int go1(int idx, int l, int r, int ds) { n if (idx > 1) { n int par = idx / 2; n adj[par + ds].push_back({0, idx + ds}); n } n if (l == r) { n adj[idx + ds].push_back({0, l}); n return idx; n } n int m = (l + r) / 2; n int ret = n max(idx, max(go1(2 * idx, l, m, ds), go1(2 * idx + 1, m + 1, r, ds))); n return ret; n } n void go2(int idx, int l, int r, int ds) { n for (int i = l; i < (r + 1); ++i) { n adj[i].push_back({0, idx + ds}); n } n if (r > l) { n int m = (l + r) / 2; n go2(2 * idx, l, m, ds); n go2(2 * idx + 1, m + 1, r, ds); n } n } n void go3(int idx, int x, int y, int l, int r, function f) { n if (y < l || x > r) return; n if (x >= l && y <= r) { n f(idx); n return; n } n int m = (x + y) / 2; n go3(2 * idx, x, m, l, r, f); n go3(2 * idx + 1, m + 1, y, l, r, f); n } n void dijsktra(int src) { n memset(dist, 0x3f3f3f3f, sizeof(dist)); n dist[src] = 0; n par[src] = src; n priority_queue, vector>, n greater>> n pq; n pq.push({dist[src], src}); n while (!pq.empty()) { n int u = pq.top().second; n long long l = pq.top().first; n pq.pop(); n if (dist[u] == l) { n for (auto p : adj[u]) { n long long ndist = l + p.first; n if (ndist < dist[p.second]) { n dist[p.second] = ndist; n par[p.second] = u; n pq.push({dist[p.second], p.second}); n } n } n } n } n } n int main() { n int n, m, src; n scanf( %d %d , &(n), &(m)); n scanf( %d , &(src)); n --src; n int ds1 = n - 1 + 5; n int ds2 = go1(1, 0, n - 1, ds1) + ds1 + 5; n go2(1, 0, n - 1, ds2); n while (m--) { n int tp; n scanf( %d , &(tp)); n if (tp == 1) { n int u, v, w; n scanf( %d %d , &(u), &(v)); n scanf( %d , &(w)); n adj[u - 1].push_back({w, v - 1}); n } else { n int vtx, l, r, w; n scanf( %d %d , &(vtx), &(l)); n scanf( %d %d , &(r), &(w)); n --l; n --r; n --vtx; n go3(1, 0, n - 1, l, r, [ds1, ds2, tp, w, vtx](int idx) { n if (tp == 2) { n adj[vtx].push_back({w, idx + ds1}); n } else { n adj[idx + ds2].push_back({w, vtx}); n } n }); n } n } n dijsktra(src); n for (int i = 0; i < (n); ++i) n printf( %lld%c , (dist[i] == 0x3f3f3f3f3f3f3f3fll ? -1 : dist[i]), n n [i == n - 1]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n pair a[300001]; n long long n, k, s, m; n bool b[300001]; n inline long long read() { n long long sum = 0, x = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) x = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n sum = sum * 10 + ch - 0 ; n ch = getchar(); n } n return sum * x; n } n inline void write(long long x) { n if (x < 0) { n putchar( - ); n x = -x; n } n if (x > 9) write(x / 10); n putchar(x % 10 + 0 ); n return; n } n inline bool cmp(pair a, pair b) { n return a.first > b.first; n } n signed main() { n n = read(); n k = read(); n for (register long long i = 1; i <= n; ++i) a[i].second = i; n for (m = 1; m <= n; ++m) { n for (register long long j = m * 2; j <= n; j += m) ++a[j].first; n s += a[m].first; n if (s >= k) break; n } n if (s < k) { n puts( No ); n return 0; n } n sort(a + 1, a + m, cmp); n long long t = m; n for (register long long i = 1; i <= m; ++i) { n if (a[i].second > m / 2 && s - a[i].first >= k) { n s -= a[i].first; n b[a[i].second] = true; n t--; n } n if (s == k) break; n } n puts( Yes ); n write(t); n putchar( n ); n for (register long long i = 1; i <= m; ++i) n if (!b[i]) { n write(i); n putchar( ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int te; n cin >> te; n while (te--) { n int n, m, x, ji = 0, ou = 0; n cin >> n >> m; n for (int i = 0; i < n; ++i) { n cin >> x; n if (x & 1) n ji++; n else n ou++; n } n if (ji == 0) { n puts( No ); n continue; n } n ji--; n m--; n int q = min(m / 2 * 2, ji / 2 * 2); n m -= q; n ou -= m; n if (ou < 0) n puts( No ); n else n puts( Yes ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, q[1000010], a[1000010], del[1000010], sz[1000010], p[1000010]; n stack res; n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) scanf( %d , &a[i]); n if (a[m] <= n) a[m + 1] = n + 1; n for (int i = 1; i <= m; i++) n for (int j = a[i]; j < a[i + 1]; j++) p[j] = i; n for (int i = 1; i <= n; i++) scanf( %d , &q[i]); n for (int i = 0; i < a[1]; i++) del[i] = n; n for (int i = 1; i <= m; i++) { n del[a[i]] = 1; n for (int j = a[i] + 1; j < a[i + 1]; j++) del[j] = del[j - i] + 1; n } n for (int i = 1; i <= n; i++) { n if (q[i] == 1 || q[i] == 0) n sz[i] = sz[i - 1] + 1; n else n sz[i] = sz[i - 1] - p[sz[i - 1]]; n } n if (!sz[n]) { n puts( Poor stack! ); n return 0; n } n int k = 0; n for (int i = n; i >= 1; i--) { n if (q[i] == -1) n k++; n else if (del[sz[i]] > k) n res.push(q[i]); n } n while (!res.empty()) { n printf( %d , res.top()); n res.pop(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int s0, t0, t1, n, m, Next[500000 + 5]; n char s[500000 + 5], t[500000 + 5]; n void GetNext() { n Next[0] = -1; n int j = 0, k = -1; n while (j < m) { n if (!~k || t[j] == t[k]) n Next[++j] = ++k; n else n k = Next[k]; n } n } n int main() { n scanf( %s%s , s, t); n n = strlen(s), m = strlen(t); n GetNext(); n for (int i = 0; s[i]; i++) s0 += s[i] == 0 ; n for (int i = 0; t[i]; i++) t0 += t[i] == 0 ; n for (int i = Next[m]; t[i]; i++) t1 += t[i] == 0 ; n int A = t0, B = m - t0, l = m - Next[m], step = 0; n while (A + t1 <= s0 && B + l - t1 <= n - s0) A += t1, B += l - t1, step++; n if (t0 <= s0 && m - t0 <= n - s0) { n printf( %s , t); n for (int i = 0; i < step; i++) printf( %s , t + Next[m]); n for (int i = s0 - A; i; i--) putchar( 0 ); n for (int i = n - s0 - B; i; i--) putchar( 1 ); n puts( ); n } else n printf( %s n , s); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1000 * 100 + 10; n vector g[maxn]; n int a[maxn], b[maxn]; n bool p[maxn]; n int n, m; n void input() { n cin >> n >> m; n for (int i = 0; i < m; i++) { n int u, v; n cin >> u >> v; n u--, v--; n g[u].push_back(v); n g[v].push_back(u); n } n for (int i = 0; i < n; i++) cin >> a[i]; n } n void bfs(int v) { n queue q; n q.push(v); n while (!q.empty()) { n p[q.front()] = true; n int u = q.front(); n b[u]++; n for (int i = 0; i < g[u].size(); i++) { n b[g[u][i]]++; n if (b[g[u][i]] == a[g[u][i]]) q.push(g[u][i]); n } n q.pop(); n } n } n int main() { n input(); n for (int i = 0; i < n; i++) n if (b[i] == a[i]) bfs(i); n int ans = 0; n for (int i = 0; i < n; i++) ans += p[i]; n cout << ans << endl; n ; n for (int i = 0; i < n; i++) n if (p[i]) cout << i + 1 << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mod = 1000000007; n int main() { n string s; n cin >> s; n int k; n cin >> k; n unordered_set st; n for (int i = 0; i < k; i++) { n string temp; n cin >> temp; n st.insert(temp); n string temp2 = ; n temp2 = temp2 + temp[1]; n temp2 = temp2 + temp[0]; n st.insert(temp2); n } n vector > arr; n for (int i = 0; i < s.size(); i++) { n int count = 1; n int j = i + 1; n while (j < s.size() && s[j] == s[i]) { n count++; n j++; n } n arr.push_back(make_pair(s[i], count)); n i = j - 1; n } n int ans = 0; n for (int i = 0; i < arr.size() - 1; i++) { n string temp = ; n temp = temp + arr[i].first; n temp = temp + arr[i + 1].first; n if (st.find(temp) != st.end()) { n int c1 = arr[i].second, c2 = arr[i + 1].second; n int j = i + 2; n while (j < s.size()) { n if (arr[j].first == arr[i].first) n c1 += arr[j].second; n else if (arr[j].first == arr[i + 1].first) n c2 += arr[j].second; n else n break; n j++; n } n ans += min(c1, c2); n i = j - 1; n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, x, y; n long long dp[10000005]; n int main(void) { n scanf( %lld%lld%lld , &n, &x, &y); n dp[1] = x; n for (int i = 2; i <= n; ++i) { n if (i & 1) { n dp[i] = min(dp[i - 1] + x, dp[(i + 1) >> 1] + x + y); n } else n dp[i] = min(dp[i - 1] + x, dp[i >> 1] + y); n } n printf( %lld n , dp[n]); n } n "} +{"func_code_string": "#include n using namespace std; n int n, nn, sum; n vector q; n double x, ans, anss; n int main() { n scanf( %d , &n); n sum = 0; n for (int i = 1; i <= 2 * n; i++) { n scanf( %lf , &x); n ans += (x - floor(x)); n if (floor(x) == ceil(x)) sum++; n } n if (sum > n) n = n * 2 - sum; n sum = min(sum, n); n anss = 10000000; n for (int i = n - sum; i <= n; i++) anss = min(anss, fabs(ans - i)); n printf( %.3lf , anss); n } n "} +{"func_code_string": "#include n using namespace std; n struct TnT { n int k, f; n } T[111]; n bool cmp(TnT a, TnT b) { n if (a.f == b.f) return a.k < b.k; n return a.f < b.f; n } n map t; n int main() { n ios::sync_with_stdio(false); n int n, m, ans = -1; n cin >> n >> m; n for (int i = 0; i < m; i++) cin >> T[i].k >> T[i].f; n sort(T, T + m, cmp); n for (int k = 1; k <= 100; k++) { n int cnt = 1; n for (int i = 1; i <= 110; i += k) { n for (int j = i; j <= i + k - 1; j++) t[j] = cnt; n cnt++; n } n int flag = 1; n for (int i = 0; i < m; i++) { n if (t[T[i].k] != T[i].f) flag = 0; n } n if (flag) { n if (ans == -1) n ans = t[n]; n else if (ans != t[n]) { n cout << -1 << endl; n return 0; n } n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool distinct(int n) { n set a; n int i, c = 0; n while (n > 0) { n int d = n % 10; n a.insert(d); n n /= 10; n } n int l = a.size(); n for (int i = 0; i <= l - 1; i++) { n c++; n } n if (c == 4) { n return true; n } else { n return false; n } n } n int main() { n int y; n cin >> y; n for (int i = y; i <= 10000; i++) { n if (i > y) { n if (distinct(i)) { n cout << i; n break; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, n; n cin >> t; n while (t--) { n cin >> n; n int a[n], sum = n - 1; n for (int i = 0; i < n; i++) { n cin >> a[i]; n sum += a[i]; n } n cout << sum / n << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char A[2005][2005], B[2005][2005]; n int last_valid; n pair lb[26], ub[26]; n bool ans; n void _clear(int n, int m) { n for (int i = 0; i < 26; ++i) { n lb[i] = make_pair(INT_MAX, INT_MAX); n ub[i] = make_pair(INT_MIN, INT_MIN); n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n B[i][j] = . ; n } n } n ans = true; n last_valid = -1; n } n void _populate(int n, int m) { n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (A[i][j] == . ) continue; n char c = A[i][j] - a ; n lb[c].first = min(lb[c].first, i); n lb[c].second = min(lb[c].second, j); n ub[c].first = max(ub[c].first, i); n ub[c].second = max(ub[c].second, j); n } n } n } n void _regenerate() { n for (int i = 0; i < 26; ++i) { n if (lb[i].first != INT_MAX) { n last_valid = i; n if (lb[i].first == ub[i].first) { n int x = lb[i].first; n for (int j = lb[i].second; j <= ub[i].second; ++j) B[x][j] = i + a ; n } else if (lb[i].second == ub[i].second) { n int x = lb[i].second; n for (int j = lb[i].first; j <= ub[i].first; ++j) B[j][x] = i + a ; n } else n ans = false; n } n } n } n void _compare(int n, int m) { n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (A[i][j] != B[i][j]) ans = false; n } n } n } n void _print() { n if (!ans) { n cout << NO << endl; n return; n } n cout << YES << endl; n cout << last_valid + 1 << endl; n for (int i = 0; i <= last_valid; ++i) { n if (lb[i].first != INT_MAX) { n cout << lb[i].first + 1 << << lb[i].second + 1 << n << ub[i].first + 1 << << ub[i].second + 1 << endl; n } else { n int x = last_valid; n cout << lb[x].first + 1 << << lb[x].second + 1 << n << ub[x].first + 1 << << ub[x].second + 1 << endl; n } n } n } n void _debug(int n, int m) { n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) cout << A[i][j] << ; n cout << endl; n } n cout << endl; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) cout << B[i][j] << ; n cout << endl; n } n cout << endl; n } n int main() { n ios_base::sync_with_stdio(false); n cout.tie(0); n cin.tie(0); n int t, n, m, i, j, k, x, y, z, a, b, c; n cin >> t; n while (t--) { n cin >> n >> m; n for (i = 0; i < n; ++i) cin >> A[i]; n _clear(n, m); n _populate(n, m); n _regenerate(); n _compare(n, m); n _print(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n string s; n long long dp[200011]; n const long long Mod = 1e9 + 7; n long long f[200011][3]; n long long power(long long x, long long n) { n if (n < 0) return 0; n if (n == 0) return 1; n if (n % 2 == 0) return power(x * x % Mod, n / 2); n return x * power(x * x % Mod, n / 2) % Mod; n } n int main() { n cin >> n; n cin >> s; n s = . + s; n int c = 0; n for (int i = n; i >= 1; i--) { n if (s[i] == ? ) c++; n } n long long cnt1 = 0; n long long cnt2 = 0; n for (int i = 1; i <= n; i++) { n if (s[i] == b ) { n f[i][0] += cnt1; n f[i][1] += cnt2; n } n if (s[i] == ? ) { n f[i][1] += cnt1; n f[i][2] += cnt2; n } n if (s[i] == a ) { n cnt1++; n } n if (s[i] == ? ) cnt2++; n } n for (int i = 1; i <= n; i++) { n for (int j = 0; j <= 2; j++) (f[i][j] += f[i - 1][j]) %= Mod; n } n long long ans = 0; n for (int i = 1; i <= n; i++) { n if (s[i] == c ) { n ans += f[i - 1][0] * power(3, c); n ans %= Mod; n ans += f[i - 1][1] * power(3, c - 1); n ans %= Mod; n ans += f[i - 1][2] * power(3, c - 2); n ans %= Mod; n } n if (s[i] == ? ) { n ans += f[i - 1][0] * power(3, c - 1); n ans %= Mod; n ans += f[i - 1][1] * power(3, c - 2); n ans %= Mod; n ans += f[i - 1][2] * power(3, c - 3); n ans %= Mod; n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, x[1042], y[1042]; n double eps = 0.00000001; n int dist2(int x1, int y1, int x2, int y2) { n return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2); n } n double dist(double x1, double y1, double x2, double y2) { n return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); n } n int cross(int a, int b, int c) { n return (x[a] - x[b]) * (y[c] - y[b]) - (x[c] - x[b]) * (y[a] - y[b]); n } n bool acute(int a, int b, int c) { n if (cross(a, b, c) == 0) { n return 0; n } n int dAB = dist2(x[a], y[a], x[b], y[b]); n int dBC = dist2(x[b], y[b], x[c], y[c]); n int dAC = dist2(x[a], y[a], x[c], y[c]); n if (dAB >= dBC + dAC) { n return 0; n } n if (dAC >= dBC + dAB) { n return 0; n } n if (dBC >= dAC + dAB) { n return 0; n } n return 1; n } n bool r(int a, int b, int c) { n int dAB = dist2(x[a], y[a], x[b], y[b]); n int dBC = dist2(x[b], y[b], x[c], y[c]); n int dAC = dist2(x[a], y[a], x[c], y[c]); n if (dAB == dBC + dAC) { n return 1; n } n if (dAC == dBC + dAB) { n return 1; n } n if (dBC == dAC + dAB) { n return 1; n } n return 0; n } n bool covered(double cx, double cy, double t) { n for (int i = 0; i < n; i++) { n if (dist(cx, cy, x[i], y[i]) < t) { n return 1; n } n } n return 0; n } n pair getCirC(int a, int b, int c) { n int dx1 = x[a] - x[b], dx2 = x[b] - x[c], dx3 = x[c] - x[a]; n int dy1 = y[a] - y[b], dy2 = y[b] - y[c], dy3 = y[c] - y[a]; n double xc1 = (x[a] + x[b]) / 2., xc2 = (x[b] + x[c]) / 2., n xc3 = (x[c] + x[a]) / 2.; n double yc1 = (y[a] + y[b]) / 2., yc2 = (y[b] + y[c]) / 2., n yc3 = (y[c] + y[a]) / 2.; n if (dy1 == 0) { n swap(dx1, dx3); n swap(dy1, dy3); n swap(xc1, xc3); n swap(yc1, yc3); n } n if (dy2 == 0) { n swap(dx2, dx3); n swap(dy2, dy3); n swap(xc2, xc3); n swap(yc2, yc3); n } n double n1 = -1. * dx1 / (double)dy1, n2 = -1. * dx2 / (double)dy2; n double x = (yc2 - yc1 + n1 * xc1 - n2 * xc2) / (n1 - n2); n double y = n1 * (x - xc1) + yc1; n return make_pair(x, y); n } n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n cin >> x[i] >> y[i]; n } n double ans = -1; n for (int i = 0; i < n; i++) { n for (int j = i + 1; j < n; j++) { n for (int k = j + 1; k < n; k++) { n if (acute(i, j, k)) { n pair crr = getCirC(i, j, k); n double px = crr.first, py = crr.second; n double d = dist(px, py, x[i], y[i]); n if (!covered(px, py, d - eps)) { n ans = max(ans, d); n } n } n } n } n } n for (int i = 0; i < n; i++) { n for (int j = i + 1; j < n; j++) { n vector ids; n ids.clear(); n for (int k = 0; k < n; k++) { n if (k == i || k == j) { n continue; n } n if (dist2(x[i], y[i], x[k], y[k]) != dist2(x[j], y[j], x[k], y[k])) { n continue; n } n if (!r(i, j, k)) { n continue; n } n ids.push_back(k); n } n if (ids.size() < 2) { n continue; n } n int k = ids[0]; n int cc = ids[1]; n double px = (x[i] + x[j] + x[k] + x[cc]) / 4.; n double py = (y[i] + y[j] + y[k] + y[cc]) / 4.; n double d = dist(x[i], y[i], px, py); n if (!covered(px, py, d - eps)) { n ans = max(ans, d); n } n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector vec[100010]; n long long a[100010]; n long long s; n int n; n long long dfs(int f, int u, long long val) { n int sz = vec[u].size(), v; n long long ret = 0, mv = ((long long)1e18), tmp; n if (sz == 1 && vec[u][0] == f) n return (a[u] = ((val) < (a[u]) ? (val) : (a[u]))); n if (u != 1) n val = val / (sz - 1) * (sz - 1) / (sz - 1); n else n val = val / sz * sz / sz; n for (int i = 0; i < sz; i++) { n v = vec[u][i]; n if (v == f) continue; n tmp = dfs(u, v, val); n mv = ((mv) < (tmp) ? (mv) : (tmp)); n } n while (true) { n tmp = mv; n for (int i = 0; i < sz; i++) { n v = vec[u][i]; n if (v == f) continue; n if (a[v] > tmp) tmp = ((dfs(u, v, mv)) < (tmp) ? (dfs(u, v, mv)) : (tmp)); n } n if (tmp == mv) n break; n else n mv = tmp; n } n for (int i = 0; i < sz; i++) n if (vec[u][i] != f) ret += a[vec[u][i]]; n return a[u] = ret; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %I64d , a + i), s += a[i]; n for (int i = 1; i < n; i++) { n int u, v; n scanf( %d%d , &u, &v); n vec[u].push_back(v); n vec[v].push_back(u); n } n long long ret = dfs(0, 1, ((long long)1e18)); n cout << s - ret << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dx[] = {0, 0, 1, -1}; n int dy[] = {1, -1, 0, 0}; n template n inline void smin(T &a, T b) { n if (a > b) a = b; n } n template n inline void smax(T &a, T b) { n if (a < b) a = b; n } n int qf, qb, q[11111111]; n long long res[555], a[555][555], dst[555][555]; n int r[555], first[555]; n int main() { n int N, ii, i, j, nn, u, st; n scanf( %d , &N); n for (i = 0; i < N; i++) n for (j = 0; j < N; j++) scanf( %I64d , &dst[i][j]); n for (i = 0; i < N; i++) { n scanf( %d , r + i); n r[i]--; n } n nn = 0; n for (ii = N - 1; ii >= 0; ii--) { n st = r[ii]; n for (i = 0; i < nn; i++) { n for (j = 0; j < nn; j++) { n smin(dst[st][first[j]], dst[st][first[i]] + dst[first[i]][first[j]]); n smin(dst[first[j]][st], dst[first[j]][first[i]] + dst[first[i]][st]); n } n } n for (i = 0; i < nn; i++) n for (j = 0; j < nn; j++) n smin(dst[first[i]][first[j]], dst[first[i]][st] + dst[st][first[j]]); n first[nn++] = st; n res[ii] = 0; n for (i = 0; i < nn; i++) n for (j = 0; j < nn; j++) res[ii] += dst[first[i]][first[j]]; n } n for (i = 0; i < N; i++) { n if (i) printf( ); n printf( %I64d , res[i]); n } n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 400005; n int n, q, K, m, i, j, k, h[N], t[N], num, fa[N], s[N], id[N], size[N], son[N], n tp[N], dep[N], head[N], adj[N * 2], nxt[N * 2], p[N], cnt, stk[N], top, n g[N], Head[N], Adj[N * 2], Nxt[N * 2], l, f[N]; n void dfs(int x, int dad) { n size[x] = 1; n for (int y = head[x]; y; y = nxt[y]) n if (adj[y] != dad) { n dep[adj[y]] = dep[x] + 1; n fa[adj[y]] = x; n dfs(adj[y], x); n size[x] += size[adj[y]]; n if (!son[x] || size[adj[y]] > size[son[x]]) son[x] = adj[y]; n } n } n void Dfs(int x, int dad) { n id[x] = ++i; n if (son[x]) { n tp[son[x]] = tp[x]; n Dfs(son[x], x); n } n for (int y = head[x]; y; y = nxt[y]) n if (adj[y] != dad && adj[y] != son[x]) { n tp[adj[y]] = adj[y]; n Dfs(adj[y], x); n } n } n int lca(int a, int b) { n while (tp[a] != tp[b]) { n if (dep[tp[a]] < dep[tp[b]]) swap(a, b); n a = fa[tp[a]]; n } n return dep[a] < dep[b] ? a : b; n } n int dis(int a, int b) { return dep[a] + dep[b] - 2 * dep[lca(a, b)]; } n bool cmp(int a, int b) { return id[a] < id[b]; } n void addedge(int u, int v) { n Adj[++l] = v; n Nxt[l] = Head[u]; n Head[u] = l; n Adj[++l] = u; n Nxt[l] = Head[v]; n Head[v] = l; n } n void dzx(int x, int dad) { n if (s[x]) n f[x] = x; n else n f[x] = 0; n for (int y = Head[x], a, b; y; y = Nxt[y]) n if (Adj[y] != dad) { n dzx(Adj[y], x); n if (f[Adj[y]] && (!f[x] || n 1ll * (a = dis(f[Adj[y]], x) - 1) / s[f[Adj[y]]] < n 1ll * (b = dis(f[x], x) - 1) / s[f[x]] || n 1ll * (a = dis(f[Adj[y]], x) - 1) / s[f[Adj[y]]] == n 1ll * (b = dis(f[x], x) - 1) / s[f[x]] && n h[f[Adj[y]]] < h[f[x]])) n f[x] = f[Adj[y]]; n } n if (s[x]) f[x] = x; n } n void phh(int x, int dad, int u) { n int a, b; n if (u) { n if (u && (!f[x] || n 1ll * (a = dis(u, x) - 1) / s[u] < n 1ll * (b = dis(f[x], x) - 1) / s[f[x]] || n 1ll * (a = dis(u, x) - 1) / s[u] == n 1ll * (b = dis(f[x], x) - 1) / s[f[x]] && n h[u] < h[f[x]])) n f[x] = u; n } n if (s[x]) f[x] = x; n for (int y = Head[x]; y; y = Nxt[y]) n if (Adj[y] != dad) phh(Adj[y], x, f[x]); n Head[x] = 0; n } n int main() { n scanf( %d , &n); n for (i = 1; i < n; ++i) { n scanf( %d%d , &j, &k); n adj[i * 2 - 1] = k; n nxt[i * 2 - 1] = head[j]; n head[j] = i * 2 - 1; n adj[i * 2] = j; n nxt[i * 2] = head[k]; n head[k] = i * 2; n } n dfs(1, -1); n tp[1] = 1; n i = 0; n Dfs(1, -1); n scanf( %d , &q); n while (q--) { n if (n == 10) { n for (i = 1; i <= n; ++i) Head[i] = h[i] = s[i] = g[i] = t[i] = p[i] = 0; n } n scanf( %d%d , &K, &m); n num = 0; n for (i = 1; i <= K; ++i) { n scanf( %d%d , &j, &k); n s[j] = k; n h[j] = i; n t[++num] = j; n } n for (i = 1; i <= m; ++i) { n scanf( %d , &j); n g[i] = t[++num] = j; n } n t[++num] = 1; n sort(t + 1, t + 1 + num, cmp); n cnt = 0; n for (i = 1; i <= num; i = j) { n for (j = i; j <= num && t[i] == t[j]; ++j) n ; n p[++cnt] = t[i]; n } n if (cnt == 1) { n puts( 1 ); n continue; n } n l = 0; n stk[1] = p[1], stk[2] = p[2]; n top = 2; n for (i = 3; i <= cnt; ++i) { n while (top > 1 && dep[lca(stk[top], p[i])] <= dep[stk[top - 1]]) { n addedge(stk[top - 1], stk[top]); n --top; n } n if ((j = lca(p[i], stk[top])) == stk[top]) n stk[++top] = p[i]; n else { n addedge(j, stk[top]); n stk[top] = j; n stk[++top] = p[i]; n } n } n while (top > 1) { n addedge(stk[top - 1], stk[top]); n --top; n } n dzx(1, -1); n phh(1, -1, 0); n for (i = 1; i <= m; ++i) printf( %d , h[f[g[i]]]); n puts( ); n for (i = 1; i <= cnt; ++i) s[p[i]] = 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int BIG = 1000000; n int n, k; n cin >> n >> k; n string s; n int a[2][n + 2 * k]; n int x[2][n + 2 * k]; n for (int i = 0; i < 2; i++) { n cin >> s; n for (int j = k; j < n + k; j++) { n if (s[j - k] == - ) n a[i][j] = 0; n else n a[i][j] = 1; n } n } n for (int i = 0; i < 2; i++) n for (int j = 0; j < k; j++) { n a[i][j] = 1; n } n for (int i = 0; i < 2; i++) n for (int j = n + k; j < n + 2 * k; j++) { n a[i][j] = 0; n } n for (int i = 0; i < 2; i++) { n for (int j = 0; j < n + 2 * k; j++) { n x[i][j] = BIG; n } n } n x[0][k] = 0; n vector v[2][n + 1]; n v[0][0].push_back(k); n for (int T = 1; T <= n; T++) { n for (int i = 0; i < 2; i++) { n for (int J = 0; J < v[(i) % 2][T - 1].size(); J++) { n int j = v[(i) % 2][T - 1][J]; n if (x[i][j - 1] == BIG && (j - 1 - k) >= T) { n x[i][j - 1] = (a[i][j - 1] == 1) ? BIG : T; n if (!(a[i][j - 1] == 1)) v[(i) % 2][T].push_back(j - 1); n } n if (x[i][j + 1] == BIG) { n x[i][j + 1] = (a[i][j + 1] == 1) ? BIG : T; n if (!(a[i][j + 1] == 1)) v[(i) % 2][T].push_back(j + 1); n } n if (x[(i + 1) % 2][j + k] == BIG) { n x[(i + 1) % 2][j + k] = (a[(i + 1) % 2][j + k] == 1) ? BIG : T; n if (!(a[(i + 1) % 2][j + k] == 1)) v[(i + 1) % 2][T].push_back(j + k); n } n } n } n } n for (int i = 0; i < 2; i++) n for (int j = n + k; j < n + 2 * k; j++) { n if (x[i][j] <= n) { n cout << YES ; n return 0; n } n } n cout << NO ; n } n "} +{"func_code_string": "#include n #define pairs pair n #define loop(i,a,n) for(int i=a;i siz; n /*ll indes(ll i,ll right){ n ll val=siz[i]; n ll left=0; n ll ans=-1; n while(left<=right){ n ll mid=(left+right)/2; n if(2*siz[mid]<=val){ n ans=mid; n left=mid+1; n } n else n { n right=mid-1; n } n n } n return ans; n }*/ n map mp; n n void solve(){ n ll n,k; n cin>>n>>k; n vector vec(n); n vector range(n); n loop(i,0,n){ n cin>>vec[i]; n } n range[0].fi=vec[0]; n range[0].se=vec[0]; n range[n-1].fi=vec[n-1]; n range[n-1].se=vec[n-1]; n for(ll i=1;i=d||b+k<=c){ n cout<< NO ; n return; n } n n } n cout<< YES ; n return; n } n int main(){ n int test=1; n cin>>test; n while(test--){ n solve(); n cout< n using namespace std; n const int Mod = 1e9 + 7; n int main() { n long long N, M, ans = 0, Last = 0; n scanf( %I64d%I64d , &N, &M); n long long Min = min(N, M); n for (long long i = 1, j; i <= Min; i = j + 1) { n j = min(N / (N / i), M); n long long tmp; n if (j & 1LL) n tmp = ((j + 1) / 2 % Mod) * (j % Mod) % Mod; n else n tmp = (j / 2 % Mod) * ((j + 1) % Mod) % Mod; n ans = n (ans + (N / i) % Mod * (((tmp - Last) % Mod + Mod) % Mod) % Mod) % Mod; n Last = tmp; n } n ans = (((N % Mod) * (M % Mod) - ans) % Mod + Mod) % Mod; n printf( %I64d , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2E5 + 10, mod = 1E9 + 7, M = 1E6 + 10, lim = 1E6; n int n, m, a[N], s[N], ans[N]; n struct node { n int l, r, num; n } p[N]; n vector f[M]; n int pos[M]; n inline int cmp(node x, node y) { return x.r < y.r; } n struct sgtree { n int l, r, sum; n } t[N << 2]; n inline int ksm(int x, int y) { n return y == 1 n ? x n : 1ll * ksm(1ll * x * x % mod, y >> 1) * ((y & 1) ? x : 1) % mod; n } n inline void pl(int l = 1, int r = n, int x = 1) { n t[x] = (sgtree){l, r, 1}; n if (l == r) return; n int mid = l + r >> 1; n pl(l, mid, x << 1); n pl(mid + 1, r, x << 1 | 1); n } n inline void modify(int l, int r, int v, int x = 1) { n if (l == t[x].l && r == t[x].r) { n t[x].sum = 1ll * t[x].sum * v % mod; n return; n } n int mid = t[x].l + t[x].r >> 1; n if (r <= mid) n modify(l, r, v, x << 1); n else if (l > mid) n modify(l, r, v, x << 1 | 1); n else n modify(l, mid, v, x << 1), modify(mid + 1, r, v, x << 1 | 1); n } n inline void insert(int v, int x) { n for (int i = 0; i < f[v].size(); i++) { n modify(pos[f[v][i]] + 1, x, n 1ll * ksm(f[v][i], mod - 2) * (f[v][i] - 1) % mod); n pos[f[v][i]] = x; n } n } n inline int query(int l, int x = 1) { n if (t[x].l == t[x].r) return t[x].sum; n int mid = t[x].l + t[x].r >> 1; n return 1ll * t[x].sum * (l <= mid ? query(l, x << 1) : query(l, x << 1 | 1)) % n mod; n } n inline int sol(int l, int r) { n return 1ll * s[r] * ksm(s[l - 1], mod - 2) % mod * query(l) % mod; n } n int main() { n scanf( %d , &n); n s[0] = 1; n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n s[i] = 1ll * s[i - 1] * a[i] % mod; n } n scanf( %d , &m); n pl(); n for (int i = 1; i <= m; i++) { n scanf( %d%d , &p[i].l, &p[i].r); n p[i].num = i; n } n sort(p + 1, p + 1 + m, cmp); n int now = 1; n for (int i = 2; i <= lim; i++) n if (!f[i].size()) n for (int j = 1; i * j <= lim; j++) f[i * j].push_back(i); n for (int i = 1; i <= n; i++) { n insert(a[i], i); n while (now <= m && p[now].r == i) { n ans[p[now].num] = sol(p[now].l, p[now].r); n now++; n } n } n for (int i = 1; i <= m; i++) printf( %d n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long fact[1000010]; n long long m = 1e9 + 7; n long long me(long long a, long long b, long long m) { n long long ans = 1; n while (b > 0) { n if (b % 2 == 1) { n ans = (ans % m * a % m) % m; n } n a = (a * a) % m; n b /= 2; n } n return ans % m; n } n bool check(long long x, long long a, long long b) { n while (x > 0) { n int dg = x % 10; n if (dg != a && dg != b) return false; n x /= 10; n } n return true; n } n long long ncr(long long n, long long r) { n long long fn = fact[n]; n long long tf = fact[r] * fact[n - r]; n tf = tf % m; n tf = me(tf, m - 2, m); n fn = (tf % m * fn % m) % m; n return fn % m; n } n int main() { n fact[0] = 1; n for (long long i = 1; i <= 1000001; i++) { n fact[i] = (fact[i - 1] * i) % m; n } n int n, a, b; n cin >> a >> b >> n; n if (a == b) { n if (check(n * a, a, b)) { n cout << 1 n ; n } else n cout << 0 n ; n return 0; n } n long long ans = 0; n for (long long i = 0; i <= n; i++) { n long long tmp = i * a + (n - i) * b; n if (check(tmp, a, b)) { n ans += ncr(n, i); n ans %= m; n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n while (cin >> n) { n string s; n cin >> s; n string res = ; n for (int i = 0; i < n; i++) { n if (s[i] <= 1 ) n continue; n else { n if (s[i] == 4 ) n res += 3 , res += 2 , res += 2 ; n else { n if (s[i] == 6 ) n res += 5 , res += 3 ; n else { n if (s[i] == 8 ) n res += 7 , res += 2 , res += 2 , res += 2 ; n else { n if (s[i] == 9 ) n res += 3 , res += 3 , res += 2 , res += 7 ; n else n res += s[i]; n } n } n } n } n } n sort(res.begin(), res.end()); n reverse(res.begin(), res.end()); n cout << res << endl; n } n } n "} +{"func_code_string": "#include n int W[21][11]; n void F() { n W[1][1] = 0; n W[1][2] = 0; n W[1][3] = 0; n W[1][4] = 0; n W[1][5] = 0; n W[1][6] = 0; n W[1][7] = 0; n W[1][8] = 0; n W[1][9] = 0; n W[1][10] = 0; n W[2][1] = 0; n W[2][2] = 0; n W[2][3] = 0; n W[2][4] = 0; n W[2][5] = 0; n W[2][6] = 0; n W[2][7] = 0; n W[2][8] = 0; n W[2][9] = 0; n W[2][10] = 0; n W[3][1] = 14; n W[3][2] = 0; n W[3][3] = 0; n W[3][4] = 0; n W[3][5] = 0; n W[3][6] = 0; n W[3][7] = 0; n W[3][8] = 0; n W[3][9] = 0; n W[3][10] = 0; n W[4][1] = 22; n W[4][2] = 0; n W[4][3] = 0; n W[4][4] = 0; n W[4][5] = 0; n W[4][6] = 0; n W[4][7] = 0; n W[4][8] = 0; n W[4][9] = 0; n W[4][10] = 0; n W[5][1] = 16; n W[5][2] = 70; n W[5][3] = 0; n W[5][4] = 0; n W[5][5] = 0; n W[5][6] = 0; n W[5][7] = 0; n W[5][8] = 0; n W[5][9] = 0; n W[5][10] = 0; n W[6][1] = 6; n W[6][2] = 232; n W[6][3] = 0; n W[6][4] = 0; n W[6][5] = 0; n W[6][6] = 0; n W[6][7] = 0; n W[6][8] = 0; n W[6][9] = 0; n W[6][10] = 0; n W[7][1] = 1; n W[7][2] = 380; n W[7][3] = 353; n W[7][4] = 0; n W[7][5] = 0; n W[7][6] = 0; n W[7][7] = 0; n W[7][8] = 0; n W[7][9] = 0; n W[7][10] = 0; n W[8][1] = 0; n W[8][2] = 396; n W[8][3] = 1786; n W[8][4] = 0; n W[8][5] = 0; n W[8][6] = 0; n W[8][7] = 0; n W[8][8] = 0; n W[8][9] = 0; n W[8][10] = 0; n W[9][1] = 0; n W[9][2] = 284; n W[9][3] = 4500; n W[9][4] = 1782; n W[9][5] = 0; n W[9][6] = 0; n W[9][7] = 0; n W[9][8] = 0; n W[9][9] = 0; n W[9][10] = 0; n W[10][1] = 0; n W[10][2] = 142; n W[10][3] = 7414; n W[10][4] = 12122; n W[10][5] = 0; n W[10][6] = 0; n W[10][7] = 0; n W[10][8] = 0; n W[10][9] = 0; n W[10][10] = 0; n W[11][1] = 0; n W[11][2] = 48; n W[11][3] = 8849; n W[11][4] = 41160; n W[11][5] = 8997; n W[11][6] = 0; n W[11][7] = 0; n W[11][8] = 0; n W[11][9] = 0; n W[11][10] = 0; n W[12][1] = 0; n W[12][2] = 10; n W[12][3] = 8028; n W[12][4] = 92226; n W[12][5] = 76878; n W[12][6] = 0; n W[12][7] = 0; n W[12][8] = 0; n W[12][9] = 0; n W[12][10] = 0; n W[13][1] = 0; n W[13][2] = 1; n W[13][3] = 5658; n W[13][4] = 152140; n W[13][5] = 328222; n W[13][6] = 45425; n W[13][7] = 0; n W[13][8] = 0; n W[13][9] = 0; n W[13][10] = 0; n W[14][1] = 0; n W[14][2] = 0; n W[14][3] = 3112; n W[14][4] = 195420; n W[14][5] = 928494; n W[14][6] = 467292; n W[14][7] = 0; n W[14][8] = 0; n W[14][9] = 0; n W[14][10] = 0; n W[15][1] = 0; n W[15][2] = 0; n W[15][3] = 1322; n W[15][4] = 201744; n W[15][5] = 1947581; n W[15][6] = 2402980; n W[15][7] = 229347; n W[15][8] = 0; n W[15][9] = 0; n W[15][10] = 0; n W[16][1] = 0; n W[16][2] = 0; n W[16][3] = 422; n W[16][4] = 170444; n W[16][5] = 3213988; n W[16][6] = 8205152; n W[16][7] = 2758896; n W[16][8] = 0; n W[16][9] = 0; n W[16][10] = 0; n W[17][1] = 0; n W[17][2] = 0; n W[17][3] = 96; n W[17][4] = 118912; n W[17][5] = 4322956; n W[17][6] = 20852648; n W[17][7] = 16594160; n W[17][8] = 1157954; n W[17][9] = 0; n W[17][10] = 0; n W[18][1] = 0; n W[18][2] = 0; n W[18][3] = 14; n W[18][4] = 68640; n W[18][5] = 4846524; n W[18][6] = 41920210; n W[18][7] = 66357900; n W[18][8] = 15946870; n W[18][9] = 0; n W[18][10] = 0; n W[19][1] = 0; n W[19][2] = 0; n W[19][3] = 1; n W[19][4] = 32632; n W[19][5] = 4594423; n W[19][6] = 69183464; n W[19][7] = 197939352; n W[19][8] = 109824208; n W[19][9] = 5846414; n W[19][10] = 0; n W[20][1] = 0; n W[20][2] = 0; n W[20][3] = 0; n W[20][4] = 12628; n W[20][5] = 3715462; n W[20][6] = 96046590; n W[20][7] = 468541040; n W[20][8] = 503245466; n W[20][9] = 90700276; n W[20][10] = 0; n } n int main() { n F(); n int n, t; n scanf( %d %d , &n, &t); n printf( %d n , W[n][t]); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int t; n cin >> t; n while (t--) { n long long int i, j, n, ans = 0, k1, k2; n cin >> n; n long long int arr[n]; n vector > vec(26); n for (i = 0; i < n; i++) { n cin >> arr[i]; n vec[arr[i] - 1].push_back(i); n } n long long int dp1[n][26], dp2[n][26]; n for (i = 0; i < n; i++) n for (j = 0; j < 26; j++) { n dp1[i][j] = 0; n dp2[i][j] = 0; n } n dp1[0][arr[0] - 1]++; n for (i = 1; i < n; i++) { n for (j = 0; j < 26; j++) n if (arr[i] == j + 1) n dp1[i][j] += dp1[i - 1][j] + 1; n else n dp1[i][j] += dp1[i - 1][j]; n } n dp2[n - 1][arr[n - 1] - 1]++; n for (i = n - 2; i >= 0; i--) { n for (j = 0; j < 26; j++) n if (arr[i] == j + 1) n dp2[i][j] += dp2[i + 1][j] + 1; n else n dp2[i][j] += dp2[i + 1][j]; n } n for (i = 0; i < 26; i++) { n long long int dd = vec[i].size(); n ans = max(ans, dd); n } n for (i = 0; i < 26; i++) { n for (k1 = 0; k1 < vec[i].size(); k1++) { n for (k2 = k1; k2 < vec[i].size(); k2++) { n long long int d1 = vec[i][k1], d2 = vec[i][k2]; n for (j = 0; j < 26; j++) n if (i != j) n ans = max(ans, k2 - k1 + 1 + 2 * min(dp1[d1][j], dp2[d2][j])); n } n } n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 500005; n long long a[MAX], pre[MAX], suf[MAX], t; n int main() { n int ans = -1, pos = 0, n; n scanf( %d , &n); n for (register int i = 1; i <= n; i++) { n scanf( %lld , &a[i]); n pre[i] = pre[i - 1] | a[i]; n } n for (register int i = n; i >= 1; i--) suf[i] = suf[i + 1] | a[i]; n for (register int i = 1; i <= n; i++) { n t = pre[i - 1] | suf[i + 1]; n if ((a[i] | t) - t > ans) { n ans = (a[i] | t) - t; n pos = i; n } n } n printf( %lld , a[pos]); n for (register int i = 1; i <= n; i++) n if (i != pos) printf( %lld , a[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n priority_queue > all[10010]; n int main() { n int n, m; n cin >> n >> m; n string name; n int reg, sc; n for (int i = 0; i < n; i++) { n cin >> name >> reg >> sc; n all[reg].push(make_pair(sc, name)); n } n for (int i = 1; i <= m; i++) { n int tt[4]; n int tool = 0; n pair p[4]; n while (all[i].size()) { n p[tool] = all[i].top(); n all[i].pop(); n tt[tool++] = p[tool].first; n if (tool == 3) break; n } n if (tool == 2) { n cout << p[0].second << << p[1].second << endl; n } else { n if (p[0].first == p[2].first || p[1].first == p[2].first) { n cout << ? << endl; n } else { n cout << p[0].second << << p[1].second << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n = 1009; n int LG2(int N) { n int ans = 0; n while (N) { n N >>= 1; n ans++; n } n return ans - 1; n } n int main() { n cin.tie(0); n cin.sync_with_stdio(0); n int n; n cin >> n; n map M; n int o = 1; n vector v(n); n vector vv(n); n int ans = 0; n for (int i = 0; i < (n); i++) { n string s; n cin >> s; n ans += s.length(); n vv[i] = s; n if (M[s]) { n v[i] = M[s]; n } else { n M[s] = o; n v[i] = o; n o++; n } n } n ans += n - 1; n int L = ans; n for (int f = 0; f < n; f++) { n int len = 0; n vector p; n for (int l = f; l < n; l++) { n len += vv[l].length(); n if (l > f) len++; n p.push_back(v[l]); n int pL = l - f + 1; n int cntP = 0; n for (int i = l + 1; i < n; i++) { n int o = i + pL - 1; n if (o > n) continue; n int c = 0; n bool b = 1; n for (int j = i; j <= o; j++) { n if (v[j] == p[c]) { n } else { n b = 0; n break; n } n c++; n } n if (b) { n cntP++; n i = o; n } n } n if (!cntP) continue; n int rB = (len - pL) * (cntP + 1); n ans = min(ans, L - rB); n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #define INF 1000000009 n n int get(int i){ n cout << ? << i+1 << endl; n cout.flush(); n int a; cin >> a; n int b; n if(i == 0) b = INF; n else{ n cout << ? << i << endl; n cout.flush(); n cin >> b; n } n return b-a; n } n n int main(){ n // freopen( input.txt , r , stdin); n // freopen( output.txt , w , stdout); n ios_base::sync_with_stdio(false); n cin.tie(0); n int n; cin >> n; n if(n == 1){ n cout << ! << 1 << endl; n cout.flush(); n return 0; n } n if(get(1) < 0){ n cout << ! << 1 << endl; n cout.flush(); n return 0; n } n if(get(n-1) > 0){ n cout << ! << n << endl; n cout.flush(); n return 0; n } n int lo = 0, hi = n-1; n while(lo < hi){ n int mid = lo+(hi-lo)/2; n if(get(mid) > 0) lo = mid+1; n else hi = mid; n } n cout << ! << lo << endl; n cout.flush(); n }"} +{"func_code_string": "#include n using namespace std; n int N, M; n int timew, cnt; n stack si; n int low[2000005], dep[2000005], siz[2000005], dfn[2000005], nex[2000005], n las[2000005], Arrive[2000005], st[2000005], cnt1; n bool isin[2000005]; n void jt(int xx, int yy) { n cnt++; n nex[cnt] = las[xx]; n las[xx] = cnt; n Arrive[cnt] = yy; n } n void tarjan(int noww) { n timew++; n low[noww] = dfn[noww] = timew; n si.push(noww); n isin[noww] = true; n for (int i = las[noww]; i; i = nex[i]) { n if (!dfn[Arrive[i]]) { n tarjan(Arrive[i]); n low[noww] = min(low[noww], low[Arrive[i]]); n } else if (isin[Arrive[i]]) n low[noww] = min(low[noww], dfn[Arrive[i]]); n } n if (low[noww] == dfn[noww]) { n cnt1++; n int k = -1; n while (k != noww) { n k = si.top(); n si.pop(); n isin[k] = false; n st[k] = cnt1; n siz[cnt1]++; n } n } n } n void Clear() { n cnt = 0; n cnt1 = 0; n timew = 0; n for (int i = 1; i <= N; i++) n las[i] = dep[i] = st[i] = siz[i] = dfn[i] = low[i] = dep[i] = 0; n } n int main() { n int T; n scanf( %d , &T); n while (T--) { n scanf( %d%d , &N, &M); n Clear(); n for (int i = 1; i <= M; i++) { n int u, v; n scanf( %d%d , &u, &v); n if (u != v) jt(u, v); n } n for (int i = 1; i <= N; i++) n if (!dfn[i]) tarjan(i); n if (siz[st[1]] == N) { n puts( No ); n continue; n } n for (int i = 1; i <= N; i++) n for (int j = las[i]; j; j = nex[j]) n if (st[i] != st[Arrive[j]]) dep[st[i]]++; n bool flag = false; n for (int i = 1; i <= cnt1; i++) { n if (!dep[i] && siz[i]) { n flag = true; n puts( Yes ); n vector ans[2]; n for (int j = 1; j <= N; j++) ans[st[j] == i].push_back(j); n printf( %d %d n , ans[1].size(), ans[0].size()); n for (auto &i : ans[1]) printf( %d , i); n cout << n ; n for (auto &i : ans[0]) printf( %d , i); n cout << n ; n break; n } n } n if (!flag) puts( No ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6; n const int inf = 1e9 + 100; n int a[N + 100], b[N + 100]; n vector > mon[N + 100]; n int tree[N * 4 + 100], lazy[N * 4 + 100]; n void build(int v, int tl, int tr) { n if (tl == tr) { n tree[v] = -b[tl + 1]; n return; n } n int tm = (tl + tr) / 2; n build(v * 2, tl, tm); n build(v * 2 + 1, tm + 1, tr); n tree[v] = max(tree[v * 2], tree[v * 2 + 1]); n } n void push(int v) { n tree[v * 2] += lazy[v]; n tree[v * 2 + 1] += lazy[v]; n lazy[v * 2] += lazy[v]; n lazy[v * 2 + 1] += lazy[v]; n lazy[v] = 0; n } n void update(int v, int tl, int tr, int l, int r, int addend) { n if (l > r) { n return; n } n if (tl == l && tr == r) { n tree[v] += addend; n lazy[v] += addend; n return; n } n push(v); n int tm = (tl + tr) / 2; n update(v * 2, tl, tm, l, min(r, tm), addend); n update(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, addend); n tree[v] = max(tree[v * 2], tree[v * 2 + 1]); n } n int query(int v, int tl, int tr, int l, int r) { n if (l > r) { n return -inf; n } n if (tl == l && tr == r) { n return tree[v]; n } n push(v); n int tm = (tl + tr) / 2; n return max(query(v * 2, tl, tm, l, min(r, tm)), n query(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r)); n } n int main() { n for (int i = 1; i <= N + 1; i++) { n a[i] = b[i] = inf; n } n int n, m, p; n scanf( %d%d%d , &n, &m, &p); n for (int i = 1; i <= n; i++) { n int cur, cost; n scanf( %d%d , &cur, &cost); n a[cur] = min(cost, a[cur]); n } n int mx = 0; n for (int i = 1; i <= m; i++) { n int cur, cost; n scanf( %d%d , &cur, &cost); n b[cur] = min(cost, b[cur]); n mx = max(mx, cur); n } n for (int i = 1; i <= p; i++) { n int x, y, z; n scanf( %d%d%d , &x, &y, &z); n mon[x].push_back(make_pair(y, z)); n } n for (int i = 1; i <= N; i++) { n sort(mon[i].begin(), mon[i].end()); n } n for (int i = N; i > 0; i--) { n a[i] = min(a[i], a[i + 1]); n b[i] = min(b[i], b[i + 1]); n } n build(1, 1, N); n int ans = -a[1] - b[1]; n int total = 0; n for (int i = 1; i <= N; i++) { n if (a[i + 1] == inf) { n break; n } n for (auto it : mon[i]) { n update(1, 1, N, it.first, N, it.second); n ans = max(ans, query(1, 1, N, 1, mx - 1) - a[i + 1]); n } n } n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n char s[500][500]; n int di[4] = {-1, 1, 0, 0}; n int dj[4] = {0, 0, -1, 1}; n typedef int int2d[500][500]; n int2d p[26]; n int2d d; n struct Pos { n int r, c; n Pos(int r = 0, int c = 0) : r(r), c(c) {} n void init(int r, int c) { n this->r = r; n this->c = c; n } n bool operator<(const Pos& p) const { n int d1 = d[r][c], d2 = d[p.r][p.c]; n return d1 < d2 || d1 == d2 && (r < p.r || r == p.r && c < p.c); n } n } wh[27]; n int n, m; n bool isDigit(char c) { return c >= 0 && c <= 9 ; } n set heap; n void calc(int i, int j, int2d& par) { n memset(d, 127, sizeof(d)); n d[i][j] = 0; n heap.insert(Pos(i, j)); n while (!heap.empty()) { n Pos p = *heap.begin(); n heap.erase(heap.begin()); n char ch = s[p.r][p.c]; n if (!isDigit(ch) && ch != s[i][j]) { n continue; n } n int cost = (isDigit(ch) ? ch - 0 : 1) + d[p.r][p.c]; n for (int dir = 0; dir < 4; dir++) { n int r = p.r + di[dir], c = p.c + dj[dir]; n if (r >= 0 && c >= 0 && r < n && c < m && s[r][c] != # ) { n if (d[r][c] > cost) { n heap.erase(Pos(r, c)); n d[r][c] = cost; n heap.insert(Pos(r, c)); n par[r][c] = dir; n } n } n } n } n } n char sm[10000]; n int main() { n int k; n cin >> n >> m >> k; n for (int i = 0; i < n; i++) { n scanf( %s , s[i]); n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (s[i][j] >= a && s[i][j] <= z ) { n wh[s[i][j] - a ].init(i, j); n calc(i, j, p[s[i][j] - a ]); n } n } n } n int r, c; n int r2, c2; n scanf( %d %d %s %d %d , &r, &c, sm, &r2, &c2); n r--, c--; n r2--, c2--; n calc(r2, c2, p[26]); n int len = strlen(sm); n for (int i = 0; i < len && k;) { n char ch = s[r][c]; n if (ch == sm[i]) { n i++; n continue; n } n int cost = (isDigit(ch) ? ch - 0 : 1); n int dir = p[sm[i] - a ][r][c]; n if (cost > k) { n k = 0; n break; n } n k -= cost; n r -= di[dir]; n c -= dj[dir]; n } n while (k > 0 && (r != r2 || c != c2)) { n char ch = s[r][c]; n int cost = (isDigit(ch) ? ch - 0 : 1); n if (cost > k) { n k = cost; n exit(1); n break; n } n k -= cost; n int dir = p[26][r][c]; n r -= di[dir]; n c -= dj[dir]; n } n printf( %d %d n , r + 1, c + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n T abs(T x) { n return x > 0 ? x : -x; n } n const int tt = 75; n int n; n int m; n int x[100]; n int y[100]; n int z[100]; n vector v; n vector w[300]; n int res[301][301][2]; n int was[301][301][2]; n map num; n int f[300]; n int calc() { n vector > v; n for (int i = 0; i < n; i++) n if (z[i]) { n v.push_back(make_pair(x[i], 1)); n v.push_back(make_pair(x[i] + y[i], -1)); n } else { n v.push_back(make_pair(x[i] - y[i], 1)); n v.push_back(make_pair(x[i], -1)); n } n sort((v).begin(), (v).end()); n int cur = 0, bal = 0; n for (int i = 0; i + 1 < 2 * n; i++) { n bal += v[i].second; n if (bal) cur += v[i + 1].first - v[i].first; n } n return cur; n } n int go(int i, int j, int t) { n if (j < i) { n t = 0; n j = i; n } n if (i == ((int)(v).size())) return 0; n if (was[i][j][t]) return res[i][j][t]; n was[i][j][t] = 1; n int cur = go(i + 1, j, t); n if ((!t || i < j) && f[i] > j) n cur = max(cur, go((t ? j : i) + 1, f[i], 0) + (v[f[i]] - v[j])); n for (int k = 0; k < ((int)(w[i]).size()); k++) n if (w[i][k] > j) n cur = max(cur, go((t ? j : i) + 1, w[i][k], 1) + (v[w[i][k]] - v[j])); n return res[i][j][t] = cur; n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d%d , &x[i], &y[i]); n v.push_back(x[i] - y[i]); n v.push_back(x[i]); n v.push_back(x[i] + y[i]); n } n sort((v).begin(), (v).end()); n v.resize(unique((v).begin(), (v).end()) - v.begin()); n for (int i = 0; i < ((int)(v).size()); i++) num[v[i]] = i; n for (int i = 0; i < n; i++) { n int a = num[x[i] - y[i]]; n int b = num[x[i]]; n int c = num[x[i] + y[i]]; n f[b] = c; n w[a].push_back(b); n } n printf( %d n , go(0, 0, 0)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() n { n ios_base :: sync_with_stdio(false); cin.tie(NULL); n int t ; cin >> t ; while(t--) n { n int a , b ; cin >> a >> b ; n a-=b ; n while(b--) cout << a ; n string d = cba ; n for(int i = 0 ; i < a ; i++) n { n cout << d[i % 3] ; n } n cout << endl ; n } n n } n n n n n "} +{"func_code_string": "#include n using namespace std; n long long n, m, rr[10][10]; n long long func(long long), dp[(1 << 21)]; n map > mr; n long long check(long long i, long long j) { n return (abs(mr[i].first - mr[j].first) + abs(mr[i].second - mr[j].second)) == n 3; n } n int main() { n scanf( %lld %lld , &n, &m); n if (n > m) swap(n, m); n if (n * m <= 21) { n long long x = 0; n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) { n mr[x++] = make_pair(i, j); n } n memset(dp, -1, sizeof(dp)); n cout << func(0); n } else { n long long ans = 0; n if (n == 1) { n ans += m - m % 6; n m = m % 6; n ans += (m >= 3 ? 2 * (m - 3) : 0); n } else n ans = n * m - (n * m) % 2; n cout << ans << n ; n } n } n long long func(long long mask) { n if (dp[mask] != -1) return dp[mask]; n long long ans = 0; n for (int i = 0; i < n * m; i++) { n for (int j = i + 1; j < n * m; j++) { n if ((mask & (1 << i)) == 0 && (mask & (1 << j)) == 0 && check(i, j)) { n ans = max(ans, 2 + func(mask | (1 << i) | (1 << j))); n } n } n } n return dp[mask] = ans; n } n "} +{"func_code_string": "#include n using namespace std; n bool f(int n, int h, int c, int t) { n return (2 * n + 1ll) * abs(1ll * n * (h + c - 2 * t) + t - c) <= n (2 * n - 1ll) * (1ll * n * (h + c - 2 * t) + h - t); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n long long t = 1; n cin >> t; n while (t--) { n int h, c, t; n cin >> h >> c >> t; n if (2 * t <= h + c) n cout << 2 n << n ; n else { n int a = h - t; n int b = 2 * t - c - h; n int k = 2 * (a / b) + 1; n long long val1 = n abs(k / 2 * 1ll * c + (k + 1) / 2 * 1ll * h - t * 1ll * k); n long long val2 = abs((k + 2) / 2 * 1ll * c + (k + 3) / 2 * 1ll * h - n t * 1ll * (k + 2)); n if (val1 * (k + 2) <= val2 * k) n cout << k << n ; n else n cout << k + 2 << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n #define sim template < class c n #define ris return * this n #define dor > debug & operator << n #define eni(x) sim > typename n enable_if(0) x 1, debug&>::type operator<<(c i) { n sim > struct rge { c b, e; }; n sim > rge range(c i, c j) { return rge{i, j}; } n sim > auto dud(c* x) -> decltype(cerr << *x, 0); n sim > char dud(...); n struct debug { n #ifndef ONLINE_JUDGE n ~debug() { cerr << endl; } n eni(!=) cerr << boolalpha << i; ris; } n eni(==) ris << range(begin(i), end(i)); } n sim, class b dor(pair < b, c > d) { n ris << ( << d.first << , << d.second << ) ; n } n sim dor(rge d) { n *this << [ ; n for (auto it = d.b; it != d.e; ++it) n *this << , + 2 * (it == d.b) << *it; n ris << ] ; n } n #else n sim dor(const c&) { ris; } n #endif n }; n #define imie(...) [ << #__VA_ARGS__ : << (__VA_ARGS__) << ] n n #define ll long long n n const ll mod = 998244353; n n long long power(long long x, ll y, ll p) n { n long long res = 1; // Initialize result n n x = x % p; // Update x if it is more than or n // equal to p n n while (y > 0) n { n n // If y is odd, multiply x with result n if (y & 1) n res = (res * x) % p; n n // y must be even now n y = y >> 1; // y = y/2 n x = (x * x) % p; n } n return res; n } n n // Returns n^(-1) mod p n long long modInverse(long long n, int p) n { n return power(n, p - 2, p); n } n n // Returns nCr % p using Fermat s little n // theorem. n long long nCrModPFermat(long long n,int r, int p) n { n // If n> n; n string s; n cin >> s; n ll cnt = 0, cnt2 = 0, tmp = 0; n for(ll i = 0; i < n; ++i) { n if(s[i] == 0 ) { n cnt2 = cnt2 + (tmp) / 2; n tmp = 0; n cnt++; n } else { n tmp++; n } n } n cnt2 = cnt2 + (tmp) / 2; n cout << nCrModPFermat(cnt + cnt2, cnt, mod) << endl; n } n n int main() n { n ll T; n cin >> T; n for(ll i = 1; i <= T; ++i) { n test_case(); n } n return 0; n }"} +{"func_code_string": "#include n #pragma GCC optimize(2) n using namespace std; n int rd() { n int k = 0; n char c = getchar(); n while (c > 9 || c < 0 ) c = getchar(); n while (c >= 0 && c <= 9 ) k = k * 10 + c - 0 , c = getchar(); n return k; n } n const int N = 300000, M = 600001; n int T, x, y, f[M], sx[M], sy[M]; n long long ans; n vector > v[M << 1]; n map, int> mp; n pair p; n int F(int x) { n while (x != f[x]) x = f[x]; n return x; n } n void Add(int x, int l, int r, int s, int t, pair p) { n if (s <= l && r <= t) { n v[x].push_back(p); n return; n } n if (s <= ((l + r) >> 1)) Add((x << 1), l, ((l + r) >> 1), s, t, p); n if (((l + r) >> 1) < t) Add((x << 1 | 1), ((l + r) >> 1) + 1, r, s, t, p); n } n void Solve(int x, int l, int r) { n long long pre = ans; n stack S; n for (int i = 0; i < v[x].size(); ++i) { n int a = F(v[x][i].first), b = F(v[x][i].second + N); n if (a == b) continue; n if (sx[a] + sy[a] > sx[b] + sy[b]) { n int t = a; n a = b, b = t; n } n ans -= (long long)sx[a] * sy[a] + (long long)sx[b] * sy[b], n f[a] = b, sx[b] += sx[a], sy[b] += sy[a]; n ans += (long long)sx[b] * sy[b], S.push(a); n } n if (l == r) n printf( %lld , ans); n else n Solve((x << 1), l, ((l + r) >> 1)), n Solve((x << 1 | 1), ((l + r) >> 1) + 1, r); n while (!S.empty()) { n int t = S.top(), z = f[t]; n S.pop(), f[t] = t, sx[z] -= sx[t], sy[z] -= sy[t]; n } n ans = pre; n } n int main() { n T = rd(); n for (int i = 1; i <= T; ++i) { n x = rd(), y = rd(), p = make_pair(x, y); n if (mp.count(p)) n Add(1, 1, T, mp[p], i - 1, p), mp.erase(p); n else n mp[p] = i; n } n for (auto t : mp) Add(1, 1, T, t.second, T, t.first); n for (int i = 1; i <= N; ++i) sx[f[i] = i] = 1; n for (int i = N + 1; i < M; ++i) sy[f[i] = i] = 1; n Solve(1, 1, T); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector adj[100007][2]; n long long ecnt[100007][2] = {0}; n long long ss[100007] = {0}; n long long sum = 0; n long long n, m, q; n int main() { n cin >> n >> m; n for (long long i = 0; i < m; i++) { n long long a, b; n cin >> a >> b; n --a; n --b; n if (a > b) swap(a, b); n adj[a][0].push_back(b); n adj[b][1].push_back(a); n ecnt[a][0]++; n ecnt[b][1]++; n } n for (long long i = 0; i < n; i++) { n ss[i] = ecnt[i][0] * ecnt[i][1]; n sum += ss[i]; n } n cin >> q; n cout << sum << endl; n while (q--) { n long long v; n cin >> v; n --v; n sum -= ss[v]; n ss[v] = 0; n ecnt[v][1] += ecnt[v][0]; n ecnt[v][0] = 0; n for (auto i : adj[v][0]) { n sum -= ecnt[i][0] * ecnt[i][1]; n ecnt[i][1]--; n ecnt[i][0]++; n sum += ecnt[i][0] * ecnt[i][1]; n ss[i] = ecnt[i][0] * ecnt[i][1]; n adj[i][0].push_back(v); n } n adj[v][0].clear(); n cout << sum << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n int maxdp[27]; n int dp[N]; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int n; n string str; n cin >> n >> str; n for (int i = 0; i < n; ++i) { n for (int c = 26; c > str[i] - a ; --c) n maxdp[str[i] - a ] = max(maxdp[c] + 1, maxdp[str[i] - a ]); n dp[i] = maxdp[str[i] - a ]; n } n cout << *max_element(dp, dp + n) << endl; n for (int i = 0; i < n; ++i) { n cout << dp[i] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int SIZE = 1e2 + 5; n int main() { n int n, m, c; n string s[SIZE], extract, f; n c = 0, f = acef ; n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> s[i]; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n extract.push_back(s[i][j]); n extract.push_back(s[i + 1][j]); n extract.push_back(s[i][j + 1]); n extract.push_back(s[i + 1][j + 1]); n sort(extract.begin(), extract.end()); n if (extract == f) c++; n extract.clear(); n } n } n cout << c << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long t, n, m, i, j; n cin >> n >> m; n string a[n]; n for (long long i = 0; i < n; i++) cin >> a[i]; n long long f = 0; n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < m; j++) { n if (a[i][j] == . ) continue; n if (i - 1 >= 0 && j - 1 >= 0 && a[i - 1][j] == X && n a[i][j - 1] == X && a[i - 1][j - 1] == . ) { n f = 1; n break; n } n if (i - 1 >= 0 && j + 1 < n && a[i - 1][j] == X && a[i][j + 1] == X && n a[i - 1][j + 1] == . ) { n f = 1; n break; n } n if (i + 1 < n && j - 1 >= 0 && a[i][j - 1] == X && a[i + 1][j] == X && n a[i + 1][j - 1] == . ) { n f = 1; n break; n } n if (i + 1 < n && j + 1 < n && a[i + 1][j] == X && a[i][j + 1] == X && n a[i + 1][j + 1] == . ) { n f = 1; n break; n } n } n if (f) break; n } n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < m; j++) { n if (a[i][j] == . ) continue; n if (i - 1 >= 0 && j - 1 >= 0 && a[i - 1][j - 1] == X && n (a[i - 1][j] == . || a[i][j - 1] == . )) { n f = 1; n break; n } n if (i - 1 >= 0 && j + 1 < n && a[i - 1][j + 1] == X && n (a[i - 1][j] == . || a[i][j + 1] == . )) { n f = 1; n break; n } n if (i + 1 < n && j - 1 >= 0 && a[i + 1][j - 1] == X && n (a[i + 1][j] == . || a[i][j - 1] == . )) { n f = 1; n break; n } n if (i + 1 < n && j + 1 < n && a[i + 1][j + 1] == X && n (a[i + 1][j] == . || a[i][j + 1] == . )) { n f = 1; n break; n } n } n if (f) break; n } n if (f) n cout << NO n ; n else n cout << YES n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e6 + 7; n pair > A[maxn]; n map X; n map Y; n int Hx[maxn], Hy[maxn]; n int ans[maxn]; n int fa[maxn]; n int fi(int u) { n if (fa[u] == u) return u; n return fa[u] = fi(fa[u]); n } n void un(int u, int v) { n int p1 = fi(u), p2 = fi(v); n if (p1 != p2) fa[p1] = p2; n } n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 0; i < n * m; i++) { n fa[i] = i; n scanf( %d , &A[i].first); n A[i].second.first = i / m; n A[i].second.second = i % m; n } n int j = -1; n sort(A, A + n * m); n for (int i = 0; i < n * m; i++) { n if (i != n * m - 1 && A[i].first == A[i + 1].first) continue; n for (int k = j + 1; k <= i; k++) { n int p = A[k].second.first * m + A[k].second.second; n int x = A[k].second.first, y = A[k].second.second; n Hx[x] = p; n Hy[y] = p; n } n for (int k = j + 1; k <= i; k++) { n int p = A[k].second.first * m + A[k].second.second; n int x = A[k].second.first, y = A[k].second.second; n un(Hx[x], p); n un(Hy[y], p); n } n for (int k = j + 1; k <= i; k++) { n int p = A[k].second.first * m + A[k].second.second; n int x = A[k].second.first, y = A[k].second.second; n int pa = fi(p); n ans[pa] = max(ans[pa], max(X[x], Y[y]) + 1); n } n for (int k = j + 1; k <= i; k++) { n int p = A[k].second.first * m + A[k].second.second; n int x = A[k].second.first, y = A[k].second.second; n X[x] = max(X[x], ans[fi(p)]); n Y[y] = max(Y[y], ans[fi(p)]); n } n j = i; n } n for (int i = 0; i < n * m; i++) { n printf( %d , ans[fi(i)]); n if (i % m == m - 1) printf( n ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n; n vector adj[100005], stx, sty; n long long mx = 0ll, ans[100005]; n int sz[100005], par[100005]; n pair centroid = {0, 0}; n bool cmp(int u, int v) { return sz[u] < sz[v]; } n void dfs(int nw, int bf) { n par[nw] = bf; n sz[nw] = 1; n for (int nx : adj[nw]) n if (nx != bf) { n dfs(nx, nw); n sz[nw] += sz[nx]; n } n sort(adj[nw].begin(), adj[nw].end(), cmp); n mx += 2 * min(sz[nw], n - sz[nw]); n centroid = max(centroid, {min(sz[nw], n - sz[nw]), nw}); n } n void get_subtree(int nw, int bf, vector &v) { n v.push_back(nw); n for (int nx : adj[nw]) n if (nx != bf) get_subtree(nx, nw, v); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int u, v, i = 1; i < n; i++) { n cin >> u >> v; n adj[u].push_back(v); n adj[v].push_back(u); n } n dfs(1, 0); n int x = centroid.second, y = par[x]; n if (sz[x] * 2 > n) swap(x, y); n get_subtree(x, y, stx); n get_subtree(y, x, sty); n for (int i = 0; i < stx.size(); i++) { n ans[stx[i]] = sty[i]; n ans[sty[sty.size() - stx.size() + i]] = stx[i]; n } n for (int i = 0; i < sty.size() - stx.size(); i++) n ans[sty[i]] = sty[stx.size() + i]; n cout << mx << endl; n for (int i = 1; i <= n; i++) cout << ans[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int a, b; n bool temp = false; n int main() { n cin >> a; n for (b = 1; b <= 500; b++) n if ((b * (b + 1)) / 2 == a) { n temp = true; n break; n } n if (temp) n cout << YES ; n else n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1e5 + 9, lg = 20; n int n, q, timer = 1; n vector adj[inf], level[inf]; n int depth[inf], in[inf], out[inf], parent[inf][lg]; n void dfs(int u, int par) { n in[u] = timer++; n level[depth[u]].push_back(in[u]); n for (auto v : adj[u]) n if (v != par) parent[v][0] = u, depth[v] = depth[u] + 1, dfs(v, u); n out[u] = timer++; n } n int KthParent(int u, int k) { n for (int j = lg - 1; j >= 0; j--) n if (k & (1ll << j)) u = parent[u][j]; n return u; n } n int CntLevelInSubtree(int u, int h) { n return upper_bound(level[h].begin(), level[h].end(), out[u]) - n lower_bound(level[h].begin(), level[h].end(), in[u]); n } n int main() { n cin >> n; n for (int i = 1; i <= n; i++) { n int tmp; n cin >> tmp; n if (tmp) adj[tmp].push_back(i), adj[i].push_back(tmp); n } n for (int i = 1; i <= n; i++) n if (!in[i]) dfs(i, 0); n for (int j = 1; j < lg; j++) n for (int i = 1; i <= n; i++) parent[i][j] = parent[parent[i][j - 1]][j - 1]; n cin >> q; n while (q--) { n int v, p; n cin >> v >> p; n if (depth[v] < p) { n cout << 0 << ; n continue; n } n int u = KthParent(v, p); n cout << CntLevelInSubtree(u, depth[v]) - 1 << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const int maxn = 1000000 + 5; n int f[maxn], inv[maxn], finv[maxn]; n void init() { n inv[1] = 1; n for (int i = 2; i < maxn; i++) n inv[i] = (mod - mod / i) * 1ll * inv[mod % i] % mod; n f[0] = finv[0] = 1; n for (int i = 1; i < maxn; i++) { n f[i] = f[i - 1] * 1ll * i % mod; n finv[i] = finv[i - 1] * 1ll * inv[i] % mod; n } n } n int C(int n, int m) { n if (m < 0 || m > n) return 0; n return f[n] * 1ll * finv[n - m] % mod * finv[m] % mod; n } n long long qpow(long long x, long long n) { n long long r = 1; n while (n > 0) { n if (n & 1) r = r * x % mod; n n >>= 1; n x = x * x % mod; n } n return r; n } n long long T(long long n, long long k) { n if (k == n) return 1; n return k * qpow(n, n - k - 1) % mod; n } n int n, m, a, b; n int main() { n init(); n cin >> n >> m >> a >> b; n long long ans = 0; n for (int i = 1; i < n; i++) { n long long tot = 1ll * C(m - 1, i - 1) * C(n - 2, i - 1) % mod * f[i - 1] % n mod * qpow(m, n - i - 1) % mod * T(n, i + 1) % mod; n ans += tot; n if (ans >= mod) ans -= mod; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int func1(long long int i) { n long long int m = i; n return i * (i + 1) * (2 * i + 1) / 6 - (m + m + 2) * i * (i + 1) / 2 + n (m + m + 1 + m * m) * i; n } n long long int func2(long long int x, long long int i) { n return x * (i + i * i - i * (i + 1) / 2); n } n int main() { n long long int inp, tem, ans = 0, tem2; n cin >> inp; n vector > v; n bool flag = 0; n for (int i = 0; i < 100000000; i++) n if (ans > 0) ans += 1; n ans = 0; n for (long long int i = 1; func1(i) <= inp; i++) { n tem = inp - func1(i); n if (!tem) { n flag = 1; n v.push_back(make_pair(i, i)); n } else { n tem2 = func2(1, i); n if (tem % tem2 == 0) v.push_back(make_pair(i, i + tem / tem2)); n } n } n if (!flag) n cout << 2 * v.size(); n else n cout << 2 * v.size() - 1; n cout << n ; n for (int i = 0; i < v.size(); i++) n cout << v[i].first << << v[i].second << n ; n int i = v.size() - 1; n if (flag) i--; n for (; i >= 0; i--) cout << v[i].second << << v[i].first << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void chkMax(T &x, T y) { n if (y > x) x = y; n } n template n void chkMin(T &x, T y) { n if (y < x) x = y; n } n template n void inline read(T &x) { n int f = 1; n x = 0; n char s = getchar(); n while (s < 0 || s > 9 ) { n if (s == - ) f = -1; n s = getchar(); n } n while (s <= 9 && s >= 0 ) x = x * 10 + (s ^ 48), s = getchar(); n x *= f; n } n const int N = 2005; n int n, f[10][10][10][10][10], g[10][10][10][10][10]; n int ans = 2e9; n int main() { n read(n); n memset(f, 0x3f, sizeof f); n f[1][0][0][0][0] = 0; n for (int i = 1; i <= n; i++) { n int x, y; n read(x), read(y); n memcpy(g, f, sizeof f); n memset(f, 0x3f, sizeof f); n for (int p = 1; p <= 9; p++) { n for (int a = 0; a <= 9; a++) { n for (int b = 0; b <= 9; b++) { n for (int c = 0; c <= 9; c++) { n for (int d = 0; d <= 9; d++) { n if (a == 0) { n chkMin(f[x][y][b][c][d], g[p][a][b][c][d] + abs(p - x)); n } n if (b == 0) { n chkMin(f[x][a][y][c][d], g[p][a][b][c][d] + abs(p - x)); n } n if (c == 0) { n chkMin(f[x][a][b][y][d], g[p][a][b][c][d] + abs(p - x)); n } n if (d == 0) { n chkMin(f[x][a][b][c][y], g[p][a][b][c][d] + abs(p - x)); n } n } n } n } n } n } n for (int a = 9; ~a; a--) { n for (int b = 9; ~b; b--) { n for (int c = 9; ~c; c--) { n for (int d = 9; ~d; d--) { n for (int p = 1; p <= 9; p++) { n if (a) chkMin(f[a][0][b][c][d], f[p][a][b][c][d] + abs(p - a)); n if (b) chkMin(f[b][a][0][c][d], f[p][a][b][c][d] + abs(p - b)); n if (c) chkMin(f[c][a][b][0][d], f[p][a][b][c][d] + abs(p - c)); n if (d) chkMin(f[d][a][b][c][0], f[p][a][b][c][d] + abs(p - d)); n } n } n } n } n } n } n for (int i = 1; i <= 9; i++) chkMin(ans, f[i][0][0][0][0]); n printf( %d n , ans + 2 * n); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string a, b; n int k = 0, l = 0, n; n cin >> a >> b; n n = a.size(); n for (int i = 0; i < n; i++) { n if (a[i] == 4 && b[i] == 7 ) { n k++; n } else if (a[i] == 7 && b[i] == 4 ) { n l++; n } n } n int p = max(k, l); n cout << p << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC target( sse4 ) n using namespace std; n template n T gcd(T a, T b) { n return ((b == 0) ? a : gcd(b, a % b)); n } n void solve() { n int n, k; n long long x; n cin >> n >> k >> x; n string s; n cin >> s; n x--; n int cnt = 0; n vector nm; n for (int i = n - 1; i >= 0; i--) { n if (s[i] == * ) n cnt++; n else { n if (cnt) nm.push_back(cnt); n cnt = 0; n } n } n if (cnt) nm.push_back(cnt); n int uwu = 0; n vector d; n while (x > 0) { n int cr = (nm[uwu++] * k) + 1; n d.push_back(x % cr); n x /= cr; n } n int ind = 0, lst = -1; n string ans = ; n for (int i = n - 1; i >= 0; i--) { n if (s[i] == a ) n ans += a , lst = 1; n else { n if (!lst) continue; n if (ind == (int)(d.size())) continue; n for (int j = 0; j < (int)(d[ind]); j++) ans += b ; n ind++; n lst = 0; n } n } n reverse(ans.begin(), ans.end()); n cout << ans << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int t; n cin >> t; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int tt; n cin >> tt; n while (tt--) { n long long n, s, t; n cin >> n >> s >> t; n cout << max(n - s + 1, n - t + 1) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long f[105], g[105][2], q[105], t, n; n int main() { n f[1] = 1; n f[2] = 2; n for (int i = 3; i <= 86; ++i) f[i] = f[i - 1] + f[i - 2]; n int cases; n for (scanf( %d , &cases); cases--;) { n scanf( %I64d , &n); n t = 0; n for (int i = 86; i; --i) n if (f[i] <= n) q[++t] = i, n -= f[i]; n g[t][0] = 1; n g[t][1] = (q[t] - 1) >> 1; n for (int i = t - 1; i; --i) { n g[i][0] = g[i + 1][0] + g[i + 1][1]; n int l = q[i] - q[i + 1] - 1; n g[i][1] = (l >> 1) * g[i + 1][0] + ((l + 1) >> 1) * g[i + 1][1]; n } n printf( %I64d n , g[1][0] + g[1][1]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n namespace runzhe2000 { n const int INF = 1 << 29; n int ft[100005], gt[100005], f[100005][10], g[100005][10], timer = 1, c[10], n sta[100005], top; n char s[100005]; n bool insta[100005]; n struct node { n int l, r, v; n } no[100005]; n void del(int x) { n no[no[x].l].r = no[x].r; n no[no[x].r].l = no[x].l; n } n void main() { n int n, q; n scanf( %d%d%s , &n, &q, s + 1); n for (int i = 1, v; i <= n; i++) { n if (s[i] >= 0 && s[i] <= 9 ) n v = s[i] - 0 ; n else n v = s[i] == < ? 11 : 10; n no[i] = (node){i - 1, i + 1, v}; n } n memset(ft, 63, sizeof(ft)); n memset(gt, 63, sizeof(gt)); n ++timer; n ++n; n no[n] = (node){n - 1, n + 1, 10}; n for (int l = 1; l <= n; l++) n if (ft[l] > INF) { n for (int cur = l, next, pos = 10; l <= cur && cur <= n; n cur = next, ++timer) { n if (timer < ft[cur]) { n ft[cur] = timer; n for (int i = 0; i < 10; i++) f[cur][i] = c[i]; n } n if (no[cur].v < 10) { n c[no[cur].v--]++; n if (no[cur].v < 0) del(cur); n } else { n pos = no[cur].v; n } n next = pos == 11 ? no[cur].l : no[cur].r; n if (no[cur].v > 9 && no[next].v > 9) del(cur); n if (!insta[cur]) sta[++top] = cur, insta[cur] = 1; n if (pos == 11) { n for (; no[cur].l < sta[top] && sta[top] <= cur && top; --top) { n gt[sta[top]] = ++timer; n for (int i = 0; i < 10; i++) g[sta[top]][i] = c[i]; n } n } n } n } n for (; q--;) { n int l, r; n scanf( %d%d , &l, &r); n if (ft[r + 1] < gt[l]) { n for (int i = 0; i < 10; i++) n printf( %d%c , f[r + 1][i] - f[l][i], i == 9 ? n : ); n } else { n for (int i = 0; i < 10; i++) n printf( %d%c , g[l][i] - f[l][i], i == 9 ? n : ); n } n } n } n } // namespace runzhe2000 n int main() { runzhe2000::main(); } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n int r = 0, b = 0, y = 0, g = 0; n int len = s.size(); n for (int i = 0; i < len; i++) { n if (s[i] == B ) n b = i % 4; n else if (s[i] == G ) n g = i % 4; n else if (s[i] == R ) n r = i % 4; n else if (s[i] == Y ) n y = i % 4; n } n int w = 0, x = 0, yy = 0, z = 0, pos; n for (int i = 0; i < len; i++) { n if (s[i] == ! ) { n pos = i % 4; n if (pos == r) n w++; n else if (pos == b) n x++; n else if (pos == y) n yy++; n else if (pos == g) n z++; n } n } n cout << w << << x << << yy << << z << endl; n return 0; n } n "} +{"func_code_string": "#include n int main() { n unsigned short x; n std::cin >> x; n (x > 1) ? std::cout << x << << x : std::cout << -1; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k, a[300005], b[300005]; n int main() { n cin >> n >> k; n k--; n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int i = 1; i < n; i++) b[i] = a[i + 1] - a[i]; n long long res = a[n] - a[1]; n sort(b + 1, b + n); n for (int i = n - 1; i >= n - k; i--) res -= b[i]; n cout << res; n return 0; n } n "} +{"func_code_string": "#include n int main() { n char a[3][4]; n int i, f; n for (i = 0; i < 3; i++) scanf( %s , a[i]); n if (a[0][0] == a[2][2] && a[0][1] == a[2][1] && a[0][2] == a[2][0] && n a[1][0] == a[1][2]) n f = 1; n else n f = 0; n if (f == 1) n printf( YES n ); n else n printf( NO n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int T = 31; n const int mod = 1000000007; n const long long oo = 1LL << 60; n long long N; n int K; n long long B[T][T]; n long long power[70]; n long long dp[70][T][T]; n bool bio[70]; n long long rot[T][T][T]; n long long mult(long long a, long long b) { n if (a == 0) return 0; n if (b >= oo / a + 1) return oo; n return a * b; n } n void mult(long long A[T][T], long long B[T][T]) { n static long long C[T][T]; n for (int i = (0); i < (T); ++i) n for (int j = (0); j < (T); ++j) C[i][j] = 0; n for (int i = (0); i < (T); ++i) n for (int j = (0); j < (T); ++j) n for (int k = (0); k < (T); ++k) n C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % mod; n for (int i = (0); i < (T); ++i) n for (int j = (0); j < (T); ++j) A[i][j] = C[i][j]; n } n void rec(long long prefix, int n, long long A[T][T]) { n long long lo = mult(prefix, power[n]); n long long hi = lo + power[n] - 1; n if (lo >= N) return; n long long z = prefix % K; n mult(A, rot[z]); n if (n == 0) { n mult(A, B); n } else { n bool memo = hi < N; n auto AA = memo ? dp[n] : A; n if (!bio[n] && memo) n for (int i = (0); i < (T); ++i) AA[i][i] = 1; n if (!bio[n] || !memo) n for (int i = (0); i < (K); ++i) rec(prefix * K + i, n - 1, AA); n if (memo) bio[n] = true, mult(A, AA); n } n mult(A, rot[(K - z) % K]); n } n int main() { n scanf( %lld%d , &N, &K); n for (int i = (0); i < (K); ++i) B[i][i] = 1; n for (int i = (1); i < (K); ++i) B[i][0] = 1; n B[K][0] = 1; n B[K][K] = 1; n for (int x = (0); x < (K); ++x) n for (int i = (0); i < (K); ++i) rot[x][i][(i + x) % K] = 1; n for (int x = (0); x < (K); ++x) n for (int i = (K); i < (T); ++i) rot[x][i][i] = 1; n static long long A[T][T]; n A[0][K] = 1; n power[0] = 1; n for (int i = (1); i < (70); ++i) power[i] = mult(power[i - 1], K); n rec(0, 69, A); n long long ans = 1; n for (int i = (0); i < (K); ++i) ans = (ans + A[0][i]) % mod; n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base ::sync_with_stdio(false); n cin.tie(NULL); n int n, p, q; n cin >> n; n vector> v1; n int x1, x2; n for (size_t i = 0; i < n; i++) { n cin >> x1 >> x2; n v1.push_back(make_pair(x1, x2)); n } n bool s = true; n sort(v1.begin(), v1.end()); n for (size_t i = 0; i < n; i++) { n if (v1[i].second > v1[i + 1].second && i + 1 < n) { n s = false; n break; n } n } n if (s == true) { n cout << Poor Alex ; n } else { n cout << Happy Alex ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n int n; n double f1[N], f2[N], f3[N], a[N], ans; n int main() { n ios::sync_with_stdio(false); n cin >> n; n for (int i = 1; i <= n; ++i) { n cin >> a[i]; n f1[i] = a[i] * (f1[i - 1] + 1); n f2[i] = a[i] * (f2[i - 1] + 1 + 2 * f1[i - 1]); n f3[i] = a[i] * (f3[i - 1] + 3 * f2[i - 1] + 3 * f1[i - 1] + 1); n } n for (int i = 1; i <= n + 1; ++i) ans += (1 - a[i]) * f2[i - 1]; n printf( %.10lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n; n scanf( %d , &n); n printf( %d , n % 2); n } n "} +{"func_code_string": "#include n using namespace std; n vector t; n int n, x, i, j, h, sol, temp; n int main() { n ios::sync_with_stdio(false); n cin >> n; n for (i = 0; i < n; i++) { n cin >> x; n t.push_back(x); n } n cin >> h; n sort(t.begin(), t.end()); n sol = 0; n for (i = 0; i < n; i++) { n temp = 1; n for (j = i + 1; j < n; j++) { n if (t[j] - t[i] <= h) temp++; n } n sol = max(sol, temp); n } n cout << sol << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 305; n int n, m; n class Point { n public: n long long x, y; n Point() : x(0), y(0) {} n Point(long long _x, long long _y) : x(_x), y(_y) {} n void read() { scanf( %lld%lld , &x, &y); } n Point operator+(const Point &o) const { return Point(x + o.x, y + o.y); } n Point operator-(const Point &o) const { return Point(x - o.x, y - o.y); } n long long operator*(const Point &o) const { return x * o.y - y * o.x; } n bool operator<(const Point &o) const { n int c = (y == 0 && x > 0) || (y > 0); n int oc = (o.y == 0 && o.x > 0) || (o.y > 0); n if (c != oc) return c > oc; n return (*this) * o > 0; n } n } p[maxn]; n class Edge { n public: n Point w; n int u, v; n Edge() {} n Edge(Point _w, int _u, int _v) : w(_w), u(_u), v(_v) {} n bool operator<(const Edge &o) const { return w < o.w; } n } e[maxn * maxn]; n long long dp[maxn][maxn][6]; n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) p[i].read(); n for (int i = 0; i < n; i++) n for (int j = i + 1; j < n; j++) { n e[m++] = Edge(p[j] - p[i], i, j); n e[m++] = Edge(p[i] - p[j], j, i); n } n sort(e, e + m); n for (int i = 0; i < n; i++) dp[i][i][0] = 1; n for (int i = 0; i < m; i++) n for (int j = 0; j < n; j++) n for (int k = 0; k < 5; k++) dp[j][e[i].v][k + 1] += dp[j][e[i].u][k]; n long long ans = 0; n for (int i = 0; i < n; i++) ans += dp[i][i][5]; n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n long long n, x; n cin >> n >> x; n string second; n cin >> second; n long long ans = 0; n long long sm = 0; n for (long long i = 0; i < n; i++) { n if (second[i] == 0 ) n sm++; n else n sm--; n } n long long c = 0; n for (long long i = 0; i < n; i++) { n if (sm == 0 && c == x) { n cout << -1 << endl; n return; n } n if ((x - c) % sm == 0 && (x - c) / sm >= 0 && sm != 0) ans++; n if (second[i] == 0 ) n c++; n else n c--; n } n cout << ans << endl; n } n int main() { n long long t; n cin >> t; n while (t--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n struct sort_pred { n bool operator()(const std::pair &left, n const std::pair &right) { n return right.first > left.first; n } n }; n int n, m, k, t; n int r = 0; n vector visited; n vector> v; n vector distanc; n queue q; n map, int> mp; n vector chosen; n void bfs(int first) { n visited[first] = true; n q.push(first); n while (!q.empty()) { n int s = q.front(); n q.pop(); n for (auto u : v[s]) { n if (distanc[s] - mp[make_pair(s, u)] >= 0 && n distanc[s] - mp[make_pair(s, u)] > distanc[u]) { n if (!visited[u]) r++; n visited[u] = true; n distanc[u] = distanc[s] - mp[make_pair(s, u)]; n if (chosen[u]) distanc[u] = t; n q.push(u); n } n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n map mp; n vector b(n); n for (int i = 0; i < n; i++) { n int first; n cin >> first; n mp[first] = i + 1; n } n for (int i = 0; i < n; i++) { n int first; n cin >> first; n cout << mp[first] << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const int inf = 1e9 + 5; n long long powmod(long long a, long long b) { n long long ret = 1; n while (b) { n if (b & 1) ret = (ret * a) % mod; n a = (a * a) % mod; n b >>= 1; n } n return ret; n } n const int maxn = 3e5 + 5; n long long a[maxn]; n int n, m; n int q[maxn]; n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cin >> n; n long long tot = 0; n for (int i = 0; i <= n - 1; i++) { n cin >> a[i]; n tot += a[i]; n } n sort(a, a + n); n cin >> m; n for (int i = 0; i <= m - 1; i++) { n cin >> q[i]; n cout << tot - a[n - q[i]] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1002000, CAN = 34; n int n, m, p, vis[MAXN], pr[MAXN], pcnt; n char w1[MAXN], w2[MAXN]; n vector can[300]; n int muln(int x, int y) { return 1LL * x * y % p; } n int mo(int x) { n while (x >= p) x -= p; n while (x < 0) x += p; n return x; n } n int qpow(int x, int y) { n int ret = 1; n for (; y; y >>= 1, x = muln(x, x)) n if (y & 1) ret = muln(ret, x); n return ret; n } n struct poly { n int deg; n vector a; n poly(int x = 0) : deg(x) { a.resize(x + 1, 0); } n int& operator[](int idx) { return a[idx]; } n void print(string s) { n cerr << Poly << s << : ; n for (auto g : a) printf( %d , g); n cerr << endl; n } n int at(int x) { n x = mo(x); n int ret = 0; n for (int i = deg; i >= 0; --i) ret = mo(muln(ret, x) + mo(a[i])); n return ret; n } n void norm() { n for (auto& g : a) g = mo(g); n } n } I; n void sieve() { n for (int i = 2; i <= 1000000; ++i) { n if (!vis[i]) { n pr[++pcnt] = i; n } n for (int j = 1; j <= pcnt && i * pr[j] <= 1000000; ++j) { n vis[i * pr[j]] = true; n if (i % pr[j] == 0) break; n } n } n for (int k = 1, i = pr[k]; k <= pcnt; i = pr[++k]) { n if (i > m) n for (int j = 1; j <= CAN; ++j) n if ((i - 1) % pr[j] == 0) can[j].push_back(i); n } n } n void sol(int opt) { n int d = pr[opt]; n poly a(d - 1); n for (int i = 0; i < n; ++i) a[i % d] += I[i]; n for (auto pri : can[opt]) { n p = pri; n int rr = 2; n while (qpow(rr, (p - 1) / d) == 1) rr++; n rr = qpow(rr, (p - 1) / d); n for (int Cnt = 1; Cnt < d; ++Cnt) { n int r = qpow(rr, Cnt); n if (r < 2 || r > p - 2) continue; n int val = a.at(r); n if (val == 0) { n printf( %d %d n , p, r); n exit(0); n } n } n } n } n int main() { n scanf( %d%d%s%s , &n, &m, w1, w2); n sieve(); n I = poly(n - 1); n for (int i = 0; i < n; ++i) I[i] = w1[i] - w2[i]; n for (int i = 1; i <= CAN; ++i) sol(i); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int a[100007], ans[100007], vis[100007]; n int count(int x) { n int cnt = 0, now = 0; n memset(vis, 255, sizeof(vis)); n for (int i = 1; i <= n; i++) { n if (vis[a[i]] == now) continue; n vis[a[i]] = now; n if (++cnt > x) { n cnt = 1; n vis[a[i]] = ++now; n } n } n return now + 1; n } n void work(int l, int r) { n if (l > r) return; n int cnt1 = count(l), cnt2 = count(r); n if (cnt1 == cnt2) { n for (int i = l; i <= r; i++) ans[i] = cnt1; n return; n } n ans[l] = cnt1; n ans[r] = cnt2; n int mid = (l + r) >> 1; n work(l + 1, mid); n work(mid + 1, r - 1); n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n work(1, n); n for (int i = 1; i <= n; i++) printf( %d , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e5 + 5; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n long long n; n cin >> n; n long long a[n]; n for (long long i = 0; i < n; i++) cin >> a[i]; n vector good, bad; n for (long long i = 0; i < n; i++) { n long long val = sqrt(a[i]); n if (val * val == a[i]) n good.push_back(a[i]); n else n bad.push_back(a[i]); n } n long long sz1 = good.size(), sz2 = bad.size(); n if (sz1 == sz2) { n cout << 0 << n ; n } else if (sz1 > sz2) { n long long nz = 0; n for (auto it : good) { n if (it) nz++; n } n long long req = (sz1 - sz2) / 2; n if (nz >= req) n cout << req << n ; n else n cout << nz + (req - nz) * 2 << n ; n } else { n vector ans; n long long req = (sz2 - sz1) / 2; n for (auto it : bad) { n long long val = sqrt(it); n long long down = it - val * val, up = (val + 1) * (val + 1) - it; n ans.push_back(min(down, up)); n } n sort(ans.begin(), ans.end()); n long long fans = 0; n for (long long i = 0; i < req; i++) { n fans += ans[i]; n } n cout << fans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = (1 << 22) + 5; n int n, m; n bool is[MAX], seen[MAX]; n int conj(int x) { n int r = 0; n for (int i = 0; i < n; ++i) n if (!(x & (1 << i))) r += (1 << i); n return r; n } n void dfs(int st, bool p = 0) { n if (seen[st]) return; n seen[st] = 1; n if (is[st]) dfs(conj(st), 1); n if (p) { n for (int i = 0; i < n; ++i) n if (st & (1 << i)) { n dfs(st - (1 << i), 1); n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0), cout.tie(0); n cin >> n >> m; n vector st((1 << n) + 1, 0); n vector lz((1 << n) + 1, 0); n for (int i = 0; i < m; ++i) { n int x; n cin >> x; n is[x] = 1; n } n int cnt = 0; n for (int i = 0; i < (1 << n); ++i) { n if (!seen[i] && is[i]) { n dfs(i); n ++cnt; n } n } n cout << cnt << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main(void) { n long long int n, x; n cin >> n; n vector > a(n); n for (long long int i = 0; i < n; i++) { n cin >> x; n for (long long int j = 0; j < x; j++) { n long long int tp; n cin >> tp; n a[i].push_back(tp); n } n } n long long int a1 = 0, b = 0; n vector q; n for (long long int i = 0; i < n; i++) { n long long int f = a[i].size(); n if (f % 2 != 0) { n for (long long int j = 0; j < (f - 1) / 2; j++) { n a1 += a[i][j]; n } n for (long long int j = (f - 1) / 2 + 1; j < f; j++) { n b += a[i][j]; n } n q.push_back(a[i][(f - 1) / 2]); n } else { n for (long long int j = 0; j < f / 2; j++) { n a1 += a[i][j]; n } n for (long long int j = f / 2; j < f; j++) { n b += a[i][j]; n } n } n } n sort(q.begin(), q.end(), greater()); n for (long long int k = 0; k < q.size(); k++) { n if (k % 2 == 0) n a1 += q[k]; n else n b += q[k]; n } n cout << a1 << << b; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 3 * (int)1e5 + 100; n int b[maxN]; n int t[4 * maxN]; n int a[maxN]; n void build(int v, int tl, int tr) { n if (tl == tr) { n t[v] = a[tl]; n return; n } n int tm = (tl + tr) / 2; n build(v + v, tl, tm); n build(v + v + 1, tm + 1, tr); n t[v] = min(t[v + v], t[v + v + 1]); n } n void upd(int v, int tl, int tr, int pos, int val) { n if (tl == tr) { n t[v] = val; n return; n } n int tm = (tl + tr) / 2; n if (pos <= tm) n upd(v + v, tl, tm, pos, val); n else n upd(v + v + 1, tm + 1, tr, pos, val); n t[v] = min(t[v + v], t[v + v + 1]); n } n const int INF = (int)1e9 + 100; n int get(int v, int tl, int tr, int l, int r) { n if (l > r) return INF; n if (tl == l && tr == r) { n return t[v]; n } n int tm = (tl + tr) / 2; n return min(get(v + v, tl, tm, l, min(r, tm)), n get(v + v + 1, tm + 1, tr, max(l, tm + 1), r)); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n int q; n cin >> q; n while (q--) { n int n; n cin >> n; n set > s; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n s.insert(make_pair(a[i], i)); n } n bool ok = true; n build(1, 1, n); n for (int i = 1; i <= n; i++) { n cin >> b[i]; n if (!ok) continue; n auto it = s.lower_bound(make_pair(b[i], -1)); n if (it == s.end() || ((it->first) != b[i])) { n ok = false; n continue; n } n int ind = (it->second); n s.erase(it); n if (b[i] != get(1, 1, n, 1, ind)) { n ok = false; n } n upd(1, 1, n, ind, INF); n } n if (ok) n cout << YES << n ; n else n cout << NO << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[11]; n int main() { n int i, n, m, x; n while (scanf( %d , &a[0]) > 0) { n int c[33] = {0}; n c[a[0]]++; n for ((i) = 0; (i) < (5); (i)++) { n scanf( %d , &a[i + 1]); n c[a[i + 1]]++; n } n bool f = 0; n int mx = 0; n for ((i) = 0; (i) < (11); (i)++) { n mx = max(mx, c[i]); n c[i] = c[i] % 4; n if (c[i] == 2) f = 1; n } n if (mx < 4) n printf( Alien n ); n else if (f) n printf( Elephant n ); n else n printf( Bear n ); n } n return 0; n } n "} +{"func_code_string": "#include n const int MAXN = 2000 + 10; n const int INF = std::numeric_limits::max(); n const double EPS = 1e-6; n const int dx[] = {1, 0, -1, 0}; n const int dy[] = {0, 1, 0, -1}; n int a[MAXN][MAXN]; n std::deque, int>> q; n using std::cin; n using std::cout; n using std::endl; n int main() { n std::ios_base::sync_with_stdio(false); n std::cin.tie(0); n std::cout.tie(0); n int n, m; n cin >> n >> m; n int r, c; n cin >> r >> c; n int x, y; n cin >> x >> y; n for (int i = 0; i <= n + 1; ++i) { n for (int j = 0; j <= m + 1; ++j) { n a[i][j] = -1; n } n } n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n char c; n cin >> c; n if (c == . ) a[i][j] = INF; n } n } n q.push_back({{r, c}, 0}); n a[r][c] = 0; n while (!q.empty()) { n int cur_x = q.front().first.first, cur_y = q.front().first.second, n cur_step = q.front().second; n q.pop_front(); n for (int i = 0; i < 4; ++i) { n if (a[cur_x + dx[i]][cur_y + dy[i]] > cur_step + (dy[i] == -1)) { n a[cur_x + dx[i]][cur_y + dy[i]] = cur_step + (dy[i] == -1); n if (dy[i] == -1) n q.push_back({{cur_x + dx[i], cur_y + dy[i]}, cur_step + 1}); n else n q.push_front({{cur_x + dx[i], cur_y + dy[i]}, cur_step}); n } n } n } n int ans = 0; n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n if (a[i][j] != -1) { n if (a[i][j] <= x && a[i][j] + j - c <= y) { n ++ans; n } n } n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast,unroll-loops,no-stack-protector,fast-math,inline ) n #pragma GCC target( n sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) n using namespace std; n template n ostream &operator<<(ostream &os, const vector &v) { n os << { ; n string sep; n for (const auto &x : v) os << sep << x, sep = , ; n return os << } ; n } n template n ostream &operator<<(ostream &os, const pair &p) { n return os << ( << p.first << , << p.second << ) ; n } n void dbg_out() { cerr << endl; } n template n void dbg_out(Head H, Tail... T) { n cerr << << H; n dbg_out(T...); n } n template n struct _m_int { n int val; n _m_int(int64_t v = 0) { n if (v < 0) v = v % MOD + MOD; n if (v >= MOD) v %= MOD; n val = v; n } n static int inv_mod(int a, int m = MOD) { n int g = m, r = a, x = 0, y = 1; n while (r != 0) { n int q = g / r; n g %= r; n swap(g, r); n x -= q * y; n swap(x, y); n } n return x < 0 ? x + m : x; n } n explicit operator int() const { return val; } n explicit operator int64_t() const { return val; } n _m_int &operator+=(const _m_int &other) { n val -= MOD - other.val; n if (val < 0) val += MOD; n return *this; n } n _m_int &operator-=(const _m_int &other) { n val -= other.val; n if (val < 0) val += MOD; n return *this; n } n static unsigned fast_mod(uint64_t x, unsigned m = MOD) { n return x % m; n unsigned x_high = x >> 32, x_low = (unsigned)x; n unsigned quot, rem; n asm( divl %4 n : =a (quot), =d (rem) : d (x_high), a (x_low), r (m)); n return rem; n } n _m_int &operator*=(const _m_int &other) { n val = fast_mod((uint64_t)val * other.val); n return *this; n } n _m_int &operator/=(const _m_int &other) { return *this *= other.inv(); } n friend _m_int operator+(const _m_int &a, const _m_int &b) { n return _m_int(a) += b; n } n friend _m_int operator-(const _m_int &a, const _m_int &b) { n return _m_int(a) -= b; n } n friend _m_int operator*(const _m_int &a, const _m_int &b) { n return _m_int(a) *= b; n } n friend _m_int operator/(const _m_int &a, const _m_int &b) { n return _m_int(a) /= b; n } n _m_int &operator++() { n val = val == MOD - 1 ? 0 : val + 1; n return *this; n } n _m_int &operator--() { n val = val == 0 ? MOD - 1 : val - 1; n return *this; n } n _m_int operator++(int) { n _m_int before = *this; n ++*this; n return before; n } n _m_int operator--(int) { n _m_int before = *this; n --*this; n return before; n } n _m_int operator-() const { return val == 0 ? 0 : MOD - val; } n bool operator==(const _m_int &other) const { return val == other.val; } n bool operator!=(const _m_int &other) const { return val != other.val; } n _m_int inv() const { return inv_mod(val); } n _m_int pow(int64_t p) const { n if (p < 0) return inv().pow(-p); n _m_int a = *this, result = 1; n while (p > 0) { n if (p & 1) result *= a; n a *= a; n p >>= 1; n } n return result; n } n friend ostream &operator<<(ostream &os, const _m_int &m) { n return os << m.val; n } n }; n extern const int MOD = 998244353; n using mod_int = _m_int; n const int BITS = 53; n template n struct xor_basis { n T basis[BITS]; n int n = 0; n T min_value(T start) const { n if (n == BITS) return 0; n for (int i = 0; i < n; i++) start = min(start, start ^ basis[i]); n return start; n } n T max_value(T start = 0) const { n if (n == BITS) return ((T)1 << BITS) - 1; n for (int i = 0; i < n; i++) start = max(start, start ^ basis[i]); n return start; n } n bool add(T x) { n x = min_value(x); n if (x == 0) return false; n basis[n++] = x; n for (int k = n - 1; k > 0 && basis[k] > basis[k - 1]; k--) n swap(basis[k], basis[k - 1]); n return true; n } n void merge(const xor_basis &other) { n for (int i = 0; i < other.n && n < BITS; i++) add(other.basis[i]); n } n void merge(const xor_basis &a, const xor_basis &b) { n if (a.n > b.n) { n *this = a; n merge(b); n } else { n *this = b; n merge(a); n } n } n }; n int N, M, B; n vector basis; n vector answers; n void generate_all() { n vector change(B + 1, 0); n int64_t prefix = 0; n for (int i = 0; i < B; i++) { n prefix ^= basis[i]; n change[i] = prefix; n } n change[B] = prefix; n int64_t value = 0; n for (unsigned mask = 0; mask < 1U << B; mask++) { n answers[__builtin_popcountll(value)]++; n value ^= change[__builtin_ctz(mask + 1)]; n } n } n void dp_on_repeats() { n ; n for (int i = 0; i < B; i++) n for (int j = i + 1; j < B; j++) n basis[i] = min(basis[i], basis[i] ^ basis[j]); n ; n vector repeats; n for (int bit = 0; bit < M; bit++) { n int count = 0; n for (int i = 0; i < B; i++) n if (basis[i] >> bit & 1) count++; n if (count > 1) repeats.push_back(bit); n } n int R = repeats.size(); n vector> options(B); n int count_sum = 0; n for (int i = 0; i < B; i++) { n int64_t value = basis[i]; n int count = __builtin_popcountll(value); n int repeat_mask = 0; n for (int r = 0; r < R; r++) n if (value >> repeats[r] & 1) { n count--; n repeat_mask |= 1 << r; n } n options[i] = {count, repeat_mask}; n count_sum += count; n }; n sort(options.begin(), options.end()); n if (R <= 20) { n vector> dp(count_sum + 1, vector(1 << R, 0)); n dp[0][0] = 1; n int max_count = 0; n for (pair &option : options) { n int opt_count = option.first; n int opt_mask = option.second; n for (int count = max_count; count >= 0; count--) n for (int mask = 0; mask < 1 << R; mask++) n dp[count + opt_count][mask ^ opt_mask] += dp[count][mask]; n max_count += opt_count; n } n for (int count = 0; count <= count_sum; count++) n for (int mask = 0; mask < 1 << R; mask++) n if (dp[count][mask] > 0) n answers[count + __builtin_popcount(mask)] += dp[count][mask]; n } else { n vector> dp(count_sum - 1, vector(1 << R, 0)); n int max_count = 0; n for (pair &option : options) { n int opt_count = option.first; n int opt_mask = option.second; n for (int count = min(max_count - 1, count_sum - 1 - opt_count - 1); n count >= 0; count--) n for (int mask = 0; mask < 1 << R; mask++) n dp[count + opt_count][mask ^ opt_mask] += dp[count][mask]; n dp[opt_count - 1][opt_mask]++; n max_count += opt_count; n } n for (int count = 0; count < count_sum - 1; count++) n for (int mask = 0; mask < 1 << R; mask++) n if (dp[count][mask] > 0) n answers[count + 1 + __builtin_popcount(mask)] += dp[count][mask]; n int everything = 0; n for (int i = 0; i < B; i++) everything ^= options[i].second; n answers[count_sum + __builtin_popcount(everything)]++; n answers[0]++; n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n cin >> N >> M; n xor_basis basis_obj; n for (int i = 0; i < N; i++) { n int64_t a; n cin >> a; n basis_obj.add(a); n } n B = basis_obj.n; n basis.resize(B); n for (int i = 0; i < B; i++) basis[i] = basis_obj.basis[i]; n answers.assign(M + 1, 0); n if (B <= 0.57 * M) n generate_all(); n else n dp_on_repeats(); n for (int i = 0; i <= M; i++) { n mod_int answer = answers[i]; n answer *= mod_int(2).pow(N - B); n cout << answer << (i < M ? : n ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int g[405][405]; n vector v[405]; n double ans; n double gai[405]; n double pos[405]; n double suan(int yi, int juli) { n memset(gai, 0, sizeof(gai)); n for (int i = 1; i <= n; i++) { n if (g[i][yi] == juli) { n for (int j = 0; j < (int)v[i].size(); j++) { n gai[v[i][j]] += 1.0 / n / (int)v[i].size(); n } n } n } n vector r; n r.clear(); n for (int i = 1; i <= n; i++) n if (gai[i]) r.push_back(i); n double ret = 0; n for (int i = 1; i <= n; i++) { n double tmp = 0; n for (int j = 0; j < (int)r.size(); j++) { n pos[g[i][r[j]]] = max(pos[g[i][r[j]]], gai[r[j]]); n } n for (int j = 0; j < (int)r.size(); j++) { n tmp += pos[g[i][r[j]]]; n pos[g[i][r[j]]] = 0; n } n ret = max(ret, tmp); n } n return ret; n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) n if (i != j) g[i][j] = 199912310; n } n for (int i = 1; i <= m; i++) { n int x, y, z; n scanf( %d%d , &x, &y); n g[x][y] = 1; n g[y][x] = 1; n v[x].push_back(y); n v[y].push_back(x); n } n for (int k = 1; k <= n; k++) { n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) n g[i][j] = g[j][i] = min(g[i][j], g[i][k] + g[k][j]); n } n } n for (int i = 1; i <= n; i++) { n double now = 0; n for (int dist = 0; dist < n; dist++) { n int cnt = 0; n for (int j = 1; j <= n; j++) { n if (g[i][j] == dist) cnt++; n } n if (!cnt) continue; n double p = 1.0 / n; n double q = suan(i, dist); n now += max(p, q); n } n ans = max(ans, now); n } n printf( %.8lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool voltea; n int A[100005], B[100005], I[100005], D[100005], R[100005], ctos, hay, x, y, mid, n en; n int Z[100005], grande; n void lis() { n B[1] = A[1]; n if (voltea) n D[ctos] = 1; n else n I[1] = 1; n hay = 1; n for (int i = 2; i <= ctos; i++) { n if (A[i] > B[hay]) { n ++hay; n B[hay] = A[i]; n en = hay; n } else { n x = 1; n y = hay; n while (x < y) { n mid = (x + y) / 2; n if (B[mid] < A[i]) { n x = mid + 1; n } else { n y = mid; n } n } n B[x] = A[i]; n en = x; n } n if (voltea) { n D[ctos - i + 1] = en; n } else { n I[i] = en; n } n } n } n int main() { n scanf( %d , &ctos); n for (int i = 1; i <= ctos; i++) { n scanf( %d , &A[i]); n } n lis(); n voltea = true; n x = 1; n y = ctos; n while (x < y) { n swap(A[x], A[y]); n A[x] *= -1; n A[y] *= -1; n ++x; n --y; n } n if (x == y) { n A[x] *= -1; n } n lis(); n grande = 1; n for (int i = 1; i <= ctos; i++) { n if (I[i] + D[i] - 1 > grande) { n grande = I[i] + D[i] - 1; n } n } n for (int i = 1; i <= ctos; i++) { n if (I[i] + D[i] - 1 == grande) { n Z[I[i]]++; n } else { n R[i] = 1; n } n } n for (int i = 1; i <= ctos; i++) { n if (R[i] == 0) { n R[i] = 2; n if (Z[I[i]] == 1) { n R[i] = 3; n } n } n printf( %d , R[i]); n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int a, b, c; n cin >> a >> b >> c; n if (a >= c || b >= c) { n cout << 0 ; n } else if (a <= 0 && b <= 0) { n cout << -1 ; n } else { n long long int count = 0; n while (a < c && b < c) { n if (a > b) { n swap(a, b); n } else if (a < 0) { n count += (abs(a) / b + (abs(a) % b != 0)); n if (abs(a) % b) { n long long int r = abs(a) % b; n a = (b - r); n } else { n a = 0; n } n } else { n long long int p = b; n b += a; n a = p; n count++; n } n } n cout << count; n } n } n "} +{"func_code_string": "#include n char map[2][9][9]; n int now[2][9][9], dx[] = {-1, -1, 0, 1, 1, 1, 0, -1, 0}, n dy[] = {0, 1, 1, 1, 0, -1, -1, -1, 0}; n int main() { n for (int i = 0; i < 8; i++) scanf( %s , map[0][i]); n bool a = 0; n now[a][7][0] = 1; n int sta = 0; n while (sta == 0) { n memset(now[!a], 0, sizeof(now[!a])); n memset(map[!a], 0, sizeof(map[!a])); n for (int i = 1; i < 8; i++) n for (int j = 0; j < 8; j++) n if (map[a][i - 1][j] == S ) map[!a][i][j] = S ; n for (int i = 0; i < 8; i++) n for (int j = 0; j < 8; j++) n if (now[a][i][j]) n for (int k = 0; k < 9; k++) { n int x = i + dx[k], y = j + dy[k]; n if (x < 0 || x > 7 || y < 0 || y > 7 || map[a][x][y] == S ) n continue; n now[!a][x][y] = 1; n } n if (now[!a][0][7]) { n sta = 1; n continue; n } n bool alive = 0; n for (int i = 0; i < 8; i++) n for (int j = 0; j < 8; j++) n if (map[!a][i][j] == S ) n now[!a][i][j] = 0; n else if (now[!a][i][j] == 1) n alive = 1; n if (alive == 0) sta = 2; n a = !a; n } n puts(sta == 1 ? WIN : LOSE ); n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000000000; n const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; n const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, n {-1, 0}, {-1, -1}, {0, -1}, {1, -1}}; n int par[200010], r[200010], lar[200010]; n void init() { n for (int i = 0; i < 200010; i++) { n par[i] = i; n r[i] = 0; n lar[i] = 1; n } n } n int find(int x) { n if (par[x] == x) return x; n return par[x] = find(par[x]); n } n bool same(int x, int y) { return find(x) == find(y); } n void unit(int x, int y) { n if (same(x, y)) return; n x = find(x); n y = find(y); n if (r[x] < r[y]) { n par[x] = y; n lar[y] += lar[x]; n } else { n par[y] = x; n lar[x] += lar[y]; n if (r[x] == r[y]) { n r[x]++; n } n } n } n int main() { n static int n; n static int a[200010]; n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n } n init(); n bool used[200010]; n for (int i = 0; i < 200010; i++) { n used[i] = false; n } n vector > vec; n for (int i = 1; i <= n; i++) { n vec.push_back(pair(a[i], i)); n } n sort(vec.begin(), vec.end()); n reverse(vec.begin(), vec.end()); n int ans[200010]; n int k = 1; n for (int i = 0; i < vec.size(); i++) { n pair p = vec[i]; n used[p.second] = true; n if (used[p.second - 1]) { n unit(p.second, p.second - 1); n } n if (used[p.second + 1]) { n unit(p.second, p.second + 1); n } n for (; k <= lar[find(p.second)]; k++) { n ans[k] = p.first; n } n } n for (int i = 1; i <= n; i++) { n printf( %d , ans[i]); n } n puts( ); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100 + 7; n int n; n map, int> id; n vector g[N]; n long double rep(long double x) { n if (x >= 2) { n x -= 2; n } n return x; n } n void dfs(int a, int p = 0, long double t = 0) { n int deg = (int)g[a].size(); n long double jump = 2 / (long double)deg; n for (auto &b : g[a]) { n if (b == p) continue; n t = rep(t + jump); n cout << 1 << << id[{a, b}] << ; n if (t <= 1) { n cout << b << << a << << fixed << setprecision(6) << 1 - t << n ; n } else { n cout << a << << b << << fixed << setprecision(6) << 1 - rep(t + 1) n << n ; n } n dfs(b, a, rep(t + 1)); n } n } n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n; n for (int i = 1; i < n; i++) { n int x, y; n cin >> x >> y; n id[{x, y}] = i; n id[{y, x}] = i; n g[x].push_back(y); n g[y].push_back(x); n } n int root = 1; n cout << n - 1 << n ; n dfs(root); n } n "} +{"func_code_string": "#include n const double eps = 1e-8; n const double pi = acos(-1.0); n const int INF = 0x7f7f7f7f; n const double inf = 1e50; n template n inline T minx(T a, T b) { n return (a == -1 || b < a) ? b : a; n } n template n inline T gcd(T a, T b) { n return b ? gcd(b, a % b) : a; n } n template n inline T lcm(T a, T b) { n return a * (b / gcd(a, b)); n } n template n inline T getbit(T n) { n return n ? (1 + getbit(n & (n - 1))) : 0; n } n template n inline T lowbit(T n) { n return n & (-n); n } n using namespace std; n pair parse(double x, double y) { return make_pair(x, y); } n int main() { n int i, j, k; n pair A, B, C; n double x, y; n double dx, dy, tx, ty; n while (cin >> x >> y) { n A = parse(x, y); n cin >> x >> y; n B = parse(x, y); n cin >> x >> y; n C = parse(x, y); n dx = B.first - A.first; n dy = B.second - A.second; n tx = C.first - B.first; n ty = C.second - B.second; n double res = dx * ty - dy * tx; n if (res == 0) n puts( TOWARDS ); n else if (res > 0) n puts( LEFT ); n else n puts( RIGHT ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000009; n const int maxn = 1000010; n long long p[maxn], q[maxn]; n int main() { n int i, n; n long long nAns = 0; n cin >> n; n n /= 2; n p[1] = 2; n q[1] = 1; n for (i = 2; i <= n; i++) { n p[i] = p[i - 1] * 2 % mod; n q[i] = q[i - 1] * (p[i] - 3) % mod; n nAns = (nAns + q[i] * 4) % mod; n } n cout << (2 * nAns * nAns % mod + nAns * 8 % mod + 10) % mod << endl; n return 0; n } n "} +{"func_code_string": "#include n const int maxn = 1e5 + 7; n int main(int argc, char *argv[]) { n std::ios::sync_with_stdio(false); n std::cin.tie(0); n int n, k; n std::set > t[maxn], s; n std::cin >> n >> k; n int u, v, w; n int ans = 0; n for (int i = 0; i < n - 1; i++) { n std::cin >> u >> v >> w; n t[u].insert(std::make_pair(v, w)); n t[v].insert(std::make_pair(u, w)); n } n for (int i = 1; i <= n; i++) { n if (t[i].size() == 1) { n s.insert(std::make_pair((*t[i].begin()).second, i)); n } n } n while (n > k || s.size() > 2) { n auto i = *s.begin(); n s.erase(i); n int cur = i.second; n ans = i.first; n n--; n int nxt = (*t[cur].begin()).first; n t[nxt].erase(t[nxt].lower_bound(std::make_pair(cur, 0))); n if (t[nxt].size() == 1) { n s.insert(std::make_pair((*t[nxt].begin()).second + ans, nxt)); n } n } n std::cout << ans << std::endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 3e3 + 5; n const int MOD = 1e9 + 7; n int N, M, A, B; n int G[MAXN * MAXN], X, Y, Z; n int H[MAXN][MAXN]; n int P[MAXN][MAXN]; n int T[MAXN][MAXN]; n long long ans; n deque > qu; n void reset() { qu.clear(); } n void push(int v, int p) { n while (qu.size() && qu.back().first >= v) { n qu.pop_back(); n } n qu.push_back({v, p}); n } n int pop(int p) { n while (qu.size() && qu.front().second < p) { n qu.pop_front(); n } n assert(qu.size()); n return qu.front().first; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> N >> M >> A >> B; n cin >> G[0] >> X >> Y >> Z; n for (int i = 1; i < N * M; i++) { n G[i] = (1LL * G[i - 1] * X + Y) % Z; n } n for (int i = 0; i < N; i++) { n for (int j = 0; j < M; j++) { n H[i][j] = G[i * M + j]; n } n } n for (int i = 0; i < N; i++) { n reset(); n for (int j = 0; j < B; j++) push(H[i][j], j); n P[i][B - 1] = pop(0); n for (int j = B; j < M; j++) { n push(H[i][j], j); n P[i][j] = pop(j - B + 1); n } n } n for (int j = B - 1; j < M; j++) { n reset(); n for (int i = 0; i < A; i++) push(P[i][j], i); n ans += pop(0); n for (int i = A; i < N; i++) { n push(P[i][j], i); n ans += pop(i - A + 1); n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int withoutzero(int x); n int main() { n int a, b, c, d, e, f; n cin >> a >> b; n d = withoutzero(a); n e = withoutzero(b); n c = a + b; n f = withoutzero(c); n if ((d + e) == f) { n cout << YES ; n } else { n cout << NO ; n } n } n int withoutzero(int x) { n int arr[10], i = 0, t = 0, k = 0; n while (x > 0) { n arr[i] = x % 10; n x = x / 10; n i++; n } n for (int j = 0; j < i; j++) { n if (arr[j] != 0) { n t += arr[j] * pow(10, k); n k++; n } n } n return t; n } n "} +{"func_code_string": "#include n using namespace std; n long long f[100000 + 1], a[100000 + 1], n, d, b; n int main() { n scanf( %lld%lld%lld , &n, &d, &b); n for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); n f[0] = 0; n for (int i = 1; i <= n; i++) f[i] += f[i - 1] + a[i]; n long long a1 = 0, a2 = 0; n for (long long i = 1; i <= n / 2; i++) { n if (f[min(n, i + i * d)] >= (a1 + 1) * b) ++a1; n if (f[n] - f[max((long long)1, n - i - i * d)] >= (a2 + 1) * b) ++a2; n } n printf( %lld , n / 2 - min(a1, a2)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, i, j, k, ans1, ans2; n long long a[1010][1010]; n long long c[1010], x, y, s, t, temp; n n int main() { n scanf( %d%d , &n, &m); n for (i = 0; i < m; i++) { n for (j = 1; j <= n; j++) { n scanf( %lld , &a[i][j]); n c[i] += a[i][j]; n } n } n x = (c[m - 1] - c[0]) / (m - 1); n for (i = 1; i < m; i++) { n if ((c[i] - c[0]) != x * i) { n ans1 = i; n y = c[i] - c[0] - x * i; n break; n } n } n for (i = 1; i < m - 1; i++) { n if (i - 1 != ans1 && i != ans1 && i + 1 != ans1) { n x = 0; n for (j = 1; j <= n; j++) { n x += a[i - 1][j] * a[i - 1][j] + a[i + 1][j] * a[i + 1][j] - n a[i][j] * a[i][j] * 2; n } n break; n } n } n i = ans1; n t = s = 0; n for (j = 1; j <= n; j++) { n s += a[i - 1][j] * a[i - 1][j] + a[i + 1][j] * a[i + 1][j]; n t += a[i][j] * a[i][j] * 2; n } n s -= x; n for (j = 1; j <= n; j++) { n temp = t - a[i][j] * a[i][j] * 2 + (a[i][j] - y) * (a[i][j] - y) * 2; n if (temp == s) { n ans2 = a[i][j] - y; n break; n } n } n cout << ans1 << << ans2 << endl; n }"} +{"func_code_string": "#include n using namespace std; n long long N = 500005; n long long MAX = 9223372036854775807; n long long MOD = 1000000007; n long double PI = 4 * atan(1); n long long int t, a, b, res; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n cin >> t; n while (t--) { n cin >> a >> b; n res = 0; n a = abs(a - b); n res += a / 5; n a = a % 5; n res += a / 2 + a % 2; n cout << res << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n long long int T; n cin >> T; n while (T--) { n long long int n; n cin >> n; n long long int a[n]; n for (long long int i = 0; i < n; i++) cin >> a[i]; n if (a[n - 1] > a[0]) n cout << YES n << n ; n else n cout << NO n << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, siz[200005], l[200005], r[200005], a[200005], p[200005], an = 0, n b[200005]; n bool vis[200005]; n vector vt[200005], vec; n set st; n set::iterator it; n int root(int node) { n while (p[node] != node) { n p[node] = p[p[node]]; n node = p[node]; n } n return node; n } n int merging(int n1, int n2) { n int p1 = root(n1), p2 = root(n2); n if (p1 == 0) return p2; n if (p2 == 200005 - 1) return p1; n if (p1 == p2) return p1; n if (siz[p1] > siz[p2]) { n siz[p1] += siz[p2]; n p[p2] = p[p1]; n l[p1] = min(l[p1], l[p2]); n r[p1] = max(r[p1], r[p2]); n return p1; n } else { n siz[p2] += siz[p1]; n p[p1] = p[p2]; n l[p2] = min(l[p2], l[p1]); n r[p2] = max(r[p1], r[p2]); n return p2; n } n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n scanf( %d , &n); n int lef = 1, cur = 1, ri; n st.insert(0); n st.insert(200005 - 1); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n if (i != 1 && a[i] != a[i - 1]) { n l[cur] = lef, r[cur] = i - 1; n siz[cur] = r[cur] - l[cur] + 1; n vt[siz[cur]].push_back(l[cur]); n p[cur] = cur; n cur++; n lef = i; n } n st.insert(i); n b[i] = cur; n } n l[cur] = lef, r[cur] = n, siz[cur] = n - lef + 1; n vt[siz[cur]].push_back(l[cur]); n p[cur] = cur; n for (int i = 200005 - 1; i >= 1; i--) { n sort(vt[i].begin(), vt[i].end()); n for (int j = 0, par, tmp, tpp, lol, now; j < vt[i].size(); j++) { n now = vt[i][j]; n if (vis[now]) continue; n par = root(b[now]); n it = st.lower_bound(l[par]); n it--; n tmp = *it; n it = st.lower_bound(r[par]); n it++; n tpp = *it; n if (a[tmp] == a[tpp] && a[tmp]) { n lol = merging(b[tmp], b[tpp]); n if (siz[lol] >= i) { n vt[i][j] = l[lol]; n j--; n } else n vt[siz[lol]].push_back(l[lol]); n } n for (it = st.lower_bound(l[par]); *it <= r[par]; it++) vec.push_back(*it); n for (int k = 0; k < vec.size(); k++) { n st.erase(vec[k]), vis[vec[k]] = true; n } n vec.clear(); n an++; n } n } n printf( %d n , an); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n string s; n cin >> s; n int maxi = 0; n int ind = 0; n string ret = ; n for (int i = 0; i < n; i++) { n string temp; n int d = 10 - (s[i] - 48); n int j = i; n int ctr = 0; n while (ctr < n) { n ctr++; n temp += ((s[j] - 48 + d) % 10) + 48; n j = (j + 1) % s.length(); n } n if (ret == ) n ret = temp; n else if (temp < ret) n ret = temp; n } n cout << ret; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n long long n; n cin >> n; n vector > p(2, vector(n)), n suf(2, vector(n + 1)), ebalVLevo(2, vector(n + 1)), n ebalVPravo(2, vector(n + 1)); n for (long long i = 0; i < 2; i++) { n for (long long j = 0; j < n; j++) { n cin >> p[i][j]; n } n } n for (long long i = 0; i < 2; i++) { n suf[i][n - 1] = p[i][n - 1]; n for (long long j = n - 2; j >= 0; j--) { n suf[i][j] = suf[i][j + 1] + p[i][j]; n } n } n for (long long i = 0; i < 2; i++) { n ebalVPravo[i][0] = (n)*p[i][0]; n for (long long j = 1; j < n; j++) { n ebalVPravo[i][j] = ebalVPravo[i][j - 1] + p[i][j] * (n + j); n } n } n for (long long i = 0; i < 2; i++) { n ebalVLevo[i][n - 1] = p[i][n - 1]; n for (long long j = n - 2; j >= 0; j--) { n ebalVLevo[i][j] = ebalVLevo[i][j + 1] + p[i][j] * (n - j); n } n } n long long sum = 0; n long long ans = 0; n long long i = 0, j = 0; n bool lastI = false; n for (long long t = 0; t < 2 * n; t++) { n sum += t * p[i][j]; n long long tmp = sum; n long long tmpR = n ebalVPravo[i][n - 1] - ebalVPravo[i][j] - (n - t + j) * suf[i][j + 1]; n long long tmpL = 0; n long long tmpLL = 0; n if (t == 0) { n tmpL = ebalVLevo[1][j] + (t + (n - j) - 1) * suf[1][j]; n } else if (i == 0) { n tmpL = ebalVLevo[1][j + 1] + (t + (n - j) - 1) * suf[1][j + 1]; n } else if (i == 1) { n tmpL = ebalVLevo[0][j + 1] + (t + (n - j) - 1) * suf[0][j + 1]; n } n ans = max(ans, tmp + tmpL + tmpR); n if (!lastI) { n if (!i) { n i++; n } else { n i--; n } n lastI = true; n } else { n j++; n lastI = false; n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long dp[300005]; n vector g[300005]; n long long ans = 1; n long long subs[300005]; n long long f[300005][2]; n void dfs(long long s, long long p) { n dp[s] = 0; n long long mx1 = 0; n long long mx2 = 0; n long long cnt = 0; n for (auto it : g[s]) { n if (it != p) { n dfs(it, s); n if (mx1 < dp[it]) { n mx2 = mx1; n mx1 = dp[it]; n } else if (mx2 < dp[it]) n mx2 = dp[it]; n cnt++; n } n } n f[s][0] = mx1; n f[s][1] = mx2; n subs[s] = cnt; n dp[s] += mx1 + cnt; n } n void ans_dfs(long long s, long long p) { n for (auto it : g[s]) { n if (it != p) ans_dfs(it, s); n } n if (s == p) { n ans = max(ans, 1 + dp[s] + f[s][1]); n return; n } n long long y = f[p][0]; n if (y == dp[s]) y = f[p][1]; n long long z = max(y, f[s][1]); n ans = max(ans, 1 + dp[s] + z + 1); n } n int32_t main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n for (long long i = 1; i <= n; i++) { n dp[i] = 0; n g[i].clear(); n } n for (long long i = 0; i < n - 1; i++) { n long long a, b; n cin >> a >> b; n g[a].push_back(b); n g[b].push_back(a); n } n ans = 1; n dfs(1, 1); n ans_dfs(1, 1); n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 18; n long long dp[(1 << N)][105]; n string n; n int qwq; n int m, pw[20]; n bool used[10]; n void init() { n pw[0] = 1; n for (int i = 1; i <= n.size(); i++) pw[i] = pw[i - 1] * 10 % m; n } n int main() { n cin >> n >> m; n dp[0][0] = 1; n init(); n for (int i = 1; i < (1 << n.size()); i++) { n int sz = n.size() - __builtin_popcount(i); n for (int k = 0; k < m; k++) { n for (int j = 0; j < 10; j++) used[j] = false; n for (int j = 0; j < n.size(); j++) n if (((i >> j) & 1) && !used[n[j] - 0 ]) n if (sz != (int)n.size() - 1 || n[j] != 0 ) n dp[i][k] += n dp[i - (1 << j)][(m + k - (n[j] - 0 ) * pw[sz] % m) % m], n used[n[j] - 0 ] = true; n } n } n cout << dp[(1 << n.size()) - 1][0] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXM = 500 + 5; n const int MAXN = 500 + 5; n const int MAXQ = 300 + 5; n const int MAXK = 800 + 5; n const int P = 5; n const int MOD = 1e9 + 7; n int n, m, q, a[MAXN][MAXK]; n int inv[P], ans = 1; n char buf[MAXM]; n int main() { n for (int i = 0; i < P; i++) inv[i] = i * i * i % P; n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) { n scanf( %s , buf + 1); n for (int j = 1; j <= m; j++) a[j][i] = buf[j] - a ; n } n scanf( %d , &q); n for (int i = 1; i <= q; i++) { n scanf( %s , buf + 1); n for (int j = 1; j <= m; j++) a[j][i + n] = buf[j] - a ; n } n int cur = 1, r = 0; n for (int i = 1; i <= m && cur <= n; i++) { n while (cur <= n) { n int t = i; n for (int j = i + 1; j <= m; j++) n if (a[j][cur]) t = j; n for (int j = 1; j <= n + q; j++) swap(a[i][j], a[t][j]); n if (a[i][cur]) break; n cur++; n } n if (cur == n + 1) break; n for (int j = cur + 1; j <= n + q; j++) n a[i][j] = a[i][j] * inv[a[i][cur]] % P; n a[i][cur] = 1; n for (int j = i + 1; j <= m; j++) { n for (int k = cur + 1; k <= n + q; k++) { n a[j][k] -= a[j][cur] * a[i][k] % P; n if (a[j][k] < 0) a[j][k] += P; n } n a[j][cur] = 0; n } n r++; n } n for (int i = 1; i <= n - r; i++) ans = ans * 5ll % MOD; n for (int i = 1; i <= q; i++) { n int x = ans; n for (int j = 1; j <= m; j++) { n bool flg = 1; n for (int k = 1; k <= n; k++) flg &= (a[j][k] == 0); n flg &= (a[j][n + i] > 0); n if (flg) x = 0; n } n printf( %d n , x); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector st[100000], edge[200000], topo; n vector > ps; n int incnt[200000], tol; n priority_queue que; n bool visit[200000]; n int main(void) { n int n, m, in; n while (scanf( %d %d , &n, &m) == 2) { n for (int i = 0; i < m; ++i) st[i].clear(); n for (int i = 0; i < n; ++i) n for (int j = 0; j < m; ++j) { n scanf( %d , &in); n st[j].push_back(in); n } n memset(incnt, 0, sizeof(incnt)); n tol = m; n for (int i = 0; i < 200000; ++i) edge[i].clear(); n for (int i = 0; i < n; ++i) { n ps.clear(); n for (int j = 0; j < m; ++j) n if (st[j][i] >= 0) ps.push_back(make_pair(st[j][i], j)); n sort(ps.begin(), ps.end()); n for (int a = 0, b, k = ps.size(), pre = -1; a < k; a = b) { n for (b = a; (b < k) && (ps[b].first == ps[a].first); ++b) { n int now = ps[b].second; n if (pre >= 0) { n edge[pre].push_back(now); n ++incnt[now]; n } n edge[now].push_back(tol); n ++incnt[tol]; n } n pre = tol++; n } n } n topo.clear(); n for (int i = 0; i < tol; ++i) n if (!incnt[i]) que.push(-i); n while (!que.empty()) { n int now = -que.top(); n que.pop(); n if (now < m) topo.push_back(now + 1); n for (int i = 0, j = edge[now].size(); i < j; ++i) { n --incnt[edge[now][i]]; n if (!incnt[edge[now][i]]) que.push(-edge[now][i]); n } n } n if (topo.size() != m) n puts( -1 ); n else { n printf( %d , topo[0]); n for (int i = 1, j = topo.size(); i < j; ++i) printf( %d , topo[i]); n putchar( n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map mp; n map mp_back; n vector way[5005 * 2]; n int n, j, i, ans[5005 * 2] = {}; n int main() { n cin >> n; n int w = 0; n for (i = 1; i <= n; i++) { n int v1, v2; n string s1, s2; n cin >> s1 >> s2; n if (!mp[s1]) n ++w, mp[s1] = w, v1 = w, mp_back[w] = s1; n else n v1 = mp[s1]; n if (!mp[s2]) n ++w, mp[s2] = w, v2 = w, mp_back[w] = s2; n else n v2 = mp[s2]; n way[v1].push_back(v2); n way[v2].push_back(v1); n } n for (i = 1; i <= w; i++) { n int friends[5005 * 2] = {}, friends2[5005 * 2] = {}; n for (j = 0; j < way[i].size(); j++) friends[way[i][j]] = 1; n int maxf = 0; n for (j = 1; j <= w; j++) n if (!friends[j] && j != i) { n int size = 0; n for (int h = 0; h < way[j].size(); h++) n if (friends[way[j][h]]) ++size; n maxf = max(maxf, size); n friends2[j] = size; n } n for (j = 1; j <= w; j++) n if (friends2[j] == maxf && !friends[j] && j != i) ans[i]++; n } n cout << w << endl; n for (i = 1; i <= w; i++) cout << mp_back[i] << << ans[i] << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC target( avx2 ) n #pragma comment(linker, /stack:200000000 ) n #pragma GCC optimize( Ofast ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n using namespace std; n void solve() { n int n; n cin >> n; n vector ans; n for (int i = 1; i <= 1000; i += 2) { n ans.push_back(i); n ans.push_back(i); n } n if (ans.size() < n) { n for (int i = 0; i < ans.size(); i++) { n cout << ans[i] << ; n } n n -= ans.size(); n for (int i = 0; i < n; i++) { n cout << ans[i] << ; n } n cout << endl; n return; n } n for (int i = int(0); i < int(n); i++) { n cout << ans[i] << ; n } n cout << endl; n } n signed main() { n int t; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c, i, j, sum, p[3][3]; n stack s; n queue q1, q2; n for (i = 0; i < 3; i++) n for (j = 0; j < 3; j++) p[i][j] = (j + 3 - i) % 3; n while (s.size()) s.pop(); n while (q1.size()) q1.pop(); n while (q2.size()) q2.pop(); n scanf( %d%d , &a, &b); n while (a) { n q1.push(a % 3); n a /= 3; n } n while (b) { n q2.push(b % 3); n b /= 3; n } n if (q1.size() > q2.size()) n for (i = q2.size(); i < q1.size(); i++) q2.push(0); n else { n if (q2.size() > q1.size()) n for (i = q1.size(); i < q2.size(); i++) q1.push(0); n } n while (q1.size()) { n a = q1.front(); n q1.pop(); n b = q2.front(); n q2.pop(); n s.push(p[a][b]); n } n sum = 0; n while (s.size()) { n c = s.top(); n s.pop(); n sum = sum * 3 + c; n } n printf( %d n , sum); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-7; n const int MOD = 1e9 + 7; n const long long INFLL = 0x3f3f3f3f3f3f3f3f; n const int INF = 0x3f3f3f3f; n const int MAXN = 4e5 + 5; n char s[MAXN]; n int vis[200], t[200]; n int check(int n, int l) { n int need = (l / 2) * n, cnt = 0; n for (int i = 0; i < 200; i++) cnt += vis[i] / 2; n if (cnt >= need) return 1; n return 0; n } n void solve(int n, int l) { n vector v1, v2; n printf( %d n , n); n for (int i = 0; i < 200; i++) { n while (vis[i] >= 2) v1.push_back((char)i), vis[i] -= 2; n if (vis[i]) v2.push_back((char)i); n } n for (int i = 0; i < n; i++) { n int p = 0; n while (p < l / 2) { n s[p] = s[l - 1 - p] = v1[v1.size() - 1]; n v1.pop_back(); n p++; n } n if (l & 1) { n if (v2.empty()) n s[p] = v1[v1.size() - 1], v2.push_back(v1[v1.size() - 1]), n v1.pop_back(); n else n s[p] = v2[v2.size() - 1], v2.pop_back(); n } n s[l] = 0; n printf( %s , s); n } n } n int main() { n int n; n cin >> n; n scanf( %s , s + 1); n for (int i = 1; i <= n; i++) vis[s[i]]++; n int maxn = INF; n for (int i = 1; i * i <= n; i++) { n if (n % i == 0) { n if (check(i, n / i)) maxn = min(i, maxn); n if (check(n / i, i)) maxn = min(n / i, maxn); n } n } n solve(maxn, n / maxn); n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[100001]; n vector>> o[6], ans; n void relax(vector& m) { n o[m.size()].push_back({}); n for (size_t i = 0; i < m.size(); i++) n o[m.size()].back().push_back({m[i], m[(i + 1) % m.size()]}); n m.resize(1); n } n void gao(int x, int y) { n if (!y) ans.insert(ans.end(), o[x].begin(), o[x].end()); n while (o[x].size() > (x == y) && o[y].size()) { n ans.push_back(o[x].back()); n o[x].pop_back(); n ans.back().insert(ans.back().end(), o[y].back().begin(), o[y].back().end()); n o[y].pop_back(); n } n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , a + i); n for (int i = 1; i <= n; i++) n if (a[i] != i) { n vector u = {i}, m = {i}; n while (a[u.back()] != i) u.push_back(a[u.back()]); n for (size_t c = 1; c < u.size(); c++) { n if (m.size() == 5) relax(m); n m.push_back(a[u[c]] = u[c]); n } n relax(m); n } n gao(5, 0); n gao(4, 0); n gao(2, 3); n while (o[3].size() >= 2) { n auto u = o[3].back(); n o[3].pop_back(); n o[2].push_back({{u[0].first, u[1].first}, {u[1].first, u[0].first}}); n o[2].push_back({{u[1].first, u[2].first}, {u[2].first, u[1].first}}); n gao(2, 3); n } n gao(2, 2); n gao(3, 0); n gao(2, 0); n printf( %d n , ans.size()); n for (auto& c : ans) { n printf( %d n , c.size()); n for (auto x : c) printf( %d , x.first); n puts( ); n for (auto x : c) printf( %d , x.second); n puts( ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, tot, a[100010], ans[100010]; n vector > q[100010]; n set s; n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1, l, x; i <= m; i++) { n scanf( %d%d , &l, &x); n q[l].emplace_back(i, x); n } n s.insert(0); n tot = 1; n for (int i = 1; i <= n; i++) { n if (s.count(a[i])) n tot = 1ll * tot * 2 % 1000000007; n else { n vector v; n for (int u : s) v.push_back(u ^ a[i]); n for (int u : v) s.insert(u); n } n for (auto &p : q[i]) ans[p.first] = s.count(p.second) ? tot : 0; n } n for (int i = 1; i <= m; i++) printf( %d n , ans[i]); n } n "} +{"func_code_string": "#include n using namespace std; n template n void __f(const char* name, Arg1&& arg1) { n std::cerr << name << : << arg1 << endl; n } n template n void __f(const char* names, Arg1&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n std::cerr.write(names, comma - names) << : << arg1 << | ; n __f(comma + 1, args...); n } n long long int solve() { n long long int n; n cin >> n; n std::vector v; n long long int seg = 0; n long long int count = 0; n for (long long int i = 0; i < n; i++) { n long long int a; n cin >> a; n v.push_back(a); n if (a != i + 1) { n count++; n } else { n if (count) { n seg++; n count = 0; n } n } n } n if (count) { n seg++; n } n if (seg == 0) { n cout << 0 << n ; n } else if (seg == 1) { n cout << 1 << n ; n } else { n cout << 2 << n ; n } n return 0; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long int T = 1; n cin >> T; n while (T--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, sav, mn = 1e9; n struct point { n long long x, y, uz; n } p[2005]; n string s; n int det(point A, point B, point C) { n if (A.x * B.y + A.y * C.x + B.x * C.y - A.x * C.y - A.y * B.x - B.y * C.x < 0) n return -1; n return 1; n } n int main() { n ios::sync_with_stdio(false); n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> p[i].x >> p[i].y; n if (p[i].y < mn) { n mn = p[i].y; n sav = i; n } n } n cin >> s; n p[sav].uz = 1; n cout << sav << ; n for (int i = 0; i < s.size(); i++) { n int crt = 1, j, sgn; n while (p[crt].uz) crt++; n j = crt + 1; n if (s[i] == R ) n sgn = 1; n else n sgn = -1; n while (j <= n) { n while (j <= n && p[j].uz) j++; n if (j > n) break; n if (det(p[sav], p[crt], p[j]) == sgn) crt = j; n j++; n } n sav = crt; n p[crt].uz = 1; n cout << sav << ; n } n for (int i = 1; i <= n; i++) n if (!p[i].uz) cout << i << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n int va, id; n } a[200015], b[200015]; n int n, Q, rv[200015]; n long long dp[200015]; n inline bool cmp(node x, node y) { return x.va > y.va; } n int main() { n scanf( %d%d , &n, &Q); n for (int i = 1; i <= n; i++) scanf( %d , &a[i].va), a[i].id = i; n for (int i = 1; i <= n; i++) scanf( %d , &b[i].va), b[i].id = i; n sort(a + 1, a + 1 + n, cmp); n sort(b + 1, b + 1 + n, cmp); n for (int i = 1; i <= n; i++) rv[b[i].id] = i; n while (Q--) { n int x, y; n scanf( %d%d , &x, &y); n swap(rv[x], rv[y]); n b[rv[x]].id = x, b[rv[y]].id = y; n for (int i = 1; i <= n; i++) { n dp[i] = 0; n if (a[i].id ^ b[i].id) n dp[i] = max(dp[i], dp[i - 1] + 1ll * a[i].va * b[i].va); n if (i > 1) { n if ((a[i].id ^ b[i - 1].id) && (a[i - 1].id ^ b[i].id)) { n dp[i] = max(dp[i], dp[i - 2] + 1ll * a[i].va * b[i - 1].va + n 1ll * a[i - 1].va * b[i].va); n } n } n if (i > 2) { n if ((a[i].id ^ b[i - 2].id) && (a[i - 1].id ^ b[i].id) && n (a[i - 2].id ^ b[i - 1].id)) { n dp[i] = max(dp[i], dp[i - 3] + 1ll * a[i - 2].va * b[i - 1].va + n 1ll * a[i - 1].va * b[i].va + n 1ll * a[i].va * b[i - 2].va); n } n if ((a[i - 2].id ^ b[i].id) && (a[i - 1].id ^ b[i - 2].id) && n (a[i].id ^ b[i - 1].id)) { n dp[i] = max(dp[i], dp[i - 3] + 1ll * a[i - 2].va * b[i].va + n 1ll * a[i - 1].va * b[i - 2].va + n 1ll * a[i].va * b[i - 1].va); n } n if ((a[i].id ^ b[i - 2].id) && (a[i - 2].id ^ b[i].id) && n (a[i - 1].id ^ b[i - 1].id)) { n dp[i] = max(dp[i], dp[i - 3] + 1ll * a[i].va * b[i - 2].va + n 1ll * a[i - 1].va * b[i - 1].va + n 1ll * a[i - 2].va * b[i].va); n } n } n } n printf( %lld n , dp[n]); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector a; n vector ss; n bool possible = false; n for (int i = 0; i < n; ++i) { n string s; n cin >> s; n if (!possible) { n if (s.substr(0, 2) == OO ) { n possible = true; n s[0] = + ; n s[1] = + ; n } else if (s.substr(3, 2) == OO ) { n possible = true; n s[3] = + ; n s[4] = + ; n } n } n ss.push_back(s); n } n if (possible) { n cout << YES n ; n for (int j = 0; j < n; ++j) { n cout << ss[j] << n ; n } n } else { n cout << NO ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int maxd(long long int n) { n long long int temp = 10 * n, mm = 0; n while (temp /= 10) mm = max(mm, temp % 10); n return mm; n } n int main() { n long long int n, ans = 0; n cin >> n; n while (n) { n n -= maxd(n); n ans++; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1e9 + 1; n const int N = 100123; n int z, n; n int a[N]; n int best[N]; n long long ans[N]; n long long res; n pair tree[N << 2]; n void build(int v, int l, int r) { n if (l == r) { n tree[v] = {a[l], l}; n return; n } n int mid = (l + r) >> 1; n build(2 * v, l, mid); n build(2 * v + 1, mid + 1, r); n tree[v] = max(tree[2 * v], tree[2 * v + 1]); n } n pair query(int v, int l, int r, int ql, int qr) { n if (ql <= l && qr >= r) { n return tree[v]; n } n int mid = (l + r) >> 1; n pair res = {0, 0}; n if (ql <= mid) res = max(res, query(2 * v, l, mid, ql, qr)); n if (qr >= mid + 1) res = max(res, query(2 * v + 1, mid + 1, r, ql, qr)); n return res; n } n int main() { n ios_base::sync_with_stdio(0); n cin >> n; n for (int i = 1; i <= n - 1; i++) { n cin >> a[i]; n } n a[n] = n; n build(1, 1, n); n for (int i = 1; i <= n; i++) { n pair b = query(1, 1, n, i, a[i]); n best[i] = b.second; n } n ans[n - 1] = 1; n res++; n for (int i = n - 2; i >= 1; i--) { n ans[i] = ans[best[i]] + (best[i] - i) + (n - a[i]); n res += ans[i]; n } n cout << res << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const long long md = 1e9 + 7; n const int N = 2e6 + 34; n char s[N]; n long long p[N]; n int n, k, m; n int lst[100]; n int c, cur, mn; n int main() { n scanf( %d %d n , &n, &k); n gets(s); n m = strlen(s); n for (int i = 0; i < k; i++) lst[i] = -1; n p[0] = 0; n p[1] = 1; n for (int i = 0; i < m; i++) { n c = s[i] - a ; n cur = p[i + 1] - p[lst[c] + 1]; n p[i + 2] = (p[i + 1] + cur + md) % md; n lst[c] = i; n } n for (int i = m; i < m + n; i++) { n mn = 0; n for (int j = 1; j < k; j++) n if (lst[j] < lst[mn]) mn = j; n c = mn; n cur = p[i + 1] - p[lst[c] + 1]; n p[i + 2] = (p[i + 1] + cur + md) % md; n lst[c] = i; n } n cout << p[n + m + 1]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map mp; n set st; n int n; n char in[30]; n string read() { n scanf( %s , in); n return (string)in; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i += 1) { n string a = read(); n string b = read(); n if (st.find(b) != st.end()) { n continue; n } n st.insert(a); n if (mp.find(a) != mp.end()) { n mp[b] = mp[a]; n mp.erase(a); n continue; n } n mp[b] = a; n } n printf( %d n , mp.size()); n for (auto x : mp) { n if (x.second == _ ) { n continue; n } n printf( %s %s n , x.second.c_str(), x.first.c_str()); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n vector> p; n bool is(int val) { n int c = 0; n vector pres(n, 0); n bool flag = 0; n for (int i = 0; i < m; i++) { n c = 0; n for (int j = 0; j < n; j++) { n if (p[i][j] >= val) { n pres[j] = true; n c++; n } n } n if (c > 1) flag = 1; n } n if (!flag) return false; n bool ans = 1; n for (bool i : pres) n if (!i) return false; n return true; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int t; n cin >> t; n while (t--) { n cin >> m >> n; n p.assign(m, vector(n)); n int minn = INT_MAX, maxx; n for (int i = 0; i < m; i++) n for (int j = 0; j < n; j++) cin >> p[i][j]; n for (int i = 0; i < n; i++) { n maxx = -1; n for (int j = 0; j < m; j++) { n maxx = max(maxx, p[j][i]); n } n minn = min(maxx, minn); n } n int l = 1, r = minn + 3; n while (r - l > 1) { n int mid = (l + r) / 2; n if (is(mid)) n l = mid; n else n r = mid; n } n cout << l << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dp[80][80][80][80]; n int dfs(int l1, int r1, int l2, int r2, int dep) { n if (l1 > r1 || l2 > r2) return 0; n if (l1 == l2 && r1 == r2) return r1 - l1 + 1; n if (r1 < 80 && r2 < 80 && dp[l1][r1][l2][r2] != -1) return dp[l1][r1][l2][r2]; n int mid = (1 << dep - 1) - 1; n int res = 0; n if (l1 <= mid && mid <= r1 && l2 <= mid && mid <= r2) { n res = max(res, min(r1, r2) - max(l1, l2) + 1); n } n int l1_next[] = {l1, max(l1, mid + 1) - (mid + 1)}; n int r1_next[] = {min(r1, mid - 1), r1 - (mid + 1)}; n int l2_next[] = {l2, max(l2, mid + 1) - (mid + 1)}; n int r2_next[] = {min(r2, mid - 1), r2 - (mid + 1)}; n for (int i = 0; i < (2); i++) n for (int j = 0; j < (2); j++) n res = max(res, n dfs(l1_next[i], r1_next[i], l2_next[j], r2_next[j], dep - 1)); n if (r1 < 80 && r2 < 80) dp[l1][r1][l2][r2] = res; n return res; n } n int main() { n int l1, r1, l2, r2; n scanf( %d%d%d%d , &l1, &r1, &l2, &r2); n l1--; n r1--; n l2--; n r2--; n memset(dp, -1, sizeof dp); n printf( %d n , dfs(l1, r1, l2, r2, 30)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 4e5 + 123; n long long n, m, k; n int num[maxn]; n int dp[maxn][5]; n int presum[maxn]; n int tmp[maxn]; n int main(int argc, char const *argv[]) { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n std::cin >> n; n for (int i = 1; i <= n; i++) { n long long u; n std::cin >> u; n int one = 0; n while (u) { n if (u % 2 == 1) { n one++; n } n u /= 2; n } n num[i] = one; n } n long long ans = 0; n for (int i = 1; i <= n; i++) { n dp[i][1] = dp[i - 1][1]; n dp[i][0] = dp[i - 1][0]; n presum[i] = presum[i - 1] + num[i]; n if (presum[i] % 2 == 1) { n dp[i][1] += 1; n } else { n dp[i][0] += 1; n } n } n int cur = n + 1; n for (int i = n; i >= 0; --i) { n tmp[i] = cur; n if (num[i] != 0) { n cur = i; n } n } n for (int i = 1; i <= n; i++) { n int k = presum[i - 1] % 2; n int cur = i; n int sum = num[i]; n int maxx = num[i]; n for (int j = 1; j < 71; j++) { n int kk = tmp[cur]; n if (maxx <= sum / 2) { n ans += dp[kk - 1][k] - dp[cur - 1][k]; n } n maxx = max(maxx, num[kk]); n sum += num[kk]; n cur = kk; n if (cur > n) { n break; n } n } n ans += dp[n][k] - dp[cur - 1][k]; n } n std::cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int cnt(long long int x) { n long long int ans = 0; n while (x) { n x /= 2; n ans++; n } n return ans; n } n int main() { n int t; n cin >> t; n while (t--) { n long long int d, m; n cin >> d >> m; n long long int temp = cnt(d) - 1; n long long int ans = d - pow(2, temp) + 2; n for (long long int i = temp - 1; i >= 0; i--) { n ans = ans * (pow(2, i) + 1); n ans %= m; n } n ans = (ans - 1) % m; n if (ans < 0) ans = m + ans; n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n inline int nextint() { n int res = 0; n char c = 0; n while (c < 0 || c > 9 ) c = getchar(); n while (c >= 0 && c <= 9 ) { n res = res * 10 + c - 0 ; n c = getchar(); n } n return res; n } n int n; n long long a[200000], b[200000]; n bool good[200000]; n bool ans[200000]; n long long diff[200000]; n const int maxh = 17; n const int maxn = (1 << maxh); n long long tree[2 * maxn]; n void build() { n for (int i = maxn - 1; i; i--) tree[i] = min(tree[i + i], tree[i + i + 1]); n } n long long get(int i, int j) { n long long result = (long long)1e18; n for (i += maxn - 1, j += maxn; i + 1 != j; i >>= 1, j >>= 1) { n if (!(i & 1)) result = min(result, tree[i + 1]); n if (j & 1) result = min(result, tree[j - 1]); n } n return result; n } n long long get_min(int i, int j) { n long long result = (long long)1e18; n if (i <= j) result = get(i + 1, j + 2); n return result; n } n void go() { n memset(tree, 0, sizeof(tree)); n for (int i = 0; i < (int)(n); ++i) n tree[maxn + i + 1] = tree[maxn + i] + diff[i]; n build(); n for (int i = 0; i < (int)(n); ++i) { n long long presum = tree[maxn + i]; n long long postsum = tree[maxn + n] - presum; n long long m_main = get_min(i, n - 1); n long long m_oth = get_min(0, i - 1); n bool ok = true; n if (-presum + m_main < 0) ok = false; n if (postsum + m_oth < 0) ok = false; n good[i] = ok; n } n } n int main() { n cin >> n; n for (int i = 0; i < (int)(n); ++i) { n int _a; n scanf( %d , &_a); n a[i] = _a; n } n for (int i = 0; i < (int)(n); ++i) { n int _b; n scanf( %d , &_b); n b[i] = _b; n } n for (int i = 0; i < (int)(n); ++i) diff[i] = a[i] - b[i]; n go(); n for (int i = 0; i < (int)(n); ++i) n if (good[i]) ans[i] = true; n memset(good, 0, sizeof(good)); n reverse(a + 1, a + n); n reverse(b, b + n); n for (int i = 0; i < (int)(n); ++i) diff[i] = a[i] - b[i]; n go(); n for (int i = 0; i < (int)(n); ++i) n if (good[i]) ans[(n - i) % n] = true; n int ans_size = 0; n for (int i = 0; i < (int)(n); ++i) n if (ans[i]) ans_size++; n cout << ans_size << endl; n for (int i = 0; i < (int)(n); ++i) n if (ans[i]) cout << (i + 1) << ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector edges[8]; n int calc(int a, int b) { n vector cnt(8); n for (auto e : edges[a]) cnt[e]++; n for (auto e : edges[b]) cnt[e]++; n int sol = 0; n for (int i = 1; i <= 7; i++) n if (cnt[i] == 2) sol++; n return sol; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n, m, a, b; n cin >> n >> m; n for (int i = 0; i < m; i++) { n cin >> a >> b; n edges[a].push_back(b); n edges[b].push_back(a); n } n if (n <= 6) { n cout << m << n ; n return 0; n } n int mmin = 1e9; n for (int i = 1; i <= n; i++) { n for (int j = i + 1; j <= n; j++) { n mmin = min(mmin, calc(i, j)); n } n } n cout << m - mmin << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 300010; n const int M = 1000010; n const int MOD = 1000000007; n const int INF = 2e9; n const double eps = 1e-8; n const double PI = acos(-1.0); n int fx[] = {1, -1, 0, 0}; n int fy[] = {0, 0, 1, -1}; n int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } n int lcm(int x, int y) { n x /= gcd(x, y); n return x * y; n } n int Min(int a, int b) { return a < b ? a : b; } n int Max(int a, int b) { return a > b ? a : b; } n bool prime[M + 5], isprime[M + 5]; n vector v; n int n, m, q, cs, ar[123456]; n void sieve() { n v.push_back(2); n prime[1] = 1; n int limit = (int)sqrt(M); n for (int i = 4; i <= M; i += 2) prime[i] = 1; n for (int i = 3; i <= M; i += 2) { n if (!prime[i]) { n v.push_back(i); n if (i <= limit) { n for (int j = i * i; j <= M; j += 2 * i) prime[j] = 1; n } n } n } n } n int br[123456]; n int main() { n long long n, tot = 0; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> ar[i]; n tot += ar[i]; n } n for (int i = 0; i < n; i++) cin >> br[i]; n sort(br, br + n); n long long a = br[n - 1], b = br[n - 2]; n if (tot <= a + b) n cout << YES ; n else n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, e = 0, st[100005], d[100005], T[100005], s[100005], Time; n struct Node { n int v, t; n double p; n }; n struct { n int v, t, nx; n } edge[200005]; n vector E[100005]; n bool cmp(Node a, Node b) { return a.p < b.p; } n void add(int u, int v, int t) { n edge[e].v = v; n edge[e].t = t; n edge[e].nx = st[u]; n st[u] = e++; n } n void dfs(int u, int fa, int t) { n s[u] = 1; n d[u] = 2 * t; n for (int i = st[u]; ~i; i = edge[i].nx) { n int v = edge[i].v; n if (v != fa) { n Node tmp; n t = edge[i].t; n tmp.v = v; n tmp.t = t; n E[u].push_back(tmp); n dfs(v, u, t); n s[u] += s[v]; n d[u] += d[v]; n } n } n } n void Dfs(int u) { n int m = E[u].size(); n for (int i = 0; i < m; i++) n E[u][i].p = (double)d[E[u][i].v] / (double)s[E[u][i].v]; n sort(E[u].begin(), E[u].end(), cmp); n for (int i = 0; i < m; i++) { n int v = E[u][i].v; n int t = E[u][i].t; n Time += t; n T[v] = Time; n Dfs(v); n Time += t; n } n } n int main() { n while (~scanf( %d , &n)) { n e = 0; n memset(st, -1, sizeof(st)); n int a, b, t; n for (int i = 1; i < n; i++) { n scanf( %d%d%d , &a, &b, &t); n add(a, b, t); n add(b, a, t); n } n dfs(1, -1, 0); n Time = 0; n Dfs(1); n double ans = 0; n for (int i = 2; i <= n; i++) ans += 1.0 * T[i]; n printf( %.12f n , ans / 1.0 / (n - 1)); n } n } n "} +{"func_code_string": "#include n const int INT_INF = 0x3f3f3f3f; n const int INT_M_INF = 0x7f7f7f7f; n const long long LL_INF = 0x3f3f3f3f3f3f3f3f; n const long long LL_M_INF = 0x7f7f7f7f7f7f7f7f; n const double pi = acos(-1.0); n using namespace std; n inline void debug(char ch) { n for (int __ii = 0; __ii < 20; ++__ii) putchar(ch); n printf( n ); n } n const double eps = 1e-8; n inline int dcmp(double a, double b) { n if (fabs(a - b) < eps) return 0; n return a < b ? -1 : 1; n } n const int dr[] = {0, 0, -1, 1, -1, -1, 1, 1}; n const int dc[] = {-1, 1, 0, 0, -1, 1, -1, 1}; n const int MAXN = 4000 + 10; n const int MAXT = 10000 + 10; n char s[MAXN], t[MAXN]; n int main() { n memset(s, 0, sizeof s); n memset(t, 0, sizeof t); n while (scanf( %s%s , s, t) == 2) { n int slen = strlen(s), tlen = strlen(t), ans = 0; n for (int i = 0; i < slen; ++i) { n int num = 0; n for (int j = 0; j < tlen; ++j) n if (s[i + j] == t[j]) ++num; n ans = max(ans, num); n } n for (int i = 0; i < tlen; ++i) { n int num = 0; n for (int j = 0; j < slen; ++j) n if (t[i + j] == s[j]) ++num; n ans = max(ans, num); n } n printf( %d n , tlen - ans); n memset(s, 0, sizeof s); n memset(t, 0, sizeof t); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int nump; n int arr[7]; n scanf( %d , &nump); n scanf( %d , &arr[0]); n for (int i = 1; i < 7; i++) { n scanf( %d , &arr[i]); n arr[i] += arr[i - 1]; n } n int tmp = (nump / arr[6]), idx = 0; n if (tmp && arr[6] * tmp >= nump) n tmp = (tmp - 1) * arr[6]; n else n tmp *= arr[6]; n while (tmp + arr[idx] < nump) idx++; n printf( %d n , idx + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s, s1, s2; n getline(cin, s); n getline(cin, s1); n getline(cin, s2); n int substr = s.find(s1), substr1; n int forward = 0, backward = 0; n if (substr != -1) { n substr1 = s.find(s2, substr + s1.length()); n if (substr1 != -1) forward = 1; n } n string inverted; n for (substr = 0; substr <= s.length() - 1; substr++) n inverted = s[substr] + inverted; n substr = inverted.find(s1); n if (substr != -1) { n substr1 = inverted.find(s2, substr + s1.length()); n if (substr1 != -1) backward = 1; n } n if (forward == 1 && backward == 0) cout << forward << endl; n if (forward == 0 && backward == 1) cout << backward << endl; n if (forward == 1 && backward == 1) cout << both << endl; n if (forward == 0 && backward == 0) cout << fantasy << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int Maxn = 50005; n char str[Maxn]; n int hs[26]; n int main() { n scanf( %s , str); n int len = strlen(str), cCnt = 0; n int xNum = 0, sta = 0; n bool ok = false; n int i; n for (i = 0; i < len; i++) { n if (i - sta >= 26 && cCnt + xNum == 26) { n ok = true; n for (int j = sta; j < sta + 26; j++) { n if (str[j] == ? ) { n for (int k = 0; k < 26; k++) { n if (hs[k] == 0) { n hs[k] = 1; n str[j] = A + k; n break; n } n } n } n } n break; n } n if (str[i] == ? ) n xNum++; n else { n if (hs[str[i] - A ] == 0) { n hs[str[i] - A ] = 1; n cCnt++; n } else { n hs[str[i] - A ]++; n cCnt++; n for (int j = sta; j < i; j++) { n if (str[j] == str[i]) { n hs[str[j] - A ]--; n cCnt--; n sta = j + 1; n break; n } else { n if (str[j] == ? ) n xNum--; n else { n hs[str[j] - A ]--; n cCnt--; n } n } n } n } n } n } n if (!ok && i - sta >= 26 && cCnt + xNum == 26) { n ok = true; n for (int j = sta; j < sta + 26; j++) { n if (str[j] == ? ) { n for (int k = 0; k < 26; k++) { n if (hs[k] == 0) { n hs[k] = 1; n str[j] = A + k; n break; n } n } n } n } n } n if (ok) { n for (int i = 0; i < len; i++) { n if (str[i] == ? ) str[i] = A ; n } n printf( %s n , str); n } else { n puts( -1 ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 30; n int n, a[maxn]; n long long k, res; n bool check(long long x) { n long long sum = 0; n for (int i = 0; i < n; ++i) { n sum += min((long long)a[i], x); n if (sum > k) return false; n } n return true; n } n int main() { n scanf( %d%I64d , &n, &k); n long long sum = 0; n for (int i = 0; i < n; ++i) { n scanf( %d , &a[i]); n sum += a[i]; n } n if (k > sum) { n printf( -1 n ); n return 0; n } n long long l = 0, r = sum; n while (l <= r) { n long long m = l + (r - l) / 2; n if (check(m)) n l = m + 1; n else n r = m - 1; n } n sum = 0; n for (int i = 0; i < n; ++i) sum += min((long long)a[i], r); n res = k - sum; n int st = 0, flag = 1; n for (int i = 0; i < n; ++i) { n a[i] -= min((long long)a[i], r); n if (a[i]) { n if (res == 0 && flag) { n flag = 0; n st = i; n } else if (res > 0) { n --res; n --a[i]; n } n } n } n for (int i = st; i < n; ++i) n if (a[i]) printf( %d , i + 1); n for (int i = 0; i < st; ++i) n if (a[i]) printf( %d , i + 1); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int x[3], y[3], r[3]; n double ansx, ansy; n bool bisecting_normal(double x1, double y1, double x2, double y2, double &a, n double &b, double &c) { n double xm = (x1 + x2) * 0.5; n double ym = (y1 + y2) * 0.5; n double xl = x2 - x1; n double yl = y2 - y1; n if (fabs(xl) < 1.0e-10 && fabs(yl) < 1.0e-10) return false; n a = xl; n b = yl; n c = -xl * xm - yl * ym; n return true; n } n bool dividing_locus(double x1, double y1, double r1, double x2, double y2, n double r2, double &xa, double &ya, double &ra) { n double a, b, c; n if (fabs(r1 - r2) < 1.0e-10) return false; n a = -r1 * r1; n b = r2 * r2; n c = a + b; n a /= c; n b /= c; n xa = x1 * b + x2 * a; n ya = y1 * b + y2 * a; n ra = fabs(r1 * r2 / c) * sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); n return true; n } n bool line2line() { n double a, b, c, d, e, f, g; n bisecting_normal(x[0], y[0], x[1], y[1], a, b, c); n bisecting_normal(x[0], y[0], x[2], y[2], d, e, f); n g = a * e - b * d; n if (fabs(g) < 1.0e-10) return false; n ansx = (b * f - e * c) / g; n ansy = (d * c - a * f) / g; n return true; n } n bool line2circle(int z) { n int z1, z2; n double a, b, c, d, e, s, t, u, n, xm, ym, xa1, xa2, ya1, ya2, d1, d2; n z1 = (z + 1) % 3; n z2 = (z + 2) % 3; n bisecting_normal(x[z1], y[z1], x[z2], y[z2], a, b, c); n dividing_locus(x[z], y[z], r[z], x[z1], y[z1], r[z1], s, t, u); n n = sqrt(a * a + b * b); n d = (a * s + b * t + c) / n; n if (d > u) return false; n xm = s - d * a / n; n ym = t - d * b / n; n e = sqrt(u * u - d * d); n xa1 = xm + e * b / n; n ya1 = ym - e * a / n; n xa2 = xm - e * b / n; n ya2 = ym + e * a / n; n d1 = (xa1 - x[z]) * (xa1 - x[z]) + (ya1 - y[z]) * (ya1 - y[z]); n d2 = (xa2 - x[z]) * (xa2 - x[z]) + (ya2 - y[z]) * (ya2 - y[z]); n if (d1 < d2) { n ansx = xa1; n ansy = ya1; n } else { n ansx = xa2; n ansy = ya2; n } n return true; n } n bool circle2circle() { n double a, b, c, d, f, e, s1, t1, u1, s2, t2, u2, xm, ym, xv, yv, xa1, xa2, n ya1, ya2, d1, d2; n dividing_locus(x[0], y[0], r[0], x[1], y[1], r[1], s1, t1, u1); n dividing_locus(x[0], y[0], r[0], x[2], y[2], r[2], s2, t2, u2); n xv = t2 - t1; n yv = s1 - s2; n d = xv * xv + yv * yv; n if ((u1 + u2) * (u1 + u2) < d || (u1 - u2) * (u1 - u2) > d) return false; n a = d + u1 * u1 - u2 * u2; n b = d - u1 * u1 + u2 * u2; n c = a + b; n a /= c; n b /= c; n xm = s1 * b + s2 * a; n ym = t1 * b + t2 * a; n d = sqrt(d); n xv /= d; n yv /= d; n f = (d * d + u1 * u1 - u2 * u2) / (2. * d); n e = fabs(sqrt(u1 * u1 - f * f)); n xa1 = xm + e * xv; n ya1 = ym + e * yv; n xa2 = xm - e * xv; n ya2 = ym - e * yv; n d1 = (xa1 - x[0]) * (xa1 - x[0]) + (ya1 - y[0]) * (ya1 - y[0]); n d2 = (xa2 - x[0]) * (xa2 - x[0]) + (ya2 - y[0]) * (ya2 - y[0]); n if (d1 < d2) { n ansx = xa1; n ansy = ya1; n } else { n ansx = xa2; n ansy = ya2; n } n return true; n } n int main() { n bool exists; n for (int i = 0; i < 3; i++) { n cin >> x[i] >> y[i] >> r[i]; n } n if (r[0] == r[1]) { n if (r[0] == r[2]) { n exists = line2line(); n } else { n exists = line2circle(2); n } n } else { n if (r[0] == r[2]) { n exists = line2circle(1); n } else { n exists = circle2circle(); n } n } n if (exists) { n cout << fixed << setprecision(5) << ansx << << ansy << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 2000000002; n pair p[100005]; n long long minl[100005], maxl[100005], minr[100005], maxr[100005]; n int main() { n int i, j, n, a, b; n while (~scanf( %d , &n)) { n for (i = 0; i < n; i++) { n scanf( %d%d , &a, &b); n p[i] = make_pair(a - b, a + b); n } n sort(p, p + n); n minl[0] = maxl[0] = p[0].second; n for (i = 1; i < n; i++) n minl[i] = min(minl[i - 1], p[i].second), n maxl[i] = max(maxl[i - 1], p[i].second); n minr[n - 1] = maxr[n - 1] = p[n - 1].second; n for (i = n - 2; i >= 0; i--) n minr[i] = min(minr[i + 1], p[i].second), n maxr[i] = max(maxr[i + 1], p[i].second); n long long l = 0, r = 4 * inf; n while (l < r) { n long long s = (l + r) / 2; n bool can = 0; n j = 0; n for (i = 0; i < n; i++) { n while (j < n - 1 && p[j + 1].first - p[i].first <= s) j++; n if (i == 0 && j == n - 1) { n can = true; n break; n } n long long miny = inf, maxy = -inf; n if (i > 0) miny = min(minl[i - 1], miny), maxy = max(maxl[i - 1], maxy); n if (j < n - 1) n miny = min(miny, minr[j + 1]), maxy = max(maxr[j + 1], maxy); n if (maxy - miny <= s) can = true; n if (can) break; n } n if (can) n r = s; n else n l = s + 1; n } n double t = l * 0.5; n printf( %.8lf n , t); n } n return 0; n } n "} +{"func_code_string": "#include n int map[2001][2001] = {0}; n int ans[2001] = {0}; n int n, m, k; n char ss[2001]; n void show() { n int i, j; n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n printf( %d , map[i][j]); n } n printf( n ); n } n } n int main() { n int i, j, k; n scanf( %d %d %d , &n, &m, &k); n for (i = 0; i < n; i++) { n scanf( %s , ss); n for (j = 0; j < m; j++) { n if (ss[j] == . ) { n map[i][j] = 0; n } else if (ss[j] == L ) { n map[i][j] = 1; n } else if (ss[j] == R ) { n map[i][j] = 2; n } else if (ss[j] == U ) { n map[i][j] = 4; n } else { n map[i][j] = 8; n } n } n } n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n if (map[i][j] == 1) { n if (i <= j) ans[j - i]++; n } else if (map[i][j] == 2) { n if (i < m - j) ans[i + j]++; n } else if (map[i][j] == 4) { n if (!(i & 1)) ans[j]++; n } else if (map[i][j] == 8) { n } n } n } n printf( %d , ans[0]); n for (i = 1; i < m; i++) { n printf( %d , ans[i]); n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n if (n & 1) n cout << (n - 1) / 2; n else { n int v = 1; n while (v * 2 <= n) v = v * 2; n cout << (n - v) / 2; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1e9 + 7; n const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f; n int main() { n int n, m, array1[100][100], mini, maxi = -OO, i, j; n scanf( %d %d , &n, &m); n for (i = 0; i < n; ++i) { n for (j = 0; j < m; ++j) { n scanf( %d , &array1[i][j]); n } n } n for (i = 0; i < n; ++i) { n mini = OO; n for (j = 0; j < m; ++j) { n mini = min(mini, array1[i][j]); n } n maxi = max(maxi, mini); n } n printf( %d , maxi); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n long long i, j, k, l, n, m; n long long t; n cin >> t; n while (t--) { n cin >> n >> m; n for (i = 1; i <= n; i++) { n for (j = 1; j <= m; j++) { n if (i == 1 && j == 1) n cout << B ; n else if (i == 1 && j >= 2) n cout << W ; n else n cout << B ; n } n cout << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n vector > bord(312345); n vector ans; n int main() { n std::ios::sync_with_stdio(false); n int n, a, b, k; n cin >> n >> a >> b >> k; n string s; n cin >> s; n int i, sumi = 0, counter = 0; n for (i = 0; i < n; i++) { n if (s[i] == 1 ) { n counter++; n } else { n bord[counter].push_back(i + 1); n } n } n for (i = 0; i < counter + 1; i++) { n sumi += bord[i].size() / b; n } n sumi -= a; n sumi++; n cout << sumi << endl; n for (i = 0; i < counter + 1; i++) { n int val = bord[i].size(); n int j = b - 1; n while (sumi) { n if (j < val) { n ans.push_back(bord[i][j]); n j += b; n sumi--; n } else { n break; n } n } n } n for (i = 0; i < ans.size(); i++) { n cout << ans[i] << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1000000 + 10; n const int INF = 1e9 + 7; n const int MOD = 1e9 + 7; n const double eps = 1e-10; n const double pi = acos(-1); n int T, cases, n, m; n int main() { n ios::sync_with_stdio(false); n ; n cin >> n >> m; n int ans; n if (n == 1 || m == 1) n ans = n * m; n else if (n == 2 || m == 2) { n if (m == 2) swap(n, m); n if (m % 4 == 1) n ans = m / 4 * 4 + 2; n else n ans = (m + 3) / 4 * 4; n } else n ans = max((n * m) / 2, (n * m) - (n * m / 2)); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1610; n typedef int MAP[maxn][maxn]; n int n, m; n MAP A, B, flag, used; n int total; n int num[maxn * maxn], que[maxn * maxn * 2]; n MAP temp; n int px[] = {0, 0, 1, -1, 0}, py[] = {1, -1, 0, 0, 0}; n bool isok(int x, int y) { return x >= 1 && x <= n && y >= 1 && y <= m; } n void zoomin(MAP X) { n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) { n int value = 1; n for (int x = 0; x < 5; x++) n if (isok(i + px[x], j + py[x]) && X[i + px[x]][j + py[x]] == 0) n value = 0; n temp[i][j] = value; n } n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) X[i][j] = temp[i][j]; n } n void zoomout(MAP X) { n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) { n int value = 0; n for (int x = 0; x < 5; x++) n if (isok(i + px[x], j + py[x]) && X[i + px[x]][j + py[x]] == 1) n value = 1; n temp[i][j] = value; n } n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) X[i][j] = temp[i][j]; n } n void bfs(int x, int y, int& index) { n index++; n int start = 1, tail = 0, sum = 0; n que[++tail] = x; n que[++tail] = y; n used[x][y] = 1; n while (start <= tail) { n x = que[start++]; n y = que[start++]; n flag[x][y] = index; n sum++; n for (int i = 0; i < 4; i++) n if (isok(x + px[i], y + py[i]) && !used[x + px[i]][y + py[i]] && n B[x + px[i]][y + py[i]] == 1) { n used[x + px[i]][y + py[i]] = 1; n que[++tail] = x + px[i]; n que[++tail] = y + py[i]; n } n } n if (sum < 100) index--; n } n void bfs(int x, int y) { n int start = 1, tail = 0, sum = 0, index = 0; n que[++tail] = x; n que[++tail] = y; n used[x][y] = 1; n while (start <= tail) { n x = que[start++]; n y = que[start++]; n sum++; n for (int i = 0; i < 4; i++) n if (isok(x + px[i], y + py[i]) && !used[x + px[i]][y + py[i]] && n A[x + px[i]][y + py[i]] == 1) { n if (!flag[x + px[i]][y + py[i]]) { n used[x + px[i]][y + py[i]] = 1; n que[++tail] = x + px[i]; n que[++tail] = y + py[i]; n } else { n index = flag[x + px[i]][y + py[i]]; n } n } n } n if (sum > 2) num[index]++; n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) scanf( %d , &A[i][j]); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) B[i][j] = A[i][j]; n for (int i = 1; i <= 3; i++) zoomin(B); n for (int i = 1; i <= 4; i++) zoomout(B); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n if (!used[i][j] && B[i][j]) bfs(i, j, total); n memset(used, 0, sizeof(used)); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n if (!used[i][j] && A[i][j] && !flag[i][j]) bfs(i, j); n sort(num + 1, num + 1 + total); n cout << total << endl; n for (int i = 1; i <= total; i++) cout << num[i] << ; n return 0; n } n "} +{"func_code_string": "#include n int main(void) { n int n, sum = 0; n scanf( %d , &n); n getchar(); n char str[n]; n gets(str); n for (int i = 0; i < n; i++) { n if (str[i] == + ) n sum++; n else if (str[i] == - && sum != 0) n sum--; n } n printf( %d n , sum); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n, m; n cin >> n >> m; n int a[n], s = 0; n for (int i = 0; i < n; i++) { n cin >> a[i]; n s += a[i]; n } n if (s >= m) n cout << m << endl; n else n cout << s << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 10, inf = 0x3f3f3f3f; n int sa[N]; n int rk[N]; n int tmp[N]; n int lcp[N]; n char s[N], t[N]; n int n, k; n bool cmp(int i, int j) { n if (rk[i] != rk[j]) n return rk[i] < rk[j]; n else { n int ri = i + k <= n ? rk[i + k] : -1; n int rj = j + k <= n ? rk[j + k] : -1; n return ri < rj; n } n } n void build(char *s, int *sa) { n n = strlen(s); n for (int i = 0; i <= n; i++) { n sa[i] = i; n rk[i] = i < n ? s[i] : -1; n } n for (k = 1; k <= n; k *= 2) { n sort(sa, sa + n + 1, cmp); n tmp[sa[0]] = 0; n for (int i = 1; i <= n; i++) { n tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0); n } n for (int i = 0; i <= n; i++) { n rk[i] = tmp[i]; n } n } n } n void LCP(char *s, int *sa, int *lcp) { n n = strlen(s); n for (int i = 0; i <= n; i++) rk[sa[i]] = i; n int h = 0; n lcp[0] = 0; n for (int i = 0; i < n; i++) { n int j = sa[rk[i] - 1]; n for (h ? h-- : 0; j + h < n && i + h < n && s[j + h] == s[i + h]; h++) n ; n lcp[rk[i] - 1] = h; n } n } n int st[N], pos[N]; n int main() { n int T; n scanf( %d , &T); n while (T--) { n scanf( %s , s); n int n = strlen(s); n build(s, sa); n LCP(s, sa, lcp); n for (int i = 0; i < n; i++) { n } n int now = 0; n lcp[n] = 0; n long long ans = 0; n for (int i = 1; i <= n; i++) { n int newpos = i, len = lcp[i]; n while (now > 0 && st[now] > len) { n long long v1 = st[now] - max(st[now - 1], len); n long long v2 = i - pos[now] + 1; n ans += v1 * v2 * v2; n newpos = pos[now--]; n } n st[++now] = len; n pos[now] = newpos; n } n for (int i = 0; i < n; i++) { n ans += n - i - max(lcp[rk[i] - 1], lcp[rk[i]]); n } n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 2000; n int n, m, k, t, a[MAX_N + 1], b[MAX_N + 1], p[MAX_N + 1]; n vector x; n vector y; n int main() { n int i, j, ans = 0; n scanf( %d , &n); n for (i = 1; i <= n; i++) scanf( %d , a + i); n for (i = 1; i <= n; i++) scanf( %d , b + i), p[b[i]] = i; n for (i = 1; i <= n; i++) { n for (k = i;; k++) n if (p[a[k]] == i) break; n while (k != i) { n for (j = i; j <= k; j++) n if (p[a[j]] >= k) { n x.push_back(k); n y.push_back(j); n ans += k - j; n swap(a[j], a[k]); n k = j; n } n } n } n printf( %d n%d n , ans, x.size()); n for (i = 0; i < x.size(); i++) printf( %d %d n , x[i], y[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char c; n int v[300], a; n int main() { n v[ > ] = 0; n v[ < ] = 1; n v[ + ] = 2; n v[ - ] = 3; n v[ . ] = 4; n v[ , ] = 5; n v[ [ ] = 6; n v[ ] ] = 7; n while (cin >> c) a = (a * 16 + 8 + v[c]) % 1000003; n cout << a << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long a, b; n cin >> a >> b; n cout << fixed << setprecision(7) << a * pow(double(1.000000011), b) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1000000000; n long long mod = 1000000007LL; n long long mod2 = 998244353LL; n int n, m, k; n bool a[1000005]; n int main() { n cin >> n >> m >> k; n memset(a, false, sizeof(a)); n for (int i = 1; i <= n; ++i) { n int ai; n scanf( %d , &ai); n a[ai] = true; n } n int ans = 0; n deque dq; n for (int i = 1; i <= 1000001; ++i) { n if (a[i]) { n dq.push_back(i); n } n while (!dq.empty() && i - dq.front() >= m) { n dq.pop_front(); n } n if (i >= m) { n int det = dq.size() - (k - 1); n if (det > 0) { n for (int j = 1; j <= det; ++j) { n dq.pop_back(); n ans++; n } n } n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int cnt[5005][5005]; n int len; n char st[5005]; n bool palin[5005][5005]; n void updateFreq(int r, int c) { n int cc; n while (r <= len) { n cc = c; n while (cc <= len) { n cnt[r][cc]++; n cc += (cc & (-cc)); n } n r += (r & (-r)); n } n } n int readFreq(int r, int c) { n int ret = 0; n int cc; n while (r > 0) { n cc = c; n while (cc > 0) { n ret += cnt[r][cc]; n cc -= (cc & (-cc)); n } n r -= (r & (-r)); n } n return ret; n } n int main() { n scanf( %s , st + 1); n len = strlen(st + 1); n int q; n scanf( %d , &q); n for (int d = 0, lets_stop_here = (int)len + 1; d < lets_stop_here; d++) { n for (int i = 1, lets_stop_here = (int)len; i <= lets_stop_here; i++) { n int j = i + d; n if (j > len) break; n if (i == j) n palin[i][j] = true; n else if (j - i == 1) n palin[i][j] = st[i] == st[j] ? true : false; n else if (palin[i + 1][j - 1]) n palin[i][j] = st[i] == st[j] ? true : false; n else n palin[i][j] = false; n if (palin[i][j]) updateFreq(i, j); n } n } n while (q--) { n int l, r; n scanf( %d %d , &l, &r); n int ans = readFreq(r, r) - readFreq(r, l - 1) - readFreq(l - 1, r) + n readFreq(l - 1, l - 1); n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n const int maxn = 1e5 + 51; n const int mod1 = 1e9 + 7; n const int mod2 = 1e9 + 9; n std::vector> g[maxn]; n int dfn[maxn], idx = 0; n int f[maxn], fw[maxn]; n int xr; n std::vector> V; n void dfs(int u, int fa) { n dfn[u] = ++idx; n for (auto x : g[u]) { n int v = x.first, w = x.second; n if (v == fa) continue; n if (!dfn[v]) { n f[v] = u, fw[v] = w; n dfs(v, u); n } else if (dfn[v] > dfn[u]) { n std::vector vec; n int cur = w; n for (int now = v; now ^ u; now = f[now]) cur ^= fw[now]; n vec.push_back(cur ^ w); n for (int now = v; now ^ u; now = f[now]) vec.push_back(cur ^ fw[now]); n xr ^= cur; n V.push_back(vec); n } n } n } n int add(int x, int y, const int& mod) { n x += y; n return (x >= mod) ? x - mod : x; n } n int dec(int x, int y, const int& mod) { n x -= y; n return (x < 0) ? x + mod : x; n } n int n, m; n int main() { n std::ios::sync_with_stdio(false); n std::cin.tie(nullptr); n std::cout.tie(nullptr); n std::cin >> n >> m; n for (int i = 1; i <= m; i++) { n int u, v, w; n std::cin >> u >> v >> w; n g[u].push_back({v, w}); n g[v].push_back({u, w}); n xr ^= w; n } n dfs(1, 0); n static int a[1 << 17 | 3], b[1 << 17 | 3]; n auto fwt = [&](int* f, int lim, const int& inv, const int& mod) { n for (int len = 1; len < lim; len <<= 1) { n for (int i = 0; i < lim; i += len << 1) { n for (int j = 0; j < len; j++) { n int x = f[i + j], y = f[i + j + len]; n f[i + j] = add(x, y, mod); n f[i + j + len] = dec(x, y, mod); n if (inv > 1) n f[i + j] = 1ll * f[i + j] * inv % mod, n f[i + j + len] = 1ll * f[i + j + len] * inv % mod; n } n } n } n }; n a[xr] = 1, b[xr] = 1; n fwt(a, 1 << 17, 1, mod1); n fwt(b, 1 << 17, 1, mod2); n static int c[1 << 17 | 3], d[1 << 17 | 3]; n for (auto v : V) { n memset(c, 0, sizeof(c)); n memset(d, 0, sizeof(d)); n for (auto x : v) c[x]++, d[x]++; n fwt(c, 1 << 17, 1, mod1); n fwt(d, 1 << 17, 1, mod2); n for (int i = 0; i < (1 << 17); i++) { n a[i] = 1ll * a[i] * c[i] % mod1; n b[i] = 1ll * b[i] * d[i] % mod2; n } n } n fwt(a, 1 << 17, (mod1 + 1) >> 1, mod1); n fwt(b, 1 << 17, (mod2 + 1) >> 1, mod2); n for (int i = 0; i < (1 << 17); i++) n if (a[i] || b[i]) { n std::cout << i << << a[i] << n ; n return 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 9; n const long long mod = 998244353; n long long dp[N][1 << 7]; n int s[N][1 << 7], st[N], Log[1 << 7]; n struct node { n int v, id; n } a[N]; n bool cmp(node a, node b) { return a.v > b.v; } n void upd(long long &a, long long b) { n if (a < b) a = b; n } n int main() { n int n, p, k; n for (int i = (1); i < (N); ++i) st[i] = st[i >> 1] + (i & 1); n for (int i = (0); i < (7); ++i) Log[1 << i] = i; n scanf( %d%d%d , &n, &p, &k); n for (int i = (1); i < (n + 1); ++i) { n scanf( %d , &a[i].v); n a[i].id = i; n } n sort(a + 1, a + 1 + n, cmp); n int op = (1 << p) - 1; n for (int i = (1); i < (n + 1); ++i) n for (int j = (0); j < (p); ++j) scanf( %d , &s[i][j]); n for (int i = (1); i < (p + k + 1); ++i) { n for (int mask = (0); mask < (1 << p); ++mask) { n if (st[mask] > i - 1) continue; n upd(dp[i - st[mask]][mask], dp[i - st[mask] - 1][mask] + a[i].v); n int pos = op ^ mask; n while (pos) { n upd(dp[i - st[mask] - 1][mask | ((pos) & (-pos))], n dp[i - st[mask] - 1][mask] + s[a[i].id][Log[((pos) & (-pos))]]); n pos ^= ((pos) & (-pos)); n } n } n } n for (int i = (p + k + 1); i < (n + 1); ++i) { n for (int mask = (1 << p) - 1; mask >= (0); --mask) { n int pos = mask; n while (pos) { n upd(dp[k][mask], n dp[k][mask ^ ((pos) & (-pos))] + s[a[i].id][Log[((pos) & (-pos))]]); n pos ^= ((pos) & (-pos)); n } n } n } n printf( %lld , dp[k][op]); n } n "} +{"func_code_string": "#include n using namespace std; n long long ans[100010]; n long long ans2[100010]; n int main() { n int n, p; n int l, r; n while (cin >> n >> p) { n for (int i = 0; i < n; i++) { n scanf( %d%d , &l, &r); n ans[i] = r / p - l / p; n ans2[i] = r - l + 1; n if (l % p == 0) ans[i]++; n } n ans[n] = ans[0]; n ans2[n] = ans2[0]; n double anss = 0; n for (int i = 0; i < n; i++) n anss += ((ans[i] * (ans2[i + 1] - ans[i + 1]) + n (ans2[i] - ans[i]) * ans[i + 1] + ans[i] * ans[i + 1]) * n 1.0) / n (ans2[i] * ans2[i + 1] * 1.0) * 2000; n printf( %.10llf , anss); n } n return 0; n } n "} +{"func_code_string": "#include n #pragma warning(disable : 4996) n using namespace std; n int IT_MAX = 1 << 17; n const long long MOD = 5000000; n const int INF = 1034567891; n const long long LL_INF = 1234567890123456789ll; n const double PI = 3.141592653589793238; n const double ERR = 1E-11; n int in[200050]; n int lr[200050][2]; n int v[200050]; n int main() { n int N, T, K, i, j; n scanf( %d %d %d , &N, &T, &K); n for (i = 1; i <= T; i++) scanf( %d , &in[i]); n in[0] = 1; n for (i = 1; i < T; i++) { n lr[i][1] = in[i] - 1; n lr[i][0] = max(0, in[i] - in[i + 1]); n } n lr[T][0] = lr[T][1] = in[T]; n int mn = 0, mx = 0; n for (i = 1; i <= T; i++) mn += lr[i][0], mx += lr[i][1]; n if (K < mn || mx < K) return !printf( -1 n ); n int t = K - mn; n for (i = 1; i <= T; i++) { n int t2 = min(t, lr[i][1] - lr[i][0]); n t -= t2; n v[i] = in[i] - (lr[i][0] + t2); n } n v[0] = 1; n printf( %d n , N); n int pst = 1; n for (i = 1; i <= T; i++) { n int st = pst + in[i - 1]; n for (j = 0; j < v[i - 1]; j++) printf( %d %d n , pst + j, st + j); n for (j = v[i - 1]; j < in[i]; j++) printf( %d %d n , pst, st + j); n pst = st; n } n return 0; n } n "} +{"func_code_string": "#include n #define LL long long n #define dl double n #define P pair n using namespace std; n n const int N = 2e5 + 10; n n int n; n struct ghb{ n int a,b; n bool operator < (const ghb &o)const{ n return min(a,b) < min(o.a,o.b); n } n }f[N]; n LL ans; n int mx; n n int main(){ n // freopen( in.txt , r ,stdin); n // freopen( o.txt , w ,stdout); n std::ios::sync_with_stdio(false); n std::cin.tie(nullptr); n cin >> n; n for(int i = 1;i <= n;i++)cin >> f[i].a; n for(int i = 1;i <= n;i++)cin >> f[i].b; n for(int i = 1;i <= n;i++)ans += abs(f[i].a - f[i].b); n sort(f + 1,f + n + 1); n int mx_1 = 0,mx_2 = 0; n for(int i = 1;i <= n;i++){ n if(f[i].a > f[i].b){ n if(mx_1)mx = max(mx,min(mx_1,f[i].a) - f[i].b); n mx_2 = max(mx_2,f[i].a); n } n else { n if(mx_2)mx = max(mx,min(mx_2,f[i].b) - f[i].a); n mx_1 = max(mx_1,f[i].b); n } n } n cout << ans - 2 * mx << endl; n return 0; n } n /**/"} +{"func_code_string": "#include n using namespace std; n long long GCD(long long a, long long b) { return (b == 0) ? a : GCD(b, a % b); } n bool isPrime(int x) { n for (int i = 2; i <= sqrt(x); i++) n if (x % i == 0) return 0; n return 1; n } n bool C[26]; n int main() { n int n, a; n cin >> n >> a; n vector v(n); n for (int i = 0; i < n; i++) { n scanf( %d , &v[i]); n } n int ans = 0; n if (a - 1 < n - a) { n reverse(v.begin(), v.end()); n a = n - a + 1; n } n a--; n for (int i = 0; i < a + 1; i++) { n if (v[i] == 1 && ((2 * a - i) >= n || i == a)) n ans++; n else if (v[i] == 1 && v[2 * a - i] == 1) n ans += 2; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a, b; n long long c, d; n int main() { n while (cin >> a >> b) { n cin >> c >> d; n for (int i = 0; i <= 1000; ++i) { n for (int j = 0; j <= 1000; ++j) { n if ((b + a * i) == (d + c * j)) { n cout << b + a * i << endl; n return 0; n } n } n } n cout << -1 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int mid, i, j; n string a; n cin >> a; n if ((a.length()) % 2) { n cout << NO n ; n continue; n } n mid = (a.length()) / 2; n j = mid; n i = 0; n while (i < mid) { n if (a[i] == a[j]) { n i++; n j++; n } else { n cout << NO n ; n break; n } n } n if (i == mid) { n cout << YES n ; n } n } n } n "} +{"func_code_string": "#include n const int N = 100100; n const long long mod = 1e9 + 7; n using namespace std; n int n, Xa, Ya, Xb, Yb; n int Smallest(int a, int b, int c, int d) { n int min_ = a; n if (min_ > b) min_ = b; n if (min_ > c) min_ = c; n if (min_ > d) min_ = d; n return min_; n } n int main() { n ios_base::sync_with_stdio(0); n cin >> n >> Xa >> Ya >> Xb >> Yb; n if ((Xa == Xb && (Xa == 0 || Xa == n)) || (Ya == Yb && (Ya == 0 || Ya == n))) n cout << abs(Xa - Xb) + abs(Ya - Yb) << n ; n else n cout << Smallest(abs(0 - Xa) + abs(0 - Ya) + abs(0 - Xb) + abs(0 - Yb), n abs(0 - Xa) + abs(n - Ya) + abs(0 - Xb) + abs(n - Yb), n abs(n - Xa) + abs(0 - Ya) + abs(n - Xb) + abs(0 - Yb), n abs(n - Xa) + abs(n - Ya) + abs(n - Xb) + abs(n - Yb)) n << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n scanf( %d %d , &n, &k); n int a[500005]; n map> m; n set s; n for (int i = 0; i < n; i++) s.insert(i); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n m[a[i]].push_back(i); n } n int llast = n + k; n int last = n; n int cnt = 0; n for (auto it : m) { n if (!cnt && it.second[0] < last - k) { n auto it = s.lower_bound(llast - k); n if (it != s.end()) last = *it; n cnt = 1; n } n if (it.second[0] < last - k) { n printf( NO n ); n return 0; n } n for (auto it2 : it.second) { n s.erase(it2); n } n llast = last; n last = min(it.second[0], last); n } n printf( YES n ); n } n "} +{"func_code_string": "#include n using namespace std; n map glosy; n map, int> parki; n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = (0); i < (n); i++) { n int a, b; n scanf( %d%d , &a, &b); n if (a > b) swap(a, b); n if (glosy.find(a) != glosy.end()) n glosy[a]++; n else n glosy.insert(make_pair(a, 1)); n if (glosy.find(b) != glosy.end()) n glosy[b]++; n else n glosy.insert(make_pair(b, 1)); n if (parki.find(make_pair(a, b)) != parki.end()) n parki[make_pair(a, b)]++; n else n parki.insert(make_pair(make_pair(a, b), 1)); n } n if (m == 0) { n cout << (n * 1LL * (n - 1LL)) / 2LL << endl; n return 0; n } n long long int res = 0LL; n vector v; n for (map::iterator it = glosy.begin(); it != glosy.end(); it++) n v.push_back(it->second); n int jeszcze = n - v.size(); n sort(v.begin(), v.end()); n int k = v.size(); n for (int i = (0); i < (k); i++) { n vector::iterator it2 = lower_bound(v.begin(), v.end(), m - v[i]); n int ile = (v.end() - it2); n if (v[i] + v[i] >= m) ile--; n if (v[i] >= m) ile += 2 * jeszcze; n res += ile * 1LL; n } n res = res / 2; n for (map, int>::iterator it = parki.begin(); it != parki.end(); n it++) { n pair para = it->first; n int a = para.first; n int b = para.second; n int x = glosy[a] + glosy[b] - it->second; n if (x < m && ((glosy[a] + glosy[b]) >= m)) res--; n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n const int LG = 21; n const int N = 500005; n const long long MOD = 1e9 + 7; n const long long INF = 1e9; n const long long INFLL = 1e18; n using namespace std; n void dfs(int v, int paint, vector &col, n vector > > &graph, vector &need, int &cnt0, n int &cnt1, int &fl) { n col[v] = paint; n if (paint == -1) n cnt0++; n else n cnt1++; n if (need[v] != 0) { n if (paint == need[v]) n fl = 1; n else n fl = -1; n } n for (auto p : graph[v]) { n if (col[p.first] == 0) { n dfs(p.first, p.second * paint, col, graph, need, cnt0, cnt1, fl); n } n } n } n int root[N]; n vector suns[N]; n int cntsame[N]; n int sametoroot[N]; n int fl[N]; n int ans; n int Root(int x) { return root[x] == x ? x : Root(root[x]); } n void complete_data(int v, int FL) { n int x = Root(v); n if (fl[x] != 0) return; n FL *= sametoroot[v]; n int took_before = min(cntsame[x], (int)suns[x].size() - cntsame[x]); n ans -= took_before; n fl[x] = FL; n if (FL == 1) n ans += cntsame[x]; n else n ans += suns[x].size() - cntsame[x]; n } n void Merge(int v, int u, int w) { n int x = Root(v), y = Root(u); n if (x == y) return; n if (suns[x].size() > suns[y].size()) { n swap(v, u); n swap(x, y); n } n w *= sametoroot[v]; n w *= sametoroot[u]; n if (fl[x] == 0 && fl[y] == 0) { n ans -= min(cntsame[x], (int)suns[x].size() - cntsame[x]); n ans -= min(cntsame[y], (int)suns[y].size() - cntsame[y]); n } n if (fl[x] == 0 && fl[y] != 0) { n complete_data(x, fl[y] * w); n } n if (fl[x] != 0 && fl[y] == 0) { n complete_data(y, fl[x] * w); n } n for (auto u : suns[x]) { n suns[y].push_back(u); n sametoroot[u] *= w; n if (sametoroot[u] == 1) cntsame[y]++; n } n if (fl[x] == 0 && fl[y] == 0) { n ans += min(cntsame[y], (int)suns[y].size() - cntsame[y]); n } n root[x] = y; n } n signed main() { n srand(time(NULL)); n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n, k; n cin >> n >> k; n string s; n cin >> s; n vector > contains(n); n for (int i = 0; i < k; i++) { n int c; n cin >> c; n for (int j = 0; j < c; j++) { n int x = 0; n cin >> x; n x--; n contains[x].push_back(i); n } n } n vector > > graph(k); n vector need(k, 0); n for (int i = 0; i < k; i++) root[i] = i; n for (int i = 0; i < k; i++) suns[i].push_back(i); n for (int i = 0; i < k; i++) cntsame[i] = 1; n for (int i = 0; i < k; i++) sametoroot[i] = 1; n for (int i = 0; i < n; i++) { n if (contains[i].size() == 1) { n if (s[i] == 1 ) { n need[contains[i][0]] = -1; n complete_data(contains[i][0], -1); n } else { n need[contains[i][0]] = 1; n complete_data(contains[i][0], 1); n } n } n if (contains[i].size() == 2) { n if (s[i] == 0 ) { n graph[contains[i][0]].push_back({contains[i][1], -1}); n graph[contains[i][1]].push_back({contains[i][0], -1}); n Merge(contains[i][0], contains[i][1], -1); n } else { n graph[contains[i][0]].push_back({contains[i][1], 1}); n graph[contains[i][1]].push_back({contains[i][0], 1}); n Merge(contains[i][0], contains[i][1], 1); n } n } n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 10; n vector v; n set > st; n int bfs(int x) { n queue q; n q.push(x); n int cnt = 0; n while (!q.empty()) { n int u = q.front(); n q.pop(); n cnt++; n int len = v.size(); n for (int i = 0; i < len; i++, len = v.size()) { n int p = v[i]; n if (st.find(make_pair(u, p)) != st.end()) n continue; n else n swap(v[i], v.back()), v.pop_back(), q.push(p), i--; n } n } n return cnt; n } n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 0; i < m; i++) { n int u, v; n scanf( %d%d , &u, &v); n st.insert(make_pair(u, v)); n st.insert(make_pair(v, u)); n } n for (int i = 1; i <= n; i++) v.push_back(i); n int ans = 0; n while (!v.empty()) { n int x = v.back(); n v.pop_back(); n bfs(x); n ans++; n } n printf( %d n , ans - 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool essentiallyEqual(float a, float b) { n return fabs(a - b) <= ((fabs(a) > fabs(b) ? fabs(b) : fabs(a)) * 1e-6); n } n struct TVector { n long long x, y; n TVector operator+(TVector q) const { return {x + q.x, y + q.y}; } n TVector operator-(TVector q) const { return {x - q.x, y - q.y}; } n TVector operator*(int t) const { return {x * t, y * t}; } n long long operator*(TVector q) const { return {x * q.x + y * q.y}; } n long long operator^(TVector q) const { return {x * q.y - q.x * y}; } n long double operator~() const { return {hypot(x, y)}; } n long double disPointLine(TVector p, TVector q) { n TVector r = *this; n if (((r - p) * (q - p) >= 0) && ((r - q) * (p - q) >= 0)) { n return abs((q - p) ^ (r - p)) / ~(p - q); n } else { n return min(~(r - p), ~(r - q)); n } n } n bool onLine(TVector p, TVector q) { n TVector r = *this; n long double dis = r.disPointLine(p, q); n return essentiallyEqual(dis, 0); n } n long double sqrdDist(TVector p) { n return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y); n } n int orientation(TVector b, TVector c) { n TVector a = *this; n int val = (c - a) ^ (b - a); n return val; n } n int orientationV2(TVector b, TVector c) { n TVector a = *this; n int val = (c - a) ^ (b - a); n if (val == 0) return 0; n return (val > 0) ? 1 : 2; n } n void imprimePonto() { printf( %lld %lld , x, y); } n }; n vector stormtroopers; n vector isShot; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int n, x0, y0; n cin >> n >> x0 >> y0; n TVector gun; n gun.x = x0; n gun.y = y0; n for (int i = 0; i < n; ++i) { n int x, y; n cin >> x >> y; n stormtroopers.push_back({x, y}); n isShot.push_back(0); n } n int tiros = 0; n for (int i = 0; i < n; ++i) { n if (!isShot[i]) { n tiros++; n for (int j = i + 1; j < n; ++j) { n if (!isShot[j]) { n if (!gun.orientationV2(stormtroopers[i], stormtroopers[j])) n isShot[j] = 1; n } n } n } n } n cout << tiros << endl; n return 0; n } n "} +{"func_code_string": "#include n #include n #include n #include n #include n #include n #define ll long long n using namespace std; n n n int main() n { n ll t; n cin >> t; n while (t--) { n ll n, m; n cin >> n >> m; n string s; n vector a(n, 0); n vector b(n, 0); n vector c(m, 0); n vector result(m, 0); n vector> bucket(n + 1, vector(0)); n n for (auto& e : a)cin >> e; n for (auto& e : b)cin >> e; n for (auto& e : c)cin >> e; n n for (ll i = 0; i < n; i++) n { n if (b[i] != a[i]) { n bucket[b[i]].push_back(i); n } n } n n ll lastC = -1; n if (bucket[c[m - 1]].size() > 0) { n lastC = bucket[c[m - 1]].back(); n bucket[c[m - 1]].pop_back(); n } n else { n for (ll i = 0; i < n; i++) n { n if (b[i] == c[m - 1]) { n lastC = i; n break; n } n } n } n n if (lastC == -1) { n cout << NO << endl; n } n else { n result[m - 1] = lastC; n for (ll i = 0; i < m - 1; i++) n { n if (bucket[c[i]].size() == 0) { n result[i] = lastC; n } n else { n result[i] = bucket[c[i]].back(); n bucket[c[i]].pop_back(); n } n } n n auto res = true; n for (ll i = 0; i < n + 1; i++) n { n if (bucket[i].size() > 0) { n res = false; n } n } n n if (res == false) { n cout << NO << endl; n } n else { n cout << YES << endl; n for (ll i = 0; i < m; i++) n { n cout << result[i] + 1; n if (i < m - 1) { n cout << ; n } n else { n cout << endl; n } n } n } n } n } n return 0; n }"} +{"func_code_string": "#include n using namespace std; n const int nmax = 1010; n const int inf = 1000000007; n int n; n pair a[nmax]; n int main() { n ios_base::sync_with_stdio(false); n cin >> n; n for (int i = 1; i <= n; ++i) cin >> a[i].first >> a[i].second; n long double ans = 1e15; n a[n + 1] = a[1]; n a[n + 2] = a[2]; n for (int i = 1; i <= n; ++i) { n pair a1 = a[i], a2 = a[i + 1], a3 = a[i + 2]; n long double A = a3.second - a1.second, B = a1.first - a3.first, n C = -A * a3.first - a3.second * B; n long double d = n abs(A * a2.first + B * a2.second + C) / (sqrt((A * A + B * B))); n if (ans > d) ans = d; n } n cout << fixed << setprecision(15) << ans / (long double)2.0 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 1e6 + 666; n long long saveori[maxn]; n long long save[maxn]; n long long getcnt(long long x) { n long long cnt = 0; n while (x) { n if (x & 1) cnt++; n x = x >> 1; n } n return cnt; n } n long long cnt[maxn][2]; n long long pre[maxn]; n signed main() { n long long n; n cin >> n; n for (long long i = 1; i <= n; i++) { n scanf( %lld , &saveori[i]); n save[i] = getcnt(saveori[i]); n } n long long sum = 0; n for (long long i = 1; i <= n; i++) { n cnt[i][0] = cnt[i - 1][0]; n cnt[i][1] = cnt[i - 1][1]; n cnt[i][sum % 2]++; n sum += save[i]; n pre[i] = sum; n } n long long ans = 0; n for (long long i = n; i >= 1; i--) { n long long maxval = -1; n sum = 0; n for (long long j = i; j >= i - 64 && j > 0; j--) { n sum += save[j]; n maxval = max(maxval, save[j]); n if (maxval * 2 <= sum && sum % 2 == 0) { n ans++; n } n } n if (i - 65 >= 1) { n ans += cnt[i - 65][pre[i] % 2]; n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n #define int long long int n void next(char &x){ n if(x<= b ){ n x++; n }else{ n x= a ; n } n } n void solve() { n int n,k; n cin>>n>>k; n char cur= a ; n for(int i=0;i> t; n while (t--){ n solve(); n } n }"} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC target( avx,avx2,fma ) n #pragma GCC optimization( unroll-loops ) n const int mod = 1e9 + 7; n using ll = int64_t; n using namespace std; n template n struct modnum { n static constexpr int MOD = MOD_; n static_assert(MOD_ > 0, MOD must be positive ); n int v; n n private: n using ll = long long; n static int minv(int a, int m) { n a %= m; n assert(a); n return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a); n } n n public: n modnum() : v(0) {} n modnum(ll v_) : v(int(v_ % MOD)) { n if (v < 0) v += MOD; n } n explicit operator int() const { return v; } n friend std::ostream& operator<<(std::ostream& out, const modnum& n) { n return out << int(n); n } n friend std::istream& operator>>(std::istream& in, modnum& n) { n ll v_; n in >> v_; n n = modnum(v_); n return in; n } n friend bool operator==(const modnum& a, const modnum& b) { n return a.v == b.v; n } n friend bool operator!=(const modnum& a, const modnum& b) { n return a.v != b.v; n } n modnum inv() const { n modnum res; n res.v = minv(v, MOD); n return res; n } n friend modnum inv(const modnum& m) { return m.inv(); } n modnum neg() const { n modnum res; n res.v = v ? MOD - v : 0; n return res; n } n friend modnum neg(const modnum& m) { return m.neg(); } n modnum operator-() const { return neg(); } n modnum operator+() const { return modnum(*this); } n modnum& operator++() { n v++; n if (v == MOD) v = 0; n return *this; n } n modnum& operator--() { n if (v == 0) v = MOD; n v--; n return *this; n } n modnum& operator+=(const modnum& o) { n v += o.v; n if (v >= MOD) v -= MOD; n return *this; n } n modnum& operator-=(const modnum& o) { n v -= o.v; n if (v < 0) v += MOD; n return *this; n } n modnum& operator*=(const modnum& o) { n v = int(ll(v) * ll(o.v) % MOD); n return *this; n } n modnum& operator/=(const modnum& o) { return *this *= o.inv(); } n friend modnum operator++(modnum& a, int) { n modnum r = a; n ++a; n return r; n } n friend modnum operator--(modnum& a, int) { n modnum r = a; n --a; n return r; n } n friend modnum operator+(const modnum& a, const modnum& b) { n return modnum(a) += b; n } n friend modnum operator-(const modnum& a, const modnum& b) { n return modnum(a) -= b; n } n friend modnum operator*(const modnum& a, const modnum& b) { n return modnum(a) *= b; n } n friend modnum operator/(const modnum& a, const modnum& b) { n return modnum(a) /= b; n } n }; n using mi = modnum; n void solve() { n int n, m; n cin >> n; n vector> adj(n); n for (int i = 0; i < n - 1; i++) { n int a, b; n cin >> a >> b; n a--, b--; n adj[a].push_back(b); n adj[b].push_back(a); n } n cin >> m; n vector fac(m); n for (int i = 0; i < m; i++) { n cin >> fac[i]; n } n auto comp = [&](mi X, mi Y) -> bool { return X.v < Y.v; }; n sort(fac.begin(), fac.end(), comp); n if (int(fac.size()) < n - 1) { n reverse(fac.begin(), fac.end()); n while (int(fac.size()) < n - 1) { n if (int(fac.size()) < n - 1) { n fac.push_back(mi(1)); n } n } n reverse(fac.begin(), fac.end()); n } n if (int(fac.size()) > n - 1) { n mi cur = 1; n while (int(fac.size()) >= n - 1) { n cur *= fac.back(); n fac.pop_back(); n } n fac.push_back(cur); n } n vector sz(n, 0), num; n function dfs = [&](int node, int par) -> void { n sz[node] = 1; n for (auto i : adj[node]) { n if (i != par) { n dfs(i, node); n sz[node] += sz[i]; n num.push_back((ll)sz[i] * (n - sz[i])); n } n } n }; n mi answer = 0; n dfs(0, 0); n sort(num.begin(), num.end()); n assert(int(num.size()) >= n - 1); n assert(int(fac.size()) == n - 1); n for (int i = 0; i < n - 1; i++) { n mi cur = (fac[i] * num[i]); n answer += cur; n } n cout << answer << n ; n } n int main() { n std::ios_base::sync_with_stdio(false); n std::cin.tie(nullptr); n int t(1); n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[105], z, x; n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , a + i); n if (a[i] % 2) x++; n z += a[i]; n } n if (z % 2) n printf( %d , x); n else n printf( %d , n - x); n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1000005, mod = 1000000007; n vector pri; n bool vis[80]; n int pos[80], a[maxn], n; n long long w[80]; n long long dp[1 << 21], dp2[1 << 21], f[maxn]; n void prework() { n for (int i = 2; i < (71); ++i) { n if (!vis[i]) { n pri.push_back(i); n pos[i] = (int)pri.size() - 1; n for (int j = i; j <= 70; j += i) vis[j] = 1; n } n } n f[0] = 1; n for (int i = 1; i < (maxn); ++i) f[i] = 2 * f[i - 1] % mod; n } n void init() { n scanf( %d , &n); n for (int i = 0; i < (n); ++i) { n scanf( %d , &a[i]); n w[a[i]]++; n } n } n int gao(int n) { n int tmp[30] = {0}; n for (int i = 2; i <= n; ++i) { n while (n % i == 0) { n n /= i; n tmp[pos[i]] ^= 1; n } n } n if (n > 1) tmp[pos[n]] ^= 1; n int res = 0; n for (int i = 0; i < (21); ++i) n if (tmp[i]) res |= (1 << i); n return res; n } n inline int get_nx(int st1, int st2) { return st1 ^ st2; } n void solve() { n dp[0] = 1; n for (int i = 2; i < (71); ++i) { n if (!w[i]) continue; n int st = gao(i); n for (int pre = 0; pre < (1 << 19); ++pre) { n int nx_st = get_nx(st, pre); n dp2[nx_st] += dp[pre] * f[w[i] - 1] % mod; n dp2[pre] += dp[pre] * f[w[i] - 1] % mod; n dp2[nx_st] %= mod; n dp2[pre] %= mod; n } n for (int k = 0; k < (1 << 19); ++k) dp[k] = dp2[k], dp2[k] = 0; n } n long long ans = dp[0] - 1; n if (w[1]) ans = (f[w[1]]) * ans % mod + f[w[1]] - 1; n cout << ans % mod << endl; n } n int main() { n prework(); n init(); n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1000000007; n ; n const int maxn = 410; n unsigned long long powmod(unsigned long long n, unsigned long long k) { n unsigned long long ret = 1; n while (k) { n if (k & 1) ret = ret * n % mod; n n = n * n % mod; n k >>= 1; n } n return ret; n } n int nxt[maxn][26]; n int dp[maxn][maxn]; n void upd(int& n, int k) { n if (n < 0 || n > k) n = k; n } n bool gao(const string& s, const string& t1, const string& t2) { n memset(dp, -1, sizeof(dp)); n for (int i = 0; i <= t1.size(); i++) n for (int j = 0; j <= t2.size(); j++) n if (dp[i][j] >= 0 || i + j == 0) { n int p = dp[i][j] + 1; n if (i < t1.size()) { n int n = nxt[p][t1[i] - a ]; n if (n >= 0) upd(dp[i + 1][j], n); n } n if (j < t2.size()) { n int n = nxt[p][t2[j] - a ]; n if (n >= 0) upd(dp[i][j + 1], n); n } n } n return dp[t1.size()][t2.size()] >= 0; n } n char str[maxn]; n char tt[maxn]; n int main() { n int t; n cin >> t; n while (t--) { n cin >> str >> tt; n memset(nxt, -1, sizeof(nxt)); n for (int i = strlen(str) - 1; i >= 0; i--) { n memcpy(nxt[i], nxt[i + 1], sizeof(nxt[i])); n nxt[i][str[i] - a ] = i; n } n bool yes = false; n if (strlen(tt) == 1) n yes = (nxt[0][tt[0] - a ] >= 0); n else { n for (int i = 0; tt[i + 1]; i++) { n char tmp = tt[i + 1]; n tt[i + 1] = 0; n string t1 = tt; n tt[i + 1] = tmp; n string t2 = tt + i + 1; n if (gao(str, t1, t2)) { n yes = true; n break; n } n } n } n if (yes) n puts( YES ); n else n puts( NO ); n } n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n long long Query(long long L, long long R) { n cout << L << << R << endl; n fflush(stdout); n string s; n cin >> s; n if (L == R && s == Yes ) exit(0); n return s == Yes ; n } n int32_t main() { n long long n, k; n cin >> n >> k; n long long L = 1, R = n; n while (true) { n if (R - L + 1 <= 4 * k + 7) { n long long M = L + rng() % (R - L + 1); n if (Query(M, M)) { n return 0; n } else { n L = max(1LL, L - k); n R = min(n, R + k); n } n } else { n long long M = L + ((R - L) >> 1); n if (Query(L, M)) { n L = max(1LL, L - k); n R = min(n, M + k); n } else { n L = max(1LL, M - k); n R = min(n, R + k); n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = (1e9 + 7); n const long long INF = (1e9 + 123456789); n const long long INFL = (INF * INF); n inline long long addm(long long a, long long b, long long m = MOD) { n return ((a + b) % m); n } n inline long long subm(long long a, long long b, long long m = MOD) { n return (((a - b) % m + m) % m); n } n inline long long mulm(long long a, long long b, long long m = MOD) { n return ((a * b) % m); n } n long long powm(long long a, long long b, long long m = MOD) { n long long ret = (!b) ? 1 : powm(a, b / 2, m); n return (!b) ? 1 : mulm(mulm(ret, ret, m), b % 2 ? a : 1, m); n } n long long gcd(long long a, long long b) { return (!b) ? a : gcd(b, a % b); } n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } n long long inv(long long x, long long m = MOD) { return powm(x, m - 2, m); } n const int N = 1000500; n int a[N], lft[N], nxt[N]; n vector nodes, g[N]; n struct SegmentTree { n int f, t; n SegmentTree *lc, *rc; n bool has_child, has_lazy = false; n int upd = 0; n int vmax = 0; n SegmentTree(int l, int r) { n if (l == r) { n f = t = l; n lc = rc = NULL; n has_child = false; n } else { n f = l; n t = r; n int mid = (l + r) / 2; n lc = new SegmentTree(l, mid); n rc = new SegmentTree(mid + 1, r); n has_child = true; n } n } n void change(int v) { n vmax += v; n upd += v; n has_lazy = true; n } n void push() { n if (!has_lazy) return; n lc->change(upd); n rc->change(upd); n upd = 0; n has_lazy = false; n } n void update(int l, int r, int x) { n if (r < f || l > t) return; n if (l <= f && t <= r) { n change(x); n return; n } n push(); n lc->update(l, r, x); n rc->update(l, r, x); n vmax = max(lc->vmax, rc->vmax); n } n int query(int l, int r) { n if (r < f || l > t) return 0; n if (l <= f && t <= r) return vmax; n return vmax = max(lc->query(l, r), rc->query(l, r)); n } n }; n void solve() { n int n, k; n cin >> n >> k; n for (int i = 0; i < n; i++) cin >> a[i]; n stack st; n for (int i = n - 1; i >= 0; i--) { n while (!st.empty() && a[st.top()] <= a[i]) st.pop(); n if (!st.empty()) n nxt[i] = st.top(); n else n nxt[i] = n; n st.push(i); n } n for (int i = 0; i < n; i++) g[nxt[i]].push_back(i); n function post = [&](int v) { n int l = (int)(nodes).size(); n for (int u : g[v]) post(u); n lft[(int)(nodes).size()] = l; n nodes.push_back(v); n }; n post(n); n SegmentTree root(0, n); n for (int i = 0; i < k; i++) root.update(lft[i], i, 1); n vector ans; n ans.push_back(root.query(0, n)); n for (int i = k; i < n; i++) { n root.update(lft[i - k], i - k, -1); n root.update(lft[i], i, 1); n ans.push_back(root.query(0, n)); n } n for (int i = 0; i < (int)(ans).size(); i++) { n if (i) cout << ; n cout << ans[i]; n } n cout << n ; n } n int main(int argc, char *argv[]) { n cin.sync_with_stdio(0); n cin.tie(NULL); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 2e5 + 100; n long long a[N]; n pair ask(long long l, long long r) { n cout << ? << l << << r << endl; n long long first; n cin >> first; n if (first == -1) exit(0); n long long f; n cin >> f; n return {first, f}; n } n void solve(long long l, long long r) { n if (l > r) return; n long long first, f; n tie(first, f) = ask(l, r); n long long l1 = r + 1 - f, r1 = l - 1 + f; n if (l1 <= r1) { n for (long long i = l1; i <= r1; i++) a[i] = first; n solve(l, l1 - 1); n solve(r1 + 1, r); n } else { n long long m = (l + r) / 2; n solve(l, m); n solve(m + 1, r); n } n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n; n cin >> n; n solve(1, n); n cout << ! ; n for (long long i = 1; i <= n; i++) cout << a[i] << ; n cout << endl; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast,unroll-loops,fast-math ) n using namespace std; n const int MAXN = 102, K = 900; n int n, m, k, u, v, x, y, t, a, b; n int A[MAXN]; n short F1[MAXN][MAXN][2 * MAXN]; n short F2[MAXN][MAXN][2 * MAXN]; n short F3[MAXN][MAXN][2 * MAXN]; n double dp[2][MAXN][MAXN]; n int C(int x) { return x * (x + 1) / 2; } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> k; n k = min(k, K); n for (int i = 0; i < n; i++) cin >> A[i]; n for (int l = 0; l < n; l++) n for (int r = l; r < n; r++) { n for (int i = 0; i < n; i++) n for (int j = i + 1; j < n; j++) { n bool ii = (l <= i && i <= r); n bool jj = (l <= j && j <= r); n if (ii && !jj) F1[i][j][l + r]++; n if (!ii && jj) F2[i][j][l + r]++; n if (ii && jj) F3[i][j][l + r]++; n } n } n int prev = 0, curr = 1; n for (int i = 0; i < n; i++) n for (int j = 0; j < i; j++) dp[0][i][j] = 1; n for (int x = 1; x <= k; x++) { n for (int i = 0; i < n; i++) n for (int j = i + 1; j < n; j++) { n dp[curr][i][j] = (C(i) + C(j - i - 1) + C(n - j - 1)) * dp[prev][i][j]; n for (int cent = i; cent < n + i; cent++) n dp[curr][i][j] += F1[i][j][cent] * dp[prev][cent - i][j]; n for (int cent = j; cent < n + j; cent++) n dp[curr][i][j] += F2[i][j][cent] * dp[prev][i][cent - j]; n for (int cent = j; cent < n + i; cent++) n dp[curr][i][j] += F3[i][j][cent] * dp[prev][cent - i][cent - j]; n dp[curr][i][j] /= C(n); n dp[curr][j][i] = 1. - dp[curr][i][j]; n } n swap(prev, curr); n } n double ans = 0; n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) n if (A[i] < A[j]) ans += dp[prev][i][j]; n cout << setprecision(12) << fixed << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int tab[n]; n long long s = 0; n for (int i = 0; i < n; i++) { n cin >> tab[i]; n if (i == tab[i]) { n s++; n tab[i] = -1; n } n } n bool bo = false; n for (int i = 0; i < n; i++) { n if (tab[i] != -1) { n if (tab[tab[i]] == i) { n s += 2; n bo = false; n break; n } n bo = true; n } n } n if (bo) s++; n cout << s; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O2 ) n using namespace std; n string conv(int n) { n string kq = ; n while (n != 0) { n int r = n % 26; n if (r == 0) r = 26; n kq = char(r - 1 + A ) + kq; n n = (n - r) / 26; n } n return kq; n } n int conv(string s) { n int kq = 0; n int n = s.size(); n int tmp = 1; n for (int i = n - 1; i >= 0; i--) { n int k = int(s[i] - A ) + 1; n kq += tmp * k; n tmp *= 26; n } n return kq; n } n int type(string s) { n if (s[0] != R ) return 1; n if (s[1] >= A && s[1] <= Z ) return 1; n bool kt = false; n int n = s.size(); n for (int i = 0; i <= n - 1; i++) n if (s[i] == C ) { n kt = true; n break; n } n if (!kt) return 1; n return 2; n } n void chuyen(string s) { n if (type(s) == 1) { n int n = s.size(); n string x1 = ; n int j = 0; n while (s[j] >= A && s[j] <= Z ) { n x1 += s[j]; n j++; n } n cout << R ; n for (int i = j; i <= n - 1; i++) cout << s[i]; n cout << C << conv(x1) << n ; n } n if (type(s) == 2) { n int kq = 0; n int tmp = 1; n int j = s.size() - 1; n while (s[j] >= 0 && s[j] <= 9 ) { n kq += (s[j] - 0 ) * tmp; n tmp *= 10; n j--; n } n cout << conv(kq); n for (int i = 1; i <= j - 1; i++) cout << s[i]; n cout << n ; n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n while (n--) { n string s; n cin >> s; n chuyen(s); n } n } n "} +{"func_code_string": "#include n using namespace std; n void solution() { n long long n; n cin >> n; n vector> v(n, vector(n, 0)); n if (n % 2 != 0) { n v[n - 1][(n - 1) / 2] = 1; n v[(n - 1) / 2][n - 1] = 1; n } n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < n; j++) { n if (i == j || i == n - j - 1) v[i][j] = 1; n cout << v[i][j] << ; n } n cout << n ; n } n } n int32_t main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long t; n cin >> t; n while (t--) solution(); n } n "} +{"func_code_string": "#include n std::vector V[200010], V2[200010]; n int check[200010]; n std::stack St; n void init(int k) { n if (check[k] == 1) return; n check[k] = 1; n for (int i = 0; i < V[k].size(); i++) init(V[k][i]); n St.push(k); n } n int color[200010]; n void makeSCC(int k, int c) { n if (color[k] > 0) return; n color[k] = c; n for (int i = 0; i < V2[k].size(); i++) makeSCC(V2[k][i], c); n } n int x[200010], cost[200010]; n std::vector V3[200010]; n int main() { n int a; n scanf( %d , &a); n for (int i = 1; i <= a; i++) scanf( %d , &x[i]); n for (int i = 1; i <= a; i++) { n int b; n scanf( %d , &b); n V[i].push_back(b); n V2[b].push_back(i); n } n for (int i = 1; i <= a; i++) init(i); n int c = 1; n while (!St.empty()) { n int k = St.top(); n St.pop(); n if (color[k] == 0) makeSCC(k, c++); n } n for (int i = 1; i <= a; i++) cost[i] = 123456789; n for (int i = 1; i <= a; i++) n cost[color[i]] = cost[color[i]] < x[i] ? cost[color[i]] : x[i]; n for (int i = 1; i <= a; i++) n if (color[i] != color[V[i][0]]) V3[color[i]].push_back(color[V[i][0]]); n long long int ans = 0; n for (int i = 1; i <= a; i++) n if (V3[i].size() == 0 && cost[i] < 123456789) ans += cost[i]; n printf( %lld , ans); n } n "} +{"func_code_string": "#include n int n, ust, x, y, mark[10]; n int main() { n scanf( %d , &n); n scanf( %d , &ust); n for (int i = 0; i < n; i++) { n scanf( %d %d , &x, &y); n mark[x] = 1; n mark[y] = 1; n mark[7 - x] = 1; n mark[7 - y] = 1; n if (!mark[7 - ust]) n for (int j = 0; j < 7; j++) mark[j] = 0; n else { n printf( NO n ); n return 0; n } n } n printf( YES n ); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n; n cin >> n; n cout << n / (2520LL); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1000001; n int n, kt[N], a[N], cnt, x[N]; n long long k, s; n long long cal(int i) { n long long res = i; n return res * (res + 1) / 2; n } n int main() { n scanf( %d%lld , &n, &k); n if (k < cal(n)) { n printf( -1 ); n return 0; n } n for (int i = n; i > 0; i--) { n int h = n - (n - i) / 2; n if (k - h < cal(i - 1)) h = k - cal(i - 1); n k -= h; n kt[h]++; n if (kt[h] == 2) a[++cnt] = h; n } n for (int i = 1; i <= n; i++) s += kt[i] * i; n printf( %lld n , s); n for (int i = 1; i <= n; i++) { n if (kt[i] == 1) n x[i] = i; n else if (kt[i] == 0) { n x[a[cnt]] = i; n x[i] = a[cnt]; n cnt--; n } n } n for (int i = 1; i <= n; i++) printf( %d , i); n printf( n ); n for (int i = 1; i <= n; i++) printf( %d , x[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n int n, m, q; n cin >> n >> m >> q; n vector> r(n), c(m); n for (int i = 0; i < q; ++i) { n int x, y; n cin >> x >> y; n --x; n --y; n r[x].push_back(y); n c[y].push_back(x); n } n if (n == 1) { n cout << m - q; n return 0; n } n if (m == 1) { n cout << n - q; n return 0; n } n vector used_row(n, false); n vector used_col(m, false); n int ans = 0; n vector cols_to_add(r[0]), next_cols_to_add; n used_row[0] = true; n for (int i = 0; i < m; ++i) { n if (used_col[i]) continue; n while (!cols_to_add.empty()) { n next_cols_to_add.clear(); n for (int col : cols_to_add) { n if (used_col[col]) continue; n used_col[col] = true; n for (int row : c[col]) { n if (used_row[row]) continue; n used_row[row] = true; n for (int new_col : r[row]) { n next_cols_to_add.push_back(new_col); n } n } n } n cols_to_add = next_cols_to_add; n } n if (!used_col[i]) { n ++ans; n cols_to_add.push_back(i); n } n } n while (!cols_to_add.empty()) { n next_cols_to_add.clear(); n for (int col : cols_to_add) { n if (used_col[col]) continue; n used_col[col] = true; n for (int row : c[col]) { n if (used_row[row]) continue; n used_row[row] = true; n for (int new_col : r[row]) { n next_cols_to_add.push_back(new_col); n } n } n } n cols_to_add = next_cols_to_add; n } n for (int i = 1; i < n; ++i) { n if (!used_row[i]) { n ++ans; n } n } n cout << ans; n } n "} +{"func_code_string": "#include n bool canWin(long long b, long long e) { n if (e % 2 == 1) { n return b % 2 == 0; n } else if (e < 2 * b) { n return b % 2 == 1; n } else if (e < 4 * b) { n return 1; n } else { n return canWin(b, e / 4); n } n } n bool canLose(long long b, long long e) { n if (e < 2 * b) { n return 1; n } else if (e / 2 % 2 == 1) { n return b % 2 == 0; n } else if (e < 4 * b) { n return b % 2 == 1; n } else { n return canLose(b, e / 4); n } n } n int main() { n int t; n scanf( %d , &t); n bool canBeWinner, canBeLoser; n bool canBeFirst = true; n bool canBeSecond = false; n for (int i = 0; i < t; i++) { n long long b, e; n scanf( %lld%lld , &b, &e); n bool cWin = canWin(b, e); n bool cLose = canLose(b, e); n canBeWinner = (canBeFirst && cWin) || (canBeSecond && !cWin); n canBeLoser = (canBeFirst && cLose) || (canBeSecond && !cLose); n canBeFirst = canBeLoser; n canBeSecond = canBeWinner; n } n printf( %d %d n , canBeWinner, canBeLoser); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using namespace std; n const long long N = 4e7 + 5, N_ = 4e6 + 5; n int cnt = 0, prime[N_]; n bitset vis; n void pre() { n for (int i = 2; i < N; ++i) { n if (!vis[i]) prime[cnt++] = i; n for (int j = 0; i * prime[j] < N; ++j) { n vis[i * prime[j]] = 1; n if (i % prime[j] == 0) break; n } n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, m; n cin >> n; n if (n == 2) { n cout << 1 1 << endl; n return 0; n } n if (n == 3) { n cout << 1 1 2 << endl; n return 0; n } n if (n == 4) { n cout << 1 1 2 1 << endl; n return 0; n } n if (n == 5) { n cout << 1 2 1 1 1 << endl; n return 0; n } n if (n == 6) { n cout << 1 2 1 1 1 1 << endl; n return 0; n } n pre(); n m = n * (n + 1) / 2; n bool sign = 0; n vector res(n + 1, 0); n int flag = 0; n if (m & 1) { n if (!vis[m - 2]) { n ++res[2]; n res.erase(res.begin()); n for (auto i : res) cout << i + 1 << ; n cout << endl; n return 0; n } n m -= 3; n flag = 3; n res[3] = 2; n } n for (auto i : prime) { n int t = m - i; n if (!i || t < 0) break; n if (!vis[t]) { n for (int i = n; t && i > flag; --i) { n if (i == flag) continue; n if (i <= t) { n t -= i; n ++res[i]; n } n } n if (t) { n res = vector(n + 1, 0); n res[flag] = 2; n } else { n sign = 1; n break; n } n } n } n if (!sign) { n cout << -1 << endl; n return 0; n } n res.erase(res.begin()); n for (auto i : res) cout << i + 1 << ; n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m; n inline long long read() { n long long x = 0, f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = (x << 3) + (x << 1) + ch - 0 ; n ch = getchar(); n } n return x * f; n } n long long qpow(long long a, long long b) { n long long ans = 1; n while (b) { n if (b & 1) ans = 1ll * ans * a % 1000000007; n a = 1ll * a * a % 1000000007; n b >>= 1; n } n return ans % 1000000007; n } n signed main() { n cin >> n >> m; n long long c = n - m + 1; n c *= 2; n n++; n n *= 2; n m--; n long long tot = qpow(n, m); n long long amo = (c * tot) % 1000000007; n amo %= 1000000007; n cout << amo; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k; n int pr(int i) { return (i - 1 + n) % n; } n int nx(int i) { return (i + 1) % n; } n int get(int i, int j) { n if (i > j) swap(i, j); n return min(j - i, n - j + i); n } n char no(char el) { n if (el == B ) n return W ; n else n return B ; n } n int gg(string s) { n int b = 1; n for (char i : s) { n if (i != B ) b = 0; n } n int w = 1; n for (char i : s) { n if (i != W ) w = 0; n } n return max(w, b); n } n signed main() { n string s; n cin >> n >> k >> s; n if (gg(s)) { n cout << s; n return 0; n } n vector used(n, 0); n int l = 0, r = 0, op = 1e6; n bool ch = false; n while (l < n && op > 0) { n --op; n if (used[l]) { n ++l; n } else if (s[l] == s[pr(l)]) { n ch = true; n while (s[l] == s[nx(l)]) used[l] = 1, l = nx(l); n r = nx(l); n while (s[r] != s[nx(r)]) used[r] = 1, r = nx(r); n int cr = r; n while (s[nx(cr)] == s[cr]) used[cr] = 1, cr = nx(cr); n char last = s[l]; n for (int i = nx(l); i != r; i = nx(i)) { n if (get(l, i) > k && get(r, i) > k) n s[i] = no(last), last = no(last); n else if (get(l, i) < get(r, i)) n s[i] = s[l], last = s[l]; n else if (get(l, i) >= get(r, i)) n s[i] = s[r], last = s[r]; n } n ++l; n } else { n ++l; n } n } n if (!ch) { n if (k % 2 == 0) n cout << s; n else n for (char i : s) cout << no(i); n return 0; n } n cout << s; n } n "} +{"func_code_string": "#include n using namespace std; n vector g[100100]; n int aa[100100]; n long long dfs(int u, int fa) { n vector tmp; n for (int i = 0; i < g[u].size(); i++) { n int v = g[u][i]; n if (v != fa && aa[v] - 1 >= 0) { n aa[v] -= 1; n tmp.push_back(dfs(v, u)); n } n } n sort(tmp.begin(), tmp.end()); n int cc = tmp.size(); n long long ans = 0; n for (int i = aa[u]; i >= 1; i--) { n if (cc > 0) { n ans += tmp[--cc] + 2; n aa[u]--; n } else { n break; n } n } n for (int i = 0; i < g[u].size(); i++) { n int v = g[u][i]; n if (v != fa) { n int tmp = min(aa[u], aa[v]); n ans += tmp * 2; n aa[u] -= tmp; n aa[v] -= tmp; n } n } n return ans; n } n int main() { n int n; n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &aa[i]); n } n for (int i = 0; i < n - 1; i++) { n int u, v; n scanf( %d%d , &u, &v); n g[u].push_back(v); n g[v].push_back(u); n } n int s; n scanf( %d , &s); n printf( %I64d n , dfs(s, -1)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n ; n long long int TESTS, k, a, n, b, c, d, m, x, i, y, z; n cin >> TESTS; n while (TESTS--) { n cin >> n; n cin >> s; n long long int ans = n; n for (long long int i = 0; i <= n - 1; i++) { n if (s[i] == 1 ) { n a = max(i + 1, n - i); n ans = max(ans, 2 * a); n } n } n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n if (n == 1) n cout << -1; n else n cout << (n % 2 == 0 ? n : n - 1) << 2 ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int limit = 10000; n int query(vector &v) { n int n = (int)v.size(); n cout << n << ; n for (int i = 0; i < n; i++) { n cout << v[i] << (i == n - 1 ? n : ); n } n int k; n cin >> k; n if (k == -1) { n exit(0); n } else if (k == -2) { n assert(false); n } n return k; n } n int main() { n vector> dp(6, vector(10010)); n for (int q = 1; q <= 5; q++) { n for (long long p = 1; p <= limit; p++) { n if (q == 5 && p == 2) { n break; n } n long long x = p; n for (int i = 0; i < p; i++) { n x += dp[q - 1][min(10000LL, x)]; n x++; n } n x += dp[q - 1][min(10000LL, x)]; n dp[q][p] = x - p; n } n } n long long lb = 1, ub = 10004205361450474LL; n for (int q = 5; q >= 1; q--) { n vector hoge; n long long x = lb; n for (int i = 0; i < min(10000LL, lb); i++) { n x += dp[q - 1][min((long long)10000, x)]; n hoge.push_back(x); n x++; n } n x += dp[q - 1][min(10000LL, x)]; n int k = query(hoge); n if (k == 0) { n ub = hoge[0] - 1; n } else if (k == (int)hoge.size()) { n lb = hoge.back() + 1; n } else { n lb = hoge[k - 1] + 1; n ub = hoge[k] - 1; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = (int)1e5 + 10; n int sx[MAXN], sy[MAXN], sz[MAXN]; n char s[MAXN]; n void solve(int x, int y, int z) { n if (x + y + z < 3) { n printf( YES n ); n return; n } n int e = (x + y + z) / 3; n vector v; n v.push_back(x); n v.push_back(y); n v.push_back(z); n sort(v.begin(), v.end()); n if ((x + y + z) % 3 == 0) { n if (x == e && y == e && z == e) n printf( YES n ); n else n printf( NO n ); n return; n } else if ((x + y + z) % 3 == 1) { n if (v[2] == e + 1 && v[1] == e) n printf( YES n ); n else n printf( NO n ); n return; n } else { n if (v[2] == e + 1 && v[1] == e + 1) n printf( YES n ); n else n printf( NO n ); n return; n } n } n int main() { n scanf( %s , s); n int n = strlen(s); n for (int i = 1; i <= n; i++) { n sx[i] = sx[i - 1] + (s[i - 1] == x ); n sy[i] = sy[i - 1] + (s[i - 1] == y ); n sz[i] = sz[i - 1] + (s[i - 1] == z ); n } n int m; n scanf( %d , &m); n for (int i = 1; i <= m; i++) { n int l, r; n scanf( %d%d , &l, &r); n int x = sx[r] - sx[l - 1], y = sy[r] - sy[l - 1], z = sz[r] - sz[l - 1]; n solve(x, y, z); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int siz = 3e5 + 5; n map> adjList; n long long int ans[siz] = {0}; n long long int cum[siz] = {0}; n map q[siz]; n void dfs(int cur, int parent, int level, long long int val) { n for (pair temp : q[cur]) { n cum[level] += temp.second; n cum[min(level + temp.first + 1, siz - 1)] -= temp.second; n } n val += cum[level]; n ans[cur] = val; n for (int child : adjList[cur]) { n if (child != parent) { n dfs(child, cur, level + 1, val); n } n } n for (pair temp : q[cur]) { n cum[level] -= temp.second; n cum[min(level + temp.first + 1, siz - 1)] += temp.second; n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ; n int n; n cin >> n; n int y; n long long int x; n for (int i = 0; i < (int)(n - 1); i++) { n cin >> x >> y; n adjList[x].push_back(y); n adjList[y].push_back(x); n } n int m; n cin >> m; n int d, v; n for (int i = 0; i < (int)(m); i++) { n cin >> v >> d >> x; n q[v][d] += x; n } n dfs(1, -1, 1, 0); n for (int i = 1; i <= (int)(n); i++) { n cout << ans[i] << ; n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n unsigned long long n, a[130], i, b = 1, f[10002]; n int main() { n cin >> n; n for (i = 1; i <= n; i++) { n cin >> a[i]; n f[a[i]]++; n } n sort(a + 1, a + n + 1); n cout << a[n] << ; n for (i = 1; i < n; i++) { n if (f[a[i]] == 1 && a[n] % a[i] != 0) { n b = a[i]; n } else if (f[a[i]] == 2) { n b = a[i]; n } n } n cout << b; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long MOD = 998244353; n inline long long Msum(long long x) { return x; } n template n inline long long Msum(long long x, Rest... rest) { n return (x + Msum(rest...)) % MOD; n } n inline long long Mprod(long long x) { return x; } n template n inline long long Mprod(long long x, Rest... rest) { n return x * Mprod(rest...) % MOD; n } n inline long long Mnorm(long long x) { return (x % MOD + MOD) % MOD; } n long long Msq(long long x) { return x * x % MOD; } n long long Mpow(long long b, long long e) { n return e ? Mprod(Msq(Mpow(b, e >> 1)), (e & 1 ? b : 1)) : 1; n } n long long Minv(long long x) { return Mpow(x, MOD - 2); } n const int MAXN = 51; n int sns[MAXN], w[MAXN]; n int wi, sn; n int sl, sd, S; n long long dp[MAXN][MAXN][MAXN]; n long long f(int h, int hl, int hd, int t) { n if (!t) return 0; n long long &ret = dp[h][hl][hd]; n if (ret != -1) return ret; n ret = 0; n long long cS = S + hl - hd + sn * h; n ret += Mprod(wi + sn * h, Minv(cS), 1 + f(h + 1, hl, hd, t - 1)); n ret = Mnorm(ret); n ret += Mprod(sl + hl, Minv(cS), f(h, hl + 1, hd, t - 1)); n ret = Mnorm(ret); n ret += Mprod(sd - hd, Minv(cS), f(h, hl, hd + 1, t - 1)); n ret = Mnorm(ret); n assert(sd - hd + sl + hl + wi + sn * h == cS); n return ret; n } n int main() { n int n, m; n scanf( %d %d , &n, &m); n for (int i = 0; i < n; i++) { n scanf( %d , &sns[i]); n sns[i] = sns[i] * 2 - 1; n } n for (int i = 0; i < n; i++) { n scanf( %d , &w[i]); n } n for (int i = 0; i < n; i++) { n S = sl = sd = 0; n wi = w[i]; n sn = sns[i]; n for (int j = 0; j < (int)n; j++) { n S += w[j]; n if (j != i) { n if (sns[j] == 1) n sl += w[j]; n else n sd += w[j]; n } n } n memset(dp, -1, sizeof(dp)); n printf( %lld n , Mnorm(wi + sn * f(0, 0, 0, m))); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1111111; n int a[N]; n int n, k; n vector prime, p; n void Getprime() { n for (int i = 2; i <= 1000; i++) { n bool bo = 1; n for (int j = 2; j * j <= i; j++) { n if (i % j == 0) { n bo = 0; n break; n } n } n if (bo) { n prime.push_back(i); n } n } n } n int main() { n Getprime(); n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; ++i) { n scanf( %d , &a[i]); n } n int K = k; n for (int i = 0; i < prime.size() && prime[i] * prime[i] <= k; ++i) { n int t = prime[i]; n if (k % t == 0) { n int m = 1; n while (K % t == 0 && K) { n m *= t; n K /= t; n } n p.push_back(m); n } n } n if (K != 1) { n p.push_back(K); n } n for (int i = 0; i < p.size(); ++i) { n int pr = p[i]; n bool flag = false; n for (int j = 1; j <= n; ++j) { n if (a[j] % pr == 0) { n flag = true; n break; n } n } n if (!flag) { n puts( No ); n return 0; n } n } n puts( Yes ); n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void smn(T &a, const T &b) { n if (b < a) a = b; n } n template n inline void smx(T &a, const T &b) { n if (b > a) a = b; n } n template n inline T gcd(T x, T y) { n return y ? gcd(y, x % y) : x; n } n namespace std { n template n struct hash> { n inline size_t operator()(const pair &p) const { n return hash()(p.first) * 701 + hash()(p.second); n } n }; n } // namespace std n const double eps = 1e-8; n const int key = 701; n const int MN = 1000 * 1000 + 1000; n string s; n long long h1[MN], pw1[MN], h2[MN], pw2[MN]; n const int MOD = 1000 * 1000 * 1000 + 7; n long long add[MN]; n int n, k; n pair get(int s, int e) { n long long res1 = h1[e]; n if (s != 0) res1 -= pw1[e - s + 1] * h1[s - 1]; n long long res2 = h2[e]; n if (s != 0) res2 -= pw2[e - s + 1] * h2[s - 1], res2 %= MOD; n if (res2 < 0) res2 += MOD; n return make_pair(res1, res2); n } n bool check(int l) { n auto v = get(0, l - 1); n int now = l; n for (int i = 1; i < k; i++) { n if (get(now, now + l - 1) != v) return 0; n now += l; n } n return 1; n } n int fnd(int p) { n int s = 1, e = n - p, res = 0; n while (s <= e) { n int m = (s + e) / 2; n if (get(0, m - 1) == get(p, p + m - 1)) n res = m, s = m + 1; n else n e = m - 1; n } n return res; n } n int main() { n ios_base::sync_with_stdio(false); n cin >> n >> k >> s; n long long now = 0; n for (int i = 0; i < n; i++) now = now * 701 + s[i], h1[i] = now; n pw1[0] = 1; n for (int i = 1; i <= n; i++) pw1[i] = 701 * pw1[i - 1]; n now = 0; n for (int i = 0; i < n; i++) now = (now * 701 + s[i]) % MOD, h2[i] = now; n pw2[0] = 1; n for (int i = 1; i <= n; i++) pw2[i] = (701 * pw2[i - 1]) % MOD; n for (int i = 1; i <= n; i++) n if (n / i >= k && check(i)) { n int t = i * k; n int b = fnd(t); n smn(b, i); n add[t - 1] += 1; n add[t + b] += -1; n } n now = 0; n for (int i = 0; i < n; i++) { n now += add[i]; n cout << (now ? 1 : 0); n } n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int upd(int& a, int b) { return a = min(a, b); } n inline int _abs(int x) { return x > 0 ? x : -x; } n char c; n int n, cnt[3], type[80]; n int pos[3][80], leq[3][80]; n int dp[80][80][80][80]; n void getpos(void) { n for (int p = 0; p <= 2; p++) { n cnt[p] = 0; n for (int y = 1; y <= n; y++) { n while (y <= n && type[y] != p) y++; n if (y <= n) pos[p][++cnt[p]] = y; n } n leq[p][0] = 0; n for (int i = 1; i <= n; i++) leq[p][i] = leq[p][i - 1] + (type[i] == p); n } n return; n } n void trans(int i, int j, int k, int lst) { n int p0 = pos[0][i], p1 = pos[1][j], p2 = pos[2][k]; n if (i > 0) n upd(dp[0][i][j][k], n dp[lst][i - 1][j][k] + _abs(j - leq[1][p0]) + _abs(k - leq[2][p0])); n if (j > 0) n upd(dp[1][i][j][k], n dp[lst][i][j - 1][k] + _abs(i - leq[0][p1]) + _abs(k - leq[2][p1])); n if (k > 0 && lst != 1) n upd(dp[2][i][j][k], n dp[lst][i][j][k - 1] + _abs(i - leq[0][p2]) + _abs(j - leq[1][p2])); n return; n } n int main(void) { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %c , &c); n type[i] = (c == V ? 1 : (c == K ? 2 : 0)); n } n getpos(); n memset(dp, 0x1f, sizeof(dp)); n dp[0][0][0][0] = 0; n for (int i = 0; i <= cnt[0]; i++) n for (int j = 0; j <= cnt[1]; j++) n for (int k = 0; k <= cnt[2]; k++) n for (int lst = 0; lst <= 2; lst++) trans(i, j, k, lst); n int ans = n * n; n for (int i = 0; i <= 2; i++) upd(ans, dp[i][cnt[0]][cnt[1]][cnt[2]]); n printf( %d n , ans >> 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2000000; n int xx[1111111], yy[1111111]; n int pos[1111111], n, m, op[1111111], np[1111111], ff; n int owner[3333333], first[3333333]; n int ans[1111111]; n bool used[1111111]; n void imp() { n puts( -1 ); n exit(0); n } n inline int sum(int x) { n int r = 0; n while (x >= 0) { n r += first[x]; n x = (x & (x + 1)) - 1; n } n return r; n } n inline void add(int x, int d) { n while (x <= maxn) { n first[x] += d; n x = (x | (x + 1)); n } n } n inline int getFirst(int x) { n int l = -1, r = maxn; n while (r - l > 1) { n int mid = ((l + r) >> 1); n if (sum(mid) >= x) { n r = mid; n } else { n l = mid; n } n } n return r; n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < m; ++i) { n scanf( %d%d , &xx[i], &yy[i]); n --xx[i]; n } n memset(owner, -1, sizeof(owner)); n memset(pos, -1, sizeof(pos)); n int ff = m; n for (int i = 1; i <= n; ++i) { n add(ff + i, 1); n } n for (int i = 0; i < m; ++i) { n int &oldPlace = op[i]; n int &newPlace = np[i]; n int &x = xx[i]; n int &y = yy[i]; n oldPlace = getFirst(y); n if ((pos[x] != -1 && oldPlace != pos[x]) || n (owner[oldPlace] != -1 && owner[oldPlace] != x)) { n imp(); n } n newPlace = ff--; n owner[oldPlace] = -1; n add(oldPlace, -1); n add(newPlace, 1); n pos[x] = newPlace; n owner[newPlace] = x; n } n for (int i = m - 1; i >= 0; --i) { n int &oldPlace = op[i]; n int &newPlace = np[i]; n int &x = xx[i]; n int &y = yy[i]; n pos[x] = oldPlace; n owner[oldPlace] = x; n add(oldPlace, 1); n owner[newPlace] = -1; n add(newPlace, -1); n } n memset(ans, -1, sizeof(ans)); n for (int i = 0; i < n; ++i) n if (pos[i] != -1) { n int p = sum(pos[i]); n ans[p - 1] = i; n used[i] = true; n } n int fx = 0; n for (int i = 0; i < n; ++i) n if (ans[i] == -1) { n while (used[fx]) { n ++fx; n } n ans[i] = fx; n used[fx] = true; n } n for (int i = 0; i < n; ++i) { n if (i > 0) { n putchar( ); n } n printf( %d , ans[i] + 1); n } n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long spf[100001]; n bool isPrime(long long n) { n if (n <= 1) return false; n if (n <= 3) return true; n if (n % 2 == 0 || n % 3 == 0) return false; n for (long long i = 5; i * i <= n; i = i + 6) n if (n % i == 0 || n % (i + 2) == 0) return false; n return true; n } n long long power(long long a, long long b) { n long long res = 1; n while (b > 0) { n if (b & 1) res = (res * a); n a = (a * a); n b >>= 1; n } n return res; n } n long long modpow(long long a, long long b, long long x) { n long long res = 1; n while (b > 0) { n if (b & 1) res = (res * a) % x; n a = (a * a) % x; n b >>= 1; n } n return res; n } n void sieve() { n spf[1] = 1; n for (long long i = 2; i < 100001; i++) spf[i] = i; n for (long long i = 4; i < 100001; i += 2) spf[i] = 2; n for (long long i = 3; i * i < 100001; i++) n if (spf[i] == i) n for (long long j = i * i; j < 100001; j += i) n if (spf[j] == j) spf[j] = i; n } n vector getFactorization(long long x) { n vector ret; n while (x != 1) { n ret.push_back(spf[x]); n x = x / spf[x]; n } n return ret; n } n void solve() { n long long n, m; n cin >> n >> m; n vector adj[n + 1]; n for (int i = 0; i < m; i++) { n long long a, b; n cin >> a >> b; n adj[a].push_back(b); n adj[b].push_back(a); n } n vector> topic(n); n for (int i = 0; i < n; i++) { n long long a; n cin >> a; n topic[i] = {a, i + 1}; n } n sort(topic.begin(), topic.end()); n vector res; n vector> around(n + 1); n for (int i = 0; i < topic.size(); i++) { n long long u = topic[i].second; n res.push_back(u); n if (around[u].find(topic[i].first) != around[u].end() || n around[u].size() != topic[i].first - 1) { n cout << -1 << n ; n return; n } n for (auto j : adj[u]) { n around[j].insert(topic[i].first); n } n } n for (auto i : res) cout << i << ; n cout << n ; n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long t = 1; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 5; n vector v[N]; n long long vis[N]; n long long col[N]; n set che; n void dfs(long long x) { n vis[x] = 1; n che.insert(x); n for (auto it : v[x]) { n if (!vis[it]) { n dfs(it); n } n } n } n void solve() { n long long n; n cin >> n; n long long i, x, y; n vector > e, spe; n for (i = 0; i < n - 1; i++) { n cin >> x >> y; n x--, y--; n e.push_back(make_pair(x, y)); n } n for (i = 0; i < n; i++) { n cin >> col[i]; n } n for (auto it : e) { n if (col[it.first] != col[it.second]) { n spe.push_back(make_pair(it.first, it.second)); n } n } n long long m = spe.size(); n long long f = 0, ind = 0; n long long cnt[n]; n memset(cnt, 0, sizeof(cnt)); n if (m == 0) { n cout << YES n1 ; n return; n } n for (auto it : spe) { n cnt[it.first]++; n cnt[it.second]++; n } n for (i = 0; i < n; i++) { n if (cnt[i] == m) { n cout << YES n << i + 1; n return; n } n } n cout << NO n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n if (fopen( input.txt , r )) { n freopen( input.txt , r , stdin); n freopen( output.txt , w , stdout); n } n long long t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n; n cin >> n; n int zD = 1; n int zABC = 0; n for (int i = 1; i <= n; i++) { n int nzD = zABC * 3LL % 1000000007; n int nzABC = (zABC * 2LL + zD) % 1000000007; n zD = nzD; n zABC = nzABC; n } n cout << zD; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n int n, m; n cin >> n >> m; n auto chk = [&](int x, int y) { return 0 <= x && x < n && 0 <= y && y < m; }; n vector nxt(n * m, -1), deg(n * m), dp(n * m), dp2(n * m); n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n char c; n cin >> c; n int x = i, y = j; n if (c == L ) --y; n if (c == R ) ++y; n if (c == U ) --x; n if (c == D ) ++x; n if (chk(x, y)) { n nxt[i * m + j] = x * m + y; n deg[x * m + y] += 1; n } n } n } n for (int i = 0; i < n * m; ++i) dp2[i] = i; n queue q; n for (int i = 0; i < n * m; ++i) n if (deg[i] == 0) q.push(i); n while (!q.empty()) { n int u = q.front(); n q.pop(); n if (nxt[u] != -1) { n int v = nxt[u]; n if (dp[v] < dp[u] + 1) { n dp[v] = dp[u] + 1; n dp2[v] = dp2[u]; n } n if (--deg[v] == 0) q.push(v); n } n } n int ans = 0; n for (int i = 0; i < n * m; ++i) { n if (deg[i] == 0) continue; n int p = nxt[i]; n vector loop; n while (p != i) { n loop.push_back(p); n p = nxt[p]; n } n loop.push_back(i); n for (int j : loop) dp[j] += loop.size() - 1, deg[j] = 0; n } n int mx = -1, x = -1, y = -1; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (dp[i * m + j] > mx) { n mx = dp[i * m + j]; n x = dp2[i * m + j] / m; n y = dp2[i * m + j] % m; n } n } n } n cout << x + 1 << << y + 1 << << mx + 1 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n void addmod(int &a, long long b) { n a = (a + b); n if (a >= 1000000007) a -= 1000000007; n } n void mulmod(int &a, long long b) { a = (a * b) % 1000000007; } n int gi() { n int a; n scanf( %d , &a); n return a; n } n long long gll() { n long long a; n scanf( %lld , &a); n return a; n } n class rangesum { n vector s; n n public: n rangesum(const vector &inp, const int &n) { n s.resize(n + 1); n for (int i = 0; i < n; i++) s[i + 1] = s[i] + inp[i]; n } n long long get(int x, int y) { return s[y + 1] - s[x]; } n }; n int main() { n int n = gi(), l, u; n vector a(n); n for (auto i = 0; i < n; i++) { n a[i] = gi(); n } n rangesum rs(a, n); n set rm; n multiset> v; n rm.insert(-1); n rm.insert(n); n v.insert(rs.get(0, n - 1)); n for (int i = 0; i < n; i++) { n int ix = gi() - 1; n auto it = rm.upper_bound(ix); n u = (*it) - 1; n it--; n l = (*it) + 1; n auto mit = v.find(rs.get(l, u)); n assert(mit != v.end()); n v.erase(mit); n if (ix > l) v.insert(rs.get(l, ix - 1)); n if (ix < u) v.insert(rs.get(ix + 1, u)); n rm.insert(ix); n printf( %lld n , (v.size() ? *v.begin() : 0)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long BIG = 1000000000000000000LL; n void solve(); n signed main() { n ios::sync_with_stdio(false); n cin.tie(0); n solve(); n return 0; n } n long long nbBoxes; n long long reqSom = 0; n bool cycor[1 << 15]; n pair > cymem[1 << 15]; n long long dpGo[1 << 15]; n long long origSom[15]; n vector yolo[15]; n map loc; n map ds; n vector maskOk; n pair finRes[15]; n long long osef[15]; n long long getMap(long long x) { n auto it = loc.find(x); n if (it == loc.end()) n return -1; n else n return it->second; n } n void tester(long long dep, long long valEnvoi, long long suiv, n bool act = false) { n if (dep == suiv) { n if (origSom[dep] == reqSom) { n cycor[1LL << dep] = true; n cymem[1LL << dep] = {dep, {valEnvoi, suiv}}; n if (act) finRes[dep] = {dep, osef[dep]}; n } n return; n } n long long gauche = dep; n long long cg = reqSom - (origSom[dep] - valEnvoi); n long long mask = (1LL << gauche); n if (act) finRes[dep] = {suiv, valEnvoi}; n while (true) { n long long prev = gauche; n gauche = getMap(cg); n if (gauche != -1 && act) finRes[gauche] = {prev, cg}; n if (gauche == -1 || gauche == dep) break; n if (mask & (1LL << gauche)) break; n cg = reqSom - (origSom[gauche] - cg); n mask |= (1LL << gauche); n } n if (gauche == dep && cg == valEnvoi) { n cycor[mask] = true; n cymem[mask] = {dep, {valEnvoi, suiv}}; n } n } n void solve() { n cin >> nbBoxes; n for (long long i = (0); i < (nbBoxes); ++i) { n long long ni; n cin >> ni; n for (long long i00 = (0); i00 < (ni); ++i00) { n long long x; n cin >> x; n yolo[i].push_back(x); n reqSom += x; n origSom[i] += x; n loc[x] = i; n osef[i] = x; n } n } n if (reqSom % nbBoxes != 0) { n cout << No n ; n return; n } n reqSom /= nbBoxes; n for (long long i = (0); i < (nbBoxes); ++i) { n for (long long x : yolo[i]) { n tester(i, x, -1); n tester(i, x, i); n } n } n for (long long i = (0); i < ((1 << 15)); ++i) { n dpGo[i] = -1; n } n dpGo[0] = 0; n for (long long mask = 1; mask < (1 << 15); ++mask) { n for (long long s = mask; s > 0; s = ((s - 1) & mask)) { n if (cycor[s] && dpGo[mask ^ s] != -1) { n dpGo[mask] = s; n break; n } n } n } n long long cur = (1LL << nbBoxes) - 1; n while (dpGo[cur] != 0) { n if (dpGo[cur] == -1) { n cout << No n ; n return; n } n long long ret = dpGo[cur]; n long long dep = cymem[ret].first, valEnv = cymem[ret].second.first, n suiv = cymem[ret].second.second; n tester(dep, valEnv, suiv, true); n cur ^= ret; n } n cout << Yes n ; n for (long long i = (0); i < (nbBoxes); ++i) n cout << finRes[i].second << << finRes[i].first + 1 << n ; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k, a[300010], sum[300010], ans; n int main() { n scanf( %lld%lld , &n, &k); n for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); n for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i]; n ans += k * sum[n]; n sort(sum + 1, sum + n); n for (int i = 1; i < k; i++) ans -= sum[i]; n printf( %lld , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using LL = long long; n using LD = long double; n using ULL = unsigned long long; n template n using P = pair; n using PII = P; n using PLL = P; n using PLD = P; n template n using V = vector; n using VI = V; n using VLL = V; n using VLD = V; n using VB = V; n using VS = V; n template > n using PQ = priority_queue, Comp>; n template n int sz(const T& x) { n return (int)size(x); n } n template n bool amin(T& a, const T& b) { n if (b < a) { n a = b; n return true; n } n return false; n } n template n bool amax(T& a, const T& b) { n if (b > a) { n a = b; n return true; n } n return false; n } n const size_t rseed = n std::chrono::high_resolution_clock::now().time_since_epoch().count(); n mt19937 rnd(rseed); n int randint(int lo, int hi) { n return uniform_int_distribution{lo, hi}(rnd); n } n int main() { n int T; n scanf( %d , &T); n for (int t = (1); t <= (T); t++) { n int n; n scanf( %d , &n); n string s(n + 1, ); n scanf( %s , &s[0]); n string a(n, ), b(n, ); n bool f = false; n for (int i = (0); i <= (n - 1); i++) { n if (f) { n a[i] = 0 ; n b[i] = s[i]; n } else { n if (s[i] == 1 ) { n f = true; n a[i] = 1 ; n b[i] = 0 ; n } else if (s[i] == 2 ) n a[i] = b[i] = 1 ; n else n a[i] = b[i] = 0 ; n } n } n printf( %s n%s n , a.c_str(), b.c_str()); n } n } n "} +{"func_code_string": "#include n using namespace std; n int seq[100]; n int main() { n int n; n int acc, t, pen; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , seq + i); n } n sort(seq, seq + n); n acc = 10; n t = 0; n pen = 0; n for (int i = 0; i < n; i++) { n acc += seq[i]; n if (acc > 720) { n break; n } n t++; n if (acc > 360) { n pen += ((acc - 360) < 0 ? -(acc - 360) : (acc - 360)); n } n } n printf( %d %d n , t, pen); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin >> n; n if ((n * n) % 2 == 0) { n cout << 2 n ; n } else { n cout << 1 n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxx = 1e5 + 20, sqr = 150, mod = 1e9 + 7; n long long len, n, dp[maxx][sqr][2], q, pw25[maxx], pw26[maxx], pwmod[maxx], n fac[maxx], tmp[maxx]; n string s; n long long pw(long long a, long long b) { n if (!b) return 1ll; n long long x = pw(a, b / 2); n x = (x * x) % mod; n if (b % 2) x = (x * a) % mod; n return x; n } n long long sel(long long a, long long b) { n long long x = 1ll; n x = (x * fac[a]) % mod; n x = (x * pwmod[b]) % mod; n x = (x * pwmod[a - b]) % mod; n return x; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n pw25[0] = pw26[0] = 1; n for (long long i = 1; i < maxx; i++) n pw25[i] = (pw25[i - 1] * 25) % mod, pw26[i] = (pw26[i - 1] * 26) % mod; n fac[0] = 1; n for (long long i = 1; i < maxx; i++) fac[i] = (fac[i - 1] * i) % mod; n for (long long i = 0; i < maxx; i++) pwmod[i] = pw(fac[i], mod - 2); n for (long long j = 0; j < sqr; j++) { n dp[j][j][1] = dp[j][j][0] = 1; n for (long long i = j + 1; i < maxx; i++) { n dp[i][j][0] = (((dp[i - 1][j][0] * 26) % mod) + n (j >= 1 ? dp[i - 1][j - 1][1] : 0)) % n mod; n dp[i][j][1] = (((dp[i - 1][j][1] * 25) % mod) + n (j >= 1 ? dp[i - 1][j - 1][1] : 0)) % n mod; n } n } n long long c = 0; n cin >> n >> s; n len = s.length(); n if (len >= sqr) { n fill(tmp, tmp + maxx, 0); n tmp[len - 1] = 1; n for (long long j = len; j < maxx; j++) n tmp[j] = (((tmp[j - 1] * 26ll) % mod) + n (((long long)sel(j, len - 1) * pw25[j + 1 - len]) % mod)) % n mod; n } n for (long long i = 0; i < n; i++) { n long long type; n cin >> type; n if (type == 1) { n cin >> s, len = s.length(); n if (len >= sqr) { n fill(tmp, tmp + maxx, 0); n tmp[len - 1] = 1; n for (long long j = len; j < maxx; j++) n tmp[j] = (((tmp[j - 1] * 26ll) % mod) + n (((long long)sel(j, len - 1) * pw25[j + 1 - len]) % mod)) % n mod; n } n } else { n c++; n cin >> q; n if (len < sqr) { n if (len > q) n cout << 0 << n ; n else n cout << dp[q][len][0] << n ; n continue; n } n long long ans = 0ll; n cout << tmp[q - 1] << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector> tree(1); n int terminal[110]; n unsigned long long inf = (1ull << 63) - 1; n int s; n struct Mat { n vector data; n Mat() { data.assign(s * s, inf); } n }; n Mat operator*(const Mat& a, const Mat& b) { n Mat r; n for (int i = 0; i < s; i++) { n for (int k = 0; k < s; k++) { n for (int j = 0; j < s; j++) { n r.data[i * s + j] = n min(r.data[i * s + j], a.data[i * s + k] + b.data[k * s + j]); n } n } n } n return r; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int g, n, m; n cin >> g >> n >> m; n vector>> mut; n vector>> node(g); n for (int i = 0; i < n; i++) { n int a, k; n cin >> a >> k; n node[a].push_back(vector(k)); n mut.emplace_back(a, vector()); n for (int& v : node[a].back()) { n cin >> v; n mut.back().second.push_back(v); n } n } n for (int i = 0; i < m; i++) { n int k; n cin >> k; n int p = 0; n while (k--) { n int c; n cin >> c; n if (!tree[p][c]) { n tree[p][c] = tree.size(); n tree.push_back({0, 0}); n } n p = tree[p][c]; n } n terminal[p] = 1; n } n { n vector link(tree.size()); n queue q; n q.push(0); n while (q.size()) { n int p = q.front(); n q.pop(); n int par = link[p]; n terminal[p] |= terminal[par]; n for (int c : {0, 1}) { n if (!tree[p][c]) { n tree[p][c] = tree[par][c]; n } else { n link[tree[p][c]] = p ? tree[par][c] : 0; n q.push(tree[p][c]); n } n } n } n } n s = tree.size(); n for (int p = 0; p < s; p++) n if (terminal[p]) tree[p][0] = tree[p][1] = p; n vector mat(g); n for (int c : {0, 1}) { n for (int i = 0; i < s; i++) { n mat[c].data[i * s + tree[i][c]] = 1; n } n } n vector changed(g, 1); n while (1) { n int found = 0; n vector nchanged(g); n for (auto& [a, v] : mut) { n int need = 0; n for (int b : v) n if (changed[b]) need = 1; n if (!need) continue; n Mat prod = mat[v[0]]; n for (int i = 1; i < (int)v.size(); i++) { n prod = prod * mat[v[i]]; n } n for (int i = 0; i < s * s; i++) { n if (prod.data[i] < mat[a].data[i]) { n mat[a].data[i] = prod.data[i]; n nchanged[a] = 1; n found = 1; n } n } n } n changed = nchanged; n if (!found) break; n } n for (int a = 2; a < g; a++) { n unsigned long long mi = inf; n for (int i = 0; i < s; i++) { n if (!terminal[i]) mi = min(mi, mat[a].data[i]); n } n if (mi < inf) n cout << NO << mi << endl; n else n cout << YES << endl; n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize -O3 n using namespace std; n const int MAXN = 310000; n int n; n int a[MAXN]; n vector pr; n int bb[MAXN]; n int go[MAXN]; n int cc[MAXN]; n int ans[MAXN]; n vector fc[MAXN]; n int gcd(int a, int b) { n while (b) { n int q = a % b; n a = b; n b = q; n } n return a; n } n int dp[1 << 7]; n int gg; n int gog[1 << 7]; n void run(int x, int msk, int ml, int k) { n if (x == k) { n dp[msk] = cc[ml]; n gog[msk] = ml; n return; n } n run(x + 1, msk, ml, k); n run(x + 1, msk + (1 << x), ml * fc[gg][x], k); n } n int main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n for (int i = 0; i < MAXN; ++i) bb[i] = i; n for (int i = 2; i < MAXN; ++i) { n if (bb[i] == i) pr.push_back(i); n for (int j : pr) { n if (j * i >= MAXN || bb[i] < j) break; n bb[j * i] = j; n } n } n for (int i = 1; i < MAXN; ++i) { n int cur = 1; n int x = i; n while (x != 1) { n int d = bb[x]; n while (x % d == 0) x /= d; n cur *= d; n fc[i].push_back(d); n } n go[i] = cur; n } n cin >> n; n int now = 0; n fill(ans, ans + MAXN, 1000); n for (int i = 0; i < n; ++i) { n cin >> a[i]; n now = gcd(now, a[i]); n a[i] = go[a[i]]; n ++cc[a[i]]; n ans[a[i]] = 1; n } n if (now != 1) { n cout << -1 << n ; n return 0; n } n for (int i = 1; i < MAXN; ++i) { n for (int j = 2 * i; j < MAXN; j += i) cc[i] += cc[j]; n } n for (int i = MAXN - 1; i > 1; --i) { n if (go[i] != i) continue; n int k = fc[i].size(); n gg = i; n run(0, 0, 1, k); n for (int i = (1 << k) - 1; i > 0; --i) { n for (int j = (i - 1) & i; j > 0; j = (j - 1) & i) dp[j] -= dp[i]; n dp[0] -= dp[i]; n } n for (int j = 0; j < (1 << k); ++j) n if (dp[j]) ans[gog[j]] = min(ans[gog[j]], ans[i] + 1); n } n cout << ans[1] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, x, m; n priority_queue s; n int main() { n scanf( %d , &n); n m = n; n for (int i = 0; i < int(n); i++) { n scanf( %d , &x); n if (x < m) { n s.push(x); n cout << ; n } else if (x == m) { n cout << x << ; n m--; n while (!s.empty() && m == s.top()) { n cout << s.top() << ; n s.pop(); n m--; n } n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[12000]; n int n, i, j; n vector ans; n int cek(int v, int t, string e) { n if (v >= strlen(s) - 1) return v; n int i = v; n do { n string tmp = ; n for (i = i;; i++) { n tmp.push_back(s[i]); n if (s[i] == > ) break; n } n i++; n if (e == && tmp ==
) break; n if (e == && tmp == ) break; n if (e == && tmp == ) { n ans[t]++; n break; n } n if (tmp == ) { n ans.push_back(0); n i = cek(i, ans.size() - 1, tmp); n } else if (tmp == ) { n i = cek(i, t, tmp); n } else if (tmp ==
) { n i = cek(i, t, tmp); n } n } while (i < strlen(s)); n return i; n } n int main() { n n = 0; n bool f = 1; n while (scanf( %c , &s[n]) != EOF) { n if (s[n] != n ) n++; n } n int k = cek(0, -1, ); n sort(ans.begin(), ans.end()); n for (i = 0; i < ans.size(); i++) { n if (f) n f = 0; n else n printf( ); n cout << ans[i]; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n long double scal(long double x, long double y, long double x1, long double y1) { n return x * y1 - x1 * y; n } n int n, m; n int a[20][2], b[20][2]; n int aa[20][10], bb[20][10]; n int p[10]; n int main() { n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1]; n for (int i = 0; i < m; i++) cin >> b[i][0] >> b[i][1]; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if ((a[i][0] == b[j][0] && a[i][1] == b[j][1]) || n (a[i][1] == b[j][0] && a[i][0] == b[j][1])) n continue; n if (a[i][0] == b[j][0]) { n aa[i][a[i][0]] = 1; n bb[j][a[i][0]] = 1; n } n if (a[i][0] == b[j][1]) { n aa[i][a[i][0]] = 1; n bb[j][a[i][0]] = 1; n } n if (a[i][1] == b[j][1]) { n aa[i][a[i][1]] = 1; n bb[j][a[i][1]] = 1; n } n if (a[i][1] == b[j][0]) { n aa[i][a[i][1]] = 1; n bb[j][a[i][1]] = 1; n } n } n } n for (int i = 0; i < n; i++) n for (int j = 1; j <= 9; j++) n if (aa[i][j] == 1) p[j] = 1; n int anss = 0; n for (int i = 1; i <= 9; i++) anss += p[i]; n if (anss == 1) { n for (int i = 1; i <= 9; i++) n if (p[i]) cout << i; n return 0; n } n int ans1 = 1, ans2 = 1; n for (int i = 0; i < n; i++) { n int t = 0; n for (int j = 1; j <= 9; j++) t += aa[i][j]; n if (t > 1) ans1 = 0; n } n for (int i = 0; i < m; i++) { n int t = 0; n for (int j = 1; j <= 9; j++) t += bb[i][j]; n if (t > 1) ans2 = 0; n } n if (ans1 && ans2) n cout << 0; n else n cout << -1; n } n "} +{"func_code_string": "#include n using namespace std; n int n, p, k; n int a[333333]; n long long ans; n map mp, mpb; n int main() { n scanf( %d%d%d , &n, &p, &k); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1; i <= n; i++) { n mp[a[i]]++; n } n for (map::iterator it = mp.begin(); it != mp.end(); it++) { n if (1ll * ((it->first) + (it->first)) * n (2ll * (it->first) * (it->first) % p) % p != n k) n ans -= (1ll * (it->second) * ((it->second) - 1)); n } n for (int i = 1; i <= n; i++) { n mpb[((1ll * a[i] * a[i] % p * a[i] % p * a[i] - 1ll * k * a[i]) % p + p) % n p]++; n } n for (map::iterator it = mpb.begin(); it != mpb.end(); it++) { n ans += (1ll * (it->second) * ((it->second) - 1)); n } n printf( %lld n , ans / 2); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using namespace std::chrono; n long long fac[1000006]; n inline long long exp(long long x, long long n) { n long long r = 1; n x = x; n while (n) { n if (n % 2) r = (r * x) % 10000000000000007; n x = (x * x) % 10000000000000007; n n = n / 2; n } n return r; n } n inline long long mmi(long long a) { n return exp(a, 10000000000000007 - 2) % 10000000000000007; n } n inline long long fact(long long n) { n long long res = 1; n for (long long i = 1; i < (n + 1); ++i) { n res = (res * i) % 10000000000000007; n } n return res; n } n inline void fact_a() { n fac[0] = 1; n fac[1] = 1; n for (long long i = 1; i < (105); ++i) { n fac[i] = (fac[i - 1] * i) % 10000000000000007; n } n } n inline long long inv_fact(long long n) { n long long par = fac[n]; n long long res = mmi(par); n return res; n } n inline long long comb(long long n, long long r) { n if (n == r && r == 0) return 1; n if (n < r) return 0; n return ((fac[n] * inv_fact(r)) % 10000000000000007 * inv_fact(n - r)) % n 10000000000000007; n } n struct triplet { n long long a, b, c; n }; n bool operator<(const triplet &t1, const triplet &t2) { n if (t1.a < t2.a) return true; n if (t1.a == t2.a && t1.b < t2.b) return true; n if (t1.a == t2.a && t1.b == t2.b && t1.c < t2.c) return true; n return false; n } n pair > ex_gcd(long long a, long long b) { n if (b == 0) { n return make_pair(a, make_pair(1, 0)); n } n pair > p = ex_gcd(b, a % b); n long long gcd = p.first; n long long x1 = p.second.first; n long long y1 = p.second.second; n long long x = y1; n long long y = x1 - (a / b) * y1; n return make_pair(gcd, make_pair(x, y)); n } n long long prime[3000006]; n long long spf_prime[3000006]; n void sieve() { n prime[1] = 1; n for (long long i = 2; i * i <= 3000000; i++) n if (prime[i] == 0) n for (long long j = i * i; j <= 3000000; j += i) prime[j] = 1; n } n void spf() { n for (long long i = 2; i * i <= 3000000; i++) n if (!spf_prime[i]) n for (long long j = i * i; j <= 3000000; j += i) n if (!spf_prime[j]) spf_prime[j] = i; n for (long long i = 2; i <= 3000000; i++) n if (!spf_prime[i]) spf_prime[i] = i; n } n long long getparent_BIT(long long idx) { return idx - (idx & -idx); } n long long getnext_BIT(long long idx) { return idx + (idx & -idx); } n long long getsum_BIT(long long idx, long long BIT[], long long n) { n long long sum = 0; n while (idx > 0) { n sum += BIT[idx]; n idx = getparent_BIT(idx); n } n return sum; n } n void update_BIT(long long idx, long long BIT[], long long val, long long n) { n while (idx <= n) { n BIT[idx] += val; n idx = getnext_BIT(idx); n } n } n void build_BIT(long long BIT[], long long a[], long long n) { n for (long long i = 0; i < (n); ++i) { n update_BIT(i, BIT, a[i], n); n } n } n void comp_lps(string s, long long lps[], long long n) { n long long i = 1, j = 0; n while (i < n) { n if (s[i] == s[j]) { n lps[i++] = ++j; n } else { n if (j != 0) n j = lps[j - 1]; n else n lps[i++] = 0; n } n } n } n void dfs_l(long long u, vector > &adj, long long status[]) { n if (status[u] == 1) return; n status[u] = 1; n for (long long i = 0; i < (adj[u].size()); ++i) dfs_l(adj[u][i], adj, status); n } n long long dij(long long u, long long n, n vector > > &adj, n long long status[]) { n long long dist[n]; n for (long long i = 0; i < (n); ++i) dist[i] = 1000000000; n dist[0] = 0; n priority_queue, n vector >, n greater > > n q; n q.push(make_pair(0, 0)); n while (!q.empty()) { n pair p; n p = q.top(); n q.pop(); n long long x = p.second; n long long w = p.first; n if (status[x] == 1) continue; n status[x] = 1; n for (long long i = 0; i < (adj[x].size()); ++i) { n long long ww = adj[x][i].first; n long long y = adj[x][i].second; n if (dist[x] + ww < dist[y]) { n dist[y] = dist[x] + ww; n q.push(make_pair(dist[y], y)); n } n } n } n if (dist[n - 1] >= 1000000000) return -1; n return dist[n - 1]; n } n long long phi(long long n) { n vector v; n long long k = n; n ; n for (long long i = 2; i * i <= n; i++) { n if (k % i == 0) { n v.push_back(i); n while (k % i == 0) k /= i; n } n } n if (k > 1) v.push_back(k); n long long ans = n; n for (long long i = 0; i < (v.size()); ++i) ans -= (ans / v[i]); n return ans; n } n struct trie { n struct trie *left, *right; n bool isend; n }; n trie *get_trie() { n trie *ptr = new trie; n ptr->left = NULL; n ptr->right = NULL; n ptr->isend = false; n return ptr; n } n bool isempty(trie *root) { n if (root->left == NULL && root->right == NULL) return true; n return false; n } n void insert_trie(trie *root, string key) { n trie *ptr = root; n for (long long i = 0; i < (key.size()); ++i) { n if (key[i] == 0 ) { n if (ptr->left == NULL) { n ptr->left = get_trie(); n } n ptr = ptr->left; n } else { n if (ptr->right == NULL) ptr->right = get_trie(); n ptr = ptr->right; n } n } n ptr->isend = true; n } n trie *remove_trie(trie *root, string key, long long idx = 0) { n if (root == NULL) return NULL; n if (idx == key.size()) { n if (isempty(root)) { n delete (root); n root = NULL; n } n return root; n } n if (key[idx] == 0 ) n root->left = remove_trie(root->left, key, idx + 1); n else n root->right = remove_trie(root->right, key, idx + 1); n if (isempty(root)) { n delete (root); n root = NULL; n } n return root; n } n long long search_trie(trie *root, string key) { n trie *ptr = root; n string s = ; n for (long long i = 0; i < (key.size()); ++i) { n if (key[i] == 0 ) { n if (ptr->right != NULL) { n ptr = ptr->right; n s += 1 ; n } else { n ptr = ptr->left; n s += 0 ; n } n } else { n if (ptr->left != NULL) { n ptr = ptr->left; n s += 1 ; n } else { n ptr = ptr->right; n s += 0 ; n } n } n } n long long res = 0; n reverse(s.begin(), s.end()); n for (long long i = s.length() - 1; i >= (0); --i) n res = res * 2 + (s[i] - 0 ); n return res; n } n struct Comp { n bool operator()(const std::pair &a, const std::pair &b) { n if (a.first != b.first) { n return a.first < b.first; n } n return a.second > b.second; n } n }; n void dearr() { n long long dar[1005]; n dar[0] = 1; n dar[1] = 0; n dar[2] = 1; n for (long long i = 3; i < (1002); ++i) { n dar[i] = (i - 1) * (dar[i - 1] + dar[i - 2]); n } n } n int main() { n long long n; n cin >> n; n if (n % 2 == 0) { n cout << white n << n ; n cout << 1 << << 2 << n ; n } else n cout << black n << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n if (i % 2 == 0) { n if (j % 2 == 0) { n cout << W ; n } else { n cout << B ; n } n } else { n if (j % 2 != 0) { n cout << W ; n } else { n cout << B ; n } n } n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int first, second; n cin >> second >> first; n if ((second == 1 && first == 0) || first == 0) { n cout << NO ; n return 0; n } else if (first == 1 && second == 0) { n cout << YES ; n return 0; n } n int tot = first; n int co = first - 1; n if (first == 1 && second >= 0) { n cout << NO ; n return 0; n } n if ((second - co) % 2 == 0 && (second - co) >= 0) n cout << YES ; n else n cout << NO ; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, x, k, lb, ub, ans = -1; n int main() { n long long l, r; n scanf( %lld%lld%lld%lld , &n, &l, &r, &k); n x = (r >= l ? r - l + 1 : r + n - l + 1) % n; n for (long long i = k, j, r; i; i = j) { n j = k / (k / i + 1); n r = k / i; n ub = min(2 * n, i); n lb = max(n, j + 1); n ub = min(ub, min((2 * n + k - 2 * x + 1) / (r + 1), (k - x) / r)); n lb = max(lb, (k - 2 * x + r - 1) / r); n if (ub >= lb) ans = max(ans, ub); n } n if (x <= k && k <= x * 2) ans = max(ans, n + min(k - x, x - 1) + n - x + 1); n if (!x && k == n) ans = max(ans, n + 1); n printf( %lld n , ~ans ? ans - n : ans); n } n "} +{"func_code_string": "#include n using namespace std; n char p[][20] = { vaporeon , jolteon , flareon , espeon , n umbreon , leafeon , glaceon , sylveon }; n char s[20]; n int main() { n int n, k, i; n scanf( %d , &n); n scanf( %s , s); n for (k = 0; k < 8; k++) { n int fl = 1; n for (i = 0; fl && i < n; i++) { n if (p[k][i] == 0 || (p[k][i] != s[i] && s[i] != . )) fl = 0; n } n if (fl && p[k][i] == 0 ) printf( %s n , p[k]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double epsilon = 1e-9; n int main() { n int n; n cin >> n; n vector a(n), b(n); n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) cin >> b[i]; n vector > moves; n for (int i = 0; i < n; i++) { n if (b[i] != a[i]) { n for (int j = i + 1; j < n; j++) { n if (b[j] == a[i]) { n for (int k = j; k > i; k--) { n moves.push_back(make_pair(k - 1, k)); n swap(b[k], b[k - 1]); n } n break; n } n } n } n } n cout << moves.size() << endl; n for (int i = 0; i < moves.size(); i++) n cout << moves[i].first + 1 << << moves[i].second + 1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long a, b, c, d, e, first; n cin >> a >> b >> c >> d >> e >> first; n b = min(c, b); n if (d < a && d < b) n cout << d * max(e, first); n else { n long long p = min(a, d) * e + min(d - min(d, a), b) * first; n long long q = min(b, d) * first + min(d - min(d, b), a) * e; n cout << max(p, q); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n long long n; n cin >> n; n string s; n cin >> s; n for (long long i = 0; i < n - 1; i++) { n if (s[i] > s[i + 1]) { n cout << YES << endl; n cout << i + 1 << << i + 2 << endl; n return 0; n } n } n cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 21; n int a[1 << maxn], n; n long long ans[maxn][2]; n void mergesort(int l, int r, int dep) { n if (r - l <= 1) return; n int m = (l + r) / 2; n mergesort(l, m, dep - 1); n mergesort(m, r, dep - 1); n for (int i = l; i < m; i++) { n ans[dep][0] += lower_bound(a + m, a + r, a[i]) - a - m; n } n for (int i = m; i < r; i++) { n ans[dep][1] += lower_bound(a + l, a + m, a[i]) - a - l; n } n inplace_merge(a + l, a + m, a + r); n } n long long solve(int q) { n long long res = 0; n while (q) swap(ans[q][0], ans[q][1]), q--; n for (int i = 1; i <= n; i++) { n res += ans[i][0]; n } n return res; n } n int main() { n int m, q; n cin >> n; n for (int i = 0; i < 1 << n; i++) scanf( %d , &a[i]); n cin >> m; n mergesort(0, 1 << n, n); n for (int i = 0; i < m; i++) { n scanf( %d , &q); n cout << solve(q) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-8; n const double pi = acos(-1.0); n const int INF = 0x3f3f3f3f; n const long long inf = (((long long)1) << 61) + 5; n const int N = 100005; n int f[N]; n int g[N]; n int a[N]; n int bit[N]; n int ans[N]; n int sum1(int x) { n int ans = 0; n for (int i = x; i > 0; i -= i & -i) ans = max(bit[i], ans); n return ans; n } n void add1(int x, int val) { n for (int i = x; i <= N; i += i & -i) bit[i] = max(bit[i], val); n } n int sum2(int x) { n int ans = 0; n for (int i = x; i <= N; i += i & -i) ans = max(bit[i], ans); n return ans; n } n void add2(int x, int val) { n for (int i = x; i > 0; i -= i & -i) bit[i] = max(bit[i], val); n } n int main() { n int n, res = 0; n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n int x = sum1(a[i] - 1); n f[i] = x + 1; n if (f[i] > res) res = f[i]; n add1(a[i], f[i]); n } n memset(bit, 0, sizeof bit); n for (int i = n; i >= 1; i--) { n int x = sum2(a[i] + 1); n g[i] = x + 1; n add2(a[i], g[i]); n } n vector q[N]; n for (int i = 1; i <= n; i++) { n if (f[i] + g[i] - 1 < res) n ans[i] = 1; n else n q[f[i]].push_back(i); n } n for (int i = 1; i <= res; i++) { n int sz = q[i].size(); n for (int j = 0; j < sz; j++) { n int v = q[i][j]; n if (sz == 1) n ans[v] = 3; n else n ans[v] = 2; n } n } n for (int i = 1; i <= n; i++) printf( %d , ans[i]); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x3f3f3f3f; n template n inline void read(T &x) { n x = 0; n T fl = 1; n char ch = 0; n for (; ch < 0 || ch > 9 ; ch = getchar()) n if (ch == - ) fl = -1; n for (; ch >= 0 && ch <= 9 ; ch = getchar()) n x = (x << 1) + (x << 3) + (ch ^ 48); n x *= fl; n } n template n inline void read(T &x, Args &...args) { n read(x); n read(args...); n } n const int N = 1e5 + 5; n struct data { n int s, m, r, t; n data(int x = 0) { t = x; } n bool operator<(const data &b) const { return t < b.t; } n long long calc(long long tim) { return min(s + tim * r, m * 1ll); } n } a[18][N]; n struct seg { n int trt[N << 2]; n long long trm[18][N << 2], trr[18][N << 2]; n void pushdown(int nod) { n if (trt[nod] >= 0) trt[(nod << 1)] = trt[(nod << 1 | 1)] = trt[nod]; n } n void pushup(int nod) { n if (trt[(nod << 1)] != trt[(nod << 1 | 1)]) n trt[nod] = -1; n else n trt[nod] = trt[(nod << 1)]; n } n void build(int nod, int l, int r, int dep) { n trt[nod] = -2; n if (l == r) { n read(a[dep][l].s, a[dep][l].m, a[dep][l].r); n if (a[dep][l].r == 0) n a[dep][l].t = inf; n else n a[dep][l].t = a[dep][l].m % a[dep][l].r == 0 n ? a[dep][l].m / a[dep][l].r n : a[dep][l].m / a[dep][l].r + 1; n trm[dep][l] = trm[dep][l - 1] + a[dep][l].m; n trr[dep][l] = trr[dep][l - 1] + a[dep][l].r; n return; n } n int mid = (l + r) >> 1; n build((nod << 1), l, mid, dep + 1); n build((nod << 1 | 1), mid + 1, r, dep + 1); n for (int i = (l); i <= (r); i++) a[dep][i] = a[dep + 1][i]; n sort(a[dep] + l, a[dep] + r + 1); n for (int i = (l); i <= (r); i++) { n trm[dep][i] = trm[dep][i - 1] + a[dep][i].m; n trr[dep][i] = trr[dep][i - 1] + a[dep][i].r; n } n } n long long query(int tim, int nod, int l, int r, int ql, int qr, int dep) { n long long res = 0; n if (ql <= l && r <= qr && trt[nod] != -1) { n if (trt[nod] == -2) n for (int i = (l); i <= (r); i++) res += a[dep][i].calc(tim); n else { n int i = upper_bound(a[dep] + l, a[dep] + 1 + r, data(tim - trt[nod])) - n a[dep] - 1; n res = (tim - trt[nod]) * (trr[dep][r] - trr[dep][i]) + trm[dep][i] - n trm[dep][l - 1]; n } n trt[nod] = tim; n return res; n } n pushdown(nod); n int mid = (l + r) >> 1; n if (ql <= mid) res += query(tim, (nod << 1), l, mid, ql, qr, dep + 1); n if (qr > mid) n res += query(tim, (nod << 1 | 1), mid + 1, r, ql, qr, dep + 1); n pushup(nod); n return res; n } n } sgt; n int n, m; n int main() { n read(n); n sgt.build(1, 1, n, 0); n read(m); n for (int _ = (1); _ <= (m); _++) { n int t, l, r; n read(t); n read(l); n read(r); n printf( %lld n , sgt.query(t, 1, 1, n, l, r, 0)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a, i, j, n, aux, cnt, ans, div1[10000010], v[10000010]; n int main() { n cin >> a >> n; n v[1] = 1; n for (i = 3; i * i <= a + n - 1; i += 2) n if (!div1[i]) { n div1[i] = i; n for (j = i * i; j <= a + n - 1; j += 2 * i) div1[j] = i; n } n for (i = 2; i <= a + n - 1; i += 2) div1[i] = 2; n for (i = 2; i <= a + n - 1; i++) { n aux = i; n cnt = 0; n if (!div1[i]) div1[i] = i; n while (aux % div1[i] == 0) aux /= div1[i], cnt++; n v[i] = v[aux]; n if (cnt & 1) v[i] *= div1[i]; n } n for (i = a; i <= a + n - 1; i++) ans += v[i]; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( unroll-loops ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n using namespace std; n vector v; n unordered_map m; n long long falla(long long n) { n if (m.count(n)) { n return m[n]; n } n long long ans; n long long k = 0; n for (int j = n - 1; j >= 1; j--) { n if (n % j == 0) { n ans = j; n break; n } n if (n % (n - j + 1) == 0) { n ans = n / (n - j + 1); n break; n } n } n m[ans] = ans; n return ans; n } n int main() { n long long casos; n cin >> casos; n long long num = pow(2, 25) - 1; n for (int i = 1; i < 30; i++) { n v.push_back((1 << i) - 1); n } n long long flag = 0; n while (casos--) { n long long num; n long long ans1; n cin >> num; n if (m.count(num)) { n cout << m[num] << endl; n flag = 1; n } n if (flag == 0) { n ans1 = lower_bound((v).begin(), (v).end(), num) - v.begin(); n if (num == v[ans1]) { n ans1 = falla(num); n m[num] = ans1; n cout << ans1 << endl; n } else { n m[num] = v[ans1]; n cout << v[ans1] << endl; n } n } n flag = 0; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long dp[200005][2]; n bool vst[200005][2]; n long long A[200005], n; n long long go(long long v, bool b) { n if (vst[v][b]) return dp[v][b]; n vst[v][b] = true; n long long val = 0; n if (!b) { n if ((v - A[v]) > 1) n val = go(v - A[v], b ^ 1); n else if ((v - A[v]) == 1) n val = -1; n } else { n if ((v + A[v]) <= n) val = go(v + A[v], b ^ 1); n } n if (val != -1) n dp[v][b] = A[v] + val; n else n dp[v][b] = -1; n return dp[v][b]; n } n int main() { n long long i; n cin >> n; n for (i = (2); i <= (n); i++) { n cin >> A[i]; n } n memset((vst), (0), sizeof(vst)); n long long j; n memset((dp), (-1), sizeof(dp)); n for (i = (2); i <= (n); i++) { n go(i, 0); n if (dp[i][0] != -1) n cout << dp[i][0] + i - 1 << endl; n else n cout << -1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-10; n const double Pi = 3.1415926535897932; n const int dir[4][2] = {-1, 0, 0, -1, 1, 0, 0, 1}; n const int maxn = 1e4 + 5; n struct EDGE { n int a, b; n int A, B; n } edge[maxn]; n int n, m; n int last[maxn]; n vector G[maxn], tree[maxn]; n int d[maxn]; n int A[maxn], B[maxn]; n bool vis[maxn]; n vector ans; n int in[maxn]; n void dfs_tree(int a, int fa) { n vis[a] = true; n for (int i = 0; i < G[a].size(); i++) { n int p = G[a][i]; n if (p == last[a]) continue; n int b = edge[p].a ^ edge[p].b ^ a; n if (!vis[b]) { n tree[a].push_back(p); n in[p] = true; n d[b] = d[a] + 1; n last[b] = p; n dfs_tree(b, a); n } else if (d[a] > d[b]) { n if (d[a] - d[b] + 1 & 1) { n ans.push_back(p); n B[a]++; n B[b]--; n } else { n A[a]++; n A[b]--; n } n } n } n } n void dfs(int a) { n vis[a] = true; n for (int i = 0; i < tree[a].size(); i++) { n int p = tree[a][i]; n int b = edge[p].a ^ edge[p].b ^ a; n if (!vis[b]) dfs(b); n A[a] += A[b]; n B[a] += B[b]; n } n edge[last[a]].A = A[a]; n edge[last[a]].B = B[a]; n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n int a, b; n scanf( %d%d , &a, &b); n edge[i] = EDGE{a, b}; n G[a].push_back(i); n G[b].push_back(i); n } n for (int i = 1; i <= n; i++) { n if (!vis[i]) dfs_tree(i, -1); n } n memset(vis, false, sizeof(vis)); n for (int i = 1; i <= n; i++) { n if (!vis[i]) dfs(i); n } n if (ans.size() == 0) { n for (int i = 1; i <= m; i++) ans.push_back(i); n } else if (ans.size() == 1) { n for (int i = 1; i <= m; i++) n if (in[i]) { n if (edge[i].A == 0 && edge[i].B) ans.push_back(i); n } n } else { n int t = ans.size(); n ans.clear(); n for (int i = 1; i <= m; i++) n if (in[i]) { n if (edge[i].B) { n if (edge[i].B == t && edge[i].A == 0) ans.push_back(i); n } n } n } n sort(ans.begin(), ans.end()); n printf( %d n , ans.size()); n for (int i = 0; i < ans.size(); i++) n printf( %d , ans[i]), putchar(i == ans.size() - 1 ? n : ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n pair a[200]; n int n; n int main() { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i].second; n long long tmp = a[i].second; n while (tmp % 3 == 0) { n a[i].first--; n tmp /= 3; n } n } n sort(a + 1, a + n + 1); n for (int i = 1; i <= n; i++) cout << a[i].second << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long arr[3]; n scanf( %I64d%I64d%I64d , &arr[0], &arr[1], &arr[2]); n sort(arr, arr + 3); n if (arr[0] == arr[1] && arr[1] == arr[2]) n printf( 0 n ); n else if (arr[2] == arr[1] && arr[1] > arr[0]) { n printf( %I64d n , arr[2] - arr[0] - 1); n } else if (arr[2] > arr[1] && arr[1] == arr[0]) { n printf( %I64d n , (arr[2] - arr[1] - 1) + (arr[2] - arr[0] - 1)); n } else if (arr[2] > arr[1] && arr[1] > arr[0]) { n printf( %I64d n , (arr[2] - arr[1] - 1) + (arr[2] - arr[0] - 1)); n } n } n "} +{"func_code_string": "#include n using namespace std; n long long const modul = 1; n long long mod_sum(long long x, long long y) { return (x + y) % modul; } n long long mod_sub(long long x, long long y) { n if (x > y) { n return (x - y) % modul; n } else { n return (modul + x - y) % modul; n } n } n long long mod_mpl(long long x, long long y) { return (x * y) % modul; } n void set_precise(int n) { n cout << fixed; n cout << setprecision(n); n } n int const N = 200000; n class Tree { n private: n long long tree[N * 4]; n int start; n int size; n void rebuild(int id) { n if (id < 1) { n return; n } n tree[id] = tree[id * 2] + tree[id * 2 + 1]; n rebuild(id / 2); n }; n long long count_sum(int cur, int left, int right, int cur_l, int cur_r) { n int mid = (cur_l + cur_r) / 2; n if ((left == cur_l) && (right == cur_r)) { n return tree[cur]; n } n if (right <= mid) { n return count_sum(cur * 2, left, right, cur_l, mid); n } else if (left >= mid + 1) { n return count_sum(cur * 2 + 1, left, right, mid + 1, cur_r); n } else { n return count_sum(cur * 2, left, mid, cur_l, mid) + n count_sum(cur * 2 + 1, mid + 1, right, mid + 1, cur_r); n } n }; n n public: n Tree() { n size = 0; n start = 0; n }; n void initialize(int n) { n int cur = 1; n int sum = 0; n while (cur < n) { n sum += cur; n cur *= 2; n } n start = sum + 1; n size = cur; n for (int i = 1; i < start + cur; ++i) { n tree[i] = 0; n } n } n Tree(int n) { n int cur = 1; n int sum = 0; n while (cur < n) { n sum += cur; n cur *= 2; n } n start = sum + 1; n size = cur; n for (int i = 1; i < start + cur; ++i) { n tree[i] = 0; n } n }; n void update(int pos, long long q, long long no_more) { n long long cur = tree[start + pos]; n cur += q; n if (cur > no_more) { n cur = no_more; n } n tree[start + pos] = cur; n rebuild((start + pos) / 2); n }; n long long get_sum(int left, int right) { n if (left > right) { n return 0; n } n return count_sum(1, left, right, 0, size - 1); n } n }; n Tree max_a; n Tree max_b; n int main() { n int n, k; n long long a, b; n int q; n cin >> n >> k >> a >> b >> q; n max_a.initialize(n); n max_b.initialize(n); n for (int i = 0; i < q; ++i) { n int type; n cin >> type; n if (type == 1) { n int day; n long long x; n cin >> day >> x; n --day; n max_a.update(day, x, a); n max_b.update(day, x, b); n } else { n int p; n cin >> p; n --p; n long long ans = 0; n ans += max_b.get_sum(0, p - 1); n ans += max_a.get_sum(p + k, n - 1); n cout << ans << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void sove() {} n int main() { n int n; n cin >> n; n int nums[n]; n for (int i = 0; i < n; ++i) { n cin >> nums[i]; n } n for (int i = 0; i < n / 2; i += 2) { n int temp = nums[i]; n nums[i] = nums[n - i - 1]; n nums[n - i - 1] = temp; n } n for (int num : nums) { n cout << num << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 3e5 + 10; n vector e[maxn]; n int dp[maxn], root[maxn], d[maxn], sz[maxn]; n pair dfs(int v, int st, int par) { n if (root[v] == -1) sz[st]++; n root[v] = st; n pair p = make_pair(0, -1); n for (int i = 0; i < e[v].size(); i++) n if (e[v][i] != par) p = max(p, dfs(e[v][i], st, v)); n if (par != -1) p.first++; n if (p.second == -1) p.second = v; n return p; n } n int get_root(int v) { return root[v] == v ? v : root[v] = get_root(root[v]); } n void merge(int v, int u) { n v = get_root(v); n u = get_root(u); n if (sz[v] > sz[u]) swap(v, u); n if (v == u) return; n root[v] = u; n sz[u] += sz[v]; n d[u] = max((d[v] + 1) / 2 + (d[u] + 1) / 2 + 1, max(d[v], d[u])); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int n, m, q; n cin >> n >> m >> q; n memset(root, -1, sizeof root); n for (int i = 0; i < m; i++) { n int u, v; n cin >> v >> u; n v--; n u--; n e[v].push_back(u); n e[u].push_back(v); n } n for (int i = 0; i < n; i++) n if (root[i] == -1) d[i] = dfs(dfs(i, i, -1).second, i, -1).first; n for (int i = 0; i < q; i++) { n int t; n cin >> t; n if (t == 1) { n int x; n cin >> x; n x--; n cout << d[get_root(x)] << n ; n } else { n int x, y; n cin >> x >> y; n x--; n y--; n merge(x, y); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long int t; n t = 1; n for (long long int _ = 0; _ < t; _++) { n long long int n, m, b, mod; n cin >> n >> m >> b >> mod; n vector v(n + 1); n for (long long int i = 1; i <= n; i++) cin >> v[i]; n long long int dp[2][m + 1][b + 1]; n for (long long int i = 0; i <= 1; i++) { n for (long long int j = 0; j <= m; j++) { n for (long long int k = 0; k <= b; k++) dp[i][j][k] = 0; n } n } n dp[0][0][0] = 1; n for (long long int i = 1; i <= n; i++) { n for (long long int j = 0; j <= m; j++) { n for (long long int k = 0; k <= b; k++) { n if (k >= v[i] && j > 0) n dp[i % 2][j][k] = n (dp[1 - (i % 2)][j][k] + dp[i % 2][j - 1][k - v[i]]) % mod; n else n dp[i % 2][j][k] = dp[1 - (i % 2)][j][k]; n } n } n } n long long int ans = 0; n for (long long int k = 0; k <= b; k++) ans = (ans + dp[n % 2][m][k]) % mod; n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n set a, b, c; n void solve() { n cin >> n >> m; n for (int i = 1; i <= n; i++) { n string s; n cin >> s; n a.insert(s); n } n for (int i = 1; i <= m; i++) { n string s; n cin >> s; n if (a.count(s)) c.insert(s); n b.insert(s); n } n while (1) { n if (a.empty()) { n cout << NO n ; n return; n } n if (!c.empty()) { n a.erase(*c.begin()); n b.erase(*c.begin()); n c.erase(c.begin()); n } else { n if (b.count(*a.begin())) b.erase(*a.begin()); n a.erase(a.begin()); n } n if (b.empty()) { n cout << YES n ; n return; n } n if (!c.empty()) { n a.erase(*c.begin()); n b.erase(*c.begin()); n c.erase(c.begin()); n } else { n if (a.count(*b.begin())) a.erase(*b.begin()); n b.erase(b.begin()); n } n } n } n int main() { n int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, d, res = 0, a = 0, b; n cin >> n >> d; n for (int i = 0; i < n; i++) { n cin >> b; n if (a >= b) { n res += ceil((a - b + 1) / (double)d); n b += ceil((a - b + 1) / (double)d) * d; n } n a = b; n } n cout << res << endl; n } n "} +{"func_code_string": "#include n using namespace std; n vector > g[100010]; n int N, K, in[100010], dp[100010][2]; n vector > num[100010]; n void dfs(int u, int fa) { n for (pair& e : g[u]) { n int v = e.first, cost = e.second; n if (v == fa) continue; n dfs(v, u); n num[u].push_back(pair(dp[v][1] + cost, v)); n } n sort(num[u].begin(), num[u].end(), greater >()); n dp[u][1] = 0; n int sum = 0; n for (size_t i = 0; (int)i < K - 1 && i < num[u].size(); i++) { n dp[u][1] += num[u][i].first; n sum += num[u][i].first; n } n if ((int)num[u].size() <= K - 1) { n for (size_t i = 0; i < num[u].size(); i++) { n int v = num[u][i].second; n dp[u][0] = max(dp[u][0], sum - dp[v][1] + dp[v][0]); n } n } else { n for (size_t i = 0; i < (int)K - 1; i++) { n int v = num[u][i].second; n dp[u][0] = max(dp[u][0], sum + num[u][K - 1].first - dp[v][1] + dp[v][0]); n } n for (size_t i = K - 1; i < num[u].size(); i++) { n int v = num[u][i].second; n dp[u][0] = max(dp[u][0], sum + num[u][i].first - dp[v][1] + dp[v][0]); n } n } n } n int main() { n int u, v, c; n scanf( %d%d , &N, &K); n for (int i = 1; i < N; i++) { n scanf( %d%d%d , &u, &v, &c); n g[u].push_back(pair(v, c)); n g[v].push_back(pair(u, c)); n } n dfs(0, -1); n printf( %d n , max(dp[0][0], dp[0][1])); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long GCD(long long a, long long b) { n while (b) b ^= a ^= b ^= a %= b; n return a; n } n long long LCM(long long a, long long b) { return a * (b / GCD(a, b)); } n const double EPS = 10e-9; n const long long INF = (1LL << 30); n using namespace std; n template n string toString(T t) { n stringstream ss; n ss << t; n return ss.str(); n } n long long isSquare(long long N) { n long long lo = 1, hi = 2 * sqrt(N); n while (hi - lo > 1) { n long long mid = (hi + lo) >> 1; n long long res = mid * mid; n if (res < N) { n lo = mid; n } else if (res > N) { n hi = mid; n } else { n return mid; n } n } n return lo; n } n int main() { n long long N; n cin >> N; n if (N % 3 != 0) { n cout << 0 << endl; n } else { n N /= 3; n int options = 0; n for (long long i = 1; i * i * i <= N; i++) { n if (N % i == 0) { n long long left = N / i, to = i / 2; n for (long long a = 1; a <= to; a++) { n long long c = i - a; n long long d = (a - c) * (a - c); n long long sqr = isSquare(d + 4 * left); n if (sqr * sqr == d + 4 * left) { n long long b = (-(a + c) + sqr) >> 1; n if (c <= b) { n if (a == c) { n if (b == c) { n options += 1; n } else { n options += 3; n } n } else { n if (b == c) { n options += 3; n } else { n options += 6; n } n } n } n } n } n } n } n cout << options << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int mod = 1000000007; n const long long int inf = 1e17; n const long long int N = 5005; n long long int n; n long long int a[N]; n long long int dp[N][N]; n long long int go(long long int idx, long long int flag) { n long long int &ans = dp[idx][flag]; n if (ans != -1) return ans; n if (idx > n) { n return 0; n } n if (flag == 0 or flag == 2) { n ans = max(go(idx + 1, flag), go(idx + 1, flag + 1)) + a[idx]; n } else { n ans = max(go(idx + 1, flag), go(idx + 1, flag + 1)) - a[idx]; n } n return ans; n } n vector res; n void backtrack(long long int idx, long long int flag) { n if (idx > n) { n return; n } n if (flag == 0 or flag == 2) { n long long int tmp1 = go(idx + 1, flag) + a[idx]; n long long int tmp2 = go(idx + 1, flag + 1) + a[idx]; n res.push_back(1); n if (tmp1 >= tmp2) { n backtrack(idx + 1, flag); n } else { n backtrack(idx + 1, flag + 1); n } n } else { n long long int tmp1 = go(idx + 1, flag) - a[idx]; n long long int tmp2 = go(idx + 1, flag + 1) - a[idx]; n res.push_back(0); n if (tmp1 >= tmp2) { n backtrack(idx + 1, flag); n } else { n backtrack(idx + 1, flag + 1); n } n } n } n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n memset(dp, -1, sizeof(dp)); n cin >> n; n for (long long int i = 1; i <= n; i++) { n cin >> a[i]; n } n long long int ans = go(0, 0); n backtrack(0, 0); n res.erase(res.begin()); n long long int cnt = 0, idx = 0; n while (res[idx] and idx < n) { n cnt++; n idx++; n } n vector vec; n vec.push_back(cnt); n cnt = 0; n idx = vec.back(); n while (idx < n and !res[idx]) { n cnt++; n idx++; n } n vec.push_back(cnt); n idx = vec[0] + vec[1]; n cnt = 0; n while (idx < n and res[idx]) { n cnt++; n idx++; n } n vec.push_back(cnt); n idx = 0, cnt = 0; n for (auto to : vec) { n cnt = to; n if (cnt == 0LL) { n cout << idx << ; n } else { n cout << idx + cnt << ; n idx += cnt; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 10; n bool chk(string s) { n int l = s.size(); n for (int i = 0, j = l - 1; i <= j; i++, j--) { n if (s[i] != s[j]) return false; n } n return true; n } n int main() { n int t; n cin >> t; n while (t--) { n string s; n cin >> s; n string ans; n int mx = 0; n string res; n for (int i = 0; i < s.size(); i++) { n ans += s[i]; n if (chk(ans)) { n int l = ans.size(); n if (l > mx) { n mx = ans.size(); n res = ans; n } n } n } n ans = ; n for (int i = s.size() - 1; i >= 0; i--) { n ans += s[i]; n if (chk(ans)) { n int l = ans.size(); n if (l > mx) { n mx = ans.size(); n res = ans; n } n } n } n int p1 = 0; n int p2 = 0; n for (int i = 0, j = s.size() - 1; i < j; i++, j--) { n if (s[i] != s[j]) { n p1 = i - 1; n p2 = j + 1; n break; n } n } n ans = ; n string rev = ; n for (int i = 0; i <= p1; i++) ans += s[i]; n for (int i = p2; i < s.size(); i++) rev += s[i]; n string ss = ; n for (int i = p1 + 1; i < p2; i++) { n ss += s[i]; n string tmp = ans + ss + rev; n int l = tmp.size(); n if (l <= mx) continue; n if (chk(tmp)) { n if (l > mx) { n mx = l; n res = tmp; n } n } n } n ss = ; n for (int j = p2 - 1; j > p1; j--) { n ss = s[j] + ss; n string tmp = ans + ss + rev; n int l = tmp.size(); n if (chk(tmp)) { n if (l > mx) { n mx = l; n res = tmp; n } n } n } n cout << res << endl; n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n, m; n scanf( %d%d , &n, &m); n int num = n + m; n int a = m / 2, aa = m % 2, aaa = a + aa; n if (n == m) { n for (int i = 0; i < n; i++) { n printf( 01 ); n } n } else if (n < m) { n if (aaa <= n + 1) { n a = m - (n + 1); n m -= a; n for (int i = 0; n; i++) { n if (a) { n printf( 11 ); n a--; n } else if (m) { n printf( 1 ); n m--; n } n if (n) { n printf( 0 ); n n--; n } n } n if (a) n printf( 11 ); n else if (m) n printf( 1 ); n } else n printf( -1 ); n } else if (n > m) { n if (n <= m + 1) { n for (int i = 0; i < m; i++) { n printf( 01 ); n } n printf( 0 ); n } else n printf( -1 ); n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long k, d, t; n int main() { n scanf( %lld%lld%lld , &k, &d, &t); n t *= 2; n long long round = ceil((double)k / d) * d; n long long num = k * 2 + (round - k); n long long cnt = t / num; n long long left = t - cnt * num; n double ans = 0.0; n if (left <= k * 2) { n ans = cnt * round + left / 2; n if (left % 2) ans += 0.5; n } else n ans = cnt * round + k + (left - k * 2); n printf( %.1lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int ans = 0, last = 0, current = 0; n while (n > 0) { n ans++; n current = last + ans; n last = current; n n -= current; n if (n < 0) { n ans--; n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int head, tail, n, q[100100]; n long long f[100100], a[100100], b[100010]; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]); n for (int i = 1; i <= n; i++) scanf( %I64d , &b[i]); n f[1] = 0; n head = tail = 1; n q[head] = 1; n for (int i = 2; i <= n; i++) { n while (head < tail) { n if ((1.0 * f[q[head]] + 1.0 * a[i] * b[q[head]]) > n (1.0 * f[q[head + 1]] + 1.0 * a[i] * b[q[head + 1]])) n head++; n else n break; n } n f[i] = f[q[head]] + b[q[head]] * a[i]; n while (head < tail) { n if (1.0 * (f[q[tail]] - f[q[tail - 1]]) * (b[q[tail]] - b[i]) > n 1.0 * (f[i] - f[q[tail]]) * (b[q[tail - 1]] - b[q[tail]])) n tail--; n else n break; n } n q[++tail] = i; n } n printf( %I64d , f[n]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 998244353; n const int N = 5005; n void update(int &a, int b) { n a += b; n a %= MOD; n } n int add(int a, int b) { return (a + b) % MOD; } n int multiply(int a, int b) { return (a * 1LL * b) % MOD; } n int quick_power(int a, int n) { n int res = 1; n for (; n > 0; n >>= 1) { n if (n & 1) res = multiply(res, a); n a = multiply(a, a); n } n return res; n } n int get_inv(int a) { return quick_power(a, MOD - 2); } n int n, a; n int cnt[N], sum[N][N], dp[N][N]; n int main() { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a; n cnt[a]++; n } n for (int i = 0; i <= n; i++) { n sum[0][i] = 1; n } n int answer = 0; n for (int i = 1; i <= n; i++) { n int inv = get_inv(n - i + 1); n for (int j = 1; j <= n; j++) { n if (cnt[j]) { n dp[i][j] = multiply(multiply(sum[i - 1][j - 1], cnt[j]), inv); n update(answer, multiply(multiply(dp[i - 1][j], cnt[j] - 1), inv)); n } n sum[i][j] = add(sum[i][j - 1], dp[i][j]); n } n } n cout << answer << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long double n, h; n cin >> n >> h; n cout << setprecision(20); n for (long double i = 0; i < n - 1; i++) { n cout << h * sqrt((i + 1) / n) << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const double pi = acos(-1); n const long long N = 1e5 + 5, M = 1e9 + 7; n char ulta[500]; n set ache; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n ulta[ U ] = D ; n ulta[ D ] = U ; n ulta[ R ] = L ; n ulta[ L ] = R ; n string s; n long long n, i, j, k, ans = 2; n cin >> n >> s; n for (auto ch : s) { n auto x = ache.find(ulta[ch]); n if (x != ache.end()) { n ans++; n ache.clear(); n } n ache.insert(ch); n } n cout << ans - 1 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n struct State { n int len, link; n map nxtc; n } SA[2 * 2006]; n bool vis[2 * 2006]; n char str[2006], pref[2 * 2006], suf[2006]; n class SuffixAutomata { n int sz, last; n void init(int idx) { n SA[idx].len = 0, SA[idx].link = -1; n SA[idx].nxtc.clear(); n } n bool traverse(int cur, char *ch) { n if (*ch == 0) return true; n if (SA[cur].nxtc.count(*ch) == 0) return false; n int p = SA[cur].nxtc[*ch]; n return traverse(p, ++ch); n } n int findState(int cur, char *ch) { n if (*ch == 0) return cur; n int p = SA[cur].nxtc[*ch]; n return findState(p, ++ch); n } n n public: n SuffixAutomata() { n sz = last = 0; n init(0); n ++sz; n } n int size() { return sz; } n void extend(char ch) { n int p, q, clone, cur = sz++; n init(cur); n SA[cur].len = SA[last].len + 1; n for (p = last; p != -1 && SA[p].nxtc.count(ch) == 0; p = SA[p].link) n SA[p].nxtc[ch] = cur; n if (p == -1) n SA[cur].link = 0; n else { n q = SA[p].nxtc[ch]; n if (SA[p].len + 1 == SA[q].len) n SA[cur].link = q; n else { n clone = sz++; n init(clone); n SA[clone] = SA[q]; n SA[clone].len = SA[p].len + 1; n for (; p != -1 && SA[p].nxtc[ch] == q; p = SA[p].link) n SA[p].nxtc[ch] = clone; n SA[cur].link = SA[q].link = clone; n } n } n last = cur; n } n bool traverse(char *str) { return traverse(0, str); } n int findState(char *str) { return findState(0, str); } n }; n int lenp, lens, dp[2 * 2006][2006]; n int rec(int cur, int idx) { n if (suf[idx] == 0) return 1; n if (dp[cur][idx] != -1) return dp[cur][idx]; n int &ret = dp[cur][idx]; n ret = 0; n char ch; n int p; n if (idx) { n ch = suf[idx]; n if (SA[cur].nxtc.count(ch) == 0) return ret = 0; n p = SA[cur].nxtc[ch]; n return ret = rec(p, idx + 1); n } n map &M = SA[cur].nxtc; n map::iterator im; n for (im = M.begin(); im != M.end(); ++im) { n ch = im->first; n p = im->second; n ret += rec(p, idx); n if (ch == suf[idx]) ret += rec(p, idx + 1); n } n return ret; n } n int main() { n int i, j, ans, n; n while (scanf( %s , str) != EOF) { n SuffixAutomata sa; n for (i = 0; str[i]; ++i) sa.extend(str[i]); n ans = 0; n scanf( %s %s , pref, suf); n lenp = strlen(pref), lens = strlen(suf); n if (!sa.traverse(pref)) { n puts( 0 ); n continue; n } n for (i = 0; i < lenp; ++i) { n if (i + lens < lenp) continue; n for (j = 0; j < lens; ++j) { n if (pref[i + j] != suf[j]) break; n } n if (i + j == lenp) { n strcat(pref, &suf[lenp - i]); n ans += sa.traverse(pref); n pref[lenp] = 0; n } n } n n = sa.findState(pref); n memset(dp, -1, sizeof(dp)); n ans += rec(n, 0); n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 200005; n int main() { n int n, k, q, i, a, b, p[MAX] = {0}, c[MAX] = {0}; n scanf( %d %d %d , &n, &k, &q); n while (n--) { n scanf( %d %d , &a, &b); n p[a]++; n p[b + 1]--; n } n for (i = 1; i < MAX; i++) { n p[i] += p[i - 1]; n c[i] += c[i - 1] + (p[i] >= k); n } n while (q--) { n scanf( %d %d , &a, &b); n printf( %d n , c[b] - c[a - 1]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n class base { n public: n long double a, b; n base(void) { n a = 0; n b = 0; n } n base(long double _a, long double _b) { n a = _a; n b = _b; n } n base(long double _a) { n a = _a; n b = 0; n } n base operator*(const base& b2) { n base ret(a * b2.a - b * b2.b, b * b2.a + a * b2.b); n return ret; n } n base operator+(const base& b2) { n base ret(a + b2.a, b + b2.b); n return ret; n } n base operator-(const base& b2) { n base ret(a - b2.a, b - b2.b); n return ret; n } n base operator/(const base& b2) { n long double c = b2.a, d = b2.b; n base ret((a * c + b * d) / (c * c + d * d), n (b * c - a * d) / (c * c + d * d)); n return ret; n } n void operator*=(const base& b2) { n long double tmp = a * b2.a - b * b2.b; n b = b * b2.a + a * b2.b; n a = tmp; n } n void operator/=(const base& b2) { n long double c = b2.a, d = b2.b; n long double tmp = (a * c + b * d) / (c * c + d * d); n b = (b * c - a * d) / (c * c + d * d); n a = tmp; n } n inline long double real(void) { return a; } n }; n void fft(vector& a, bool invert) { n int n = (int)a.size(); n for (int i = 1, j = 0; i < n; ++i) { n int bit = n >> 1; n for (; j >= bit; bit >>= 1) j -= bit; n j += bit; n if (i < j) swap(a[i], a[j]); n } n base ww[n]; n long double ang = 2 * 3.14159265358979323846l / n * (invert ? -1 : 1); n base wi(cos(ang), sin(ang)); n ww[0] = 1; n for (int i = 1; i < n; i++) { n ww[i] = ww[i / 2] * ww[i / 2]; n if (i % 2 == 1) ww[i] *= wi; n } n for (int len = 2; len <= n; len <<= 1) { n int k = n / len; n for (int i = 0; i < n; i += len) { n int wn = 0; n for (int j = 0; j < len / 2; ++j) { n base u = a[i + j], v = a[i + j + len / 2] * ww[wn]; n a[i + j] = u + v; n a[i + j + len / 2] = u - v; n wn += k; n } n } n } n if (invert) n for (int i = 0; i < n; ++i) a[i] /= n; n } n vector multiply(const vector& a, const vector& b) { n vector fa(a.begin(), a.end()); n size_t n = 1; n while (n < (a.size() + b.size())) n <<= 1; n fa.resize(n); n vector res; n fft(fa, false); n for (size_t i = 0; i < n; ++i) fa[i] *= fa[i]; n fft(fa, true); n res.resize(n); n long long int carry = 0; n for (size_t i = 0; i < n; ++i) { n carry += (long long int)(fa[i].real() + 0.5); n res[i] = carry % 1000; n carry /= 1000; n } n int i; n for (i = n - 1; i > 0; i--) { n if (res[i] != 0) break; n } n res.resize(i + 1); n return res; n } n void small_mult(vector& a, int b) { n int carry = 0; n for (int i = 0; i < (int)a.size() || carry; i++) { n if (i == (int)a.size()) a.push_back(0); n int cur = carry + a[i] * b; n a[i] = cur % 1000; n carry = cur / 1000; n } n while (a.size() > 1 && !a.back()) a.pop_back(); n } n void fast_3_pow(long long int k, vector& ans) { n ans = {1}; n if (k <= 0) return; n long long int r = 0, kk = 0; n for (long long int t = k; t > 0; t /= 2) { n r = (2 * r + t % 2); n kk++; n } n for (long long int i = 0; i < kk; i++) { n ans = multiply(ans, ans); n if (r % 2) small_mult(ans, 3); n r /= 2; n } n } n bool first_is_BE(vector& v1, vector& v2) { n if (v1.size() > v2.size()) return 1; n if (v1.size() < v2.size()) return 0; n for (long long int i = ((long long int)v1.size()) - 1; i >= 0; i--) { n if (v1[i] > v2[i]) return 1; n if (v1[i] < v2[i]) return 0; n } n return 1; n } n int main() { n ios::sync_with_stdio(0); n string s; n cin >> s; n if (s == 1 ) { n cout << 1 ; n return 0; n } n if (s == 2 ) { n cout << 2 ; n return 0; n } n if (s == 3 ) { n cout << 3 ; n return 0; n } n if (s == 4 ) { n cout << 4 ; n return 0; n } n if (s == 5 ) { n cout << 5 ; n return 0; n } n if (s == 6 ) { n cout << 5 ; n return 0; n } n if (s == 7 ) { n cout << 6 ; n return 0; n } n if (s == 8 ) { n cout << 6 ; n return 0; n } n if (s == 9 ) { n cout << 6 ; n return 0; n } n vector n; n int tmp = 0; n while (s.size() % 3 != 0) s = 0 + s; n for (int i = 0; i < (int)s.size(); i++) { n tmp *= 10; n tmp += s[i] - 0 ; n if ((i + 1) % 3 == 0) { n n.push_back(tmp); n tmp = 0; n } n } n reverse(n.begin(), n.end()); n vector v1, vt; n int k; n k = max((int)(s.size() * logl(10) / logl(3) - 8), (int)0); n fast_3_pow(k, v1); n vt = v1; n small_mult(v1, 4); n while (1) { n if (first_is_BE(v1, n)) { n break; n } n k++; n small_mult(v1, 3); n } n int ans3 = 3 * k + 4; n k = max((int)(s.size() * logl(10) / logl(3) - 8), (int)0); n v1 = vt; n while (1) { n if (first_is_BE(v1, n)) { n break; n } n k++; n small_mult(v1, 3); n } n int ans1 = 3 * k; n k = max((int)(s.size() * logl(10) / logl(3) - 8), (int)0); n v1 = vt; n small_mult(v1, 2); n while (1) { n if (first_is_BE(v1, n)) { n break; n } n k++; n small_mult(v1, 3); n } n int ans2 = 3 * k + 2; n cout << min(min(ans1, ans2), ans3); n return 0; n } n "} +{"func_code_string": "#include n #define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); n #define ll long long int n #define pb push_back n #define pob pop_back n #define ub upper_bound n #define lb lower_bound n #define mp make_pair n #define f0(i,n) for(i=0;i=0;i--) n #define f2(i,n) for(i=1;i>t; while(t--) n #define fi first n #define sc second n #define pll pair n #define vll vector n #define vpll vector n #define all(v) v.begin(),v.end() n #define mod 1000000007 n #define dev(a) for(auto it:a)cout<mp,mp1; n setst; vector v; n cin>>n>>k; ll x[n][2]; n f0(i,n) n { n cin>>x[i][0]>>x[i][1]; n } n f0(i,n) n { n vll vk; n f0(j,n) n { n n if(i!=j) n { n vk.pb(abs(x[i][0]-x[j][0])+abs(x[i][1]-x[j][1])); n } n n } n v.pb(vk); n r++; n } n f0(i,v.size()) n { n ll p=*max_element(all(v[i])); n if(p<=k){e=1;break;} n } n if(e==1)cout<<1; n else cout<<-1; n cout< n #pragma GCC optimize( O3 ) n const double pi = acos(-1); n const int MOD = 1e9 + 7; n const int INF = 1e9 + 7; n const int MAXN = 10000; n const double eps = 1e-9; n using namespace std; n int n, m, cur; n set s; n void dfs(int x, int y) { n if (y == 0) { n int tmp = abs(abs(x) - n); n if (tmp < MAXN) { n if (s.size() < m) s.insert(cur * MAXN + tmp); n if (s.size() < m) s.insert(cur + MAXN * tmp); n } n return; n } n dfs(x + (y % 10), y / 10); n dfs(x - (y % 10), y / 10); n dfs(x * (y % 10), y / 10); n } n int main() { n scanf( %d , &(n)), scanf( %d , &(m)); n for (int i = 0; i < MAXN; i++) { n cur = i; n dfs(i % 10, i / 10); n } n auto it = s.begin(); n for (; it != s.end(); it++) printf( %08d n , *it); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000000000; n const int MAX = 400005; n const int MAX1 = 2007; n const int MAX2 = 4007; n const int LEN = 21; n const int BASE = 1000000000; n const double EPS = 1e-7; n const int MOD = 1234567891; n vector > vec; n int main(void) { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ifstream in( ); n ofstream out( ); n int n, k; n cin >> n >> k; n string s; n cin >> s; n for (int i = (0); i < ((int)s.size()); ++i) { n vec.push_back(make_pair(s[i], i)); n } n sort(vec.begin(), vec.end()); n char ans[MAX]; n memset(ans, 0 , sizeof(ans)); n for (int i = (k); i < ((int)vec.size()); ++i) { n ans[vec[i].second] = vec[i].first; n } n for (int i = (0); i < (n); ++i) { n if (ans[i] != 0 ) cout << ans[i]; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int num; n int likes[7][7]; n map heroes; n int getNum(string s) { n if (!heroes.count(s)) heroes[s] = num++; n return heroes[s]; n } n int getMaxSymp(int n1, int n2) { n vector p, groups(7, 0); n for (int i = 0; i < 7; i++) { n p.push_back(i); n if (i >= n1) groups[i] = i < n1 + n2 ? 1 : 2; n } n int res = 0; n do { n int r = 0; n for (int i = 0; i < 7; i++) n for (int j = 0; j < 7; j++) n if (groups[i] == groups[j]) r += likes[p[i]][p[j]]; n res = max(r, res); n } while (next_permutation(p.begin(), p.end())); n return res; n } n int main() { n int i, j, k, n, a, b, c, res = 2000000000, symp = 0; n cin >> n; n for (i = 0; i < n; i++) { n string s1, s2, s3; n cin >> s1 >> s3 >> s2; n likes[getNum(s1)][getNum(s2)] = 1; n } n cin >> a >> b >> c; n for (i = 1; i < 7; i++) n for (j = 1; j + i < 7; j++) { n k = 7 - i - j; n int d = max(a / i, max(b / j, c / k)) - min(a / i, min(b / j, c / k)); n if (d < res) n res = d, symp = getMaxSymp(i, j); n else if (res == d) n symp = max(symp, getMaxSymp(i, j)); n } n cout << res << << symp << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 998244353; n long long inv[5050 + 10], fac[5050 + 10], ifac[5050 + 10]; n void setComb() { n inv[0] = 1; n inv[1] = 1; n fac[1] = 1; n ifac[1] = 1; n fac[0] = 1; n ifac[0] = 1; n for (int i = 2; i < 5050; i++) { n inv[i] = (-MOD / i) * inv[MOD % i] % MOD; n fac[i] = fac[i - 1] * i % MOD; n ifac[i] = ifac[i - 1] * inv[i] % MOD; n inv[i] = (inv[i] + MOD) % MOD; n fac[i] = (fac[i] + MOD) % MOD; n ifac[i] = (ifac[i] + MOD) % MOD; n } n return; n } n long long comb(long long n, long long k) { n if (n < k || n < 0 || k < 0) n return 0; n else n return ((fac[n] * ifac[k] % MOD * ifac[n - k] % MOD + MOD) % MOD); n } n long long hcomb(long long n, long long r) { n if (n == 0 && r == 0) n return 1; n else if (n < 0 || r < 0) n return 0; n else n return comb(n + r - 1, r - 1); n } n int N; n vector A; n long long dp[5050][5050]; n long long cnt[5050]; n void add(long long &a, long long b) { a = (a + b) % MOD; } n void mul(long long &a, long long b) { a = a * b % MOD; } n int main() { n cin.tie(0); n ios::sync_with_stdio(false); n cin >> N; n A.resize(N); n for (int i = 0; i < (N); ++i) cin >> A[i]; n sort(A.begin(), A.end()); n for (int i = 0; i < (N); ++i) cnt[A[i]]++; n setComb(); n dp[0][0] = 1; n for (int i = 0; i < N; i++) { n long long sum = 0; n for (int j = 0; j <= 5000; j++) { n long long res = sum; n mul(res, cnt[j]); n mul(res, inv[N - i]); n add(dp[i + 1][j], res); n sum += dp[i][j]; n } n } n long long ans = 0; n for (int i = 1; i < N; i++) { n for (int j = 0; j <= 5000; j++) { n long long res = dp[i][j]; n mul(res, cnt[j] - 1); n mul(res, inv[N - i]); n add(ans, res); n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n vector v; n vector::iterator it; n int n, q, x, count1 = 0, x1; n cin >> q; n while (q--) { n cin >> n; n while (n--) { n cin >> x; n v.push_back(x); n } n it = v.end() - 1; n x1 = *it; n for (it = v.end() - 2; it >= v.begin(); it--) { n if (*it > x1) n count1++; n else n x1 = *it; n } n cout << count1 << endl; n count1 = 0; n v.clear(); n } n } n "} +{"func_code_string": "#include n long long ans; n int F[50000001], n, m, N; n char str[10001]; n void dfs(int x, int bit, int key) { n if (x > 3) { n if (bit) F[bit] += key; n return; n } n dfs(x + 1, bit, key); n int v = str[x] - a ; n dfs(x + 1, bit | (1 << v), -key); n } n int main() { n scanf( %d , &m); n for (int i = 1; i <= m; i++) { n scanf( %s , str + 1); n dfs(1, 0, -1); n } n n = 24; n N = 1 << n; n int res = 0; n for (int i = 0; i < N; i++) res += F[i]; n for (int i = 1; i < N; i <<= 1) n for (int j = 0; j < N; j++) n if (i & j) { n F[j] += F[j - i]; n } n for (int i = 0; i < N; i++) ans ^= (long long)F[i] * F[i]; n printf( %I64d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 10, MAXM = 100; n int A[MAXN][MAXM], B[MAXN][MAXM], C[MAXN][MAXM]; n int order[MAXM]; n int ib, is; n bool cmp(int a, int b) { return B[is][a] - A[ib][a] > B[is][b] - A[ib][b]; } n int main() { n int n, m, k, ans = 0, tmp; n int cur_hold, nx, p; n int i, j, id; n scanf( %d%d%d , &n, &m, &k); n for (i = 0; i < n; ++i) { n scanf( %*s ); n for (j = 0; j < m; ++j) scanf( %d%d%d , A[i] + j, B[i] + j, C[i] + j); n } n for (ib = 0; ib < n; ++ib) n for (is = 0; is < n; ++is) n if (ib != is) { n for (j = 0; j < m; ++j) order[j] = j; n sort(order, order + m, cmp); n for (tmp = cur_hold = j = 0; j < m; ++j) { n id = order[j]; n if ((p = B[is][id] - A[ib][id]) > 0) { n nx = min(C[ib][id], k - cur_hold); n tmp += p * nx; n cur_hold += nx; n } else n break; n } n if (ans < tmp) ans = tmp; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void init() {} n void _print(long long int t) { cerr << t; } n void _print(int t) { cerr << t; } n void _print(string t) { cerr << t; } n void _print(char t) { cerr << t; } n void _print(long double t) { cerr << t; } n void _print(double t) { cerr << t; } n void _print(unsigned long long int t) { cerr << t; } n template n void _print(pair p); n template n void _print(vector v); n template n void _print(set v); n template n void _print(map v); n template n void _print(multiset v); n template n void _print(pair p) { n cerr << { ; n _print(p.first); n cerr << , ; n _print(p.second); n cerr << } ; n } n template n void _print(vector v) { n cerr << [ ; n for (T i : v) { n _print(i); n cerr << ; n } n cerr << ] ; n } n template n void _print(set v) { n cerr << [ ; n for (T i : v) { n _print(i); n cerr << ; n } n cerr << ] ; n } n template n void _print(multiset v) { n cerr << [ ; n for (T i : v) { n _print(i); n cerr << ; n } n cerr << ] ; n } n template n void _print(map v) { n cerr << [ ; n for (auto i : v) { n _print(i); n cerr << ; n } n cerr << ] ; n } n long long int round_up(long long int a, long long int b) { n return (a + b - 1) / b; n } n long long int gcd(long long int a, long long int b) { n if (b > a) { n return gcd(b, a); n } n if (b == 0) { n return a; n } n return gcd(b, a % b); n } n long long int expo(long long int a, long long int b, long long int mod) { n long long int res = 1; n while (b > 0) { n if (b & 1) res = (res * a) % mod; n a = (a * a) % mod; n b = b >> 1; n } n return res; n } n void extendgcd(long long int a, long long int b, long long int *v) { n if (b == 0) { n v[0] = 1; n v[1] = 0; n v[2] = a; n return; n } n extendgcd(b, a % b, v); n long long int x = v[1]; n v[1] = v[0] - v[1] * (a / b); n v[0] = x; n return; n } n long long int mminv(long long int a, long long int b) { n long long int arr[3]; n extendgcd(a, b, arr); n return arr[0]; n } n long long int mminvprime(long long int a, long long int b) { n return expo(a, b - 2, b); n } n bool revsort(long long int a, long long int b) { return a > b; } n void swap(int &x, int &y) { n int temp = x; n x = y; n y = temp; n } n long long int combination(long long int n, long long int r, long long int m, n long long int *fact, long long int *ifact) { n long long int val1 = fact[n]; n long long int val2 = ifact[n - r]; n long long int val3 = ifact[r]; n return (((val1 * val2) % m) * val3) % m; n } n void google(int t) { cout << Case # << t << : ; } n vector sieve(int n) { n int *arr = new int[n + 1](); n vector vect; n for (int i = 2; i <= n; i++) n if (arr[i] == 0) { n vect.push_back(i); n for (int j = 2 * i; j <= n; j += i) arr[j] = 1; n } n return vect; n } n long long int mod_add(long long int a, long long int b, long long int m) { n a = a % m; n b = b % m; n return (((a + b) % m) + m) % m; n } n long long int mod_mul(long long int a, long long int b, long long int m) { n a = a % m; n b = b % m; n return (((a * b) % m) + m) % m; n } n long long int mod_sub(long long int a, long long int b, long long int m) { n a = a % m; n b = b % m; n return (((a - b) % m) + m) % m; n } n long long int mod_div(long long int a, long long int b, long long int m) { n a = a % m; n b = b % m; n return (mod_mul(a, mminvprime(b, m), m) + m) % m; n } n void solve() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n long long int sum = 0; n long long int ans = 0; n int arr[n]; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n sum += arr[i]; n if (sum < 0) { n ans -= sum; n sum = 0; n } n } n cout << sum << n ; n } n } n int main() { n init(); n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n long long int b[100005], p[100005]; n int n, m, a; n bool check(int x) { n int temp_a = a; n for (__typeof((x)) i = (0); i < (x); i += 1) { n int t = x - 1; n if (p[i] > b[t - i]) { n if (temp_a < p[i] - b[t - i]) { n return false; n } else { n temp_a -= p[i] - b[t - i]; n } n } n } n return true; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> m >> a; n for (__typeof((n)) i = (0); i < (n); i += 1) { n cin >> b[i]; n } n for (__typeof((m)) i = (0); i < (m); i += 1) { n cin >> p[i]; n } n sort(b, b + n, greater()); n sort(p, p + m); n int l = 0, h = ((n) < (m) ? (n) : (m)), ans = 0; n while (l < h) { n int mid = (l + h + 1) / 2; n if (check(mid) == true) { n l = mid; n } else { n h = mid - 1; n } n ans = l; n } n int ans2 = 0; n for (__typeof((ans)) i = (0); i < (ans); i += 1) { n ans2 += p[i]; n } n ans2 -= a; n if (ans2 < 0) { n ans2 = 0; n } n cout << ans << << ans2; n } n "} +{"func_code_string": "#include n using namespace std; n long long a00, a01, a10, a11; n char *s; n bool isSquare(long long x, long long &res) { n long long t = sqrt(x); n for (long long i = max(t - 10, 1LL); i <= t + 10; i++) { n if (i * i == x) { n res = i; n return true; n } n } n return false; n } n bool getS(long long n0, long long n1, long long n) { n s = new char[n + 1]; n long long A01 = a01, A10 = a10; n for (long long i = 0; i < n; i++) { n if (A01 - n1 >= 0) { n s[i] = 0 ; n n0 -= 1; n A01 -= n1; n } else if (A10 - n0 >= 0) { n s[i] = 1 ; n n1 -= 1; n A10 -= n0; n } else n return false; n } n s[n] = 0 ; n if (n0 != 0 || n1 != 0 || A01 != 0 || A10 != 0) return false; n return true; n } n bool solve() { n long long t; n if (!isSquare(1 + 8 * a00, t)) return false; n vector n0; n n0.push_back((1 + t) / 2); n n0.push_back((1 - t) / 2); n if (!isSquare(1 + 8 * a11, t)) return false; n vector n1; n n1.push_back((1 + t) / 2); n n1.push_back((1 - t) / 2); n for (auto i : n0) n for (auto j : n1) { n long long n = i + j; n if (i < 0 || j < 0 || n <= 0) continue; n if (!getS(i, j, n)) continue; n return true; n } n return false; n } n int main() { n while (cin >> a00 >> a01 >> a10 >> a11) { n bool can = solve(); n printf( %s n , can ? s : Impossible ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using vi = vector; n using pii = pair; n const signed INF_ = 1001001001; n const long long INF = 1001001001001001001LL; n const long long DX[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0}, n DY[9] = {-1, 0, 1, 0, -1, 1, 1, -1, 0}; n template n ostream &operator<<(ostream &os, const vector &v) { n for (auto i = (begin(v)); i != (end(v)); ++i) n os << *i << (i == end(v) - 1 ? : ); n return os; n } n template n istream &operator>>(istream &is, vector &v) { n for (auto i = (begin(v)); i != (end(v)); ++i) is >> *i; n return is; n } n template n istream &operator>>(istream &is, pair &p) { n is >> p.first >> p.second; n return is; n } n template n bool chmax(T &a, const U &b) { n return a < b ? a = b, 1 : 0; n } n template n bool chmin(T &a, const U &b) { n return a > b ? a = b, 1 : 0; n } n template n void PSUM(T &c) { n partial_sum(begin(c), end(c), begin(c)); n } n template n using heap = priority_queue, greater>; n struct before_main_function { n before_main_function() { n cin.tie(0); n ios::sync_with_stdio(0); n cout << setprecision(15) << fixed; n } n } before_main_function; n signed main() { n long long N, M; n cin >> N >> M; n vector> g(N); n vector deg(N); n for (long long i = 0, ilen = (long long)(M); i < ilen; ++i) { n long long a, b; n cin >> a >> b; n a--, b--; n g[a].push_back(b); n g[b].push_back(a); n deg[a]++; n deg[b]++; n } n vector ans; n vector vis(N); n { n queue q; n long long st = max_element(begin(deg), end(deg)) - begin(deg); n q.push(st); n vis[st] = true; n while (q.size()) { n long long v = q.front(); n q.pop(); n for (auto &&w : g[v]) { n if (vis[w]) continue; n vis[w] = true; n ans.push_back({v + 1, w + 1}); n q.push(w); n } n } n } n for (auto &&p : ans) { n cout << p.first << << p.second << endl; n } n return (0 ^ 0 ^ 0); n } n "} +{"func_code_string": "#include n using namespace std; n int rep[2000005]; n int sz[2000005]; n void dsu(int n) { n for (int i = 0; i < n; i++) rep[i] = i, sz[i] = 1; n } n int findSet(int a) { return ((rep[a] == a) ? a : rep[a] = findSet(rep[a])); } n int mergeSet(int a, int b) { n int y = findSet(b); n int x = findSet(a); n if (x != y) { n rep[x] = y; n sz[y] += sz[x]; n sz[x] = 0; n } n } n long long int grid[1005][1005]; n int vis[1005][1005] = {0}; n vector > > v; n int n, m; n long long int k; n int dx[] = {-1, 0, 0, 1}; n int dy[] = {0, -1, 1, 0}; n int solx = -1; n int soly = -1; n long long int sol; n int cnt; n void floodfill(int x, int y) { n if (cnt < 1) return; n vis[x][y] = 1; n grid[x][y] = sol; n cnt--; n for (int i = 0; i < 4; i++) { n int newx = x + dx[i]; n int newy = y + dy[i]; n if (newx >= 0 && newx < n && newy >= 0 && newy < m && !vis[newx][newy] && n grid[newx][newy] >= sol) { n floodfill(newx, newy); n } n } n } n void solve() { n cin >> n >> m; n cin >> k; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n cin >> grid[i][j]; n v.push_back(make_pair(grid[i][j], make_pair(i, j))); n } n } n sort(v.begin(), v.end(), greater > >()); n dsu(n * m); n int i = 0, j = 0; n while (i < v.size()) { n j = i; n while (j < v.size()) { n if (v[i].first == v[j].first) { n int x = v[j].second.first; n int y = v[j].second.second; n for (int k = 0; k < 4; k++) { n int newx = x + dx[k]; n int newy = y + dy[k]; n if (newx >= 0 && newx < n && newy >= 0 && newy < m && n grid[newx][newy] >= v[j].first) { n mergeSet(newx * m + newy, x * m + y); n } n } n } else n break; n j++; n } n for (int l = i; l < j; l++) { n if (v[l].first && (k % v[l].first == 0) && n sz[findSet(v[l].second.first * m + v[l].second.second)] >= n k / v[l].first) { n solx = v[l].second.first; n soly = v[l].second.second; n sol = v[l].first; n cnt = k / v[l].first; n break; n } n } n i = j; n } n if (solx == -1 || soly == -1) n cout << NO n ; n else { n floodfill(solx, soly); n cout << YES n ; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m - 1; j++) { n if (vis[i][j]) n cout << grid[i][j] << ; n else n cout << 0 ; n } n if (vis[i][m - 1]) n cout << grid[i][m - 1] << n ; n else n cout << 0 n ; n } n } n } n int main() { n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n int k = 0; n while (1) { n k++; n if (k % m == 0) n++; n n--; n if (n == 0) break; n } n cout << k; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e5; n int edges[MAXN] = {0}; n int main() { n int n, s; n cin >> n >> s; n for (int i = 0; i < n - 1; i++) { n int a, b; n cin >> a >> b; n a--, b--; n edges[a]++, edges[b]++; n } n int amt = 0; n for (int i = 0; i < n; i++) { n if (edges[i] == 1) amt++; n } n double ans = ((double)s) / ((double)amt); n cout << fixed << setprecision(10) << ans * 2 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int v[100]; n bool cmp(int a, int b) { return a > b; } n int highest(int n) { n int i = 1, fact = 0; n while (2 * i <= n) { n i *= 2; n fact++; n } n return fact; n } n void permute(int left, int right, int pos, int last) { n if (!pos || (!last && pos == 1)) return; n int t = highest(pos); n pos -= (1 << t); n if (!last) { n left = right - t - 1; n swap(v[left + 1], v[right]); n sort(v + left + 2, v + right, cmp); n permute(left, right, pos, t); n return; n } n swap(v[left], v[right]); n --right; n if (last - t != 1) { n ++left; n sort(v + left, v + right + 1); n permute(left, right, pos + (1 << t), 0); n return; n } n permute(left, right, pos, t); n } n int main() { n int n, m, num = 1, piv = 0, pos, t; n cin >> n >> m; n for (int i = 0; i < n; ++i) v[i] = i + 1; n permute(0, n - 1, m, 0); n for (int i = 0; i < n; ++i) cout << v[i] << ; n return 0; n } n "} +{"func_code_string": "#include n class Solver { n public: n Solver() = default; n void read() { n int n; n std::cin >> n; n int left = 0; n int right = 0; n for (int i = 0; i < n; ++i) { n int x, y; n std::cin >> x >> y; n if (x < 0) n left++; n else n right++; n } n if (left <= 1 || right <= 1) n std::cout << Yes n ; n else n std::cout << No n ; n } n void solve() {} n void write() {} n }; n int main() { n Solver solver; n solver.read(); n solver.solve(); n solver.write(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int flow, n, m, S, T, tot, x, y; n int g[3000], dis[3000], pre[3000]; n int Next[50000], adj[50000], f[50000], c[50000]; n bool used[3000]; n queue q; n int ans = 0; n int calc[110][30]; n string t, s; n void add(int x, int y, int flow, int cost) { n adj[tot] = y; n c[tot] = cost; n f[tot] = flow; n Next[tot] = g[x]; n g[x] = tot++; n adj[tot] = x; n c[tot] = -cost; n f[tot] = 0; n Next[tot] = g[y]; n g[y] = tot++; n } n bool spfa() { n for (int i = 1; i <= T; i++) dis[i] = 1 << 23; n dis[S] = 0; n memset(used, 0, sizeof(used)); n while (!q.empty()) q.pop(); n q.push(S); n used[S] = true; n int p; n while (!q.empty()) { n x = q.front(); n used[x] = false; n p = g[x]; n while (p != -1) { n y = adj[p]; n if (f[p] && dis[x] + c[p] < dis[y]) { n dis[y] = dis[x] + c[p]; n pre[y] = p; n if (!used[y]) { n used[y] = true; n q.push(y); n } n } n p = Next[p]; n } n q.pop(); n } n return dis[T] != 1 << 23; n } n int path() { n int del = 1 << 23; n int p = T; n while (p != S) { n if (f[pre[p]] < del) del = f[pre[p]]; n p = adj[pre[p] ^ 1]; n } n p = T; n while (p != S) { n f[pre[p]] -= del; n f[pre[p] ^ 1] += del; n p = adj[pre[p] ^ 1]; n } n flow += del; n return del * dis[T]; n } n void solve() { n memset(pre, 0, sizeof(pre)); n while (spfa()) ans += path(); n if (flow != t.size()) n cout << -1 << endl; n else n cout << ans << endl; n } n int main() { n cin >> t; n cin >> n; n memset(g, -1, sizeof(g)); n tot = 0; n S = 26 * (n + 1) + n + 1; n T = S + 1; n for (int i = 1; i <= n; i++) { n cin >> s >> x; n for (int j = 0; j < s.size(); j++) calc[i][s[j] - a ]++; n add(S, 26 * (n + 1) + i, x, 0); n } n for (int i = 0; i < t.size(); i++) calc[n + 1][t[i] - a ]++; n for (int i = 0; i < 26; i++) add(26 * n + i + 1, T, calc[n + 1][i], 0); n for (int i = 1; i <= n; i++) n for (int j = 0; j < 26; j++) { n add(26 * (n + 1) + i, (i - 1) * 26 + j + 1, 1 << 23, 0); n add((i - 1) * 26 + j + 1, 26 * n + j + 1, calc[i][j], i); n } n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n clock_t clk_begin = clock(); n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int n; n cin >> n; n string s; n cin >> s; n int c = 0; n for (int i = 0; i < n; ++i) n if (s[i] == 8 ) c++; n n /= 11; n cout << min(n, c) << n ; n ; n cerr << Time taken: << (double)(clock() - clk_begin) / CLOCKS_PER_SEC n << n ; n return 0; n ; n } n "} +{"func_code_string": "#include n using namespace std; n int form[9], piece[9][2]; n map res; n string result[] = { n illegal , the first player won , the second player won , draw , first , n second }; n void pre() { n form[0] = 3; n piece[0][0] = 1; n piece[0][1] = 1 << 1; n for (int i = 1; i < 9; i++) { n form[i] = form[i - 1] << 2; n piece[i][0] = piece[i - 1][0] << 2; n piece[i][1] = piece[i - 1][1] << 2; n } n } n int add(int now, int p, int who, bool end) { n int px = p / 3 * 3, py = p % 3; n if ((piece[px][who] & now) && (piece[px + 1][who] & now) && n (piece[px + 2][who] & now)) n return who + 1; n if ((piece[py][who] & now) && (piece[py + 3][who] & now) && n (piece[py + 6][who] & now)) n return who + 1; n if ((p == 0 || p == 4 || p == 8) && (piece[0][who] & now) && n (piece[4][who] & now) && (piece[8][who] & now)) n return who + 1; n if ((p == 2 || p == 4 || p == 6) && (piece[2][who] & now) && n (piece[4][who] & now) && (piece[6][who] & now)) n return who + 1; n return end ? 3 : 5 - who; n } n void enumeration(int now, int who, int round) { n for (int p = 0; p < 9; p++) { n if (now & form[p]) continue; n now ^= piece[p][who]; n if (!res[now]) { n res[now] = add(now, p, who, round == 9); n if (res[now] > 3) enumeration(now, who ^ 1, round + 1); n } n now ^= piece[p][who]; n } n } n int main() { n int now = 0; n char ch; n pre(); n enumeration(now, 0, 1); n for (int p = 0; p < 9; p++) { n cin >> ch; n if (ch == X ) n now ^= piece[p][0]; n else if (ch == 0 ) n now ^= piece[p][1]; n } n cout << result[res[now]] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int parent(int x, vector &v) { n return v[x] = (v[x] == x ? x : parent(v[x], v)); n } n void u(int x, int y, vector &v, vector &r) { n x = parent(x, v); n y = parent(y, v); n if (r[x] == r[y]) { n if (x == y) { n return; n } n r[x]++; n } n if (r[x] > r[y]) { n v[y] = x; n } else { n v[x] = y; n } n return; n } n int main() { n int n; n scanf( %d n , &n); n vector v(26, -1); n vector r(26); n string s; n for (int i = 0; i < n; i++) { n cin >> s; n if (v[s[0] - a ] == -1) { n v[s[0] - a ] = s[0] - a ; n } n for (int i = 1; i < (int)s.size(); i++) { n if (v[s[i] - a ] == -1) { n v[s[i] - a ] = s[i] - a ; n } n u(s[i] - a , s[0] - a , v, r); n } n } n unordered_map h; n for (int i = 0; i < 26; i++) { n if (v[i] != -1) { n h[parent(v[i], v)] = 1; n } n } n cout << h.size(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[105], b[105]; n int main() { n int n, i, j, k, x, y; n while (~scanf( %d , &n)) { n for (i = 1; i <= n; i++) { n scanf( %d , &a[i]); n } n scanf( %d%d , &x, &y); n for (i = 1, j = 0; i <= n; i++) { n int count1 = 0, count2 = 0; n for (k = 1; k <= n; k++) { n if (k >= i) n count1 += a[k]; n else n count2 += a[k]; n } n if ((count1 >= x && count1 <= y) && (count2 >= x && count2 <= y)) { n b[j++] = i; n break; n } n } n if (j == 0) { n printf( 0 n ); n continue; n } n printf( %d n , b[0]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n vector> a(n, vector(m, 0)); n vector> b(n, vector(m, 0)); n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n cin >> a[i][j]; n } n } n vector> ans; n for (int i = 0; i < n - 1; i++) { n for (int j = 0; j < m - 1; j++) { n if (a[i][j] == 1 && a[i][j + 1] == 1 && a[i + 1][j + 1] == 1 && n a[i + 1][j] == 1) { n ans.push_back(make_pair(i, j)); n b[i][j] = 1; n b[i][j + 1] = 1; n b[i + 1][j + 1] = 1; n b[i + 1][j] = 1; n } n } n } n bool flag = true; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (a[i][j] != b[i][j]) { n flag = false; n i = n; n break; n } n } n } n if (flag) { n cout << ans.size() << endl; n for (auto it = ans.begin(); it != ans.end(); it++) { n cout << (*it).first + 1 << << (*it).second + 1 << endl; n } n } else n cout << -1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void smin(T &a, const U &b) { n if (a > b) a = b; n } n template n inline void smax(T &a, const U &b) { n if (a < b) a = b; n } n template n inline void gn(T &first) { n char c, sg = 0; n while (c = getchar(), (c > 9 || c < 0 ) && c != - ) n ; n for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; n c = getchar()) n first = (first << 1) + (first << 3) + c - 0 ; n if (sg) first = -first; n } n template n inline void gn(T1 &x1, T2 &x2) { n gn(x1), gn(x2); n } n int power(int a, int b, int m, int ans = 1) { n for (; b; b >>= 1, a = 1LL * a * a % m) n if (b & 1) ans = 1LL * ans * a % m; n return ans; n } n vector adj[500500]; n int can0[500500], can1[500500], dp0[500500], dp1[500500]; n int dp[4]; n int n, sz[500500]; n void dfs(int u, int f = 0) { n sz[u] = 1; n for (int v : adj[u]) n if (v != f) dfs(v, u), sz[u] += sz[v]; n can0[u] = 1; n dp[0] = 1, dp[1] = 0; n for (int v : adj[u]) { n if (v == f) continue; n can0[u] &= can1[v]; n int t[2] = {dp[0], dp[1]}; n dp[0] = t[0] * can1[v]; n dp[1] = t[0] * can0[v] + t[1] * can1[v]; n } n can1[u] = dp[1]; n dp[0] = 1, dp[1] = 0; n for (int v : adj[u]) { n if (v == f) continue; n int t[2] = {dp[0], dp[1]}; n dp[0] = t[0] * can1[v]; n dp[1] = t[1] * can1[v] + t[0] * dp1[v]; n } n dp0[u] = dp[1]; n dp1[u] = can0[u]; n dp[0] = 1, dp[1] = 0; n for (int v : adj[u]) { n if (v == f) continue; n int t[2] = {dp[0], dp[1]}; n dp[0] = t[0] * can1[v]; n dp[1] = t[1] * can1[v] + t[0] * dp0[v]; n } n dp1[u] += dp[1]; n dp[0] = 1, dp[1] = dp[2] = dp[3] = 0; n for (int v : adj[u]) { n if (v == f) continue; n int t[4] = {dp[0], dp[1], dp[2], dp[3]}; n dp[0] = t[0] * can1[v]; n dp[1] = t[0] * can0[v] + t[1] * can1[v]; n dp[2] = t[0] * dp1[v] + t[2] * can1[v]; n dp[3] = t[1] * dp1[v] + t[2] * can0[v] + t[3] * can1[v]; n } n dp1[u] += dp[3]; n } n long long ans; n int c0[500500], c1[500500], d0[500500], d1[500500]; n int R[500500], Rdp[500500][4]; n void redfs(int u, int f = 0) { n if (f) { n if (can1[u] && c1[u]) n ans += (long long)sz[u] * (n - sz[u]); n else n ans += (long long)dp1[u] * d1[u]; n } n R[adj[u].size()] = 1; n Rdp[adj[u].size()][0] = 1; n Rdp[adj[u].size()][1] = 0; n for (int i = adj[u].size(); i--;) { n int v = adj[u][i]; n R[i] = R[i + 1] & (v == f ? c1[u] : can1[v]); n Rdp[i][0] = Rdp[i + 1][0] * (v == f ? c1[u] : can1[v]); n Rdp[i][1] = Rdp[i + 1][0] * (v == f ? c0[u] : can0[v]) + n Rdp[i + 1][1] * (v == f ? c1[u] : can1[v]); n } n int cur = 1; n dp[0] = 1, dp[1] = 0; n for (int i = 0; i < adj[u].size(); i++) { n int v = adj[u][i]; n if (v != f) { n c0[v] = cur & R[i + 1]; n c1[v] = dp[0] & Rdp[i + 1][1] | dp[1] & Rdp[i + 1][0]; n } n int t[2] = {dp[0], dp[1]}; n cur &= (v == f ? c1[u] : can1[v]); n dp[0] = t[0] * (v == f ? c1[u] : can1[v]); n dp[1] = n t[0] * (v == f ? c0[u] : can0[v]) + t[1] * (v == f ? c1[u] : can1[v]); n } n Rdp[adj[u].size()][0] = 1; n Rdp[adj[u].size()][1] = 0; n for (int i = adj[u].size(); i--;) { n int v = adj[u][i]; n Rdp[i][0] = Rdp[i + 1][0] * (v == f ? c1[u] : can1[v]); n Rdp[i][1] = Rdp[i + 1][0] * (v == f ? d1[u] : dp1[v]) + n Rdp[i + 1][1] * (v == f ? c1[u] : can1[v]); n } n dp[0] = 1, dp[1] = 0; n for (int i = 0; i < adj[u].size(); i++) { n int v = adj[u][i]; n if (v != f) d0[v] = dp[0] * Rdp[i + 1][1] + dp[1] * Rdp[i + 1][0]; n int t[2] = {dp[0], dp[1]}; n dp[0] = t[0] * (v == f ? c1[u] : can1[v]); n dp[1] = n t[1] * (v == f ? c1[u] : can1[v]) + t[0] * (v == f ? d1[u] : dp1[v]); n } n for (int v : adj[u]) n if (v != f) d1[v] = c0[v]; n Rdp[adj[u].size()][0] = 1; n Rdp[adj[u].size()][1] = 0; n for (int i = adj[u].size(); i--;) { n int v = adj[u][i]; n Rdp[i][0] = Rdp[i + 1][0] * (v == f ? c1[u] : can1[v]); n Rdp[i][1] = Rdp[i + 1][0] * (v == f ? d0[u] : dp0[v]) + n Rdp[i + 1][1] * (v == f ? c1[u] : can1[v]); n } n dp[0] = 1, dp[1] = 0; n for (int i = 0; i < adj[u].size(); i++) { n int v = adj[u][i]; n if (v != f) d1[v] += dp[0] * Rdp[i + 1][1] + dp[1] * Rdp[i + 1][0]; n int t[2] = {dp[0], dp[1]}; n dp[0] = t[0] * (v == f ? c1[u] : can1[v]); n dp[1] = n t[1] * (v == f ? c1[u] : can1[v]) + t[0] * (v == f ? d0[u] : dp0[v]); n } n Rdp[adj[u].size()][0] = 1; n Rdp[adj[u].size()][1] = 0; n Rdp[adj[u].size()][2] = 0; n Rdp[adj[u].size()][3] = 0; n for (int i = adj[u].size(); i--;) { n int v = adj[u][i]; n Rdp[i][0] = Rdp[i + 1][0] * (v == f ? c1[u] : can1[v]); n Rdp[i][1] = Rdp[i + 1][0] * (v == f ? c0[u] : can0[v]) + n Rdp[i + 1][1] * (v == f ? c1[u] : can1[v]); n Rdp[i][2] = Rdp[i + 1][0] * (v == f ? d1[u] : dp1[v]) + n Rdp[i + 1][2] * (v == f ? c1[u] : can1[v]); n Rdp[i][3] = Rdp[i + 1][1] * (v == f ? d1[u] : dp1[v]) + n Rdp[i + 1][2] * (v == f ? c0[u] : can0[v]) + n Rdp[i + 1][3] * (v == f ? c1[u] : can1[v]); n } n dp[0] = 1, dp[1] = dp[2] = dp[3] = 0; n for (int i = 0; i < adj[u].size(); i++) { n int v = adj[u][i]; n if (v != f) n d1[v] += dp[0] * Rdp[i + 1][3] + dp[1] * Rdp[i + 1][2] + n dp[2] * Rdp[i + 1][1] + dp[3] * Rdp[i + 1][0]; n int t[4] = {dp[0], dp[1], dp[2], dp[3]}; n dp[0] = t[0] * (v == f ? c1[u] : can1[v]); n dp[1] = n t[0] * (v == f ? c0[u] : can0[v]) + t[1] * (v == f ? c1[u] : can1[v]); n dp[2] = n t[0] * (v == f ? d1[u] : dp1[v]) + t[2] * (v == f ? c1[u] : can1[v]); n dp[3] = t[1] * (v == f ? d1[u] : dp1[v]) + n t[2] * (v == f ? c0[u] : can0[v]) + n t[3] * (v == f ? c1[u] : can1[v]); n } n for (int v : adj[u]) n if (v != f) redfs(v, u); n } n int main() { n cin >> n; n for (int i = 1; i < n; i++) { n int u, v; n gn(u, v); n adj[u].push_back(v); n adj[v].push_back(u); n } n dfs(1); n redfs(1); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using pii = pair; n n void solve() { n int m, k; n cin >> m >> k; n n vector a; n n int ai; n for (int i = 1; i <= k; i++) { n cin >> ai; n a.push_back({ai, i}); n } n n sort(a.begin(), a.end(), greater()); n n int n = 1; n for (; ; n++) { n if (m > n * n - (n / 2) * (n / 2)) continue; n if (a[0].first > n * ((n + 1) / 2)) continue; n break; n } n n vector pos[3]; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n int idx = ((i & 1) << 1) + (j & 1); n if (idx != 3) n pos[idx].push_back({i, j}); n } n } n n vector> ans(n, vector(n, 0)); n n for (auto [cnt, val] : a) { n vector &curr = pos[1].empty() ? pos[2] : pos[1]; n n for (; !curr.empty() && cnt > 0; cnt--) { n auto [x, y] = curr.back(); n curr.pop_back(); n ans[x][y] = val; n } n for (; cnt > 0; cnt--) { n auto [x, y] = pos[0].back(); n pos[0].pop_back(); n ans[x][y] = val; n } n } n n cout << n << n ; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n cout << ans[i][j] << ; n } n cout << n ; n } n } n n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n n int t; n cin >> t; n n while (t--) { n solve(); n } n n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 211, M = N * N / 2; n int u[M], v[M], w[M]; n int f[N][N]; n bool check(int n, int m, int lim) { n for (int i = 1; i <= m; i++) { n vector> v; n bool t = 1; n for (int j = 1; j <= n; j++) { n int l = f[j][u[i]], r = f[j][::v[i]]; n if (lim >= l && lim >= r) { n if (2 * lim - l - r >= w[i]) { n v.push_back({0, 1}); n v.push_back({w[i] + 1, -1}); n } else { n v.push_back({0, 1}); n v.push_back({min(w[i], lim - l) + 1, -1}); n v.push_back({w[i] - min(w[i], lim - r), 1}); n v.push_back({w[i] + 1, -1}); n } n } else if (lim >= l) { n v.push_back({0, 1}); n v.push_back({min(w[i], lim - l) + 1, -1}); n } else if (lim >= r) { n v.push_back({w[i] - min(w[i], lim - r), 1}); n v.push_back({w[i] + 1, -1}); n } else { n t = 0; n break; n } n } n if (!t) continue; n sort(v.begin(), v.end()); n int cnt = 0; n for (auto e : v) { n cnt += e.second; n if (cnt == n) return 1; n } n } n return 0; n } n int main() { n ios ::sync_with_stdio(0); n int n, m; n cin >> n >> m; n memset(f, 0x3f, sizeof f); n for (int i = 1; i <= n; i++) f[i][i] = 0; n for (int i = 1; i <= m; i++) { n cin >> u[i] >> v[i] >> w[i]; n w[i] *= 2; n f[u[i]][v[i]] = f[v[i]][u[i]] = w[i]; n } n for (int k = 1; k <= n; k++) n for (int i = 1; i <= n; i++) n for (int j = 1; j <= n; j++) f[i][j] = min(f[i][j], f[i][k] + f[k][j]); n int l = 0, r = 1e8L; n while (l + 1 < r) { n int im = (l + r) / 2; n if (check(n, m, im - 1)) n r = im; n else n l = im; n } n cout << fixed << setprecision(1); n cout << l / 2.0 << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int ans1, ans2; n int t[4], v[4][10], T[10][10], A, B, C; n map mymap; n const char *help[] = { Anka , Chapay , Cleo , Troll , n Dracul , Snowy , Hexadecimal }; n int countT() { n int ret = 0; n for (int k = 0; k < 3; k++) { n for (int i = 0; i < t[k]; i++) n for (int j = 0; j < t[k]; j++) n if (T[v[k][i]][v[k][j]]) ret++; n } n return ret; n } n void go(int x) { n if (x == 8) { n if (!t[0] || !t[1] || !t[2]) return; n int h[4]; n h[0] = A / t[0]; n h[1] = B / t[1]; n h[2] = C / t[2]; n sort(h, h + 3); n int d = h[2] - h[0]; n int p = countT(); n if (d < ans1) { n ans1 = d; n ans2 = p; n } else if (d == ans1) { n ans2 = max(ans2, p); n } n return; n } n for (int i = 0; i < 3; i++) { n v[i][t[i]++] = x; n go(x + 1); n t[i]--; n } n return; n } n int main() { n char s1[30], s2[30], s3[30]; n for (int i = 0; i < 7; i++) mymap[help[i]] = i + 1; n memset(T, 0, sizeof(T)); n int m; n cin >> m; n while (m--) { n cin >> s1 >> s2 >> s3; n int u, v; n u = mymap[s1]; n v = mymap[s3]; n T[u][v] = 1; n } n cin >> A >> B >> C; n ans1 = 2000000001; n ans2 = 0; n memset(t, 0, sizeof(t)); n go(1); n cout << ans1 << << ans2 << endl; n return 0; n } n "} +{"func_code_string": "#include n typedef long long ll ; n using namespace std; n const int maxn=2e5+5; n const int maxm=5e6+5; n #define P pair n #define fi first n #define se second n int t,n; n int a[maxn]; n int vis[maxm*2]; n P mp[maxm]; n n n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr), cout.tie(nullptr); n cin>>n; n for(int i=1;i<=n;i++){ n cin>>a[i]; n } n int sum1; n for(int i=1;i<=n;i++){ n for(int j=i+1;j<=n;j++){ n sum1=a[i]+a[j]; n if(mp[sum1].fi==0 &&mp[sum1].se==0){ n mp[sum1]={i,j}; n }else if(i!=mp[sum1].fi&&i!=mp[sum1].se&&j!=mp[sum1].fi&&j!=mp[sum1].se){ n cout<< YES < n using namespace std; n template n T BigMod(T b, T p, T m) { n if (p == 0) return 1; n if (p % 2 == 0) { n T s = BigMod(b, p / 2, m); n return ((s % m) * (s % m)) % m; n } n return ((b % m) * (BigMod(b, p - 1, m) % m)) % m; n } n template n T ModInv(T b, T m) { n return BigMod(b, m - 2, m); n } n template n T in() { n char ch; n T n = 0; n bool ng = false; n while (1) { n ch = getchar(); n if (ch == - ) { n ng = true; n ch = getchar(); n break; n } n if (ch >= 0 && ch <= 9 ) break; n } n while (1) { n n = n * 10 + (ch - 0 ); n ch = getchar(); n if (ch < 0 || ch > 9 ) break; n } n return (ng ? -n : n); n } n template n T POW(T B, T printf) { n if (printf == 0) return 1; n if (printf & 1) n return B * POW(B, printf - 1); n else n return (POW(B, printf / 2) * POW(B, printf / 2)); n } n template n T Bigmod(T b, T p, T m) { n if (p == 0) n return 1; n else if (!(p & 1)) n return (Bigmod(b, p / 2, m) * Bigmod(b, p / 2, m)) % m; n else n return ((b % m) * Bigmod(b, p - 1, m)) % m; n } n template n T Dis(T x1, T y1, T x2, T y2) { n return sqrt((x1 - x2 * x1 - x2) + (y1 - y2 * y1 - y2)); n } n template n T Angle(T x1, T y1, T x2, T y2) { n return atan(double(y1 - y2) / double(x1 - x2)); n } n template n T DIFF(T a, T b) { n T d = a - b; n if (d < 0) n return -d; n else n return d; n } n template n T ABS(T a) { n if (a < 0) n return -a; n else n return a; n } n template n T gcd(T a, T b) { n if (a < 0) return gcd(-a, b); n if (b < 0) return gcd(a, -b); n return (b == 0) ? a : gcd(b, a % b); n } n template n T lcm(T a, T b) { n if (a < 0) return lcm(-a, b); n if (b < 0) return lcm(a, -b); n return a * (b / gcd(a, b)); n } n template n T euclide(T a, T b, T &x, T &y) { n if (a < 0) { n T d = euclide(-a, b, x, y); n x = -x; n return d; n } n if (b < 0) { n T d = euclide(a, -b, x, y); n y = -y; n return d; n } n if (b == 0) { n x = 1; n y = 0; n return a; n } else { n T d = euclide(b, a % b, x, y); n T t = x; n x = y; n y = t - (a / b) * y; n return d; n } n } n template n void ia(T a[], int n) { n for (int i = 0; i < n; i++) cin >> a[i]; n } n template n void pa(T a[], int n) { n for (int i = 0; i < n - 1; i++) cout << a[i] << ; n cout << a[n - 1] << endl; n } n template n long long int isLeft(T a, T b, T c) { n return (a.x - b.x) * (b.y - c.y) - (b.x - c.x) * (a.y - b.y); n } n int Set(int N, int pos) { return N = N | (1 << pos); } n int Reset(int N, int pos) { return N = N & ~(1 << pos); } n bool Check(int N, int pos) { return (bool)(N & (1 << pos)); } n template n inline T togglebit(T a, first i) { n T t = 1; n return (a ^ (t << i)); n } n int toInt(string s) { n int sm; n stringstream ss(s); n ss >> sm; n return sm; n } n int toLlint(string s) { n long long int sm; n stringstream ss(s); n ss >> sm; n return sm; n } n int cdigittoint(char ch) { return ch - 0 ; } n bool isVowel(char ch) { n ch = toupper(ch); n if (ch == A || ch == U || ch == I || ch == O || ch == E ) n return true; n return false; n } n bool isConst(char ch) { n if (isalpha(ch) && !isVowel(ch)) return true; n return false; n } n double DEG(double x) { return (180.0 * x) / (2.0 * acos(0.0)); } n double RAD(double x) { return (x * (double)2.0 * acos(0.0)) / (180.0); } n vector adj[200007], dag[200007], par[200007]; n int DP[200007][18], siz[200007]; n long long int dis[200007]; n int L[200007]; n int inDeg[200007]; n bool vis[200007]; n void Init(int n) { n for (int i = 0; i <= n; i++) { n dis[i] = 1LL << 60; n adj[i].clear(); n dag[i].clear(); n par[i].clear(); n inDeg[i] = siz[i] = vis[i] = 0; n for (int j = 0; j < 18; j++) DP[i][j] = -1; n } n } n void Update(int u, int p) { n DP[u][0] = p; n L[u] = L[p] + 1; n adj[p].push_back(u); n for (int i = 1; i < 18; i++) n if (DP[u][i - 1] != -1) DP[u][i] = DP[DP[u][i - 1]][i - 1]; n } n int LCA(int p, int q) { n if (L[p] < L[q]) swap(p, q); n for (int i = 18 - 1; i >= 0; i--) n if (L[p] - (1 << i) >= L[q]) p = DP[p][i]; n if (p == q) return p; n for (int i = 18 - 1; i >= 0; i--) n if (DP[p][i] != -1 && DP[p][i] != DP[q][i]) { n p = DP[p][i]; n q = DP[q][i]; n } n return DP[p][0]; n } n void Dijkstra(int n, int s) { n set > pq; n pq.insert(make_pair(0, s)); n dis[s] = 0; n L[s] = 1; n while (!pq.empty()) { n pair tmp = *pq.begin(); n pq.erase(pq.begin()); n int u = tmp.second; n for (int i = 0; i < adj[u].size(); i += 2) { n int v = adj[u][i]; n int w = adj[u][i + 1]; n if (dis[v] > dis[u] + w) { n dis[v] = dis[u] + w; n pq.insert(make_pair(dis[v], v)); n } n } n } n for (int i = 1; i <= n; i++) { n for (int j = 0; j < adj[i].size(); j += 2) { n int v = adj[i][j]; n int w = adj[i][j + 1]; n if (dis[i] + w == dis[v]) { n inDeg[v]++; n dag[i].push_back(v); n par[v].push_back(i); n } n } n adj[i].clear(); n } n } n void TopSort(int s) { n queue q; n q.push(s); n L[s] = 1; n while (!q.empty()) { n int u = q.front(); n q.pop(); n if (!par[u].empty()) { n int lca = par[u][0]; n for (int i = 1; i < par[u].size(); i++) { n lca = LCA(lca, par[u][i]); n } n Update(u, lca); n } n for (int i = 0; i < dag[u].size(); i++) { n int v = dag[u][i]; n inDeg[v]--; n if (!inDeg[v]) q.push(v); n } n } n } n void Dfs(int u) { n siz[u] = 1; n vis[u] = 1; n for (int i = 0; i < adj[u].size(); i++) { n Dfs(adj[u][i]); n siz[u] += siz[adj[u][i]]; n } n } n int main() { n int n, m, s; n scanf( %d%d%d , &n, &m, &s); n Init(n); n for (int i = 1; i <= m; i++) { n int u, v, w; n scanf( %d%d%d , &u, &v, &w); n adj[u].push_back(v); n adj[u].push_back(w); n adj[v].push_back(u); n adj[v].push_back(w); n } n Dijkstra(n, s); n TopSort(s); n Dfs(s); n int mx = 0; n for (int i = 1; i <= n; i++) { n if (i != s) mx = max(mx, siz[i]); n } n cout << mx << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 2048; n char s[M], b[M], e[M], fb[M], fe[M]; n int r[2][M], *p = r[0], *q = r[1], h[M]; n int main(void) { n cin >> s >> b >> e; n int ns = strlen(s), nb = strlen(b), ne = strlen(e), nn = nb > ne ? nb : ne, n w = 0; n for (int i = ns; i-- > 0;) { n if (!strncmp(s + i, b, nb)) fb[i] = 1; n if (!strncmp(s + i, e, ne)) fe[i] = 1; n } n for (int i = 0, *t; i < ns; ++i, t = p, p = q, q = t) n for (int j = i; j-- > 0;) { n q[j + 1] = (s[i] == s[j]) ? (p[j] + 1) : 0; n if (h[i] < q[j + 1]) h[i] = q[j + 1]; n } n for (int i = ns; i-- > 0;) n if (fb[i]) n for (int j = i + nn; j <= ns; ++j) n if (fe[j - ne] && h[j - 1] < j - i) ++w; n cout << w << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n int inv[25]; n long long a[25]; n int power(int a, int b) { n int c = 1; n for (; b; b >>= 1) { n if (b & 1) c = (long long)c * a % mod; n a = (long long)a * a % mod; n } n return c; n } n int C(long long y, int x) { n if (y < 0 || x < 0 || y < x) return 0; n y %= mod; n if (y == 0 || x == 0) return 1; n int ans = 1; n for (int i = 0; i < x; i++) ans = (long long)ans * (y - i) % mod; n for (int i = 1; i <= x; i++) ans = (long long)ans * inv[i] % mod; n return ans; n } n int main() { n int n; n long long m; n long long ans = 0; n for (int i = 1; i <= 20; i++) inv[i] = power(i, mod - 2); n cin >> n >> m; n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int x = 0; x < (1 << n); x++) { n if (x == 0) n ans = (ans + C(n + m - 1, n - 1)) % mod; n else { n long long t = n + m; n int p = 0; n for (int i = 0; i < n; i++) n if ((x >> i) & 1) { n p++; n t -= a[i + 1]; n } n t -= (p + 1); n if (p & 1) n ans = (ans - C(t, n - 1)) % mod; n else n ans = (ans + C(t, n - 1)) % mod; n } n } n cout << (ans + mod) % mod << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n string print_iterable(T1 begin_iter, T2 end_iter, int counter) { n bool done_something = false; n stringstream res; n res << [ ; n for (; begin_iter != end_iter and counter; ++begin_iter) { n done_something = true; n counter--; n res << *begin_iter << , ; n } n string str = res.str(); n if (done_something) { n str.pop_back(); n str.pop_back(); n } n str += ] ; n return str; n } n vector SortIndex(int size, std::function compare) { n vector ord(size); n for (int i = 0; i < size; i++) ord[i] = i; n sort(ord.begin(), ord.end(), compare); n return ord; n } n template n bool MinPlace(T& a, const T& b) { n if (a > b) { n a = b; n return true; n } n return false; n } n template n bool MaxPlace(T& a, const T& b) { n if (a < b) { n a = b; n return true; n } n return false; n } n const int MAXN = 100100; n int a[MAXN]; n int pr[MAXN]; n int last_apparizione[MAXN]; n int N; n int res[MAXN]; n int EasyCalc(int k) { n if (res[k]) return res[k]; n int ris = 1; n int curr_start = 0; n int curr_size = 1; n for (int i = 1; i < N; i++) { n curr_size += curr_start > pr[i]; n if (curr_size > k) { n curr_size = 1; n curr_start = i; n ris++; n } n } n return ris; n } n int main() { n ios::sync_with_stdio(false); n cin >> N; n for (int i = 0; i < N; i++) cin >> a[i]; n for (int i = 0; i < MAXN; i++) last_apparizione[i] = -1; n for (int i = 0; i < N; i++) { n pr[i] = last_apparizione[a[i]]; n last_apparizione[a[i]] = i; n } n int rad = min((int)(2 * sqrt(N)), N); n for (int k = 1; k <= rad; k++) res[k] = EasyCalc(k); n int curr = rad; n while (curr <= N) { n int l = curr + 1; n int r = N + 1; n while (l < r) { n int m = (l + r) / 2; n res[m] = EasyCalc(m); n if (res[m] == res[curr]) n l = m + 1; n else n r = m; n } n int prox = l; n for (int i = curr + 1; i < prox; i++) res[i] = res[curr]; n curr = prox; n } n for (int k = 1; k <= N; k++) cout << res[k] << ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, ans = 0; n cin >> n; n for (int i = 0; i < n; i++) { n int x, y, z; n cin >> x >> y >> z; n ans += (x + y + z >= 2); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char str[1010]; n int pri[510][510]; n int pre[510][510]; n int f[510][510]; n bool v[510] = {0}; n int N; n void init() { n gets(str); n scanf( %d , &N); n } n void prework() { n int len = strlen(str); n for (int i = 0; i < len; ++i) n for (int j = 0; j < len; ++j) { n int p = 0; n int tmp = 0; n while (i + p < j - p) { n if (str[i + p] != str[j - p]) tmp++; n p++; n } n pri[i + 1][j + 1] = tmp; n } n } n void dp() { n int len = strlen(str); n memset(f, 10, sizeof(f)); n f[0][0] = 0; n for (int i = 1; i <= len; ++i) { n for (int j = 1; j <= N; ++j) n for (int k = 0; k < i; ++k) { n if (f[i][j] > f[k][j - 1] + pri[k + 1][i]) { n f[i][j] = f[k][j - 1] + pri[k + 1][i]; n pre[i][j] = k; n } n } n } n int Ans = 1000000000; n int p; n for (int i = 1; i <= N; ++i) n if (f[len][i] < Ans) { n Ans = f[len][i]; n p = i; n } n printf( %d n , Ans); n int q = len; n while (q != 0) { n v[pre[q][p]] = 1; n int x = 0; n while (pre[q][p] + x < q - 1 - x) { n str[pre[q][p] + x] = str[q - 1 - x]; n x++; n } n q = pre[q][p]; n p--; n } n v[0] = 0; n for (int i = 0; i < len; ++i) { n if (v[i]) putchar( + ); n putchar(str[i]); n } n } n int main() { n init(); n prework(); n dp(); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( unroll-loops ) n #pragma GCC target( n sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) n using namespace std; n template n void ckmin(T1 &a, T2 b) { n if (a > b) a = b; n } n template n void ckmax(T1 &a, T2 b) { n if (a < b) a = b; n } n int read() { n int x = 0, f = 0; n char ch = getchar(); n while (!isdigit(ch)) f |= ch == - , ch = getchar(); n while (isdigit(ch)) x = 10 * x + ch - 0 , ch = getchar(); n return f ? -x : x; n } n template n void print(T x) { n if (x < 0) putchar( - ), x = -x; n if (x >= 10) print(x / 10); n putchar(x % 10 + 0 ); n } n template n void print(T x, char let) { n print(x), putchar(let); n } n const int mod = 998244353; n const int G = 3, Gi = 332748118; n int add(int x, int y) { n if ((x += y) >= mod) x -= mod; n return x; n } n int sub(int x, int y) { n if ((x -= y) < 0) x += mod; n return x; n } n int qpow(int a, int b = mod - 2) { n int res = 1; n while (b > 0) { n if (b & 1) res = 1ll * res * a % mod; n a = 1ll * a * a % mod; n b >>= 1; n } n return res; n } n namespace Poly { n vector Rev, W; n int lim, L; n void getR(int len) { n lim = 1, L = 0; n while (lim <= len) lim <<= 1, L++; n Rev.resize(lim), W.resize(lim), W[0] = 1; n for (int i = 0; i < lim; i++) n Rev[i] = (Rev[i >> 1] >> 1) | ((i & 1) << L - 1); n } n void wf(vector &a) { n int n = a.size(); n for (int i = 0; i < n; i++) a[i] = 1ll * (i + 1) * a[i + 1] % mod; n a[n - 1] = 0; n } n void jf(vector &a) { n int n = a.size(); n for (int i = n - 1; i >= 1; i--) a[i] = 1ll * a[i - 1] * qpow(i) % mod; n a[0] = 0; n } n void NTT(vector &a, int opt) { n for (int i = 0; i < lim; i++) n if (i < Rev[i]) swap(a[i], a[Rev[i]]); n for (int mid = 1; mid < lim; mid <<= 1) { n int Wn = qpow(opt == 1 ? G : Gi, (mod - 1) / (mid << 1)); n for (int k = 1; k < mid; k++) W[k] = 1ll * W[k - 1] * Wn % mod; n for (int j = 0; j < lim; j += mid << 1) { n for (int k = 0; k < mid; k++) { n int x = a[j + k], y = 1ll * W[k] * a[j + k + mid] % mod; n a[j + k] = add(x, y); n a[j + k + mid] = sub(x, y); n } n } n } n if (opt == -1) { n int linv = qpow(lim); n for (int i = 0; i < lim; i++) a[i] = 1ll * a[i] * linv % mod; n } n } n vector operator*(vector a, vector b) { n int len = a.size() + b.size() - 1; n getR(len); n a.resize(lim), b.resize(lim); n NTT(a, 1), NTT(b, 1); n for (int i = 0; i < lim; i++) a[i] = 1ll * a[i] * b[i] % mod; n NTT(a, -1); n a.resize(len); n return a; n } n vector Inv(vector a) { n if ((int(a.size())) == 1) return vector(1, qpow(a[0])); n int len = a.size(); n vector ta = a; n ta.resize((len + 1) / 2); n vector tb = Inv(ta); n getR(2 * len), a.resize(lim), tb.resize(lim); n NTT(a, 1), NTT(tb, 1); n for (int i = 0; i < lim; i++) n tb[i] = 1ll * tb[i] * (mod + 2 - 1ll * a[i] * tb[i] % mod) % mod; n NTT(tb, -1); n tb.resize(len); n return tb; n } n vector Ln(vector a) { n vector ta = a; n wf(ta); n int len = a.size(); n a = ta * Inv(a), jf(a); n a.resize(len); n return a; n } n vector Exp(vector a) { n if ((int(a.size())) == 1) return vector(1, 1); n int len = a.size(); n vector ta = a; n ta.resize((len + 1) / 2); n vector tb = Exp(ta); n tb.resize(len); n vector Lnb = Ln(tb); n assert(Lnb.size() == len); n for (int i = 0; i < len; i++) Lnb[i] = (a[i] - Lnb[i] + mod) % mod; n Lnb[0] = (Lnb[0] + 1) % mod; n tb = tb * Lnb; n tb.resize(len); n return tb; n } n } // namespace Poly n using namespace Poly; n const int N = 250005; n const int B = 15; n vector adj[N]; n int n; n int son[N]; n void dfs1(int u, int fa) { n for (auto v : adj[u]) { n if (v == fa) continue; n son[u]++; n dfs1(v, u); n } n } n int two[N], len; n vector solve(int l, int r) { n if (l > r) return {1}; n if (l == r) return {1, mod - two[l]}; n int mid = l + r >> 1; n return solve(l, mid) * solve(mid + 1, r); n } n int fac[N], inv[N]; n int fuck[N]; n int main() { n n = read(); n inv[1] = 1; n for (int i = 2; i <= n; i++) n inv[i] = 1ull * (mod - mod / i) * inv[mod % i] % mod; n fac[0] = 1; n for (int i = 1; i <= n; i++) fac[i] = 1ull * fac[i - 1] * i % mod; n for (int i = 1; i <= n - 1; i++) { n int u = read(), v = read(); n adj[u].push_back(v), adj[v].push_back(u); n } n dfs1(1, 0); n vector ONE(n + 1); n for (int i = 1; i <= n; i++) { n if (son[i] > B) { n two[++len] = son[i]; n } else { n fuck[son[i]]++; n } n } n for (int i = 1; i <= B; i++) { n int coef = 1; n for (int j = 1; j <= n; j++) { n coef = 1ull * coef * i % mod; n ONE[j] = sub(ONE[j], 1ull * fuck[i] * coef % mod * inv[j] % mod); n } n } n ONE = Exp(ONE); n vector TWO = solve(1, len); n vector f = ONE * TWO; n int ans = 0; n for (int i = 0; i <= n - 1; i++) ans = (ans + 1ll * fac[n - i] * f[i]) % mod; n print(ans, n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, arr[200005]; n string swaps; n cin >> n; n for (int i = 1; i <= n; i++) cin >> arr[i]; n cin >> swaps; n int m = 0, flag = 0; n for (int i = 1; i < n; i++) { n m = max(m, arr[i]); n if (swaps[i - 1] == 0 && m > i) { n flag = 1; n break; n } n } n (flag) ? cout << NO n : cout << YES n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int n; n cin >> n; n char s; n int d = 1, j = 1; n for (int i = 1; i <= n; i++) { n cin >> s; n j -= 1; n if (j == 0) { n cout << s; n d += 1; n j = d; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mod = 1e9 + 7; n const int N = 1e5 + 5; n const double pi = acos(-1); n long long n, m, ans; n char arr[55][55]; n bool inrange(int i, int j) { n if (i < n && i >= 0 && j < m && j >= 0) return true; n return false; n } n void solve(int i, int j) { n int cntr1 = 0, cntr2 = 0, cntr3 = 0; n if (inrange(i + 1, j) && inrange(i + 1, j + 1) && inrange(i, j + 1)) { n if (arr[i + 1][j] == a || arr[i + 1][j + 1] == a || n arr[i][j + 1] == a ) n cntr1++; n if (arr[i + 1][j] == e || arr[i + 1][j + 1] == e || n arr[i][j + 1] == e ) n cntr2++; n if (arr[i + 1][j] == c || arr[i + 1][j + 1] == c || n arr[i][j + 1] == c ) n cntr3++; n } n if (cntr1 == 1 && cntr3 == 1 && cntr2 == 1) ans++; n cntr1 = 0, cntr2 = 0, cntr3 = 0; n if (inrange(i + 1, j) && inrange(i + 1, j - 1) && inrange(i, j - 1)) { n if (arr[i + 1][j] == a || arr[i + 1][j - 1] == a || n arr[i][j - 1] == a ) n cntr1++; n if (arr[i + 1][j] == e || arr[i + 1][j - 1] == e || n arr[i][j - 1] == e ) n cntr2++; n if (arr[i + 1][j] == c || arr[i + 1][j - 1] == c || n arr[i][j - 1] == c ) n cntr3++; n } n if (cntr1 == 1 && cntr3 == 1 && cntr2 == 1) ans++; n cntr1 = 0, cntr2 = 0, cntr3 = 0; n if (inrange(i - 1, j) && inrange(i - 1, j - 1) && inrange(i, j - 1)) { n if (arr[i - 1][j] == a || arr[i - 1][j - 1] == a || n arr[i][j - 1] == a ) n cntr1++; n if (arr[i - 1][j] == e || arr[i - 1][j - 1] == e || n arr[i][j - 1] == e ) n cntr2++; n if (arr[i - 1][j] == c || arr[i - 1][j - 1] == c || n arr[i][j - 1] == c ) n cntr3++; n } n if (cntr1 == 1 && cntr3 == 1 && cntr2 == 1) ans++; n cntr1 = 0, cntr2 = 0, cntr3 = 0; n if (inrange(i - 1, j) && inrange(i - 1, j + 1) && inrange(i, j + 1)) { n if (arr[i - 1][j] == a || arr[i - 1][j + 1] == a || n arr[i][j + 1] == a ) n cntr1++; n if (arr[i - 1][j] == e || arr[i - 1][j + 1] == e || n arr[i][j + 1] == e ) n cntr2++; n if (arr[i - 1][j] == c || arr[i - 1][j + 1] == c || n arr[i][j + 1] == c ) n cntr3++; n } n if (cntr1 == 1 && cntr3 == 1 && cntr2 == 1) ans++; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> m; n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) cin >> arr[i][j]; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (arr[i][j] == f ) solve(i, j); n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int main() { n cin >> n; n cout << n / 2 + n << endl; n if (n & 1) { n for (int i = 1; i <= n; i++) { n if (!(i & 1)) cout << i << ; n } n for (int i = 1; i <= n; i++) { n if (i & 1) cout << i << ; n } n for (int i = 1; i <= n; i++) { n if (!(i & 1)) cout << i << ; n } n } else { n for (int i = 1; i <= n; i++) { n if (i & 1) cout << i << ; n } n for (int i = 1; i <= n; i++) { n if (!(i & 1)) cout << i << ; n } n for (int i = 1; i <= n; i++) { n if (i & 1) cout << i << ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 5, M = 20; n int n, m; n string s; n int pos[(1 << M) - 1], a[M + 5][M + 5], f[(1 << M) + 5], g[(1 << M) + 5][M + 5]; n int main() { n memset(a, 0, sizeof(a)); n memset(f, 0x3f, sizeof(f)); n memset(g, 0, sizeof(g)); n cin >> n >> m >> s; n for (int i = 0; i < n - 1; i++) { n a[s[i] - a ][s[i + 1] - a ]++; n a[s[i + 1] - a ][s[i] - a ]++; n } n for (int i = 0; i < m; i++) pos[1 << i] = i; n for (int i = 1; i < (1 << m); i++) n for (int j = 0; j < m; j++) { n int k = i & (-i); n g[i][j] = g[i ^ k][j] + a[j][pos[k]]; n } n f[0] = 0; n for (int i = 0; i < (1 << m) - 1; i++) { n long long sum = 0; n for (int j = 0; j < m; j++) n if ((i & (1 << j)) == 0) sum += g[i][j]; n for (int j = 0; j < m; j++) n if ((i & (1 << j)) == 0) n f[i | (1 << j)] = min(f[i] + sum, (long long)f[i | (1 << j)]); n } n cout << f[(1 << m) - 1]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long dp[31][31][51]; n void Cal() { n for (int i = 0; i <= 30; i++) n for (int j = 0; j <= 30; j++) n for (int k = 0; k <= 50; k++) { n dp[i][j][k] = (k == 0 || k == i * j) ? 0 : 10000000000000000; n for (int kk = 0; kk <= k; kk++) { n for (int ii = 1; ii < i; ii++) n dp[i][j][k] = n min(dp[i][j][k], dp[ii][j][kk] + dp[i - ii][j][k - kk] + j * j); n for (int jj = 1; jj < j; jj++) n dp[i][j][k] = n min(dp[i][j][k], dp[i][jj][kk] + dp[i][j - jj][k - kk] + i * i); n } n } n } n int main() { n int T; n scanf( %d , &T); n Cal(); n while (T--) { n int n, m, k; n scanf( %d%d%d , &n, &m, &k); n cout << dp[n][m][k] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int m, n; n cin >> m; n int a[m]; n for (int i = 0; i < m; i++) { n a[i] = 0; n } n cin >> n; n int p = 0, q = 0, r = 0; n for (int i = 0; i < n; i++) { n cin >> p; n cin >> q; n cin >> r; n a[p - 1] -= r; n a[q - 1] += r; n } n int res = 0; n for (int i = 0; i < m; i++) { n if (a[i] > 0) res += a[i]; n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 10; n vector > v[3]; n vector > segment[3]; n struct matrix { n int arr[3][3]; n matrix(array a1, array a2) { n for (int i = 0; i <= 2; i++) { n for (int j = 0; j <= 2; j++) { n if (!a1[i] and !a2[j] and abs(i - j) < 2) { n arr[i][j] = 1; n } else n arr[i][j] = 0; n } n } n } n matrix() { n for (int i = 0; i <= 2; i++) { n for (int j = 0; j <= 2; j++) { n if (i == j) n arr[i][j] = 1; n else n arr[i][j] = 0; n } n } n } n }; n matrix mul(matrix a, matrix b) { n matrix c; n for (int i = 0; i <= 2; i++) { n for (int j = 0; j <= 2; j++) { n c.arr[i][j] = 0; n for (int k = 0; k <= 2; k++) { n c.arr[i][j] = (0ll + c.arr[i][j] + n (1ll * a.arr[i][k] * b.arr[k][j]) % 1000000007) % n 1000000007; n } n } n } n return c; n } n matrix matexpo(matrix a, long long int steps) { n if (!steps) { n return matrix(); n } n matrix temp = matexpo(a, steps / 2); n temp = mul(temp, temp); n if (steps % 2) { n temp = mul(temp, a); n } n return temp; n } n vector get(vector old_ans, array oldcur, array newcur, n long long int steps) { n matrix alpha(oldcur, newcur); n matrix temp = matexpo(alpha, steps); n vector loop_ans(3); n for (int i = 0; i <= 2; i++) { n for (int j = 0; j <= 2; j++) { n loop_ans[j] = (0ll + loop_ans[j] + n (1ll * temp.arr[i][j] * old_ans[i]) % 1000000007) % n 1000000007; n } n } n return loop_ans; n } n void solve() { n long long int n, m; n scanf( %lld , &n); n scanf( %lld , &m); n vector ans = {0, 1, 0}; n array cur = {0, 0, 0}; n for (int i = 1; i <= n; i++) { n long long int a, l, r; n scanf( %lld , &a); n scanf( %lld , &l); n scanf( %lld , &r); n v[a - 1].push_back({l, r}); n } n for (int i = 0; i <= 2; i++) { n sort((v[i]).begin(), (v[i]).end()); n stack > s1; n for (int j = 0; j <= (int)v[i].size() - 1; j++) { n if (s1.empty() or s1.top().second < (v[i][j].first - 1)) { n s1.push(v[i][j]); n } else { n s1.top().second = max(v[i][j].second, s1.top().second); n } n } n v[i].clear(); n v[i].reserve(s1.size()); n while (!s1.empty()) { n v[i].push_back(s1.top()); n s1.pop(); n } n reverse((v[i]).begin(), (v[i]).end()); n } n for (int i = 0; i <= 2; i++) { n for (int j = 0; j <= (int)v[i].size() - 1; j++) { n segment[i].push_back({v[i][j].first, 1}); n segment[i].push_back({v[i][j].second + 1, 0}); n } n segment[i].push_back({m + 1, 0}); n } n int i = 0, j = 0, k = 0; n long long int pos = 1; n while (true) { n long long int next = n min({segment[0][i].first, segment[1][j].first, segment[2][k].first}); n long long int steps = next - pos - 1; n ans = get(ans, cur, cur, steps); n if (next == (m + 1)) { n printf( %d n , ans[1]); n return; n } n pos = next - 1; n array newcur = cur; n if (next == segment[0][i].first) { n newcur[0] = segment[0][i].second; n i++; n } n if (next == segment[1][j].first) { n newcur[1] = segment[1][j].second; n j++; n } n if (next == segment[2][k].first) { n newcur[2] = segment[2][k].second; n k++; n } n ans = get(ans, cur, newcur, 1); n cur = newcur; n pos++; n } n } n int main() { n int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long co[100]; n int main() { n long long a, l = 0; n long long ans = 1; n cin >> a; n while (a > 1) { n long long c = 0; n for (int s = 2; s <= sqrt(a); s++) { n if (a % s == 0) { n a /= s, co[l] = s, l++, c = 1; n break; n } n } n if (c == 0) break; n } n if (l == 0) n cout << 1 << endl << 0; n else if (l == 1) n cout << 2; n else { n cout << 1 << endl; n for (int s = 0; s < 2; s++) ans *= co[s]; n cout << ans; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, d, ans = 0; n scanf( %d%d , &n, &d); n int maxi, t, l; n scanf( %d , &maxi); n for (int i = 1; i < n; i++) { n scanf( %d , &t); n if (t > maxi) { n maxi = t; n continue; n } else { n l = (int)ceil((maxi + 1 - t) / (double)d); n ans += l; n maxi = t + d * l; n } n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5, M = 1e5; n int dfn, cur[M + 1], in[N + 1], pre[N + 1], fin[N + 1], r[N + 1], sz[N + 1]; n vector adj[N + 1]; n int dfs(int u, int a) { n sz[u] = 1; n r[u] = a; n pre[u] = ++dfn; n for (auto v : adj[u]) sz[u] += dfs(v, a); n fin[u] = ++dfn; n return sz[u]; n } n int main() { n int n, m, k, q; n scanf( %d%d%d%d , &n, &m, &k, &q); n for (int i = (0), i_end = (k); i < i_end; ++i) { n int a, b; n scanf( %d%d , &a, &b); n if (cur[b]) { n ++in[a]; n adj[cur[b]].push_back(a); n } n cur[b] = a; n } n for (int i = (1), i_end = (n + 1); i < i_end; ++i) n if (!in[i]) dfs(i, i); n for (int i = (0), i_end = (q); i < i_end; ++i) { n int x, y; n scanf( %d%d , &x, &y); n y = cur[y]; n if (r[x] == r[y] && pre[y] > pre[x] && fin[y] < fin[x]) n printf( %d n , sz[x]); n else n puts( 0 ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = acos(-1.0); n const int INF = 1000 * 1000 * 1000 + 7; n const long long LINF = INF * (long long)INF; n const int MAX = 2 * 1000 * 100 + 47; n struct Item { n int a, t, ind; n bool operator<(const Item& a) const { return t < a.t; } n }; n Item A[MAX]; n int n, t; n bool ok(int k) { n long long time = 0; n int cnt = 0; n for (int i = (0); i < (n); i++) { n int a = A[i].a; n int tt = A[i].t; n if (a >= k && time + tt <= t) { n cnt++; n time += tt; n } n } n return cnt >= k; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> n >> t; n for (int i = (0); i < (n); i++) { n cin >> A[i].a >> A[i].t; n A[i].ind = i; n } n sort(A, A + n); n int l = 0, r = n + 1; n while (r - l > 1) { n int c = (r + l) / 2; n if (ok(c)) { n l = c; n } else { n r = c; n } n } n int cnt = l; n cout << cnt << n << cnt << n ; n for (int i = (0); i < (n); i++) { n if (cnt == 0) break; n if (A[i].a >= l) { n cnt--; n cout << A[i].ind + 1 << ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n double a, b, c, d; n int main() { n scanf( %d%d%d%d , &a, &b, &c, &d); n printf( %.12lf n , a / b / (1 - (1 - a / b) * (1 - c / d))); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 7; n int n, p[N]; n deque > deq; n bool mrk[N]; n vector dor[2]; n int dfs(int v, int d) { n mrk[v] = 1; n if (!mrk[p[v]]) return dfs(p[v], d + 1); n return d; n } n void add(int v, int l) { n dor[l].clear(); n int pnt = v; n do { n dor[l].push_back(pnt); n pnt = p[pnt]; n } while (pnt != v); n } n void remake(int l) { n int go = dor[l].size() / 2 + 1; n for (int i = 0; i < dor[l].size(); i++) { n p[dor[l][i]] = dor[l][(i + go) % dor[l].size()]; n } n } n void merge() { n for (int i = 0; i < dor[0].size(); i++) { n p[dor[0][i]] = dor[1][i]; n p[dor[1][i]] = dor[0][(1 + i) % dor[0].size()]; n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 1; i <= n; i++) cin >> p[i]; n for (int i = 1; i <= n; i++) { n if (!mrk[i]) { n deq.push_back({dfs(i, 1), i}); n } n } n sort(deq.begin(), deq.end()); n while (deq.size()) { n if (deq[0].first % 2) { n add(deq[0].second, 0); n remake(0); n deq.pop_front(); n continue; n } n if (deq.size() == 1 || deq[1].first != deq[0].first) { n cout << -1; n return 0; n } n add(deq[0].second, 0); n add(deq[1].second, 1); n merge(); n deq.pop_front(); n deq.pop_front(); n } n for (int i = 1; i <= n; i++) cout << p[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 200001; n int MAX[N]; n vector A[N]; n int main() { n ios::sync_with_stdio(false); n set > S; n int n; n cin >> n; n for (int i = 0; i < n; i++) { n int u, v; n cin >> u >> v; n MAX[u] = v; n A[u].push_back(v); n } n for (int i = 1; i <= n; i++) { n if (MAX[i] > 0) S.insert({MAX[i], i}); n } n int q; n cin >> q; n for (int i = 0; i < q; i++) { n int c; n cin >> c; n vector temp; n for (int j = 0; j < c; j++) { n int u; n cin >> u; n temp.push_back(u); n S.erase({MAX[u], u}); n } n if (S.size() > 1) { n pair p = *S.rbegin(), p2; n S.erase(p); n temp.push_back(p.second); n p2 = *S.rbegin(); n int l_lim = 0, u_lim = A[p.second].size(); n while (l_lim < u_lim - 1) { n int cur = (l_lim + u_lim) / 2; n if (A[p.second][cur] > p2.first) { n u_lim = cur; n } else { n l_lim = cur; n } n } n if (A[p.second][l_lim] > p2.first) { n cout << p.second << << A[p.second][l_lim] << n ; n } else { n cout << p.second << << A[p.second][l_lim + 1] << n ; n } n } else if (S.size() == 1) { n pair p = *S.rbegin(); n cout << p.second << << A[p.second][0] << n ; n } else { n cout << 0 0 n ; n } n while (!temp.empty()) { n if (MAX[temp.back()] > 0) S.insert({MAX[temp.back()], temp.back()}); n temp.pop_back(); n } n } n return 0; n } n "} +{"func_code_string": "#include n using i64 = long long; n using u64 = unsigned long long; n using u32 = unsigned; n int main() { n std::ios::sync_with_stdio(false); n std::cin.tie(nullptr); n int n; n std::cin >> n; n std::vector c0(n, 0); n std::vector c1(n, 0); n for (int i = 0; i < n; i++) { n std::cin >> c0[i] >> c1[i]; n } n std::vector tmp{0}; n for (int i = 0; i < n; i++) { n tmp.emplace_back(c0[i]); n tmp.emplace_back(c1[i]); n } n std::sort(tmp.begin(), tmp.end()); n tmp.resize(std::unique(tmp.begin(), tmp.end()) - tmp.begin()); n for (int i = 0; i < n; i++) { n c0[i] = std::lower_bound(tmp.begin(), tmp.end(), c0[i]) - tmp.begin(); n c1[i] = std::lower_bound(tmp.begin(), tmp.end(), c1[i]) - tmp.begin(); n } n std::vector p(tmp.size(), 0); n std::iota(p.begin(), p.end(), 0); n auto find = [&](int x) { n while (x != p[x]) { n x = p[x] = p[p[x]]; n } n return x; n }; n int ans = 0; n for (int i = 0; i < n; i++) { n int x = c0[i]; n int y = c1[i]; n x = find(x); n y = find(y); n if (!x && !y) { n std::cout << -1, exit(0); n } else { n if (x == y || !x || !y) { n ans = std::max({ans, x, y}); n p[x] = p[y] = 0; n } else { n ans = std::max(ans, std::min(x, y)); n p[std::min(x, y)] = std::max(x, y); n } n } n } n std::cout << tmp[ans] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct compare { n bool operator()(const std::string& first, const std::string& second) { n return first.size() > second.size(); n } n }; n int main() { n ios_base::sync_with_stdio(false); n int n, k, i; n cin >> n >> k; n string arr[110]; n for (i = 0; i < n; i++) { n cin >> arr[i]; n } n string password; n cin >> password; n long long int tries = 0, equallen = 0; n int plen = password.length(); n for (i = 0; i < n; i++) { n if (arr[i].length() < plen) { n tries++; n } else if (arr[i].length() == plen) { n equallen++; n } n } n long long int ans = 0; n ans = ((tries) / k) * 5 + tries + 1; n cout << ans << ; n ans = ((tries + equallen - 1) / k) * 5 + (tries + equallen); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s[10] = { O-|-OOOO , O-|O-OOO , O-|OO-OO , O-|OOO-O , O-|OOOO- , n -O|-OOOO , -O|O-OOO , -O|OO-OO , -O|OOO-O , -O|OOOO- }; n string num; n while (cin >> num) { n int i = num.size(); n while (i--) cout << s[num[i] - 0 ] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k; n int main() { n cin >> n >> k; n cout << (n + k - n % k); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e9 + 7; n const int N = 2e5 + 10; n int a[N]; n int main() { n string str; n string s; n while (cin >> s) str += s; n for (auto& c : str) { n if (c == < ) c = ; n if (c == > ) c = ; n } n vector vs; n vector ans; n stringstream sin(str); n while (sin >> str) { n if (str[0] == / ) { n if (str == /table ) { n ans.push_back(a[vs.size() - 1]); n } else { n a[vs.size() - 2] += a[vs.size() - 1]; n } n vs.pop_back(); n a[vs.size()] = 0; n } else { n if (str == td ) n a[vs.size()] = 1; n else n a[vs.size()] = 0; n vs.push_back(str); n } n } n sort(ans.begin(), ans.end()); n for (auto& x : ans) printf( %d , x); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N; n char field[110][110]; n bool check_solution(bool do_print, bool swapped) { n for (int r = 0; r < N; ++r) { n int c; n for (c = 0; c < N; ++c) { n if (field[r][c] == . ) break; n } n if (c == N) return false; n if (do_print) { n if (swapped) n printf( %d %d n , c + 1, r + 1); n else n printf( %d %d n , r + 1, c + 1); n } n } n return true; n } n int main(void) { n scanf( %d , &N); n for (int r = 0; r < N; ++r) scanf( %s , field[r]); n if (check_solution(false, false)) { n check_solution(true, false); n } else { n for (int r = 0; r < N; ++r) { n for (int c = r + 1; c < N; ++c) { n swap(field[r][c], field[c][r]); n } n } n if (check_solution(false, true)) n check_solution(true, true); n else n puts( -1 ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct nade { n int pos, tag, sum, l, r; n } tree[600005 * 2]; n int n; n void puup(int x) { n if (tree[x * 2].sum > tree[x * 2 + 1].sum) { n tree[x].pos = tree[x * 2].pos; n tree[x].sum = tree[x * 2].sum; n } else { n tree[x].pos = tree[x * 2 + 1].pos; n tree[x].sum = tree[x * 2 + 1].sum; n } n } n void pudo(int x) { n tree[x * 2].tag += tree[x].tag; n tree[x * 2].sum += tree[x].tag; n tree[x * 2 + 1].tag += tree[x].tag; n tree[x * 2 + 1].sum += tree[x].tag; n tree[x].tag = 0; n } n void build(int x, int l, int r) { n tree[x].l = l; n tree[x].r = r; n if (l == r) { n tree[x].pos = l; n return; n } n int mid = (l + r) / 2; n build(x * 2, l, mid); n build(x * 2 + 1, mid + 1, r); n tree[x].pos = tree[x * 2].pos; n } n void add(int l, int r, int val, int x) { n if (tree[x].l >= l && tree[x].r <= r) { n tree[x].sum += val; n tree[x].tag += val; n return; n } n pudo(x); n if (tree[x * 2].r >= l) add(l, r, val, x * 2); n if (tree[x * 2 + 1].l <= r) add(l, r, val, x * 2 + 1); n puup(x); n } n int l[200005], r[200005], v[200005]; n struct node { n int x, u, d; n bool b; n } s[200005]; n bool cmp(node a, node b) { n if (a.x != b.x) return a.x < b.x; n return a.b < b.b; n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d%d%d , &l[i], &v[i], &r[i]); n s[i * 2].x = l[i]; n s[i * 2].u = r[i]; n s[i * 2].d = v[i]; n s[i * 2].b = 0; n s[i * 2 + 1].x = v[i]; n s[i * 2 + 1].u = r[i]; n s[i * 2 + 1].d = v[i]; n s[i * 2 + 1].b = 1; n } n build(1, 1, 3e5 + 1); n sort(s, s + 2 * n, cmp); n int ans = 0, ansp = 0, ansx = 0; n for (int i = 0; i < n * 2; i++) { n add(s[i].d, s[i].u, s[i].b ? -1 : 1, 1); n if (tree[1].sum > ans) { n ans = tree[1].sum; n ansp = tree[1].pos; n ansx = s[i].x; n } n } n printf( %d n , ans); n for (int i = 0; i < n; i++) n if (l[i] <= ansx && ansx <= v[i] && v[i] <= ansp && ansp <= r[i]) n printf( %d , i + 1); n } n "} +{"func_code_string": "#include n using namespace std; n using lld = long long int; n int n, m; n int a[200009]; n int b[200009]; n int c[420009]; n int main() { n int t = 1, tv = 0; n int i, j, k; n scanf( %d , &t); n while (t--) { n scanf( %d %d , &n, &m); n b[0] = 0; n bool nom = true; n for (i = 0; i < n; i++) { n scanf( %d , &a[i]); n if (a[i] >= m) { n b[i + 1] = b[i] + 1; n } else { n b[i + 1] = b[i] - 1; n } n if (a[i] == m) { n nom = false; n } n } n bool valid = false; n if (n == 1 && a[0] == m) { n valid = true; n goto HELL; n } n if (!nom && !valid) { n for (i = 200009 - n - 9; i <= 200009 + n + 9; i++) { n c[i] = 0; n } n for (i = 0; i < n; i++) { n if (a[i] >= m) { n if (c[b[i] + 200009] == 1 || c[b[i] + 200009 - 1] == 1) { n valid = true; n goto HELL; n } n } n c[b[i] + 200009] = 1; n } n for (i = 200009 - n - 9; i <= 200009 + n + 9; i++) { n c[i] = 0; n } n for (i = n - 1; i >= 0; i--) { n if (a[i] >= m) { n if (c[b[i + 1] + 200009] == 1 || c[b[i + 1] + 200009 + 1] == 1) { n valid = true; n goto HELL; n } n } n c[b[i + 1] + 200009] = 1; n } n } n HELL: n printf( %s n , valid ? yes : no ); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100500; n const int infi = (1 << 30); n const long long infl = (1LL << 62); n const double eps = 1e-9; n const long long mod = 1000000007LL; n const double pi = acos(-1.0); n int n, k; n int a[maxn], c[maxn]; n int main() { n cin >> n >> k; n for (int i = 1; i < n; i++) a[i] = 1; n a[0] = 0; n for (int i = 0; i < k; i++) { n for (int j = 0; j < n; j++) { n int second = int(upper_bound(a, a + n, j - a[j] - 1) - a); n if (second == n) second = n - 1; n c[j] = second; n } n for (int j = 0; j < n; j++) { n a[j] += a[c[j]]; n } n for (int j = n - 1; j >= 0; --j) cout << n - c[j] << ; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector divs[1000009]; n bool p[1000009]; n vector primes; n void pre() { n for (int i = 2; i <= (1000000); ++i) { n if (!p[i]) { n primes.push_back(i); n for (int j = i; j <= 1000000; j += i) divs[j].push_back(i), p[j] = true; n } n } n } n int L(int x, int p) { n int s = (int)(divs[p]).size(); n int tot = (1 << s) - 1; n long long ans = 0; n for (int i = 1; i <= (tot); ++i) { n int cnt = 0; n int var = 1; n for (int j = 0; j < (s); ++j) n if (i & (1 << j)) cnt++, var *= divs[p][j]; n if (cnt % 2) n ans += x / var; n else n ans -= x / var; n } n return x - ans; n } n int main() { n cin.sync_with_stdio(0); n cin.tie(0); n cin.exceptions(cin.failbit); n pre(); n int q; n cin >> q; n for (int aa = 0; aa < (q); ++aa) { n int x, p, k; n cin >> x >> p >> k; n if (p == 1) n cout << k + x << n ; n else { n k += L(x, p); n int l = 1, r = 1e8; n while (l < r) { n int m = (l + r) >> 1; n if (L(m, p) >= k) n r = m; n else n l = m + 1; n } n cout << l << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n class Solution { n public: n long long count(long long _m, long long _x) { n if (_m < 3) { n return max(0LL, _m); n } n m = _m; n x = _x; n vector> cnts = factorize(m); n long long res = 0; n search(0, 1, cnts, res); n return res; n } n n private: n map>> fs; n long long m, x; n long long gcd(long long x, long long y) { n while (x != 0) { n y %= x; n swap(x, y); n } n return y; n } n vector>& factorize(long long n) { n if (fs.count(n) > 0) { n return fs[n]; n } n vector>& res = fs[n]; n for (long long i = 2; i * i <= n; ++i) { n int cnt = 0; n while (n % i == 0) { n ++cnt; n n /= i; n } n if (cnt > 0) { n res.emplace_back(i, cnt); n } n } n if (n > 1) { n res.emplace_back(n, 1); n } n return res; n } n void search(int i, long long dv, vector>& cnts, n long long& ans) { n if (i >= cnts.size()) { n vector> dvcnts; n dvcnts.reserve(cnts.size()); n for (auto& pc : cnts) { n if (pc.second <= 1) { n continue; n } n dvcnts.emplace_back(pc.first, pc.second - 1); n } n long long phi = dv; n for (auto& pc : cnts) { n long long p = pc.first; n int c = pc.second; n if (c == 0) { n continue; n } n dvcnts = merge(dvcnts, factorize(p - 1)); n phi = phi - phi / p; n } n ans += phi / calcPeriod(x % dv, dv, dvcnts); n return; n } n long long p = fs[m][i].first; n long long n = fs[m][i].second; n for (int j = 0; j <= n; ++j) { n cnts[i].second = j; n search(i + 1, dv, cnts, ans); n dv *= p; n } n } n vector> merge(vector>& list1, n vector>& list2) { n vector> res; n res.reserve(list1.size() + list2.size()); n int n = list1.size(), m = list2.size(); n int i = 0, j = 0; n while (i < n && j < m) { n if (list1[i].first < list2[j].first) { n res.emplace_back(list1[i].first, list1[i].second); n ++i; n } else if (list1[i].first > list2[j].first) { n res.emplace_back(list2[j].first, list2[j].second); n ++j; n } else { n res.emplace_back(list1[i].first, list1[i].second + list2[j].second); n ++i; n ++j; n } n } n while (i < n) { n res.emplace_back(list1[i].first, list1[i].second); n ++i; n } n while (j < m) { n res.emplace_back(list2[j].first, list2[j].second); n ++j; n } n return res; n } n long long calcPeriod(long long x, long long mod, n vector>& factors) { n long long phi = 1; n for (auto& pc : factors) { n long long p = pc.first; n int c = pc.second; n for (int i = 0; i < c; ++i) { n phi *= p; n } n } n long long res = 1; n for (auto& pc : factors) { n long long p = pc.first; n int c = pc.second; n long long base = phi; n for (int i = 0; i < c; ++i) { n base /= p; n } n long long val = powM(x, base, mod); n int j = c; n for (int i = 1; i <= c; ++i) { n if (val == 1) { n j = i - 1; n break; n } n val = powM(val, p, mod); n } n res *= powI(p, j); n } n return res; n } n long long mulM(long long a, long long b, long long m) { n long long res = 0; n while (b > 0) { n if (b & 0x1) { n res = (res + a) % m; n } n a = (a + a) % m; n b >>= 1; n } n return res; n } n long long powM(long long x, long long e, long long m) { n long long res = 1; n while (e > 0) { n if (e & 0x1) { n res = mulM(res, x, m); n } n x = mulM(x, x, m); n e >>= 1; n } n return res; n } n long long powI(long long x, long long e) { n long long res = 1; n for (int i = 0; i < e; ++i) { n res *= x; n } n return res; n } n }; n int main(int argc, char** argv) { n ios::sync_with_stdio(false); n cin.tie(0); n long long m, x; n cin >> m >> x; n Solution sol; n cout << sol.count(m, x) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n ll dx[] = {0, 0, 1, -1}; n ll dy[] = {1, -1, 0, 0}; n void solve() { n ll n; n cin >> n; n vector v(n); n for (ll i = 0; i < (n); ++i) cin >> v[i]; n vector> aux(n); n ll i = n - 1; n stack s; n while (i >= 0) { n while (!s.empty() && s.top() < v[i]) s.pop(); n if (s.empty()) n aux[i].first = -1; n else n aux[i].first = s.top(); n s.push(v[i]); n i--; n } n i = 0; n while (!s.empty()) s.pop(); n while (i < n) { n while (!s.empty() && s.top() < v[i]) s.pop(); n if (s.empty()) n aux[i].second = -1; n else n aux[i].second = s.top(); n s.push(v[i]), i++; n } n ll res = 0; n for (ll i = 0; i < (n); ++i) { n if (aux[i].first != -1) res = max(res, aux[i].first ^ v[i]); n if (aux[i].second != -1) res = max(res, aux[i].second ^ v[i]); n } n cout << res << n ; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n ll t = 1; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, i; n double p[2], poly[100005][2], minD = 1e18, maxD = 0, d, answer, lo, hi, n EPS = 1e-12, mid1, mid2, x, y, d1, d2; n int main() { n scanf( %d %lf %lf , &n, &p[0], &p[1]); n for (i = 0; i < n; i++) { n scanf( %lf %lf , &poly[i][0], &poly[i][1]); n d = (poly[i][0] - p[0]) * (poly[i][0] - p[0]) + n (poly[i][1] - p[1]) * (poly[i][1] - p[1]); n maxD = max(maxD, d); n } n for (i = 0; i < n; i++) { n lo = 0; n hi = 1; n while (hi - lo > EPS) { n mid1 = lo + (hi - lo) / 3; n mid2 = mid1 + (hi - lo) / 3; n x = poly[i][0] + (poly[(i + 1) % n][0] - poly[i][0]) * mid1; n y = poly[i][1] + (poly[(i + 1) % n][1] - poly[i][1]) * mid1; n d1 = (x - p[0]) * (x - p[0]) + (y - p[1]) * (y - p[1]); n x = poly[i][0] + (poly[(i + 1) % n][0] - poly[i][0]) * mid2; n y = poly[i][1] + (poly[(i + 1) % n][1] - poly[i][1]) * mid2; n d2 = (x - p[0]) * (x - p[0]) + (y - p[1]) * (y - p[1]); n if (d1 < d2) n hi = mid2; n else n lo = mid1; n } n d = d1; n minD = min(minD, d); n } n answer = acos(-1.0) * (maxD - minD); n printf( %.18lf n , answer); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1010; n void solve() { n int n, m; n cin >> n >> m; n vector> a = n vector>(n, vector(m, 0)); n for (int i = 0; i < n; ++i) n for (int j = 0; j < m; ++j) cin >> a[i][j]; n vector col(m, 0), row(n, 0); n for (int i = 0; i < m; ++i) n for (int j = 0; j < n; ++j) col[i] += a[j][i]; n for (int i = 0; i < n; ++i) n for (int j = 0; j < m; ++j) row[i] += a[i][j]; n vector x(m + 1), y(n + 1); n long long mn = LLONG_MAX; n long long ans = 0; n int ansx = 0; n for (int i = 0; i <= m; ++i) { n long long curx = i * 4; n for (int j = 0; j < m; ++j) { n long long curpos = j * 4 + 2; n long long dx = curx - curpos; n x[i] += dx * dx * col[j]; n } n if (x[i] < mn) { n mn = x[i]; n ansx = i; n } n } n ans += mn; n mn = LLONG_MAX; n int ansy = 0; n for (int i = 0; i <= n; ++i) { n int cury = i * 4; n for (int j = 0; j < n; ++j) { n long long curpos = j * 4 + 2; n long long dy = cury - curpos; n y[i] += dy * dy * row[j]; n } n if (y[i] < mn) { n mn = y[i]; n ansy = i; n } n } n ans += mn; n cout << ans << n ; n cout << ansy << << ansx << n ; n } n int main(void) { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int tc = 1; n while (tc--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1LL << 60; n const long long md = 1e9 + 7; n const long double eps = 1e-14; n const int mx = 3010; n int t[mx]; n void upd(int p) { n for (++p; p < mx; p += p & -p) ++t[p]; n } n int que(int p) { n int res = 0; n for (; p > 0; p -= p & -p) res += t[p]; n return res; n } n char zey[mx][mx]; n int le[mx][mx], ri[mx][mx]; n int solve(vector &a, vector &b) { n int sz = a.size(); n if (sz == 0) return 0; n int res = 0; n fill(t, t + sz + 5, 0); n vector > bb(sz); n for (int i = (0); i < int(sz); ++i) bb[i] = pair(i - b[i] + 1, i); n sort(bb.begin(), bb.end()); n int ix = 0; n for (int i = (0); i < int(sz); ++i) { n while (ix < sz && bb[ix].first <= i) upd(bb[ix++].second); n res += que(min(sz, i + a[i])) - i; n } n return res; n } n int main() { n memset(t, 0, sizeof(t)); n int n, m; n cin >> n >> m; n for (int i = (0); i < int(n); ++i) scanf( %s , zey[i]); n for (int i = (0); i < int(n); ++i) { n le[i][0] = zey[i][0] == z ; n ri[i][m - 1] = zey[i][m - 1] == z ; n } n for (int i = (0); i < int(n); ++i) n for (int j = (1); j < int(m); ++j) n le[i][j] = zey[i][j] == z ? 1 + le[i][j - 1] : 0; n for (int i = (0); i < int(n); ++i) n for (int j = (m - 1); j-- > int(0);) n ri[i][j] = zey[i][j] == z ? 1 + ri[i][j + 1] : 0; n long long ans = 0; n for (int s = (0); s < int(m + n - 1); ++s) { n vector a, b; n for (int d = (max(0, s - m + 1)); d < int(min(n, s + 1)); ++d) { n if (zey[d][s - d] == z ) { n a.push_back(le[d][s - d]); n b.push_back(ri[d][s - d]); n } else { n ans += solve(a, b); n a.clear(); n b.clear(); n } n } n ans += solve(a, b); n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n unsigned long long val(int i) { return i + 1; } n unsigned long long pot1[100001], pot2[100001], prec1[10][100001], n prec2[10][100001]; n int v[100000]; n struct Node { n unsigned long long h1, h2; n int flag; n bool valid; n int sz; n Node() { n sz = h1 = h2 = 0; n flag = -1; n valid = true; n } n Node(unsigned long long a, unsigned long long b, int c) { n h1 = a; n h2 = b; n sz = c; n flag = -1; n valid = true; n } n Node(unsigned long long a, unsigned long long b, int c, bool d) { n h1 = a; n h2 = b; n sz = c; n valid = d; n flag = -1; n } n void set(int c) { flag = c; } n void reset() { flag = -1; } n void update(int c) { n if (c == -1) return; n h1 = prec1[c][sz]; n h2 = prec2[c][sz]; n } n bool operator!=(const Node& n) { return h1 != n.h1 || h2 != n.h2; } n }; n Node st[400000]; n inline int left(int i) { return 2 * i + 1; } n inline int right(int i) { return 2 * i + 2; } n void initialize(int r, int beg, int end) { n if (beg == end) { n st[r] = Node(val(v[beg]), val(v[beg]), 1); n } else { n int h = (beg + end) / 2; n initialize(left(r), beg, h); n initialize(right(r), h + 1, end); n st[r] = Node( n (st[left(r)].h1 * pot1[st[right(r)].sz] + st[right(r)].h1) % 1000000009, n (st[left(r)].h2 * pot2[st[right(r)].sz] + st[right(r)].h2) % 1000000007, n st[left(r)].sz + st[right(r)].sz); n } n } n void update(int r, int beg, int end, int qbeg, int qend, char c) { n if (end < qbeg || beg > qend) { n if (st[r].flag != -1) { n st[r].update(st[r].flag); n if (beg != end) { n st[2 * r + 1].set(st[r].flag); n st[2 * r + 2].set(st[r].flag); n } n st[r].reset(); n } n return; n } n if (beg >= qbeg && end <= qend) { n st[r].update(c); n if (beg != end) { n st[left(r)].set(c); n st[right(r)].set(c); n } n st[r].reset(); n } else { n int h = (beg + end) / 2; n if (st[r].flag != -1) { n st[r].update(st[r].flag); n st[2 * r + 1].set(st[r].flag); n st[2 * r + 2].set(st[r].flag); n st[r].reset(); n } n update(left(r), beg, h, qbeg, qend, c); n update(right(r), h + 1, end, qbeg, qend, c); n st[r] = Node( n (st[left(r)].h1 * pot1[st[right(r)].sz] + st[right(r)].h1) % 1000000009, n (st[left(r)].h2 * pot2[st[right(r)].sz] + st[right(r)].h2) % 1000000007, n st[right(r)].sz + st[left(r)].sz); n } n } n Node query(int r, int beg, int end, int qbeg, int qend) { n if (end < qbeg || beg > qend) return Node(0, 0, false); n if (beg >= qbeg && end <= qend) { n if (st[r].flag != -1) { n st[r].update(st[r].flag); n if (beg != end) { n st[left(r)].set(st[r].flag); n st[right(r)].set(st[r].flag); n } n st[r].reset(); n } n return st[r]; n } else { n if (st[r].flag != -1) { n st[r].update(st[r].flag); n st[left(r)].set(st[r].flag); n st[right(r)].set(st[r].flag); n st[r].reset(); n } n Node le = query(left(r), beg, (beg + end) / 2, qbeg, qend); n Node ri = query(right(r), (beg + end) / 2 + 1, end, qbeg, qend); n if (le.valid && ri.valid) n return Node((le.h1 * pot1[ri.sz] + ri.h1) % 1000000009, n (le.h2 * pot2[ri.sz] + ri.h2) % 1000000007, le.sz + ri.sz); n else if (le.valid) n return le; n else n return ri; n } n } n bool qquery(int r, int beg, int end, int qbeg, int qend, int d) { n int sz = qend - qbeg + 1; n if (sz <= d) return true; n if (qbeg > qend) return 0; n int sobra = sz % d; n if (sobra) { n if (query(r, beg, end, qbeg, qbeg + sobra - 1) != n query(r, beg, end, qend - sobra + 1, qend)) n return false; n } n qend -= sobra; n sz = qend - qbeg + 1; n int n = sz / d; n if (sz == d) return true; n if (n & 1) { n int b0 = qbeg, b1 = qbeg + n / 2 * d, b2 = qbeg + (n / 2 + 1) * d; n int e0 = b1 - 1, e1 = b2 - 1, e2 = qend; n if (query(r, beg, end, b0, e0) != query(r, beg, end, b2, e2) || n query(r, beg, end, b0, b0 + d - 1) != query(r, beg, end, b1, e1)) n return false; n return qquery(r, beg, end, b0, e0, d); n } else { n int b0 = qbeg, b1 = qbeg + (n + 1) / 2 * d; n int e0 = b1 - 1, e1 = qend; n if (query(r, beg, end, b0, e0) != query(r, beg, end, b1, e1)) return false; n return qquery(r, beg, end, b0, e0, d); n } n } n void precalc() { n pot1[0] = 1; n pot2[0] = 1; n for (int i = 1; i <= 100000; i++) { n pot1[i] = (pot1[i - 1] * 33) % 1000000009; n pot2[i] = (pot2[i - 1] * 33) % 1000000007; n } n for (int i = 0; i < 10; i++) { n prec1[i][0] = 0; n prec2[i][0] = 0; n for (int j = 1; j <= 100000; j++) { n prec1[i][j] = (prec1[i][j - 1] * 33 + val(i)) % 1000000009; n prec2[i][j] = (prec2[i][j - 1] * 33 + val(i)) % 1000000007; n } n } n } n int main(void) { n int n, m, k; n char s[100001]; n precalc(); n scanf( %d%d%d , &n, &m, &k); n scanf( %s , s); n for (int i = 0; i < n; i++) { n v[i] = s[i] - 0 ; n } n initialize(0, 0, n - 1); n for (int i = 0; i < m + k; i++) { n int cmd; n int l, r, x; n scanf( %d%d%d%d , &cmd, &l, &r, &x); n if (cmd == 1) { n l--; n r--; n update(0, 0, n - 1, l, r, x); n } else { n l--; n r--; n printf( %s n , qquery(0, 0, n - 1, l, r, x) ? YES : NO ); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100005, M = 500005; n vector gr[N], path, odd; n pair ed[M]; n bool us[M]; n void GetEulerCircuit(int u) { n while (true) { n while (!gr[u].empty() && us[gr[u].back()]) { n gr[u].pop_back(); n } n if (gr[u].empty()) { n break; n } n us[gr[u].back()] = true; n int v = u ^ ed[gr[u].back()].first ^ ed[gr[u].back()].second; n gr[u].pop_back(); n GetEulerCircuit(v); n } n path.push_back(u); n } n int main() { n ios_base::sync_with_stdio(false); n cout.tie(0); n int n, m; n scanf( %d %d , &n, &m); n for (int i = 0; i < m; i++) { n int u, v; n scanf( %d %d , &u, &v); n ed[i] = make_pair(u, v); n gr[u].push_back(i); n gr[v].push_back(i); n } n for (int u = 1; u <= n; u++) { n if (gr[u].size() % 2) { n odd.push_back(u); n } n } n for (int i = 0; i < odd.size(); i += 2) { n int u = odd[i], v = odd[i + 1]; n ed[m] = make_pair(u, v); n gr[u].push_back(m); n gr[v].push_back(m); n m++; n } n if (m % 2) { n ed[m] = make_pair(1, 1); n gr[1].push_back(m); n gr[1].push_back(m); n m++; n } n GetEulerCircuit(1); n for (int i = 0; i < m; i++) { n int u = path[i], v = path[i + 1]; n if (i % 2) { n swap(u, v); n } n ed[i] = make_pair(u, v); n } n printf( %d n , m); n for (int i = 0; i < m; i++) { n int u = ed[i].first, v = ed[i].second; n printf( %d %d n , u, v); n } n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void read(T &x) { n x = 0; n T f = 1; n char c = getchar(); n for (; !isdigit(c); c = getchar()) n if (c == - ) f = -1; n for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48); n x *= f; n } n int main() { n int n; n read(n); n for (int i = 1; i <= n; i++) { n int x; n read(x); n cout << x / 6 + (x % 6 == 0 ? 0 : 1) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e6; n int q[maxn], fin, razbeg, jump, n; n pair ans[maxn]; n int sz = 0; n int main() { n cin >> n >> fin >> razbeg >> jump; n for (int i = 0; i < n; i++) cin >> q[i]; n q[n] = 0; n q[n + 1] = fin; n n += 2; n sort(q, q + n); n int i = 0, now = 0; n while (i < n - 1) n if (i == n - 2) { n if (fin - now > 0) ans[sz] = make_pair(0, fin - now), sz++; n break; n } else if (q[i + 1] - 1 - now < razbeg) { n cout << IMPOSSIBLE ; n return 0; n } else { n if (q[i + 1] - 1 - now > 0) n ans[sz] = make_pair(0, q[i + 1] - 1 - now), sz++; n now = q[i + 1] - 1; n while (1) { n i++; n if (q[i] + 1 - now > jump) { n cout << IMPOSSIBLE ; n return 0; n } n if (i == n - 2) { n ans[sz] = make_pair(1, q[i] + 1 - now), sz++, now = q[i] + 1; n break; n } else if (q[i + 1] - 1 - q[i] - 1 >= razbeg) { n ans[sz] = make_pair(1, q[i] + 1 - now), sz++, now = q[i] + 1; n break; n } n } n } n for (int i = 0; i < sz; i++) n if (ans[i].first == 0) n cout << RUN << ans[i].second << n ; n else n cout << JUMP << ans[i].second << n ; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, q, c[100005], v[100005], f[100005]; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> q; n for (int i = 1; i <= n; i++) cin >> v[i]; n for (int i = 1; i <= n; i++) cin >> c[i]; n while (q--) { n long long a, b, ans = 0, mx = 0, smx = 0; n memset(f, -6, sizeof(f)); n cin >> a >> b; n for (int i = 1; i <= n; i++) { n long long cur = max(v[i] * b, f[c[i]] + v[i] * a); n if (c[i] != mx) n cur = max(cur, f[mx] + v[i] * b); n else n cur = max(cur, f[smx] + v[i] * b); n if (cur > f[mx]) { n if (mx != c[i]) smx = mx; n mx = c[i]; n } else if (cur > f[smx] && c[i] != mx) n smx = c[i]; n f[c[i]] = max(f[c[i]], cur); n ans = max(ans, cur); n } n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int a[4010][4010]; n int n, m; n int u[4010], v[4010], sz[4010]; n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n scanf( %d%d , &u[i], &v[i]); n a[u[i]][v[i]] = a[v[i]][u[i]] = 1; n sz[u[i]]++; n sz[v[i]]++; n } n int ans = 1e9; n for (int i = 1; i <= m; i++) { n int x = u[i], y = v[i]; n for (int j = i + 1; j <= m; j++) { n int c = u[j], d = v[j]; n if (x == c && a[y][d] == 1) { n ans = min(ans, sz[x] + sz[y] + sz[d] - 6); n } else if (x == d && a[y][c] == 1) { n ans = min(ans, sz[x] + sz[c] + sz[y] - 6); n } else if (y == c && a[x][d] == 1) { n ans = min(ans, sz[y] + sz[x] + sz[d] - 6); n } else if (y == d && a[x][c] == 1) { n ans = min(ans, sz[y] + sz[x] + sz[c] - 6); n } n } n } n if (ans == 1e9) n cout << -1 << endl; n else n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXK = 26; n const long long MOD = 1e9 + 7; n int last[MAXK], ord[MAXK]; n long long sum, dp[MAXK]; n void add(int c) { n sum = (sum - dp[c] + MOD) % MOD; n dp[c] = (dp[c] + sum + 1) % MOD; n sum = (sum + dp[c]) % MOD; n } n int main() { n ios_base::sync_with_stdio(false); n int N, K; n string S; n cin >> N >> K >> S; n memset((last), (-1), sizeof(last)); n sum = 0; n for (int _n((int)S.size()), i(0); i < _n; i++) { n int c = S[i] - a ; n last[c] = i; n add(c); n } n iota(ord, ord + K, 0); n sort(ord, ord + K, [](int a, int b) { return last[a] < last[b]; }); n for (int _n(N), i(0); i < _n; i++) { n int c = ord[i % K]; n add(c); n } n cout << (sum + 1) % MOD << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma GCC optimize( Ofast ) n const int INF = 1e9 + 7; n const long long INF2 = 1e15; n void solve(void) {} n int main(void) { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long n, l, r, ql, qr; n cin >> n >> l >> r >> ql >> qr; n vector v(n); n for (int i = 0; i < n; i++) cin >> v[i]; n long long total = 0; n vector left(n + 1), right(n + 1); n for (long long i = 0; i < n; i++) { n total += v[i] * l; n left[i + 1] = total; n } n total = 0; n for (long long i = n - 1; i >= 0; i--) { n total += v[i] * r; n right[i] = total; n } n long long ans = INF, current; n for (long long i = 0; i <= n; i++) { n long long a = i, b = n - i, change; n current = INF; n change = min(a, b); n a -= change; n b -= change; n if (a) { n a--; n current = min(current, a * ql); n } else if (b) { n current = min(current, b * qr); n } else { n current = 0; n } n a = i, b = n - i; n change = min(a, b); n a -= change; n b -= change; n if (b) { n b--; n current = min(current, b * qr); n } else if (a) { n current = min(current, a * ql); n } else { n current = 0; n } n long long temp = 0; n a = i, b = n - i; n if (b) { n b--; n temp += qr * b; n } n if (a) { n a--; n temp += ql * a; n } n current = min(current, temp); n ans = min(ans, current + left[i] + right[i]); n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n using namespace std; n int main() { n int n, k, q; n cin >> n >> k >> q; n vector vec(n + 1); n vector pq; n map ar, ans, rev; n for (int i = 1; i <= n; i++) cin >> vec[i], ar[i] = vec[i], rev[vec[i]] = i; n while (q--) { n int a, b; n cin >> a >> b; n if (a == 1) { n pq.push_back(ar[b]); n ans[b] = 1; n if (pq.size() > k) { n sort(pq.begin(), pq.end()); n long long dd = rev[pq[0]]; n ans[dd] = 0; n pq.erase(pq.begin()); n } n } else { n if (ans[b]) { n cout << YES n ; n } else n cout << NO n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int lowbit(int x) { return x & -x; } n inline int ABS(int x) { return x < 0 ? -x : x; } n inline long long ABS(long long x) { return x < 0 ? -x : x; } n inline void MAX(int &a, int b) { n if (b > a) a = b; n } n inline void MAX(long long &a, long long b) { n if (b > a) a = b; n } n inline void MIN(int &a, int b) { n if (b < a) a = b; n } n inline void MIN(long long &a, long long b) { n if (b < a) a = b; n } n inline void SUM(int &a, int b) { a = (a + b) % 1000000007; } n int fast(int x, int v) { n int ans = 1; n for (; v; v >>= 1, x = (long long)x * x % 1000000007) n if (v & 1) ans = (long long)ans * x % 1000000007; n return ans; n } n long long fast(long long x, long long v) { n long long ans = 1; n for (; v; v >>= 1, x = x * x % 1000000007) n if (v & 1) ans = ans * x % 1000000007; n return ans; n } n inline long long sqr(int x) { return x * x; } n int n, a[300005], l, r, sum; n long long pre[300005], ans; n map s; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; ++i) { n scanf( %d , a + i); n pre[i] = pre[i - 1] + (a[i] < 0 ? 0 : a[i]); n if (!s[a[i]]) s[a[i]] = i; n } n ans = -0x7f7f7f7f; n for (int i = n; i >= 1; --i) n if (s[a[i]] && s[a[i]] != i && pre[i - 1] - pre[s[a[i]]] + a[i] * 2 > ans) { n ans = pre[i - 1] - pre[s[a[i]]] + a[i] * 2; n l = s[a[i]]; n r = i; n } n for (int i = l + 1; i <= r - 1; ++i) n if (a[i] < 0) ++sum; n printf( %I64d %d n , ans, sum + l - 1 + n - r); n for (int i = 1; i <= l - 1; ++i) printf( %d , i); n for (int i = l + 1; i <= r - 1; ++i) n if (a[i] < 0) printf( %d , i); n for (int i = r + 1; i <= n; ++i) printf( %d , i); n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 9223372036854775807; n const long long MOD = 1000000007; n const long double PI = acos(-1); n inline long long power(long long a, long long b, long long z = MOD) { n long long res = 1; n a = (a % z); n while (b) { n if (b & 1) res = (res * a) % z; n a = (a * a) % z; n b = b >> 1; n } n return res; n } n inline long long inverse(long long a, long long z = MOD) { n return power(a, z - 2, z); n } n long long extend(long long a, long long b, long long &x, long long &y) { n if (b == 0) { n x = 1; n y = 0; n return a; n } n long long x1, y1; n long long g = extend(b, a % b, x1, y1); n x = y1; n y = x1 - (a / b) * y1; n return g; n } n inline long long mat_power(long long a, long long b, long long c, long long d, n long long n, long long z = MOD) { n long long a0 = 1, b0 = 0, c0 = 0, d0 = 1; n while (n) { n if (n & 1) { n long long a1 = a0, b1 = b0, c1 = c0, d1 = d0; n a0 = (a1 * a + b1 * c) % z; n b0 = (a1 * b + b1 * d) % z; n c0 = (c1 * a + d1 * c) % z; n d0 = (c1 * b + d1 * d) % z; n } n long long a1 = a, b1 = b, c1 = c, d1 = d; n a = (a1 * a1 + b1 * c1) % z; n b = (a1 * b1 + b1 * d1) % z; n c = (c1 * a1 + d1 * c1) % z; n d = (c1 * b1 + d1 * d1) % z; n n = n >> 1; n } n return c0; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n, m; n cin >> n >> m; n int aray[n][m], arr[n][m]; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) cin >> aray[i][j]; n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) cin >> arr[i][j]; n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (aray[i][j] > arr[i][j]) swap(aray[i][j], arr[i][j]); n } n } n for (int i = 0; i < n; i++) { n for (int j = 1; j < m; j++) { n if (aray[i][j] <= aray[i][j - 1] || arr[i][j] <= arr[i][j - 1]) { n cout << Impossible n ; n return 0; n } n } n } n for (int j = 0; j < m; j++) { n for (int i = 1; i < n; i++) { n if (aray[i][j] <= aray[i - 1][j] || arr[i][j] <= arr[i - 1][j]) { n cout << Impossible n ; n return 0; n } n } n } n cout << Possible n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n map mp; n mp[ q ] = 9; n mp[ k ] = 0; n mp[ r ] = 5; n mp[ b ] = 3; n mp[ n ] = 3; n mp[ p ] = 1; n int white = 0, black = 0; n for (int i = 0; i < 8; i++) { n for (int j = 0; j < 8; j++) { n char x; n cin >> x; n if (x >= A && x <= Z ) white += mp[x + 32]; n if (x >= a && x <= z ) black += mp[x]; n } n } n if (white > black) n cout << White << endl; n else if (white == black) n cout << Draw << endl; n else n cout << Black << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 20; n long long int dp[MAXN][MAXN]; n long long int tav[MAXN]; n long long int n; n string s; n long long int dtoc(char x) { return x - 0 ; } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n tav[0] = 1; n for (int i = 1; i < MAXN; i++) { n tav[i] = 10 * tav[i - 1]; n } n cin >> n; n cin >> s; n for (int i = 0; i <= n; i++) { n for (int j = 0; j <= n; j++) { n if (i) { n dp[i][j] = dp[i - 1][j] + dtoc(s[2 * n - i - j]) * tav[i - 1]; n } n if (j) { n dp[i][j] = n max(dp[i][j], dp[i][j - 1] + dtoc(s[2 * n - i - j]) * tav[j - 1]); n } n } n } n int i = n; n int j = n; n while (i > 0 || j > 0) { n if (i && dp[i - 1][j] + dtoc(s[2 * n - i - j]) * tav[i - 1] == dp[i][j]) { n i--; n cout << H ; n } else { n j--; n cout << M ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int v[300123], n, ans, g[300123], f[300123], a, b, m, op; n queue q; n int main() { n ios_base::sync_with_stdio(0); n cin >> n; n for (int i = 1; i <= n; ++i) { n cin >> v[i]; n if (~v[i]) n g[v[i]]++; n else { n g[0]++; n } n } n ans = 1; n for (int i = 1; i <= n; ++i) { n if (g[i] == 0) { n q.push(i); n f[i] = 1; n } n } n while (!q.empty()) { n int u = q.front(); n q.pop(); n g[v[u]]--; n if (g[v[u]] == 0) { n f[v[u]] = f[u] + 1; n q.push(v[u]); n ans = max(ans, f[v[u]]); n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n for (int i = 0; i < t; i++) { n int x; n cin >> x; n int ans = (x % 10 - 1) * 10; n ans += 1; n if (x / 10 > 0) ans += 2; n if (x / 100 > 0) ans += 3; n if (x / 1000 > 0) ans += 4; n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(NULL); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n int a, b, c, m; n cin >> a >> b >> c >> m; n int len = a + b + c; n int maxi = len - 3; n int valMax = max(a, max(b, c)); n int mini = max(0, ((2 * valMax) - len - 1)); n if (m < mini || m > maxi) n cout << NO n ; n else n cout << YES n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream &operator<<(ostream &os, const pair &p) { n return os << ( << p.first << , << p.second << ) ; n } n template ::value, n typename T_container::value_type>::type> n ostream &operator<<(ostream &os, const T_container &v) { n os << { ; n string sep; n for (const T &x : v) os << sep << x, sep = , ; n return os << } ; n } n void dbg_out() { cerr << endl; } n template n void dbg_out(Head H, Tail... T) { n cerr << << H; n dbg_out(T...); n } n const int INF = 1 << 30; n const int MOD = 1e9 + 7; n const int MAXN = 2e5 + 5; n string asignar(int n) { n if (n == 0) return S ; n if (n == 1) return M ; n if (n == 2) return L ; n if (n == 3) return XL ; n if (n == 4) return XXL ; n if (n == 5) return XXXL ; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n vector stock(6); n for (long long i = (0); i < (long long)(6); i++) cin >> stock[i]; n int n; n cin >> n; n vector, int>> quiero(n); n for (long long j = (0); j < (long long)(n); j++) { n string s; n cin >> s; n string curr = ; n pair x = make_pair(-1, -1); n for (long long i = (0); i < (long long)(s.size()); i++) { n if (s[i] != , ) { n curr += s[i]; n } else { n if (curr == S ) x.first = 0; n if (curr == M ) x.first = 1; n if (curr == L ) x.first = 2; n if (curr == XL ) x.first = 3; n if (curr == XXL ) x.first = 4; n if (curr == XXXL ) x.first = 5; n curr = ; n } n } n if (curr == S ) x.second = 0; n if (curr == M ) x.second = 1; n if (curr == L ) x.second = 2; n if (curr == XL ) x.second = 3; n if (curr == XXL ) x.second = 4; n if (curr == XXXL ) x.second = 5; n if (x.first == -1) x.first = x.second; n if (x.first > x.second) swap(x.first, x.second); n quiero[j] = make_pair(x, j); n } n sort((quiero).begin(), (quiero).end()); n ; n vector ans(n); n for (long long i = (0); i < (long long)(n); i++) { n if (stock[quiero[i].first.first] > 0) { n ans[quiero[i].second] = asignar(quiero[i].first.first); n stock[quiero[i].first.first]--; n } else if (stock[quiero[i].first.second] > 0) { n ans[quiero[i].second] = asignar(quiero[i].first.second); n stock[quiero[i].first.second]--; n } else { n cout << NO n ; n return 0; n } n } n cout << YES n ; n for (long long i = (0); i < (long long)(n); i++) cout << ans[i] << n ; n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int in() { n int x; n scanf( %d , &x); n return x; n } n const int N = 1e6 + 7; n int n, m, a[N], Q; n long long SUM, psr[N], psl[N]; n int en[N], st[N]; n pair dpl[N], dpr[N]; n int solve(long long maax) { n if (maax >= SUM) return 1; n long long sum = 0, cur = 0; n for (int i = 0; i < n; i++) { n sum += a[i]; n while (sum > maax) { n en[cur] = i - 1; n sum -= a[cur]; n cur++; n } n } n while (cur < n) en[cur++] = n - 1; n sum = 0, cur = n - 1; n for (int i = n - 1; i >= 0; i--) { n sum += a[i]; n while (sum > maax) { n st[cur] = i + 1; n sum -= a[cur]; n cur--; n } n } n while (cur >= 0) st[cur--] = 0; n for (int i = 0; i < n; i++) { n if (st[i] == 0) n dpl[i] = {1, psl[i + 1]}; n else n dpl[i] = dpl[st[i] - 1], dpl[i].first++; n } n for (int i = n - 1; i >= 0; --i) { n if (en[i] == n - 1) n dpr[i] = {1, psr[i]}; n else n dpr[i] = dpr[en[i] + 1], dpr[i].first++; n } n int mn = dpr[0].first; n for (int i = 1; i < n; i++) n mn = min(mn, dpr[i].first + dpl[i - 1].first - n ((dpr[i].second + dpl[i - 1].second) <= maax)); n return mn; n } n int32_t main() { n n = in(), Q = in(); n for (int i = 0; i < n; i++) { n a[i] = in(); n SUM += a[i]; n psl[i + 1] = a[i] + psl[i]; n } n for (int i = n - 1; i >= 0; --i) psr[i] = psr[i + 1] + a[i]; n while (Q--) { n long long x; n cin >> x; n cout << solve(x) << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int a[1005][1005], used[1005][1005]; n const int dx[4] = {0, 0, 1, -1}; n const int dy[4] = {1, -1, 0, 0}; n void DFS(int i, int j, int N, int M) { n if (i == 0 || i == N + 1 || j == 0 || j == M + 1 || used[i][j]) return; n used[i][j] = 1; n for (int d = 0; d < 4; ++d) n if (a[i + dx[d]][j + dy[d]] == 1) DFS(i + dx[d], j + dy[d], N, M); n } n int main() { n int N, M; n scanf( %d%d , &N, &M); n int numberBlacks = 0; n for (int i = 1; i <= N; ++i) { n char s[1005]; n scanf( %s , s + 1); n for (int j = 1; j <= M; ++j) n if (s[j] == # ) { n a[i][j] = 1; n ++numberBlacks; n } n } n if (numberBlacks == 0) { n printf( 0 n ); n return 0; n } n int emptyLines = 0; n for (int i = 1; i <= N; ++i) { n int cnt = 0, numberLineSegments = 0; n for (int j = 1; j <= M; ++j) { n cnt += a[i][j]; n if (a[i][j - 1] == 0 && a[i][j] == 1) ++numberLineSegments; n } n if (numberLineSegments > 1) { n printf( -1 n ); n return 0; n } n if (cnt == 0) ++emptyLines; n } n int emptyColumns = 0; n for (int j = 1; j <= M; ++j) { n int cnt = 0, numberColumnSegments = 0; n for (int i = 1; i <= N; ++i) { n cnt += a[i][j]; n if (a[i - 1][j] == 0 && a[i][j] == 1) ++numberColumnSegments; n } n if (numberColumnSegments > 1) { n printf( -1 n ); n return 0; n } n if (cnt == 0) ++emptyColumns; n } n if (emptyLines == 0 && emptyColumns > 0 || n emptyLines > 0 && emptyColumns == 0) { n printf( -1 n ); n return 0; n } n int connectedComponents = 0; n for (int i = 1; i <= N; ++i) n for (int j = 1; j <= M; ++j) n if (used[i][j] == 0 && a[i][j] == 1) { n ++connectedComponents; n DFS(i, j, N, M); n } n printf( %d n , connectedComponents); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n T scani(T &n) { n n = 0; n bool negative = false; n char c = getchar(); n while (c < 0 || c > 9 ) { n if (c == - ) negative = true; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n n = n * 10 + c - 48; n c = getchar(); n } n if (negative) n = ~(n - 1); n return n; n } n template n void write(T n, int type = true) { n if (n < 0) { n putchar( - ); n n = -n; n } n if (!n) { n putchar( 0 ); n if (type == 32) n putchar( ); n else if (type) n putchar( n ); n return; n } n char buff[22]; n int len = 0; n while (n) buff[len++] = n % 10 + 48, n /= 10; n for (int i = len - 1; i >= 0; i--) putchar(buff[i]); n if (type == 32) n putchar( ); n else if (type) n putchar( n ); n } n int scans(char *a) { n int i = 0; n char c = 0; n while (c < 33) c = getchar(); n while (c > 33) { n a[i++] = c; n c = getchar(); n } n a[i] = 0; n return i; n } n const int N = 100005; n int main() { n int n, k; n scani(n), scani(k); n int ans; n ans = (2 * n + k - 1) / k + (5 * n + k - 1) / k + (8 * n + k - 1) / k; n write(ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline bool uin(T& a, T b) { n return a > b ? (a = b, true) : false; n } n template n inline bool uax(T& a, T b) { n return a < b ? (a = b, true) : false; n } n const int nax = 5123; n pair edge[nax]; n vector g[nax]; n int col[nax]; n int N, M; n bool cycle_found = false; n int dfs_num[nax]; n void dfs(int v) { n dfs_num[v] = 1; n for (int i : g[v]) { n int ch = edge[i].first ^ edge[i].second ^ v; n if (dfs_num[ch] == 2) { n continue; n } else if (dfs_num[ch] == 1) { n col[i] = 1; n cycle_found = true; n continue; n } n dfs(ch); n } n dfs_num[v] = 2; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> N >> M; n for (int u, v, i = 0; i < M; ++i) { n cin >> u >> v; n --u, --v; n edge[i] = make_pair(u, v); n g[u].push_back(i); n } n for (int i = 0; i < N; ++i) n if (dfs_num[i] != 2) dfs(i); n cout << (cycle_found ? 2 : 1) << n ; n for (int i = 0; i < M; ++i) cout << col[i] + 1 << n [i == M - 1]; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, mid, rt, res, a[200010], f[200010], sz[200010]; n vector e[200010]; n void dfs(int u, int fa) { n f[u] = sz[u] = 1; n int m1 = 0, m2 = 0; n for (auto v : e[u]) { n if (v == fa) continue; n dfs(v, u); n sz[u] += sz[v]; n if (f[v] == sz[v]) n f[u] += f[v]; n else { n if (f[v] > m1) swap(f[v], m1); n if (f[v] > m2) swap(f[v], m2); n } n } n f[u] = a[u] < mid ? 0 : f[u] + m1; n res = max(res, f[u] + m2); n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1; i < n; i++) { n int u, v; n scanf( %d%d , &u, &v); n e[u].push_back(v); n e[v].push_back(u); n } n rt = min_element(a + 1, a + 1 + n) - a; n int l = 0, r = 1000010, ans; n while (l <= r) { n mid = (l + r) >> 1; n res = 0; n dfs(rt, 0); n if (res >= m) n l = mid + 1, ans = mid; n else n r = mid - 1; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool used[10000005]; n int ans[105]; n bool comp(pair, int> a, pair, int> b) { n if (a.first.second == b.first.second) return a.first.first < b.first.first; n return a.first.second < b.first.second; n } n void solve() { n int N; n cin >> N; n vector, int>> x(N); n for (int i = 0; i < N; i++) { n cin >> x[i].first.first >> x[i].first.second; n x[i].second = i; n } n sort(x.begin(), x.end(), comp); n for (int i = 0; i < N; i++) { n for (int j = x[i].first.first; j < x[i].first.second + 1; j++) { n if (!used[j]) { n used[j] = true; n ans[x[i].second] = j; n break; n } n } n } n for (int i = 0; i < N; i++) { n cout << ans[i] << ; n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MAXN = 200100, M = 1000000009; n string s; n long long n, ans = 0, a[MAXN], b[MAXN]; n void obra(long long v) { n long long tc = 0, k = a[v]; n for (long long i = 0; i < n; i++) { n b[i] = a[i] + k / n; n if (i == v) b[i] -= a[i]; n } n k %= 14; n for (long long i = 0; i < k; i++) { n b[(v + 1 + i) % n]++; n } n for (long long i = 0; i < n; i++) { n if (b[i] % 2 == 0) { n tc += b[i]; n } n } n if (ans < tc) ans = tc; n } n int main() { n ios_base::sync_with_stdio(0); n n = 14; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n } n for (long long i = 0; i < n; i++) obra(i); n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n long long arr[n]; n for (int i = 0; i < n; i++) scanf( %lld , &arr[i]); n map mp; n long long sum = 0; n for (int i = n - 1; i >= 0; i--) { n sum += arr[i]; n mp[sum] = i; n } n long long ans = 0; n long long cnt = 0; n for (int i = 0; i < n; i++) { n cnt += arr[i]; n if (mp[cnt] > i && mp[cnt] != 0) { n ans = max(cnt, ans); n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ld = long double; n template n T &chmin(T &a, const T &b) { n return a = min(a, b); n } n template n T &chmax(T &a, const T &b) { n return a = max(a, b); n } n template n T inf; n template <> n constexpr int inf = 1e9; n template <> n constexpr ll inf = 1e18; n template <> n constexpr ld inf = 1e30; n struct yes_no : numpunct { n string_type do_truename() const { return Yes ; } n string_type do_falsename() const { return No ; } n }; n int N, K; n int A[501000]; n int main() { n locale loc(locale(), new yes_no); n cout << boolalpha; n cout.imbue(loc); n scanf( %d%d , &K, &N); n for (int i = 0; i < (int)(N); i++) scanf( %d , &A[i]); n sort(A, A + N); n set> index_value, value_index; n for (int i = 0; i < (int)(N - 1); i++) { n const int val = A[i + 1] - A[i]; n index_value.emplace(i, val); n value_index.emplace(val, i); n } n index_value.emplace(-1, inf); n index_value.emplace(N, inf); n value_index.emplace(inf, -1); n value_index.emplace(inf, N); n ll res = 0; n for (int loop = 0; loop < (int)(K); loop++) { n int v, l, r; n ll val, lval, rval; n tie(val, v) = *begin(value_index); n auto it = index_value.lower_bound(make_pair(v, val)); n tie(l, lval) = *prev(it); n tie(r, rval) = *next(it); n index_value.erase(make_pair(v, val)); n index_value.erase(make_pair(l, lval)); n index_value.erase(make_pair(r, rval)); n value_index.erase(make_pair(val, v)); n value_index.erase(make_pair(lval, l)); n value_index.erase(make_pair(rval, r)); n index_value.emplace(v, lval + rval - val); n value_index.emplace(lval + rval - val, v); n res += val; n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector childs[100000 + 1]; n long long s[100000 + 1]; n int p[100000 + 1]; n long long a[100000 + 1]; n bool flag = false; n void fill(int v, long long prevsum) { n if (s[v] != -1) { n a[v] = s[v] - prevsum; n if (a[v] < 0) flag = true; n for (int i = 0; i < childs[v].size(); ++i) { n fill(childs[v][i], s[v]); n } n } else { n long long mi = 1000000001; n for (int i = 0; i < childs[v].size(); ++i) { n mi = min(mi, s[childs[v][i]]); n } n if (mi == 1000000001) mi = prevsum; n a[v] = mi - prevsum; n if (a[v] < 0) flag = true; n for (int i = 0; i < childs[v].size(); ++i) { n fill(childs[v][i], mi); n } n } n } n int main() { n int n; n cin >> n; n for (int i = 0; i < n; ++i) { n childs[i].clear(); n } n for (int i = 2; i < n + 1; ++i) { n cin >> p[i]; n childs[p[i]].push_back(i); n } n for (int i = 1; i < n + 1; ++i) { n cin >> s[i]; n } n fill(1, 0); n if (flag) n cout << -1 << endl; n else { n long long sum = 0; n for (int i = 1; i < n + 1; ++i) { n sum += a[i]; n } n cout << sum << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n string a, b; n int i, ax, ay, bx, by; n int main() { n cin >> a >> b; n for (i = 0; i < a.length(); i++) n if (a[i] == 1 ) n ax++; n else n ay++; n for (i = 0; i <= b.length(); i++) n if (b[i] == 1 ) n bx++; n else n by++; n if (ax % 2 == 1) ax++; n if (ax < bx) n cout << NO ; n else n cout << YES ; n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:200000 ) n const int INF = 1e9 + 7; n const double EPS = 1e-6; n const double pi = acos(-1); n const int MOD = 1e9 + 7; n const int N = 1e5 + 1000; n using namespace std; n double mid; n struct node { n int pos, val; n node() { pos = val = 0; } n node(int a, int b) { n pos = a; n val = b; n } n bool operator<(node a) const { n if (val != a.val) return val < a.val; n if (abs(mid - pos * 1.0) != abs(mid - a.pos * 1.0)) n return abs(mid - pos * 1.0) < abs(mid - a.pos * 1.0); n return pos < a.pos; n } n }; n int n, m, ans[N]; n set st; n int main() { n cin >> n >> m; n mid = (m + 1) * 0.5; n for (int i = 1; i <= m; i++) { n st.insert(node(i, 0)); n } n for (int i = 1; i <= n; i++) { n auto it = *st.begin(); n st.erase(it); n it.val++; n ans[i] = it.pos; n st.insert(it); n } n for (int i = 1; i <= n; i++) cout << ans[i] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, x, y; n int b[1005], a[1005]; n int F1[1005], F2[1005]; n int main() { n char ch; n cin >> n >> m >> x >> y; n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) { n cin >> ch; n if (ch == # ) b[j]++; n } n for (int i = 1; i <= m; ++i) a[i] = a[i - 1] + b[i]; n for (int i = 1; i <= m; ++i) { n F1[i] = 10000000; n F2[i] = 10000000; n } n for (int i = x; i <= y; ++i) { n F1[i] = a[i]; n F2[i] = n * i - a[i]; n } n for (int i = x + 1; i <= m; ++i) { n for (int j = x; j <= y; ++j) n if (i - j >= x) { n if (F1[i] > F2[i - j] + a[i] - a[i - j]) n F1[i] = F2[i - j] + a[i] - a[i - j]; n if (F2[i] > F1[i - j] + n * j - a[i] + a[i - j]) n F2[i] = F1[i - j] + n * j - a[i] + a[i - j]; n } n } n if (F1[m] > F2[m]) n cout << F2[m]; n else n cout << F1[m]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, op; n string tes; n int main() { n cin >> n >> k >> ws >> tes; n op = 0; n for (int i = 1; i < n; i++) n if (tes.substr(0, i) == tes.substr(n - i, i)) op = i; n cout << tes; n tes = tes.substr(op, tes.length()); n for (int i = 1; i < k; i++) cout << tes; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char x[100100]; n long x2[100100]; n long mes[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; n long wr = 0; n long res, cur, repsmax = -1; n long reps = 0; n long tmp1, tmp2, tmp3; n string s1; n int compare(const void *a, const void *b) { return (*(long *)a - *(long *)b); } n long check(long z) { n if ((isdigit(x[z])) && (isdigit(x[z + 1])) && (isdigit(x[z + 3])) && n (isdigit(x[z + 4])) && (isdigit(x[z + 6])) && (isdigit(x[z + 7])) && n (isdigit(x[z + 8])) && (isdigit(x[z + 9]))) { n if ((x[z + 2] == x[z + 5]) && (x[z + 2] == - )) { n tmp1 = n ((long)(x[z]) - (long)( 0 )) * 10 + ((long)(x[z + 1]) - (long)( 0 )); n tmp2 = ((long)(x[z + 3]) - (long)( 0 )) * 10 + n ((long)(x[z + 4]) - (long)( 0 )); n tmp3 = ((long)(x[z + 6]) - (long)( 0 )) * 1000 + n ((long)(x[z + 7]) - (long)( 0 )) * 100 + n (((long)(x[z + 8]) - (long)( 0 )) * 10) + n ((long)(x[z + 9]) - (long)( 0 )); n if ((tmp2 <= 12) && (tmp3 <= 2015) && (tmp3 >= 2013)) { n if ((tmp1 <= mes[tmp2]) && (tmp2 != 0) && (tmp1 != 0)) { n x2[wr++] = tmp1 + tmp2 * 100 + tmp3 * 10000; n } n } n } n } n if ((!isdigit(x[z + 9])) && (x[z + 9] != - )) { n return -2; n } n } n int main(int argc, char *argv[]) { n scanf( %s , &x); n long j = 0; n while (check(j++) > -2) { n } n qsort(x2, wr - 1, sizeof(long), compare); n cur = x2[0]; n for (long j = 0; j < wr; j++) { n if (cur == x2[j]) { n reps++; n } else { n if (reps > repsmax) { n repsmax = reps; n res = cur; n } n cur = x2[j]; n reps = 1; n } n } n if (reps > repsmax) { n repsmax = reps; n res = cur; n } n cur = x2[j]; n reps = 1; n ldiv_t divresult1; n divresult1 = ldiv(res, 100); n if (divresult1.rem < 10) { n cout << 0 ; n } n cout << divresult1.rem << - ; n ldiv_t divresult2; n divresult2 = ldiv(res, 10000); n if (((divresult2.rem - divresult1.rem) / 100) < 10) { n cout << 0 ; n } n cout << (divresult2.rem - divresult1.rem) / 100 << - ; n ldiv_t divresult3; n divresult3 = ldiv(res, 100000000); n cout << (divresult3.rem - divresult2.rem) / 10000; n return EXIT_SUCCESS; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100005; n int n, m; n vector > e[N]; n vector ans[2]; n bool fla[2], flag; n int E[N], d[N]; n vector cnt[2]; n void DFS(int first, int o, int res) { n if (flag) return; n d[first] = o; n cnt[o].push_back(first); n for (auto& i : e[first]) { n if (flag) return; n int second = (i.second + o) % 2; n if (d[i.first] == -1) n DFS(i.first, second != res, res); n else if (d[i.first] != (second != res)) n flag = true; n } n } n void SOLVE(int res) { n memset(d, -1, sizeof(d)); n flag = false; n for (int i(1); i <= n; i++) n if (d[i] == -1) { n cnt[0].clear(); n cnt[1].clear(); n DFS(i, 0, res); n if (flag) { n fla[res] = true; n return; n } n for (bool ___ = 1; ___; ___ = 0) { n int mx = (cnt[1].size() < cnt[0].size()); n for (auto& i : cnt[mx]) ans[res].push_back(i); n } n } n } n int main() { n n = ({ n long long first = 0; n int n = 0, c = getchar(); n for (; !isdigit(c); c = getchar()) n = c == - ; n for (; isdigit(c); c = getchar()) first = first * 10 + c - 0 ; n n ? -first : first; n }), n m = ({ n long long first = 0; n int n = 0, c = getchar(); n for (; !isdigit(c); c = getchar()) n = c == - ; n for (; isdigit(c); c = getchar()) first = first * 10 + c - 0 ; n n ? -first : first; n }); n for (int i(1); i <= m; i++) { n int first = ({ n long long first = 0; n int n = 0, c = getchar(); n for (; !isdigit(c); c = getchar()) n = c == - ; n for (; isdigit(c); c = getchar()) first = first * 10 + c - 0 ; n n ? -first : first; n }), n second = ({ n long long first = 0; n int n = 0, c = getchar(); n for (; !isdigit(c); c = getchar()) n = c == - ; n for (; isdigit(c); c = getchar()) first = first * 10 + c - 0 ; n n ? -first : first; n }); n int c = ({ n char c = getchar(); n while (c == || c == n ) c = getchar(); n c; n }) == R ; n e[first].push_back({second, c}); n e[second].push_back({first, c}); n } n SOLVE(0); n SOLVE(1); n for (bool ___ = 1; ___; ___ = 0) { n int res; n if (fla[0] && fla[1]) n return cout << -1 << n , 0; n else if (fla[0]) n res = 1; n else if (fla[1]) n res = 0; n else if (ans[0].size() < ans[1].size()) n res = 0; n else n res = 1; n cout << ans[res].size() << n ; n for (auto& i : ans[res]) cout << i << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n class BLongtailHedgehog { n public: n int N, M; n vector dist, deg_in, deg; n vector> G; n void input(std::istream& in, std::ostream& out) { n ios_base::sync_with_stdio(false); n in >> N >> M; n dist = vector(N, -1); n deg_in = vector(N, 0); n deg = vector(N, 0); n G = vector>(N, vector()); n for (int(i) = (0); (i) < (M); ++(i)) { n int u, v; n in >> u >> v; n u--, v--; n if (u > v) swap(u, v); n G[u].push_back(v); n deg_in[v]++, deg[u]++, deg[v]++; n } n } n void bfs(int s) { n queue q; n dist[s] = 1, q.push(s); n while (!q.empty()) { n int u = q.front(); n q.pop(); n for (auto v : G[u]) { n deg_in[v]--; n dist[v] = max(dist[v], dist[u] + 1); n if (deg_in[v] == 0) { n q.push(v); n } n } n } n } n void solve(std::istream& in, std::ostream& out) { n input(in, out); n for (int(i) = (0); (i) < (N); ++(i)) { n if (dist[i] == -1) bfs(i); n } n long long ans = 0; n for (int(i) = (0); (i) < (N); ++(i)) ans = max(ans, 1LL * dist[i] * deg[i]); n out << ans << n ; n } n }; n int main() { n BLongtailHedgehog solver; n std::istream& in(std::cin); n std::ostream& out(std::cout); n solver.solve(in, out); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void hi() { n static long long i = 0; n cout << Check Point : << ++i << n ; n return; n } n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n long long t; n t = 1; n while (t--) { n string str; n cin >> str; n long long n = str.length(); n stack stk; n for (long long i = 0; i < n; i++) { n if (!stk.empty() && ((stk.top() == + && str[i] == + ) || n ((stk.top() == - && str[i] == - )))) { n stk.pop(); n } else { n stk.push(str[i]); n } n } n if (stk.empty()) { n cout << Yes n << n ; n } else { n cout << No n << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 400010; n int gcds[N], a[N], b[N]; n int c[N], mx[N]; n int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } n int main() { n int n; n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i - 1]); n gcds[i] = gcd(i, n); n } n long long ans = 0; n for (int i = 1; i < n; i++) { n if (n % i) continue; n for (int j = 1; j <= n; j++) c[j] = c[j - 1] + (i == gcds[j]); n for (int j = 0; j < i; j++) mx[j] = a[j]; n for (int j = i; j < n; j++) mx[j % i] = max(mx[j % i], a[j]); n for (int j = 0; j < n; j++) b[j] = b[j + n] = mx[j % i] == a[j]; n for (int j = 2 * n - 2; j >= 0; j--) n if (b[j]) b[j] += b[j + 1]; n for (int j = 0; j < n; j++) ans += c[min(n - 1, b[j])]; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[23][23]; n char s[23][23]; n int dp[1 << 23]; n int n, m; n int cost[23][23]; n int st[23][23]; n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < n; i++) scanf( %s , s[i]); n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) scanf( %d , &a[i][j]); n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) { n int mx = -0x3f3f3f3f; n int ans = 0; n for (int k = 0; k < n; k++) { n if (s[i][j] == s[k][j]) { n ans += a[k][j]; n mx = max(mx, a[k][j]); n st[i][j] |= 1 << k; n } n } n ans -= mx; n cost[i][j] = ans; n } n for (int i = 1; i < (1 << n); i++) dp[i] = 0x3f3f3f3f; n dp[0] = 0; n for (int i = 0; i < (1 << n); i++) n for (int j = 0; j < n; j++) n if ((i & (1 << j)) == 0) { n for (int k = 0; k < m; k++) { n dp[i | (1 << j)] = min(dp[i | (1 << j)], dp[i] + a[j][k]); n dp[i | st[j][k]] = min(dp[i | st[j][k]], dp[i] + cost[j][k]); n } n } n printf( %d n , dp[(1 << n) - 1]); n return 0; n } n "} +{"func_code_string": "#include n long long int a[300000]; n int main() { n long long int n, i, hei, bai; n while (scanf( %lld , &n) != EOF) { n hei = bai = 0; n for (i = 0; i < n; i++) { n scanf( %lld , &a[i]); n if (i % 2) { n hei += (a[i] + 1) / 2; n bai += a[i] / 2; n } else { n bai += (a[i] + 1) / 2; n hei += a[i] / 2; n } n } n printf( %lld n , bai < hei ? bai : hei); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = INT_MAX; n const long long INFL = LLONG_MAX; n const int output_precision = 15; n const long double pi = acos(-1); n const bool debug = true; n int N; n int A[5]; n int check() { n vector B(4); n for (int(i) = 1, j1234 = 4; (i) <= j1234; (i)++) B[i - 1] = A[i]; n sort(B.begin(), B.end()); n int x1 = B[0] + B[1] + B[2] + B[3]; n int x2 = 2 * (B[1] + B[2]); n int x3 = 4 * (B[3] - B[0]); n return x1 == x2 && x2 == x3; n } n int main() { n ios_base::sync_with_stdio(0); n cout.precision(output_precision); n cout << fixed; n cout.tie(0); n cin >> N; n for (int(i) = 1, j1234 = N; (i) <= j1234; (i)++) cin >> A[i]; n if (N == 0) { n cout << YES << n ; n cout << 1 << n ; n cout << 1 << n ; n cout << 3 << n ; n cout << 3 << n ; n return 0; n } n if (N == 1) { n int a = A[1]; n cout << YES << n ; n cout << a << n ; n cout << 3 * a << n ; n cout << 3 * a << n ; n return 0; n } n if (N == 2) { n for (int(x) = 1, j1234 = 1500; (x) <= j1234; (x)++) n for (int(y) = 1, j1234 = 1500; (y) <= j1234; (y)++) { n A[3] = x; n A[4] = y; n if (check()) { n cout << YES << n ; n cout << x << n ; n cout << y << n ; n return 0; n } n } n cout << NO << n ; n return 0; n } n if (N == 3) { n for (int(i) = 1, j1234 = 1500; (i) <= j1234; (i)++) { n A[4] = i; n if (check()) { n cout << YES << n ; n cout << i << n ; n return 0; n } n } n cout << NO << n ; n return 0; n } n if (N == 4) { n if (check()) { n cout << YES << n ; n } else { n cout << NO << n ; n } n return 0; n } n } n "} +{"func_code_string": "#include n using namespace std; n void islam() { n ios::sync_with_stdio(false); n cin.tie(NULL); n } n void get(long long &x) { cin >> x; } n class ghost { n public: n ghost() { n get(n); n for (int i = 0; i < n; i++) { n get(arr[i]); n s += arr[i]; n } n s /= n; n } n void solve() { n long long c = 0; n for (int i = 0; i < n; i++) { n c += s - arr[i]; n a += abs(c); n } n } n void print() { cout << a; } n n private: n long long n, s; n long long arr[50000 + 10], a = 0; n }; n int main() { n islam(); n ghost x; n x.solve(); n x.print(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool isAscending(const vector& vec) { n for (int i = 1; i < vec.size(); ++i) { n if (vec[i - 1] >= vec[i]) { n return false; n } n } n return true; n } n bool Requal(const vector& av, const vector& bv) { n for (int i = 0; i < av.size(); ++i) { n if (av[i] != bv[bv.size() - i - 1]) { n return false; n } n } n return true; n } n bool Equal(const vector& av, const vector& bv) { n for (int i = 0; i < av.size(); ++i) { n if (av[i] != bv[i]) { n return false; n } n } n return true; n } n int main() { n std::ios_base::sync_with_stdio(false); n std::cin.tie(nullptr); n int len; n cin >> len; n vector av(len), bv(len); n for (auto&& e : av) { n cin >> e; n } n for (auto&& e : bv) { n cin >> e; n } n if (len == 1) { n if (av[0] == bv[0]) { n cout << SMALL << endl; n cout << 0 << endl; n cout << endl; n } else { n cout << IMPOSSIBLE << endl; n } n return 0; n } n if (len == 2) { n int64_t total = 0; n vector> buf; n string res; n if (av[0] > av[1]) { n swap(av[0], av[1]); n res += R ; n } n while (1) { n if (bv[0] > bv[1]) { n swap(bv[0], bv[1]); n buf.push_back({ R , 1}); n } n if (bv[0] == av[0]) { n if (bv[1] >= av[1] && ((bv[1] - av[1]) % bv[0]) == 0) { n buf.push_back({ P , (bv[1] - av[1]) / bv[0]}); n total += (bv[1] - av[1]) / bv[0]; n } else { n total = -1; n } n break; n } n if (bv[0] == bv[1]) { n total = -1; n break; n } n buf.push_back({ P , bv[1] / bv[0]}); n bv[1] = bv[1] % bv[0]; n total += buf.back().second; n if (bv[1] == 0) { n bv[1] = bv[0]; n total--; n buf.back().second--; n } n } n if (total < 0) { n cout << IMPOSSIBLE << endl; n return 0; n } n if (total > 200000) { n cout << BIG << endl; n cout << total << endl; n } else { n cout << SMALL << endl; n for (auto it = buf.rbegin(); it != buf.rend(); ++it) { n for (int i = 0; i < it->second; ++i) { n res += it->first; n } n } n cout << res.size() << endl; n cout << res << endl; n } n return 0; n } n int64_t total = 0; n string res; n while (1) { n if (Equal(av, bv)) { n break; n } n if (Requal(av, bv)) { n res += R ; n break; n } n if (bv[0] > bv[1]) { n reverse(begin(bv), end(bv)); n res += R ; n } n if (isAscending(bv) and bv[0] > 0) { n for (int i = len; i-- > 1;) { n bv[i] -= bv[i - 1]; n } n res += P ; n ++total; n } else { n res = ; n break; n } n } n if (res == ) { n cout << IMPOSSIBLE << endl; n } else if (total > 200000) { n cout << BIG << endl; n cout << total << endl; n } else { n cout << SMALL << endl; n reverse(begin(res), end(res)); n cout << res.size() << endl; n cout << res << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, i, j, k, l, m, t; n int a[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; n int main() { n cin >> m >> t; n a[m] -= 7 - t + 1; n if (a[m] % 7 == 0) { n cout << a[m] / 7 + 1; n } else { n cout << a[m] / 7 + 2; n } n } n "} +{"func_code_string": "#include n using namespace std; n queue fila; n struct G { n double d; n int m, p, r; n } g[250002]; n bool mk[250002]; n int a2[9000000]; n bool cmp2(int a, int b) { return g[a].d < g[b].d; } n int pos = 0; n int ind = 0; n struct T { n int m; n int* e; n void pdt(int a, int* b) { m = a, e = b; } n } mas[2 * 250002]; n bool cmp(T a, T b) { return a.m < b.m; } n int ls[4 * 250002]; n int s[4 * 250002][2]; n int r[4 * 250002]; n int build(int a, int b, int f) { n int p = ind++; n ls[p] = pos; n r[p] = b; n int i = ls[f]; n for (int i = ls[f]; a2[i] >= 0; i++) { n if (g[a2[i]].m >= a && g[a2[i]].m <= b) a2[pos] = a2[i], pos++; n } n a2[pos] = -1; n pos++; n if (a != b) n s[p][0] = build(a, (a + b) / 2, p), n s[p][1] = build(((a + b) / 2) + 1, b, p); n else n s[p][0] = s[p][1] = -1; n return p; n } n void get(int p, int power, int ray) { n if (r[p] <= power) { n for (int i = ls[p]; a2[i] >= 0; i++) { n if (g[a2[i]].d <= ray + 1e-2) { n if (!mk[a2[i]]) fila.push(a2[i]), mk[a2[i]] = true; n ls[p] = i + 1; n } else n break; n } n } else { n get(s[p][0], power, ray); n if (power > r[s[p][0]]) get(s[p][1], power, ray); n } n } n int main() { n double x0, y0; n int pp, rr, n; n scanf( %lf %lf %d %d %d , &x0, &y0, &pp, &rr, &n); n int tot = 0; n mas[tot++].pdt(pp, &pp); n double x, y; n for (int i = 0; i < n; i++) { n scanf( %lf %lf %d %d %d , &x, &y, &g[i].m, &g[i].p, &g[i].r); n x -= x0; n y -= y0; n g[i].d = sqrt(x * x + y * y); n mk[i] = false; n a2[i] = i; n mas[tot++].pdt(g[i].m, &g[i].m), mas[tot++].pdt(g[i].p, &g[i].p); n } n a2[n] = -1; n sort(mas, mas + tot, cmp); n int v = 1; n int tmp = mas[0].m; n *mas[0].e = v; n for (int i = 1; i < tot; i++) { n if (mas[i].m != tmp) v++; n tmp = mas[i].m; n *mas[i].e = v; n } n sort(a2, a2 + n, cmp2); n r[0] = v; n ls[0] = 0; n ind = 1; n pos = n + 1; n if (n >= 2) s[0][0] = build(1, v / 2, 0), s[0][1] = build((v / 2) + 1, v, 0); n get(0, pp, rr); n int resp = 0; n while (fila.size()) { n resp++; n int u = fila.front(); n fila.pop(); n get(0, g[u].p, g[u].r); n } n printf( %d n , resp); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int run(int n) { n int i, a[n]; n for (i = 0; i < n; i++) cin >> a[i]; n sort(a, a + i); n int ans = 0; n int tempCount = 0; n for (i = 0; i < n; i++) { n tempCount++; n if (a[i] == tempCount) { n ans++; n tempCount = 0; n } n } n return ans; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n int n; n while (t--) { n cin >> n; n cout << run(n) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, s = 1; n char a; n string b[10], c; n cin >> n; n b[0] = ; n b[1] = ; n b[2] = 2 ; n b[3] = 3 ; n b[4] = 322 ; n b[5] = 5 ; n b[6] = 53 ; n b[7] = 7 ; n b[8] = 7222 ; n b[9] = 7332 ; n int k = 0; n int d = 0; n for (int i = 1; i <= n; i++) { n cin >> a; n s = a - 48; n if (s != 1 && s != 0) c = c + b[s]; n } n sort(c.begin(), c.end()); n k = c.size(); n for (int i = k - 1; i >= 0; i--) cout << c[i]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, n, k; n cin >> t; n while (t--) { n cin >> n >> k; n for (int i = 0; i < n; ++i) cout << (char)(i % k + a ); n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n; n scanf( %lld , &n); n long long int a[n]; n long long int i, j, k; n long long int ans = 0; n k = 0; n for (i = 0; i < n; i++) { n scanf( %lld , &j); n if (j == 1) { n a[k++] = i; n } n } n if (k == 0) { n ans = 0; n } else if (k == 1) { n ans = 1; n } else { n ans = 1; n for (i = 1; i < k; i++) { n if ((a[i] - a[i - 1]) == 1) { n ans++; n } else { n ans += 2; n } n } n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n int b[1000005], a[1000005]; n int main() { n int n, i; n scanf( %d , &n); n for (i = 0; i < n; i++) scanf( %d , &a[i]); n b[n - 1] = a[n - 1]; n for (i = n - 2; i >= 0; i--) b[i] = a[i] + a[i + 1]; n for (i = 0; i < n; i++) printf( %d , b[i]); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n namespace io { n template n inline void read(T &x) { n bool flag = false; n char c = getchar(); n while ((c < 0 || c > 9 ) && c != - ) c = getchar(); n c == - ? flag = true, x = 0 : x = c - 0 ; n c = getchar(); n while (c >= 0 && c <= 9 ) x = (x << 3) + (x << 1) + c - 0 , c = getchar(); n if (flag) x = -x; n } n template n inline void write(T x) { n char st[10010]; n int cnt = 0; n if (x < 0) x = -x, putchar( - ); n if (x == 0) putchar( 0 ); n while (x) { n st[++cnt] = x % 10 + 48; n x /= 10; n } n while (cnt) { n putchar(st[cnt--]); n } n } n } // namespace io n using namespace io; n int main() { n int a, ans = 0; n read(a); n while (a) { n ans += (a % 8 == 1); n a /= 8; n } n write(ans); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n const int N = 300010; n const int MOD = 1e9 + 7; n struct xxx { n int id; n char c; n } s[N]; n std::string a, b, c; n int gap, n; n int sa[N], lcp[N], rank[N], tmp[N], bucket[N], cnt[N][3], ans[N], dp[19][N], n fw[N]; n void update(int i, int v) { n while (i < N) { n fw[i] = (fw[i] + v) % MOD; n i += i & -i; n } n } n int query(int i) { n int res = 0; n while (i) { n res = (res + fw[i]) % MOD; n i -= i & -i; n } n if (res < 0) res += MOD; n return res; n } n int rmq(int f, int t) { n int k = 31 - __builtin_clz(t - f + 1); n int x = dp[k][f]; n int y = dp[k][t - (1 << k) + 1]; n if (lcp[x] < lcp[y]) return x; n return y; n } n void solve(int f, int t, int h) { n if (t - f + 1 < 3) return; n int m = rmq(f, t - 1); n int c0 = cnt[t][0] - cnt[f - 1][0]; n int c1 = cnt[t][1] - cnt[f - 1][1]; n int c2 = cnt[t][2] - cnt[f - 1][2]; n int v = lcp[m]; n int num = 1ll * c0 * c1 % MOD * c2 % MOD; n update(v + 1, -num); n update(h + 1, num); n solve(f, m, v); n solve(m + 1, t, v); n } n bool cmp2(int i, int j) { n i += gap; n j += gap; n if (i < n && j < n) return rank[i] < rank[j]; n return i > j; n } n bool cmp(int i, int j) { n if (rank[i] != rank[j]) return rank[i] < rank[j]; n i += gap; n j += gap; n if (i < n && j < n) return rank[i] < rank[j]; n return i > j; n } n int main() { n std::cin >> a >> b >> c; n int an = int(a.size()), bn = int(b.size()), cn = int(c.size()); n for (int i = 0; i < an; ++i) s[i].id = 0, s[i].c = a[i]; n for (int i = 0; i < bn; ++i) s[i + an + 1].id = 1, s[i + an + 1].c = b[i]; n for (int i = 0; i < cn; ++i) n s[i + an + bn + 2].id = 2, s[i + an + bn + 2].c = c[i]; n s[an].c = 1; n s[an + bn + 1].c = 2; n n = an + bn + cn + 2; n int rn = 255; n for (int i = 0; i < n; ++i) { n sa[i] = i; n rank[i] = s[i].c; n } n for (gap = 1;; gap <<= 1) { n int p = 0; n for (int i = n - 1; i + gap >= n; --i) tmp[p++] = i; n std::fill(bucket, bucket + rn, 0); n for (int i = 0; i + gap < n; ++i) ++bucket[rank[i + gap]]; n for (int i = 1; i < rn; ++i) bucket[i] += bucket[i - 1]; n for (int i = 0; i + gap < n; ++i) tmp[--bucket[rank[i + gap]] + p] = i; n std::fill(bucket, bucket + rn, 0); n for (int i = 0; i < n; ++i) ++bucket[rank[i]]; n for (int i = 1; i < rn; ++i) bucket[i] += bucket[i - 1]; n for (int i = n - 1; i >= 0; --i) sa[--bucket[rank[tmp[i]]]] = tmp[i]; n tmp[0] = 0; n for (int i = 1; i < n; ++i) tmp[i] = tmp[i - 1] + cmp(sa[i - 1], sa[i]); n for (int i = 0; i < n; ++i) rank[sa[i]] = tmp[i]; n if (tmp[n - 1] == n - 1) break; n rn = tmp[n - 1] + 1; n } n for (int i = 0, k = 0; i < n; ++i) { n if (rank[i] == n - 1) continue; n for (int j = sa[rank[i] + 1]; s[i + k].c == s[j + k].c;) ++k; n lcp[rank[i]] = k; n if (k) --k; n } n for (int i = 0; i < n - 1; ++i) dp[0][i] = i; n for (int j = 1; 1 << j < n; ++j) n for (int i = 0; i + (1 << j) - 1 < n - 1; ++i) { n int x = dp[j - 1][i]; n int y = dp[j - 1][i + (1 << (j - 1))]; n dp[j][i] = lcp[x] < lcp[y] ? x : y; n } n assert(s[sa[0]].c == 1); n assert(s[sa[1]].c == 2); n for (int i = 2; i < n; ++i) { n cnt[i][0] = cnt[i - 1][0]; n cnt[i][1] = cnt[i - 1][1]; n cnt[i][2] = cnt[i - 1][2]; n ++cnt[i][s[sa[i]].id]; n } n int sz = std::min(an, std::min(bn, cn)); n solve(2, n - 1, 0); n for (int i = 1; i <= sz; ++i) std::cout << query(i) << ; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:1073741824 ) n using namespace std; n const int N = 3e5 + 100; n int col[N], d[N][2]; n vector v[N]; n int main() { n #pragma warning(disable : 4996) n int n, m; n scanf( %d%d , &n, &m); n for (int i = 0; i < m; i++) { n int a, b; n scanf( %d%d , &a, &b); n a--, b--; n v[a].push_back(b); n v[b].push_back(a); n } n queue q; n for (int i = 0; i < n; i++) { n d[i][0] = v[i].size(); n if (d[i][0] > 1) q.push(i); n } n while (!q.empty()) { n int node = q.front(); n q.pop(); n if (d[node][col[node]] > 1) { n col[node] ^= 1; n for (int to : v[node]) { n d[to][col[node]]++; n d[to][col[node] ^ 1]--; n if (d[to][col[to]] > 1) q.push(to); n } n } n } n for (int i = 0; i < n; i++) printf( %d , col[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1000005; n const long long mod = 1e9 + 7; n const int N = 1e6; n vector rec[maxn]; n long long fac[maxn], ans; n int n, m; n int ord[maxn], bit; n bool comp(int a, int b) { return rec[a][bit] < rec[b][bit]; } n void mysort(int l, int r, int j) { n if (l == r) return; n bit = j; n sort(ord + l, ord + r + 1, comp); n int p = l; n while (p <= r && rec[ord[p]][j] == -1) ++p; n int cnt = 1; n for (int i = l + 1; i < p; i++) n if (rec[ord[i]][j - 1] == rec[ord[i - 1]][j - 1]) n ++cnt; n else { n (ans *= fac[cnt]) %= mod; n cnt = 1; n } n (ans *= fac[cnt]) %= mod; n int t = p; n while (t <= r) { n p = t; n while (p <= r && rec[ord[p]][j] == rec[ord[t]][j]) ++p; n mysort(t, p - 1, j + 1); n t = p; n } n } n int main() { n fac[0] = 1ll; n for (int i = 1; i <= N; i++) fac[i] = fac[i - 1] * i % mod; n scanf( %d %d , &n, &m); n for (int i = 1; i <= m; i++) rec[i].push_back(0); n for (int g, i = 1; i <= n; i++) { n scanf( %d , &g); n for (int v, j = 1; j <= g; j++) scanf( %d , &v), rec[v].push_back(i); n } n for (int i = 1; i <= m; i++) { n sort(rec[i].begin(), rec[i].end()); n rec[i].push_back(-1); n ord[i] = i; n } n ans = 1ll; n mysort(1, m, 1); n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int Power(int base, int exp) { n int ans = 1; n while (exp > 0) { n if (exp & 1) ans = (1LL * ans * base) % 1000000007; n exp = exp >> 1; n base = (1LL * base * base) % 1000000007; n } n return ans; n } n vector > p_CntS(2005); n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n long long int n; n cin >> n; n long double x[n], y[n]; n for (int i = 0; i < n; i += 1) cin >> x[i] >> y[i]; n long double slope; n for (int p1 = 0; p1 < n; p1 += 1) n for (int p2 = 0; p2 < n; p2 += 1) { n if (p1 == p2) continue; n slope = y[p2] - y[p1]; n if (x[p2] - x[p1] == 0) n p_CntS[p1][600.0]++; n else n p_CntS[p1][300.0 + slope / (x[p2] - x[p1])]++; n } n long long int ans = (1LL * n * (n - 1) * (n - 2)) / 6, ans_ = 0; n int cnt; n for (int i = 0; i < n; i += 1) { n map::iterator it = p_CntS[i].begin(); n while (it != p_CntS[i].end()) { n cnt = (*it).second; n ans_ += 1LL * cnt * (cnt - 1) / 2; n it++; n } n } n cout << ans - ans_ / 3 << n ; n } n "} +{"func_code_string": "#include n int ans = 0; n double H = 100, len = 100000; n int F[110000], T[110000], FF[110000], TT[110000]; n bool vis[110000]; n int judge(bool fuck, double st, double t) { n int ret = 0; n int top, flo; n double point = st; n memset(vis, 0, sizeof(vis)); n while (point < len) { n top = (int)ceil(point); n flo = (int)floor(point); n if (fuck) { n if (T[top] < 0 || T[flo] < 0 || T[top] != T[flo]) { n return -1; n } n if (vis[TT[top]] == 1) return -1; n ret += T[top]; n vis[TT[top]] = 1; n fuck = !fuck; n } else { n if (F[top] < 0 || F[flo] < 0 || F[top] != F[flo]) { n return -1; n } n if (vis[FF[top]] == 1) return -1; n ret += F[top]; n vis[FF[top]] = 1; n fuck = !fuck; n } n point += t; n } n if (ans < ret) ans = ret; n return ret; n } n int work() { n int n, i, j, val, x, y; n char c; n double A, B, t; n double hl, hr; n scanf( %lf%lf%d , &hl, &hr, &n); n memset(T, -1, sizeof(T)); n memset(F, -1, sizeof(F)); n for (i = 1; i <= n; i++) { n scanf( %d %c%d%d , &val, &c, &x, &y); n if (c == T ) { n for (j = x; j <= y; j++) T[j] = val, TT[j] = i; n } else { n for (j = x; j <= y; j++) F[j] = val, FF[j] = i; n } n } n A = hl / H; n B = hr / H; n for (i = 0; i <= 100; i++) { n if ((i & 1) == 0) { n t = len / (A + B + i); n judge(0, A * t, t); n } n if ((i & 1) == 1) { n t = len / ((1 - A) + B + i); n judge(1, (1 - A) * t, t); n } n if ((i & 1) == 1) { n t = len / (A + (1 - B) + i); n judge(0, A * t, t); n } n if ((i & 1) == 0) { n t = len / ((1 - A) + (1 - B) + i); n judge(1, (1 - A) * t, t); n } n } n printf( %d n , ans); n return 1; n } n int main() { n work(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct point { n int x, y; n point() {} n point(int x, int y) : x(x), y(y) {} n } p[1010]; n point operator-(const point &a, const point &b) { n return point(a.x - b.x, a.y - b.y); n } n long long operator*(const point &a, const point &b) { n return (long long)a.x * b.y - (long long)a.y * b.x; n } n int main() { n int n, i, x, y, low, high; n cin >> n; n for (i = 0; i < n; i++) { n cin >> x >> y; n p[i] = point(x, y); n } n low = p[0].x; n high = p[1].x; n if (low > high) swap(low, high); n p[n] = p[0]; n for (i = 0; i < n; i++) { n while (low <= high && (p[i + 1] - p[i]) * (point(low, p[0].y) - p[i]) > 0) n low++; n while (low <= high && (p[i + 1] - p[i]) * (point(high, p[0].y) - p[i]) > 0) n high--; n } n cout << high - low + 1 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 500000; n const long long minx = -0x5fffffffffffffff; n struct nn { n long long x, y; n nn() { y = minx; } n }; n int n, u, v; n nn num[N]; n vector node[N]; n long long dfs(int f, int x) { n for (int i = 0; i < node[x].size(); i++) { n if (node[x][i] == f) continue; n long long r = dfs(x, node[x][i]); n num[x].y += r; n } n return num[x].y; n } n long long dfs1(int f, int x, long long &ans) { n long long m1 = minx; n long long m2 = minx; n for (int i = 0; i < node[x].size(); i++) { n if (node[x][i] == f) continue; n long long r = dfs1(x, node[x][i], ans); n if (m1 < r) { n m2 = m1; n m1 = r; n } else if (m2 < r) { n m2 = r; n } n } n if (m2 != minx) { n if (ans < m1 + m2) ans = m1 + m2; n } n return m1 > num[x].y ? m1 : num[x].y; n } n int main() { n long long ans; n while (scanf( %d , &n) != EOF) { n ans = minx; n for (int i = 0; i < N; i++) node[i].clear(); n for (int i = 1; i <= n; i++) { n scanf( %lld , &num[i].x); n num[i].y = num[i].x; n } n for (int i = 0; i < n - 1; i++) { n scanf( %d%d , &u, &v); n node[u].push_back(v); n node[v].push_back(u); n } n dfs(0, 1); n dfs1(0, 1, ans); n if (ans != minx) n printf( %lld n , ans); n else n printf( Impossible n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n int n, k; n cin >> n >> k; n if (k > (n * n + 1) / 2) { n cout << NO ; n return 0; n } n cout << YES n ; n int tmp = 0; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n if (j % 2 == i % 2 && tmp != k) { n cout << L ; n tmp++; n } else n cout << S ; n } n cout << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n using namespace chrono; n const int infinity = (int)1e9 + 42; n const int64_t llInfinity = (int64_t)1e18 + 256; n const int module = (int)1e9 + 7; n const long double eps = 1e-8; n mt19937_64 randGen(system_clock().now().time_since_epoch().count()); n inline void raiseError(string errorCode) { n cerr << Error : << errorCode << endl; n exit(42); n } n inline int readAns(int req) { n cout << req << endl; n int q; n cin >> q; n if (q == 0) { n exit(0); n } n return q; n } n signed main() { n ios_base::sync_with_stdio(false); n int m, n; n cin >> m >> n; n vector v(n); n for (int i = 0; i < n; i++) { n v[i] = readAns(m) * -1; n } n int l = 1, r = m - 1; n int p = 0; n while (l != r) { n int m = (l + r) / 2; n int ans = readAns(m) * v[p]; n p++; n p %= n; n if (ans < 0) { n r = m - 1; n } else { n l = m + 1; n } n } n readAns(l); n assert(false); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int n, m; n string s, t; n cin >> n >> m >> s >> t; n bool can = false; n if (s == t) n can = true; n else { n if (n <= m + 1) { n for (int i = 0; i < int(n); i++) { n if (s[i] == * ) { n if (s.substr(0, i) == t.substr(0, i) && n s.substr(i + 1, string::npos) == n t.substr(m - (n - (i + 1)), string::npos)) n can = true; n } n } n } n } n cout << (can ? YES : NO ) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[200001], b[200001], c[200001]; n int main() { n long long n, ans = 0; n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) cin >> b[i]; n for (int i = 0; i < n; i++) c[i] = a[i] - b[i]; n sort(c, c + n); n for (int i = n - 1;; i--) { n if (c[i] <= 0) break; n int ans1 = &c[i] - upper_bound(c, c + n, 0 - c[i]); n ans += ans1; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int a, b; n if (n == 2) { n cout << 2 << endl; n } else n cout << 1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 10; n unsigned long long preLef[N], preRig[N], sum[N], a[N]; n map f, g; n int n, m; n unsigned long long Rand() { n return (unsigned long long)rand() * rand() * rand() + n (unsigned long long)rand() * rand() * rand(); n } n int main() { n srand(time(0)); n scanf( %d%d , &n, &m); n for (int i = 0, l, r; i < n; ++i) { n scanf( %d%d , &l, &r); n unsigned long long t = Rand(); n a[l] ^= t; n a[r + 1] ^= t; n preLef[l] ^= t; n preRig[r] ^= t; n } n for (int i = 1; i <= m + 1; ++i) { n a[i] ^= a[i - 1]; n sum[i] = sum[i - 1] ^ a[i]; n preLef[i] ^= preLef[i - 1]; n preRig[i] ^= preRig[i - 1]; n } n g[0] = 0; n f[0] = 1; n unsigned long long ans = 0; n for (int i = 1; i <= m; ++i) { n unsigned long long t = sum[i] ^ preLef[i]; n ans += f[t] * i - g[t]; n t = sum[i] ^ preRig[i]; n g[t] += i; n ++f[t]; n } n for (int i = 1, lf = 0; i <= m; ++i) n if (!a[i]) n ans -= (unsigned long long)(i - lf + 1) * (i - lf) / 2; n else n lf = i; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e4 + 5; n int n, a[N]; n int main() { n ios ::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n if (fopen( main.in , r )) freopen( main.in , r , stdin); n cin >> n; n for (int i = 1; i <= n; i++) cin >> a[i]; n int cnt = 0; n for (int i = 2; i < n; i++) n if (a[i - 1] == 1 && a[i + 1] == 1 && a[i] == 0) a[i + 1] = 0, cnt++; n cout << cnt; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[10]; n int main() { n int n, i, len; n long long wi = 1, he = 1; n scanf( %d , &n); n for (i = 1; i <= n; i++) { n scanf( %s , s); n len = strlen(s); n if (len == 4) { n wi++; n he++; n } else if (!strcmp(s, UL ) || !strcmp(s, DR )) n wi++; n else if (!strcmp(s, UR ) || !strcmp(s, DL )) n he++; n } n printf( %I64d n , wi * he); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string rotate(string s, int off, int* a) { n string new_s(s); n for (int i = 0; i < 4; i++) new_s[a[(i + off) % 4] - 1] = s[a[i] - 1]; n return new_s; n } n string rotate1(string s, int off) { n int a[] = {1, 3, 5, 6}; n return rotate(s, off, a); n } n string rotate2(string s, int off) { n int a[] = {2, 6, 4, 3}; n return rotate(s, off, a); n } n int main() { n string s; n cin >> s; n sort(s.begin(), s.end()); n map m; n int ans = 0; n do { n bool flg = true; n map mm; n for (int i = 0; i < 4; i++) { n string b = rotate1(s, i); n for (int j = 0; j < 4; j++) { n string bb = rotate2(b, j); n if (mm.find(bb) == mm.end()) n if (m.find(bb) != m.end()) flg = false; n mm[bb] = m[bb] = 1; n } n } n if (flg) ans++; n } while (next_permutation(s.begin(), s.end())); n cout << ans; n return 0; n } n "} +{"func_code_string": " n // Problem: A. Searching Local Minimum n // Contest: Codeforces - Codeforces Round #700 (Div. 1) n // URL: https://codeforces.com/contest/1479/problem/A n // Memory Limit: 512 MB n // Time Limit: 2000 ms n // Powered by CP Editor (https://github.com/cpeditor/cpeditor) n n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #pragma GCC optimize ( -O3 ) n n using namespace std; n n #define watch(x) cout << (#x) << = << (x) << endl n #define PI double(2 * acos(0.0)) n #define LL long long n #define MOD 1000000007 n #define all(x) (x).begin(), (x).end() n #define INF 1e15 n int query(int a, int n){ n if(a == 0 || a == n + 1){ n return 1e7; n } n cout << ? << a << endl; n int p; n cin >> p; n return p; n } n int helper(int a, int n){ n int left = a - 1; n int right = a + 1; n int mid = a; n int p = query(left, n); n int q = query(mid, n); n int r = query(right, n); n if(p > q && q < r){ n return 0; n } n if(p < q){ n return 2; n } n else{ n return 1; n } n } n int main() { n int n; n cin >> n; n int start = 1; n int end = n; n int ans = -1; n while(start <= end){ n int mid = (start + end) / 2; n int p = helper(mid, n); n if(p == 0){ n ans = mid; n break; n } n if(p == 1){ n start = mid + 1; n }else{ n end = mid - 1; n } n } n cout << ! << ans << endl; n } n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n n "} +{"func_code_string": "#include n using namespace std; n const int INF = INT_MAX; n const long long INFL = LLONG_MAX; n const long double pi = acos(-1); n class SumSegTree { n private: n vector sum, lazy; n int N; n void check_index(int i) { n if (i < 0 || N <= i) { n throw index out of bound ; n } n } n n public: n SumSegTree(int N) { n this->N = 1; n while (this->N < N) this->N <<= 1; n this->sum.resize(this->N << 1); n this->lazy.resize(this->N << 1); n } n long long get_sum(int l, int r) { n check_index(l); n check_index(r); n return get_sum(l, r, 0, N - 1, 1); n } n void add(int l, int r, int val) { n check_index(l); n check_index(r); n add(l, r, val, 0, N - 1, 1); n } n void delegate(int a, int b, int n) { n sum[n] += (b - a + 1) * lazy[n]; n if (a < b) { n lazy[n * 2] += lazy[n]; n lazy[n * 2 + 1] += lazy[n]; n } n lazy[n] = 0; n } n long long get_sum(int l, int r, int a, int b, int n) { n if (b < l || r < a) return 0; n if (lazy[n] != 0) delegate(a, b, n); n if (l <= a && b <= r) return sum[n]; n int m = (a + b) / 2; n return get_sum(l, r, a, m, n * 2) + get_sum(l, r, m + 1, b, n * 2 + 1); n } n void add(int l, int r, long long val, int a, int b, int n) { n if (b < l || r < a) return; n if (l <= a && b <= r) { n if (a == b) n sum[n] += val; n else n lazy[n] += val; n } else { n int m = (a + b) / 2; n if (lazy[n] != 0) delegate(a, b, n); n sum[n] += (min(b, r) - max(a, l) + 1) * val; n add(l, r, val, a, m, n * 2); n add(l, r, val, m + 1, b, n * 2 + 1); n } n } n }; n int N, M; n vector adj[300100]; n vector > query[300100]; n SumSegTree segt(300005); n long long ans[300100]; n void dfs(int u, int prev, int h) { n for (int(i) = 0; (i) < (int((query[u]).size())); (i)++) { n int dist = query[u][i].first; n long long value = query[u][i].second; n segt.add(h, min(N, h + dist), value); n } n ans[u] = segt.get_sum(h, h); n for (int(i) = 0; (i) < (int((adj[u]).size())); (i)++) { n int v = adj[u][i]; n if (v == prev) continue; n dfs(v, u, h + 1); n } n for (int(i) = 0; (i) < (int((query[u]).size())); (i)++) { n int dist = query[u][i].first; n long long value = query[u][i].second; n segt.add(h, min(N, h + dist), -value); n } n } n int main() { n ios_base::sync_with_stdio(0); n cout.precision(15); n cout << fixed; n cout.tie(0); n cin.tie(0); n cin >> N; n for (int(i) = 1; (i) <= (N - 1); (i)++) { n int a, b; n cin >> a >> b; n adj[a].push_back(b); n adj[b].push_back(a); n } n cin >> M; n for (int(i) = 1; (i) <= (M); (i)++) { n int v, d; n long long x; n cin >> v >> d >> x; n query[v].push_back(make_pair(d, x)); n } n dfs(1, 0, 0); n for (int(i) = 1; (i) <= (N); (i)++) n cout << ans[i] << (i + 1 <= N ? : n ); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n pair home, uni; n cin >> home.first >> home.second >> uni.first >> uni.second; n int count; n cin >> count; n int solution = 0; n int64_t a, b, c; n for (int i = 0; i < count; i++) { n cin >> a >> b >> c; n bool h_p = a * home.first + b * home.second + c > 0; n bool u_p = a * uni.first + b * uni.second + c > 0; n if ((h_p && !u_p) || (!h_p && u_p)) { n solution++; n } n } n cout << solution << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main(void) { n int n; n char str[102][102]; n scanf( %d , &n); n bool row, col; n row = col = false; n for (int i = 0; i < n; i++) { n scanf( %s , str[i]); n bool bolong = false; n for (int j = 0; j < n; j++) { n if (str[i][j] == . ) { n bolong = true; n } n } n if (!bolong) { n row = true; n } n } n if (!row) { n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n if (str[i][j] == . ) { n printf( %d %d n , i + 1, j + 1); n break; n } n } n } n return 0; n } n for (int i = 0; i < n; i++) { n bool bolong = false; n for (int j = 0; j < n; j++) { n if (str[j][i] == . ) bolong = true; n } n if (!bolong) col = true; n } n if (!col) { n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n if (str[j][i] == . ) { n printf( %d %d n , j + 1, i + 1); n break; n } n } n } n } else n printf( -1 ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937_64 rng( n (unsigned)chrono::system_clock::now().time_since_epoch().count()); n const long double error = 1e-7; n const long double PI = acosl(-1); n const int nmax = 2e5 + 10; n int master[nmax]; n int sz[nmax]; n void init(int u) { n master[u] = u; n sz[u] = 1; n return; n } n int fnd(int u) { n if (master[u] == u) return u; n return master[u] = fnd(master[u]); n } n bool unite(int u, int v) { n u = fnd(u); n v = fnd(v); n if (u == v) return false; n if (sz[u] < sz[v]) swap(u, v); n sz[u] += sz[v]; n master[v] = u; n return true; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n int n, m; n cin >> n >> m; n vector A(n + 1), B(m + 1); n for (int i = 1; i <= n; i++) { n cin >> A[i]; n } n for (int i = 1; i <= m; i++) { n cin >> B[i]; n } n vector>> edges; n long long int totcost = 0; n for (int i = 1; i <= n; i++) { n int k; n cin >> k; n for (int j = 0; j < k; j++) { n int x; n cin >> x; n edges.emplace_back(A[i] + B[x], make_pair(i, n + x)); n totcost += A[i] + B[x]; n } n } n for (int i = 1; i <= n + m; i++) init(i); n sort(edges.begin(), edges.end()); n reverse(edges.begin(), edges.end()); n long long int ans = 0; n for (auto e : edges) { n if (unite(e.second.first, e.second.second)) ans += e.first; n } n ans = totcost - ans; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int L[100010]; n int P[100010][20]; n vector pp[100010][20]; n int T[100010]; n vector tt[100010]; n int arr[100010]; n vector graph[100010]; n vector fnc(vector &a, vector &b) { n vector ans; n int aa = a.size(), bb = b.size(), i, j, shajib = 0; n for (i = 0, j = 0; i + j < aa + bb && shajib < 10;) { n if (i == aa) { n ans.push_back(b[j]); n j++; n shajib++; n } else if (j == bb) { n ans.push_back(a[i]); n i++; n shajib++; n } else { n if (a[i] == b[j]) { n i++; n } else if (a[i] > b[j]) { n ans.push_back(b[j]); n j++; n shajib++; n } else { n ans.push_back(a[i]); n i++; n shajib++; n } n } n } n return ans; n } n void dfs(int src, int par) { n if (src == -1) n L[par] = 1; n else n L[par] = L[src] + 1; n T[par] = src; n int len = graph[par].size(); n for (int i = 0; i < (int)graph[par].size(); i++) { n int v = graph[par][i]; n if (v != src) { n dfs(par, v); n } n } n } n vector query(int n, int p, int q) { n int log = 1, i, j, temp; n if (L[p] < L[q]) { n temp = q; n q = p; n p = temp; n } n log = log2(n); n vector os; n os = fnc(os, tt[p]); n for (j = log; j >= 0; j--) { n if (L[p] - (1 << j) >= L[q]) { n os = fnc(os, pp[p][j]); n p = P[p][j]; n } n } n if (p == q) return os; n os = fnc(os, tt[q]); n for (j = log; j >= 0; j--) { n if (P[p][j] != -1 && P[p][j] != P[q][j]) { n os = fnc(os, pp[p][j]); n os = fnc(os, pp[q][j]); n p = P[p][j], q = P[q][j]; n } n } n os = fnc(os, pp[p][0]); n return os; n } n void lca(int n) { n memset(P, -1, sizeof(P)); n int i, j; n for (i = 1; i <= n; i++) { n P[i][0] = T[i]; n if (T[i] != -1) pp[i][0] = fnc(pp[i][0], tt[T[i]]); n } n for (j = 1; (1 << j) < n; j++) { n for (i = 1; i <= n; i++) { n if (P[i][j - 1] != -1) { n P[i][j] = P[P[i][j - 1]][j - 1]; n pp[i][j] = fnc(pp[i][j], pp[P[i][j - 1]][j - 1]); n pp[i][j] = fnc(pp[i][j], pp[i][j - 1]); n } n } n } n } n int main() { n int i, j, n, m, t, a, b, k, c; n scanf( %d%d%d , &n, &m, &k); n for (i = 0; i < n - 1; i++) { n scanf( %d%d , &a, &b); n graph[a].push_back(b); n graph[b].push_back(a); n } n for (i = 1; i <= m; i++) { n scanf( %d , &a); n tt[a].push_back(i); n } n for (i = 1; i <= n; i++) { n sort(tt[i].begin(), tt[i].end()); n a = tt[i].size(); n while (a > 10) { n tt[i].pop_back(); n a--; n } n } n dfs(-1, 1); n lca(n); n vector os; n for (i = 1; i <= k; i++) { n scanf( %d%d%d , &a, &b, &c); n os = query(n, a, b); n c = min(c, (int)os.size()); n a = 0; n printf( %d , c); n for (auto it = os.begin(); a < c && it != os.end(); a++, it++) { n printf( %d , (*it)); n } n printf( n ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, i, j, k, lst, a[22], b[1 << 18], o[1 << 18]; n long long f[1 << 18][18], g[1 << 18]; n char s[22][22]; n void rec(int sum, int x, int mask) { n if (sum == 0) { n for (i = 0; i < (1 << n); i++) n if (b[i] > lst) n for (j = 0; j < n; j++) f[i][j] = 0; n for (i = 0; i < (1 << n) - 1; i++) n if (b[i] >= lst) n for (j = 0; j < n; j++) n if (f[i][j]) { n int prv = (1 << n) - 1 - i; n if ((mask >> (n - b[i] - 1)) & 1) { n for (int x = (prv & (prv - 1)); prv > 0; x &= (x - 1)) { n k = o[prv ^ x]; n if (s[j][k] == 1 ) f[i ^ (1 << k)][k] += f[i][j]; n prv = x; n } n } else n for (int x = (prv & (prv - 1)); prv > 0; x &= (x - 1)) { n k = o[prv ^ x]; n f[i ^ (1 << k)][k] += f[i][j]; n prv = x; n } n } n for (j = 0; j < n; j++) g[mask] += f[i][j]; n return; n } n for (; x > 0; x--) { n rec(sum - x, min(sum - x, x), (mask << x) + (1 << (x - 1)) - 1); n lst = n - (sum - x + 1); n } n } n int main() { n scanf( %d , &n); n for (i = 0; i < n; i++) { n scanf( %s , s[i]); n f[1 << i][i] = 1; n o[1 << i] = i; n } n lst = 1; n for (i = 0; i < (1 << n); i++) b[i] = b[i / 2] + (i & 1); n rec(n, n, 0); n for (i = 0; i < (1 << (n - 1)); i++) { n for (m = 0, j = -1; j < n - 1; j = k) { n for (k = j + 1; k < n - 1 && ((i >> k) & 1); k++) n ; n a[m++] = k - j; n } n sort(a, a + m); n reverse(a, a + m); n for (k = j = 0; j < m; j++) k = (k << a[j]) + (1 << (a[j] - 1)) - 1; n g[i] = g[k]; n } n for (j = n - 1; j >= 0; j--) n for (i = (1 << (n - 1)) - 1; i > 0; i--) n if ((i >> j) & 1) g[i ^ (1 << j)] -= g[i]; n for (i = 0; i < (1 << (n - 1)); i++) printf( %I64d , g[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int a[107]; n map f; n vector> b; n bool cmp(pair u, pair v) { return u.first > v.first; } n int main() { n cin >> n >> m; n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int i = 1; i <= m; i++) { n string s; n cin >> s; n if (f[s] == 0) n f[s] = 1; n else n f[s]++; n } n sort(a + 1, a + n + 1); n for (map::iterator it = f.begin(); it != f.end(); ++it) { n b.push_back(make_pair(it->second, it->first)); n } n sort(b.begin(), b.end(), cmp); n long long minP = 0, maxP = 0; n for (int i = 0; i < b.size(); i++) { n minP += b[i].first * a[i + 1]; n maxP += b[i].first * a[n - i]; n } n cout << minP << << maxP << endl; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n long long cos, rlev; n bool operator<(const node &a) const { return cos < a.cos; } n } f[300005]; n int main() { n int n, k; n while (scanf( %d%d , &n, &k) != EOF) { n for (int i = 1; i <= n; i++) { n scanf( %I64d , &f[i].cos); n f[i].rlev = i; n } n priority_queue p; n long long ans = 0; n for (int i = 1; i <= k; i++) p.push(f[i]); n for (int i = k + 1; i <= k + n; i++) { n if (i <= n) p.push(f[i]); n node now = p.top(); n p.pop(); n if (i >= now.rlev) { n ans += (i - now.rlev) * now.cos; n f[now.rlev].rlev = i; n } n } n printf( %I64d n , ans); n for (int i = 1; i < n; i++) { n printf( %I64d , f[i].rlev); n } n printf( %I64d n , f[n].rlev); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mul(long long a, long long b, long long p = 1000000007) { n return ((a % p) * (b % p)) % p; n } n long long add(long long a, long long b, long long p = 1000000007) { n return (a % p + b % p) % p; n } n void input(long long a[], long long sz) { n for (long long i = 0; i < sz; i++) cin >> a[i]; n } n void print(long long a[], long long sz) { n for (long long i = 0; i < sz; i++) { n if (i == sz - 1) n cout << a[i] << n ; n else n cout << a[i] << ; n } n } n long long maxr(long long a[], long long sz) { n long long ma; n for (long long i = 0; i < sz; i++) { n if (i == 0) n ma = a[i]; n else if (a[i] > ma) n ma = a[i]; n } n return ma; n } n long long minr(long long a[], long long sz) { n long long mi; n for (long long i = 0; i < sz; i++) { n if (i == 0) n mi = a[i]; n else if (a[i] < mi) n mi = a[i]; n } n return mi; n } n long long isprm(long long n) { n if (n <= 1) return 0; n if (n <= 3) return 1; n if (n % 2 == 0 || n % 3 == 0) return 0; n for (int i = 5; i * i <= n; i = i + 6) n if (n % i == 0 || n % (i + 2) == 0) return 0; n return 1; n } n long long power(long long x, long long y, long long p = 1000000007) { n long long res = 1; n x = x % p; n while (y > 0) { n if (y & 1) res = (res * x) % p; n y = y >> 1; n x = (x * x) % p; n } n return res; n } n long long modInverse(long long n, long long p = 1000000007) { n return power(n, p - 2, p); n } n long long ncrMod(long long n, long long r, long long p = 1000000007) { n if (r == 0) return 1; n long long fac[n + 1]; n fac[0] = 1; n for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p; n return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % n p; n } n bool comp(const pair &a, const pair &b) { n if (a.first == b.first) { n return (a.second > b.second); n } n return (a.first < b.first); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n int t; n cin >> t; n while (t--) { n long long n, k; n cin >> n >> k; n long long q = n / k; n long long r = n % k; n if ((r % 2 == 1 && k % 2 == 0) || (r % 2 == 1 && q == 1) || q == 0) n cout << NO n ; n else { n cout << YES n ; n if (r % 2 == 0) { n cout << q + r << ; n for (long long i = 0; i < k - 1; i++) cout << q << ; n cout << n ; n } else { n cout << q + r << ; n for (long long i = 0; i < k - 1; i++) { n if (i % 2 == 0) n cout << q - 1 << ; n else n cout << q + 1 << ; n } n cout << n ; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 5e5 + 20; n struct edge { n int v, l, r; n edge() {} n edge(int a, int b, int c) { n v = a; n l = b; n r = c; n } n }; n struct nd { n int no, lim, to; n nd() {} n nd(int a, int b, int c) { n no = a; n lim = b; n to = c; n } n }; n bool operator<(const nd& a, const nd& b) { n if (a.no != b.no) { n return a.no > b.no; n } n if (a.lim != b.lim) { n return a.lim > b.lim; n } n return a.to < b.to; n } n bool operator<(const edge& a, const edge& b) { n if (a.l != b.l) { n return a.l < b.l; n } n return a.r < b.r; n } n vector G[2 * maxn]; n int now[2 * maxn]; n int main() { n int n, m, u, v, l, r; n scanf( %d%d , &n, &m); n for (int i = 0; i < m; i++) { n scanf( %d%d%d%d , &u, &v, &l, &r); n if (l & 1) { n if (r & 1) { n G[u].push_back(edge(v + n, l + 1, r - 1)); n G[v].push_back(edge(u + n, l + 1, r - 1)); n G[u + n].push_back(edge(v, l, r - 2)); n G[v + n].push_back(edge(u, l, r - 2)); n } else { n if (l + 1 < r) { n G[u].push_back(edge(v + n, l + 1, r - 2)); n G[v].push_back(edge(u + n, l + 1, r - 2)); n } n G[u + n].push_back(edge(v, l, r - 1)); n G[v + n].push_back(edge(u, l, r - 1)); n } n } else { n if (r & 1) { n G[u].push_back(edge(v + n, l, r - 1)); n G[v].push_back(edge(u + n, l, r - 1)); n if (l + 1 < r) { n G[u + n].push_back(edge(v, l + 1, r - 2)); n G[v + n].push_back(edge(u, l + 1, r - 2)); n } n } else { n G[u].push_back(edge(v + n, l, r - 2)); n G[v].push_back(edge(u + n, l, r - 2)); n G[u + n].push_back(edge(v, l + 1, r - 1)); n G[v + n].push_back(edge(u, l + 1, r - 1)); n } n } n } n for (int i = 1; i <= n + n; i++) { n sort(G[i].begin(), G[i].end()); n } n priority_queue Q; n Q.push(nd(0, 0, 1)); n int ans = 0x3f3f3f3f; n nd t; n while (!Q.empty()) { n t = Q.top(); n int u = t.to, no = t.no, lim = t.lim; n Q.pop(); n if (u == n || u == n * 2) { n ans = min(ans, no); n } n for (int& i = now[u]; i < G[u].size(); i++) { n if (lim < G[u][i].l) { n break; n } n if (no <= G[u][i].r) { n Q.push(nd(max(no + 1, G[u][i].l + 1), G[u][i].r + 1, G[u][i].v)); n } n } n } n if (ans == 0x3f3f3f3f) { n printf( -1 n ); n } else { n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1000008; n int n, m, k, d, i, j, e; n int tmp[N], pos[N], p[N], c[N]; n char s[N]; n int main() { n scanf( %s %d , s, &m); n n = strlen(s); n while (m--) { n scanf( %d%d , &k, &d); n for (i = 0; i < n; i++) { n c[i] = (i + 1) % n; n pos[i] = p[i] = i; n } n int t = 0; n for (i = 0; i < d; i++) n for (j = i; j < k; t++, j += d) p[t] = j; n for (i = 0; i < n; ++i) { n c[i] = p[c[i]]; n } n for (e = n - k + 1; e; e >>= 1) { n for (i = 0; i < n; ++i) tmp[i] = c[i]; n if (e & 1) n for (i = 0; i < n; ++i) pos[i] = c[pos[i]]; n for (i = 0; i < n; ++i) c[i] = tmp[c[i]]; n } n for (i = 0; i < n; ++i) tmp[(i + n - k + 1) % n] = s[pos[i]]; n for (i = 0; i < n; ++i) putchar(s[i] = (char)tmp[i]); n putchar( n ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n vector ke[1000010]; n bool cx[1000010], visited[1000010]; n void dfs(int u) { n visited[u] = true; n for (int v : ke[u]) n if (!visited[v]) dfs(v); n } n long long c2(int x) { return (1LL * x * (x - 1)) >> 1; } n int main() { n if (fopen( a.txt , r )) { n freopen( a.txt , r , stdin); n } else n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n >> m; n int own = 0; n for (int i = 1; i <= m; i++) { n int u, v; n cin >> u >> v; n cx[u] = true; n cx[v] = true; n if (u != v) { n ke[u].push_back(v); n ke[v].push_back(u); n } else n own++; n } n int cnt = 0; n for (int u = 1; u <= n; u++) n if (cx[u] && !visited[u]) { n dfs(u); n cnt++; n } n if (cnt != 1) { n cout << 0; n exit(0); n }; n long long res = 0; n for (int i = 1; i <= n; i++) res += c2(int(ke[i].size())); n res += c2(own); n res += 1LL * own * (m - own); n cout << res; n } n "} +{"func_code_string": "#include n using namespace std; n int get_point(int N) { n int score[10] = {25, 18, 15, 12, 10, 8, 6, 4, 2, 1}; n if (N > 10) return 0; n return score[N - 1]; n } n int main() { n int T; n map n_map; n map n_win; n cin >> T; n for (int i = 0; i < (T); ++i) { n int N; n cin >> N; n for (int j = 0; j < (N); ++j) { n string t_s; n cin >> t_s; n n_map[t_s] += get_point(j + 1); n if (n_win[t_s] == ) n n_win[t_s] = 0000000000000000000000000000000000000000000000000000 ; n n_win[t_s][j] += 1; n } n } n map::iterator it; n int n_max1 = 0, n_max2 = 0; n string n_ret1 = , n_ret2 = ; n n_win[ ] = 0000000000000000000000000000000000000000000000000000 ; n for (it = n_map.begin(); it != n_map.end(); it++) { n if (n_max1 < (*it).second) { n n_ret1 = (*it).first; n n_max1 = (*it).second; n } n if (n_max1 == (*it).second && n_win[n_ret1] < n_win[(*it).first]) { n n_ret1 = (*it).first; n n_max1 = (*it).second; n } n if (n_win[n_ret2][0] < n_win[(*it).first][0]) { n n_ret2 = (*it).first; n n_max2 = (*it).second; n } n if (n_win[n_ret2][0] == n_win[(*it).first][0] && n_max2 < (*it).second) { n n_ret2 = (*it).first; n n_max2 = (*it).second; n } n if (n_win[n_ret2][0] == n_win[(*it).first][0] && n_max2 == (*it).second) { n if (n_win[n_ret2] < n_win[(*it).first]) { n n_ret2 = (*it).first; n n_max2 = (*it).second; n } n } n } n cout << n_ret1 << endl; n cout << n_ret2 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 300005; n int n, m, ans, two, one, l, r, k, a[N], dp[N][205]; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n a[i] /= 100; n } n memset(dp, 127, sizeof(dp)); n dp[0][0] = 0; n for (int i = 0; i < n; i++) { n for (int j = 0; j <= 200; j++) n if (dp[i][j] <= 2e8) { n if (j + a[i + 1] / 10 <= 200) n dp[i + 1][j + a[i + 1] / 10] = n min(dp[i + 1][j + a[i + 1] / 10], dp[i][j] + a[i + 1]); n if (j >= a[i + 1]) n dp[i + 1][j - a[i + 1]] = min(dp[i + 1][j - a[i + 1]], dp[i][j]); n else n dp[i + 1][0] = min(dp[i + 1][0], dp[i][j] + (a[i + 1] - j)); n } n } n int ans = 2e9; n for (int i = 0; i <= 200; i++) { n ans = min(ans, dp[n][i]); n } n printf( %d00 n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 40; n const int F = N / 2 + N % 2; n const int S = N - F; n const long long N_MASKS = (1ll << N); n const long long F_MASKS = (1ll << F); n const long long S_MASKS = (1ll << S); n double liquid; n int n, f, s; n long long adj[N]; n int firstSizes[F_MASKS]; n long long firstAvailables[F_MASKS]; n int secondSizes[S_MASKS]; n long long secondAvailables[S_MASKS]; n int maxPossible[S_MASKS]; n void readData() { n cin >> n >> liquid; n f = n / 2 + n % 2; n s = n - f; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < n; ++j) { n long long a; n cin >> a; n adj[i] |= (a << j); n } n } n } n void findCliques(int sta, int cur, int fin, long long mask, int size, n long long available, int* sizes, long long* availables) { n if (cur == fin) { n return; n } n findCliques(sta, cur + 1, fin, mask, size, available, sizes, availables); n if ((1ll << cur) & available) { n mask |= (1ll << cur); n ++size; n available &= adj[cur]; n sizes[mask >> sta] = size; n availables[mask >> sta] = available; n findCliques(sta, cur + 1, fin, mask, size, available, sizes, availables); n } n } n int findPossibles(long long available) { n if (maxPossible[available]) { n return maxPossible[available]; n } n if (available == 0) { n return 0; n } n if (secondSizes[available]) { n return maxPossible[available] = secondSizes[available]; n } n for (int i = 0; i < s; ++i) { n if (available & (1ll << i)) { n maxPossible[available] = n max(maxPossible[available], findPossibles(available & ~(1ll << i))); n } n } n return maxPossible[available]; n } n int findMaxClique() { n findCliques(0, 0, f, 0, 0, (1ll << n) - 1, firstSizes, firstAvailables); n findCliques(f, f, n, 0, 0, (1ll << n) - 1, secondSizes, secondAvailables); n int res = findPossibles((1 << s) - 1); n for (int mask = 0; mask < (1 << f); ++mask) { n if (firstSizes[mask]) { n res = max(res, n firstSizes[mask] + findPossibles(firstAvailables[mask] >> f)); n } n } n return res; n } n double solve() { n int x = findMaxClique(); n return 0.5 * liquid * liquid * (x - 1.) / x; n } n int main() { n ios_base::sync_with_stdio(false); n cout << setprecision(20) << fixed; n readData(); n cout << solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; n long long power(long long a, long long b) { n long long res = 1; n while (b) { n if (b % 2) res = (res * a) % 5; n b = b >> 1; n a = (a * a) % 5; n } n return res; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long i, n, t; n cin >> n >> t; n long long ans = 1e16; n pair p; n for (i = 0; i < t; i++) { n long long a, b; n cin >> a >> b; n if (b - a + 1 < ans) { n ans = b - a + 1; n } n } n cout << ans << n ; n long long c = 0; n for (i = 0; i < n; i++) { n if (i % ans == 0) { n c = 0; n cout << c << ; n c++; n } else { n cout << c << ; n c++; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 200005; n vector lk[maxn]; n int fa[maxn], dep[maxn], a[maxn], b[maxn], n; n void dfs(int now, int pre) { n fa[now] = pre; n dep[now] = dep[pre] + 1; n for (auto p : lk[now]) n if (p != pre) dfs(p, now); n } n vector cir; n int rt, lp, lq; n bool find_circle() { n cir.clear(); n static bool vis[maxn]; n int p = 0; n for (int i = 1; i <= n; i++) n if (a[i] != b[i] && dep[i] > dep[p]) p = i; n if (!p) return 1; n for (int u = p; vis[u] = 1, cir.push_back(u), a[fa[u]] != b[fa[u]]; u = fa[u]) n ; n int q = 0; n for (int i = 1; i <= n; i++) n if (a[i] != b[i] && !vis[i] && dep[i] > dep[q]) q = i; n if (q) { n reverse(cir.begin(), cir.end()); n for (int u = q; vis[u] = 1, cir.push_back(u), a[fa[u]] != b[fa[u]]; n u = fa[u]) n ; n } else n q = fa[cir.back()]; n for (int i = 1; i <= n; i++) n if (a[i] != b[i] && !vis[i]) return 0; n int u, v; n for (u = p, v = q; u != v; u = fa[u]) n if (dep[u] < dep[v]) swap(u, v); n rt = u; n if (cir.size() != dep[p] + dep[q] - 2 * dep[rt]) return 0; n lp = p, lq = q; n return 1; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1; i <= n; i++) scanf( %d , &b[i]); n for (int i = 1, u, v; i < n; i++) { n scanf( %d%d , &u, &v); n lk[u].push_back(v), lk[v].push_back(u); n } n int pa = find(a + 1, a + n + 1, 0) - a, pb = find(b + 1, b + n + 1, 0) - b; n dep[0] = -1; n dfs(pb, 0); n for (int u = pa; u != pb; u = fa[u]) swap(a[u], a[fa[u]]); n long long ans = dep[pa]; n if (!find_circle()) { n printf( -1 n ); n return 0; n } n if (!cir.size()) { n printf( 0 %d n , ans); n return 0; n } n int gap = 0, len = cir.size(); n for (int i = 0; i < len; i++) n if (b[cir[i]] == a[cir[0]]) gap = i; n for (int i = 1; i < len; i++) n if (b[cir[(i + gap) % len]] != a[cir[i]]) { n printf( -1 n ); n return 0; n } n static bool vis[maxn]; n for (int i = pa; i; i = fa[i]) vis[i] = 1; n if (vis[cir[0]] || vis[cir.back()]) { n if (vis[cir.back()]) reverse(cir.begin(), cir.end()), gap = len - gap; n int po = cir.size(); n for (int i = 0; i < cir.size(); i++) n if (!vis[cir[i]]) { n po = i; n break; n } n ans = ans - po + n min(po + gap * 1ll * (len + 1), n abs((len - gap) * 1ll * (len + 1) - po)); n } else n ans = (ans + min(gap, len - gap) * 1ll * (len + 1)); n for (; !vis[rt]; rt = fa[rt]) ans += 2; n if (lp > lq) swap(lq, lp); n printf( %d %d %lld n , lp, lq, ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5010; n struct Edge { n int v, u, f, r, c; n Edge() {} n Edge(int v, int u, int f, int c, int r) : v(v), u(u), f(f), c(c), r(r) {} n }; n const int inf = 1e9; n const int C = 4000; n int n, m, k, nflow, s, t, parent[N], number[N], a[N], b[N]; n int dist[N], pl[N]; n vector g[N]; n queue > q; n vector ga, gb; n void addEdge(int a, int b, int u, int c) { n g[a].push_back(Edge(b, u, 0, c, g[b].size())); n g[b].push_back(Edge(a, 0, 0, -c, g[a].size() - 1)); n } n int MinCostFlow() { n int flow = 0; n int cost = 0; n while (true) { n for (int i = 1; i <= nflow; i++) dist[i] = inf; n dist[s] = 0; n q.push(make_pair(0, s)); n while (!q.empty()) { n int v = (q.front()).second; n int d = -(q.front()).first; n q.pop(); n if (dist[v] != d) continue; n if (d == inf) break; n for (int i = 0; i < g[v].size(); i++) n if (g[v][i].f < g[v][i].u && dist[g[v][i].v] > d + g[v][i].c) { n dist[g[v][i].v] = d + g[v][i].c; n q.push(make_pair(-dist[g[v][i].v], g[v][i].v)); n number[g[v][i].v] = i; n parent[g[v][i].v] = v; n } n } n if (dist[t] == inf) break; n int v = t, addflow = 1e9; n while (v != s) { n int u = parent[v]; n addflow = min(addflow, g[u][number[v]].u - g[u][number[v]].f); n v = u; n } n v = t; n while (v != s) { n int u = parent[v]; n cost += addflow * g[u][number[v]].c; n g[u][number[v]].f += addflow; n g[v][g[u][number[v]].r].f -= addflow; n v = u; n } n flow += addflow; n } n return cost; n } n int main() { n scanf( %d%d%d , &n, &m, &k); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1; i <= n; i++) scanf( %d , &b[i]); n s = n + 3; n t = n + 4; n for (int i = 1; i <= n; i++) { n addEdge(n + 1, i, 1, -a[i]); n addEdge(n + 2, i, 1, -b[i]); n } n addEdge(s, n + 1, m, 0); n addEdge(s, n + 2, k, 0); n for (int i = 1; i <= n; i++) { n addEdge(i, t, 1, 0); n } n nflow = n + 4; n int ans = -MinCostFlow(); n cout << ans << endl; n for (int j = 0; j < g[n + 1].size(); j++) { n int v = g[n + 1][j].v; n if (v >= 1 && v <= n && g[n + 1][j].f == 1) { n ga.push_back(v); n } n } n for (int j = 0; j < g[n + 2].size(); j++) { n int v = g[n + 2][j].v; n if (v >= 1 && v <= n && g[n + 2][j].f == 1) { n gb.push_back(v); n } n } n for (int i = 0; i < ga.size(); i++) cout << ga[i] << ; n cout << endl; n for (int i = 0; i < gb.size(); i++) cout << gb[i] << ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n int n; n double a[N]; n double max_poor(double x) { n int i; n double pre, mpre, ret = 0; n pre = mpre = 0; n for (i = 0; i < n; i++) { n pre += a[i] - x; n ret = max(ret, abs(pre - mpre)); n mpre = min(mpre, pre); n } n pre = mpre = 0; n for (i = 0; i < n; i++) { n pre += a[i] - x; n ret = max(ret, abs(pre - mpre)); n mpre = max(mpre, pre); n } n return ret; n } n int main() { n cin.tie(0); n ios::sync_with_stdio(0); n int i; n double l = 0.0, h = 0.0, m1, m2; n cin >> n; n for (i = 0; i < n; h = max(h, abs(a[i])), i++) cin >> a[i]; n l = -h; n for (i = 0; i < 300; i++) { n m1 = l + (h - l) / 3; n m2 = h - (h - l) / 3; n if (max_poor(m1) > max_poor(m2)) n l = m1; n else n h = m2; n } n printf( %.17f n , max_poor(l)); n return 0; n } n "} +{"func_code_string": "#include n const long long MOD = 1000000007; n const int MAX = 1e9 + 7; n const int MIN = -1e9 + 7; n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long b, g; n cin >> b >> g; n long long n; n cin >> n; n if (b >= n && g >= n) { n cout << n + 1; n } else if (b + g == n) { n cout << 1; n } else if (b >= n || g >= n) { n cout << min(b, g) + 1; n } else { n cout << b + g - n + 1; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = int(5e4) + 100; n const int MOD = int(360); n const int oo = INT_MAX; n const long double PI = acos(-1.0); n const long double EPS = 1e-9; n struct pt { n long double x, y; n pt() {} n pt(long double x, long double y) : x(x), y(y) {} n }; n inline long double x(pt P) { return P.x; } n inline long double y(pt P) { return P.y; } n istream& operator>>(istream& in, pt& p) { n long double x, y; n in >> x >> y; n p = pt(x, y); n return in; n } n ostream& operator<<(ostream& out, const pt& p) { n out << ( << double(p.x) << , << double(p.y) << ) ; n return out; n } n pt operator+(const pt& A, const pt& B) { return pt(x(A) + x(B), y(A) + y(B)); } n pt operator-(const pt& A, const pt& B) { return pt(x(A) - x(B), y(A) - y(B)); } n pt operator*(const pt& A, const pt& B) { n return pt(x(A) * x(B) - y(A) * y(B), x(A) * y(B) + y(A) * x(B)); n } n pt operator*(const pt& A, const long double& B) { n return pt(x(A) * B, y(A) * B); n } n pt operator*(const long double& B, const pt& A) { n return pt(x(A) * B, y(A) * B); n } n pt operator/(const pt& A, const long double& B) { n return pt(x(A) / B, y(A) / B); n } n inline long double norm(pt A) { return x(A) * x(A) + y(A) * y(A); } n inline long double abs(pt A) { return sqrt(norm(A)); } n inline long double cross(pt A, pt B) { return x(A) * y(B) - y(A) * x(B); } n inline long double dot(pt A, pt B) { return x(A) * x(B) + y(A) * y(B); } n inline bool same(long double a, long double b) { n return a + EPS > b && b + EPS > a; n } n inline bool samePt(pt A, pt B) { return same(x(A), x(B)) && same(y(A), y(B)); } n inline long double dist(pt A, pt B) { return abs(B - A); } n inline pt rotcw(pt p) { return p * pt(0, -1); } n inline bool segContains(pt X, pt A, pt B) { n if (samePt(X, A) || samePt(X, B)) return 1; n if (!same(0, cross(A - X, B - X))) return 0; n return (dot(A - X, B - X) < EPS); n } n pt linesIntersection(pt A, pt B, pt C, pt D) { n long double x = cross(C, D - C) - cross(A, D - C); n x /= cross(B - A, D - C); n return A + x * (B - A); n } n double signedArea(const vector& P) { n double result = 0.0; n for (int i = 0; i < (int)P.size() - 1; i++) result += cross(P[i], P[i + 1]); n return result / 2.0; n } n vector reorganize(vector& P) { n int n = int(P.size()); n vector R(n); n if (P.size() == 1) { n R[0] = P[0]; n return R; n } n if (signedArea(P) > EPS) { n reverse(P.begin(), P.end()); n } n int s = 0; n for (int i = 1; i < n; ++i) { n if (x(P[s]) > x(P[i]) || (x(P[s]) == x(P[i]) && y(P[s]) > y(P[i]))) { n s = i; n } n } n R[0] = P[s]; n for (int i = (s + 1) % n, j = 1; i != s; i = (i + 1) % n, ++j) { n if (samePt(P[i], P[(i - 1 + n) % n])) { n j--; n continue; n } n R[j] = P[i]; n } n R[n - 1] = R[0]; n return R; n } n vector convexPolygonSum(vector& P, vector& Q) { n P = reorganize(P); n Q = reorganize(Q); n int n = int(P.size()), m = int(Q.size()); n vector R(n + m - 1); n R[0] = (P[0] + Q[0]); n int i = 1, j = 1, k = 1; n for (; i < n && j < m; ++k) { n if (cross(P[i] - P[i - 1], Q[j] - Q[j - 1]) < -EPS) { n R[k] = R[k - 1] + (P[i] - P[i - 1]); n ++i; n } else { n R[k] = R[k - 1] + (Q[j] - Q[j - 1]); n ++j; n } n } n while (i < n) { n R[k] = R[k - 1] + (P[i] - P[i - 1]); n ++i; n ++k; n } n while (j < m) { n R[k] = R[k - 1] + (Q[j] - Q[j - 1]); n ++j; n ++k; n } n vector T; n T.push_back(R[0]); n for (int i = 1; i + 1 < int(R.size()); ++i) { n if (same(cross(R[i] - R[i - 1], R[i + 1] - R[i - 1]), 0.0)) continue; n T.push_back(R[i]); n } n T.push_back(T[0]); n return T; n } n int inConvexPolygon(pt X, long double mnx, long double mxx, vector& P) { n if (x(X) < mnx || x(X) > mxx) return -1; n int lo = 1, hi = int(P.size()) - 1, mi; n while (lo <= hi) { n mi = (lo + hi) / 2; n if (cross(P[mi] - P[0], X - P[0]) < -EPS) { n lo = mi + 1; n } else { n hi = mi - 1; n } n } n lo = hi; n if (hi == -1) return -1; n long double c = cross(X - P[lo], X - P[lo + 1]); n if (same(c, 0.0)) return (segContains(X, P[lo], P[lo + 1]) ? 0 : -1); n if (c > EPS) return -1; n return 1; n } n int l, n, m, q; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n while (cin >> l) { n vector P1(l + 1); n for (int i = 0; i < l; ++i) { n cin >> P1[i]; n } n cin >> n; n vector P2(n + 1); n for (int i = 0; i < n; ++i) { n cin >> P2[i]; n } n cin >> m; n vector P3(m + 1); n for (int i = 0; i < m; ++i) { n cin >> P3[i]; n } n P1[l] = P1[0]; n P2[n] = P2[0]; n P3[m] = P3[0]; n vector P = convexPolygonSum(P2, P3); n P = convexPolygonSum(P1, P); n long double mnx = x(P[0]); n long double mxx = -oo; n for (int i = 0; i < int(P.size()); ++i) { n mxx = max(mxx, x(P[i])); n } n cin >> q; n for (int i = 0; i < q; ++i) { n pt cur; n cin >> cur; n cur = 3.0 * cur; n if (inConvexPolygon(cur, mnx, mxx, P) >= 0) { n cout << YES n ; n } else { n cout << NO n ; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k = 0; n string home; n cin >> n; n cin >> home; n for (int i = 0; i < n; i++) { n string now; n cin >> now; n now = now.substr(5, 3); n if (now == home) k++; n } n if (k == n - k) n cout << home ; n else n cout << contest ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n using min_heap = priority_queue, greater>; n struct RangeIncrement { n vector tree, lazy; n RangeIncrement(int n) : tree(n << 2), lazy(n << 2) {} n void refresh(int i, int l, int r) { n if (lazy[i] != 0) { n tree[i] += lazy[i] * (r - l + 1); n if (l < r) { n int lc = i << 1, rc = (i << 1) + 1; n lazy[lc] += lazy[i]; n lazy[rc] += lazy[i]; n } n lazy[i] = 0; n } n } n void update(int i, int l, int r, int ul, int ur, long long x) { n refresh(i, l, r); n if (r < ul || l > ur) { n return; n } else if (ul <= l && r <= ur) { n lazy[i] += x; n refresh(i, l, r); n } else { n int m = l + r >> 1; n int lc = i << 1, rc = (i << 1) + 1; n update(lc, l, m, ul, ur, x); n update(rc, m + 1, r, ul, ur, x); n tree[i] = tree[lc] + tree[rc]; n } n } n long long query(int i, int l, int r, int ql, int qr) { n refresh(i, l, r); n if (r < ql || l > qr) { n return 0; n } else if (ql <= l && r <= qr) { n return tree[i]; n } else { n int m = l + r >> 1; n int lc = i << 1, rc = (i << 1) + 1; n return query(lc, l, m, ql, qr) + query(rc, m + 1, r, ql, qr); n } n } n }; n template n struct DisjointRanges { n struct Range { n int l, r; n T x; n Range(int l, const pair& p) : l(l), r(p.first), x(p.second) {} n }; n map> s; n vector update(int l, int r, T x) { n vector bye; n auto last = s.upper_bound(r); n if (last != s.begin()) { n auto it = prev(last); n if (it->second.first > r) { n last = s.emplace_hint(last, r + 1, it->second); n it->second.first = r; n } n } n auto first = s.lower_bound(l); n if (first != s.begin()) { n auto it = prev(first); n if (it->second.first >= l) { n bye.emplace_back(l, it->second); n it->second.first = l - 1; n } n } n while (first != last) { n bye.emplace_back(first->first, first->second); n first = s.erase(first); n } n s.emplace_hint(last, l, make_pair(r, x)); n return bye; n } n }; n int main() { n int n, m; n scanf( %d %d , &n, &m); n RangeIncrement ri(n); n DisjointRanges dr; n for (int i = 1; i <= n; i++) { n dr.update(i, i, i); n } n while (m--) { n int o, l, r, x; n scanf( %d %d %d , &o, &l, &r); n switch (o) { n case 1: { n scanf( %d , &x); n auto v = dr.update(l, r, x); n for (auto it : v) { n ri.update(1, 1, n, it.l, it.r, abs(x - it.x)); n } n break; n } n case 2: { n printf( %lld n , ri.query(1, 1, n, l, r)); n break; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int cnt[100100]; n int R[100100]; n int n; n long long power(long long a, long long b) { n long long res = 1; n while (b) { n if (b & 1) res = (res * a) % 1000000007; n a = (a * a) % 1000000007; n b >>= 1; n } n return res; n } n int main() { n memset(cnt, 0, sizeof(cnt)); n scanf( %d , &n); n int maxA = 0; n for (int i = 1; i <= n; i++) { n int tmp; n scanf( %d , &tmp); n cnt[tmp]++; n maxA = max(maxA, tmp); n } n for (int i = maxA; i >= 1; i--) cnt[i] += cnt[i + 1]; n long long ans = 0; n for (int i = 1; i <= maxA; i++) { n int tot = 0; n for (int j = 1; j * j <= i; j++) { n if (i % j == 0) { n R[tot++] = j; n if (j * j != i) { n R[tot++] = i / j; n } n } n } n sort(R, R + tot); n long long tmp = n (power(tot, cnt[R[tot - 1]]) - n power(tot - 1, cnt[R[tot - 1]]) % 1000000007 + 1000000007) % n 1000000007; n for (int j = 0; j < tot - 1; j++) n tmp = (tmp * power(j + 1, cnt[R[j]] - cnt[R[j + 1]])) % 1000000007; n ans = (ans + tmp) % 1000000007; n } n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 500100; n const int maxp = 40; n int n, q; n double d[maxn][maxp]; n int p[maxn]; n void upd(int v, int k, double x) { n while (v && k < maxp) { n double a = d[v][k]; n d[v][k] *= x; n x = (d[v][k] + 1) / (a + 1); n v = p[v]; n k++; n } n } n int main() { n ios_base::sync_with_stdio(0); n for (int i = 0; i < maxn; i++) n for (int j = 0; j < maxp; j++) d[i][j] = 1; n cin >> q; n n = 1; n for (int i = 0; i < q; i++) { n int qtype, v; n cin >> qtype >> v; n if (qtype == 1) { n p[++n] = v; n upd(n, 0, 0); n } else { n double ans = 0; n for (int j = 1; j < maxp; j++) ans += (1 - d[v][j]); n cout << fixed << setprecision(10) << ans << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const ll INF = 1e14 + 7; n using vi = vector; n using pii = pair; n using pli = pair; n int ask(int i, int j) { n cout << ? << i << << j << endl; n int ans; n cin >> ans; n return ans; n } n int main() { n int n; n cin >> n; n vi ans(n + 4), curr(n + 4); n curr[0] = ask(1, n); n curr[1] = ask(2, n); n ans[1] = curr[0] - curr[1]; n for (int i = 2; i <= n - 1; i++) { n curr[i] = ask(i - 1, i); n ans[i] = curr[i] - ans[i - 1]; n } n ans[n] = curr[0]; n for (int i = 1; i < n; i++) { n ans[n] -= ans[i]; n } n cout << ! ; n for (int i = 1; i <= n; i++) { n cout << << ans[i]; n } n cout << endl; n fflush(stdout); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[200005]; n int b[200005]; n bool f[200005]; n int main() { n int q, n; n cin >> q; n while (q--) { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n b[i] = 1; n f[i] = 0; n } n for (int i = 1; i <= n; i++) { n int j = i; n if (f[i] == 1) continue; n f[i] = 1; n int ctr = 1; n while (a[j] != i) { n ctr++; n f[j] = 1; n j = a[j]; n } n j = i; n while (a[j] != i) { n b[j] = ctr; n j = a[j]; n } n } n for (int i = 1; i <= n; i++) cout << b[i] << ; n cout << n ; n } n } n "} +{"func_code_string": "#include n inline int readChar(); n template n inline T readInt(); n template n inline void writeInt(T x, char end = 0); n inline void writeChar(int x); n inline void writeWord(const char* s); n static const int buf_size = 4096; n inline int getChar() { n static char buf[buf_size]; n static int len = 0, pos = 0; n if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin); n if (pos == len) return -1; n return buf[pos++]; n } n inline int readChar() { n int c = getChar(); n while (c <= 32) c = getChar(); n return c; n } n template n inline T readInt() { n int s = 1, c = readChar(); n T x = 0; n if (c == - ) s = -1, c = getChar(); n while ( 0 <= c && c <= 9 ) x = x * 10 + c - 0 , c = getChar(); n return s == 1 ? x : -x; n } n static int write_pos = 0; n static char write_buf[buf_size]; n inline void writeChar(int x) { n if (write_pos == buf_size) n fwrite(write_buf, 1, buf_size, stdout), write_pos = 0; n write_buf[write_pos++] = x; n } n template n inline void writeInt(T x, char end) { n if (x < 0) writeChar( - ), x = -x; n char s[24]; n int n = 0; n while (x || !n) s[n++] = 0 + x % 10, x /= 10; n while (n--) writeChar(s[n]); n if (end) writeChar(end); n } n inline void writeWord(const char* s) { n while (*s) writeChar(*s++); n } n struct Flusher { n ~Flusher() { n if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0; n } n } flusher; n using namespace std; n struct static_graph { n int colors[500000]; n int firstv[500000]; n set pool; n static const int N = 500000; n static const int M = 900000; n struct edge { n int v; n edge* next; n } edges[M]; n int nedges; n struct node { n vector* ice; n int prev_colors; n bool depth_use; n edge* firstedge; n inline void init() { firstedge = NULL; }; n inline edge* add_edge(edge* e) { n e->next = firstedge; n firstedge = e; n return firstedge; n }; n } nodes[N]; n int nnodes; n static_graph() { nnodes = 0, nedges = 0; }; n inline node& new_node() { n node& r = nodes[nnodes++]; n return r; n } n inline edge* new_edge() { return &(edges[nedges++]); }; n inline edge* add_edge(int a, int b) { n edge* e = new_edge(); n e->v = b; n return nodes[a].add_edge(e); n }; n inline void add_bi_edge(int a, int b) { n add_edge(a, b); n add_edge(b, a); n }; n void depth_go(int index, int prev) { n node& cur = nodes[index]; n if (cur.depth_use++) return; n for (int x : (*cur.ice)) n if (colors[x]) pool.erase(colors[x]); n for (int x : (*cur.ice)) n if (!colors[x]) { n colors[x] = (*pool.upper_bound(0)); n firstv[x] = index; n pool.erase(colors[x]); n } n for (int x : (*cur.ice)) pool.insert(colors[x]); n for (edge* e = cur.firstedge; e; e = e->next) { n depth_go(e->v, index); n }; n }; n void depth_run(int first) { n chrono::time_point start, end; n start = std::chrono::high_resolution_clock::now(); n for (int i = 0; i < nnodes; i++) { n node& cur = nodes[i]; n cur.depth_use = false; n }; n depth_go(first, -1); n }; n vector depth_to_wide(int first) {} n void read_graph(istream* f){}; n }; n static_graph g; n int main() { n istream& f = cin; n ios_base::sync_with_stdio(false); n cin.tie(NULL); n chrono::time_point start, end; n start = std::chrono::high_resolution_clock::now(); n int n, m, c, x = 0; n n = readInt(); n m = readInt(); n for (int i = 0; i < n; i++) { n c = readInt(); n static_graph::node& cur = g.new_node(); n cur.ice = new vector(); n cur.ice->resize(c); n cur.prev_colors = 0; n for (int t = 0; t < c; t++) { n x = readInt(); n (*cur.ice)[t] = x - 1; n }; n sort((*cur.ice).begin(), (*cur.ice).end()); n ; n }; n for (int i = 0; i < n - 1; i++) { n int a, b; n a = readInt(), b = readInt(); n g.add_bi_edge(a - 1, b - 1); n }; n for (int i = 0; i < m; i++) g.colors[i] = 0; n for (int i = 0; i < m; i++) g.pool.insert(i + 1); n g.depth_run(0); n int mx = 1; n for (int i = 0; i < m; i++) { n mx = max(mx, g.colors[i]); n if (!g.colors[i]) g.colors[i] = 1; n } n cout << mx << endl; n for (int i = 0; i < m; i++) cout << g.colors[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n long long pw(long long a, long long b) { n if (b == 0) return 1; n if (b % 2 == 1) n return (a * pw(a * a, b / 2)); n else n return (1 * pw(a * a, b / 2)); n } n void solve() { n long long n, k; n cin >> n >> k; n long long a[n], b[k]; n for (int i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n int n1 = 0; n for (int i = 0; i < k; i++) { n cin >> b[i]; n if (b[i] == 1) n1++; n } n sort(b, b + k); n long long ans = 0; n for (int i = 0; i < n1; i++) ans += (a[n - 1 - i] * 2); n long long st = 0, en = n - 1 - n1; n for (long long i = k - 1; i >= n1; i--) { n if (b[i] == 1) { n ans += (a[en] * 2); n en--; n } else { n ans += a[en]; n b[i]--; n en--; n ans += a[st]; n st += b[i]; n } n } n cout << ans << endl; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long t = 1; n cin >> t; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n long long lvl1, lvl2, id; n }; n node t[500005]; n bool cmp(struct node x, struct node y) { n if (x.lvl1 < y.lvl1) n return true; n else n return false; n } n vector sh; n vector adj[500005]; n long long vis[500005], lvl1[500005], lvl2[500005]; n void bfs1(long long n = 1) { n queue q; n q.push(n); n vis[n] = 1; n lvl1[n] = 0; n while (!q.empty()) { n long long x = q.front(); n q.pop(); n for (auto &cv : adj[x]) { n if (vis[cv]) continue; n q.push(cv); n vis[cv] = 1; n lvl1[cv] = lvl1[x] + 1; n } n } n } n void bfs2(long long n) { n queue q; n q.push(n); n vis[n] = 1; n lvl2[n] = 0; n while (!q.empty()) { n long long x = q.front(); n q.pop(); n for (auto &cv : adj[x]) { n if (vis[cv]) continue; n q.push(cv); n vis[cv] = 1; n lvl2[cv] = lvl2[x] + 1; n } n } n } n node combine(node x, node y) { n if (x.lvl2 > y.lvl2) n return x; n else n return y; n } n void build(long long n) { n for (long long i = n - 1; i > 0; --i) n t[i] = combine(t[i << 1], t[i << 1 | 1]); n } n node query(long long l, long long r, long long n) { n node res; n res.lvl2 = res.lvl1 = res.id = 0; n for (l += n, r += n; l < r; l >>= 1, r >>= 1) { n if (l & 1) res = (combine(t[l++], res)); n if (r & 1) res = combine(t[--r], res); n } n return res; n } n long long arr[500005]; n int32_t main() { n ios::sync_with_stdio(false); n cin.tie(0); n long long i, j, k, l, m, n, x, y; n cin >> n >> m >> k; n for (i = 0; i < k; i++) { n cin >> arr[i]; n } n for (i = 0; i < m; i++) { n cin >> x; n cin >> y; n adj[x].push_back(y); n adj[y].push_back(x); n } n bfs1(); n memset(vis, 0, sizeof vis); n bfs2(n); n for (i = 0; i < k; i++) { n node temp; n temp.id = arr[i]; n temp.lvl1 = lvl1[arr[i]]; n temp.lvl2 = lvl2[arr[i]]; n sh.push_back(temp); n } n sort(sh.begin(), sh.end(), cmp); n for (i = 0; i < sh.size(); i++) { n t[i + k].lvl1 = sh[i].lvl1; n t[i + k].lvl2 = sh[i].lvl2; n t[i + k].id = sh[i].id; n } n build(k); n long long ans = 0; n for (i = 0; i + 1 < sh.size(); i++) { n long long temp; n temp = sh[i].lvl1; n temp++; n temp += query(i + 1, sh.size(), sh.size()).lvl2; n ans = max(ans, temp); n } n cout << min(lvl2[1], ans) << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma warning(disable : 4786) n #pragma comment(linker, /STACK:102400000,102400000 ) n using namespace std; n const double eps = 1e-8; n const double PI = acos(-1.0); n const int MAXN = 200005; n const int mod = 1000000007; n const long long llinf = (long long)(1e18) + 500; n const int inf = 0x3f3f3f3f; n int x[1005]; n double y[1005]; n int main() { n int i, j, k, m; n int n, r; n scanf( %d%d , &n, &r); n for (i = 1; i <= n; i++) { n scanf( %d , x + i); n y[i] = r * 1.0; n } n for (i = 2; i <= n; i++) { n for (j = i - 1; j >= 1; j--) { n int dx = abs(x[i] - x[j]); n if (dx > 2 * r) continue; n y[i] = max(y[i], y[j] + sqrt(4 * r * r * 1.0 - dx * 1.0 * dx)); n } n } n for (i = 1; i <= n; i++) { n printf( %.10lf%c , y[i], i == n ? n : ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char str[1000005 + 1]; n int main() { n int ans = 0, i; n stack S; n scanf( %s , str); n for (i = 0; str[i] != 0 ; ++i) { n if (str[i] == ( ) S.push(i); n if (str[i] == ) && !S.empty()) { n S.pop(); n ans += 2; n } n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int y, b, r; n cin >> y >> b >> r; n while (1) { n if (r - 1 <= b && r - 2 <= y) { n break; n } n --r; n } n cout << 3 * r - 3; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string n; n cin >> n; n long long even = 0; n long long odd = 0; n long long len = n.length(); n long long aeven = 0; n long long aodd = 0; n long long beven = 0; n long long bodd = 0; n for (int i = 0; i < len; i++) { n if (n[i] == a ) { n if (i % 2 == 1) { n aodd++; n odd += aodd; n even += aeven; n } else { n aeven++; n odd += aeven; n even += aodd; n } n } else { n if (i % 2 == 1) { n bodd++; n odd += bodd; n even += beven; n } else { n beven++; n odd += beven; n even += bodd; n } n } n } n cout << even << << odd << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int const N = 100000; n long long a[N + 1]; n long long f[N * 3]; n inline int lc(int root) { return root << 1; } n inline int rc(int root) { return (root << 1) | 1; } n void build(int root, int l, int r) { n f[root] = -1; n if (l == r) { n f[root] = a[l]; n return; n } n int mid = (l + r) >> 1; n build(lc(root), l, mid); n build(rc(root), mid + 1, r); n if (f[lc(root)] == f[rc(root)]) { n f[root] = f[lc(root)]; n } n } n void update(int root, int l, int r, int fi, int la, long long val) { n if (fi == l && la == r) { n f[root] = val; n return; n } n int mid = (l + r) >> 1; n f[root] = -1; n if (fi > mid) { n update(rc(root), mid + 1, r, fi, la, val); n } else if (la <= mid) { n update(lc(root), l, mid, fi, la, val); n } else { n update(lc(root), l, mid, fi, mid, val); n update(rc(root), mid + 1, r, mid + 1, la, val); n } n if (f[lc(root)] == f[rc(root)]) { n f[root] = f[lc(root)]; n } n } n long long query(int root, int l, int r, int fi, int la) { n if (f[root] != -1) { n return f[root]; n } n int mid = (l + r) >> 1; n if (fi > mid) { n return query(rc(root), mid + 1, r, fi, la); n } else if (la <= mid) { n return query(lc(root), l, mid, fi, la); n } else { n return max(query(lc(root), l, mid, fi, mid), n query(rc(root), mid + 1, r, mid + 1, la)); n } n } n void work() { n int n; n int m; n long long w, h; n long long res; n scanf( %d , &n); n for (int i = 1; i <= n; ++i) { n scanf( %I64d , &a[i]); n } n build(1, 1, n); n scanf( %d , &m); n while (m--) { n scanf( %I64d%I64d , &w, &h); n res = query(1, 1, n, 1, w); n printf( %I64d n , res); n update(1, 1, n, 1, w, res + h); n } n } n int main() { n work(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map mp; n int main() { n long long int b, q, l, m, t; n scanf( %lld%lld%lld%lld , &b, &q, &l, &m); n for (int i = 0; i < m; i++) { n scanf( %lld , &t); n mp[t] = 1; n } n if (b < -l || b > l) { n printf( 0 n ); n return 0; n } n if (b == 0) { n if (mp[0]) n printf( 0 n ); n else n printf( inf n ); n return 0; n } else if (q == 0) { n if (mp[b] && mp[0]) n printf( 0 n ); n else if (!mp[b] && mp[0]) n printf( 1 n ); n else n printf( inf n ); n return 0; n } else if (q == 1) { n if (mp[b]) n printf( 0 n ); n else n printf( inf n ); n return 0; n } else if (q == -1) { n if (mp[b] && mp[-b]) n printf( 0 n ); n else n printf( inf n ); n return 0; n } else { n long long int cont = 0; n while (b <= l && b >= -l) { n if (!mp[b]) cont++; n b *= q; n } n printf( %lld n , cont); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n string a, c; n int b, d, p; n int pos[110]; n p = 0; n cin >> b >> d; n cin >> a; n cin >> c; n int t = 0, la, lc; n la = a.length(); n lc = c.length(); n int k = 0; n for (int i = 0; i < lc; i++) { n k = 0; n for (int j = 0; j < la; j++) n if (a[j] == c[(i + k) % lc]) k++; n pos[i] = k; n } n int sum = 0; n int j = 0; n for (int i = 0; i < b; i++) { n sum += pos[j]; n j = (j + pos[j]) % lc; n } n sum /= lc; n p = sum / d; n cout << p << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, a, b; n set > s; n set sc; n vector ans; n int main() { n cin >> n >> m; n for (int i = 1; i <= m; ++i) { n cin >> a >> b; n s.insert(make_pair(min(a, b), max(a, b))); n } n for (int i = 1; i <= n; ++i) { n sc.insert(i); n } n for (int i = 1; i <= n; ++i) { n if (sc.find(i) != sc.end()) { n int cur = 0; n queue q; n q.push(i); n sc.erase(i); n while (!q.empty()) { n cur++; n int v = q.front(); n q.pop(); n set::iterator it; n set c = sc; n for (it = c.begin(); it != c.end(); it++) { n int to = *it; n if (s.find(make_pair(min(v, to), max(v, to))) == s.end()) { n q.push(to); n sc.erase(to); n } n } n } n ans.push_back(cur); n } n } n sort(ans.begin(), ans.end()); n cout << (int)ans.size() << endl; n for (int i = 0; i < (int)ans.size(); ++i) { n cout << ans[i] << ; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:10000000 ) n using namespace std; n template n inline T abs(T a) { n return ((a < 0) ? -a : a); n } n template n inline T sqr(T a) { n return a * a; n } n const int INF = (int)1E9 + 7; n const long double EPS = 1E-9; n const long double PI = 3.1415926535897932384626433832795; n const int NMAX = 200 * 1000; n int a[NMAX], sza; n int t[NMAX * 4], cnt[NMAX * 4]; n long long sum[NMAX * 4][5]; n char buf[300]; n void upd(int pos, int idx, int lf, int rg) { n if (lf == rg) { n t[idx] ^= 1; n memset(sum[idx], 0, sizeof sum[idx]); n sum[idx][0] = t[idx] * 1LL * a[pos]; n cnt[idx] = t[idx]; n return; n } n int mid = (lf + rg) >> 1; n if (pos <= mid) n upd(pos, 2 * idx + 1, lf, mid); n else n upd(pos, 2 * idx + 2, mid + 1, rg); n cnt[idx] = cnt[2 * idx + 1] + cnt[2 * idx + 2]; n for (int i = 0; i < int(5); ++i) { n long long& ans = sum[idx][i]; n int f = (cnt[2 * idx + 1]) % 5; n f = (i - f + 5) % 5; n ans = sum[2 * idx + 1][i] + sum[2 * idx + 2][f]; n } n } n void change(int val) { n int pos = lower_bound(a, a + sza, val) - a; n upd(pos, 0, 0, sza - 1); n } n inline long long getSum() { return sum[0][2]; } n int main() { n int n; n scanf( %d , &n); n gets(buf); n vector > q; n for (int i = 0; i < int(n); ++i) { n gets(buf); n if (buf[0] == a ) { n int val; n sscanf(buf, add %d , &val); n q.push_back(make_pair(1, val)); n a[sza++] = val; n } n if (buf[0] == d ) { n int val; n sscanf(buf, del %d , &val); n q.push_back(make_pair(-1, val)); n a[sza++] = val; n } n if (buf[0] == s ) { n q.push_back(make_pair(-1, -1)); n } n } n sort(a, a + sza); n sza = unique(a, a + sza) - a; n for (int i = 0; i < int(n); ++i) { n if (q[i] == pair(-1, -1)) { n printf( %I64d n , getSum()); n continue; n } n if (q[i].first == 1) { n change(q[i].second); n } else { n change(q[i].second); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[100001]; n int getBound(int start, int dir, int size, int k) { n int cnt = 0; n bool seen[100001]; n fill(seen, seen + 100001, false); n for (int i = start; i <= size && i > 0; i += dir) { n if (!seen[a[i]]) cnt++, seen[a[i]] = true; n if (cnt == k) return i; n } n return -1; n } n int main() { n int n, k; n cin >> n >> k; n for (int i = 1; i <= n; i++) cin >> a[i]; n int right = getBound(1, 1, n, k); n if (right == -1) n cout << -1 << << -1 << endl; n else { n int left = getBound(right, -1, n, k); n cout << left << << right << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MAX = 10e5; n vector graph[MAX]; n queue q; n bool visit[MAX]; n long long a[MAX]; n long long s[MAX]; n long long parent[MAX]; n int main() { n memset(visit, false, sizeof(visit)); n long long nodes; n cin >> nodes; n for (auto i = 2; i <= nodes; ++i) { n long long tmp; n cin >> tmp; n parent[i] = tmp; n graph[i].push_back(tmp); n graph[tmp].push_back(i); n } n for (auto i = 1; i <= nodes; ++i) { n cin >> s[i]; n } n a[1] = s[1]; n q.push(1); n visit[1] = true; n while (!q.empty()) { n long long n = q.front(); n q.pop(); n if (n != 1) { n if (s[n] == -1) { n s[n] = s[parent[n]]; n if (graph[n].size() > 1) { n long long mini = 10e9; n for (auto v : graph[n]) { n if (v == parent[n]) continue; n mini = min(mini, s[v]); n } n if (mini < s[n]) { n cout << -1; n return 0; n } else { n a[n] = mini - s[n]; n s[n] = mini; n } n } else { n a[n] = 0; n s[n] = s[parent[n]]; n } n } else { n a[n] = s[n] - s[parent[n]]; n } n } n for (auto p : graph[n]) { n if (visit[p]) continue; n q.push(p); n visit[p] = true; n } n } n long long ans = 0; n for (auto i = 1; i <= nodes; i++) { n ans += a[i]; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n string s; n cin >> s; n string ans = ; n int cnt(0); n for (int i = 0; i < s.size(); i++) { n if (s[i] == 0 && cnt == 0) { n cnt++; n } else n ans += s[i]; n } n if (cnt == 0) { n for (int i = 0; i < ans.size() - 1; i++) cout << ans[i]; n } else n cout << ans; n } n int main() { n long long t; n t = 1; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}; n const int N = 500005; n vector arr[N], cnt[N], adj[N]; n int vis[N], st[N], fin[N], dep[N]; n int tim; n char inp[N]; n void dfs(int i, int d) { n vis[i] = 1; n dep[i] = d; n st[i] = ++tim; n arr[d].push_back(st[i]); n int no = 0; n for (int first = 0; first < (int)26; first++) n no |= (first == inp[i] - a ) << first; n cnt[d].push_back(no); n for (int v : adj[i]) n if (!vis[v]) dfs(v, d + 1); n fin[i] = ++tim; n } n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, m; n cin >> n >> m; n for (int i = 0; i < (int)n - 1; i++) { n int first; n cin >> first; n adj[first].push_back(i + 2); n adj[i + 2].push_back(first); n } n for (int i = 0; i < (int)n; i++) cin >> inp[i + 1]; n dfs(1, 0); n for (int i = 0; i < (int)N; i++) { n for (int j = 1; j < cnt[i].size(); j++) { n cnt[i][j] ^= cnt[i][j - 1]; n } n } n for (int wrd = 0; wrd < (int)m; wrd++) { n int a, b; n cin >> a >> b; n b--; n int no_odds = 0; n vector& v = arr[b]; n int l = lower_bound((v).begin(), (v).end(), st[a]) - v.begin(); n int r = upper_bound((v).begin(), (v).end(), fin[a]) - v.begin() - 1; n if (l > r) { n cout << Yes n ; n continue; n } n for (int first = 0; first < (int)26; first++) { n int add = (cnt[b][r] >> first) & 1; n int sub = (l == 0) ? 0 : ((cnt[b][l - 1] >> first) & 1); n no_odds += (add - sub + 2) % 2; n } n if (no_odds <= 1) n cout << Yes n ; n else n cout << No n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int t; n cin >> t; n while (t--) { n long long int a[3], i; n for (i = 0; i < 3; i++) cin >> a[i]; n sort(a, a + 3); n if (a[2] <= a[1] + a[0] + 1) n cout << YES << endl; n else n cout << NO << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n string to_string(string s) { return + s + ; } n string to_string(const char* s) { return to_string((string)s); } n string to_string(bool b) { return (b ? true : false ); } n template n string to_string(pair p) { n return ( + to_string(p.first) + , + to_string(p.second) + ) ; n } n template n string to_string(A v) { n bool first = true; n string res = { ; n for (const auto& x : v) { n if (!first) { n res += , ; n } n first = false; n res += to_string(x); n } n res += } ; n return res; n } n void debug_out() { cerr << endl; } n template n void debug_out(Head H, Tail... T) { n cerr << << to_string(H); n debug_out(T...); n } n template n struct modnum { n static constexpr int MOD = MOD_; n static_assert(MOD_ > 0, MOD must be positive ); n n private: n using ll = long long; n int v; n static int minv(int a, int m) { n a %= m; n assert(a); n return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a); n } n n public: n modnum() : v(0) {} n modnum(ll v_) : v(int(v_ % MOD)) { n if (v < 0) v += MOD; n } n explicit operator int() const { return v; } n friend std::ostream& operator<<(std::ostream& out, const modnum& n) { n return out << int(n); n } n friend std::istream& operator>>(std::istream& in, modnum& n) { n ll v_; n in >> v_; n n = modnum(v_); n return in; n } n friend bool operator==(const modnum& a, const modnum& b) { n return a.v == b.v; n } n friend bool operator!=(const modnum& a, const modnum& b) { n return a.v != b.v; n } n modnum inv() const { n modnum res; n res.v = minv(v, MOD); n return res; n } n friend modnum inv(const modnum& m) { return m.inv(); } n modnum neg() const { n modnum res; n res.v = v ? MOD - v : 0; n return res; n } n friend modnum neg(const modnum& m) { return m.neg(); } n modnum operator-() const { return neg(); } n modnum operator+() const { return modnum(*this); } n modnum& operator++() { n v++; n if (v == MOD) v = 0; n return *this; n } n modnum& operator--() { n if (v == 0) v = MOD; n v--; n return *this; n } n modnum& operator+=(const modnum& o) { n v -= MOD - o.v; n v = (v < 0) ? v + MOD : v; n return *this; n } n modnum& operator-=(const modnum& o) { n v -= o.v; n v = (v < 0) ? v + MOD : v; n return *this; n } n modnum& operator*=(const modnum& o) { n v = int(ll(v) * ll(o.v) % MOD); n return *this; n } n modnum& operator/=(const modnum& o) { return *this *= o.inv(); } n friend modnum operator++(modnum& a, int) { n modnum r = a; n ++a; n return r; n } n friend modnum operator--(modnum& a, int) { n modnum r = a; n --a; n return r; n } n friend modnum operator+(const modnum& a, const modnum& b) { n return modnum(a) += b; n } n friend modnum operator-(const modnum& a, const modnum& b) { n return modnum(a) -= b; n } n friend modnum operator*(const modnum& a, const modnum& b) { n return modnum(a) *= b; n } n friend modnum operator/(const modnum& a, const modnum& b) { n return modnum(a) /= b; n } n }; n using num = modnum<1000000007>; n const int mod = 1e9 + 7; n num power(num a, int64_t b) { n if (b == 0) return 1; n num res = power(a, b / 2); n if (b & 1) return res * res * a; n return res * res; n } n bool checkinter(pair x, pair y) { n if (x.first > y.first) swap(x, y); n return x.first <= y.first && y.first <= x.second; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n if (fopen( input.txt , r )) { n freopen( input.txt , r , stdin); n freopen( output.txt , w , stdout); n } n int64_t N, M, K, R, C, Ax, Bx, Ay, By; n cin >> N >> M >> K >> R >> C >> Ax >> Ay >> Bx >> By; n if (!checkinter(make_pair(Ax, Ax + R - 1), make_pair(Bx, Bx + R - 1)) or n !checkinter(make_pair(By, By + C - 1), make_pair(Ay, Ay + C - 1))) { n num res = 0; n res = power(K, 1ll * N * M - 2ll * R * C); n res *= power(K, 1ll * R * C); n cout << res; n return 0; n } n if (Ax > Bx) swap(Ax, Bx), swap(Ay, By); n if (By < Ay) { n int diff = abs(By + C - 1 - Ay + 1); n By = Ay + C - 1 - diff + 1; n } n int64_t sharearea = 1ll * ((Ay + C - 1) - By + 1) * ((Ax + R - 1) - Bx + 1); n int64_t area = 2ll * R * C - sharearea; n int64_t remainarea = 1ll * N * M - area; n num res = power(K, remainarea); n if (Ax == Bx and Ay == By) n res *= power(K, R * C); n else n res *= power(K, 1ll * R * C - sharearea); n cout << res; n } n "} +{"func_code_string": "#include n using namespace std; n struct rangeincrease { n int l, r; n }; n rangeincrease actions[100001]; n rangeincrease inprogress[100001]; n int actionL = 0; n int nums[100001]; n int opened = 0; n int main() { n int n; n int i; n cin >> n; n for (i = 1; i <= n; i++) { n cin >> nums[i]; n } n for (i = 1; i <= n; i++) { n while (nums[i] > opened) { n opened++; n inprogress[opened].l = i; n } n while (nums[i] < opened) { n inprogress[opened].r = i - 1; n actionL++; n actions[actionL].l = inprogress[opened].l; n actions[actionL].r = inprogress[opened].r; n opened--; n } n } n while (opened > 0) { n inprogress[opened].r = n; n actionL++; n actions[actionL].l = inprogress[opened].l; n actions[actionL].r = inprogress[opened].r; n opened--; n } n cout << actionL << endl; n for (i = 1; i <= actionL; i++) { n cout << actions[i].l << << actions[i].r << endl; n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC target( avx,avx2,fma ) n using namespace std; n bool ispoweroftwo(long long n) { return n & (!(n & (n - 1))); } n long long mod = 1000000007; n long long dx[] = {1, 0, -1, 0}; n long long dy[] = {0, -1, 0, 1}; n bool test = 0; n const long long inf = 1e18; n const long long N = 1e5 + 5; n long long cache[N][4][4]; n long long k, n; n long long color[N][3]; n vector adj[N]; n long long dp(long long u, long long f = 3, long long f1 = 3, long long p = -1) { n long long &ans = cache[u][f][f1]; n if (ans != -1) return ans; n long long kid1 = -1, kid2 = -1; n for (auto it : adj[u]) { n if (it == p) continue; n if (kid1 == -1) n kid1 = it; n else n kid2 = it; n } n if (kid1 == -1) return ans = 0; n if (kid2 != -1) { n vector c1, c2, c3; n for (long long i = 0; i < 3; ++i) { n if (i == f) continue; n c1.emplace_back(color[kid1][i] + dp(kid1, i, f, u)); n c3.emplace_back(i); n } n for (long long i = 0; i < 3; ++i) { n if (i == f) continue; n c2.emplace_back(color[kid2][i] + dp(kid2, i, f, u)); n } n ans = min(c1[0] + c2[1], c1[1] + c2[0]); n return ans; n } n ans = inf; n for (long long i = 0; i < 3; ++i) { n if (i == f or i == f1) continue; n ans = min(ans, color[kid1][i] + dp(kid1, i, f, u)); n } n return ans; n } n vector col(N); n void path(long long u, long long f, long long f1 = 3, long long p = -1) { n long long &ans = cache[u][f][f1]; n long long kid1 = -1, kid2 = -1; n for (auto it : adj[u]) { n if (it == p) continue; n if (kid1 == -1) n kid1 = it; n else n kid2 = it; n } n if (kid1 == -1) return; n if (kid2 != -1) { n vector c1, c2, c3; n for (long long i = 0; i < 3; ++i) { n if (i == f) continue; n c1.emplace_back(color[kid1][i] + cache[kid1][i][f]); n c3.emplace_back(i); n } n for (long long i = 0; i < 3; ++i) { n if (i == f) continue; n c2.emplace_back(color[kid2][i] + cache[kid2][i][f]); n } n if (ans != c1[0] + c2[1]) swap(kid1, kid2); n col[kid1] = c3[0] + 1; n col[kid2] = c3[1] + 1; n path(kid1, c3[0], f, u); n path(kid2, c3[1], f, u); n return; n } n for (long long i = 0; i < 3; ++i) { n if (i == f or i == f1) continue; n if (ans == color[kid1][i] + cache[kid1][i][f]) { n col[kid1] = i + 1; n path(kid1, i, f, u); n } n } n } n void solve(long long tc = 0) { n memset(cache, -1, sizeof(cache)); n cin >> n; n for (long long i = 0; i < 3; ++i) n for (long long j = 1; j <= n; ++j) cin >> color[j][i]; n for (long long i = 1, x, y; i < n; ++i) { n cin >> x >> y; n adj[x].emplace_back(y); n adj[y].emplace_back(x); n } n for (long long i = 1; i <= n; ++i) { n if (adj[i].size() >= 3) { n cout << -1 n ; n return; n } n } n adj[0].emplace_back(1); n long long ans = dp(0, 3); n cout << ans << n ; n path(0, 3); n for (long long i = 1; i <= n; ++i) cout << col[i] << ; n cout << n ; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long t = 1; n if (test) cin >> t; n for (long long i = 1; i <= t; ++i) { n solve(i); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MX = 200005; n long long n, m; n vector adj[2][MX]; n long long st[MX], fin[MX]; n long long deg[2][MX]; n long long ans, tim; n long long cur = 1; n pair seg[4 * MX]; n long long lazy[4 * MX]; n pair merge(pair x, n pair y) { n if (x.first == y.first) return {x.first, x.second + y.second}; n return min(x, y); n } n void build(long long node, long long l, long long r) { n if (l == r) { n seg[node] = {0, 1}; n return; n } n long long mid = (l + r) / 2; n build(2 * node, l, mid); n build(2 * node + 1, mid + 1, r); n seg[node] = merge(seg[2 * node], seg[2 * node + 1]); n } n void propagate(long long node, long long l, long long r) { n seg[node].first += lazy[node]; n if (l != r) { n lazy[2 * node] += lazy[node]; n lazy[2 * node + 1] += lazy[node]; n } n lazy[node] = 0; n } n void update(long long node, long long l, long long r, long long x, long long y, n long long val) { n propagate(node, l, r); n if (l > y or r < x) return; n if (l >= x and r <= y) { n lazy[node] += val; n propagate(node, l, r); n return; n } n long long mid = (l + r) / 2; n update(2 * node, l, mid, x, y, val); n update(2 * node + 1, mid + 1, r, x, y, val); n seg[node] = merge(seg[2 * node], seg[2 * node + 1]); n } n void dfs(long long u) { n st[u] = tim++; n for (auto v : adj[1][u]) { n dfs(v); n } n fin[u] = tim; n } n void solve(long long u) { n update(1, 0, cur - 1, st[u], fin[u] - 1, 1); n if (!seg[1].first) ans -= seg[1].second; n for (auto v : adj[0][u]) { n solve(v); n } n update(1, 0, cur - 1, st[u], fin[u] - 1, -1); n } n signed main() { n cin >> n >> m; n vector > index(n, vector(m, -1)); n vector > a(n, vector(m)); n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < m; j++) { n cin >> a[i][j]; n if (a[i][j] == L ) { n index[i][j] = cur; n index[i][j + 1] = cur; n cur++; n } else if (a[i][j] == U ) { n index[i][j] = cur; n index[i + 1][j] = cur; n cur++; n } n } n } n cur--; n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < m; j++) { n if (a[i][j] == L and j + 2 < m) { n adj[(i + j) % 2][index[i][j + 2]].push_back(index[i][j]); n deg[(i + j) % 2][index[i][j]]++; n } n if (a[i][j] == R and j - 2 >= 0) { n adj[(i + j) % 2][index[i][j - 2]].push_back(index[i][j]); n deg[(i + j) % 2][index[i][j]]++; n } n if (a[i][j] == U and i + 2 < n) { n adj[(i + j) % 2][index[i + 2][j]].push_back(index[i][j]); n deg[(i + j) % 2][index[i][j]]++; n } n if (a[i][j] == D and i - 2 >= 0) { n adj[(i + j) % 2][index[i - 2][j]].push_back(index[i][j]); n deg[(i + j) % 2][index[i][j]]++; n } n } n } n ans = (n * m * n * m) / 4; n tim = 0; n for (long long i = 1; i < cur + 1; i++) { n if (!deg[1][i]) dfs(i); n } n build(1, 0, cur - 1); n for (long long i = 1; i < cur + 1; i++) { n if (!deg[0][i]) solve(i); n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 205, inf = 1e9; n int n, a[N]; n int tot, lnk[N], fro[N * N * 2], nxt[N * N * 2], son[N * N * 2], c[N * N * 2], n ori[N * N * 2]; n int S, T, dep[N], cur[N]; n queue q; n int cnt; n bool vis[N]; n vector ans[N]; n bool isprm(int x) { n if (x == 2 || x == 3 || x == 5 || x == 7) return 1; n for (int i = 2; i <= sqrt(x); ++i) n if (x % i == 0) return 0; n return 1; n } n void add(int x, int y, int z) { n nxt[++tot] = lnk[x], lnk[x] = tot; n fro[tot] = x, son[tot] = y, c[tot] = ori[tot] = z; n } n struct Dinic { n bool bfs(int x = 0) { n memset(dep, 0, sizeof dep), dep[S] = 1; n for (; !q.empty(); q.pop()) n ; n q.push(S); n for (; !q.empty();) { n x = q.front(), q.pop(); n for (int j = lnk[x]; j; j = nxt[j]) { n if (!dep[son[j]] && c[j]) { n dep[son[j]] = dep[x] + 1; n q.push(son[j]); n } n } n } n return dep[T]; n } n int dfs(int x, int f, int ret = 0) { n if (x == T) return f; n for (int &j = cur[x]; j; j = nxt[j]) { n if (dep[son[j]] == dep[x] + 1 && c[j]) { n int delta = dfs(son[j], min(f, c[j])); n c[j] -= delta, c[j ^ 1] += delta; n ret += delta, f -= delta; n } n } n return ret; n } n int answer(int ret = 0) { n for (; bfs();) { n for (int i = S; i <= T; ++i) cur[i] = lnk[i]; n ret += dfs(S, inf); n } n return ret; n } n } network; n void dfs(int x, int s) { n vis[x] = 1, ans[cnt].push_back(x); n if (a[x] & 1) { n for (int j = lnk[x]; j; j = nxt[j]) { n if (c[j] != 0 || son[j] == S || son[j] == T) continue; n if (!vis[son[j]]) { n dfs(son[j], s); n break; n } n } n } else { n for (int j = lnk[x]; j; j = nxt[j]) { n if (c[j ^ 1] != 0 || son[j] == S || son[j] == T) continue; n if (!vis[son[j]]) { n dfs(son[j], s); n break; n } n } n } n } n int main() { n cin >> n, tot = 1, S = 0, T = n + 1; n for (int i = 1; i <= n; ++i) { n scanf( %d , &a[i]); n if (a[i] & 1) n add(S, i, 2), add(i, S, 0); n else n add(i, T, 2), add(T, i, 0); n } n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= n; ++j) n if (isprm(a[i] + a[j]) && a[i] % 2 == 1 && a[j] % 2 == 0) n add(i, j, 1), add(j, i, 0); n } n int fl = network.answer(); n if (fl != n) return puts( Impossible ), 0; n for (int i = 1; i <= n; ++i) n if (a[i] & 1) { n if (!vis[i]) ++cnt, dfs(i, i); n } n printf( %d n , cnt); n for (int i = 1; i <= cnt; ++i) { n printf( %d , ans[i].size()); n for (int j = 0; j < ans[i].size(); ++j) printf( %d , ans[i][j]); n puts( ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int NMax = 1003; n enum directions { EAST, NORTH }; n struct point { n int x, y; n }; n point a[NMax]; n int n; n int test(int searchDir, point a[], long double x, long double y) { n if (searchDir == NORTH) { n int nr = 0; n for (int i = 1; i <= n; ++i) { n if (a[i].y >= y && n (((long double)a[i].x >= x && x <= (long double)a[i + 1].x) || n ((long double)a[i].x <= x && x >= (long double)a[i + 1].x))) { n nr++; n } n } n return (nr & 1); n } else { n int nr = 0; n for (int i = 1; i <= n; ++i) { n if (a[i].x >= x && n (((long double)a[i].y >= y && y <= (long double)a[i + 1].y) || n ((long double)a[i].y <= y && y >= (long double)a[i + 1].y))) { n nr++; n } n } n return (nr & 1); n } n } n int main() { n cin >> n; n for (int i = 1; i <= n + 1; ++i) { n cin >> a[i].x >> a[i].y; n } n int ans = 0; n for (int i = 2; i <= n + 1; ++i) { n if (a[i].x == a[i - 1].x) { n if (a[i].y > a[i - 1].y) { n ans += test(EAST, a, a[i].x, a[i].y + 0.5); n } else { n ans += test(EAST, a, a[i].x, a[i].y - 0.5); n } n } else { n if (a[i].x > a[i - 1].x) { n ans += test(NORTH, a, a[i].x + 0.5, a[i].y); n } else { n ans += test(NORTH, a, a[i].x - 0.5, a[i].y); n } n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long px1[133000], px2[133000], py1[133000], py2[133000], sx1[133000], n sx2[133000], sy1[133000], sy2[133000]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n long long a[n + 1], b[n + 1], c[n + 1], d[n + 1]; n for (unsigned long long i = 1; i < n + 1; i++) n cin >> a[i] >> b[i] >> c[i] >> d[i]; n px1[0] = -9999999999, px2[0] = 9999999999, py1[0] = -9999999999, n py2[0] = 9999999999; n for (unsigned long long i = 1; i < n + 1; i++) { n px1[i] = max(a[i], px1[i - 1]); n px2[i] = min(c[i], px2[i - 1]); n py1[i] = max(b[i], py1[i - 1]); n py2[i] = min(d[i], py2[i - 1]); n } n sx1[n + 1] = -9999999999, sx2[n + 1] = 9999999999, sy1[n + 1] = -9999999999, n sy2[n + 1] = 9999999999; n for (unsigned long long i = n + 1 - 1; i >= 1; i--) { n sx1[i] = max(a[i], sx1[i + 1]); n sx2[i] = min(c[i], sx2[i + 1]); n sy1[i] = max(b[i], sy1[i + 1]); n sy2[i] = min(d[i], sy2[i + 1]); n } n long long ax1, ax2, ay1, ay2; n for (unsigned long long i = 1; i < n + 1; i++) { n ax1 = max(px1[i - 1], sx1[i + 1]); n ax2 = min(px2[i - 1], sx2[i + 1]); n ay1 = max(py1[i - 1], sy1[i + 1]); n ay2 = min(py2[i - 1], sy2[i + 1]); n if (ax1 <= ax2 && ay1 <= ay2) { n cout << ax1 << << ay1 << endl; n return 0; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1051131; n const int Inv2 = (mod + 1) >> 1; n inline void setIO(string a) {} n long long Power; n int m, s, n, nn; n int a[(1 << 25) + 23]; n void work(int n, int p, int q) { n if (n == 1) { n int &An = a[1]; n (p += q) %= mod; n for (long long c = Power; c; c >>= 1, p = 1ll * p * p % mod) n if (c & 1) An = 1ll * An * p % mod; n return; n } n int t = n >> 1, tt = 1ll * t * p % mod; n int ttp = (p + q + mod - tt) % mod, tttp = 1; n for (long long c = Power; c; c >>= 1, ttp = 1ll * ttp * ttp % mod) n if (c & 1) tttp = 1ll * tttp * ttp % mod; n int xi = (1ll * t * p % mod - p + q + mod) % mod; n for (int i = (1); i <= (t); i++) { n int A = a[i], B = a[i + t]; n a[i] = (A + B) % mod; n a[i + t] = (A + mod - B) % mod; n a[i + t] = 1ll * a[i + t] * tttp % mod; n } n work(n >> 1, (p + p) % mod, xi); n for (int i = (1); i <= (t); i++) { n int A = a[i], B = a[i + t]; n a[i] = (A + B) % mod; n a[i + t] = (A + mod - B) % mod; n a[i] = 1ll * a[i] * Inv2 % mod; n a[i + t] = 1ll * a[i + t] * Inv2 % mod; n } n } n int main() { n scanf( %d , &m); n cin >> Power; n scanf( %d , &s); n for (int i = (1); i <= (s); i++) scanf( %d , &a[i]); n n = 1 << m; n nn = n; n for (int i = (s + 1); i <= (n); i++) n a[i] = (101ll * a[i - s] + 10007) % 1051131; n work(n, 1, 0); n int ans = 0; n for (int i = (1); i <= (n); i++) ans ^= a[i]; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, arr[30010], book[30010]; n bool judge() { n int ps, gap; n int t1 = 1, t2; n while (t1 <= n && book[t1]) t1++; n t2 = t1 + 1; n if (t1 > n) return false; n while (t2 <= n && book[t2]) t2++; n if (t2 > n) return true; n gap = arr[t2] - arr[t1]; n ps = t2; n for (int i = t2 + 1; i <= n; i++) n if (!book[i]) { n if (arr[i] - arr[ps] == gap) n ps = i; n else n return false; n } n return true; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &arr[i]); n if (n == 2) n printf( %d n%d , arr[1], arr[2]); n else { n int x[3] = {arr[2] - arr[1], arr[3] - arr[2], arr[3] - arr[1]}; n int flag = 0; n for (int i = 0; i < 3; i++) { n int st = 4, tmp = arr[3]; n memset(book, 0, sizeof(book)); n if (i == 0) { n book[2] = book[1] = 1; n st = 3; n tmp = arr[2]; n } else if (i == 1) n book[2] = book[3] = 1; n else n book[1] = book[3] = 1; n for (int ii = st; ii <= n; ii++) n if (arr[ii] == tmp + x[i]) { n book[ii] = 1; n tmp = arr[ii]; n } n if (judge()) { n flag = 1; n break; n } else { n int p = n; n while (!book[p]) p--; n book[p] = 0; n if (judge()) { n flag = 1; n break; n } n } n } n if (flag) { n for (int i = 1; i <= n; i++) n if (book[i]) printf( %d , arr[i]); n printf( n ); n for (int i = 1; i <= n; i++) n if (!book[i]) printf( %d , arr[i]); n } else n printf( No solution ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int ekub(int a, int b) { return b == 0 ? a : ekub(b, a % b); } n long long s[51][51]; n int main() { n long long i, j, n, m, a, b, ans = 1e9; n cin >> n >> m; n for (i = 1; i <= n; i++) n for (j = 1; j <= m; j++) { n cin >> s[i][j]; n s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1]; n } n cin >> a >> b; n for (i = a; i <= n; i++) n for (j = b; j <= m; j++) n ans = min(ans, s[i][j] - s[i - a][j] - s[i][j - b] + s[i - a][j - b]); n for (i = b; i <= n; i++) n for (j = a; j <= m; j++) n ans = min(ans, s[i][j] - s[i - b][j] - s[i][j - a] + s[i - b][j - a]); n cout << ans; n } n "} +{"func_code_string": "#include n namespace P_TEMPLATE { n class fastin { n private: n int _ch, _f; n n public: n inline fastin& operator>>(char& c) { n c = getchar(); n return *this; n } n template n inline fastin& operator>>(_Tp& _x) { n _x = 0; n while (!isdigit(_ch)) _f |= (_ch == 45), _ch = getchar(); n while (isdigit(_ch)) n _x = (_x << 1) + (_x << 3) + (_ch ^ 48), _ch = getchar(); n _f && (_x = -_x, _f = 0); n return *this; n } n fastin() { _ch = _f = 0; } n } fin; n class fastout { n private: n int _num[32], _head; n n public: n inline fastout& operator<<(char c) { n putchar(c); n return *this; n } n template n inline fastout& operator<<(_Tp _x) { n _Tp _k; n if (_x == 0) { n putchar( 0 ); n return *this; n } n if (_x < 0) putchar( - ), _x = -_x; n while (_x > 0) n _k = _x / 10, ++_head, _num[_head] = (_x - (_k << 1) - (_k << 3)) ^ 48, n _x = _k; n while (_head > 0) putchar(_num[_head]), --_head; n return *this; n } n fastout() { _head = 0; } n } fout; n inline void P_INIT() {} n } // namespace P_TEMPLATE n using namespace P_TEMPLATE; n using namespace std; n const int maxn = 1000004, maxm = 104; n const int mod = 1000000007, inf = 1201201201; n int n, k, p; n char s[maxn][maxm]; n int len[maxn]; n int book[28], cnt[28]; n vector e[28]; n queue q; n int topo[28], indx; n inline bool check() { n for (register int i = 1; i <= 26; ++i) n if (!cnt[i]) q.push(i), topo[++indx] = i; n while (!q.empty()) { n int t = q.front(); n q.pop(); n for (register int i = 0; i < e[t].size(); ++i) { n --cnt[e[t][i]]; n if (cnt[e[t][i]] == 0) q.push(e[t][i]), topo[++indx] = e[t][i]; n } n } n return indx == 26; n } n signed main() { n P_INIT(); n fin >> n >> k; n for (register int i = 1; i <= n; ++i) { n fin >> p; n for (register int j = 1; j <= k; ++j) { n scanf( %s , s[p * k + j] + 1), len[p * k + j] = strlen(s[p * k + j] + 1); n for (register int t = 1; t <= len[p * k + j]; ++t) n book[s[p * k + j][t] - a + 1] = 1; n } n } n for (register int i = 1; i < n * k; ++i) { n bool flag = 0; n for (register int j = 1; j <= std::min(len[i], len[i + 1]); ++j) n if (s[i][j] != s[i + 1][j]) { n e[s[i][j] - a + 1].push_back(s[i + 1][j] - a + 1); n ++cnt[s[i + 1][j] - a + 1]; n flag = 1; n break; n } n if (!flag && len[i] > len[i + 1]) { n puts( IMPOSSIBLE ); n return 0; n } n } n if (check()) { n for (register int i = 1; i <= 26; ++i) n if (book[topo[i]]) fout << char(topo[i] - 1 + a ); n } else n puts( IMPOSSIBLE ); n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:66777216 ) n using namespace std; n const int N = 100007; n int n, a[N], cnt[N]; n vector D[N]; n long long power(long long a, long long b) { n if (b == 0) { n return 1; n } n if (b & 1) { n return (a * power(a, b - 1)) % 1000000007LL; n } n long long ret = power(a, b >> 1); n return (ret * ret) % 1000000007LL; n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n; ++i) { n scanf( %d , &a[i]); n } n sort(a, a + n); n for (int i = 1; i <= a[n - 1]; ++i) { n for (int j = i; j <= a[n - 1]; j += i) { n D[j].push_back(i); n } n } n long long ans = 0; n for (int m = 1; m <= a[n - 1]; ++m) { n vector &d = D[m]; n int nd = (int)(d).size(); n for (int i = 0; i < nd; ++i) { n cnt[i] = n - (lower_bound(a, a + n, d[i]) - a); n } n long long cur = n (power(nd, cnt[nd - 1]) - power(nd - 1, cnt[nd - 1]) + 1000000007LL) % n 1000000007LL; n for (int i = 0; i < nd - 1; ++i) { n cur = (cur * power(i + 1, cnt[i] - cnt[i + 1])) % 1000000007LL; n } n ans = (ans + cur) % 1000000007LL; n } n printf( %d n , (int)ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void init_code() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n } n int main() { n init_code(); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n vector> v; n vector> v1; n for (int i = 0; i < n; i++) { n int x, y; n cin >> x >> y; n v1.push_back({x, y}); n v.push_back({x, y}); n } n sort(v.begin(), v.end()); n int st = v[0].first; n int ed = v[0].second; n int cnt = 1; n unordered_map mp; n mp[st] = 1; n for (int i = 1; i < n; i++) { n if (v[i].first <= ed) { n mp[v[i].first] = cnt; n ed = max(ed, v[i].second); n } else { n st = v[i].first; n ed = v[i].second; n if (cnt == 1) { n cnt++; n } n mp[v[i].first] = cnt; n } n } n if (cnt < 2) { n cout << -1 << endl; n } else { n for (int i = 0; i < v1.size(); i++) { n cout << mp[v1[i].first] << ; n } n cout << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() {} n void no() { n cout << NO << n ; n exit(0); n } n const long long maxn = 100050; n long long a[maxn]; n long long psa[maxn]; n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n long long n; n cin >> n; n for (long long i = 1; i <= n; i++) { n cin >> a[i]; n } n long long len = n; n for (long long i = 1; i <= n; i++) { n if (a[i] != a[1]) { n len = i - 1; n break; n } n } n for (long long i = 1; i <= n; i++) { n psa[i] = psa[i - 1] + a[i]; n } n if (n % len) no(); n for (long long i = len; i <= n; i += len) { n long long sum = psa[i] - psa[i - len]; n if (sum and sum != len) { n no(); n } n if (i >= len * 2) { n if (sum == psa[i - len] - psa[i - 2 * len]) { n no(); n } n } n } n cout << YES << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1234567; n int pref[N], a[N], b[N]; n char c[N]; n int solve(vector > z, int b) { n sort(z.begin(), z.end()); n int cnt = z.size(); n if (cnt < 2) { n return 0; n } n pref[0] = 0; n for (int i = 0; i < cnt; i++) { n pref[i + 1] = max(pref[i], z[i].second); n } n int i = 0; n int res = 0; n for (int j = cnt - 1; j >= 0; j--) { n while (i < j && z[i].first + z[j].first <= b) { n i++; n } n i = min(i, j); n if (i > 0) { n res = max(res, pref[i] + z[j].second); n } n } n return res; n } n int same(vector > &v, int b) { n if (v.size() < 2) return 0; n sort(v.begin(), v.end()); n vector pre(v.size() + 1, 0); n for (int i = 0; i < v.size(); i++) pre[i + 1] = max(pre[i], v[i].second); n int i = 0, ans = 0; n for (int j = v.size() - 1; j >= 0; j--) { n while (i < j && v[i].first + v[j].first <= b) i++; n i = min(i, j); n if (i > 0) { n ans = max(ans, v[j].second + pre[i]); n } n } n return ans; n } n int main() { n int n, C, D; n scanf( %d %d %d , &n, &C, &D); n for (int i = 0; i < n; i++) { n scanf( %d %d , a + i, b + i); n c[i] = getchar(); n while (c[i] != C && c[i] != D ) { n c[i] = getchar(); n } n } n int ans = 0; n { n int x = 0, y = 0; n for (int i = 0; i < n; i++) { n if (c[i] == C && b[i] <= C) { n x = max(x, a[i]); n } n } n for (int i = 0; i < n; i++) { n if (c[i] == D && b[i] <= D) { n y = max(y, a[i]); n } n } n if (x > 0 && y > 0) { n ans = max(ans, x + y); n } n } n { n vector > z; n for (int i = 0; i < n; i++) { n if (c[i] == C ) { n z.push_back(make_pair(b[i], a[i])); n } n } n ans = max(ans, same(z, C)); n } n { n vector > z; n for (int i = 0; i < n; i++) { n if (c[i] == D ) { n z.push_back(make_pair(b[i], a[i])); n } n } n ans = max(ans, same(z, D)); n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n inline int abs(int n) { return n < 0 ? -n : n; } n bool board[20][20]; n int dx[] = {-3, -2, -2, -1, -1, 0, 0, 1, 1, 2, 2, 3}; n int dy[] = {0, 1, -1, 2, -2, 3, -3, 2, -2, 1, -1, 0}; n int dfs(int p, int n, int m) { n int mx = p, t, cnt = 0; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (!board[i][j]) { n board[i][j] = true; n for (int k = 0; k < 12; k++) { n int ic = i + dx[k], jc = j + dy[k]; n if (ic >= 0 && ic < n && jc >= 0 && jc < m && !board[ic][jc]) { n board[ic][jc] = true; n t = dfs(p + 2, n, m); n mx < t && (mx = t); n if (mx == ((m * n) | 1) - 1) return mx; n board[ic][jc] = false; n } n } n board[i][j] = false; n cnt++; n if (m * n - cnt <= mx) return mx; n } n } n } n return mx; n } n int ans[] = {0, 0, 0, 0, 2, 4}; n int main() { n int m, n; n scanf( %d%d , &m, &n); n if (m < 10 && n < 10) { n printf( %d n , dfs(0, n, m)); n } else if (m == 1) { n printf( %d n , n / 6 * 6 + ans[n % 6]); n } else if (n == 1) { n printf( %d n , m / 6 * 6 + ans[m % 6]); n } else { n printf( %lld n , (((long long)(m)*n) | 1) - 1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using db = long double; n using pll = pair; n const long long sz = 300003; n long long dp[sz][2], n; n long long a[sz]; n long long dfs(long long i, long long par) { n if (i >= n) return 0; n long long &res = dp[i][par]; n if (res == -1) { n res = 0; n if (par) { n res = a[i] + dfs(i + 1, par ^ 1); n } else { n res = -a[i] + dfs(i + 1, par ^ 1); n } n res = max({0LL, res, dfs(i + 1, par)}); n } n return res; n } n int32_t main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long t, i, x, j, y, q, z, k; n int kkr, csk; n long long tt; n cin >> tt; n for (long long _tt = 0; _tt < tt; _tt++) { n cin >> n >> q; n for (int i = 0; i < n; i++) cin >> a[i]; n ; n while (q-- > 0) { n cin >> x >> y; n x--, y--; n } n for (i = 0; i < n; i += 1) { n memset(dp[i], -1, sizeof(dp[i])); n } n z = dfs(0, 1); n 42; n cout << z << n ; n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n int arr[n]; n for (int i = 0; i < n; i++) cin >> arr[i]; n int counts[n + 1]; n memset(counts, 0, sizeof(counts)); n if (n == 1) { n cout << 0 << endl; n continue; n } n for (int i = 0; i < n; i++) counts[arr[i]]++; n int dc = 0, rc = INT_MIN; n for (int i = 0; i <= n; i++) { n if (counts[i] > 0) dc++; n rc = max(rc, counts[i]); n } n if (rc > 1) dc--; n if (rc > dc + 1) n cout << dc + 1 << endl; n else n cout << min(dc, rc) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 105; n const int inf = 10000000; n int n, k; n int l[N], r[N]; n int main() { n scanf( %d%d , &n, &k); n int midx = (k + 1) / 2, midy = (k + 1) / 2; n for (int i = 0; i < n; i++) { n int m, ans = inf, x, y1, y2; n scanf( %d , &m); n for (int row = 1; row <= k; row++) { n if (l[row] == 0 && r[row] == 0) { n for (int a = 1; a + m - 1 <= k; a++) { n int tot = 0, b = a + m - 1; n for (int col = a; col <= b; col++) { n tot += abs(row - midx) + abs(col - midy); n } n if (tot < ans) ans = tot, x = row, y1 = a, y2 = b; n } n } else { n if (l[row] > m) { n int tot = 0, a = l[row] - m, b = l[row] - 1; n for (int col = a; col <= b; col++) { n tot += abs(row - midx) + abs(col - midy); n } n if (tot < ans) ans = tot, x = row, y1 = a, y2 = b; n } n if (r[row] + m <= k) { n int tot = 0, a = r[row] + 1, b = r[row] + m; n for (int col = a; col <= b; col++) n tot += abs(row - midx) + abs(col - midy); n if (tot < ans) ans = tot, x = row, y1 = a, y2 = b; n } n } n } n if (ans == inf) n puts( -1 ); n else { n printf( %d %d %d n , x, y1, y2); n if (r[x] == 0 && l[x] == 0) n l[x] = y1, r[x] = y2; n else n l[x] = min(l[x], y1), r[x] = max(r[x], y2); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 500010; n const int M = 16; n const int inf = 0x3f3f3f3f; n const int S = 1 << 15; n map mp; n int vs[15], n, m; n char s[N][12], sx[12]; n int dp[S], cnt[S][16]; n int cal(int st) { n int res = 0; n while (st) { n if (st & 1) res++; n st >>= 1; n } n return res; n } n void prepare() { n for (int i = 0; i < S; ++i) { n int tmp = i; n for (int j = 0; j < M; ++j) { n tmp >>= 1; n cnt[i][j] = cal(tmp); n } n } n } n int stx[N], pre[M]; n int main() { n prepare(); n ios::sync_with_stdio(0); n scanf( %d , &n); n for (int i = 0; i < n; ++i) { n scanf( %s , sx); n mp[sx] = i; n } n int ans1 = -1, ans2 = 0, ans3 = 0; n scanf( %d , &m); n for (int i = 0; i < m; ++i) { n int k; n scanf( %d , &k); n memset(vs, 0, sizeof vs); n for (int j = 0; j < k; ++j) { n scanf( %s , s[j]); n if (mp.find(s[j]) == mp.end()) continue; n vs[mp[s[j]]] = 1; n } n int f = 0; n for (int j = 0; j < n && !f; ++j) n if (!vs[j]) f = 1; n if (f) continue; n int v = 0; n memset(dp, 0x3f, sizeof dp); n dp[0] = 0; n int pre = 0; n for (int j = 0; j < k; ++j) { n if (mp.find(s[j]) == mp.end()) continue; n int id = mp[s[j]], vst = 1 << id; n if (pre & (1 << id)) continue; n pre = (pre & ((1 << id) - 1) | (1 << id)); n for (int st = stx[j] & (vst - 1); st < (1 << n); ++st) n if ((st & vst) == 0) { n dp[st | vst] = min(dp[st | vst], dp[st] + cnt[st][id]); n } n } n int tmp = n * (n - 1) / 2 - dp[(1 << n) - 1] + 1; n if (ans1 == -1 || tmp > ans2 || (tmp == ans2 && dp[(1 << n) - 1] < ans3)) { n ans1 = i; n ans2 = tmp; n ans3 = dp[(1 << n) - 1]; n } n } n if (ans1 == -1) n puts( Brand new problem! ); n else { n printf( %d n , ans1 + 1); n printf( %s , [: ); n for (int i = 0; i < ans2; ++i) putchar( | ); n puts( :] ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n using V = vector; n const int MM = 5e5 + 5; n using T = long long; n bool QUERY; n struct Line { n mutable T a, b, p; n T Eval(T first) const { return a * first + b; } n bool operator<(const Line& o) const { return QUERY ? p < o.p : a < o.a; } n }; n struct ConvexHull : multiset { n const T kInf = numeric_limits::max(); n T div(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); } n bool isect(iterator first, iterator second) { n if (second == end()) { n first->p = kInf; n return false; n } n if (first->a == second->a) { n first->p = first->b > second->b ? kInf : -kInf; n } else { n first->p = div(second->b - first->b, first->a - second->a); n } n return first->p >= second->p; n } n void InsertLine(T a, T b) { n auto nx = insert({a, b, 0}), it = nx++, pv = it; n while (isect(it, nx)) { n nx = erase(nx); n } n if (pv != begin() && isect(--pv, it)) { n isect(pv, it = erase(it)); n } n while ((it = pv) != begin() && (--pv)->p >= it->p) { n isect(pv, erase(it)); n } n } n T EvalMax(T first) { n if (empty()) { n return -2e18; n } n QUERY = 1; n auto it = lower_bound({0, 0, first}); n QUERY = 0; n return it->Eval(first); n } n }; n vector> tree; n long long sub[MM]; n long long n; n long long sq(long long e) { return e * e; } n void dfs1(int cur, int par) { n sub[cur] = 1; n for (auto u : tree[cur]) { n if (u != par) { n dfs1(u, cur); n sub[cur] += sub[u]; n } n } n } n long long dp1[MM]; n void dfs2(int cur, int par) { n dp1[cur] = sq(sub[cur]); n for (int u : tree[cur]) { n if (u != par) { n dfs2(u, cur); n dp1[cur] = min(dp1[cur], sq(sub[cur] - sub[u]) + dp1[u]); n } n } n } n vector ans; n void dfs3(int cur, int par) { n ConvexHull CH; n ans[cur] = sq(n); n for (int u : tree[cur]) { n if (u != par) { n dfs3(u, cur); n long long val = dp1[u] - CH.EvalMax(sub[u]) + sq(sub[u]); n ans[cur] = min(ans[cur], val); n ans[cur] = min(ans[cur], dp1[u] + sq(n - sub[u])); n CH.InsertLine(2 * (n - sub[u]), -(dp1[u] + sq(n - sub[u]))); n } n } n return; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n; n tree.resize(n); n ans.resize(n); n for (int i = 0; i < n - 1; i++) { n int u, v; n cin >> u >> v; n u--; n v--; n tree[u].push_back(v); n tree[v].push_back(u); n } n dfs1(0, -1); n dfs2(0, -1); n dfs3(0, -1); n cout << (n * n - n) / 2 + n (sq(n) - *min_element((ans).begin(), (ans).end())) / 2 n << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Item { n int x[3], y[3]; n }; n bool check(Item t); n inline int Dist(int x1, int y1, int x2, int y2) { n return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2); n } n int main() { n Item it; n for (int i = 0; i < 3; i++) cin >> it.x[i] >> it.y[i]; n if (check(it)) n cout << RIGHT n ; n else { n bool f = false; n for (int i = 0; i < 3; i++) { n Item tmp = it; n tmp.x[i]--; n if (check(tmp)) { n f = true; n break; n } n tmp.x[i] += 2; n if (check(tmp)) { n f = true; n break; n } n } n for (int i = 0; i < 3; i++) { n Item tmp = it; n tmp.y[i]--; n if (check(tmp)) { n f = true; n break; n } n tmp.y[i] += 2; n if (check(tmp)) { n f = true; n break; n } n } n if (f == true) n cout << ALMOST n ; n else n cout << NEITHER n ; n } n return 0; n } n bool check(Item t) { n int d[3]; n int xx[3], yy[3]; n d[0] = Dist(t.x[0], t.y[0], t.x[1], t.y[1]); n d[1] = Dist(t.x[0], t.y[0], t.x[2], t.y[2]); n d[2] = Dist(t.x[1], t.y[1], t.x[2], t.y[3]); n if (!d[0] || !d[1] || !d[2]) return false; n if (d[0] + d[1] == d[2] || d[1] + d[2] == d[0] || d[0] + d[2] == d[1]) n return false; n xx[0] = t.x[0] - t.x[1]; n yy[0] = t.y[0] - t.y[1]; n xx[1] = t.x[0] - t.x[2]; n yy[1] = t.y[0] - t.y[2]; n xx[2] = t.x[1] - t.x[2]; n yy[2] = t.y[1] - t.y[2]; n if (xx[0] * xx[1] + yy[0] * yy[1] == 0 || n xx[0] * xx[2] + yy[0] * yy[2] == 0 || xx[1] * xx[2] + yy[1] * yy[2] == 0) n return true; n else n return false; n } n "} +{"func_code_string": "#include n using namespace std; n void input(long long int n, long long int a[]) { n for (long long int i = 0; i < n; ++i) cin >> a[i]; n } n long long int bin_expo(long long int A, long long int B, long long int M) { n long long int result = 1ll; n while (B > 0) { n if (B % 2 == 1) { n result = (result * A) % M; n } n A = (A * A) % M; n B = B / 2; n } n return result; n } n long long int gcd(long long int a, long long int b) { n if (b == 0) return a; n return gcd(b, a % b); n } n long long int lcm(long long int a, long long int b) { n return (a * b) / gcd(a, b); n } n long long int n, l; n long long int a[101], b[101]; n long long int dp[4001][200][3]; n long long int solve(long long int left, long long int prev, n long long int flag) { n if (left < 0) return 0LL; n if (left == 0) return 1LL; n if (dp[left][prev][flag] != -1) return dp[left][prev][flag]; n long long int res = 0; n if (prev == -1) { n for (long long int i = 0; i < n; ++i) { n res += solve(left - a[i], i, 2); n if (a[i] != b[i]) res += solve(left - b[i], i, 1); n res %= 1000000007; n } n } else { n for (long long int i = 0; i < n; ++i) { n if (i != prev) { n long long int cur; n if (flag == 1) cur = a[prev]; n if (flag == 2) cur = b[prev]; n if (a[i] == cur) n res += solve(left - a[i], i, 2); n else if (b[i] == cur) n res += solve(left - b[i], i, 1); n res %= 1000000007; n } n } n } n return dp[left][prev][flag] = res % 1000000007; n } n int main() { n memset(dp, -1, sizeof(dp)); n cin >> n >> l; n for (long long int i = 0; i < n; ++i) cin >> a[i] >> b[i]; n cout << solve(l, -1, 0) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int sum, t, p, pos, a[100005], b[100005], n, f, c, f1; n cin >> t; n while (t--) { n memset(a, 0, sizeof(a)); n memset(b, 0, sizeof(b)); n cin >> n; n f = 1; n sum = 0; n p = 0; n f1 = 1, c = 0; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) cin >> b[i]; n for (int i = 0; i < n; i++) { n if (f == 1 && a[i] != b[i]) { n if (p == 0) pos = i, p = 1, c = b[i] - a[i]; n sum++; n f = 0; n } else if (a[i] > b[i]) n f1 = 0; n else if (a[i] == b[i]) n f = 1; n } n if (sum >= 2) { n cout << NO << endl; n } else if (f1 == 0 || c < 0) n cout << NO << endl; n else { n if (sum == 0) n cout << YES << endl; n else { n for (int i = pos; a[i] != b[i]; i++) { n if (b[i] - a[i] != c) f1 = 0; n } n if (f1 == 0) n cout << NO << endl; n else n cout << YES << endl; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int left_[105], right_[105], mark[105]; n int main() { n int n, j; n std::ios::sync_with_stdio(0); n while (~scanf( %d , &n)) { n int ans = 0; n memset(left_, 0, sizeof(left_)); n memset(right_, 0, sizeof(right_)); n memset(mark, 0, sizeof(mark)); n for (int i = 1; i <= n; i++) { n scanf( %d %d , &left_[i], &right_[i]); n if (left_[i] == 0) mark[++ans] = i; n } n for (int i = 1; i < ans; i++) { n for (j = mark[i]; right_[j] != 0; j = right_[j]) n ; n left_[mark[i + 1]] = j; n right_[j] = mark[i + 1]; n } n for (int i = 1; i <= n; i++) printf( %d %d n , left_[i], right_[i]); n } n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int f, int s) { n if (s == 0) n return f; n else n return gcd(s, f % s); n } n int const N = 1000006; n long long const M = 1020; n long double const ep = .000000000000000001; n long long arr[N], arr1[N]; n int main() { n int n, m; n scanf( %d , &n); n long long sum = 0, sum1 = 0; n for (int i = 0; i < n; i++) { n scanf( %lld , arr + i); n sum += arr[i]; n } n scanf( %d , &m); n for (int i = 0; i < m; i++) { n scanf( %lld , arr1 + i); n sum1 += arr1[i]; n } n if (sum == sum1) { n printf( 0 n0 ); n return 0; n } n long long best = abs(sum - sum1); n int ind = -1, ind1 = -1; n for (int i = 0; i < n; i++) { n long long temp = sum, temp1 = sum1; n for (int x = 0; x < m; x++) { n temp -= arr[i]; n temp += arr1[x]; n temp1 -= arr1[x]; n temp1 += arr[i]; n if (abs(temp - temp1) < best) { n ind = i + 1, ind1 = x + 1; n best = abs(temp - temp1); n } n temp = sum, temp1 = sum1; n } n } n int indd = -1, indd1 = -1, indd2 = -1, indd21 = -1; n vector > > v, v1; n for (int i = 0; i < n; i++) n for (int x = i + 1; x < n; x++) n v.push_back(make_pair(arr[i] + arr[x], make_pair(i, x))); n for (int i = 0; i < m; i++) n for (int x = i + 1; x < m; x++) n v1.push_back(make_pair(arr1[i] + arr1[x], make_pair(i, x))); n sort(v1.begin(), v1.end()); n long long want = (sum - sum1) / 2; n long long test = 1e17; n long long num = -1; n for (int i = 0; i < v.size(); i++) { n int left = 0, right = v1.size() - 1, mid; n while (left <= right) { n mid = (left + right) / 2; n long long curr = v[i].first - v1[mid].first; n if (test > abs(curr - want)) { n test = abs(curr - want); n num = curr; n indd = v[i].second.first + 1, indd1 = v[i].second.second + 1; n indd2 = v1[mid].second.first + 1, indd21 = v1[mid].second.second + 1; n } n if (curr > want) n left = mid + 1; n else n right = mid - 1; n } n } n long long s = sum, s1 = sum1; n s -= num; n s1 += num; n if (ind == -1 && indd == -1) { n printf( %lld n0 , best); n return 0; n } n if (best > abs(s - s1)) { n printf( %lld n , abs(s - s1)); n printf( 2 n%d %d n%d %d , indd, indd2, indd1, indd21); n } else { n printf( %lld n , best); n printf( 1 n%d %d , ind, ind1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long fact[100005]; n long long power(long long x, long long y, long long p) { n long long res = 1; n x = x % p; n while (y > 0) { n if (y & 1) res = ((res % p) * (x % p)) % p; n y = y >> 1; n x = ((x % p) * (x % p)) % p; n } n return res; n } n long long modInverse(long long n, long long p) { return power(n, p - 2, p); } n long long nCrModFermat(long long n, long long r, long long p) { n if (r == 0 || r == n) return 1; n return (((fact[n] % p) * (modInverse(fact[r], p) % p)) % p * n (modInverse(fact[n - r], p) % p)) % n p; n } n void sieve(vector &isPrime) { n long long n = isPrime.size(); n isPrime[0] = false; n isPrime[1] = false; n for (long long i = 2; i * i <= n; i++) { n if (isPrime[i] == true) { n for (long long j = i * i; j <= n; j += i) isPrime[j] = false; n } n } n } n void addEdge(vector adj[], long long u, long long v) { n adj[u].push_back(v); n adj[v].push_back(u); n } n void BFS(long long s, vector adj[], vector &visited) { n deque q; n q.push_back(s); n visited[s] = true; n cout << s << ; n while (!q.empty()) { n long long p = q.front(); n q.pop_front(); n for (long long i = 0; i < adj[p].size(); i++) { n if (visited[adj[p][i]] == false) { n q.push_back(adj[p][i]); n visited[adj[p][i]] = true; n cout << adj[p][i] << ; n } n } n } n } n void DFSUtil(long long u, vector adj[], vector &visited) { n visited[u] = true; n cout << u << ; n for (long long i = 0; i < adj[u].size(); i++) n if (visited[adj[u][i]] == false) DFSUtil(adj[u][i], adj, visited); n } n void DFS(vector adj[], long long V) { n vector visited(V, false); n for (long long u = 0; u < V; u++) n if (visited[u] == false) DFSUtil(u, adj, visited); n } n void ChubbyCoder() { n long long n; n cin >> n; n cout << n << n ; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n long long t; n t = 1; n cin >> t; n while (t--) { n ChubbyCoder(); n } n } n "} +{"func_code_string": "#include n using namespace std; n bool seat[100][100] = {0}; n int main() { n int n, k; n scanf( %d %d , &n, &k); n while (n--) { n int num, x, l, r, min_sum; n min_sum = 100000; n scanf( %d , &num); n for (int i = 1; i <= k; i++) { n for (int j = 1; j <= k - num + 1; j++) { n int flag, sum; n sum = 0; n flag = 0; n for (int m = j; m <= j + num - 1; m++) { n if (seat[i][m]) { n flag = 1; n break; n } n sum += abs(i - k / 2 - 1) + abs(m - k / 2 - 1); n } n if (flag == 0 && sum < min_sum) { n x = i; n l = j; n r = j + num - 1; n min_sum = sum; n } n } n } n if (min_sum == 100000) n printf( -1 n ); n else { n printf( %d %d %d n , x, l, r); n for (int i = l; i <= r; i++) seat[x][i] = 1; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n if (n % 2 == 0) { n if (n >= 8 && n % 4 == 0) n cout << ((n / 4) - 1) << endl; n else if (n > 4 && n < 8) n cout << 1 << endl; n else if (n <= 4) n cout << 0 << endl; n else n cout << (n / 4) << endl; n } else { n cout << 0 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, shet = 0; n long long int ans = 0; n cin >> n; n ans = n; n int* mas = new int[n]; n for (int i = 0; i < n; i++) { n cin >> mas[i]; n } n for (int i = 1; i < n; i++) { n if (mas[i] == mas[i - 1]) { n shet++; n ans += shet; n } else { n shet = 0; n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int a, int b) { n if (b == 0) return a; n return gcd(b, a % b); n } n int main() { n int a, i, temp; n long long int sum = 0, n, fra; n cin >> a; n for (i = 2; i <= a - 1; i++) { n temp = a; n while (temp > 0) { n sum += temp % i; n temp = temp / i; n } n } n temp = a - 2; n fra = gcd(sum, temp); n while (fra != 1) { n sum = sum / fra; n temp = temp / fra; n fra = gcd(sum, temp); n } n cout << sum << / << temp << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n while (scanf( %d%d , &n, &m) != EOF) { n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (i % 2 == 0) { n printf( # ); n } else { n if (i / 2 % 2 == 0 && j == m - 1) n printf( # ); n else if (i / 2 % 2 != 0 && j == 0) n printf( # ); n else n printf( . ); n } n } n puts( ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-8; n const int M = 1e5 + 5; n const int N = 1e6 + 5; n const int mod = 1e9 + 7; n const double pi = acos(-1.0); n const int INF = 0x3f3f3f3f; n const long long lINF = 0x3f3f3f3f3f3f3f3fLL; n const int sINF = 0xcfcfcfcf; n char s[M * 2], s1[M]; n int mx, tmp, len; n int main() { n scanf( %s , s1); n len = strlen(s1); n mx = tmp = 1; n strcpy(s, s1); n strcat(s + len, s1); n for (int i = 1; i < len * 2; i++) { n if (s[i] == s[i - 1]) { n mx = max(mx, tmp); n tmp = 1; n } else { n tmp++; n mx = max(mx, tmp); n } n } n mx = min(mx, len); n printf( %d n , mx); n } n "} +{"func_code_string": "#include n using namespace std; n n #define ll long long n #define vi vector n #define pii pair n #define mii map n #define pqb priority_queue n #define pqs priority_queue > n n #define ff first n #define ss second n #define pb push_back n #define mp make_pair n #define PI 3.1415926535897932384626 n #define MOD 1000000007 n #define ps(x,y) fixed<>n>>l>>r; n n long long int ans=0; n ans = C(n,n/2)%MOD; n if(n%2) ans = (ans*2)%MOD; n ans = (ans*(min(1-l,r-n)))%MOD; n for(long long int p=min(1-l,r-n)+1;p<=min(r,n+1-l);p++){ n long long int a = p + l - 1; n if(a<=0) a = 0; n long long int b = n + p - r; n if(b<=0) b=0; n n ans = (C(n-a-b,n/2-a) + ans)%MOD; n if(n%2) ans = (C(n-a-b,n/2-b) + ans)%MOD; n } n cout<>t; n n for(int i=1;i<=t;i++){ n // cout<< Case # < n using namespace std; n char str[10000]; n int n, m, Q; n map mem; n map::iterator iter; n struct Func { n string name; n int num; n int v[10]; n bool operator==(const Func& A) const { n if (name != A.name) return false; n if (num != A.num) return false; n for (int i = 0; i < num; ++i) n if (v[i] * A.v[i] != 0 && v[i] != A.v[i]) return false; n return true; n } n } g[2000], pre; n int Type(string x) { n if (x == T ) return 0; n if (x == int ) return 1; n if (x == double ) return 2; n if (x == string ) return 3; n return -1; n } n void inputFunc(int gs) { n gets(str); n int i = 0, j = 0, len = strlen(str); n while (str[j] != d ) ++j; n ++j; n while (j < len) { n if (str[j] != ) str[i++] = str[j]; n j++; n } n len = i; n i = 0; n g[gs].name = ; n while (str[i] != ( ) { n g[gs].name += str[i]; n i++; n } n string temp = ; n i++; n for (;;) { n if (str[i] == , || str[i] == ) ) { n g[gs].v[g[gs].num++] = Type(temp); n temp = ; n if (str[i] == ) ) break; n } else n temp += str[i]; n i++; n } n } n void inputType() { n string a, b; n cin >> a >> b; n mem[b] = Type(a); n } n void solve() { n gets(str); n int i = 0, j = 0, len = strlen(str); n for (j = 0; j < len; ++j) { n if (str[j] != ) str[i++] = str[j]; n } n len = i; n i = 0; n pre.name = ; n pre.num = 0; n while (str[i] != ( ) { n pre.name += str[i]; n i++; n } n string temp = ; n i++; n for (;;) { n if (str[i] == , || str[i] == ) ) { n pre.v[pre.num++] = mem.find(temp)->second; n temp = ; n if (str[i] == ) ) break; n } else n temp += str[i]; n i++; n } n int ans = 0; n for (int i = 0; i < n; ++i) n if (pre == g[i]) ++ans; n printf( %d n , ans); n } n int main() { n scanf( %d , &n); n gets(str); n for (int i = 0; i < n; ++i) inputFunc(i); n scanf( %d , &m); n gets(str); n mem.clear(); n while (m--) inputType(); n scanf( %d , &Q); n gets(str); n while (Q--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1000000007; n int main() { n long long n, a; n long long fuck = 0, fucck = 0; n cin >> n; n priority_queue prio1, prio2; n for (int i = 0; i < n; ++i) { n cin >> a; n prio1.push(a); n fuck += a; n } n for (int i = 0; i < n; ++i) { n cin >> a; n prio2.push(a); n fucck += a; n } n prio1.push(-1); n prio2.push(-1); n long long sum1 = 0, sum2 = 0; n int mark = 1; n for (int i = 0; i < 2 * n; ++i) { n if (mark == 1) { n if (prio1.top() >= prio2.top()) { n fuck -= prio1.top(); n sum1 += prio1.top(); n prio1.pop(); n } else { n fucck -= prio2.top(); n prio2.pop(); n } n mark = 2; n } else { n if (prio2.top() >= prio1.top()) { n fucck -= prio2.top(); n sum2 += prio2.top(); n prio2.pop(); n } else { n fuck -= prio1.top(); n prio1.pop(); n } n mark = 1; n } n } n cout << (sum1 - sum2) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n pair check(string s) { n map used; n int l = s.size(), i, maxVal = 0; n char ans; n for (i = 0; i < l; i++) { n used[s.at(i)]++; n if (used[s.at(i)] > maxVal) { n maxVal = used[s.at(i)]; n ans = s.at(i); n } n } n return make_pair(ans, maxVal); n } n int execute() { n int n, i, diff[4] = {0}, minVal = 10e8 + 7; n cin >> n; n vector > val(4); n string a[3]; n for (i = 0; i < 3; i++) { n cin >> a[i]; n val[i] = check(a[i]); n diff[i] = a[i].size() - val[i].second; n diff[i] = max(0 + (diff[i] + 1 == n && !diff[i]), diff[i] - n); n minVal = min(minVal, diff[i]); n } n int index; n for (i = 0; i < 3; i++) { n if (minVal == diff[i]) { n index = i; n } n } n sort(diff, diff + 3); n if (diff[0] == diff[1]) n cout << Draw << endl; n else { n switch (index) { n case (0): n cout << Kuro << endl; n break; n case (1): n cout << Shiro << endl; n break; n default: n cout << Katie << endl; n } n } n return 0; n } n char mtest = false; n unsigned short TE = 1; n int main() { n ios_base::sync_with_stdio(false); n if (mtest) cin >> TE; n while (TE--) execute(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 1; n long long a[4], mn = 1e12 + 1; n char b, c, d; n int main() { n cin >> a[0] >> a[1] >> a[2] >> a[3]; n cin >> b >> c >> d; n sort(a, a + 4); n do { n long long first, second, temp; n if (b == + ) n first = a[0] + a[1]; n else n first = a[0] * a[1]; n long long a1[3]; n a1[0] = first; n a1[1] = a[2]; n a1[2] = a[3]; n sort(a1, a1 + 3); n do { n if (c == + ) n second = a1[0] + a1[1]; n else n second = a1[0] * a1[1]; n if (d == + ) n temp = second + a1[2]; n else n temp = second * a1[2]; n mn = min(mn, temp); n } while (next_permutation(a1, a1 + 3)); n } while (next_permutation(a, a + 4)); n cout << mn; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[100010]; n typedef struct record { n char ch; n int po; n } rec; n int main() { n int leng, ans, l, r; n rec tmp1, tmp2; n int tmp3; n bool flag; n stack st; n while (~scanf( %s , s)) { n flag = false; n while (!st.empty()) st.pop(); n leng = strlen(s); n for (int i = 0; i < leng; i++) { n if (!st.empty()) tmp2 = st.top(); n if (!st.empty() && ((tmp2.ch == ( && s[i] == ) ) || n (tmp2.ch == [ && s[i] == ] ))) { n st.pop(); n } else { n tmp1.ch = s[i]; n tmp1.po = i; n st.push(tmp1); n } n } n ans = 0; n if (st.empty()) { n for (int i = 0; i < leng; i++) n if (s[i] == [ ) ans++; n printf( %d n%s n , ans, s); n } else { n bool once = true; n flag = false; n ans = -1; n int tmpr, tmpl; n while (st.size() != 0) { n tmp3 = 0; n if (once) { n tmpr = leng - 1; n tmpl = st.top().po + 1; n once = false; n } else { n if (st.size() != 1) { n tmpr = st.top().po - 1; n st.pop(); n tmpl = st.top().po + 1; n } else { n tmpr = st.top().po - 1; n tmpl = 0; n st.pop(); n } n } n if (tmpl < tmpr) { n flag = true; n for (int j = tmpl; j <= tmpr; j++) n if (s[j] == [ ) tmp3++; n } n if (tmp3 > ans) { n ans = tmp3; n l = tmpl; n r = tmpr; n } n } n if (flag) { n printf( %d n , ans); n for (int i = l; i <= r; i++) printf( %c , s[i]); n printf( n ); n } else n printf( 0 n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize(2) n using namespace std; n const int INF = 0x3f3f3f3f; n const long long inf = 0x3f3f3f3f3f3f3f3f; n const int mod = 1e9 + 7; n const int maxn = 1e3 + 5; n int n, m, qq, s[maxn][maxn], f[maxn][maxn]; n bool vis[maxn][maxn]; n int a[4] = {0, 1, 0, -1}; n int b[4] = {-1, 0, 1, 0}; n bool judge(int x, int y) { n for (int i = 0; i <= 3; i++) { n int xx = x + a[i], yy = y + b[i]; n if (xx <= 0 || xx > n || yy <= 0 || yy > m) continue; n if (s[xx][yy] == s[x][y]) return true; n } n return false; n } n void bfs() { n queue > q; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n if (judge(i, j)) { n vis[i][j] = 1; n f[i][j] = 0; n q.push({i, j}); n } n } n } n while (!q.empty()) { n int x = q.front().first; n int y = q.front().second; n q.pop(); n for (int i = 0; i <= 3; i++) { n int xx = x + a[i], yy = y + b[i]; n if (xx <= 0 || xx > n || yy <= 0 || yy > m) continue; n if (vis[xx][yy]) continue; n f[xx][yy] = f[x][y] + 1; n vis[xx][yy] = 1; n q.push({xx, yy}); n } n } n } n int main() { n scanf( %d%d%d , &n, &m, &qq); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n scanf( %1d , &s[i][j]); n } n } n bfs(); n while (qq--) { n int x, y; n long long t; n scanf( %d%d%lld , &x, &y, &t); n if (vis[x][y]) { n if (t < f[x][y]) n printf( %d n , s[x][y]); n else n printf( %d n , s[x][y] ^ ((t - f[x][y]) & 1)); n } else { n printf( %d n , s[x][y]); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n vector adj[100005]; n vector vis(100005, 1); n vector ans; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int T = 1; n for (int qq = 1; qq <= T; qq++) { n cin >> n >> m; n for (int i = 0; i < m; i++) { n int x, y; n cin >> x >> y; n adj[x].push_back(y); n adj[y].push_back(x); n } n priority_queue v; n v.push(-1); n vis[1] = 0; n while (!v.empty()) { n int u = -v.top(); n v.pop(); n ans.push_back(u); n for (auto i : adj[u]) n if (vis[i]) v.push(-i), vis[i] = 0; n } n for (auto i : ans) cout << i << ; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1e18 + 1e17; n const long long mod = 1e9 + 7; n long long modInverse(long long a, long long m) { n long long m0 = m; n long long y = 0, x = 1; n if (m == 1) return 0; n while (a > 1) { n long long q = a / m; n long long t = m; n m = a % m, a = t; n t = y; n y = x - q * y; n x = t; n } n if (x < 0) x += m0; n return x; n } n long long powm(long long a, long long b) { n a = a % mod; n long long res = 1; n while (b) { n if (b & 1) res = (res * a) % mod; n a = (a * a) % mod; n b >>= 1; n } n return (res % mod); n } n const long long N = 5e3 + 6; n int n, k, water; n vector v; n int dp[N][2], dpr[N][2]; n int arr[N]; n bool brr[N]; n int ip = 1e9; n void makedp() { n dp[0][0] = 1; n dp[0][1] = -1; n for (int i = 0; i < n; i++) { n int x = arr[i] % k; n memset(dpr, -1, sizeof(dpr)); n dpr[0][0] = 1; n for (int j = 1; j < k; j++) { n if (dp[j][0] == 0 && dp[(j - x + k) % k][0] == 1) { n dpr[j][0] = 1; n dpr[j][1] = i; n } else { n dpr[j][0] = dp[j][0]; n dpr[j][1] = dp[j][1]; n } n } n swap(dpr, dp); n } n } n bool check() { n int tt = 0; n for (int i = 0; i < n; i++) tt += arr[i]; n if (tt < water || dp[water % k][0] == 0) { n cout << NO n ; n return true; n ; n } n return false; n } n void find() { n int val = water % k; n int x = dp[val][1]; n while (x != -1) { n v.push_back(dp[val][1]); n val = (val - arr[x] % k + k) % k; n x = dp[val][1]; n } n } n void seperate() { n memset(brr, 0, sizeof(brr)); n int tt = 0; n for (int i : v) { n brr[i] = 1; n tt += arr[i]; n } n for (int i = 1; i < v.size(); i++) n cout << ip << << v[i] + 1 << << v[0] + 1 << n ; n int mark = -1; n int tc = 0; n for (int i = 0; i < n; i++) n if (!brr[i]) { n mark = i; n tc += arr[i]; n } n for (int i = 0; i < n; i++) n if (!brr[i] && mark != i) n cout << ip << << i + 1 << << mark + 1 << n ; n if (v.size() == 0) v.push_back(0); n if (tt > water) n cout << (tt - water) / k << << v[0] + 1 << << (0 == v[0] ? 2 : 1) n << n ; n else if (tt < water) n cout << (water - tt) / k << << mark + 1 << << v[0] + 1 << n ; n } n void solve() { n cin >> n >> k >> water; n for (int i = 0; i < n; i++) cin >> arr[i]; n makedp(); n if (check()) return; n cout << YES n ; n find(); n seperate(); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long t = 1; n for (long long i = 1; i <= t; i++) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int freq[27]; n char sent[101]; n int main() { n int n; n scanf( %d , &n); n scanf( %s , sent); n while (n--) { n if (isupper(sent[n])) sent[n] = tolower(sent[n]); n freq[sent[n] - a ]++; n } n for (int i = 0; i < 26; i++) n if (!freq[i]) { n printf( NO n ); n return 0; n } n printf( YES n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n const int INF = 1e9 + 5; n int read(int base = 10) { n int x = 0; n char ch = getchar(); n while (!isdigit(ch)) ch = getchar(); n while (isdigit(ch)) x = x * base + ch - 0 , ch = getchar(); n return x; n } n struct Node { n int num[12][2]; n } tree[N << 2]; n void push_up(int o, int l, int r) { n int tmp[4]; n for (int ii = 1; ii <= 11; ii++) { n tmp[0] = tree[o << 1].num[ii][0]; n tmp[1] = tree[o << 1].num[ii][1]; n tmp[2] = tree[o << 1 | 1].num[ii][0]; n tmp[3] = tree[o << 1 | 1].num[ii][1]; n sort(tmp, tmp + 4); n tree[o].num[ii][0] = tmp[0]; n tree[o].num[ii][1] = tmp[1]; n } n } n void build(int o, int l, int r) { n if (l == r) { n int x = read(); n int tmp = x; n for (int ii = 1; ii <= 11; tmp /= 10, ii++) { n if (tmp % 10 == 0) { n tree[o].num[ii][0] = tree[o].num[ii][1] = INF; n continue; n } n tree[o].num[ii][0] = x; n tree[o].num[ii][1] = INF; n } n return; n } n int mid = (l + r) >> 1; n build(o << 1, l, mid); n build(o << 1 | 1, mid + 1, r); n push_up(o, l, r); n } n int id, x; n void update(int o, int l, int r) { n if (l == r) { n int tmp = x; n for (int ii = 1; ii <= 11; ii++, tmp /= 10) { n if (tmp % 10) { n tree[o].num[ii][0] = x; n tree[o].num[ii][1] = INF; n } else { n tree[o].num[ii][0] = tree[o].num[ii][1] = INF; n } n } n return; n } n int mid = (l + r) >> 1; n if (id <= mid) n update(o << 1, l, mid); n else n update(o << 1 | 1, mid + 1, r); n push_up(o, l, r); n } n int L, R, ans[12][2]; n int tmp[4]; n void query_up(int o, int i) { n tmp[0] = ans[i][0]; n tmp[1] = ans[i][1]; n tmp[2] = tree[o].num[i][0]; n tmp[3] = tree[o].num[i][1]; n sort(tmp, tmp + 4); n ans[i][0] = tmp[0]; n ans[i][1] = tmp[1]; n } n void query(int o, int l, int r) { n if (L <= l && r <= R) { n for (int ii = 1; ii <= 11; ii++) { n query_up(o, ii); n } n return; n } n int mid = (l + r) >> 1; n if (L <= mid) query(o << 1, l, mid); n if (R > mid) query(o << 1 | 1, mid + 1, r); n } n int main() { n int n = read(), m = read(); n build(1, 1, n); n while (m--) { n int op = read(); n if (op == 1) { n id = read(), x = read(); n update(1, 1, n); n } else { n L = read(), R = read(); n for (int i = 1; i <= 11; i++) ans[i][0] = ans[i][1] = INF; n query(1, 1, n); n int all = INF * 2; n ; n for (int i = 1; i <= 11; i++) { n if (ans[i][0] == INF || ans[i][1] == INF) continue; n all = min(all, ans[i][0] + ans[i][1]); n } n if (all == INF * 2) { n cout << -1 n ; n } else { n cout << all << n ; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n template n void __f(const char* name, Arg1&& arg1) { n cerr << name << : << arg1 << endl; n } n template n void __f(const char* names, Arg1&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n cerr.write(names, comma - names) << : << arg1 << | ; n __f(comma + 1, args...); n } n const int INF = 1 << 30; n const int MOD = 1e9 + 7; n const int N = 1e6; n int a[N]; n double sqr(double x) { return x * x; } n int main() { n int cas; n scanf( %d , &cas); n double ret = 0; n for (int num = 0; num < cas; ++num) { n int n = 250; n double ave = 0; n for (int i = 0; i < n; ++i) { n scanf( %d , &a[i]); n ave += a[i]; n } n ave /= n; n double V = 0; n for (int i = 0; i < n; ++i) { n V += sqr(ave - a[i]); n } n V /= n; n double ratio = ave / V; n ret = max(ret, abs(ratio - 1)); n puts(abs(ratio - 1) < 0.5 ? poisson : uniform ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n string s; n cin >> s; n int ans = 0; n for (int i = 1; i < n; i++) n if (s[i - 1] == . && s[i] == . ) ans++; n while (m--) { n int k; n char c; n cin >> k >> c; n if (c != s[k - 1]) { n if (c == . ) { n if (k > 1 && s[k - 2] == . ) ans++; n if (k < n && s[k] == . ) ans++; n } n if (s[k - 1] == . ) { n if (k > 1 && s[k - 2] == . ) ans--; n if (k < n && s[k] == . ) ans--; n } n s[k - 1] = c; n } n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int me; n int bebia; n int iliko = 0; n int ilarioni = 0; n cin >> me; n for (int i = 0; i < me; i++) { n cin >> bebia; n if (bebia > 0) iliko += bebia; n if (bebia == -1) { n if (iliko - 1 < 0) { n ilarioni++; n } else n iliko--; n } n } n cout << ilarioni; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int i, j, t; n int n; n int a[105]; n cin >> n; n for (i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n int b[105] = {0}; n int cnt = 1; n for (i = 0; i < n; i++) { n for (j = 0; j <= cnt; j++) { n if (!b[j]) { n b[j]++; n break; n } else if (b[j] <= a[i]) { n b[j]++; n break; n } n } n if (j == cnt) cnt++; n } n cout << cnt << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int rx[4] = {0, 0, 1, -1}; n int ry[4] = {-1, 1, 0, 0}; n int main() { n int n, k, a, b, u, v; n cin >> n >> k; n cin >> a >> b >> u >> v; n if (k < n + 1 || n == 4) { n cout << -1 << endl; n return 0; n } n int ind1, ind2; n vector p(n + 1); n p[1] = a; n int ct = 2, i = 1; n while (ct <= n - 1) { n if (i == a || i == b) { n i++; n continue; n } n p[ct] = i; n ct++; n i++; n } n p[n] = b; n for (int i = 1; i < n - 2; i++) { n if ((p[i] == u && p[i + 1] == v) || (p[i] == v && p[i + 1] == u)) { n swap(p[i + 1], p[i + 2]); n } n } n if ((p[n - 2] == u && p[n - 1] == v) || (p[n - 2] == v && p[n - 1] == u)) { n swap(p[n - 3], p[n - 2]); n } n for (int i = 1; i <= n; i++) { n if (p[i] == u) { n ind1 = i; n } n if (p[i] == v) { n ind2 = i; n } n } n for (int i = 1; i <= n; i++) { n cout << p[i] << ; n } n cout << endl; n if (u < v) { n int s = ind1; n while (s >= 1) { n cout << p[s] << ; n s--; n } n s = ind1 + 1; n while (s < ind2) { n cout << p[s] << ; n s++; n } n s = n; n while (s >= ind2) { n cout << p[s] << ; n s--; n } n } else { n int s = ind1; n while (s <= n) { n cout << p[s] << ; n s++; n } n s = ind1 - 1; n while (s > ind2) { n cout << p[s] << ; n s--; n } n s = 1; n while (s <= ind2) { n cout << p[s] << ; n s++; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n int i; n cin >> s; n for (i = 0; i < s.size(); i++) { n if (s[i] == r ) cout << i + 1 << n ; n } n for (i = s.size() - 1; i >= 0; i--) { n if (s[i] == l ) cout << i + 1 << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long a, b, c, d; n cin >> a >> b >> c >> d; n long long sum = a + b + c + d; n if (sum % 2 == 0) { n if (a + b == sum / 2 || a + c == sum / 2 || a + d == sum / 2 || n b + c == sum / 2 || b + d == sum / 2 || c + d == sum / 2 || n a == sum / 2 || b == sum / 2 || c == sum / 2 || d == sum / 2) n cout << YES << endl; n else n cout << NO << endl; n } else n cout << NO << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int i, j, r, n, x; n cin >> x; n r = x % 4; n if (r == 0) { n cout << 1 n << A ; n } n if (r == 1) { n cout << 0 n << A ; n } n if (r == 2) { n cout << 1 n << B ; n } n if (r == 3) { n cout << 2 n << A ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline bool SR(int &x) { return scanf( %d , &x) == 1; } n inline bool SR(long long &x) { return scanf( %lld , &x) == 1; } n inline bool SR(double &x) { return scanf( %lf , &x); } n inline bool SR(char *s) { return scanf( %s , s); } n inline bool RI() { return 1; } n template n bool RI(I &x, T &...tail) { n return SR(x) && RI(tail...); n } n inline void SP(const int x) { printf( %d , x); } n inline void SP(const long long x) { printf( %lld , x); } n inline void SP(const double x) { printf( %.10f , x); } n inline void SP(const char *s) { printf( %s , s); } n inline void PL() { puts( ); } n template n void PL(const I x, const T... tail) { n SP(x); n if (sizeof...(tail)) putchar( ); n PL(tail...); n } n template n inline void _DOING(const char *s, I &&x) { n cerr << s << = << x << n ; n } n template n void _DOING(const char *s, I &&x, T &&...tail) { n int c = 0; n while (*s != , || c != 0) { n if (*s == ( || *s == [ || *s == { ) c++; n if (*s == ) || *s == ] || *s == } ) c--; n cerr << *s++; n } n cerr << = << x << , ; n _DOING(s + 1, tail...); n } n const int INF = 0x3f3f3f3f; n const long long INF64 = 0x3f3f3f3f3f3f3f3fll; n inline int RAND() { n static int x = 880301; n return x = (x * 0xdefacedll + 1ll) % 0x7fffffffll; n } n int n; n map, int> rd; n inline bool check(long long a, int b) { n long long x = 1; n while (b) { n if (a >= n) return 0; n if (b & 1) x = x * a; n if (x >= n) return 0; n a = a * a; n b >>= 1; n } n return 1; n } n int dfs(int a, int b) { n if (rd.count(make_pair(a, b))) return rd[make_pair(a, b)]; n if (!check(a, b)) return rd[make_pair(a, b)] = 1; n if (a == 1) { n if (!check(a + 1, b)) n return rd[make_pair(a, b)] = 0; n else if (dfs(a + 1, b) == -1 || dfs(a, b + 1) == -1) n return rd[make_pair(a, b)] = 1; n else if (dfs(a + 1, b) == 0 || dfs(a, b + 1) == 0) n return rd[make_pair(a, b)] = 0; n else n return rd[make_pair(a, b)] = -1; n } else if (b == 1) { n if (1ll * a * a >= n) { n if ((n - a) & 1) n return rd[make_pair(a, b)] = -1; n else n return rd[make_pair(a, b)] = 1; n } else if (dfs(a + 1, b) == -1 || dfs(a, b + 1) == -1) n return rd[make_pair(a, b)] = 1; n else if (dfs(a + 1, b) == 0 || dfs(a, b + 1) == 0) n return rd[make_pair(a, b)] = 0; n else n return rd[make_pair(a, b)] = -1; n } else { n if (dfs(a + 1, b) == -1 || dfs(a, b + 1) == -1) n return rd[make_pair(a, b)] = 1; n else n return rd[make_pair(a, b)] = -1; n } n } n int main() { n int a, b; n RI(a, b, n); n int res = dfs(a, b); n if (res == 1) n PL( Masha ); n else if (res == -1) n PL( Stas ); n else n PL( Missing ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 50000 + 10; n int n; n int B[maxN]; n vector> VB; n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %d , &B[i]); n for (int i = 0; i < n; i++) { n VB.push_back(make_pair(B[i] + B[(i + 1) % n], i)); n } n sort(VB.begin(), VB.end()); n for (int i = 0; i < n; i++) { n auto p = VB[i]; n B[p.second] = i; n } n for (int i = 0; i < n; i++) printf( %d%c , B[i], (i == n - 1) ? n : ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int arr[5001], k = 0; n string s, in; n stack s1; n while (getline(cin, s)) { n in = in + s; n } n for (int i = 0; i < in.size(); i++) { n char st[5001] = { 0 }; n if (in[i] == < ) { n i++; n int j = 0; n while (in[i] != > ) { n st[j++] = in[i]; n i++; n } n } n string st1 = table , st2 = tr , st3 = td , st4 = /table , st5 = /tr , n st6 = /td ; n if (st1.compare(st) == 0) arr[k++] = 1; n if (st2.compare(st) == 0) arr[k++] = 2; n if (st3.compare(st) == 0) arr[k++] = 3; n if (st4.compare(st) == 0) arr[k++] = 4; n if (st5.compare(st) == 0) arr[k++] = 5; n if (st6.compare(st) == 0) arr[k++] = 6; n } n int z = -1, max = z; n vector v, v1; n for (int i = 0; i < k; i++) { n if (arr[i] == 1) { n s1.push(arr[i]); n v.push_back(0); n } n if (arr[i] == 2) s1.push(arr[i]); n if (arr[i] == 3) s1.push(arr[i]); n if (arr[i] == 4) { n s1.pop(); n v1.push_back(v.back()); n v.pop_back(); n } n if (arr[i] == 5) s1.pop(); n if (arr[i] == 6) { n s1.pop(); n v.back()++; n } n } n sort(v1.begin(), v1.end()); n for (int i = 0; i < v1.size(); i++) cout << v1[i] << ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n int main() { n int a, b, c; n int a1, b1, c1; n int s = 0; n scanf( %d%d%d%d%d%d , &a, &b, &c, &a1, &b1, &c1); n if (a > a1) { n s = s + ((a - a1) / 2); n } else n s = s - (a1 - a); n if (b > b1) { n s = s + ((b - b1) / 2); n } else n s = s - (b1 - b); n if (c > c1) { n s = s + ((c - c1) / 2); n } else n s = s - (c1 - c); n if (s >= 0) { n printf( YES ); n } else n printf( NO ); n } n "} +{"func_code_string": "#include n using namespace std; n int main(int argc, char *argv[]) { n int n, tmp = 1, res = 1; n cin >> n; n int A[n][2]; n for (int i = 0; i < n; i++) cin >> A[i][0] >> A[i][1]; n for (int i = 0; i < n - 1; i++) { n if ((A[i][0] == A[i + 1][0]) && (A[i][1] == A[i + 1][1])) { n tmp++; n if (res < tmp) res = tmp; n } else n tmp = 1; n } n cout << res << endl; n return EXIT_SUCCESS; n } n "} +{"func_code_string": "#include n using namespace std; n unsigned long long int expo_fast(long long int a, long long int b) { n a = a; n long long int result = 1; n while (b) { n if (b & 1) result = (result * a); n b >>= 1; n a = (a * a); n } n return (result); n } n void take_in(vector *arr) { n for (int i = 0; i < arr->size(); i++) cin >> (*(arr))[i]; n } n long long int gcd(long long int a, long long int b) { n if (b == 0) return a; n return gcd(b, a % b); n } n unsigned long long int power(long long int x, unsigned long long int y, n long long int p) { n long long int res = 1; n x = x % p; n while (y > 0) { n if (y & 1) res = (res * x) % p; n y = y >> 1; n x = (x * x) % p; n } n return res; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long int n, x1, x2, done = 0; n cin >> n >> x1 >> x2; n vector > arr; n vector dp(n + 1); n for (int i = 0; i < n; i++) { n long long int x; n cin >> x; n arr.push_back({x, i}); n } n sort(arr.begin(), arr.end()); n dp[n] = arr[n - 1].first; n for (int i = n - 1; i > 0; i--) { n dp[i] = max(dp[i + 1], arr[i - 1].first * (n - i + 1)); n } n auto bs = [n](long long int x, long long int tar) -> long long int { n int low = 1, high = n, ans = n + 1; n while (low <= high) { n int mid = (low + high) / 2; n if (x * mid >= tar) { n ans = mid; n high = mid - 1; n } else n low = mid + 1; n } n return ans; n }; n for (int i = 1; i <= n; i++) { n vector indx; n long long int len = bs(arr[i - 1].first, x1); n if (i + len - 1 < n && dp[i + len] >= x2) { n done = 1; n cout << Yes n ; n for (int j = n; j >= 1; j--) { n if (dp[j] >= x2) { n indx.push_back(j); n indx.push_back(n); n break; n } n } n cout << len << << indx[1] - indx[0] + 1 << n ; n for (int k = i; k < i + len; k++) cout << arr[k - 1].second + 1 << ; n cout << n ; n for (int k = indx[0]; k <= n; k++) cout << arr[k - 1].second + 1 << ; n break; n } n if (!done) { n len = bs(arr[i - 1].first, x2); n if (i + len - 1 < n && dp[i + len] >= x1) { n done = 1; n cout << Yes n ; n for (int j = n; j >= 1; j--) { n if (dp[j] >= x1) { n indx.push_back(j); n indx.push_back(n); n break; n } n } n cout << indx[1] - indx[0] + 1 << << len << n ; n for (int k = indx[0]; k <= n; k++) cout << arr[k - 1].second + 1 << ; n cout << n ; n for (int k = i; k < i + len; k++) cout << arr[k - 1].second + 1 << ; n break; n } n } n } n if (!done) cout << No ; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, k, l[100100], c[100100]; n vector g[100100]; n vector s; n void dfs(int t) { n s.push_back(t); n l[t] = s.size(); n for (auto v : g[t]) { n if (!l[v]) n dfs(v); n else { n if (l[t] - l[v] + 1 >= k) { n printf( 2 n%d n , l[t] - l[v] + 1); n for (int i = l[v] - 1; i < l[t]; i++) printf( %d , s[i]); n exit(0); n } n } n } n if (!c[t]) n for (auto v : g[t]) c[v] = 1; n s.pop_back(); n } n int main() { n int i, a, b; n scanf( %d %d , &n, &m); n for (i = 0; i < m; i++) { n scanf( %d %d , &a, &b); n g[a].push_back(b); n g[b].push_back(a); n } n while (k * k < n) k++; n dfs(1); n printf( 1 n ); n for (i = 1; k; i++) { n if (!c[i]) { n printf( %d , i); n k--; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n vector v[200008]; n int val[200008]; n int n, tk; n int dp[200008]; n int lim; n int siz[200008]; n int cnt, tot; n int no[200008]; n void dfs(int x, int p) { n no[x] = val[x] < lim; n dp[x] = 0; n int b1 = 0, b2 = 0, b3 = 0; n siz[x] = 1; n for (int i = 0; i < v[x].size(); i++) { n int y = v[x][i]; n if (y == p) continue; n dfs(y, x); n siz[x] += siz[y], no[x] += no[y]; n if (no[y] == 0) n b3 += siz[y]; n else { n if (dp[y] > b1) n b2 = b1, b1 = dp[y]; n else n b2 = max(b2, dp[y]); n } n } n if (val[x] < lim) return; n dp[x] = b1 + b3 + 1; n if (tot == no[x]) n cnt = max(cnt, 1 + n - siz[x] + b1 + b2 + b3); n else n cnt = max(cnt, 1 + b1 + b2 + b3); n } n int check(int mid) { n lim = mid; n cnt = 0; n tot = 0; n for (int i = 1; i <= n; i++) n if (val[i] < lim) tot++; n dfs(1, 0); n return cnt >= tk; n } n int main() { n scanf( %d%d , &n, &tk); n for (int i = 1; i <= n; i++) scanf( %d , &val[i]); n for (int i = 1; i < n; i++) { n int x, y; n scanf( %d%d , &x, &y); n v[x].push_back(y); n v[y].push_back(x); n } n int l = 0, r = 1000000; n int ans = -1; n while (l <= r) { n int mid = (l + r) / 2; n if (check(mid)) n ans = mid, l = mid + 1; n else n r = mid - 1; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int mini(long long int p, long long int q) { n if (p < q) return p; n return q; n } n int main() { n long long int k2, k3, k5, k6, total = 0; n cin >> k2 >> k3 >> k5 >> k6; n int m = 0; n m = mini(k2, k5); n m = mini(m, k6); n total = m * 256; n m = mini(k2 - m, k3); n total += m * 32; n cout << total << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = 2.0 * acos(0.0); n inline int getInt() { n int x; n scanf( %d , &x); n return x; n } n inline long long getLL() { n long long x; n scanf( %lld , &x); n return x; n }; n inline int NUM(char c) { return (int)c - 48; } n inline char CHR(int n) { return (char)(n + 48); } n template n inline T MAX(T a, T b) { n if (a > b) return a; n return b; n } n template n inline T MIN(T a, T b) { n if (a < b) return a; n return b; n } n inline void OPEN(const string &s) { n freopen((s + .in ).c_str(), r , stdin); n freopen((s + .out ).c_str(), w , stdout); n } n map score, sco, mis; n map times; n int main() { n vector v; n for (int k = 0, _n = (5); k < _n; k++) { n string A, B, C; n cin >> A >> B; n cin >> C; n for (int i = 0, _n = ((C).size()); i < _n; i++) n if (C[i] == : ) C[i] = ; n stringstream ss(C); n int s, m; n ss >> s >> m; n if (s > m) n score[A] += 3; n else if (s < m) n score[B] += 3; n else { n score[A]++; n score[B]++; n } n sco[A] += s; n mis[A] += m; n sco[B] += m; n mis[B] += s; n v.push_back(A); n v.push_back(B); n times[A]++; n times[B]++; n } n sort((v).begin(), (v).end()); n v.resize(unique((v).begin(), (v).end()) - v.begin()); n string OTHER; n for (int i = 0, _n = ((v).size()); i < _n; i++) { n if (times[v[i]] == 2 && v[i] != BERLAND ) OTHER = v[i]; n } n vector > > > sorted; n for (int d = (1), _b = (50); d <= _b; d++) { n for (int m = (0), _b = (50); m <= _b; m++) { n int s = m + d; n string A, B; n A = BERLAND , B = OTHER; n score[A] += 3; n sco[A] += s; n sco[B] += m; n mis[B] += s; n mis[A] += m; n sorted.clear(); n for (int i = 0, _n = ((v).size()); i < _n; i++) { n sorted.push_back(make_pair( n -score[v[i]], n make_pair(-sco[v[i]] + mis[v[i]], make_pair(-sco[v[i]], v[i])))); n } n sort((sorted).begin(), (sorted).end()); n if (sorted[0].second.second.second == BERLAND || n sorted[1].second.second.second == BERLAND ) { n cout << s << : << m << endl; n return 0; n } n score[A] -= 3; n sco[A] -= s; n sco[B] -= m; n mis[B] -= s; n mis[A] -= m; n } n } n cout << IMPOSSIBLE << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 1 << 20, KOR = 32000; n const long long INF = 1e18; n int n; n int p[MAX]; n int sito[KOR]; n int bezp[MAX], sp[MAX]; n int cijseg, cijprom; n vector Pr; n void Eratosten() { n for (int i = 2; i < KOR; i++) { n if (!sito[i]) { n Pr.push_back(i); n for (int j = 2 * i; j < KOR; j += i) sito[j] = i; n } n } n } n vector Fak(int x) { n vector R; n for (int i = 0; i < (int)Pr.size(); i++) { n if (!(x % Pr[i])) R.push_back(Pr[i]); n for (; !(x % Pr[i]); x /= Pr[i]) n ; n } n if (x > 1) R.push_back(x); n return R; n } n long long Rijesi(int x) { n memset(bezp, 0, sizeof bezp); n memset(sp, 0, sizeof sp); n int prvi = n, zadnji = 0; n int ukprom = 0; n for (int i = 0; i < n; i++) { n if (!(p[i] % x)) bezp[i] = 1; n if (!((p[i] + 1) % x) || !((p[i] - 1) % x)) sp[i] = 1; n if (!bezp[i] && !sp[i]) { n prvi = min(prvi, i); n zadnji = max(zadnji, i); n } n if (!bezp[i] && sp[i]) ukprom++; n } n if (!ukprom && prvi == n) return 0; n long long ret = INF; n if (prvi == n) ret = (long long)cijprom * ukprom; n long long maxx = -cijseg; n int tprom = 0; n for (int i = 0; i < n; i++) { n if (!bezp[i] && sp[i]) tprom++; n if (i >= zadnji) n ret = min(ret, (long long)i * cijseg - maxx + n ((long long)ukprom - tprom) * cijprom); n if (i < prvi) n maxx = max(maxx, (long long)-tprom * cijprom + (long long)i * cijseg); n } n return ret; n } n int main() { n Eratosten(); n scanf( %d%d%d , &n, &cijseg, &cijprom); n for (int i = 0; i < n; i++) scanf( %d , &p[i]); n long long rje = INF; n vector Bitni; n for (int i = -1; i <= 1; i++) { n vector T = Fak(p[0] + i); n for (int j = 0; j < (int)T.size(); j++) Bitni.push_back(T[j]); n } n for (int i = -1; i <= 1; i++) { n vector T = Fak(p[n - 1] + i); n for (int j = 0; j < (int)T.size(); j++) Bitni.push_back(T[j]); n } n sort(Bitni.begin(), Bitni.end()); n Bitni.resize(unique(Bitni.begin(), Bitni.end()) - Bitni.begin()); n for (int i = 0; i < (int)Bitni.size(); i++) rje = min(rje, Rijesi(Bitni[i])); n printf( %lld n , rje); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1000006, MOD = 1e9 + 7, INF = 1e16; n long long a[N], b, n, m, k, g[105][105], q, x, ans, Ans, pre[N], l, r; n string s; n pair p[N]; n int main() { n ios_base::sync_with_stdio(false), cin.tie(0); n cin >> n >> m; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) cin >> g[i][j]; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n if (g[i][j] < 1) x = 1; n while (!x) { n Ans++; n q += min(n, m); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) { n g[i][j]--; n if (g[i][j] < 1) x = 1; n } n } n ans = 0; n x = 0; n for (int i = 1; i <= n; i++) n if (!g[i][1]) x = 1; n while (!x) { n ans++, r++; n for (int i = 1; i <= n; i++) { n g[i][1]--; n if (!g[i][1]) x = 1; n } n } n x = 0; n for (int i = 1; i <= m; i++) n if (!g[1][i]) x = 1; n while (!x) { n ans++, l++; n for (int i = 1; i <= m; i++) { n g[1][i]--; n if (!g[1][i]) x = 1; n } n } n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n if (g[i][j] != g[1][j] + g[i][1]) { n cout << -1; n return 0; n } n for (int i = 1; i <= n; i++) ans += g[i][1]; n for (int i = 2; i <= m; i++) ans += g[1][i]; n cout << ans + q << endl; n for (int i = 1; i <= l; i++) n cout << row n << << 1 << endl; n for (int i = 1; i <= r; i++) n cout << col n << << 1 << endl; n for (int i = 1; i <= n; i++) n for (int u = 1; u <= g[i][1]; u++) n cout << row n << << i << endl; n for (int i = 1; i <= m; i++) n for (int u = 1; u <= g[1][i]; u++) n cout << col n << << i << endl; n if (n < m) n s = row ; n else n s = col ; n for (int i = 0; i < min(n, m) * Ans; i++) n cout << s << << i % min(n, m) + 1 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, a[100010]; n long long t; n int main() { n cin >> n >> m; n a[0] = 1; n for (int i = 1; i <= m; i++) { n cin >> a[i]; n if (a[i] > a[i - 1]) t += (a[i] - a[i - 1]); n if (a[i] < a[i - 1]) t += (n - a[i - 1] + a[i]); n } n cout << t; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n int n, k; n cin >> n >> k; n int i = 1; n for (i = k - 1; i > 0; i--) { n if ((n % i) == 0) break; n } n if (i == 0) i = 1; n int x = (n / i) * k; n for (; x % k != i; x++) { n } n cout << x; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const ll INF = 4e18; n const int MAXN = 1.1e5; n ll T[MAXN]; n int main() { n ios::sync_with_stdio(0), cin.tie(0); n ll N, M, A, D; n cin >> N >> M >> A >> D; n for (ll i = 0; i < M; i++) { n cin >> T[i]; n } n sort(T, T + M); n T[M] = INF; n auto getEmployee = [&](ll i) -> ll { return i <= N ? i * A : INF; }; n ll est = 1; n ll cst = 0; n ll ans = 0; n while (est <= N || cst < M) { n ll nxt = D + min(getEmployee(est), T[cst]); n ll een = min(N + 1, (nxt / A) + 1); n ll cen = ll(upper_bound(T, T + M, nxt) - T); n ans++; n if (cst == cen) { n ll delta = een - est; n assert(delta > 0); n ll tgt = min(N + 1, T[cst] / A); n ll extra = max(tgt - een, ll(0)) / delta; n ans += extra; n een += extra * delta; n } n assert(een > est || cen > cst); n assert(est <= een && cst <= cen); n tie(est, cst) = {een, cen}; n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n #include n using namespace std; n int a[10005],s[10005]; n signed main() { n int T; n cin >> T; n while(T--) n { n int n; n cin >> n; n memset(s,0,sizeof s); n for(int i=1;i<=n;i++) cin >> a[i]; n long long ans=0; n for(int i=1;i<=n;i++) n { n ans+=max(0,a[i]-s[i]-1); n s[i]=max(s[i],a[i]-1); n for(int j=i+2;j<=min(n,i+a[i]);j++) n ++s[j]; n s[i+1]+=max(0,s[i]-a[i]+1); n } n cout << ans << n ; n } n return 0; n }"} +{"func_code_string": "#include n using namespace std; n int l[51], r[51], a[51], c[51], dp[51][51][51]; n void inline FilterRestrictions(int i, int j, int h, vector &v) { n vector u; n for (int x : v) { n if (r[x] < i || j < l[x] || a[x] >= h) { n continue; n } n u.push_back(x); n } n v = u; n u.clear(); n sort(v.begin(), v.end(), [](int i, int j) { return l[i] > l[j]; }); n } n int Solve(int i, int j, int h, vector v) { n if (j < i) { n return 0; n } n if (dp[i][j][h] != -1) { n return dp[i][j][h]; n } n FilterRestrictions(i, j, h, v); n int ans = Solve(i, j, h - 1, v), cost = h * h; n vector > V(51 + 1); n vector v1; n for (int x = i; x <= j; ++x) { n for (; !v.empty() && l[v.back()] == x; v.pop_back()) { n int k = v.back(); n cost -= c[k]; n V[r[k] + 1].push_back(k); n } n for (auto k : V[x]) { n cost += c[k]; n v1.push_back(k); n } n int ansx = cost + Solve(i, x - 1, h, v1) + Solve(x + 1, j, h, v); n ans = max(ans, ansx); n } n dp[i][j][h] = ans; n return ans; n } n int main() { n int n, h, m; n cin >> n >> h >> m; n for (int i = 1; i <= m; ++i) { n cin >> l[i] >> r[i] >> a[i] >> c[i]; n } n vector v; n for (int i = 1; i <= m; ++i) { n v.push_back(i); n } n for (int i = 1; i <= n; ++i) { n for (int j = i; j <= n; ++j) { n for (int x = 1; x <= h; ++x) { n dp[i][j][x] = -1; n } n } n } n cout << Solve(1, n, h, v) << n ; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( unroll-loops ) n #pragma GCC target( n sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) n using namespace std; n template n void ckmin(T1 &a, T2 b) { n if (a > b) a = b; n } n template n void ckmax(T1 &a, T2 b) { n if (a < b) a = b; n } n int read() { n int x = 0, f = 0; n char ch = getchar(); n while (!isdigit(ch)) f |= ch == - , ch = getchar(); n while (isdigit(ch)) x = 10 * x + ch - 0 , ch = getchar(); n return f ? -x : x; n } n template n void print(T x) { n if (x < 0) putchar( - ), x = -x; n if (x >= 10) print(x / 10); n putchar(x % 10 + 0 ); n } n template n void print(T x, char let) { n print(x), putchar(let); n } n const int mlen = 1 << 20; n const int N = mlen + 5; n const int mod = 998244353; n unsigned long long omgs[N]; n int rev[N]; n int qpow(int a, int b = mod - 2) { n int res = 1; n while (b) { n if (b & 1) res = 1ll * res * a % mod; n a = 1ll * a * a % mod; n b >>= 1; n } n return res; n } n const int G = qpow(3, (mod - 1) / mlen); n void setup() { n omgs[mlen / 2] = 1; n for (int i = mlen / 2 + 1; i < mlen; i++) omgs[i] = G * omgs[i - 1] % mod; n for (int i = mlen / 2 - 1; i > 0; i--) omgs[i] = omgs[i << 1]; n } n int getR(int len) { n int lim = 1, L = 0; n while (lim <= len) lim <<= 1, L++; n for (int i = 0; i < lim; i++) n rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << L - 1); n return lim; n } n inline void dft(vector &a, int lim) { n a.resize(lim); n static unsigned long long A[N]; n for (int i = 0; i < lim; i++) A[rev[i]] = a[i]; n for (int mid = 1; mid < lim; mid <<= 1) { n for (int i = 0; i < lim; i += mid << 1) { n unsigned long long *W = omgs + mid; n for (int j = 0; j < mid; j++) { n unsigned long long tmp = *(W++) * A[i + j + mid] % mod; n A[i + j + mid] = A[i + j] + mod - tmp; n A[i + j] += tmp; n } n } n } n for (int i = 0; i < lim; i++) a[i] = A[i] % mod; n } n inline void idft(vector &a, int lim) { n a.resize(lim); n dft(a, lim), reverse(a.begin() + 1, a.end()); n int linv = mod - (mod - 1) / lim; n for (int i = 0; i < lim; i++) a[i] = 1ll * a[i] * linv % mod; n } n vector operator*(vector a, vector b) { n int len = (int(a.size())) + (int(b.size())) - 1, lim = getR(len); n dft(a, lim), dft(b, lim); n for (int i = 0; i < lim; i++) a[i] = 1ll * a[i] * b[i] % mod; n idft(a, lim), a.resize(len); n return a; n } n vector adj[N]; n int n; n int son[N]; n void dfs1(int u, int fa) { n for (auto v : adj[u]) { n if (v == fa) continue; n son[u]++; n dfs1(v, u); n } n } n int fac[N], ifac[N]; n inline int C(int n, int m) { n return 1ll * fac[n] * ifac[n - m] % mod * ifac[m] % mod; n } n int main() { n setup(); n n = read(); n fac[0] = 1; n for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % mod; n ifac[n] = qpow(fac[n]); n for (int i = n; i >= 1; i--) ifac[i - 1] = 1ll * ifac[i] * i % mod; n for (int i = 1; i <= n - 1; i++) { n int u = read(), v = read(); n adj[u].push_back(v), adj[v].push_back(u); n } n dfs1(1, 0); n vector f = {1}; n sort(son + 1, son + n + 1, greater()); n for (int i = 1; i <= n; i++) { n int j = i; n while (j < n && son[i] == son[j + 1]) j++; n int up = j - i + 1; n vector g(up + 1); n int cf = 1; n for (int i = 0; i <= up; i++) { n int coef = 1ll * C(up, i) * cf % mod; n g[i] = coef; n cf = 1ll * cf * (mod - son[j]) % mod; n } n f = f * g; n i = j; n } n int ans = 0; n for (int i = 0; i <= n - 1; i++) ans = (ans + 1ll * fac[n - i] * f[i]) % mod; n print(ans, n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct MinMax { n int min, max; n MinMax() : min(INT_MAX), max(INT_MIN){}; n MinMax(int min, int max) : min(min), max(max){}; n }; n int main(int argc, char const *argv[]) { n ios_base::sync_with_stdio(false); n int n, m; n cin >> n >> m; n MinMax a[n]; n for (int i = 0; i < m; i++) { n int c; n cin >> c; n a[c - 1].min = min(a[c - 1].min, i); n a[c - 1].max = max(a[c - 1].max, i); n } n int sum = 0; n for (int i = 0; i < n; i++) { n int cnt = 3; n if (i == 0 || i == n - 1) cnt--; n if (a[i].min < INT_MAX) cnt--; n if (i < n - 1) { n if (a[i].min < a[i + 1].max) cnt--; n } n if (i > 0) { n if (a[i - 1].max > a[i].min) cnt--; n } n sum += cnt; n } n if (n == 1) sum = 0; n cout << sum << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int t, n, i, j, k, h = 0; n cin >> n; n long long int a[n], b[n]; n for (i = 0; i < n; ++i) { n cin >> a[i] >> b[i]; n } n if (n == 1) cout << a[0] << endl; n if (n > 1) { n set s1, s, s3; n set::iterator jt, it; n j = a[0]; n while (j % 2 == 0) { n s.insert(2); n j /= 2; n } n for (k = 3; k <= sqrt(j); k = k + 2) { n while (j % k == 0) { n s.insert(k); n j /= k; n } n } n if (j > 2) s.insert(j); n j = b[0]; n while (j % 2 == 0) { n s.insert(2); n j /= 2; n } n for (k = 3; k <= sqrt(j); k = k + 2) { n while (j % k == 0) { n s.insert(k); n j /= k; n } n } n if (j > 2) s.insert(j); n j = a[1]; n while (j % 2 == 0) { n s1.insert(2); n j /= 2; n } n for (k = 3; k <= sqrt(j); k = k + 2) { n while (j % k == 0) { n s1.insert(k); n j /= k; n } n } n if (j > 2) s1.insert(j); n j = b[1]; n while (j % 2 == 0) { n s1.insert(2); n j /= 2; n } n for (k = 3; k <= sqrt(j); k = k + 2) { n while (j % k == 0) { n s1.insert(k); n j /= k; n } n } n if (j > 2) s1.insert(j); n for (it = s.begin(); it != s.end(); ++it) { n for (jt = s1.begin(); jt != s1.end(); jt++) { n if ((*jt) % (*it) == 0) { n s3.insert(*it); n } else if ((*it) % (*jt) == 0) n s3.insert(*jt); n } n } n s.clear(); n for (i = 2; i < n; ++i) { n for (it = s3.begin(); it != s3.end(); ++it) { n if (a[i] % (*it) == 0) s.insert(*it); n if (b[i] % (*it) == 0) s.insert(*it); n } n s3.clear(); n for (it = s.begin(); it != s.end(); ++it) { n s3.insert(*it); n } n s.clear(); n } n if (s3.size() > 0) { n for (it = s3.begin(); it != s3.end(); ++it) { n cout << *it << endl; n break; n } n } else n cout << -1 n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin >> n; n if (n == 0) n cout << 1; n else { n n %= 4; n if (n == 0) n = 4; n n = pow(8, n); n cout << n % 10; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n vector a(n), b(n); n for (int i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] <= 1) { n printf( -1 n ); n exit(0); n } n } n for (int i = 0; i < n; i++) { n cin >> b[i]; n if (b[i] <= 1) { n printf( -1 n ); n exit(0); n } n } n double s = m; n s += s / (b[0] - 1); n for (int i = n - 1; i >= 1; i--) { n s += s / (a[i] - 1); n s += s / (b[i] - 1); n } n s += s / (a[0] - 1); n printf( %.10f n , s - m); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ull = unsigned long long; n const int MAX_N = 1e6 + 5; n int fen[MAX_N]; n int n; n int lowbit(int x) { return x & (-x); } n void add(int x, int val) { n for (int i = x; i <= n; i += lowbit(i)) fen[i] += val; n } n int sum(int x) { n int s = 0; n for (int i = x; i; i -= lowbit(i)) s += fen[i]; n return s; n } n int sum(int l, int r) { return sum(r) - sum(l); } n map cnt; n int pre[MAX_N]; n int back[MAX_N]; n int arr[MAX_N]; n int main() { n ios::sync_with_stdio(false); n cin >> n; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n cnt[arr[i]]++; n pre[i] = cnt[arr[i]]; n } n cnt.clear(); n for (int i = n - 1; i >= 0; i--) { n cnt[arr[i]]++; n back[i] = cnt[arr[i]]; n add(back[i], 1); n } n ll ans = 0; n for (int i = 0; i < n; i++) { n add(back[i], -1); n ans += sum(pre[i] - 1); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 9; n bool p[N]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n vector k; n for (int i = 2; i <= 1e6; i++) { n if (p[i]) continue; n k.push_back(i); n for (int j = i + i; j <= 1e6; j += i) { n p[j] = 1; n } n } n int t; n cin >> t; n while (t--) { n long long x; n cin >> x; n long long m = sqrtl(x); n long long r = upper_bound(k.begin(), k.end(), x) - k.begin(); n long long l = upper_bound(k.begin(), k.end(), m) - k.begin(); n cout << r - l + 1 << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000000007; n const int N = 100100; n int n; n int main() { n cin >> n; n for (int i = n + 1; i <= n + n; i++) cout << i << ; n } n "} +{"func_code_string": "#include n using namespace std; n const double EPS = 1e-9; n struct DDMY { n ostringstream o; n template n DDMY &operator,(const T &t) { n o << t << , ; n return *this; n } n string operator*() { return o.str().substr(0, o.str().size() - 1); } n }; n template n std::ostream &operator<<(std::ostream &o, const std::vector &v) { n o << [ ; n for (std::size_t i = 0; i < v.size(); i++) n o << v[i] << (i < v.size() - 1 ? , : ); n return o << ] ; n } n template n std::ostream &operator<<(std::ostream &o, const std::pair &v) { n return o << v.first << : << v.second; n } n template n std::ostream &operator<<(std::ostream &o, const std::map &v) { n o << { ; n typename std::map::const_iterator i = v.begin(), j = i; n ++j; n for (; i != v.end(); ++i, ++j) o << *i << (j != v.end() ? , : ); n return o << } ; n } n template n std::ostream &operator<<(std::ostream &o, const std::set &v) { n o << { ; n typename std::set::const_iterator i = v.begin(), j = i; n ++j; n for (; i != v.end(); ++i, ++j) o << *i << (j != v.end() ? , : ); n return o << } ; n } n void error() { n cout << -1 << endl; n exit(0); n } n int main(int argc, char *argv[]) { n ios::sync_with_stdio(false); n int a1, a2, a3, a4; n cin >> a1 >> a2 >> a3 >> a4; n if (max(a3, a4) > a1 || max(a3, a4) > a2) { n error(); n } n string line; n if (a3 >= a4) { n for (int i = 0; i < a3; i++) { n line += 47 ; n } n a1 -= a3; n a2 -= a3; n a4 -= a3 - 1; n if (a1 < 0 || a2 < 0 || a4 < 0) { n error(); n } n if (a4 == 1) { n if (a1 == 0) { n if (a2 > 0) { n line = 7 + line; n a2--; n if (a2 > 0) line += string(a2, 7 ); n } else { n error(); n } n } else { n line += string(a2, 7 ); n line += 4 ; n a1--; n } n } else if (a4 == 0) { n line += string(a2, 7 ); n } else { n error(); n } n if (a1 > 0) line = string(a1, 4 ) + line; n } else { n for (int i = 0; i < a4; i++) { n line += 74 ; n } n a1 -= a4; n a2 -= a4; n a3 -= a4 - 1; n if (a1 < 0 || a2 < 0 || a4 < 0) { n error(); n } n if (a3 == 0) { n if (a4 > 1) { n line = line.substr(0, line.size() - 2); n line = line.substr(2); n line = 7 + string(a1 + 1, 4 ) + line; n line += string(a2 + 1, 7 ) + 4 ; n } else if (a4 == 1) { n a1 += a4; n a2 += a4; n if (a2 > 0 && a1 > 0) { n line = string(a2, 7 ) + string(a1, 4 ); n } else { n error(); n } n } else if (a4 == 0) { n if (a1 == 0 || a2 == 0) { n if (a1 > 0) { n line = string(a1, 4 ); n } else if (a2 > 0) { n line = string(a2, 7 ); n } n } else { n error(); n } n } else { n error(); n } n } else { n error(); n } n } n cout << line << endl; n return 0; n } n "} +{"func_code_string": "#include n n template n inline void read(T &res) n { n res = 0; bool bo = 0; char c; n while (((c = getchar()) < 0 || c > 9 ) && c != - ); n if (c == - ) bo = 1; else res = c - 48; n while ((c = getchar()) >= 0 && c <= 9 ) n res = (res << 3) + (res << 1) + (c - 48); n if (bo) res = ~res + 1; n } n n const int N = 505; n n int n, m, a[N][N]; n n int main() n { n read(n); read(m); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n read(a[i][j]); n for (int i = 1; i <= n; i++) n { n for (int j = 1; j <= m; j++) n printf( %d , i + j & 1 ? 720720 : 720720 - a[i][j] n * a[i][j] * a[i][j] * a[i][j]); n puts( ); n } n return 0; n }"} +{"func_code_string": "#include n using namespace std; n long double pi = 3.141592653589793238462643383279502884197; n vector v(14); n void Compute() { n for (long long int i = 1; i < 14; i++) { n v[i] = pow(2, i) + v[i - 1]; n } n } n void solve() { n long long int n; n cin >> n; n long long int ans = 0; n string s = to_string(n); n long long int si = s.size(); n ans += v[si - 1]; n for (long long int i = 0; i < s.size(); i++) { n if (s[i] == 7 ) ans += pow(2, (si - 1 - i)); n } n ans++; n cout << ans << endl; n } n int main() { n Compute(); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int V = 100000 + 5; n int n, num[V]; n int main() { n int i, j; n scanf( %d , &n); n for (i = 0; i < n; ++i) scanf( %d , &num[i]); n sort(num, num + n); n printf( %d , num[n - 1]); n for (i = 1; i < n - 1; ++i) printf( %d , num[i]); n printf( %d n , num[0]); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 10; n const double pi = acos(-1.0); n struct Complex { n double x, y; n Complex(double x = 0.0, double y = 0.0) { n this->x = x; n this->y = y; n } n Complex operator-(const Complex &b) const { n return Complex(x - b.x, y - b.y); n } n Complex operator+(const Complex &b) const { n return Complex(x + b.x, y + b.y); n } n Complex operator*(const Complex &b) const { n return Complex(x * b.x - y * b.y, x * b.y + y * b.x); n } n }; n void change(Complex y[], int len) { n for (int i = 1, j = len / 2; i < len - 1; i++) { n if (i < j) swap(y[i], y[j]); n int k = len / 2; n while (j >= k) { n j -= k; n k /= 2; n } n if (j < k) j += k; n } n } n void fft(Complex y[], int len, int on) { n change(y, len); n for (int h = 2; h <= len; h <<= 1) { n Complex wn(cos(-on * 2 * pi / h), sin(-on * 2 * pi / h)); n for (int j = 0; j < len; j += h) { n Complex w(1, 0); n for (int k = j; k < j + h / 2; k++) { n Complex u = y[k]; n Complex t = w * y[k + h / 2]; n y[k] = u + t; n y[k + h / 2] = u - t; n w = w * wn; n } n } n } n if (on == -1) n for (int i = 0; i < len; i++) y[i].x /= len; n } n int n, m, k, i, j, p[30]; n Complex A[N], B[N], C[N]; n int a[N], b[N]; n char sa[N], sb[N]; n int main() { n for (i = 1; i <= 26; i++) scanf( %d , &p[i]); n scanf( %s %s , sa, sb); n m = strlen(sa), n = strlen(sb); n for (i = 0, j = m - 1; i < j; i++, j--) swap(sa[i], sa[j]); n for (i = 0; i < m; i++) a[i] = sa[i] - a + 1; n for (i = 0; i < n; i++) b[i] = sb[i] - a + 1; n for (k = 1; k < n; k <<= 1) n ; n for (i = 0; i < k; i++) n A[i] = Complex(2 * a[i] * p[a[i]] * (a[i] + p[a[i]]), 0), n B[i] = Complex(b[i], 0); n for (fft(A, k, 1), fft(B, k, 1), i = 0; i < k; i++) C[i] = C[i] - A[i] * B[i]; n for (i = 0; i < k; i++) n A[i] = Complex(a[i] * a[i] + p[a[i]] * p[a[i]] + 4 * a[i] * p[a[i]], 0), n B[i] = Complex(b[i] * b[i], 0); n for (fft(A, k, 1), fft(B, k, 1), i = 0; i < k; i++) C[i] = C[i] + A[i] * B[i]; n for (i = 0; i < k; i++) n A[i] = Complex(2 * (a[i] + p[a[i]]), 0), n B[i] = Complex(b[i] * b[i] * b[i], 0); n for (fft(A, k, 1), fft(B, k, 1), i = 0; i < k; i++) C[i] = C[i] - A[i] * B[i]; n for (i = 0; i < k; i++) { n if (i < m) n A[i] = Complex(1, 0); n else n A[i] = Complex(0, 0); n B[i] = Complex(b[i] * b[i] * b[i] * b[i], 0); n } n for (fft(A, k, 1), fft(B, k, 1), i = 0; i < k; i++) C[i] = C[i] + A[i] * B[i]; n for (i = 0; i < k; i++) { n A[i] = Complex(a[i] * a[i] * p[a[i]] * p[a[i]], 0); n if (i < n) n B[i] = Complex(1, 0); n else n B[i] = Complex(0, 0); n } n for (fft(A, k, 1), fft(B, k, 1), i = 0; i < k; i++) C[i] = C[i] + A[i] * B[i]; n fft(C, k, -1); n for (int i = 0; i < n - m + 1; i++) n printf( %d , ((long long)(C[i + m - 1].x + 0.5) == 0)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline void read(int& n) { n int x = 0, f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) n x = (x << 1) + (x << 3) + ch - 0 , ch = getchar(); n n = x * f; n } n int outputarray[20]; n inline void write(int k) { n int num = 0; n if (k < 0) putchar( - ), k = -k; n do { n outputarray[++num] = k % 10, k /= 10; n } while (k); n while (num) putchar(outputarray[num--] + 0 ); n puts( ); n } n const int N = 50; n int n, m, sg[N][N][N][N][2]; n char s[N][N]; n int dfs(int x0, int x2, int y0, int y2, int type) { n if (sg[x0][x2][y0][y2][type] >= 0) return sg[x0][x2][y0][y2][type]; n int a[N * N]; n memset(a, 0, sizeof(a)); n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) n if (((i + j) & 1) == type) { n int x = i + j, y = i - j + m; n if (x >= x0 && x < x2 && y >= y0 && y < y2) { n int tmp = 0; n if (s[i][j] == L ) n tmp = dfs(x0, x, y0, y2, type) ^ dfs(x + 1, x2, y0, y2, type); n if (s[i][j] == R ) n tmp = dfs(x0, x2, y0, y, type) ^ dfs(x0, x2, y + 1, y2, type); n if (s[i][j] == X ) n tmp = dfs(x0, x, y0, y, type) ^ dfs(x0, x, y + 1, y2, type) ^ n dfs(x + 1, x2, y0, y, type) ^ dfs(x + 1, x2, y + 1, y2, type); n a[tmp] = 1; n } n } n while (a[++sg[x0][x2][y0][y2][type]]) n ; n return sg[x0][x2][y0][y2][type]; n } n int main() { n memset(sg, -1, sizeof(sg)); n read(n), read(m); n for (int i = 0; i < n; i++) scanf( %s , s[i]); n if (dfs(0, n + m, 0, n + m, 0) ^ dfs(0, n + m, 0, n + m, 1)) n puts( WIN ); n else n puts( LOSE ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, ans = 0; n cin >> n >> m; n while (n != m) { n if (n < m) { n if (m % 2 == 0) n m /= 2, ans++; n else n m++, ans++; n } else { n ans++; n m++; n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, q; n int matrix[52][52]; n long long pref[3][52][52]; n long long all[2][52][52][52][52]; n void precalculate() { n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n for (int k = i; k <= n; k++) { n for (int ij = j; ij <= m; ij++) { n all[1][i][j][k][ij] = all[1][i][j][k][ij - 1] + n all[1][i][j][k - 1][ij] - n all[1][i][j][k - 1][ij - 1]; n int r = ij - j + 1; n for (int c = k; c >= i && r > 0; c--) { n r = (r > pref[2][c][ij]) ? pref[2][c][ij] : r; n all[1][i][j][k][ij] += r; n } n } n } n } n } n } n int main() { n scanf( %d %d %d , &n, &m, &q); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n char c = 2 ; n while (c != 0 && c != 1 ) scanf( %c , &c); n matrix[i][j] = c - 48; n pref[2][i][j] = pref[2][i][j - 1]; n if (matrix[i][j] == 1) n pref[2][i][j] = 0; n else n pref[2][i][j]++; n } n } n precalculate(); n while (q--) { n int a, b, c, d; n cin >> a >> b >> c >> d; n cout << all[1][a][b][c][d] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int arr[4005]; n int nxt[4005], prv[4005]; n map M; n map Q; n int main() { n int n; n cin >> n; n int ans = 0; n for (int i = 0; i < n; ++i) { n cin >> arr[i]; n if (M.find(arr[i]) != M.end()) { n nxt[M[arr[i]]] = i; n prv[i] = M[arr[i]]; n Q[arr[i]]++; n ans = max(ans, Q[arr[i]]); n } else { n prv[i] = -1; n Q[arr[i]]++; n ans = max(ans, Q[arr[i]]); n } n M[arr[i]] = i; n nxt[i] = -1; n } n for (int i = 0; i < n; ++i) { n if (prv[i] != -1) { n continue; n } n for (int j = i + 1; j < n; ++j) { n if (prv[j] != -1) { n continue; n } n int cur = 2; n int t1 = i, t2 = j; n while (t1 != -1 && t2 != -1) { n if (t1 < t2) { n if (nxt[t1] > t2) { n ++cur; n } n t1 = nxt[t1]; n } else { n if (nxt[t2] > t1) { n ++cur; n } n t2 = nxt[t2]; n } n } n ans = max(ans, cur); n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int b = 3e6; n long long a[b]; n void ans(long long x, long long y, long long k, long long i) { n long long sidl = k + k * y, ans = k; n long long ez1 = (sidl - 3 + x) / (x - 1); n ans += ez1; n a[i] = ans; n } n int main() { n long long t, x, y, k, j; n cin >> t; n for (int i = 0; i < t; i++) { n cin >> x >> y >> k; n ans(x, y, k, i); n } n for (int i = 0; i < t; i++) cout << a[i] << endl; n return 0; n }; n "} +{"func_code_string": "#include n using namespace std; n int test() { n long long n; n cin >> n; n long long cL = 0, cR = 0; n long long si = 3 * 100001; n long long *right = new long long[si], *left = new long long[si]; n for (long long i = 0; i < si; i++) { n right[i] = 0; n left[i] = 0; n } n long long prop = 0, l = 0, r = 0; n string temp; n for (long long i = 0; i < n; i++) { n cin >> temp; n long long tempS = temp.size(); n for (long long i = 0; i < tempS; i++) { n if (temp[i] == ( ) { n cL++; n l++; n } else { n cR++; n if (l != 0) n l--; n else n r++; n } n } n if (r != 0 && l != 0) { n } else if (cR == cL) n prop++; n else if (cR > cL) n right[cR - cL]++; n else n left[cL - cR]++; n l = 0; n r = 0; n cL = 0; n cR = 0; n } n long long S = 0; n for (long long i = 0; i < si; i++) { n if (right[i] != 0 && left[i] != 0) { n S += right[i] * left[i]; n } n } n S += prop * prop; n cout << S; n return 0; n } n int hacker() { return 0; } n int main() { n while (true) { n return test(); n cout << n n-- ; n hacker(); n cout << n n n----------------------------- n n n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double EPS = 1e-6; n double n, r; n bool check(double R) { n double x1 = r + R; n double y1 = 0; n double x2 = cos(2 * acos(-1) / n) * (r + R); n double y2 = sin(2 * acos(-1) / n) * (r + R); n double len = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); n if (len <= 2 * R) n return true; n else n return false; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> r; n double l1 = 0, r1 = 10000; n for (int i = 0; i < 500; i++) { n double mm = (l1 + r1) / 2.0; n if (check(mm)) n r1 = mm; n else n l1 = mm; n } n cout.fixed; n cout.precision(15); n cout << l1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c; n cin >> a; n cin >> b; n cin >> c; n int d = a + b - c; n int e = b + c - a; n int f = a + c - b; n if (d < 0 || e < 0 || f < 0 || e % 2 || d % 2 || f % 2) { n cout << Impossible ; n return 0; n } n cout << d / 2 << << e / 2 << << f / 2 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n int l, r, num; n } a[100005]; n int n, ans[100005]; n bool cmp(node x, node y) { n if (x.l == y.l) return x.r < y.r; n return x.l < y.l; n } n void solve() { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i].l >> a[i].r; n a[i].num = i + 1; n } n sort(a + 1, a + n + 1, cmp); n set F; n int mx = -1; n for (int i = 1; i <= n - 1; i++) { n F.insert(a[i].num); n mx = max(mx, a[i].r); n if (mx < a[i + 1].l) { n for (int j = 1; j <= n; j++) { n if (F.count(a[j].num)) n ans[a[j].num] = 1; n else n ans[a[j].num] = 2; n } n for (int j = 2; j <= n + 1; j++) cout << ans[j] << ; n cout << endl; n return; n } n } n cout << -1 << endl; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int T; n cin >> T; n while (T--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, a, b, c, d, e, f, g, h; n cin >> n; n vector values(n), kalues(n), malues; n for (int i = 0; i < n; i++) { n cin >> values[i]; n cin >> kalues[i]; n kalues[i]--; n malues.push_back(values[i]); n malues.push_back(kalues[i]); n } n sort(values.begin(), values.end()); n sort(kalues.begin(), kalues.end()); n sort(malues.begin(), malues.end()); n long long int mini = -5, year = -1; n malues.erase(unique(malues.begin(), malues.end()), malues.end()); n for (int i = 0; i < 2 * n; i++) { n long long int helebele = n lower_bound(kalues.begin(), kalues.end(), malues[i]) - kalues.begin(); n helebele += n - (upper_bound(values.begin(), values.end(), malues[i]) - n values.begin()); n if (mini < n - helebele) mini = n - helebele, year = malues[i]; n } n cout << year << << mini << endl; n } n "} +{"func_code_string": "#include n using namespace std; n char s[55]; n int l; n int df[55][10]; n int f(int pos, int c) { n if (pos == l) return 1; n if (df[pos][c] != -1) return df[pos][c]; n int res = 0; n int nn = c + s[pos]; n res += f(pos + 1, nn / 2); n if (nn & 1) res += f(pos + 1, (nn + 1) / 2); n return df[pos][c] = res; n } n bool good() { n for (int i = 1; i < l; i++) { n int nn = s[i] + s[i - 1]; n if (nn & 1) { n if (nn / 2 != s[i] && (nn + 1) / 2 != s[i]) return false; n } else { n if (nn / 2 != s[i]) return false; n } n } n return true; n } n int main() { n memset(df, -1, sizeof(df)); n scanf( %s , s); n l = strlen(s); n for (int i = 0; i < l; i++) s[i] -= 0 ; n long long ans = 0; n for (int i = 0; i < 10; i++) ans += f(1, i); n if (good()) ans--; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n const int INF = 1e9; n using namespace std; n int R, C, frow, fcol, row, col, srow, scol, nxcol, nxrow; n int ans, intest[1005][1005], goal; n char grid[1005][1005]; n queue > q; n const int dr[4] = {-1, 0, 1, 0}; n const int dc[4] = {0, -1, 0, 1}; n bool inside(int r, int c) { return r > 0 && c > 0 && r <= R && c <= C; } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> R >> C; n for (int r = 1; r <= R; r++) { n for (int c = 1; c <= C; c++) { n cin >> grid[r][c]; n intest[r][c] = INF; n if (grid[r][c] == S ) n srow = r, scol = c; n else if (grid[r][c] == E ) n frow = r, fcol = c; n } n } n intest[frow][fcol] = 0; n q.push(make_pair(frow, fcol)); n while (!q.empty()) { n pair cur = q.front(); n q.pop(); n row = cur.first; n col = cur.second; n for (int i = 0; i <= 3; i++) { n nxrow = row + dr[i]; n nxcol = col + dc[i]; n if (!inside(nxrow, nxcol)) continue; n if (grid[nxrow][nxcol] == T ) continue; n if (intest[nxrow][nxcol] != INF) continue; n intest[nxrow][nxcol] = intest[row][col] + 1; n q.push(make_pair(nxrow, nxcol)); n } n } n goal = intest[srow][scol]; n for (int i = 1; i <= R; i++) { n for (int j = 1; j <= C; j++) { n if (grid[i][j] - 0 > 0 && grid[i][j] < 58) { n srow = i, scol = j; n if (intest[srow][scol] <= goal) ans += (grid[i][j] - 0 ); n } n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int a[n]; n for (int i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n for (int i = 0; i < n; i++) cout << a[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n int x, y, z; n int _x, _y, _z; n int a[6]; n long long int ans = 0LL; n int main() { n ios::sync_with_stdio(false); n cin >> x >> y >> z; n cin >> _x >> _y >> _z; n for (int i = 0; i < 6; i++) cin >> a[i]; n if (y < 0) ans += a[0]; n if (y > _y) ans += a[1]; n if (z < 0) ans += a[2]; n if (z > _z) ans += a[3]; n if (x < 0) ans += a[4]; n if (x > _x) ans += a[5]; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int SZ = 8e6 + 10; n const int INF = 1e9 + 10; n const int mod = 998244353; n const long double eps = 1e-8; n long long read() { n long long n = 0; n char a = getchar(); n bool flag = 0; n while (a > 9 || a < 0 ) { n if (a == - ) flag = 1; n a = getchar(); n } n while (a <= 9 && a >= 0 ) { n n = n * 10 + a - 0 , a = getchar(); n } n if (flag) n = -n; n return n; n } n int a[SZ], f[1010][1010], b[SZ], c[SZ]; n int main() { n int n = read(), k = read(); n for (int i = 1; i <= n; i++) a[i] = read(); n sort(a + 1, a + 1 + n); n for (int i = 1; i <= n; i++) { n for (int j = i + 1; j <= n; j++) { n b[++b[0]] = a[j] - a[i]; n } n } n sort(b + 1, b + 1 + b[0]); n b[0] = unique(b + 1, b + 1 + b[0]) - b - 1; n int ans = 0; n for (int j = 1; j <= b[0]; j++) { n int minx = b[j]; n if (minx > 1e5 / (k - 1)) break; n for (int i = 1; i <= n; i++) f[i][1] = f[i - 1][1] + 1; n for (int l = 2; l <= k; l++) { n for (int i = 2, lst = 0; i <= n; i++) { n while (lst < i && a[lst + 1] <= a[i] - minx) lst++; n f[i][l] = f[lst][l - 1]; n } n for (int i = 1; i <= n; i++) (f[i][l] += f[i - 1][l]) %= mod; n } n c[j] = f[n][k]; n } n for (int j = 1; j <= b[0]; j++) n (ans += 1ll * b[j] * (c[j] - c[j + 1] + mod) % mod) %= mod; n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int book[3]; n char s[105], rs[105]; n int main() { n int t, ans, n; n scanf( %d , &t); n for (int i = 0; i < t; i++) { n scanf( %d , &n); n ans = 0; n memset(rs, 0 , sizeof(rs)); n for (int i = 0; i < 3; i++) { n scanf( %d , &book[i]); n } n scanf( %s , s); n for (int i = 0; i < n; i++) { n if (s[i] == R ) { n if (book[1] > 0) { n ans++; n book[1]--; n rs[i] = P ; n } n } else if (s[i] == P ) { n if (book[2] > 0) { n ans++; n book[2]--; n rs[i] = S ; n } n } else { n if (book[0] > 0) { n ans++; n book[0]--; n rs[i] = R ; n } n } n } n if (ans >= (n + 1) / 2) { n int k = 0; n for (int i = 0; i < n; i++) { n if (rs[i] == 0 ) { n while (book[k] == 0) k++; n if (k == 0) n rs[i] = R ; n else if (k == 1) n rs[i] = P ; n else n rs[i] = S ; n book[k]--; n } n } n printf( YES n%s n , rs); n } else n printf( NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 5; n long long le[N], ri[N], mid, lee, rii; n long long a[N], b[N], c[N], mp[35], ans, n, answ, idx, idx1, pw[35], bb; n int main() { n std::ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n } n pw[0] = 1; n for (int i = 1; i <= 35; i++) { n pw[i] = pw[i - 1] * 2; n } n for (int i = 0; i <= 30; i++) { n for (int j = 1; j <= n; j++) { n b[j] += a[j] & pw[i]; n c[j] = b[j]; n } n std::stable_sort(c + 1, c + n + 1); n idx = n; n for (int j = 1; j <= n; j++) { n idx = max(idx, j + 1LL); n bb = 0; n while (c[j] + c[idx] >= pw[i] && idx > j) { n idx--; n bb = 1; n } n if (bb == 1) idx++; n if (c[j] + c[idx] < pw[i] || idx > n) n le[j] = -1; n else n le[j] = idx; n } n idx = n; n for (int j = 1; j <= n; j++) { n idx = max(idx, j + 1LL); n while (c[j] + c[idx] >= pw[i + 1] && idx > j + 1) { n idx--; n } n if (c[j] + c[idx] >= pw[i + 1] || idx > n) n ri[j] = -1; n else n ri[j] = idx; n } n for (int j = 1; j <= n; j++) { n if (le[j] != -1 && ri[j] != -1) mp[i] += ri[j] - le[j] + 1; n } n idx = n; n for (int j = 1; j <= n; j++) { n idx = max(idx, j + 1LL); n bb = 0; n while (c[j] + c[idx] >= pw[i + 1] + pw[i] && idx > j) { n bb = 1; n idx--; n } n if (bb == 1) idx++; n if (c[j] + c[idx] < pw[i + 1] + pw[i] || idx > n) n le[j] = -1; n else n le[j] = idx; n } n idx = n; n for (int j = 1; j <= n; j++) { n idx = max(idx, j + 1LL); n while (c[j] + c[idx] >= pw[i + 2] && idx > j + 1) { n idx--; n } n if (c[j] + c[idx] >= pw[i + 2] || idx > n) n ri[j] = -1; n else n ri[j] = idx; n } n for (int j = 1; j <= n; j++) { n if (le[j] != -1 && ri[j] != -1) mp[i] += ri[j] - le[j] + 1; n } n } n for (int i = 0; i <= 30; i++) { n if (mp[i] % 2) answ += (1LL << i); n } n cout << answ << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int a[20000], num[20000]; n int dp[400]; n int n, m, t, k, ans, maxm; n int main() { n scanf( %d%d , &n, &m); n maxm = 0; n ans = 0; n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n num[a[i]]++; n maxm = max(maxm, num[a[i]]); n } n t = min(n, m); n k = t; n int temp = 0; n while (--k) { n temp += n; n for (int i = 1; i <= n; i++) a[temp + i] = a[i]; n } n for (int i = 1; i <= n * t; i++) { n dp[a[i]]++; n for (int j = a[i] - 1; j >= 0; j--) dp[a[i]] = max(dp[a[i]], dp[j] + 1); n ans = max(dp[a[i]], ans); n } n ans += maxm * (m - t); n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n const int inf = 1500000000; n const int d = 1e9 + 7; n using namespace std; n struct triple { n int a; n int b; n int c; n bool flag; n triple() { flag = true; } n }; n int main() { n int n; n cin >> n; n vector t(n - 1, triple()); n vector adj[n + 1]; n for (int i = 1; i <= n - 2; i++) { n cin >> t[i].a >> t[i].b >> t[i].c; n adj[t[i].a].push_back(i); n adj[t[i].b].push_back(i); n adj[t[i].c].push_back(i); n } n int first; n triple f; n for (int i = 1; i <= n; i++) { n if (adj[i].size() == 1) { n first = i; n f = t[adj[i][0]]; n break; n } n } n int second; n if (adj[f.a].size() == 2) { n second = f.a; n } n if (adj[f.b].size() == 2) { n second = f.b; n } n if (adj[f.c].size() == 2) { n second = f.c; n } n vector perm; n perm.push_back(first); n perm.push_back(second); n while (perm.size() != n) { n int third; n for (int i = 0; i < adj[first].size(); i++) { n int ind = adj[first][i]; n if (t[ind].flag == true) { n t[ind].flag = false; n third = (t[ind].a + t[ind].b + t[ind].c) - first - second; n perm.push_back(third); n first = second; n second = third; n break; n } n } n } n for (int i = 0; i < perm.size(); i++) cout << perm[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int k; n string s; n int main() { n cin >> k; n cin >> s; n int n = s.length(); n for (int i = 0; i < n; ++i) { n if (s[i] == ? && s[n - i - 1] == ? ) { n continue; n } else if (s[i] == ? ) { n s[i] = s[n - i - 1]; n } else if (s[n - i - 1] == ? ) { n s[n - i - 1] = s[i]; n } else if (s[i] != s[n - i - 1]) { n cout << IMPOSSIBLE ; n return 0; n } n } n bool flag[26]; n memset(flag, 0, sizeof(flag)); n for (int i = 0; i < n; ++i) { n if (s[i] != ? ) { n flag[s[i] - a ] = true; n } n } n int miss = 0; n for (int c = 0; c < k; ++c) { n if (!flag[c]) { n ++miss; n } n } n int have = 0; n for (int i = 0; i <= n - i - 1; ++i) { n if (s[i] == ? ) { n ++have; n } n } n if (miss > have) { n cout << IMPOSSIBLE ; n return 0; n } n for (int i = 0; i < n; ++i) { n if (s[i] == ? ) { n if (have > miss) { n s[i] = s[n - i - 1] = a ; n } else { n for (int c = 0; c < k; ++c) { n if (!flag[c]) { n s[i] = s[n - i - 1] = c + a ; n flag[c] = true; n break; n } n } n --miss; n } n --have; n } n } n cout << s << endl; n return 0; n } n "} +{"func_code_string": "#include n const long double EPS = 1e-10; n const long long int MOD = 1000000007ll; n const long long int mod1 = 1000000009ll; n const long long int mod2 = 1100000009ll; n int INF = (int)1e9; n long long int INFINF = (long long int)1e18; n int debug = 0; n long double PI = acos(-1.0); n using namespace std; n long long int bit_count(long long int _x) { n long long int _ret = 0; n while (_x) { n if (_x % 2 == 1) _ret++; n _x /= 2; n } n return _ret; n } n long long int bit(long long int _mask, long long int _i) { n return (_mask & (1 << _i)) == 0 ? 0 : 1; n } n long long int powermod(long long int _a, long long int _b, n long long int _m = MOD) { n long long int _r = 1; n while (_b) { n if (_b % 2 == 1) _r = (_r * _a) % _m; n _b /= 2; n _a = (_a * _a) % _m; n } n return _r; n } n long long int add(long long int a, long long int b, long long int m = MOD) { n long long int x = a + b; n while (x >= m) x -= m; n while (x < 0) x += m; n return x; n } n long long int sub(long long int a, long long int b, long long int m = MOD) { n long long int x = a - b; n while (x < 0) x += m; n while (x >= m) x -= m; n return x; n } n long long int mul(long long int a, long long int b, long long int m = MOD) { n long long int x = a * 1ll * b; n x %= m; n if (x < 0) x += m; n return x; n } n int N, M, K; n vector G[1010]; n bool spec[1010]; n bool vis[1010]; n int tot, cnt; n vector sizes; n void dfs(int u) { n tot++; n cnt++; n vis[u] = true; n for (int v : G[u]) { n if (!vis[v]) { n dfs(v); n } n } n } n int main() { n if (0) { n freopen( input.txt , r , stdin); n debug = 1; n } n srand(time(NULL)); n scanf( %d , &N); n scanf( %d , &M); n scanf( %d , &K); n for (int i = 1; i <= K; i++) { n int x; n scanf( %d , &x); n spec[x] = true; n } n for (int i = 1; i <= M; i++) { n int u, v; n scanf( %d , &u); n scanf( %d , &v); n G[u].push_back(v); n G[v].push_back(u); n } n for (int i = 1; i <= N; i++) { n if (spec[i]) { n cnt = 0; n dfs(i); n sizes.push_back(cnt); n } n } n sort(sizes.begin(), sizes.end()); n reverse(sizes.begin(), sizes.end()); n sizes[0] += (N - tot); n long long int ans = 0; n for (int it : sizes) { n ans += (it * (it - 1)) / 2; n } n cout << ans - M; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void inin(Q &x) { n x = 0; n int f = 0; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = 1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); n x = f ? -x : x; n } n int n, a[100010], b[100010]; n long long sum[100010], ans[100010], tot[100010]; n int erfen(int x, int l, int r) { n int ll = l, rr = r, mid; n while (ll < rr) { n mid = (ll + rr) >> 1; n if (sum[mid] - sum[l - 1] < x) n ll = mid + 1; n else n rr = mid; n } n if (ll == n && sum[n] - sum[l - 1] < x) return n + 1; n return ll; n } n int main() { n inin(n); n for (int i = (1); i <= (n); i++) inin(a[i]); n for (int i = (1); i <= (n); i++) inin(b[i]), sum[i] = sum[i - 1] + b[i]; n for (int i = (1); i <= (n); i++) { n int x = erfen(a[i], i, n); n tot[x]--; n ans[x] += a[i] - (sum[x - 1] - sum[i - 1]); n tot[i] += tot[i - 1] + 1; n ans[i] += 1LL * b[i] * tot[i]; n } n for (int i = (1); i <= (n); i++) printf( %lld , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n const long long sze = 1e5 + 2; n const long long inf = 0x3f3f3f3f; n void solve() { n long long n, k; n cin >> n; n cin >> k; n long long swap = k; n long long last = n; n long long i = 1; n bool turn = true; n while (swap) { n if (turn) { n cout << i << ; n i++; n turn = false; n } else { n cout << last << ; n last--; n turn = true; n } n swap--; n } n if (k % 2 == 0) { n while (last >= i) { n cout << last << ; n last--; n } n return; n } n while (i <= last) { n cout << i << ; n i++; n } n } n signed main() { n long long test = 1; n while (test--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b; n vector > v, re; n scanf( %d %d , &a, &b); n v.push_back(make_pair(a, b)); n scanf( %d %d , &a, &b); n v.push_back(make_pair(a, b)); n scanf( %d %d , &a, &b); n v.push_back(make_pair(a, b)); n sort(v.begin(), v.end()); n pair A = v[0], B = v[1], C = v[2]; n int x = A.first, y = A.second; n re.push_back(make_pair(x, y)); n if (C.second > A.second) { n int dy = max(min(B.second, C.second), A.second); n for (int i = A.second + 1; i <= dy; i++) { n re.push_back(make_pair(x, i)); n } n y = dy; n for (int i = A.first + 1; i <= C.first; i++) { n re.push_back(make_pair(i, y)); n } n x = C.first; n for (int i = y + 1; i <= C.second; i++) { n re.push_back(make_pair(x, i)); n } n } else { n int dy = min(max(B.second, C.second), A.second); n for (int i = A.second - 1; i >= dy; i--) { n re.push_back(make_pair(x, i)); n } n y = dy; n for (int i = A.first + 1; i <= C.first; i++) { n re.push_back(make_pair(i, y)); n } n x = C.first; n for (int i = y - 1; i >= C.second; i--) { n re.push_back(make_pair(x, i)); n } n } n if (B.second > y) { n for (int i = y + 1; i <= B.second; i++) { n re.push_back(make_pair(B.first, i)); n } n } else { n for (int i = y - 1; i >= B.second; i--) { n re.push_back(make_pair(B.first, i)); n } n } n printf( %d n , re.size()); n for (int i = 0; i < re.size(); i++) { n printf( %d %d n , re[i].first, re[i].second); n } n } n "} +{"func_code_string": "#include n using namespace std; n int len, pos; n void insert(int x) { n len++; n if (x <= pos) pos++; n } n void erase(int x) { n if (x >= pos) n len = x; n else n len -= x, pos -= x; n } n int main() { n int m, t; n scanf( %d%d%d%d , &len, &pos, &m, &t); n while (t--) { n int type, x; n scanf( %d%d , &type, &x); n if (type == 1) n insert(x); n else n erase(x); n printf( %d %d n , len, pos); n } n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const int sz = 5e5 + 10; n int ar[sz]; n int main() { n int n, ans; n while (cin >> n) { n for (int i = 0; i < n; i++) cin >> ar[i]; n sort(ar, ar + n); n ans = n; n for (int i = n - 1, j = (n / 2) - 1; j >= 0; j--) { n if (ar[i] >= ar[j] * 2) { n ans--; n i--; n } n } n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int DX[8] = {1, -1, 0, 0, 1, 1, -1, -1}; n const int DY[8] = {0, 0, 1, -1, 1, -1, 1, -1}; n const int intmax = 0x7fffffff; n map mp; n int main() { n int n; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n int a; n scanf( %d , &a); n mp[a]++; n } n map::iterator it = mp.begin(); n int deg = (it->second) * 2; n int last = it->first; n it++; n for (; it != mp.end(); it++) { n if ((it->first) != last + 1) { n puts( NO ); n return 0; n } n if (!deg) { n puts( NO ); n return 0; n } n deg = it->second * 2 - deg; n if (deg < 0) { n puts( NO ); n return 0; n } n last = it->first; n } n if (!deg) n puts( YES ); n else n puts( NO ); n } n "} +{"func_code_string": "#include n using namespace std; n const long double PI = acos(-1); n const long double eps = 0.0000000001; n const long long INF = 0x3fffffffffffffff; n long long a[200005], sum[200005], n, q, x, y; n long long lowbit(long long now) { return now & -now; } n void add(long long pos, long long v) { n while (pos <= n) { n sum[pos] += v; n pos += lowbit(pos); n } n } n long long query(long long now) { n long long res = 0; n while (now) { n res += sum[now]; n now ^= lowbit(now); n } n return res; n } n long long findnext(long long now) { n long long l = now + 1, r = n + 1, v = query(now); n while (l < r) { n long long mid = (l + r) >> 1; n if (query(mid) < v << 1) { n l = mid + 1; n } else { n r = mid; n } n } n return l; n } n signed main() { n ios::sync_with_stdio(false); n cin >> n >> q; n for (long long i = 1; i <= n; ++i) { n cin >> a[i]; n add(i, a[i]); n } n for (long long i = 1; i <= q; ++i) { n cin >> x >> y; n add(x, -a[x]); n a[x] = y; n add(x, a[x]); n long long now = 1; n bool flag = false; n if (a[1] == 0) { n cout << 1 << endl; n continue; n } n while (now <= n) { n now = findnext(now); n if (now <= n && query(now) == a[now] << 1) { n cout << now << endl; n flag = true; n break; n } n } n if (!flag) { n cout << -1 << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int n, p, q, b, l; n long long int gcd(long long int a, long long int c) { n if (!c) return a; n return gcd(c, a % c); n } n long long int read_ll() { n char ch; n long long int num = 0; n ch = getchar(); n while (!isdigit(ch)) { n ch = getchar(); n } n while (isdigit(ch)) { n num = num * 10 + (long long int)ch - (long long int) 0 ; n ch = getchar(); n } n return num; n } n int main() { n scanf( %ld , &n); n while (n--) { n p = read_ll(); n q = read_ll(); n b = read_ll(); n long long int d = gcd(p, q); n p = p / d; n q = q / d; n while (1) { n b = gcd(q, b); n if (b == 1) { n if (q == 1) n printf( Finite n ); n else n printf( Infinite n ); n break; n } n while (q % b == 0) q /= b; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int x, y, z; n cin >> x >> y >> z; n int total = x - y; n if (total < 0) { n if (total + z < 0) { n cout << - ; n } else { n cout << ? ; n } n } n if (total > 0) { n if (total - z > 0) { n cout << + ; n } else { n cout << ? ; n } n } n if (total == 0) { n if (total + z == 0) { n cout << 0 ; n } else { n cout << ? ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int main() { n cin >> n; n if (n == 1) n cout << -1 ; n else n cout << n << << n + 1 << << n * n + n; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma comment(linker, /STACK:100000000 ) n int n; n double l; n pair mas[1010]; n int lst[1010]; n double dp[1010]; n bool check(double r) { n for (int i = 0; i <= n; i++) lst[i] = -1; n for (int i = 1; i <= n; i++) dp[i] = -1e15; n for (int i = 0; i < n; i++) { n if (lst[i] == -1 && i != 0) continue; n for (int j = i + 1; j <= n; j++) { n double p = sqrt(abs(l - (double)(mas[j].first - mas[i].first))); n if (dp[j] < dp[i] + (double)mas[j].second * r - p) { n lst[j] = i; n dp[j] = dp[i] + (double)mas[j].second * r - p; n } n } n } n if (lst[n] != -1 && dp[n] > -1e-9) n return true; n else n return false; n } n int main() { n scanf( %d %lf , &n, &l); n for (int i = 1; i <= n; i++) scanf( %d %d , &mas[i].first, &mas[i].second); n double l = 0, r = 1e9; n for (int i = 0; i < 100; i++) { n double av = (l + r) / 2.0; n if (check(av)) n r = av; n else n l = av; n } n check(l); n vector ans; n int cur = n; n while (cur != 0) { n ans.push_back(cur); n cur = lst[cur]; n } n for (int i = (int)(ans).size() - 1; i >= 0; i--) printf( %d , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int m = 31; n const int maxn = 31; n long long n, k; n long long f[maxn + 5], g[maxn + 5]; n void init() { n f[1] = g[1] = 1; n for (int i = 2; i <= m; i++) { n f[i] = (1LL << i * 2 - 2) + f[i - 1]; n g[i] = (1LL << i) - 1 + g[i - 1]; n } n } n int main() { n init(); n long long T; n cin >> T; n while (T--) { n cin >> n >> k; n if (n > m) { n printf( YES %I64d n , n - 1); n continue; n } n int flg = -1; n for (int i = 0; i <= n; i++) { n if (k >= g[i] && n k <= f[i] + f[n - i] * ((1ll << i) - 1) * ((1ll << i) - 1)) { n flg = i; n break; n } n } n if (~flg) n printf( YES %I64d n , n - flg); n else n printf( NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n int n, m; n cin >> n >> m; n cin >> s; n for (int i = 0; i < m; i++) { n int l, r; n char c1, c2; n scanf( %d %d %c %c , &l, &r, &c1, &c2); n for (int j = l - 1; j < r; j++) { n if (s[j] == c1) { n s[j] = c2; n } n } n } n cout << s << endl; n cin >> n; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n scanf( %d , &n); n if (n == 1) { n printf( a na nb nb n ); n } else if (n == 2) { n printf( aa nbb ncc ndd n ); n } else if (n == 3) { n printf( aab n ); n printf( ccb n ); n printf( baa n ); n printf( bcc n ); n } else { n char a[4][105]; n int i, j; n if (n % 2 == 0) { n a[0][0] = a ; n a[0][1] = a ; n a[1][0] = b ; n a[2][0] = b ; n a[3][0] = a ; n a[3][1] = a ; n a[0][n - 2] = a[0][n - 1] = y ; n a[1][n - 1] = a[2][n - 1] = z ; n a[3][n - 2] = a[3][n - 1] = y ; n for (i = 1;; i += 2) { n a[1][i] = a[1][i + 1] = g + ((i / 2) % 2) * 2; n a[2][i] = a[2][i + 1] = h + ((i / 2) % 2) * 2; n if (i + 1 == n - 2) break; n a[0][i + 1] = a[0][i + 2] = m + ((i / 2) % 2) * 2; n a[3][i + 1] = a[3][i + 2] = n + ((i / 2) % 2) * 2; n } n } else { n a[0][0] = a[1][0] = a ; n a[2][0] = a[2][1] = b ; n a[3][0] = a[3][1] = c ; n a[0][n - 1] = a[0][n - 2] = z ; n a[1][n - 1] = a[1][n - 2] = y ; n a[2][n - 1] = a[3][n - 1] = x ; n for (i = 1; i < n - 2; i++) a[0][i] = g + (((i - 1) / 2) % 2); n for (i = 1; i < n - 2; i++) a[1][i] = i + (((i - 1) / 2) % 2); n for (i = 2; i < n - 1; i++) a[2][i] = k + (((i) / 2) % 2); n for (i = 2; i < n - 1; i++) a[3][i] = n + (((i) / 2) % 2); n } n a[0][n] = a[1][n] = a[2][n] = a[3][n] = 0 ; n printf( %s n%s n%s n%s n , a[0], a[1], a[2], a[3]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long h, n; n cin >> h >> n; n long long l = 1, r = (1LL << h), ret = 0, cur = 0, dir = 0; n while (cur < h) { n long long size = (1LL << (h - cur)), mid = (l + r) / 2; n if (dir == 0) { n if (n <= mid) n ++ret, r = mid, dir = 1; n else n ret += size, l = mid + 1; n } else { n if (n <= mid) n ret += size, r = mid; n else n ++ret, l = mid + 1, dir = 0; n } n ++cur; n } n cout << ret << endl; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx ) n template n inline T readInt(); n inline double readDouble(); n inline int readUInt(); n inline int readChar(); n inline void readWord(char *s); n inline bool readLine(char *s); n inline bool isEof(); n inline int getChar(); n inline int peekChar(); n inline bool seekEof(); n inline void skipBlanks(); n inline std::string readString(); n template n inline void writeInt(T x, char end = 0, int len = -1); n inline void writeChar(int x); n inline void writeWord(const char *s); n inline void writeDouble(double x, int len = 0); n inline void flush(); n static struct buffer_flusher_t { n ~buffer_flusher_t() { flush(); } n } buffer_flusher; n using namespace std; n template n inline void pv(const std::vector &vector, char separator = , n char end = n ) { n for (int i = 0; i < vector.size(); ++i) { n if (i != 0) { n writeChar(separator); n } n writeInt(vector[i]); n } n writeChar(end); n } n inline void init() { n srand(time(0)); n ios_base::sync_with_stdio(0); n cin.tie(0); n } n static const int buf_size = 4 * 4096; n static unsigned char buf[buf_size]; n static int buf_len = 0, buf_pos = 0; n inline string readString() { n const int MAX = 1e6 + 42; n static char buf[MAX]; n readWord(buf); n return string(buf); n } n inline bool isEof() { n if (buf_pos == buf_len) { n buf_pos = 0, buf_len = fread(buf, 1, buf_size, stdin); n if (buf_pos == buf_len) return 1; n } n return 0; n } n inline int getChar() { return isEof() ? -1 : buf[buf_pos++]; } n inline int peekChar() { return isEof() ? -1 : buf[buf_pos]; } n inline bool seekEof() { n int c; n while ((c = peekChar()) != -1 && c <= 32) buf_pos++; n return c == -1; n } n inline void skipBlanks() { n while (!isEof() && buf[buf_pos] <= 32U) buf_pos++; n } n inline int readChar() { n int c = getChar(); n while (c != -1 && c <= 32) c = getChar(); n return c; n } n inline int readUInt() { n int c = readChar(), x = 0; n while ( 0 <= c && c <= 9 ) x = x * 10 + c - 0 , c = getChar(); n return x; n } n template n inline T readInt() { n int second = 1, c = readChar(); n T x = 0; n if (c == - ) n second = -1, c = getChar(); n else if (c == + ) n c = getChar(); n while ( 0 <= c && c <= 9 ) x = x * 10 + c - 0 , c = getChar(); n return second == 1 ? x : -x; n } n inline double readDouble() { n int second = 1, c = readChar(); n double x = 0; n if (c == - ) second = -1, c = getChar(); n while ( 0 <= c && c <= 9 ) x = x * 10 + c - 0 , c = getChar(); n if (c == . ) { n c = getChar(); n double coef = 1; n while ( 0 <= c && c <= 9 ) x += (c - 0 ) * (coef *= 1e-1), c = getChar(); n } n return second == 1 ? x : -x; n } n inline void readWord(char *second) { n int c = readChar(); n while (c > 32) *second++ = c, c = getChar(); n *second = 0; n } n inline bool readLine(char *second) { n int c = getChar(); n while (c != n && c != -1) *second++ = c, c = getChar(); n *second = 0; n return c != -1; n } n static int write_buf_pos = 0; n static char write_buf[buf_size]; n inline void writeChar(int x) { n if (write_buf_pos == buf_size) n fwrite(write_buf, 1, buf_size, stdout), write_buf_pos = 0; n write_buf[write_buf_pos++] = x; n } n inline void flush() { n if (write_buf_pos) n fwrite(write_buf, 1, write_buf_pos, stdout), write_buf_pos = 0; n } n template n inline void writeInt(T x, char end, int output_len) { n if (x < 0) writeChar( - ), x = -x; n char second[24]; n int n = 0; n while (x || !n) second[n++] = 0 + x % 10, x /= 10; n while (n < output_len) second[n++] = 0 ; n while (n--) writeChar(second[n]); n if (end) writeChar(end); n } n inline void writeWord(const char *second) { n while (*second) writeChar(*second++); n } n inline void writeDouble(double x, int output_len) { n if (x < 0) writeChar( - ), x = -x; n int t = (int)x; n writeInt(t), x -= t; n writeChar( . ); n for (int i = output_len - 1; i > 0; i--) { n x *= 10; n t = std::min(9, (int)x); n writeChar( 0 + t), x -= t; n } n x *= 10; n t = std::min(9, (int)(x + 0.5)); n writeChar( 0 + t); n } n const int MAXN = 3e5 + 42; n const int MOD = 1e9 + 7; n void solve() { n int n = readInt(); n vector> oper; n vector pos; n for (int i = 0; i < 2 * n; ++i) { n char c = readChar(); n if (false) cerr << c = << c << endl; n if (c == + ) { n oper.push_back({ + , 0}); n pos.push_back(oper.size() - 1); n continue; n } else { n int cost = readInt(); n oper.push_back({ - , cost}); n if (pos.empty()) { n writeWord( NO n ); n return; n } n int x = pos.back(); n if (false) cerr << x << endl; n pos.pop_back(); n oper[x].second = cost; n } n } n set have; n vector ans; n for (auto [op, c] : oper) { n if (false) cerr << op << << c << endl; n if (op == + ) { n have.insert(c); n ans.push_back(c); n } else { n auto u = *have.begin(); n if (u != c) { n writeWord( NO n ); n return; n } n have.erase(have.begin()); n } n } n writeWord( YES n ); n pv(ans); n } n signed main() { n init(); n init(); n solve(); n } n "} +{"func_code_string": "#include n using ull = unsigned long long; n using ll = long long; n using ld = long double; n using namespace std; n const ll mod = 998244353; n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n int n, m, k, t; n cin >> n >> k >> m >> t; n deque cur(n); n cur[k - 1] = 1; n while (t--) { n int f, pos; n cin >> f >> pos; n if (f == 1) { n cur.insert(cur.begin() + (pos - 1), 0); n for (int i = 0; i < ((int)(cur).size()); i++) { n if (cur[i]) { n cout << ((int)(cur).size()) << << i + 1 << n ; n break; n } n } n } else { n int loc = -1; n for (int i = 0; i < ((int)(cur).size()); i++) { n if (cur[i]) { n loc = i + 1; n break; n } n } n if (loc <= pos) n while (((int)(cur).size()) > pos) cur.pop_back(); n else n while (pos--) cur.pop_front(); n for (int i = 0; i < ((int)(cur).size()); i++) { n if (cur[i]) { n cout << ((int)(cur).size()) << << i + 1 << n ; n break; n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int maze[1500][1500]; n pair was[1500][1500]; n int n, m; n int sr, sc; n inline int rem(int x, int y) { n x %= y; n return (x < 0) ? x + y : x; n } n bool dfs(int r, int c) { n int rm = rem(r, n), cm = rem(c, m); n if (maze[rm][cm] == 1) { n return was[rm][cm] != pair(r, c); n } n int rmn, cmn; n if (maze[rm][cm] == 0) { n maze[rm][cm] = 1; n was[rm][cm] = pair(r, c); n rmn = rem(r, n), cmn = rem(c - 1, m); n if (maze[rmn][cmn] != -1 && dfs(r, c - 1)) return true; n rmn = rem(r, n), cmn = rem(c + 1, m); n if (maze[rmn][cmn] != -1 && dfs(r, c + 1)) return true; n rmn = rem(r + 1, n), cmn = rem(c, m); n if (maze[rmn][cmn] != -1 && dfs(r + 1, c)) return true; n rmn = rem(r - 1, n), cmn = rem(c, m); n if (maze[rmn][cmn] != -1 && dfs(r - 1, c)) return true; n } n return false; n } n void TheSolution(istream& input, ostream& output) { n input >> n >> m; n string s; n memset(maze, -1, sizeof(maze)); n for (int i = 0; i < n; i++) { n input >> s; n for (int j = 0; j < m; j++) { n if (s[j] == . ) maze[i][j] = 0; n if (s[j] == S ) { n sr = i; n sc = j; n maze[i][j] = 0; n } n was[i][j] = pair(-1000000, -1000000); n } n } n output << (dfs(sr, sc) ? Yes : No ); n } n int main() { n TheSolution(cin, cout); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n struct node { n int cnt; n node* bit[3]; n node() { n bit[0] = bit[1] = NULL; n cnt = 0; n } n }; n node* root; n void Insertt(int x) { n node* cur = root; n for (int i = 28; i >= 0; --i) { n if (cur->bit[(x >> i) & 1] == NULL) cur->bit[(x >> i) & 1] = new node(); n cur = cur->bit[(x >> i) & 1]; n ++(cur->cnt); n } n } n void Erasee(int x) { n node* cur = root; n for (int i = 28; i >= 0; --i) { n --(cur->bit[(x >> i) & 1]->cnt); n if (cur->bit[(x >> i) & 1]->cnt == 0) { n cur->bit[(x >> i) & 1] = NULL; n return; n } else n cur = cur->bit[(x >> i) & 1]; n } n } n int Query(int p, int l) { n int res = 0; n node* cur = root; n for (int i = 28; i >= 0; --i) { n if (((l >> i) & 1) == 0) { n if (cur->bit[(p >> i) & 1] != NULL) n cur = cur->bit[(p >> i) & 1]; n else n return res; n } else { n if (cur->bit[(p >> i) & 1] != NULL) res += cur->bit[(p >> i) & 1]->cnt; n if (cur->bit[(1 ^ ((p >> i) & 1))] != NULL) n cur = cur->bit[(1 ^ ((p >> i) & 1))]; n else n return res; n } n } n return res; n } n int main() { n scanf( %d , &n); n root = new node(); n for (int i = 1; i <= n; ++i) { n int type, p, l; n scanf( %d%d , &type, &p); n if (type == 1) Insertt(p); n if (type == 2) Erasee(p); n if (type == 3) { n scanf( %d , &l); n printf( %d n , Query(p, l)); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long labs(long long a) { return a < 0 ? (-a) : a; } n long long max(long long a, long long b) { return a > b ? a : b; } n long long min(long long a, long long b) { return a < b ? a : b; } n struct Fenwik { n vector t; n long long n; n void Init(long long nn) { n n = nn; n t.assign(n, 0); n } n long long Sum(long long r) { n long long result = 0; n for (; r >= 0; r = (r & (r + 1)) - 1) result += t[r]; n return result; n } n void Inc(long long i, long long delta) { n for (; i < n; i = (i | (i + 1))) t[i] += delta; n } n long long Sum(long long l, long long r) { return Sum(r) - Sum(l - 1); } n void Init(const vector& a) { n Init(a.size()); n for (int(i) = 0; (i) < (n); (i)++) Inc(i, a[i]); n } n }; n vector f; n vector g; n vector gn; n long long gs; n map > ids; n long long h, m, n; n long long gt; n long long F(long long x) { n long long pos = (gn[gt] + x) % gs; n long long sum = 0; n if (pos < gn[gt]) { n sum = f[g[gt]].Sum(gn[gt], gs - 1) + f[g[gt]].Sum(0, pos); n } else { n sum = f[g[gt]].Sum(gn[gt], pos); n } n return x + 1 - sum; n } n long long UpperBound(long long l, long long r, long long f) { n while (l < r) { n long long m = (l + r) / 2; n if (!(f < F(m))) { n l = m + 1; n } else { n r = m; n } n } n return l; n } n long long res = 0; n void Add(long long id, long long t) { n gt = t; n long long lb = UpperBound(0, gs - 1, 0); n res += lb; n long long gg = g[t]; n long long nn = (gn[t] + lb) % gs; n f[gg].Inc(nn, 1); n ids[id] = make_pair(gg, nn); n } n void Delete(long long id) { f[ids[id].first].Inc(ids[id].second, -1); } n int main() { n cin >> h >> m >> n; n g.resize(h, -1); n gn.resize(h, 0); n long long group = 0; n for (int(i) = 0; (i) < (h); (i)++) { n if (g[i] != -1) continue; n g[i] = group; n gs = 1; n for (long long j = 1; (i + j * m) % h != i; j++) { n g[(i + j * m) % h] = group; n gn[(i + j * m) % h] = j; n gs = j + 1; n } n group++; n } n f.resize(group); n for (int(i) = 0; (i) < (group); (i)++) { n f[i].Init(gs); n } n char c; n long long id; n long long t; n for (int(i) = 0; (i) < (n); (i)++) { n cin >> c >> id; n if (c == + ) { n cin >> t; n Add(id, t); n } else { n Delete(id); n } n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9 + 7; n const int MAXN = 1e6 + 7; n const double EPS = 1e-8; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long n, m; n cin >> n >> m; n vector cnt(m, 0); n long long d = n % m; n for (long long i = 0; i < m; i++) { n cnt[i * i % m] += n / m; n if (i && i <= d) { n cnt[i * i % m]++; n } n } n long long res = 0; n for (long long i = 0; i < m; i++) { n res += cnt[i] * cnt[(m - i) % m]; n } n cout << res; n } n "} +{"func_code_string": "#include n using namespace std; n char buffer[200]; n int main() { n int n; n string data; n while (scanf( %d , &n) != EOF) { n getchar(); n for (int i = 0; i < n; i++) { n gets(buffer); n data = string(buffer); n int firstM = data.find( miao. ); n int lastL = data.rfind( lala. ); n if (firstM != data.npos && n (lastL == data.npos || lastL != data.size() - 5) && firstM == 0) { n printf( Rainbow s n ); n } else if ((firstM == data.npos || firstM != 0) && lastL != data.npos && n lastL == data.size() - 5) { n printf( Freda s n ); n } else { n printf( OMG>.< I don t know! n ); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1e9 + 7; n const long double PI = 3.1415926535898; n const long long LLMAX = LLONG_MAX; n int a[(int)2e5 + 5], b[(int)2e5 + 5], c[(int)2e5 + 5]; n int n; n vector > v((int)2e5 + 5); n int type10 = 0; n int type01 = 0; n long long ans = 0; n int one[(int)2e5 + 5] = {0}; n int zero[(int)2e5 + 5] = {0}; n void solve(int parent, int node) { n if (b[node] != c[node]) { n if (b[node]) n one[node]++; n else n zero[node]++; n } n if (parent) a[node] = min(a[node], a[parent]); n for (int i = 0; i < v[node].size(); i++) { n if (v[node][i] == parent) n continue; n else { n solve(node, v[node][i]); n one[node] += one[v[node][i]]; n zero[node] += zero[v[node][i]]; n } n } n int dec = min(one[node], zero[node]); n one[node] -= dec; n zero[node] -= dec; n ans += (long long)a[node] * 2 * dec; n } n int main() { n int x, y; n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i] >> b[i] >> c[i]; n if (b[i] == 0 && c[i] == 1) n type01++; n else if (b[i] == 1 && c[i] == 0) n type10++; n } n for (int i = 1; i < n; i++) { n cin >> x >> y; n v[x].push_back(y); n v[y].push_back(x); n } n solve(0, 1); n if (type01 != type10) { n cout << -1 << n ; n } else { n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long a, b; n int main() { n cin >> a >> b; n long long ans = (b * (b - 1)) / 2; n ans %= 1000000007; n ans = n (a * ans + ((b * ans) % 1000000007) * ((a * (a + 1) / 2) % 1000000007)) % n 1000000007; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #define mp make_pair n #define fi first n #define se second n #define pb push_back n #define pf push_front n #define ppb pop_back n #define ppf pop_front n #define sz(v) (v).size() n #define all(v) (v).begin(),(v).end() n #define REP(i,a,b) for(int (i)=(a);(i)<(b);(i)++) n #define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++) n #define Time (double)clock()/CLOCKS_PER_SEC n typedef long long ll; n typedef unsigned long long ull; n typedef double db; n typedef long double ldb; n typedef pair pi; n template void chmax(T &x,T y) {x=x>y?x:y;return;} n template void chmin(T &x,T y) {x=x T sqr(T x) {return x*x;} n template T gcd(T x,T y) {return y==0?x:gcd(y,x%y);} n template T lcm(T x,T y) {return x/gcd(x,y)*y;} n const int inf=1000000000,mod=1000000007; n const ll infll=1000000000000000000ll,modll=ll(mod); n const db maxdb=db(infll),eps=1e-14,PI=acos(-1.0); n //#define mydef n //#define LOCAL n #ifdef mydef n #define foreach(v,it) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++) n #endif n #define debug n #define putnum(x) cout<<#x<< : < inline void read(T &x){ n T w=1;x=0;char c=getchar(); n while(c< 0 ||c> 9 ) {if(c== - )w=-1;c=getchar();} n while(c>= 0 &&c<= 9 ) {x=(x<<3)+(x<<1)+(c&15);c=getchar();} n x*=w; n } n template inline void write(T x) { n if(x<0) putchar( - ),x=~x+1; n if(x) write(x/10),putchar(x%10+ 0 ); n } n n const int maxn=200005; n int n; n ll sum[2],a[maxn]; n vector odd,even; n n void solve() { n odd.clear(); n even.clear(); n cin>>n; n for(int i=1;i<=n;i++) { n cin>>a[i]; n if(a[i]&1ll) odd.pb(a[i]); n else even.pb(a[i]); n } n sort(all(odd)); n sort(all(even)); n n sum[0]=sum[1]=0ll; n int p=0; n for(int i=0;iB) { n if(!p) sum[p]+=A; n even.ppb(); n } else { n if(p) sum[p]+=B; n odd.ppb(); n } n p^=1; n } n cout<<(sum[0]>sum[1]? Alice :(sum[0]==sum[1]? Tie : Bob ))<>T; n while(T--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using vi = vector; n using vpi = vector>; n using pi = pair; n const int nax = 1e5 + 7; n const int mod = 1e9 + 7; n const int inf = numeric_limits::max() - (int)9e6; n struct monotonic_queue { n queue qu; n deque mx, mn; n void push(int v) { n qu.push(v); n while (mx.size() && mx.back() < v) mx.pop_back(); n mx.push_back(v); n while (mn.size() && mn.back() > v) mn.pop_back(); n mn.push_back(v); n } n void pop() { n if (mx.front() == qu.front()) mx.pop_front(); n if (mn.front() == qu.front()) mn.pop_front(); n qu.pop(); n } n int front() const { return qu.front(); } n int max() const { return mx.front(); } n int min() const { return mn.front(); } n int size() const { return qu.size(); } n bool empty() { return qu.empty(); } n }; n int n; n void test() { n cin >> n; n int s, l; n cin >> s >> l; n vi v(n); n for (int i = 0; i < (int)n; i++) cin >> v[i]; n monotonic_queue q; n vi g(n, n); n for (int i = n - 1, j = n - 1; i >= 0; i--) { n while (j >= 0 and (q.empty() or (((q.max() - q.min()) <= s)))) { n q.push(v[j--]); n } n g[i] = (((q.max() - q.min()) <= s) ? j : j + 1); n if (((int)(q).size())) q.pop(); n } n while (((int)(q).size())) q.pop(); n vi dp(n + 1, inf); n dp[0] = 0; n for (int i = l, j = 0; i <= n; i++) { n q.push(dp[i - l]); n while (((int)(q).size()) and j <= g[i - 1]) q.pop(), j++; n if (((int)(q).size())) dp[i] = q.min() + 1; n } n cout << (dp[n] >= inf ? -1 : dp[n]); n } n signed main() { n ios_base ::sync_with_stdio(false); n cin.tie(NULL); n int T = 1; n while (T--) { n test(); n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 5; n int a[20]; n long long ans, p[] = {1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29}, limit = 1e18; n void dfs(int num, int len) { n if (num == 1) { n long long res = 1; n for (int i = 1; i <= len; ++i) { n for (int j = 1; j < a[i]; ++j) { n if (limit / p[i] <= res) { n return; n } n res *= p[i]; n } n } n ans = min(ans, res); n return; n } n for (int i = 2; i <= num; ++i) { n if (num % i == 0) { n a[len + 1] = i; n dfs(num / i, len + 1); n } n } n } n int main() { n int n; n cin >> n; n if (n == 1) { n cout << 1 << endl; n return 0; n } else if (n == 2) { n cout << 2 << endl; n return 0; n } n ans = limit; n for (int i = 1; i <= n; ++i) { n if (n % i == 0) { n a[1] = i; n dfs(n / i, 1); n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, T; n int l[200010], r[200010], s[200010], t[200010], id[200010]; n int f[1010][1010]; n int ans[200010]; n int x[200010], y[200010]; n inline int cmp(int x, int y) { return l[x] > l[y]; } n int main() { n scanf( %d%d%d , &n, &m, &T); n for (int i = 1; i <= m; i++) scanf( %d%d , &x[i], &y[i]); n for (int i = 1; i <= T; i++) n scanf( %d%d%d%d , &l[i], &r[i], &s[i], &t[i]), id[i] = i; n sort(id + 1, id + T + 1, cmp); n memset(f, 63, sizeof(f)); n int last = 1; n for (int i = m; i; i--) { n f[x[i]][y[i]] = f[y[i]][x[i]] = i; n for (int j = 1; j <= n; j++) { n f[x[i]][j] = min(f[x[i]][j], f[y[i]][j]); n f[y[i]][j] = min(f[y[i]][j], f[x[i]][j]); n } n while (last <= T && l[id[last]] == i) { n int u = id[last++]; n ans[u] = f[s[u]][t[u]] <= r[u]; n } n } n for (int i = 1; i <= T; i++) puts(ans[i] ? Yes : No ); n } n "} +{"func_code_string": "#include n using namespace std; n const long long oo = 0x3f3f3f3f3f3f3f3fLL; n struct Edge { n int u, v; n long long cap[2], flow; n }; n vector d, act; n bool bfs(int s, int t, vector>& adj, vector& E, n long long lim = 1) { n queue Q; n d = vector(adj.size(), -1); n d[t] = 0; n Q.push(t); n for (Q.push(t); Q.size() and d[s] == -1; Q.pop()) { n int u = Q.front(); n for (int i = (0); i < int(adj[u].size()); i++) { n int e = adj[u][i], v = (E[e].u ^ E[e].v ^ u); n if (((E[e].u == v) ? E[e].cap[0] - E[e].flow : E[e].cap[1] + E[e].flow) >= n lim and n d[v] == -1) { n d[v] = d[u] + 1; n Q.push(v); n } n } n } n return d[s] >= 0; n } n long long dfs(int u, int t, long long bot, vector>& adj, n vector& E) { n if (bot == 0) return 0; n if (u == t) return bot; n for (; act[u] < int(adj[u].size()); ++act[u]) { n int e = adj[u][act[u]]; n if (d[u] == d[(E[e].u ^ E[e].v ^ u)] + 1) { n long long inc = dfs((E[e].u ^ E[e].v ^ u), t, n min(bot, ((E[e].u == u) ? E[e].cap[0] - E[e].flow n : E[e].cap[1] + E[e].flow)), n adj, E); n if (inc) { n E[e].flow += ((E[e].u == u) ? (inc) : (-(inc))); n return inc; n } n } n } n return 0; n } n long long maxflow(int s, int t, vector>& adj, vector& E, n int F = 0) { n for (auto& e : E) e.flow = 0; n long long flow = 0, bot; n for (int lim = (1 << F); lim >= 1; lim >>= 1) { n while (bfs(s, t, adj, E, lim)) { n act = vector(adj.size(), 0); n while ((bot = dfs(s, t, oo, adj, E))) flow += bot; n } n } n return flow; n } n inline void addEdge(int x, int y, vector>& adj, vector& E, n long long c, long long rc = 0) { n Edge e; n e.u = x; n e.v = y; n e.flow = 0; n e.cap[0] = c; n e.cap[1] = rc; n adj[x].push_back(int((E).size())); n adj[y].push_back(int((E).size())); n E.push_back(e); n } n long long anss = 0; n void gomory_hu(vector>& adj, vector& E, vector& parent, n vector>& ans) { n int n = int((adj).size()); n parent.assign(n, 0); n ans.assign(n, vector(n, oo)); n for (int i = (1); i < int(n); i++) { n long long f = maxflow(i, parent[i], adj, E); n anss += f; n bfs(i, parent[i], adj, E); n for (int j = (i + 1); j < int(n); j++) n if (d[j] == -1 and parent[j] == parent[i]) parent[j] = i; n ans[i][parent[i]] = ans[parent[i]][i] = f; n for (int j = (0); j < int(i); j++) n ans[i][j] = ans[j][i] = min(f, ans[parent[i]][j]); n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n, m; n cin >> n >> m; n vector> adj(n); n vector E; n for (int i = (0); i < int(m); i++) { n int a, b, c; n cin >> a >> b >> c; n --a, --b; n addEdge(a, b, adj, E, c, c); n } n vector par; n vector> d; n gomory_hu(adj, E, par, d); n cout << anss << endl; n int best = 0; n vector res(n); n for (int i = 0; i < n; ++i) { n res[i] = i; n } n for (int i = 0; i < 1; ++i) { n vector order; n order.push_back(i); n vector used(n, 0); n used[i] = true; n int score = 0; n while (int((order).size()) != n) { n int best = -1, index = -1; n for (int j = 0; j < n; ++j) { n if (!used[j] && d[order.back()][j] > best) { n best = d[order.back()][j]; n index = j; n } n } n score += best; n order.push_back(index); n used[index] = true; n } n if (score > best) { n best = score; n res = order; n } n } n for (int i = 0; i < res.size(); ++i) { n printf( %d , res[i] + 1); n } n printf( n ); n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x3f3f3f3f; n const long long INF = 0x3f3f3f3f3f3f3f3fll; n const int maxn = 1000010; n const long long mod = 1e9 + 7; n char str1[maxn], str2[maxn]; n int ans[maxn]; n long long L1[maxn], R1[maxn], L2[maxn], R2[maxn]; n int main() { n while (scanf( %s , str1 + 1) != -1) { n scanf( %s , str2 + 1); n int len1 = strlen(str1 + 1); n int len2 = strlen(str2 + 1); n if (len1 - 1 != len2) { n printf( 0 n ); n continue; n } n L1[0] = 0; n L2[0] = 0; n R1[len1 + 1] = 0; n R2[len2 + 1] = 0; n for (int i = 1; i <= len1; i++) L1[i] = (L1[i - 1] * 26 + str1[i]) % mod; n for (int i = len1; i >= 1; i--) R1[i] = (R1[i + 1] * 26 + str1[i]) % mod; n for (int i = 1; i <= len2; i++) L2[i] = (L2[i - 1] * 26 + str2[i]) % mod; n for (int i = len2; i >= 1; i--) R2[i] = (R2[i + 1] * 26 + str2[i]) % mod; n int len = 0; n for (int i = 1; i <= len1; i++) { n if (L1[i - 1] == L2[i - 1] && R1[i + 1] == R2[i]) ans[len++] = i; n } n printf( %d n , len); n for (int i = 0; i < len; i++) { n if (i == len - 1) n printf( %d n , ans[i]); n else n printf( %d , ans[i]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } n const int MAXN = 100000; n const int MAXQ = 200000; n int nq; n int qkind[MAXQ], qx[MAXQ], qy[MAXQ], qans[MAXQ]; n int n; n map, int> mp; n int px[MAXN], py[MAXN], pl[MAXN], pr[MAXN]; n map> byrad; n map, vector>> matches; n map, vector>> singles; n map, vector> queries; n void run() { n scanf( %d , &nq); n for (int i = (0); i < (nq); ++i) scanf( %d%d%d , &qkind[i], &qx[i], &qy[i]); n n = 0; n mp.clear(); n for (int i = (0); i < (nq); ++i) { n if (qkind[i] == 1) { n int id = n++; n pair key = make_pair(qx[i], qy[i]); n assert(!mp.count(key)); n mp[key] = id; n px[id] = qx[i], py[id] = qy[i], pl[id] = i, pr[id] = -1; n } n if (qkind[i] == 2) { n pair key = make_pair(qx[i], qy[i]); n assert(mp.count(key)); n int id = mp[key]; n mp.erase(key); n pr[id] = i; n } n if (qkind[i] == 3) { n qans[i] = ((int)(mp).size()); n } n } n for (auto it = mp.begin(); it != mp.end(); ++it) { n int id = it->second; n pr[id] = nq; n } n mp.clear(); n for (int i = (0); i < (n); ++i) n byrad[(long long)px[i] * px[i] + (long long)py[i] * py[i]].push_back(i); n for (auto it = byrad.begin(); it != byrad.end(); ++it) { n vector lst = it->second; n for (int ii = (0); ii < (((int)(lst).size())); ++ii) n for (int jj = (ii + 1); jj < (((int)(lst).size())); ++jj) { n int i = lst[ii], j = lst[jj]; n int l = max(pl[i], pl[j]), r = min(pr[i], pr[j]); n if (l > r) continue; n assert(px[i] != px[j] || py[i] != py[j]); n int cx = px[i] + px[j], cy = py[i] + py[j], g = gcd(cx, cy); n cx /= g, cy /= g; n matches[make_pair(cx, cy)].push_back(make_pair(l, r)); n } n } n for (int i = (0); i < (n); ++i) { n int cx = px[i], cy = py[i], g = gcd(cx, cy); n cx /= g, cy /= g; n singles[make_pair(cx, cy)].push_back(make_pair(pl[i], pr[i])); n } n for (int i = (0); i < (nq); ++i) n if (qkind[i] == 3) { n int cx = qx[i], cy = qy[i], g = gcd(cx, cy); n cx /= g, cy /= g; n queries[make_pair(cx, cy)].push_back(i); n } n for (auto it = queries.begin(); it != queries.end(); ++it) { n vector cqueries = it->second; n vector> cmatches = matches[it->first]; n vector> csingles = singles[it->first]; n vector> evt; n for (int i = (0); i < (((int)(cmatches).size())); ++i) n evt.push_back(make_pair(cmatches[i].first, -2)), n evt.push_back(make_pair(cmatches[i].second + 1, +2)); n for (int i = (0); i < (((int)(csingles).size())); ++i) n evt.push_back(make_pair(csingles[i].first, -1)), n evt.push_back(make_pair(csingles[i].second + 1, +1)); n sort(cqueries.begin(), cqueries.end()); n sort(evt.begin(), evt.end()); n int at = 0, sum = 0; n for (int i = (0); i < (((int)(cqueries).size())); ++i) { n int id = cqueries[i]; n while (at < ((int)(evt).size()) && id >= evt[at].first) n sum += evt[at++].second; n qans[id] += sum; n } n } n for (int i = (0); i < (nq); ++i) n if (qkind[i] == 3) printf( %d n , qans[i]); n } n int main() { n run(); n return 0; n } n "} +{"func_code_string": "#include n int main(void) { n int i, j, k, m, n, max_length, length; n char string[101]; n for (n = 0, scanf( %s , string); string[n]; n++) n ; n for (m = 1, max_length = 0; m < n; m++) { n for (i = m - 1; i >= 0; i--) { n for (j = i, k = m, length = 0; k && string[j] == string[k]; n j--, k--, length++) n ; n if (max_length < length) { n max_length = length; n } n } n } n printf( %d , max_length); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int K; n cin >> K; n int sinir = 2 * K * K; n int primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 27, 31, 37, 39}; n set mynums; n int i; n for (i = 0; i < sizeof(primes) / sizeof(int); i++) { n mynums.clear(); n int t1 = 1, t2 = 1, t = 1; n for (int j = 0; j <= i; j++) t *= primes[j]; n for (int j = 0; j <= i / 4; j++) t1 *= primes[j] * primes[i - j]; n for (int j = i / 4 + 1; j < i - i / 4; j++) t2 *= primes[j]; n mynums.insert(t); n for (int y = 0; y < 30; y++) { n for (int j = 0; j <= i; j++) { n for (set::iterator it = mynums.begin(); it != mynums.end(); it++) { n if (*it * primes[j] <= sinir) { n mynums.insert(*it * primes[j]); n } n } n } n } n if (mynums.size() > K) break; n if (t1 > 1) mynums.insert(t1); n if (t2 > 1) mynums.insert(t2); n for (int y = 0; y < 30; y++) { n for (int j = 0; j <= i; j++) { n for (set::iterator it = mynums.begin(); it != mynums.end(); it++) { n if (*it * primes[j] <= sinir) { n mynums.insert(*it * primes[j]); n } n } n } n } n if (mynums.size() <= K / 2) continue; n if (mynums.size() > K) break; n } n set::iterator it = mynums.end(); n it--; n cout << *it; n i = 1; n for (it--; it != mynums.begin() && i < K; it--, i++) cout << << *it; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, k; n char s[504][504]; n int vis[504][504]; n vector > > v; n vector > ord; n int dx[] = {1, 0, -1, 0}; n int dy[] = {0, 1, 0, -1}; n void dfs(int x, int y) { n ord.push_back(make_pair(x, y)); n for (int i = 0; i < 4; i++) n if (x + dx[i] < n and y + dy[i] < m and x + dx[i] >= 0 and n y + dy[i] >= 0 and s[x + dx[i]][y + dy[i]] != # and n !vis[x + dx[i]][y + dy[i]]) { n vis[x + dx[i]][y + dy[i]] = 1; n dfs(x + dx[i], y + dy[i]); n } n } n int main() { n scanf( %d%d%d , &n, &m, &k); n for (int i = 0; i < n; i++) scanf( %s , &s[i]); n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) n if (s[i][j] == . ) v.push_back(make_pair( B , make_pair(i, j))); n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) n if (!vis[i][j] and s[i][j] != # ) { n ord.clear(); n vis[i][j] = 1; n dfs(i, j); n for (int k = ord.size() - 1; k >= 1; k--) { n v.push_back(make_pair( D , ord[k])); n v.push_back(make_pair( R , ord[k])); n } n } n printf( %d n , v.size()); n for (int i = 0; i < v.size(); i++) n printf( %c %d %d n , v[i].first, v[i].second.first + 1, n v[i].second.second + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n char S[110]; n scanf( %s , S); n int len = strlen(S); n sort(S, S + len); n for (int i = 0; i < len - 1; i++) { n if (S[i + 1] - S[i] != 1) { n printf( NO n ); n return; n } n } n printf( YES n ); n } n int main() { n int T; n scanf( %d , &T); n while (T--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int sqr(long long int x) { return x * x; } n inline long long int add(long long int a, long long int b) { n long long int c = a + b; n if (c >= 1000000007) c -= 1000000007; n return c; n } n inline long long int mul(long long int a, long long int b) { n return (a * 1ll * b) % 1000000007; n } n inline long long int sub(long long int a, long long int b) { n long long int c = a - b; n if (c < 0) c += 1000000007; n return c; n } n const int nax = 1000 * 1000 + 10; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n auto ok = [](vector &v, int pos) { n swap(v[pos + 1], v[pos + 2]); n swap(v[pos], v[pos + 1]); n }; n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n vector v(n); n vector> x(n); n for (int i = 0; i < n; ++i) { n cin >> v[i]; n x[i] = {v[i], i}; n } n sort(x.begin(), x.end()); n for (int i = 0; i < n; ++i) { n v[x[i].second] = i; n } n int cnt = 0; n for (int i = 0; i < n; ++i) { n for (int j = i + 1; j < n; ++j) { n cnt += (v[j] < v[i]); n } n } n if (cnt & 1) { n for (int i = 0; i < n - 1; ++i) { n if (x[i].first == x[i + 1].first) { n swap(v[x[i].second], v[x[i + 1].second]); n break; n } n } n } n vector ans; n for (int i = 0; i < n - 2; ++i) { n int pos = min_element(v.begin() + i, v.end()) - v.begin(); n while (pos > i + 1) { n ok(v, pos - 2); n ans.push_back(pos - 2); n pos -= 2; n } n if (pos != i) { n ok(v, i); n ok(v, i); n ans.push_back(i); n ans.push_back(i); n } n } n for (int i = 0; i < 3; ++i) { n if (is_sorted(v.begin(), v.end())) break; n ok(v, n - 3); n ans.push_back(n - 3); n } n if (!is_sorted(v.begin(), v.end())) { n cout << -1 << n ; n } else { n cout << ans.size() << n ; n for (int i = 0; i < ans.size(); ++i) cout << ans[i] + 1 << ; n cout << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n while (cin >> n) { n string str; n cin >> str; n bool flag = true; n if (n < 3) { n if (n == 1) { n if (str[0] == 1 ) n cout << Yes << endl; n else n cout << No << endl; n } else { n if (str != 00 && str != 11 ) n cout << Yes << endl; n else n cout << No << endl; n } n continue; n } n for (int i = 0; i < n - 2; i++) { n int ans = 0; n for (int j = i; j < i + 3; j++) { n ans += str[j] - 0 ; n } n if (ans == 1) n continue; n else if (ans == 0 || ans == 3) { n flag = false; n break; n } else { n if (str[i + 1] != 0 ) { n flag = false; n break; n } n } n } n if (str[0] == 0 && str[1] == 0 && str[2] == 1 ) flag = false; n if (str[n - 1] == 0 && str[n - 2] == 0 && str[n - 3] == 1 ) n flag = false; n if (flag) n cout << Yes << endl; n else n cout << No << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n struct SCC { n vector> minmax; n int size; n SCC(vector v) { n minmax.resize(v.size()); n for (int i = 0; i < (int)v.size(); i++) { n minmax[i].first = v[i]; n minmax[i].second = v[i]; n } n size = 1; n } n bool operator<(SCC const& other) const { n for (int i = 0; i < (int)minmax.size(); i++) { n if (other.minmax[i].first < minmax[i].second) return false; n } n return true; n } n }; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n, k; n cin >> n >> k; n set s; n for (int i = 0; i < n; i++) { n vector v(k); n for (int i = 0; i < k; i++) { n cin >> v[i]; n } n SCC scc(v); n auto a = s.lower_bound(scc); n auto b = s.upper_bound(scc); n if (a != b) { n auto x = a; n while (x != b) { n for (int K = 0; K < k; K++) { n scc.minmax[K].first = min(scc.minmax[K].first, x->minmax[K].first); n scc.minmax[K].second = max(scc.minmax[K].second, x->minmax[K].second); n } n scc.size += x->size; n x++; n } n s.erase(a, b); n } n s.insert(scc); n cout << s.rbegin()->size << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n struct he { n int ind; n int val; n he(int ind_ = 0, int val_ = 0) : ind(ind_), val(val_) {} n bool operator<(const he oth) const { return val > oth.val; } n }; n int n, m, k; n vector p[200200], c[200200]; n int minv[200200], maxv[200200]; n int np[200200], nc[200200]; n int ans[200200]; n queue q; n priority_queue d_cand, id_cand; n int main() { n cin >> n >> m >> k; n for (int i = 1; i <= n; ++i) { n int a; n cin >> a; n if (a == 0) { n minv[i] = 0; n maxv[i] = k + 1; n } else { n minv[i] = a; n maxv[i] = a; n } n } n for (int i = 0; i < m; ++i) { n int a, b; n cin >> a >> b; n p[b].push_back(a); n c[a].push_back(b); n } n for (int i = 1; i <= n; ++i) { n np[i] = p[i].size(); n if (np[i] == 0) { n maxv[i] = min(k, maxv[i]); n q.push(i); n } n } n int reached = 0; n while (!q.empty()) { n int ind = q.front(); n q.pop(); n ++reached; n for (int x : c[ind]) { n maxv[x] = min(maxv[x], maxv[ind] - 1); n --np[x]; n if (np[x] == 0) q.push(x); n } n } n if (reached < n) { n cout << -1 n ; n return 0; n } n for (int i = 1; i <= n; ++i) { n nc[i] = c[i].size(); n if (nc[i] == 0) { n id_cand.push(he(i, minv[i])); n } n } n for (int step = 1; step <= k; ++step) { n while (!id_cand.empty() && id_cand.top().val <= step) { n int x = id_cand.top().ind; n id_cand.pop(); n d_cand.push(he(x, maxv[x])); n } n if (d_cand.empty()) { n cout << -1 n ; n return 0; n } n int added = 0; n while (!d_cand.empty() && d_cand.top().val == step) { n ++added; n int x = d_cand.top().ind; n d_cand.pop(); n ans[x] = step; n for (int y : p[x]) { n --nc[y]; n minv[y] = max(minv[y], step + 1); n if (nc[y] == 0) { n id_cand.push(he(y, minv[y])); n } n } n } n if (added == 0) { n int x = d_cand.top().ind; n d_cand.pop(); n if (maxv[x] < step) { n cout << -1 n ; n return 0; n } n ans[x] = step; n for (int y : p[x]) { n --nc[y]; n minv[y] = max(minv[y], step + 1); n if (nc[y] == 0) { n id_cand.push(he(y, minv[y])); n } n } n } n } n for (int i = 1; i <= n; ++i) { n cout << ans[i] << ; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map mp; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int n; n cin >> n; n for (int i = 1; i <= n; i++) { n int num; n cin >> num; n mp[num]++; n } n if (mp.size() != 2) { n cout << NO ; n exit(0); n } n if (mp.begin()->second != mp.rbegin()->second) { n cout << NO ; n exit(0); n } n cout << YES n ; n cout << mp.begin()->first << << mp.rbegin()->first; n return 0; n } n "} +{"func_code_string": "#include n #include n #include n #include n #include n #include n #include n #include n #include n #define Quick ios::sync_with_stdio(false); cin.tie(0); cout.tie(0) n #define ll long long n #define INF 0x3f3f3f3f n #define PI acos(-1) n #define mem(a, b) memset(a, b, sizeof a) n using namespace std; n const int N = 1e6 + 3; n const int mod =1e9 + 7; n int a[N]; n ll dp[N]; n int vis[N]; n int tot = 0; n n int main() n { n Quick; n int n; cin >> n; n cout << (n - 1) % 9 + 1 << endl;; n } n n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 5; n int par[N], ran[N]; n struct DSU { n DSU() { n for (int i = 1; i < N; ++i) par[i] = i, ran[i] = 1; n } n int find(int x) { return par[x] == x ? x : par[x] = find(par[x]); } n bool unite(int a, int b) { n a = find(a), b = find(b); n if (a == b) return false; n ran[a] += ran[a] == ran[b]; n if (ran[a] < ran[b]) swap(a, b); n par[b] = a; n return true; n } n }; n int a[N]; n int n, q; n vector primes; n int spf[N]; n void sieve() { n for (int i = 2; i < N; ++i) { n if (spf[i] == 0) spf[i] = i, primes.push_back(i); n int sz = primes.size(); n for (int j = 0; j < sz && i * primes[j] < N && primes[j] <= spf[i]; ++j) { n spf[i * primes[j]] = primes[j]; n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n sieve(); n cin >> n >> q; n DSU ds; n for (int i = 1; i <= n; ++i) { n cin >> a[i]; n } n for (int i = 1; i <= n; ++i) { n int x = a[i]; n while (x > 1) { n ds.unite(spf[a[i]], spf[x]); n x /= spf[x]; n } n } n set> pary; n for (int i = 1; i <= n; ++i) { n int x = a[i]; n vector v; n while (x > 1) { n v.push_back(spf[x]); n x /= spf[x]; n } n x = a[i] + 1; n while (x > 1) { n v.push_back(spf[x]); n x /= spf[x]; n } n v.resize(unique(v.begin(), v.end()) - v.begin()); n for (auto &j : v) { n j = ds.find(j); n } n for (auto j : v) { n for (auto k : v) { n if (j < k) pary.insert({j, k}); n } n } n } n while (q--) { n int x, y; n cin >> x >> y; n x = spf[a[x]], y = spf[a[y]]; n if (ds.find(x) == ds.find(y)) n cout << 0 << endl; n else { n x = ds.find(x); n y = ds.find(y); n if (x > y) swap(x, y); n if (pary.count({x, y})) n cout << 1 << endl; n else n cout << 2 << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n template n T extgcd(T a, T b, T& x, T& y) { n for (T u = y = 1, v = x = 0; a;) { n T q = b / a; n swap(x -= q * u, u); n swap(y -= q * v, v); n swap(b -= q * a, a); n } n return b; n } n template n T mod_inv(T a, T m) { n T x, y; n extgcd(a, m, x, y); n return (m + x % m) % m; n } n long long mod_pow(long long a, long long n, long long mod) { n long long ret = 1; n long long p = a % mod; n while (n) { n if (n & 1) ret = ret * p % mod; n p = p * p % mod; n n >>= 1; n } n return ret; n } n template n class NTT { n public: n long long get_mod() const { return mod; } n void _ntt(vector& a, long long sign) { n const long long n = ((long long)(a).size()); n const long long g = primitive_root; n long long h = (long long)mod_pow(g, (mod - 1) / n, mod); n if (sign == -1) h = (long long)mod_inv(h, mod); n long long i = 0; n for (long long j = 1; j < n - 1; ++j) { n for (long long k = n >> 1; k > (i ^= k); k >>= 1) n ; n if (j < i) swap(a[i], a[j]); n } n for (long long m = 1; m < n; m *= 2) { n const long long m2 = 2 * m; n const long long base = mod_pow(h, n / m2, mod); n long long w = 1; n for (long long x = 0; x < (m); x++) { n for (long long s = x; s < n; s += m2) { n long long u = a[s]; n long long d = a[s + m] * w % mod; n a[s] = u + d; n if (a[s] >= mod) a[s] -= mod; n a[s + m] = u - d; n if (a[s + m] < 0) a[s + m] += mod; n } n w = w * base % mod; n } n } n for (auto& x : a) n if (x < 0) x += mod; n } n void ntt(vector& input) { _ntt(input, 1); } n void intt(vector& input) { n _ntt(input, -1); n const long long n_inv = mod_inv(((long long)(input).size()), mod); n for (auto& x : input) x = x * n_inv % mod; n } n vector convolution(const vector& a, n const vector& b) { n long long ntt_size = 1; n while (ntt_size < ((long long)(a).size()) + ((long long)(b).size())) n ntt_size *= 2; n vector _a = a, _b = b; n _a.resize(ntt_size); n _b.resize(ntt_size); n ntt(_a); n ntt(_b); n for (long long i = 0; i < (ntt_size); i++) { n (_a[i] *= _b[i]) %= mod; n } n intt(_a); n return _a; n } n vector powup(const vector& a, long long exponent) { n long long ntt_size = 1; n while (ntt_size < (((long long)(a).size()) * exponent)) ntt_size *= 2; n vector _a = a; n _a.resize(ntt_size); n ntt(_a); n for (long long i = 0; i < (ntt_size); i++) { n _a[i] = mod_pow(_a[i], exponent, mod); n } n intt(_a); n return _a; n } n }; n vector mul(vector a, vector b, long long mod) { n for (auto& x : a) x %= mod; n for (auto& x : b) x %= mod; n NTT<167772161, 3> ntt1; n NTT<469762049, 3> ntt2; n NTT<1224736769, 3> ntt3; n auto x = ntt1.convolution(a, b); n auto y = ntt2.convolution(a, b); n auto z = ntt3.convolution(a, b); n const long long m1 = ntt1.get_mod(), m2 = ntt2.get_mod(), m3 = ntt3.get_mod(); n const long long m1_inv_m2 = mod_inv(m1, m2); n const long long m12_inv_m3 = mod_inv(m1 * m2, m3); n const long long m12_mod = m1 * m2 % mod; n vector ret(((long long)(x).size())); n for (long long i = 0; i < (((long long)(x).size())); i++) { n long long v1 = (y[i] - x[i]) * m1_inv_m2 % m2; n if (v1 < 0) v1 += m2; n long long v2 = (z[i] - (x[i] + m1 * v1) % m3) * m12_inv_m3 % m3; n if (v2 < 0) v2 += m3; n long long constants3 = (x[i] + m1 * v1 + m12_mod * v2) % mod; n if (constants3 < 0) constants3 += mod; n ret[i] = constants3; n } n return ret; n } n vector exppoly(vector base, long long e, long long mod) { n vector ans = {1}; n while (e > 0) { n if (e % 2 == 1) { n ans = mul(ans, base, mod); n e--; n } else { n base = mul(base, base, mod); n e /= 2; n } n } n return ans; n } n const long long MOD = 1000000007LL; n int main() { n ios_base::sync_with_stdio(false); n long long a, b, k, t; n cin >> a >> b >> k >> t; n vector v; n for (long long x = 0; x < 2 * k + 1; x++) v.push_back(1); n vector got = exppoly(v, t, MOD); n long long len = got.size(); n vector suf = got; n for (long long x = len - 2; x >= 0; x--) suf[x] = (suf[x] + suf[x + 1]) % MOD; n long long ans = 0; n for (long long x = 0; x < len; x++) { n long long me = b + x; n long long youneed = max(0LL, me + 1 - a); n if (youneed >= len) continue; n ans += (got[x] * suf[youneed]); n ans %= MOD; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n bool dp[505][505]; n int c[505]; n int N, K, a[505], b[505]; n long long s1, s2; n int main() { n ios::sync_with_stdio(false); n cin >> N >> K; n for (int i = 1; i <= N; ++i) cin >> a[i] >> b[i], s1 += a[i], s2 += b[i]; n dp[0][0] = 1; n for (int i = 0; i < N; ++i) { n for (int j = 0; j < K; ++j) c[j] = 0, dp[i + 1][j] = dp[i][j]; n if (a[i + 1] + b[i + 1] >= K) n for (int j = 0; j < K; ++j) { n if (!dp[i][j]) continue; n int l, r; n l = max(1, K - b[i + 1]); n r = min(K - 1, a[i + 1]); n if (l <= r) { n int St, Ed; n St = j + l; n Ed = j + r; n St %= K; n Ed %= K; n c[St]++; n if (Ed >= St) { n c[Ed + 1]--; n } else { n c[0]++; n c[Ed + 1]--; n } n } n } n for (int j = 0; j < K; ++j) { n if (j) c[j] += c[j - 1]; n dp[i + 1][j] |= c[j]; n } n } n long long res = 0; n for (int j = 0; j < K; ++j) { n if (!dp[N][j]) continue; n long long l1, l2; n l1 = s1, l2 = s2; n l1 -= j; n l2 -= (K - j) % K; n long long cur = bool(j) + (l1 / K) + (l2 / K); n res = max(res, cur); n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char ch; n int n, cnt = 0; n long long x, a; n scanf( %d%I64d , &n, &x); n for (int i = 0; i < n; i++) { n while (isspace(ch = getchar())) n ; n scanf( %I64d , &a); n if (ch == + ) n x += a; n else { n if (x < a) n cnt++; n else n x -= a; n } n } n cout << x << << cnt << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[100009]; n int main() { n cin >> n; n if (n == 1) n cout << 1; n else if ((n / 2) % 2 == 1) n cout << -1; n else { n for (int i = 1; i <= (n / 2 / 2); i++) { n a[i * 2 - 1] = i * 2; n a[i * 2] = n - (i - 1) * 2; n a[n - i * 2 + 1] = i * 2 - 1; n a[n - (i - 1) * 2] = n - (i - 1) * 2 - 1; n if (n % 2 == 1) a[n / 2 + 1] = n / 2 + 1; n } n for (int i = 1; i <= n; i++) cout << a[i] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 200005; n int cnt[N]; n int n, k; n int cut[N]; n vector > arr; n struct Sub { n bool operator()(pair > a, pair > b) { n if (a.first != b.first) n return a.first < b.first; n else n return (cnt[a.second.second] / (a.second.first + 1)) < n (cnt[b.second.second] / (b.second.first + 1)); n } n }; n bool ForSort(pair a, pair b) { return a.first > b.first; } n int main() { n scanf( %d%d , &n, &k); n int tx; n for (int i = 1; i <= n; i++) scanf( %d , &tx), cnt[tx]++; n for (int i = 1; i <= 200000; i++) n if (cnt[i] > 0) arr.push_back({cnt[i], i}); n sort(arr.begin(), arr.end(), ForSort); n priority_queue >, n vector > >, Sub> n pq; n int len = 1, ex = arr[0].first; n cut[arr[0].second] = 1; n cout << arr[0].second << ; n pq.push(pair >(arr[0].first, n pair(1, arr[0].second))); n int i = 1; n pair > u = n pair >(2, pair(10, 1)); n pair > v = n pair >(2, pair(4, 2)); n while (len < k) { n pair > u = pq.top(); n if (i >= arr.size()) { n if (cut[u.second.second] + 1 <= cnt[u.second.second]) { n len++; n cut[u.second.second] = u.second.first + 1; n pq.pop(); n cout << u.second.second << ; n pq.push(pair >( n cnt[u.second.second] / (u.second.first + 1), n pair(u.second.first + 1, u.second.second))); n } else n pq.pop(); n } else { n if (u.second.first + 1 <= cnt[u.second.second] && n cnt[u.second.second] / (u.second.first + 1) > arr[i].first) { n cut[u.second.second] = u.second.first + 1; n cout << u.second.second << ; n len++; n pq.pop(); n pq.push(pair >( n cnt[u.second.second] / (u.second.first + 1), n pair(u.second.first + 1, u.second.second))); n } else { n ex = min(ex, arr[i].first); n cut[arr[i].second] = 1; n cout << arr[i].second << ; n len++; n pq.push(pair >(arr[i].first, n pair(1, arr[i].second))); n i++; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 300010; n long long n, a[N], t; n map vis; n int solve() { n scanf( %lld , &t); n while (t--) { n scanf( %lld , &n); n vis.clear(); n bool imp = 0; n for (int i = 1; i <= n; i++) { n scanf( %lld , &a[i]); n long long nw = (i + a[i]) % n; n if (nw < 0) nw += n; n if (vis[nw]) { n imp = 1; n } n vis[nw] = 1; n } n if (imp) n printf( NO n ); n else n printf( YES n ); n } n return 0; n } n int main() { return solve(); } n "} +{"func_code_string": "#include n using namespace std; n void file() {} n void fast() { n std::ios_base::sync_with_stdio(0); n cin.tie(NULL); n } n const int N = 510 + 20; n const double PI = acos(-1.0); n bool cmp(complex a, complex b) { n if (a.real() == b.real()) return a.imag() < b.imag(); n return a.real() < b.real(); n } n bool cmp_doub(double a, double b) { n if (fabs(a - b) <= 1e-9) { n return 1; n } n return 0; n } n bool is_correct(complex p1, complex p2, complex p3, n complex p4) { n vector dists; n double dist1 = (hypot((p1 - p2).imag(), (p1 - p2).real())); n double dist2 = (hypot((p2 - p4).imag(), (p2 - p4).real())); n double dist3 = (hypot((p3 - p4).imag(), (p3 - p4).real())); n double dist4 = (hypot((p3 - p1).imag(), (p3 - p1).real())); n double dist5 = (hypot((p2 - p3).imag(), (p2 - p3).real())); n double dist6 = (hypot((p1 - p4).imag(), (p1 - p4).real())); n dists.push_back(dist1); n dists.push_back(dist2); n dists.push_back(dist3); n dists.push_back(dist4); n dists.push_back(dist5); n dists.push_back(dist6); n sort(((dists).begin()), ((dists).end())); n if (dists[0] > 0 && cmp_doub(dists[0], dists[1]) && n cmp_doub(dists[1], dists[2]) && cmp_doub(dists[2], dists[3]) && n cmp_doub(dists[3], dists[2])) { n if (cmp_doub(dists[4], dists[5]) && !cmp_doub(dists[5], dists[0])) { n return 1; n } n } n return 0; n } n complex rotate(complex a, complex b, int c) { n for (int i = 0; i < c; i++) { n a = (((((a) - (b))) * exp(complex(0, PI / 2.0))) + b); n } n return a; n } n int main() { n file(); n fast(); n int n; n cin >> n; n for (int i = 0; i < n; i++) { n vector, complex>> points; n for (int j = 0; j < 4; j++) { n int x, y, z, m; n cin >> x >> y >> z >> m; n points.push_back({complex(x, y), complex(z, m)}); n } n int ans = 1e9; n for (int j1 = 0; j1 < 4; j1++) { n for (int j2 = 0; j2 < 4; j2++) { n for (int j3 = 0; j3 < 4; j3++) { n for (int j4 = 0; j4 < 4; j4++) { n vector> points1(4); n points1[0] = rotate(points[0].first, points[0].second, j1); n points1[1] = rotate(points[1].first, points[1].second, j2); n points1[2] = rotate(points[2].first, points[2].second, j3); n points1[3] = rotate(points[3].first, points[3].second, j4); n if (is_correct(points1[0], points1[1], points1[2], points1[3])) { n ans = min(ans, j1 + j2 + j3 + j4); n } n } n } n } n } n if (ans == 1e9) ans = -1; n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int a[300001]; n const long long mod = 1000000007; n int main(int argc, const char* argv[]) { n string S; n cin >> S; n int n = (int)S.size(); n string A(n, 2 ); n int scr = 0; n for (int i = 0; i < n; ++i) { n char a = S[(i + n - 1) % n]; n char b = S[i]; n char c = S[(i + 1) % n]; n if (a == b && b == c) n A[i] = 0 ; n else if (a == b && b != c) { n ++scr; n A[i] = 1 ; n A[(i + 1) % n] = 0 ; n } else if (a != b && b == c) n A[i] = 0 ; n } n int fst = 0; n while (fst < n && !(A[fst] != 2 && A[(fst + 1) % n] == 2 )) ++fst; n if (fst == n) { n if (A[0] == 2 ) n cout << n / 2 << endl; n else n cout << scr << endl; n return 0; n } n int j = 0; n for (int i = 0; i < n; ++i) { n char a = A[(i + fst) % n]; n char b = A[(i + fst + 1) % n]; n if (a == 2 && b != 2 ) { n scr += (i - j + 1) / 2; n } n if (a != 2 && b == 2 ) j = i; n } n cout << scr << endl; n } n "} +{"func_code_string": "#include n using namespace std; n string s; n int main() { n int n, a, b, k; n scanf( %d%d%d%d , &n, &a, &b, &k); n int tot = 0; n cin >> s; n int prev = -1; n for (int i = 0; i < n; i++) n if (s[i] == 1 ) { n tot += (i - prev - 1) / b; n prev = i; n } n tot += (n - prev - 1) / b; n int ans = tot - a + 1; n printf( %d n , ans); n int cnt = 0; n for (int i = 0; i < n; i++) { n if (s[i] == 1 ) { n cnt = 0; n } else { n cnt++; n } n if (cnt == b && ans) { n ans--; n printf( %d , i + 1); n cnt = 0; n } n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n typedef long long ll; n typedef unsigned long long ull; n const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; n const int inf = 0x3f3f3f3f; n const ll linf = 0x3f3f3f3f3f3f3f3f; n const ll mod = 1e9 + 7; n //const ll mod = 998244353; n n ll ksm(ll x,ll k) { n ll ret=1; n while(k) { n if(k&1) ret=ret*x%mod; n x=x*x%mod,k>>=1; n } n return ret; n } n n ll prime[10000005],pcnt,phi[10000005]; n bool mark[10000005]; n inline void pre(ll n) { n mark[1]=1; n for(ll i=2;i<=n;i++) { n if(!mark[i]) prime[++pcnt]=i/*,phi[i]=i-1*/; n for(ll j=1;j<=pcnt;j++) { n ll k=i*prime[j]; n if(k>n) break; n mark[k]=1; n if(i%prime[j]==0) { n // phi[k]=phi[i]*prime[j]; n break; n } n // else phi[k]=phi[i]*(prime[j]-1); n } n } n } n n struct data { n int u,v,val; n data(int _u=0,int _v=0,int _val=0):u(_u),v(_v),val(_val) {} n bool operator < (const data &x) const { n if(val==x.val) return u u,v; n n int getfa(int x) { n return x==fa[x] ? x:fa[x]=getfa(fa[x]); n } n n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int T=1; n // cin>>T; n while(T--) { n int n; cin>>n; n for(int i=1;i<=n*n;i++) fa[i]=i; n int cnt=0; n for(int i=1;i<=n;i++) { n for(int j=1;j<=n;j++) { n int x; cin>>x; n if(i==j) c[i]=x; n if(i>=j) continue; n a[++cnt]=data(i,j,x); n } n } n sort(a+1,a+cnt+1); n int k=n; n for(int i=1;i<=cnt;i++) { n int fu=getfa(a[i].u),fv=getfa(a[i].v); n if(fu==fv) continue; n if(fu>n && c[fu]==a[i].val) { n fa[fv]=fu,u.push_back(fv),v.push_back(fu); n continue; n } n if(fv>n && c[fv]==a[i].val) { n fa[fu]=fv,u.push_back(fu),v.push_back(fv); n continue; n } n k++; n fa[fu]=fa[fv]=k; n c[k]=a[i].val; n u.push_back(fu),v.push_back(k); n u.push_back(fv),v.push_back(k); n } n cout< n using namespace std; n int gcd(int a, int b); n bool prime(int n); n long long sumdigit(long long n); n bool ispowerof2(int n); n long long onesinbinary(long long n); n long long power(long long a, long long b); n bool cmp(pair x, pair y) { return x.second < y.second; } n bool cmp(int x, int y) { return x > y; } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n long long t; n cin >> t; n while (t--) { n int n; n cin >> n; n char arr[2][n]; n for (int i = 0; i < 2; i++) { n for (int j = 0; j < n; j++) { n cin >> arr[i][j]; n } n } n int ans = 0; n vector v; n for (int i = 0; i < n; i++) { n if (arr[0][i] == 0 && arr[1][i] == 0 ) n ans++; n else if (arr[0][i] == 0 || arr[1][i] == 0 ) n ans += 2; n else { n v.push_back(i); n } n } n int x = v.size(); n for (int i = 0; i < x; i++) { n if (v[i] < n - 1 && v[i] > 0) { n if (arr[0][v[i] - 1] == 0 && arr[1][v[i] - 1] == 0 ) { n ans++; n } else if (arr[0][v[i] + 1] == 0 && arr[1][v[i] + 1] == 0 ) { n ans++; n arr[0][v[i] + 1] = 1 , arr[1][v[i] + 1] = 1 ; n } n } else if (v[i] == n - 1) { n if (arr[0][v[i] - 1] == 0 && arr[1][v[i] - 1] == 0 ) { n ans++; n } n } else if (v[i] == 0) { n if (arr[0][v[i] + 1] == 0 && arr[1][v[i] + 1] == 0 ) { n ans++; n arr[0][v[i] + 1] = 1 , arr[1][v[i] + 1] = 1 ; n } n } n } n cout << ans << endl; n } n return 0; n } n long long onesinbinary(long long n) { n long long cnt = 0; n while (n) { n n = n & (n - 1); n cnt++; n } n return cnt; n } n int gcd(int a, int b) { n if (b == 0) return a; n return gcd(b, a % b); n } n bool prime(int n) { n for (int i = 2; i * i <= n; i++) n if (n % i == 0) return false; n return true; n } n long long sumdigit(long long n) { n int c = 0; n while (n > 0) { n c += n % 10; n n /= 10; n } n return c; n } n bool ispowerof2(int n) { n if (n == 0) return false; n return (!(n & ((n) & (n - 1)))); n } n long long power(long long a, long long b) { n if (b == 0) return 1; n long long res = 1; n while (b) { n if (b % 2 == 1) res = (res * a) % 1000000007; n a = (a * a) % 1000000007; n b /= 2; n } n return res; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int p, c = 0; n cin >> p; n long long int x = p; n long long int n = std::numeric_limits::digits - 1; n std::string s; n s.reserve(n + 1); n do s.push_back(((x >> n) & 1) + 0 ); n while (--n > -1); n for (auto x : s) n if (x == 1 ) c++; n cout << c; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Str { n int l; n char *s; n } str[50010 << 2]; n int tot; n char s[3100000]; n int k; n int n, l[50010], r[50010]; n char ans[3100000]; n int cut(int pos) { n for (int i = 0; i < tot; i++) n if (pos == 0) { n tot++; n for (int k = tot - 1; k > i; k--) str[k] = str[k - 1]; n return i; n } else if (str[i].l <= pos) n pos -= str[i].l; n else { n tot += 2; n for (int k = tot - 1; k > i + 1; k--) str[k] = str[k - 2]; n str[i + 2].l = str[i].l - pos; n str[i + 2].s = str[i].s + pos; n str[i].l = pos; n return i + 1; n } n return tot++; n } n void getans(int h, int t) { n int l = 0; n for (int i = 0; t >= 0 && i < tot; i++) n if (str[i].l <= h) { n h -= str[i].l; n t -= str[i].l; n } else { n for (int k = max(0, h); k < str[i].l && k <= t; k++) n ans[l++] = str[i].s[k]; n int tmp = min(str[i].l, t); n h -= tmp; n t -= tmp; n } n } n void deal(int d, int len) { n if (d < 0) { n Str tmp; n tmp.l = len; n tmp.s = s + 1; n str[tot++] = tmp; n return; n } n if (r[d] >= len) { n deal(d - 1, len); n return; n } n int c = r[d] - l[d] + 1; n if (r[d] + c >= len) { n deal(d - 1, r[d]); n Str tmp; n tmp.l = len - r[d]; n tmp.s = new char[len - r[d]]; n int c_2 = c / 2; n int D = (tmp.l >= c_2) ? c : (tmp.l * 2); n getans(l[d], l[d] + D - 1); n for (int i = 0; i < tmp.l; i++) n if (i < c_2) n tmp.s[i] = ans[i * 2 + 1]; n else n tmp.s[i] = ans[(i - c_2) << 1]; n str[tot++] = tmp; n } else { n deal(d - 1, len - c); n int pos = cut(r[d] + 1); n Str tmp; n tmp.l = c; n tmp.s = new char[c]; n int c_2 = c / 2; n getans(l[d], r[d]); n for (int i = 0; i < c; i++) n if (i < c_2) n tmp.s[i] = ans[i * 2 + 1]; n else n tmp.s[i] = ans[(i - c_2) << 1]; n str[pos] = tmp; n } n } n int main() { n scanf( %s , s + 1); n scanf( %d , &k); n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %d%d , &l[i], &r[i]); n tot = 1; n str[0].l = 1; n str[0].s = new char[1]; n str[0].s[0] = ; n deal(n - 1, k); n getans(0, k); n ans[k + 1] = 0; n printf( %s n , ans + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long L[100005], R[100005], odd[100005], s[100005], dp[100005], ans = 0; n int n; n int main() { n scanf( %d , &n); n for (int i = 1; i < n; i++) scanf( %I64d , &s[i]); n L[0] = 0; n for (int i = 1; i < n; i++) { n if (s[i] == 1) n L[i] = 0; n else n L[i] = L[i - 1] + s[i] / 2 * 2; n } n R[n - 1] = 0; n for (int i = n - 2; i >= 0; i--) { n if (s[i + 1] == 1) n R[i] = 0; n else n R[i] = R[i + 1] + s[i + 1] / 2 * 2; n } n dp[0] = 0; n for (int i = 1; i < n; i++) { n dp[i] = max(dp[i - 1] + (s[i] - 1) / 2 * 2 + 1, L[i]); n } n for (int i = 0; i < n; i++) { n ans = max(ans, dp[i] + R[i]); n } n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n while (cin >> n) { n long long i = 5, cnt = 1, x, ans = 0, y, z = 5, m; n if (n < 5 || n == 5) { n if (n == 1) n cout << Sheldon << endl; n else if (n == 2) n cout << Leonard << endl; n else if (n == 3) n cout << Penny << endl; n else if (n == 4) n cout << Rajesh << endl; n else if (n == 5) n cout << Howard << endl; n continue; n } n while (i < n || i == n) { n x = i; n if (i == n) { n x = 0; n break; n } else { n z += z; n i += z; n } n cnt = cnt * 2; n } n if (x == 0) n cout << Howard << endl; n else { n y = n - x; n if (y < 1) y *= -1; n ans = y / cnt; n ans++; n if (y % cnt == 0) ans--; n if (ans == 1) n cout << Sheldon << endl; n else if (ans == 2) n cout << Leonard << endl; n else if (ans == 3) n cout << Penny << endl; n else if (ans == 4) n cout << Rajesh << endl; n else if (ans == 5) n cout << Howard << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int modd = 998244353; n const int maxn = 2000 + 10; n int n, k; n long long dp[maxn][maxn][4]; n void solve() { n dp[1][1][0] = dp[1][1][3] = 1; n dp[1][2][1] = dp[1][2][2] = 1; n for (int i = 2; i <= n; i++) { n dp[i][1][0] = dp[i][1][3] = 1; n dp[i][1][1] = dp[i][1][2] = 0; n for (int j = 2; j <= k; j++) { n dp[i][j][0] = (dp[i - 1][j][0] % modd + dp[i - 1][j][1] % modd + n dp[i - 1][j][2] % modd + dp[i - 1][j - 1][3] % modd) % n modd; n dp[i][j][1] = (dp[i - 1][j - 1][0] % modd + dp[i - 1][j][1] % modd + n dp[i - 1][j - 2][2] % modd + dp[i - 1][j - 1][3] % modd) % n modd; n dp[i][j][2] = (dp[i - 1][j - 1][0] % modd + dp[i - 1][j - 2][1] % modd + n dp[i - 1][j][2] % modd + dp[i - 1][j - 1][3] % modd) % n modd; n dp[i][j][3] = (dp[i - 1][j - 1][0] % modd + dp[i - 1][j][1] % modd + n dp[i - 1][j][2] % modd + dp[i - 1][j][3] % modd) % n modd; n } n } n } n int main() { n cin >> n >> k; n solve(); n cout << (dp[n][k][0] % modd + dp[n][k][1] % modd + dp[n][k][2] % modd + n dp[n][k][3] % modd) % n modd n << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 300010; n int ans[N], vis[N]; n vector G[N], s[N], tmp; n void dfs(int u, int fa) { n int sz = s[u].size(); n for (int i = 1; i <= sz; i++) vis[i] = 0; n for (int j : s[u]) { n if (ans[j] && ans[j] <= sz) vis[ans[j]] = 1; n } n for (int j = 1; j <= sz; j++) { n if (!vis[j]) tmp.push_back(j); n } n int cur = 0; n for (int j : s[u]) { n if (!ans[j]) ans[j] = tmp[cur++]; n } n tmp.clear(); n for (int v : G[u]) { n if (v == fa) continue; n dfs(v, u); n } n } n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) { n int cnt; n scanf( %d , &cnt); n for (int j = 1; j <= cnt; j++) { n int x; n scanf( %d , &x); n s[i].push_back(x); n } n } n for (int i = 1; i <= n - 1; i++) { n int u, v; n scanf( %d%d , &u, &v); n G[u].push_back(v); n G[v].push_back(u); n } n dfs(1, 0); n int mx = 0; n for (int i = 1; i <= m; i++) { n if (!ans[i]) ans[i] = 1; n mx = max(mx, ans[i]); n } n printf( %d n , mx); n for (int i = 1; i <= m; i++) printf( %d , ans[i]); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long Time = 12622780800ll; n int i, j, k, n, ch, s, m, h, day, date, month, Fg; n long long t; n struct cc { n int s, m, h, day, date, month, year; n int Js() { n if (month == 4 || month == 6 || month == 9 || month == 11) return 30; n if (month != 2) return 31; n if (year % 400 == 0 || (year % 100 && year % 4 == 0)) return 29; n return 28; n } n int count() { n if (year % 400 == 0 || (year % 100 && year % 4 == 0)) return 366; n return 365; n } n void work() { n if (s == 60) { n s = 0; n m++; n } n if (m == 60) { n h++; n m = 0; n } n if (h == 24) { n date++; n day = day % 7 + 1; n h = 0; n } n if (date == Js() + 1) { n month++; n date = 1; n } n if (month == 13) { n year++; n month = 1; n } n } n void operator+=(const long long &ad) { n long long a = ad; n while (s && a) { n a--; n if (++s == 60) work(); n } n while (m && a >= 60) { n a -= 60; n if (++m == 60) work(); n } n while (h && a >= 3600) { n a -= 3600; n if (++h == 24) work(); n } n while (date != 1 && a >= 86400) { n a -= 86400; n day = day % 7 + 1; n if (++date == Js() + 1) work(); n } n while (month != 1 && a >= Js() * 86400) { n a -= Js() * 86400; n day = (day + Js() - 1) % 7 + 1; n if (++month == 13) work(); n } n while (year % 400 && a >= count() * 86400) { n a -= count() * 86400; n day = (day + count() - 1) % 7 + 1; n year++; n } n year += (a / Time) * 400; n a %= Time; n while (a >= count() * 86400) { n a -= count() * 86400; n day = (day + count() - 1) % 7 + 1; n year++; n } n while (a >= Js() * 86400) { n a -= Js() * 86400; n day = (day + Js() - 1) % 7 + 1; n if (++month == 13) work(); n } n while (a >= 86400) { n a -= 86400; n day = day % 7 + 1; n if (++date == Js() + 1) work(); n } n while (a >= 3600) { n a -= 3600; n if (++h == 24) work(); n } n while (a >= 60) { n a -= 60; n if (++m == 60) work(); n } n while (a) { n a--; n if (++s == 60) work(); n } n } n } a; n void R(long long &x) { n x = 0; n ch = getchar(); n while (ch < 0 || 9 < ch) ch = getchar(); n while ( 0 <= ch && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); n } n void W(long long x) { n if (x >= 10) W(x / 10); n putchar(x % 10 + 0 ); n } n bool check() { n if (month == -1 || month == a.month) n if ((day == -1 && date == -1) || (day == a.day || date == a.date)) n if (h == -1 || h == a.h) n if (m == -1 || m == a.m) n if (s == -1 || s == a.s) return 1; n return 0; n } n int main() { n scanf( %d%d%d%d%d%d , &s, &m, &h, &day, &date, &month); n scanf( %d , &n); n for (i = 1; i <= n; i++) { n R(t); n t++; n Fg = 0; n a.s = a.m = a.h = 0; n a.day = 4; n a.date = a.month = 1; n a.year = 1970; n a += t; n while (a.s && !check()) { n t++; n if (++a.s == 60) a.work(); n } n while (s != -1 && a.s != s) { n t++; n a.s++; n } n while (a.m && !check()) { n t += 60; n if (++a.m == 60) a.work(); n } n while (m != -1 && a.m != m) { n t += 60; n a.m++; n } n while (a.h && !check()) { n t += 3600; n if (++a.h == 24) a.work(); n } n while (h != -1 && a.h != h) { n t += 3600; n a.h++; n } n while (!check()) { n t += 86400; n a.day = a.day % 7 + 1; n a.date++; n a.work(); n } n W(t); n puts( ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n while (cin >> n) { n if (n == 1 || n == 2) n cout << -1 n ; n else if (n == 3) n cout << 210 n ; n else { n if (n % 6 == 1) { n cout << 1 ; n for (int i = 3; i < n; i++) cout << 0 ; n cout << 20 n ; n } n if (n % 6 == 2) { n cout << 1 ; n for (int i = 3; i < n - 1; i++) cout << 0 ; n cout << 200 n ; n } n if (n % 6 == 3) { n cout << 1 ; n for (int i = 3; i < n - 1; i++) cout << 0 ; n cout << 110 n ; n } n if (n % 6 == 4) { n cout << 1 ; n for (int i = 3; i < n; i++) cout << 0 ; n cout << 50 n ; n } n if (n % 6 == 5) { n cout << 1 ; n for (int i = 3; i < n; i++) cout << 0 ; n cout << 80 n ; n } n if (n % 6 == 0) { n cout << 1 ; n for (int i = 3; i < n - 1; i++) cout << 0 ; n cout << 170 n ; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool ok[100005]; n typedef long long int ll; n int gcd(int a ,int b) n { n if(b==0) n return a; n else if(a==0) n return a; n else n n return gcd(b,a%b); n } n int main() n { n int n; n cin>>n; n ll prod=1; n for(int i=1;i n using namespace std; n int inf = 1000000000, mxx, mxy, mnx = inf, mny = inf, n, m, i, j, r = 0, n x[2000001], y[2000001]; n char a[3001][3001], c[3001][3001]; n bool ok(int mxx, int mxy, int mnx, int mny) { n for (int i = 0; i < r; i++) n if (x[i] < mnx || x[i] > mxx || y[i] < mny || y[i] > mxy || n (x[i] != mxx && x[i] != mnx && y[i] != mxy && y[i] != mny)) n return false; n return (mxx - mnx == mxy - mny && mxx < n && mxy < m && mnx >= 0 && mny >= 0); n } n void go(int mxx, int mxy, int mnx, int mny) { n int i, j; n for (i = 0; i < n; i++) n for (j = 0; j < m; j++) { n if (i >= mnx && i <= mxx && j >= mny && j <= mxy && n ((i == mxx || i == mnx) || (j == mxy || j == mny)) && a[i][j] != w ) n c[i][j] = + ; n else n c[i][j] = a[i][j]; n } n } n int main() { n cin >> n >> m; n for (i = 0; i < n; i++) n for (j = 0; j < m; j++) { n cin >> a[i][j]; n if (a[i][j] == w ) { n x[r] = i; n y[r] = j; n r++; n } n } n for (i = 0; i < r; i++) { n if (x[i] > mxx) mxx = x[i]; n if (y[i] > mxy) mxy = y[i]; n if (x[i] < mnx) mnx = x[i]; n if (y[i] < mny) mny = y[i]; n } n for (i = 0; i <= m; i++) { n if (ok(mxx, i + (mxx - mnx), mnx, i)) { n go(mxx, i + (mxx - mnx), mnx, i); n for (i = 0; i < n; i++) n for (j = 0; j < m; j++) { n cout << c[i][j]; n if (j == m - 1) cout << endl; n } n return 0; n } n } n for (i = 0; i <= n; i++) { n if (ok(i + (mxy - mny), mxy, i, mny)) { n go(i + (mxy - mny), mxy, i, mny); n for (i = 0; i < n; i++) n for (j = 0; j < m; j++) { n cout << c[i][j]; n if (j == m - 1) cout << endl; n } n return 0; n } n } n cout << -1 ; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 11, MAXL = 100000 + 10; n struct State { n int len, fa, num[MAXN], tr[26]; n State() : len(0), fa(0) { n memset(num, 0, sizeof(num)); n memset(tr, 0, sizeof(tr)); n } n State(int len, int fa, int numr, int ref) : len(len), fa(fa) { n memset(num, 0, sizeof(num)); n memset(tr, 0, sizeof(tr)); n num[ref] = numr; n } n } SAM[MAXL * 2]; n int n, tot = 1, c[MAXN][2]; n string str[MAXN]; n void Construct_SAM(const string &str, int ref) { n int ns = str.size(); n for (int cp = 1, pre = 1, i = 0, id = str[i] - a ; i < ns; n id = str[++i] - a , pre = cp) { n if (SAM[cp].tr[id] && SAM[SAM[cp].tr[id]].len == SAM[cp].len + 1) { n cp = SAM[cp].tr[id]; n ++SAM[cp].num[ref]; n continue; n } n cp = ++tot; n SAM[cp] = State(SAM[pre].len + 1, 0, 1, ref); n for (; pre && !SAM[pre].tr[id]; SAM[pre].tr[id] = cp, pre = SAM[pre].fa) n ; n if (pre != 0) n if (SAM[pre].len + 1 == SAM[SAM[pre].tr[id]].len) n SAM[cp].fa = SAM[pre].tr[id]; n else { n int tp = SAM[pre].tr[id]; n SAM[++tot] = State(SAM[pre].len + 1, SAM[tp].fa, 0, 0); n memcpy(SAM[tot].tr, SAM[tp].tr, sizeof(SAM[tp].tr)); n SAM[cp].fa = SAM[tp].fa = tot; n for (; pre && SAM[pre].tr[id] == tp; n SAM[pre].tr[id] = tot, pre = SAM[pre].fa) n ; n } n else n SAM[cp].fa = 1; n } n } n void init() { n cin >> str[0]; n c[0][0] = 1, c[0][1] = MAXL; n Construct_SAM(str[0], 0); n cin >> n; n for (int i = 1; i <= n; ++i) { n cin >> str[i] >> c[i][0] >> c[i][1]; n Construct_SAM(str[i], i); n } n } n vector l[MAXL]; n void Calc(int id) { n for (int i = MAXL - 1; i >= 0; --i) n for (int j = 0; j < (int)l[i].size(); ++j) n SAM[SAM[l[i][j]].fa].num[id] += SAM[l[i][j]].num[id]; n } n bool Check(int x) { n for (int i = 0; i <= n; ++i) n if (!(SAM[x].num[i] >= c[i][0] && SAM[x].num[i] <= c[i][1])) return false; n return true; n } n void solve() { n for (int i = 1; i <= tot; ++i) l[SAM[i].len].push_back(i); n for (int i = 0; i <= n; ++i) Calc(i); n long long CC = 0; n for (int i = 2; i <= tot; ++i) n if (Check(i)) CC += SAM[i].len - SAM[SAM[i].fa].len; n cout << CC << endl; n } n int main() { n init(); n solve(); n fclose(stdin); n fclose(stdout); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n set st; n set::iterator it; n long long int cnt[200010]; n int main() { n long long int n, a, b, x, y, z, p, m, d, mn, mx, t, i; n scanf( %lld , &t); n while (t--) { n scanf( %lld , &n); n p = 0; n for (i = 1; i <= n; i++) { n scanf( %lld , &a); n st.insert(a); n cnt[a]++; n p = max(p, cnt[a]); n } n x = st.size(); n if (x == 1) { n if (p >= 2) { n cout << 1 << endl; n } else n cout << 0 << endl; n } else { n x = x - 1; n if (p <= x) n cout << p << endl; n else { n d = p - x; n if (d > 1) n cout << x + 1 << endl; n else n cout << x << endl; n } n } n for (i = 1; i <= n; i++) cnt[i] = 0; n st.clear(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool prime[1500000 + 10]; n bool a[1500000 + 10]; n int func(int N, int x) { n int i, ans = 0; n if (x == 2) return 0; n if (a[1]) return 1; n if (x >= 1500000) return -1; n for (i = 2; i <= x - 1; i++) n if (prime[i]) n if (a[i]) n ans++; n else n return -1; n return ans; n } n int main(void) { n int i, j, N, x, tmp; n for (i = 2; i < 1500000; i++) prime[i] = true; n for (i = 2; i * i < 1500000; i++) n if (prime[i]) n for (j = i * i; j < 1500000; j += i) prime[j] = false; n scanf( %d%d , &N, &x); n for ((i) = 0; (i) < (int)(N); (i)++) { n scanf( %d , &tmp); n if (tmp < 1500000) a[tmp] = true; n } n int ans = func(N, x); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void task(); n int main() { n srand(time(0)); n ios_base::sync_with_stdio(0); n task(); n return 0; n } n vector prefix_function(string s) { n int n = s.length(); n vector p(n, 0); n for (int i = 1; i < n; ++i) { n int j = p[i - 1]; n while (j > 0 && s[i] != s[j]) j = p[j - 1]; n if (s[i] == s[j]) p[i] = j + 1; n } n return p; n } n string s[3]; n void task() { n cin >> s[0] >> s[1] >> s[2]; n sort(s, s + 3); n int ans = 1e9 + 10; n do { n string ss = s[0]; n { n vector p = prefix_function(s[1] + ! + s[0]); n int mx = 0; n for (int i = s[1].length(); i < ((int)((p).size())); ++i) n mx = max(mx, p[i]); n if (p.back() != ((int)((s[1]).size())) && mx != ((int)((s[1]).size()))) n ss += s[1].substr(p.back(), ((int)((s[1]).size())) - p.back()); n } n { n vector p = prefix_function(s[2] + ! + ss); n int mx = 0; n for (int i = s[2].length(); i < ((int)((p).size())); ++i) n mx = max(mx, p[i]); n if (p.back() != ((int)((s[2]).size())) && mx != ((int)((s[2]).size()))) n ss += s[2].substr(p.back(), ((int)((s[2]).size())) - p.back()); n ans = min(ans, ((int)((ss).size()))); n } n } while (next_permutation(s, s + 3)); n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x3f3f3f3f; n const int MOD = 1e9 + 7; n const int maxn = 3e5 + 10; n const int maxv = 1e3 + 10; n const double eps = 1e-9; n std::vector G[maxn]; n int ans[maxn]; n void inv(int i) { ans[i] ^= 1; } n bool bad(int u) { n int cnt = 0; n for (int i = 0; i < G[u].size(); i++) { n cnt += ans[u] == ans[G[u][i]]; n } n return cnt >= 2; n } n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n int u, v; n scanf( %d%d , &u, &v); n if (u > v) swap(u, v); n G[v].push_back(u); n G[u].push_back(v); n } n stack s; n for (int i = 1; i <= n; i++) { n if (bad(i)) s.push(i); n } n while (s.size()) { n int u = s.top(); n s.pop(); n if (bad(u)) inv(u); n for (int i = 0; i < G[u].size(); i++) { n int v = G[u][i]; n if (bad(G[u][i])) s.push(v); n } n } n for (int i = 1; i <= n; i++) { n printf( %d , ans[i]); n } n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n char s[105]; n string S; n multiset st; n vector v; n inline bool cmp(string a, string b) { return a.length() < b.length(); } n int cnt[26]; n char ans[105]; n int f[105][26]; n int main() { n scanf( %d , &n); n if (n <= 3) { n if (n == 1) { n printf( ? 1 1 n ), fflush(stdout); n scanf( %s , s); n printf( ! %s n , s); n return 0; n } n printf( ? 2 %d n , n), fflush(stdout); n for (int i = 1; i <= n * (n - 1) / 2; i++) { n scanf( %s , s); n S = s; n sort(S.begin(), S.end()); n st.insert(S); n } n printf( ? 1 %d n , n), fflush(stdout); n for (int i = 1; i <= n * (n + 1) / 2; i++) { n scanf( %s , s); n S = s; n sort(S.begin(), S.end()); n if (st.find(S) == st.end()) n v.push_back(S); n else n st.erase(st.find(S)); n } n sort(v.begin(), v.end(), cmp); n printf( ! ); n for (int i = 0; i < n; i++) { n if (i == 0) { n printf( %c , v[i][0]); n continue; n } n for (int j = 0; j < i + 1; j++) cnt[v[i][j] - a ]++; n for (int j = 0; j < i; j++) cnt[v[i - 1][j] - a ]--; n for (int j = 0; j < 26; j++) { n if (cnt[j]) { n cnt[j] = 0, printf( %c , j + a ); n break; n } n } n } n puts( ); n return 0; n } n int m = (n + 1) / 2; n printf( ? 2 %d n , m), fflush(stdout); n for (int i = 1; i <= m * (m - 1) / 2; i++) { n scanf( %s , s); n S = s; n sort(S.begin(), S.end()); n st.insert(S); n } n printf( ? 1 %d n , m), fflush(stdout); n for (int i = 1; i <= m * (m + 1) / 2; i++) { n scanf( %s , s); n S = s; n sort(S.begin(), S.end()); n if (st.find(S) == st.end()) n v.push_back(S); n else n st.erase(st.find(S)); n } n sort(v.begin(), v.end(), cmp); n for (int i = 0; i < m; i++) { n if (i == 0) { n ans[i + 1] = v[i][0]; n continue; n } n for (int j = 0; j < i + 1; j++) cnt[v[i][j] - a ]++; n for (int j = 0; j < i; j++) cnt[v[i - 1][j] - a ]--; n for (int j = 0; j < 26; j++) { n if (cnt[j]) { n cnt[j] = 0, ans[i + 1] = j + a ; n break; n } n } n } n printf( ? 1 %d n , n), fflush(stdout); n for (int i = 1; i <= n * (n + 1) / 2; i++) { n scanf( %s , s); n int len = strlen(s); n for (int j = 0; j < len; j++) { n f[len][s[j] - a ]++; n } n } n for (int i = m; i; i--) { n for (int j = 0; j < 26; j++) { n int x = f[i][j] - f[i - 1][j]; n for (int k = i; k < n + 1 - i; k++) x -= ans[k] == j + a ; n if (x) { n ans[n + 1 - i] = j + a ; n break; n } n } n } n printf( ! ); n for (int i = 1; i <= n; i++) printf( %c , ans[i]); n puts( ); n } n "} +{"func_code_string": "#include n using namespace std; n long long a, b; n vector A, B, C; n int main() { n scanf( %lld %lld , &a, &b); n for (long long i = 1; i <= sqrt(a); i++) n if (a % i == 0) A.push_back(i); n for (long long i = 1; i <= sqrt(b); i++) n if (b % i == 0) B.push_back(i); n for (long long i = 1; i <= sqrt(a + b); i++) n if ((a + b) % i == 0) C.push_back(i); n long long ans; n for (long long i : C) { n for (long long j : A) { n if (j <= i && a / j <= (a + b) / i) ans = 2 * i + (2 * (a + b) / i); n } n for (long long j : B) { n if (j <= i && b / j <= (a + b) / i) ans = 2 * i + (2 * (a + b) / i); n } n } n printf( %lld n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n vector a, b, e; n char s[5]; n long long ans; n int c; n int main() { n int n, f; n scanf( %d , &n); n while (n--) { n scanf( %s %d , &s, &f); n if (s[0] == 0 && s[1] == 1 ) n a.push_back(f); n else if (s[0] == 1 && s[1] == 0 ) n b.push_back(f); n else if (s[0] == 0 && s[1] == 0 ) n e.push_back(f); n else { n c++; n ans += f; n } n } n int temp = c + 2 * min((int)a.size(), (int)b.size()); n c += min((int)a.size(), (int)b.size()); n if (!a.empty()) sort(a.rbegin(), a.rend()); n if (!b.empty()) sort(b.rbegin(), b.rend()); n for (int i = 0; i < min((int)a.size(), (int)b.size()); ++i) { n ans += a[i]; n ans += b[i]; n } n if (a.size() > b.size()) { n for (int i = min(a.size(), b.size()); i < a.size(); ++i) e.push_back(a[i]); n } else if (b.size() > a.size()) { n for (int i = min(a.size(), b.size()); i < b.size(); ++i) e.push_back(b[i]); n } n if (!e.empty()) sort(e.rbegin(), e.rend()); n for (int i = 0; i < e.size(); ++i) { n if (((temp + 2) / 2) <= c) { n ans += e[i]; n temp++; n } n } n printf( %lld , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n ifstream fin( Sisend.txt ); n int n, c; n bool b[100005]; n vector v, v1; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cerr.tie(0); n cin >> n; n for (int(i) = (0); ((i)) < ((n)); ((i))++) { n cin >> c; n v.emplace_back(c); n } n sort(v.rbegin(), v.rend()); n int l = 1, r = v.size() / 2 + 1; n int vas = 0; n v1.emplace_back(v[0]); n while (r < v.size()) { n while (r < v.size() and v[r] == v[l]) r++; n v1.emplace_back(v[r]), v1.emplace_back(v[l]); n b[r] = 1; n vas++; n l++; n r++; n } n while (l < v.size()) { n if (!b[l]) { n v1.emplace_back(v[l]); n } n l++; n } n cout << vas << endl; n for (int i : v1) cout << i << ; n } n "} +{"func_code_string": "///****In the name of ALLAH, most Gracious, most Compassionate****// n #include n n #define Input freopen( in.txt , r ,stdin) n #define Output freopen( out.txt , w ,stdout) n #define ll long long int n #define ull unsigned long long int n #define pii pair n #define pll pair n #define sc scanf n #define scin(x) sc( %d ,&(x)) n #define scin2(x,y) sc( %d %d ,&(x),&(y)) n #define scln(x) sc( %lld ,&(x)) n #define scln2(x,y) sc( %lld %lld ,&(x),&(y)) n #define pf printf n #define all(a) (a.begin()),(a.end()) n #define UNIQUE(X) (X).erase(unique(all(X)),(X).end()) n #define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end())))) n #define ms(a,b) memset(a,b,sizeof(a)) n #define pb(a) push_back(a) n #define mp make_pair n #define db double n #define EPS 10E-10 n #define ff first n #define ss second n #define sqr(x) (x)*(x) n #define vi vector n #define vl vector n #define vii vector > n #define vll vector > n #define DBG pf( HI n ) n #define MOD 1000000007 n #define CIN ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) n #define RUN_CASE(t,T) for(__typeof(t) t=1;t<=T;t++) n #define CASE(t) printf( Case %d: ,t) n #define CASEl(t) printf( Case %d: n ,t) n #define intlimit 2147483690 n #define longlimit 9223372036854775800 n #define infinity (1<<28) n #define gcd(a,b) __gcd(a,b) n #define lcm(a,b) (a)*(b)/gcd(a,b) n #define mxx 123456789 n #define PI 2*acos(0.0) n #define rep(i,a,b) for(__typeof(i) i=a;i<=b;i++) n #define rev(i,a,b) for(__typeof(i) i=a;i>=b;i--) n #define coutv(v) for(auto it:v)cout<>it; n #define srt(v) sort(v.begin(),v.end()); n #define rsrt(v) sort(v.rbegin(),v.rend()); n #define rvs(v) reverse(v.begin(),v.end()); n n using namespace std; n /** toint, tostring, BigMod, Power , sieve, Primefactorize ,frequency in n! **/ n //ll toint(string s){ll n=0,k=1;for(int i=s.size()-1; i>=0; i--){n += ((s[i]- 0 )*k);k*=10;}return n;} n //string tostring(ll x){string s= ;while(x){s += (x%10)+ 0 ;x/=10;}reverse(s.begin(),s.end());return s;} n //ll BigMod(ll a,ll b){if(b == 0)return 1%MOD;else if(b%2 == 0){ll temp=BigMod(a,b/2);return ((temp%MOD)*(temp%MOD))%MOD;}else{return ((a%MOD)*BigMod(a,b-1)%MOD)%MOD;}} n //ll Power(ll a,ll n){ll ret=1;for(ll i=1 ; i<=n ; i++)ret = ((ret%MOD)*(a%MOD))%MOD;return ret;} n //bool isPrime(ll n){for(ll i=2 ; i*i<=n ; i++){if(n%i == 0)return 0;}return 1;} n //vectorPrime; n //bool mark[10000003]; n //void sieve(ll n){ll i,j;mark[1]=1;for(i=4; i<=n; i+=2)mark[i]=1;Prime.push_back(2);for(i=3; i<=n; i+=2){if(!mark[i]){Prime.push_back(i);if(i*i<=n){for(j=i*i; j<=n; j+=(i*2))mark[j]=1;}}}} n //mapFactor; n //void Primefactorize(ll n){for(ll i=0; i1){Factor[n]++;}} n //ll frequency(ll n,ll factor)/** Frequency of a factor in n! **/{ll cnt=0;while(n){cnt += (n/factor);n /= factor;}return cnt;} n /** Order Set **/ n //#include n //using namespace __gnu_pbds; n //template using orderset = tree,rb_tree_tag,tree_order_statistics_node_update>; n //orderset s ; //orderset::iterator it ; n //orderset X; //X.insert(1); //X.insert(2); //X.insert(4); //X.insert(8); //X.insert(16); n //cout<<*X.find_by_order(0)<> 30)) * 0xbf58476d1ce4e5b9; n x = (x ^ (x >> 27)) * 0x94d049bb133111eb; n return x ^ (x >> 31); n } n n size_t operator()(uint64_t x) const { n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); n return splitmix64(x + FIXED_RANDOM); n } n }; n n /** Debugging Tool **/ n #define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), , , ); stringstream _ss(_s); istream_iterator _it(_ss); err(_it, args); } n void err(istream_iterator it) {} n template n void err(istream_iterator it, T a, Args... args) n { n cerr << *it << = << a << endl; n err(++it, args...); n } n /// n n inline int add(int a, int b) {a += b; return a >= MOD ? a - MOD : a;} n inline int sub(int a, int b) {a -= b; return a < 0 ? a + MOD : a;} n inline int mul(int a, int b) {return (ll) a * b % MOD;} n int Set(int N, int pos) {return N = N | (1<(l , r) (rng); n //} n n //string small = abcdefghijklmnopqrstuvwxyz ; n //string capital = ABCDEFGHIJKLMNOPQRSTUVWXYZ ; n n ///------------------Graph Moves------------------- n ///const int fx[] = {+1,-1,+0,+0}; n ///const int fy[] = {+0,+0,+1,-1}; n ///const int fx[] = {+0,+0,+1,-1,-1,+1,-1,+1}; ///King s move n ///const int fy[] = {-1,+1,+0,+0,+1,+1,-1,-1}; ///King s move n ///const int fx[] = {-2,-2,-1,-1,+1,+1,+2,+2}; ///Knight s move n ///const int fy[] = {-1,+1,-2,+2,-2,+2,-1,+1}; ///Knight s move n n ll s[5009],added[5009]; n n void Solve(int t) n { n ll i,j,k,n,ans=0; n scln(n); n for(i=1 ; i<=n ; i++) n scln(s[i]); n n for(i=1 ; i<=n ; i++){ n if(s[i] - added[i] <= 1){ n for(j=i+2 ; j<=min(n , i+s[i]) ; j++) n added[j]++; n if(added[i] >= s[i]){ n ll xtra = added[i] - (s[i] - 1); n added[i+1] += xtra; n } n continue; n } n n ll temp = (s[i] - 1) - added[i]; n added[i] += temp; n ans += temp; n n // error(i , temp); n for(j=i+2 ; j<=min(n , i+s[i]) ; j++){ n added[j]++; n } n n if(added[i] >= s[i]){ n ll xtra = added[i] - (s[i] - 1); n added[i+1] += xtra; n } n } n pf( %lld n ,ans); n n for(i=1 ; i<=n+2 ; i++) n s[i] = added[i] = 0; n } n n int main() n { n int t,T; n T = 1; n cin>>T; n RUN_CASE(t,T) n { n Solve(t); n } n return 0; n } n n /** Stuff u should look for n * Avoid overflow n * Corner(Small) case n * Don t get stuck on one approach n * Don t forget to clean used memory in each case n **/ n "} +{"func_code_string": "#include n using namespace std; n const int INF = 2e9; n const long long BIG_INF = 1e18; n const long long MOD = 1e9 + 7; n const int maxn = 1e5 + 5; n vector g[maxn]; n int p[maxn], max_height, deep_v; n void dfs(int v, int height) { n if (height > max_height) { n max_height = height; n deep_v = v; n } n for (int j = 0; j < (int)g[v].size(); j++) { n int to = g[v][j]; n dfs(to, height + 1); n } n } n void out(int v) { n if (v) out(p[v]); n ; n cout << v << ; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n for (int i = 1; i < n; i++) { n int u; n cin >> u; n p[i] = u; n g[u].push_back(i); n } n dfs(0, 0); n vector ans; n int v = deep_v; n while (1) { n while (v && (int)g[p[v]].size() == 1) v = p[v]; n if (!v) break; n int par = p[v]; n g[par].erase(find(g[par].begin(), g[par].end(), v)); n int to = g[par][0]; n ans.push_back(v); n g[to].push_back(v); n p[v] = to; n } n out(deep_v); n cout << n ; n reverse(ans.begin(), ans.end()); n cout << (int)ans.size() << n ; n for (int i = 0; i < (int)ans.size(); i++) cout << ans[i] << ; n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n int main() { n char a[19]; n int i, c = 0, t = 0, x = 0; n scanf( %s , &a); n for (i = 0; a[i] != 0 ; i++) { n t = t + a[i]; n } n x = a[0] - 1 + (i - 1) * 9 ; n if (t >= x) n printf( %s , a); n else { n if (a[1] != 9 ) { n for (i = 0; a[i] != 0 ; i++) { n if (c > 0) n printf( 9 ); n else { n if (a[i] > 1 ) printf( %c , a[i] - 1); n c++; n } n } n } else { n c = 0; n printf( %c , a[0]); n for (i = 1; a[i] != 0 ; i++) { n if (c == 0) { n if (a[i + 1] == 9 ) n printf( 9 ); n else { n printf( 8 ); n c++; n } n } else n printf( 9 ); n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n; n long long a[1006]; n long long fac[1000006]; n long long power(long long a, long long i) { n if (i == 0) return 1 % 1000000007; n long long t = power(a, i / 2); n long long ans = t * t % 1000000007; n if (i % 2 == 1) ans = ans * a % 1000000007; n return ans; n } n long long work(long long m, long long i) { n return ((fac[m] % 1000000007) * n (power(fac[i] * fac[m - i] % 1000000007, 1000000007 - 2) % n 1000000007)) % n 1000000007; n } n int main() { n fac[0] = 1; n for (int i = 1; i < 1000006; i++) fac[i] = (fac[i - 1] * i) % 1000000007; n long long ans = 1; n long long sum = 0; n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n sum += a[i]; n } n for (int i = n; i >= 1; i--) { n ans = ans * work(sum - 1, a[i] - 1) % 1000000007; n sum -= a[i]; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n long long int n, k; n cin >> n >> k; n long long int a[n], s = 0; n vector > v; n for (int i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] <= k) { n v.push_back({a[i], i + 1}); n s += a[i]; n } n } n if (s < (k + 1) / 2) { n cout << -1 << endl; n return; n } n s = 0; n sort(v.begin(), v.end()); n vector ans; n for (int i = v.size() - 1; i >= 0; i--) { n if (s + v[i].first >= (k + 1) / 2 and s + v[i].first <= k) { n s += v[i].first; n ans.push_back(v[i].second); n break; n } else if (s + v[i].first < (k + 1) / 2) { n ans.push_back(v[i].second); n s += v[i].first; n } n } n if (ans.size() == 0) { n cout << -1 << endl; n } n sort(ans.begin(), ans.end()); n cout << ans.size() << endl; n for (int i = 0; i < ans.size(); i++) { n cout << ans[i] << ; n } n cout << endl; n } n int main() { n int t; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n const long long INF = 1e12; n const int MOD = 1e9 + 7; n const unsigned long long BIT_FLAG_0 = (1 << 0); n const unsigned long long BIT_FLAG_1 = (1 << 1); n const unsigned long long BIT_FLAG_2 = (1 << 2); n const unsigned long long BIT_FLAG_3 = (1 << 3); n const unsigned long long BIT_FLAG_4 = (1 << 4); n const unsigned long long BIT_FLAG_5 = (1 << 5); n const unsigned long long BIT_FLAG_6 = (1 << 6); n const unsigned long long BIT_FLAG_7 = (1 << 7); n const long long dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0}; n const long long Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, n Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; n void print() { cout << n ; } n template n void print(Head &&head, Tail &&...tail) { n cout << head; n if (sizeof...(tail) != 0) cout << ; n print(forward(tail)...); n } n template n void print(vector &vec) { n for (auto &a : vec) { n cout << a; n if (&a != &vec.back()) cout << ; n } n cout << n ; n } n template n void print(set &set) { n for (auto &a : set) { n cout << a << ; n } n cout << n ; n } n template n void print(vector> &df) { n for (auto &vec : df) { n print(vec); n } n } n long long power(long long a, long long n) { n long long res = 1; n while (n > 0) { n if (n & 1) res = res * a; n a *= a; n n >>= 1; n } n return res; n } n long long comb(long long n, long long k) { n vector> v(n + 1, vector(n + 1, 0)); n for (long long i = 0; i < (long long)((v).size()); i++) { n v[i][0] = 1; n v[i][i] = 1; n } n for (long long k = 1; k < (long long)((v).size()); k++) { n for (long long j = 1; j < k; j++) { n v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]); n } n } n return v[n][k]; n } n void add(long long &a, long long b) { n a += b; n if (a >= MOD) a -= MOD; n } n template n inline bool chmin(T &a, T b) { n if (a > b) { n a = b; n return true; n } n return false; n } n template n inline bool chmax(T &a, T b) { n if (a < b) { n a = b; n return true; n } n return false; n } n __attribute__((constructor)) void faster_io() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n } n long long n, k; n map got; n pair> isOK(long long idx) { n multiset ans; n multiset trueans; n long long cnt = 0; n for (const auto &[key, value] : got) { n long long types = value / idx; n cnt += types; n for (long long ti = 0; ti < (long long)(types); ti++) { n ans.insert(key); n } n } n if (cnt >= k) { n long long now = 0; n for (auto i : ans) { n trueans.insert(i); n now++; n if (now == k) { n break; n } n } n return make_pair(true, trueans); n } else { n return make_pair(false, trueans); n } n } n multiset bin_search() { n multiset finalans; n long long ng = n + 1; n long long ok = 0; n while (abs(ok - ng) > 1) { n long long mid = (ok + ng) / 2; n long long bl = isOK(mid).first; n auto nums = isOK(mid).second; n if (bl) { n ok = mid; n finalans = nums; n } else n ng = mid; n } n return finalans; n } n signed main() { n cin >> n >> k; n vector A(n); n for (long long ni = 0; ni < (long long)(n); ni++) { n long long v; n cin >> v; n A[ni] = v; n got[v]++; n } n auto ret = bin_search(); n for (auto i : ret) { n cout << i << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 1e6 + 5; n int main() { n ios_base::sync_with_stdio(0); n long long q; n cin >> q; n while (q--) { n long long n; n cin >> n; n long long cnt = 0; n long long flag = 1; n while (n != 1) { n if (n % 2 == 0) { n n = n / 2; n cnt++; n } else if (n % 3 == 0) { n n = (2 * n) / 3; n cnt++; n } else if (n % 5 == 0) { n n = (4 * n) / 5; n cnt++; n } else { n cout << -1 << endl; n flag = 0; n break; n } n } n if (flag) cout << cnt << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int x; n while (cin >> x) { n map p1; n string str, strr; n ; n bool l = 0; n int sum; n cin >> str; n for (int i = 0; i < str.size(); i++) { n p1[str[i]]++; n } n for (int i = 0; i < str.size(); i++) { n if (p1[str[i]] % x != 0) { n l = 1; n break; n } n } n if (l == 0) { n for (char i = a ; i <= z ; i++) { n sum = 0; n if (p1[i] > 0) { n sum = p1[i] / x; n } n while (sum--) { n strr += i; n } n } n while (x--) { n cout << strr; n } n } else n cout << -1; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 200200; n const int mod = 1e9 + 7; n int n, a, b; n vector q; n int main() { n cin >> n >> a >> b; n q.push_back(a); n q.push_back(a); n q.push_back(a); n q.push_back(a); n q.push_back(b); n q.push_back(b); n sort(q.begin(), q.end()); n int res = 1e9; n do { n int ans = 1, cur = n; n for (int i = 0; i < q.size(); ++i) n if (cur - q[i] >= 0) n cur -= q[i]; n else n ans++, cur = n - q[i]; n res = min(res, ans); n } while (next_permutation(q.begin(), q.end())); n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using lli = long long int; n lli mod = 1000000007.0; n int main(void) { n long long t; n cin >> t; n lli x; n lli n; n while (t--) { n cin >> n; n x = 1; n for (lli i = 2 * n; i >= 3; i--) { n x *= i; n x = x % mod; n } n cout << x << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, x[210], y[210], ans, dp[210][210]; n long long S[210][210]; n bool in[210][210][210]; n int gogo(int x) { n if (x % n == 0) return n; n return x % n; n } n long long cp(int a, int b, int c) { n return 1LL * (x[a] - x[c]) * (y[b] - y[c]) - n 1LL * (y[a] - y[c]) * (x[b] - x[c]); n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d%d , &x[i], &y[i]); n for (int i = 1; i <= n; i++) n for (int j = i; j <= n; j++) { n for (int p = i + 1; p < j; p++) S[i][j] += cp(p, p + 1, i); n } n for (int i = 1; i <= n; i++) n for (int j = 1; j < i; j++) { n for (int p = gogo(i + 1); p != j; p = gogo(p + 1)) n S[i][j] += cp(gogo(p), gogo(p + 1), i); n } n for (int i = 1; i <= n; i++) n for (int j = i + 1; j <= n; j++) n for (int p = j + 1; p <= n; p++) n if (abs(cp(j, p, i)) + abs(S[i][j]) + abs(S[j][p]) + abs(S[p][i]) == n abs(S[1][n]) && n cp(j, p, i)) { n in[i][j][p] = true; n } n for (int i = 1; i <= n; i++) dp[i][i + 1] = 1; n for (int i = n; i; i--) n for (int j = i + 1; j <= n; j++) n for (int p = i + 1; p < j; p++) n if (in[i][p][j]) n dp[i][j] = (dp[i][j] + 1LL * dp[i][p] * dp[p][j]) % 1000000007; n ans = dp[1][n]; n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int round_up(int i) { n while (i & (i - 1)) { n i = ((i - 1) | i) + 1; n } n return i; n } n class seg_t { n public: n vector seg, ar; n int n; n seg_t(vector& a) { n n = a.size(); n ar = a; n int si = round_up(n); n seg.resize(si * 2); n build(0, 0, n - 1); n } n void build(int i, int l, int r) { n if (l == r) { n seg[i] = ar[l]; n return; n } n int mid = (l + r) / 2; n build(i * 2 + 1, l, mid); n build(i * 2 + 2, mid + 1, r); n seg[i] = min(seg[i * 2 + 1], seg[i * 2 + 2]); n } n int q(int i, int l, int r, int lind, int rind, int val) { n if (r < lind || r > rind) { n return -1; n } n if (l == r) { n if (seg[i] >= val) return -1; n return l; n } n if (lind <= l && r <= rind) { n if (seg[i] >= val) return -1; n } n int mid = (l + r) / 2; n int t = q(i * 2 + 1, l, mid, lind, rind, val); n if (t >= 0) return t; n return q(i * 2 + 2, mid + 1, r, lind, rind, val); n } n int qq(int i, int l, int r, int lind, int rind) { n if (r < lind || r > rind) { n return 1000000000; n } n if (lind <= l && r <= rind) { n return seg[i]; n } n int mid = (l + r) / 2; n return min(qq(i * 2 + 1, l, mid, lind, rind), n qq(i * 2 + 2, mid + 1, r, lind, rind)); n } n }; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int n; n cin >> n; n vector a(2 * n); n for (int i = 0; i < n; i++) { n cin >> a[i]; n a[i + n] = a[i]; n } n seg_t t(a); n vector b(2 * n); n for (int i = 0; i < n; i++) { n int tmp = t.q(0, 0, 2 * n - 1, i, n * 2 - 1, (a[i] + 1) / 2); n if (tmp == -1) n b[i] = 1000000000; n else n b[i] = tmp; n b[i + n] = b[i] + n; n } n seg_t tt(b); n for (int i = 0; i < n; i++) { n int tmp = tt.qq(0, 0, 2 * n - 1, i, n * 2 - 1); n if (tmp >= 1000000000) n cout << -1 << ; n else n cout << tmp - i << ; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ld = long double; n using pii = pair; n int const N = 1e5 + 20, MAX = 7000 + 20; n int n, q; n bitset bt[N]; n int a[MAX]; n vector dv[MAX]; n bitset save[MAX]; n void pre() { n a[1] = 1; n for (int i = 1; i < MAX; i++) { n for (int j = 2 * i; j < MAX; j += i) a[j] ^= a[i], dv[j].push_back(i); n dv[i].push_back(i); n } n for (int i = 1; i < MAX; i++) { n for (int j = 1; i * j < MAX; j++) { n if (a[j]) save[i][i * j] = 1; n } n } n } n int main() { n pre(); n scanf( %d %d , &n, &q); n while (q--) { n int tp, x, y, z, v; n scanf( %d , &tp); n if (tp == 1) { n scanf( %d %d , &x, &v); n x--; n bt[x].reset(); n for (int u : dv[v]) bt[x][u] = 1; n } else if (tp == 2) { n scanf( %d %d %d , &x, &y, &z); n x--, y--, z--; n bt[x] = (bt[y] ^ bt[z]); n } else if (tp == 3) { n scanf( %d %d %d , &x, &y, &z); n x--, y--, z--; n bt[x] = (bt[y] & bt[z]); n } else if (tp == 4) { n scanf( %d %d , &x, &v); n x--; n bitset tmp = (bt[x] & save[v]); n putchar( 0 + (tmp.count() & 1)); n } n } n putchar( n ); n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int k; n vector > vp; n const long double PI = 2 * acos(0.0); n bool check(long double r) { n vector > events; n for (int i = 0; i < n; ++i) { n long double ang = atan2(vp[i].second, vp[i].first); n long double d = n sqrt(vp[i].first * vp[i].first + vp[i].second * vp[i].second); n if (d > 2 * r) continue; n long double alph = (PI - acos(1 - (d * d) / (2 * (r * r)))) / 2; n long double ang_in = ang - alph; n long double ang_out = ang + alph; n if (ang_in < 0) { n ang_in += 2 * PI; n ang_out += 2 * PI; n } n events.emplace_back(ang_in, 1); n events.emplace_back(ang_out, -1); n events.emplace_back(ang_in + 2 * PI, 1); n events.emplace_back(ang_out + 2 * PI, -1); n } n sort(events.begin(), events.end()); n int ck = 0; n for (int i = 0; i < (int)events.size(); ++i) { n ck += events[i].second; n if (ck >= k) return true; n } n return false; n } n int main() { n cout.setf(ios::fixed); n cout << setprecision(10); n cin >> n; n cin >> k; n for (int i = 0; i < n; ++i) { n int first, second; n cin >> first >> second; n vp.emplace_back(first, second); n } n long double l = 0; n long double r = 2e5; n while (r - l > 1e-6) { n long double mid = (l + r) / 2; n if (check(mid)) { n r = mid; n } else { n l = mid; n } n } n cout << l << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int a[] = {2, 7, 2, 3, 3, 4, 2, 5, 1, 2}; n const int Q = 1e9 + 7; n int main() { n string s, t; n cin >> s >> t; n vector p(t.length()); n for (int i = 1; i < t.length(); ++i) { n int k = p[i - 1]; n while (k > 0) { n if (t[k] == t[i]) { n p[i] = k + 1; n break; n } n k = p[k - 1]; n } n if (!p[i] && t[i] == t[0]) p[i] = 1; n } n vector x(s.length()); n if (s[0] == t[0]) x[0] = 1; n for (int i = 1; i < s.length(); ++i) { n int k = x[i - 1]; n if (k == t.length()) k = p[k - 1]; n while (k > 0) { n if (s[i] == t[k]) { n x[i] = k + 1; n break; n } n k = p[k - 1]; n } n if (!x[i] && s[i] == t[0]) x[i] = 1; n } n vector sum(s.length() + 1), r(s.length() + 1), h(s.length() + 1); n sum[0] = 0; n h[0] = 0; n for (int i = 0; i < s.length(); ++i) { n if (x[i] == t.length()) { n r[i + 1] = (h[i - t.length() + 1] + i - t.length() + 2) % Q; n } else { n r[i + 1] = r[i]; n } n sum[i + 1] = (sum[i] + r[i + 1]) % Q; n h[i + 1] = (h[i] + sum[i + 1]) % Q; n } n cout << sum[s.length()]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long check(long long x) { n long long i = 0, ans = 0; n while (x > 0) { n if ((x & (1)) == 1) { n ans = max(ans, i); n } n x = x >> 1; n i++; n } n return ans; n } n void solve() { n long long n; n cin >> n; n long long a[n + 1]; n map mp; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n mp[check(a[i])]++; n } n long long ans = 0; n for (auto x : mp) { n if (x.second > 1) ans += ((x.second) * (x.second - 1)) / 2; n } n cout << ans << endl; n return; n } n int main() { n int t; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int cnt = 0; n vector ans; n vector > adj; n void dfs(int u, int col) { n if (ans[u] != -1) return; n ans[u] = col; n for (int i = 0; i < adj[u].size(); ++i) dfs(adj[u][i], col); n } n char conv(int first) { n if (first == 0) return b ; n if (first == 1) return a ; n if (first == 2) return c ; n } n int main() { n cout.setf(ios::fixed); n cout.precision(7); n ios_base::sync_with_stdio(false); n cin.tie(0); n int n, m; n cin >> n >> m; n adj = vector >(n); n vector deg(n, 0); n for (int asdf = 0; asdf < m; ++asdf) { n int first, second; n cin >> first >> second; n --first; n --second; n adj[first].push_back(second); n adj[second].push_back(first); n ++deg[first]; n ++deg[second]; n } n ans = vector(n, -1); n int qt = 0; n for (int i = 0; i < n; ++i) n if (deg[i] == n - 1) { n ans[i] = 0; n ++qt; n } n for (int i = 0; i < n; ++i) n if (ans[i] == -1) { n ++cnt; n dfs(i, cnt); n } n bool ok = true; n if (cnt >= 3) ok = false; n int n1 = 0, m1 = 0, n2 = 0, m2 = 0; n for (int i = 0; i < n; ++i) { n if (ans[i] == 1) { n ++n1; n m1 += deg[i] - qt; n } else if (ans[i] == 2) { n ++n2; n m2 += deg[i] - qt; n } n } n if (n1 * (n1 - 1) != m1) ok = false; n if (n2 * (n2 - 1) != m2) ok = false; n if (not ok) n cout << No n ; n else { n cout << Yes n ; n for (int i = 0; i < n; ++i) cout << conv(ans[i]); n cout << n ; n } n } n "} +{"func_code_string": "#include n typedef std::function fun; n class Map { n int n, w, r; n std::vector A, B; n std::function lower, upper; n std::vector who; n std::vector val; n void find_array(std::vector &a, const std::vector &S, fun f, n fun g) { n a.resize(1 << r); n std::vector > set(1 << r); n std::vector m(1 << (r + 1)); n std::vector ind; n for (long long x : S) { n if (set[f(x)].empty()) ind.push_back(f(x)); n set[f(x)].push_back(x); n } n std::sort(ind.begin(), ind.end(), n [&](int x, int y) { return set[x].size() > set[y].size(); }); n for (int i : ind) { n a[i] = 0; n for (int j = 0; j < r; ++j) { n int ex0 = 0, ex1 = 0; n for (long long y : set[i]) n ex0 += m[(1 << (j + 1)) + ((y & ((1 << (j + 1)) - 1)) ^ a[i])], n ex1 += m[(1 << (j + 1)) + n ((y & ((1 << (j + 1)) - 1)) ^ (a[i] | (1 << j)))]; n if (ex1 < ex0) a[i] |= (1 << j); n } n for (long long y : set[i]) { n int v = (g(y) ^ a[i]); n for (int j = 0; j < r; ++j) n m[(1 << (r - j)) + v]++, v = v & ((1 << (r - 1 - j)) - 1); n } n } n } n n public: n Map() {} n Map(const std::vector &S, int word) { init(S, word); } n int operator()(long long x) { return lower(x) ^ B[upper(x) ^ A[lower(x)]]; } n int size() { return (1 << r); } n bool have(long long x) { return who[(*this)(x)] == x; } n int &operator[](long long i) { return val[(*this)(i)]; } n void init(const std::vector &S, int word) { n n = (int)S.size(); n w = word; n r = std::max(w / 2, (int)std::log2(n) + 3) + 1; n assert(*std::min_element(S.begin(), S.end()) >= 0); n assert(*std::max_element(S.begin(), S.end()) < (1ll << word)); n lower = [&](long long x) { return x & ((1 << r) - 1); }; n upper = [&](long long x) { return x >> (w - r); }; n find_array(A, S, lower, upper); n auto f2 = [&](long long x) { return upper(x) ^ A[lower(x)]; }; n auto &g2 = lower; n find_array(B, S, f2, g2); n who.resize(1 << r, -1); n for (long long x : S) who[(*this)(x)] = x; n val.resize(1 << r); n } n }; n void make_unique(std::vector &A) { n std::sort(A.begin(), A.end()); n A.resize(std::unique(A.begin(), A.end()) - A.begin()); n } n int main() { n std::ios_base::sync_with_stdio(false); n std::cin.tie(0); n int n, k; n std::cin >> n >> k; n std::vector A(n); n long long pref = 0; n std::vector values; n values.push_back(pref); n for (int i = 0; i < n; ++i) { n std::cin >> A[i]; n pref += A[i]; n values.push_back(pref); n } n make_unique(values); n long long min = *std::min_element(values.begin(), values.end()); n std::vector lower, upper; n for (long long x : values) n lower.push_back((x - min) & ((1 << 24) - 1)), n upper.push_back((x - min) >> 24); n make_unique(lower); n make_unique(upper); n Map ml(lower, 24); n Map mu(upper, 24); n std::vector vals; n auto kto = [&](long long x) { n if (!ml.have((x - min) & ((1 << 24) - 1)) || !mu.have((x - min) >> 24)) n return -1ll; n return ml((x - min) & ((1 << 24) - 1)) + n 1ll * ml.size() * mu((x - min) >> 24); n }; n for (long long x : values) vals.push_back(kto(x)); n make_unique(vals); n Map map(vals, 40); n long long ans = 0; n pref = 0; n map[kto(pref)]++; n for (int i = 0; i < n; ++i) { n pref += A[i]; n long long pow = 1; n while (std::abs(pow) < 1000000000ll * 100000ll + 5ll) { n long long want = (pref - pow); n if (want >= min && want <= min + (1ll << 48)) { n if (kto(want) != -1 && map.have(kto(want))) { n ans += map[kto(want)]; n } n } n pow *= k; n if (pow == 1) break; n } n map[kto(pref)]++; n } n std::cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, q, num, tot, tp, cnt, ans, w[200100], head[200100], dfn[200100], n c[200100], low[200100], sta[200100]; n int dfc, sz[200100], d[200100], f[200100], son[200100], top[200100], n tree[200100], mn[200100 * 4]; n vector v[200100]; n multiset s[200100]; n struct point { n int fr, to, nxt; n } a[200100 * 2]; n void add(int x, int y) { n a[++tot].fr = x; n a[tot].to = y; n a[tot].nxt = head[x]; n head[x] = tot; n } n void tarjan(int x) { n dfn[x] = low[x] = ++num; n sta[++tp] = x; n for (int i = 0; i < v[x].size(); i++) { n int y = v[x][i]; n if (!dfn[y]) { n tarjan(y); n low[x] = min(low[x], low[y]); n if (low[y] == dfn[x]) { n ++cnt; n int now; n do { n now = sta[tp--]; n add(cnt, now); n add(now, cnt); n } while (now != y); n add(cnt, x); n add(x, cnt); n } n } else n low[x] = min(low[x], dfn[y]); n } n } n void dfs1(int x, int fa) { n f[x] = fa; n d[x] = d[fa] + 1; n sz[x] = 1; n for (int i = head[x]; i; i = a[i].nxt) { n int y = a[i].to; n if (y == fa) continue; n dfs1(y, x); n sz[x] += sz[y]; n if (sz[y] > sz[son[x]]) son[x] = y; n } n } n void dfs2(int x, int lst) { n top[x] = lst; n dfn[x] = ++dfc; n tree[dfc] = x; n if (son[x]) dfs2(son[x], lst); n for (int i = head[x]; i; i = a[i].nxt) n if (!top[a[i].to]) dfs2(a[i].to, a[i].to); n } n void build(int x, int l, int r) { n if (l == r) return mn[x] = w[tree[l]], void(); n int mid = (l + r) >> 1; n build(x << 1, l, mid); n build(x << 1 | 1, mid + 1, r); n mn[x] = min(mn[x << 1], mn[x << 1 | 1]); n } n void modify(int x, int l, int r, int p, int y) { n if (l == r) return mn[x] = y, void(); n int mid = (l + r) >> 1; n if (p <= mid) n modify(x << 1, l, mid, p, y); n else n modify(x << 1 | 1, mid + 1, r, p, y); n mn[x] = min(mn[x << 1], mn[x << 1 | 1]); n } n int query(int x, int l, int r, int L, int R) { n if (l >= L && r <= R) return mn[x]; n int mid = (l + r) >> 1, ret = 1e9; n if (L <= mid) ret = min(ret, query(x << 1, l, mid, L, R)); n if (R > mid) ret = min(ret, query(x << 1 | 1, mid + 1, r, L, R)); n return ret; n } n int query(int x, int y, int ret = 1e9) { n while (top[x] != top[y]) { n if (d[top[x]] < d[top[y]]) swap(x, y); n ret = min(ret, query(1, 1, cnt, dfn[top[x]], dfn[x])); n x = f[top[x]]; n } n if (d[x] < d[y]) swap(x, y); n ret = min(ret, query(1, 1, cnt, dfn[y], dfn[x])); n if (y > n) ret = min(ret, w[f[y]]); n return ret; n } n int main() { n scanf( %d%d%d , &n, &m, &q); n cnt = n; n for (int i = 1; i <= n; i++) scanf( %d , &w[i]); n for (int i = 1, x, y; i <= m; i++) n scanf( %d%d , &x, &y), v[x].push_back(y), v[y].push_back(x); n tarjan(1); n dfs1(1, 0); n dfs2(1, 1); n memset(mn, 0x3f, sizeof(mn)); n for (int i = 1; i <= n; i++) s[f[i]].insert(w[i]); n for (int i = n + 1; i <= cnt; i++) w[i] = (*s[i].begin()); n build(1, 1, cnt); n for (int i = 1; i <= q; i++) { n char ch[4]; n int a, b; n scanf( %s%d%d , ch + 1, &a, &b); n if (ch[1] == C ) { n if (f[a]) { n multiset::iterator pos = s[f[a]].find(w[a]); n s[f[a]].erase(pos); n s[f[a]].insert(b); n w[f[a]] = (*s[f[a]].begin()); n modify(1, 1, cnt, dfn[f[a]], (*s[f[a]].begin())); n } n w[a] = b; n modify(1, 1, cnt, dfn[a], w[a]); n } else n printf( %d n , query(a, b)); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int a[111][111]; n char c[111]; n int main() { n int i, j, k; n int p, q, r; n int t, tt, ttt; n scanf( %d , &n); n for (i = 1; i <= n; i++) { n scanf( %s , c); n for (j = 1; j <= n; j++) { n if (c[j - 1] == E ) n a[i][j] = 1; n else n a[i][j] = 0; n } n } n for (i = 1; i <= n; i++) { n for (j = 1; j <= n; j++) { n if (a[i][j] == 0) break; n } n if (j == n + 1) break; n } n if (i != n + 1) { n for (j = 1; j <= n; j++) { n for (i = 1; i <= n; i++) { n if (a[i][j] == 0) break; n } n if (i == n + 1) break; n } n if (j != n + 1) { n printf( -1 ); n } else { n for (j = 1; j <= n; j++) { n for (i = 1; i <= n; i++) { n if (a[i][j] == 0) { n printf( %d %d n , i, j); n break; n } n } n } n } n } else { n for (i = 1; i <= n; i++) { n for (j = 1; j <= n; j++) { n if (a[i][j] == 0) { n printf( %d %d n , i, j); n break; n } n } n } n } n scanf( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100001; n vector v, w; n char s[1000001]; n int main() { n scanf( %s , &s); n int len = strlen(s); n for (int i = (0); i < (len); i++) { n if (s[i] == @ ) v.push_back(i); n if (s[i] == . ) w.push_back(i); n } n int t = 0, tmp = 0; n long long ans = 0; n while (t < v.size() && tmp < w.size()) { n long long first = 0, mid = 1, last = 0; n if (t == v.size()) break; n while (v[t] > w[tmp] && tmp < w.size()) tmp++; n if (tmp == w.size()) break; n if (v[t] + 1 == w[tmp]) mid = 0; n for (int i = v[t] + 1; i < w[tmp]; i++) { n if ((s[i] > 9 || s[i] < 0 ) && (s[i] > z || s[i] < a )) { n mid = 0; n break; n } n } n if (!mid) { n t++; n continue; n } n if (v[t] > 0) n for (int i = v[t] - 1; i >= 0; i--) { n if ((s[i] >= a && s[i] <= z ) || (s[i] >= 0 && s[i] <= 9 ) || n s[i] == _ ) { n if (s[i] >= a && s[i] <= z ) first++; n } else n break; n } n if (w[tmp] + 1 < len) n for (int i = w[tmp] + 1; i < len; i++) { n if (s[i] >= a && s[i] <= z ) n last++; n else n break; n } n ans += first * last; n t++; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, c; n int ans[1001]; n int zero; n inline void send(int x, int p) { n if (ans[x] == 0) --zero; n ans[x] = p; n printf( %d n , x); n fflush(stdout); n } n int main() { n scanf( %d %d %d , &n, &m, &c); n int mid = (c + 1) / 2; n zero = n; n for (int round = 1; zero && round <= m; ++round) { n int p; n scanf( %d , &p); n if (p <= mid) { n int i; n for (i = 1; i < n; ++i) n if (ans[i] == 0 || ans[i] > p) { n break; n } n send(i, p); n } else { n int i; n for (i = n; i > 1; --i) n if (ans[i] == 0 || ans[i] < p) { n break; n } n send(i, p); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = acos(-1.0); n const int INF = 1000000000; n const int MOD = 1073741824; n const int M = INF; n const double RRR = 180.0 / PI; n vector > g; n vector used; n void dfs(int v) { n used[v] = 1; n for (vector::iterator it = g[v].begin(); it != g[v].end(); ++it) { n if (!used[*it]) { n dfs(*it); n } n } n } n int main() { n int x, y; n cin >> x >> y; n int d1 = 1, d2 = 0; n int e = 1; n int f = 0; n int a = 0, b = 0; n int r = 0; n int ans = 0; n if (a == x && b == y) { n cout << 0; n return 0; n } n while (1) { n a += d1; n b += d2; n r++; n if (a == x && b == y) { n cout << ans; n return 0; n } n if (r == e) { n ans++; n if (f == 0) { n f = 1; n d1 = 0; n d2 = 1; n r = 0; n } else { n if (f == 1) { n f = 2; n e++; n r = 0; n d1 = -1; n d2 = 0; n } else { n if (f == 2) { n f = 3; n r = 0; n d1 = 0; n d2 = -1; n } else { n f = 0; n e++; n r = 0; n d1 = 1; n d2 = 0; n } n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mcd(long long a, long long b) { n if (b > a) swap(a, b); n if (b == 0) n return a; n else n return mcd(b, a % b); n } n long long i, j, n, m, q, a, l, r, b; n int main() { n cin.tie(0); n cout.tie(0); n ios_base::sync_with_stdio(0); n cin >> q; n while (q--) { n cin >> n; n if (n == 1) n cout << 3; n else if (n == 2) n cout << 2; n else if (n & 1) n cout << 1; n else n cout << 0; n cout << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long modulo = 998244353; n const long long p = modulo; n vector edges[300005]; n int father[300005]; n long long rCount[300005]; n long long oCount[300005]; n long long eCount[300005]; n pair gcd(long long a, long long b) { n if (b == 0ll) return {1ll, 0ll}; n pair q = gcd(b, a % b); n return {q.second, q.first - q.second * (a / b)}; n } n long long inv(long long a) { n long long aa = gcd(a, p).first; n aa %= p; n if (aa < 0) aa += p; n return aa; n } n void trace(int index) { n for (int j = 0; j < edges[index].size(); ++j) { n int v = edges[index][j]; n if (v == father[index]) { n edges[index].erase(edges[index].begin() + j); n --j; n continue; n } n father[v] = index; n trace(v); n } n } n void dfs(int index) { n if (edges[index].empty()) { n rCount[index] = 1; n oCount[index] = 1; n eCount[index] = 0; n return; n } n long long totalR = 1; n long long total = 1; n for (int j = 0; j < edges[index].size(); ++j) { n int v = edges[index][j]; n dfs(v); n totalR *= rCount[v]; n totalR %= modulo; n total *= rCount[v] + eCount[v]; n total %= modulo; n } n rCount[index] = totalR; n oCount[index] = 1; n eCount[index] = 0; n for (int j = 0; j < edges[index].size(); ++j) { n int v = edges[index][j]; n long long temp = oCount[v] * total; n temp %= modulo; n temp *= inv(rCount[v] + eCount[v]); n temp %= modulo; n rCount[index] += temp; n rCount[index] %= modulo; n oCount[index] *= (rCount[v] + eCount[v]); n oCount[index] %= modulo; n eCount[index] += temp; n eCount[index] %= modulo; n } n } n int main() { n int n; n cin >> n; n if (n == 1) { n cout << 1 << endl; n return 0; n } n int u, v; n for (int i = 0; i < n - 1; ++i) { n scanf( %i%i , &u, &v); n --u; n --v; n edges[u].push_back(v); n edges[v].push_back(u); n } n for (int i = 0; i < n; ++i) { n father[i] = -1; n rCount[i] = 0; n oCount[i] = 0; n eCount[i] = 0; n } n father[0] = -1; n trace(0); n dfs(0); n long long result = rCount[0]; n while (result < 0) { n result += modulo; n } n result %= modulo; n cout << result << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = (int)1e2, maxM = (int)1e2, intMax = INT_MAX, maxValue = 44721; n const long long llmax = LLONG_MAX, INF = (long long)1e9 + 1, mod = 998244353; n long long nod(long long a, long long b) { n while (a != 0 && b != 0) { n if (a < b) n b %= a; n else n a %= b; n } n return a + b; n } n int nod(int a, int b) { n while (a != 0 && b != 0) { n if (a < b) n b %= a; n else n a %= b; n } n return a + b; n } n long long nok(long long a, long long b) { return a * b / nod(a, b); } n int nok(int a, int b) { return a * b / nod(a, b); } n long long modPlus(long long a, long long b) { n a %= mod; n b %= mod; n return a + b; n } n long long modPlus(int a, int b) { n a %= mod; n b %= mod; n return (a + b) % mod; n } n long long binPow(long long a, long long b) { n long long res = 1; n while (b) { n if (b % 2 == 1) { n res *= a; n res %= mod; n } n a = a * a; n a %= mod; n b >>= 1; n } n return res; n } n int n, s, a, b, emaxx = -1; n int main() { n scanf( %d%d , &n, &s); n s *= 100; n for (int i = 0; i < n; i++) { n scanf( %d%d , &a, &b); n b += a * 100; n if (s >= b) emaxx = max((100 - (b % 100)) % 100, emaxx); n } n printf( %d n , emaxx); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int a, b, c; n cin >> a >> b >> c; n int diff = INT_MAX; n int a1, b1, c1; n for (int i = 1; i <= 10000; i++) { n for (int j = i; j <= 20000; j += i) { n for (int k = j; k <= 50000; k += j) { n int dif = abs(a - i) + abs(b - j) + abs(c - k); n if (dif < diff) { n diff = dif; n a1 = i; n b1 = j; n c1 = k; n } n } n } n } n cout << diff << endl << a1 << << b1 << << c1 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, q; n int it[35][800005]; n struct point { n int a[10]; n point(){}; n int &operator[](int x) { return a[x]; } n }; n point p[200005]; n int sign(point &p, int bit) { n int ans = 0; n for (int i = 0; i < k; i++) { n if (bit & 1 == 1) { n ans += p[i]; n } else { n ans -= p[i]; n } n bit >>= 1; n } n return ans; n } n void build(int id, int l, int r) { n if (l == r - 1) { n for (int i = 0; i < (1 << k); i++) { n it[i][id] = sign(p[l], i); n } n return; n } n int mid = (l + r) / 2; n build(id * 2, l, mid); n build(id * 2 + 1, mid, r); n for (int i = 0; i < (1 << k); i++) { n it[i][id] = min(it[i][id * 2], it[i][id * 2 + 1]); n } n } n void update(int id, int l, int r, int pos, point &val) { n if (l == r - 1) { n for (int i = 0; i < (1 << k); i++) { n it[i][id] = sign(val, i); n } n return; n } n int mid = (l + r) / 2; n if (pos < mid) { n update(id * 2, l, mid, pos, val); n } else { n update(id * 2 + 1, mid, r, pos, val); n } n for (int i = 0; i < (1 << k); i++) { n it[i][id] = min(it[i][id * 2], it[i][id * 2 + 1]); n } n } n int chosen[35]; n void get(int id, int l, int r, int a, int b) { n if (a >= b) return; n if (l == a && r == b) { n for (int i = 0; i < (1 << k); i++) { n chosen[i] = min(chosen[i], it[i][id]); n } n return; n } n int mid = (l + r) / 2; n get(id * 2, l, mid, a, min(mid, b)); n get(id * 2 + 1, mid, r, max(mid, a), b); n } n int main() { n cin >> n >> k; n for (int i = 0; i < n; i++) { n for (int j = 0; j < k; j++) { n cin >> p[i][j]; n } n } n build(1, 0, n); n cin >> q; n while (q--) { n int t; n cin >> t; n if (t == 1) { n int x; n cin >> x; n x--; n point cnt; n for (int i = 0; i < k; i++) { n cin >> cnt[i]; n } n update(1, 0, n, x, cnt); n } n if (t == 2) { n int l, r; n cin >> l >> r; n l--; n for (int i = 0; i < (1 << k); i++) { n chosen[i] = 1e9; n } n get(1, 0, n, l, r); n int res = 0; n for (int i = 0; i < (1 << k); i++) { n res = max(res, abs(chosen[(1 << k) - i - 1] + chosen[i])); n } n cout << res << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1000000007; n int N; n int X[206], Y[206]; n int D[202][202]; n long long area(int i1, int i2, int i3) { n return 1LL * X[i1] * Y[i2] + 1LL * X[i2] * Y[i3] + 1LL * X[i3] * Y[i1] - n 1LL * Y[i1] * X[i2] - 1LL * Y[i2] * X[i3] - 1LL * Y[i3] * X[i1]; n } n int sign(int i1, int i2, int i3) { n long long val = area(i1, i2, i3); n if (val < 0) return -1; n if (val > 0) return 1; n return 0; n } n bool inpoly(int x, int y) { n int pnx = 1e9 + 7, pny = 1e9 + 9; n X[N + 2] = x; n Y[N + 2] = y; n X[N + 3] = pnx; n Y[N + 3] = pny; n for (int i = 1; i <= N + 1; ++i) { n X[i] *= 2; n Y[i] *= 2; n } n int nn = 0; n for (int i = 1; i <= N; ++i) n if (sign(N + 2, N + 3, i) * sign(N + 2, N + 3, i + 1) == -1 && n sign(i, i + 1, N + 2) * sign(i, i + 1, N + 3) == -1) n ++nn; n for (int i = 1; i <= N + 1; ++i) { n X[i] /= 2; n Y[i] /= 2; n } n return (nn % 2); n } n bool isok(int i1, int i2) { n if (i1 + 1 == i2 || (i2 == N && i1 == 1)) return true; n for (int i = 1; i <= N; ++i) n if (i != i1 && i != i2) { n if (X[i] < min(X[i1], X[i2]) || X[i] > max(X[i1], X[i2])) continue; n if (Y[i] < min(Y[i1], Y[i2]) || Y[i] > max(Y[i1], Y[i2])) continue; n if (1LL * (Y[i] - Y[i1]) * (X[i2] - X[i]) == n 1LL * (Y[i2] - Y[i]) * (X[i] - X[i1])) n return false; n } n for (int i = 1; i <= N; ++i) n if (i != i1 && i + 1 != i1 && (i + 1) % N != i1) n if (i != i2 && i + 1 != i2 && (i + 1) % N != i2) { n int p1 = i, p2 = i + 1; n if (sign(i1, i2, p1) * sign(i1, i2, p2) == -1 && n sign(p1, p2, i1) * sign(p1, p2, i2) == -1) n return false; n } n int xn = X[i1] + X[i2]; n int yn = Y[i1] + Y[i2]; n if (!inpoly(xn, yn)) return false; n return true; n } n int ways(int i1, int i2) { n if (D[i1][i2] != -1) return D[i1][i2]; n if (i1 + 1 == i2) return 1; n int& now = D[i1][i2]; n now = 0; n if (!isok(i1, i2)) return now; n for (int k = i1 + 1; k <= i2 - 1; ++k) n now = (now + 1LL * ways(i1, k) * ways(k, i2)) % MOD; n return now; n } n int main() { n cin.sync_with_stdio(false); n cin >> N; n for (int i = 1; i <= N; ++i) cin >> X[i] >> Y[i]; n X[N + 1] = X[1]; n Y[N + 1] = Y[1]; n memset(D, -1, sizeof(D)); n cout << ways(1, N) << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 2e5 + 10; n struct Node { n int a, b, d; n } p[MAXN]; n int n, k; n bool cmp(Node aa, Node bb) { return aa.d < bb.d; } n bool cmp2(Node aa, Node bb) { return aa.d > bb.d; } n int main() { n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; i++) scanf( %d , &p[i].a); n for (int i = 1; i <= n; i++) { n scanf( %d , &p[i].b); n p[i].d = p[i].a - p[i].b; n } n long long ans = 0; n sort(p + 1, p + 1 + n, cmp); n if (p[1].d >= 0) { n for (int i = 1; i <= k; i++) ans += (long long)p[i].a; n for (int i = k + 1; i <= n; i++) ans += (long long)p[i].b; n } else if (p[n].d <= 0) { n sort(p + 1, p + 1 + n, cmp2); n for (int i = 1; i <= n; i++) { n ans += (long long)p[i].a; n } n } else { n if (p[k].d <= 0) { n for (int i = 1; i <= n; i++) { n if (p[i].d <= 0) n ans += (long long)p[i].a; n else n ans += (long long)p[i].b; n } n } else { n int tmp = 0; n for (int i = 1; i <= n; i++) { n if (p[i].d <= 0) { n ans += (long long)p[i].a; n } else { n tmp = i; n break; n } n } n sort(p + tmp, p + 1 + k, cmp2); n for (int i = tmp; i <= k; i++) { n ans += (long long)p[i].a; n } n for (int i = k + 1; i <= n; i++) { n ans += (long long)p[i].b; n } n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin >> n; n vector dp; n dp.push_back(0); n dp.push_back(1); n while (dp.back() <= n - 1) { n dp.push_back(dp[dp.size() - 1] + dp[dp.size() - 2] + 1); n } n cout << dp.size() - 2 << endl; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast , unroll-loops ) n using namespace std; n const int inf = numeric_limits::max() / 2; n const long double eps = 1e-9; n const long double pi = acos(-1); n inline void solve(), read(); n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n read(); n solve(); n return 0; n } n pair operator+(pair p1, pair p2) { n return {p1.first + p2.first, p1.second + p2.second}; n } n int q; n map, int> l, s; n map>> qs; n int n = 0; n int gcd(int a, int b) { n while (b != 0) { n a %= b; n swap(a, b); n } n return a; n } n pair getp(pair p) { n int g = gcd(p.first, p.second); n return {p.first / g, p.second / g}; n } n void add(pair p) { n ++n; n pair t = getp(p); n ++l[t]; n int d = p.first * p.first + p.second * p.second; n for (pair q : qs[d]) { n pair u = getp(p + q); n ++s[u]; n } n qs[d].insert(p); n } n void del(pair p) { n --n; n pair t = getp(p); n --l[t]; n int d = p.first * p.first + p.second * p.second; n qs[d].erase(p); n for (pair q : qs[d]) { n pair u = getp(p + q); n --s[u]; n } n } n int get(pair p) { n pair t = getp(p); n return n - l[t] - 2 * s[t]; n } n inline void solve() { n for (int i = 0; i < q; i++) { n int t; n pair p; n cin >> t >> p.first >> p.second; n if (t == 1) { n add(p); n } else if (t == 2) { n del(p); n } else if (t == 3) { n int ans = get(p); n cout << ans << n ; n } n } n } n inline void read() { cin >> q; } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100005; n vector> adj[N], fish[N]; n int n, m, now, depth[N]; n struct node_t { n int x, d, v; n node_t(int x, int d, int v, int t = 0) : x(x - d * t), d(d), v(v) {} n bool operator<(const node_t &b) const { n int p = x + now * d, q = b.x + now * b.d; n return p == q ? d < b.d : p < q; n } n }; n struct collision_t { n node_t x, y; n int when; n collision_t(node_t x, node_t y) : x(x), y(y) { when = y.x - x.x >> 1; } n bool operator<(const collision_t &b) const { n if (when != b.when) { n return when < b.when; n } else { n return make_tuple(x.x, x.v, y.x, y.v) < n make_tuple(b.x.x, b.x.v, b.y.x, b.y.v); n } n } n }; n struct info_t { n set collisions; n set nodes; n void insert_collision(node_t x, node_t y) { n if (x.d > 0 && y.d < 0) { n collisions.insert(collision_t(x, y)); n } n } n void erase_collision(node_t x, node_t y) { n if (x.d > 0 && y.d < 0) { n collisions.erase(collision_t(x, y)); n } n } n void insert(node_t x) { n if (!x.v) { n return; n } n if (nodes.find(x) != nodes.end()) { n x.v += nodes.find(x)->v; n erase(*nodes.find(x)); n } n auto it = nodes.insert(x).first, next = it; n ++next; n if (it != nodes.begin()) { n auto prev = it; n --prev; n if (next != nodes.end()) { n erase_collision(*prev, *next); n } n insert_collision(*prev, x); n } n if (next != nodes.end()) { n insert_collision(x, *next); n } n } n void erase(node_t x) { n auto it = nodes.find(x), next = it; n ++next; n if (next != nodes.end()) { n erase_collision(x, *next); n } n if (it != nodes.begin()) { n auto prev = it; n --prev; n erase_collision(*prev, x); n if (next != nodes.end()) { n insert_collision(*prev, *next); n } n } n nodes.erase(it); n } n int reset(int x, int y) { n node_t l(x + 1, -1, y, now), r(x - 1, 1, y, now); n return max(0, y - max(nodes.find(l) == nodes.end() ? 0 : nodes.find(l)->v, n nodes.find(r) == nodes.end() ? 0 : nodes.find(r)->v)); n } n node_t cancel(node_t x, node_t y) { n if (x.v > y.v) { n return node_t(x.x, x.d, x.v - y.v); n } else { n return node_t(y.x, y.d, y.v - x.v); n } n } n void collide(collision_t x) { n erase(x.x); n erase(x.y); n insert(cancel(x.x, x.y)); n } n void maintain(int x) { n while (!collisions.empty() && collisions.begin()->when <= x) { n collide(*collisions.begin()); n } n } n void merge(info_t &b) { n if (nodes.size() < b.nodes.size()) { n swap(nodes, b.nodes); n swap(collisions, b.collisions); n } n for (auto x : b.nodes) { n insert(x); n } n } n int query() { n int answer = 0; n for (auto x : nodes) { n if (x.d > 0) { n answer += x.v; n } n } n return answer; n } n } info[N]; n void dfs(int x, int parent) { n for (auto e : adj[x]) { n int y = e.first, w = e.second; n if (y != parent) { n depth[y] = depth[x] + w; n dfs(y, x); n } n } n } n void solve(int x, int parent) { n for (auto e : adj[x]) { n int y = e.first, w = e.second; n if (y != parent) { n solve(y, x); n now = -depth[y]; n info[y].maintain(-(depth[x] + 1)); n now = -(depth[x] + 1); n info[x].merge(info[y]); n } n } n now = -(depth[x] + 1); n for (auto &e : fish[x]) { n e.second = info[x].reset(e.first, e.second); n } n info[x].maintain(-depth[x]); n now = -depth[x]; n for (auto e : fish[x]) { n info[x].insert(node_t(e.first, -1, e.second, now)); n info[x].insert(node_t(e.first, 1, e.second, now)); n } n } n int main() { n scanf( %d , &n); n for (int i = 1; i < n; ++i) { n int x, y, w; n scanf( %d %d %d , &x, &y, &w); n --x; n --y; n w <<= 1; n adj[x].emplace_back(y, w); n adj[y].emplace_back(x, w); n } n scanf( %d , &m); n for (int i = 1; i <= m; ++i) { n int day, value, where; n scanf( %d %d %d , &day, &value, &where); n day <<= 1; n --where; n fish[where].emplace_back(day, value); n } n dfs(0, -1); n solve(0, -1); n info[0].maintain(INT_MAX); n printf( %d n , info[0].query()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, i, j, k; n double maxm, sum, r; n cin >> n; n double A[n]; n for (i = 0; i < n; i++) cin >> A[i]; n sort(A, A + n); n maxm = A[n - 1]; n for (i = n - 1; i >= 0; i--) { n sum = 0; n for (j = n - 1; j >= i; j--) { n r = A[j]; n for (k = n - 1; k >= i; k--) { n if (k != j) r = r * (double(1.0) - A[k]); n } n sum += r; n } n if (sum > maxm) maxm = sum; n } n cout << setprecision(10) << maxm << endl; n } n "} +{"func_code_string": "#include n void fre() { n freopen( c://test//input.in , r , stdin); n freopen( c://test//output.out , w , stdout); n } n template n inline void gmax(T &a, T b) { n if (b > a) a = b; n } n template n inline void gmin(T &a, T b) { n if (b < a) a = b; n } n using namespace std; n const int N = 1e5 + 10, M = 0, Z = 1e9 + 7, maxint = 2147483647, n ms31 = 522133279, ms63 = 1061109567, ms127 = 2139062143; n const double eps = 1e-8, PI = acos(-1.0); n int n, m; n int x, y; n int ind[N], s[N], num, top; n vector a[N], b[N]; n bool e[N]; n void dfs(int x) { n e[x] = 1; n num++; n if (ind[x] == 0) s[++top] = x; n for (int i = a[x].size() - 1; i >= 0; i--) { n int y = a[x][i]; n if (!e[y]) dfs(y); n } n } n int main() { n while (~scanf( %d%d , &n, &m)) { n memset(ind, 0, sizeof(ind)); n for (int i = 1; i <= n; i++) a[i].clear(), b[i].clear(); n for (int i = 1; i <= m; i++) { n scanf( %d%d , &x, &y); n ind[y]++; n a[x].push_back(y); n a[y].push_back(x); n b[x].push_back(y); n } n int ans = 0; n memset(e, 0, sizeof(e)); n for (int i = 1; i <= n; i++) n if (!e[i]) { n num = top = 0; n dfs(i); n int sum = top; n while (top) { n int x = s[top--]; n for (int j = b[x].size() - 1; j >= 0; j--) { n int y = b[x][j]; n ind[y]--; n if (ind[y] == 0) { n s[++top] = y; n sum++; n } n } n } n if (sum == num) n ans += (num - 1); n else n ans += num; n } n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int a, b, c; n cin >> a >> b >> c; n if (a > b) swap(a, b); n int mx = (b - a) * 2; n if (a > mx || b > mx || c > mx) n cout << -1 n ; n else { n if (c > mx / 2) n cout << c - mx / 2 << n ; n else n cout << c + mx / 2 << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[50100]; n long long m, ans; n struct node { n int s, cnt[30]; n node *ch[2]; n node(); n } * tp, *nul, *root[50100]; n int getint() { n char ch; n while (!isdigit(ch = getchar())) n ; n int x = ch - 0 ; n for (; isdigit(ch = getchar()); x = x * 10 + ch - 0 ) n ; n return x; n } n node::node() { ch[0] = tp, tp = this; } n node *newnode(node *x) { n if (!tp) new node[50000]; n node *t = tp; n tp = t->ch[0], *t = *x; n return t; n } n void insert(node *&x, node *y, int w) { n node *ret = newnode(y); n ++(x = ret)->s; n for (int i = 29; i >= 0; --i) { n for (int j = 0; j <= i; ++j) x->cnt[j] += (w >> j) & 1; n int t = (w >> i) & 1; n x->ch[t] = newnode(y = y->ch[t]), ++(x = x->ch[t])->s; n } n x = ret; n } n int main() { n scanf( %d%I64d , &n, &m); n nul = new node, tp = 0; n memset(nul, 0, sizeof(node)); n root[1] = nul->ch[0] = nul->ch[1] = nul; n for (int i = 1; i <= n; ++i) insert(root[i + 1], root[i], a[i] = getint()); n for (int i = 29; i >= 0; --i) { n long long sum = 0; n for (int j = 2; j <= n; ++j) sum += root[j]->ch[1 ^ ((a[j] >> i) & 1)]->s; n if (sum < m) { n m -= sum, ans += (1LL << i) * sum; n for (int j = 2; j <= n; ++j) { n node *x = root[j]->ch[1 ^ ((a[j] >> i) & 1)]; n for (int k = 0; k <= i - 1; ++k) n ans += n (1LL << k) * (((a[j] >> k) & 1) ? x->s - x->cnt[k] : x->cnt[k]); n root[j] = root[j]->ch[(a[j] >> i) & 1]; n } n } else { n ans += (1LL << i) * m; n for (int j = 2; j <= n; ++j) root[j] = root[j]->ch[1 ^ ((a[j] >> i) & 1)]; n } n } n printf( %d n , ans % 1000000007); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[200001]; n void op(int i) { n int res = a[i] ^ a[i + 1] ^ a[i + 2]; n a[i] = a[i + 1] = a[i + 2] = res; n } n vector push_left(int i) { n vector v; n while (i - 2 >= 1 && a[i] == 0 && a[i - 1] == 1 && a[i - 2] == 1) { n op(i - 2); n v.push_back(i - 2); n i -= 2; n } n return v; n } n vector push_right(int i, int n) { n vector v; n while (i + 2 <= n && a[i] == 0 && a[i + 1] == 1 && a[i + 2] == 1) { n op(i); n v.push_back(i); n i += 2; n } n return v; n } n int main() { n int i, t; n for (scanf( %d , &t); t--;) { n int n; n vector v, ans; n int cum = 0; n for (scanf( %d , &n), i = 1; i <= n; ++i) { n scanf( %d , a + i); n cum += a[i]; n } n if (cum == 0) { n printf( YES n0 n ); n continue; n } else if ((cum & 1) || cum == n) { n printf( NO n ); n continue; n } n int cur = 1; n if (a[1]) { n cum = a[1]; n cur = 2; n while (cur <= n && a[cur]) cum += a[cur], ++cur; n if (cum & 1) { n --cur; n bool y = 1; n while (cur <= n && a[cur]) { n if (cur + 2 <= n) { n if (a[cur] + a[cur + 1] + a[cur + 2] == 3) { n cur += 2; n } else if (a[cur + 1] + a[cur + 2] == 0) { n ans.push_back(cur); n op(cur); n cur += 2; n } else if (a[cur + 1] == 0 && a[cur + 2] == 1) { n ans.push_back(cur); n op(cur); n auto push_vec = push_left(cur); n ans.insert(ans.end(), push_vec.begin(), push_vec.end()); n cur += 3; n break; n } else { n auto push_vec = push_left(cur + 2); n ans.insert(ans.end(), push_vec.begin(), push_vec.end()); n cur += 3; n break; n } n } else { n y = 0; n break; n } n } n if (y == 0) { n printf( NO n ); n continue; n } n } else { n ans = push_left(cur); n } n } n cur = 1; n while (cur + 2 <= n) { n if (a[cur] == 0 && a[cur + 1] + a[cur + 2] == 2) { n op(cur); n ans.push_back(cur); n cur += 2; n } else if (a[cur]) { n int st = cur - 1; n while (1) { n if (cur + 2 <= n && a[cur + 1] + a[cur + 2] == 2) n cur += 2; n else if (cur + 2 <= n && a[cur + 1] + a[cur + 2] == 0) { n op(cur); n ans.push_back(cur); n cur += 2; n } else if (cur + 2 <= n && a[cur + 1] == 0 && a[cur + 2] == 1) { n op(cur); n ans.push_back(cur); n break; n } else { n break; n } n } n auto push_vec = push_right(st, n); n ans.insert(ans.end(), push_vec.begin(), push_vec.end()); n } else n ++cur; n } n cum = 0; n for (i = 1; i <= n; ++i) cum += a[i]; n if (cum == 0) { n printf( YES n%d n , ans.size()); n for (auto x : ans) printf( %d , x); n puts( ); n } else n printf( NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void read(T& x) { n x = 0; n char s = (char)getchar(); n bool f = false; n while (!(s >= 0 && s <= 9 )) { n if (s == - ) f = true; n s = (char)getchar(); n } n while (s >= 0 && s <= 9 ) { n x = (x << 1) + (x << 3) + s - 0 ; n s = (char)getchar(); n } n if (f) x = (~x) + 1; n } n const long long N = 2e6 + 5, mod = 998244353, MAX = 2e6; n long long power[N], fac[N], inv[N]; n inline long long quickpow(long long a, long long b, long long p = mod) { n long long res = 1; n while (b) { n if (b & 1) res = res * a % p; n a = a * a % p; n b >>= 1; n } n return res; n } n inline long long C(long long n, long long m) { n if (n < m) return 0; n return fac[n] * inv[m] % mod * inv[n - m] % mod; n } n long long n; n long long ans[N]; n void init() { n long long limit = 2e5; n long long x = 810; n ans[1] = 10; n ans[2] = 180; n for (register long long i = 3; i <= limit; ++i) { n ans[i] = ans[i - 1] * 10 + x; n x *= 10; n ans[i] %= mod, x %= mod; n } n } n signed main() { n init(); n long long n; n cin >> n; n for (register long long i = n; i >= 1; --i) cout << ans[i] << ; n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int kN = 100 + 1; n const int kA = 256; n bool dp[kN][kN][kA]; n bool used[kN][kN][kA]; n vector > g[kN]; n bool Dp(int u, int v, int mark) { n if (!used[u][v][mark]) { n used[u][v][mark] = true; n dp[u][v][mark] = false; n for (const auto& edge : g[u]) { n if (edge.second < mark) { n continue; n } n dp[u][v][mark] = dp[u][v][mark] || !Dp(v, edge.first, edge.second); n } n } n return dp[u][v][mark]; n } n void Solve() { n int n, m; n cin >> n >> m; n for (int i = 0; i < m; ++i) { n int u, v; n char ch; n cin >> u >> v >> ch; n g[u - 1].emplace_back(v - 1, int(ch)); n } n for (int u = 0; u < n; ++u) { n for (int v = 0; v < n; ++v) { n cout << (Dp(u, v, 0) ? A : B ); n } n cout << n ; n } n } n int main() { n std::ios_base::sync_with_stdio(false); n cin.tie(NULL); n int tests_count = 1; n for (int test_index = 0; test_index < tests_count; ++test_index) { n Solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1e9 + 7; n int n, S, L; n int a[300005]; n int dp[300005]; n void solve() { n deque > dqmin, dqmax, dqdp; n int pos = 0; n for (int i = 1; i <= n; i++) { n if (i >= L) { n while (dqdp.size() && dqdp.back().first >= dp[i - L]) dqdp.pop_back(); n dqdp.push_back(make_pair(dp[i - L], i - L)); n } n while (dqmax.size() && dqmax.back().first <= a[i]) dqmax.pop_back(); n dqmax.push_back(make_pair(a[i], i)); n while (dqmin.size() && dqmin.back().first >= a[i]) dqmin.pop_back(); n dqmin.push_back(make_pair(a[i], i)); n while (dqmax.size() && dqmax.front().first - dqmin.front().first > S) { n pos++; n if (dqmax.front().second < pos) dqmax.pop_front(); n if (dqmin.front().second < pos) dqmin.pop_front(); n } n while (dqdp.size() && dqdp.front().second < pos - 1) dqdp.pop_front(); n if (dqdp.size()) dp[i] = dqdp.front().first + 1; n } n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n; n cin >> S >> L; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n dp[i] = n + 1; n } n solve(); n if (dp[n] <= n) n cout << dp[n]; n else n cout << -1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MaxN = 600005; n template n inline void rd(t &s) { n s = 0; n register char c = getchar(); n while (!isdigit(c)) c = getchar(); n while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar(); n return; n } n long long a[MaxN], b[MaxN], vis[MaxN * 3]; n struct Quetion { n long long idx, pos, val; n } que[MaxN]; n struct SegTree { n struct Node { n long long val, lazy; n }; n Node tr[MaxN << 2]; n inline void clear() { n memset(tr, 0, sizeof tr); n return; n } n inline void pushup(long long u) { n tr[u].val = max(tr[(u << 1)].val, tr[(u << 1 | 1)].val); n return; n } n inline void pushdown(long long u, long long l, long long r) { n if (tr[u].lazy) { n tr[(u << 1)].lazy += tr[u].lazy; n tr[(u << 1 | 1)].lazy += tr[u].lazy; n tr[(u << 1)].val += tr[u].lazy; n tr[(u << 1 | 1)].val += tr[u].lazy; n tr[u].lazy = 0; n } n return; n } n inline void buildtr(long long u, long long l, long long r) { n if (l == r) { n tr[u].val = 0; n return; n } n register long long mid = (l + r) >> 1; n buildtr((u << 1), l, mid); n buildtr((u << 1 | 1), mid + 1, r); n pushup((u >> 1)); n return; n } n inline void change(long long u, long long l, long long r, long long ql, n long long qr, long long x) { n if (ql == l && r == qr) { n tr[u].val += x; n tr[u].lazy += x; n return; n } n if (l == r) return; n register long long mid = (l + r) >> 1; n pushdown(u, l, r); n if (qr <= mid) n change((u << 1), l, mid, ql, qr, x); n else if (mid < ql) n change((u << 1 | 1), mid + 1, r, ql, qr, x); n else { n change((u << 1), l, mid, ql, mid, x); n change((u << 1 | 1), mid + 1, r, mid + 1, qr, x); n } n pushup(u); n return; n } n inline long long query(long long u, long long l, long long r, long long ql, n long long qr) { n if (l == r) return l; n register long long mid = (l + r) >> 1; n pushdown(u, l, r); n if (tr[(u << 1 | 1)].val > 0) n return query((u << 1 | 1), mid + 1, r, ql, qr); n else n return query((u << 1), l, mid, ql, qr); n } n } segtree; n signed main(void) { n long long n, m, q; n register long long cnt = 0; n rd(n); n rd(m); n for (long long i = 1; i <= n; ++i) rd(a[i]), vis[++cnt] = a[i]; n for (long long i = 1; i <= m; ++i) rd(b[i]), vis[++cnt] = b[i]; n rd(q); n for (long long i = 1; i <= q; ++i) { n rd(que[i].idx); n rd(que[i].pos); n rd(que[i].val); n vis[++cnt] = que[i].val; n } n sort(vis + 1, vis + cnt + 1); n cnt = unique(vis + 1, vis + cnt + 1) - vis - 1; n for (long long i = 1; i <= n; ++i) n a[i] = lower_bound(vis + 1, vis + cnt + 1, a[i]) - vis; n for (long long i = 1; i <= m; ++i) n b[i] = lower_bound(vis + 1, vis + cnt + 1, b[i]) - vis; n for (long long i = 1; i <= q; ++i) n que[i].val = lower_bound(vis + 1, vis + cnt + 1, que[i].val) - vis; n segtree.buildtr(1, 1, cnt); n for (long long i = 1; i <= n; ++i) segtree.change(1, 1, cnt, 1, a[i], 1); n for (long long i = 1; i <= m; ++i) segtree.change(1, 1, cnt, 1, b[i], -1); n for (long long i = 1; i <= q; ++i) { n if (que[i].idx == 1) { n segtree.change(1, 1, cnt, 1, a[que[i].pos], -1); n a[que[i].pos] = que[i].val; n segtree.change(1, 1, cnt, 1, a[que[i].pos], 1); n } else { n segtree.change(1, 1, cnt, 1, b[que[i].pos], 1); n b[que[i].pos] = que[i].val; n segtree.change(1, 1, cnt, 1, b[que[i].pos], -1); n } n if (segtree.tr[1].val <= 0) n puts( -1 ); n else n printf( %lld n , vis[segtree.query(1, 1, cnt, 1, cnt)]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void printvec(vector& vec) { n for (long long int i = 0; i < vec.size(); i++) { n cout << vec[i] << ; n } n cout << endl; n } n int main() { n ios_base::sync_with_stdio(false); n long long int n; n cin >> n; n vector > inp; n for (long long int i = 0; i < n; i++) { n long long int a, b, c, d; n cin >> a >> b >> c >> d; n a = a + b + c + d; n inp.push_back(make_pair(-a, i)); n } n sort(inp.begin(), inp.end()); n for (long long int i = 0; i < n; i++) { n if (inp[i].second == 0) { n cout << i + 1 << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int s = 1000000; n int a[1000001]; n bool belongs[1000001]; n bool used[1000001]; n vector ans; n int main() { n int n; n cin >> n; n for (int i = 0; i <= s; i++) belongs[i] = used[i] = false; n for (int i = 0; i < n; i++) { n scanf( %i , &a[i]); n belongs[a[i]] = true; n } n int u = 1; n for (int i = 0; i < n; i++) n if (!used[a[i]]) { n if (belongs[a[i]] && !belongs[s - a[i] + 1] && !used[s - a[i] + 1]) { n ans.push_back(s - a[i] + 1); n used[s - a[i] + 1] = true; n used[a[i]] = true; n } else if (belongs[a[i]] && belongs[s - a[i] + 1]) { n while (u <= s && n (belongs[u] || belongs[s - u + 1] || used[u] || used[s - u + 1])) n u++; n used[u] = true; n used[s - u + 1] = true; n used[s - a[i] + 1] = true; n used[a[i]] = true; n ans.push_back(u); n ans.push_back(s - u + 1); n u++; n } else n assert(false); n } n cout << int(ans.size()) << endl; n for (int i = 0; i < int(ans.size()); i++) printf( %i , ans[i]); n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string n; n int sz; n long long mul; n long long ans; n long long powe(long long a, long long b) { n if (!b) return 1; n long long tmp = powe(a, b / 2); n tmp = (tmp * tmp) % 1000000007; n if (b % 2 == 1) n return (tmp * a) % 1000000007; n else n return tmp; n } n int main() { n cin >> n; n sz = ((int)n.size()); n mul = powe(2, sz - 1); n long long tp = 1; n for (int i = sz - 1; i >= 0; i--) { n if (n[i] == 1 ) { n ans = (ans + ((tp * mul) % 1000000007)) % 1000000007; n } n tp = (tp * 2) % 1000000007; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n const double pi = acos(-1); n const int o = 524288; n int a[1111111]; n double x[1111111], y[1111111]; n int z[1111111]; n int main() { n double tx, ty; n int i, j, k, n, m, tz; n scanf( %d%d , &n, &m); n for (i = 0; i < n; i++) a[i + o] = x[i + o] = 1; n for (i = o - 1; i >= 0; i--) x[i] = x[i << 1] + x[i << 1 | 1]; n while (m--) { n scanf( %d%d%d , &i, &j, &k); n j += o - 1; n if (i == 1) n a[j] += k; n else n z[j] = (z[j] + k) % 360; n x[j] = a[j] * cos(z[j] * pi / 180); n y[j] = a[j] * sin(-z[j] * pi / 180); n while (j >>= 1) { n x[j] = x[j << 1] + x[j << 1 | 1] * cos(-z[j << 1] * pi / 180) - n y[j << 1 | 1] * sin(-z[j << 1] * pi / 180); n y[j] = y[j << 1] + x[j << 1 | 1] * sin(-z[j << 1] * pi / 180) + n y[j << 1 | 1] * cos(-z[j << 1] * pi / 180); n z[j] = (z[j << 1] + z[j << 1 | 1]) % 360; n } n printf( %.10f %.10f n , x[1], y[1]); n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) n #pragma GCC optimize( unroll-loops ) n using namespace std; n long long MOD = 998244353; n double eps = 1e-12; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int n; n cin >> n; n string s; n cin >> s; n int coins = 0; n int x, y; n if (s[0] == U ) { n x = 0; n y = 1; n } else { n x = 1; n y = 0; n } n for (int i = 1; i < n; i++) { n if (s[i] == U ) { n if (x == y) { n if (s[i - 1] == U ) coins++; n } n y++; n } else { n if (x == y) { n if (s[i - 1] == R ) coins++; n } n x++; n } n } n cout << coins; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 10000; n const int maxm = 20000; n const int maxk = 10; n const int inf = 25; n int tot_edge, sz; n int head[maxn]; n int nxt[maxm]; n int to[maxm]; n int cap[maxm]; n int flow[maxk + 1][maxm]; n int qu[maxn]; n int prv[maxn]; n int when[maxn]; n int pass_flow[maxn]; n int last_time; n int level[maxn], edge_pos[maxn]; n int read() { n int xx = 0, ff = 1; n char ch = getchar(); n while (ch > 9 || ch < 0 ) { n if (ch == - ) ff = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n xx = (xx << 3) + (xx << 1) + ch - 0 ; n ch = getchar(); n } n return xx * ff; n } n void add_edge(int u, int v, int w) { n nxt[tot_edge] = head[u]; n head[u] = tot_edge; n to[tot_edge] = v; n cap[tot_edge] = w; n tot_edge++; n } n bool bfs(int s, int t, int *flow) { n sz = 0; n qu[sz++] = t; n int pnt = 0; n memset(level, -1, sizeof(level)); n level[t] = 0; n while (pnt < sz && level[s] == -1) { n int u = qu[pnt++]; n for (int e = head[u]; e >= 0; e = nxt[e]) { n int v = to[e]; n if (level[v] == -1 && flow[e ^ 1] < cap[e ^ 1]) { n level[v] = level[u] + 1; n qu[sz++] = v; n } n } n } n return level[s] != -1; n } n int dinic(int s, int t, int *flow) { n int ret = 0; n while (bfs(s, t, flow)) { n copy(head, head + maxn, edge_pos); n function find_path = [&](int u, int res) { n if (u == t) return res; n for (int &e = edge_pos[u]; e >= 0; e = nxt[e]) { n int v = to[e]; n if (flow[e] == cap[e] || level[u] - 1 != level[v]) continue; n int push = find_path(v, min(res, cap[e] - flow[e])); n if (push > 0) { n flow[e] += push; n flow[e ^ 1] -= push; n if (flow[e] == cap[e]) e = nxt[e]; n return push; n } n } n return 0; n }; n for (int f; (f = find_path(s, 1e9)) > 0;) ret += f; n } n return ret; n } n int augment(int s, int t, int *flow) { n last_time++; n sz = 0; n qu[sz++] = s; n when[s] = last_time; n int pnt = 0; n pass_flow[s] = inf; n pass_flow[t] = 0; n while (pnt < sz && when[t] != last_time) { n int u = qu[pnt++]; n assert(pass_flow[u] > 0); n for (int e = head[u]; e >= 0; e = nxt[e]) { n int v = to[e]; n if (when[v] != last_time && flow[e] < cap[e]) { n pass_flow[v] = min(pass_flow[u], cap[e] - flow[e]); n prv[v] = e; n when[v] = last_time; n qu[sz++] = v; n if (v == t) break; n } n } n } n int f = pass_flow[t]; n if (f == 0) return f; n do { n int e = prv[t]; n flow[e] += f; n flow[e ^ 1] -= f; n assert(to[e] == t); n t = to[e ^ 1]; n } while (t != s); n return f; n } n int max_flow(int s, int t, int *flow) { n int res = 0, cur = 0; n do { n cur = augment(s, t, flow); n res += cur; n } while (cur); n return res; n } n int n, m, k, q; n int masked[1 << maxk]; n void go(int n, int m, int mask, int pointer) { n for (int i = 0; (mask >> i & 1) == 0 && i < k; ++i) { n int n_mask = mask | (1 << i); n copy(flow[pointer], flow[pointer] + m, flow[pointer + 1]); n cap[2 * i] = inf; n masked[n_mask] = masked[mask] + max_flow(0, n - 1, flow[pointer + 1]); n go(n, m, n_mask, pointer + 1); n cap[2 * i] = 0; n } n } n int wei[maxk]; n int suma[1 << maxk]; n int eptr; n struct info { n int u, v, w; n } edges[maxm]; n vector adj[maxn]; n void relabel(int n, int m) { n sz = 0; n qu[sz++] = 0; n int pnt = 0; n memset(level, -1, sizeof(level)); n level[0] = 0; n level[n - 1] = n - 1; n while (pnt < sz) { n int u = qu[pnt++]; n for (auto v : adj[u]) { n if (level[v] == -1) { n level[v] = sz; n qu[sz++] = v; n } n } n } n for (int i = 0; i < n; ++i) n if (level[i] == -1) level[i] = sz++; n for (int i = 0; i < m; ++i) { n edges[i].u = level[edges[i].u]; n edges[i].v = level[edges[i].v]; n } n } n int main() { n memset(head, -1, sizeof head); n n = read(); n m = read(); n k = read(); n q = read(); n for (int i = 0; i < m; ++i) { n int u, v, w; n u = read(); n v = read(); n w = read(); n u--; n v--; n edges[i] = {u, v, w}; n adj[u].push_back(v); n } n relabel(n, m); n for (int i = 0; i < m; ++i) { n add_edge(edges[i].u, edges[i].v, edges[i].w); n add_edge(edges[i].v, edges[i].u, 0); n } n masked[0] = dinic(0, n - 1, flow[0]); n go(n, 2 * m, 0, 0); n int top = (1 << k) - 1; n for (int i = 0; i < q; ++i) { n for (int j = 0; j < k; ++j) wei[j] = read(); n int answer = masked[top]; n for (int j = 1; j < (1 << k); j++) { n int x = __builtin_ctz(j); n suma[j] = suma[j ^ (1 << x)] + wei[x]; n answer = min(answer, masked[top ^ j] + suma[j]); n } n printf( %d n , answer); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string n; n cin >> n; n cout << 25 << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n using namespace std; n const int maxn = 1000100; n int cnt_neg = 0, cnt_pos = 0; n int arr[maxn << 1]; n int main() { n int n; n scanf( %d , &n); n for (int e = 1; e <= n; e++) scanf( %d , arr + e), arr[e + n] = arr[e]; n int hi = 2 * n, lo = n + 1, nowlo = n; n long long sum = 0; n set > go; n unordered_set removido; n for (int cur = hi; cur >= lo; cur--) { n if (arr[cur] <= nowlo) n cnt_pos++; n else n cnt_neg++, go.insert(make_pair(arr[cur] - nowlo, cur)); n sum += abs(arr[cur] - nowlo); n nowlo--; n } n long long ans = sum, shift = 0, state = 0; n for (; lo > 1;) { n if (arr[hi] <= n) n cnt_pos--; n else n cnt_neg--; n sum -= abs(arr[hi] - n); n removido.insert(hi); n shift++; n sum += -cnt_neg + cnt_pos; n sum += abs(arr[lo - 1] - 1); n if (sum < ans) ans = sum, state = shift; n if (arr[lo - 1] > 1) n cnt_neg++, go.insert(make_pair(shift + arr[lo - 1] - 1, lo - 1)); n else n cnt_pos++; n while (!go.empty()) { n int shi, val; n tie(shi, val) = *go.begin(); n int removal = removido.count(val); n if (!(removal || shi == shift)) break; n if (!removal) n cnt_neg--, cnt_pos++; n else n removido.erase(go.begin()->second); n go.erase(go.begin()); n } n lo--; n hi--; n } n printf( %lld %lld n , ans, state); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mod(long long v, long long k, long long p) { n long long res = 1; n for (long long i = 0; i < 4; i++) res *= v, res %= p; n res -= ((k * v) % p); n if (res < 0) res += p; n return res; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long n, p, k; n cin >> n >> p >> k; n long long Array[n]; n for (long long i = 0; i < n; i++) cin >> Array[i]; n long long B[n]; n for (long long i = 0; i < n; i++) B[i] = mod(Array[i], k, p); n vector out; n sort(B, B + n); n long long cnt = 1; n for (long long i = 0; i < n - 1; i++) { n if (B[i + 1] != B[i] and cnt != 1) n out.push_back(cnt), cnt = 1; n else if (B[i + 1] == B[i]) n cnt++; n } n if (cnt != 1) out.push_back(cnt); n long long sum = 0; n for (long long i = 0; i < out.size(); i++) n sum += ((out[i] * (out[i] - 1)) / 2); n cout << sum << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 200000000 + 1; n const int N = 300006, M = 80; n int dp[2][101][10005], a[105], cnt[105]; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int i = 1; i <= n; i++) { n int cnt1 = 0; n for (int j = 1; j <= n; j++) { n if (a[i] == a[j]) cnt1++; n } n cnt[a[i]] = cnt1; n } n sort(a + 1, a + n + 1); n vector v; n v.push_back(a[1]); n for (int i = 2; i <= n; i++) n if (a[i] != a[i - 1]) v.push_back(a[i]); n dp[0][0][0] = 1; n for (int i = 1; i <= v.size(); i++) { n for (int j = 0; j <= n; j++) { n for (int k = 0; k <= 100 * n; k++) { n dp[i % 2][j][k] = dp[1 - i % 2][j][k]; n for (int l = 1; l <= cnt[v[i - 1]] && l <= j; l++) { n int z = l * v[i - 1]; n if (k >= z) n dp[i % 2][j][k] = dp[i % 2][j][k] + dp[1 - i % 2][j - l][k - z]; n if (dp[i % 2][j][k] > 10) dp[i % 2][j][k] = 10; n } n } n } n } n int ans = 1; n for (int i = 1; i <= n; i++) { n for (int j = i; j <= n; j++) { n if (a[j] != a[i]) break; n int sum = a[j] * (j - i + 1); n int z = j - i + 1; n if (dp[v.size() % 2][z][sum] == 1) ans = max(ans, z); n } n } n if (v.size() == 2) { n cout << n << n ; n return 0; n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n const int MAXN = 1e6 + 5; n int n, m, k; n char str[21]; n int x[MAXN], y[MAXN]; n int s[MAXN], t[MAXN]; n int p[21]; n int f[(1 << 20) + 3], g[(1 << 20) + 3]; n inline void presum() { n for (int i = 0; i <= k - 1; ++i) { n for (int S = 0; S <= (1 << k) - 1; ++S) { n if ((S >> i) & 1) continue; n f[S] = std::min(f[S ^ (1 << i)], f[S]); n g[S] = std::max(g[S ^ (1 << i)], g[S]); n } n } n } n int main() { n scanf( %d%d%d , &n, &m, &k); n scanf( %s , str); n for (int i = 0; i <= k - 1; ++i) n if (str[i] == 1 ) s[0] |= (1 << i); n scanf( %s , str); n for (int i = 0; i <= k - 1; ++i) n if (str[i] == 1 ) t[0] |= (1 << i); n for (int i = 1; i <= n; ++i) scanf( %d%d , x + i, y + i); n for (int i = 1; i <= k; ++i) p[i] = i; n for (int i = 1; i <= n; ++i) { n int p1 = -1, p2 = -1; n for (int j = 1; j <= k; ++j) { n if (p[j] == x[i]) p1 = j; n if (p[j] == y[i]) p2 = j; n } n std::swap(p[p1], p[p2]); n for (int j = 0; j <= k - 1; ++j) n if ((s[0] >> (p[j + 1] - 1)) & 1) s[i] |= 1 << j; n for (int j = 0; j <= k - 1; ++j) n if ((t[0] >> (p[j + 1] - 1)) & 1) t[i] |= 1 << j; n } n for (int i = 0; i <= (1 << k) - 1; ++i) f[i] = 1e9, g[i] = -1e9; n for (int i = 0; i <= n; ++i) n f[s[i]] = std::min(f[s[i]], i), g[t[i]] = std::max(g[t[i]], i); n presum(); n int ans = -1e9, ansl = -1, ansr = -1; n for (int S = 0; S <= (1 << k) - 1; ++S) { n if (g[S] - f[S] >= m && __builtin_popcount(S) > ans) { n ans = __builtin_popcount(S); n ansl = f[S] + 1; n ansr = g[S]; n } n } n ans = 2 * ans + k - __builtin_popcount(s[0]) - __builtin_popcount(t[0]); n printf( %d n%d %d n , ans, ansl, ansr); n return 0; n } n "} +{"func_code_string": "//頑張って n #include n #define ff first n #define ss second n #define ll long long n #define rep(i, n) for (int i = 0; i < n; i++) n using namespace std; n #define all(x) x.begin(), x.end() n void solve() { n int n; n cin >> n; n vector a(n); n for (auto &i : a) n cin >> i; n int mxn = accumulate(all(a), 0); n vector dp(mxn + 1); n dp[0] = true; n for (int i = 0; i < n; i++) { n for (int j = mxn - a[i]; j >= 0; j--) { n if (dp[j] == true) n dp[a[i] + j] = true; n } n } n if ((mxn % 2 == 0 && !dp[mxn / 2]) || mxn % 2) { n cout << 0 n ; n return; n } n while (true) { n for (int i = 0; i < n; i++) { n if (a[i] % 2 != 0) { n cout << 1 n << i + 1 << n ; n return; n } n a[i] /= 2; n } n } n } n int main() { n #ifndef ONLINE_JUDGE n freopen( inp.in , r , stdin); freopen( outp.in , w , stdout); n #endif n ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); n solve(); n return 0; n }"} +{"func_code_string": "#include n using namespace std; n const long long inf = (long long)1e18; n const int N = 1234567; n long long a[N], b[N]; n int main() { n int n, k; n scanf( %d %d , &n, &k); n n++; n for (int i = 0; i < n; i++) { n int foo; n scanf( %d , &foo); n a[i] = foo; n } n long long z = 0; n int up = 0; n for (int i = 0; i < n; i++) { n z += a[i]; n b[i] = z; n if (z % 2 != 0) { n break; n } n up++; n z /= 2; n } n long long value = 0; n int ans = 0; n for (int i = n - 1; i >= 0; i--) { n if (i <= up) { n long long tmp = value * 2 + b[i]; n long long z = a[i] - tmp; n if (-k <= z && z <= k && (i != n - 1 || z != 0)) { n ans++; n } n } n value = value * 2 + a[i]; n if (value < -inf || value > inf) { n break; n } n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int di[] = {-1, 0, 1, 0}; n const int dj[] = {0, 1, 0, -1}; n const long long MOD = 1e9 + 7; n const long long INF = 1e9; n const double EPS = 1e-11; n class UnionFind { n private: n vector p, rank, setSize; n int numSets; n n public: n UnionFind(int N) { n setSize.assign(N, 1); n numSets = N; n rank.assign(N, 0); n p.assign(N, 0); n for (int i = 0; i < N; i++) p[i] = i; n } n int findSet(int i) { return (p[i] == i) ? i : (p[i] = findSet(p[i])); } n bool isSameSet(int i, int j) { return findSet(i) == findSet(j); } n void unionSet(int i, int j) { n if (!isSameSet(i, j)) { n numSets--; n int x = findSet(i), y = findSet(j); n if (rank[x] > rank[y]) { n p[y] = x; n setSize[x] += setSize[y]; n } else { n p[x] = y; n setSize[y] += setSize[x]; n if (rank[x] == rank[y]) rank[y]++; n } n } n } n int numDisjointSets() { return numSets; } n int sizeOfSet(int i) { return setSize[findSet(i)]; } n }; n int main() { n ios::sync_with_stdio(false), cin.tie(0); n int n; n cin >> n; n vector num(n); n map idx, vis; n for (int i = 0; i < n; ++i) cin >> num[i], idx[num[i]] = i; n vector num2 = num; n sort(num2.begin(), num2.end()); n UnionFind dsu(n); n for (int i = 0; i < n; ++i) { n swap(num[i], num[idx[num2[i]]]); n dsu.unionSet(i, idx[num2[i]]); n } n for (int i = 0; i < n; ++i) num[i] = dsu.findSet(i); n map > r; n for (int i = 0; i < n; ++i) r[num[i]].push_back(i + 1); n cout << r.size() << endl; n for (map >::iterator i = r.begin(); i != r.end(); n ++i) { n cout << i->second.size() << ; n for (int j = 0; j < i->second.size(); ++j) n cout << i->second[j] << n [j == i->second.size() - 1]; n } n } n "} +{"func_code_string": "#include n using namespace std; n template n using minheap = priority_queue, greater>; n int main() { n ios_base::sync_with_stdio(false); n int t; n cin >> t; n while (t--) { n long long w, h; n cin >> w >> h; n vector> a(4); n for (int i = 0; i < 4; i++) { n int k, temp; n cin >> k; n for (int j = 0; j < k; j++) { n cin >> temp; n a[i].push_back(temp); n } n } n long long ans = 0; n ans = max(ans, (a[0].back() - a[0][0]) * h); n ans = max(ans, (a[1].back() - a[1][0]) * h); n ans = max(ans, (a[2].back() - a[2][0]) * w); n ans = max(ans, (a[3].back() - a[3][0]) * w); n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n char a[5][6] = { aabb , abab , abba , aaaa }; n char s[5][10005]; n bool f[5]; n int find(char s[], int k) { n int p1 = -1; n int len = strlen(s); n int cnt = 0; n for (int i = len - 1; i >= 0; i--) { n if (s[i] == a || s[i] == e || s[i] == i || s[i] == o || s[i] == u ) n cnt++; n if (cnt == k) return i; n } n return -1; n } n bool check(char s[], char t[], int k) { n int p = find(s, k), q = find(t, k); n if (p == -1) return false; n if (q == -1) return false; n int l1 = strlen(s), l2 = strlen(t); n if (l1 - p != l2 - q) return false; n int j = q; n for (int i = p; i < l1; i++) { n if (s[i] == t[j]) n j++; n else n return false; n } n return true; n } n int main() { n int n, k; n while (scanf( %d%d , &n, &k) > 0) { n memset(f, false, sizeof(f)); n for (int i = 1; i <= n; i++) { n for (int j = 0; j < 4; j++) scanf( %s , s[j]); n if (!check(s[0], s[1], k)) { n f[0] = true; n f[3] = true; n } n if (!check(s[2], s[3], k)) { n f[0] = true; n f[3] = true; n } n if (!check(s[0], s[2], k)) { n f[1] = true; n f[3] = true; n } n if (!check(s[1], s[3], k)) { n f[1] = true; n f[3] = true; n } n if (!check(s[0], s[3], k)) { n f[2] = true; n f[3] = true; n } n if (!check(s[2], s[1], k)) { n f[2] = true; n f[3] = true; n } n } n bool sol = false; n if (!f[0] && !f[1] && !f[2]) { n puts( aaaa ); n continue; n } n for (int i = 2; i >= 0; i--) { n if (!f[i]) { n puts(a[i]); n sol = true; n break; n } n } n if (!sol) puts( NO ); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100005; n struct edge { n int to, index; n edge(int t = 0, int i = 0) { n to = t; n index = i; n } n }; n vector g[N]; n int num[N], ans[N], dep[N], fa[18][N], n, m; n void add(int from, int to, int index) { g[from].push_back(edge(to, index)); } n void dfs(int x, int ffa, int d) { n fa[0][x] = ffa; n dep[x] = d; n for (int i = 0; i < g[x].size(); i++) { n int y = g[x][i].to; n if (y == ffa) continue; n dfs(y, x, d + 1); n } n } n void init() { n m = 0; n while (n >= (1 << m)) m++; n for (int i = 1; i <= m; i++) { n for (int j = 1; j <= n; j++) { n if (fa[i - 1][j] < 0) n fa[i][j] = -1; n else { n fa[i][j] = fa[i - 1][fa[i - 1][j]]; n } n } n } n } n int LCA(int x, int y) { n if (dep[x] < dep[y]) swap(x, y); n for (int i = m; i >= 0; i--) { n if ((dep[x] - dep[y]) & (1 << i)) x = fa[i][x]; n } n if (x == y) return x; n for (int i = m; i >= 0; i--) { n if (fa[i][x] != fa[i][y]) { n x = fa[i][x]; n y = fa[i][y]; n } n } n return fa[0][x]; n } n void dfs2(int x, int fa, int z) { n for (int i = 0; i < g[x].size(); i++) { n int y = g[x][i].to; n if (y == fa) continue; n dfs2(y, x, g[x][i].index); n num[x] += num[y]; n } n ans[z] = num[x]; n } n int main() { n int x, y, rt; n scanf( %d , &n); n for (int i = 1; i < n; i++) { n scanf( %d%d , &x, &y); n add(x, y, i); n add(y, x, i); n } n dfs(1, -1, 0); n init(); n int TA; n scanf( %d , &TA); n while (TA--) { n scanf( %d%d , &x, &y); n rt = LCA(x, y); n num[x]++; n num[y]++; n num[rt] -= 2; n } n dfs2(1, -1, 0); n for (int i = 1; i < n; i++) printf( %d , ans[i]); n printf( n ); n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[2 * 100004], b[2 * 100004], c[2 * 100004], poz, x; n int main() { n ios::sync_with_stdio(false); n cin >> n; n for (int i = 1; i <= n; ++i) { n cin >> a[i]; n c[a[i]] = 1; n } n poz = 1; n for (int i = 1; i <= n; ++i) { n cin >> b[i]; n if (c[b[i]] == 0) { n cout << 0 ; n continue; n } n for (int j = poz; j <= n; ++j) { n c[a[j]] = 0; n if (a[j] == b[i]) { n cout << j - poz + 1 << ; n poz = j + 1; n break; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, cou = 0; n cin >> n; n string s; n cin >> s; n int res = n + 1; n for (int i = 0; i < n; i++) { n if (s[i] == H ) cou++; n } n for (int i = 0; i < n; i++) { n int cnt = 0; n for (int j = 0; j < cou; j++) { n if (s[(i + j) % n] == T ) cnt++; n } n res = min(res, cnt); n } n cout << res << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int x[55], y[55]; n int main(int argc, char** argv) { n int n; n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &x[i]); n for (int i = 1; i <= n; i++) scanf( %d , &y[i]); n int sum = 0; n for (int i = 1; i <= n; i++) { n sum += x[i] - y[i]; n } n if (sum >= 0) n cout << Yes ; n else n cout << No ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void read(T &x) { n T res = 0, f = 1; n char c = getchar(); n while (!isdigit(c)) { n if (c == - ) f = -1; n c = getchar(); n } n while (isdigit(c)) { n res = (res << 3) + (res << 1) + c - 0 ; n c = getchar(); n } n x = res * f; n } n const long long N = 200000 + 10; n long long w, a[N], n, mn = 1e13, mx = -1e13, sum; n int main() { n read(n), read(w); n for (int i = 1; i <= n; i++) { n read(a[i]); n sum += a[i]; n mn = min(mn, sum); n mx = max(mx, sum); n } n if (abs(mx) > w || abs(mn) > w) { n printf( 0 ); n return 0; n } n long long l = 0, r = w; n if (mn < 0) { n l = 0 - mn; n } n if (mx > 0) { n r = w - mx; n } n long long ans = r - l + 1; n if (ans > 0) n printf( %lld , r - l + 1); n else n printf( 0 ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long getint() { n long long _x = 0, _tmp = 1; n char _tc = getchar(); n while ((_tc < 0 || _tc > 9 ) && _tc != - ) _tc = getchar(); n if (_tc == - ) _tc = getchar(), _tmp = -1; n while (_tc >= 0 && _tc <= 9 ) _x *= 10, _x += (_tc - 0 ), _tc = getchar(); n return _x * _tmp; n } n inline long long add(long long _x, long long _y, n long long _mod = 1000000007ll) { n long long _ = _x + _y; n if (_ >= _mod) _ -= _mod; n return _; n } n inline long long sub(long long _x, long long _y, n long long _mod = 1000000007ll) { n long long _ = _x - _y; n if (_ < 0) _ += _mod; n return _; n } n inline long long mul(long long _x, long long _y, n long long _mod = 1000000007ll) { n long long _ = _x * _y; n if (_ >= _mod) _ %= _mod; n return _; n } n long long mypow(long long _a, long long _x, long long _mod) { n if (_x == 0) return 1ll; n long long _tmp = mypow(_a, _x / 2, _mod); n _tmp = mul(_tmp, _tmp, _mod); n if (_x & 1) _tmp = mul(_tmp, _a, _mod); n return _tmp; n } n long long mymul(long long _a, long long _x, long long _mod) { n if (_x == 0) return 0ll; n long long _tmp = mymul(_a, _x / 2, _mod); n _tmp = add(_tmp, _tmp, _mod); n if (_x & 1) _tmp = add(_tmp, _a, _mod); n return _tmp; n } n inline bool equal(double _x, double _y) { n return _x > _y - 1e-9 && _x < _y + 1e-9; n } n int __ = 1, _cs; n void build() {} n long long n, m, a, b; n void init() { n n = getint(); n m = getint(); n a = getint() - 1; n b = getint() - 1; n } n void solve() { n long long ai = a / m, aj = a % m; n long long bi = b / m, bj = b % m; n if (ai == bi || (a == 0 && b == n - 1) || m == 1) { n puts( 1 ); n exit(0); n } n if (aj == 0 && (bj == m - 1 || b == n - 1)) { n puts( 1 ); n exit(0); n } n if (aj == 0 || bj == m - 1 || bi == ai + 1 || bj + 1 == aj || b == n - 1) { n puts( 2 ); n exit(0); n } n puts( 3 ); n } n int main() { n build(); n while (__--) { n init(); n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream &operator<<(ostream &os, pair P) { n return os << ( << P.first << , << P.second << ) ; n } n template n ostream &operator<<(ostream &os, vector V) { n os << [ ; n for (auto vv : V) os << vv << , ; n return os << ] ; n } n template n void _dbg(const char *sdbg, TH h) { n cerr << sdbg << = << h << n ; n } n template n void _dbg(const char *sdbg, TH h, TA... a) { n while (*sdbg != , ) cerr << *sdbg++; n cerr << = << h << , ; n _dbg(sdbg + 1, a...); n } n const long long N = 4e5 + 7; n long long n, a[N], pre[N], ansLen, ansIdx; n double ans = -1.0; n double sum(long long l, long long r) { n return pre[r] - (l > 0 ? pre[l - 1] : 0); n } n double f(long long len, long long idx) { n double ret = pre[idx] - pre[idx - len - 1]; n ret += pre[n] - pre[n - len]; n ret /= len + len + 1; n ret -= a[idx]; n if (ret > ans) { n ans = ret; n ansIdx = idx; n ansLen = len; n } n return ret; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n cin >> n; n for (long long i = 1; i <= n; i++) cin >> a[i]; n sort(a + 1, a + n + 1); n for (long long i = 1; i <= n; i++) pre[i] = a[i] + pre[i - 1]; n for (long long i = 1; i <= n; i++) { n long long cnt = min(i - 1, n - i); n long long lo = 0, hi = cnt; n while (hi - lo > 3) { n long long m1 = lo + (hi - lo) / 3, m2 = hi - (hi - lo) / 3; n if (f(m1, i) < f(m2, i)) n lo = m1; n else n hi = m2; n } n for (long long k = lo; k <= hi; k++) f(k, i); n } n cout << 2 * ansLen + 1 << n ; n for (long long i = ansIdx; i >= ansIdx - ansLen; i--) cout << a[i] << ; n for (long long i = n - ansLen + 1; i <= n; i++) cout << a[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int i, n, a, j, b, m, s = 0, t = 0; n int x[105] = {0}; n cin >> n >> m; n for (i = 1; i <= m; ++i) { n cin >> a; n for (j = a; j <= n; ++j) { n if (x[j] != 0) break; n x[j] = a; n } n } n for (i = 1; i <= n; ++i) cout << x[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 2e5 + 100; n const int MAXM = 15; n int N, Q, M; n int log2(int v) { n int r = 1; n while (v >>= 1) r++; n return r; n } n int a[MAXN]; n int t[2][MAXN]; n struct ST { n int v[3 * MAXN][2][MAXM]; n int l[3 * MAXN], r[3 * MAXN]; n bool lz[3 * MAXN]; n int NXT; n int sz; n void updv(const int& n) { n assert(n != -1 and l[n] != -1 and r[n] != -1); n for (int i = 0; i <= M; i++) n for (int j = 0; j < 2; j++) v[n][j][i] = v[l[n]][j][v[r[n]][j][i]]; n } n void init(int n, int nl, int nr) { n assert(n != -1 and nl < nr); n lz[n] = false; n l[n] = r[n] = -1; n if (nr - nl == 1) { n for (int i = 0; i < M; i++) n for (int j = 0; j < 2; j++) v[n][j][i] = i + 1; n v[n][a[nl]][M] = M, v[n][!a[nl]][M] = 0; n } n if (nr - nl > 1) { n int m = nl + ((nr - nl) >> 1); n init(l[n] = NXT++, nl, m); n init(r[n] = NXT++, m, nr); n updv(n); n } n } n ST() {} n ST(const int& s, bool ini) { n sz = s; n NXT = 0; n if (ini) init(NXT++, 0, sz); n } n void prop(int n, int nl, int nr) { n if (!lz[n]) return; n for (int i = 0; i <= M; i++) swap(v[n][0][i], v[n][1][i]); n if (nr - nl > 1) { n lz[l[n]] = !lz[l[n]]; n lz[r[n]] = !lz[r[n]]; n } n lz[n] = false; n } n void upd(int n, int nl, int nr, int gl, int gr) { n if (gl <= nl and gr >= nr) { n lz[n] = !lz[n]; n prop(n, nl, nr); n return; n } n if (nr - nl > 1) { n prop(n, nl, nr); n int m = nl + ((nr - nl) >> 1); n if (gl < m) n upd(l[n], nl, m, gl, gr); n else n prop(l[n], nl, m); n if (gr > m) n upd(r[n], m, nr, gl, gr); n else n prop(r[n], m, nr); n updv(n); n return; n } n assert(false); n } n void upd(int gl, int gr) { upd(0, 0, sz, gl, gr); } n int qry(int n, int nl, int nr, int gl, int gr, int c = M) { n prop(n, nl, nr); n if (gl <= nl and gr >= nr) { n return v[n][0][c]; n } n if (nr - nl > 1) { n int m = nl + ((nr - nl) >> 1); n if (gr > m) c = qry(r[n], m, nr, gl, gr, c); n if (gl < m) c = qry(l[n], nl, m, gl, gr, c); n return c; n } n assert(false); n return -1; n } n int qry(int gl, int gr) { return qry(0, 0, sz, gl, gr); } n } st; n void q1() { n int l, r, v; n scanf( %d%d%d , &l, &r, &v); n if (v & 1) st.upd(--l, r); n } n void q2() { n int l, r; n scanf( %d%d , &l, &r); n printf( %d n , (st.qry(--l, r) == 0 ? 2 : 1)); n } n int main() { n scanf( %d%d%d , &N, &M, &Q); n for (int i = 0, v; i < N; i++) { n scanf( %d , &v); n a[i] = v & 1; n } n st = *(new ST(N, true)); n for (int i = 0, type; i < Q; i++) { n scanf( %d , &type); n if (type == 1) n q1(); n else if (type == 2) n q2(); n } n return 0; n } n "} +{"func_code_string": "#include n const int N = (int)2e5 + 5; n const int MOD = (int)1e9 + 7; n const bool MULTI_TEST = true; n const double PI = acos(-1.0); n using namespace std; n void solve() { n int n; n cin >> n; n int a[n]; n int max = 0, index = -1; n for (int i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] > max) { n max = a[i]; n } n } n if (*min_element(a, a + n) == max) n cout << -1 n ; n else { n for (int i = 0; i < n - 1; i++) { n if (a[i] == max && a[i] > a[i + 1]) index = i + 1; n } n if (index != -1) { n cout << index << n ; n return; n } else { n for (int i = 1; i < n; i++) { n if (a[i] == max && a[i] > a[i - 1]) index = i + 1; n } n } n cout << index << endl; n } n } n int main() { n ios_base::sync_with_stdio(false); n int t = 1; n if (MULTI_TEST) cin >> t; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[100500], c[300], dp[100500][305], z, cnt, tmp, e, s, l, r, n, m, x, n y, k, j, p, k1, k2, i, cur, rez; n vector f[100500]; n long long Abs(long long x) { n if (x < 0) return -x; n return x; n } n int main() { n cin >> n >> m >> s >> e; n for (i = 0; i < n; i++) cin >> a[i]; n for (j = 0; j < m; j++) { n cin >> x; n f[x].push_back(j); n } n for (i = 0; i <= n; i++) n for (j = 0; j <= s / e; j++) dp[i][j] = m + 1; n dp[0][0] = -1; n for (i = 0; i < n; i++) { n for (j = 0; j <= s / e; j++) n if (dp[i][j] != m + 1) { n long long tmp = upper_bound(f[a[i]].begin(), f[a[i]].end(), dp[i][j]) - n f[a[i]].begin(); n if (tmp != f[a[i]].size()) n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], f[a[i]][tmp]); n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]); n } n } n rez = 0; n for (i = 0; i <= n; i++) { n for (j = 0; j <= s / e; j++) { n if (i + dp[i][j] + 1 + j * e <= s && dp[i][j] != m + 1) rez = max(rez, j); n } n } n cout << rez << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct data { n float x, a; n } h[1005]; n bool cmp(data a, data b) { return a.x < b.x; }; n int main() { n int n, ans = 2; n float t, d; n cin >> n >> t; n for (int i = 1; i <= n; i++) cin >> h[i].x >> h[i].a; n sort(h + 1, h + n + 1, cmp); n for (int i = 1; i < n; i++) { n d = h[i + 1].x - h[i].x - h[i].a / 2 - h[i + 1].a / 2; n if (d > t) ans += 2; n if (abs(d - t) < 1e-6) ans++; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int main() { n cin >> n; n int ans = 0; n if (n % 2 == 0) { n ans = 3 * (n / 2); n } else { n ans = 3 * (n / 2) + 1; n } n cout << ans << endl; n for (int i = 1; i <= n; i++) { n if (!(i % 2)) cout << i << ; n } n for (int i = 1; i <= n; i++) { n if (i % 2) cout << i << ; n } n for (int i = 1; i <= n; i++) { n if (!(i % 2)) cout << i << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n using minpq = priority_queue, greater>; n const int N = 5e5 + 5; n int n; n long long a[N], x; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> n; n for (int i = (0); i < ((n + 1) / 2); i++) cin >> a[i]; n cin >> x; n long long sum = 0, mn = n / 2 + 1, mx = n; n vector> ve; n for (int i = (n + 1) / 2 - 1; i >= 0; i--) { n sum += a[i]; n if (x > 0) { n if (sum <= 0) { n mn = max(mn, n min((long long)n - i + 1, (-sum + x) / x + (n + 1) / 2 - i)); n } n } else if (x < 0) { n if (sum > 0) { n long long val = (sum - x - 1) / -x - 1 + (n + 1) / 2 - i; n if (n - i + 1 > val) { n ve.emplace_back(val + 1, n - i); n } n } else { n mn = max(mn, (long long)n - i + 1); n } n } else if (sum <= 0) { n mn = max(mn, (long long)n - i + 1); n } n } n reverse((ve).begin(), (ve).end()); n for (auto &p : ve) { n if (p.first <= mx && mx <= p.second) { n mx = p.first - 1; n } n } n if (mn <= mx) { n cout << mx << n ; n } else { n cout << -1 n ; n } n } n "} +{"func_code_string": "#include n const long long Inf = 1e18; n const long double eps = 1e-7; n long long LINF = (long long)2e18; n using namespace std; n long long mod = 1e9 + 7; n long long mod5 = 1e9 + 9; n long long mod3 = 998244353; n long long mod4 = 1000003; n long long mod2 = 1e9 + 123; n const int MAXN = 10100000; n const int INF = 1000000000; n vector > a; n int n, m; n vector > mx; n int rec(int pos, vector mxs) { n if (pos == m) { n int ss = 0; n for (long long(i) = 0; (i) < n; (i)++) { n ss += mxs[i]; n } n return ss; n } n int cur = 0; n int ss = 0; n for (long long(i) = 0; (i) < n; (i)++) { n cur += mxs[i]; n ss += mxs[i]; n } n int ans = cur; n for (long long(i) = 0; (i) < n; (i)++) { n cur = ss; n vector lol = mxs; n for (long long(j) = 0; (j) < n; (j)++) { n if (a[(i + j) % n][mx[pos].second] > mxs[j]) { n cur += a[(i + j) % n][mx[pos].second] - mxs[j]; n lol[j] = a[(i + j) % n][mx[pos].second]; n } n } n ans = max(ans, rec(pos + 1, lol)); n } n return ans; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cout.setf(ios::fixed); n cout.precision(20); n int tt; n cin >> tt; n while (tt--) { n cin >> n >> m; n a.clear(); n a.resize(n, vector(m)); n for (long long(i) = 0; (i) < n; (i)++) { n for (long long(j) = 0; (j) < m; (j)++) { n cin >> a[i][j]; n } n } n mx.clear(); n for (long long(i) = 0; (i) < m; (i)++) { n int cur = -1; n for (long long(j) = 0; (j) < n; (j)++) { n cur = max(cur, a[j][i]); n } n mx.push_back({cur, i}); n } n sort((mx).rbegin(), (mx).rend()); n mx.resize(min(4, m)); n m = min(m, 4); n vector kek(n, 0); n cout << rec(0, kek) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long M = 1000000007; n int main() { n int n, x, y; n cin >> n >> x >> y; n string s; n cin >> s; n int ans = 0; n for (int i = 0; i < x; i++) { n int pos = n - i - 1; n char current = 0 ; n if (i == y) { n current = 1 ; n } n if (current != s[pos]) { n ans++; n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 10, OO = 0x3f3f3f3f; n int dx[] = {1, 0, -1, 0}; n int dy[] = {0, 1, 0, -1}; n int tc, n, m; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n string s; n cin >> tc; n while (tc--) { n cin >> n >> m; n cin >> s; n vector freq(n + 1, 0); n vector indx(m); n for (int i = 0; i < int(m); i++) { n cin >> indx[i]; n freq[0]++; n freq[indx[i]]--; n } n freq[0]++; n for (int i = int(1); i <= int(n - 1); i++) freq[i] += freq[i - 1]; n vector karakter(26, 0); n for (int i = 0; i < int(n); i++) karakter[s[i] - a ] += freq[i]; n for (int i = 0; i < int(26); i++) cout << karakter[i] << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 10; n int a[N]; n int sum[11]; n int main() { n int n; n cin >> n; n for (int i = 1; i <= n; ++i) { n scanf( %d , &a[i]); n sum[a[i]]++; n } n while (1) { n int i, aa[11]; n memset(aa, 0, sizeof(aa)); n for (i = 1; i < 11; ++i) aa[i] = sum[i]; n sort(aa, aa + 11); n for (i = 0; i < 11; ++i) n if (aa[i]) break; n if (aa[10] - aa[i] > 1) { n if (aa[i] == 1) { n if (aa[i + 1] == aa[10]) { n cout << n; n break; n } n } n } else if (aa[i] == aa[10]) { n if (aa[i] == 1 || i == 10) { n cout << n; n break; n } n } else { n if (aa[i] == 1) { n if (aa[i + 1] == aa[10]) { n cout << n; n break; n } n } n if (aa[i] == aa[9]) { n cout << n; n break; n } n } n sum[a[n]]--; n n--; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n bool umin(T& a, T b) { n if (a > b) { n a = b; n return 1; n } n return 0; n } n template n bool umax(T& a, T b) { n if (a < b) { n a = b; n return 1; n } n return 0; n } n long long a, b, c, type, ric[300007], par[300007], cost[300007], d[300007], n, n m, lvl[300007], P[300007][20 * 2]; n vector > E[300007]; n pair, long long> way[300007]; n long long atabul(long long x) { n if (ric[x] == x) return x; n return ric[x] = atabul(ric[x]); n } n void dfs(long long x, long long y, long long z) { n lvl[x] = lvl[y] + 1; n P[x][0] = y; n cost[x] = z; n if (z == 1) { n ric[x] = y; n atabul(x); n } n for (int i = 0; i < int(E[x].size()); i++) n if (E[x][i].first != y) dfs(E[x][i].first, x, E[x][i].second); n } n void build_table() { n for (int j = 1; j <= 20; j++) n for (int i = 1; i <= n; i++) n if (P[i][j - 1] > 0) P[i][j] = P[P[i][j - 1]][j - 1]; n } n void form_LCA() { n for (int i = 0; i <= n; i++) n for (int j = 0; j <= 20; j++) P[i][j] = -1; n dfs(1, 0, 0); n build_table(); n } n long long LCA(long long x, long long y) { n if (lvl[x] < lvl[y]) swap(x, y); n for (int i = 20; i >= 0; i--) n if (lvl[x] - (1 << i) >= lvl[y]) x = P[x][i]; n if (x == y) return x; n for (int i = 20; i >= 0; i--) n if (P[x][i] > 0 && P[x][i] != P[y][i]) x = P[x][i], y = P[y][i]; n return P[x][0]; n } n int main() { n scanf( %lld%lld , &n, &m); n ric[n] = n; n for (int i = 1; i < n; i++) { n scanf( %lld%lld%lld , &a, &b, &c); n E[a].push_back(make_pair(b, c)); n E[b].push_back(make_pair(a, c)); n ric[i] = i; n way[i] = {{a, b}, c}; n } n form_LCA(); n while (m--) { n scanf( %lld , &type); n if (type == 1) { n scanf( %lld%lld%lld , &a, &b, &c); n long long tr = LCA(a, b); n while (atabul(a) != atabul(tr) && c > 0) { n if (cost[a] == 1) { n a = atabul(a); n continue; n } n c /= cost[a]; n a = P[a][0]; n } n while (atabul(b) != atabul(tr) && c > 0) { n if (cost[b] == 1) { n b = atabul(b); n continue; n } n c /= cost[b]; n b = P[b][0]; n } n printf( %lld n , c); n } else { n scanf( %lld%lld , &a, &b); n long long qm = way[a].first.first, gr = way[a].first.second; n if (lvl[qm] < lvl[gr]) swap(qm, gr); n cost[qm] = b; n if (b == 1) { n ric[qm] = gr; n atabul(qm); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int in() { n int32_t x; n scanf( %d , &x); n return x; n } n inline string get() { n char ch[1000010]; n scanf( %s , ch); n return ch; n } n const int MAX_LG = 60; n const long long maxn = 1e6 + 100; n const long long base = 29; n const long long mod = 1e9 + 7; n const long long INF = 1e18 + 100; n struct state { n long long a = 0, b = 0, tp = 0; n state() {} n state(long long a, long long b, long long tp) : a(a), b(b), tp(tp) {} n }; n long long cnt[maxn]; n long long di[51][51][2]; n long long C[51][51]; n long long ways[51][51][2]; n queue q; n int32_t main() { n long long n = in(), k = in(); n for (long long i = 0; i < n; i++) cnt[in() / 51]++; n q.push({cnt[0], cnt[1], 0}); n for (long long i = 0; i <= 50; i++) n for (long long j = 0; j <= 50; j++) di[i][j][0] = di[i][j][1] = INF; n for (long long i = 0; i <= 50; i++) { n for (long long j = 0; j <= i; j++) { n if (j == 0) n C[i][j] = 1; n else n C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod; n } n } n di[cnt[0]][cnt[1]][0] = 0; n ways[cnt[0]][cnt[1]][0] = 1; n while (q.empty() == false) { n state now = q.front(); n q.pop(); n long long a2 = cnt[0] - now.a; n long long b2 = cnt[1] - now.b; n for (long long i = 0; i <= now.a; i++) { n for (long long j = 0; j <= now.b; j++) { n if (i + j == 0) continue; n if (i * 50 + j * 100 > k) continue; n long long d2 = di[now.a][now.b][now.tp] + 1; n long long *d3 = &di[a2 + i][b2 + j][now.tp ^ 1]; n if (*d3 == INF) { n *d3 = d2; n q.push({a2 + i, b2 + j, now.tp ^ 1}); n } n if (*d3 == d2) { n ways[a2 + i][b2 + j][now.tp ^ 1] += ways[now.a][now.b][now.tp] * n C[now.a][i] % mod * C[now.b][j] % n mod; n if (ways[a2 + i][b2 + j][now.tp ^ 1] > mod) n ways[a2 + i][b2 + j][now.tp ^ 1] -= mod; n } n } n } n } n if (ways[cnt[0]][cnt[1]][1] == 0) n return cout << -1 << n << 0 << n , 0; n else { n cout << di[cnt[0]][cnt[1]][1] << n ; n cout << ways[cnt[0]][cnt[1]][1] << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long modulo(long long base, long long exponent, long long modulus); n long long choose(long long n, long long k); n long long inverse(long long a, long long m); n void build(); n void fileio(); n long long ncr(long long n, long long r); n const int nax = 1e6 + 10; n const int LG = log2(nax) + 1; n vector fact(nax); n long long dp[1LL << 20]; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n, m; n cin >> n >> m; n string s; n cin >> s; n long long freq[m][m]; n memset(freq, 0, sizeof(freq)); n for (int i = 1; i < n; i++) { n freq[s[i] - a ][s[i - 1] - a ]++; n freq[s[i - 1] - a ][s[i] - a ]++; n } n for (int i = 0; i < (1LL << m); i++) dp[i] = 1000000000000000; n for (int mask = 0; mask < (1LL << m); mask++) { n long long cost = 0; n for (int i = 0; i < m; i++) { n for (int j = i + 1; j < m; j++) { n if ((mask >> i & 1) ^ (mask >> j & 1)) { n cost += freq[i][j]; n } n } n } n for (int i = 0; i < m; i++) { n if ((mask & (1LL << i)) == 0) continue; n dp[mask] = min(dp[mask], dp[mask ^ (1LL << i)] + cost); n if ((mask ^ (1LL << i)) == 0) dp[mask] = cost; n } n } n long long ans = dp[(1LL << m) - 1]; n cout << ans << n ; n return 0; n } n long long ncr(long long n, long long r) { n if (r > n || r < 0 || n < 0) return 0; n long long ans = fact[n]; n long long temp = (fact[n - r] * fact[r]) % 1000000007; n ans = (ans * inverse(temp, 1000000007)) % 1000000007; n return ans; n } n void fileio() { n freopen( input.txt , r , stdin); n freopen( output.txt , w , stdout); n } n void build() { n fact[0] = 1; n for (long long i = 1; i < nax; i++) fact[i] = (fact[i - 1] * i) % 1000000007; n } n long long modulo(long long base, long long exponent, long long modulus) { n if (modulus == 1) return 0; n long long result = 1; n base = base % modulus; n while (exponent > 0) { n if (exponent % 2 == 1) { n result = (result * base) % modulus; n } n exponent = exponent >> 1; n base = (base * base) % modulus; n } n return result; n } n long long choose(long long n, long long k) { n if (k == 0) return 1; n return (n * choose(n - 1, k - 1)) / k; n } n void EE(long long a, long long b, long long &co1, long long &co2) { n if (a % b == 0) { n co1 = 0; n co2 = 1; n return; n } n EE(b, a % b, co1, co2); n long long temp = co1; n co1 = co2; n co2 = temp - co2 * (a / b); n } n long long inverse(long long a, long long m) { n long long x, y; n EE(a, m, x, y); n if (x < 0) x += m; n return x; n } n "} +{"func_code_string": "#include n using namespace std; n vector g[100500]; n int c[100500]; n int n; n bool vis[100500]; n bool dfs(int u, int cu) { n if (vis[u]) return 0; n vis[u] = 1; n bool r = 0; n if (c[u] != cu) return 1; n for (int v : g[u]) r |= dfs(v, cu); n return r; n } n int main() { n scanf( %d , &n); n for (int i = 0, qwe = n - 1; i < qwe; ++i) { n int u, v; n scanf( %d%d , &u, &v); n u--; n v--; n g[u].push_back(v); n g[v].push_back(u); n } n for (int i = 0, qwe = n; i < qwe; ++i) scanf( %d , c + i); n int u = -1, sz = 0; n for (int i = 0, qwe = n; i < qwe; ++i) { n set s; n for (int v : g[i]) n if (c[i] != c[v]) s.insert(v); n if (s.size() > sz) u = i, sz = s.size(); n } n if (u == -1) { n puts( YES n1 ); n return 0; n } n vis[u] = 1; n for (int i = 0, qwe = g[u].size(); i < qwe; ++i) n if (dfs(g[u][i], c[g[u][i]])) { n puts( NO ); n return 0; n } n printf( YES n%d n , u + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int a[105][105]; n int main() { n scanf( %d %d , &n, &m); n if (n + m == 3 or n + m == 4) n printf( -1 n ); n else { n int num = 2; n if (n >= m) { n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) { n if (num > m * n) num = 1; n a[i][j] = num; n num += 2; n } n } else n for (int j = 1; j <= m; j++) n for (int i = 1; i <= n; i++) { n if (num > m * n) num = 1; n a[i][j] = num; n num += 2; n } n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) { n printf( %d , a[i][j]); n if (j == m) n printf( n ); n else n printf( ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const inline int __GET_INT() { n int ret; n scanf( %d , &ret); n return ret; n } n const int maxn = 2002; n int n, m; n char grid[maxn][maxn]; n int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1}; n int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1}; n int cntStar(int r, int c) { n return (grid[r][c] == * ) + (grid[r + 1][c] == * ) + n (grid[r][c + 1] == * ) + (grid[r + 1][c + 1] == * ); n } n void dfs(int r, int c) { n if (r < 0 || c < 0 || (r + 1) >= n || (c + 1) >= m) { n return; n } n if (cntStar(r, c) != 1) { n return; n } n grid[r][c] = grid[r + 1][c] = grid[r][c + 1] = grid[r + 1][c + 1] = . ; n for (int i = 0; i < 2; ++i) n for (int j = 0; j < 2; ++j) { n for (int k = 0; k < 8; ++k) { n dfs(r + i + dx[k], c + j + dy[k]); n } n } n } n int main() { n n = __GET_INT(); n m = __GET_INT(); n for (int i = 0; i < n; ++i) { n scanf( %s , grid[i]); n } n for (int i = 0; (i + 1) < n; ++i) n for (int j = 0; (j + 1) < m; ++j) { n dfs(i, j); n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) printf( %c , grid[i][j]); n puts( ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[200005]; n int b[200005]; n int n, k, Q; n long long ans; n int l, r; n int main() { n scanf( %d , &Q); n while (Q--) { n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); n for (int i = 1; i <= k; i++) scanf( %d , &b[i]); n sort(a + 1, a + 1 + n); n sort(b + 1, b + 1 + k); n int l, r; n ans = 0; n l = 1; n r = n; n for (int i = 1; i <= k; i++) { n if (b[i] == 1) n ans += a[r] + a[r]; n else n break; n r--; n } n for (int i = k; i >= 1; i--) { n if (b[i] == 1) break; n ans += a[l] + a[r]; n r--; n l += b[i] - 1; n } n printf( %lld n , ans); n } n } n "} +{"func_code_string": "#include n using namespace std; n long long max(long long a, long long b) { n if (a > b) return a; n return b; n } n long long min(long long a, long long b) { n if (a < b) return a; n return b; n } n const int MOD = 1e9 + 7, N = 102, L = 3005, INF = INT_MAX; n pair a[N]; n long long dp[L][N][2]; n int main() { n int n, l; n cin >> n >> l; n for (int i = 0; i < n; i++) { n cin >> a[i].first >> a[i].second; n } n for (int i = 1; i <= l; i++) { n for (int j = 0; j < n; j++) { n if (a[j].first == i) n dp[i][j][0] = 1; n else if (a[j].first < i) { n for (int c = 0; c < n; c++) { n if (c == j) continue; n if (a[c].second == a[j].first) n dp[i][j][0] += dp[i - a[j].first][c][0]; n if (a[c].first == a[j].first && a[c].first != a[c].second) n dp[i][j][0] += dp[i - a[j].first][c][1]; n dp[i][j][0] %= MOD; n } n } n if (a[j].second == i) n dp[i][j][1] = 1; n else if (a[j].second < i) { n for (int c = 0; c < n; c++) { n if (c == j) continue; n if (a[c].second == a[j].second) n dp[i][j][1] += dp[i - a[j].second][c][0]; n if (a[c].first == a[j].second && a[c].first != a[c].second) n dp[i][j][1] += dp[i - a[j].second][c][1]; n dp[i][j][1] %= MOD; n } n } n } n } n long long ans = 0; n for (int i = 0; i < n; i++) { n ans += dp[l][i][0]; n if (a[i].first != a[i].second) ans += dp[l][i][1]; n ans %= MOD; n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 11, N = 2e5 + 5; n int n, k; n int a[N]; n map rem[M]; n long long solve() { n long long ans = 0; n for (int i = 0; i < n; ++i) { n unsigned long long f = 10; n int ln = ((int)(to_string(a[i])).size()); n for (int l = 1; l < M; ++l) { n int r = (k - (int)((f * a[i]) % k)) % k; n ans += rem[l][r]; n if (l == ln && r == a[i] % k) ans--; n f *= 10; n } n } n return ans; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(nullptr); n cout.tie(nullptr); n cin >> n >> k; n for (int i = 0; i < n; ++i) { n cin >> a[i]; n int l = ((int)(to_string(a[i])).size()); n rem[l][a[i] % k]++; n } n cout << solve() << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, k, x; n cin >> n; n for (long long i = 0; i < n; i++) { n cin >> k >> x; n cout << x + (k - 1) * 9 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 5e5 + 5; n int main() { n long long v, w1, w2, v1, v2; n cin >> v >> w1 >> w2 >> v1 >> v2; n long long x = max(v1, v2); n if (x * x >= v) { n if (v1 < v2) swap(v1, v2), swap(w1, w2); n long long ans = 0; n for (int i = 0; i <= v / v1; i++) { n ans = max(ans, i * w1 + (v - i * v1) / v2 * w2); n } n cout << ans << endl; n } else { n if (1.0 * w1 / v1 > 1.0 * w2 / v2) { n swap(v1, v2), swap(w1, w2); n } n long long ans = 0; n for (int i = 0; i < v2; i++) { n ans = max(ans, i * w1 + (v - i * v1) / v2 * w2); n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n const int mod = 1000000007; n const int inf = 1000000009; n const long long INF = 1000000000000000009; n const long long big = 1000000000000000; n const long double eps = 0.000000000000000000001; n using namespace std; n const int M = 100000; n int W[M + 5], U[M + 5], cnt[M + 5]; n vector D[M + 5], S; n long long int funkcja(int x) { n long long int wynik = 0; n for (auto v : D[x]) wynik += cnt[v] * U[v]; n return wynik; n } n void aktualizuj(int x, int c) { n for (auto v : D[x]) cnt[v] += c; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(); n cout.tie(); n int n; n cin >> n; n for (int i = 1; i <= M; i++) { n for (int j = i; j <= M; j += i) D[j].push_back(i); n if (i == 1) n U[i] = 1; n else if ((i / D[i][1]) % D[i][1] == 0) n U[i] = 0; n else n U[i] = -U[i / D[i][1]]; n } n long long int wynik = 0; n for (int i = 1; i <= n; i++) { n int a; n cin >> a; n wynik = max(wynik, (long long int)a); n for (auto v : D[a]) W[v] = 1; n } n for (int j = M; j >= 1; j--) { n if (!W[j]) continue; n while (funkcja(j)) { n wynik = max(wynik, (long long int)j * S.back()); n aktualizuj(S.back(), -1); n S.pop_back(); n } n aktualizuj(j, 1); n S.push_back(j); n } n cout << wynik; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a, b, sum, x; n int main() { n cin >> a >> b; n while (a) { n sum += a; n x += a % b; n a /= b; n a += x / b; n x %= b; n } n cout << sum; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, arr[500010], temp, j, i, ans; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n; n for (long long i = 0; i < n; i++) { n cin >> arr[i]; n }; n sort(arr, arr + n); n i = 0, j = n / 2; n ans = n; n while (i < n / 2) { n while (j < n) { n if (arr[i] * 2 <= arr[j]) { n ans--; n j++; n break; n } else n j++; n } n i++; n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int l[210000], r[210000]; n vector > v; n int n, m, k; n int mp[1000]; n int lbit[1000]; n int dp[210000][300]; n int msk[210000]; n int main() { n for (int i = 0; i < 210000; i++) n for (int j = 0; j < 300; j++) dp[i][j] = -0x3f3f3f3f; n dp[0][0] = 0; n for (int i = 0; i < (1 << 9); i++) { n int cnt = 0; n for (int j = 0; j < 8; j++) n if (i & (1 << j)) { n mp[i]++; n } else if (lbit[i] == 0) { n lbit[i] = (1 << j); n } n } n cin >> n >> m >> k; n for (int i = 1; i <= n; i++) { n scanf( %d%d , &l[i], &r[i]); n v.push_back({l[i] - 1, i}); n v.push_back({r[i], -i}); n } n sort(v.begin(), v.end()); n int tim = 0; n int posmsk = 0; n int ans = 0; n int lst = 0; n for (auto p : v) { n tim++; n if (p.second < 0) { n for (int j = 0; j < (1 << 8); j++) n if (j & msk[-p.second]) n dp[tim][j ^ msk[-p.second]] = n max(dp[tim][j ^ msk[-p.second]], n dp[tim - 1][j] + max(0, p.first - lst) * (mp[j] & 1)); n else { n dp[tim][j] = n max(dp[tim][j], dp[tim - 1][j] + (p.first - lst) * (mp[j] & 1)); n } n posmsk ^= msk[-p.second]; n } else { n msk[p.second] = lbit[posmsk]; n posmsk ^= msk[p.second]; n for (int j = 0; j < (1 << 8); j++) n if ((j & msk[p.second]) == 0) { n dp[tim][j ^ msk[p.second]] = n max(dp[tim][j ^ msk[p.second]], n dp[tim - 1][j] + (max(0, p.first - lst)) * (mp[j] & 1)); n dp[tim][j] = n max(dp[tim][j], dp[tim - 1][j] + (p.first - lst) * (mp[j] & 1)); n } n } n lst = p.first; n } n cout << dp[2 * n][0]; n return ~~(0 ^ 0 ^ 0); n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 998244353; n const int N = 3005; n int n, c, a[N], dp[N][N], g[N][N], freq[N], mul[N], imul[N], pw[N], cnt[N]; n int dp2[2][N][1 << 12]; n int inverse(int n) { n if (n == 1) return 1; n return inverse(mod % n) * 1LL * (mod - mod / n) % mod; n } n inline void add(int &x, int y) { n x += y; n if (x >= mod) x -= mod; n } n void solve1() { n for (int i = 1; i <= n; i++) { n a[i]--; n } n memset(dp2, 0, sizeof(dp2)); n int flg = 0; n dp2[0][0][0] = 1; n for (int i = 1; i <= n; i++) { n for (int p = 0; p * c <= i; p++) { n for (int mask = 0; mask < (1 << c); mask++) { n dp2[flg ^ 1][p][mask] = 0; n } n } n for (int p = 0; p * c <= i; p++) { n for (int mask = 0; mask + 1 < (1 << c); mask++) { n int nmask = mask | (1 << a[i]); n if (nmask + 1 == (1 << c)) { n add(dp2[flg ^ 1][p + 1][0], dp2[flg][p][mask]); n } else { n add(dp2[flg ^ 1][p][nmask], dp2[flg][p][mask]); n } n add(dp2[flg ^ 1][p][mask], dp2[flg][p][mask]); n } n } n flg ^= 1; n } n memset(cnt, 0, sizeof(cnt)); n for (int p = 0; p <= n; p++) { n for (int mask = 0; mask + 1 < (1 << c); mask++) { n add(cnt[p], dp2[flg][p][mask]); n } n } n add(cnt[0], mod - 1); n for (int i = 0; i <= n; i++) { n cout << cnt[i] << ; n } n cout << n ; n } n void solve2() { n mul[0] = 0; n pw[0] = 1; n for (int i = 1; i <= n; i++) { n mul[i] = mul[i - 1] + mul[i - 1] + 1; n if (mul[i] >= mod) mul[i] -= mod; n imul[i] = inverse(mul[i]); n pw[i] = mul[i] + 1; n } n memset(g, 0, sizeof(g)); n for (int i = 1; i <= n; i++) { n int cnt = 0; n long long prd = 1; n memset(freq, 0, sizeof(freq)); n for (int j = i; j <= n; j++) { n if (freq[a[j]] == 0) { n cnt++; n } else { n (prd *= imul[freq[a[j]]]) %= mod; n } n freq[a[j]]++; n (prd *= mul[freq[a[j]]]) %= mod; n if (cnt == c) { n g[i][j] = prd * imul[freq[a[j]]] % mod; n } n } n } n memset(dp, 0, sizeof(dp)); n for (int i = 1; i <= n; i++) { n dp[i][1] = g[1][i]; n for (int j = 1; j <= i; j++) { n for (int p = 2; p * c <= i; p++) { n dp[i][p] += dp[j - 1][p - 1] * 1LL * g[j][i] % mod; n if (dp[i][p] >= mod) dp[i][p] -= mod; n } n } n } n memset(cnt, 0, sizeof(cnt)); n for (int i = 1; i <= n; i++) { n for (int p = 1; p * c <= i; p++) { n cnt[p] += dp[i][p] * 1LL * pw[n - i] % mod; n if (cnt[p] >= mod) cnt[p] -= mod; n } n } n cnt[0] = mul[n] + mod - cnt[1]; n if (cnt[0] >= mod) cnt[0] -= mod; n for (int p = 1; p <= n; p++) { n cnt[p] += mod - cnt[p + 1]; n if (cnt[p] >= mod) cnt[p] -= mod; n } n for (int i = 0; i <= n; i++) { n cout << cnt[i] << ; n } n cout << n ; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> n >> c; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n } n if (c <= 10) { n solve1(); n } else { n solve2(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int ans[101000], mark[101000]; n char s[101000]; n int n, top, now, n_; n int main() { n do s[++n_] = getchar(); n while (s[n_] != = ); n scanf( %d , &n); n mark[1] = 0; n top = 1; n for (int i = 3; i < n_; i += 4) mark[++top] = (s[i] == - ); n now = 0; n for (int i = 1; i <= top; i++) ans[i] = 1; n for (int i = 1; i <= top; i++) n if (mark[i]) n now--; n else n now++; n while (now != n) { n if (now < n) { n int q = 0; n for (int i = 1; i <= top; i++) n if (!mark[i] && ans[i] < n) { n q = i; n break; n } n if (!q) { n printf( Impossible ); n return 0; n } n int inc = min(n - ans[q], n - now); n ans[q] += inc; n now += inc; n } else { n int q = 0; n for (int i = 1; i <= top; i++) n if (mark[i] && ans[i] < n) { n q = i; n break; n } n if (!q) { n printf( Impossible ); n return 0; n } n int inc = min(n - ans[q], now - n); n ans[q] += inc; n now -= inc; n } n } n printf( Possible n ); n printf( %d , ans[1]); n for (int i = 2; i <= top; i++) { n putchar( ); n if (mark[i]) n putchar( - ); n else n putchar( + ); n putchar( ); n printf( %d , ans[i]); n } n printf( = %d , n); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const int maxn = 4e5 + 5; n long long a[maxn], f[maxn], d[maxn]; n int q[maxn]; n int main() { n int n, i, j, l, r; n long long c; n scanf( %d%lld , &n, &c); n for (i = 1; i < (n << 1); i++) { n scanf( %lld , &a[i]); n a[i] += a[i - 1]; n } n l = r = 1; n j = q[1] = 0; n for (i = 1; i <= n; i++) { n while (j < i && a[(i << 1) - 1] - a[j << 1] > c) j++; n while (l <= r && q[l] < j) l++; n if (j) f[i] = f[j - 1] + c; n if (l <= r) f[i] = max(f[i], d[q[l]] + a[(i << 1) - 1]); n d[i] = f[i] - a[i << 1]; n while (l <= r && d[i] > d[q[r]]) r--; n q[++r] = i; n } n printf( %lld n , f[n]); n return 0; n } n "} +{"func_code_string": "#include n template n std::istream& operator>>(std::istream& input, std::vector& v) { n for (T& a : v) input >> a; n return input; n } n void answer(bool v) { n constexpr const char* s[2] = { NO , YES }; n std::cout << s[v] << n ; n } n void solve(const std::vector& a) { n const size_t n = a.size(); n for (size_t i = 1; i < n; ++i) { n if (a[i] >= a[i - 1]) return answer(true); n } n answer(false); n } n void test_case() { n size_t n; n std::cin >> n; n std::vector a(n); n std::cin >> a; n solve(a); n } n int main() { n size_t t; n std::cin >> t; n while (t-- > 0) test_case(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void __print(int x) { cerr << x; }; n void __print(long x) { cerr << x; }; n void __print(long long x) { cerr << x; }; n void __print(unsigned x) { cerr << x; }; n void __print(unsigned long x) { cerr << x; }; n void __print(unsigned long long x) { cerr << x; }; n void __print(float x) { cerr << x; }; n void __print(double x) { cerr << x; }; n void __print(long double x) { cerr << x; }; n void __print(char x) { cerr << << x << ; }; n void __print(const char *x) { cerr << << x << ; }; n void __print(const string &x) { cerr << << x << ; }; n void __print(bool x) { cerr << (x ? true : false ); } n long long powmod(long long a, long long b) { n long long res = 1; n a %= 1000000007; n assert(b >= 0); n for (; b; b >>= 1) { n if (b & 1) res = res * a % 1000000007; n a = a * a % 1000000007; n } n return res; n } n long long string_to_int(string s) { n long long ans = 0; n long long p = 1; n for (long long i = s.size() - 1; i >= 0; i--) { n ans += (s[i] - 0 ) * p; n p *= 10; n } n return ans; n } n long long fast_pow(long long a, long long b) { n if (b == 1) return a; n if (b == 0) return 1; n long long x = fast_pow(a, b / 2); n x *= x; n if (b & 1) x *= a; n return x; n } n template n void __print(const pair &x) { n cerr << { ; n __print(x.first); n cerr << , ; n __print(x.second); n cerr << } ; n } n template n void __print(const T &x) { n long long f = 0; n cerr << { ; n for (auto &i : x) cerr << (f++ ? , : ), __print(i); n cerr << } ; n } n void _print() { cerr << ] n ; } n template n void _print(T t, V... v) { n __print(t); n if (sizeof...(v)) cerr << , ; n _print(v...); n } n void t_c_c() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n, m, k; n cin >> n >> m >> k; n long long arr[m]; n for (long long i = 0; i < m; i++) { n cin >> arr[i]; n } n long long days = 0; n long long pages = k; n long long point = 0; n long long x = 0; n long long xx = 0; n for (long long i = 0; i < m;) { n if (arr[i] - x <= pages) { n while (arr[i] - xx <= pages) { n ; n x++; n i++; n } n xx = x; n days++; n } else { n long long factor = ((arr[i] - x) - pages) / k; n pages += n (((arr[i] - x) - pages) % k == 0 ? factor * k : (factor + 1) * k); n } n } n cout << days << n ; n } n int32_t main() { n t_c_c(); n return 0; n } n "} +{"func_code_string": "/** n * author: Ujjwal Tripathi n * created: 15.04.2021 18:04:04 n **/ n n n #include n using namespace std; n n #define ar array n #define ll long long n #define in insert n #define pb push_back n #define pii pair n #define vt vector n #define P_Q(x) priority_queue n #define p_q(x) priority_queue, greater> n #define For(i, n) for(ll i = 0; i < n; i++) n #define Rev(i, n) for(ll i = n-1; i >= 0; i--) n #define FOR(i, n) for(ll i = 1; i <= n; i++) n #define REV(i, n) for(ll i = n; i >= 1; i--) n #define Rep(i,a,b) for(ll i = a; i <= b; i++) n #define all(x) (x).begin(),(x).end() n #define rall(x) (x).rbegin(), (x).rend() n #define sz(x) (int) (x).size() n n // Maximum priority queue n template n using mxpq = priority_queue; n n // Minimum priority queue n template n using mnpq = priority_queue, greater>; n n n // x | (x + 1) sets lowest unset bit of x n // x & (x - 1) unsets lowest set bit of x n n const ll mod = 1e9L + 7; n const ll INF = 1e18L + 5; n const ll mxN = 2e5 + 1; n n n ll n; n ll dp[1000004]; n // remember to read no of test_cases n void solve() n { n cin>>n; n vt v(n); n For(i,n) n { n cin>>v[i]; n if(v[i]%2==0) n { n cout<> t; n FOR(tt, t) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[200010], b[200010], n, cnt = 0; n int main() { n ios::sync_with_stdio(0); n cin >> n; n for (int i = 2; i <= n; i++) cin >> a[i]; n for (int tmp = n; tmp; tmp = a[tmp]) b[++cnt] = tmp; n reverse(b + 1, b + cnt + 1); n for (int i = 1; i <= cnt; i++) cout << b[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n cin.tie(0); n cin.sync_with_stdio(0); n int t; n long long n; n cin >> t; n for (int i = 0; i < t; i++) { n cin >> n; n cout << (-1 * n) + 1 << << n << n ; n } n } n bool sortbysec(const pair &a, const pair &b) { n return (a.second < b.second); n } n bool sort_descending(int a, int b) { return (a > b); } n "} +{"func_code_string": "#include n using namespace std; n const int seed = 131; n const long long LLMAX = 2e18; n const int MOD = 1e9 + 7; n const double eps = 1e-8; n const int MAXN = 1e5 + 10; n const int hmod1 = 0x48E2DCE7; n const int hmod2 = 0x60000005; n inline long long sqr(long long x) { return x * x; } n inline int sqr(int x) { return x * x; } n inline double sqr(double x) { return x * x; } n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } n long long exgcd(long long a, long long b, long long &x, long long &y) { n long long d; n (b == 0 ? (x = 1, y = 0, d = a) n : (d = exgcd(b, a % b, y, x), y -= a / b * x)); n return d; n } n long long qpow(long long a, long long n) { n long long sum = 1; n while (n) { n if (n & 1) sum = sum * a % MOD; n a = a * a % MOD; n n >>= 1; n } n return sum; n } n inline int dcmp(double x) { n if (fabs(x) < eps) return 0; n return (x > 0 ? 1 : -1); n } n long long need[MAXN], tim[MAXN], v[MAXN][2], cnt = 0; n struct node { n long long id, a, b; n node() {} n node(long long x, long long y, long long z) { id = x, a = y, b = z; } n bool operator<(const node &n) const { n if (a - b == n.a - n.b) return a > n.a; n return a - b > n.a - n.b; n } n } in[MAXN]; n long long check(long long n, long long a, long long b) { n long long sum = 0; n for (int i = 0; i <= n; i++) tim[i] = need[i]; n for (int i = 0; i < cnt; i++) { n if (tim[in[i].id]) { n long long minn = min(tim[in[i].id], a); n sum += in[i].a * minn; n tim[in[i].id] -= minn; n a -= minn; n } n if (tim[in[i].id]) { n long long minn = min(tim[in[i].id], b); n sum += in[i].b * minn; n tim[in[i].id] -= minn; n b -= minn; n } n } n return sum; n } n int main(void) { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long n, s, sum = 0, ans = 0; n cin >> n >> s; n for (int i = 0; i < n; i++) { n cin >> need[i] >> v[i][0] >> v[i][1]; n sum += need[i]; n in[cnt++] = node(i, v[i][0], v[i][1]); n } n long long all = (sum + s - 1) / s, l = 0, r = all; n need[n] = all * s - sum; n in[cnt++] = node(n, 0, 0); n sort(in, in + cnt); n while (l + 3 < r) { n long long m1 = (l + r) / 2, m2 = (m1 + r) / 2; n if (check(n, m1 * s, (all - m1) * s) > check(n, m2 * s, (all - m2) * s)) n r = m2; n else n l = m1; n } n for (long long i = l; i <= r; i++) n ans = max(ans, check(n, i * s, (all - i) * s)); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long poww(long long a, long long b, long long md) { n return (!b ? 1 n : (b & 1 ? a * poww(a * a % md, b / 2, md) % md n : poww(a * a % md, b / 2, md) % md)); n } n const long long MAXN = 1e6 + 10; n const long long INF = 8e18; n const long long MOD = 1e9 + 7; n vector, int>> v; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n v.clear(); n int n; n cin >> n; n n = n * 2 - 1; n v.resize(n); n for (int i = 0; i < n; i++) n cin >> v[i].first.first >> v[i].first.second, v[i].second = i + 1; n sort((v).begin(), (v).end(), n greater, int>>()); n vector ans = {v.front().second}; n for (int i = 1; i < n; i += 2) { n if (v[i].first.second < v[i + 1].first.second) n ans.push_back(v[i + 1].second); n else n ans.push_back(v[i].second); n } n sort((ans).begin(), (ans).end()); n cout << YES << n ; n for (int e : ans) cout << e << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n long long int t, x, sum = 0, y, z, flag = 0, a, p, l, r, b, c, q, i, j, k, n, n m, maxi = LONG_MIN, mini = LONG_MAX, mul = 1; n string s, s1; n vector v, va, vb; n map mp, mp1; n cin >> n; n for (i = 0; i < n; i++) { n cin >> x; n mp[x]++; n mp1[x]++; n } n auto it = mp.begin(); n auto it1 = mp1.begin(); n while (it1 != mp1.end()) { n if (it->first == it1->first) it1++; n if (it1 == mp1.end()) break; n x = it->second; n y = it1->second; n for (i = 0; i < x && i < y; i++) { n mp[it->first]--; n sum++; n mp1[it1->first]--; n } n if (x == i) it++; n if (y == i) it1++; n } n cout << sum << endl; n } n "} +{"func_code_string": "#include n using namespace std; n struct ele { n long long next, prev, delta, y; n }; n long long r, c, k, n, curcnt = 0, ans = 0; n vector a; n vector deltaleft, deltaright; n vector > X, id; n vector > tmp; n void init() { n X.clear(); n X.resize(r + 1); n id.resize(r + 1); n } n void remove(long long id) { n long long cur = id; n deltaleft.clear(); n deltaright.clear(); n for (long long i = 0; i <= k; i++) { n if (cur == -1 || a[cur].delta == -1) break; n deltaleft.push_back(a[cur].delta); n cur = a[cur].prev; n } n cur = a[id].next; n for (long long i = 0; i <= k; i++) { n if (cur == -1 || a[cur].delta == -1) break; n deltaright.push_back(a[cur].delta); n cur = a[cur].next; n } n curcnt -= deltaright[0] * deltaleft[0]; n curcnt -= deltaright[0] * (deltaright[0] - 1) / 2 + n deltaleft[0] * (deltaleft[0] - 1) / 2; n curcnt += n (deltaright[0] + deltaleft[0]) * (deltaright[0] + deltaleft[0] - 1) / 2; n for (long long i = 0; i <= k; i++) { n if (i < deltaleft.size() && k - i < deltaright.size()) n curcnt += deltaleft[i] * deltaright[k - i]; n } n a[a[id].prev].next = a[id].next; n a[a[id].next].prev = a[id].prev; n a[a[id].next].delta += a[id].delta; n } n long long cmp(pair a, pair b) { n return X[a.first][a.second] < X[b.first][b.second]; n } n void solve(long long r1) { n tmp.clear(); n for (long long i = r1; i <= r; i++) { n for (long long j = 0; j < X[i].size(); j++) { n tmp.push_back({i, j}); n } n } n sort(tmp.begin(), tmp.end(), cmp); n a.resize(tmp.size() + 2); n a[0].prev = -1; n a[0].next = 1; n a[0].y = 0; n a[tmp.size() + 1].prev = (long long)tmp.size(); n a[tmp.size() + 1].next = -1; n a[tmp.size() + 1].y = c + 1; n for (long long i = 0; i < tmp.size(); i++) { n id[tmp[i].first][tmp[i].second] = i + 1; n a[i + 1].y = X[tmp[i].first][tmp[i].second]; n a[i + 1].prev = i; n a[i + 1].next = i + 2; n } n a[0].delta = -1; n for (long long i = 1; i < a.size(); i++) { n a[i].delta = a[i].y - a[i - 1].y; n } n curcnt = 0; n for (long long i = 1; i < a.size(); i++) { n curcnt += (a[i].delta - 1) * a[i].delta / 2; n for (long long j = 1; j <= k; j++) { n if (i - j <= 0) break; n curcnt += a[i].delta * a[i - j].delta; n } n } n for (long long i = r; i >= r1; i--) { n ans += curcnt; n for (long long j = 0; j < X[i].size(); j++) { n remove(id[i][j]); n } n } n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> r >> c >> n >> k; n k--; n init(); n for (long long i = 1; i <= n; i++) { n long long u, v; n cin >> u >> v; n X[u].push_back(v); n } n for (long long i = 1; i <= r; i++) { n id[i].resize(X[i].size()); n } n for (long long i = 1; i <= r; i++) { n solve(i); n } n ans = (r + 1) * r / 2 * (c + 1) * c / 2 - ans; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 300007; n struct tup { n int u, v, pos; n friend bool operator<(tup x, tup y) { n if (x.v < y.v) { n return 1; n } n return 0; n } n } ans[maxn]; n int rec[maxn], n; n int solve() { n int cnt = 0; n rec[cnt++] = n; n ans[n].v = 2 * n + 1; n for (int i = n - 1; i >= 0; --i) { n if (ans[i].u < ans[rec[cnt - 1]].v && ans[i].u < ans[i].v) { n rec[cnt++] = i; n } n } n return cnt; n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n; ++i) { n scanf( %d%d , &ans[i].u, &ans[i].v); n ans[i].pos = i; n } n sort(ans, ans + n); n int cnt1 = solve() - 1; n int tmp[maxn]; n for (int i = 1; i <= cnt1; ++i) { n tmp[i] = ans[rec[i]].pos + 1; n } n for (int i = 0; i < n; ++i) { n ans[i].u = -ans[i].u; n ans[i].v = -ans[i].v; n } n sort(ans, ans + n); n int cnt = solve() - 1; n if (cnt <= cnt1) { n printf( %d n , cnt1); n for (int i = 1; i <= cnt1; ++i) { n printf( %d , tmp[i]); n } n } else { n printf( %d n , cnt); n for (int i = 1; i <= cnt; ++i) { n printf( %d , ans[rec[i]].pos + 1); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main(int argc, char const *argv[]) { n int n, q, counts = 0; n cin >> n; n int s[n]; n for (int i = 0; i < n; i++) cin >> s[i]; n cin >> q; n int l[q], r[q]; n for (int i = 0; i < q; i++) cin >> l[i] >> r[i]; n int sums[n + 1]; n sums[0] = 0; n for (int i = 1; i < n + 1; i++) sums[i] = sums[i - 1] + s[i - 1]; n for (int i = 0; i < q; i++) n cout << (sums[r[i]] - sums[l[i] - 1]) / 10 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 7; n const int M = 107; n const int inf = 1e9 + 7; n vector g[N], a[M]; n int w[N][M], d[N]; n void bfs(int u) { n queue q; n memset(d, inf, sizeof(d)); n for (int i = 0; i < (int)a[u].size(); ++i) { n q.push(a[u][i]); n d[a[u][i]] = 0; n } n while (!q.empty()) { n int v = q.front(); n q.pop(); n w[v][u] = d[v]; n for (int i = 0; i < (int)g[v].size(); ++i) { n int to = g[v][i]; n if (d[to] > d[v] + 1) { n d[to] = d[v] + 1; n q.push(to); n } n } n } n } n int main() { n int n, m, k, second; n scanf( %d %d %d %d , &n, &m, &k, &second); n for (int i = 1, x; i <= n; ++i) { n scanf( %d , &x); n a[x].push_back(i); n } n for (int i = 0, u, v; i < m; ++i) { n scanf( %d %d , &u, &v); n g[u].push_back(v); n g[v].push_back(u); n } n for (int i = 1; i <= k; ++i) bfs(i); n for (int i = 1; i <= n; ++i) { n sort(w[i] + 1, w[i] + k + 1); n int ans = 0; n for (int j = 1; j <= second; ++j) ans += w[i][j]; n printf( %d , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, n, m, x; n unordered_map mp; n cin >> t; n int a[t]; n for (int i = 1; i <= t; i++) { n cin >> a[i]; n mp[i] = a[i]; n } n for (int i = 1; i <= t; i++) { n n = mp[i]; n m = mp[n]; n x = mp[m]; n if (i == x) { n cout << YES ; n return 0; n } n } n cout << NO << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 23; n const int mod = 1000 * 1000 * 1000 + 7; n int dp[2][1 << maxN]; n int a[maxN]; n int res[maxN][maxN]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int n; n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n dp[0][1] = 1; n dp[0][0] = mod; n memset(res, -1, sizeof res); n for (int i = 0; i < n; i++) n for (int j = 0; j < i; j++) n for (int k = 0; k < i; k++) n if (a[j] + a[k] == a[i]) res[i][j] = k; n for (int i = 1; i < n; i++) { n int u = i & 1; n for (int mask = 0; mask < (1 << (i + 1)); mask++) dp[u][mask] = mod; n for (int mask = 0; mask < (1 << i); mask++) { n for (int j = 0; j < i; j++) { n if (res[i][j] == -1) continue; n if (mask >> j & 1) n if (mask >> res[i][j] & 1) { n int tmp = mask ^ (1 << i); n dp[u][tmp] = n min(dp[u][tmp], max(__builtin_popcount(tmp), dp[!u][mask])); n for (int k = 0; k < i; k++) { n if (mask >> k & 1) { n dp[u][tmp ^ (1 << k)] = n min(dp[u][tmp ^ (1 << k)], dp[!u][mask]); n } n } n break; n } n } n } n } n int ans = mod; n for (int mask = 0; mask < (1 << n); mask++) n ans = min(ans, dp[(n - 1) & 1][mask]); n if (ans == mod) n cout << -1 << endl; n else n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MN = 51; n char a[MN][MN], b[MN][MN]; n const char L = L , R = R , U = U , D = D ; n vector > sol, sol2; n int n, m; n void show() { n ; n for (int i = 0; i < n; ++i) n ; n ; n ; n for (int i = 0; i < n; ++i) n ; n ; n } n bool move(char arr[MN][MN], int i, int j) { n ; n if (arr[i][j] == U && arr[i][j + 1] == U && arr[i + 1][j] == D && n arr[i + 1][j + 1] == D) { n ; n arr[i][j] = arr[i + 1][j] = L; n arr[i][j + 1] = arr[i + 1][j + 1] = R; n } else if (arr[i][j] == L && arr[i + 1][j] == L && arr[i][j + 1] == R && n arr[i + 1][j + 1] == R) { n ; n arr[i][j] = arr[i][j + 1] = U; n arr[i + 1][j] = arr[i + 1][j + 1] = D; n } else { n ; n return false; n } n sol.emplace_back(i, j); n return true; n ; n show(); n } n void push(char arr[MN][MN], int i, int k, bool ver) { n char aim = ver ? U : L; n ; n show(); n assert(arr[i][k] == L || arr[i][k] == U); n if (arr[i][k] != aim) { n if (!move(arr, i, k)) { n push(arr, i + ver, k + !ver, !ver); n move(arr, i, k); n } n } n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < n; ++i) scanf( %s , a[i]); n for (int i = 0; i < n; ++i) scanf( %s , b[i]); n if (n % 2) { n ; n for (int k = 0; k < m; k += 2) n for (int i = 0; i < n; ++i) push(a, i, k, false); n swap(sol, sol2); n ; n for (int k = 0; k < m; k += 2) n for (int i = 0; i < n; i++) push(b, i, k, false); n } else { n ; n for (int i = 0; i < n; i += 2) n for (int k = 0; k < m; k++) push(a, i, k, true); n swap(sol, sol2); n ; n for (int i = 0; i < n; i += 2) n for (int k = 0; k < m; k++) push(b, i, k, true); n } n printf( %d n , (int)(sol.size() + sol2.size())); n reverse(sol.begin(), sol.end()); n for (auto x : sol2) printf( %d %d n , x.first + 1, x.second + 1); n for (auto x : sol) printf( %d %d n , x.first + 1, x.second + 1); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int t; n cin >> t; n while (t-- > 0) { n int l, r; n cin >> l >> r; n cout << l << << 2 * l << n ; n } n return 0; n } n "} +{"func_code_string": "#include n char ans[4][128]; n int main() { n int i, j, n; n while (scanf( %d , &n) != EOF) { n memset(ans, 0, sizeof(ans)); n if (n % 2 == 1) { n j = 0; n ans[0][0] = a + j; n ans[1][0] = a + j; n j = (j + 1) % 26; n for (i = 0; i < n; i += 2) { n ans[0][i + 1] = ans[0][i + 2] = a + j; n j = (j + 1) % 26; n ans[1][i + 1] = ans[1][i + 2] = a + j; n j = (j + 1) % 26; n ans[2][i + 1] = ans[2][i] = a + j; n j = (j + 1) % 26; n ans[3][i + 1] = ans[3][i] = a + j; n j = (j + 1) % 26; n } n ans[2][n - 1] = a + j; n ans[3][n - 1] = a + j; n ans[0][n] = ans[1][n] = ans[2][n] = ans[3][n] = 0 ; n } else { n j = 0; n ans[1][0] = a + j; n ans[2][0] = a + j; n j = (j + 1) % 26; n for (i = 0; i < n; i += 2) { n ans[1][i + 1] = ans[1][i + 2] = a + j; n j = (j + 1) % 26; n ans[2][i + 1] = ans[2][i + 2] = a + j; n j = (j + 1) % 26; n ans[0][i + 1] = ans[0][i] = a + j; n j = (j + 1) % 26; n ans[3][i + 1] = ans[3][i] = a + j; n j = (j + 1) % 26; n } n ans[1][n - 1] = a + j; n ans[2][n - 1] = a + j; n ans[0][n] = ans[1][n] = ans[2][n] = ans[3][n] = 0 ; n } n puts(ans[0]); n puts(ans[1]); n puts(ans[2]); n puts(ans[3]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, Mod, p[100010], a[200010], nxt[200010], w[200010], tot, root, n size[100010], son[100010], cnt; n bool vis[100010]; n long long ans, mul[100010]; n struct record { n int dep, step; n record(int D = 0, int S = 0) { n dep = D; n step = S; n } n } pre[100010], suf[100010]; n int comp(record a, record b) { return a.dep < b.dep; } n void add(int x, int y, int val) { n tot++; n a[tot] = y; n nxt[tot] = p[x]; n w[tot] = val; n p[x] = tot; n } n void getroot(int u, int fa, int N) { n size[u] = 1; n son[u] = 0; n for (int i = p[u]; i != 0; i = nxt[i]) n if (a[i] != fa && vis[a[i]] == false) { n getroot(a[i], u, N); n size[u] += size[a[i]]; n son[u] = max(son[u], size[a[i]]); n } n son[u] = max(son[u], N - size[u]); n if (son[u] < son[root]) root = u; n } n void getdeep(int u, int fa, long long pred, int step, long long sufd) { n pre[++cnt] = record(pred, step); n suf[cnt] = record(sufd, step); n for (int i = p[u]; i != 0; i = nxt[i]) n if (a[i] != fa && vis[a[i]] == false) n getdeep(a[i], u, (pred * 10 + w[i]) % Mod, step + 1, n (sufd + w[i] * mul[step] % Mod) % Mod); n } n int findL(int l, int r, int x, record *v) { n int mid; n while (l != r) { n mid = (l + r) >> 1; n if (v[mid].dep >= x) n r = mid; n else n l = mid + 1; n } n if (v[l].dep != x) return 1000000000; n return l; n } n int findR(int l, int r, int x, record *v) { n int mid, ans = 0; n while (l <= r) { n mid = (l + r) >> 1; n if (v[mid].dep <= x) { n ans = max(ans, mid); n l = mid + 1; n } else n r = mid - 1; n } n if (v[ans].dep != x) return 0; n return ans; n } n long long getnum(int l, int r, int now, record *v) { n int L, R; n if (l > r) return 0; n L = findL(l, r, now, v); n R = findR(l, r, now, v); n if (L <= R) return R - L + 1; n return 0; n } n void exgcd(int a, int b, long long &x, long long &y) { n if (b == 0) { n x = 1; n y = 0; n return; n } n long long t; n exgcd(b, a % b, x, y); n t = x; n x = y; n y = t - (a / b) * y; n } n int getinv(long long A, long long B) { n long long x, y; n exgcd(A, Mod, x, y); n x = (x % Mod + Mod) % Mod; n x = (x * B) % Mod; n return x; n } n long long calc(int u, int pre0, int s0, int suf0) { n long long sum = 0; n cnt = 0; n getdeep(u, 0, pre0, s0, suf0); n sort(pre + 1, pre + cnt + 1, comp); n sort(suf + 1, suf + cnt + 1, comp); n for (int i = 1; i <= cnt; i++) { n int now = getinv(mul[pre[i].step], Mod - pre[i].dep); n sum += getnum(1, cnt, now, suf); n if (now == 0) --sum; n } n return sum; n } n void work(int u) { n ans += calc(u, 0, 0, 0); n vis[u] = true; n for (int i = p[u]; i != 0; i = nxt[i]) n if (vis[a[i]] == false) { n ans -= calc(a[i], w[i] % Mod, 1, w[i] % Mod); n root = 0; n getroot(a[i], 0, size[a[i]]); n work(root); n } n } n int main() { n scanf( %d%d , &n, &Mod); n for (int i = 1; i < n; i++) { n int x, y, v; n scanf( %d%d%d , &x, &y, &v); n ++x; n ++y; n add(x, y, v); n add(y, x, v); n } n son[0] = 1000000000; n root = 0; n mul[0] = 1; n for (int i = 1; i <= n; i++) mul[i] = mul[i - 1] * 10 % Mod; n getroot(1, 0, n); n work(root); n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline T gcd(T a, T b) { n return b ? gcd(b, a % b) : a; n } n template n inline T LCM(T a, T b) { n if (a < 0) return LCM(-a, b); n if (b < 0) return LCM(a, -b); n return a * (b / gcd(a, b)); n } n vector arr; n const int N = 50005; n int memo[5001]; n int save[N]; n int visit[N]; n int find(int pos, int &xr) { n for (int i = 0; i < N; i++) visit[i] = 0; n vector toAdd; n int end = pos; n visit[arr[pos]] = 1; n for (int i = 0; i < pos; i++) { n visit[arr[i]] = 2; n } n if (visit[arr[pos]] == 2) { n return -1; n } n bool cant = false; n for (int i = pos; i < arr.size(); i++) { n if (visit[arr[i]] == 2) { n cant = true; n } n if (visit[arr[i]] == 1) { n if (cant) return -1; n for (int j = 0; j < toAdd.size(); j++) { n visit[toAdd[j]] = 1; n } n toAdd.clear(); n end = i; n } else { n toAdd.push_back(arr[i]); n } n } n xr = 0; n for (int i = 0; i < N; i++) { n if (visit[i] == 1) { n xr = xr ^ i; n } n } n return end; n } n int solve(int from) { n int txr = 0; n int ret = 0; n if (from >= arr.size()) return 0; n if (memo[from] != -1) { n return memo[from]; n } n int end = find(from, txr); n if (end != -1) { n ret = max(txr + solve(end + 1), solve(from + 1)); n } else { n ret = solve(from + 1); n } n memo[from] = ret; n return ret; n } n int main() { n int n, i, temp, j; n for (i = (int)0; i < (int)5001; ++i) { n memo[i] = -1; n } n scanf( %d , &n); n for (i = (int)0; i < (int)n; ++i) { n scanf( %d , &temp); n arr.push_back(temp); n } n int xx; n cout << solve(0); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a, b, c, d; n void solve() { n double m = max((3.0) * a / (10.0), (double)(a - a * c / 250)); n double v = max((3.0) * b / (10.0), (double)(b - b * d / 250)); n if (m > v) cout << Misha << endl; n if (m == v) cout << Tie << endl; n if (m < v) cout << Vasya << endl; n } n int main() { n while (cin >> a >> b >> c >> d) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string op; n bool check(int l, int r) { n char c; n cout << ? << l << << r << endl; n cin >> c; n return c == x ; n } n int main() { n while (cin >> op) { n if (op == end ) { n return 0; n } n int l = 1, r = 2; n while (1) { n if (check(l, r)) break; n l <<= 1, r <<= 1; n } n while (l + 1 < r) { n int mid = (l + r) >> 1; n if (check(l - 1, mid)) n r = mid; n else n l = mid + 1; n } n if (l == 1 && r == 2) { n if (check(2, 3)) n cout << ! 1 << endl; n else n cout << ! 2 << endl; n } else { n if (l == r) n cout << ! << l << endl; n else { n if (check(l, l + 1)) n cout << ! << l + 1 << endl; n else n cout << ! << l << endl; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, a[1000005]; n long long l; n vector val, cou, dp[1000005]; n void add(int &a, int b) { n a += b; n if (a >= 1000000007) a -= 1000000007; n } n void setup() { n cin >> n >> l >> k; n for (int i = 0; i <= n - 1; i++) { n cin >> a[i]; n val.push_back(a[i]); n } n sort(val.begin(), val.end()); n val.resize(unique(val.begin(), val.end()) - val.begin()); n cou.resize(val.size()); n for (int i = 0; i <= n - 1; i++) { n dp[i].resize(k + 1); n dp[i][1] = 1; n a[i] = lower_bound(val.begin(), val.end(), a[i]) - val.begin(); n } n } n void xuly() { n for (int j = 2; j <= k; j++) { n for (int i = 0; i <= int(cou.size()) - 1; i++) cou[i] = 0; n for (int i = 0; i <= n - 1; i++) add(cou[a[i]], dp[i][j - 1]); n for (int i = 1; i <= int(cou.size()) - 1; i++) add(cou[i], cou[i - 1]); n for (int i = 0; i <= n - 1; i++) dp[i][j] = cou[a[i]]; n } n int ans = 0; n for (int i = 0; i <= n - 1; i++) n for (int j = 1; j <= k; j++) { n long long m = l / n; n if (i < l % n) m++; n m = m - j + 1; n if (m > 0) ans = (ans + (m % 1000000007) * dp[i][j]) % 1000000007; n } n cout << ans; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n setup(); n xuly(); n return 0; n } n "} +{"func_code_string": "#include n const int N = 500005; n int to[N << 1], edge, Next[N << 1], last[N], n, x, y, d[N], mx1[N], mx2[N]; n int f[N], fmx[N], ans1, mx[N], f0[N], f1[N], sum[N]; n std::vector e[N]; n void upd(int &x, int y) { n if (y > x) x = y; n } n void add(int x, int y) { n to[++edge] = y; n Next[edge] = last[x]; n last[x] = edge; n } n void dfs1(int x, int y) { n f[x] = y; n for (int i = last[x]; i; i = Next[i]) { n int u = to[i]; n if (u == y) continue; n dfs1(u, x); n if (mx1[u] + 1 > mx1[x]) n mx2[x] = mx1[x], mx1[x] = mx1[u] + 1; n else if (mx1[u] + 1 > mx2[x]) n mx2[x] = mx1[u] + 1; n } n } n void dfs2(int x, int y) { n if (y) e[fmx[x]].push_back(x); n for (int i = last[x]; i; i = Next[i]) { n int u = to[i]; n if (u == y) continue; n if (mx1[x] == mx1[u] + 1) n fmx[u] = std::max(mx2[x], fmx[x]) + 1; n else n fmx[u] = std::max(mx1[x], fmx[x]) + 1; n e[mx1[u] + 1].push_back(x); n } n for (int i = last[x]; i; i = Next[i]) n if (to[i] != y) dfs2(to[i], x); n } n int main() { n scanf( %d , &n); n for (int i = 1; i < n; i++) { n scanf( %d%d , &x, &y); n add(x, y), add(y, x); n d[x]++, d[y]++; n } n for (int i = 1; i <= n; i++) upd(ans1, d[i] + 1); n dfs1(1, 0); n dfs2(1, 0); n f0[n] = f1[n] = 1; n for (int i = n; i >= 1; i--) { n int lst = 0; n for (auto u : e[i]) { n sum[u]++; n upd(f0[i], sum[u]); n upd(f1[i - 1], sum[u]); n if (lst != u) upd(f1[i], sum[u]); n upd(mx[f[u]], sum[u]); n upd(f0[i], sum[u] + mx[u] - 2); n if (f[u]) upd(f0[i], sum[u] + sum[f[u]] - 2); n lst = u; n } n } n for (int i = n; i >= 1; i--) upd(f0[i], f0[i + 1]), upd(f1[i], f1[i + 1]); n printf( %d , ans1); n for (int i = 2; i <= n; i++) n if (i & 1) n printf( %d , f1[i / 2]); n else n printf( %d , f0[i / 2]); n } n "} +{"func_code_string": "#include n using namespace std; n int a[1000]; n bool b[1000][1000]; n int main() { n int N, M; n scanf( %d%d , &N, &M); n for (int i = 0; i < N; i++) scanf( %d , &a[i]); n for (int i = 0; i < M; i++) { n int x, y; n scanf( %d%d , &x, &y); n --x; n --y; n b[x][y] = true; n b[y][x] = true; n } n int mincost = 1000000000; n for (int x = 0; x < N; x++) n for (int y = 0; y < N; y++) n for (int z = 0; z < N; z++) n if (b[x][y] && b[y][z] && b[x][z]) n if (a[x] + a[y] + a[z] < mincost) mincost = a[x] + a[y] + a[z]; n if (mincost == 1000000000) n printf( -1 ); n else n printf( %d n , mincost); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n vector > arr(n + 1, vector(m + 1)); n for (int k = 1; k <= n; k++) { n for (int i = 1; i <= m; i++) { n cin >> arr[k][i]; n arr[k][i] += arr[k][i - 1]; n } n } n for (int i = 1; i <= m; i++) { n for (int k = 1; k <= n; k++) { n arr[k][i] += arr[k - 1][i]; n } n } n int a, b; n cin >> a >> b; n int res = 1e9; n for (int k = a; k <= n; k++) { n for (int i = b; i <= m; i++) { n res = min(res, n arr[k][i] - arr[k][i - b] - arr[k - a][i] + arr[k - a][i - b]); n } n } n for (int k = b; k <= n; k++) { n for (int i = a; i <= m; i++) { n res = min(res, n arr[k][i] - arr[k][i - a] - arr[k - b][i] + arr[k - b][i - a]); n } n } n cout << res << n ; n return 0; n } n "} +{"func_code_string": "#include n const int N = 1e5 + 50; n using namespace std; n int n, m, h, tot, mx, maxn, ans; n int a[N], b[N], cnt[N], num[N]; n int read() { n int s = 0, t = 1; n char c; n while (c < 0 || c > 9 ) { n if (c == - ) t = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n s = s * 10 + c - 0 ; n c = getchar(); n } n return s * t; n } n long long readl() { n long long s = 0, t = 1; n char c; n while (c < 0 || c > 9 ) { n if (c == - ) t = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n s = s * 10 + c - 0 ; n c = getchar(); n } n return s * t; n } n int main() { n n = read(); n m = read(); n for (int i = 1; i <= m; i++) a[i] = read(), b[a[i]]++, mx = max(mx, a[i]); n for (int i = 1; i <= mx; i++) n if (b[i] > 0) cnt[++tot] = b[i]; n for (int i = 1; i <= m; i++) { n h = 0; n for (int j = 1; j <= tot; j++) h += cnt[j] / i; n if (h >= n) n ans = i; n else n break; n } n printf( %d , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int n, q; n cin >> n >> q; n set s; n multiset d; n auto Add = [&](int x) { n auto ret = s.insert(x); n auto it = ret.first; n if (next(it) != s.end() && it != s.begin()) { n d.erase(d.find(*next(it) - *prev(it))); n } n if (it != s.begin()) { n d.insert(*it - *prev(it)); n } n if (next(it) != s.end()) { n d.insert(*next(it) - *it); n } n }; n auto Remove = [&](int x) { n auto it = s.find(x); n if (it != s.begin()) { n d.erase(d.find(*it - *prev(it))); n } n if (next(it) != s.end()) { n d.erase(d.find(*next(it) - *it)); n } n if (next(it) != s.end() && it != s.begin()) { n d.insert(*next(it) - *prev(it)); n } n s.erase(it); n }; n for (int i = 0; i < n; i++) { n int foo; n cin >> foo; n Add(foo); n } n for (int i = 0; i <= q; i++) { n if (d.empty()) { n cout << 0 << n ; n } else { n cout << *prev(s.end()) - *s.begin() - *prev(d.end()) << n ; n } n if (i == q) { n break; n } n int c, x; n cin >> c >> x; n if (c) { n Add(x); n } else { n Remove(x); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long read() { n char ch = getchar(); n long long s = 0, w = 1; n while (ch < 0 || ch > 9 ) { n if (ch == - ) w = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n s = s * 10 + ch - 0 ; n ch = getchar(); n } n return s * w; n } n int d[1000010], t[1000010], prime[1000010], tot, vis[1000010]; n int n, fa[1000010], a[1000010], m; n long long c[1000010]; n inline void prepare(int Maxn) { n d[1] = 1; n for (register int i = 2; i <= Maxn; i++) { n if (!vis[i]) { n prime[++tot] = i; n t[i] = d[i] = 2; n } n for (register int j = 1; 1LL * prime[j] * i <= Maxn; j++) { n vis[i * prime[j]] = 1; n if (i % prime[j]) { n d[i * prime[j]] = d[i] * 2; n t[i * prime[j]] = 2; n } else { n d[i * prime[j]] = d[i] / t[i] * (t[i] + 1); n t[i * prime[j]] = t[i] + 1; n break; n } n } n } n } n inline void add(int x, int v) { n for (; x <= n; x += x & (-x)) c[x] += v; n } n inline long long query(int x) { n long long sum = 0; n for (; x; x -= x & (-x)) sum += c[x]; n return sum; n } n int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); } n int main() { n prepare(1000010 - 10); n n = read(), m = read(); n for (register int i = 1; i <= n; i++) a[i] = read(), fa[i] = i; n fa[n + 1] = n + 1; n for (register int i = 1; i <= n; i++) add(i, a[i]); n while (m--) { n int opt = read(), l = read(), r = read(); n if (opt == 1) { n for (register int i = l; i <= r; i = find(i + 1)) { n add(i, d[a[i]] - a[i]); n a[i] = d[a[i]]; n if (a[i] == 2 || a[i] == 1) fa[find(i)] = find(i + 1); n } n } else { n printf( %lld n , query(r) - query(l - 1)); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char str[100050]; n char a[5000], b[5000]; n int len1, len2, len3; n bool pp(int s1, int s2) { n while (s2 <= len2) { n if (str[s1] != a[s2]) return false; n s1++, s2++; n } n return true; n } n bool pp2(int s1, int s2) { n while (s2 <= len3) { n if (str[s1] != b[s2]) return false; n s1++, s2++; n } n return true; n } n bool rp(int s1, int s2) { n while (s2 <= len2) { n if (str[s1] != a[s2]) return false; n s1--, s2++; n } n return true; n } n bool rp2(int s1, int s2) { n while (s2 <= len3) { n if (str[s1] != b[s2]) return false; n s1--, s2++; n } n return true; n } n int main() { printf( Even n ); } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long num, tmp, sum, mx, l, r, mid; n cin >> num; n mx = sum = 0; n for (int i = 0; i < num; i++) { n cin >> tmp; n sum += tmp; n mx = max(mx, tmp); n } n l = mx; n r = sum; n while (l < r) { n mid = (l + r) / 2; n if (mid * num - sum >= mid) n r = mid; n else n l = mid + 1; n } n cout << l; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 505; n const int maxm = 1e4 + 5; n struct node { n int pre[maxn]; n void init() { n for (int i = 0; i < maxn; ++i) { n pre[i] = i; n } n } n int Find(int x) { n if (x != pre[x]) pre[x] = Find(pre[x]); n return pre[x]; n } n void v(int x, int y) { n int fx = Find(x), fy = Find(y); n if (fx != fy) pre[fy] = fx; n } n }; n struct node q[maxm], h[maxm]; n int u[maxm], v[maxm]; n int n, m; n int solve(node a, node b) { n int ans = 0; n for (int i = 1; i <= n; ++i) { n a.v(i, b.Find(i)); n } n for (int i = 1; i <= n; ++i) { n if (a.Find(i) == i) ans++; n } n return ans; n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; ++i) scanf( %d%d , &u[i], &v[i]); n q[0].init(); n h[m + 1].init(); n for (int i = 1; i <= m; ++i) { n q[i] = q[i - 1]; n q[i].v(u[i], v[i]); n } n for (int i = m; i >= 1; --i) { n h[i] = h[i + 1]; n h[i].v(u[i], v[i]); n } n int tt; n scanf( %d , &tt); n while (tt--) { n int x, y; n scanf( %d%d , &x, &y); n printf( %d n , solve(q[x - 1], h[y + 1])); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector v, t; n v.push_back(0), t.push_back(0); n long long int sum = 0, tt = 1, x = 0; n double result = 0; n long long int ix, a, b; n for (int i = 0; i < n; ++i) { n cin >> ix; n if (ix == 1) { n cin >> a >> b; n t[a - 1] += b; n sum += a * b; n } else if (ix == 2) { n cin >> a; n v.push_back(a), t.push_back(0); n sum += a; n ++tt; n } else { n t[t.size() - 2] += t.back(); n sum -= (v.back() + t.back()); n --tt; n v.pop_back(), t.pop_back(); n } n result = (double)sum / (double)tt; n cout << fixed << setprecision(6) << result << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e9 + 5; n long long n, k; n bool valid(long long x) { n long long maxi = (x)*k - ((x - 1) * ((x + 2) / 2.0)); n if (maxi >= n) n return true; n else n return false; n } n long long binary() { n long long lo = 0, mid, hi = k; n while (hi - lo > 0) { n mid = (hi + lo) / 2; n if (valid(mid)) n hi = mid; n else n lo = mid + 1; n } n if (hi == lo) n return lo; n else n return -1; n } n int main() { n scanf( %I64d %I64d , &n, &k); n long long ans = binary(); n long long maxi = k; n maxi += (ans - 1) * k - ((ans - 1) * ((ans + 2) / 2)); n if (ans & 1 && ans != 1) maxi--; n if (maxi >= n) n printf( %I64d , ans); n else n printf( -1 ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int cnt[3600]; n int main() { n int n; n cin >> n; n for (int i = 0; i < n; i++) { n int h, m; n scanf( n%d:%d , &h, &m); n cnt[h * 60 + m]++; n } n int ans = 0; n for (int i = 0; i < 1440; i++) { n if (cnt[i] == 0) { n int cur = 1, j = (i + 1) % 1440; n while (j != i && cnt[j] == 0) { n j = (j + 1) % 1440; n cur++; n } n ans = max(ans, cur); n } n } n cout << (ans / 60) / 10 << (ans / 60) % 10 << : << (ans % 60) / 10 n << ans % 10; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e6 + 10; n int a[N], b[N]; n int main() { n int n; n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n } n vector ans; n for (int i = 1; i <= n; i++) { n b[i] = a[i] - a[i - 1]; n } n for (int i = 1; i <= n; i++) { n int flag = 0; n for (int j = 1; i + j <= n; j++) { n if (b[j] != b[i + j]) { n flag++; n break; n } n } n if (!flag) { n ans.push_back(i); n } n } n cout << ans.size() << endl; n for (auto i : ans) cout << i << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 6; n bool flag = true; n vector v[N]; n int a[N], p[N], h[N], g[N]; n void dfs(int u, int temp = -1) { n a[u] = p[u]; n int sum = 0; n for (auto x : v[u]) { n if (x == temp) continue; n dfs(x, u); n sum += g[x]; n a[u] += a[x]; n } n if ((a[u] + h[u]) % 2 != 0) flag = false; n g[u] = (a[u] + h[u]) / 2; n if (g[u] >= 0 and g[u] <= a[u]) { n } else n flag = false; n if (sum > g[u]) flag = false; n } n int main() { n long long int t; n cin >> t; n while (t--) { n int n, m; n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> p[i]; n ; n for (int i = 0; i < n; i++) cin >> h[i]; n ; n for (int i = 0; i < n - 1; i++) { n int a, b; n cin >> a >> b; n a--; n b--; n v[a].push_back(b); n v[b].push_back(a); n } n dfs(0); n cout << (flag ? YES : NO ) << endl; n flag = true; n for (int i = 0; i < n; i++) v[i].clear(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int i = 0, j = 0, a; n string s, t; n cin >> s >> t; n a = t.length(); n while (a--) { n if (t[j] == s[i]) { n i++; n } n j++; n } n cout << i + 1; n } n "} +{"func_code_string": "#include n using namespace std; n char inp[1005], ans[1005]; n int n, p; n bool possible(int pos, int ok) { n if (pos == n) return ok; n int start = ok ? 0 : inp[pos] - a ; n int i; n for (i = start; i < p; i++) { n ans[pos] = i + a ; n if (pos > 0 && ans[pos - 1] == ans[pos]) continue; n if (pos > 1 && ans[pos - 2] == ans[pos]) continue; n if (possible(pos + 1, ok | (i > start))) return true; n } n return false; n } n int main() { n scanf( %d%d , &n, &p); n scanf( %s , inp); n bool ok = 0; n int i; n if (possible(0, 0)) { n ans[n] = 0 ; n printf( %s n , ans); n } else n printf( NO n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, k; n long long C[1005][2005]; n int main() { n scanf( %d %d %d , &n, &m, &k); n int M = max(n, m); n for (int n = 0; n <= M; n++) n for (int r = 0; r <= 2 * k; r++) { n if (r == 0) n C[n][r] = 1; n else if (n == 0) n C[n][r] = 0; n else n C[n][r] = (C[n - 1][r - 1] + C[n - 1][r]) % 1000000007; n } n printf( %d n , (int)((C[n - 1][2 * k] * C[m - 1][2 * k]) % 1000000007)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long lca(long long a, long long b) { n while (a != b) { n if (a < b) n b /= 2; n else n a /= 2; n } n return a; n } n long long inf = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL; n int main() { n ios_base::sync_with_stdio(0); n int t; n cin >> t; n map M; n while (t-- > 0) { n int x; n cin >> x; n long long u, v, w; n cin >> u >> v; n if (x == 1) { n cin >> w; n long long y = lca(u, v); n while (u != y) { n M[u] += w; n u /= 2; n } n while (v != y) { n M[v] += w; n v /= 2; n } n } else { n long long y = lca(u, v); n long long ans = 0; n while (u != y) { n ans += M[u]; n u /= 2; n } n while (v != y) { n ans += M[v]; n v /= 2; n } n cout << ans << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int a[100]; n int main() { n int x = 1; n scanf( %d , &n); n for (int i = 1; i <= n; ++i) { n scanf( %d , &a[i]); n if (a[i] < a[x]) x = i; n } n if (n == 1 || (n == 2 && a[1] == a[2])) { n puts( -1 ); n } else { n printf( 1 n%d n , x); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char comp[200005]; n vector > edge[200005]; n vector father[200005]; n vector ans; n int dis[200005], n, k; n queue > q; n void dfs(int u) { n if (ans.size() >= k) return; n if (u == n + 1) { n ans.push_back(comp + 1); n return; n } n for (int i = 0; i < father[u].size(); i++) { n comp[father[u][i]] = 1 ; n dfs(u + 1); n comp[father[u][i]] = 0 ; n } n } n int main() { n char a[10]; n int m; n cin >> n >> m >> k; n for (int i = 1; i <= m; i++) { n int u, v; n scanf( %d %d , &u, &v); n edge[u].push_back(make_pair(v, i)); n edge[v].push_back(make_pair(u, i)); n } n memset(dis, -1, sizeof(dis)); n for (int i = 1; i <= m; i++) comp[i] = 0 ; n q.push(make_pair(1, 0)); n dis[1] = 0; n while (!q.empty()) { n pair pa = q.front(); n q.pop(); n int u = pa.first, d = pa.second; n for (int i = 0; i < edge[u].size(); i++) { n int v = edge[u][i].first; n if (dis[v] == -1) { n dis[v] = d + 1; n q.push(make_pair(v, d + 1)); n } n } n } n for (int i = 2; i <= n; i++) { n for (int j = 0; j < edge[i].size(); j++) { n if (dis[i] == dis[edge[i][j].first] + 1) n father[i].push_back(edge[i][j].second); n } n } n dfs(2); n if (ans.size() >= k) { n cout << k << endl; n for (int i = 0; i < k; i++) cout << ans[i] << endl; n } else { n cout << ans.size() << endl; n for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n for (int i = 0; i < n; i++) { n int s, f, t; n cin >> s >> f >> t; n int x = t % (2 * (m - 1)); n int y = t - x; n int ans = 0; n if (s == f) { n ans = t; n } else if (s < f) { n if (x <= s - 1) { n ans = y + f - 1; n } else { n ans = y + 2 * (m - 1) + f - 1; n } n } else { n if (x <= (m - 1) + (m - s)) { n ans = y + (m - 1) + m - f; n } else { n ans = y + 3 * (m - 1) + m - f; n } n } n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 5; n int n, m, t; n vector e[maxn]; n vector ans; n stack s; n bool vis[maxn]; n int dep[maxn]; n int N; n bool v[maxn]; n int dfs(int x, int fr) { n vis[x] = true; n s.push(x); n for (auto y : e[x]) { n if (y == fr) continue; n if (!vis[y]) { n dep[y] = dep[x] + 1; n dfs(y, x); n dep[y] = 0; n } else if (dep[y]) { n if (dep[x] - dep[y] + 1 >= N) { n printf( 2 n ); n printf( %d n , dep[x] - dep[y] + 1); n while (s.top() != y) { n printf( %d , s.top()); n s.pop(); n } n printf( %d n , s.top()); n exit(0); n } n } n } n if (!v[x]) { n for (auto y : e[x]) { n v[y] = true; n } n ans.push_back(x); n } n s.pop(); n return 0; n } n int read() { n int x; n scanf( %d , &x); n return x; n } n int main() { n int i, j; n int x, y; n n = read(); n m = read(); n N = sqrt(n); n while (N * N < n) N++; n for (i = 1; i <= m; i++) { n x = read(); n y = read(); n e[x].push_back(y); n e[y].push_back(x); n } n for (i = 1; i <= n; i++) { n if (!vis[i]) { n dep[i] = 1; n dfs(i, -1); n dep[i] = 0; n } n } n printf( 1 n ); n for (i = 1; i <= n; i++) { n if (v[i]) continue; n N--; n printf( %d , i); n if (!N) break; n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[110], mx; n const int N = 30; n map mem; n int Penu(int now) { n if (!now || mem.find(now) != mem.end()) return mem[now]; n register int ans = 0; n register set mex; n for (register int i = 1; i < 31; i++) n if (now >> i) mex.insert(Penu(now & ((1 << i) - 1) | (now >> i))); n while (mex.count(ans)) ans++; n return mem[now] = ans; n } n int ans; n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n cin >> n; n mem[0] = 0; n map ma; n for (register int i = 1, j; i <= n; i++) { n cin >> j; n for (register int r = 2, c = 0; r * r <= j; r++, c = 0) { n while (!(j % r)) { n c++; n j /= r; n } n if (c) ma[r] |= (1 << c); n } n if (j > 1) ma[j] |= 2; n } n for (auto u : ma) ans ^= Penu(u.second); n cout << (!ans ? Arpa n : Mojtaba n ); n return 0; n } n "} +{"func_code_string": "#include n n #define ll long long int n #define ld long double n #define pb push_back n #define fi first n #define se second n #define all(x) x.begin(),x.end() n #define mem(x,y) memset(x,y,sizeof(x)) n #define pii pair n #define pll pair n #define INF 1e9+10 n #define INFL 1e18 n #define mod 1000000007 n //#define mod 998244353 n #define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); n using namespace std; n n n n n ll power(ll x,ll n){ll res =1;while(n>0){if(n%2==1){res=res*x;}x=x*x;n=n/2;}return res;} n ll powm(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;} n n //cout<< fixed << setprecision(10) n //__builtin_popcountll(); n //|_2.4_|=2 n int vis[500005]; n vectorg[500005]; n n int lev[500005]; n int ans[500005]; n n void bfs(int s) n { n queueq; n q.push(s); n vis[s]=1; n lev[s]=0; n n while(!q.empty()) n { n int x=q.front(); n q.pop(); n for(int i=0;i=lev[x]) n continue; n n dfs(x); n n ans[s]=min(ans[s],ans[x]); n } n } n n n int main(){ n n fast; n int T=1; n cin>>T; n while(T--) n { n int n,i,j,m; n cin>>n>>m; n vectorv; n for(i=0;i>r>>c; n v.pb({c,r}); n } n sort(all(v)); n int l=0,r; n if(m%2==1) n { n cout<< NO n ; n continue; n } n for(i=0;i+1 n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int n; n string s, t; n cin >> n >> s >> t; n string ss = s, tt = t; n sort(ss.begin(), ss.end()); n sort(tt.begin(), tt.end()); n if (ss != tt) n cout << -1 << n ; n else { n vector ans; n for (int j = (int)(n - 1); j >= int(0); j--) { n char target = t[j]; n ; n int pos = n - j - 1; n ; n while (target != s[pos]) pos++; n ; n ; n ans.push_back(n); n reverse(s.begin(), s.end()); n ; n ans.push_back(pos); n string temp(s.begin() + n - pos, s.end()); n reverse(temp.begin(), temp.end()); n s.erase(s.begin() + n - pos, s.end()); n s.insert(s.begin(), temp.begin(), temp.end()); n ; n ans.push_back(1); n char c = s[n - 1]; n s.erase(s.begin() + n - 1); n s.insert(s.begin(), c); n ; n } n cout << int((ans).size()) << n ; n for (int i = 0; i < int(int((ans).size())); i++) { n if (i) cout << ; n cout << ans[i]; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int MOD = 1000000000 + 7; n long long int arr[200005]; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n long long int t; n cin >> t; n while (t--) { n long long int n, sum = 0; n cin >> n; n for (long long int i = 0; i < n; i++) cin >> arr[i]; n long long int i = 0; n vector vec; n while (1) { n long long int maxp = INT_MIN; n long long int maxn = INT_MIN; n for (; i < n; i++) { n if (arr[i] < 0) n break; n else { n maxp = max(maxp, arr[i]); n } n } n if (maxp != INT_MIN) vec.push_back(maxp); n if (i == n) break; n for (; i < n; i++) { n if (arr[i] >= 0) n break; n else { n maxn = max(maxn, arr[i]); n } n } n if (maxn != INT_MIN) vec.push_back(maxn); n if (i == n) break; n } n for (long long int i = 0; i < vec.size(); i++) sum += vec[i]; n cout << sum << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 2e5 + 5; n int n, k, a[maxn], ans[maxn], pos[maxn]; n class Node { n public: n int l, r; n }; n Node lis[maxn]; n int main() { n scanf( %d%d , &n, &k); n for (int(i) = 0; (i) < (n); (i)++) { n cin >> a[i + 1]; n pos[a[i + 1]] = i + 1; n lis[i + 1].l = i; n lis[i + 1].r = i + 2; n } n int team = 1; n for (int i = n; i >= 1; i--) { n int p = pos[i]; n if (ans[p] != 0) continue; n ans[p] = team; n for (int(j) = 0; (j) < (k); (j)++) { n int el = lis[p].r; n if (el != n + 1) { n ans[el] = team; n lis[lis[el].l].r = lis[el].r; n lis[lis[el].r].l = lis[el].l; n } else n break; n } n for (int(j) = 0; (j) < (k); (j)++) { n int el = lis[p].l; n if (el != 0) { n ans[el] = team; n lis[lis[el].l].r = lis[el].r; n lis[lis[el].r].l = lis[el].l; n } else n break; n } n lis[lis[p].l].r = lis[p].r; n lis[lis[p].r].l = lis[p].l; n if (team == 1) n team = 2; n else n team = 1; n } n for (int(i) = 0; (i) < (n); (i)++) cout << ans[i + 1]; n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n inline bool isLow(char ch) { return (ch >= a && ch <= z ); } n inline bool isUpp(char ch) { return (ch >= A && ch <= Z ); } n inline bool isDig(char ch) { return (ch >= 0 && ch <= 9 ); } n inline bool are_equal(double a, double b) { n return fabs(a - b) < numeric_limits::epsilon(); n } n inline bool less_than(double a, double b) { n return (b - a) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) * n numeric_limits::epsilon()); n } n inline bool greater_than(double a, double b) { n return (a - b) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) * n numeric_limits::epsilon()); n } n template n inline string arrStr(T arr, int n) { n stringstream s; n s << [ ; n for (int i = 0; i < n - 1; i++) s << arr[i] << , ; n s << arr[n - 1] << ] ; n return s.str(); n } n inline void __evars_begin(int line) { cout << # << line << : ; } n template n inline void __evars_out_var(vector val) { n cout << arrStr(val, val.size()); n } n template n inline void __evars_out_var(T *val) { n cout << arrStr(val, 10); n } n template n inline void __evars_out_var(T val) { n cout << val; n } n inline void __evars(vector::iterator it) { cout << endl; } n template n inline void __evars(vector::iterator it, T a, Args... args) { n cout << it->substr((*it)[0] == , it->length()) << = ; n __evars_out_var(a); n cout << ; ; n __evars(++it, args...); n } n void in(int &n, int a[]) { n cin >> n; n for (__typeof(n - 1) i = (0); i <= (n - 1); i++) cin >> a[i]; n } n void in(int &n, vector &a) { n cin >> n; n a.resize(n); n for (__typeof(n - 1) i = (0); i <= (n - 1); i++) cin >> a[i]; n } n void out(int n, int a[]) { n for (__typeof(n - 1) i = (0); i <= (n - 1); i++) n cout << a[i] << n [i + 1 == n]; n } n void out(vector &a) { n for (__typeof(a.size() - 1) i = (0); i <= (a.size() - 1); i++) n cout << a[i] << n [i + 1 == a.size()]; n } n template n T power(T val, T p, T mod) { n val %= mod; n T result = 1; n while (p > 0) { n if (p & 0x1) result = (result * val) % mod; n val = (val * val) % mod; n p >>= 1; n } n return result; n } n vector split(const string &s, char c) { n vector v; n stringstream ss(s); n string x; n while (getline(ss, x, c)) v.emplace_back(x); n return move(v); n } n template n T gcd(T a, T b) { n return b == 0 ? a : gcd(b, a % b); n } n template n T lcm(T a, T b) { n return (a * b) / gcd(a, b); n } n template n string toString(T x) { n stringstream ss; n ss << x; n return ss.str(); n } n template n T stringToT(string s, T a) { n T p; n istringstream ss(s); n ss >> p; n return p; n } n template n T SOD(T n) { n __typeof(n) sum = 0, i = 1; n for (; i * i <= n; i++) n sum += (n % i) ? 0 : ((((i) * (i)) == n) ? i : i + n / i); n return sum; n } n template n ostream &operator<<(ostream &os, const pair &v) { n os << ( << v.first << , << v.second << ) ; n return os; n } n template n ostream &operator<<(ostream &os, const map &v) { n for (auto it : v) os << it.first << : << it.second << n ; n return os; n } n template n ostream &operator<<(ostream &os, const set &v) { n os << [ ; n for (auto it : v) { n os << it; n if (it != *v.rbegin()) os << , ; n } n os << ] ; n return os; n } n template n ostream &operator<<(ostream &os, const vector &v) { n os << [ ; n for (int i = 0; i < v.size(); i++) { n os << v[i]; n if (i != (int)v.size() - 1) os << , ; n } n os << ] ; n return os; n } n const int fx[] = {+1, -1, +0, +0}; n const int fy[] = {+0, +0, +1, -1}; n const int fx8[] = {+0, +0, +1, -1, -1, +1, -1, +1}; n const int fy8[] = {-1, +1, +0, +0, +1, +1, -1, -1}; n const int kx[] = {-2, -2, -1, -1, 1, 1, 2, 2}; n const int ky[] = {-1, 1, -2, 2, -2, 2, -1, 1}; n int Set(int N, int pos) { return N = N | (1 << pos); } n int reset(int N, int pos) { return N = N & ~(1 << pos); } n bool check(int N, int pos) { return (bool)(N & (1 << pos)); } n const int mod = 1e9 + 7; n const int mx = 2 * 100001; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long x, y; n int cases, tc; n cin >> tc; n for (cases = 1; cases <= tc; cases++) { n cin >> x >> y; n long long d = x - y; n if (d == 1) n cout << NO n ; n else n cout << YES n ; n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n template n using V = vector; n template n using min_priority_queue = priority_queue, greater >; n long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; } n long long LCM(long long a, long long b) { return a / GCD(a, b) * b; } n long long int pom(long long int a, long long int n, int m) { n long long int x = 1; n for (a %= m; n; n /= 2) n& 1 ? x = x * a % m : 0, a = a * a % m; n return x; n } n int dx[4] = {-1, 0, 1, 0}; n int dy[4] = {0, -1, 0, 1}; n int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1}; n int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1}; n long long int cmp1(pair, long long int> a, n pair, long long int> b) { n return a.first.second > b.first.second; n } n long long int cmp2(pair a, n pair b) { n if (a.second != b.second) n return a.second < b.second; n else n return a.first > b.first; n } n int main(int argc, char* argv[]) { n cin.tie(0); n ios::sync_with_stdio(false); n long long int T; n cin >> T; n while (T--) { n long long int n; n cin >> n; n V a(n + 1); n for (long long int i = 0; i < n; i++) { n cin >> a[i]; n } n long long int ans = 0; n bool abc = 0; n long long int cnt = 0; n for (long long int i = 1; i < n; i++) { n if (a[i - 1] == 1 && a[i] == 0) { n abc = 1; n cnt = 1; n } else if (abc == 1 && a[i] == 0) { n cnt++; n } n if (abc == 1 && (a[i] == 0 && a[i + 1] == 1 && i < n - 1)) { n ans += cnt; n cnt = 0; n abc = 0; n } n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const double eps = 1e-6; n const double PI = acos(-1); n const double R = 0.57721566490153286060651209; n const int maxn = 1005; n struct Edge { n int from, to, cap, flow, cost; n Edge(int u, int v, int c, int f, int cc) n : from(u), to(v), cap(c), flow(f), cost(cc) {} n }; n struct MCMF { n int n, m; n vector edges; n vector G[maxn]; n int inq[maxn]; n int d[maxn]; n int p[maxn]; n int a[maxn]; n void init(int n) { n this->n = n; n for (int i = 0; i <= n; ++i) G[i].clear(); n edges.clear(); n } n void add(int from, int to, int cap, int cost) { n edges.emplace_back(Edge(from, to, cap, 0, cost)); n edges.emplace_back(Edge(to, from, 0, 0, -cost)); n m = int(edges.size()); n G[from].emplace_back(m - 2); n G[to].emplace_back(m - 1); n } n bool spfa(int s, int t, int &flow, int &cost) { n for (int i = 1; i <= n; ++i) d[i] = INF; n memset(inq, 0, sizeof(inq)); n d[s] = 0; n inq[s] = 1; n p[s] = 0; n queue q; n a[s] = INF; n q.push(s); n while (!q.empty()) { n int u = q.front(); n q.pop(); n inq[u] = 0; n for (int i = 0; i < int(G[u].size()); ++i) { n Edge &e = edges[G[u][i]]; n if (e.cap > e.flow && d[e.to] > d[u] + e.cost) { n d[e.to] = d[u] + e.cost; n p[e.to] = G[u][i]; n a[e.to] = min(a[u], e.cap - e.flow); n if (!inq[e.to]) { n q.push(e.to); n inq[e.to] = 1; n } n } n } n } n if (d[t] == INF) return false; n flow += a[t]; n cost += d[t] * a[t]; n for (int u = t; u != s; u = edges[p[u]].from) { n edges[p[u]].flow += a[t]; n edges[p[u] ^ 1].flow -= a[t]; n } n return true; n } n int MincostMaxflow(int s, int t, int &cost) { n int flow = 0; n cost = 0; n while (spfa(s, t, flow, cost)) n ; n return flow; n } n } mcmf; n int n, m, mincost; n void solve() { n string S; n cin >> S; n cin >> n; n map num, mp[n + 1]; n vector a(n + 1); n for (int i = 0; i < S.length(); i++) { n num[S[i] - a + 1]++; n } n for (int i = 1; i <= n; i++) { n string T; n cin >> T >> a[i]; n for (int j = 0; j < T.length(); j++) { n mp[i][T[j] - a + 1]++; n } n } n int s = 0, t = n + 26 + 1; n mcmf.init(t); n for (int i = 1; i <= 26; i++) { n if (!num[i]) continue; n mcmf.add(s, i, num[i], 0); n for (int j = 1; j <= n; j++) { n if (!mp[j][i]) continue; n mcmf.add(i, j + 26, mp[j][i], j); n } n } n for (int i = 1; i <= n; i++) { n mcmf.add(i + 26, t, a[i], 0); n } n int maxflow = mcmf.MincostMaxflow(s, t, mincost); n if (maxflow == S.length()) n cout << mincost << n ; n else n cout << -1 << n ; n } n signed main() { n ios_base::sync_with_stdio(false); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int OO = 0x3f3f3f3f, NegOO = -1 * OO, N = 1e6 + 5, mod = 1e9 + 7; n long long gcd(long long x, long long y) { n if (y == 0) return x; n return gcd(y, x % y); n } n int main() { n int t; n cin >> t; n while (t--) { n int n, x, y, d; n cin >> n >> x >> y >> d; n if (x == y) { n cout << 0 << n ; n continue; n } else if (x < y) { n int mx = 1e9 + 5; n int ans1 = mx, ans2 = mx, ans3 = mx; n if ((y - x) % d == 0) ans1 = (y - x) / d; n if ((y - 1) % d == 0) n ans2 = (x - 1) / d + ((x - 1) % d != 0) + (y - 1) / d; n if ((n - y) % d == 0) n ans3 = (n - x) / d + ((n - x) % d != 0) + (n - y) / d; n int ans = min(min(ans1, ans2), ans3); n cout << ((ans != mx) ? ans : -1) << n ; n } else { n int mx = 1e9 + 5; n int ans1 = mx, ans2 = mx, ans3 = mx; n if ((x - y) % d == 0) ans1 = (x - y) / d; n if ((y - 1) % d == 0) n ans2 = (x - 1) / d + ((x - 1) % d != 0) + (y - 1) / d; n if ((n - y) % d == 0) n ans3 = (n - x) / d + ((n - x) % d != 0) + (n - y) / d; n int ans = min(min(ans1, ans2), ans3); n cout << ((ans != mx) ? ans : -1) << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector g[200000]; n long long c[200000]; n long long cnt; n void dfs(long long v, long long p = -1) { n cnt++; n long long cnt1 = cnt; n for (long long to : g[v]) { n if (to != p) { n dfs(to, v); n } n } n c[v] = cnt - cnt1 + 1; n } n signed main() { n long long t; n cin >> t; n for (long long q = 0; q < t; q++) { n long long k; n cin >> k; n k *= 2; n vector> edge; n long long t[k]; n for (long long i = 0; i < k - 1; i++) { n long long a, b; n cin >> a >> b >> t[i]; n a--; n b--; n g[a].push_back(b); n g[b].push_back(a); n edge.push_back({a, b}); n } n dfs(0); n long long mnsum = 0, mxsum = 0; n for (long long i = 0; i < k - 1; i++) { n long long c1 = min(c[edge[i].first], c[edge[i].second]); n mnsum += c1 % 2 * t[i]; n mxsum += min(c1, k - c1) * t[i]; n } n cout << mnsum << << mxsum << n ; n for (long long i = 0; i < k; i++) { n g[i].clear(); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 410; n const int inf = 0x7fffffff; n int a[maxn]; n int n; n int main() { n int ans = inf; n cin >> n; n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int i = 2; i <= n; i++) n for (int j = i; j <= n; j++) { n int x = a[i - 1] - 1, y = 0; n for (int k = i; k <= j; k++) { n int t = x / a[k]; n y += t; n x -= t * a[k]; n } n x = a[i - 1] - 1 - x + a[j]; n y++; n if (x < ans) { n int o = x; n for (int k = 1; k <= n; k++) { n int t = x / a[k]; n y -= t; n x -= t * a[k]; n } n if (y < 0) ans = o; n } n } n if (ans == inf) n puts( -1 ); n else n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int prime[15] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47}; n int main() { n int n; n cin >> n; n vector res; n int limit = 2 * n * n; n for (int i = 0; i < 15; i++) { n res.clear(); n res.push_back(1); n for (int j = 0; j <= i; j++) { n int p = prime[j]; n int sz = res.size(); n for (int k = 0; k < sz; k++) { n int x = res[k]; n while (x * p <= limit) { n x *= p; n res.push_back(x); n } n } n } n if (res.size() >= n) { n break; n } n } n sort(res.begin(), res.end(), greater()); n for (int i = 0; i < n; i++) { n cout << res[i] << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long nax = 1e5 + 7; n const long long mod = 1e9 + 7; n const long long inf = numeric_limits::max(); n long long n, m; n bool check(vector &vec) { n vector freq(n + 1, 0); n for (long long i = 0; i < n; i++) { n if (vec[i] > n) return false; n freq[vec[i]]++; n if (freq[vec[i]] > 1) { n return false; n } n } n for (long long i = 0; i < n; i++) { n if (freq[i + 1] != 1) return false; n } n return true; n } n void test() { n cin >> n; n vector vec; n vec.push_back(0); n long long first = 0; n for (long long i = 1; i < n; i++) { n long long t; n cin >> t; n vec.push_back(vec.back() + t); n first = min(first, vec.back()); n } n first = 1 - first; n for (long long &x : vec) x += first; n if (check(vec)) n for (long long x : vec) cout << x << ; n else n cout << -1; n } n signed main() { n ios_base ::sync_with_stdio(false); n cin.tie(NULL); n long long T = 1; n while (T--) { n test(); n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int test; n cin >> test; n while (test--) { n int n; n cin >> n; n vector> v(n, vector(n, 0)); n for (int i = 0; i < n; i++) { n v[i][i] = 1; n v[(i + 1) % n][i] = 1; n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) cout << v[i][j] << ; n cout << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long int inf = (long long int)1e18 + 19; n const long long int mod = (long long int)1e9 + 7; n void cazz() { n long long int t = 1, i; n long double j, n; n cin >> t; n while (t--) { n cin >> n; n i = 3, j = -1; n while (j < n) { n j = (((long double)180 * (i - 2)) / i); n i++; n } n if (j == n) { n cout << YES n ; n continue; n } n cout << NO n ; n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n cazz(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1000 * 1000 + 10; n vector vec[N]; n vector d[2]; n bool mark[N]; n void dfs(int v, int hh) { n mark[v] = true; n d[hh].push_back(v); n for (int u : vec[v]) n if (!mark[u]) dfs(u, 1 - hh); n } n int main() { n int o; n cin >> o; n while (o--) { n int n, m; n cin >> n >> m; n for (int i = 0; i < n; i++) vec[i].clear(), mark[i] = false; n ; n d[0].clear(); n d[1].clear(); n for (int i = 0; i < m; i++) { n int a, b; n cin >> a >> b; n a--, b--; n vec[a].push_back(b); n vec[b].push_back(a); n } n dfs(0, 0); n if ((int)d[0].size() > (int)d[1].size()) swap(d[0], d[1]); n cout << (int)d[0].size() << endl; n for (int a : d[0]) cout << a + 1 << ; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n const int inf = 1000000007; n const double pi = 2 * acos(0.0); n using namespace std; n int gcd(int a, int b) { n a = abs(a); n b = abs(b); n while (b) { n a = a % b; n swap(a, b); n } n return a; n } n int main() { n map m; n long long n, k; n scanf( %lld%lld , &n, &k); n long long arr[n]; n for (long long i = 0; i < n; i++) { n scanf( %lld , &arr[i]); n m.insert(make_pair(arr[i], 1)); n } n vector ans; n long long sum = 0; n for (int i = 1; i < 1e9; i++) { n if (sum > k) { n ans.pop_back(); n break; n } n if (m[i] != 1) { n sum += i; n ans.push_back(i); n } n } n printf( %d n , ans.size()); n for (long long i : ans) { n printf( %d , i); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 500005; n int ult; n int cont; n int prim; n char cad[MAXN]; n bool Solve(int a, int n, int T) { n int c = 0, time = 0; n queue s; n prim = -1; n for (int i = 0; i < n && c < cont; i++, time++) { n if (cad[i] == H && a > 0) { n c++; n a--; n if (prim == -1) prim = i; n } else if (cad[i] == H ) { n s.push(i); n if (prim == -1) prim = i; n } else if (cad[i] == S ) { n a++; n if (a >= s.size()) { n if (!s.empty()) { n int aux = abs(s.front() - i); n time += aux; n s.pop(); n a--; n c++; n while (!s.empty()) { n c++; n a--; n s.pop(); n } n if (c < cont) time += aux; n } n } n } n if (c == cont) ult = i; n } n time = min(time, ult + 1 + (ult - prim)); n return (time <= T && c == cont); n } n int main() { n int n; n long long int T; n scanf( %d %lld , &n, &T); n scanf( n%s , cad); n for (int i = 0; i < n; i++) n if (cad[i] == H ) cont++; n int ini = 0, fin = cont; n while (ini < fin) { n int med = (ini + fin) / 2; n if (!Solve(med, n, T)) n ini = med + 1; n else n fin = med; n } n if (Solve(ini, n, T)) n printf( %d n , ini); n else n printf( -1 n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int i, j, k, m, n, a[100400], t, w, q, sum = 0; n char s[105000]; n long double x, y; n cin >> q; n for (j = 0; j < q; j++) { n cin >> n; n cin >> s; n if (n > 2) { n cout << YES << endl; n cout << 2 << endl; n cout << s[0] << ; n for (i = 1; i < n; i++) cout << s[i]; n cout << endl; n } else { n if (s[0] - 0 < s[1] - 0 ) { n cout << YES << endl; n cout << 2 << endl; n cout << s[0] << << s[1] << endl; n } else n cout << NO << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n long long fact(int i) { n if (i <= 1) n return 1; n else n return i * fact(i - 1); n } n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n while (t--) { n int arr[4]; n for (int i = 0; i < 4; i++) { n cin >> arr[i]; n } n int minus = arr[0] + arr[1]; n string final[4]; n if (minus % 2 == 0) { n final[0] = Tidak ; n final[1] = Tidak ; n if (arr[2] == 0) { n if (arr[1] == 0) { n final[2] = Tidak ; n } else { n final[2] = Ya ; n } n } else { n final[2] = Ya ; n } n if (arr[3] == 0) { n if (arr[0] == 0) { n final[3] = Tidak ; n } else { n final[3] = Ya ; n } n } else { n final[3] = Ya ; n } n } else { n final[2] = Tidak ; n final[3] = Tidak ; n if (arr[0] == 0) { n if (arr[3] == 0) { n final[0] = Tidak ; n } else { n final[0] = Ya ; n } n } else { n final[0] = Ya ; n } n if (arr[1] == 0) { n if (arr[2] == 0) { n final[1] = Tidak ; n } else { n final[1] = Ya ; n } n } else { n final[1] = Ya ; n } n } n for (int i = 0; i < 4; i++) { n cout << final[i] << ; n } n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n vector a; n void SieveOfEratosthenes(int n) { n bool prime[n + 1]; n memset(prime, true, sizeof(prime)); n for (int p = 2; p * p <= n; p++) { n if (prime[p] == true) { n for (int i = p * p; i <= n; i += p) prime[i] = false; n } n } n for (int p = 2; p <= n; p++) n if (prime[p]) a.push_back(p); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n cin >> n; n SieveOfEratosthenes(100000); n for (int i = 2; i <= n; i++) { n for (int j = 0; j < a.size(); j++) { n if (i % a[j] == 0) { n cout << j + 1 << ; n break; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void mini(T& a, T b) { n a = min(a, b); n } n template n void maxi(T& a, T b) { n a = max(a, b); n } n template n ostream& operator<<(ostream& out, pair a) { n return out << a.first << << a.second; n } n template n ostream& operator<<(ostream& out, vector a) { n for (auto& i : a) out << i << ; n return out; n } n template n ostream& operator<<(ostream& out, set a) { n for (auto& i : a) out << i << ; n return out; n } n template n ostream& operator<<(ostream& out, multiset a) { n for (auto& i : a) out << i << ; n return out; n } n template n ostream& operator<<(ostream& out, map a) { n for (auto& i : a) out << i << n ; n return out; n } n template n ostream& operator<<(ostream& out, unordered_map a) { n for (auto& i : a) out << i << n ; n return out; n } n template n ostream& operator<<(ostream& out, queue a) { n while (!a.empty()) { n cout << a.front() << ; n a.pop(); n } n return out; n } n template n ostream& operator<<(ostream& out, deque a) { n while (!a.empty()) { n cout << a.front() << ; n a.pop_front(); n } n return out; n } n template n ostream& operator<<(ostream& out, priority_queue a) { n while (!a.empty()) { n cout << a.top() << n ; n a.pop(); n } n return out; n } n template n void out(T a) { n cout << a << endl; n } n template n void out(T1 a, T2 b) { n cout << a << << b << endl; n } n template n void out(T1 a, T2 b, T3 c) { n cout << a << << b << << c << endl; n } n void out() { cout << OK << endl; } n template n void sort(vector& a) { n sort(a.begin(), a.end()); n } n template n void uniq(vector& a) { n sort(a); n a.erase(unique(a.begin(), a.end()), a.end()); n } n template n vector set_int(vector a, vector b) { n sort(a); n sort(b); n vector res; n set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res)); n return res; n } n istream& operator>>(istream& in, __int128& a) { n int64_t b; n cin >> b; n a = b; n return in; n } n ostream& operator<<(ostream& out, const __int128 a) { n unsigned __int128 b = a < 0 ? -a : a; n char buf[128]; n char* c = end(buf); n do { n --c; n *c = 0123456789 [b % 10]; n b /= 10; n } while (b); n if (a < 0) { n --c; n *c = - ; n } n int len = end(buf) - c; n out.rdbuf()->sputn(c, len); n return out; n } n const int N = 1e5 + 5; n const int inf = 1e9; n vector dp, pr; n vector used; n vector a[N]; n void Solve() { n int n, k; n cin >> n >> k; n int h = 5 * sqrt(k); n int ans = 0; n for (int i = 1; i <= k; i++) { n int r, c; n cin >> r >> c; n if (n - r < h) n a[c - 1].push_back(n - r); n else n ans += 3; n } n dp.resize(h, 0); n pr.resize(h, 0); n used.resize(h, 0); n for (int i = n - 1; i >= 0; i--) { n for (int j = 0; j <= h - 1; j++) used[j] = 0; n for (int j : a[i]) used[j] = 1; n for (int& j : dp) j = inf; n int suf = 0; n for (int j = h - 1; j >= 0; j--) { n if (used[j]) suf += 3; n int cur = suf + pr[max(j - 1, 0)]; n mini(dp[j], cur); n if (j) cur += 2 + j * (j + 1) / 2; n mini(dp[0], cur); n } n for (int j = 0; j <= h - 2; j++) mini(dp[j + 1], dp[j]); n swap(dp, pr); n } n ans += pr[0]; n out(ans); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n Solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool comp(int a, int b) { return (a > b); } n int main() { n int a, b, n, l, t, m, x, ans, r; n long long cek; n scanf( %d %d %d , &a, &b, &n); n for (int i = 1; i <= n; i++) { n scanf( %d %d %d , &l, &t, &m); n if (t < a + (long long)(l - 1) * b) n printf( -1 n ); n else { n x = 1; n ans = l; n while (x > 0) { n r = ans + x; n cek = ((a + (long long)(r - 1) * b + a + (long long)(l - 1) * b) * n (r - l + 1)) / n 2; n cek = max(cek / m + (cek % m == 0 ? 0 : 1), a + (long long)(r - 1) * b); n if (cek <= t) n ans += x, x *= 2; n else n x /= 2; n } n printf( %d n , ans); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int fun(string s, int i) { n int k = 0; n while (s[i] == 0 & i >= 0) { n k++; n i--; n } n return k; n } n int main(int argc, char const *argv[]) { n string s; n int a, k = 0, count = 1; n cin >> a; n cin >> s; n string ans = ; n int i = s.size() - 1; n if (s[i] == 0 ) { n while (s[i] == 0 ) { n ans = ans + 0 ; n i--; n } n } n while (i >= 0) { n k = 0; n if (s[i] == 1 ) { n while (s[i] == 1 && i >= 0) { n k++; n i--; n } n ans = ans + char( 0 + k); n } else if (s[i] == 0 ) { n int t = fun(s, i); n i = i - t; n while (t > 1) { n ans = ans + 0 ; n t = t - 1; n } n } n } n reverse(ans.begin(), ans.end()); n int myint1 = stoi(ans); n cout << myint1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 55; n int n, m, dp[MAX_N][MAX_N][MAX_N][MAX_N]; n char a[MAX_N][MAX_N]; n int dfs(int x1, int y1, int x2, int y2) { n if (dp[x1][y1][x2][y2] >= 0) { n return dp[x1][y1][x2][y2]; n } n if (x1 == x2 && y1 == y2) { n return dp[x1][y1][x2][y2] = a[x1][y1] == # ; n } n int &ans = dp[x1][y1][x2][y2]; n ans = max(x2 - x1 + 1, y2 - y1 + 1); n for (int i = x1; i < x2; ++i) { n ans = min(ans, dfs(x1, y1, i, y2) + dfs(i + 1, y1, x2, y2)); n } n for (int j = y1; j < y2; ++j) { n ans = min(ans, dfs(x1, y1, x2, j) + dfs(x1, j + 1, x2, y2)); n } n return ans; n } n int main() { n scanf( %d , &n); n memset(dp, -1, sizeof dp); n for (int i = 1; i <= n; ++i) { n scanf( %s , a[i] + 1); n } n printf( %d n , dfs(1, 1, n, n)); n } n "} +{"func_code_string": "#include n using namespace std; n const long long int delta = 1e9 + 5; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ; n int x; n int d; n cin >> x >> d; n vector ans; n long long int cur = 1; n for (int i = 31; i >= 0; i--) { n long long int cnt = (1LL << i); n while (x >= cnt) { n x -= cnt; n for (int j = 0; j < i; j++) { n ans.push_back(cur); n } n cur += d; n ans.push_back(cur); n cur += d; n } n } n cout << ans.size() << n ; n for (auto a : ans) cout << a << ; n cout << endl; n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n string str; n cin >> str; n int n = str.length(); n map mp; n for (int i = 0; i < n; i++) { n mp[str[i]]++; n } n if (mp.size() % 2 == 1) n cout << IGNORE HIM! ; n else n cout << CHAT WITH HER! ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 998244353LL, INV2 = (MOD + 1) / 2; n const int MAXN = 500; n long long DP[MAXN + 1][MAXN + 1]; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int N, K; n cin >> N >> K; n for (int k = 1; k <= min(N, K); ++k) { n DP[k][0] = 2; n for (int n = 1; n <= N; ++n) { n for (int m = n - 1; m >= 0 && n - m <= k; --m) DP[k][n] += DP[k][m]; n DP[k][n] %= MOD; n } n } n long long ans = 0; n for (int k = 1; k <= N && k < K; ++k) { n long long aux = (DP[k][N] + MOD - DP[k - 1][N]) * n DP[min((K + k - 1) / k - 1, N)][N] % MOD; n aux = aux * INV2 % MOD; n ans += aux; n ans %= MOD; n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long cubes[100001], x; n long long my_pow(long long x) { return x * x * x; } n pair best; n void rec(long long m, long long steps, long long subtracted) { n if (m == 0) { n best = max(best, make_pair(steps, subtracted)); n return; n } n long long x = 1; n while (my_pow(x + 1) <= m) ++x; n rec(m - my_pow(x), steps + 1, subtracted + my_pow(x)); n if (x - 1 >= 0) n rec(my_pow(x) - 1 - my_pow(x - 1), steps + 1, subtracted + my_pow(x - 1)); n } n int main() { n long long m; n scanf( %I64d , &m); n rec(m, 0, 0); n printf( %I64d %I64d , best.first, best.second); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n using namespace std; n const long long infl = 0x3f3f3f3f3f3f3f3fLL; n const long long infi = 0x3f3f3f3f; n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count()); n const long long mod = 1e9 + 7; n const long long N = 1e6 + 5; n void solve() { n long long m; n cin >> m; n cout << (m / 4 + 1) % mod * ((m / 2 - m / 4 + 1) % mod + mod) % mod << n ; n } n signed main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n cout << fixed << setprecision(15); n long long t = 1; n cin >> t; n while (t--) solve(); n return 0; n } n long long powm(long long a, long long b) { n long long res = 1; n while (b) { n if (b & 1) res = (res * a) % mod; n a = (a * a) % mod; n b >>= 1; n } n return res; n } n long long divide(long long a, long long b) { n return (a % mod) * powm(b, mod - 2) % mod; n } n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n "} +{"func_code_string": "#include n using namespace std; n int ABS(int a) { n if (a < 0) return (-a); n return a; n } n void input() {} n int n, table; n int a[55]; n double dp[55][55][55][55]; n int aim; n double f(int idx, int sum, int k, int cnt) { n if (idx == n) { n if (sum != aim || cnt == 0) return 0; n return (k * cnt * 1.0) / ((double)(n)-k); n } n double &res = dp[idx][sum][k][cnt]; n if (res > -0.5) return res; n double invK = (k + 1.0) / (idx + 1.0); n double invNK = (idx - k + 1.0) / (idx + 1.0); n res = 0.0; n if (sum + a[idx] <= aim) { n res += invK * f(idx + 1, sum + a[idx], k + 1, cnt); n } n if (aim + a[idx] > table) cnt++; n res += invNK * f(idx + 1, sum, k, cnt); n return res; n } n int main() { n input(); n cin >> n; n int sum = 0; n for (int i = (0); i < (n); ++i) { n cin >> a[i]; n sum += a[i]; n } n cin >> table; n if (sum <= table) { n printf( %d n , n); n return 0; n } n double ans = 0.0; n for (int i = (1); i < (table + 1); ++i) { n for (int I = (0); I < (55); ++I) n for (int j = (0); j < (55); ++j) n for (int k = (0); k < (55); ++k) n for (int l = (0); l < (55); ++l) dp[I][j][k][l] = -1.0; n aim = i; n ans += f(0, 0, 0, 0); n } n printf( %.12lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 100010; n const int MAXK = 20; n int times[MAXN]; n int dp[MAXN][MAXK]; n int subtree[MAXN]; n int marc[MAXN]; n int prof[MAXN]; n vector graph[MAXN]; n vector> arcs; n void init_dfs(int u) { n marc[u] = 1; n for (int v : graph[u]) { n if (marc[v]) continue; n dp[v][0] = u; n for (int i = 1; i < MAXK; ++i) dp[v][i] = dp[dp[v][i - 1]][i - 1]; n prof[v] = prof[u] + 1; n init_dfs(v); n } n } n inline int lca(int a, int b) { n if (prof[a] > prof[b]) swap(a, b); n int d = prof[b] - prof[a]; n for (int i = 0; i < MAXK; ++i) n if (d & (1 << i)) b = dp[b][i]; n if (a == b) return a; n for (int i = MAXK - 1; i >= 0; --i) n if (dp[a][i] != dp[b][i]) { n a = dp[a][i]; n b = dp[b][i]; n } n return dp[a][0]; n } n inline void add_path(int u, int v) { n ++times[u]; n --times[v]; n } n inline void add_arc(int u, int v) { n graph[u].push_back(v); n graph[v].push_back(u); n arcs.push_back({u, v}); n } n void final_dfs(int u) { n marc[u] = 2; n subtree[u] = times[u]; n for (int v : graph[u]) { n if (marc[v] == 2) continue; n final_dfs(v); n subtree[u] += subtree[v]; n } n } n int main() { n int n; n scanf( %d , &n); n for (int i = 0; i < n - 1; ++i) { n int u, v; n scanf( %d%d , &u, &v); n add_arc(u, v); n } n init_dfs(1); n int k; n scanf( %d , &k); n for (int i = 0; i < k; ++i) { n int u, v; n scanf( %d%d , &u, &v); n int w = lca(u, v); n add_path(u, w); n add_path(v, w); n } n final_dfs(1); n for (auto [u, v] : arcs) { n if (prof[u] < prof[v]) swap(u, v); n printf( %d , subtree[u]); n } n printf( n ); n } n "} +{"func_code_string": "#include n using namespace std; n vector> v[4]; n double x[3], y[3], r[3]; n void add_point(int p, double x, double y) { n for (int t = 0; t < v[p].size(); t++) n if (fabs(x - v[p][t].first) < 1e-7 && fabs(y - v[p][t].second) < 1e-7) n return; n v[p].push_back(make_pair(x, y)); n } n int main() { n int n, ans = 0; n cin >> n; n for (int i = 0; i < n; i++) cin >> x[i] >> y[i] >> r[i]; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n double a = 2 * (x[j] - x[i]), b = 2 * (y[j] - y[i]), n c = (a * a + b * b) / 4 + r[i] * r[i] - r[j] * r[j]; n double d = a * a + b * b, x0 = a * c / d + x[i], y0 = b * c / d + y[i], n md = r[i] * r[i] * d - c * c; n if (i == j || md < 0) continue; n b *= sqrt(md) / d, a *= sqrt(md) / d; n for (int k = 0, p[3] = {3, i, j}; k < 3; k++) n add_point(p[k], x0 + b, y0 - a), add_point(p[k], x0 - b, y0 + a); n } n ans += v[i].size() ? v[i].size() : 1; n } n cout << ans + 2 - (v[3].size() ? v[3].size() : 1) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long Mod = 1000000007; n long long fp(long long a, long long k) { n long long res = 1; n while (k) { n if (k & 1) res = res * a % Mod; n a = a * a % Mod; n k >>= 1; n } n return res; n } n int main() { n long long n, m; n scanf( %I64d%I64d , &n, &m); n long long res = (m == 1 ? n + 1 n : ((m * fp(2 * m - 1, n) - fp(m, n)) % Mod + Mod) * n fp(m - 1, Mod - 2) % Mod); n printf( %I64d , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1e9 + 7; n void solve() { n long long n, m; n cin >> n >> m; n if (m == 1) { n long long a = n * (n - 1) / 2; n cout << a << << a << endl; n } else { n long long aux = n - (m - 1); n long long maxi = aux * (aux - 1) / 2; n long long mini = 0; n aux = n / m; n long long left = n - m * aux; n if (left != 0) { n mini = (aux + 1) * aux / 2 * left + (m - left) * (aux * (aux - 1)) / 2; n } else { n mini = (aux * (aux - 1)) / 2 * m; n } n cout << mini << << maxi << endl; n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 25; n long long n, ans[N]; n pair arr[N]; n int main() { n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); n cin >> n; n for (int i = 0; i < n; i++) cin >> arr[i].first, arr[i].second = i; n sort(arr, arr + n); n for (int i = 0; i < n; i++) ans[arr[(i + 1) % n].second] = arr[i].first; n for (int i = 0; i < n; i++) cout << ans[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int gcd(long long int a, long long int b) { n return b == 0 ? a : gcd(b, a % b); n } n inline long long int lbt(long long int x) { return x & -x; } n inline void fail() { n cout << -1 << endl; n exit(0); n } n int main() { n long long int a, b, c, d, e, f, h, x(0); n cin >> a >> b >> c >> d; n e = a * b; n f = c * d; n h = gcd(e, f); n e /= h, f /= h; n if (e == 1) { n while (c % 3 == 0 && f != lbt(f)) ++x, c /= 3, c <<= 1, f /= 3, f <<= 1; n while (d % 3 == 0 && f != lbt(f)) ++x, d /= 3, d <<= 1, f /= 3, f <<= 1; n ; n } else if (f == 1) { n while (a % 3 == 0 && e != lbt(e)) ++x, a /= 3, a <<= 1, e /= 3, e <<= 1; n while (b % 3 == 0 && e != lbt(e)) ++x, b /= 3, b <<= 1, e /= 3, e <<= 1; n ; n } else if (e == lbt(e)) { n h = f; n while (h % 3 == 0) h /= 3; n if (h != 1) fail(); n ; n while (c % 3 == 0 && f != lbt(f)) ++x, c /= 3, c <<= 1, f /= 3, f <<= 1; n while (d % 3 == 0 && f != lbt(f)) ++x, d /= 3, d <<= 1, f /= 3, f <<= 1; n ; n } else if (f == lbt(f)) { n h = e; n while (h % 3 == 0) h /= 3; n if (h != 1) fail(); n ; n while (a % 3 == 0 && e != lbt(e)) ++x, a /= 3, a <<= 1, e /= 3, e <<= 1; n while (b % 3 == 0 && e != lbt(e)) ++x, b /= 3, b <<= 1, e /= 3, e <<= 1; n ; n } else n fail(); n while ((~c & 1) && e < f) ++x, c >>= 1, f >>= 1; n while ((~d & 1) && e < f) ++x, d >>= 1, f >>= 1; n ; n while ((~a & 1) && f < e) ++x, a >>= 1, e >>= 1; n while ((~b & 1) && f < e) ++x, b >>= 1, e >>= 1; n ; n FINAL: n cout << x << endl << a << << b << endl << c << << d << endl; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, l, r; n long long gerar(long long n) { n if (n == 0) { n return 0; n } n return 2 * gerar(n / 2) + 1; n } n long long solve(long long esq, long long dir, long long l, long long r, n long long valor) { n long long mid = (esq + dir) / 2; n long long res = 0; n if (valor == 1) { n return 1; n } n if (valor == 0) { n return 0; n } n if (mid >= l && mid <= r) { n res += valor % 2ll; n } n if (mid - 1 >= l) { n res += solve(esq, mid - 1, l, r, valor / 2ll); n } n if (mid + 1 <= r) { n res += solve(mid + 1, dir, l, r, valor / 2ll); n } n return res; n } n int main() { n scanf( %lld %lld %lld , &n, &l, &r); n long long qtd = gerar(n); n printf( %lld n , solve(1, qtd, l, r, n)); n } n "} +{"func_code_string": "#include n using namespace std; n long long add(long long a, long long b) { n a += b; n if (a >= 998244353) { n a -= 998244353; n } n return a; n } n long long sub(long long a, long long b) { n a -= b; n if (a < 0) { n a += 998244353; n } n return a; n } n long long mul(long long a, long long b) { return (a * b) % 998244353; } n void add_self(long long& a, long long b) { a = add(a, b); } n void sub_self(long long& a, long long b) { a = sub(a, b); } n void mul_self(long long& a, long long b) { a = mul(a, b); } n const long long MAXN = 200010; n long long fpower(long long x, long long y, long long p) { n long long res = 1; n x = x % p; n while (y > 0) { n if (y & 1) res = (res * x) % p; n y = y >> 1; n x = (x * x) % p; n } n return res; n } n int main() { n long long x, y; n cin >> x >> y; n cout << fpower(2, x + y, 998244353) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int num[500005]; n int maps[500005]; n int to[500005]; n int main() { n ios::sync_with_stdio(0); n int n, m; n int l, r; n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) { n scanf( %d , &num[i]); n to[num[i]] = i; n } n for (int i = 1; i <= m; i++) { n scanf( %d%d , &l, &r); n if (to[r] < to[l]) { n int tmp = r; n r = l; n l = tmp; n } n maps[to[r]] = max(to[l], maps[to[r]]); n } n l = 1; n long long ans = 0; n for (int i = 1; i <= n; i++) { n if (maps[i] >= l) l = maps[i] + 1; n ans += i - l + 1; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n long long n, k; n cin >> n >> k; n long long i = 1, cnt = 0; n while (i < k && i < n) { n cnt++; n i = i * 2; n } n if (i < n) { n cnt += (n - i) / k; n if ((n - i) % k) cnt++; n } n cout << cnt << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using UL = unsigned int; n using ULL = unsigned long long; n using LL = long long; n int N; n int CB[300000]; n int CN[300000]; n int Bbuf = 0, Nbuf = 0; n int F(int cn, int cb) { n int ans = 0; n for (int i = 0; i < (N); i++) { n ans = max(ans, abs(cn - CN[i])); n ans = max(ans, abs(cb - CB[i])); n ans = max(ans, abs((cn - CN[i]) - (cb - CB[i]))); n } n return ans; n } n int FF(int cb) { n int lN, rN; n lN = -1; n rN = 500010; n if (cb == 0) lN = 0; n while (lN + 2 < rN) { n int m1N = (lN + lN + rN) / 3, m2N = (lN + rN + rN) / 3; n if (F(m1N, cb) < F(m2N, cb)) n rN = m2N; n else n lN = m1N; n } n Nbuf = lN + 1; n return F(Nbuf, cb); n } n int main() { n cin >> N; n for (int i = 0; i < (N); i++) { n CB[i] = CN[i] = 0; n string S; n cin >> S; n for (char c : S) n if (c == B ) n CB[i]++; n else if (c == N ) n CN[i]++; n } n int lB, rB; n lB = -1; n rB = 500010; n while (lB + 2 < rB) { n int m1B = (lB + lB + rB) / 3, m2B = (lB + rB + rB) / 3; n if (FF(m1B) < FF(m2B)) n rB = m2B; n else n lB = m1B; n } n Bbuf = lB + 1; n FF(Bbuf); n printf( %d n , F(Nbuf, Bbuf)); n for (int i = 0; i < (Bbuf); i++) printf( B ); n for (int i = 0; i < (Nbuf); i++) printf( N ); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n set S; n int n, a[500005], b[500005], q[500005], r; n int main() { n scanf( %d , &n); n n *= 2; n int tot = 0; n for (int i = 1; i <= n; i++) { n char c = getchar(); n while (c != + && c != - ) c = getchar(); n if (c == + ) n q[++r] = ++tot, b[i] = 0; n else { n int x; n scanf( %d , &x); n b[i] = x; n if (!r) return puts( NO ), 0; n a[q[r]] = x; n r--; n } n } n if (r) return puts( NO ), 0; n tot = 0; n for (int i = 1; i <= n; i++) { n if (!b[i]) { n ++tot; n S.insert(a[tot]); n } else { n int p = (*S.begin()); n S.erase(S.begin()); n if (p != b[i]) return puts( NO ), 0; n } n } n puts( YES ); n for (int i = 1; i <= n / 2; i++) printf( %d , a[i]); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n scanf( %d , &t); n while (t--) { n int n; n scanf( %d , &n); n int a[n], b[n]; n for (int i = 0; i < n; i++) scanf( %d%d , &a[i], &b[i]); n if (a[0] < b[0]) n printf( NO n ); n else { n int f = 1; n for (int i = 1; i < n; i++) { n if (a[i] < a[i - 1] || b[i] < b[i - 1]) { n f = 0; n break; n } n if (a[i] - a[i - 1] < b[i] - b[i - 1]) { n f = 0; n break; n } n } n if (f) n printf( YES n ); n else n printf( NO n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double pi = acos(-1.0); n const int inf = (int)1e9; n struct vert { n int to, z, num; n }; n struct ans { n int x, y, z; n }; n const int N = (int)(1e5) + 5; n int n, m; n vector g[N]; n vector d(N, inf); n vector dp(N, inf); n vector pr(N, -1); n vector road(N); n void go() { n queue q; n q.push(0); n d[0] = 0; n while (!q.empty()) { n int v = q.front(); n q.pop(); n for (int i = 0; i < (int)g[v].size(); ++i) { n int to = g[v][i].to; n if (d[to] == inf) { n d[to] = d[v] + 1; n q.push(to); n } n } n } n } n void getAns() { n queue q; n q.push(n - 1); n dp[n - 1] = 0; n while (!q.empty()) { n int v = q.front(); n q.pop(); n for (int i = 0; i < (int)g[v].size(); ++i) { n int to = g[v][i].to; n int z = 1 - g[v][i].z; n if (d[to] + 1 == d[v]) { n if (dp[to] > dp[v] + z) { n dp[to] = dp[v] + z; n pr[to] = v; n } n q.push(to); n } n } n } n } n int main() { n cin >> n >> m; n vert p; n int kol = 0; n for (int i = 0; i < m; ++i) { n int x, y, z; n scanf( %d %d %d , &x, &y, &z); n --x; n --y; n p.z = z; n p.num = i; n if (z == 0) { n ++kol; n } n p.to = y; n g[x].push_back(p); n p.to = x; n g[y].push_back(p); n } n go(); n getAns(); n vector out; n ans a; n int v = 0; n for (int to = pr[0]; to != -1; to = pr[to]) { n vert now; n for (int k = 0; k < g[v].size(); ++k) { n if (g[v][k].to == to) { n now = g[v][k]; n break; n } n } n road[now.num] = true; n if (now.z == 0) { n a.x = v + 1; n a.y = to + 1; n a.z = 1; n out.push_back(a); n } n v = to; n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < (int)g[i].size(); ++j) { n if (road[g[i][j].num]) { n continue; n } n if (g[i][j].z == 1) { n a.x = i + 1; n a.y = g[i][j].to + 1; n a.z = 0; n road[g[i][j].num] = true; n out.push_back(a); n } n } n } n cout << out.size() << n ; n for (int i = 0; i < out.size(); ++i) { n cout << out[i].x << << out[i].y << << out[i].z << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int mod = (int)1e9 + 7; n struct matrix { n int A[2][2] = {0}; n matrix operator*(matrix B) { n matrix C; n for (int i = 0; i < 2; i++) n for (int j = 0; j < 2; j++) n for (int k = 0; k < 2; k++) n C[i][j] = (C[i][j] + 1ll * A[i][k] * B[k][j]) % mod; n return C; n } n matrix operator+(matrix B) { n matrix C; n for (int i = 0; i < 2; i++) n for (int j = 0; j < 2; j++) C[i][j] = (A[i][j] + B[i][j]) % mod; n return C; n } n matrix pow(int n) { n matrix B, C = *this; n for (int i = 0; i < 2; i++) B[i][i] = 1; n while (n) { n if (n & 1) B = B * C; n C = C * C; n n >>= 1; n } n return B; n } n int *operator[](int i) { return A[i]; } n }; n matrix fib; n struct segment_tree { n struct node { n node *node_l, *node_r; n int l, r; n matrix sum, mul; n } * root; n node *build(vector &a, int l, int r) { n node *res = new node; n res->l = l; n res->r = r; n res->mul[0][0] = res->mul[1][1] = 1; n if (l == r) { n res->sum = fib.pow(a[l]); n res->node_l = res->node_r = nullptr; n } else { n int m = (l + r) >> 1; n res->node_l = build(a, l, m); n res->node_r = build(a, m + 1, r); n res->sum = res->node_l->sum + res->node_r->sum; n } n return res; n } n void build(vector &a) { root = build(a, 0, a.size() - 1); } n void push(node *root) { n if (root->mul[1][0] + root->mul[0][0] + root->mul[0][1] + root->mul[1][1] == n 2) n return; n if (root->node_l) { n root->node_l->mul = root->node_l->mul * root->mul; n root->node_l->sum = root->node_l->sum * root->mul; n } n if (root->node_r) { n root->node_r->mul = root->node_r->mul * root->mul; n root->node_r->sum = root->node_r->sum * root->mul; n } n root->mul[0][0] = root->mul[1][1] = 1; n root->mul[1][0] = root->mul[0][1] = 0; n } n void update(node *root, int l, int r) { n if (root->l > r || root->r < l) return; n if (root->l >= l && root->r <= r) { n root->sum = root->sum * fib; n root->mul = root->mul * fib; n } else { n push(root); n update(root->node_l, l, r); n update(root->node_r, l, r); n root->sum = root->node_l->sum + root->node_r->sum; n } n } n void update(int l, int r) { update(root, l, r); } n matrix query(node *root, int l, int r) { n push(root); n if (root->l > r || root->r < l) return matrix(); n if (root->l >= l && root->r <= r) return root->sum; n return query(root->node_l, l, r) + query(root->node_r, l, r); n } n matrix query(int l, int r) { return query(root, l, r); } n }; n int main() { n fib[0][1] = fib[1][0] = fib[0][0] = 1; n int n, m; n scanf( %d %d , &n, &m); n vector v(n); n for (int &p : v) scanf( %d , &p); n segment_tree sg; n sg.build(v); n for (int i = 0; i < m; i++) { n int t, l, r; n scanf( %d %d %d , &t, &l, &r); n l--, r--; n if (t == 1) { n int x; n scanf( %d , &x); n matrix tmp = fib; n fib = fib.pow(x); n sg.update(l, r); n fib = tmp; n } else { n printf( %d n , sg.query(l, r)[0][1]); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int a[110], b[110]; n int main() { n int n; n cin >> n; n for (int i = 1; i <= n; ++i) cin >> a[i]; n sort(a + 1, a + 1 + n); n int aa = a[n]; n cin >> n; n for (int i = 1; i <= n; ++i) cin >> b[i]; n sort(b + 1, b + 1 + n); n int bb = b[n]; n cout << aa << << bb << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const long long LINF = 0x3f3f3f3f3f3f3f3f; n int v[1010]; n bool compare(pair a, pair b) { n if (a.second != b.second) return a.second > b.second; n if (v[a.first] != v[b.first]) return v[a.first] < v[b.first]; n return a.first < b.first; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int n; n cin >> n; n for (int i = 0; i < n; i++) cin >> v[i]; n vector > ret; n for (int i = 0; i < n; i++) { n for (int j = i + 1; j < n; j++) { n if (v[j] < v[i]) ret.push_back({i, j}); n } n } n sort(ret.begin(), ret.end(), compare); n cout << ret.size() << n ; n for (auto x : ret) { n cout << x.first + 1 << << x.second + 1 << n ; n } n exit(0); n } n "} +{"func_code_string": "#include n using namespace std; n void fast() { n ios_base::sync_with_stdio(0); n cin.tie(NULL), cout.tie(NULL); n } n int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } n int lcm(int a, int b) { return a * (b / gcd(a, b)); } n char maze[1001][1001]; n int main() { n fast(); n int num, one = 0, two = 0, there = 0, six = 0, fou = 0; n cin >> num; n ; n for (int i = 0; i < num; i++) { n int x; n cin >> x; n one += bool(x == 1); n two += bool(x == 2); n there += bool(x == 3); n fou += bool(x == 4); n six += bool(x == 6); n } n if ((fou + six) != num / 3 || (one) != num / 3 || (two + there) != num / 3) { n cout << -1 << endl; n return 0; n } n vector vs; n for (int i = 0; i < num / 3; i++) { n string s = ; n s += 1 ; n s += ; n if (there == six && six && there) { n s += 3 , s += , s += 6 ; n six--, there--; n } else if (two) { n s += 2 ; n s += ; n if (fou) n s += 4 , fou--; n else if (six) n s += 6 , six--; n else { n cout << -1 << endl; n return 0; n } n two--; n } else { n cout << -1 << endl; n return 0; n } n vs.push_back(s); n } n for (int i = 0; i < vs.size(); i++) { n cout << vs[i] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n const int maxN = 2 * 1e5; n int answers[maxN]; n int n, m, x, neg = 0, pos = 0; n cin >> n >> m; n for (int i = 0; i < n; i++) { n cin >> x; n if (x == -1) n neg++; n else n pos++; n } n int li, ri, range; n for (int i = 0; i < m; i++) { n cin >> li >> ri; n range = ri - li + 1; n if (range % 2 != 0) n answers[i] = 0; n else if (pos >= range / 2 && neg >= range / 2) { n answers[i] = 1; n } else { n answers[i] = 0; n } n } n for (int i = 0; i < m; i++) { n cout << answers[i] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 * 4; n inline int get() { n int x; n cin >> x; n return x; n } n inline long long getlong() { n long long x; n cin >> x; n return x; n } n inline string getString() { n string s; n cin >> s; n return s; n } n template n inline vector getvector(int len) { n vector a(len); n for (auto &it : a) cin >> it; n return a; n } n inline vector getvector(int len) { n vector a(len); n for (auto &it : a) cin >> it; n return a; n } n inline vector> getvector_andPairCnt(int len) { n vector> a(len); n int i = 1; n for (auto &it : a) { n it.second = i; n i++; n cin >> it.first; n } n return a; n } n double power_log(double power, double val) { return log(val) / log(power); } n template n T sqr(T x) { n return x * x; n } n template n ostream &operator<<(ostream &os, const vector &v) { n for (auto it : v) os << it << ; n os << n ; n return os; n } n template n inline vector> getvector_andBiPair(int len) { n vector> a(len); n for (auto &it : a) { n cin >> it.first >> it.second; n } n return a; n } n template n inline set vector_to_set(const vector &vec) { n set s; n for (auto &it : vec) s.insert(it); n return s; n } n int main() { n auto n = getlong(), k = getlong(); n int t = get(); n if (t <= k) { n cout << t; n } else { n if (t >= n) { n cout << (n + k) - t; n } else { n cout << k; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n void split(string &s, vector &v, string &sep) { n int current, previous = 0; n current = s.find_first_of(sep); n while (current != string::npos) { n v.push_back(s.substr(previous, current - previous)); n previous = current + 1; n current = s.find_first_of(sep, previous); n } n v.push_back(s.substr(previous, current - previous)); n } n int main() { n int n, flag = 0; n cin >> n; n for (int i = 0; i < n; i++) { n int temp; n cin >> temp; n if (temp) { n flag = 1; n } n } n if (flag) { n cout << HARD ; n cout << endl; n } else { n cout << EASY ; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int has[205][205]; n int vis[205][205]; n vector > q; n int gcd(int x, int y) { n if (x < y) swap(x, y); n while (y) { n int t = x % y; n x = y; n y = t; n } n return x; n } n int main() { n int n; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n int x, y; n scanf( %d%d , &x, &y); n q.push_back(make_pair(y + 100, x + 100)); n has[x + 100][y + 100] = 1; n } n sort(q.begin(), q.end()); n if (n < 3) { n printf( 0 n ); n return 0; n } n long long ans1 = 0; n int hehe = 0; n int L = q.size(); n for (int i = 1; i <= 200; i++) { n for (int j = 1; j <= 200; j++) { n if (gcd(i, j) != 1) continue; n memset(vis, 0, sizeof(vis)); n for (int k = 0; k < L; k++) { n int yy = q[k].first; n int xx = q[k].second; n if (vis[xx][yy]) continue; n int res = 0; n while (xx <= 200 && yy <= 200) { n vis[xx][yy] = 1; n res += has[xx][yy]; n xx += i; n yy += j; n } n if (res > 2) ans1 += (long long)res * (res - 1) * (res - 2) / 6; n } n memset(vis, 0, sizeof(vis)); n for (int k = 0; k < L; k++) { n int yy = q[k].first; n int xx = q[k].second; n if (vis[xx][yy]) continue; n int res = 0; n while (xx >= 0 && yy <= 200) { n vis[xx][yy] = 1; n res += has[xx][yy]; n xx -= i; n yy += j; n } n if (res > 2) ans1 += (long long)res * (res - 1) * (res - 2) / 6; n } n } n } n for (int i = 0; i <= 200; i++) { n int xx = i; n int yy = 0; n int res = 0; n while (xx <= 200 && yy <= 200) { n res += has[xx][yy]; n yy += 1; n } n if (res >= 3) { n ans1 += (long long)res * (res - 1) * (res - 2) / 6; n } n } n for (int i = 0; i <= 200; i++) { n int xx = 0; n int yy = i; n int res = 0; n while (xx <= 200 && yy <= 200) { n res += has[xx][yy]; n xx += 1; n } n if (res >= 3) { n ans1 += (long long)res * (res - 1) * (res - 2) / 6; n } n } n long long ans = (long long)n * (n - 1) * (n - 2) / 6 - ans1; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long N; n scanf( %I64d , &N); n int l = 1, r = 20000000, ans = 0; n while (l <= r) { n int mid = (l + r) >> 1; n if ((long long)mid * (mid + 1) < N * 2) n ans = mid, l = mid + 1; n else n r = mid - 1; n } n printf( %I64d , N - (long long)ans * (ans + 1) / 2); n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:96777216 ) n using namespace std; n const double NOT_FOUND = -1000000000; n const double EPS = 0.00000001; n const double PI = acos(-1.0); n struct point { n double x, y; n }; n point make_point(double a, double b) { n point c; n c.x = a; n c.y = b; n return c; n } n struct line { n double A, B, C; n }; n line make_line(double a, double b, double c) { n line p; n p.A = a; n p.B = b; n p.C = c; n return p; n } n struct circle { n double R; n point center; n vector intersects; n }; n circle make_circle(point c, double r) { n circle C; n C.R = r; n C.center = c; n return C; n } n int main() { n int N, K; n cin >> N >> K; n if (K > N) { n cout << -1; n return 0; n } n if (K == 1 && N > 1) { n cout << -1; n return 0; n } n if (K == N) { n char p = a ; n for (int i = 0; i < N; i++) { n cout << p; n p++; n } n return 0; n } n string S; n for (char c = a + K - 1; c > b ; c--) { n S += c; n N--; n } n if (N % 2) { n S += a ; n N--; n } n for (int i = 0; i < N; i += 2) S += ba ; n for (int i = (int)S.length() - 1; i >= 0; i--) cout << S[i]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int prim[10] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29}; n int n; n long long ans; n void DFS(int a, int b, long long temp) { n if (temp < ans && a == n) ans = temp; n if (a >= n) return; n for (int i = 1; i <= 64; i++) { n if (ans / prim[b] < temp) break; n temp *= prim[b]; n DFS(a * (i + 1), (b + 1), temp); n } n } n int main() { n while (scanf( %d , &n) != EOF) { n ans = LONG_LONG_MAX; n DFS(1, 0, 1); n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int ABS(int a) { n if (a < 0) return (-a); n return a; n } n void input() {} n int a[100005]; n int seg[100005]; n int nxt[100005]; n int hop[100005]; n void readInt(int &n) { n n = 0; n char ch = getchar(); n while (!isdigit(ch)) ch = getchar(); n while (isdigit(ch)) { n n = n * 10 + ch - 48; n ch = getchar(); n } n } n int main() { n input(); n int n, q; n readInt(n); n readInt(q); n int sq = sqrt(n); n int c = 0, cnt = 0; n for (int i = (0); i < (n); ++i) { n readInt(a[i]); n seg[i] = cnt; n c++; n if (c == sq) c = 0, cnt++; n } n for (int i = (n - 1); i >= (0); --i) { n int to = i + a[i]; n hop[i] = 1; n if (to >= n) n nxt[i] = -1; n else if (seg[to] != seg[i]) n nxt[i] = to; n else { n nxt[i] = nxt[to]; n hop[i] += hop[to]; n } n } n while (q--) { n int type; n readInt(type); n if (type == 0) { n int x, y; n readInt(x); n readInt(y); n x--; n int i = x; n a[x] = y; n while (i >= 0) { n if (seg[i] != seg[x]) break; n int to = i + a[i]; n hop[i] = 1; n if (to >= n) n nxt[i] = -1; n else if (seg[to] != seg[i]) n nxt[i] = to; n else { n nxt[i] = nxt[to]; n hop[i] += hop[to]; n } n i--; n } n } else { n int x; n readInt(x); n x--; n int ans = 0; n int last = x; n while (x != -1) { n ans += hop[x]; n last = x; n x = nxt[x]; n } n while (last + a[last] < n) last = last + a[last]; n printf( %d %d n , last + 1, ans); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mx = 200100; n struct node { n int x, y, z; n } a[mx]; n struct nod { n int id, x; n } b[mx]; n int fa[mx]; n long long num[mx]; n long long ans[mx]; n int n, m; n bool cmp(node x, node y) { return x.z < y.z; } n bool cmp1(nod x, nod y) { return x.x < y.x; } n int find(int x) { n if (x != fa[x]) { n return fa[x] = find(fa[x]); n } n return fa[x]; n } n int main() { n cin >> n >> m; n for (int i = 1; i <= n; i++) fa[i] = i, num[i] = 1; n for (int i = 1; i < n; i++) { n cin >> a[i].x >> a[i].y >> a[i].z; n } n for (int i = 1; i <= m; i++) { n cin >> b[i].x; n b[i].id = i; n } n sort(a + 1, a + n, cmp); n sort(b + 1, b + m + 1, cmp1); n int l = 1; n long long sum = 0; n for (int i = 1; i < n; i++) { n while (l <= m && a[i].z > b[l].x) { n ans[b[l].id] = sum; n l++; n } n int x = find(a[i].x); n int y = find(a[i].y); n sum += num[y] * num[x]; n fa[x] = y; n num[y] += num[x]; n } n while (l <= m) { n if (a[n - 1].z <= b[l].x) { n ans[b[l].id] = sum; n } n l++; n } n for (int i = 1; i <= m; i++) cout << ans[i] << n [i == m]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int a[100005], ans[100005]; n int main() { n long long int n, i, j; n cin >> n; n for (i = 0; i < n; i++) { n cin >> j; n a[j] += 1 * j; n } n ans[1] = a[1]; n ans[2] = a[2]; n ans[3] = a[1] + a[3]; n for (i = 4; i < 100005; i++) { n ans[i] = max(ans[i - 2] + a[i], ans[i - 3] + a[i]); n } n cout << ans[100004]; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n int main() { n int T; n cin >> T; n while (T--) { n int n; n cin >> n; n long double theta = 3.14159265358979323846 / (2 * n); n long double answer = 1 / tan(theta); n cout << setprecision(15) << answer << n ; n } n return 0; n } n "} +{"func_code_string": "#include n const int M = 1 << 20, L = 100020; n char s[L]; n int n, m, g[M], f[M], i, j, k, x, y, D; n void init() { n scanf( %d%d%s , &n, &m, s + 1); n D = (1 << m) - 1; n for (i = 1; i < n; i++) { n x = s[i] - 97; n y = s[i + 1] - 97; n if (x != y) g[1 << x | 1 << y]++; n } n for (j = 0; j < m; j++) n for (i = 0; i <= D; i++) n if (i >> j & 1) g[i] += g[i ^ 1 << j]; n } n int min(int x, int y) { return x < y ? x : y; } n void work() { n memset(f, 0x3f, sizeof(f)); n f[0] = 0; n for (i = 0; i <= D; i++) n for (j = 0; j < m; j++) n if ((i >> j & 1) == 0) n f[i | 1 << j] = min(f[i | 1 << j], f[i] + g[D] - g[i] - g[D ^ i]); n printf( %d , f[D]); n } n int main() { n init(); n work(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(); n cout.tie(); n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n string a; n cin >> a; n string last = a; n for (long long i = 0; i <= n; ++i) { n string s; n s = a; n for (long long k = 1; k < n; ++k) { n if (a[k - 1] == A ) { n s[k] = A ; n } n } n a = s; n if (a == last) { n cout << i << n ; n break; n } n last = a; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n int n = s.length(); n vector P(n, 0); n int C = 0; n int R = 0; n for (int i = 1; i < n - 1; i++) { n int mirror = 2 * C - i; n if (R > i) { n P[i] = min(R - i, P[mirror]); n } else { n P[i] = 0; n } n while ((i + 1 + P[i] < n) && (i - 1 - P[i] >= 0) && n (s[i + 1 + P[i]] == s[i - 1 - P[i]])) { n P[i]++; n } n if (i + P[i] > R) { n C = i; n R = i + P[i]; n } n } n string rev(s); n reverse(rev.begin(), rev.end()); n vector T(n, 0); n T[0] = -1; n int pos = 2; n int cnd = 0; n while (pos < n) { n if (rev[pos - 1] == rev[cnd]) { n cnd++; n T[pos] = cnd; n pos++; n } else if (cnd > 0) { n cnd = T[cnd]; n } else { n T[pos] = 0; n pos++; n } n } n int m = 0; n int revI = 0; n vector found(n + 1, -1); n found[0] = 0; n while (revI < n && m + revI < n) { n if (rev[revI] == s[m + revI]) { n if (found[revI + 1] == -1) { n found[revI + 1] = m; n } n revI++; n } else { n m = m + revI - T[revI]; n if (T[revI] > -1) { n revI = T[revI]; n } else { n revI = 0; n } n } n } n vector fend(n + 1, -1); n int fendMax = 0; n for (int i = 0; i <= n; i++) { n if (found[i] != -1) { n fend[i] = found[i] + i; n fendMax = i; n } n } n int best = 0; n int bestMidSt = 0; n int bestMidL = 0; n int bestLeftSt = 0; n int bestSideL = 0; n for (int i = 0; i < n; i++) { n int midStart = i - P[i]; n int midEnd = i + P[i]; n int lLow = 0; n int lHigh = min(n - midEnd, fendMax + 1); n int lCur = (lLow + lHigh) / 2; n while (lHigh - lLow > 1) { n if (fend[lCur] <= midStart) { n lLow = lCur; n } else { n lHigh = lCur; n } n lCur = (lLow + lHigh) / 2; n } n int curBest = 2 * P[i] + 1 + 2 * lCur; n if (curBest > best) { n best = curBest; n bestMidSt = midStart; n bestMidL = 2 * P[i] + 1; n bestLeftSt = found[lCur]; n bestSideL = lCur; n } n } n if (bestSideL == 0) { n cout << 1 << endl; n cout << (bestMidSt + 1) << << bestMidL << endl; n } else { n cout << 3 << endl; n cout << (bestLeftSt + 1) << << bestSideL << endl; n cout << (bestMidSt + 1) << << bestMidL << endl; n cout << (n - bestSideL + 1) << << bestSideL << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool ck(int x) { n int t[50], l = 0; n while (x) t[l++] = x & 1, x >>= 1; n if (l & 1) { n int lim = l - 1 >> 1; n for (int i = 0; i < lim; i++) n if (t[i]) return 0; n for (int i = lim; i < l; i++) n if (!t[i]) return 0; n } else n return 0; n return 1; n } n int main() { n int n; n cin >> n; n for (int i = n; i >= 1; i--) { n if (n % i == 0 && ck(i)) { n printf( %d n , i); n return 0; n } n } n } n "} +{"func_code_string": "#include n const int N = 2010; n std::set> set; n long long a[N][N], dis[N]; n bool vis[N]; n int n; n int main() { n scanf( %d , &n); n memset(dis, 0x7f, sizeof(dis)); n long long mine = LLONG_MAX; n for (int i = 0; i < n; ++i) { n for (int j = i + 1; j < n; ++j) { n scanf( %I64d , &a[i][j]); n mine = std::min(mine, a[j][i] = a[i][j]); n } n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < n; ++j) { n if (i == j) { n continue; n } n a[i][j] -= mine; n dis[i] = std::min(dis[i], 2 * a[i][j]); n } n } n for (int i = 0; i < n; ++i) { n set.insert({dis[i], i}); n } n for (int i = 0; i < n; ++i) { n std::pair p = *(set.begin()); n set.erase(set.begin()); n vis[p.second] = true; n for (int j = 0; j < n; ++j) { n if (!vis[j] && p.second != j) { n set.erase({dis[j], j}); n dis[j] = std::min(dis[p.second] + a[p.second][j], dis[j]); n set.insert({dis[j], j}); n } n } n } n for (int i = 0; i < n; ++i) { n printf( %I64d n , dis[i] + (n - 1) * mine); n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC target( avx2 ) n using namespace std; n void solve() { n int q; n cin >> q; n unordered_map map; n while (q--) { n string a, b; n cin >> a >> b; n if (map.find(a) != map.end()) { n string s = map[a]; n map.erase(a); n map[b] = s; n continue; n } n map[b] = a; n } n cout << map.size() << n ; n for (auto i : map) { n cout << i.second << << i.first << n ; n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int t; n t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n struct Heap { n Value p[100100]; n int pos[100100]; n vector hp; n void init() { hp.clear(); } n void swapPos(int i, int a) { n int temp; n temp = pos[hp[a]]; n pos[hp[a]] = pos[hp[i]]; n pos[hp[i]] = temp; n swap(hp[i], hp[a]); n } n void up(int a) { n int i; n while (1) { n i = a; n if (a + a + 1 < hp.size() && p[hp[i]] > p[hp[a + a + 1]]) { n i = a + a + 1; n } n if (a + a + 2 < hp.size() && p[hp[i]] > p[hp[a + a + 2]]) { n i = a + a + 2; n } n if (i == a) break; n swapPos(i, a); n a = i; n } n } n void down(int a) { n int i, temp; n while (1) { n i = a; n if (a && p[hp[i]] < p[hp[(a - 1) / 2]]) { n i = (a - 1) / 2; n } n if (i == a) break; n swapPos(i, a); n a = i; n } n } n void update(Key k, Value v) { n p[k] = v; n up(pos[k]); n down(pos[k]); n } n void push_heap(Key k, Value v) { n hp.push_back(k); n p[k] = v; n down(pos[k] = hp.size() - 1); n } n Value top() { return p[hp[0]]; } n void pop(Key& k, Value& v) { n k = hp[0]; n v = p[hp[0]]; n swapPos(0, hp.size() - 1); n hp.pop_back(); n up(0); n } n int size() { return hp.size(); } n }; n Heap hp; n template n struct Graph { n static const int gmaxn = 101000; n static const int gmaxm = 101000; n int ind[gmaxn]; n int last[gmaxm * 2], e[gmaxm * 2], gt; n T w[gmaxm * 2]; n bool bi; n int n, m; n void init() { n gt = 0; n memset(ind, 0, sizeof(ind)); n } n void addE1(int a, int b, T& c) { n gt++; n last[gt] = ind[a]; n ind[a] = gt; n e[gt] = b; n w[gt] = c; n } n void addE2(int a, int b, T& c) { n addE1(a, b, c); n addE1(b, a, c); n } n void addE(int a, int b, T& c) { n if (bi) n addE2(a, b, c); n else n addE1(a, b, c); n } n Graph(bool bidirectional = true) { bi = bidirectional; } n void next(int& a) { a = last[a]; } n void dijkstra(vector& S); n }; n int from[100100]; n long long int dis[100100]; n template n void Graph::dijkstra(vector& S) { n memset(dis, -1, sizeof(dis)); n int i, now, j; n long long int nowdis; n for (i = 0; i < S.size(); i++) { n dis[from[S[i]] = S[i]] = 0; n hp.push_heap(S[i], 0); n } n while (hp.size()) { n hp.pop(now, nowdis); n for (i = ind[now]; i; next(i)) { n j = e[i]; n if (dis[j] < 0) { n dis[j] = nowdis + w[i]; n from[j] = from[now]; n hp.push_heap(j, dis[j]); n } else if (dis[j] > nowdis + w[i]) { n dis[j] = nowdis + w[i]; n from[j] = from[now]; n hp.update(j, dis[j]); n } n } n } n } n Graph g; n bool k[100100]; n vector s; n int fa[100100]; n int findfa(int a) { n if (a == fa[a]) return a; n return fa[a] = findfa(fa[a]); n } n bool merge(int a, int b) { n a = findfa(a); n b = findfa(b); n if (a == b) return 0; n if (rand() & 1) swap(a, b); n fa[a] = b; n return 1; n } n vector > > eg; n int main() { n scanf( %d %d , &g.n, &g.m); n int i, j, a, b, cc; n long long int c; n for (i = 0; i < g.m; i++) { n scanf( %d %d %d , &a, &b, &cc); n c = cc; n g.addE(a, b, c); n } n scanf( %d , &i); n while (i--) { n scanf( %d , &j); n k[j] = 1; n s.push_back(j); n } n g.dijkstra(s); n for (i = 1; i <= g.n; i++) { n fa[i] = i; n for (j = g.ind[i]; j; g.next(j)) { n if (from[i] != from[g.e[j]]) { n eg.push_back(make_pair(dis[i] + dis[g.e[j]] + g.w[j], n make_pair(from[i], from[g.e[j]]))); n } n } n } n sort(eg.begin(), eg.end()); n long long int ans = 0; n if (!k[1]) ans += dis[1]; n for (i = 0; i < eg.size(); i++) { n if (merge(eg[i].second.first, eg[i].second.second)) { n ans += eg[i].first; n } n } n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = INT_MAX; n const int mod = 1e9 + 7; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n int arr[2][n]; n int sum[2][n]; n for (int i = 0; i < 2; i++) { n for (int j = 0; j < n; j++) { n cin >> arr[i][j]; n if (j == 0) n sum[i][j] = arr[i][j]; n else n sum[i][j] = sum[i][j - 1] + arr[i][j]; n } n } n int move1 = sum[0][n - 1]; n int move2 = sum[1][n - 1]; n int ans = min(move1 - arr[0][0], move2 - arr[1][n - 1]); n for (int i = 1; i < n; i++) { n int temp1 = move1 - sum[0][i]; n int temp2 = sum[1][i - 1]; n ans = min(ans, max(temp1, temp2)); n } n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:167772160 ) n using namespace std; n int main() { n int n; n cin >> n; n pair x[1111]; n for (int i = 0; i < n; ++i) cin >> x[i].first >> x[i].second; n long long p = 0, maxx = -1; n int j = 0; n for (int i = 0; i < x[n - 1].first; i++) { n if (p != 0) --p; n if (i == x[j].first - 1) { n p += x[j].second; n ++j; n } n if (p > maxx) maxx = p; n } n cout << x[n - 1].first + p << << maxx << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int n, k, a, b; n vector arr; n long long int rec(long long int l, long long int r) { n long long int i = lower_bound(arr.begin(), arr.end(), l) - arr.begin(); n long long int j = upper_bound(arr.begin(), arr.end(), r) - arr.begin(); n long long int x = j - i; n long long int val; n if (x == 0) { n val = a; n } else { n val = b * x * (r - l + 1); n } n if (l == r || x == 0) { n return val; n } n long long int mid = (l + r) / 2; n return min(val, rec(l, mid) + rec(mid + 1, r)); n } n int main() { n cin >> n >> k >> a >> b; n for (int i = 0; i < k; i++) { n int x; n cin >> x; n arr.push_back(x); n } n sort(arr.begin(), arr.end()); n long long int start = 1; n long long int end = pow(2, n); n cout << rec(start, end) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n char s[10]; n int main() { n scanf( %s , s); n int res = 1; n for (int i = 1; i < 7; i++) { n if (s[i] == 1 ) n res += 10, i++; n else n res += s[i] - 0 ; n } n printf( %d n , res); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 10; n char s[N]; n int main() { n vector v1, v2; n scanf( %s , s); n int len = strlen(s); n for (int i = 0; i < len; i++) { n if (s[i] == l ) { n v1.push_back(i + 1); n } else n v2.push_back(i + 1); n } n for (int x : v2) printf( %d n , x); n for (int i = (int)v1.size() - 1; i >= 0; i--) printf( %d n , v1[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 100; n int n, p[4], bx[N], wx, by[N], wy, sum[N][4]; n vector wh[N]; n struct node { n int x, y, c; n } sh[N]; n bool cmp(node a, node b) { return a.x < b.x; } n inline int read() { n int f = 1, x = 0; n char s = getchar(); n while (s < 0 || s > 9 ) { n if (s == - ) f = -1; n s = getchar(); n } n while (s >= 0 && s <= 9 ) { n x = x * 10 + s - 0 ; n s = getchar(); n } n return x * f; n } n struct bit { n int sh[N]; n void init() { memset(sh, 0, sizeof(sh)); } n int lowbit(int x) { return x & (-x); } n void change(int x, int v) { n while (x <= n) sh[x] += v, x += lowbit(x); n } n int query(int x) { n int ans = 0; n while (x) ans += sh[x], x -= lowbit(x); n return ans; n } n int ask(int l, int r) { return query(r) - query(l - 1); } n } T[4]; n int g(int l, int r, int c) { return sum[r][c] - sum[l - 1][c]; } n void init() { n memset(sum, 0, sizeof(sum)); n wx = wy = 0; n for (int i = 1; i <= n; i++) bx[++wx] = sh[i].x; n sort(bx + 1, bx + 1 + wx); n wx = unique(bx + 1, bx + 1 + wx) - bx - 1; n for (int i = 1; i <= n; i++) n sh[i].x = lower_bound(bx + 1, bx + 1 + wx, sh[i].x) - bx; n for (int i = 1; i <= n; i++) by[++wy] = sh[i].y; n sort(by + 1, by + 1 + wy); n wy = unique(by + 1, by + 1 + wy) - by - 1; n for (int i = 1; i <= n; i++) n sh[i].y = lower_bound(by + 1, by + 1 + wy, sh[i].y) - by; n sort(sh + 1, sh + 1 + n, cmp); n for (int i = 1; i <= n; i++) sum[sh[i].x][sh[i].c]++; n for (int i = 1; i <= wx; i++) n for (int j = 1; j <= 3; j++) sum[i][j] += sum[i - 1][j]; n } n int solve() { n for (int i = 1; i <= wx; i++) wh[i].clear(); n for (int i = 1; i <= n; i++) wh[sh[i].x].push_back(i); n for (int i = 1; i <= 3; i++) p[i] = i; n int ans = 1; n do { n for (int i = 2; i <= wx; i++) { n int A = sum[i - 1][p[1]], l = i, r = wx - 1; n while (l < r) { n int mid = l + ((r - l + 1) >> 1); n if (g(i, mid, p[2]) <= g(mid + 1, wx, p[3])) n l = mid; n else n r = mid - 1; n } n ans = max(ans, min({A, g(i, l, p[2]), g(l + 1, wx, p[3])})); n l++; n ans = max(ans, min({A, g(i, l, p[2]), g(l + 1, wx, p[3])})); n } n } while (next_permutation(p + 1, p + 4)); n for (int i = 1; i <= 3; i++) p[i] = i; n auto find = [](int A, int &ans) { n int l = 1, r = wy - 1; n while (l < r) { n int mid = l + ((r - l + 1) >> 1); n if (T[p[2]].ask(1, mid) <= T[p[3]].ask(mid + 1, wy)) n l = mid; n else n r = mid - 1; n } n ans = max(ans, min({A, T[p[2]].ask(1, l), T[p[3]].ask(l + 1, wy)})); n l++; n ans = max(ans, min({A, T[p[2]].ask(1, l), T[p[3]].ask(l + 1, wy)})); n }; n do { n T[p[2]].init(); n T[p[3]].init(); n for (int i = wx; i >= 1; i--) { n int A = g(1, i, p[1]); n find(A, ans); n for (int j : wh[i]) n if (sh[j].c != p[1]) T[sh[j].c].change(sh[j].y, 1); n } n } while (next_permutation(p + 1, p + 4)); n for (int i = 1; i <= 3; i++) p[i] = i; n do { n T[p[2]].init(); n T[p[3]].init(); n for (int i = 1; i <= wx; i++) { n int A = g(i, wx, p[1]); n find(A, ans); n for (int j : wh[i]) n if (sh[j].c != p[1]) T[sh[j].c].change(sh[j].y, 1); n } n } while (next_permutation(p + 1, p + 4)); n return ans; n } n signed main() { n n = read(); n for (int i = 1; i <= n; i++) sh[i] = (node){read(), read(), read()}; n init(); n int ans = solve(); n for (int i = 1; i <= n; i++) swap(sh[i].x, sh[i].y); n init(); n ans = max(ans, solve()); n printf( %d n , ans * 3); n } n "} +{"func_code_string": "#include n static const int MAXN = 50004; n static const int MAXE = 100004 * 2; n static const int MAXL = 20; n static const int MAXT = 1000005; n int n, e; n int head[MAXN], dest[MAXE], next[MAXE]; n int l[MAXN], t[MAXN][MAXL]; n int T = 0; n int p[MAXN]; n int conf[MAXN], team[MAXN]; n int team_conf[MAXT]; n inline void add_edge(int u, int v) { n static int w = 0; n dest[w] = v; n next[w] = head[u]; n head[u] = w++; n } n int main() { n scanf( %d%d , &n, &e); n for (int i = 0; i < n; ++i) head[i] = -1; n int u, v; n for (int i = 0; i < e; ++i) { n scanf( %d%d , &u, &v); n --u, --v; n add_edge(u, v); n add_edge(v, u); n } n for (int i = 0; i < n; ++i) { n scanf( %d , &l[i]); n for (int j = 0; j < l[i]; ++j) { n scanf( %d , &t[i][j]); n --t[i][j]; n T = std::max(T, t[i][j]); n } n } n ++T; n srand(87665544); n for (int i = 0; i < n; ++i) p[i] = i; n for (int attempts = 0;; ++attempts) { n if (attempts % 16 == 0) { n std::random_shuffle(p, p + n); n std::fill(conf, conf + n, -1); n int ct[2]; n for (int i = 0; i < n; ++i) { n ct[0] = ct[1] = 0; n for (int w = head[p[i]]; w != -1; w = next[w]) { n if (conf[dest[w]] != -1) ++ct[conf[dest[w]]]; n } n conf[p[i]] = (ct[0] > ct[1] ? 1 : 0); n } n } n for (int i = 0; i < T; ++i) team_conf[i] = rand() % 2; n bool valid = true; n for (int i = 0; i < n; ++i) { n team[i] = -1; n for (int j = 0; j < l[i]; ++j) n if (conf[i] == team_conf[t[i][j]]) { n team[i] = t[i][j]; n break; n } n if (team[i] == -1) { n valid = false; n break; n } n } n if (!valid) continue; n for (int i = 0; i < n; ++i) n printf( %d%c , team[i] + 1, i == n - 1 ? n : ); n for (int i = 0; i < T; ++i) n printf( %d%c , team_conf[i] + 1, i == T - 1 ? n : ); n break; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int ans = 654; n vector a, b, us(10); n int main() { n cin >> n >> m; n a.resize(n); n b.resize(m); n for (int i = 0; i < n; ++i) { n cin >> a[i]; n us[a[i]] = 1; n } n for (int j = 0; j < m; ++j) { n cin >> b[j]; n if (us[b[j]] == 1) { n ans = min(ans, b[j]); n } n } n sort(a.begin(), a.end()); n sort(b.begin(), b.end()); n cout << min({(a[0] * 10) + b[0], (b[0] * 10) + a[0], ans}); n } n "} +{"func_code_string": "#include n using namespace std; n inline void read(int &x) { n x = 0; n char c = getchar(); n int f = 1; n while (!isdigit(c)) { n if (c == - ) f = -1; n c = getchar(); n } n while (isdigit(c)) { n x = x * 10 + c - 0 ; n c = getchar(); n } n x *= f; n } n const int N = 505000; n int n, a[N], ans[N]; n int main() { n read(n); n for (int i = 1; i <= n; i++) read(a[i]); n for (int i = 0; i <= n - 2; i++) { n if ((n - i) & 1) n ans[i] = max(min(a[(1 + n - i) / 2], n max(a[(1 + n - i) / 2 + 1], a[(1 + n - i) / 2 - 1])), n min(a[(1 + n + i) / 2], n max(a[(1 + n + i) / 2 + 1], a[(1 + n + i) / 2 - 1]))); n else n ans[i] = max(a[(n - i + 1) / 2], a[(n + i + 2) / 2]); n if ((n & 1) && i == 1) ans[i] = max(ans[i], a[n / 2 + 1]); n if (i - 2 >= 0) ans[i] = max(ans[i], ans[i - 2]); n } n for (int i = 1; i <= n; i++) ans[n - 1] = max(ans[n - 1], a[i]); n for (int i = 0; i <= n - 1; i++) printf( %d , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1000000007; n int dp[1001][2010]; n int digit[1002], k; n void init() { memset(dp, -1, sizeof dp); } n int dfs(int pos, int dist, bool doing) { n if (pos == -1) return dist == 0; n if (!doing && dp[pos][dist] != -1) return dp[pos][dist]; n int ans = 0; n int end = doing ? digit[pos] : 9; n for (int i = 0; i <= end; i++) { n int nextdist = dist == 0 ? 0 : dist + 1; n if (i == 4 || i == 7) { n if (dist <= k) n nextdist = 0; n else n nextdist = 1; n } n ans = (ans + dfs(pos - 1, nextdist, doing && i == end)) % MOD; n } n if (!doing) dp[pos][dist] = ans; n return ans; n } n int cal(char x[]) { n int pos = 0, l = strlen(x); n while (pos < l) { n digit[pos] = x[l - pos - 1] - 0 ; n pos++; n } n return dfs(pos - 1, k + 2, 1); n } n bool check(char x[]) { n int dist = k + 1; n for (int i = 0; i < strlen(x); i++) { n if (!dist) break; n if (x[i] == 4 || x[i] == 7 ) { n if (dist <= k) n dist = 0; n else n dist = 1; n } else n dist++; n } n return dist == 0; n } n int main() { n int T; n init(); n char a[1002], b[1002]; n scanf( %d %d , &T, &k); n while (T--) { n scanf( %s %s , a, b); n int ansa = cal(a); n int ansb = cal(b); n if (check(a)) ansa--; n ansb = ((ansb - ansa) % MOD + MOD) % MOD; n printf( %d n , ansb); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector vec_splitter(string s) { n s += , ; n vector res; n while (!s.empty()) { n res.push_back(s.substr(0, s.find( , ))); n s = s.substr(s.find( , ) + 1); n } n return res; n } n void debug_out(vector __attribute__((unused)) args, n __attribute__((unused)) int idx, n __attribute__((unused)) int LINE_NUM) { n cerr << n ; n } n template n void debug_out(vector args, int idx, int LINE_NUM, Head H, Tail... T) { n if (idx > 0) n cerr << , ; n else n cerr << Line( << LINE_NUM << ) ; n stringstream ss; n ss << H; n cerr << args[idx] << = << ss.str(); n debug_out(args, idx + 1, LINE_NUM, T...); n } n void run() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr), cout.tie(nullptr); n } n const int N = 5e4 + 4, MOD = 1e9 + 7, mod2 = 998244353; n int dp[N][503]; n int n, k; n vector adj[N]; n long long ans; n void dfs(int u, int p) { n dp[u][0] = 1; n for (auto &v : adj[u]) { n if (v == p) continue; n dfs(v, u); n for (int i = 0; i < k; ++i) { n dp[u][i + 1] += dp[v][i]; n } n } n long long sum = 0; n for (auto &v : adj[u]) { n if (v == p) continue; n for (int i = 1; i < k; ++i) { n sum += dp[v][i - 1] * (dp[u][k - i] - dp[v][k - i - 1]); n } n } n ans += dp[u][k] + sum / 2; n } n int main() { n run(); n cin >> n >> k; n for (int i = 0; i < (int)(n - 1); ++i) { n int u, v; n cin >> u >> v; n adj[v].push_back(u); n adj[u].push_back(v); n } n dfs(1, -1); n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n void Genawy() { n std::ios_base::sync_with_stdio(0); n cin.tie(NULL); n } n int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } n int n, cost[305]; n int length[305]; n map, int> dp; n int solve(int ind, int gc) { n if (ind == n) return gc == 1 ? 0 : 1e9; n if (dp.find({ind, gc}) != dp.end()) return dp[{ind, gc}]; n dp[{ind, gc}] = solve(ind + 1, gc); n dp[{ind, gc}] = n min(dp[{ind, gc}], solve(ind + 1, gcd(gc, length[ind])) + cost[ind]); n return dp[{ind, gc}]; n } n int main() { n Genawy(); n cin >> n; n for (int i = 0; i < n; i++) cin >> length[i]; n for (int i = 0; i < n; i++) cin >> cost[i]; n int ans = solve(0, 0); n if (ans >= 1e9) ans = -1; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n int compare(const void *a, const void *b) { n long long la = *(long long *)a; n long long lb = *(long long *)b; n return la == lb ? 0 : la < lb ? -1 : 1; n } n long long aa[8], aa_[8]; n int bb[8], dp[8][1 << (8 - 1)]; n char pp[8]; n int n, ans = 0x3f3f3f3f; n void solve(int i) { n int j; n if (i == n) { n int cnt, sum; n cnt = 0, sum = 0; n for (i = 0; i < n; i++) { n int k; n if (!pp[i]) cnt++; n k = dp[i][bb[i]]; n sum += k == 1 && bb[i] == 0 ? 1 : k + 1; n } n if (cnt >= 2) sum++; n if (ans > sum) ans = sum; n return; n } n solve(i + 1); n pp[i] = 1; n for (j = i + 1; j < n; j++) n if (aa_[j] % aa[i] == 0) { n aa_[j] /= aa[i], bb[j] ^= 1 << i; n solve(i + 1); n aa_[j] *= aa[i], bb[j] ^= 1 << i; n } n pp[i] = 0; n } n int main() { n int i, j; n scanf( %d , &n); n for (i = 0; i < n; i++) scanf( %lld , &aa[i]); n qsort(aa, n, sizeof *aa, compare); n for (i = 0; i < n; i++) { n long long a; n int k, p, b; n a = aa[i]; n k = 0; n for (p = 2; p <= a / p; p++) n while (a % p == 0) { n k++; n a /= p; n } n if (a > 1) k++; n dp[i][0] = k; n for (b = 1; b < 1 << i; b++) { n a = aa[i]; n k = dp[i][0]; n for (j = 0; j < i; j++) n if ((b & 1 << j)) { n if (a % aa[j] != 0) { n k = -1; n break; n } n a /= aa[j]; n k -= dp[j][0]; n } n dp[i][b] = k; n } n } n for (i = 0; i < n; i++) aa_[i] = aa[i]; n solve(0); n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector v; n int main() { n string x, y; n int cnt = 0; n char temp; n int n; n cin >> n; n n = n + n - 1; n for (int i = 0; i < n; i++) { n cin >> x; n if (x == ** ) continue; n cin >> y; n x += y; n sort(v.begin(), v.end()); n if (binary_search(v.begin(), v.end(), x)) continue; n cnt++; n v.push_back(x); n for (int j = 1; j <= 3; j++) { n y = ; n if (j == 1) { n y += x[2]; n y += x[0]; n y += x[3]; n y += x[1]; n v.push_back(y); n } else if (j == 2) { n y += x[3]; n y += x[2]; n y += x[1]; n y += x[0]; n v.push_back(y); n } else if (j == 3) { n y += x[1]; n y += x[3]; n y += x[0]; n y += x[2]; n v.push_back(y); n } n } n } n cout << cnt; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n const int inf = 1 << 30; n int n, qn, tot = 0, head[N], col[N], nowHead[N], deg[N], seq[N]; n int dfsc = 0, id[N], siz[N], fa[N], son[N], dep[N], top[N]; n bool vis[N]; n struct Edge { n int to, nxt; n } e[N << 1]; n inline void add(int from, int to) { n e[++tot].to = to; n e[tot].nxt = head[from]; n head[from] = tot; n } n struct Seg { n int l, r, c; n inline Seg(int L = 0, int R = 0, int C = 0) { l = L, r = R, c = C; } n friend bool operator<(const Seg x, const Seg y) { return x.l < y.l; } n }; n set seg[N]; n template n inline void read(T &X) { n X = 0; n char ch = 0; n T op = 1; n for (; ch > 9 || ch < 0 ; ch = getchar()) n if (ch == - ) op = -1; n for (; ch >= 0 && ch <= 9 ; ch = getchar()) n X = (X << 3) + (X << 1) + ch - 48; n X *= op; n } n namespace Bit { n int s[N << 1]; n inline void modify(int p, int v) { n if (!p) return; n for (; p < (N << 1); p += (p & (-p))) s[p] += v; n } n inline int query(int p) { n int res = 0; n for (; p > 0; p -= (p & (-p))) res += s[p]; n return res; n } n } // namespace Bit n void dfs1(int x, int fat, int depth) { n fa[x] = fat, dep[x] = depth, siz[x] = 1; n int maxson = -1; n for (int i = head[x]; i; i = e[i].nxt) { n int y = e[i].to; n if (y == fat) continue; n dfs1(y, x, depth + 1); n siz[x] += siz[y]; n if (siz[y] > maxson) { n maxson = siz[y]; n son[x] = y; n } n } n } n void dfs2(int x, int topf) { n top[x] = topf, id[x] = ++dfsc; n if (!son[x]) return; n dfs2(son[x], topf); n for (int i = head[x]; i; i = e[i].nxt) { n int y = e[i].to; n if (y == fa[x] || y == son[x]) continue; n dfs2(y, y); n } n } n inline int getLca(int x, int y) { n for (; top[x] != top[y];) { n if (dep[top[x]] < dep[top[y]]) swap(x, y); n x = fa[top[x]]; n } n return dep[x] < dep[y] ? x : y; n } n inline int getDis(int x, int y) { n return dep[x] + dep[y] - 2 * dep[getLca(x, y)]; n } n inline set::iterator getSeg(set &s, int l) { n set::iterator it = s.lower_bound(Seg(l, inf, 0)); n if (it != s.end() && it->l == l) return it; n --it; n int nowl = it->l, nowr = it->r, nowc = it->c; n s.erase(it); n if (l - 1 >= nowl) s.insert(Seg(nowl, l - 1, nowc)); n s.insert(Seg(l, nowr, nowc)); n return s.lower_bound(Seg(l, nowr, nowc)); n } n inline void ins(set &s, int l, int r, int c, int st) { n set::iterator itl = getSeg(s, l), itr; n if (r + 1 <= id[st] + siz[st] - 1) n itr = getSeg(s, r + 1); n else n itr = s.end(); n for (set::iterator it = itl; it != itr; ++it) { n Bit ::modify(it->c, -((it->r) - (it->l) + 1)); n } n Bit ::modify(c, r - l + 1); n s.erase(itl, itr), s.insert(Seg(l, r, c)); n } n inline void modify(int x, int y, int c) { n nowHead[c] = y; n for (; top[x] != top[y];) { n if (dep[top[x]] < dep[top[y]]) swap(x, y); n ins(seg[top[x]], id[top[x]], id[x], c, top[x]); n x = fa[top[x]]; n } n if (dep[x] > dep[y]) swap(x, y); n ins(seg[top[x]], id[x], id[y], c, top[x]); n } n inline int solve(int x) { n int c = getSeg(seg[top[x]], id[x])->c; n return Bit ::query(c - 1) + getDis(x, nowHead[c]) + 1; n } n int main() { n read(n), read(qn); n for (int x, y, i = 1; i < n; i++) { n read(x), read(y); n ++deg[x], ++deg[y]; n add(x, y), add(y, x); n } n dfs1(1, 0, 1), dfs2(1, 1); n int cnt = 0; n set q; n for (int i = 1; i <= n; i++) n if (deg[i] == 1) q.insert(i), vis[i] = 1; n for (; !q.empty();) { n int now = (*q.begin()); n q.erase(*q.begin()); n seq[now] = ++cnt; n nowHead[cnt] = now; n seg[top[now]].insert(Seg(id[now], id[now], cnt)); n Bit ::modify(cnt, 1); n for (int i = head[now]; i; i = e[i].nxt) { n if (vis[e[i].to]) continue; n --deg[e[i].to]; n if (deg[e[i].to] == 1 && !vis[e[i].to]) n q.insert(e[i].to), vis[e[i].to] = 1; n } n } n int lst = n; n for (char op[9]; qn--;) { n scanf( %s , op); n if (op[0] == u ) { n int x; n read(x); n modify(x, lst, ++cnt); n lst = x; n } n if (op[0] == w ) { n int x; n read(x); n printf( %d n , solve(x)); n } n if (op[0] == c ) { n int x, y; n read(x), read(y); n printf( %d n , solve(x) < solve(y) ? x : y); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = (int)1e9 + 7; n int up(int n) { n int r = 1; n while (r < n) r <<= 1; n return r; n } n class segtree { n vector arr; n vector laz; n void inv(int l, int r, int cl, int cr, int v) { n if (r <= cl || cr <= l) return; n push(v); n if (l <= cl && cr <= r) { n laz[v] = !laz[v]; n return; n } n int ct = (cl + cr) / 2; n inv(l, r, cl, ct, 2 * v); n inv(l, r, ct, cr, 2 * v + 1); n upd(v); n } n int cnt(int l, int r, int cl, int cr, int v) { n if (r <= cl || cr <= l) return 0; n push(v); n if (l <= cl && cr <= r) return arr[v]; n int ct = (cl + cr) / 2; n ct = cnt(l, r, cl, ct, 2 * v) + cnt(l, r, ct, cr, 2 * v + 1); n upd(v); n return ct; n } n void push(int v) { n if (laz[v]) { n laz[v] = false; n arr[v] = arr.size() / up(v + 1) - arr[v]; n if (v < (int)arr.size() / 2) { n laz[2 * v] = !laz[2 * v]; n laz[2 * v + 1] = !laz[2 * v + 1]; n } n } n } n void upd(int v) { n if (v < (int)arr.size() / 2) { n push(2 * v); n push(2 * v + 1); n arr[v] = arr[2 * v] + arr[2 * v + 1]; n } n } n n public: n segtree(int n) : arr(2 * up(n)), laz(2 * up(n)) {} n void inv(int l, int r) { inv(l, r, 0, arr.size() / 2, 1); } n int cnt(int l, int r) { return cnt(l, r, 0, arr.size() / 2, 1); } n }; n void dfs(const vector> &gr, int v, vector &in, n vector &out, int &cnt) { n in[v] = cnt++; n for (auto it : gr[v]) dfs(gr, it, in, out, cnt); n out[v] = ++cnt; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n cin >> n; n vector> gr(n); n for (int i = 1; i < n; i++) { n int p; n cin >> p; n p--; n gr[p].push_back(i); n } n vector in(n), out(n); n n = 0; n dfs(gr, 0, in, out, n); n segtree st(n); n n /= 2; n for (int i = 0; i < n; i++) { n int t; n cin >> t; n if (t == 1) { n st.inv(in[i], in[i] + 1); n st.inv(out[i] - 1, out[i]); n } n } n int q; n cin >> q; n for (int i = 0; i < q; i++) { n string s; n int t; n cin >> s >> t; n t--; n if (s == get ) { n cout << st.cnt(in[t], out[t]) / 2 << endl; n } else { n assert(s == pow ); n st.inv(in[t], out[t]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n string s; n cin >> s; n int p1 = 0, q1 = 0, r1 = 0, s1 = 0; n int ans = 1; n int a = 0, b = 0, c = 0, d = 0; n vector v; n int sum = 0; n for (int j = 0; j < s.length(); j++) { n if (s[j] == R ) { n if ((q1 > 0)) { n ans++; n v.push_back(j); n q1 = 0; n r1 = 0; n s1 = 0; n } n p1++; n } n if (s[j] == L ) { n if ((p1 > 0)) { n ans++; n v.push_back(j); n p1 = 0; n r1 = 0; n s1 = 0; n } n q1++; n } n if (s[j] == U ) { n if (s1 > 0) { n ans++; n v.push_back(j); n q1 = 0; n p1 = 0; n s1 = 0; n } n r1++; n } n if (s[j] == D ) { n if ((r1 > 0)) { n ans++; n v.push_back(j); n q1 = 0; n r1 = 0; n p1 = 0; n } n s1++; n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n long long int a[n], sum = 0, fg = 0, cnt = 0, ind = 1, ans = 0; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) { n if (a[i] <= ind) { n ind++; n continue; n } n ans = ans + a[i] - ind; n ind = a[i] + 1; n } n cout << ans; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long s1[2100][2100], sum[2100][2100], cnt[2100][2100], cnt1[2100][2100]; n int main() { n int n, m, i, j; n long long res; n scanf( %d%d , &n, &m); n for (i = 2; i <= m; i++) { n for (j = 1; j <= n; j++) { n cnt[i][j] = sum[i][j - 1] + 1; n cnt[i][j] %= 1000000007; n s1[i][j] = s1[i - 1][j] + cnt[i][j]; n s1[i][j] %= 1000000007; n sum[i][j] = sum[i - 1][j] + s1[i][j]; n sum[i][j] %= 1000000007; n cnt1[i][j] = cnt[i][j] - cnt[i][j - 1]; n if (cnt1[i][j] < 0) cnt1[i][j] += 1000000007; n } n } n res = 0; n for (i = 2; i <= m; i++) n for (j = 1; j <= n; j++) { n res += ((cnt[i][j] * cnt1[i][n - j + 1]) % 1000000007) * (m - i + 1); n res %= 1000000007; n } n printf( %I64d n , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n s = * + s; n int add = 0; n int n = (s.length()) - 1; n for (int i = 1; i + i <= n; i++) { n if (s[i] != s[s.size() - i]) { n add++; n } n } n if (add <= 1 && (n & 1) || add == 1) n cout << YES n ; n else n cout << NO n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, a, i, j, arr[300] = {0}, p = 0, k = 0, c, d; n cin >> n >> a; n for (i = 1; i < n + 1; i++) { n cin >> arr[i]; n } n arr[0] = 1, arr[n + 1] = 1; n j = min(a, n - a + 1); n for (i = j; i < n + 1; i++) { n c = a + k; n d = a - k; n if (d < 1) d = 0; n if (c > n) c = n + 1; n if (arr[d] == arr[c] and arr[c]) { n if (c != d and c <= n and d > 0) n p += 2; n else n p++; n } n k++; n } n cout << p << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n int x, y; n } arr[104]; n vector graph[105]; n int visited[105] = {0}; n void dfs(int i) { n visited[i] = 1; n int j = 0; n while (j < graph[i].size()) { n if (visited[graph[i][j]] == 0) { n dfs(graph[i][j]); n } n j++; n } n } n int main() { n int n; n scanf( %d , &n); n int x, y; n for (int i = 0; i < n; i++) { n scanf( %d%d , &x, &y); n arr[i].x = x; n arr[i].y = y; n } n int hash[102] = {0}; n int ct = 0; n for (int i = 0; i < n; i++) { n int flag = 0; n for (int j = 0; j < n; j++) { n if (i == j) continue; n if (arr[j].x == arr[i].x || arr[j].y == arr[i].y) { n graph[i].push_back(j); n graph[j].push_back(i); n flag = 1; n } n } n if (flag == 0) visited[i] = 1; n } n for (int i = 0; i < n; i++) { n if (visited[i] == 0) { n dfs(i); n ct++; n } n } n int c = 0; n for (int i = 0; i < n; i++) { n if (!graph[i].size()) c++; n } n printf( %d n , c - 1 + ct); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXT = (1 << 18) + 5; n int icT[MAXT], dcT[MAXT]; n const int MAXN = 100010; n int a[MAXN], idxofa[MAXN], b[MAXN]; n int n; n priority_queue > dc, ic; n int main() { n scanf( %d , &n); n for (int i = 1; i <= (int)(n); i++) { n scanf( %d , &a[i]); n idxofa[a[i]] = i; n } n for (int i = 0; i < (int)(MAXT); i++) icT[i] = dcT[i] = 1000000000; n int NN = (1 << 17) - 1; n for (int i = 1; i <= (int)(n); i++) { n scanf( %d , &b[i]); n if (i > idxofa[b[i]]) { n dc.push(make_pair(-(i - idxofa[b[i]]), b[i])); n dcT[NN + b[i]] = abs(i - idxofa[b[i]]); n for (int node = (NN + b[i]) / 2; node; node >>= 1) n dcT[node] = min(dcT[2 * node], dcT[2 * node + 1]); n } else { n ic.push(make_pair(-(i - 1), b[i])); n icT[NN + b[i]] = abs(i - idxofa[b[i]]); n for (int node = (NN + b[i]) / 2; node; node >>= 1) n icT[node] = min(icT[2 * node], icT[2 * node + 1]); n } n } n for (int t = 0; t < n; t++) { n int dcres = dcT[1] - t; n int icres = icT[1] + t; n printf( %d n , min(dcres, icres)); n while (dc.size() > 0 && -dc.top().first == t) { n pair qt = dc.top(); n dc.pop(); n ic.push(make_pair(-t - (idxofa[qt.second] - 1), qt.second)); n dcT[NN + qt.second] = 1000000000; n icT[NN + qt.second] = -t; n for (int node = (NN + qt.second) / 2; node; node >>= 1) n icT[node] = min(icT[2 * node], icT[2 * node + 1]); n for (int node = (NN + qt.second) / 2; node; node >>= 1) n dcT[node] = min(dcT[2 * node], dcT[2 * node + 1]); n } n while (ic.size() > 0 && -ic.top().first == t) { n pair qt = ic.top(); n ic.pop(); n dc.push(make_pair(-t - (n - idxofa[qt.second]) - 1, qt.second)); n icT[NN + qt.second] = 1000000000; n dcT[NN + qt.second] = t + 1 + n - idxofa[qt.second]; n for (int node = (NN + qt.second) / 2; node; node >>= 1) n icT[node] = min(icT[2 * node], icT[2 * node + 1]); n for (int node = (NN + qt.second) / 2; node; node >>= 1) n dcT[node] = min(dcT[2 * node], dcT[2 * node + 1]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 10; n const long long inf = 0x3f3f3f3f3f3f3f3f; n int n, k, b, c; n int a[N], A[N], cost[N]; n long long ans = inf; n void solve(int x) { n for (int i = 1; i <= n; ++i) { n A[i] = a[i]; n cost[i] = 0; n while (A[i] % 5 != x) ++A[i], cost[i] += c; n } n priority_queue heap; n long long res = 0; n for (int i = 1; i <= k; ++i) { n long long val = 5 * cost[i] - 1LL * b * A[i]; n res += val; n heap.push(val); n } n ans = min(ans, (res + 1LL * k * b * A[k]) / 5); n for (int i = k + 1; i <= n; ++i) { n long long val = 5 * cost[i] - 1LL * b * A[i]; n if (val < heap.top()) { n res -= heap.top(); n heap.pop(); n heap.push(val); n res += val; n } n ans = min(ans, (res + 1LL * k * b * A[i]) / 5); n } n } n int main() { n cin >> n >> k >> b >> c; n for (int i = 1; i <= n; ++i) { n scanf( %d , &a[i]); n a[i] += 1e9; n } n sort(a + 1, a + n + 1); n b = min(b, c * 5); n for (int i = 0; i < 5; ++i) solve(i); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n const int N = 1e5 + 5; n const int OO = 1e9 + 7; n using namespace std; n long long n, m, dishes[N], cost[N]; n priority_queue, vector>, n greater>> n q; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> dishes[i]; n for (int i = 0; i < n; i++) cin >> cost[i], q.push({cost[i], i}); n for (int i = 0; i < m; i++) { n long long kind, numofdishes, COST = 0; n cin >> kind >> numofdishes; n kind--; n if (numofdishes <= dishes[kind]) { n COST += (numofdishes * cost[kind]); n dishes[kind] -= numofdishes; n cout << COST << n ; n } else { n COST += (dishes[kind] * cost[kind]); n numofdishes -= dishes[kind]; n dishes[kind] = 0; n while (!q.empty() && numofdishes > 0) { n if (dishes[q.top().second] <= 0) { n q.pop(); n continue; n } n if (numofdishes <= dishes[q.top().second]) { n COST += (numofdishes * q.top().first); n dishes[q.top().second] -= numofdishes; n numofdishes = 0; n } else { n COST += (dishes[q.top().second] * q.top().first); n numofdishes -= dishes[q.top().second]; n dishes[q.top().second] = 0; n } n if (dishes[q.top().second] <= 0) { n q.pop(); n continue; n } n } n if (numofdishes > 0) n cout << 0 << n ; n else n cout << COST << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n void myswap(int& a, int& b) { n int temp; n temp = a; n a = b; n b = temp; n } n void fun(vector& vec, int k, int l, int r) { n if (k <= 1 || l >= r - 1) { n return; n } n int mid = (l + r) / 2; n if (k == 3) { n myswap(vec[mid - 1], vec[mid]); n return; n } n k--; n int p = k / 2; n if (p % 2 == 1) { n fun(vec, p, l, mid); n fun(vec, p, mid, r); n } else if (mid - l >= r - mid) { n fun(vec, p + 1, l, mid); n fun(vec, p - 1, mid, r); n } else { n fun(vec, p - 1, l, mid); n fun(vec, p + 1, mid, r); n } n } n int _count(int l, int r) { n if (l >= r) { n return 0; n } n if (l == r - 1) { n return 1; n } n int mid = (l + r) / 2; n return 1 + _count(l, mid) + _count(mid, r); n } n int main() { n int n, k, i, j; n cin >> n >> k; n if (k % 2 == 0) { n cout << -1; n } else if (k == 1) { n for (i = 1; i <= n; i++) { n cout << i << ; n } n } else { n int mm = _count(0, n); n if (k > mm) { n cout << -1; n } else { n vector vec; n for (i = 1; i <= n; i++) { n vec.push_back(i); n } n fun(vec, k, 0, n); n for (i = 0; i < n; i++) { n cout << vec[i] << ; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n, k; n cin >> n >> k; n string s; n cin >> s; n int freq[26] = {0}; n vector v; n for (int i = 0; i < s.length(); ++i) { n freq[s[i] - a ]++; n } n for (int i = 0; i < 26; ++i) { n v.push_back(freq[i]); n } n sort(v.begin(), v.end()); n int maxAns = 1; n for (int i = 1; i <= k; ++i) { n if (k % i == 0) { n for (int j = i; j <= n; j += i) { n int ans = 0; n int div = j / i; n for (int k = 0; k < v.size(); ++k) { n ans += v[k] / div; n } n if (ans >= i) { n maxAns = max(maxAns, j); n } n } n } n } n cout << maxAns << endl; n } n } n "} +{"func_code_string": "#include n int t; n long long n, k, d1, d2, td1, td2, x1, x2, x3; n bool solve() { n if (n % 3) return false; n for (int i = -1; i <= 1; ++i) n for (int j = -1; j <= 1; ++j) { n if (i == 0 || j == 0) continue; n d1 = i * td1; n d2 = j * td2; n if ((d1 * 2 + d2 + k) % 3 || (d2 - d1 + k) % 3 || (k - d1 - 2 * d2) % 3) n continue; n x1 = d1 * 2 + d2 + k; n x2 = d2 - d1 + k; n x3 = k - d1 - 2 * d2; n if (x1 <= n && x2 <= n && x3 <= n && x1 >= 0 && x2 >= 0 && x3 >= 0) n return true; n } n return false; n } n int main() { n scanf( %d , &t); n while (t--) { n scanf( %lld%lld%lld%lld , &n, &k, &td1, &td2); n puts(solve() ? yes : no ); n } n return 0; n } n "} +{"func_code_string": "#include n int n; n char str[50]; n int F[50], sz[50]; n inline int find(int x) { return x == F[x] ? x : F[x] = find(F[x]); } n inline void merge(int x, int y) { n x = find(x); n y = find(y); n if (x == y) return; n F[y] = x; n sz[x] += sz[y]; n } n std::vector G[55]; n int id[66]; n int e[25]; n int f[(1 << 23) + 5], g[(1 << 23) + 5], coe[(1 << 23) + 5]; n int main() { n scanf( %d , &n); n for (int i = 0; i <= n - 1; ++i) F[i] = i, sz[i] = 1; n for (int i = 0; i <= n - 1; ++i) { n scanf( %s , str); n for (int j = i + 1; j <= n - 1; ++j) { n if (str[j] == A ) merge(i, j); n if (str[j] == X ) G[i].emplace_back(j), G[j].emplace_back(i); n } n } n int ans = n - 1; n n = 0; n for (int i = 0; i <= ans; ++i) id[i] = find(i); n for (int i = 0; i <= ans; ++i) n for (auto x : G[i]) n if (id[i] == id[x]) { n puts( -1 ); n exit(0); n } n for (int i = 0; i <= ans; ++i) { n if (sz[id[i]] == 1) { n id[i] = -1; n continue; n } n if (id[i] != i) { n id[i] = id[id[i]]; n continue; n } n id[i] = n++; n } n if (n <= 1) { n printf( %d n , ans + n); n return 0; n } n assert(n <= 23); n for (int i = 0; i <= ans; ++i) n for (auto x : G[i]) n if (~id[i] && ~id[x]) e[id[i]] |= (1 << id[x]); n f[0] = coe[0] = 1; n for (int S = 1; S <= (1 << n) - 1; ++S) { n int lb = __builtin_ctz(S); n f[S] = (!(e[lb] & S)) & f[S ^ (1 << lb)]; n coe[S] = -coe[S ^ (1 << lb)]; n } n for (int i = 0; i <= n - 1; ++i) { n for (int S = 0; S <= (1 << n) - 1; ++S) { n if ((S >> i) & 1) f[S] += f[S ^ (1 << i)]; n } n } n for (int i = 0; i <= (1 << n) - 1; ++i) g[i] = f[i]; n for (int k = 1; k <= n; ++k) { n auto chk = [&]() { n int ans = 0; n for (int S = 0; S <= (1 << n) - 1; ++S) ans += g[S] * coe[S]; n return ans != 0; n }; n if (chk()) { n printf( %d n , ans + k); n return 0; n } n for (int S = 0; S <= (1 << n) - 1; ++S) g[S] *= f[S]; n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n; n while (scanf( %d , &n) != EOF) { n if (n % 2 == 1) { n printf( -1 n ); n continue; n } n printf( 2 1 ); n for (int i = 3; i < n; i = i + 2) printf( %d %d , i + 1, i); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map Map; n pair a[250001]; n vector b[250001], t[250001]; n char type; n long long ans; n int len[250001], n, m, i, q, l, r, d, mid, nom, nomN, zn, sum; n bool pole[250001]; n int get(int tl, int tr, int nom, int l, int r, int nomT) { n if (tl > tr) return 0; n if (tl > r || tr < l) return 0; n if (l <= tl && tr <= r) return t[nomT][nom]; n int mid = (tl + tr) / 2; n return get(tl, mid, nom * 2, l, r, nomT) + n get(mid + 1, tr, nom * 2 + 1, l, r, nomT); n } n void update(int tl, int tr, int nom, int nomN, int zn, int nomT) { n if (tl > tr) return; n if (tl > nomN || tr < nomN) return; n t[nomT][nom] += zn; n if (tl == tr) return; n int mid = (tl + tr) / 2; n update(tl, mid, nom * 2, nomN, zn, nomT); n update(mid + 1, tr, nom * 2 + 1, nomN, zn, nomT); n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n >> m >> q; n for (i = 0; i < n; i++) n if (!pole[i]) { n nom = i; n d++; n t[d].push_back(0); n b[d].push_back(0); n while (!pole[nom]) { n pole[nom] = true; n len[d]++; n a[nom + 1] = make_pair(d, len[d]); n b[d].push_back(nom); n t[d].push_back(0); n t[d].push_back(0); n t[d].push_back(0); n t[d].push_back(0); n nom = (nom + m) % n; n } n } n while (q--) { n cin >> type; n if (type == + ) { n cin >> zn >> nom; n nom++; n sum = 0; n if (get(1, len[a[nom].first], 1, a[nom].second, len[a[nom].first], n a[nom].first) != len[a[nom].first] - a[nom].second + 1) { n l = a[nom].second; n r = len[a[nom].first]; n while (l <= r) { n mid = (l + r) / 2; n if (get(1, len[a[nom].first], 1, a[nom].second, mid, a[nom].first) != n mid - a[nom].second + 1) { n r = mid - 1; n sum = mid - a[nom].second; n } else n l = mid + 1; n } n update(1, len[a[nom].first], 1, a[nom].second + sum, 1, a[nom].first); n Map[zn] = b[a[nom].first][a[nom].second + sum] + 1; n } else { n ans += len[a[nom].first] - a[nom].second + 1; n l = 1; n r = a[nom].second - 1; n while (l <= r) { n mid = (l + r) / 2; n if (get(1, len[a[nom].first], 1, 1, mid, a[nom].first) != mid) { n r = mid - 1; n sum = mid - 1; n } else n l = mid + 1; n } n update(1, len[a[nom].first], 1, sum + 1, 1, a[nom].first); n Map[zn] = b[a[nom].first][sum + 1] + 1; n } n ans += sum; n } else { n cin >> zn; n nom = Map[zn]; n update(1, len[a[nom].first], 1, a[nom].second, -1, a[nom].first); n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int nax = 1e5 + 5; n void solve() { n long long int n; n cin >> n; n vector a(n); n for (auto &x : a) cin >> x; n long long int sum = 0, mx = 0; n for (long long int i = 0; i < n - 1; i++) { n sum += max((long long int)0, a[i] - a[i + 1]); n } n cout << sum << n ; n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long int t = 1; n cin >> t; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int n = 0, f = 1, ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n n = n * 10 + ch - 0 ; n ch = getchar(); n } n return n * f; n } n char a[2000005], b[2000005]; n int n; n int c[2000005]; n int get(int x) { n int cur = 0, res = 0; n for (int i = 1; i <= n; i++) { n cur += x * c[i]; n res = max(res, cur); n if (cur < 0) cur = 0; n } n return res; n } n int main() { n int s1 = 0, s2 = 0; n n = read(); n scanf( %s%s , a + 1, b + 1); n for (int i = 1; i <= n; i++) { n if (a[i] != b[i] && a[i] == 0 ) n c[i] = -1, s1++; n else if (a[i] != b[i] && a[i] == 1 ) n c[i] = 1, s2++; n } n if (s1 != s2) { n printf( -1 n ); n return 0; n } n printf( %d n , max(get(1), get(-1))); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long double sq(long double a) { return a * a; } n long double dist(pair a, n pair b) { n return sqrt((long double)(sq(a.second - b.second) + sq(a.first - b.first))); n } n long double mandist(pair a, n pair b) { n return abs(a.second - b.second) + abs(a.first - b.first); n } n long long a, b, c; n pair p1, p2; n int main() { n scanf( %lld%lld%lld , &a, &b, &c); n scanf( %lld%lld%lld%lld , &p1.first, &p1.second, &p2.first, &p2.second); n if (a == 0 || b == 0) n printf( %.20Lf n , mandist(p1, p2)); n else { n long double res = mandist(p1, p2); n long double interhoriz1 = n ((long double)(-c - a * p1.first)) / ((long double)b); n long double interhoriz2 = n ((long double)(-c - a * p2.first)) / ((long double)b); n long double intervert1 = n ((long double)(-c - b * p1.second)) / ((long double)a); n long double intervert2 = n ((long double)(-c - b * p2.second)) / ((long double)a); n res = min(res, abs((long double)p1.second - interhoriz1) + n abs((long double)p2.second - interhoriz2) + n dist(make_pair((long double)p1.first, interhoriz1), n make_pair((long double)p2.first, interhoriz2))); n res = min(res, abs((long double)p1.second - interhoriz1) + n abs((long double)p2.first - intervert2) + n dist(make_pair((long double)p1.first, interhoriz1), n make_pair(intervert2, (long double)p2.second))); n res = min(res, abs((long double)p1.first - intervert1) + n abs((long double)p2.first - intervert2) + n dist(make_pair(intervert1, (long double)p1.second), n make_pair(intervert2, (long double)p2.second))); n res = min(res, abs((long double)p1.first - intervert1) + n abs((long double)p2.second - interhoriz2) + n dist(make_pair(intervert1, (long double)p1.second), n make_pair((long double)p2.first, interhoriz2))); n printf( %.20Lf n , res); n } n } n "} +{"func_code_string": "#include n using namespace std; n int a[2005], b[2005]; n int main() { n int n, i, j, x, y, k; n long long s; n cin >> n; n for (i = 0; i < n; i++) { n cin >> x >> y; n a[x + y]++; n b[1001 + x - y]++; n } n s = 0; n for (i = 0; i < 2003; i++) { n k = a[i]; n s += (k - 1) * k / 2; n k = b[i]; n s += (k - 1) * k / 2; n } n cout << s << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve(); n signed main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout << fixed; n cout.precision(12); n solve(); n return 0; n } n template n void prv(vector v) { n for (int __ii = 0; __ii < ((int)v.size()); __ii++) { n if (__ii) cout << ; n cout << v[__ii]; n } n cout << n ; n } n template n void prm(vector> v) { n for (int __ii = 0; __ii < ((int)v.size()); __ii++) { n for (int __jj = 0; __jj < v[__ii].size(); __jj++) { n if (__jj) cout << ; n cout << v[__ii][__jj]; n } n cout << n ; n } n } n template n void sc(T& x) { n cin >> x; n } n template n void sc(Head& head, Tail&... tail) { n cin >> head; n sc(tail...); n } n template n void pr(const T& x) { n cout << x << n ; n } n template n void pr(const Head& head, const Tail&... tail) { n cout << head << ; n pr(tail...); n } n template n void err(const T&... cod) { n pr(cod...); n exit(0); n } n void solve() { n int n, m, y, x; n sc(n, m, y, x); n string s; n sc(s); n int dx = (s[1] == L ? -1 : 1); n int dy = (s[0] == U ? -1 : 1); n const int MAX_ITER = 1e6 + 10; n set> st; n long long ans = 1; n for (int i = 0; i < MAX_ITER; i++) { n st.emplace(y, x); n if (((int)st.size()) == n + m - 2) err(ans); n int u = (dy == -1 ? y - 1 : n - y); n int v = (dx == -1 ? x - 1 : m - x); n int w = min(u, v); n x += dx * w; n y += dy * w; n ans += w; n if (v == w) dx *= -1; n if (u == w) dy *= -1; n } n pr(-1); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n cin.tie(0); n cout.tie(0); n ios_base::sync_with_stdio(0); n string s; n cin >> s; n string v = aeiou ; n string c = bcdfghjklmnpqrstvwxyz ; n map cnt; n map mp; n for (auto i : v) mp[i] = 1; n for (auto i : c) mp[i] = 0; n string temp = ; n int vc = 0; n int cc = 0; n int dc = 0; n vector ans; n for (int i = 0; i < s.size(); i++) { n if (mp[s[i]] == 1) { n cc = 0; n dc = 0; n for (auto j : c) cnt[j] = 0; n } else { n if (cnt[s[i]] == 0) { n cnt[s[i]]++; n dc++; n cc++; n } else { n cnt[s[i]]++; n cc++; n } n } n if (cc > 2 && dc > 1) { n ans.push_back(temp); n for (auto j : c) cnt[j] = 0; n cnt[s[i]] = 1; n cc = 1; n dc = 1; n temp = s[i]; n } else n temp += s[i]; n } n ans.push_back(temp); n for (auto i : ans) cout << i << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e6 + 5; n string s[10005]; n int vis[10005]; n int main() { n ios::sync_with_stdio(0); n int n, sum(0); n cin >> n; n for (long long i = 0; i < n; ++i) cin >> s[i], sum += s[i].size(); n char c; n cin >> c; n for (long long i = 0; i < n; ++i) s[i] += c; n sort(s, s + n); n sum = sum * 2 / n + 1; n for (long long i = 0; i < n; ++i) n if (!vis[i]) { n cout << s[i]; n vis[i]++; n for (long long j = i + 1; j < n; ++j) n if (!vis[j] && sum - s[i].size() == s[j].size() - 1) { n cout << s[j].substr(0, s[j].size() - 1) << n ; n vis[j]++; n break; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector a(n); n for (int i = 0; i < n; ++i) cin >> a[i]; n map used; n int ans = 0; n for (int i = n - 1; i >= 0; --i) { n if (used[a[i]] == 0) { n used[a[i]] = i; n ans = a[i]; n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double E = 1e-7; n const int MOD = 1e9 + 7; n const long long MAX = 1e6 + 1; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n int n, k; n cin >> n >> k; n int ar[n]; n for (int i = 0; i < n; i++) cin >> ar[i]; n int ans = INT_MIN; n int a[n], b[n]; n for (int i = 0; i < n; i++) n for (int j = i; j < n; j++) { n int A = j - i + 1; n int B = n - A; n copy(ar + i, ar + j + 1, a); n copy(ar, ar + i, b); n copy(ar + j + 1, ar + n, b + i); n sort(a, a + A); n sort(b, b + B); n for (int l = 0, r = B - 1, q = k; l < A && r >= 0 && a[l] < b[r] && q; n l++, r--, --q) n swap(a[l], b[r]); n int sum = 0; n for (int i = 0; i < A; i++) sum += a[i]; n ans = max(ans, sum); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int x, int y) { n if (x > y) n return gcd(x - y, y); n else if (x == y) n return x; n else n return gcd(x, y - x); n } n int main() { n int n, m, z; n cin >> n >> m >> z; n cout << (gcd(n, m) * z) / (n * m) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, cnt, flag = 0; n cin >> n; n int a, b, c = 0; n for (int i = 1; i <= n; i++) { n cin >> a >> b; n if (b - a >= 2) ++c; n } n cout << c << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, p = 0, ans = 0; n string s, dvg, answ, r_dvg; n cin >> n >> s; n for (int i = 0; i < n - 1; i++) { n dvg = s.substr(i, 2); n for (int j = i; j < n - 1; j++) { n r_dvg = s.substr(j, 2); n if (dvg == r_dvg) { n p++; n } n } n if (p > ans) { n ans = p; n answ = dvg; n } n p = 0; n } n cout << answ << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Point { n long long x, y; n void read() { scanf( %lld%lld , &x, &y); } n }; n long long product(const Point &o, const Point &a, const Point &b) { n return (a.x - o.x) * (b.y - o.y) - (b.x - o.x) * (a.y - o.y); n } n bool intersect(const Point &a, const Point &b, const Point &c, const Point &d) { n bool insect1 = product(a, c, d) * product(b, c, d) < 0; n bool insect2 = product(c, a, b) * product(d, a, b) < 0; n return insect1 && insect2; n } n int main() { n ios ::sync_with_stdio(false); n cout << fixed << setprecision(16); n int R, B; n scanf( %d%d , &R, &B); n vector bases(B); n vector ships(R); n vector b(R); n for (int i = 0; i < R; i++) { n ships[i].read(); n } n for (int i = 0; i < B; i++) { n bases[i].read(); n } n if (B != R) { n puts( No ); n return 0; n } n for (int i = 0; i < R; i++) { n b[i] = i; n } n bool yes = false; n do { n bool ok = true; n for (int i = 0; i < B; i++) { n for (int j = i + 1; j < B; j++) { n if (intersect(ships[b[i]], bases[i], ships[b[j]], bases[j])) { n ok = false; n } n } n } n if (ok) { n yes = true; n break; n } n } while (next_permutation(b.begin(), b.end())); n puts(yes ? Yes : No ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 305000; n long long mod = 1e9 + 7; n long long h, w, n; n long long dp[maxn], f[maxn], inv[maxn]; n struct stu { n long long x, y; n } a[maxn]; n long long cmp(stu a, stu b) { n if (a.x != b.x) n return a.x < b.x; n else n return a.y < b.y; n } n long long ksm(long long base, long long b, long long mod) { n long long ans = 1; n while (b) { n if (b & 1) { n ans *= base; n ans %= mod; n } n base *= base; n base %= mod; n b >>= 1; n } n return ans; n } n void init() { n f[0] = 1, inv[0] = 1; n for (long long i = 1; i <= 200000; i++) { n f[i] = f[i - 1] * i % mod; n inv[i] = ksm(f[i], mod - 2, mod); n } n } n long long c(long long x, long long y) { n if (x < y) n return 0; n else n return f[x] * inv[y] % mod * inv[x - y] % mod; n } n signed main() { n cin >> h >> w >> n; n init(); n for (long long i = 1; i <= n; i++) cin >> a[i].x >> a[i].y; n sort(a + 1, a + n + 1, cmp); n a[n + 1].x = h, a[n + 1].y = w; n for (long long i = 1; i <= n + 1; i++) { n dp[i] = c(a[i].x + a[i].y - 2, a[i].x - 1); n for (long long j = 1; j < i; j++) { n if (a[j].x > a[i].x || a[j].y > a[i].y) continue; n dp[i] = (dp[i] - n dp[j] * c(a[i].x + a[i].y - a[j].x - a[j].y, a[i].x - a[j].x)) % n mod; n } n } n cout << (dp[n + 1] + mod) % mod << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int v[3005], inv = 0, n; n double sol; n int main() { n cin >> n; n for (int i = 1; i <= n; i++) cin >> v[i]; n for (int i = 1; i <= n; i++) n for (int j = i + 1; j <= n; j++) n if (v[i] > v[j]) inv++; n sol = double(inv) - inv / 2 + (inv / 2) * 3.0; n cout << fixed; n cout << setprecision(6); n cout << sol << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000 * 1000 * 1000; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n pair minp1(INF, INF), minp2(INF, INF); n for (int i = 0; i < n; i++) { n int x, y; n cin >> x >> y; n minp1 = min(minp1, pair(x, y)); n } n for (int i = 0; i < n; i++) { n int x, y; n cin >> x >> y; n x *= -1; n y *= -1; n minp2 = min(minp2, pair(x, y)); n } n cout << minp1.first - minp2.first << << minp1.second - minp2.second; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n scanf( %d , &n); n printf( %d n , (n & 1) ? (n - 1) + (n - 1) * ((n - 3) / 2) / 2 n : (n - 2) * (n - 2) / 4 + (n - 2)); n if (n & 1) { n for (int i = 2; i <= n; i += 2) { n printf( %d %d %d %d n , 3, 1, i, i + 1); n printf( %d %d %d %d n , 3, 1, i, i + 1); n for (int j = 2; j < i; j += 2) { n printf( %d %d %d %d %d n , 4, i, j, i + 1, j + 1); n printf( %d %d %d %d %d n , 4, i, j, i + 1, j + 1); n } n } n } else { n puts( 4 1 2 3 4 ), puts( 4 1 3 4 2 ), puts( 4 1 4 2 3 ); n for (int i = 5; i <= n; i += 2) { n printf( %d %d %d %d n , 3, 1, i, i + 1); n printf( %d %d %d %d n , 3, 2, i, i + 1); n printf( %d %d %d %d %d n , 4, 1, i, 2, i + 1); n for (int j = 3; j < i; j += 2) { n printf( %d %d %d %d %d n , 4, i, j, i + 1, j + 1); n printf( %d %d %d %d %d n , 4, i, j, i + 1, j + 1); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n const int MAXN = 100100; n struct Gao { n int p[MAXN], q[MAXN]; n bool r[MAXN]; n void init(int n) { n for (int i = 0; i < n; ++i) { n q[i] = 1; n r[i] = true; n } n } n void next(int i) { n if (!r[p[i]] && p[i] != i) { n next(p[i]); n q[i] += q[p[i]]; n p[i] = p[p[i]]; n } n } n void kill(int i) { n if (r[i]) { n next(i); n r[i] = false; n } n } n } gao; n int main() { n int n, m, x, y, z; n static int a[MAXN], b[MAXN]; n scanf( %d%d , &n, &m); n gao.init(n); n for (int i = 0; i < n; ++i) { n scanf( %d , &gao.p[i]); n --gao.p[i]; n } n for (int i = 0; i < m; ++i) { n scanf( %d , &a[i]); n --a[i]; n } n for (int i = 0; i < m; ++i) { n scanf( %d , &b[i]); n } n z = 0; n for (int i = 0; i < m; ++i) { n x = (a[i] + z) % n; n y = b[i]; n z = 0; n while (true) { n if (!gao.r[x]) { n gao.next(x); n y -= gao.q[x]; n x = gao.p[x]; n } n if (gao.r[x] && y > 0) { n ++z; n gao.kill(x); n } else { n break; n } n } n printf( %d n , z); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 4e4 + 5; n int pr[N], ps = 0; n bool np[N]; n bool check(int n) { n if (n == 1 || n == 0) return false; n for (int i = 0; pr[i] * pr[i] <= n; ++i) n if (n % pr[i] == 0) return false; n return true; n } n int main() { n for (int i = 2; i < N; ++i) n if (!np[i]) { n pr[ps++] = i; n for (int j = i + i; j < N; j += i) np[j] = 1; n } n int n; n cin >> n; n if (check(n)) { n cout << 1 n << n << endl; n return 0; n } n for (int i = 0; i < ps && pr[i] <= n; ++i) { n if (check(n - pr[i])) { n cout << 2 n << pr[i] << << n - pr[i] << endl; n return 0; n } n if (pr[i] % 2 == 1 && check((n - pr[i]) / 2)) { n cout << 3 n n << pr[i] << << (n - pr[i]) / 2 << << (n - pr[i]) / 2 << endl; n return 0; n } n } n cout << lol nope n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mk = 100005; n long long n; n vector g[mk]; n long long find(long long A) { n if (A == 0) return 0; n long long tmp = A & 3; n long long R = (find(A / 4) << 2); n if (tmp == 0) return R; n if (tmp == 1) return (R | 2); n if (tmp == 2) return (R | 3); n if (tmp == 3) return (R | 1); n } n void init() { n long long test; n cin >> test; n for (long long i = 1; i <= test; i++) { n long long n; n cin >> n; n long long root = 1; n while (root * 4 <= n) root *= 4; n n -= (root - 1); n long long A = (root | ((n - 1) / 3)); n long long B = find(A); n long long C = A ^ B; n if (n % 3 == 1) cout << A; n if (n % 3 == 2) cout << B; n if (n % 3 == 0) cout << C; n cout << n ; n } n } n signed main() { init(); } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e4 + 5; n pair p[maxn]; n set > s; n void solve(int l, int r) { n if (r - l < 2) return; n int mid = (l + r) / 2; n solve(l, mid), solve(mid, r); n for (int i = l; i < r; i++) s.insert(make_pair(p[mid].first, p[i].second)); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n for (int i = 0; i < n; i++) n cin >> p[i].first >> p[i].second, n s.insert(make_pair(p[i].first, p[i].second)); n sort(p, p + n); n solve(0, n); n cout << s.size() << endl; n for (pair now : s) cout << now.first << << now.second << endl; n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n; n long long int s; n scanf( %d , &n); n s = 6 * n * (n - 1) + 1; n printf( %I64d , s); n return 0; n } n "} +{"func_code_string": "#include n template n inline bool contains(const C& container, const E& element) { n return container.find(element) != container.end(); n } n template n inline void checkmin(T& a, T b) { n if (b < a) a = b; n } n template n inline void checkmax(T& a, T b) { n if (b > a) a = b; n } n using namespace std; n class UnionFind { n public: n UnionFind(int elements) : _subsets(elements), _setCount(elements) { n for (int i = 0; i < elements; ++i) { n _subsets[i].parent = i; n _subsets[i].rank = 0; n } n } n int Find(int i) { n if (_subsets[i].parent != i) _subsets[i].parent = Find(_subsets[i].parent); n return _subsets[i].parent; n } n void Union(int x, int y) { n int xroot = Find(x); n int yroot = Find(y); n if (xroot == yroot) return; n --_setCount; n if (_subsets[xroot].rank < _subsets[yroot].rank) n _subsets[xroot].parent = yroot; n else if (_subsets[xroot].rank > _subsets[yroot].rank) n _subsets[yroot].parent = xroot; n else { n _subsets[yroot].parent = xroot; n _subsets[xroot].rank++; n } n } n struct subset { n int parent; n int rank; n }; n void Trace() { n for (int i = (0), _b = ((_subsets.size()) - 1); i <= _b; i++) n cout << i << : << Find(i) << | ; n cout << endl; n } n vector _subsets; n int _setCount; n }; n struct SetInfo { n set _yc; n set _xc; n }; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cout << std::setprecision(15); n cout << std::fixed; n long long xs, ys, q; n cin >> xs >> ys >> q; n UnionFind uf(xs + ys); n vector > p(q); n for (int i = (0), _b = ((q)-1); i <= _b; i++) { n int x, y; n cin >> p[i].first >> p[i].second; n --p[i].first; n --p[i].second; n uf.Union(p[i].first, xs + p[i].second); n } n map ss; n for (int i = (0), _b = ((q)-1); i <= _b; i++) { n int id = uf.Find(p[i].first); n SetInfo& setInfo = ss[id]; n setInfo._xc.insert(p[i].first); n setInfo._yc.insert(p[i].second); n } n long long got = 0; n long long totX = 0, totY = 0; n for (auto& p : ss) { n totX += (long long)p.second._xc.size(); n totY += (long long)p.second._yc.size(); n } n long long remX = xs - totX; n long long remY = ys - totY; n long long res = remX + remY - 1 + ss.size(); n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n T sqr(T x) { n return x * x; n } n template n T abs(T x) { n return x < 0 ? -x : x; n } n template n T gcd(T a, T b) { n return b ? gcd(b, a % b) : a; n } n template n bool chmin(T& x, const T& y) { n if (x > y) { n x = y; n return true; n } n return false; n } n template n bool chmax(T& x, const T& y) { n if (x < y) { n x = y; n return true; n } n return false; n } n string to_bin(int x) { n string ret; n while (x) { n ret = ret + (char)((x % 2) + 0 ); n x /= 2; n } n return ret; n } n int main(int, char**) { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n while (t--) { n long long n; n cin >> n; n long long m = (n - 1) / 3; n int k = 0; n long long p = 1; n while (m >= p) { n m -= p; n k += 1; n p *= 4; n } n vector a; n for (int i = 0; i < k; ++i) { n a.push_back(m % 4); n m /= 4; n } n long long A, B; n A = 1LL << (2 * k); n B = 1LL << (2 * k + 1); n vector b = {0, 2, 3, 1}; n for (int i = 0; i < k; ++i) { n A ^= a[i] << (2 * i); n B ^= b[a[i]] << (2 * i); n } n long long C = A ^ B; n long long ans; n if (n % 3 == 1) { n ans = A; n } else if (n % 3 == 2) { n ans = B; n } else { n ans = C; n } n cout << ans << n ; n } n cerr << Time execute: << clock() / (double)CLOCKS_PER_SEC << sec n << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n double n, m, a, b; n cin >> n >> m >> a >> b; n double s = n / m; n long long int s1 = floor(s) * m; n long long int s2 = ceil(s) * m; n long long int a1 = (n - s1) * b; n long long int a2 = (s2 - n) * a; n cout << (min(a1, a2)); n } n "} +{"func_code_string": "#include n using namespace std; n int res; n int tox[] = {0, 0, 1, -1}; n int toy[] = {1, -1, 0, 0}; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr), cout.tie(nullptr); n string s; n cin >> s; n while (s.back() == 0 ) s.erase(s.size() - 1, 1), res++; n while (s != 1 ) { n while (s.size() && s.back() == 1 ) s.erase(s.size() - 1, 1), res++; n res++; n if (!s.size()) break; n s.back() = 1 ; n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n deque b, g; n long long int n; n cin >> n; n for (long long int i = 0; i < n; i++) { n long long int temp; n cin >> temp; n b.push_back(temp); n } n cin >> n; n for (long long int i = 0; i < n; i++) { n long long int temp; n cin >> temp; n g.push_back(temp); n } n sort(b.begin(), b.end()); n sort(g.begin(), g.end()); n long long int ans = 0; n while (b.size() && g.size()) { n if (abs(b.front() - g.front()) <= 1) { n ans++; n b.pop_front(); n g.pop_front(); n } else { n if (b.front() < g.front()) n b.pop_front(); n else n g.pop_front(); n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mod = 1e9 + 7; n bool comp(pair p1, pair p2) { n if (p1.first != p2.first) { n return p1.first < p2.first; n } else n return p2.second < p1.second; n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long n; n cin >> n; n map>> m; n for (long long i = 0; i < n; i++) { n long long x, y; n cin >> x >> y; n long long level = max(x, y); n m[level].push_back({x, y}); n } n vector> v; n long long dp[200006][2]; n memset(dp, INT_MAX, sizeof dp); n dp[0][0] = 0; n dp[0][1] = 0; n pair p_start, p_end; n p_start = {0, 0}; n p_start = {0, 0}; n long long i = 1; n for (auto it : m) { n for (auto it1 : it.second) { n v.push_back(it1); n } n sort(v.begin(), v.end(), comp); n pair start = v[0]; n pair end = v[v.size() - 1]; n long long di = n abs(start.first - end.first) + abs(start.second - end.second); n long long a1 = dp[i - 1][0] + abs(p_start.first - end.first) + n abs(p_start.second - end.second) + di; n long long a2 = dp[i - 1][1] + abs(p_end.first - end.first) + n abs(p_end.second - end.second) + di; n dp[i][0] = min(a1, a2); n a1 = dp[i - 1][0] + abs(p_start.first - start.first) + n abs(p_start.second - start.second) + di; n a2 = dp[i - 1][1] + abs(p_end.first - start.first) + n abs(p_end.second - start.second) + di; n dp[i][1] = min(a1, a2); n p_start = start; n p_end = end; n v.clear(); n i++; n } n cout << min(dp[i - 1][0], dp[i - 1][1]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int INF = 9223372036854775807; n const long long int mod = 998244353; n long long int MOD(long long int a, long long int b) { n if (a > b) n return a - b; n else n return b - a; n } n long long int max3(long long int a, long long int b, long long int c) { n return max(c, max(a, b)); n } n long long int min3(long long int a, long long int b, long long int c) { n return min(a, min(b, c)); n } n long long int power(long long int x, long long int y) { n long long int res = 1; n while (y > 0) { n if (y & 1) res = (res * x); n y = y >> 1; n x = (x * x); n } n return res; n } n long long int power1(long long int x, long long int y) { n long long int res = 1; n while (y > 0) { n if (y & 1) res = (res * x) % mod; n y = y >> 1; n x = (x * x) % mod; n } n return res % mod; n } n long long int logg(long long int a) { n long long int x = 0; n while (a > 1) { n x++; n a /= 2; n } n return x; n } n long long int gcd(long long int a, long long int b) { n if (a == 0) return b; n return gcd(b % a, a); n } n long long int abso(long long int x) { n if (x < 0) { n return -x; n } n return x; n } n long long int ceiling(long long int a, long long int b) { n if (a % b == 0) { n return a / b; n } else { n return a / b + 1; n } n } n long long int modinv(long long int x) { return power1(x, mod - 2); } n long long int par[20][400000]; n long long int sum[20][400000]; n long long int weight[400000]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n int t; n cin >> t; n long long int cnt = 1; n long long int last = 0; n par[0][1] = 1; n weight[1] = 0; n weight[0] = INF; n for (int i = 0; i < 20; i++) { n for (int j = 0; j < 400000; j++) { n par[i][j] = 0; n } n } n for (int i = 0; i < 20; i++) { n sum[i][1] = INF; n } n for (int i = 0; i < 20; i++) { n for (int j = 2; j < 400000; j++) { n sum[i][j] = 0; n } n } n while (t--) { n int ch; n cin >> ch; n long long int p, q; n cin >> p >> q; n p = p ^ last; n q = q ^ last; n if (ch == 1) { n cnt++; n weight[cnt] = q; n long long int curr = p; n if (weight[p] >= q) { n curr = p; n par[0][cnt] = curr; n } else { n for (int j = 19; j >= 0; j--) { n if (weight[par[j][curr]] < weight[cnt]) { n curr = par[j][curr]; n } n } n par[0][cnt] = par[0][curr]; n } n if (par[0][cnt] != 0) { n sum[0][cnt] = weight[par[0][cnt]]; n } else { n sum[0][cnt] = INF; n } n for (int i = 1; i < 20; i++) { n par[i][cnt] = par[i - 1][par[i - 1][cnt]]; n } n for (int i = 1; i < 20; i++) { n if (par[i][cnt] != 0 && sum[i - 1][cnt] != INF) { n sum[i][cnt] = sum[i - 1][cnt] + sum[i - 1][par[i - 1][cnt]]; n } else { n sum[i][cnt] = INF; n } n } n } else { n long long int W = weight[p]; n if (W > q) { n cout << 0 << endl; n last = 0; n } else { n long long int curr = p; n long long int ans = 1; n for (int j = 19; j >= 0; j--) { n if (sum[j][curr] != INF && sum[j][curr] + W <= q) { n ans += power(2, j); n W += sum[j][curr]; n curr = par[j][curr]; n } n } n cout << ans << endl; n last = ans; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1005; n const int Q = 1e9 + 7; n struct Point { n int x, y; n Point(int _x = 0, int _y = 0) : x(_x), y(_y) {} n const int sign() const { return y < 0 || y == 0 && x < 0; } n Point operator-(const Point &R) { return Point(x - R.x, y - R.y); } n long long operator^(const Point &R) const { n return (long long)x * R.y - (long long)y * R.x; n } n bool operator<(const Point &R) const { n if (sign() != R.sign()) { n return sign() < R.sign(); n } n return (*this ^ R) > 0; n } n }; n inline void add(long long &A, long long B) { A += B; } n Point p[N]; n int n; n long long f[6][N][N]; n int main() { n scanf( %d , &n); n for (int i = 0; i < n; ++i) { n scanf( %d%d , &p[i].x, &p[i].y); n f[0][i][i] = 1; n } n vector> v; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < i; ++j) { n v.emplace_back(p[j] - p[i], i, j); n v.emplace_back(p[i] - p[j], j, i); n } n } n sort(v.begin(), v.end()); n for (auto &it : v) { n int x = get<1>(it); n int y = get<2>(it); n for (int i = 5; i > 0; --i) { n for (int j = 0; j < n; ++j) { n add(f[i][j][y], f[i - 1][j][x]); n } n } n } n long long res = 0; n for (int i = 0; i < n; ++i) { n add(res, f[5][i][i]); n } n cout << res << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k, l, r, sall, sk; n cin >> n >> k >> l >> r >> sall >> sk; n int el[n]; n int div, mod, m, sm; n m = n - k; n sm = sall - sk; n if (k > 0) { n div = sk / k; n mod = sk % k; n for (int i = 0; i < k; i++) { n el[i] = div; n if (i < mod) { n el[i] += 1; n } n } n } n if (m > 0) { n div = sm / m; n mod = sm % m; n for (int i = 0; i < m; i++) { n el[i + k] = div; n if (i < mod) { n el[i + k] += 1; n } n } n } n for (int i = 0; i < n; i++) { n cout << el[i] << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long ar[100005]; n long long N; n int main() { n cin >> N; n for (long long i = 0; i < N; i++) cin >> ar[i]; n long long ans = 0ll; n for (long long i = 0; i < N; i++) { n long long lft = (i == 0 ? 0 : ar[i - 1]); n if (ar[i] < lft) ans += (ar[i]) * (lft - ar[i]); n if (ar[i] > lft) ans += (ar[i] - lft) * (N - ar[i] + 1); n } n cout << ans << endl; n return (0); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long int n, m; n cin >> n >> m; n for (long long int i = 0; i < n; i += 1) { n long long int s, f, t; n cin >> s >> f >> t; n long long int q = t / (m - 1); n long long int r = t % (m - 1); n if (s == f) { n cout << t << n ; n continue; n } n if (q % 2 == 0) { n long long int floor = r + 1; n if (s >= floor) { n t += (s - floor); n if (f >= s) { n t += (f - s); n } else { n t += (m - s) + (m - f); n } n } else { n t += (m - floor) + (m - s); n if (f > s) { n t += (s - 1) + (f - 1); n } else { n t += (s - f); n } n } n } else { n long long int floor = m - r; n if (s <= floor) { n t += (floor - s); n if (f <= s) { n t += (s - f); n } else { n t += (s - 1) + (f - 1); n } n } else { n t += (floor - 1) + (s - 1); n if (f >= s) { n t += (f - s); n } else { n t += (m - s) + (m - f); n } n } n } n cout << t << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = (int)1e5 + 5; n long long add[N << 2], sum[N << 2], color[N << 2]; n int n, m; n void down(int rt, int len) { n if (add[rt]) { n add[(rt << 1)] += add[rt]; n add[(rt << 1 | 1)] += add[rt]; n sum[(rt << 1)] += add[rt] * (len - (len >> 1)); n sum[(rt << 1 | 1)] += add[rt] * (len >> 1); n add[rt] = 0; n color[(rt << 1)] = color[(rt << 1 | 1)] = color[rt]; n color[rt] = 0; n } n } n void build(int rt, int l, int r) { n if (l == r) { n color[rt] = l; n return; n } n int mid = (l + r) >> 1; n build((rt << 1), l, mid); n build((rt << 1 | 1), mid + 1, r); n } n void modify(int rt, int l, int r, int L, int R, int x) { n if (L <= l && r <= R && color[rt]) { n add[rt] += abs(color[rt] - x); n sum[rt] += (r - l + 1) * abs(color[rt] - x); n color[rt] = x; n return; n } n down(rt, r - l + 1); n int mid = (l + r) >> 1; n if (L <= mid) modify((rt << 1), l, mid, L, R, x); n if (mid < R) modify((rt << 1 | 1), mid + 1, r, L, R, x); n color[rt] = (color[(rt << 1)] == color[(rt << 1 | 1)]) ? color[(rt << 1)] : 0; n sum[rt] = sum[(rt << 1)] + sum[(rt << 1 | 1)]; n } n long long query(int rt, int l, int r, int L, int R) { n if (L <= l && r <= R) { n return sum[rt]; n } n down(rt, r - l + 1); n long long t = 0ll; n int mid = (l + r) >> 1; n if (L <= mid) t += query((rt << 1), l, mid, L, R); n if (mid < R) t += query((rt << 1 | 1), mid + 1, r, L, R); n return t; n } n int main() { n scanf( %d%d , &n, &m); n build(1, 1, n); n while (m--) { n int op, l, r, x; n scanf( %d , &op); n if (op == 1) { n scanf( %d%d%d , &l, &r, &x); n modify(1, 1, n, l, r, x); n } else { n scanf( %d%d , &l, &r); n printf( %I64d n , query(1, 1, n, l, r)); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool f[9000000]; n int a[30]; n bool check(int sta, int i) { n if (sta & (1 << (i - 1))) n ; n else n return false; n for (int j = 0; j < i; j++) n if (sta & (1 << j)) n for (int k = j; k < i; k++) n if (sta & (1 << k)) n if (a[j] + a[k] == a[i]) return true; n return false; n } n int main() { n int n; n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %d , &a[i]); n memset(f, false, sizeof(f)); n f[1] = true; n for (int i = 1; i < n; i++) { n int l = 1 << i, r = 1 << (i + 1); n for (int j = l; j < r; j++) n if (f[j - l] && check(j, i)) { n f[j] = true; n for (int k = 0; k < i; k++) f[j & (~(1 << k))] = true; n } n } n int ans = 30; n for (int i = (1 << (n - 1)); i < (1 << n); i++) n if (f[i]) { n int total = 0; n for (int j = 0; j < n; j++) n if (i & (1 << j)) total++; n ans = ((ans) < (total) ? (ans) : (total)); n } n printf( %d n , ans == 30 ? -1 : ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 500 + 1; n int a[maxn], n; n bool check(int r) { n for (int i = 1; i <= n; i++) n if (a[i] % r > 0 && r - 1 - a[i] % r > a[i] / r) return 0; n return 1; n } n long long calc(int r) { n long long res = 0; n for (int i = 1; i <= n; i++) res += a[i] / r + (a[i] % r != 0); n return res; n } n int main() { n ios::sync_with_stdio(false); n cin >> n; n for (int i = 1; i <= n; i++) cin >> a[i]; n int res = 1; n for (int i = 1, j, m = a[1]; i <= m; i = j + 1) { n int t = m / i; n j = m / t; n if (check(t + 1)) { n res = t + 1; n break; n } n if (check(t)) { n res = t; n break; n } n } n cout << calc(res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int Maxn = 1005; n int n, m, k; n long long s[Maxn][Maxn], sl[Maxn][Maxn], sr[Maxn][Maxn]; n inline int get() { n char ch; n while (!isdigit(ch = getchar())) n ; n int v = ch - 48; n while (isdigit(ch = getchar())) v = v * 10 + ch - 48; n return v; n } n int main() { n n = get(); n m = get(); n k = get(); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n s[i][j] = get() + s[i][j - 1] + s[i - 1][j] - s[i - 1][j - 1]; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n sl[i][j] = n sl[i - 1][j - 1] + s[i][j] - (i > k && j > k ? s[i - k][j - k] : 0); n sr[i][j] = sr[i - 1][j + 1] + s[i][j] - n (i > k && j + k <= m ? s[i - k][j + k] : 0); n } n sr[i][0] = sr[i - 1][1] + s[i][0] - (i > k ? s[i - k][k] : 0); n } n int wx = 0, wy = 0; n long long maxv = -1; n for (int i = k; i <= n - k + 1; i++) n for (int j = k; j <= m - k + 1; j++) { n long long v = sr[i + k - 1][j] + sr[i - 1][j - k] - sl[i - 1][j + k - 1] - n sl[i + k - 1][j - 1]; n if (maxv < v) maxv = v, wx = i, wy = j; n } n cout << wx << << wy << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, sum[3] = {0}; n cin >> n; n int *x = new int[n], *y = new int[n], *z = new int[n]; n for (int i = 0; i < n; i++) { n cin >> x[i] >> y[i] >> z[i]; n sum[0] += x[i]; n sum[1] += y[i]; n sum[2] += z[i]; n } n if (sum[0] == 0 && sum[1] == 0 && sum[2] == 0) n cout << YES ; n else n cout << NO ; n delete[] x; n delete[] y; n delete[] z; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct man { n long long int m, s, I; n }; n man a[131072]; n bool cmp(man a, man b) { n if (a.m < b.m) return true; n if (a.m > b.m) return false; n if (a.I > b.I) return true; n if (a.I < b.I) return false; n } n int main() { n queue x; n long long int n, d, i, tbr = 0, maxbr = 0; n cin >> n >> d; n for (i = 0; i < n; i++) { n cin >> a[i].m >> a[i].s; n a[i].I = i; n } n sort(a, a + n, cmp); n for (i = 0; i < n; i++) { n x.push(a[i]); n struct man m = x.front(), m2 = x.back(); n while (m2.m - m.m >= d) { n tbr -= m.s; n x.pop(); n m = x.front(); n m2 = x.back(); n } n tbr += m2.s; n if (tbr > maxbr) maxbr = tbr; n } n cout << maxbr << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1000000007; n const long long INF = 1000000000; n struct wie { n int il_50, il_100, str; n }; n int main() { n ios_base::sync_with_stdio(0); n int n, k; n cin >> n >> k; n int p = 0, s = 0; n for (int i = 0; i < n; ++i) { n int x; n cin >> x; n if (x == 50) n ++p; n else n ++s; n } n vector > C(51, vector(51)); n for (int i = 0; i <= 50; ++i) { n for (int j = 0; j <= i; ++j) { n if (j == 0 || j == i) n C[i][j] = 1; n else n C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD; n } n } n long long il[51][51][2]; n long long odl[51][51][2]; n bool odw[51][51][2]; n for (int i = 0; i < 51; ++i) { n for (int j = 0; j < 51; ++j) { n for (int l = 0; l < 2; ++l) { n odw[i][j][l] = false; n odl[i][j][l] = -1; n } n } n } n queue Q; n Q.push({p, s, 1}); n odw[p][s][1] = true; n while (!Q.empty()) { n wie akt = Q.front(); n Q.pop(); n if (akt.il_100 == s && akt.il_50 == p && akt.str == 1) { n odl[akt.il_50][akt.il_100][akt.str] = 0; n il[akt.il_50][akt.il_100][akt.str] = 1; n for (int i = 0; i <= akt.il_50; ++i) { n for (int j = 0; j <= akt.il_100; ++j) { n wie nowy = {p - akt.il_50 + i, s - akt.il_100 + j, (akt.str ^ 1)}; n if (i + j != 0 && 50 * i + 100 * j <= k) { n Q.push(nowy); n odw[nowy.il_50][nowy.il_100][nowy.str] = true; n } n } n } n } else { n odl[akt.il_50][akt.il_100][akt.str] = INF; n il[akt.il_50][akt.il_100][akt.str] = 0; n for (int i = 0; i <= akt.il_50; ++i) { n for (int j = 0; j <= akt.il_100; ++j) { n wie nowy = {p - akt.il_50 + i, s - akt.il_100 + j, (akt.str ^ 1)}; n if (i + j != 0 && 50 * i + 100 * j <= k) { n if (odw[nowy.il_50][nowy.il_100][nowy.str]) { n if (odl[nowy.il_50][nowy.il_100][nowy.str] != -1) { n odl[akt.il_50][akt.il_100][akt.str] = n min(odl[akt.il_50][akt.il_100][akt.str], n odl[nowy.il_50][nowy.il_100][nowy.str] + 1); n il[akt.il_50][akt.il_100][akt.str] = n (il[akt.il_50][akt.il_100][akt.str] + n (C[akt.il_50][i] * C[akt.il_100][j]) % MOD * n il[nowy.il_50][nowy.il_100][nowy.str]) % n MOD; n } n } else { n Q.push(nowy); n odw[nowy.il_50][nowy.il_100][nowy.str] = true; n } n } n } n } n } n } n if (odw[p][s][0]) n cout << odl[p][s][0] << << il[p][s][0]; n else n cout << -1 0 ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1000 + 10, M = 998244353; n int t; n int n, m, q; n bool locked[N][N]; n long long num[N][N][2]; n long long ans = 0; n int calc(int i, int j, int t) { n if (i > n || j > m) return 0; n if (num[i][j][t] != 0) return num[i][j][t]; n num[i][j][t] = 1; n if (t == 0) n num[i][j][t] += calc(i + 1, j, t ^ 1); n else n num[i][j][t] += calc(i, j + 1, t ^ 1); n return num[i][j][t]; n } n void go(int i, int j, int t, int val) { n if (i <= 0 || j <= 0 || locked[i][j]) return; n if (t == 0) { n num[i][j][t] -= val; n ans -= val; n return go(i, j - 1, t ^ 1, val); n } else { n num[i][j][t] -= val; n ans -= val; n return go(i - 1, j, t ^ 1, val); n } n } n void go2(int i, int j, int t) { n num[i][j][t] = 1; n ans++; n if (t == 0) { n if (i < n) { n num[i][j][t] += num[i + 1][j][t ^ 1]; n ans += num[i + 1][j][t ^ 1]; n } n } else { n if (j < m) { n num[i][j][t] += num[i][j + 1][t ^ 1]; n ans += num[i][j + 1][t ^ 1]; n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n >> m >> q; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n for (int k = 0; k < 2; k++) ans += calc(i, j, k); n } n } n long long free = n * m; n while (q--) { n int x, y; n cin >> x >> y; n if (!locked[x][y]) { n go(x, y, 0, num[x][y][0]); n go(x, y, 1, num[x][y][1]); n locked[x][y] = 1; n free--; n } else { n go2(x, y, 0); n go2(x, y, 1); n locked[x][y] = 0; n go(x, y, 0, -num[x][y][0]); n go(x, y, 1, -num[x][y][1]); n num[x][y][0] /= 2; n num[x][y][1] /= 2; n ans -= num[x][y][0] + num[x][y][1]; n free++; n } n cout << ans - free << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int values[400][400]; n int mem[400][400][2]; n void read() { n cin >> n; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < n; ++j) { n cin >> values[i][j]; n mem[i][j][0] = 0; n mem[i][j][1] = 0; n } n } n } n void add(int x1, int x2, int c, int v) { n if (x1 > x2) return; n int lo = max(0, c - n + 1), hi = min(n - 1, c); n if (x1 < lo || x2 > hi) return; n int y1 = c - x1, y2 = c - x2; n v += values[x1][y1] + values[x2][y2]; n if (x1 == x2) v -= values[x1][y1]; n if (v > mem[x1][x2][c & 1]) mem[x1][x2][c & 1] = v; n } n void solve() { n mem[0][0][0] = values[0][0]; n for (int c = 0; c <= 2 * n - 3; ++c) { n for (int i = 0; i < n; ++i) { n for (int j = 0; j < n; ++j) { n mem[i][j][(c + 1) & 1] = -1000 * 400 * 2; n } n } n int lo = max(0, c - n + 1), hi = min(n - 1, c); n for (int x1 = lo; x1 <= hi; ++x1) { n for (int x2 = x1; x2 <= hi; ++x2) { n add(x1, x2, c + 1, mem[x1][x2][c & 1]); n add(x1 + 1, x2, c + 1, mem[x1][x2][c & 1]); n add(x1, x2 + 1, c + 1, mem[x1][x2][c & 1]); n add(x1 + 1, x2 + 1, c + 1, mem[x1][x2][c & 1]); n } n } n } n } n int main() { n read(); n solve(); n cout << mem[n - 1][n - 1][0] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int modulo = 1e9 + 7; n int n; n const int limite = 100001; n long long int cuantoshasta[limite], sumahasta[limite], valor[limite], n prodhasta[limite]; n long long int cuatros[limite][10], sietes[limite][10], diezala[limite], n dosala[limite], sumahasta7[limite][10], prodhasta7[limite][10]; n long long int d[limite]; n long long int computa(string &s) { n for (int i = 0; i < n; i++) d[i] = s[n - 1 - i] - 0 ; n valor[0] = d[0]; n if (d[0] == 4) { n cuantoshasta[0] = 1; n sumahasta[0] = 4; n prodhasta[0] = 0; n } else { n cuantoshasta[0] = 2; n sumahasta[0] = 11; n prodhasta[0] = 28; n } n for (int i = 1; i < n; i++) { n valor[i] = (valor[i - 1] + diezala[i] * d[i]) % modulo; n if (d[i] == 4) { n cuantoshasta[i] = cuantoshasta[i - 1]; n sumahasta[i] = n (4 * diezala[i] % modulo * cuantoshasta[i - 1] + sumahasta[i - 1]) % n modulo; n prodhasta[i] = n (4 * diezala[i] % modulo * n (2 * sumahasta[i - 1] - cuatros[i - 1][4] - valor[i - 1] + n 4 * diezala[i] % modulo * (cuantoshasta[i - 1] - 1) % modulo) % n modulo + n prodhasta[i - 1]) % n modulo; n } else { n cuantoshasta[i] = (cuantoshasta[i - 1] + dosala[i]) % modulo; n sumahasta[i] = n (sumahasta7[i][4] + 7 * diezala[i] % modulo * cuantoshasta[i - 1] + n sumahasta[i - 1]) % n modulo; n prodhasta[i] = n (prodhasta7[i][4] + sietes[i][4] * cuatros[i][7] % modulo + n 7 * diezala[i] % modulo * n (2 * sumahasta[i - 1] - cuatros[i - 1][4] - valor[i - 1] + n 7 * diezala[i] % modulo * (cuantoshasta[i - 1] - 1) % modulo) % n modulo + n prodhasta[i - 1]) % n modulo; n } n } n return prodhasta[n - 1]; n } n int main() { n ios::sync_with_stdio(false); n string sl, sr; n cin >> sl >> sr; n n = int(sl.size()); n cuatros[0][4] = 4; n cuatros[0][7] = 7; n sietes[0][4] = 4; n sietes[0][7] = 7; n diezala[0] = 1; n dosala[0] = 1; n sumahasta7[0][4] = 4; n sumahasta7[0][7] = 11; n prodhasta7[0][4] = 0; n prodhasta7[0][7] = 28; n for (int i = 1; i < n; i++) { n diezala[i] = (diezala[i - 1] * 10) % modulo; n dosala[i] = (dosala[i - 1] * 2) % modulo; n cuatros[i][4] = (cuatros[i - 1][4] + 4 * diezala[i]) % modulo; n cuatros[i][7] = (cuatros[i - 1][4] + 7 * diezala[i]) % modulo; n sietes[i][4] = (sietes[i - 1][7] + 4 * diezala[i]) % modulo; n sietes[i][7] = (sietes[i - 1][7] + 7 * diezala[i]) % modulo; n sumahasta7[i][4] = n (4 * diezala[i] % modulo * dosala[i] + sumahasta7[i - 1][7]) % modulo; n sumahasta7[i][7] = (sumahasta7[i][4] + 7 * diezala[i] % modulo * dosala[i] + n sumahasta7[i - 1][7]) % n modulo; n prodhasta7[i][4] = n (4 * diezala[i] % modulo * n (2 * sumahasta7[i - 1][7] - cuatros[i - 1][4] - sietes[i - 1][7] + n 4 * diezala[i] % modulo * (dosala[i] - 1) % modulo) % n modulo + n prodhasta7[i - 1][7]) % n modulo; n prodhasta7[i][7] = n (prodhasta7[i][4] + sietes[i][4] * cuatros[i][7] % modulo + n 7 * diezala[i] % modulo * n (2 * sumahasta7[i - 1][7] - cuatros[i - 1][4] - sietes[i - 1][7] + n 7 * diezala[i] % modulo * (dosala[i] - 1) % modulo) % n modulo + n prodhasta7[i - 1][7]) % n modulo; n } n cout << ((computa(sr) - computa(sl)) % modulo + modulo) % modulo << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long x, y, z; n long long x1, y1, z1; n vector a(6); n long long sum = 0; n cin >> x >> y >> z; n cin >> x1 >> y1 >> z1; n for (int i = 0; i < 6; ++i) { n long long b; n cin >> b; n a[i] = b; n } n if (x < 0) { n sum += a[4]; n } else if (x > x1) { n sum += a[5]; n } n if (y < 0) { n sum += a[0]; n } else if (y > y1) { n sum += a[1]; n } n if (z < 0) { n sum += a[2]; n } else if (z > z1) { n sum += a[3]; n } n cout << sum; n } n "} +{"func_code_string": "#include n struct node { n double x, y, z; n } p[5005]; n double d[5005]; n double getlen(node a, node b) { n double len; n len = (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y) + n (a.z - b.z) * (a.z - b.z); n return sqrt(len); n } n int main() { n int n, i, j, a, b, c; n while (scanf( %d , &n) != EOF) { n for (i = 0; i < n; i++) { n scanf( %d %d %d , &a, &b, &c); n p[i].x = a * 1.0; n p[i].y = b * 1.0; n p[i].z = c * 1.0; n } n for (i = 1; i < n; i++) { n d[i] = getlen(p[0], p[i]); n } n double lenn; n double max = 9999999.0; n for (i = 1; i < n; i++) { n for (j = 1; j <= i; j++) { n if (j == i) continue; n lenn = d[i] + d[j] + getlen(p[i], p[j]); n if (max - lenn > 1e-6) max = lenn; n } n } n printf( %.10f n , max * 1.0 / 2.0); n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n; n scanf( %d , &n); n if (n == 2) { n printf( -1 n ); n return 0; n } n printf( 6 n10 n15 n ); n for (int i = 4; i <= n; i++) { n printf( 6 ); n for (int zero = 1; zero <= i - 4 + 1; zero++) printf( 0 ); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n string s; n cin >> s; n int x; n cin >> x; n int a[s.length()]; n for (int i = 0; i < s.length(); i++) { n a[i] = 1; n } n for (int i = 0; i < s.length(); i++) { n if (s[i] == 0 ) { n if (i - x >= 0) { n a[i - x] = 0; n } n if (i + x < s.length()) { n a[i + x] = 0; n } n } n } n int tag = 0; n for (int i = 0; i < s.length(); i++) { n if (s[i] == 1 ) { n int tag1 = 0; n if (i - x >= 0) { n if (a[i - x] == 1) { n a[i - x] = 1; n tag1++; n } n } n if (i + x < s.length()) { n if (a[i + x] == 1) { n tag1++; n } n } n if (tag1 == 0) { n tag = 1; n break; n } n } n } n if (tag == 1) { n cout << -1 << endl; n } else { n for (int i = 0; i < s.length(); i++) { n cout << a[i]; n } n cout << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, a, b, c, d, e, R, B, P, ans; n char s; n inline long long read() { n long long sum = 0, x = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) x = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n sum = sum * 10 + ch - 0 ; n ch = getchar(); n } n return sum * x; n } n inline void write(long long x) { n if (x < 0) { n putchar( - ); n x = -x; n } n if (x > 9) write(x / 10); n putchar(x % 10 + 0 ); n return; n } n signed main() { n n = read(); n for (register long long i = 1; i <= n; ++i) { n m = read(); n cin >> s; n if (s == P || s == R ) { n if (R) { n ans += m - b; n a = max(a, m - b); n } n R = 1; n b = m; n } n if (s == P || s == B ) { n if (B) { n ans += m - c; n d = max(d, m - c); n } n B = 1; n c = m; n } n if (s == P ) { n if (P) ans += min(0ll, m - e - d - a); n P = 1; n a = d = 0; n e = m; n } n } n write(ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const long long LINF = 0x3f3f3f3f3f3f3f3fll; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n long long n, x, y; n cin >> n >> x >> y; n long long a1 = y - n + 1; n if (a1 <= 0 or a1 * a1 + n - 1 < x) return cout << -1 << n , 0; n cout << a1 << n ; n for (int i = 0; i < n - 1; i++) cout << 1 << n ; n exit(0); n } n "} +{"func_code_string": "#include n using namespace std; n int T; n priority_queue, greater > q; n vector g[1000005]; n int main() { n scanf( %d , &T); n int n; n long long int ans; n while (T--) { n ans = 0; n scanf( %d , &n); n int x, y; n for (int i = 1; i <= n; i++) { n scanf( %d %d , &x, &y); n g[x].push_back(y); n } n for (int i = n - 1; i >= 0; i--) { n int sz = g[i].size(); n for (int j = 0; j < sz; j++) q.push(g[i][j]); n while (q.size() > n - i) { n ans += q.top(), q.pop(); n } n } n printf( %lld n , ans); n for (int i = 0; i < n; ++i) { n g[i].clear(); n while (!q.empty()) q.pop(); n } n } n return 0; n } n "} +{"func_code_string": "#include n const double EPS = 1e-24; n const long long int MOD = 1000000007ll; n const long long int MOD1 = 1000000009ll; n const long long int MOD2 = 1100000009ll; n const double PI = 3.14159265359; n int INF = 2147483645; n long long int INFINF = 9223372036854775807; n template n T Max2(T a, T b) { n return a < b ? b : a; n } n template n T Min2(T a, T b) { n return a < b ? a : b; n } n template n T Max3(T a, T b, T c) { n return Max2(Max2(a, b), c); n } n template n T Min3(T a, T b, T c) { n return Min2(Min2(a, b), c); n } n template n T Max4(T a, T b, T c, T d) { n return Max2(Max2(a, b), Max2(c, d)); n } n template n T Min4(T a, T b, T c, T d) { n return Min2(Min2(a, b), Min2(c, d)); n } n using namespace std; n int bit_count(long long int _x) { n int _ret = 0; n while (_x) { n if (_x % 2 == 1) _ret++; n _x /= 2; n } n return _ret; n } n int bit(long long int _mask, long long int _i) { n return (_mask & (1 << _i)) == 0 ? 0 : 1; n } n long long int powermod(long long int _a, long long int _b, long long int _m) { n long long int _r = 1; n while (_b) { n if (_b % 2 == 1) _r = (_r * _a) % _m; n _b /= 2; n _a = (_a * _a) % _m; n } n return _r; n } n int x[5], y[5]; n bool issquare[30010]; n int sz, sz2; n char s[110][110]; n char c[5]; n void type2(int a1, int a2, int b1, int b2, int c1, int c2, int i1, int i2, n int i3) { n for (int i = 1; i <= a1; i++) n for (int j = 1; j <= a2; j++) s[i][j] = c[i1]; n for (int i = a1 + 1; i <= a1 + b1; i++) n for (int j = 1; j <= b2; j++) s[i][j] = c[i2]; n for (int i = 1; i <= c1; i++) n for (int j = a2 + 1; j <= a2 + c2; j++) s[i][j] = c[i3]; n } n void print() { n cout << sz << n ; n for (int i = 1; i <= sz; i++) { n for (int j = 1; j <= sz; j++) cout << s[i][j]; n cout << n ; n } n } n int main() { n std::ios::sync_with_stdio(false); n srand(time(NULL)); n for (int i = 1; i <= 3; i++) cin >> x[i] >> y[i]; n c[1] = A ; n c[2] = B ; n c[3] = C ; n for (int i = 2; i * i <= 30010; i++) issquare[i * i] = true; n sz2 = 0; n for (int i = 1; i <= 3; i++) sz2 += x[i] * y[i]; n if (!issquare[sz2]) { n cout << -1 ; n return 0; n } n for (int i = 2; i * i <= 30010; i++) { n if (i * i == sz2) { n sz = i; n break; n } n } n for (int i = 1; i <= 3; i++) n if (x[i] > y[i]) swap(x[i], y[i]); n if (y[1] == sz && y[2] == sz && y[3] == sz && x[1] + x[2] + x[3] == sz) { n cout << sz << n ; n for (int i = 1; i <= x[1]; i++) { n for (int j = 1; j <= y[1]; j++) cout << A ; n cout << n ; n } n for (int i = 1; i <= x[2]; i++) { n for (int j = 1; j <= y[2]; j++) cout << B ; n cout << n ; n } n for (int i = 1; i <= x[3]; i++) { n for (int j = 1; j <= y[3]; j++) cout << C ; n cout << n ; n } n return 0; n } n for (int i = 1; i <= 3; i++) n for (int j = 1; j <= 3; j++) n for (int k = 1; k <= 3; k++) { n if (i == j || j == k || i == k) continue; n if (x[j] + x[k] == sz && y[j] == y[k]) { n if (x[i] == sz && y[i] == sz - y[j]) { n type2(x[j], y[j], x[k], y[k], x[i], y[i], j, k, i); n print(); n return 0; n } n if (y[i] == sz && x[i] == sz - y[j]) { n type2(x[j], y[j], x[k], y[k], y[i], x[i], j, k, i); n print(); n return 0; n } n } else if (x[j] + y[k] == sz && y[j] == x[k]) { n if (x[i] == sz && y[i] == sz - y[j]) { n type2(x[j], y[j], y[k], x[k], x[i], y[i], j, k, i); n print(); n return 0; n } n if (y[i] == sz && x[i] == sz - y[j]) { n type2(x[j], y[j], y[k], x[k], y[i], x[i], j, k, i); n print(); n return 0; n } n } else if (y[j] + x[k] == sz && x[j] == y[k]) { n if (x[i] == sz && y[i] == sz - x[j]) { n type2(y[j], x[j], x[k], y[k], x[i], y[i], j, k, i); n print(); n return 0; n } n if (y[i] == sz && x[i] == sz - x[j]) { n type2(y[j], x[j], x[k], y[k], y[i], x[i], j, k, i); n print(); n return 0; n } n } else if (y[j] + y[k] == sz && x[j] == x[k]) { n if (x[i] == sz && y[i] == sz - x[j]) { n type2(y[j], x[j], y[k], x[k], x[i], y[i], j, k, i); n print(); n return 0; n } n if (y[i] == sz && x[i] == sz - x[j]) { n type2(y[j], x[j], y[k], x[k], y[i], x[i], j, k, i); n print(); n return 0; n } n } n } n cout << -1 ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n string s; n int l1, l, r, count = 0; n cin >> s; n l1 = s.size(); n int arr[l1]; n memset(arr, 0, sizeof(arr)); n int last = -1; n for (int i = 0; i < l1;) { n if (s[i] == s[i + 1]) { n l = i; n r = i + 1; n while (s[l] == s[r] && l >= 0 && r < l1) { n count++; n s.erase(l, 1); n s.erase(l, 1); n l--; n r--; n l1 -= 2; n } n i = r - 1; n last = r - 1; n } n i++; n } n if (count % 2) n cout << Yes n ; n else n cout << No ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 998244353; n const int maxn = 1100; n const int maxk = 2 * maxn; n long long dp[maxn][maxk][4]; n long long st[4][4] = {{0, 1, 1, 1}, {1, 0, 1, 1}, {0, 0, 0, 2}, {0, 0, 2, 0}}; n int main() { n int n, k; n scanf( %d%d , &n, &k); n dp[1][1][0] = 1; n dp[1][1][1] = 1; n dp[1][2][2] = 1; n dp[1][2][3] = 1; n for (int i = 2; i <= n; i++) n for (int j = 1; j <= k; j++) n for (int a = 0; a < 4; a++) n for (int b = 0; b < 4; b++) n dp[i][j + st[b][a]][a] += dp[i - 1][j][b] % mod; n printf( %d n , (dp[n][k][0] + dp[n][k][1] + dp[n][k][2] + dp[n][k][3]) % mod); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector> a; n vector> b; n vector c; n long long int n, m, T; n bool solve(long long int d) { n priority_queue, greater> n s; n long long int j = 0; n long long int sum = 0; n for (long long int i = 0; i < m; i = i + d) { n while (j < n && a[j].first >= b[i].first) { n s.push(c[a[j].second]); n j++; n } n if (s.empty()) return false; n long long int temp = s.top(); n s.pop(); n sum += temp; n } n return sum <= T; n } n signed main(void) { n std::ios::sync_with_stdio(false); n cin.tie(NULL); n long long int t = 1; n while (t--) { n cin >> n >> m >> T; n a.resize(0); n b.resize(0); n c.resize(n); n for (long long int i = 0; i < m; i++) { n long long int temp; n cin >> temp; n b.push_back({temp, i}); n } n for (long long int i = 0; i < n; i++) { n long long int temp; n cin >> temp; n a.push_back({temp, i}); n } n for (long long int i = 0; i < n; i++) cin >> c[i]; n sort(b.begin(), b.end(), greater>()); n sort(a.begin(), a.end(), greater>()); n long long int l = 1; n long long int r = m; n long long int ans = -1; n while (l <= r) { n long long int mid = (l + r) / 2; n if (solve(mid)) { n r = mid - 1; n ans = mid; n } else n l = mid + 1; n } n if (ans == -1) { n cout << NO << endl; n continue; n } n cout << YES << endl; n priority_queue, n vector>, n greater>> n s; n long long int j = 0; n long long int sum = 0; n vector p(m); n for (long long int i = 0; i < m; i = i + ans) { n while (j < n && a[j].first >= b[i].first) { n s.push({c[a[j].second], a[j].second}); n j++; n } n long long int index = s.top().second; n s.pop(); n for (long long int k = i; k < min(i + ans, m); k++) { n p[b[k].second] = index; n } n } n for (long long int i = 0; i < m; i++) cout << p[i] + 1 << ; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 6e1; n map mp; n int n; n int answer = 1; n string To(string a) { n for (int i = 0; i < a.size(); i++) n if (a[i] > Z ) a[i] = a[i] - 32; n return a; n } n int main() { n mp[ POLYCARP ] = 1; n cin >> n; n for (int i = 0; i < n; i++) { n string n1, r, n2; n cin >> n1 >> r >> n2; n n1 = To(n1); n n2 = To(n2); n mp[n1] = mp[n2] + 1; n answer = max(answer, mp[n1]); n } n cout << answer; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e5 + 10; n struct Node { n long long l, r; n } dict[maxn]; n long long N, s; n inline bool check(long long mid) { n long long cnt = 0, cost = 0; n priority_queue, greater> q; n for (int i = 1; i <= N; ++i) { n cost += dict[i].l; n if (dict[i].l < mid && dict[i].r >= mid) { n q.push(mid - dict[i].l); n } else if (dict[i].l >= mid) { n ++cnt; n } n } n while (!q.empty() && cnt < (N + 1) / 2) { n cost += q.top(); n q.pop(); n cnt++; n } n return cost <= s && cnt >= (N + 1) / 2; n } n int main() { n int T; n scanf( %d , &T); n while (T--) { n scanf( %lld%lld , &N, &s); n for (int i = 1; i <= N; ++i) { n scanf( %lld%lld , &dict[i].l, &dict[i].r); n } n long long l = 1, r = 1e14, ans; n while (l <= r) { n long long mid = (l + r) >> 1; n if (check(mid)) n ans = mid, l = mid + 1; n else n r = mid - 1; n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int t = 1, n, k = 0, flag = -1, b = 0; n while (t--) { n scanf( %lld , &n); n k = 0; n while (n != flag) { n if (n / 10 == 0 && b == 0) { n flag = n; n b = 1; n } n k++; n n++; n while (n % 10 == 0) { n n = n / 10; n } n } n printf( %lld n , k); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int t[40008]; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long n, m, k, l, p; n cin >> n; n string s; n map ex; n map kol; n map wh; n for (int u = 1; u <= n; u++) { n cin >> s; n for (int i = 0; i < s.length(); i++) { n string q; n for (int j = i; j < s.length(); j++) { n q += s[j]; n if (wh[q] == u) continue; n if (kol[q] == 0) { n ex[q] = s; n } n wh[q] = u; n kol[q]++; n } n } n } n int kk; n cin >> kk; n for (int i = 0; i < kk; i++) { n string s; n cin >> s; n int kko = kol[s]; n cout << kko << ; n if (kko == 0) { n cout << - n ; n } else { n cout << ex[s] << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n int mid = (m + 1) / 2; n int cnt = 0; n int ans[m + 1]; n if (m % 2) { n int i = 1; n int cnt = 1; n int k = 1; n ans[k++] = mid; n while (true) { n if (cnt > m) break; n ans[k++] = mid - i; n cnt++; n if (cnt > m) break; n ans[k++] = mid + i; n cnt++; n i++; n } n } else { n int i = 1; n int cnt = 0; n int k = 1; n while (true) { n if (cnt > m) break; n ans[k++] = mid - i + 1; n cnt++; n if (cnt > m) break; n ans[k++] = mid + i; n cnt++; n i++; n } n } n int k = 1; n for (int i = (1); i <= (n); i++) { n cout << ans[k++] << endl; n if (k > m) k = 1; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, d[105]; n char x[205]; n int main() { n scanf( %d%d%s , &n, &m, x); n d[0] = 1; n for (int i = 0; i < n; i++) n if (x[i] == 1 && d[i]) n for (int j = 1; j <= m; j++) n if (x[i + j] == 1 && (!d[i + j] || d[i + j] > d[i] + 1)) n d[i + j] = d[i] + 1; n printf( %d n , d[n - 1] - 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n n int main(){ n int t,n,d; n int a[110],b[110]; n n n scanf( %d ,&t); n while(t--){ n scanf( %d%d ,&n,&d); n int fir=200,sec=200; n int fid,sid; n int x[110]; n int xid[110]; n int c=0; n n for(int i=1;i<=n;i++){ n scanf( %d ,&a[i]); n if(a[i]d){ n x[++c]=a[i]; n xid[c]=i; n } n } n if(fir>d||sec>d||(c>=1&&fir+sec>d))printf( NO n ); n else printf( YES n ); n } n return 0; n } n n n "} +{"func_code_string": "#include n using namespace std; n template n inline void chkmin(T1 &first, T2 second) { n if (first > second) first = second; n } n template n inline void chkmax(T1 &first, T2 second) { n if (first < second) first = second; n } n const string FileName = input ; n const int MAXN = 3e5 + 100; n int n, k, b, c; n vector arr; n vector event[5]; n long long sum, mod, ans = 1e18; n multiset que; n long long f(long long s, long long t) { n return ((t - s) / 5) * b + ((t - s) % 5) * c; n } n int main(int argc, char const *argv[]) { n srand(time(0)); n ios::sync_with_stdio(0); n cin >> n >> k >> b >> c; n arr.resize(n); n b = min(b, c * 5); n for (int i = 0; i < n; ++i) { n cin >> arr[i]; n } n sort(arr.begin(), arr.end()); n for (int i = 0; i < n; ++i) { n for (int j = 0; j < 5; ++j) { n event[(((arr[i] + j) % 5) + 5) % 5].push_back(arr[i] + j); n } n } n for (int j = 0; j < 5; ++j) { n int L = 0; n sum = 0, mod = 0; n que.clear(); n for (int i = 0; i < n; ++i) { n while (L < n && arr[L] <= event[j][i]) { n que.insert(-f(arr[L], event[j][i]) - mod); n sum += f(arr[L], event[j][i]); n ++L; n } n while (que.size() > k) { n sum += *que.begin() + mod; n que.erase(que.begin()); n } n if (que.size() == k) { n ans = min(ans, sum); n } n if (i != n - 1) { n assert(event[j][i] <= event[j][i + 1]); n mod -= f(event[j][i], event[j][i + 1]); n sum += f(event[j][i], event[j][i + 1]) * que.size(); n } n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, a[400010]; n map m; n set > s; n long long ans = 0; n int main() { n cin >> n >> k; n for (int i = 1; i <= n; ++i) cin >> a[i]; n a[0] = 0; n for (int l = 1, r = 0; l <= n; ++l) { n s.erase(make_pair(-m[a[l - 1]], a[l - 1])); n m[a[l - 1]]--; n s.insert(make_pair(-m[a[l - 1]], a[l - 1])); n while (-s.begin()->first < k) { n ++r; n if (r >= n + 1) break; n s.erase(make_pair(-m[a[r]], a[r])); n m[a[r]]++; n s.insert(make_pair(-m[a[r]], a[r])); n } n ans += max(n + 1 - r, 0); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n int main() { n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n long long a[n]; n vector v; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n v.push_back(a[i]); n } n bool ans = true; n sort(v.begin(), v.end()); n for (long long i = 0; i < n; i++) { n if (a[i] != v[i] && a[i] % v[0] > 0) { n ans = false; n break; n } n } n if (ans) n cout << YES ; n else n cout << NO ; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e6 + 10; n int fa[maxn], cnt[maxn], vis[maxn], arr[maxn]; n int fi(int x) { return x == fa[x] ? x : fa[x] = fi(fa[x]); } n int main(int argc, char const *argv[]) { n int n, m; n scanf( %d %d , &n, &m); n for (int i = 1; i <= n; ++i) fa[i] = i, cnt[i] = 0, vis[i] = 0, arr[i] = 0; n for (int i = 1, a, b; i <= m; ++i) { n scanf( %d %d , &a, &b); n cnt[a]++; n cnt[b]++; n vis[a] = 1; n vis[b] = 1; n int fx = fi(a), fy = fi(b); n if (fx != fy) fa[fx] = fy; n } n int ans = 0, tot = 0; n for (int i = 1; i <= n; ++i) { n if (cnt[i] % 2 == 1) { n arr[fi(i)]++; n } n } n int ff = 0; n int cnt2 = 0, cnt1 = 0; n for (int i = 2; i <= n; ++i) n if (vis[i] == 1) ff = 1; n int cnt = 0; n for (int i = 1; i <= n; ++i) { n if (vis[i] && fa[i] == i && arr[i] >= 2) { n tot = tot + (arr[i] - 2) / 2; n ++cnt2; n } n if (vis[i] && fa[i] == i) tot += 1, cnt++; n } n cnt1 = cnt - cnt2; n if (cnt == 1) { n if (cnt1 == 1) { n if (vis[1] == 0) n printf( 2 n ); n else n printf( 0 n ); n } else if (cnt2 == 1) { n if (vis[1] == 0) tot++; n printf( %d n , tot); n } n } else if (cnt == 0) { n printf( 0 n ); n } else if (cnt >= 2) { n if (vis[1] == 0) ++tot; n printf( %d n , tot); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n void input() { cin >> n; } n void solve() { n int cnt = 0; n for (int i = 1; i <= n; ++i) { n if (cnt == n) { n break; n } n printf( %d 1 n , i); n ++cnt; n if (cnt == n) { n break; n } n if ((i % 2) == 0) { n printf( %d 4 n , i); n ++cnt; n } n } n } n int main() { n ios_base ::sync_with_stdio(false); n cin.tie(NULL); n int t; n t = 1; n while (t--) { n input(); n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n int l = s.length(); n cout << 4 << endl; n cout << R << l - 1 << endl; n cout << L << 2 << endl; n cout << L << l + 1 << endl; n cout << L << 2 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double pi = acos(-1.0); n const int dx[] = {0, 1, 0, -1}; n const int dy[] = {1, 0, -1, 0}; n int n, k; n string s; n int main() { n cin >> n >> k; n cin >> s; n int sum = 0; n for (int i = 0; i < n; i++) { n if (s[i] == # ) sum++; n if (sum >= k) { n puts( NO ); n return 0; n } n if (s[i] == . ) sum = 0; n } n puts( YES ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int b[65], p = 1e9 + 7; n long long pow_(long long a, long long b) { n long long res = 1; n while (b) { n if (b & 1) res = res * a % p; n b >>= 1, a = a * a % p; n } n return res % p; n } n void solve(int n, int x) { n int t = 0; n long long ans = 0; n while (x) { n if (x & 1) ans = (ans + pow_(n, t)) % p; n x >>= 1, t++; n } n cout << ans % p << endl; n } n int main() { n ios::sync_with_stdio(!true); n int t, n, k; n cin >> t; n while (t--) cin >> n >> k, solve(n, k); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5000 + 10; n const int BASE = 1e9 + 7; n int n; n int memo[N][N], _memo[N][N]; n string s; n int _solve(int pos_1, int pos_2) { n if (pos_1 > n || pos_2 > n) return 0; n if (_memo[pos_1][pos_2] != -1) return _memo[pos_1][pos_2]; n int cur = 0; n if (s[pos_1] == s[pos_2]) cur += _solve(pos_1 + 1, pos_2 + 1) + 1; n return _memo[pos_1][pos_2] = cur; n } n int solve(int pos, int len) { n if (s[pos] == 0 ) return 0; n if (pos + len - 1 > n) return 0; n if (pos + len - 1 == n) return 1; n if (memo[pos][len] != -1) return memo[pos][len]; n int cur = 0; n cur = (cur + solve(pos, len + 1)) % BASE; n if (pos + 2 * len - 1 <= n) { n int tmp = _solve(pos, pos + len); n if (tmp < len && s[pos + tmp] < s[pos + len + tmp]) { n cur = (cur + solve(pos + len, len)) % BASE; n } else n cur = (cur + solve(pos + len, len + 1)) % BASE; n } n return memo[pos][len] = cur; n } n int main() { n ios ::sync_with_stdio(0); n cin.tie(0); n cin >> n >> s; n s = @ + s; n memset(memo, -1, sizeof(memo)); n memset(_memo, -1, sizeof(_memo)); n cout << solve(1, 1); n } n "} +{"func_code_string": "#include n using namespace std; n int parent[100005]; n int coun[100005]; n bool isLucky(int a) { n while (a) { n int x = a % 10; n if (x == 4 || x == 7) { n } else n return false; n a = a / 10; n } n return true; n } n int findp(int a) { n if (parent[a] == a) { n return a; n } n parent[a] = findp(parent[a]); n return parent[a]; n } n void uni(int x, int y) { n int parx = findp(x); n int pary = findp(y); n if (parx != pary) { n parent[parx] = pary; n coun[pary] += coun[parx]; n } n } n vector vec[100005]; n int main() { n ios::sync_with_stdio(false); n cin.tie(); n cout.tie(); n long long int n, i, j, k, x, y, c = 0, ans = 0, z, z1; n cin >> n; n for (int i = 1; i < n + 1; i++) { n coun[i] = 1; n parent[i] = i; n } n for (int i = 0; i < n - 1; i++) { n cin >> x >> y >> z; n if (!isLucky(z)) { n vec[x].push_back(y); n vec[y].push_back(x); n uni(x, y); n } n } n for (i = 1; i <= n; i++) { n int x = findp(i); n int y = coun[x]; n ans += (n - y) * (n - y - 1); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void fscpp() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n } n int main() { n fscpp(); n long long n; n cin >> n; n long long ct = 0; n long long xm, ym; n long long x, y; n cin >> xm >> ym; n vector vx(n), vy(n); n vx[0] = xm; n vy[0] = ym; n for (long long int i = 1; i < n; i++) { n cin >> x >> y; n vx[i] = x; n vy[i] = y; n } n vector mvx(vx), mvy(vy); n sort(mvx.begin(), mvx.end()); n sort(mvy.begin(), mvy.end()); n long long max1 = mvx[n - 1], max2 = mvx[n - 2]; n long long min1 = mvy[0], min2 = mvy[1]; n long long len = min1 - max1; n if (len < 0) len = 0; n long long rx, ry; n for (long long int i = 0; i < n; i++) { n if (max1 == vx[i]) n rx = max2; n else n rx = max1; n if (min1 == vy[i]) n ry = min2; n else n ry = min1; n if (ry - rx > len) len = ry - rx; n } n len--; n cout << len + 1; n int p = 23; n string s = std::bitset<63>(p).to_string(); n string h; n string g; n g = s; n for (long long int i = s.size() - 2; i < s.size(); i++) h += s[i]; n y = h.size(); n s.clear(); n for (long long int i = 0; i < 31 - y; i++) { n s += 1 ; n } n sort(s.begin(), s.end()); n s.erase(unique(s.begin(), s.end()), s.end()); n for (long long int i = 0; i < y; i++) { n s += h[i]; n } n y = std::bitset<63>(g).to_ulong(); n g.clear(); n if (g.size() != 0) cout << yedhukku n t n ; n reverse(s.begin(), s.end()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxint = -1u >> 1; n const double pi = 3.14159265358979323; n const double eps = 1e-8; n int n, k, a[100100]; n set vis; n int main() { n scanf( %d%d , &n, &k); n for (int i = (0); i < (n); i++) scanf( %d , &a[i]); n sort(a, a + n); n int ans = 0; n for (int i = (0); i < (n); i++) { n if (vis.find(a[i]) == vis.end()) { n ans++; n vis.insert(1LL * a[i] * k); n } else n continue; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string str; n cin >> str; n int t = 0; n while (str[t]) { n if (str[t] == . ) { n cout << 0; n t++; n } else if (str[t] == - && str[t + 1] == . ) { n cout << 1; n t += 2; n } else if (str[t] == - && str[t + 1] == - ) { n cout << 2; n t += 2; n } n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 100 + 10; n const int MAX_V = 200 + 10; n const int MAX_S = 1 << 7; n const int INF = 1000000; n const int dx[] = {-1, 0, 1, 0}; n const int dy[] = {0, 1, 0, -1}; n int N, M, K, S; n int w[MAX_N][MAX_N]; n int f[MAX_N][MAX_N][MAX_S]; n int pre[MAX_N][MAX_N][MAX_S]; n int qx[MAX_V]; n int qy[MAX_V]; n int in[MAX_N][MAX_N]; n int cov[MAX_N][MAX_N]; n void Init() { n int x, y; n scanf( %d%d%d , &N, &M, &K); n S = 1 << K; n for (int i = 1; i <= N; ++i) n for (int j = 1; j <= M; ++j) scanf( %d , &w[i][j]); n for (int i = 1; i <= N; ++i) n for (int j = 1; j <= M; ++j) n for (int k = 1; k < S; ++k) { n f[i][j][k] = INF; n pre[i][j][k] = INF; n } n for (int i = 0; i < K; ++i) { n scanf( %d%d , &x, &y); n f[x][y][1 << i] = w[x][y]; n } n } n void SPFA(int s) { n int qh = 0, qt = 0; n for (int i = 1; i <= N; ++i) n for (int j = 1; j <= M; ++j) { n qx[qt] = i; n qy[qt++] = j; n in[i][j] = true; n } n int nx, ny, px, py; n for (; qh < qt;) { n px = qx[qh]; n py = qy[qh++]; n for (int i = 0; i < 4; ++i) { n nx = px + dx[i]; n ny = py + dy[i]; n if (nx > 0 && nx <= N && ny > 0 && ny <= M && n f[nx][ny][s] > f[px][py][s] + w[nx][ny]) { n f[nx][ny][s] = f[px][py][s] + w[nx][ny]; n pre[nx][ny][s] = -i; n if (!in[nx][ny]) { n in[nx][ny] = true; n qx[qt] = nx; n qy[qt++] = ny; n } n } n } n in[px][py] = false; n } n } n void DFS(int x, int y, int s) { n cov[x][y] = true; n int tmp = pre[x][y][s]; n if (tmp == INF) return; n if (tmp <= 0) n DFS(x - dx[-tmp], y - dy[-tmp], s); n else n DFS(x, y, tmp), DFS(x, y, s - tmp); n } n void Solve() { n for (int s = 1; s < S; ++s) { n for (int i = 1; i <= N; ++i) n for (int j = 1; j <= M; ++j) n for (int ns = (s - 1) & s; ns; ns = (ns - 1) & s) n if (f[i][j][s] > f[i][j][ns] + f[i][j][s - ns] - w[i][j]) { n f[i][j][s] = f[i][j][ns] + f[i][j][s - ns] - w[i][j]; n pre[i][j][s] = ns; n } n SPFA(s); n if (0) { n printf( Now is state %d n , s); n for (int i = 1; i <= N; ++i) { n for (int j = 1; j <= M; ++j) printf( %d , f[i][j][s]); n printf( n ); n } n } n } n int ax, ay, ans = INF; n for (int i = 1; i <= N; ++i) n for (int j = 1; j <= M; ++j) n if (f[i][j][S - 1] < ans) { n ans = f[i][j][S - 1]; n ax = i, ay = j; n } n printf( %d n , ans); n DFS(ax, ay, S - 1); n for (int i = 1; i <= N; ++i) { n for (int j = 1; j <= M; ++j) putchar(cov[i][j] ? X : . ); n putchar( n ); n } n } n int main() { n Init(); n Solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool isprime(long long n) { n if (n < 2) return false; n if (n == 2) return true; n if (n % 2 == 0) return false; n for (int i = 3; i * i <= n; i = i + 2) { n if (n % i == 0) return false; n } n return true; n } n int main() { n int w, h, k; n cin >> w >> h >> k; n int sum = 0; n while (k--) { n sum += (2 * w + (2 * (h - 2))); n w -= 4; n h -= 4; n } n cout << sum; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, r, s; n cin >> n; n if (n % 2 == 1) { n if (n == 1) { n cout << -1 ; n } else { n r = (n * n - 1) / 2; n s = (n * n + 1) / 2; n cout << r << << s; n } n } else { n if (n == 2) { n cout << -1 ; n } else { n r = (n / 2) * (n / 2) - 1; n s = (n / 2) * (n / 2) + 1; n cout << r << << s; n } n } n cout << endl; n } n "} +{"func_code_string": "#include n const double eps = 1e-11; n int dx[] = {-1, 0, 1, 0}; n int dy[] = {0, 1, 0, -1}; n using namespace std; n const int maxn = 1005; n int n; n typedef struct node_ { n int x, y; n } N; n N node[maxn]; n pair > ans[100005]; n int cnt; n void deal(int t, int a, int b) { n ans[cnt].first = t, ans[cnt].second.first = a, ans[cnt++].second.second = b; n } n int main() { n while (scanf( %d , &n) == 1) { n cnt = 0; n for (int i = (1); i < (n); i++) { n scanf( %d%d , &node[i].x, &node[i].y); n } n for (int i = 1; i < n; i++) { n int tmp; n if (node[i].x != i + 1) { n tmp = node[i].x; n for (int j = (1); j < (n); j++) { n if (node[j].x == tmp) { n node[j].x = i + 1; n } else if (node[j].x == i + 1) { n node[j].x = tmp; n } n } n deal(1, tmp, i + 1); n } n if (node[i].y > i) { n tmp = node[i].y; n for (int j = (1); j < (n); j++) { n if (node[j].y == tmp) { n node[j].y = i; n } else if (node[j].y == i) { n node[j].y = tmp; n } n } n deal(2, tmp, i); n } n } n printf( %d n , cnt); n for (int i = 0; i < cnt; i++) { n printf( %d %d %d n , ans[i].first, ans[i].second.first, n ans[i].second.second); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c; n cin >> a >> b >> c; n cout << min(a + a + b + b, min(a + b + c, min(a + a + c + c, b + b + c + c))) n << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 3e5 + 6; n namespace AC { n int tot, tr[N][26]; n int fail[N]; n int cnt[N]; n int sid[N]; n int next[N]; n bool vis[N]; n int isend[N]; n int in[N]; n int val[N]; n int victim[N]; n queue q; n void init() { n memset(fail, 0, sizeof(fail)); n memset(tr, 0, sizeof(tr)); n memset(cnt, 0, sizeof(cnt)); n memset(vis, false, sizeof vis); n memset(sid, 0, sizeof sid); n memset(val, 0, sizeof val); n memset(isend, 0, sizeof isend); n memset(victim, 0, sizeof victim); n memset(next, 0, sizeof next); n tot = 0; n } n void insert(char *s, int id) { n int u = 0; n for (int i = 1; s[i]; i++) { n if (!tr[u][s[i] - a ]) tr[u][s[i] - a ] = ++tot; n u = tr[u][s[i] - a ]; n } n sid[id] = u; n isend[u] = true; n } n void build() { n next[0] = 0; n for (int i = 0; i < 26; i++) n if (tr[0][i]) q.push(tr[0][i]); n while (q.size()) { n int u = q.front(); n q.pop(); n for (int i = 0; i < 26; i++) { n if (tr[u][i]) { n fail[tr[u][i]] = tr[fail[u]][i], q.push(tr[u][i]); n in[fail[tr[u][i]]] += 1; n } else n tr[u][i] = tr[fail[u]][i]; n next[tr[u][i]] = n isend[fail[tr[u][i]]] ? fail[tr[u][i]] : next[fail[tr[u][i]]]; n } n } n } n int query(char *t) { n int u = 0, res = -1; n for (int i = 1; t[i]; i++) { n u = tr[u][t[i] - a ]; n for (int x = u; x; x = next[x]) { n if (isend[x]) { n res = max(res, victim[x]); n } n } n } n return res; n } n void query(char *t, int) { n int u = 0; n for (int i = 1; t[i]; i++) { n u = tr[u][t[i] - a ]; n val[u] += 1; n } n } n void topoSort() { n for (int i = 0; i < N; ++i) n if (in[i] == 0) q.push(i); n while (!q.empty()) { n int u = q.front(); n q.pop(); n int v = fail[u]; n in[v]--; n val[v] += val[u]; n if (in[v] == 0) q.push(v); n } n } n } // namespace AC n char s[N]; n int val[N]; n map mp[N]; n int main() { n int ans = 0; n int n, m; n cin >> n >> m; n AC::init(); n for (int i = 0; i < n; i++) { n scanf( %s , s + 1); n AC::insert(s, i); n mp[AC::sid[i]][0] += 1; n } n AC::build(); n while (m--) { n int x, c, v; n scanf( %d , &x); n if (x == 1) { n scanf( %d %d , &c, &v); n mp[AC::sid[c - 1]][val[c - 1]] -= 1; n if (mp[AC::sid[c - 1]][val[c - 1]] == 0) { n mp[AC::sid[c - 1]].erase(val[c - 1]); n } n val[c - 1] = v; n mp[AC::sid[c - 1]][v] += 1; n AC::victim[AC::sid[c - 1]] = (*--mp[AC::sid[c - 1]].end()).first; n continue; n } n scanf( %s , s + 1); n cout << AC::query(s) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector a; n vector > s; n int main() { n ios::sync_with_stdio(false); n int n; n cin >> n; n for (int i = 0; i < n; i++) { n int x; n cin >> x; n a.push_back(x); n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < n - 1; j++) { n if (a[j] > a[j + 1]) { n swap(a[j], a[j + 1]); n s.push_back({j + 1, j + 2}); n } n } n } n for (auto a : s) { n cout << a.first << << a.second << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n short n, before, after; n cin >> n; n string a; n bool flag = false; n for (short i = 0; i < n; i++) { n cin >> a; n cin >> before; n cin >> after; n if (after >= 2400 && before >= 2400 && after - before > 0) flag = true; n } n if (flag == true) n cout << YES ; n else n cout << NO ; n } n "} +{"func_code_string": "#include n #define pb push_back n #define int long long n using namespace std; n int p=998244353,tt,n,m,fac[25]; n void prepare(){ n fac[0]=1; n for(int i=1;i<25;i++){ n fac[i]=(fac[i-1]*i)%p; n } n } n int inv(int z){ n int s=p-2,t=z,ans=1; n while(s>0){ n if(s%2)ans=(ans*t)%p; n t=(t*t)%p; n s/=2; n } n return ans; n } n void solve(){ n prepare(); n cin>>n>>m; n int a[n+1][m+1],x=0; n for(int i=1;i<=n;i++){ n for(int j=1;j<=m;j++){ n cin>>a[i][j]; n } n } n for(int i=1;i<=m;i++){ n vector v; n for(int j=1;j<=n;j++)v.pb(a[j][i]); n sort(v.begin(),v.end()); n int c=1; n for(int i=0;i>tt; n //while(tt--) n solve(); n }"} +{"func_code_string": "#include n using namespace std; n const int maxn = 5e4 + 10, mod = 1e9 + 9, maxa = 1e6 + 100; n long long sta = 0; n const long long inf = 2e18 + 13; n long long max(long long x, long long y) { return (x > y ? x : y); } n long long min(long long x, long long y) { return (x < y ? x : y); } n long long pw(long long x, long long y) { n if (!y) { n return 1; n } n long long res = pw(x, y / 2); n res *= res; n res %= mod; n if (y & 1) { n res *= x; n } n return res % mod; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n, m; n cin >> n >> m; n long long ans = 1; n for (int i = 1; i <= n; i++) { n ans = ans * (pw(2, m) - i); n ans += mod; n ans %= mod; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, tx, ty; n vector > ar; n int vis[100010]; n bool check(int first, int second, int x1, int y1, int x2, int y2) { n if ((1LL * x2 - 1LL * x1) * 1LL * (1LL * second - 1LL * y1) == n (1LL * y2 - 1LL * y1) * 1LL * (1LL * first - 1LL * x1)) n return true; n return false; n } n int main(int argc, char const *argv[]) { n scanf( %d , &n); n ar.clear(); n for (int i = 0; i < n; i++) { n scanf( %d%d , &tx, &ty); n ar.push_back({tx, ty}); n } n if (n == 1) { n cout << YES n ; n } else if (n == 2) { n cout << YES n ; n } else { n memset(vis, 0, sizeof(vis)); n for (int i = 0; i < n; i++) { n if (check(ar[i].first, ar[i].second, ar[0].first, ar[0].second, n ar[1].first, ar[1].second)) { n vis[i] = 1; n } n } n int x1, y1, x2, y2, flag = 0, hold1, hold2; n for (int j = 0; j < n; j++) { n if (!vis[j]) { n flag++; n x1 = ar[j].first; n y1 = ar[j].second; n vis[j] = 1; n hold1 = j; n break; n } n } n for (int j = 0; j < n; j++) { n if (!vis[j]) { n flag++; n x2 = ar[j].first; n y2 = ar[j].second; n int fgh = 1; n if (check(ar[0].first, ar[0].second, x1, y1, x2, y2) || n check(ar[1].first, ar[1].second, x1, y1, x2, y2)) { n fgh = 0; n hold2 = j; n continue; n } n if (fgh) { n vis[j] = 1; n hold2 = j; n } n break; n } n } n vis[hold2] = 1; n if (flag == 0 || flag == 1) { n cout << YES n ; n } else { n for (int i = 0; i < n; i++) { n if (check(ar[i].first, ar[i].second, x1, y1, x2, y2)) { n vis[i] = 1; n } n } n flag = 0; n for (int i = 0; i < n; i++) { n if (!vis[i]) { n flag = 1; n } n } n if (!flag) n cout << YES n ; n else { n memset(vis, 0, sizeof(vis)); n for (int i = 0; i < n; i++) { n if (check(ar[i].first, ar[i].second, ar[0].first, ar[0].second, x1, n y1)) n vis[i] = 1; n else if (check(ar[i].first, ar[i].second, ar[1].first, ar[1].second, n x2, y2)) n vis[i] = 1; n } n flag = 0; n for (int i = 0; i < n; i++) { n if (!vis[i]) { n flag = 1; n } n } n if (!flag) { n cout << YES n ; n } else { n memset(vis, 0, sizeof(vis)); n for (int i = 0; i < n; i++) { n if (check(ar[i].first, ar[i].second, ar[0].first, ar[0].second, x2, n y2)) n vis[i] = 1; n else if (check(ar[i].first, ar[i].second, ar[1].first, ar[1].second, n x1, y1)) n vis[i] = 1; n } n flag = 0; n for (int i = 0; i < n; i++) { n if (!vis[i]) { n flag = 1; n } n } n if (flag) n cout << NO n ; n else n cout << YES n ; n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long K, B, N, T; n int main() { n cin >> K >> B >> N >> T; n if (K == 1 && 1 + N * B >= T) { n cout << (int)ceil((1 + N * B - T) / (1.0 * B)) << endl; n return 0; n } n if (K == 1) { n cout << 0 << endl; n return 0; n } n long long C = 1, counter = N + 1; n double thres = 1.0 * (T * (K - 1) + B) / (K - 1 + B); n for (int i = 1; i <= N; i++) { n C *= K; n if (C > thres) { n counter = i; n break; n } n } n counter--; n cout << N - counter << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char buff[100000], *pb; n int readInt() { n int num = 0; n while (*pb && isdigit(*pb)) { n num = num * 10 + (*pb - 0 ); n ++pb; n } n return num; n } n int nextChar() { n int c = 0 ; n if (*pb) { n c = *pb; n pb++; n } n return c; n } n int hasNext() { return *pb ? 1 : 0; } n int main(void) { n int n; n scanf( %i n , &n); n int nextId = 1; n map, int> SId; n vector deg(n + 1); n vector>> S(n + 1); n vector> H(n + 1); n for (int i = 1; i <= n; i++) { n scanf( %s , buff); n pb = buff; n while (hasNext()) { n int k = readInt(); n assert(nextChar() == : ); n vector s; n while (hasNext()) { n s.push_back(readInt()); n if (nextChar() == - ) { n break; n } n } n assert(s.size() == k); n sort(begin(s), end(s)); n S[i].push_back(s); n deg[i]++; n if (!SId.count(s)) { n SId[s] = nextId++; n } n H[i].push_back(SId[s]); n } n } n vector> sh = H; n for (vector &s : sh) { n sort(s.begin(), s.end()); n } n vector from, to; n vector proc(n + 1); n queue Q; n for (int i = 1; i <= n; i++) { n if (deg[i] == 1) { n proc[i] = 1; n Q.push(i); n } n } n vector tree_deg(n + 1); n map root; n set seen; n while (!Q.empty()) { n int u = Q.front(); n Q.pop(); n vector sub = {u}; n for (int j = 0; j < H[u].size(); j++) { n int id = H[u][j]; n if (seen.count(id)) { n from.push_back(u); n to.push_back(root[id]); n tree_deg[root[id]]++; n for (auto e : S[u][j]) { n sub.push_back(e); n } n } n } n sort(begin(sub), end(sub)); n int id = SId[sub]; n seen.insert(id); n root[id] = u; n for (int i = 1; i <= n; i++) n if (!proc[i]) { n if (binary_search(begin(sh[i]), end(sh[i]), id)) { n deg[i]--; n if (deg[i] <= 1) { n proc[i] = 1; n Q.push(i); n } n } n } n } n bool ok = true; n for (int d : tree_deg) { n if (d > 1) { n ok = false; n } n } n if (ok && int(from.size()) == n - 1) { n printf( %i n , n - 1); n for (int i = 0; i < n - 1; i++) { n printf( %i %i n , from[i], to[i]); n } n } else { n puts( -1 ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int a, b, c, d; n cin >> a >> b >> c >> d; n if (min(a, b) + min(c, d) == max(a, b) && max(a, b) == max(c, d)) { n cout << YES n ; n } else { n cout << NO n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base ::sync_with_stdio(0); n cin.tie(0); n ; n long long int t; n cin >> t; n while (t--) { n string s; n cin >> s; n long long int a[26] = {0}; n long long int cnt = 0; n char c; n int i = 0; n while (i < s.length()) { n cnt = 0; n c = s[i]; n while (s[i] == c && i < s.length()) { n cnt++; n i++; n } n if (cnt % 2 != 0) { n a[c - a ] = 1; n } n } n string ans = ; n for (i = 0; i < 26; i++) { n if (a[i] == 1) { n ans += (i + a ); n } n } n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int check(string st) { n int s1 = 0, s2 = 0; n for (int i = 1; i < st.length(); i++) { n if (st[i] == 1 && i % 2 == 1) s1++; n if (st[i] == 1 && i % 2 == 0) s2++; n if (s1 - s2 > 5 - i / 2 || (i % 2 == 1 && s2 - s1 >= 5 - i / 2) || n (i % 2 == 0 && s2 - s1 > 5 - i / 2)) n return i; n } n return 10; n }; n int main() { n int t; n cin >> t; n while (t--) { n string st; n cin >> st; n st = + st; n string sts = st; n for (int i = 1; i < st.length(); i++) n if (st[i] == ? ) n if (i % 2 == 1) n st[i] = 1 ; n else n st[i] = 0 ; n for (int i = 1; i < sts.length(); i++) n if (sts[i] == ? ) n if (i % 2 == 0) n sts[i] = 1 ; n else n sts[i] = 0 ; n cout << min(check(st), check(sts)) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n #pragma warning(disable : 4996) n using namespace std; n using ld = long double; n template n using Table = vector>; n const ld eps = 1e-9; n template n ostream &operator<<(ostream &os, const pair v) { n os << ( << v.first << , << v.second << ) ; n return os; n } n template n ostream &operator<<(ostream &os, const vector &v) { n for (int i = 0; i < v.size(); i++) { n if (i > 0) { n os << ; n } n os << v[i]; n } n return os; n } n template n ostream &operator<<(ostream &os, const vector> &v) { n for (int i = 0; i < v.size(); i++) { n if (i > 0) { n os << endl; n } n os << v[i]; n } n return os; n } n template n ostream &operator<<(ostream &os, const vector> &v) { n for (int i = 0; i < v.size(); i++) { n if (i > 0) { n os << endl; n } n os << v[i]; n } n return os; n } n template n ostream &operator<<(ostream &os, const set &v) { n int i = 0; n for (auto it : v) { n if (i > 0) { n os << ; n } n os << it; n i++; n } n return os; n } n const int INF = 2147483647; n const long long int L_INF = 9223372036854775807; n struct Edge { n int src, dst; n int weight; n Edge(int src, int dst, int weight) : src(src), dst(dst), weight(weight) {} n }; n bool operator<(const Edge &e, const Edge &f) { n return e.weight != f.weight ? e.weight > f.weight n : e.src != f.src ? e.src < f.src n : e.dst < f.dst; n } n int maximumFlow(const vector> &ag, int s, int t) { n vector> g(ag); n for (int i = 0; i < ag.size(); ++i) { n for (int j = 0; j < ag[i].size(); ++j) { n int d = ag[i][j].dst; n int s = ag[i][j].src; n bool ok = false; n for (int k = 0; k < ag[d].size(); ++k) { n if (ag[d][k].src == s) { n ok = true; n break; n } n } n if (!ok) { n g[d].push_back(Edge(d, s, 0)); n } n } n } n int n = g.size(); n vector> flow(n, vector(n)), capacity(n, vector(n)); n for (int u = 0; u < (int)n; ++u) n for (auto e = (g[u]).begin(); e != (g[u]).end(); ++e) n capacity[e->src][e->dst] += e->weight; n int total = 0; n while (1) { n queue Q; n Q.push(s); n vector prev(n, -1); n prev[s] = s; n while (!Q.empty() && prev[t] < 0) { n int u = Q.front(); n Q.pop(); n for (auto e = (g[u]).begin(); e != (g[u]).end(); ++e) n if (prev[e->dst] < 0 && (capacity[u][e->dst] - flow[u][e->dst]) > 0) { n prev[e->dst] = u; n Q.push(e->dst); n } n } n if (prev[t] < 0) break; n int inc = INF; n for (int j = t; prev[j] != j; j = prev[j]) n inc = min(inc, (capacity[prev[j]][j] - flow[prev[j]][j])); n for (int j = t; prev[j] != j; j = prev[j]) n flow[prev[j]][j] += inc, flow[j][prev[j]] -= inc; n total += inc; n } n return total; n } n using ll = long long int; n int dx[] = {-1, 0, 1, 0}; n int dy[] = {0, 1, 0, -1}; n int N, T; n vector> get_time(const vector> &canmove, int sy, int sx, n vector> c_times) { n vector> times(N, vector(N, 100000)); n if (c_times.empty()) { n c_times = times; n } n times[sy][sx] = 0; n queue> que; n que.emplace(sx, sy); n while (!que.empty()) { n auto p(que.front()); n que.pop(); n int x = p.first; n int y = p.second; n if (c_times[y][x] == times[y][x]) continue; n for (int way = 0; way < 4; ++way) { n int nx = x + dx[way]; n int ny = y + dy[way]; n if (nx >= 0 && nx < N && ny >= 0 && ny < N) { n if (canmove[ny][nx] != false) { n if (times[ny][nx] > times[y][x] + 1 && n c_times[ny][nx] >= times[y][x] + 1) { n times[ny][nx] = times[y][x] + 1; n que.emplace(nx, ny); n } n } n } n } n } n return times; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(); n cin >> N >> T; n vector> canmove(N, vector(N, true)); n vector> ins(N, vector(N)), outs(N, vector(N)); n vector in_sts(N), out_sts(N); n int collapt_x, collapt_y; n for (int i = 0; i < N; ++i) { n cin >> in_sts[i]; n for (int j = 0; j < N; ++j) { n if (in_sts[i][j] == Y ) { n canmove[i][j] = false; n } else if (in_sts[i][j] == Z ) { n canmove[i][j] = false; n } else { n ins[i][j] = in_sts[i][j] - 0 ; n } n } n } n for (int i = 0; i < N; ++i) { n cin >> out_sts[i]; n for (int j = 0; j < N; ++j) { n if (out_sts[i][j] == Y ) { n } else if (out_sts[i][j] == Z ) { n collapt_x = j; n collapt_y = i; n } else { n outs[i][j] = out_sts[i][j] - 0 ; n } n } n } n vector> collapt_times = n get_time(canmove, collapt_y, collapt_x, vector>(0)); n vector>>> oks( n N, n vector>>(N, vector>(N, vector(N)))); n const int start = 0; n const int in_id = 1; n const int out_id = in_id + N * N; n const int goal = out_id + N * N; n vector> g(goal + 1); n for (int y = 0; y < N; ++y) { n for (int x = 0; x < N; ++x) { n g[start].push_back(Edge{start, in_id + y * N + x, ins[y][x]}); n g[out_id + y * N + x].push_back( n Edge{out_id + y * N + x, goal, outs[y][x]}); n } n } n for (int y = 0; y < N; ++y) { n for (int x = 0; x < N; ++x) { n auto atimes = get_time(canmove, y, x, collapt_times); n for (int ty = 0; ty < N; ++ty) { n for (int tx = 0; tx < N; ++tx) { n if (atimes[ty][tx] <= collapt_times[ty][tx] && atimes[ty][tx] <= T) { n oks[y][x][ty][tx] = true; n int aid = in_id + y * N + x; n int bid = out_id + ty * N + tx; n g[aid].push_back(Edge{aid, bid, 1000}); n } n } n } n } n } n int answer = maximumFlow(g, start, goal); n cout << answer << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ld = long double; n using pii = pair; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n, m, k, t; n cin >> n >> m >> k >> t; n vector waste(k); n for (int i = 0; i < k; ++i) { n cin >> waste[i].first >> waste[i].second; n --waste[i].first; n --waste[i].second; n } n sort(begin(waste), end(waste)); n vector> queries(t); n for (int i = 0; i < t; ++i) { n cin >> queries[i].first.first >> queries[i].first.second; n --queries[i].first.first; n --queries[i].first.second; n queries[i].second = i; n } n sort(begin(queries), end(queries)); n vector ans(t); n int ptr = 0; n for (auto& p : queries) { n pii pos = p.first; n int idx = p.second; n while (ptr < k and waste[ptr] < pos) { n ++ptr; n } n if (ptr < k and waste[ptr] == pos) { n ans[idx] = 3; n } else { n int tot = m * pos.first + pos.second; n tot -= ptr; n ans[idx] = tot % 3; n } n } n vector res = { Carrots , Kiwis , Grapes , Waste }; n for (int x : ans) cout << res[x] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector ad[100009]; n vector idx; n deque vec; n int cnt[100009]; n int ans[100009]; n vector > arr, arr2; n int val[100009]; n set s; n int main() { n int a, b, c, d, e, i, j, k, l, n, m, x, y, t, p, X; n scanf( %d , &t); n for (p = 1; p <= t; p++) { n scanf( %d%d%d , &n, &x, &y); n c = y - x; n m = n + 1; n arr.clear(); n arr2.clear(); n for (i = 0; i <= m; i++) { n cnt[i] = 0; n ad[i].clear(); n ans[i] = -1; n } n s.clear(); n for (i = 1; i <= n; i++) { n scanf( %d , &a); n val[i] = a; n cnt[a]++; n ad[a].push_back(i); n s.insert(i); n } n for (i = 1; i <= m; i++) { n if (cnt[i] == 0) { n X = i; n break; n } n } n if (c == 0) { n for (i = 1; i <= n; i++) { n if (x) { n ans[i] = val[i]; n x--; n } else { n ans[i] = X; n } n } n printf( YES n ); n for (i = 1; i <= n; i++) { n printf( %d , ans[i]); n } n printf( n ); n continue; n } n for (i = 1; i <= m; i++) { n if (cnt[i] > 0) { n arr.push_back({cnt[i], i}); n } n } n sort(arr.begin(), arr.end()); n m = arr.size(); n c = y - x; n for (i = 0; i < m; i++) { n if (c == 0) { n break; n } n b = c / (m - i); n if (c % (m - i) != 0) { n b++; n } n b = min(b, arr[i].first); n c -= b; n arr2.push_back({b, arr[i].second}); n } n sort(arr2.begin(), arr2.end()); n c = y - x; n m = arr2.size(); n if (m == 1) { n a = arr2[0].second; n l = arr2[0].first; n if (l > (n - cnt[a])) { n printf( NO n ); n continue; n } n b = l; n for (i = 1; i <= n; i++) { n if (val[i] != a && b > 0) { n ans[i] = a; n b--; n } n } n for (i = 0; i < l; i++) { n b = ad[a][i]; n ans[b] = X; n } n } else { n l = 0; n if (arr2[m - 1].first > (c - arr2[m - 1].first)) { n l = arr2[m - 1].first - (c - arr2[m - 1].first); n for (i = 0; i < m; i++) { n a = arr2[i].second; n b = arr2[i].first; n for (j = 0; j < b; j++) { n s.erase(ad[a][j]); n } n } n a = arr2[m - 1].second; n b = ad[a].size(); n for (j = 0; j < b; j++) { n s.erase(ad[a][j]); n } n b = s.size(); n if (l > b) { n printf( NO n ); n continue; n } n arr2[m - 1].first -= l; n a = arr2[m - 1].second; n for (i = 0; i < l; i++) { n d = *s.begin(); n s.erase(d); n ans[d] = a; n } n b = arr2[m - 1].first; n d = b + l; n for (i = b; i < d; i++) { n k = ad[a][i]; n ans[k] = X; n } n } n vec.clear(); n idx.clear(); n for (i = 0; i < m; i++) { n a = arr2[i].second; n b = arr2[i].first; n if (i == m - 1) { n for (j = 0; j < b; j++) { n vec.push_front(a); n } n } else { n for (j = 0; j < b; j++) { n vec.push_back(a); n } n } n for (j = 0; j < b; j++) { n idx.push_back(ad[a][j]); n } n } n d = idx.size(); n for (i = 0; i < d; i++) { n a = idx[i]; n ans[a] = vec[i]; n } n } n for (i = 1; i <= n; i++) { n if (ans[i] == -1) { n if (x) { n ans[i] = val[i]; n x--; n } else { n ans[i] = X; n } n } n } n if (x > 0) { n printf( NO n ); n continue; n } n printf( YES n ); n for (i = 1; i <= n; i++) { n printf( %d , ans[i]); n } n printf( n ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n; n cin >> n; n int nums[n]; n for (int i = 0; i < n; i++) { n cin >> nums[i]; n } n for (int i = 0; i < n - 1; i++) { n if (nums[i] < 0) { n cout << NO ; n return 0; n } n if (nums[i] % 2 == 1) { n nums[i + 1] -= 1; n } n } n if (nums[n - 1] >= 0 && nums[n - 1] % 2 == 0) { n cout << YES ; n } else { n cout << NO ; n } n return 0; n } n "} +{"func_code_string": "#include n void rd(int &x) { n x = 0; n int f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch <= 9 && ch >= 0 ) x = x * 10 + ch - 0 , ch = getchar(); n x *= f; n } n void lrd(long long &x) { n x = 0; n int f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch <= 9 && ch >= 0 ) x = x * 10 + ch - 0 , ch = getchar(); n x *= f; n } n const int INF = 1e9; n const long long LINF = 1e18; n const int mod = 998244353; n const int N = 3e5 + 10; n using namespace std; n int n; n int fi[N], nxt[N << 1], to[N << 1], tot; n void link(int x, int y) { n nxt[++tot] = fi[x]; n fi[x] = tot; n to[tot] = y; n } n int f[N][3]; n void dfs(int x) { n f[x][0] = f[x][1] = f[x][2] = 1; n int cnt = 1; n int ghb = 1; n for (int i = fi[x]; i; i = nxt[i]) { n if (f[to[i]][0]) continue; n dfs(to[i]); n cnt = cnt * 2 % mod; n int tmp; n tmp = (1ll * f[to[i]][0] * 2 + f[to[i]][1] + f[to[i]][2]) % mod; n f[x][0] = 1ll * f[x][0] * tmp % mod; n f[x][1] = 1ll * f[x][1] * (1ll * 2 * f[to[i]][0] + f[to[i]][1]) % mod; n ghb = 1ll * ghb * (f[to[i]][0] + f[to[i]][1]) % mod; n f[x][2] = 1ll * f[x][2] * (1ll * f[to[i]][0] * 2 + f[to[i]][1]) % mod; n } n f[x][1] = (f[x][1] - ghb + mod) % mod; n } n int main() { n rd(n); n for (int i = 1; i < n; i++) { n int x, y; n rd(x); n rd(y); n link(x, y); n link(y, x); n } n dfs(1); n printf( %d n , (f[1][0] + f[1][1] - 1) % mod); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 200005; n int dr8[] = {0, 0, 1, -1, 1, 1, -1, -1}; n int dc8[] = {1, -1, 0, 0, -1, 1, -1, 1}; n int dr4[] = {0, 1, -1, 0}; n int dc4[] = {1, 0, 0, -1}; n int n; n int a[N]; n set > s; n set end_idx; n int sz[N]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i + 1]; n } n int c = 1; n for (int i = 2; i <= n; i++) { n if (a[i] != a[i - 1]) { n s.insert({-c, i - 1}); n end_idx.insert(i - 1); n sz[i - 1] = c; n c = 1; n } else n c++; n } n s.insert({-c, n}); n end_idx.insert(n); n sz[n] = c; n int ans = 0; n while (!s.empty()) { n auto it = *s.begin(); n s.erase(s.begin()); n end_idx.erase(it.second); n ans++; n auto idx = end_idx.lower_bound(it.second); n if (idx != end_idx.begin() && idx != end_idx.end()) { n int rgt = *idx; n idx--; n int lft = *idx; n if (a[lft] == a[rgt]) { n s.erase(s.find({-sz[lft], lft})); n s.erase(s.find({-sz[rgt], rgt})); n end_idx.erase(lft); n sz[rgt] += sz[lft]; n s.insert({-sz[rgt], rgt}); n } n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = (107); n const int inf = (int)1e9 + 42; n struct aho_corasick { n int is_end[MAXN], link[MAXN], psz; n map to[MAXN]; n void clear() { n for (int i = 0; i < psz; i++) is_end[i] = 0, link[i] = 0, to[i].clear(); n psz = 1; n is_end[0] = 1; n } n aho_corasick() { n psz = MAXN - 2; n clear(); n } n void add_word(string s) { n int u = 0; n for (char c : s) { n if (!to[u].count(c)) to[u][c] = psz++; n u = to[u][c]; n } n is_end[u] = 1; n } n void push_links() { n queue Q; n int u, v, j; n char c; n Q.push(0); n link[0] = -1; n while (!Q.empty()) { n u = Q.front(); n Q.pop(); n for (auto it : to[u]) { n v = it.second; n c = it.first; n j = link[u]; n while (j != -1 && !to[j].count(c)) j = link[j]; n if (j != -1) n link[v] = to[j][c]; n else n link[v] = 0; n Q.push(v); n } n } n } n }; n int n, m; n string s1, s2, virus; n void read() { n cin >> s1; n cin >> s2; n cin >> virus; n n = s1.size(); n m = s2.size(); n } n aho_corasick aho; n bool is_bad[MAXN]; n int dp[MAXN][MAXN][MAXN]; n int nxt_i[MAXN][MAXN][MAXN]; n int nxt_j[MAXN][MAXN][MAXN]; n int nxt_state[MAXN][MAXN][MAXN]; n int rec(int i, int j, int state) { n if (i >= n + 1) return -inf; n if (j >= m + 1) return -inf; n if (is_bad[state]) return -inf; n if (i == n && j == m) return 0; n int &memo = dp[i][j][state]; n if (memo != -1) return memo; n memo = -inf; n if (i < n && j < m && s1[i] == s2[j]) { n int u = state; n while (u != -1 && !aho.to[u].count(s1[i])) u = aho.link[u]; n if (u == -1) n u = 0; n else n u = aho.to[u][s1[i]]; n memo = max(memo, 1 + rec(i + 1, j + 1, u)); n nxt_state[i][j][state] = u; n nxt_i[i][j][state] = i + 1; n nxt_j[i][j][state] = j + 1; n } n if (memo < rec(i + 1, j, state)) { n memo = max(memo, rec(i + 1, j, state)); n nxt_state[i][j][state] = state; n nxt_i[i][j][state] = i + 1; n nxt_j[i][j][state] = j; n } n if (memo < rec(i, j + 1, state)) { n memo = max(memo, rec(i, j + 1, state)); n nxt_state[i][j][state] = state; n nxt_i[i][j][state] = i; n nxt_j[i][j][state] = j + 1; n } n return memo; n } n void solve() { n aho.clear(); n aho.add_word(virus); n aho.push_links(); n int u = 0; n for (char c : virus) u = aho.to[u][c]; n is_bad[u] = true; n for (int i = 0; i < aho.psz; i++) { n int u = i; n while (u != -1) { n is_bad[i] |= is_bad[u]; n u = aho.link[u]; n } n } n memset(dp, -1, sizeof(dp)); n int ret = rec(0, 0, 0); n if (!ret) n cout << 0 << n ; n else { n string ans = ; n int c_i = 0, c_j = 0, c_state = 0, last_i, last_j, last_state; n while (!(c_i == n && c_j == m)) { n last_i = c_i; n last_j = c_j; n last_state = c_state; n c_i = nxt_i[last_i][last_j][last_state]; n c_j = nxt_j[last_i][last_j][last_state]; n c_state = nxt_state[last_i][last_j][last_state]; n if (c_i - last_i && c_j - last_j) ans.push_back(s1[last_i]); n } n cout << ans << n ; n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n read(); n solve(); n return 0; n } n "} +{"func_code_string": "#include n char s[100][100]; n int main() { n int n, m, ans = 0; n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); n for (int i = 1; i < n; i++) { n for (int j = i + 1; j <= n; j++) { n int f = 0, g = 0; n for (int k = 1; k <= m; k++) n if (s[i][k] != . || s[j][k] != . ) { n if (s[i][k] == s[j][k]) n f = 1; n else n g = 1; n } n if (f == g && f) { n printf( No ); n return 0; n } n } n } n printf( Yes ); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n long long n, d; n cin >> n >> d; n if (n >= d) n cout << YES << endl; n else { n double i = 1, cnt = 0; n while (i <= n) { n int y = ceil(d / (i + 1)) + i; n if (y <= n) { n cout << YES << endl; n ++cnt; n break; n } n ++i; n } n if (cnt == 0) cout << NO << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n int arr[n]; n for (int i = 0; i < n; i++) cin >> arr[i]; n sort(arr, arr + n); n bool flag = 1; n for (int i = 1; i < n; i++) { n if (arr[i] - arr[i - 1] > 1) { n flag = 0; n } n } n if (flag) n cout << Yes << endl; n else n cout << No << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 100, PI = 3.14159265359, M = 1e9 + 7; n long long a[N], ans = 1; n int main() { n long long n; n cin >> n; n long long x = 0, y = 0; n for (int i = 0; i < n; i++) { n long long a, b; n cin >> a >> b; n long long t1 = a - x, t2 = b - x; n if (x == y) { n ans += min(a, b) - x; n } else if (x < y) { n if (y <= a) { n x = y; n ans += min(a, b) - x + 1; n } n } else if (x > y) { n if (x <= b) { n y = x; n ans += min(a, b) - x + 1; n } n } n x = a, y = b; n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 40; n int a[maxN][maxN]; n int b[maxN][maxN]; n int flips[maxN][maxN]; n int n, x; n int check(int mask) { n memset(flips, 0, sizeof(flips)); n for (int i = 0; i < x; ++i) { n if (mask & (1 << i)) { n flips[x - 1][i] = 1; n } n } n for (int i = 0; i + 1 < x; ++i) { n for (int j = 0; j < x; ++j) { n flips[i + x][j] = flips[i][j] ^ flips[x - 1][j]; n } n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j + 1 < x; ++j) { n flips[i][j + x] = flips[i][j] ^ flips[i][x - 1]; n } n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < n; ++j) { n b[i][j] = a[i][j]; n if (flips[i][j]) { n b[i][j] = -b[i][j]; n } n } n } n int res = 0; n for (int i = 0; i < n; ++i) { n res += b[x - 1][i]; n } n for (int i = 0; i + 1 < x; ++i) { n for (int j = 0; j < n; ++j) { n b[i][j] += b[i + x][j]; n } n } n for (int i = 0; i + 1 < x; ++i) { n int cres1 = 0, cres2 = 0; n for (int j = 0; j + 1 < x; ++j) { n cres1 += abs(b[i][j] + b[i][j + x]); n cres2 += abs(b[i][j] - b[i][j + x]); n } n res += max(cres1 + b[i][x - 1], cres2 - b[i][x - 1]); n } n return res; n } n int solve(vector > a) { n for (int i = 0; i < n; ++i) { n for (int j = 0; j < n; ++j) { n ::a[i][j] = a[i][j]; n } n } n x = (n + 1) / 2; n int res = -1000000000LL; n for (int i = 0; i < (1 << x); ++i) { n res = max(res, check(i)); n } n return res; n } n int main() { n scanf( %d , &n); n vector > a(n, vector(n)); n for (int i = 0; i < n; ++i) { n for (int j = 0; j < n; ++j) { n scanf( %d , &a[i][j]); n } n } n cout << solve(a) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n long long int str, in, ex, z; n cin >> str >> in >> ex; n if (str + ex - in <= 0) { n cout << 0 << endl; n } else { n if (ex + in < str) { n z = ex + 1; n } else { n z = ex; n } n if ((str + ex - in) % 2 == 0) { n cout << min(((str + ex - in) / 2), z) << endl; n } else { n cout << min((((str + ex - in) / 2) + 1), z) << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k; n long long S[1000000] = {}; n int main() { n cin >> n >> k; n for (long long i = 0; i < n; i++) { n string s; n cin >> s; n S[s.size()]++; n } n string s; n cin >> s; n long long pass = s.size(); n long long sum1 = 1, sum2 = 0; n for (long long i = 0; i < pass; i++) { n sum1 += S[i]; n sum2 += S[i]; n } n sum2 += S[pass]; n cout << sum1 + ((sum1 - 1) / k) * 5 << << sum2 + ((sum2 - 1) / k) * 5 n << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long exp(long long x, long long y, long long p) { n long long res = 1; n while (y) { n if (y % 2) res = (res * x % p) % p; n x = (x * x) % p; n y /= 2; n } n return res; n } n long long exp(long long x, long long y) { n long long res = 1; n while (y) { n if (y % 2) res = (res * x); n x = (x * x); n y /= 2; n } n return res; n } n long long a[100]; n int main() { n long long n, m; n cin >> n >> m; n long long a[n]; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n } n if (n > m) n cout << 0 << endl; n else { n long long sum = 1; n for (long long i = 0; i < n; i++) { n for (long long j = i + 1; j < n; j++) { n sum = sum * abs(a[i] - a[j]); n sum = sum % m; n } n } n cout << sum % m; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 500010; n int A[N]; n const int S = 250; n int sum[S][S]; n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n int Q; n cin >> Q; n while (Q--) { n int t, x, y; n cin >> t >> x >> y; n if (t == 1) { n A[x] += y; n for (int m = 1; m < S; m++) { n sum[m][x % m] += y; n } n } else { n int ans = 0; n if (x < S) { n ans = sum[x][y]; n } else { n for (int i = y; i < N; i += x) { n ans += A[i]; n } n } n cout << ans << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Point { n public: n int x, y; n bool operator<(const Point &a) const { n if (x != a.x) return x < a.x; n return y < a.y; n } n } tem; n set p; n set xSet; n set ySet; n bool f() { n if (xSet.size() != 3 || ySet.size() != 3 || p.size() != 8) return false; n set::iterator p1; n set::iterator p2; n int cn = 0; n for (p1 = xSet.begin(); p1 != xSet.end(); p1++) { n for (p2 = ySet.begin(); p2 != ySet.end(); p2++) { n cn++; n if (cn == 5) continue; n tem.x = *p1; n tem.y = *p2; n if (p.find(tem) == p.end()) return false; n } n } n return true; n } n int main(int argc, char **argv) { n int i, a, b; n for (i = 0; i < 8; i++) { n scanf( %d%d , &a, &b); n tem.x = a; n tem.y = b; n xSet.insert(a); n ySet.insert(b); n p.insert(tem); n } n printf( %s n , (f() ? respectable : ugly )); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector a(n); n vector b(n); n string aans = string(n / 2, 1 ) + string((n + 1) / 2, 0 ); n string bans = string(n / 2, 1 ) + string((n + 1) / 2, 0 ); n for (int i = 0; i < n; i++) { n cin >> a[i]; n cin >> b[i]; n } n if (n % 2) { n if (a[n / 2] < b[n / 2]) n aans[n / 2] = 1 ; n else n bans[n / 2] = 1 ; n } n int bpoint = 0; n int apoint = 0; n for (int i = 0; i < n; i++) { n if (a[apoint] < b[bpoint]) { n aans[apoint] = 1 ; n apoint++; n } else { n bans[bpoint] = 1 ; n bpoint++; n } n } n cout << aans << n << bans; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string str; n int c1, c2, c3; n c1 = c2 = c3 = 0; n cin >> str; n for (int i = 0; i < str.length(); i++) { n if (str[i] == + ) { n str.erase(i, 1); n i--; n } n } n for (int i = 0; i < str.length(); i++) { n if (str[i] == 1 ) n c1++; n else if (str[i] == 2 ) n c2++; n else n c3++; n } n if (c1 == 0) { n if (c2 == 0) { n if (c3 == 0) n cout << ; n else { n cout << 3 ; n for (int i = 0; i < c3 - 1; i++) { n cout << +3 ; n } n } n } else { n if (c3 == 0) { n cout << 2 ; n for (int i = 0; i < c2 - 1; i++) { n cout << +2 ; n } n } else { n cout << 2 ; n for (int i = 0; i < c2 - 1; i++) { n cout << +2 ; n } n for (int i = 0; i < c3; i++) { n cout << +3 ; n } n } n } n } else { n cout << 1 ; n for (int i = 0; i < c1 - 1; i++) { n cout << +1 ; n } n if (c2 == 0) { n if (c3 == 0) n cout << ; n else { n for (int i = 0; i < c3; i++) { n cout << +3 ; n } n } n } else { n if (c3 == 0) { n for (int i = 0; i < c2; i++) { n cout << +2 ; n } n } else { n for (int i = 0; i < c2; i++) { n cout << +2 ; n } n for (int i = 0; i < c3; i++) { n cout << +3 ; n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000007; n const int dx[8] = {0, -1, 0, 1, -1, -1, 1, 1}, n dy[8] = {1, 0, -1, 0, -1, 1, -1, 1}; n int a[100005]; n int cnt = 0; n int n, m, k; n vector vt[100005], vt2[2]; n stack st; n int dfn[100005], color[100005]; n void dfs(int x, int fa) { n st.push(x); n dfn[x] = st.size(); n for (int i = 0; i < vt[x].size(); i++) { n int v = vt[x][i]; n if (v == fa) continue; n if (!dfn[v]) { n dfs(v, x); n } else if (dfn[x] - dfn[v] + 1 <= k && dfn[x] > dfn[v]) { n cout << 2 << endl; n cout << dfn[x] - dfn[v] + 1 << endl; n while (1) { n cout << st.top() << ; n if (st.top() == v) { n exit(0); n } n st.pop(); n } n } n } n st.pop(); n } n void dfs2(int x, int fa, int co) { n vt2[co].push_back(x); n color[x] = co; n if (vt2[co].size() == k) { n for (int i = 0; i < vt2[co].size(); i++) { n cout << vt2[co][i] << ; n } n exit(0); n } n for (int i = 0; i < vt[x].size(); i++) { n int v = vt[x][i]; n if (v == fa || color[v] != -1) continue; n dfs2(v, x, co ^ 1); n } n } n void solve() { n memset(color, -1, sizeof color); n cin >> n >> m >> k; n for (int i = 1; i <= m; i++) { n int x, y; n cin >> x >> y; n vt[x].push_back(y); n vt[y].push_back(x); n } n dfs(1, 0); n k = (k + 1) / 2; n cout << 1 << endl; n dfs2(1, 0, 0); n } n int main() { n ios::sync_with_stdio(0); n ; n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9; n struct Edge { n int to, cap, flow; n }; n struct Graph { n int n; n vector > e; n vector edges; n vector d, c; n Graph() {} n Graph(int _n) { n n = _n; n e.resize(n); n } n void addEdge(int from, int to, int cap) { n e[from].push_back(edges.size()); n edges.push_back(Edge({to, cap, 0})); n e[to].push_back(edges.size()); n edges.push_back(Edge({from, 0, 0})); n } n bool bfs() { n d.assign(n, INF); n c.assign(n, 0); n vector q(n); n int qL = 0, qR = 0; n d[0] = 0; n q[qR++] = 0; n while (qL < qR) { n int v = q[qL++]; n for (int i = 0; i < (int)e[v].size(); i++) { n Edge cur = edges[e[v][i]]; n if (d[cur.to] > d[v] + 1 && cur.flow < cur.cap) { n d[cur.to] = d[v] + 1; n q[qR++] = cur.to; n } n } n } n return d[n - 1] != INF; n } n int dfs(int v, int flow) { n if (v == n - 1) return flow; n if (flow == 0) return 0; n for (int &i = c[v]; i < (int)e[v].size(); i++) { n Edge cur = edges[e[v][i]]; n if (d[cur.to] != d[v] + 1) continue; n int pushed = dfs(cur.to, min(flow, cur.cap - cur.flow)); n if (pushed > 0) { n edges[e[v][i]].flow += pushed; n edges[e[v][i] ^ 1].flow -= pushed; n return pushed; n } n } n return 0; n } n long long flow() { n long long flow = 0; n while (bfs()) { n while (int pushed = dfs(0, INF)) { n flow += pushed; n } n } n return flow; n } n }; n int main() { n int n, m, h; n while (cin >> n >> h >> m) { n vector l(m), r(m), x(m), c(m); n for (int i = 0; i < m; i++) { n cin >> l[i] >> r[i] >> x[i] >> c[i]; n x[i]++; n l[i]--; n r[i]--; n } n Graph gr(1 + n * (h + 1) + m + 1); n int sz = gr.n; n long long sum = 0; n for (int i = 0; i < n; i++) { n for (int j = 1; j <= h; j++) { n gr.addEdge(1 + i * (h + 1) + (j - 1), 1 + i * (h + 1) + j, INF); n gr.addEdge(1 + i * (h + 1) + j, sz - 1, 2 * j - 1); n sum += 2 * j - 1; n } n } n for (int i = 0; i < m; i++) { n if (x[i] > h) continue; n for (int t = l[i]; t <= r[i]; t++) { n gr.addEdge(1 + n * (h + 1) + i, 1 + t * (h + 1) + x[i], INF); n } n gr.addEdge(0, 1 + n * (h + 1) + i, c[i]); n } n cout << sum - gr.flow() << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int cnt = 0; n while (n--) { n int p, q; n cin >> p >> q; n if ((q - p) >= 2) cnt++; n } n cout << cnt << n ; n } n "} +{"func_code_string": "#include n using namespace std; n char s[4005], t[4005], ax[4005]; n int main() { n scanf( %s%s , s, t); n int n = strlen(s), m = strlen(t), ret = m; n for (int i = n - 1; i >= 0; i--) s[i + m] = s[i], s[i] = 0; n n += m; n for (int i = 0; i < n; i++) { n int ct = 0; n for (int j = 0; j < m; j++) { n if (i + j >= n || s[i + j] != t[j]) ct++; n } n ret = min(ret, ct); n ct = 0; n for (int j = 0; j < m; j++) { n if (i - j < 0 || s[i - j] != t[m - 1 - j]) ct++; n } n ret = min(ret, ct); n } n printf( %d n , ret); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 1000000007; n const int MM = 998244353; n const long double PI = acos(-1); n const long long INF = 2e18; n template n void amax(T &a, T1 b) { n if (b > a) a = b; n } n template n void amin(T &a, T1 b) { n if (b < a) a = b; n } n long long power(long long b, long long e) { n if (e == 0) return 1; n if (e & 1) return b * power(b * b, e / 2); n return power(b * b, e / 2); n } n long long power(long long b, long long e, long long m) { n if (e == 0) return 1; n if (e & 1) return b * power(b * b % m, e / 2, m) % m; n return power(b * b % m, e / 2, m); n } n long long modinv(long long a, long long m) { return power(a, m - 2, m); } n int TLE_TERROR() { n long long n, p, f = 0, zz = -1; n cin >> n >> p; n string s; n cin >> s; n if (p == 1) { n cout << NO ; n return 0; n } n if (p == 2) { n if (n > 2) n cout << NO ; n else if (n == 1) { n if (s[0] == a ) n cout << b ; n else n cout << NO ; n } else { n if (s == ab ) n cout << ba ; n else n cout << NO ; n } n return 0; n } n for (long long i = n - 1; i >= 0; i--) { n char z = s[i]; n while ((z - a + 1) < p) { n z++; n if (i > 0 && z == s[i - 1]) continue; n if (i > 1 && z == s[i - 2]) continue; n long long q = n - i; n s[i] = z; n f = 1; n zz = i; n break; n } n if (f == 1) break; n } n if (f == 0) n cout << NO ; n else { n for (long long i = zz + 1; i < n; i++) { n if (i > 1) { n if (s[i - 1] != a && s[i - 2] != a ) n s[i] = a ; n else if (s[i - 1] != b && s[i - 2] != b ) n s[i] = b ; n else n s[i] = c ; n } else { n if (s[i - 1] != a ) n s[i] = a ; n else if (s[i - 1] != b ) n s[i] = b ; n else n s[i] = c ; n } n } n cout << s; n } n return 0; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n long long int TESTS = 1; n while (TESTS--) TLE_TERROR(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long bit[65], f[65][120][2]; n inline long long dp(long long s, int tot, int h1, int h2) { n memset(f, 0, sizeof f); n f[0][0][0] = 1; n int ed = log2(s); n for (int i = 1; i <= ed; ++i) { n long long d = (s >> i) & 1; n int ed = i * 2 - 2; n for (int j = 0; j <= ed; ++j) n for (int k = 0; k <= 1; ++k) n for (int p1 = 0; p1 <= 1; ++p1) n for (int p2 = 0; p2 <= 1; ++p2) n if ((i < h1 || p1 == 0) && (i < h2 || p2 == 0) && n (p1 + p2 + k) % 2 == d) n f[i][j + p1 + p2][(k + p1 + p2) / 2] += f[i - 1][j][k]; n } n return f[ed][tot][0]; n } n int main() { n long long x, s, res, ans = 0; n int ed = 0; n scanf( %lld , &s); n bit[0] = 1; n while (bit[ed] <= s) bit[++ed] = bit[ed - 1] << 1; n for (int i = 1; i <= ed; ++i) { n if (bit[i] - 1 > s) break; n x = s % (bit[i] - 1); n for (int j = i; j >= 1; --j) n if (x >= bit[j] - 1) x -= bit[j] - 1; n if (!x) ++ans; n } n for (int h1 = 1; h1 <= ed - 1; ++h1) { n for (int h2 = 1; bit[h2] - 1 <= s && h2 < ed; ++h2) { n x = (s - bit[h2] + 1) / (bit[h1 + 1] + bit[h2 + 1] - 3); n if (x > 0) { n res = (s - bit[h2] + 1) % (bit[h1 + 1] + bit[h2 + 1] - 3); n if (res == 0) { n ++ans; n continue; n } n if (h1 == 1 && h2 == 1) { n ans += (s == x * 5 + 1); n continue; n } n for (int i = 1; i <= h1 + h2; ++i) n if ((res + i) % 2 == 0) ans += dp(res + i, i, h1, h2); n } n } n } n printf( %lld , ans); n } n "} +{"func_code_string": "#include n using namespace std; n struct point { n int x, y; n point() : x(0), y(0) {} n point(int x, int y) : x(x), y(y) {} n point operator-(const point& p) const { return point(x - p.x, y - p.y); } n int dot(const point& p) const { return x * p.x + y * p.y; } n int cross(const point& p) const { return x * p.y - y * p.x; } n }; n istream& operator>>(istream& is, point& p) { return is >> p.x >> p.y; } n bool pointInSegment(const point& a, const point& b, const point& p) { n return (p - a).cross(b - a) == 0 && (a - p).dot(b - p) <= 0; n } n bool pointInPerimeter(const vector& P, const point& p) { n int n = P.size(); n for (int i = 0; i < n; i++) { n if (pointInSegment(P[i], P[(i + 1) % n], p)) { n return true; n } n } n return false; n } n bool crossesRay(const point& a, const point& b, const point& p) { n return ((b.y >= p.y) - (a.y >= p.y)) * (a - p).cross(b - p) >= 0; n } n bool pointInPolygon(const vector& P, const point& p) { n if (pointInPerimeter(P, p)) { n return true; n } n int n = P.size(); n int rays = 0; n for (int i = 0; i < n; i++) { n rays += crossesRay(P[i], P[(i + 1) % n], p); n } n return rays & 1; n } n int sgn(int x) { n if (x > 0) return 1; n if (x < 0) return -1; n return 0; n } n int intersectSegmentsInfo(const point& a, const point& b, const point& c, n const point& d) { n point v1 = b - a, v2 = d - c; n int t = sgn(v1.cross(c - a)), u = sgn(v1.cross(d - a)); n if (t == u) { n if (t == 0) { n if (pointInSegment(a, b, c) || pointInSegment(a, b, d) || n pointInSegment(c, d, a) || pointInSegment(c, d, b)) { n return -1; n } else { n return 0; n } n } else { n return 0; n } n } else { n return sgn(v2.cross(a - c)) != sgn(v2.cross(b - c)); n } n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n vector a(4), b(4); n for (point& p : a) cin >> p; n for (point& p : b) cin >> p; n bool ans = false; n for (const point& p : a) { n ans = ans | pointInPolygon(b, p); n } n for (const point& p : b) { n ans = ans | pointInPolygon(a, p); n } n for (int i = 0; i < 4; ++i) { n for (int j = 0; j < 4; ++j) { n ans = ans | (intersectSegmentsInfo(a[i], a[(i + 1) % 4], b[j], n b[(j + 1) % 4]) != 0); n } n } n cout << (ans ? YES : NO ) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s1, s2; n int flag = 0, f = 0; n cin >> s1 >> s2; n int l = s1.length(); n for (int i = 0; i < l; i++) { n if (s1[i] < a ) { n s1[i] += 32; n } n if (s2[i] < a ) s2[i] += 32; n if (s1[i] != s2[i]) { n f = i; n flag = 1; n break; n } n } n if (flag == 0) n cout << 0 ; n else { n if (s1[f] > s2[f]) n cout << 1 ; n else n cout << -1 ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, f[33]; n double ans = 0; n vector v[33]; n string s; n template n ostream& operator<<(ostream& out, vector v) { n out << v.size() << n ; n for (auto e : v) out << e << ; n return out; n } n double check(int k) { n double ans = 0, local; n for (int i = 0; i < n; i++) { n memset(f, 0, sizeof f); n for (auto j : v[k]) { n f[s[(j + i) % n] - a ]++; n } n local = 0; n for (int i = 0; i <= z - a ; i++) n if (f[i] == 1) local += (double)1. / v[k].size(); n ans = max(ans, local); n } n return ans; n } n int main() { n ios_base::sync_with_stdio(false); n cin >> s; n n = s.size(); n for (int i = 0; i < s.size(); i++) v[s[i] - a ].push_back(i); n for (int i = 0; i <= z - a ; i++) { n ans += ((double)v[i].size() / n) * check(i); n } n cout << fixed << setprecision(13) << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n template n string to_string(pair p); n template n string to_string(tuple p); n template n string to_string(tuple p); n string to_string(const string& s) { return + s + ; } n string to_string(const char* s) { return to_string((string)s); } n string to_string(bool b) { return (b ? true : false ); } n string to_string(vector v) { n bool first = true; n string res = { ; n for (int i = 0; i < static_cast(v.size()); i++) { n if (!first) { n res += , ; n } n first = false; n res += to_string(v[i]); n } n res += } ; n return res; n } n template n string to_string(bitset v) { n string res = ; n for (size_t i = 0; i < N; i++) { n res += static_cast( 0 + v[i]); n } n return res; n } n template n string to_string(A v) { n bool first = true; n string res = { ; n for (const auto& x : v) { n if (!first) { n res += , ; n } n first = false; n res += to_string(x); n } n res += } ; n return res; n } n template n string to_string(pair p) { n return ( + to_string(p.first) + , + to_string(p.second) + ) ; n } n template n string to_string(tuple p) { n return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + n to_string(get<2>(p)) + ) ; n } n template n string to_string(tuple p) { n return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + n to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; n } n void debug_out() { cerr << endl; } n template n void debug_out(Head H, Tail... T) { n cerr << << to_string(H); n debug_out(T...); n } n long long sqr(long long n) { return n * n; } n long long binpow(long long a, long long n) { n if (n == 0) return 1; n if (n % 2 != 0) n return binpow(a, n - 1) * a; n else { n long long b = binpow(a, n / 2); n return b * b; n } n } n long long gcd(long long a, long long b) { n while (b) { n a %= b; n swap(a, b); n } n return a; n } n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } n int n; n vector v; n string ans; n bool check(string s1, string s2) { n string s = s1 + s2.substr(n - 2); n multiset v1, pref, suff; n for (int i = 0; i < n - 1; i++) { n pref.insert(s.substr(0, n - i - 1)); n v1.insert(s.substr(0, n - i - 1)); n suff.insert(s.substr(i + 1)); n v1.insert(s.substr(i + 1)); n } n if (v1 == multiset(v.begin(), v.end())) { n for (int i = 0; i < 2 * n - 2; i++) { n if (pref.count(v[i])) { n ans += P ; n pref.erase(v[i]); n } else if (suff.count(v[i])) { n ans += S ; n suff.erase(v[i]); n } else { n ans = ; n return false; n } n } n return true; n } n return false; n } n void solve() { n cin >> n; n v = vector(2 * n - 2); n string mx1 = , mx2 = ; n for (int i = 0; i < 2 * n - 2; i++) { n cin >> v[i]; n if (v[i].size() == n - 1 && mx1.size() == 0) n mx1 = v[i]; n else if (v[i].size() == n - 1 && mx2.size() == 0) n mx2 = v[i]; n } n if (check(mx1, mx2)) n cout << ans << endl; n else { n check(mx2, mx1); n cout << ans << endl; n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a, b, c, d, i, e, f, g, n, m, k, l, A[500005], B[500005], fix[500005], n root, ans, C[500005]; n vector v[500005]; n void dfs(long long x, long long y) { n for (long long i = 0; i < v[x].size(); i++) { n if (v[x][i] == y) continue; n dfs(v[x][i], x); n if (fix[v[x][i]] == 0) C[x]++; n } n if (C[x] == 0) return; n root = x; n fix[x] = 1; n for (long long i = 0; i < v[x].size(); i++) { n if (v[x][i] == y) continue; n if (fix[v[x][i]] == 1) continue; n fix[v[x][i]] = 1; n swap(A[B[root]], A[B[v[x][i]]]); n ans += 2; n a = B[root]; n B[root] = B[v[x][i]]; n B[v[x][i]] = a; n root = v[x][i]; n } n } n int main() { n cin >> n; n for (long long i = 1; i <= n; i++) { n A[i] = i; n B[i] = i; n } n for (long long i = 1; i < n; i++) { n cin >> a >> b; n v[a].push_back(b); n v[b].push_back(a); n } n dfs(1, 0); n if (fix[1] == 0) { n a = v[1][0]; n swap(A[1], A[B[v[1][0]]]); n ans += 2; n } n cout << ans << endl; n for (long long i = 1; i <= n; i++) cout << A[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 101; n int n, m; n struct price { n int p; n int au; n bool operator<(const price &rhs) const { n if (au == rhs.au) return p > rhs.p; n return au < rhs.au; n } n } price[MAX_N]; n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; ++i) { n scanf( %d , &price[i].p); n } n for (int i = 0; i < m; ++i) { n int x; n scanf( %d , &x); n price[x].au = 1; n } n sort(price + 1, price + n + 1); n long long ans = 0; n for (int i = 1; i <= n; ++i) { n if (price[i].au == 0) { n ans += price[i].p; n } else { n if (ans > price[i].p) n ans *= 2; n else n ans += price[i].p; n } n } n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 998244353; n const int N = 2e5 + 6; n int cnt[666], dp[777][777]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int _, n; n cin >> _; n while (_--) { n cin >> n; n for (int i = 0; i <= n - 1; i++) cin >> cnt[i]; n for (int i = 0; i <= n; i++) n for (int j = 0; j <= n * 2; j++) dp[i][j] = 1e9; n sort(cnt, cnt + n); n int ans = 1e9; n dp[0][0] = 0; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n * 2; j++) { n for (int k = 0; k <= j - 1; k++) { n dp[i][j] = min(dp[i - 1][k] + abs(cnt[i - 1] - j), dp[i][j]); n if (n - i == 0) ans = min(ans, dp[i][j]); n } n } n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool calculate_digits(int a) { n int sum = 0; n while (a > 0) { n sum += (a % 10); n a = a / 10; n } n if (sum % 4 == 0) { n return true; n } else { n return false; n } n } n int main() { n int a; n cin >> a; n for (int i = a; i <= a + 10; i++) { n if (calculate_digits(i)) { n cout << i << endl; n break; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k, res = 0; n cin >> n >> k; n vector arrAB; n vector arrA; n vector arrB; n for (int i = 0; i < n; i++) { n int time, a, b; n cin >> time >> a >> b; n if (a == 1 && b == 1) { n arrAB.push_back(time); n } else if (a == 1) { n arrA.push_back(time); n } else if (b == 1) { n arrB.push_back(time); n } n } n sort(arrA.begin(), arrA.end()); n sort(arrB.begin(), arrB.end()); n for (int i = 0; i < arrA.size() && i < arrB.size(); i++) { n arrAB.push_back(arrA[i] + arrB[i]); n } n sort(arrAB.begin(), arrAB.end()); n if (arrAB.size() < k) n cout << -1 << endl; n else { n for (int i = 0; i < k; i++) res += arrAB[i]; n cout << res << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int max_n = 100000; n int n, k; n char s[max_n + 5]; n void solve(void); n int main(void) { n int t; n scanf( %d , &t); n while (t--) solve(); n return 0; n } n void solve(void) { n scanf( %d%d , &n, &k); n scanf( %s , s); n int i, j, t, ans = 0; n int lcnt = 0; n for (i = 0; i < n; i++) { n if (s[i] == W ) { n if (i > 0 && s[i - 1] == W ) n ans += 2; n else n ans++; n } else n lcnt++; n } n if (lcnt == n) { n if (!k) n printf( 0 n ); n else n printf( %d n , 2 * k - 1); n return; n } n i = 0; n vector gap; n while (i < n) { n if (s[i] == L ) { n i++; n continue; n } n j = i; n while (j < n && s[j] == W ) j++; n t = j; n while (t < n && s[t] == L ) t++; n if (t >= n) break; n gap.push_back(t - j); n i = t; n } n sort(gap.begin(), gap.end()); n for (i = 0; k && i < (int)gap.size(); i++) { n if (gap[i] <= k) { n k -= gap[i]; n lcnt -= gap[i]; n ans += 2 * gap[i] + 1; n } else { n lcnt -= k; n ans += 2 * k; n k = 0; n } n } n if (k) { n ans += min(k, lcnt) * 2; n } n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a; n cin >> a; n string s; n cin >> s; n int x = 0; n for (int i = 0; i < a - 1; i++) { n if (s[i] > s[i + 1]) { n cout << YES << endl; n cout << i + 1 << << i + 2; n return 0; n } n } n cout << NO ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, p, q, r; n cin >> n >> p >> q >> r; n long long int a[n], ans = LLONG_MIN; n for (long long int i = 0; i < n; i++) cin >> a[i]; n long long int prefixMax[n], suffixMax[n]; n prefixMax[0] = p * a[0]; n suffixMax[n - 1] = r * a[n - 1]; n for (long long int i = 1; i < n; i++) n prefixMax[i] = max(prefixMax[i - 1], p * a[i]); n for (long long int i = n - 2; i >= 0; i--) n suffixMax[i] = max(suffixMax[i + 1], r * a[i]); n for (long long int i = 0; i < n; i++) { n ans = max(ans, prefixMax[i] + suffixMax[i] + (q * a[i])); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double EPS = 1e-9; n const double PI = 3.141592653589793; n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } n struct Pt { n double x, y; n Pt(double a = 0, double b = 0) : x(a), y(b) {} n bool operator==(const Pt& p) const { return p.x == x && p.y == y; } n bool operator<(const Pt& p) const { return x == p.x ? y > p.y : x < p.x; } n Pt operator-(const Pt& p) const { return {x - p.x, y - p.y}; } n Pt operator+(const Pt& p) const { return {x + p.x, y + p.y}; } n Pt operator/(const double c) const { return {x / c, y / c}; } n Pt operator*(const double c) const { return {x * c, y * c}; } n Pt vetor(const Pt& o) const { return o - (*this); } n double dot(const Pt& b) const { return (x * b.x) + (y * b.y); } n double sq() const { return (x * x) + (y * y); } n double dist(const Pt& b) { return sqrt((b - *this).sq()); } n double cross(const Pt& b) const { return (x * b.y) - (y * b.x); } n double cross(const Pt& a, const Pt& b) const { n return (a - *this).cross(b - *this); n } n double angle(Pt& a, Pt& b) const { n a = vetor(a), b = vetor(b); n return acos(1.0 * a.dot(b) / sqrt(1.0 * a.dot(a) * b.dot(b))); n } n } pts[101000]; n Pt obj; n Pt perp(Pt p) { return {-p.y, p.x}; } n ostream& operator<<(ostream& os, Pt p) { n return os << ( << p.x << , << p.y << ) ; n } n template n int sgn(F x) { n return (F(0) < x) - (x < F(0)); n } n struct Line { n double A, B, C; n Line() {} n Line(const Pt& de, const Pt& pa) { n A = de.y - pa.y; n B = pa.x - de.x; n C = -A * de.x - B * de.y; n } n }; n bool mORe(double a, double b) { return a <= b || fabs(a - b) <= EPS; } n struct Seg { n Pt A, B; n Seg() {} n Seg(Pt a, Pt b) : A(a), B(b) { n if (B < A) swap(A, B); n } n bool inDouble(const Pt& Pt) { n return mORe(min(A.x, B.x), Pt.x) && mORe(Pt.x, max(A.x, B.x)) && n mORe(min(A.y, B.y), Pt.y) && mORe(Pt.y, max(A.y, B.y)); n } n bool inter(Seg& o, Pt& res) { n Line l1 = Line(A, B), l2 = Line(o.A, o.B); n double dx = Pt(l1.C, l1.B).cross(Pt(l2.C, l2.B)); n double dy = Pt(l1.A, l1.C).cross(Pt(l2.A, l2.C)); n double d = Pt(l1.A, l1.B).cross(Pt(l2.A, l2.B)); n if (d == 0) return false; n res = Pt(-dx / d, -dy / d); n if (!inDouble(res) || !o.inDouble(res)) return false; n return true; n } n }; n int n, p, q; n void solve() { n vector chain; n int sz = 0; n for (int i = 0; i < n; i++) { n while (sz >= 2 && chain[sz - 2].cross(chain[sz - 1], pts[i]) >= 0) n chain.pop_back(), sz--; n chain.emplace_back(pts[i]); n sz++; n } n vector linhas; n for (int i = 1; i < chain.size(); i++) { n linhas.emplace_back(chain[i - 1], chain[i]); n } n Seg teste = {Pt(0, 0), obj * 1000002.0}; n for (Seg linha : linhas) { n Pt res; n if (linha.inter(teste, res)) { n printf( %.12f n , max(obj.x / res.x, obj.y / res.y)); n return; n } n } n } n int main() { n scanf( %d%d%d , &n, &p, &q); n obj = {(double)p, (double)q}; n int x, y; n int maxx = 0, maxy = 0; n for (int i = 0; i < n; i++) { n scanf( %d%d , &x, &y); n pts[i] = {(double)x, (double)y}; n maxx = max(maxx, x); n maxy = max(maxy, y); n } n pts[n] = {0.0, (double)maxy}; n pts[n + 1] = {(double)maxx, 0.0}; n n += 2; n sort(pts, pts + n); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c, d; n while (cin >> a >> b >> c >> d) { n cout << (((a ^ b) & (c | d)) ^ ((b & c) | (a ^ d))) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void exgcd(int a, int b, int *x, int *y) { n if (b) { n exgcd(b, a % b, y, x); n (*y) = (*y) - (a / b) * (*x); n } else n *x = 1, *y = 0; n } n int main() { n std::ios::sync_with_stdio(false); n double r1, r2, c1, c2, d1, d2; n cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2; n double a, b, c, d; n b = (r1 + c2 - d1) / 2.0; n a = r1 - b; n d = c2 - b; n c = d2 - b; n if ((int)a == a && (int)b == b && (int)c == c && (int)d == d && a + b == r1 && n c + d == r2 && a + d == d1 && c + b == d2 && a + c == c1 && b + d == c2) { n set temp; n temp.insert(a); n temp.insert(b); n temp.insert(c); n temp.insert(d); n if (temp.size() == 4 && *(temp.begin()) > 0 && *(temp.rbegin()) < 10) { n cout << (int)a << << (int)b << endl; n cout << (int)c << << (int)d << endl; n } else n cout << -1; n } else n cout << -1; n } n "} +{"func_code_string": "#include n using namespace std; n struct Node { n int x, y, id; n }; n bool operator<(const Node &s, const Node &t) { n if (s.x != t.x) n return s.x < t.x; n else n return s.y < t.y; n } n int main() { n int n, m; n scanf( %d%d , &n, &m); n vector vn; n vector ans; n set se; n for (int i = 0; i < m; i++) { n Node no; n scanf( %d%d , &(no.x), &(no.y)); n no.id = i + 1; n vn.push_back(no); n } n sort(vn.begin(), vn.end()); n for (int i = 0; i < n; i++) se.insert(i); n for (int i = 0; i < m; i++) { n set::iterator it = se.lower_bound(n - vn[i].y); n if (it == se.end()) continue; n if (*it < vn[i].x) { n se.erase(it); n ans.push_back(vn[i].id); n } n } n sort(ans.begin(), ans.end()); n printf( %d n , ans.size()); n for (int i = 0; i < ans.size(); i++) printf( %d , ans[i]); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); } n long long power(long long a, long long n) { n long long p = 1; n while (n > 0) { n if (n % 2) { n p = p * a; n } n n >>= 1; n a *= a; n } n return p; n } n long long power(long long a, long long n, long long mod) { n long long p = 1; n while (n > 0) { n if (n % 2) { n p = p * a; n p %= mod; n } n n >>= 1; n a *= a; n a %= mod; n } n return p % mod; n } n using namespace std; n int a[100004], b[100004], c[100004]; n vector p; n void sieve() { n int i, j; n for (i = 2; i * i <= 100000; i++) n if (!b[i]) n for (j = i * i; j <= 100000; j += i) b[j] = 1; n for (i = 2; i <= 100000; i++) n if (!b[i]) p.push_back(i); n } n int main() { n int i, j; n int n; n sieve(); n scanf( %d , &n); n for (i = 0; i < n; i++) scanf( %d , &a[i]); n int x, y; n for (i = 0; i < n; i++) { n x = a[i]; n for (j = 0; p[j] * p[j] <= a[i]; j++) { n if (x % p[j] == 0) c[p[j]]++; n while (x % p[j] == 0) x = x / p[j]; n } n if (x > 1) c[x]++; n } n x = 1; n for (i = 0; i < p.size(); i++) x = max(x, c[p[i]]); n printf( %d n , x); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string str1, str2; n int main() { n cin >> str1 >> str2; n if (str1 == str2) n cout << str1; n else n puts( 1 ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = unsigned long long; n ll a[5], b[5], c[5], d[5], fl, k, cnt, vis[10]; n set > st; n map, ll> mp; n vector G[10]; n set stt; n void dfs(ll u = 1, ll par = -1) { n vis[u] = 1; n cnt++; n for (ll v : G[u]) { n if (par == v) continue; n if (vis[v]) return; n dfs(v, u); n } n } n int main() { n while (cin >> a[0] >> b[0] >> c[0] >> d[0]) { n st.clear(); n stt.clear(); n for (int i = 1; i < 4; i++) cin >> a[i] >> b[i] >> c[i] >> d[i]; n fl = 1; n for (int i = 0; i < 4; i++) { n if (a[i] != c[i] && b[i] != d[i]) fl = 0; n } n k = 0; n for (int i = 0; i < 10; i++) G[i].clear(); n for (int i = 0; i < 10; i++) vis[i] = 0; n for (int i = 0; i < 4; i++) { n if (mp.find({a[i], b[i]}) == mp.end()) { n mp[{a[i], b[i]}] = ++k; n } n if (mp.find({c[i], d[i]}) == mp.end()) { n mp[{c[i], d[i]}] = ++k; n } n st.insert({a[i], b[i]}); n st.insert({c[i], d[i]}); n G[mp[{a[i], b[i]}]].push_back(mp[{c[i], d[i]}]); n G[mp[{c[i], d[i]}]].push_back(mp[{a[i], b[i]}]); n } n if (st.size() != 4) fl = 0; n for (int i = 0; i < 4; i++) { n stt.insert((a[i] - c[i]) * (a[i] - c[i]) + (b[i] - d[i]) * (b[i] - d[i])); n } n if (stt.size() > 2) fl = 0; n cnt = 0; n dfs(); n if (cnt != 4) fl = 0; n puts(fl ? YES : NO ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main(int argc, char const *argv[]) { n int d, n, c, ans, m; n string arr[105]; n cin >> n >> d; n ans = 0; n m = 0; n for (int i = 0; i < d; i++) { n cin >> arr[i]; n c = 0; n for (int j = 0; j < n; j++) { n if (arr[i][j] == 1 ) c++; n } n if (c < n) n m++; n else n m = 0; n if (m > ans) ans = m; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1000000007; n int get_inv(int x) { n return (x == 1) ? 1 : (mod - (long long)(mod / x) * get_inv(mod % x) % mod); n } n const int MaxN = 200010, MaxT = 1 << 19; n struct tree_node { n int k, sum; n int lazy; n tree_node() { k = lazy = 1; } n } T[MaxT]; n int v[MaxN], deg[MaxN]; n class Graph { n public: n int en[MaxN], next[MaxN], point[MaxN], tot; n void add_edge(int x, int y) { n next[++tot] = en[x]; n en[x] = tot; n point[tot] = y; n } n } G; n int in[MaxN], out[MaxN]; n int n, q; n int dfn; n void dfs(int now) { n in[now] = ++dfn; n for (int i = G.en[now]; i; i = G.next[i]) dfs(G.point[i]); n out[now] = dfn; n } n inline int mul(int &x, int v) { return (x = (long long)x * v % mod); } n inline int inc(int x, int v) { n x += v; n return x >= mod ? x - mod : x; n } n void add_lazy(int now, int lazy) { n mul(T[now].lazy, lazy); n mul(T[now].k, lazy); n mul(T[now].sum, lazy); n } n void push_down(int now) { n if (T[now].lazy != 1) { n add_lazy(now << 1, T[now].lazy); n add_lazy(now << 1 | 1, T[now].lazy); n T[now].lazy = 1; n } n } n void update(int now) { T[now].sum = inc(T[now << 1].sum, T[now << 1 | 1].sum); } n void modify_v(int l, int r, int x, int v, int now) { n if (l == r) { n T[now].sum = 1ll * T[now].k * v % mod; n return; n } n int mid = (l + r) >> 1; n push_down(now); n if (x <= mid) n modify_v(l, mid, x, v, now << 1); n else n modify_v(mid + 1, r, x, v, now << 1 | 1); n update(now); n } n void modify_k(int l, int r, int x, int y, int k, int now) { n if ((r < x) || (y < l)) return; n if ((x <= l) && (r <= y)) return add_lazy(now, k); n int mid = (l + r) >> 1; n push_down(now); n modify_k(l, mid, x, y, k, now << 1); n modify_k(mid + 1, r, x, y, k, now << 1 | 1); n update(now); n } n int query_k(int l, int r, int x, int now) { n if (l == r) return T[now].k; n int mid = (l + r) >> 1; n push_down(now); n if (x <= mid) n return query_k(l, mid, x, now << 1); n else n return query_k(mid + 1, r, x, now << 1 | 1); n } n int query_sum(int l, int r, int x, int y, int now) { n if ((r < x) || (y < l)) return 0; n if ((x <= l) && (r <= y)) return T[now].sum; n int mid = (l + r) >> 1; n push_down(now); n return inc(query_sum(l, mid, x, y, now << 1), n query_sum(mid + 1, r, x, y, now << 1 | 1)); n } n void debug() { n for (int i = 1; i <= 17; ++i) n printf( %d: %d %d %d n , i, T[i].sum, T[i].k, T[i].lazy); n } n int main() { n static int type[MaxN], f[MaxN], u[MaxN]; n scanf( %d%d , v + 1, &q); n n = 1; n for (int i = 1; i <= q; ++i) { n scanf( %d , type + i); n if (type[i] == 1) { n u[i] = ++n; n scanf( %d%d , &f[n], &v[n]); n G.add_edge(f[n], n); n } else n scanf( %d , u + i); n } n dfs(1); n modify_v(1, n, in[1], v[1], 1); n deg[1] = 1; n for (int i = 1; i <= q; ++i) n if (type[i] == 2) { n int ans = query_sum(1, n, in[u[i]], out[u[i]], 1), k; n if (u[i] == 1) n k = 1; n else n k = query_k(1, n, in[f[u[i]]], 1); n ans = (long long)ans * get_inv(k) % mod; n printf( %d n , ans); n } else { n int k = (long long)(deg[f[u[i]]] + 1) * get_inv(deg[f[u[i]]]) % mod; n ++deg[f[u[i]]]; n modify_k(1, n, in[f[u[i]]], out[f[u[i]]], k, 1); n deg[u[i]] = 1; n modify_v(1, n, in[u[i]], v[u[i]], 1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char str[500005], cmd[500005]; n int baam[500005], daan[500005], jora[500005]; n int n, m, pos; n long long bit[500005]; n void update(int l, int r) { n bit[l] += 1; n bit[r + 1] -= 1; n } n void moveLeft() { n if (baam[pos] > 0 && baam[pos] <= n) pos = baam[pos]; n return; n } n void moveRight() { n if (daan[pos] > 0 && daan[pos] <= n) pos = daan[pos]; n return; n } n void deleteNode() { n int nextPos, L, R; n L = min(pos, jora[pos]); n R = max(pos, jora[pos]); n if (daan[R] <= n) n pos = daan[R]; n else n pos = baam[L]; n daan[baam[L]] = daan[R]; n baam[daan[R]] = baam[L]; n update(L, R); n return; n } n int main() { n scanf( %d %d %d , &n, &m, &pos); n getchar(); n for (int i = 1; i <= n; i++) scanf( %c , &str[i]); n getchar(); n stack st; n for (int i = 1; i <= n; i++) { n if (str[i] == ( ) n st.push(i); n else { n jora[i] = st.top(); n jora[st.top()] = i; n st.pop(); n } n } n for (int i = 1; i <= n; i++) { n baam[i] = i - 1; n daan[i] = i + 1; n } n scanf( %s , cmd); n for (int i = 0; cmd[i]; i++) { n if (cmd[i] == L ) n moveLeft(); n else if (cmd[i] == R ) n moveRight(); n else n deleteNode(); n } n for (int i = 1; i <= n; i++) bit[i] += bit[i - 1]; n for (int i = 1; i <= n; i++) { n if (!bit[i]) printf( %c , str[i]); n } n puts( ); n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const int maxn = 2e5 + 10; n int n; n int d[maxn]; n int main() { n scanf( %d , &n); n for (int i = 1; i < n; i++) { n int u, v; n scanf( %d%d , &u, &v); n d[u]++; n d[v]++; n } n for (int i = 1; i <= n; i++) { n if (d[i] == 2) { n puts( NO ); n return 0; n } n } n puts( YES ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n vector v; n unordered_map mapy; n v.push_back(0); n v.push_back(2); n mapy[2] = 1; n for (long long int i = 2; i <= 100000; i++) { n v.push_back(((3 * (i * (i + 1))) / 2) - i); n mapy[(((3 * (i * (i + 1))) / 2) - i)] = 1; n } n while (t--) { n long long int n; n cin >> n; n ; n long long int c = 0; n while (n > 1) { n auto f = lower_bound(v.begin(), v.end(), n); n if (mapy[n] == 1) { n c++; n break; n } n long long int hj = f - v.begin(); n hj--; n n -= v[hj]; n c++; n } n cout << c << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long double PI = acos(-1); n const int _ML = 500; n const char _inpf[] = ; n const char _outf[] = ; n template n inline ostream &operator<<(ostream &_out, const pair &_p) { n _out << _p.x << << _p.y; n return _out; n } n template n inline istream &operator>>(istream &_in, pair &_p) { n _in >> _p.x >> _p.y; n return _in; n } n template n inline ostream &operator<<(ostream &_out, const vector &_v) { n if (_v.empty()) return _out; n _out << _v.front(); n for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) _out << << *_it; n return _out; n } n template n inline istream &operator>>(istream &_in, vector &_v) { n for (auto &_i : _v) _in >> _i; n return _in; n } n template n inline ostream &operator<<(ostream &_out, const set &_s) { n if (_s.empty()) return _out; n _out << *_s.begin(); n for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << << *_it; n return _out; n } n template n inline ostream &operator<<(ostream &_out, const multiset &_s) { n if (_s.empty()) return _out; n _out << *_s.begin(); n for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << << *_it; n return _out; n } n template n inline ostream &operator<<(ostream &_out, const unordered_set &_s) { n if (_s.empty()) return _out; n _out << *_s.begin(); n for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << << *_it; n return _out; n } n template n inline ostream &operator<<(ostream &_out, const unordered_multiset &_s) { n if (_s.empty()) return _out; n _out << *_s.begin(); n for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << << *_it; n return _out; n } n template n inline ostream &operator<<(ostream &_out, const map &_m) { n if (_m.empty()) return _out; n _out << ( << _m.begin()->x << : << _m.begin()->y << ) ; n for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) n _out << , ( << _it->x << : << _it->y << ) ; n return _out; n } n template n inline ostream &operator<<(ostream &_out, const unordered_map &_m) { n if (_m.empty()) return _out; n _out << ( << _m.begin()->x << : << _m.begin()->y << ) ; n for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) n _out << , ( << _it->x << : << _it->y << ) ; n return _out; n } n inline void mainFunction(void) { n int n, m, k; n cin >> n >> m >> k; n vector v(n + 2, string(m + 2, * )); n int x = 228, n y = 1488 + m + i + s + h + k + a + = + g + a + y ; n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n cin >> v[i][j]; n if (v[i][j] == X ) { n v[i][j] = . ; n x = i; n y = j; n } n } n } n const int dx[] = {1, 0, 0, -1}; n const int dy[] = {0, -1, 1, 0}; n const int N = 1000 * 1000 + 228; n vector> d(n + 2, vector(m + 2, N)); n static int qx[N]; n static int qy[N]; n int ql = 0; n int qr = 1; n qx[0] = x; n qy[0] = y; n d[x][y] = 0; n while (ql != qr) { n int xx = qx[ql]; n int yy = qy[ql]; n ++ql; n for (int j = 0; j < 4; ++j) { n if (v[xx + dx[j]][yy + dy[j]] == . && d[xx + dx[j]][yy + dy[j]] == N) { n d[xx + dx[j]][yy + dy[j]] = d[xx][yy] + 1; n qx[qr] = xx + dx[j]; n qy[qr] = yy + dy[j]; n ++qr; n } n } n } n const char c[] = { D , L , R , U }; n static char p[228]; n p[ U ] = D ; n p[ D ] = U ; n p[ R ] = L ; n p[ L ] = R ; n string s; n for (int i = 0; i < k; ++i) { n int j; n for (j = 0; j < 4; ++j) { n if (v[x + dx[j]][y + dy[j]] == . && n d[x + dx[j]][y + dy[j]] <= k - i - 1) { n break; n } n } n if (j == 4) { n cout << IMPOSSIBLE << n ; n return; n } n s += c[j]; n x += dx[j]; n y += dy[j]; n } n cout << s << n ; n } n int main() { n if (_inpf[0] != 0 ) assert(freopen(_inpf, r , stdin) != nullptr); n if (_outf[0] != 0 ) assert(freopen(_outf, w , stdout) != nullptr); n cin.tie(nullptr); n ios_base::sync_with_stdio(false); n cout << setprecision(20); n mainFunction(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin >> n; n if (n == 1) { n cout << 1 n0 1 n0 n1 ; n return 0; n } n vector p1, p2; n p1.push_back(1); n p1.push_back(0); n p2.push_back(1); n for (long long i = 1; i < n; i++) { n vector temp = p1; n p1.push_back(0); n for (long long j = 0; j < p2.size(); j++) { n p1[j + 2] += p2[j]; n p1[j + 2] %= 2LL; n } n p2 = temp; n } n reverse(p1.begin(), p1.end()); n reverse(p2.begin(), p2.end()); n cout << p1.size() - 1 << n ; n for (long long i = 0; i < p1.size(); i++) cout << p1[i] << ; n cout << n ; n cout << p2.size() - 1 << n ; n for (long long i = 0; i < p2.size(); i++) cout << p2[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long n, d, a[100000], diff; n long sum = 0; n cin >> n >> d; n for (long i = 0; i < n; i++) cin >> a[i]; n for (long i = 1; i < n; i++) { n if (a[i - 1] >= a[i]) { n diff = a[i - 1] - a[i]; n a[i] = a[i] + (diff / d + 1) * d; n sum = sum + diff / d + 1; n } n } n cout << sum; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int Maxn = 55, p = 1e9 + 7; n int n, m; n long long inv[Maxn], f[Maxn][Maxn], g[Maxn][Maxn], sum[Maxn][Maxn]; n long long get_inv(int x) { n return x <= 1 ? 1 : (p - p / x) * get_inv(p % x) % p; n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) inv[i] = get_inv(i); n f[0][1] = sum[0][1] = 1; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= i + 1; j++) n for (int k = 1; k <= i; k++) n (g[i][j] += sum[k - 1][j] * sum[i - k][j]) %= p; n for (int j = 1; j <= i + 1; j++) { n (g[i][j] += p - g[i][j + 1]) %= p; n for (int a = n; a >= 0; a--) n for (int b = n + 1; b >= 0; b--) { n long long now = 1; n for (int d = 1; i * d <= a && j * d <= b; d++) { n (now *= inv[d] * (g[i][j] + d - 1 + p) % p) %= p; n (f[a][b] += now * f[a - i * d][b - j * d]) %= p; n } n } n } n for (int j = i + 1; j >= 1; j--) sum[i][j] = (sum[i][j + 1] + f[i][j]) % p; n } n printf( %lld , f[n][m]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int m, n; n long long mas[300007]; n long long ex[300007]; n vector s; n int main() { n scanf( %d %d , &m, &n); n for (int i = 0; i < m; i++) { n scanf( %I64d , &mas[i]); n } n for (int i = 0; i < n; i++) { n scanf( %I64d , &ex[i]); n } n n--; n m--; n for (int i = 0; i < n; i++) { n ex[i] = ex[i + 1] - ex[i]; n s.push_back(ex[i]); n } n s.push_back((long long)1000000000000); n for (int i = 0; i < m; i++) { n mas[i] = mas[i + 1] - mas[i]; n s.push_back(mas[i]); n } n m = n + m + 1; n vector z(m); n for (int i = 1, l = 0, r = 0; i < m; ++i) { n if (i <= r) z[i] = min(r - i + 1, z[i - l]); n while (i + z[i] < m && s[z[i]] == s[i + z[i]]) ++z[i]; n if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1; n } n int c = 0; n for (int i = n; i < m; i++) n if (z[i] >= n) c++; n cout << c; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 1500 + 10; n int n, x, y; n struct node { n int xx, yy, id; n bool operator<(const node &a) const { n if (xx - x >= 0 && a.xx - x <= 0) return 1; n if (xx - x <= 0 && a.xx - x >= 0) return 0; n return (yy - y) * (long long)(a.xx - x) < (a.yy - y) * (long long)(xx - x); n } n } p[M]; n vector g[M]; n int sz[M]; n int ans[M]; n void dfs(int o, int u) { n sz[u] = 1; n for (int &v : g[u]) n if (v != o) { n dfs(u, v); n sz[u] += sz[v]; n } n } n void dfs2(int o, int u, int l, int r) { n if (sz[u] == 1) { n ans[p[l].id] = u; n return; n } n int id = l; n for (int i = l + 1; i < r; ++i) { n if (p[i].xx < p[id].xx) { n id = i; n } n } n swap(p[id], p[l]); n ans[p[l].id] = u; n x = p[l].xx, y = p[l].yy; n sort(p + l + 1, p + r); n int sum = l + 1; n for (int &v : g[u]) n if (v != o) { n dfs2(u, v, sum, sum + sz[v]); n sum += sz[v]; n } n } n int main() { n scanf( %d , &n); n for (int i = 1, u, v; i < n; ++i) { n scanf( %d%d , &u, &v); n g[u].emplace_back(v); n g[v].emplace_back(u); n } n for (int i = 0; i < n; ++i) { n scanf( %d%d , &p[i].xx, &p[i].yy); n p[i].id = i; n } n dfs(1, 1); n dfs2(1, 1, 0, n); n for (int i = 0; i < n; ++i) { n printf( %d%c , ans[i], n [i == n - 1]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m; n pair a[3005]; n long long v[3005]; n vector vec[3005]; n priority_queue, greater > mc; n bool compare(pair a, pair b) { n return a > b; n } n int main() { n cin >> n >> m; n if (m == 1) { n cout << 0 << endl; n exit(0); n }; n long long x, y; n for (long long i = 0; i < n; i++) { n scanf( %I64d%I64d , &x, &y); n x--; n v[x]++; n vec[x].push_back(y); n if (x) mc.push(y); n } n for (long long i = 0; i < m; i++) { n a[i].first = v[i]; n a[i].second = i; n sort(vec[i].begin(), vec[i].end()); n } n sort(a, a + m, compare); n if (a[0].second == 0 && a[0].first > a[1].first) { n cout << 0 << endl; n exit(0); n }; n long long need = a[0].first - v[0] + 1; n long long tneed; n priority_queue, greater > tmc; n long long res = 541885418851154LL; n long long cost; n for (long long i = 0; i <= a[0].first; i++) { n cost = 0; n while (tmc.size()) { n tmc.pop(); n } n tneed = need; n if (tneed <= 0) { n res = 0; n break; n } n long long debug = (i == 2); n for (long long j = 0; j < m; j++) { n long long tj = a[j].second; n for (long long k = max(v[tj] - i, 0LL); k < v[tj]; k++) { n if (tj != 0) tmc.push(vec[tj][k]); n } n if (v[tj] <= i) continue; n for (long long k = 0; k < v[tj] - i; k++) { n cost += vec[tj][k]; n tneed--; n if (tneed == 0) break; n } n if (tneed == 0) break; n } n tneed -= a[0].first - i; n if (tneed <= 0) { n res = min(res, cost); n continue; n } n for (long long j = 0; j < tneed; j++) { n cost += tmc.top(); n tmc.pop(); n } n res = min(res, cost); n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int res[100005]; n int main() { n long long int n; n scanf( %lld , &n); n if (n % 4 == 2 || n % 4 == 3) { n printf( -1 ); n exit(0); n } n long long int c = 2; n for (long long int i = 0; i < n / 2; i += 2) { n res[i] = c; n res[i + 1] = n - i; n c += 2; n } n c = 1; n for (long long int i = n - 2; i >= n / 2; i -= 2) { n res[i] = c; n res[i + 1] = n - c; n c += 2; n } n if (n % 2) res[n / 2] = n / 2 + 1; n for (long long int i = 0; i < n; i++) printf( %lld , res[i]); n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 5e5 + 7; n const int maxm = 1e5 + 7; n struct Que { n int l, r, rt, id; n }; n struct Data { n int sum; n int id; n bool operator<(const Data& a) const { n return (sum == a.sum) ? (id < a.id) : (sum > a.sum); n } n }; n struct Edge { n int to, last; n } E[maxm]; n vector Q[maxm]; n struct Node { n Data val; n int lch, rch; n } rne[maxm * 20]; n int fail[maxm]; n int ch[maxm][26]; n int len[maxm]; n int n, m; n Data ans[maxn]; n char s[maxn]; n char t[maxn]; n int rt[maxm]; n int head[maxm]; n int f[20][maxm]; n int pos[maxn]; n int Len[maxn]; n int LL[maxn]; n int last; n int root; n int cnt; n int tot; n int qvq; n void Pushup(int u) { n if (!rne[u].lch && !rne[u].rch) return; n if (rne[u].lch && !rne[u].rch) n rne[u].val = rne[rne[u].lch].val; n else if (rne[u].rch && !rne[u].lch) n rne[u].val = rne[rne[u].rch].val; n else n rne[u].val = min(rne[rne[u].lch].val, rne[rne[u].rch].val); n } n void Modify(int& u, int l, int r, int x) { n if (!u) u = ++qvq; n if (l == r) { n rne[u].val.sum++; n rne[u].val.id = l; n return; n } n int mid = l + r >> 1; n if (x <= mid) n Modify(rne[u].lch, l, mid, x); n else n Modify(rne[u].rch, mid + 1, r, x); n Pushup(u); n } n void Extend(int x, int id) { n int p = last, np = ++tot; n last = np; n len[np] = len[p] + 1; n while (p && !ch[p][x]) ch[p][x] = np, p = fail[p]; n if (!p) n fail[np] = root; n else { n int q = ch[p][x]; n if (len[q] == len[p] + 1) n fail[np] = q; n else { n int nq = ++tot; n fail[nq] = fail[q]; n len[nq] = len[p] + 1; n memcpy(ch[nq], ch[q], sizeof ch[q]); n fail[np] = fail[q] = nq; n while (p && ch[p][x] == q) ch[p][x] = nq, p = fail[p]; n } n } n Modify(rt[np], 1, m, id); n } n int Merge(int x, int y, int l, int r) { n if (!x || !y) return x + y; n if (l == r) { n int re = ++qvq; n rne[re].val.sum = rne[x].val.sum + rne[y].val.sum; n rne[re].val.id = l; n return re; n } n int mid = l + r >> 1; n int re = ++qvq; n rne[re].lch = Merge(rne[x].lch, rne[y].lch, l, mid); n rne[re].rch = Merge(rne[x].rch, rne[y].rch, mid + 1, r); n Pushup(re); n return re; n } n Data Query(int u, int l, int r, int L, int R) { n if (l >= L && r <= R) return rne[u].val; n int mid = l + r >> 1; n Data re = (Data){-1, m + 1}; n if (L <= mid) re = min(re, Query(rne[u].lch, l, mid, L, R)); n if (R > mid) re = min(re, Query(rne[u].rch, mid + 1, r, L, R)); n return re; n } n void Dfs(int x, int p) { n for (int i = head[x], y; y = E[i].to, i; i = E[i].last) { n Dfs(y, x); n rt[x] = Merge(rt[x], rt[y], 1, m); n } n for (Que cur : Q[x]) { n ans[cur.id] = Query(rt[x], 1, m, cur.l, cur.r); n } n } n void Adde(int x, int y) { n E[++cnt] = (Edge){y, head[x]}; n head[x] = cnt; n } n int Read(char c = 0, int re = 0) { n while (!isdigit(c = getchar())) n ; n re = c - 0 ; n while (isdigit(c = getchar())) re = ((re << 2) + re << 1) + c - 0 ; n return re; n } n int main() { n scanf( %s , s + 1); n n = strlen(s + 1); n scanf( %d , &m); n last = tot = root = 1; n for (int i = 1; i <= m; ++i) { n scanf( %s , t + 1); n int len = strlen(t + 1); n last = 1; n for (int j = 1; j <= len; ++j) Extend(t[j] - a , i); n } n for (int i = 1; i <= tot; ++i) f[0][i] = fail[i]; n for (int i = 0; i < 19; ++i) n for (int x = 1; x <= tot; ++x) f[i + 1][x] = f[i][f[i][x]]; n int x = 1, tmp = 0; n for (int i = 1; i <= n; ++i) { n int d = s[i] - a ; n if (ch[x][d]) n tmp++, x = ch[x][d]; n else { n while (x && !ch[x][d]) x = fail[x]; n if (x) n tmp = len[x] + 1, x = ch[x][d]; n else n x = 1, tmp = 0; n } n pos[i] = x; n Len[i] = tmp; n } n for (int i = 1; i <= tot; ++i) n if (fail[i]) Adde(fail[i], i); n int q = Read(); n for (int i = 1; i <= q; ++i) { n int l = Read(), r = Read(), pl = Read(), pr = Read(); n LL[i] = l; n if (Len[pr] < pr - pl + 1) { n ans[i] = (Data){0, l}; n continue; n } n int rt = pos[pr]; n int LEN = pr - pl + 1; n for (int i = 19; ~i; --i) { n if (len[f[i][rt]] >= LEN) rt = f[i][rt]; n } n Q[rt].push_back((Que){l, r, rt, i}); n } n Dfs(1, 0); n for (int i = 1; i <= q; ++i) { n if (!ans[i].sum) ans[i].id = LL[i]; n printf( %d %d n , ans[i].id, ans[i].sum); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 5000; n int p[MAXN], size[MAXN], n, m; n int find_set(int v) { return v == p[v] ? v : p[v] = find_set(p[v]); } n void union_set(int x, int y) { n x = find_set(x); n y = find_set(y); n if (x != y) { n if (size[x] < size[y]) swap(x, y); n p[x] = y; n size[y] += size[x]; n } n } n int main() { n cin >> n >> m; n for (int i = 1; i <= n; i++) size[i] = 1, p[i] = i; n while (m--) { n int x, y; n cin >> x >> y; n union_set(x, y); n } n int mx = 0; n cin >> m; n while (m--) { n int x, y; n cin >> x >> y; n if (find_set(x) == find_set(y)) size[find_set(x)] = 0; n } n for (int i = 1; i <= n; i++) { n mx = max(mx, size[find_set(i)]); n } n cout << mx << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 5; n const int MOD = 1000000009; n int parent[N]; n int Rank[N]; n int Find(int x) { n if (parent[x] != x) { n parent[x] = Find(parent[x]); n } n return parent[x]; n } n bool Union(int x, int y) { n x = Find(x); n y = Find(y); n if (x == y) return false; n if (Rank[x] < Rank[y]) { n parent[x] = y; n } else if (Rank[x] > Rank[y]) { n parent[y] = x; n } else { n parent[x] = y; n Rank[y]++; n } n return true; n } n int main() { n int n, m, a, b; n scanf( %d %d , &n, &m); n for (int i = 1; i <= n; i++) { n parent[i] = i; n } n int ans = 1; n while (m--) { n scanf( %d %d , &a, &b); n if (!Union(a, b)) { n ans = (ans * 2) % MOD; n } n printf( %d n , ans ? ans - 1 : MOD - 1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, a[100005], b[2005], d[100005], z[100005], L[100005]; n inline void upd(int &a, int b) { n if (a < b) a = b; n } n int main(void) { n while (cin >> n >> m) { n for (int i = int(1); i <= int(n); i++) cin >> a[i]; n for (int i = int(1); i <= int(m); i++) cin >> b[i]; n sort(a + 1, a + n + 1); n sort(b + 1, b + m + 1); n memset(d, 0, sizeof d), memset(z, 0, sizeof z), memset(L, 0, sizeof L); n for (int i = int(1); i <= int(n); i++) { n if (i > 1 && a[i] - 1 == a[i - 1]) n L[i] = L[i - 1]; n else n L[i] = i; n int x = upper_bound(b + 1, b + m + 1, a[i]) - b; n upd(d[i], z[L[i] - 1]); n for (int j = int(x - 1); j >= int(1); j--) { n if (i <= a[i] - b[j]) break; n upd(d[i], z[L[i - a[i] + b[j]] - 1] + x - j); n } n upd(z[i], max(z[i - 1], d[i])); n for (int j = int(x); j <= int(m); j++) { n if (i + b[j] - a[i] > n) break; n upd(z[i + b[j] - a[i]], d[i] + j - x + 1); n } n } n cout << z[n] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k, l, r[200005], cnt = 0; n bool valid[200005]; n pair p; n pair > u; n vector v; n vector > > event; n priority_queue > pq; n scanf( %d %d , &n, &k); n for (int i = 1; i <= n; i++) { n scanf( %d %d , &l, &r[i]); n event.push_back(make_pair(l, make_pair(0, i))); n event.push_back(make_pair(r[i] + 1, make_pair(1, i))); n } n sort(event.begin(), event.end()); n memset(valid, true, sizeof valid); n for (int i = 0; i < (int)event.size(); i++) { n u = event[i]; n l = u.first; n while (u.first == l) { n if (u.second.first == 0) { n pq.push(make_pair(r[u.second.second], u.second.second)); n cnt++; n } else if (valid[u.second.second]) { n valid[u.second.second] = false; n cnt--; n } n i++; n if (i == (int)event.size()) break; n u = event[i]; n } n i--; n while (cnt > k) { n p = pq.top(); n pq.pop(); n while (!valid[p.second]) { n p = pq.top(); n pq.pop(); n } n valid[p.second] = false; n v.push_back(p.second); n cnt--; n } n } n printf( %d n , (int)v.size()); n for (int i = 0; i < (int)v.size(); i++) { n if (i) putchar( ); n printf( %d , v[i]); n } n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 200000; n struct Splay { n struct node { n node *fa, *ch[2]; n int num, key, mx, mn, tg; n } pl[2 * MAXN + 5], *root, *NIL; n Splay() { n root = NIL = &pl[0]; n NIL->ch[0] = NIL->ch[1] = NIL->fa = NIL; n NIL->mx = -MAXN, NIL->mn = MAXN, NIL->tg = 0; n } n void set_child(node *x, node *y, int d) { n if (x != NIL) x->ch[d] = y; n if (y != NIL) y->fa = x; n } n void pushdown(node *x) { n if (x->tg) { n if (x->ch[0] != NIL) n x->ch[0]->key += x->tg, x->ch[0]->mx += x->tg, x->ch[0]->mn += x->tg, n x->ch[0]->tg += x->tg; n if (x->ch[1] != NIL) n x->ch[1]->key += x->tg, x->ch[1]->mx += x->tg, x->ch[1]->mn += x->tg, n x->ch[1]->tg += x->tg; n x->tg = 0; n } n } n void pushup(node *x) { n x->mn = min(x->key, min(x->ch[0]->mn, x->ch[1]->mn)); n x->mx = max(x->key, max(x->ch[0]->mx, x->ch[1]->mx)); n } n void rotate(node *x) { n node *y = x->fa; n int d = (y->ch[1] == x); n pushdown(y), pushdown(x); n if (y->fa != NIL) n set_child(y->fa, x, y->fa->ch[1] == y); n else n x->fa = y->fa; n set_child(y, x->ch[!d], d); n set_child(x, y, !d); n if (y == root) root = x; n pushup(y); n } n void splay(node *x, node *rt) { n pushdown(x); n while (x->fa != rt) { n node *y = x->fa; n if (y->fa == rt) n rotate(x); n else { n if ((y->fa->ch[1] == y) == (y->ch[1] == x)) n rotate(y); n else n rotate(x); n rotate(x); n } n } n pushup(x); n } n void debug(node *x) { n if (x == NIL) return; n pushdown(x); n debug(x->ch[0]); n printf( %d : %d %d %d | %d %d n , x - pl, x->ch[0] - pl, x->ch[1] - pl, n x->fa - pl, x->num, x->key); n debug(x->ch[1]); n } n int dist(node *x, node *y) { n if (x == y) return 0; n splay(x, NIL), splay(y, root); n if (x->ch[0] == y) { n int d = min(min(x->key, y->key), x->ch[0]->ch[1]->mn); n return x->key + y->key - 2 * d; n } else { n int d = min(min(x->key, y->key), x->ch[1]->ch[0]->mn); n return x->key + y->key - 2 * d; n } n } n node *query(node *x, int d) { n pushdown(x); n if (x->ch[1]->mn <= d && d <= x->ch[1]->mx) n return query(x->ch[1], d); n else if (x->key == d) { n splay(x, NIL); n return x; n } else n return query(x->ch[0], d); n } n node *prev(node *x, node *rt) { n splay(x, rt); n node *ret = x->ch[0]; n while (ret->ch[1] != NIL) ret = ret->ch[1]; n splay(ret, rt); n return ret; n } n node *next(node *x, node *rt) { n splay(x, rt); n node *ret = x->ch[1]; n while (ret->ch[0] != NIL) ret = ret->ch[0]; n splay(ret, rt); n return ret; n } n } T; n Splay::node *fir[MAXN + 5], *bac[MAXN + 5]; n int n, m, root; n vector G[MAXN + 5]; n void addedge(int u, int v) { G[u].push_back(v); } n int dep[MAXN + 5], dfn[2 * MAXN + 5], dcnt; n void newnode(Splay::node *nw, int x, int k) { n nw->ch[0] = nw->ch[1] = nw->fa = T.NIL; n nw->num = x, nw->key = nw->mn = nw->mx = k, nw->tg = 0; n } n void dfs(int x) { n dfn[++dcnt] = x, fir[x] = bac[x] = &T.pl[dcnt], n newnode(&T.pl[dcnt], x, dep[x]); n for (int i = 0; i < G[x].size(); i++) { n int p = G[x][i]; n dep[p] = dep[x] + 1, dfs(p); n dfn[++dcnt] = x, bac[x] = &T.pl[dcnt], newnode(&T.pl[dcnt], x, dep[x]); n } n } n Splay::node *build(int l, int r) { n if (l > r) return T.NIL; n int mid = (l + r) >> 1; n Splay::node *p = &T.pl[mid]; n p->ch[0] = build(l, mid - 1); n if (p->ch[0] != T.NIL) p->ch[0]->fa = p; n p->ch[1] = build(mid + 1, r); n if (p->ch[1] != T.NIL) p->ch[1]->fa = p; n T.pushup(p); n return p; n } n bool tag[MAXN + 5]; n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) { n int l; n scanf( %d , &l); n for (int j = 1; j <= l; j++) { n int x; n scanf( %d , &x); n addedge(i, x); n tag[x] = true; n } n } n for (int i = 1; i <= n; i++) n if (!tag[i]) root = i; n newnode(&T.pl[++dcnt], 0, -1), dfs(root), newnode(&T.pl[++dcnt], 0, -1); n T.root = build(1, dcnt); n for (int i = 1; i <= m; i++) { n int op; n scanf( %d , &op); n if (op == 1) { n int v, u; n scanf( %d%d , &v, &u); n printf( %d n , T.dist(fir[v], fir[u])); n } else if (op == 2) { n int v, h; n scanf( %d%d , &v, &h); n T.splay(fir[v], T.NIL); n Splay::node *u = T.query(fir[v]->ch[0], fir[v]->key - h); n Splay::node *l = T.prev(fir[v], T.NIL), *r = T.next(bac[v], T.root); n if (bac[l->num] == r) bac[l->num] = l; n T.set_child(l, r->ch[1], 1); n Splay::node *p = r->ch[0]; n newnode(r, u->num, u->key), r->ch[0] = p; n r->tg += 1 - h, T.pushdown(r), T.pushup(r); n T.next(bac[u->num], T.NIL), T.splay(bac[u->num], T.root); n bac[u->num] = r; n T.set_child(T.root->ch[0], r, 1); n } else if (op == 3) { n int k; n scanf( %d , &k); n printf( %d n , T.query(T.root, k)->num); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 23, MAXM = 2e4 + 10, LIM = (1 << MAXN), mod = 998244353; n int n, f[1 << MAXN], g[1 << MAXN], F[1 << MAXN]; n long long ans; n int pcnt[1 << MAXN], psum[1 << MAXN], tag[1 << MAXN]; n char s[MAXN][MAXM]; n int cnt[MAXN][26]; n int main() { n for (int i = (0); i <= (22); i++) tag[1 << i] = i; n for (int i = (1); i <= ((1 << 23) - 1); i++) { n pcnt[i] = pcnt[i - (i & -i)] + 1; n psum[i] = psum[i - (i & -i)] + tag[(i & -i)] + 1; n } n scanf( %d , &n); n for (int i = (0); i <= (n - 1); i++) { n scanf( %s , s[i] + 1); n int len = strlen(s[i] + 1); n for (int j = (1); j <= (len); j++) { n cnt[i][s[i][j] - a ]++; n } n } n for (int i = (1); i <= ((1 << n) - 1); i++) f[i] = 1; n for (int i = (0); i <= (25); i++) { n g[0] = 1e9; n for (int j = (1); j <= ((1 << n) - 1); j++) { n g[j] = min(g[j ^ (j & -j)], cnt[tag[(j & -j)]][i]); n f[j] = 1LL * f[j] * (g[j] + 1) % mod; n } n } n for (int i = (1); i <= ((1 << n) - 1); i++) { n if ((pcnt[i] & 1)) n F[i] = f[i]; n else n F[i] = mod - f[i]; n } n for (int i = (0); i <= (22); i++) { n for (int j = (1); j <= ((1 << n) - 1); j++) { n if (j >> i & 1) { n F[j] = (F[j] + F[j ^ (1 << i)]) % mod; n } n } n } n for (int j = (1); j <= ((1 << n) - 1); j++) { n ans ^= (1LL * F[j] * pcnt[j] * psum[j]); n } n printf( %lld , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct input { n int a; n int b; n }; n int myfunc(input x, input y) { n if (x.a > y.a) { n return false; n } else if (x.a < y.a) { n return true; n } else { n if (x.b > y.b) { n return false; n } else { n return true; n } n } n } n int main() { n int n; n cin >> n; n vector vec; n input x; n for (int i = 0; i < n; i++) { n cin >> x.a; n x.b = i + 1; n vec.push_back(x); n } n sort(vec.begin(), vec.end(), myfunc); n int times = 0; n unsigned long long ways = 1; n int last = vec.at(0).a; n bool right = false; n int pairs = 0; n vector ans1; n vector ans2; n vector ans3; n int i; n for (i = 0; i < n; i++) { n if (last == vec.at(i).a) { n times++; n } else { n ways *= times; n if (times == 1) { n ans1.push_back(vec.at(i - 1).b); n ans2.push_back(vec.at(i - 1).b); n ans3.push_back(vec.at(i - 1).b); n } else if (times == 2) { n pairs++; n if (pairs >= 2) { n ans1.push_back(vec.at(i - 2).b); n ans1.push_back(vec.at(i - 1).b); n ans2.push_back(vec.at(i - 1).b); n ans2.push_back(vec.at(i - 2).b); n ans3.push_back(vec.at(i - 2).b); n ans3.push_back(vec.at(i - 1).b); n } else { n ans1.push_back(vec.at(i - 2).b); n ans1.push_back(vec.at(i - 1).b); n ans2.push_back(vec.at(i - 2).b); n ans2.push_back(vec.at(i - 1).b); n ans3.push_back(vec.at(i - 1).b); n ans3.push_back(vec.at(i - 2).b); n } n } else if (times >= 3) { n for (int j = i - 4; j >= i - times; j--) { n ans1.push_back(vec.at(j).b); n ans2.push_back(vec.at(j).b); n ans3.push_back(vec.at(j).b); n } n ans1.push_back(vec.at(i - 3).b); n ans1.push_back(vec.at(i - 2).b); n ans1.push_back(vec.at(i - 1).b); n ans2.push_back(vec.at(i - 2).b); n ans2.push_back(vec.at(i - 3).b); n ans2.push_back(vec.at(i - 1).b); n ans3.push_back(vec.at(i - 3).b); n ans3.push_back(vec.at(i - 1).b); n ans3.push_back(vec.at(i - 2).b); n } n times = 1; n last = vec.at(i).a; n } n if (i == n - 1) { n ways *= times; n if (times == 1) { n ans1.push_back(vec.at(i).b); n ans2.push_back(vec.at(i).b); n ans3.push_back(vec.at(i).b); n } else if (times == 2) { n pairs++; n if (pairs >= 2) { n ans1.push_back(vec.at(i - 1).b); n ans1.push_back(vec.at(i).b); n ans2.push_back(vec.at(i).b); n ans2.push_back(vec.at(i - 1).b); n ans3.push_back(vec.at(i - 1).b); n ans3.push_back(vec.at(i).b); n } else { n ans1.push_back(vec.at(i - 1).b); n ans1.push_back(vec.at(i).b); n ans2.push_back(vec.at(i - 1).b); n ans2.push_back(vec.at(i).b); n ans3.push_back(vec.at(i).b); n ans3.push_back(vec.at(i - 1).b); n } n } else if (times >= 3) { n for (int j = i - 3; j > i - times; j--) { n ans1.push_back(vec.at(j).b); n ans2.push_back(vec.at(j).b); n ans3.push_back(vec.at(j).b); n } n ans1.push_back(vec.at(i - 2).b); n ans1.push_back(vec.at(i - 1).b); n ans1.push_back(vec.at(i).b); n ans2.push_back(vec.at(i - 2).b); n ans2.push_back(vec.at(i).b); n ans2.push_back(vec.at(i - 1).b); n ans3.push_back(vec.at(i - 1).b); n ans3.push_back(vec.at(i - 2).b); n ans3.push_back(vec.at(i).b); n } n } n if (ways >= 3) { n right = true; n } n } n if (!right) { n cout << NO << endl; n } else { n cout << YES << endl; n for (int j = 0; j < n; j++) { n cout << ans1.at(j) << ; n } n cout << endl; n for (int j = 0; j < n; j++) { n cout << ans2.at(j) << ; n } n cout << endl; n for (int j = 0; j < n; j++) { n cout << ans3.at(j) << ; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n int t; n cin >> t; n while (t--) { n int n, x; n cin >> n >> x; n vector a(n), b(n); n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) cin >> b[i]; n sort(a.begin(), a.end()); n sort(b.rbegin(), b.rend()); n int f = 0; n for (int i = 0; i < n; i++) { n if (a[i] + b[i] > x) { n f = 1; n break; n } n } n if (f) n cout << No << endl; n else n cout << Yes << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int tc = 1; n const int M = 1e9 + 7; n const long long Inf = (long long)2e18 + 5; n const int N = 2e5 + 5; n std::vector a[N]; n int solve() { n int a; n cin >> a; n int z = 0; n int bg = 0; n int xx = 0; n int mx = 0; n long long ans = 0LL; n for (z = 0; z < a; z++) { n int n; n cin >> n; n mx = 0; n for (int i = 0; i < n; i++) { n int x; n cin >> x; n mx = max(mx, x); n } n if (z > 0) { n if (xx > mx) { n ans += (long long)(xx - mx) * n; n bg += n; n } else { n ans += (long long)(mx - xx) * bg; n xx = mx; n bg += n; n } n } else { n xx = mx; n bg += n; n } n } n cout << ans << endl; n return 0; n } n int main() { n int test = 1; n while (test--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, x1, x2, y1, y2; n cin >> n >> m >> x1 >> y1 >> x2 >> y2; n int dx = abs(x2 - x1); n int dy = abs(y2 - y1); n if (dx <= 4 && dy <= 2 || dy <= 4 && dx <= 2 || dx == 3 && dy == 3) { n cout << First ; n } else { n cout << Second ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, a, b, c; n int main() { n ios_base::sync_with_stdio(false); n cin >> n >> a >> b >> c; n if (n == 1) n cout << 0 << endl; n else if (c >= min(a, b)) n cout << (n - 1) * min(a, b) << endl; n else n cout << min(a, b) + (n - 2) * c << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long t; n cin >> t; n while (t--) { n long long n, m; n cin >> n >> m; n long long s = 0; n for (long long i = 0; i < n; i++) { n long long a; n cin >> a; n s += 2 * a; n } n if (n == m && n > 2) { n cout << s << endl; n for (long long i = 1; i < n; i++) cout << i << << i + 1 << endl; n cout << n << << 1 << endl; n } else n cout << -1 n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n int l = s.length(); n if ((s[l - 1] - 48) % 2 == 0) { n int temp = s[l - 2] * 10 + s[l - 1]; n if (temp % 4 == 0) { n cout << 4 << endl; n } else { n cout << 0 << endl; n } n } else { n cout << 0 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n if (n == 1 && m == 2) { n cout << 0 << endl; n cout << 1 << << 1 << endl; n cout << 1 << << 2 << endl; n cout << 1 << << 1 << endl; n return 0; n } n if (n == 2 && m == 1) { n cout << 0 << endl; n cout << 1 << << 1 << endl; n cout << 2 << << 1 << endl; n cout << 1 << << 1 << endl; n return 0; n } n if ((n % 2 && m % 2) || n == 1 || m == 1) { n cout << 1 << endl; n if (n == 1) { n cout << 1 << << m; n cout << << 1 << << 1 << endl; n } else if (m == 1) { n cout << 1 << << 1 << << n << << 1 << endl; n } else if (n % 2 == 1 && m % 2 == 1) { n cout << n << << m << ; n cout << n << << 1 << endl; n } else { n cout << n << << 1; n cout << << 1 << << 1 << endl; n } n } else n cout << 0 << endl; n if (m % 2 == 0) { n for (int i = 1; i <= m; i++) cout << 1 << << i << endl; n for (int j = m; j >= 1; j -= 2) { n for (int i = 2; i <= n; i++) cout << i << << j << endl; n for (int i = n; i > 1; i--) cout << i << << j - 1 << endl; n } n cout << 1 << << 1 << endl; n } else { n cout << 1 << << 1 << endl; n for (int i = 1; i <= n; i += 2) { n for (int j = 2; j <= m; j++) cout << i << << j << endl; n if (i != n) n for (int j = m; j >= 2; j--) cout << i + 1 << << j << endl; n } n if (n % 2 == 1 && m % 2 == 0) { n for (int i = 2; i <= n; i++) cout << i << << 1 << endl; n cout << 1 << << 1 << endl; n } else n for (int i = n; i >= 1; i--) cout << i << << 1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int c[100010]; n int x[100010], y[100010]; n vector t[100010]; n int f[100010]; n int find(int x) { return (f[x] == -1 ? x : f[x] = find(f[x])); } n int fa[100010], dep[100010]; n int dfn[100010], rnk[100010], totn = 0; n int siz[100010], son[100010], top[100010]; n void dfs1(int k) { n dep[k] = dep[fa[k]] + 1; n siz[k] = 1; n for (vector::iterator it = t[k].begin(); it != t[k].end(); ++it) { n if (*it == fa[k]) continue; n fa[*it] = k; n dfs1(*it); n siz[k] += siz[*it]; n if (son[k] == 0 || siz[*it] > siz[son[k]]) son[k] = *it; n } n return; n } n void dfs2(int k, int tp) { n dfn[k] = ++totn; n rnk[totn] = k; n top[k] = tp; n if (son[k]) dfs2(son[k], tp); n for (vector::iterator it = t[k].begin(); it != t[k].end(); ++it) { n if (*it == fa[k] || *it == son[k]) continue; n dfs2(*it, *it); n } n return; n } n int LCA(int a, int b) { n while (top[a] != top[b]) { n if (dep[top[a]] < dep[top[b]]) swap(a, b); n a = fa[top[a]]; n } n return (dep[a] < dep[b] ? a : b); n } n long long v[100010]; n void dfs3(int k) { n v[k] = c[k]; n for (vector::iterator it = t[k].begin(); it != t[k].end(); ++it) { n if (*it == fa[k]) continue; n dfs3(*it); n v[k] -= v[*it]; n } n return; n } n long long ve[100010]; n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; ++i) scanf( %d , &c[i]); n for (int i = 1; i <= m; ++i) scanf( %d%d , &x[i], &y[i]); n memset(f, -1, sizeof(f)); n for (int i = 1; i <= m; ++i) { n int p = find(x[i]), q = find(y[i]); n if (p == q) continue; n f[p] = q; n t[x[i]].push_back(y[i]); n t[y[i]].push_back(x[i]); n } n dfs1(1); n dfs2(1, 1); n dfs3(1); n for (int i = 1; i <= m; ++i) { n if (fa[x[i]] == y[i] || fa[y[i]] == x[i]) continue; n if ((dep[x[i]] + dep[y[i]] - 2 * dep[LCA(x[i], y[i])]) % 2 == 0) { n int val = v[1] / 2; n val = val * (dep[x[i]] % 2 == 0 ? -1 : 1); n ve[i] = val; n c[x[i]] -= val; n c[y[i]] -= val; n break; n } n } n dfs3(1); n if (v[1] != 0) { n puts( NO ); n return 0; n } n puts( YES ); n for (int i = 1; i <= m; ++i) { n if (fa[x[i]] == y[i] || fa[y[i]] == x[i]) { n if (dep[x[i]] < dep[y[i]]) swap(x[i], y[i]); n ve[i] = v[x[i]]; n } n printf( %lld n , ve[i]); n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( unroll-loops ) n #pragma GCC optimize( O3 ) n #pragma GCC optimize( fast-math ) n using namespace std; n const int INF = 1e9; n const long long INFll = 2e18; n const int BASE1 = 179; n const int BASE2 = 653; n const long long MOD = 1e9 + 7; n const int MAXN = 2e5; n const long double PI = 3.1415926535; n const long double EPS = 1e-10; n void solve() { n int n; n cin >> n; n vector> dop(n, vector(n, * )); n for (int i = 0; i < (n); i++) { n for (int j = 0; j < (n); j++) { n if (abs(i - n / 2) + abs(j - n / 2) <= n / 2) dop[i][j] = D ; n } n } n for (int i = 0; i < (n); i++) { n for (int j = 0; j < (n); j++) { n cout << dop[i][j]; n } n cout << n ; n } n } n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cout << fixed << setprecision(15); n int t = 1; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 3e5 + 10; n long long n, m; n long long res[N], sum[N], a[N]; n long long len; n struct Node { n int x, p, id; n } Q[N]; n inline long long read() { n long long x = 0, f = 0; n char ch; n while (((ch = getchar()) < 0 || ch > 9 ) && (ch != - )) n ; n while (!isdigit(ch)) f |= ch == - , ch = getchar(); n while (isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); n return f ? -x : x; n } n inline bool cmp(Node a, Node b) { return a.p != b.p ? a.p < b.p : a.x > b.x; } n signed main() { n n = read(); n len = sqrt(n); n for (long long i = 1; i <= n; i++) a[i] = read(); n m = read(); n for (int i = 1; i <= m; i++) { n long long x, p; n x = read(), p = read(); n Q[i].x = x, Q[i].p = p; n Q[i].id = i; n } n sort(Q + 1, Q + m + 1, cmp); n int last = n; n for (int i = 1; i <= m; i++) { n long long ans = 0; n if (Q[i].p >= len) { n for (int j = Q[i].x; j <= n; j += Q[i].p) { n ans += a[j]; n } n } else { n int p = Q[i].p, x = Q[i].x; n if (Q[i].p != Q[i - 1].p) last = n; n for (int j = last; j >= x; j--) { n sum[j] = a[j]; n if (j + p <= n) sum[j] += sum[j + p]; n } n last = x - 1; n ans = sum[x]; n } n res[Q[i].id] = ans; n } n for (int i = 1; i <= m; i++) printf( %lld n , res[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long readi() { n long long input = 0; n char c = ; n while (c < - ) { n c = getchar(); n } n bool negative = false; n if (c == - ) { n negative = true; n c = getchar(); n } n while (c >= 0 ) { n input = 10 * input + (c - 0 ); n c = getchar(); n } n if (negative) { n input = -input; n } n return input; n } n void printi(long long output) { n if (output == 0) { n putchar( 0 ); n return; n } n if (output < 0) { n putchar( - ); n output = -output; n } n int aout[20]; n int ilen = 0; n while (output) { n aout[ilen] = ((output % 10)); n output /= 10; n ilen++; n } n for (int i = ilen - 1; i >= 0; i--) { n putchar(aout[i] + 0 ); n } n return; n } n string reads() { n string input = ; n char c = ; n while (c <= ) { n c = getchar(); n } n while (c > ) { n input += c; n c = getchar(); n } n return input; n } n void prints(string output) { n for (int i = 0; i < output.length(); i++) { n putchar(output[i]); n } n return; n } n long long getrand() { n long long rand1 = (rand() % 536870912); n long long rand2 = (rand() % 536870912); n return (rand1 * 536870912ll + rand2); n } n int N, E; n vector pretest, systest; n vector badp, bads; n vector > ans; n int nump[1000010], nums[1000010]; n bool used[1000010]; n vector vp, vs, num; n int32_t main() { n srand(time(NULL)); n cout << fixed << setprecision(10); n cerr << fixed << setprecision(10); n ios_base::sync_with_stdio(false); n if (fopen( cf860c.in , r )) { n freopen( cf860c.in , r , stdin); n } n cin >> N; n for (int i = 0; i < N; i++) { n string s; n cin >> s; n bool idx; n cin >> idx; n if (idx) { n pretest.push_back(s); n } else { n systest.push_back(s); n } n } n E = pretest.size(); n for (int i = 0; i < pretest.size(); i++) { n bool isnum = true; n for (int j = 0; j < pretest[i].length(); j++) { n if (!isdigit(pretest[i][j])) { n isnum = false; n } n } n if (pretest[i][0] == 0 ) { n isnum = false; n } n if (isnum) { n nump[i] = stoi(pretest[i]); n used[nump[i]] = true; n if (E + 1 <= nump[i] && nump[i] <= N) { n badp.push_back(i); n } n } n } n for (int i = 0; i < systest.size(); i++) { n bool isnum = true; n for (int j = 0; j < systest[i].length(); j++) { n if (!isdigit(systest[i][j])) { n isnum = false; n } n } n if (systest[i][0] == 0 ) { n isnum = false; n } n if (isnum) { n nums[i] = stoi(systest[i]); n used[nums[i]] = true; n if (1 <= nums[i] && nums[i] <= E) { n bads.push_back(i); n } n } n } n for (int i = 100000; i < 1000000; i++) { n if (!used[i]) { n num.push_back(i); n } n } n for (int i = 1; i <= E; i++) { n if (!used[i]) { n vp.push_back(i); n } n } n for (int i = E + 1; i <= N; i++) { n if (!used[i]) { n vs.push_back(i); n } n } n while (!badp.empty() || !bads.empty()) { n if (!badp.empty() && !vp.empty()) { n int idx = badp.back(); n badp.pop_back(); n vs.push_back(nump[idx]); n ans.push_back(make_pair(pretest[idx], vp.back())); n pretest[idx] = to_string(vp.back()); n nump[idx] = vp.back(); n vp.pop_back(); n } else if (!bads.empty() && !vs.empty()) { n int idx = bads.back(); n bads.pop_back(); n vp.push_back(nums[idx]); n ans.push_back(make_pair(systest[idx], vs.back())); n systest[idx] = to_string(vs.back()); n nums[idx] = vs.back(); n vs.pop_back(); n } else if (!badp.empty()) { n int idx = badp.back(); n badp.pop_back(); n vs.push_back(nump[idx]); n ans.push_back(make_pair(pretest[idx], num.back())); n pretest[idx] = to_string(num.back()); n nump[idx] = num.back(); n num.pop_back(); n } else if (!bads.empty()) { n int idx = bads.back(); n bads.pop_back(); n vp.push_back(nums[idx]); n ans.push_back(make_pair(systest[idx], num.back())); n systest[idx] = to_string(num.back()); n nums[idx] = num.back(); n num.pop_back(); n } n } n for (int i = 0; i < pretest.size(); i++) { n if (1 <= nump[i] && nump[i] <= E) { n continue; n } n ans.push_back(make_pair(pretest[i], vp.back())); n pretest[i] = vp.back(); n vp.pop_back(); n } n for (int i = 0; i < systest.size(); i++) { n if (E + 1 <= nums[i] && nums[i] <= N) { n continue; n } n ans.push_back(make_pair(systest[i], vs.back())); n systest[i] = vs.back(); n vs.pop_back(); n } n cout << ans.size() << n ; n for (int i = 0; i < ans.size(); i++) { n cout << move << ans[i].first << << ans[i].second << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int x = 0, f = 1; n char c = getchar(); n for (; !isdigit(c); c = getchar()) n if (c == - ) f = -1; n for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; n return x * f; n } n const int MAXN = 200010; n char str[MAXN + 1], S[MAXN + 1]; n int main() { n scanf( %s , str + 1); n int N = strlen(str + 1); n for (int i = 0; i <= N; i++) n for (char c = a ; c <= z ; c++) { n int top = 0; n for (int j = 1; j <= i; j++) S[++top] = str[j]; n S[++top] = c; n for (int j = i + 1; j <= N; j++) S[++top] = str[j]; n bool flag = 1; n for (int j = 1; j <= top; j++) n if (S[j] != S[top - j + 1]) { n flag = 0; n break; n } n if (flag) { n for (int j = 1; j <= top; j++) printf( %c , S[j]); n printf( n ); n return 0; n } n } n printf( NA n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N, M; n int main() { n cin >> N >> M; n int putere = 1; n for (int i = 1; i <= M; i++) { n putere <<= 1; n if (putere >= 1000000009) putere -= 1000000009; n } n int val = 1; n for (int i = putere - 1; i >= putere - N; i--) n val = (1LL * val * i) % 1000000009; n cout << val; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long M = 4e5 + 10; n long long t, n, k, p, a[M], dp[M], s[M], ans; n long long bs(long long r, long long rem) { n long long l = 0, mid; n r++; n while (r - l > 1) { n mid = (r + l) / 2; n if (s[mid] > rem) n r = mid; n else n l = mid; n } n return l; n } n int32_t main() { n cin >> t; n while (t--) { n scanf( %lld%lld%lld , &n, &p, &k); n for (long long i = 1; i <= n; i++) { n scanf( %lld , a + i); n } n sort(a + 1, a + n + 1); n fill(s, s + n + 1, 0); n fill(dp, dp + n + 1, 0); n ans = 0; n for (long long i = 1; i <= n; i++) s[i] = s[i - 1] + a[i]; n for (long long i = k; i < k + k; i++) dp[i] = a[i]; n for (long long i = k + k; i <= n; i++) dp[i] = dp[i - k] + a[i]; n for (long long i = n; i >= k; i--) n if (dp[i] <= p) ans = max(ans, i - (i % k) + bs(i % k, p - dp[i])); n ans = max(ans, bs(k - 1, p)); n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[100001]; n long long n, k; n int main() { n long long p = 0, no = 0; n cin >> n >> k; n for (int i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n p = 0; n for (int i = 0; i < n; i++) { n if (p != a[i]) { n no++; n cout << a[i] - p << endl; n } n p = a[i]; n if (no == k) break; n } n for (int i = 0; i < (k - no); i++) cout << 0 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[1001], m, cnt[1001]; n set S; n int main() { n cin >> n >> m; n for (int i = 1; i <= m; i++) { n cin >> a[i]; n cnt[a[i]]++; n } n cout << *min_element(cnt + 1, cnt + n + 1); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector a(n); n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n int q; n cin >> q; n vector ta(n, -1); n vector payouts(q, 0); n for (int i = 0; i < q; i++) { n int k, p, x; n cin >> k; n if (k == 1) { n cin >> p >> x; n a[p - 1] = x; n ta[p - 1] = i; n } else { n cin >> x; n payouts[i] = x; n } n } n vector maxpayouts(q, payouts[q - 1]); n for (int i = q - 2; i >= 0; i--) { n maxpayouts[i] = max(maxpayouts[i + 1], payouts[i]); n } n maxpayouts.push_back(0); n for (int i = 0; i < n; i++) { n int res = max(maxpayouts[ta[i] + 1], a[i]); n cout << res << ; n } n cout << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const unsigned long long maxn = 200005; n unsigned long long n, m, vis[maxn]; n unsigned long long sum, A, B, C, he[maxn]; n struct node { n unsigned long long x, y; n bool operator<(const node &a) const { return x == a.x ? x < a.x : y < a.y; } n } chongtu[maxn]; n vector to[maxn], from[maxn]; n vector toq[maxn], fromq[maxn]; n map, unsigned long long> mp; n inline unsigned long long read() { n unsigned long long x = 0, f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = (x << 1) + (x << 3) + (ch ^ 48); n ch = getchar(); n } n return x * f; n } n inline void write(unsigned long long a) { n if (a < 0) { n putchar( - ); n putchar( 1 ); n } else { n if (a >= 10) write(a / 10); n putchar(a % 10 + 0 ); n } n } n signed main() { n n = read(), m = read(); n A = read(), B = read(), C = read(); n for (unsigned long long i = 0; i <= n - 3; ++i) { n unsigned long long len = (n - 1) - (i + 1) + 1; n sum += 1ull * len * (len - 1) / 2 * A * i; n } n for (unsigned long long j = 1; j <= n - 2; ++j) { n unsigned long long len1 = (j - 1) - 0 + 1, len2 = (n - 1) - (j + 1) + 1; n sum += 1ull * len1 * len2 * B * j; n } n for (unsigned long long k = 2; k <= n - 1; ++k) { n unsigned long long len = (k - 1) - 0 + 1; n sum += 1ull * len * (len - 1) / 2 * C * k; n } n for (unsigned long long i = 1; i < n; ++i) he[i] = he[i - 1] + i; n for (unsigned long long i = 1; i <= m; ++i) { n unsigned long long x = read(), y = read(); n if (x > y) swap(x, y); n chongtu[i].x = x, chongtu[i].y = y; n } n sort(chongtu + 1, chongtu + m + 1); n for (unsigned long long i = 1; i <= m; ++i) { n unsigned long long x = chongtu[i].x, y = chongtu[i].y; n mp[make_pair(x, y)]++; n to[x].push_back(y); n toq[x].push_back(1); n from[y].push_back(x); n fromq[y].push_back(1); n if (x >= 1) n sum -= 1ull * ((x - 1) - 0 + 1) * (B * x + C * y) + n 1ull * A * (he[x - 1] - he[0]); n if (y - x >= 2) n sum -= 1ull * ((y - 1) - (x + 1) + 1) * (A * x + C * y) + n 1ull * B * (he[y - 1] - he[x]); n if (y <= n - 2) n sum -= 1ull * ((n - 1) - (y + 1) + 1) * (A * x + B * y) + n 1ull * C * (he[n - 1] - he[y]); n } n for (unsigned long long i = 0; i < n; ++i) { n sort(to[i].begin(), to[i].end()); n sort(from[i].begin(), from[i].end()); n } n for (unsigned long long fu = 0; fu < n; ++fu) { n unsigned long long size11 = to[fu].size(); n for (unsigned long long k = 0; k < size11; ++k) { n unsigned long long zi = to[fu][k]; n toq[fu][k] = zi; n if (k) toq[fu][k] += toq[fu][k - 1]; n } n } n for (unsigned long long zi = 0; zi < n; ++zi) { n unsigned long long size11 = from[zi].size(); n for (unsigned long long k = 0; k < size11; ++k) { n unsigned long long fu = from[zi][k]; n fromq[zi][k] = fu; n if (k) fromq[zi][k] += fromq[zi][k - 1]; n } n } n for (unsigned long long fu = 0; fu < n; ++fu) { n unsigned long long size = to[fu].size(); n sum += 1ull * (size - 1) * (size) / 2 * A * fu; n for (unsigned long long j = 0; j < size; ++j) { n unsigned long long zi1 = to[fu][j]; n sum += 1ull * B * ((size - 1) - (j + 1) + 1) * zi1; n sum += 1ull * C * (toq[fu][size - 1] - toq[fu][j]); n } n } n for (unsigned long long zi = 0; zi < n; ++zi) { n unsigned long long size = from[zi].size(); n sum += 1ull * (size - 1) * (size) / 2 * C * zi; n for (unsigned long long j = 0; j < size; ++j) { n unsigned long long fu1 = from[zi][j]; n sum += 1ull * A * ((size - 1) - (j + 1) + 1) * fu1; n sum += 1ull * B * (fromq[zi][size - 1] - fromq[zi][j]); n } n } n for (unsigned long long zi = 0; zi < n; ++zi) { n unsigned long long size1 = to[zi].size(), size2 = from[zi].size(); n sum += 1ull * B * (size1) * (size2)*zi; n for (unsigned long long j = 0; j < size1; ++j) { n unsigned long long sun = to[zi][j]; n sum += 1ull * C * sun * size2; n if (size2) sum += 1ull * A * fromq[zi][size2 - 1]; n for (unsigned long long k = 0; k < size2; ++k) { n unsigned long long fu = from[zi][k]; n } n } n } n for (unsigned long long fu = 0; fu < n; ++fu) { n unsigned long long size = to[fu].size(); n for (unsigned long long j = 0; j < size; ++j) vis[to[fu][j]] = 1; n for (unsigned long long j = 0; j < size; ++j) { n unsigned long long zi = to[fu][j]; n unsigned long long sizez = to[zi].size(); n for (unsigned long long k = 0; k < sizez; ++k) { n unsigned long long sun = to[zi][k]; n if (vis[sun]) sum -= (1ull * A * fu + 1ull * B * zi + 1ull * C * sun); n } n } n for (unsigned long long j = 0; j < size; ++j) vis[to[fu][j]] = 0; n } n cout << sum; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int arr[300005], key[300005]; n struct node { n int cnt; n struct node *zero, *one; n node() { n cnt = 0; n zero = NULL, one = NULL; n } n } * root; n void Insert(int pat) { n struct node *curr = root; n int on = 1; n for (int i = 30; i >= 0; i--) { n int bit = (pat & (on << i)); n if (bit) { n if (curr->one == NULL) curr->one = new node(); n curr = curr->one; n curr->cnt++; n } else { n if (curr->zero == NULL) curr->zero = new node(); n curr = curr->zero; n curr->cnt++; n } n } n } n void Search(int val) { n struct node *curr = root; n int on = 1; n long long int ans = 0; n for (int i = 30; i >= 0; i--) { n int bit = (val & (on << i)); n if (bit) { n if (curr->one != NULL && curr->one->cnt > 0) { n curr = curr->one; n curr->cnt--; n } else if (curr->zero != NULL && curr->zero->cnt > 0) { n curr = curr->zero; n curr->cnt--; n ans += (on << i); n } n } else { n if (curr->zero != NULL && curr->zero->cnt > 0) { n curr = curr->zero; n curr->cnt--; n } else if (curr->one != NULL && curr->one->cnt > 0) { n curr = curr->one; n curr->cnt--; n ans += (on << i); n } n } n } n cout << ans << ; n } n int main() { n int n; n cin >> n; n root = new node(); n for (int i = 1; i <= n; i++) cin >> arr[i]; n for (int i = 1; i <= n; i++) { n cin >> key[i]; n Insert(key[i]); n } n for (int i = 1; i <= n; i++) { n Search(arr[i]); n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int i, j, k, l, p, q, m = 1, a = 0, b = 0, c = 0; n char s[50001]; n scanf( %s , s); n l = strlen(s); n i = 0; n if (s[i] == a && l > 1) { n for (j = i + 1; j < l; j++) { n if (s[j] != a ) { n if (s[j] == b ) { n for (p = j + 1; p < l; p++) { n if (s[p] != b ) { n if (s[p] == c ) { n for (q = p + 1; q < l; q++) { n if (s[q] != c ) { n m = 0; n break; n } n } n } else { n m = 0; n break; n } n } else { n if (p == l - 1) { n m = 0; n break; n } n } n } n } else { n m = 0; n } n break; n } else { n if (j == l - 1) { n m = 0; n break; n } n } n } n } else { n m = 0; n } n for (k = 0; s[k] != 0 ; k++) { n if (s[k] == a ) n a++; n else if (s[k] == b ) n b++; n else n c++; n } n if (m == 1 && (a == c || b == c)) { n printf( YES ); n } else { n printf( NO ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int F[30030]; n int n; n int mod; n int a[30030], id[30030]; n int nxt[30030]; n bool cmp(int i, int j) { return a[i] < a[j]; } n int m; n struct pnt { n int l, r, i; n pnt(int l = 0, int r = 0, int i = 0) : l(l), r(r), i(i){}; n } q[30030]; n bool operator<(pnt a, pnt b) { return b.l != a.l ? a.l < b.l : a.r < b.r; } n int answer[30030]; n int calc(int l, int r) { n int s = 0, m = 0; n for (int j, i = 1; i <= n; i++) { n j = id[i]; n if (j >= l && j <= r) { n s = (s + F[++m] * a[j]) % mod; n i = nxt[i]; n } n } n return s; n } n int main() { n scanf( %d %d , &n, &mod); n F[1] = F[2] = 1 % mod; n for (int i = 3; i <= n; i++) { n F[i] = (F[i - 1] + F[i - 2]) % mod; n } n for (int i = 1; i <= n; i++) { n scanf( %d , a + i); n id[i] = i; n } n sort(id + 1, id + n + 1, cmp); n nxt[n] = n; n for (int j = n - 1; j >= 1; j--) { n if (a[id[j]] == a[id[j + 1]]) { n nxt[j] = nxt[j + 1]; n } else { n nxt[j] = j; n } n } n for (int j = 1; j <= n; j++) { n a[j] %= mod; n } n scanf( %d , &m); n for (int i = 1; i <= m; i++) { n scanf( %d %d , &q[i].l, &q[i].r); n q[i].i = i; n } n sort(q + 1, q + m + 1); n for (int i = 1; i <= m; i++) { n if (i > 1 && q[i].l == q[i - 1].l && q[i].r == q[i - 1].r) { n answer[q[i].i] = answer[q[i - 1].i]; n } else { n answer[q[i].i] = calc(q[i].l, q[i].r); n } n } n for (int i = 1; i <= m; i++) { n printf( %d n , answer[i]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n n #define ll long long n #define int ll n #define ld long double n #define ff first n #define ss second n #define io ios_base::sync_with_stdio(false); cin.tie(NULL); n #define yes cout<< YES n #define no cout<< NO n #define loop(i,a,n) for(int i=a;i=a;i--) n #define test int tt=1; cin>>tt; while(tt--) n #define pb push_back n #define pi 3.141592653589793238 n #define all(v) v.begin(),v.end() n #define vecl vector n #define pii pair n #define vpii vector n const int MOD = 1e9 + 7; n int fast_expo(int x, int p) { n if (p == 0) return 1; n else if (p % 2 == 0) { int t = fast_expo(x, p / 2) % MOD; return (t * t) % MOD;} n else return (x * (fast_expo(x, p - 1)) % MOD) % MOD; n } n int gcd(int a, int b) { n if (a == 0 || b == 0) return a + b; n else return gcd(b % a, a); n } n n int lcm(int a, int b) n { n return (a * b) / gcd(a, b); n } n vecl v; n void primeFactors(int n) n { n // Print the number of 2s that divide n n while (n % 2 == 0) n { n v.pb(2); n n = n / 2; n } n n // n must be odd at this point. So we can skip n // one element (Note i = i +2) n for (int i = 3; i <= sqrt(n); i = i + 2) n { n // While i divides n, print i and divide n n while (n % i == 0) n { n v.pb(i); n n = n / i; n } n } n n // This condition is to handle the case when n n // is a prime number greater than 2 n if (n > 2) n v.pb(n); n } n //int t[101][101]; n void calc(vecl &a, int l, int r, vecl &b, int d) n { n if (l >= r) n return; n n int mx = 0, ans = 0; n loop(i, l, r) n { n mx = max(mx, a[i]); n } n loop(i, l, r) n { n if (mx == a[i]) n { n ans = i; break; n } n } n b[ans] = d; n calc(a, ans + 1, r, b, d + 1); n calc(a, l, ans, b, d + 1); n } n n void solve() n { n int n; n cin >> n; n vecl a(n); n loop(i, 0, n) n { n cin >> a[i]; n } n //memset(t,-1, sizeof t); n int l = 0, r = n; n vecl ans(n + 1, 0); n int d = 0; n calc(a, l, r, ans, d); n loop(i, 0, n) n cout << ans[i] << ; n } n n signed main() { n n io n #ifndef ONLINE_JUDGE n freopen( inputf.in , r , stdin); n freopen( outputf.out , w , stdout); n #endif n //calc(); n test n { n solve(); n cout << endl; n } n return 0; n }"} +{"func_code_string": "#include n using namespace std; n unsigned long long min(unsigned long long x, unsigned long long y) { n if (x < y) return x; n return y; n } n unsigned long long max(unsigned long long x, unsigned long long y) { n if (x < y) return y; n return x; n } n long long min(long long x, long long y) { n if (x < y) return x; n return y; n } n long long max(long long x, long long y) { n if (x < y) return y; n return x; n } n double min(double x, double y) { n if (x < y) return x; n return y; n } n double max(double x, double y) { n if (x < y) return y; n return x; n } n unsigned long long gcd(unsigned long long x, unsigned long long y) { n if (!x) return y; n if (!y) return x; n if (x > y) swap(x, y); n return gcd(x, y % x); n } n unsigned long long inv(unsigned long long a, unsigned long long c) { n if (a == 1) { n return 1; n } n return ((c - (c / a)) * inv(c % a, c)) % c; n } n int n, l[300005] = {0}, r[300005] = {0}, idx[300005] = {0}; n int comp(int a, int b) { n if (l[a] == l[b]) return r[a] > r[b]; n return l[a] < l[b]; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cin >> n; n for (int i = 0; i < n; ++i) { n cin >> l[i] >> r[i]; n idx[i] = i; n } n sort(idx, idx + n, comp); n int minr = r[idx[n - 1]], j = n - 1; n for (int i = n - 2; i >= 0; --i) { n if (minr <= r[idx[i]]) { n cout << (idx[j] + 1) << << (idx[i] + 1) << n ; n return 0; n } n if (r[idx[i]] < minr) { n j = i; n minr = r[idx[i]]; n } n } n cout << -1 -1 n ; n return 0; n } n "} +{"func_code_string": "#include n const int maxn = 200000; n using namespace std; n int a[maxn], b[maxn]; n int l[maxn], r[maxn]; n int main() { n int n, q; n scanf( %d%d , &n, &q); n a[0] = 0; n for (int i = 1; i <= n; i++) n scanf( %d , &a[i]), b[i - 1] = abs(a[i] - a[i - 1]); n for (int i = 1; i <= q; i++) { n int x, y; n long long ans = 0; n scanf( %d%d , &x, &y); n y--; n l[x] = x - 1; n r[y] = y + 1; n for (int j = x + 1; j <= y; j++) { n l[j] = j - 1; n while (l[j] >= x && b[l[j]] < b[j]) l[j] = l[l[j]]; n } n for (int j = y - 1; j >= x; j--) { n r[j] = j + 1; n while (r[j] <= y && b[r[j]] <= b[j]) r[j] = r[r[j]]; n } n for (int j = x; j <= y; j++) n ans += (long long)(l[j] - j) * (j - r[j]) * b[j]; n printf( %I64d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long t; n cin >> t; n while (t--) { n long long n, k; n cin >> n >> k; n vector a(n); n long long mn = 1e5; n for (int i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] < mn) { n mn = a[i]; n } n } n long long ans = 0; n bool is_mn = false; n for (int i = 0; i < n; i++) { n if (a[i] == mn && not is_mn) { n is_mn = true; n continue; n } n while (a[i] + mn <= k) { n a[i] += mn; n ans++; n } n } n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const string roman[] = { M , CM , D , CD , C , XC , L , n XL , X , IX , V , IV , I }; n const int roman_num[] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1}; n int a; n string b, c; n string ans; n long long toint(string s, int base) { n long long res = 0, add; n for (int i = 0; i < s.size(); i++) { n res = res * base; n if (isdigit(s[i])) n add = s[i] - 0 ; n else n add = s[i] - A + 10; n res += add; n } n return res; n } n string roman_convert(int num) { n int pos = 0; n string res = ; n while (num > 0) { n while (roman_num[pos] <= num) { n num -= roman_num[pos]; n res += roman[pos]; n } n pos++; n } n return res; n } n string convert(string c, int from, int to) { n long long base_10 = 0LL; n string temp = c; n for (int i = 0; i < temp.size(); i++) { n int add; n if (isdigit(temp[i])) n add = temp[i] - 0 ; n else n add = temp[i] - A + 10; n base_10 = base_10 * from + add; n } n string res = ; n while (base_10) { n int digit = base_10 % to; n if (digit >= 10) n res.push_back( A + digit - 10); n else n res.push_back(digit + 0 ); n base_10 /= to; n } n if (res.empty()) return 0 ; n reverse(res.begin(), res.end()); n while (res.at(0) == 0 && res.size() > 11) res.erase(0, 1); n return res; n } n int main() { n cin.sync_with_stdio(0); n cin >> a >> b >> c; n while (c[0] == 0 && c.size() > 1) c.erase(0, 1); n if (b == R ) { n int temp = toint(c, a); n ans = roman_convert(temp); n } else { n int base = toint(b, 10); n ans = convert(c, a, base); n } n puts(ans.c_str()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[100005]; n int main(void) { n int n, x, k; n scanf( %d %d %d , &n, &x, &k); n for (int i = 0; i < n; i++) { n scanf( %d , a + i); n } n sort(a, a + n); n long long sum = 0; n for (int i = 0; i < n; i++) { n long long p = (long long)ceil(a[i] * 1.0 / x) * x; n sum += n lower_bound(a, a + n, p + (long long)k * x) - n lower_bound(a, a + n, max((long long)a[i], p + (long long)(k - 1) * x)); n } n cout << sum << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int min_answer; n long long int max_answer = -1; n void test_this_order(long long int a, long long int b, long long int c) { n long long int new_n = (a + 1) * (b + 2) * (c + 2) - a * b * c; n min_answer = std::min(min_answer, new_n); n max_answer = std::max(max_answer, new_n); n } n void test(long long int a, long long int b, long long int c) { n test_this_order(a, b, c); n test_this_order(b, a, c); n test_this_order(c, b, a); n } n int main() { n long long int n; n cin >> n; n test(n, 1, 1); n min_answer = max_answer; n for (long long int i = 1; i * i <= n; ++i) { n if (n % i == 0) { n long long new_n = n / i; n for (long long int j = 1; j * j <= new_n; ++j) { n if (new_n % j == 0) { n test(i, j, new_n / j); n } n } n } n } n cout << min_answer << << max_answer << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 10; n const int level = 20; n vector adj[N]; n bool checked[N]; n int parent[N]; n int sz[N]; n int centroid; n int sparse[N][level]; n int depth[N]; n void subtree(int cur, int prev) { n sz[cur] = 1; n for (auto &child : adj[cur]) { n if (child != prev and !checked[child]) { n subtree(child, cur); n sz[cur] += sz[child]; n } n } n } n void decompose(int cur, int prev, int total_size) { n for (auto &child : adj[cur]) { n if (child != prev and !checked[child]) { n decompose(child, cur, total_size); n } n } n if (centroid != -1) { n return; n } n if (2 * sz[cur] >= total_size) { n centroid = cur; n return; n } n } n int get_centroid(int cur) { n subtree(cur, 0); n centroid = -1; n decompose(cur, 0, sz[cur]); n return centroid; n } n void dfs(int cur, int prev) { n int root = get_centroid(cur); n parent[root] = prev; n checked[root] = true; n for (auto &child : adj[root]) { n if (!checked[child]) { n dfs(child, root); n } n } n } n void dfs_sparse(int cur, int prev) { n sparse[cur][0] = prev; n for (auto &child : adj[cur]) { n if (child != prev) { n depth[child] = depth[cur] + 1; n dfs_sparse(child, cur); n } n } n } n void solve() { n int n, m; n cin >> n >> m; n for (int i = 1; i <= n - 1; i++) { n int x, y; n cin >> x >> y; n adj[x].push_back(y); n adj[y].push_back(x); n } n dfs(1, 0); n dfs_sparse(1, -1); n for (int l = 1; l < level; l++) { n for (int node = 1; node <= n; node++) { n if (sparse[node][l - 1] != -1) { n sparse[node][l] = sparse[sparse[node][l - 1]][l - 1]; n } n } n } n auto lca = [&](int u, int v) -> int { n if (depth[v] < depth[u]) { n swap(u, v); n } n int diff = depth[v] - depth[u]; n for (int i = 0; i < level; i++) { n if ((diff >> i) & 1) { n v = sparse[v][i]; n } n } n if (u == v) { n return u; n } n for (int i = level - 1; i >= 0; i--) { n if (sparse[u][i] != sparse[v][i]) { n u = sparse[u][i]; n v = sparse[v][i]; n } n } n return sparse[u][0]; n }; n auto get_dist = [&](int x, int y) { n int lc = lca(x, y); n return depth[x] + depth[y] - 2 * depth[lc]; n }; n vector dist(n + 1, n); n int node = 1; n for (int i = node; i; i = parent[i]) { n dist[i] = get_dist(i, node); n } n for (int i = 1; i <= m; i++) { n int type, node; n cin >> type >> node; n if (type == 1) { n for (int i = node; i; i = parent[i]) { n dist[i] = min(dist[i], get_dist(i, node)); n } n } else { n int ans = n; n for (int i = node; i; i = parent[i]) { n ans = min(ans, get_dist(i, node) + dist[i]); n } n cout << (dist[node] = ans) << n ; n } n } n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n const int MX = 2000 + 1; n const int M = 1e9 + 7; n vector> adj[MX]; n int dp[MX][MX]; n int add(int a, int b) { return (a += b) < M ? a : a - M; } n int mul(int a, int b) { return 1LL * a * b % M; } n int floor_div(int a, int b) { return a / b - ((a ^ b) < 0 && a % b); } n int intersect(pair p, pair q) { n return floor_div(p.second - q.second, q.first - p.first); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int n, m, q; n cin >> n >> m >> q; n for (int i = 0; i < m; ++i) { n int u, v, w; n cin >> u >> v >> w; n adj[u].emplace_back(v, w); n adj[v].emplace_back(u, w); n } n memset(dp, -1, sizeof dp); n dp[0][1] = 0; n for (int i = 0; i < m; ++i) { n for (int j = 1; j <= n; ++j) { n if (dp[i][j] != -1) { n for (auto [v, w] : adj[j]) { n dp[i + 1][v] = max(dp[i + 1][v], dp[i][j] + w); n } n } n } n } n vector> lns; n for (int i = 1; i <= n; ++i) { n if (dp[m][i] == -1) continue; n int mx = 0; n for (auto [_, w] : adj[i]) { n mx = max(mx, w); n } n lns.emplace_back(mx, dp[m][i]); n } n sort(lns.begin(), lns.end()); n vector> hull; n for (auto i : lns) { n if (!hull.empty() && hull.back().first == i.first) { n hull.pop_back(); n } n while (hull.size() >= 2u && n intersect(i, hull.back()) <= intersect(i, hull[hull.size() - 2u])) { n hull.pop_back(); n } n hull.push_back(i); n } n int ans = 0; n for (int i = 1; i <= m; ++i) { n ans = add(ans, *max_element(dp[i], dp[i] + n + 1) % M); n } n int left = 1; n for (int i = 0; i < int(hull.size()); ++i) { n int right = q - m; n if (i + 1 < int(hull.size())) { n right = min(right, intersect(hull[i], hull[i + 1])); n } n if (right < left) continue; n int len = right - left + 1; n ans = add(ans, mul(hull[i].second % M, len)); n ans = add(ans, mul(hull[i].first % M, n mul(mul(len, add(right, left)), (M + 1) / 2))); n left = right + 1; n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n long long lcm(long long a, long long b) { return a * b / gcd(a, b); } n struct custom_hash { n static uint64_t splitmix64(uint64_t x) { n x += 0x9e3779b97f4a7c15; n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; n x = (x ^ (x >> 27)) * 0x94d049bb133111eb; n return x ^ (x >> 31); n } n size_t operator()(uint64_t x) const { n static const uint64_t FIXED_RANDOM = n chrono::steady_clock::now().time_since_epoch().count(); n return splitmix64(x + FIXED_RANDOM); n } n }; n mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); n inline int64_t random_long(long long l = LLONG_MIN, long long r = LLONG_MAX) { n uniform_int_distribution generator(l, r); n return generator(rng); n } n void __print(int x) { cerr << x; } n void __print(long x) { cerr << x; } n void __print(long long x) { cerr << x; } n void __print(unsigned x) { cerr << x; } n void __print(unsigned long x) { cerr << x; } n void __print(unsigned long long x) { cerr << x; } n void __print(float x) { cerr << x; } n void __print(double x) { cerr << x; } n void __print(long double x) { cerr << x; } n void __print(char x) { cerr << << x << ; } n void __print(const char *x) { cerr << << x << ; } n void __print(const string &x) { cerr << << x << ; } n void __print(bool x) { cerr << (x ? true : false ); } n template n void __print(const pair &x) { n cerr << { ; n __print(x.first); n cerr << , ; n __print(x.second); n cerr << } ; n } n template n void __print(const T &x) { n int f = 0; n cerr << { ; n for (auto &i : x) cerr << (f++ ? , : ), __print(i); n cerr << } ; n } n void _print() { cerr << ] n ; } n template n void _print(T t, V... v) { n __print(t); n if (sizeof...(v)) cerr << , ; n _print(v...); n } n const long long inf = 1e18; n const int32_t M = 1e9 + 7; n const int32_t MM = 998244353; n bool isPowerOfTwo(long long x) { return x && (!(x & (x - 1))); } n long long binpow(long long a, long long b, long long m) { n a %= m; n long long res = 1; n while (b > 0) { n if (b & 1) res = res * a % m; n a = a * a % m; n b >>= 1; n } n return res; n } n const int N = 2e6 + 1; n void solve() { n long long a, b; n cin >> a >> b; n long long target = a * b; n long long l = 0; n long long r = 1e6, mid, d; n bool k = false; n while (l <= r) { n mid = l + (r - l) / 2; n d = mid * mid * mid; n if (d == target) { n k = true; n break; n } n if (d < target) { n l = mid + 1; n } else { n r = mid - 1; n } n } n if (k == true && a % mid == 0 && b % mid == 0) { n cout << Yes n << n ; n } else { n cout << No n << n ; n } n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long t = 1; n cin >> t; n while (t--) { n solve(); n } n cerr << nTime elapsed: << 1000 * clock() / CLOCKS_PER_SEC << ms n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, k; n long long read() { n long long s = 0, f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n s = s * 10 + ch - 0 ; n ch = getchar(); n } n return s * f; n } n inline void print(long long *f, long long len) { n for (long long i = 0; i < len; i++) printf( %lld , f[i]); n puts( ); n } n long long a[101010]; n long long pw[101010]; n long long cnt[101010]; n long long dp[101010]; n const long long mod = 1e9 + 7; n signed main() { n n = read(); n pw[0] = 1; n for (long long i = 1, iend = n; i <= iend; ++i) n a[i] = read(), pw[i] = (pw[i - 1] * 2) % mod, cnt[a[i]]++; n for (long long i = 100000, iend = 1; i >= iend; --i) { n long long sum = 0; n for (long long j = i; j <= 100000; j += i) sum += cnt[j]; n dp[i] = pw[sum] - 1; n for (long long j = i * 2; j <= 100000; j += i) n dp[i] += mod, dp[i] -= dp[j], dp[i] %= mod; n } n cout << dp[1]; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 998244353; n const long long inf = 1e18; n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n, b; n cin >> n >> b; n long long i = 2; n long long ans = inf; n while (i <= b) { n if (i * i > b) i = b; n long long cnt = 0; n while (b % i == 0) { n b /= i; n cnt++; n } n if (cnt == 0) { n i++; n continue; n } n long long tmp = 0; n long long j = 1; n while (j <= n / i) { n j *= i; n tmp += n / j; n } n ans = min(ans, tmp / cnt); n i++; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int ss = 1000; n int n, k, ans, x; n bool flag1, flag2; n bool a[5000][5000]; n int b[1002], tot; n int main() { n scanf( %d%d , &n, &k); n memset(a, false, sizeof(a)); n memset(b, false, sizeof(b)); n flag1 = flag2 = false; n n += ss; n for (int i = 1; i <= k; ++i) { n scanf( %d , &x); n a[0][x + ss] = true; n if (x + ss > n) flag1 = true; n if (x + ss < n) flag2 = true; n } n tot = 0; n for (int i = 0; i <= 1000 + ss; ++i) { n if (a[0][i]) b[++tot] = i; n } n if (a[0][n]) n ans = 1; n else if (flag1 ^ flag2 || (k == 1)) n ans = -1; n else n for (int i = 1; i <= 5010; ++i) { n for (int j = 0; j <= 3000; ++j) n if (a[i - 1][j]) { n for (int k = 1; k <= tot; ++k) { n if (j + b[k] - n >= 0 && j + b[k] - n <= 3000) { n a[i][j + b[k] - n] = true; n } n } n } n if (a[i][n]) { n ans = i + 1; n break; n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int q; n cin >> q; n while (q--) { n long long n, a, b; n cin >> n >> a >> b; n if (n == 1) { n cout << a << endl; n continue; n } n if (n % 2 == 0) { n long long gu = min(n * a, (n / 2) * b); n cout << gu << endl; n } else { n long long gu = min(n * a, (n / 2) * b + a); n cout << gu << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n double i = n / 3.0; n int in = i; n if (i - in > 0.6) in += 1; n int f = in / 12; n cout << f << << in - f * 12 << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1e9 + 7; n int pwr(int a, long long b) { n int res = 1; n for (; b; b >>= 1) { n if (b & 1) res = 1LL * res * a % MOD; n a = 1LL * a * a % MOD; n } n return res; n } n int T, n; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n T = 1; n while (T--) { n cin >> n; n if (n == 1) return cout << 6 << n , 0; n long long x = (1LL << n); n x -= 2; n cout << 1LL * 6 * pwr(4, x) % MOD << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n inline long long read() { n long long t = 0, f = 1; n char c = getchar(); n while (c < 0 || c > 9 ) { n c = getchar(); n } n while (c >= 0 && c <= 9 ) t = t * 10 + c - 48, c = getchar(); n return t * f; n } n char s[10000001]; n long long len, hsh[2000001][11], bas = 10; n long long mo[4] = {1000000007, 1000000009, 998244353, 1000000037}; n inline long long ksm1(long long x, long long y, long long m) { n long long sum = 1; n for (; y; y /= 2) { n if (y & 1) sum = sum * x % m; n x = x * x % m; n } n return sum; n } n inline long long ksm(long long x, long long y) { n long long sum = 1; n for (; y; y /= 2) { n if (y & 1) sum = sum * x; n x = x * x; n } n return sum; n } n inline long long get(int l, int r, int k) { n long long t = 0, ret = 0; n if (k == 10) n t = ksm(bas, r - l + 1), ret = hsh[r][10] - t * hsh[l - 1][10]; n else n t = ksm1(bas, r - l + 1, mo[k]), n ret = ((hsh[r][k] - t * hsh[l - 1][k]) % mo[k] + mo[k]) % mo[k]; n return ret; n } n int a1[2000001], a2[2000001], a3[2000001], a4[2000001], len1, len2, len3; n bool flag = 0; n inline void solve(int x) { n int rest = len - x; n for (long long l = rest / 2; l <= rest / 2 + 1; ++l) { n if ((get(1, x, 10) + get(x + 1, len - l, 10)) == n get(len - l + 1, len, 10)) { n flag = 1; n for (long long i = 0; i <= 3; ++i) n if (((get(1, x, i) + get(x + 1, len - l, i)) % mo[i] + mo[i]) % mo[i] != n get(len - l + 1, len, i)) { n flag = 0; n break; n } n if (!flag) continue; n if (s[1] == 0 && x != 1) continue; n if (s[x + 1] == 0 && len - l != x + 1) continue; n if (s[len - l + 1] == 0 && len != len - l + 1) continue; n for (long long i = 1; i <= x; ++i) putchar(s[i]); n putchar( + ); n for (long long i = x + 1; i <= len - l; ++i) putchar(s[i]); n putchar( = ); n for (long long i = len - l + 1; i <= len; ++i) putchar(s[i]); n exit(0); n } n } n for (long long l = x; l <= x + 1; ++l) { n if ((get(1, x, 10) + get(x + 1, len - l, 10)) == n get(len - l + 1, len, 10)) { n flag = 1; n for (long long i = 0; i <= 3; ++i) n if (((get(1, x, i) + get(x + 1, len - l, i)) % mo[i] + mo[i]) % mo[i] != n get(len - l + 1, len, i)) { n flag = 0; n break; n } n if (!flag) continue; n if (s[1] == 0 && x != 1) continue; n if (s[x + 1] == 0 && len - l != x + 1) continue; n if (s[len - l + 1] == 0 && len != len - l + 1) continue; n for (long long i = 1; i <= x; ++i) putchar(s[i]); n putchar( + ); n for (long long i = x + 1; i <= len - l; ++i) putchar(s[i]); n putchar( = ); n for (long long i = len - l + 1; i <= len; ++i) putchar(s[i]); n exit(0); n } n } n } n int main() { n scanf( %s , s + 1); n len = strlen(s + 1); n hsh[0][4] = 0; n for (long long i = 1; i <= len; ++i) n hsh[i][10] = hsh[i - 1][10] * bas + s[i] - 48; n for (long long i = 1; i <= len; ++i) n for (long long j = 0; j <= 3; ++j) n hsh[i][j] = (hsh[i - 1][j] * bas + s[i] - 48) % mo[j]; n for (long long i = 1; i <= len / 2 + 1; ++i) solve(i); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s, c; n int n, t = 0; n cin >> n; n cin >> s >> c; n for (int i = 0; i < n; i++) { n int p = s[i], k = c[i]; n if (p <= k) n t += min(abs(p - k), (p + 1) + (9 - k)); n else n t += min((9 - p) + (k + 1), abs(p - k)); n } n cout << t << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_BUF_SIZE = 16384; n char BUFOR[MAX_BUF_SIZE]; n int BUF_SIZE, BUF_POS; n char ZZZ; n const int MXN = 100010; n const int C = 262144; n const int INF = 1000000001; n string a[MXN]; n int aa; n int typ[MXN], gender[MXN]; n string fem[3] = { liala , etra , inites }; n string masc[3] = { lios , etr , initis }; n string mowa[6] = { lios , etr , initis , liala , etra , inites }; n int n; n void test() { n string tmp; n while (cin >> tmp) a[aa++] = tmp; n n = aa; n bool czy = 1; n for (int i = 0; i < aa; i++) { n int dec = -1; n gender[i] = -1; n for (int j = 0; j < 3; j++) { n string w = masc[j]; n if (w.length() <= a[i].length() && n w == string(a[i], (int)(a[i]).size() - (int)(w).size(), n (int)(w).size())) n dec = 1; n gender[i] = dec; n } n dec = -1; n for (int j = 0; j < 3; j++) { n string w = fem[j]; n if (w.length() <= a[i].length() && n w == string(a[i], (int)(a[i]).size() - (int)(w).size(), n (int)(w).size())) n dec = 0; n if (gender[i] == -1) gender[i] = dec; n } n for (int j = 0; j < 6; j++) { n string w = mowa[j]; n typ[i] = -1; n if (w.length() <= a[i].length() && n w == string(a[i], (int)(a[i]).size() - (int)(w).size(), n (int)(w).size())) { n typ[i] = j % 3; n break; n } n } n if (gender[i] == -1 || typ[i] == -1) czy = 0; n } n int iter = 0; n while (iter < n && typ[iter] == 0) iter++; n if (typ[iter] == 1) n iter++; n else if (n > 1) n czy = 0; n while (czy && iter < n) n if (typ[iter++] != 2) czy = 0; n for (int i = 1; i < n; i++) n if (gender[0] != gender[i]) czy = 0; n if (czy) n printf( YES n ); n else n printf( NO n ); n } n int main() { n int te = 1; n while (te--) test(); n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const int N = 1e5; n class union_find { n int n, no_of_comp; n vector par, sz; n n public: n union_find(int nv) { n n = no_of_comp = nv; n par = sz = vector(n + 1, 1); n for (int i = 1; i <= n; i++) par[i] = i; n } n int get_root(int i) { n while (i != par[i]) i = par[i]; n return i; n } n void take_union(int i, int j) { n int u = get_root(i); n int v = get_root(j); n if (u == v) return; n if (sz[u] < sz[v]) swap(u, v); n par[v] = u; n sz[u] += sz[v]; n no_of_comp--; n } n int num_of_comp() { return no_of_comp; } n }; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, m; n cin >> n >> m; n union_find dsu(n); n for (int i = 0; i < m; i++) { n int u, v; n cin >> u >> v; n dsu.take_union(u, v); n } n cout << (long long)pow(2, n - dsu.num_of_comp()); n } n "} +{"func_code_string": "#include n int main() { n int n; n scanf( %d , &n); n int s = 0; n s = n * (n + 1) / 2; n if (s % 2 == 0) { n printf( 0 ); n } else { n printf( 1 ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector com; n vector all; n long long c, a, n, k, mm; n void solve() { n long long s = 0, e = (long long)1e9 * 2 + 5; n long long mid = 0; n long long sum = 0; n while (s <= e) { n mid = (s + e) / 2; n for (int i = 0; i < n; i++) { n sum += max((long long)0, (com[i] * mid - all[i])); n if (sum > (long long)1e18) { n sum = k + 1; n break; n } n } n if (sum <= k) { n mm = mid; n s = mid + 1; n } else n e = mid - 1; n sum = 0; n } n cout << mm; n } n int main() { n cin >> n >> k; n for (int i = 0; i < n; i++) { n cin >> c; n com.push_back(c); n } n for (int i = 0; i < n; i++) { n cin >> a; n all.push_back(a); n } n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline bool equal(double _x, double _y) { n return _x > _y - 1e-9 && _x < _y + 1e-9; n } n int l[105], r[105], t[105], c[105], ans, mx, id; n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 0; i < m; i++) scanf( %d%d%d%d , &l[i], &r[i], &t[i], &c[i]); n for (int j = 1; j <= n; j++) { n mx = 1e9; n id = -1; n for (int i = 0; i < m; i++) { n if (l[i] <= j && j <= r[i] && t[i] < mx) { n mx = t[i]; n id = i; n } n } n if (~id) ans += c[id]; n } n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream& operator<<(ostream& out, const pair& x) { n return out << ( << x.first << , << x.second << ) ; n } n template n ostream& operator<<(ostream& out, const vector& a) { n out << [ ; n for (const auto& x : a) out << x << , ; n return out << ] ; n } n template n ostream& operator<<(ostream& out, const set& a) { n out << [ ; n for (const auto& x : a) out << x << , ; n return out << ] ; n } n template n ostream& operator<<(ostream& out, const map& a) { n out << [ ; n for (const auto& x : a) out << x << , ; n return out << ] ; n } n template n void __trace__(const string name, Arg1&& arg1) { n cerr << name << : << arg1 << ] << endl; n } n template n void __trace__(const string names, Arg1&& arg1, Args&&... args) { n const string name = names.substr(0, names.find( , )); n cerr << name << : << arg1 << | ; n __trace__(names.substr(1 + (int)name.size()), args...); n } n clock_t time_p = clock(); n void time_taken() { n time_p = clock() - time_p; n cerr << Time Taken : << (float)(time_p) / CLOCKS_PER_SEC << n ; n } n const long long mod = 1e9 + 7; n const long long INF = 1e18; n const int maxn = 2e5 + 5; n vector adj[maxn]; n int Q[maxn]; n int n; n void bfs(int s, int* d) { n for (int i = 1; i <= n; i++) { n d[i] = -1; n } n d[s] = 0; n int N = 0; n Q[N++] = s; n for (int i = 0; i < N; i++) { n int u = Q[i]; n for (int v : adj[u]) { n if (d[v] == -1) { n d[v] = d[u] + 1; n Q[N++] = v; n } n } n } n } n void solve() { n int m, a, b, c; n cin >> n >> m >> a >> b >> c; n for (int i = 1; i <= n; i++) { n adj[i].clear(); n } n vector p(m); n for (int i = 0; i < m; i++) cin >> p[i]; n sort(p.begin(), p.end()); n for (int i = 1; i <= m - 1; i++) p[i] += p[i - 1]; n for (int _ = 0; _ < m; _++) { n int u, v; n cin >> u >> v; n adj[u].push_back(v); n adj[v].push_back(u); n } n int da[n + 1], db[n + 1], dc[n + 1]; n bfs(a, da); n bfs(b, db); n bfs(c, dc); n if (a == b) { n int foo = dc[a]; n if (foo) { n cout << p[foo - 1] << n ; n } else { n cout << 0 << n ; n } n return; n } n if (b == c) { n int foo = da[b]; n if (foo) { n cout << p[foo - 1] << n ; n } else { n cout << 0 << n ; n } n return; n } n if (c == a) { n int foo = da[b]; n if (foo) { n cout << 2 * p[foo - 1] << n ; n } else { n cout << 0 << n ; n } n return; n } n long long ans = INF; n for (int i = 1; i <= n; i++) { n long long cur = 0; n int cnt = 0; n long long foo = 0; n if (db[i]) { n foo = p[db[i] - 1]; n cur += 2 * p[db[i] - 1]; n } n int tot = da[i] + db[i] + dc[i] - 1; n if (tot < m) n cur += p[tot] - foo; n else n continue; n ans = min(ans, cur); n } n cout << ans << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cout.precision(12); n cout << fixed; n int t; n cin >> t; n while (t--) { n solve(); n } n time_taken(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-9; n const int mod = (int)1e+9 + 7; n const double pi = acos(-1.); n const int maxn = 100100; n int x[maxn]; n int z[10 * maxn]; n int a, b; n void fill(int u) { n int lpos = (u - b % u) % u; n for (; lpos <= a - b; lpos += u) { n z[lpos] = max(z[lpos], lpos + u - 1); n } n } n int main() { n srand(time(0)); n const string file = ; n if (!file.empty()) { n freopen((file + .in ).c_str(), r , stdin); n freopen((file + .out ).c_str(), w , stdout); n } n int n; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , &x[i]); n } n scanf( %d%d , &a, &b); n sort(&x[0], &x[n]); n n = unique(&x[0], &x[n]) - &x[0]; n for (int i = 0; i < 10 * maxn; i++) { n z[i] = i + 1; n } n for (int i = 0; i < n; i++) { n fill(x[i]); n } n for (int i = 1; i <= a - b; i++) { n z[i] = max(z[i], z[i - 1]); n } n int cnt = 0; n for (int i = 0; i < a - b;) { n i = z[i]; n cnt++; n } n cout << cnt; n return (0); n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000000000; n const int MOD = 1000000007; n const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1}; n const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1}; n int n, m; n char grid[65][65]; n bool row(int row, char c) { n for (int i = 0; i < m; i++) n if (grid[row][i] != c) return false; n return true; n } n bool col(int col, char c) { n for (int i = 0; i < n; i++) n if (grid[i][col] != c) return false; n return true; n } n void solve() { n cin >> n >> m; n int a = 0, b = 0; n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) { n cin >> grid[i][j]; n if (grid[i][j] == A ) n ++a; n else n ++b; n } n if (a == 0) { n cout << MORTAL n << n ; n return; n } n if (b == 0) { n cout << 0 << n ; n return; n } n if (row(0, A ) || row(n - 1, A ) || col(0, A ) || col(m - 1, A )) { n cout << 1 << n ; n return; n } n for (int i = 0; i < n; i++) n if (row(i, A )) { n cout << 2 << n ; n return; n } n for (int i = 0; i < m; i++) n if (col(i, A )) { n cout << 2 << n ; n return; n } n if (grid[0][0] == A || grid[n - 1][0] == A || grid[0][m - 1] == A || n grid[n - 1][m - 1] == A ) { n cout << 2 << n ; n return; n } n for (int i = 0; i < n; i++) { n if (grid[i][0] == A || grid[i][m - 1] == A ) { n cout << 3 << n ; n return; n } n } n for (int j = 0; j < m; j++) { n if (grid[0][j] == A || grid[n - 1][j] == A ) { n cout << 3 << n ; n return; n } n } n cout << 4 << n ; n } n signed main() { n cin.tie(0), cout.tie(0); n ios::sync_with_stdio(0); n int q; n cin >> q; n while (q--) solve(); n return 0; n } n "} +{"func_code_string": "#include n #pragma warning(disable : 4996) n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n string s, t; n cin >> s >> t; n int n = s.size(), m = t.size(); n vector > f(n + 1); n vector > what(n + 1); n vector > > from(n + 1); n for (int i = 0; i < int((f).size()); i++) n f[i].resize(m + 1), what[i].resize(m + 1), from[i].resize(m + 1); n for (int i = 0; i <= n; ++i) n for (int j = 0; j <= m; ++j) { n if (i == 0 && j == 0) continue; n int a, b, c, d; n a = b = c = d = 1000000000; n if (i - 1 >= 0 && j - 1 >= 0 && s[i - 1] == t[j - 1]) a = f[i - 1][j - 1]; n if (i - 1 >= 0) b = f[i - 1][j] + 1; n if (j - 1 >= 0) c = f[i][j - 1] + 1; n if (i - 1 >= 0 && j - 1 >= 0) d = f[i - 1][j - 1] + 1; n int mn = min(min(a, b), min(c, d)); n if (mn == b) n what[i][j] = 1, from[i][j] = make_pair(i - 1, j); n else if (mn == c) n what[i][j] = 2, from[i][j] = make_pair(i, j - 1); n else if (mn == d) n what[i][j] = 3, from[i][j] = make_pair(i - 1, j - 1); n else n from[i][j] = make_pair(i - 1, j - 1); n f[i][j] = mn; n } n cout << f[n][m] << endl; n int i = n, j = m; n while (i != 0 || j != 0) { n if (what[i][j] == 1) n cout << DELETE << i << endl; n else if (what[i][j] == 2) n cout << INSERT << i + 1 << << t[j - 1] << endl; n else if (what[i][j] == 3) n cout << REPLACE << i << << t[j - 1] << endl; n pair h = from[i][j]; n i = h.first; n j = h.second; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int m = pow(10, 9) + 7; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n string s, t; n cin >> s >> t; n int j = 0, l = -1, r = -1; n for (int i = 0; i < t.length(); i++) { n if (s[j] == t[i]) j++; n if (j == s.length()) { n l = i + 1; n break; n } n } n reverse(s.begin(), s.end()); n j = 0; n reverse(t.begin(), t.end()); n for (int i = 0; i < t.length(); i++) { n if (s[j] == t[i]) j++; n if (j == s.length()) { n r = t.length() - i; n break; n } n } n if (l >= r || l == -1 || r == -1) n cout << 0 << endl; n else n cout << r - l << endl; n return 0; n } n "} +{"func_code_string": "#include n bool local = false; n using namespace std; n template n string toString(T x) { n ostringstream sout; n sout << x; n return sout.str(); n } n template n void print(T v) { n cout << ((int)(v).size()) << n ; n for (auto x : v) cout << x << ; n cout << n ; n }; n template n void print1(T v) { n cout << ((int)(v).size()) << n ; n for (auto x : v) cout << x + 1 << ; n cout << n ; n }; n template n ostream &operator<<(ostream &o, pair x) { n return o << x.first << << x.second; n } n template n istream &operator>>(istream &o, pair &x) { n return o >> x.first >> x.second; n } n template n pair operator+(pair a, pair b) { n a.first += b.first; n a.second += b.second; n return a; n } n template n pair operator-(pair a, pair b) { n a.first -= b.first; n a.second -= b.second; n return a; n } n template n void operator+=(pair &a, pair b) { n a.first += b.first; n a.second += b.second; n } n template n void operator-=(pair &a, pair b) { n a.first -= b.first; n a.second -= b.second; n } n int nint() { n int x; n cin >> x; n return x; n } n double getTime() { return clock() / (double)CLOCKS_PER_SEC; }; n mt19937 rnd(0); n int rand(int n) { return rnd() % n; } n int rand(int l, int r) { return rnd() % (r - l + 1) + l; } n const int mod = 1000000000 + 7; n void initIO() { n if (local) { n freopen( input.txt , r , stdin); n srand((int)time(0)); n rnd.seed((int)time(0)); n } else { n } n { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n }; n } n void solve(); n int main() { n initIO(); n int tc = 1; n for (int tt = 0; tt < (tc); tt++) { n solve(); n } n if (local) n cout << n n << time = << getTime() << n ; n } n int n; n int m; n vector v1, v2; n pair val[300500]; n bool f1(int a, int b) { return val[a].second > val[b].second; } n bool f2(int a, int b) { return val[a].second < val[b].second; } n void solve() { n cin >> n; n for (int i = 0; i < (n); i++) { n pair o; n cin >> o; n val[i] = o; n if (o.first > o.second) n v2.emplace_back(i); n else n v1.emplace_back(i); n } n sort(v1.begin(), v1.end(), f1); n sort(v2.begin(), v2.end(), f2); n if (((int)(v1).size()) > ((int)(v2).size())) n print1(v1); n else n print1(v2); n } n "} +{"func_code_string": "#include n using namespace std; n #define FOR(i, n) for (int (i) = 0; (i) < (n); (i)++) n #define FORI(i, a, b) for (int (i) = (a); (i) < (b); (i)++) n n #define ll long long n #define mp(m, n) make_pair((m), (n)) n // #define DEBUG n n #ifdef DEBUG n template n void _debug(string s, T x) { n cerr << s << : ; n for (auto it = x.begin(); it != x.end(); ++it) { n cerr << << *it; n } n cerr << endl; n } n n template n void _debug(string s, map x) { n cerr << s << : ; n for (auto it = x.begin(); it != x.end(); ++it) { n cerr << << it->first << : << it->second; n } n cerr << endl; n } n n template n void _debug(string s, set x) { n cerr << s << : ; n for (auto it = x.begin(); it != x.end(); ++it) { n cerr << << *it; n } n cerr << endl; n } n n template n void _debug(string s, vector > x) { n cerr << s << : ; n for (auto it = x.begin(); it != x.end(); ++it) { n cerr << << it->first << , << it->second; n } n cerr << endl; n } n n void _debug(string s, int x) { n cerr << s << : << x << endl; n } n void _debug(string s, long long x) { n cerr << s << : << x << endl; n } n void _debug(string s, double x) { n cerr << s << : << x << endl; n } n #define debug(x) _debug(#x, (x)) n #else n #define debug(x) n #endif n n #define db debug n n const long long N = 2e3 + 4; n int t[4*N] = {}; n n void add(int L, int R, int val, int index = 1, int l = 1, int r = N - 1) { n n if (L > R) return; n if (r < L || l > R) return; n if (L <= l && r <= R) {t[index] += val; return; } n int mid = (l + r) / 2; n // debug(l);debug(r);debug(mid); n add(L, R, val, index * 2, l, mid); n add(L, R, val, index * 2 + 1, mid + 1, r); n n // if (pos < l || pos > r) return; n // if (l == r) { n // t[index] = val; n // return; n // } n // int mid = (l + r) / 2; n // upd(pos, val, index * 2, l, mid); n // upd(pos, val, index * 2 + 1, mid + 1, r); n // t[index] = min(t[index * 2], t[index * 2 + 1]); n } n n int get_val(int pos, int index = 1, int l = 1, int r = N - 1) { n if (pos < l || pos > r) return 0; n if (l == r) { n return t[index]; n } n int mid = (l + r) / 2; n return t[index] + get_val(pos, index * 2, l, mid) + get_val(pos, index * 2 + 1, mid + 1, r); n } n n inline int in(int a, int b, int c, int d) { n int x = max(a, c); n int y = min(b, d); n return max(0, y - x + 1); n } n n int main() { n ios_base::sync_with_stdio(false); std::cin.tie(0); n int n, m, k; n cin >> n >> m >> k; n vector l(m), r(m); n FOR(i, m) cin >> l[i] >> r[i]; n int R = 0; n for (int i = 1; i + k - 1 <= n; i++) { n memset(t, 0, sizeof(t)); n int ans = 0; n for (int j = 0; j < m; j++) { n ans += in(i, i + k - 1, l[j], r[j]); n int x, y; n x = max(i + 1, l[j] - k + 1); n y = l[j]; n vector vvv; n vvv = {x, y, 1}; n debug(vvv); n add(x, y, 1); n // int xx = r[j] - k + 2; n // int yy = r[j] + 1; n // yy = min(yy, xx + y - x); n int xx = r[j] - k + 2; n int yy = r[j] + 1; n xx = max(i + 1, xx); n yy = min(yy, xx + y - x); n n add(xx, yy, -1); n vvv = {xx, yy, -1}; n debug(vvv); n } n debug(i); n debug(ans); n R = max(R, ans); n for (int j = i + 1; j + k - 1 <= n; j++) { n ans += get_val(j); n R = max(R, ans); n debug(j); debug(ans); n } n } n cout << R << endl; n } n n n n "} +{"func_code_string": "#include n using namespace std; n inline unsigned RD() { n unsigned intmp(0); n char rdch(getchar()); n while (rdch < 0 || rdch > 9 ) rdch = getchar(); n while (rdch >= 0 && rdch <= 9 ) { n intmp = (intmp << 3) + (intmp << 1) + rdch - 0 ; n rdch = getchar(); n } n return intmp; n } n inline int RDsg() { n int rdtp(0), rdsg(1); n char rdch(getchar()); n while ((rdch < 0 || rdch > 9 ) && (rdch != - )) rdch = getchar(); n if (rdch == - ) { n rdsg = -1; n rdch = getchar(); n } n while (rdch >= 0 && rdch <= 9 ) { n rdtp = (rdtp << 3) + (rdtp << 1) + rdch - 0 ; n rdch = getchar(); n } n return rdtp * rdsg; n } n unsigned Bd[500005], Pos1[500005], Pos2[500005], m, n, q, Cnt(0), A, B, C, D, t, n Ans(0); n char a[500005], b[500005]; n inline void Clr() {} n int main() { n n = RD(), m = RD(), q = RD(); n scanf( %s%s , a + 1, b + 1); n Bd[0] = -1; n for (register unsigned i(2), Tmp; i <= m; ++i) { n Tmp = Bd[i - 1]; n while ((b[i] ^ b[Tmp + 1]) && (Tmp < 0x3f3f3f3f)) { n Tmp = Bd[Tmp]; n } n Bd[i] = Tmp + 1; n } n for (register unsigned i(1), j(0); i <= n; ++i) { n while ((a[i] ^ b[j + 1]) && (j < 0x3f3f3f3f)) { n j = Bd[j]; n } n if (j > 0x3f3f3f3f) { n j = 0; n continue; n } else { n ++j; n if (Pos1[j] < q) { n Pos1[j] = i; n } n if ((j == m) && (!A)) { n A = i; n } n } n } n for (register unsigned i(m - 1); i; --i) { n if ((Pos1[i + 1] > q) && Pos1[i + 1]) { n Pos1[i] = min(Pos1[i], Pos1[i + 1] - 1); n } n } n for (register unsigned i(m); i; --i) { n if (Pos1[i] < q) { n Pos1[i] = 0; n continue; n } n if (Pos1[Bd[i]] < q) n Pos1[Bd[i]] = Pos1[i]; n else n Pos1[Bd[i]] = min(Pos1[Bd[i]], Pos1[i]); n } n Bd[m + 1] = -1; n Bd[m] = 0; n for (register unsigned i(m - 1), Tmp; i; --i) { n Tmp = Bd[i + 1]; n while ((b[i] ^ b[m - Tmp]) && (Tmp < 0x3f3f3f3f)) { n Tmp = Bd[m - Tmp + 1]; n } n Bd[i] = Tmp + 1; n } n for (register unsigned i(n), j(0); i; --i) { n while ((j < 0x3f3f3f3f) && (a[i] ^ b[m - j])) { n j = Bd[m - j + 1]; n } n if (j > 0x3f3f3f3f) { n j = 0; n continue; n } else { n if ((n - Pos2[m - j] + 1 < q) || (!Pos2[m - j])) { n Pos2[m - j] = i; n } n ++j; n if ((j == m) && (!B)) { n B = i; n } n } n } n for (register unsigned i(2); i <= m; ++i) { n if ((n - Pos2[i - 1] + 1 > q) && (Pos2[i - 1])) { n Pos2[i] = max(Pos2[i], Pos2[i - 1] + 1); n } n } n for (register unsigned i(1); i <= m; ++i) { n if (n - Pos2[i] + 1 < q) { n Pos2[i] = 0; n continue; n } n if (n - Pos2[m - Bd[i] + 1] + 1 < q) n Pos2[m - Bd[i] + 1] = Pos2[i]; n else n Pos2[m - Bd[i] + 1] = max(Pos2[i], Pos2[m - Bd[i] + 1]); n } n if (q >= m) { n if (A && (n >= q + max(A, q))) { n printf( Yes n%u %u n , max(A, q) - q + 1, max(A, q) + 1); n return 0; n } n if (B && (min(B, n - q + 1) > q)) { n printf( Yes n%u %u n , min(B, n - q + 1) - q, min(B, n - q + 1)); n return 0; n } n } n for (register unsigned i(m - min(m - 1, q)); i <= min(m - 1, q); ++i) { n if (Pos1[i] && Pos2[i + 1] && (Pos1[i] < Pos2[i + 1])) { n printf( Yes n%u %u n , Pos1[i] - q + 1, Pos2[i + 1]); n return 0; n } n } n printf( No n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long BIG = 1000000000000000000LL; n void solve(); n signed main() { n ios::sync_with_stdio(false); n cin.tie(0); n solve(); n return 0; n } n const long long borne = 3 * (long long)(1e5) + 5; n long long tab[borne]; n long long som[borne]; n long long nbElem, nbParties; n void solve() { n cin >> nbElem >> nbParties; n for (long long i = (0); i < (nbElem); ++i) { n cin >> tab[i]; n } n som[0] = tab[0]; n for (long long i = (1); i < (nbElem); ++i) som[i] = tab[i] + som[i - 1]; n vector ww(nbElem - 1); n for (long long i = (0); i < (nbElem - 1); ++i) ww[i] = som[i]; n sort(ww.begin(), ww.end()); n long long res = nbParties * som[nbElem - 1]; n for (long long i = (0); i < (nbParties - 1); ++i) res -= ww[i]; n cout << res << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long a, b, c, x; n cin >> a >> b >> c; n if (a * c % 100 == 0) n x = (a * c) / 100; n else n x = (a * c) / 100 + 1; n if (x < b) n cout << 0 << endl; n else n cout << x - b << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n char name[20]; n int id; n int num; n } a[100005]; n bool cmp(node x, node y) { n if (x.id == y.id) return x.num > y.num; n return x.id < y.id; n } n int main() { n int n, m; n while (cin >> n >> m) { n for (int i = 0; i < n; i++) { n scanf( %s %d %d , a[i].name, &a[i].id, &a[i].num); n } n sort(a, a + n, cmp); n int st = 0, ed = 0; n for (st = 0; st < n; st = ed) { n while (ed < n && a[ed].id == a[st].id) ed++; n int fir = a[st].num; n int sec = a[st + 1].num; n if (ed - st > 2 && sec == a[st + 2].num) { n printf( ? n ); n } else { n printf( %s %s n , a[st].name, a[st + 1].name); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( unroll-loops ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n using namespace std; n const int maxn = 4e2 + 5, maxk = 4e2 + 5, inf = 1e9 + 69, delta = 1e9 + 7, n max_sum = 10000 + 5; n inline void in_out_optimize() { n ios::sync_with_stdio(false); n cout.tie(0); n cin.tie(0); n } n int main() { n in_out_optimize(); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n long long eq = inf - (inf % n); n set dest; n for (int i = 0; i < n; i++) { n int a; n cin >> a; n if (a < 0) a += eq; n a %= n; n dest.insert((i + a) % n); n } n if (dest.size() == n) n cout << YES n ; n else n cout << NO n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int k; n string n, m; n int a[1001], b[1001], ns, ms; n int fs, ss; n int lcm(int, int); n int gcd(int, int); n int main() { n cin >> k >> n >> m; n ns = n.size(); n ms = m.size(); n for (int i = 0; i < ns; i++) { n a[i] = (n[i] == R ? 0 : (n[i] == P ? 1 : 2)); n } n for (int i = 0; i < ms; i++) { n b[i] = (m[i] == R ? 0 : (m[i] == P ? 1 : 2)); n } n int q = 0, p = 0, l = lcm(ns, ms); n for (int i = 0; i < l; i++) { n if ((a[q] == 0 && b[p] == 2) || (a[q] == 2 && b[p] == 1) || n (a[q] == 1 && b[p] == 0)) n fs++; n else if (a[q] != b[p]) n ss++; n q++, p++; n if (q == ns) q = 0; n if (p == ms) p = 0; n } n fs *= k / l; n ss *= k / l; n p = q = 0; n for (int i = 0; i < k % l; i++) { n if ((a[q] == 0 && b[p] == 2) || (a[q] == 2 && b[p] == 1) || n (a[q] == 1 && b[p] == 0)) n fs++; n else if (a[q] != b[p]) n ss++; n q++, p++; n if (q == ns) q = 0; n if (p == ms) p = 0; n } n cout << ss << << fs; n } n int lcm(int q, int p) { return q * p / gcd(q, p); } n int gcd(int q, int p) { n if (q > p) { n q += p, p = q - p, q -= p; n } n if (!q) return p; n return gcd(p - q, q); n } n "} +{"func_code_string": "#include n using namespace std; n int rd() { n int x = 0, flg = 1; n char c = getchar(); n for (; (c < 48 || c > 57) && c != - ; c = getchar()) n ; n if (c == - ) flg = -1, c = getchar(); n for (; c > 47 && c < 58; x = x * 10 + c - 48, c = getchar()) n ; n return flg * x; n } n const int mxn = 100010; n struct nd { n int sm, px, py, sx, sy, mx, ml, mr, _px, _py, _sx, _sy, _mx, _ml, _mr; n nd operator!() { n return (nd){-sm, -_px, _py, -_sx, _sy, -_mx, _ml, _mr, n -px, py, -sx, sy, -mx, ml, mr}; n } n } tr[mxn << 2], ret; n int tag[mxn << 2]; n void mrg(nd x, nd y) { n ret.sm = x.sm + y.sm; n if (x.px < x.sm + y.px) n ret.px = x.px, ret.py = x.py; n else n ret.px = x.sm + y.px, ret.py = y.py; n if (y.sx < y.sm + x.sx) n ret.sx = y.sx, ret.sy = y.sy; n else n ret.sx = y.sm + x.sx, ret.sy = x.sy; n if (x.mx < y.mx) n if (x.mx < x.sx + y.px) n ret.mx = x.mx, ret.ml = x.ml, ret.mr = x.mr; n else n ret.mx = x.sx + y.px, ret.ml = x.sy, ret.mr = y.py; n else if (y.mx < x.sx + y.px) n ret.mx = y.mx, ret.ml = y.ml, ret.mr = y.mr; n else n ret.mx = x.sx + y.px, ret.ml = x.sy, ret.mr = y.py; n if (x._px > x.sm + y._px) n ret._px = x._px, ret._py = x._py; n else n ret._px = x.sm + y._px, ret._py = y._py; n if (y._sx > y.sm + x._sx) n ret._sx = y._sx, ret._sy = y._sy; n else n ret._sx = y.sm + x._sx, ret._sy = x._sy; n if (x._mx > y._mx) n if (x._mx > x._sx + y._px) n ret._mx = x._mx, ret._ml = x._ml, ret._mr = x._mr; n else n ret._mx = x._sx + y._px, ret._ml = x._sy, ret._mr = y._py; n else if (y._mx > x._sx + y._px) n ret._mx = y._mx, ret._ml = y._ml, ret._mr = y._mr; n else n ret._mx = x._sx + y._px, ret._ml = x._sy, ret._mr = y._py; n } n void mrg_rev(nd x, nd y) { n ret.sm = -x.sm - y.sm; n if (x._px > x.sm + y._px) n ret.px = -x._px, ret.py = x._py; n else n ret.px = -x.sm - y._px, ret.py = y._py; n if (y._sx > y.sm + x._sx) n ret.sx = -y._sx, ret.sy = y._sy; n else n ret.sx = -y.sm - x._sx, ret.sy = x._sy; n if (x._mx > y._mx) n if (x._mx > x._sx + y._px) n ret.mx = -x._mx, ret.ml = x._ml, ret.mr = x._mr; n else n ret.mx = -x._sx - y._px, ret.ml = x._sy, ret.mr = y._py; n else if (y._mx > x._sx + y._px) n ret.mx = -y._mx, ret.ml = y._ml, ret.mr = y._mr; n else n ret.mx = -x._sx - y._px, ret.ml = x._sy, ret.mr = y._py; n if (x.px < x.sm + y.px) n ret._px = -x.px, ret._py = x.py; n else n ret._px = -x.sm - y.px, ret._py = y.py; n if (y.sx < y.sm + x.sx) n ret._sx = -y.sx, ret._sy = y.sy; n else n ret._sx = -y.sm - x.sx, ret._sy = x.sy; n if (x.mx < y.mx) n if (x.mx < x.sx + y.px) n ret._mx = -x.mx, ret._ml = x.ml, ret._mr = x.mr; n else n ret._mx = -x.sx - y.px, ret._ml = x.sy, ret._mr = y.py; n else if (y.mx < x.sx + y.px) n ret._mx = -y.mx, ret._ml = y.ml, ret._mr = y.mr; n else n ret._mx = -x.sx - y.px, ret._ml = x.sy, ret._mr = y.py; n } n void pushup(int i) { n if (tag[i]) n mrg_rev(tr[(i << 1)], tr[(i << 1 | 1)]); n else n mrg(tr[(i << 1)], tr[(i << 1 | 1)]); n tr[i] = ret; n } n void update(int i, int l, int r, int p, int v) { n if (l == r) { n tr[i] = (nd){v, v, l, v, l, v, l, l, v, l, v, l, v, l, l}; n return; n } n if (p <= ((l + r) >> 1)) n update((i << 1), l, ((l + r) >> 1), p, v); n else n update((i << 1 | 1), ((l + r) >> 1) + 1, r, p, v); n pushup(i); n } n void modify(int i, int l, int r, int x, int y) { n if (r < x || l > y) return; n if (l >= x && r <= y) { n tag[i] ^= 1, tr[i] = !tr[i]; n return; n } n modify((i << 1), l, ((l + r) >> 1), x, y); n modify((i << 1 | 1), ((l + r) >> 1) + 1, r, x, y); n pushup(i); n } n int tot, id[mxn], fl[mxn], bl[mxn], br[mxn]; n void query(int i, int l, int r, int x, int y, bool fg) { n if (r < x || l > y) return; n if (l >= x && r <= y) { n id[++tot] = i; n fl[tot] = fg; n bl[tot] = l, br[tot] = r; n return; n } n query((i << 1), l, ((l + r) >> 1), x, y, fg ^ tag[i]); n query((i << 1 | 1), ((l + r) >> 1) + 1, r, x, y, fg ^ tag[i]); n } n void qry() { n if (fl[1]) n ret = !tr[id[1]]; n else n ret = tr[id[1]]; n for (int i = 2; i <= tot; ++i) n if (fl[i]) n mrg(ret, !tr[id[i]]); n else n mrg(ret, tr[id[i]]); n } n int n, q, a[mxn], qi[mxn], ql[mxn], qr[mxn], qx[mxn], qy[mxn]; n void build(int i, int l, int r) { n if (l == r) { n tr[i] = n (nd){a[l], a[l], l, a[l], l, a[l], l, l, a[l], l, a[l], l, a[l], l, l}; n return; n } n build((i << 1), l, ((l + r) >> 1)), n build((i << 1 | 1), ((l + r) >> 1) + 1, r); n pushup(i); n } n int main() { n n = rd(); n for (int i = 1; i <= n; ++i) a[i] = rd(); n build(1, 1, n); n q = rd(); n for (int i = 1; i <= q; ++i) n if (rd()) { n int l = rd(), r = rd(), k = rd(), m = 0, ans = 0; n tot = 0; n query(1, 1, n, l, r, 0); n for (; k--;) { n qry(); n if (ret._mx <= 0) break; n ans += ret._mx; n int x = ret._ml, y = ret._mr; n modify(1, 1, n, x, y); n ql[++m] = x, qr[m] = y; n } n printf( %d n , ans); n for (int j = 1; j <= m; ++j) modify(1, 1, n, ql[j], qr[j]); n } else { n int x = rd(), y = rd(); n update(1, 1, n, x, y); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char buf[1 << 21], *p1 = buf, *p2 = buf; n template n void read(T &x) { n x = 0; n int c = getchar(); n int flag = 0; n while (c < 0 || c > 9 ) flag |= (c == - ), c = getchar(); n while (c >= 0 && c <= 9 ) n x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); n if (flag) x = -x; n } n template n T _max(T a, T b) { n return b < a ? a : b; n } n template n T _min(T a, T b) { n return a < b ? a : b; n } n template n bool checkmax(T &a, T b) { n return a < b ? a = b, 1 : 0; n } n template n bool checkmin(T &a, T b) { n return b < a ? a = b, 1 : 0; n } n const int N = 1000005; n int n; n int a[N], b[N], sa[N], sb[N]; n void init() { n read(n); n for (int i = 1; i <= n; ++i) read(a[i]); n for (int i = 1; i <= n; ++i) read(b[i]); n sa[n + 1] = 0; n for (int i = n; i >= 1; --i) sa[i] = sa[i + 1] + a[i]; n sb[0] = 0; n for (int i = 1; i <= n; ++i) sb[i] = sb[i - 1] + b[i]; n } n void solve() { n int ans = -1; n for (int i = 1; i <= n; ++i) { n int w = max(sb[i - 1], sa[i + 1]); n if (i == 1) n ans = w; n else n checkmin(ans, w); n } n printf( %d n , ans); n } n int main() { n int t; n read(t); n while (t--) { n init(); n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n double dist(double x1, double y1, double x2, double y2) { n double dx = x1 - x2; n double dy = y1 - y2; n return sqrt(dx * dx + dy * dy); n } n double catet(double a, int b) { n double z = a * a - b * b; n if (z < 1e-12) z = 0; n return sqrt(z); n } n int main() { n int xp, yp, vp; n cin >> xp >> yp >> vp; n int x, y, v, r; n cin >> x >> y >> v >> r; n const double eps = 1e-10; n const double R = sqrt(1.0 * xp * xp + 1.0 * yp * yp); n double lo = 0; n double hi = 1e7; n double T; n while ((hi - lo) / hi > eps) { n T = (lo + hi) / 2; n const double alpha = T / (R / vp); n double nx = xp * cos(alpha) - yp * sin(alpha); n double ny = xp * sin(alpha) + yp * cos(alpha); n double a = ny - y; n double b = x - nx; n double c = -(a * x + b * y); n double z = sqrt(a * a + b * b); n a /= z; n b /= z; n c /= z; n double need; n if (fabs(c) < r - 1e-8) { n double mx = a * (-c); n double my = b * (-c); n if (dist(x, y, mx, my) + dist(mx, my, nx, ny) > n dist(x, y, nx, ny) + 1e-8) { n need = dist(x, y, nx, ny); n } else { n need = catet(dist(x, y, 0, 0), r) + catet(dist(nx, ny, 0, 0), r); n double alp = fabs(atan2(y, x) - atan2(ny, nx)); n if (alp > M_PI) alp = 2 * M_PI - alp; n alp -= acos(r / dist(x, y, 0, 0)); n alp -= acos(r / dist(nx, ny, 0, 0)); n need += alp * r; n } n } else { n need = dist(x, y, nx, ny); n } n if (need <= v * T) { n hi = T; n } else { n lo = T; n } n } n printf( %.6f n , T); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ii = pair; n using vi = vector; n const int N = 2 * 5e5 + 5; n int n, m, q; n int par[N], sub[N]; n int p[N]; n struct edge { n int l, r, tag = 0; n } elist[N]; n vi g[N]; n int dp[19][500005]; n const int lg = 19; n int position[N]; n int in[N], out[N], tym = 0; n int what[N]; n void setPar(int u, int dad) { n dp[0][u] = dad; n for (int i = 1; i < lg; ++i) { n dp[i][u] = dp[i - 1][dp[i - 1][u]]; n } n } n void dfs(int u) { n if (u <= n) { n in[u] = out[u] = ++tym; n what[tym] = u; n position[p[u]] = tym; n } else { n in[u] = INT_MAX; n out[u] = INT_MIN; n for (int v : g[u]) { n setPar(v, u); n dfs(v); n in[u] = min(in[u], in[v]); n out[u] = max(out[u], out[v]); n } n } n } n int getHighest(int u, int tag) { n for (int i = lg - 1; i >= 0; --i) { n if (dp[i][u]) { n if (elist[dp[i][u] - n].tag >= tag) { n u = dp[i][u]; n } n } n } n return u; n } n int find(int u) { return par[u] == u ? u : par[u] = find(par[u]); } n int mx[N]; n void build(int u = 1, int b = 1, int e = n) { n if (b == e) { n return void(mx[u] = p[what[b]]); n } n int mid = (b + e) >> 1; n build(u << 1, b, mid); n build(u << 1 | 1, mid + 1, e); n mx[u] = max(mx[u << 1], mx[u << 1 | 1]); n } n int Max(int l, int r, int u = 1, int b = 1, int e = n) { n if (l <= b and e <= r) return mx[u]; n if (b > r or e < l) return INT_MIN; n int mid = (b + e) >> 1; n return max(Max(l, r, u << 1, b, mid), Max(l, r, u << 1 | 1, mid + 1, e)); n } n void makeZero(int pos, int u = 1, int b = 1, int e = n) { n if (b == e) { n return void(mx[u] = 0); n } n int mid = (b + e) >> 1; n if (pos <= mid) { n makeZero(pos, u << 1, b, mid); n } else { n makeZero(pos, u << 1 | 1, mid + 1, e); n } n mx[u] = max(mx[u << 1], mx[u << 1 | 1]); n } n int main(int argc, char const *argv[]) { n scanf( %d %d %d , &n, &m, &q); n for (int i = 1; i <= n; ++i) { n scanf( %d , &p[i]); n } n for (int i = 1; i < N; ++i) { n par[i] = i, sub[i] = 1; n } n for (int i = 1; i <= m; ++i) { n scanf( %d %d , &elist[i].l, &elist[i].r); n } n vector updates; n for (int i = 1; i <= q; ++i) { n int x, y; n scanf( %d %d , &x, &y); n updates.emplace_back(x, y); n if (x == 2) { n elist[y].tag = i; n } n } n for (int i = 1; i <= m; ++i) { n if (!elist[i].tag) { n elist[i].tag = q + i; n } n } n vi perm(m); n iota(begin(perm), end(perm), 1); n sort(begin(perm), end(perm), n [](int x, int y) { return elist[x].tag > elist[y].tag; }); n for (int i : perm) { n int nu = n + i; n int x = find(elist[i].l); n int y = find(elist[i].r); n if (x != y) { n par[x] = par[y] = nu; n g[nu].emplace_back(x); n g[nu].emplace_back(y); n } n } n for (int i = 2; i <= 4; ++i) { n } n set roots; n for (int i = 1; i <= n; ++i) { n roots.insert(find(i)); n } n for (int x : roots) { n setPar(x, 0); n dfs(x); n } n build(); n vi ans; n for (int i = 0; i < (int)(updates).size(); ++i) { n int tag = i + 1; n auto [op, u] = updates[i]; n if (op == 1) { n int anc = getHighest(u, tag); n int mxVal = Max(in[anc], out[anc]); n ans.emplace_back(mxVal); n if (mxVal) makeZero(position[mxVal]); n } else { n } n } n for (int x : ans) { n printf( %d n , x); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, q; n long long f(long long md) { return n - md + min(n - md, md * (md - 1) / 2); } n signed main() { n cin >> q; n while (q--) { n cin >> n; n long long lo = 1, hi = n; n while (lo + 1 < hi) { n long long md = (lo + hi) >> 1; n if (f(md) < f(md + 1)) n lo = md; n else n hi = md; n } n cout << max(f(hi), f(lo)) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int Maxn = 100005; n int n, q, tree_ct, k[Maxn], r[Maxn], ord[Maxn], Head[Maxn]; n struct Tree { n int lson, rson; n long long k, b; n } tree[24 * Maxn]; n void build_first(int root, int lt, int rt) { n if (lt + 1 == rt) n tree[root].k = k[lt], tree[root].b = 0; n else { n int mid = (lt + rt) >> 1; n tree[root].lson = ++tree_ct; n tree[root].rson = ++tree_ct; n build_first(tree[root].lson, lt, mid); n build_first(tree[root].rson, mid, rt); n tree[root].k = tree[tree[root].lson].k + tree[tree[root].rson].k; n tree[root].b = tree[tree[root].lson].b + tree[tree[root].rson].b; n } n } n void build(int root, int las, int lt, int rt, int pos) { n if (lt + 1 == rt) n tree[root].k = 0, tree[root].b = r[lt]; n else { n int mid = (lt + rt) >> 1; n if (pos >= mid) { n tree[root].rson = ++tree_ct; n tree[root].lson = tree[las].lson; n build(tree[root].rson, tree[las].rson, mid, rt, pos); n } else { n tree[root].lson = ++tree_ct; n tree[root].rson = tree[las].rson; n build(tree[root].lson, tree[las].lson, lt, mid, pos); n } n tree[root].k = tree[tree[root].lson].k + tree[tree[root].rson].k; n tree[root].b = tree[tree[root].lson].b + tree[tree[root].rson].b; n } n } n pair operator+(pair a, n pair b) { n return make_pair(a.first + b.first, a.second + b.second); n } n pair ask(int root, int lt, int rt, int L, int R) { n if (lt == L && rt == R) n return make_pair(tree[root].k, tree[root].b); n else { n int mid = (lt + rt) >> 1; n if (L >= mid) n return ask(tree[root].rson, mid, rt, L, R); n else if (R <= mid) n return ask(tree[root].lson, lt, mid, L, R); n else n return ask(tree[root].lson, lt, mid, L, mid) + n ask(tree[root].rson, mid, rt, mid, R); n } n } n struct sta { n int lt, rt; n double t; n bool operator<(const sta &tmp) const { return lt < tmp.lt; } n }; n set Se; n set::iterator spilt(int x) { n if (x > n) return Se.end(); n sta tmp = *(--Se.upper_bound((sta){x, 0, 0})); n Se.erase(tmp); n if (tmp.lt != x) Se.insert((sta){tmp.lt, x - 1, tmp.t}); n return Se.insert((sta){x, tmp.rt, tmp.t}).first; n } n pair cal(double t, int lt, int rt) { n int L = 0, R = n; n while (L + 1 <= R) { n int mid = (L + R + 1) >> 1; n if (r[ord[mid]] > t * k[ord[mid]]) n R = mid - 1; n else n L = mid; n } n return ask(Head[L], 1, n + 1, lt, rt + 1); n } n set > S; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n int x; n scanf( %d%d%d , &x, &r[i], &k[i]), ord[i] = i; n if (!r[i] && !k[i]) r[i] = 1; n if (k[i]) n Se.insert((sta){i, i, -x / (double)k[i]}); n else n Se.insert((sta){i, i, 0}), S.insert(make_pair(i, x)); n } n S.insert(make_pair(n + 1, 0)); n Head[0] = ++tree_ct; n build_first(Head[0], 1, n + 1); n sort(ord + 1, ord + 1 + n, [](int x, int y) { n return r[x] * (long long)k[y] < r[y] * (long long)k[x]; n }); n for (int i = 1; i <= n; i++) n Head[i] = ++tree_ct, build(Head[i], Head[i - 1], 1, n + 1, ord[i]); n scanf( %d , &q); n while (q--) { n int t, lt, rt; n long long ans = 0; n scanf( %d%d%d , &t, <, &rt); n set >::iterator it; n while (S.size() > 1 && n (it = S.lower_bound(make_pair(lt, 0)))->first <= rt) { n ans += it->second; n S.erase(it); n } n set::iterator it_r = spilt(rt + 1), it_l = spilt(lt), tmp_it; n tmp_it = it_l; n for (; it_l != it_r; it_l++) { n pair now = cal(t - it_l->t, it_l->lt, it_l->rt); n ans += now.second + (long long)(now.first * (t - it_l->t) + 0.5); n } n Se.erase(tmp_it, it_r); n Se.insert((sta){lt, rt, (double)t}); n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 100005; n long long n, x[maxn], y[maxn]; n bool flag; n inline long long nxt(long long id) { return (id + 1) % n; } n inline bool check(long long i, long long j) { n return (x[i] + x[j] == x[nxt(i)] + x[nxt(j)]) && n (y[i] + y[j] == y[nxt(i)] + y[nxt(j)]); n } n int main() { n scanf( %lld , &n); n if (n % 2 == 1) { n printf( No n ); n return 0; n } n for (register long long i = 0; i < n; i++) scanf( %lld%lld , &x[i], &y[i]); n for (register long long i = 0; i * 2 < n; i++) n if (!check(i, i + (n / 2))) { n flag = true; n break; n } n if (flag) n printf( No n ); n else n printf( Yes n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long GCD(long long a, long long b) { n while (b) { n a %= b; n swap(a, b); n } n return a; n } n int main() { n int n, k, i; n long double x, y, xant, yant; n scanf( %d%d , &n, &k); n double sol = 0; n for (i = 0; i < n; i++) { n cin >> x >> y; n if (i) sol += sqrt((x - xant) * (x - xant) + (y - yant) * (y - yant)); n xant = x, yant = y; n } n sol = (sol * (long double)k) / 50.0; n printf( %.9lf n , sol); n return 0; n } n "} +{"func_code_string": "#include n inline int A(int x, int y) { return x && y; } n inline int O(int x, int y) { return x ^ y; } n inline int X(int x, int y) { return x || y; } n int main() { n int t1, t2, t3, t4; n scanf( %d%d%d%d , &t1, &t2, &t3, &t4); n int a1 = O(t1, t2); n int a2 = X(t3, t4); n int a3 = A(t2, t3); n int a4 = O(t1, t4); n int b1 = A(a1, a2); n int b2 = X(a3, a4); n int c1 = O(b1, b2); n printf( %d , c1); n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ull = unsigned long long; n int t, n, m; n string x, y; n int main() { n cin >> t; n while (t--) { n cin >> x; n cin >> y; n n = (int)(x.length()); n m = (int)(y.length()); n reverse(x.begin(), x.end()); n reverse(y.begin(), y.end()); n int pos1 = 0; n while (y[pos1] != 1 ) { n ++pos1; n } n int pos2 = pos1; n while (x[pos2] != 1 ) { n ++pos2; n } n cout << pos2 - pos1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e5 + 5; n int w[MAXN]; n map f; n long long Calc(long long Res, long long Mod) { n if (Res > Mod) return Res % Mod + Mod; n return Res; n } n long long power(long long a, long long n, long long Mod) { n long long Res = 1; n while (n) { n if (n & 1) Res = Calc(Res * a, Mod); n a = Calc(a * a, Mod); n n >>= 1; n } n return Res; n } n int phi(int n) { n int result = 1; n if (f.count(n)) return f[n]; n for (int i = 2; i * i <= n; ++i) { n if (n % i == 0) { n while (n % i == 0) { n n /= i; n result *= i; n } n result /= i; n result *= (i - 1); n } n } n if (n != 1) result *= (n - 1); n f[n] = result; n return f[n]; n } n long long Solve(int l, int r, int Mod) { n if (l == r || Mod == 1) return Calc(w[l], Mod); n return power(w[l], Solve(l + 1, r, phi(Mod)), Mod); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int q, n, Mod; n cin >> n >> Mod; n for (int i = 1; i <= n; ++i) cin >> w[i]; n cin >> q; n while (q--) { n int l, r; n cin >> l >> r; n long long ans = Solve(l, r, Mod); n cout << ans % Mod << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int check(int x) { n int sum = 0; n if (n <= ceil(x / 2)) sum++; n if (m <= ceil(x / 3)) sum++; n if ((n + m <= ceil(x / 2) + ceil(x / 3) - ceil(x / 6))) sum++; n if (sum == 3) return 1; n return 0; n } n int main() { n cin >> n >> m; n int x; n x = max(2 * n, max(3 * m, (2 * n + 3 * m) / 2)); n for (int i = x; i <= 10000000; i++) { n if (check(i)) { n cout << i << endl; n break; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n char a[60][60]; n int ch(int r, int c) { n int i, j, f = 0; n for (i = 0; i < c; i++) { n if (a[0][i] == P ) f = 1; n } n if (f == 0) return 0; n f = 0; n for (i = 0; i < c; i++) { n if (a[r - 1][i] == P ) f = 1; n } n if (f == 0) return 0; n f = 0; n for (i = 0; i < r; i++) { n if (a[i][0] == P ) f = 1; n } n if (f == 0) return 0; n f = 0; n for (i = 0; i < r; i++) { n if (a[i][c - 1] == P ) f = 1; n } n return f; n } n int chh(int r, int c) { n int i, j, f = 0; n for (i = 1; i < r - 1; i++) { n f = 0; n for (j = 0; j < c; j++) { n if (a[i][j] == P ) f = 1; n } n if (f == 0) return 0; n } n for (i = 1; i < c - 1; i++) { n f = 0; n for (j = 0; j < r; j++) { n if (a[j][i] == P ) f = 1; n } n if (f == 0) return 0; n } n return 1; n } n int al(int r, int c) { n int i, j, f = 0; n for (i = 0; i < r; i++) { n for (j = 0; j < c; j++) { n if (a[i][j] == P ) return 1; n } n } n return 0; n } n int main() { n int t; n cin >> t; n while (t--) { n int r, c, i, j, f = 0; n cin >> r >> c; n cin.ignore(256, n ); n for (i = 0; i < r; i++) { n string s; n getline(cin, s); n for (j = 0; j < c; j++) a[i][j] = s[j]; n } n for (i = 0; i < r; i++) { n for (j = 0; j < c; j++) { n if (a[i][j] == A ) { n f = 1; n break; n } n } n } n if (f == 0) { n cout << MORTAL n ; n } else if (al(r, c) == 0) n cout << 0 << endl; n else { n if (ch(r, c) == 0) n cout << 1 << endl; n else if (a[0][0] == A || a[0][c - 1] == A || a[r - 1][0] == A || n a[r - 1][c - 1] == A || chh(r, c) == 0) n cout << 2 << endl; n else { n f = 0; n for (i = 1; i < c - 1; i++) { n if (a[0][i] == A ) f = 1; n if (a[r - 1][i] == A ) f = 1; n } n for (i = 1; i < r - 1; i++) { n if (a[i][0] == A ) f = 1; n if (a[i][c - 1] == A ) f = 1; n } n if (f == 1) n cout << 3 << endl; n else n cout << 4 << endl; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 100000; n int prime[MAXN + 1]; n void getPrime() { n memset(prime, 0, sizeof(prime)); n for (int i = 2; i <= MAXN; i++) { n if (!prime[i]) prime[++prime[0]] = i; n for (int j = 1; j <= prime[0] && prime[j] <= MAXN / i; j++) { n prime[prime[j] * i] = 1; n if (i % prime[j] == 0) break; n } n } n } n unordered_map Mcnt; n unordered_map M; n const int maxn = 105; n int a[maxn]; n int getsg(int S) { n if (S == 0) return 0; n if (M.count(S)) return M[S]; n vector V; n V.clear(); n for (int i = 0; i < 29; i++) n if (S & (1 << i)) V.push_back(i + 1); n int ma = 0; n for (int i = 0; i < V.size(); i++) ma = max(ma, V[i]); n int x[30]; n set pre; n pre.clear(); n for (int i = 1; i <= ma; i++) { n for (int j = 0; j < V.size(); j++) { n if (V[j] >= i) n x[j] = V[j] - i; n else n x[j] = V[j]; n } n int SS = 0; n for (int j = 0; j < V.size(); j++) { n if (x[j]) SS |= (1 << (x[j] - 1)); n } n pre.insert(getsg(SS)); n } n int now = 0; n while (pre.count(now)) now++; n M[S] = now; n return now; n } n int cnt[maxn]; n int main() { n getPrime(); n int ans = 0; n int n; n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1; i <= prime[0]; i++) { n memset(cnt, 0, sizeof(cnt)); n for (int j = 1; j <= n; j++) { n while (a[j] % prime[i] == 0) { n a[j] /= prime[i]; n cnt[j]++; n } n } n int S = 0; n for (int j = 1; j <= n; j++) n if (cnt[j]) S |= (1 << (cnt[j] - 1)); n ans ^= getsg(S); n } n for (int i = 1; i <= n; i++) n if (a[i] != 1) { n if (!Mcnt.count(a[i])) { n ans ^= 1; n Mcnt[a[i]] = true; n } n } n if (ans == 0) n printf( Arpa ); n else n printf( Mojtaba ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, k; n cin >> n >> m >> k; n vector> v; n vector cur; n if ((n * m) % k == 0) { n int div = (n * m) / k; n for (int i = 0; i < n; i++) { n if (!(i & 1)) { n for (int j = 0; j < m; j++) { n cur.push_back(i + 1); n cur.push_back(j + 1); n if (cur.size() >= div * 2) { n vector add = cur; n v.push_back(add); n cur.clear(); n } n } n } else { n for (int j = m - 1; j >= 0; j--) { n if (cur.size() <= div * 2) { n cur.push_back(i + 1); n cur.push_back(j + 1); n } n if (cur.size() >= div * 2) { n vector add = cur; n v.push_back(add); n cur.clear(); n } n } n } n } n } else { n int div = ((n * m) - 2) / (k - 1); n int count = 0; n int flag = 0; n for (int i = 0; i < n; i++) { n if (!(i & 1)) { n for (int j = 0; j < m; j++) { n if (count == k - 1 && flag == 0) { n div = (n * m - (k - 1) * (div)); n flag = 1; n } n cur.push_back(i + 1); n cur.push_back(j + 1); n if (cur.size() >= div * 2) { n vector add = cur; n v.push_back(add); n cur.clear(); n count++; n } n } n } else { n for (int j = m - 1; j >= 0; j--) { n if (count == k - 1 && flag == 0) { n div = (n * m - (k - 1) * (div)); n flag = 1; n } n if (cur.size() <= div * 2) { n cur.push_back(i + 1); n cur.push_back(j + 1); n } n if (cur.size() >= div * 2) { n vector add = cur; n v.push_back(add); n cur.clear(); n count++; n } n } n } n } n } n for (int i = 0; i < v.size(); i++) { n int s = v[i].size(); n s /= 2; n cout << s << ; n for (int j = 0; j < v[i].size(); j++) { n cout << v[i][j] << ; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = (int)1e5 + 7; n int n; n int v[N], f[N]; n bool e[N]; n int st, dr; n bool ok(int l, int r) { n for (int i = 1; i <= n; i++) { n e[i] = 0; n f[i] = 0; n } n for (int i = l; i <= r; i++) { n e[i] = 1; n f[v[i]]++; n } n for (int i = 1; i < n + 1 - i; i++) { n if (e[i] == 1 && e[n + 1 - i] == 0) { n if (f[v[n + 1 - i]] > 0) { n f[v[n + 1 - i]]--; n } else { n return 0; n } n } n if (e[i] == 0 && e[n + 1 - i] == 1) { n if (f[v[i]] > 0) { n f[v[i]]--; n } else { n return 0; n } n } n if (e[i] == 0 && e[n + 1 - i] == 0 && v[i] != v[n + 1 - i]) { n return 0; n } n } n int cntimp = 0; n for (int i = 1; i <= n; i++) { n if (f[i] % 2 == 1) { n cntimp++; n } n } n return (cntimp <= 1); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> v[i]; n f[v[i]]++; n } n int imp = 0; n for (int i = 1; i <= n; i++) { n if (f[i] % 2 == 1) { n imp++; n } n } n if (imp >= 2) { n cout << 0 n ; n return 0; n } n bool pali = 1; n for (int i = 1; i < n + 1 - i; i++) { n if (v[i] != v[n + 1 - i]) { n pali = 0; n } n } n if (pali) { n long long res = n * (long long)(n + 1) >> 1; n cout << res << n ; n return 0; n } n st = 1; n dr = n; n while (v[st] == v[dr]) { n st++; n dr--; n } n int lo = st; n int hi = dr; n int prf = -1, suf = -1; n while (lo <= hi) { n int mid = (lo + hi) >> 1; n if (ok(st, mid)) { n prf = mid; n hi = mid - 1; n } else { n lo = mid + 1; n } n } n lo = 1; n hi = n; n while (lo <= hi) { n int mid = (lo + hi) >> 1; n if (ok(mid, dr)) { n suf = mid; n lo = mid + 1; n } else { n hi = mid - 1; n } n } n int cntgood = 0; n if (prf != -1) { n cntgood += (dr - prf + 1); n } n if (suf != -1) { n cntgood += (suf - st + 1); n } n long long res = n cntgood * (long long)st - 1 + (st - 1LL) * (long long)(st - 1LL); n cout << res << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a1, a2, b1, b2, c1, c2; n void rec(long long p, long long q) { n long long mod = c1 * c1 + c2 * c2; n if ((p * c1 + q * c2) % mod == 0 && (q * c1 - p * c2) % mod == 0) { n puts( YES ); n exit(0); n } n } n int main() { n scanf( %I64d%I64d%I64d%I64d%I64d%I64d , &a1, &a2, &b1, &b2, &c1, &c2); n if (c1 == 0 && c2 == 0) { n if ((a1 == b1 && a2 == b2) || (a1 == -b1 && a2 == -b2) || n (a1 == b2 && a2 == -b1) || (a1 == -b2 && a2 == b1)) n puts( YES ); n else n puts( NO ); n return 0; n } n rec(b1 - a1, b2 - a2); n rec(b1 + a1, b2 + a2); n rec(b1 + a2, b2 - a1); n rec(b1 - a2, b2 + a1); n puts( NO ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int l, r, x, y; n double k; n cin >> l >> r >> x >> y >> k; n bool flag = false; n double value; n while (x <= y) { n value = (double)x * k; n if (value >= l && value <= r) { n flag = true; n break; n } n x++; n } n if (flag) { n cout << YES ; n } else { n cout << NO ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 500005; n const int inf = 1000 * 1000 * 1000; n const int mod = 998244353; n int n; n vector g[N]; n int dp[N][3]; n int sz[N][3]; n void dfs(int v, int p) { n dp[v][0] = dp[v][1] = 0; n sz[v][0] = 1; n sz[v][1] = 0; n for (int i = 0; i < (int)g[v].size(); i++) { n int to = g[v][i]; n if (to == p) continue; n dfs(to, v); n int d0 = dp[v][0] * 1ll * (sz[to][0] + sz[to][1]) % mod + n (dp[to][0] + dp[to][1]) * 1ll * sz[v][0] % mod; n d0 %= mod; n int s0 = sz[v][0] * 1ll * (sz[to][0] + sz[to][1]) % mod; n int d1 = dp[v][1] * 1ll * (sz[to][0] + sz[to][1]) % mod + n (dp[to][0] + dp[to][1]) * 1ll * sz[v][1] % mod; n d1 %= mod; n int s1 = sz[v][1] * 1ll * (sz[to][0] + sz[to][1]) % mod; n int dd0 = n dp[v][0] * 1ll * sz[to][1] % mod + dp[to][1] * 1ll * sz[v][0] % mod; n dd0 %= mod; n int ss0 = sz[v][0] * 1ll * sz[to][1] % mod; n int dd1 = dp[v][1] * 1ll * (sz[to][0] + sz[to][1]) % mod + n (dp[to][0] + dp[to][1]) * 1ll * sz[v][1] % mod; n dd1 %= mod; n dd1 += dp[v][0] * 1ll * sz[to][0] % mod; n dd1 %= mod; n dd1 += sz[v][0] * 1ll * dp[to][0] % mod; n dd1 %= mod; n int ss1 = sz[v][1] * 1ll * (sz[to][0] + sz[to][1]) % mod + n sz[v][0] * 1ll * sz[to][0] % mod; n ss1 %= mod; n dd1 += sz[v][0] * 1ll * sz[to][0] % mod; n dd1 %= mod; n dp[v][0] = (d0 + dd0) % mod; n sz[v][0] = (s0 + ss0) % mod; n dp[v][1] = (d1 + dd1) % mod; n sz[v][1] = (s1 + ss1) % mod; n } n } n int main() { n scanf( %d , &n); n for (int i = 1; i < n; i++) { n int a, b; n scanf( %d%d , &a, &b); n g[a].push_back(b); n g[b].push_back(a); n } n dfs(1, -1); n int answ = (dp[1][0] + dp[1][1]) % mod; n answ *= 2; n answ %= mod; n cout << answ << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Tpoint { n double x, y; n } v[200], pg[200]; n struct Tline { n Tpoint a, b; n } ls[200]; n int n, tot, q[200], ord[200]; n double at2[200]; n double getdouble() { n double d = 0, d2, d3; n char ch = ; n bool flag = false; n while (!isdigit(ch = getchar())) n if (ch == - ) break; n if (ch == - ) n flag = 1; n else n d = ch - 48; n while (isdigit(ch = getchar())) d = d * 10 + ch - 48; n if (ch == - ) { n d2 = 0; n d3 = 1; n while (isdigit(ch = getchar())) d2 = d2 * 10 + ch - 48, d3 /= 10; n d += d2 * d3; n } n if (flag) n return -d; n else n return d; n } n void init() { n int i, w, h; n double angle; n n = 4; n scanf( %d%d%lf , &w, &h, &angle); n v[1].x = (double)w / 2; n v[1].y = -(double)h / 2; n v[2].x = (double)w / 2; n v[2].y = (double)h / 2; n v[3].x = -(double)w / 2; n v[3].y = (double)h / 2; n v[4].x = -(double)w / 2; n v[4].y = -(double)h / 2; n for (int i = 1; i < n; i++) ls[i].a = v[i], ls[i].b = v[i + 1]; n ls[n].a = v[n]; n ls[n].b = v[1]; n angle = angle * 3.1415926535897932384626433832795 / 180; n for (i = 1; i <= 4; i++) { n v[i + n].x = v[i].x * cos(angle) - v[i].y * sin(angle); n v[i + n].y = v[i].x * sin(angle) + v[i].y * cos(angle); n } n for (int i = 1; i < n; i++) n ls[n + i].a = v[n + i], ls[n + i].b = v[n + i + 1]; n ls[n + n].a = v[n + n]; n ls[n + n].b = v[n + 1]; n n = n + n; n } n int sig(double d) { return d < -1e-8 ? -1 : d > 1e-8; } n double multi(Tpoint p0, Tpoint p1, Tpoint p2) { n return (p1.x - p0.x) * (p2.y - p0.y) - (p2.x - p0.x) * (p1.y - p0.y); n } n int cmp(const void *a, const void *b) { n int p1 = *(int *)a, p2 = *(int *)b; n if (sig(at2[p1] - at2[p2]) == 0) { n return -sig(multi(ls[p2].a, ls[p2].b, ls[p1].b)); n } else n return sig(at2[p2] - at2[p1]); n } n Tpoint ispoint(Tline l1, Tline l2) { n double dot1, dot2; n Tpoint I; n dot1 = multi(l2.a, l1.b, l1.a); n dot2 = multi(l1.b, l2.b, l1.a); n I.x = (l2.a.x * dot2 + l2.b.x * dot1) / (dot1 + dot2); n I.y = (l2.a.y * dot2 + l2.b.y * dot1) / (dot1 + dot2); n return I; n } n bool judgein(int x, int y, int z) { n Tpoint pnt = ispoint(ls[x], ls[y]); n return sig(multi(ls[z].a, ls[z].b, pnt)) < 0; n } n void halfplane() { n int i, tmp, front, rear; n for (i = 1; i <= n; i++) { n at2[i] = atan2(ls[i].b.y - ls[i].a.y, ls[i].b.x - ls[i].a.x); n ord[i] = i; n } n qsort(ord + 1, n, sizeof(int), cmp); n for (i = 2, tmp = 1; i <= n; i++) { n if (sig(at2[ord[i]] - at2[ord[i - 1]]) != 0) ord[++tmp] = ord[i]; n } n front = 1; n rear = 2; n q[1] = ord[1]; n q[2] = ord[2]; n for (i = 3; i <= tmp; i++) { n while (front < rear && judgein(q[rear - 1], q[rear], ord[i])) rear--; n while (front < rear && judgein(q[front + 1], q[front], ord[i])) front++; n q[++rear] = ord[i]; n } n while (front < rear && judgein(q[rear - 1], q[rear], q[front])) rear--; n while (front < rear && judgein(q[front + 1], q[front], q[rear])) front++; n q[--front] = q[rear]; n tot = 0; n for (i = front + 1; i <= rear; i++) { n pg[++tot] = ispoint(ls[q[i - 1]], ls[q[i]]); n } n } n void work() { n halfplane(); n int i; n double ans = 0; n for (i = 1; i < tot; i++) { n ans += multi(pg[1], pg[i], pg[i + 1]); n } n ans += multi(pg[1], pg[tot], pg[1]); n ans /= 2; n if (fabs(ans) > 0) n printf( %.8lf , fabs(ans)); n else n printf( 0.0 ); n } n int main() { n init(); n work(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[200005]; n int b[200005]; n int c[200005]; n char str1[200005]; n char str2[200005]; n int main() { n int n; n while (scanf( %d , &n) != EOF) { n cin >> str1 >> str2; n int i; n for (i = 0; i < n; i++) { n a[i] = str1[i] - a ; n b[i] = str2[i] - a ; n } n for (i = n - 1; i >= 0; i--) { n if (b[i] >= a[i]) { n c[i] = b[i] - a[i]; n } else { n c[i] = b[i] - a[i] + 26; n b[i - 1]--; n } n } n for (i = 0; i < n; i++) { n if (c[i] % 2 == 0) { n c[i] = c[i] / 2; n } else { n c[i] = c[i] / 2; n c[i + 1] += 26; n } n } n for (i = n - 1; i >= 0; i--) { n a[i] = a[i] + c[i]; n while (a[i] >= 26) { n a[i] -= 26; n a[i - 1]++; n } n } n for (i = 0; i < n; i++) { n printf( %c , (char)(a[i] + a )); n } n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n #include n #include n #include n #include n #include n #include n #include n #include n n using namespace std; n n typedef long long ll; n ll MOD = 1000000007; n n void solve(int testCase) n { n ll n; n cin >> n; n for (int i = 0; i * 2020 <= n; i++) n { n if ((n - i * 2020) % 2021 == 0) n { n cout << YES << endl; n return; n } n } n cout << NO << endl; n n } n n int main() n { n int t; n cin >> t; n //t = 1; n int i = 1; n while (t--) n { n solve(i++); n } n return 0; n }"} +{"func_code_string": "#include n using namespace std; n template n inline void chkmin(T &a, const T &b) { n a = a < b ? a : b; n } n template n inline void chkmax(T &a, const T &b) { n a = a > b ? a : b; n } n const int MAXN = 150005, MAXT = 300005; n int sz[MAXN], val[MAXN], vis[MAXN], n, tot; n vector gra[MAXN]; n struct Tree { n long long k, b; n Tree *ls, *rs; n bool did; n } nd[MAXT], *rt; n vector cls; n long long ans; n Tree *build(int l, int r) { n Tree *cur = nd + (tot++); n cur->did = false; n if (l == r) return cur; n int mid = (l + r) >> 1; n cur->ls = build(l, mid); n cur->rs = build(mid + 1, r); n return cur; n } n void modify(long long k, long long b, int l = 1, int r = n, Tree *p = rt) { n if (p->did) { n long long f1 = p->k * l + p->b, f2 = p->k * r + p->b, g1 = k * l + b, n g2 = k * r + b; n if (g1 >= f1 && g2 >= f2) { n p->k = k, p->b = b; n return; n } else if (g1 <= f1 && g2 <= f2) n return; n double in = 1.0 * (b - p->b) / (k - p->k); n int mid = (l + r) >> 1; n if (in <= mid) { n if (f1 >= g1 && f2 <= g2) { n modify(p->k, p->b, l, mid, p->ls); n p->k = k, p->b = b; n } else n modify(k, b, l, mid, p->ls); n } else { n if (f1 <= g1 && f2 >= g2) { n modify(p->k, p->b, mid + 1, r, p->rs); n p->k = k, p->b = b; n } else n modify(k, b, mid + 1, r, p->rs); n } n } else n p->k = k, p->b = b, p->did = true, cls.push_back(p); n } n long long query(int x, int l = 1, int r = n, Tree *p = rt) { n if (!p->did) return -1e18; n int mid = (l + r) >> 1; n long long res = p->k * x + p->b; n if (x <= mid) n chkmax(res, query(x, l, mid, p->ls)); n else n chkmax(res, query(x, mid + 1, r, p->rs)); n return res; n } n void get_sz(int u, int fa) { n sz[u] = 1; n for (int v : gra[u]) n if (v != fa && !vis[v]) { n get_sz(v, u); n sz[u] += sz[v]; n } n } n pair get_rt(int u, int fa, int s) { n auto res = make_pair(MAXN, MAXN); n int mn = s; n for (int v : gra[u]) n if (v != fa && !vis[v]) { n res = min(res, get_rt(v, u, s + sz[u] - sz[v])); n chkmax(mn, sz[v]); n } n return min(res, make_pair(mn, u)); n } n void dfs1(int u, int fa, int dep, long long sum, long long cur, long long tmp) { n sum += val[u], cur += sum, ++dep, tmp += (long long)dep * val[u]; n chkmax(ans, cur), chkmax(ans, tmp); n chkmax(ans, query(dep) + cur); n for (int v : gra[u]) n if (v != fa && !vis[v]) dfs1(v, u, dep, sum, cur, tmp); n } n void dfs2(int u, int fa, int dep, long long sum, long long cur) { n ++dep, sum += val[u], cur += (long long)dep * val[u]; n modify(sum, cur); n for (int v : gra[u]) n if (v != fa && !vis[v]) dfs2(v, u, dep, sum, cur); n } n void divide(int u) { n get_sz(u, 0); n u = get_rt(u, 0, 0).second; n vis[u] = 1; n for (int v : gra[u]) n if (!vis[v]) { n dfs1(v, u, 1, val[u], val[u], val[u]); n dfs2(v, u, 0, 0, 0); n } n for (Tree *p : cls) p->did = false; n cls.clear(); n reverse(gra[u].begin(), gra[u].end()); n for (int v : gra[u]) n if (!vis[v]) { n dfs1(v, u, 1, val[u], val[u], val[u]); n dfs2(v, u, 0, 0, 0); n } n for (Tree *p : cls) p->did = false; n cls.clear(); n for (int v : gra[u]) n if (!vis[v]) divide(v); n vis[u] = 0; n } n int main() { n scanf( %d , &n); n rt = build(1, n); n for (int i = 1; i < n; i++) { n int u, v; n scanf( %d%d , &u, &v); n gra[u].push_back(v); n gra[v].push_back(u); n } n for (int i = 1; i <= n; i++) scanf( %d , val + i); n divide(1); n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int arr[200007]; n int brr[200007]; n int main() { n int t; n cin >> t; n while (t--) { n int n, x; n cin >> n >> x; n map mpp; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n mpp[arr[i]]++; n } n int cnt = 0; n for (int i = 1;; i++) { n if (x == 0) break; n if (mpp[i] == 0) { n mpp[i]++; n x--; n } n } n for (int i = 1;; i++) { n if (mpp[i] == 0) n break; n else n cnt++; n } n cout << cnt << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 1; n int mark[N], t[N], n; n long long res; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n ; n cin >> n; n for (int i = (1); i <= (n); i += (1)) cin >> mark[i]; n int cur = 0; n for (int i = (n); i >= (1); i -= (1)) { n cur = max(0, cur - 1); n cur = max(cur, mark[i] + 1); n t[i] = cur; n } n cur = 0; n for (int i = (1); i <= (n); i += (1)) { n cur = max(cur, t[i]); n res += cur; n } n for (int i = (1); i <= (n); i += (1)) res -= (mark[i] + 1); n cout << res << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n int arr[n]; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n } n sort(arr, arr + n); n int ans = 1; n for (int i = 1; i < n; i++) { n if (arr[i] > arr[i - 1]) ans++; n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n namespace Base { n const int inf = 0x3f3f3f3f, INF = 0x7fffffff; n const long long infll = 0x3f3f3f3f3f3f3f3fll, INFll = 0x7fffffffffffffffll; n template n void read(T &x) { n x = 0; n int fh = 1; n double num = 1.0; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) fh = -1; n ch = getchar(); n } n while (isdigit(ch)) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n if (ch == . ) { n ch = getchar(); n while (isdigit(ch)) { n num /= 10; n x = x + num * (ch - 0 ); n ch = getchar(); n } n } n x = x * fh; n } n template n void chmax(T &x, T y) { n x = x < y ? y : x; n } n template n void chmin(T &x, T y) { n x = x > y ? y : x; n } n } // namespace Base n using namespace Base; n const int N = 510; n bool tag[N]; n int nxt[N], n, m, len[N], pre[N][N], bak[N][N], now[N], ch[N]; n long long k, cnt[N]; n void kmp(int *a, int lena, int *b, int lenb) { n memset(tag, 0, sizeof(tag)); n for (int i = 1; i <= lenb; i++) { n int p = i - 1; n while (p != 0 && b[nxt[p] + 1] != b[i]) p = nxt[p]; n if (b[nxt[p] + 1] != b[i] || i == 1) n nxt[i] = 0; n else n nxt[i] = nxt[p] + 1; n } n for (int i = 1, j = 1; i <= lena; i++) { n while (j != 1 && a[i] != b[j]) j = nxt[j - 1] + 1; n if (a[i] == b[j]) j++; n if (j > lenb) { n tag[i] = true, j = nxt[j - 1] + 1; n } n } n } n int main() { n read(n); n read(k); n read(m); n k = k + 1; n len[0] = len[1] = 1; n pre[0][1] = 0; n pre[1][1] = 1; n bak[0][1] = 0; n bak[1][1] = 1; n for (int j = 2; j <= n; j++) { n for (int k = 1; k <= len[j - 2]; k++) pre[j][k] = pre[j - 2][k]; n if (len[j - 2] < m) { n for (int k = len[j - 2] + 1; k <= min(len[j - 2] + len[j - 1], m); k++) n pre[j][k] = pre[j - 1][k - len[j - 2]]; n } n int tmp = 0; n if (len[j - 1] < m) { n tmp = min(len[j - 2], m - len[j - 1]); n for (int k = 1; k <= tmp; k++) n bak[j][k] = bak[j - 2][len[j - 2] - tmp + k]; n } n for (int k = 1; k <= len[j - 1]; k++) bak[j][k + tmp] = bak[j - 1][k]; n len[j] = min(m, len[j - 1] + len[j - 2]); n } n for (int i = 1; i <= m; i++) { n bool flag = false; n for (int j = 1; j <= i - 1; j++) n if (bak[n][len[n] - i + j + 1] != ch[j]) { n flag = true; n break; n } n if (flag == false) { n k--; n if (k == 0) { n for (int j = 1; j <= i - 1; j++) printf( %d , ch[j]); n printf( n ); n exit(0); n } n } n flag = false; n ch[i] = 0; n memset(cnt, 0, sizeof(cnt)); n if (i == 1) cnt[0] = 1; n for (int j = 2; j <= n; j++) { n cnt[j] = cnt[j - 1] + cnt[j - 2]; n if (cnt[j] >= k) { n flag = true; n break; n } n int id = 0, cut = 0; n for (int k = 1; k <= len[j - 2]; k++) now[++id] = bak[j - 2][k]; n cut = id; n for (int k = 1; k <= len[j - 1]; k++) now[++id] = pre[j - 1][k]; n kmp(now, id, ch, i); n for (int k = cut + 1; k <= min(cut + i - 1, id); k++) n if (tag[k] == true) cnt[j]++; n } n if (cnt[n] >= k || flag == true) n ch[i] = 0; n else n ch[i] = 1, k -= cnt[n]; n } n for (int i = 1; i <= m; i++) printf( %d , ch[i]); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, a[100000], p[100000]; n cin >> n; n for (int i = 0; i < n; ++i) cin >> a[i] >> p[i]; n for (int i = 1; i < n; ++i) p[i] = min(p[i], p[i - 1]); n int ans = 0; n for (int i = 0; i < n; ++i) ans += p[i] * a[i]; n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace ::std; n const long long maxn = 52; n const long long mod = 1e9 + 7; n const long long inf = 1e9 + 500; n long long dp[2][maxn][maxn][maxn][maxn]; n long long d[maxn]; n bool bit; n long long kv; n void add(long long a, long long b, long long c, long long d, long long z) { n if (0 <= a && 0 <= b && 0 <= c && 0 <= d && a < maxn && b < maxn && n c < maxn && d < maxn) { n dp[bit][a][b][c][d] += z * kv; n dp[bit][a][b][c][d] %= mod; n } n } n int main() { n long long n; n cin >> n; n for (long long i = 0; i < n; i++) { n cin >> d[i]; n } n long long a1 = 0, a2 = 0, b1 = 0, b2 = 0; n if (d[0] == 2) { n b1++; n } else { n b2++; n } n if (d[1] == 2) { n a1++; n } else { n a2++; n } n dp[1][a1][a2][b1][b2] = 1; n for (long long i = 2; i < n; i++) { n bit = (i & 1); n long long k = i; n for (long long a1 = 0; a1 <= k; a1++) { n for (long long a2 = 0; a2 + a1 <= k; a2++) { n for (long long b1 = 0; b1 + a1 + a2 <= k; b1++) { n for (long long b2 = 0; b2 + a1 + a2 + b1 <= k; b2++) { n dp[bit][a1][a2][b1][b2] = 0; n } n } n } n } n for (long long a1 = 0; a1 <= k; a1++) { n for (long long a2 = 0; a2 + a1 <= k; a2++) { n for (long long b1 = 0; b1 + a1 + a2 <= k; b1++) { n for (long long b2 = 0; b2 + a1 + a2 + b1 <= k; b2++) { n kv = dp[!bit][a1][a2][b1][b2]; n if (d[i] == 2) { n add(a1 - 1, a2, b1 - 1, b2, a1 * b1); n add(a1 + 1, a2 - 1, b1 - 1, b2, a2 * b1); n add(a1 + 1, a2, b1 - 1, b2, b1); n add(a1 - 1, a2, b1 + 1, b2 - 1, a1 * b2); n add(a1 + 1, a2 - 1, b1 + 1, b2 - 1, a2 * b2); n add(a1 + 1, a2, b1 + 1, b2 - 1, b2); n if (b1 == 0 && b2 == 0) { n add(1, 0, a1 - 1, a2, a1); n add(1, 0, a1 + 1, a2 - 1, a2); n } n } else { n if (b1 == 0 && b2 == 0) { n add(0, 1, a1 - 1, a2, a1); n add(0, 1, a1 + 1, a2 - 1, a2); n } n add(a1, a2 + 1, b1 - 1, b2, b1); n add(a1 + 1 + 1, a2 - 1, b1 - 1, b2, b1 * a2); n add(a1 + 1 - 1, a2, b1 - 1, b2, b1 * a1); n add(a1 - 2, a2, b1 - 1, b2, b1 * (a1 * (a1 - 1)) / 2); n add(a1 + 2, a2 - 2, b1 - 1, b2, b1 * (a2 * (a2 - 1)) / 2); n add(a1 + 1 - 1, a2 - 1, b1 - 1, b2, b1 * a1 * a2); n add(a1, a2 + 1, b1 + 1, b2 - 1, b2); n add(a1 + 1 + 1, a2 - 1, b1 + 1, b2 - 1, b2 * a2); n add(a1 + 1 - 1, a2, b1 + 1, b2 - 1, b2 * a1); n add(a1 - 2, a2, b1 + 1, b2 - 1, b2 * (a1 * (a1 - 1)) / 2); n add(a1 + 2, a2 - 2, b1 + 1, b2 - 1, b2 * (a2 * (a2 - 1)) / 2); n add(a1 + 1 - 1, a2 - 1, b1 + 1, b2 - 1, b2 * a1 * a2); n } n } n } n } n } n k++; n for (long long a1 = 0; a1 <= k; a1++) { n for (long long a2 = 0; a2 + a1 <= k; a2++) { n for (long long b1 = 0; b1 + a1 + a2 <= k; b1++) { n for (long long b2 = 0; b2 + a1 + a2 + b1 <= k; b2++) { n dp[bit][a1][a2][b1][b2] %= mod; n } n } n } n } n } n long long ans = 0; n bool bb = (n - 1) & 1; n ans = dp[bb][0][0][0][0]; n cout << ans % mod; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k, m = 1e9 + 7; n cin >> n >> k; n int a[100005]; n a[0] = 1; n for (int i = 1; i < 100005; ++i) { n if (i >= k) { n a[i] = (a[i - k] + a[i - 1]) % m; n } else { n a[i] = a[i - 1]; n } n } n for (int i = 1; i < 100005; ++i) { n a[i] = (a[i] + a[i - 1]) % m; n } n while (n--) { n int x, y; n scanf( %d %d , &x, &y); n printf( %d n , (a[y] - a[x - 1] + m) % m); n } n } n "} +{"func_code_string": "#include n using namespace std; n void write(vector &v) { n for (auto i : v) cout << i << ; n cout << n ; n } n void read(vector &v) { n for (auto &i : v) cin >> i; n } n const int INF = 1e9; n const int64_t INFF = 1e18; n const int N = 1e6 + 69; n void solve() { n int n; n cin >> n; n string s1, s2; n cin >> s1 >> s2; n int ans = 0; n vector pos(n, 1); n for (int i = 0; i < n; i++) { n if (s2[i] == 1 ) { n if (s1[i] == 0 ) { n ans++; n pos[i] = 0; n } else if (i > 0 && s1[i - 1] == 1 && pos[i - 1]) { n ans++; n pos[i - 1] = 0; n } else if (i < n - 1 && s1[i + 1] == 1 && pos[i + 1]) { n ans++; n pos[i + 1] = 0; n } n } n } n cout << ans << n ; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t = 1; n cin >> t; n for (int i = 1; i <= t; i++) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long p = 1e9 + 7; n inline long long read() { n long long neg = 1, num = 0; n char c = getchar(); n for (; !isdigit(c); c = getchar()) n if (c == - ) neg = -1; n for (; isdigit(c); c = getchar()) num = (num << 1) + (num << 3) + c - 0 ; n return neg * num; n } n long long n, k, tot, f[200010], g[200010], fac[200010], inv[200010], n pri[200010], mu[200010], mul[200010]; n bool vis[200010]; n inline long long Pow(long long x, long long y) { n long long res = 1; n for (; y; y >>= 1, x = x * x % p) n if (y & 1) res = res * x % p; n return res; n } n inline long long C(long long x, long long y) { n return fac[x] * inv[y] % p * inv[x - y] % p; n } n inline long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; } n inline void sieve() { n vis[1] = mu[1] = 1; n for (long long i = 2; i <= n; i++) { n if (!vis[i]) pri[++tot] = i, mu[i] = -1; n for (long long j = 1; j <= tot && pri[j] * i <= n; j++) { n vis[i * pri[j]] = 1; n if (i % pri[j] == 0) break; n mu[i * pri[j]] = -mu[i]; n } n } n fac[0] = inv[0] = mul[0] = 1; n for (long long i = 1; i <= 2 * n; i++) n fac[i] = fac[i - 1] * i % p, mul[i] = mul[i - 1] * k % p; n inv[2 * n] = Pow(fac[2 * n], p - 2); n for (long long i = 2 * n - 1; i >= 1; i--) inv[i] = inv[i + 1] * (i + 1) % p; n for (long long i = 2; i <= n; i++) n f[i] = (f[i - 1] + (i - 1) * mul[i] % p) % p; n for (long long i = 1; i <= n; i++) g[i] = Pow(f[n / i], i) % p; n } n signed main() { n n = read(); n k = read(); n sieve(); n long long ans = 0, sub = 0; n for (long long i = 2; i <= 2 * n; i++) { n if (i <= n) n ans = (ans + (i - 1) * mul[i] % p) % p; n else n ans = (ans + (2 * n - i + 1) * mul[i] % p) % p; n } n ans = ans * Pow(mul[n], p - 2) % p; n for (long long d = 1; d <= n; d++) { n for (long long T = d; T <= n; T += d) { n long long s1 = (n / T) * (n / T - 1) / 2 % p, s2 = g[T]; n if ((n + d - 1) / T != n / T) n s1 = (s1 + (n + d - 1) / T - 1) % p, n s2 = (s2 + ((n + d - 1) / T - 1) * mul[(n + d - 1) / T * T] % p) % p; n ans = (ans + s1 * mul[d] * mu[T / d] % p) % p; n sub = (sub + s2 * mu[T / d]) % p; n } n } n sub = sub * Pow(mul[n], p - 2) % p; n ans = (ans - sub) % p; n for (long long i = 1; i <= n; i++) n ans = (ans - (1 + (i != n)) * mul[max(gcd(i, n), i)]) % p; n ans = ans * Pow(mul[n], p - 2) % p; n ans = (ans % p + p) % p; n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int num[100020], nxt[100020]; n struct point { n int st, en, num; n } pnt[100020 * 4]; n int max1(int a, int b) { n if (a > b) return a; n return b; n } n int main() { n int n, sum = 0, cnt = 0, besti, min1 = 1 << 25, tmp, i; n scanf( %d , &n); n num[n + 1] = nxt[0] = num[0] = 0; n for (i = 1; i <= n; i++) { n scanf( %d , &num[i]), nxt[i] = i; n } n for (i = 0; i < 100020 * 3; i++) pnt[i].st = pnt[i].en = pnt[i].num = 0; n for (i = 1; i <= n + 1; i++) { n if (num[i] >= num[i - 1]) { n sum += num[i] - num[i - 1]; n } else { n besti = i - 1; n while (num[besti] > num[i]) { n tmp = max1(num[nxt[besti] - 1], num[i]); n pnt[cnt].en = i - 1; n pnt[cnt].st = nxt[besti], pnt[cnt++].num = num[besti] - tmp; n nxt[i] = nxt[besti]; n besti = nxt[besti] - 1; n } n if (num[besti] >= num[i]) nxt[i] = nxt[besti]; n } n } n printf( %d n , sum); n for (i = 0; i < cnt; i++) { n for (int j = 0; j < pnt[i].num; j++) n printf( %d %d n , pnt[i].st, pnt[i].en); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map mp; n map g; n int n, k, cnt; n char name1[10100][30], name2[10100][30]; n int mark[1010][1010]; n int x[10100], y[10100], tt[10100]; n int ans[10100], num; n struct Node { n int l, r; n } node[10100]; n struct Mark { n int l, r; n Mark() {} n Mark(int a, int b) { n if (a > b) swap(a, b); n l = a; n r = b; n } n bool operator<(const Mark a) const { n if (l == a.l) return r < a.r; n return l < a.l; n } n }; n map vis; n int vv; n int main() { n string s1, s2; n int u, v, t; n while (scanf( %d%d , &n, &k) == 2) { n cnt = 0; n num = 0; n vv = 0; n vis.clear(); n mp.clear(); n for (int i = 0; i < n; i++) { n scanf( %s%s%d , name1[i], name2[i], &t); n s1 = name1[i]; n s2 = name2[i]; n if (!mp.count(s1)) { n mp[s1] = ++cnt; n g[cnt] = s1; n } n u = mp[s1]; n if (!mp.count(s2)) { n mp[s2] = ++cnt; n g[cnt] = s2; n } n v = mp[s2]; n x[i] = u; n y[i] = v; n tt[i] = t; n for (int j = 0; j < n; j++) { n if (tt[i] != tt[j] && tt[i] - tt[j] <= k) { n if (x[i] == y[j] && x[j] == y[i]) { n if (!vis.count(Mark(x[i], y[i]))) { n node[num].l = x[i]; n node[num++].r = y[i]; n vis[Mark(x[i], y[i])] = vv++; n } n } n } n } n } n printf( %d n , num); n for (int i = 0; i < num; i++) n cout << g[node[i].l] << << g[node[i].r] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n const int LG_N = 20; n struct node { n int l, r, cnt; n node *left, *right; n node(int _l, int _r, int _c = 0) : l(_l), r(_r), cnt(_c) {} n }; n node *init(int l, int r) { n node *p = new node(l, r); n if (l < r) { n int mid = (l + r) / 2; n p->left = init(l, mid); n p->right = init(mid + 1, r); n } n return p; n } n node *update(node *p, int idx) { n node *q = new node(p->l, p->r, p->cnt + 1); n if (p->l < p->r) { n int mid = (p->l + p->r) / 2; n q->left = (idx <= mid ? update(p->left, idx) : p->left); n q->right = (idx > mid ? update(p->right, idx) : p->right); n } n return q; n } n int seg_query(node *p, int l, int r) { n if (p->r < l or r < p->l) return 0; n if (l <= p->l and p->r <= r) return p->cnt; n return seg_query(p->left, l, r) + seg_query(p->right, l, r); n } n struct Query { n int type, u, v, k, y; n void read(void) { n scanf( %d , &type); n if (type == 1) { n scanf( %d , &u); n } else { n scanf( %d%d%d%d , &u, &v, &k, &y); n } n } n } query[N]; n node *head[N]; n vector adj[N]; n int P[N][LG_N], H[N]; n int attack_year[N]; n int n, m; n int root = 1; n int count(int u, int v, int l, int r) { n int ans = 0; n if (l > 0) { n ans += seg_query(head[u], 1, l - 1); n ans -= seg_query(head[v], 1, l - 1); n } n if (r < m + 1) { n ans += seg_query(head[u], r + 1, m + 1); n ans -= seg_query(head[v], r + 1, m + 1); n } n return ans; n } n int my_advance(int u, int l) { n for (int i = LG_N - 1; i >= 0; i--) { n if ((1 << i) <= l) { n l -= 1 << i; n u = P[u][i]; n } n } n return u; n } n int lca(int u, int v) { n if (H[u] < H[v]) swap(u, v); n for (int i = LG_N - 1; i >= 0; i--) { n if (H[P[u][i]] >= H[v]) { n u = P[u][i]; n } n } n if (u == v) return u; n for (int i = LG_N - 1; i >= 0; i--) { n if (P[u][i] != P[v][i]) { n u = P[u][i]; n v = P[v][i]; n } n } n return P[u][0]; n } n void dfsInit(int u, int h) { n H[u] = h; n for (int i = 1; i < LG_N; i++) { n P[u][i] = P[P[u][i - 1]][i - 1]; n } n head[u] = update(u == root ? (head[0] = init(0, m + 1)) : head[P[u][0]], n attack_year[u]); n for (int v : adj[u]) { n dfsInit(v, h + 1); n } n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n int u; n scanf( %d , &u); n if (u == 0) { n root = i; n } n adj[u].push_back(i); n P[i][0] = u; n } n scanf( %d , &m); n for (int i = 1; i <= n; i++) { n attack_year[i] = m + 1; n } n for (int i = 1; i <= m; i++) { n query[i].read(); n if (query[i].type == 1) { n attack_year[query[i].u] = i; n } n } n H[0] = 0; n dfsInit(root, 1); n for (int i = 1; i <= m; i++) { n if (query[i].type == 1) continue; n int u = query[i].u, v = query[i].v, k = query[i].k, y = query[i].y; n int l = lca(u, v); n k += (attack_year[u] < y + 1 or attack_year[u] > i); n int lo = 0, hi = H[u] - H[l]; n while (lo < hi) { n int mid = (lo + hi) / 2; n if (count(u, my_advance(u, mid + 1), y + 1, i) >= k) { n hi = mid; n } else { n lo = mid + 1; n } n } n k -= count(u, my_advance(u, lo + 1), y + 1, i); n u = my_advance(u, lo); n if (k == 0) { n printf( %d n , (u == v ? -1 : u)); n continue; n } n k = count(v, l, y + 1, i) - k + 1; n if (k >= 0) { n lo = 0, hi = H[v] - H[l]; n while (lo < hi) { n int mid = (lo + hi) / 2; n if (count(v, my_advance(v, mid + 1), y + 1, i) >= k) { n hi = mid; n } else { n lo = mid + 1; n } n } n k -= count(v, my_advance(v, lo + 1), y + 1, i); n v = my_advance(v, lo); n if (lo == 0) { n k = -1; n } n } n if (k == 0) { n printf( %d n , v); n } else { n printf( -1 n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e5 + 5; n int a[maxn], n, s, b[maxn], num[maxn], len; n int ufs[maxn], meme[maxn]; n inline int find(int u) { n if (ufs[u] == u) n return u; n else n return ufs[u] = find(ufs[u]); n } n inline void join(int u, int v, int e) { n u = find(u), v = find(v); n if (u == v) return; n ufs[v] = u; n meme[u] = e; n } n vector > mema; n vector > adj[maxn]; n vector curm; n inline void dfs(int u) { n while (adj[u].size()) { n int v = adj[u].back().first, id = adj[u].back().second; n adj[u].pop_back(); n dfs(v); n curm.push_back(id); n } n } n int main() { n cin >> n >> s; n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n num[++len] = a[i]; n } n sort(num + 1, num + len + 1); n len = unique(num + 1, num + len + 1) - num - 1; n for (int i = 1; i <= n; i++) { n a[i] = lower_bound(num + 1, num + len + 1, a[i]) - num; n b[i] = a[i]; n ufs[i] = i; n } n sort(b + 1, b + n + 1); n int cnt = 0; n for (int i = 1; i <= n; i++) { n if (a[i] != b[i]) { n cnt++; n join(a[i], b[i], i); n } n } n if (cnt > s) { n cout << -1 << endl; n return 0; n } n if (cnt == 0) { n cout << 0 << endl; n return 0; n } n if (s - cnt > 1) { n for (int i = 1; i <= len; i++) { n if (ufs[i] == i && meme[i] != 0) { n curm.push_back(meme[i]); n if (curm.size() == s - cnt) break; n } n } n if (curm.size() > 1) { n mema.push_back(curm); n int lstv = a[curm.back()]; n for (int i = curm.size() - 1; i >= 1; i--) { n a[curm[i]] = a[curm[i - 1]]; n } n a[curm[0]] = lstv; n } n } n for (int i = 1; i <= n; i++) { n if (a[i] != b[i]) { n adj[a[i]].push_back(make_pair(b[i], i)); n } n } n for (int i = 1; i <= len; i++) { n if (adj[i].size() != 0) { n curm.clear(); n dfs(i); n mema.push_back(curm); n } n } n cout << mema.size() << endl; n for (int i = 0; i < mema.size(); i++) { n cout << mema[i].size() << endl; n for (int j = 0; j < mema[i].size(); j++) { n printf( %d , mema[i][j]); n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2005; n struct poke { n double p, q; n } srt[N]; n inline bool cmp1(poke a, poke b) { n return a.p > b.p || a.p == b.p && a.q > b.q; n } n inline bool cmp2(poke a, poke b) { return a.p - a.p * a.q > b.p - b.p * b.q; } n double f[N]; n int n, a, b; n double ans, sum; n multiset heap; n void calc() { n ans = 0., sort(srt + 1, srt + 1 + n, cmp1); n for (int i = a; i <= n; ++i) { n if (i - a > b) break; n sort(srt + 1, srt + 1 + i, cmp2), heap.clear(); n double cur = sum = f[i + 1] = 0.; n for (int j = i; j >= 1; --j) { n heap.insert(srt[j].q - srt[j].p), sum += srt[j].q - srt[j].p; n if ((int)heap.size() > i - a) n sum -= *heap.begin(), heap.erase(heap.begin()); n f[j] = sum, cur += srt[j].p; n } n heap.clear(); n for (int j = i + 1; j <= n; ++j) { n heap.insert(srt[j].q), cur += srt[j].q; n if ((int)heap.size() > b - (i - a)) n cur -= *heap.begin(), heap.erase(heap.begin()); n } n for (int j = 0; j <= i; ++j) { n if (j > a) break; n if (j) n heap.insert(srt[j].q - srt[j].p * srt[j].q), n cur += srt[j].q - srt[j].p * srt[j].q; n if ((int)heap.size() > b - (i - a)) n cur -= *heap.begin(), heap.erase(heap.begin()); n if ((int)heap.size() == b - (i - a)) ans = max(ans, cur + f[j + 1]); n } n } n } n int main() { n scanf( %d%d%d , &n, &a, &b); n for (int i = 1; i <= n; ++i) scanf( %lf , &srt[i].p); n for (int i = 1; i <= n; ++i) scanf( %lf , &srt[i].q); n calc(), printf( %.6lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n char c; n cin >> c; n string str; n cin >> str; n long long ctr = 0; n long long k = 0; n for (long long i = 0; i < n; i++) { n if (str[i] != c) { n ctr++; n k = i; n } n } n if (ctr == 0) { n cout << 0; n } else if (ctr == 1) { n if (k == n - 1) { n cout << 1 << n ; n cout << k; n } else { n cout << 1 << n ; n cout << k + 2; n } n } else { n long long flag = 0; n for (long long i = n - 1; i >= n / 2; i--) { n if (str[i] == c) { n flag = i; n break; n } n } n if (flag) { n cout << 1 << n ; n cout << flag + 1; n } else { n cout << 2 << n ; n cout << n << << n - 1; n } n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[105], b[105]; n long long tinh(long long x, int n, int nc) { n long long i, cnt = 0; n for ((i) = (1); (i) <= (n); (i)++) { n cnt += (((long long)a[i] * x) / b[i]) + 1; n if (cnt > nc) return 1001001001; n } n return cnt; n } n void input() { n int i, n, nc; n int dau, giua, cuoi; n int l, r; n scanf( %d %d , &n, &nc); n for ((i) = (1); (i) <= (n); (i)++) scanf( %d %d , &a[i], &b[i]); n dau = 1, cuoi = 1001001001; n while (dau <= cuoi) { n giua = (dau + cuoi) >> 1; n long long val = tinh(giua, n, nc); n if (val > nc) n cuoi = giua - 1; n else n dau = giua + 1; n } n r = cuoi; n dau = 1, cuoi = 1001001001; n while (dau <= cuoi) { n giua = (dau + cuoi) >> 1; n long long val = tinh(giua, n, nc); n if (val < nc) n dau = giua + 1; n else n cuoi = giua - 1; n } n l = dau; n if (r < l) n printf( 0 n ); n else if (r == 1001001001) n printf( -1 n ); n else n printf( %d n , r - l + 1); n } n int main() { n input(); n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:1000000000 ) n using namespace std; n const bool db = false; n int n, m, x, y; n int a[1010][1010], b[1010][1010]; n long long s[1010][1010], cs[1010][1010]; n vector > ans; n char mark[1010][1010]; n pair > st[1010 * 1010]; n int sz = 0; n long long sum(int lx, int ly, int rx, int ry) { n return s[rx][ry] + s[lx - 1][ly - 1] - s[rx][ly - 1] - s[lx - 1][ry]; n } n int main() { n scanf( %d%d%d%d , &n, &m, &x, &y); n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n scanf( %d , &a[i][j]); n s[i][j] = a[i][j] + s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1]; n } n } n for (int i = 1; i <= n; ++i) { n deque dq; n for (int j = 1; j < y; ++j) { n while (!dq.empty() && dq.back() > a[i][j]) dq.pop_back(); n dq.push_back(a[i][j]); n } n for (int j = 1; j + y - 1 <= m; ++j) { n if (j != 1) { n if (a[i][j - 1] == dq.front()) dq.pop_front(); n } n while (!dq.empty() && dq.back() > a[i][j + y - 1]) dq.pop_back(); n dq.push_back(a[i][j + y - 1]); n b[i][j] = dq.front(); n } n } n for (int i = 1; i + y - 1 <= m; ++i) { n deque dq; n for (int j = 1; j < x; ++j) { n while (!dq.empty() && dq.back() > b[j][i]) dq.pop_back(); n dq.push_back(b[j][i]); n } n for (int j = 1; j + x - 1 <= n; ++j) { n if (j != 1) { n if (b[j - 1][i] == dq.front()) dq.pop_front(); n } n while (!dq.empty() && dq.back() > b[j + x - 1][i]) dq.pop_back(); n dq.push_back(b[j + x - 1][i]); n cs[j][i] = dq.front(); n } n } n long long tot = 1LL << 60; n for (int i = 1; i + x - 1 <= n; ++i) { n for (int j = 1; j + y - 1 <= m; ++j) { n st[sz].first = cs[i][j] = n sum(i, j, i + x - 1, j + y - 1) - 1LL * x * y * cs[i][j]; n st[sz].second.first = i; n st[sz++].second.second = j; n } n } n sort(st, st + sz); n ans.reserve(n * m); n for (int it = 0; it < sz; ++it) { n int i = st[it].second.first, j = st[it].second.second; n if (mark[i][j] || mark[i + x - 1][j] || mark[i][j + y - 1] || n mark[i + x - 1][j + y - 1]) { n continue; n } n ans.emplace_back(make_pair(i, j)); n for (int di = 0; di < x; ++di) { n for (int dj = 0; dj < y; ++dj) { n mark[i + di][j + dj] = 1; n } n } n } n cout << ans.size() << n ; n for (int i = 0; i < ans.size(); ++i) n printf( %d %d %lld n , ans[i].first, ans[i].second, n cs[ans[i].first][ans[i].second]); n getchar(); n getchar(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void _p(T a) { n cout << a << n ; n } n template n void _pa(T a) { n cout << a << ; n } n template n void _p(T1 a, T2 b) { n cout << a << << b << n ; n } n template n void _p(T1 a, T2 b, T3 c) { n cout << a << << b << << c << n ; n } n template n void _p(T1 a, T2 b, T3 c, T4 d) { n cout << a << << b << << c << << d << << n ; n } n template n void _p(T1 a, T2 b, T3 c, T4 d, T5 e) { n cout << a << << b << << c << << d << << e << << n ; n } n template n void _pa(T a[], long long n) { n long long i; n for (i = 0; i < n; i++) cout << a[i] << ; n cout << n ; n } n template n void _p(vector v) { n for (auto x : v) cout << x << ; n cout << n ; n } n template n void _p(list l) { n for (auto x : l) cout << x << ; n cout << n ; n } n template n void _p(set s) { n for (auto x : s) cout << x << ; n cout << n ; n } n template n void _p(multiset s) { n for (auto x : s) cout << x << ; n cout << n ; n } n template n void _p(unordered_set s) { n for (auto x : s) cout << x << ; n cout << n ; n } n template n void _p(map m) { n for (auto x : m) cout << x.first << -> << x.second << n ; n cout << n ; n } n template n void _p(unordered_map m) { n for (auto x : m) cout << x.first << -> << x.second << n ; n cout << n ; n } n template n void _p(map> m) { n for (auto x : m) { n cout << x.first << -> ; n _p(x.second); n } n cout << n ; n } n template n void _p(unordered_map> m) { n for (auto x : m) { n cout << x.first << -> ; n _p(x.second); n } n cout << n ; n } n void solution() { n string a, b; n int i, n, c = 0; n cin >> a >> b; n map mp; n n = b.length(); n for (i = 0; i < 26; i++) mp[a[i]] = i; n for (i = 1; i < n; i++) c += abs(mp[b[i]] - mp[b[i - 1]]); n _p(c); n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int tcse; n cin >> tcse; n while (tcse--) solution(); n } n "} +{"func_code_string": "#include n using namespace std; n bool pd[5005][5005]; n char str[5005]; n int n; n bool vis[5050]; n bool dfs(int u, int lst) { n vis[u] = 1; n for (int i = 1; i <= n; ++i) { n if (!pd[u][i]) continue; n if (lst != -1 && pd[i][lst]) { n printf( %d %d %d n , lst, u, i); n return 1; n } n if (!vis[i] && dfs(i, u)) return 1; n } n return 0; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; ++i) { n scanf( %s , str + 1); n for (int j = 1; j <= n; ++j) n if (str[j] == 1 ) pd[i][j] = 1; n } n for (int i = 1; i <= n; ++i) n if (!vis[i] && dfs(i, -1)) { n return 0; n } n printf( -1 n ); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int i, n, m, count = 0; n scanf( %d%d , &n, &m); n while (n > 0 && m > 0) { n if (n > m && n >= 2) { n n -= 2; n m--; n count++; n } else if (m > n && m >= 2) { n m -= 2; n n--; n count++; n } else if (n == m && m >= 2) { n m -= 2; n n--; n count++; n } else n break; n } n printf( %d , count); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n long long n, m, k; n cin >> n >> m >> k; n long long s = 2 * n * m; n if (s % k != 0) { n cout << NO ; n return 0; n } n s /= k; n long long x2, x3, y2, y3; n x2 = n; n if (s % n == 0) n y3 = s / n; n else n y3 = s / n + 1; n long long r = y3 * n - s; n y2 = 1, x3 = r; n cout << YES n ; n cout << 0 0 n ; n cout << x2 << << y2 << n ; n cout << x3 << << y3 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void prepare() {} n void solve() { n string s; n cin >> s; n set ss[26]; n for (int i = 0; i < s.size(); ++i) ss[s[i] - a ].insert(i); n int i = 25; n int cur = -1; n while (i != -1) { n if (ss[i].empty()) { n --i; n continue; n } n while (!ss[i].empty() && *ss[i].begin() < cur) ss[i].erase(ss[i].begin()); n if (ss[i].empty()) { n --i; n continue; n } n for (int j = 0; j < ss[i].size(); ++j) printf( %c , i + a ); n cur = *(--ss[i].end()); n --i; n } n } n int main() { n prepare(); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 200005; n const int N = 900005; n struct node { n int son[27]; n int fa; n } a[N]; n int sz; n char s[N]; n int mat[M]; n vector over[N]; n inline int new_id() { n ++sz; n over[sz].clear(); n for (int i = (1); i <= (26); i++) a[sz].son[i] = -1; n return sz; n } n int np, ans; n void ins(int pos, int x, int y) { n over[pos].push_back(np); n if (x == y) return; n int cur = s[x] - a + 1; n if (a[pos].son[cur] == -1) { n a[pos].son[cur] = new_id(); n a[a[pos].son[cur]].fa = pos; n } n ins(a[pos].son[cur], ++x, y); n return; n } n int u[M], n; n void dfs(int x, int dep) { n for (int i = (1); i <= (26); i++) n if (a[x].son[i] != -1) dfs(a[x].son[i], dep + 1); n vector g1, g2; n g1.clear(); n g2.clear(); n for (int i = 0; i < over[x].size(); i++) { n int j = over[x][i]; n if (u[j]) continue; n if (j <= n) n g1.push_back(j); n else n g2.push_back(j); n } n for (int i = 0; i < min(g1.size(), g2.size()); i++) { n ans += dep; n u[g1[i]] = u[g2[i]] = 1; n mat[g1[i]] = g2[i] - n; n } n } n int main() { n scanf( %d , &n); n sz = -1; n new_id(); n for (int i = (1); i <= (n * 2); i++) { n np = i; n scanf( %s , &s); n int len = strlen(s); n ins(0, 0, len); n } n dfs(0, 0); n printf( %d n , ans); n for (int i = (1); i <= (n); i++) printf( %d %d n , i, mat[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n double s, x, y, z; n cin >> s >> x >> y >> z; n if ((x == y) && (y == z) && (z == 0.0)) { n cout << 0 0 << s << endl; n return 0; n } n double k = x + y + z, x0 = x * s / k, y0 = y * s / k, z0 = z * s / k; n if (x0 + y0 + z0 >= s) z0 -= (x0 + y0 + z0 - s); n cout << setprecision(14) << x0 << << y0 << << z0 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n double xx[10], yy[10]; n int main() { n double px, py, vx, vy, a, b, c, d; n cin >> px >> py >> vx >> vy >> a >> b >> c >> d; n double x = vx / sqrt(vx * vx + vy * vy); n double y = vy / sqrt(vx * vx + vy * vy); n xx[1] = b * x + px; n yy[1] = b * y + py; n xx[2] = px - (y * a / 2); n yy[2] = py + (x * a / 2); n xx[3] = px - (y * c / 2); n yy[3] = py + (x * c / 2); n xx[4] = xx[3] - (d * x); n yy[4] = yy[3] - (d * y); n xx[6] = px + (y * c / 2); n yy[6] = py - (x * c / 2); n xx[5] = xx[6] - (x * d); n yy[5] = yy[6] - (d * y); n xx[7] = px + (y * a / 2); n yy[7] = py - (x * a / 2); n cout.precision(20); n for (int i = 1; i <= 7; i++) cout << xx[i] << << yy[i] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int b, l, k = 0, p, m; n cin >> b >> l; n int n[l]; n for (int i = 0; i < l; i++) { n n[i] = 0; n } n for (int i = 0; i < b; i++) { n cin >> p; n for (int j = 0; j < p; j++) { n cin >> m; n n[m - 1]++; n } n } n for (int i = 0; i < l; i++) { n if (n[i] == 0) { n k++; n } n } n if (k > 0) { n cout << NO ; n } else { n cout << YES ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long int pwr(long long int base, long long int p, long long int mod) { n long long int ans = 1; n while (p) { n if (p & 1) ans = (ans * base) % mod; n base = (base * base) % mod; n p /= 2; n } n return ans; n } n long long int gcd(long long int a, long long int b) { n if (b == 0) return a; n return gcd(b, a % b); n } n int main() { n long long int k, a, b; n scanf( %lld , &k); n scanf( %lld , &a); n scanf( %lld , &b); n long long int ans = (a / k) + (b / k); n if ((a < k && b % k != 0) || (b < k && a % k != 0)) { n printf( -1 n ); n return 0; n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 22; n int d, p, q; n int c[N][N], s[5555]; n int a[N][N], b[N][N], f[N]; n int fpow(int x, int y = p - 2) { n if (!y) return 1; n long long z = fpow(x, y >> 1); n z = z * z % p; n if (y & 1) z = z * x % p; n return z; n } n int w; n void pr(int x, int y, int z = 0) { n if (z) n printf( + %d %d %d n , x, y, z); n else n printf( ^ %d %d n , x, y); n } n void mul(int r, int x) { n int t = 100, i; n if (x % 2 == 0) x += p; n pr(r, r, t); n x--; n for (i = 2; x; i = i + i) { n if (x & i) pr(r, t, r), x -= i; n pr(t, t, t); n } n } n void go(int r) { n int t = 10, i; n mul(9, 0); n for (i = t; i <= t + d; i = i + 1) { n pr(8, 9, i); n mul(i, i - t); n pr(i, r, i); n pr(i, i); n mul(i, b[q][i - t]); n } n pr(9, 9, r); n for (i = t; i <= t + d; i = i + 1) pr(r, i, r); n } n int main() { n int i, j, k, e, x; n cin >> d >> p; n for (i = 0; i < N; i = i + 1) { n c[i][0] = 1; n for (j = 1; j <= i; j = j + 1) n c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % p; n } n for (i = 0; i <= d; i = i + 1) { n for (j = 0; j <= d; j = j + 1) n a[i][j] = (long long)fpow(i, d - j) * c[d][j] % p; n b[i][i] = 1; n } n for (i = 0; i <= d; i = i + 1) { n for (j = 0; j <= d; j = j + 1) n if (!f[j] && a[j][i]) break; n e = j; n f[e] = 1; n if (i == 2) q = j; n x = fpow(a[j][i]); n for (k = 0; k <= d; k = k + 1) { n a[e][k] = (long long)a[e][k] * x % p; n b[e][k] = (long long)b[e][k] * x % p; n } n for (j = 0; j <= d; j = j + 1) { n if (j == e || !a[j][i]) continue; n x = a[j][i]; n for (k = i; k <= d; k = k + 1) n a[j][k] = (a[j][k] - (long long)a[e][k] * x % p + p) % p; n for (k = 0; k <= d; k = k + 1) n b[j][k] = (b[j][k] - (long long)b[e][k] * x % p + p) % p; n } n } n pr(1, 2, 3); n go(1); n go(2); n go(3); n mul(1, p - 1); n mul(2, p - 1); n pr(1, 2, 1); n pr(1, 3, 1); n mul(1, fpow(2)); n printf( f 1 n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1ll << 18; n long long a, b, top, now; n queue q; n map mp; n long long rev(long long x) { n long long y = 0; n while (x != 0) { n y = (y << 1) | (x & 1); n x >>= 1; n } n return y; n } n void push(long long &x) { n if (x > b && rev(x) > b) return; n if (mp.find(x) == mp.end()) { n q.push(x); n mp[x] = 1; n } n } n string solve() { n if (a == b) return YES ; n q.push(a); n mp[a] = 1; n while (!q.empty()) { n top = q.front(); n q.pop(); n now = rev(top << 1); n if (now == b) return YES ; n push(now); n now = rev((top << 1) | 1); n if (now == b) return YES ; n push(now); n } n return NO ; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> a >> b; n cout << solve() << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream& operator<<(ostream& os, const pair& v) { n os << ( << v.first << << v.second << ) ; n return os; n } n template ::value>::type> n ostream& operator<<(ostream& os, const T& v) { n os << [ ; n for (const auto& it : v) os << it << ; n if (!v.empty()) os << b ; n os << ] ; n return os; n } n int main() { n cin.tie(0); n cout.tie(0); n ios_base::sync_with_stdio(0); n int n, x; n cin >> n; n int cnt[6] = {0, 0, 0, 0, 0, 0}; n for (int i = 0; i < (n); i++) { n cin >> x; n if (x == 4) { n cnt[0]++; n continue; n } n if (x == 8 && cnt[0]) { n cnt[0]--; n cnt[1]++; n continue; n } n if (x == 15 && cnt[1]) { n cnt[1]--; n cnt[2]++; n continue; n } n if (x == 16 && cnt[2]) { n cnt[2]--; n cnt[3]++; n continue; n } n if (x == 23 && cnt[3]) { n cnt[3]--; n cnt[4]++; n continue; n } n if (x == 42 && cnt[4]) { n cnt[4]--; n cnt[5]++; n continue; n } n } n cout << n - 6 * cnt[5] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct par { n int x, y, label; n par(int _x, int _y, int _label) { n x = _x; n y = _y; n label = _label; n } n par() {} n }; n bool operator<(par p1, par p2) { n if (p1.x != p2.x) return p1.x < p2.x; n return p1.y < p2.y; n } n int main() { n int n; n while (cin >> n) { n vector V; n int x, y; n for (int i = 0; i < n; i++) { n cin >> x >> y; n V.push_back(par(x, y, i + 1)); n } n sort((V).begin(), (V).end()); n vector sol; n for (int i = 0; i < n; i++) { n bool ok = 1; n vector aux; n for (int j = 0; j < n; j++) n if (j != i) aux.push_back(V[j]); n for (int j = 1; j < aux.size(); j++) { n if (aux[j - 1].y > aux[j].x) { n ok = 0; n break; n } n } n if (ok) sol.push_back(V[i].label); n } n sort((sol).begin(), (sol).end()); n cout << sol.size() << endl; n for (int i = 0; i < sol.size(); i++) { n if (i == 0) n printf( %d , sol[i]); n else n printf( %d , sol[i]); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n inline int read() { n int w = 1, s = 0; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) w = -1; n ch = getchar(); n } n while (isdigit(ch)) { n s = s * 10 + ch - 0 ; n ch = getchar(); n } n return w * s; n } n int n, k, fac[1001000], Ifac[1001000], f[1000010], Sum[1010010]; n inline long long ksm(long long x, long long y) { n long long res = 1; n while (y) { n if (y & 1) res = res * x % mod; n x = x * x % mod; n y >>= 1; n } n return res; n } n inline int add(int a, int b) { n a += b; n return a >= mod ? a - mod : a; n } n inline int A(int a, int b) { return 1ll * fac[a] * Ifac[a - b] % mod; } n inline void Init() { n fac[0] = Ifac[0] = 1; n for (register int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % mod; n Ifac[n] = ksm(fac[n], mod - 2); n for (register int i = n - 1; i; --i) n Ifac[i] = 1ll * Ifac[i + 1] * (i + 1) % mod; n } n int main() { n n = read(), k = read(); n Init(); n for (register int i = k + 1; i <= n; ++i) { n int tmp = 1ll * max(i - k - 1, 0) * fac[i - 2] % mod; n f[i] = add(f[i], tmp); n int l = max(i - k, 1); n f[i] = n add(f[i], 1ll * fac[i - 2] * add(Sum[i - 1], mod - Sum[l - 1]) % mod); n Sum[i] = add(Sum[i - 1], 1ll * f[i] * Ifac[i - 1] % mod); n } n cout << 1ll * Sum[n] * fac[n - 1] % mod; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 4e5 + 10; n int n, m, k, t; n bool vis[MAXN], ans[MAXN]; n int v[MAXN]; n set p[MAXN]; n priority_queue > pq; n int main() { n cin >> n >> m; n memset(vis, false, sizeof(vis)); n memset(ans, false, sizeof(ans)); n for (int i = 0; i <= 2 * m + 2; i++) v[i] = -1; n for (int i = 1; i <= n; i++) { n cin >> k; n for (int j = 0; j < k; j++) { n cin >> t; n v[t + m] = i; n p[i].insert(t + m); n } n pq.push({-p[i].size(), i}); n } n bool flag = true; n while (!pq.empty()) { n int top = pq.top().second; n pq.pop(); n if (vis[top]) continue; n if (p[top].empty()) { n flag = false; n break; n } n int x = *p[top].begin(); n vis[top] = true; n ans[x] = true; n int y = m + m - x; n if (v[y] != -1 && !vis[v[y]]) { n p[v[y]].erase(y); n pq.push({-p[v[y]].size(), v[y]}); n } n } n if (flag) { n cout << YES << endl; n for (int i = m + 1; i < m + 1 + m; i++) { n if (!ans[i]) n cout << 0; n else n cout << 1; n } n cout << endl; n } else n cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int gi() { n int w = 0, q = 0; n char c = getchar(); n while ((c < 0 || c > 9 ) && (c != - )) c = getchar(); n if (c == - ) q = 1, c = getchar(); n while (c >= 0 && c <= 9 ) w = w * 10 + c - 0 , c = getchar(); n return q ? -w : w; n } n int n, k; n long long a[500000], d[500000]; n int main() { n n = gi(), k = gi(); n long long ans = 0, sum = 0; n for (int i = 1; i <= n; ++i) a[i] = gi(); n for (int i = 1; i <= n; ++i) d[i] = gi(); n for (int i = n; i; --i) { n sum += 1ll * a[i]; n if ((i == 1) && (k == 1)) continue; n ans = max(ans, sum - d[i]); n } n if (!k) printf( %I64d n , ans), exit(0); n sum -= d[1]; n for (int i = 2; i < n; ++i) n ans = max(ans, sum - a[i] + max(0ll, a[i] - d[i])); n long long mn = 5000000, mn1 = 5000000; n sum = 0; n for (int i = 1; i < n; ++i) { n sum += 1ll * a[i]; n if (d[i] < mn) n mn1 = mn, mn = d[i]; n else if (d[i] == mn) n mn1 = d[i]; n else n mn1 = min(mn1, d[i]); n } n ans = max(ans, sum + 1ll * (max(0ll, a[n] - d[n]) - mn)); n if (k == 1) n ans = max(ans, sum + 1ll * (a[n] - mn - mn1)); n else n ans = max(ans, sum + 1ll * (a[n] - mn)); n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector b[5001]; n for (int i = 0; i < n; i++) { n string s; n int a, b1, c; n cin >> s >> a >> b1; n if (s[0] == M ) n c = 0; n else n c = 1; n b[i].push_back(c); n b[i].push_back(a); n b[i].push_back(b1); n } n int ans = 0; n for (int i = 1; i <= 366; i++) { n int m[2] = {}; n for (int j = 0; j < n; j++) { n if (b[j][1] <= i && b[j][2] >= i) m[b[j][0]]++; n } n ans = max(ans, 2 * min(m[0], m[1])); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int n, m, ar[1000005], sum, t, ar2[1000005]; n vector ans; n vector > res; n int main() { n cin.tie(0); n cout.tie(0); n ios_base::sync_with_stdio(false); n cin >> n; n for (long long int i = 1; i <= n; i++) cin >> ar[i]; n cin >> m; n for (long long int i = 1; i <= m; i++) cin >> ar2[i]; n long long int top = 0; n long long int l = 1; n for (long long int i = 1; i <= n + 1; i++) { n if (l > m) return cout << NO , 0; n if (top < ar2[l]) { n top += ar[i]; n continue; n } n if (top > ar2[l]) return cout << NO , 0; n ans.push_back(i - 1); n l++; n top = ar[i]; n } n if (top || l <= m) return cout << NO , 0; n cout << n ; n int last = 1; n long long int cnt = 0; n for (int h = 0; h < ans.size(); h++) { n long long int y = ans[h]; n long long int mk = 0, mn = INT_MAX; n for (int i = last; i <= y; i++) { n mk = max(mk, ar[i]); n mn = min(mn, ar[i]); n } n if (last == y) { n last++; n cnt = y - h - 1; n continue; n } n if (mn == mk) { n return cout << NO , 0; n } n long long int mki = 0; n char mki2; n long long int z = y - last + 1; n for (long long int i = last; i <= y; i++) { n if (ar[i] != mk) continue; n if (i != last && ar[i - 1] != ar[i]) { n mki = i; n mki2 = L ; n res.push_back({mki - cnt, mki2}); n mki--; n break; n } n if (i != y && ar[i] != ar[i + 1]) { n mki = i; n mki2 = R ; n res.push_back({mki - cnt, mki2}); n break; n } n } n z--; n z--; n while (mki > last) { n res.push_back({mki - cnt, L }); n mki--; n z--; n } n while (z--) { n res.push_back({mki - cnt, R }); n } n cnt = y - h - 1; n last = y + 1; n } n cout << YES n << n ; n for (int i = 0; i < res.size(); i++) n cout << res[i].first << << res[i].second << n ; n } n "} +{"func_code_string": "#include n const int N = 100010; n const long long INF = 1ll << 60; n const int inf = 0x3f3f3f3f; n int t; n int n, m, k; n int a[N]; n int b[N]; n std::vector row[N]; n std::vector col[N]; n int cur; n int r, c; n long long ans; n int main() { n scanf( %d%d%d , &n, &m, &k); n for (int i = 1; i <= k; ++i) { n scanf( %d%d , &a[i], &b[i]); n row[a[i]].push_back(b[i]); n col[b[i]].push_back(a[i]); n } n for (int i = 1; i <= n; ++i) { n row[i].push_back(m + 1); n row[i].push_back(0); n std::sort(row[i].begin(), row[i].end()); n } n for (int j = 1; j <= m; ++j) { n col[j].push_back(n + 1); n col[j].push_back(0); n std::sort(col[j].begin(), col[j].end()); n } n r = 1; n c = 1; n ans = 1ll; n int r_max = inf; n int c_max = inf; n int r_min = 2; n int c_min = -inf; n for (int i = 1; i <= 2 * (n + m) + 1; ++i) { n if (!cur) { n auto x = std::lower_bound(row[r].begin(), row[r].end(), c); n int c_nxt = (*x) - 1; n c_nxt = std::min(c_nxt, c_max); n assert(c_nxt >= c); n ans += c_nxt - c; n if (c == c_nxt && i != 1) { n break; n } n c = c_nxt; n c_max = c - 1; n } else if (cur == 1) { n auto x = std::lower_bound(col[c].begin(), col[c].end(), r); n int r_nxt = (*x) - 1; n r_nxt = std::min(r_nxt, r_max); n assert(r_nxt >= r); n ans += r_nxt - r; n if (r == r_nxt && i != 1) { n break; n } n r = r_nxt; n r_max = r - 1; n } else if (cur == 2) { n auto x = std::lower_bound(row[r].begin(), row[r].end(), c); n --x; n int c_nxt = (*x) + 1; n c_nxt = std::max(c_nxt, c_min); n assert(c_nxt <= c); n ans += c - c_nxt; n if (c == c_nxt && i != 1) { n break; n } n c = c_nxt; n c_min = c + 1; n } else if (cur == 3) { n auto x = std::lower_bound(col[c].begin(), col[c].end(), r); n --x; n int r_nxt = (*x) + 1; n r_nxt = std::max(r_nxt, r_min); n assert(r_nxt <= r); n ans += r - r_nxt; n if (r == r_nxt && i != 1) { n break; n } n r = r_nxt; n r_min = r + 1; n } n cur = (cur + 1) % 4; n } n if (ans + k != 1ll * n * m) { n printf( NO n ); n } else { n printf( YES n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int n; n cin >> n; n cout << n / 2 + 1 << n ; n } n int main() { n int tc, cse = 0; n cin >> tc; n while (tc--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 7; n int ans[maxn]; n int lowbit(int x) { return x & -x; } n bool is_two(int x) { return x == lowbit(x); } n bool dfs(int n, int k, int id) { n if (k == 1) { n printf( %d %d %d n , n, k, id); n if (is_two(n)) { n return false; n } n ans[id] = max(id - 2, 0); n for (int i = 2; i <= n; ++i) { n ans[id + i - 1] = id + i / 2 - 1; n } n return true; n } else if (k == 0) { n if (is_two(n)) { n ans[1] = 0; n for (int i = 2; i <= n; ++i) { n ans[i] = i / 2; n } n return true; n } else n return false; n } else { n while (k >= 2) { n ans[id] = max(id - 2, 0); n ans[id + 1] = id; n n -= 2; n k -= 1; n id += 2; n } n return dfs(n, k, id); n } n } n int main() { n int n, k; n scanf( %d%d , &n, &k); n int lim = max(0, (n - 3) / 2); n if (n % 2 == 0 || k > lim || (n == 9 && k == 2) || n (!is_two(n + 1) && k == 0) || (is_two(n + 1) && k == 1)) { n printf( NO n ); n } else { n int id = 1; n while (k >= 2) { n ans[id] = max(id - 2, 0); n ans[id + 1] = id; n n -= 2; n k -= 1; n id += 2; n } n ans[id] = max(id - 2, 0); n for (int i = 2; i <= n - 2; ++i) { n ans[id + i - 1] = id + i / 2 - 1; n } n if (is_two(n + 1)) { n if (k == 0) n ans[id + n - 2] = id + (n - 1) / 2 - 1, n ans[id + n - 1] = id + n / 2 - 1; n else n ans[id + n - 2] = 2, ans[id + n - 1] = 2; n } else { n if (k == 0) n return printf( NO n ), 0; n else n ans[id + n - 2] = id + (n - 1) / 2 - 1, n ans[id + n - 1] = id + n / 2 - 1; n } n printf( YES n ); n for (int i = 1; i < id + n - 1; ++i) { n printf( %d , ans[i]); n } n printf( %d n , ans[id + n - 1]); n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e6 + 1, inf = 1e18; n vector > a, b; n vector, long long> > z; n long long add[4 * N], t[4 * N]; n void push(long long v, long long l, long long r) { n t[v] += add[v]; n if (l != r - 1) { n add[2 * v] += add[v]; n add[2 * v + 1] += add[v]; n } n add[v] = 0; n } n void update(long long v, long long l, long long r, long long vl, long long vr, n long long val) { n push(v, l, r); n if (l >= vr || vl >= r) return; n if (l >= vl && r <= vr) { n add[v] += val; n push(v, l, r); n return; n } n long long m = (l + r) / 2; n update(2 * v, l, m, vl, vr, val); n update(2 * v + 1, m, r, vl, vr, val); n t[v] = max(t[2 * v + 1], t[2 * v]); n } n long long get(long long v, long long l, long long r, long long vl, n long long vr) { n push(v, l, r); n if (l >= vr || vl >= r) return -inf; n if (l >= vl && r <= vr) { n return t[v]; n } n long long m = (l + r) / 2; n return max(get(2 * v, l, m, vl, vr), get(2 * v + 1, m, r, vl, vr)); n } n void fuckyou(long long v, long long l, long long r, long long pos, n long long val) { n if (l > pos || r <= pos) return; n if (l == r - 1) { n t[v] = max(t[v], val); n return; n } n long long m = (l + r) / 2; n fuckyou(2 * v, l, m, pos, val); n fuckyou(2 * v + 1, m, r, pos, val); n t[v] = max(t[2 * v], t[2 * v + 1]); n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n for (long long i = 0; i < 4 * N; i++) t[i] = -inf; n long long n, m, p, ans = -inf; n cin >> n >> m >> p; n a.resize(n); n b.resize(m); n z.resize(p); n for (long long i = 0; i < n; i++) { n cin >> a[i].first >> a[i].second; n } n for (long long i = 0; i < m; i++) { n cin >> b[i].first >> b[i].second; n fuckyou(1, 0, N, b[i].first, -b[i].second); n } n for (long long i = 0; i < p; i++) { n cin >> z[i].first.first >> z[i].first.second >> z[i].second; n } n sort((z).begin(), (z).end()); n sort((a).begin(), (a).end()); n cout << endl; n long long j = 0; n for (long long i = 0; i < n; i++) { n while (j < z.size() && a[i].first > z[j].first.first) { n update(1, 0, N, z[j].first.second + 1, N, z[j].second); n j++; n } n ans = max(ans, -a[i].second + get(1, 0, N, 0, N)); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n string s; n string rev(string s) { n string p; n for (auto i : s) p.insert(0, 1, i); n return p; n } n int main() { n cin >> s; n int n = s.size(); n for (int i = 0; i <= s.size(); i++) n for (int j = 0; j < 26; j++) { n string p = s; n p.insert(i, 1, j + a ); n if (p == rev(p)) return cout << p, 0; n } n cout << NA ; n } n "} +{"func_code_string": "#include n struct PP { n int l, r, sum, lv, rv, cover; n int mid() { return (l + r) >> 1; } n void doit() { sum = lv = rv = cover ? 0 : dis(); } n int dis() { return r - l; } n } q[100005 * 3]; n int max(int a, int b) { return a > b ? a : b; } n void Build(int l, int r, int x) { n q[x].l = l; n q[x].r = r; n q[x].sum = q[x].lv = q[x].rv = q[x].dis(); n q[x].cover = -1; n if (l == r - 1) return; n int mid = q[x].mid(); n Build(l, mid, (x << 1)); n Build(mid, r, ((x << 1) | 1)); n } n void pushdown(int x) { n q[(x << 1)].cover = q[((x << 1) | 1)].cover = q[x].cover; n q[(x << 1)].doit(); n q[((x << 1) | 1)].doit(); n q[x].cover = -1; n } n void Pushup(int x) { n q[x].sum = max(q[(x << 1)].rv + q[((x << 1) | 1)].lv, n max(q[(x << 1)].sum, q[((x << 1) | 1)].sum)); n q[x].lv = q[(x << 1)].lv; n q[x].rv = q[((x << 1) | 1)].rv; n if (q[(x << 1)].sum == q[(x << 1)].dis()) q[x].lv += q[((x << 1) | 1)].lv; n if (q[((x << 1) | 1)].sum == q[((x << 1) | 1)].dis()) n q[x].rv += q[(x << 1)].rv; n } n void update(int l, int r, int c, int x) { n if (l <= q[x].l && q[x].r <= r) { n q[x].cover = c; n q[x].doit(); n return; n } n if (q[x].cover != -1) pushdown(x); n int mid = q[x].mid(); n if (l < mid) update(l, r, c, (x << 1)); n if (mid < r) update(l, r, c, ((x << 1) | 1)); n Pushup(x); n } n int query(int w, int x) { n if (q[x].sum >= w && q[x].cover == 0) return q[x].l; n if (q[x].cover != -1) pushdown(x); n if (q[(x << 1)].sum >= w) n return query(w, (x << 1)); n else if (q[(x << 1)].rv + q[((x << 1) | 1)].lv >= w) n return q[(x << 1)].r - q[(x << 1)].rv; n else if (q[((x << 1) | 1)].sum >= w) n return query(w, ((x << 1) | 1)); n else n return -1; n } n struct SS { n int l, r; n } cnt[100005]; n int main() { n int i, m, op, a; n int L, B, F; n while (scanf( %d%d%d , &L, &B, &F) != EOF) { n scanf( %d , &m); n Build(0, B + L + F, 1); n for (i = 1; i <= m; i++) { n scanf( %d%d , &op, &a); n if (op == 1) { n int pos = query(B + a + F, 1); n if (pos == -1) { n printf( -1 n ); n continue; n } n printf( %d n , pos); n update(pos + B, pos + B + a, 1, 1); n cnt[i].l = pos + B; n cnt[i].r = pos + B + a; n } else n update(cnt[a].l, cnt[a].r, 0, 1); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mxN = 200000; n int n, m, t, tin[mxN]; n vector adj[mxN], e[mxN]; n vector> ans; n void dfs(int u, int p = -1) { n tin[u] = ++t; n if (p ^ -1) e[u].push_back(p); n for (int v : adj[u]) { n if (v == p) continue; n if (!tin[v]) { n dfs(v, u); n } else if (tin[v] < tin[u]) { n e[u].push_back(v); n } n } n while (e[u].size() >= 2) { n int v = e[u].back(); n e[u].pop_back(); n int w = e[u].back(); n e[u].pop_back(); n ans.push_back({v, u, w}); n } n if (e[u].size() == 1 && p ^ -1) e[p].push_back(u); n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n >> m; n for (int i = 0; i < m; ++i) { n int u, v; n cin >> u >> v, --u, --v; n adj[u].push_back(v); n adj[v].push_back(u); n } n for (int i = 0; i < n; ++i) n if (!tin[i]) dfs(i); n cout << ans.size() << n ; n for (array x : ans) n cout << x[0] + 1 << << x[1] + 1 << << x[2] + 1 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void __f(const char* name, Arg1&& arg1) { n cerr << name << : << arg1 << std::endl; n } n template n void __f(const char* names, Arg1&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n cerr.write(names, comma - names) << : << arg1 << | ; n __f(comma + 1, args...); n } n const int N = int(2e5) + 10; n const int M = int(1e5) + 5; n const int INF = int(1e9); n int U[N], V[N], W[N], vis[N], D[N], comp[N], val[N], ans[N], parent; n vector g[N], rg[N], G[N], nodes; n int n, m; n int adj(int u, int e) { return U[e] ^ V[e] ^ u; } n void get(int u) { n nodes.push_back(u); n nodes.push_back(u + M); n vis[u] = 1; n for (auto e : G[u]) { n int w = adj(u, e); n if (vis[w]) continue; n get(w); n } n } n int NOT(int u) { n if (u < M) n return u + M; n else n return u - M; n } n void addEdge(int u, int v) { n u = NOT(u); n g[u].push_back(v); n rg[v].push_back(u); n u = NOT(u); n v = NOT(v); n swap(u, v); n g[u].push_back(v); n rg[v].push_back(u); n } n void clear(int u) { n g[u].clear(), rg[u].clear(), vis[u] = 0, val[u] = 0, comp[u] = 0; n for (auto e : G[u]) D[e] = 0; n } n vector order, component; n void dfs1(int u) { n vis[u] = 1; n for (auto w : g[u]) n if (!vis[w]) dfs1(w); n order.push_back(u); n } n void dfs2(int u) { n vis[u] = 1; n comp[u] = parent; n for (auto w : rg[u]) n if (!vis[w]) dfs2(w); n } n int go(int t) { n for (auto u : nodes) clear(u); n for (auto u : nodes) n for (auto e : G[u]) n if (!D[e]) { n D[e] = 1; n if (W[e] == t) n addEdge(U[e], V[e]), addEdge(NOT(U[e]), NOT(V[e])); n else n addEdge(U[e], NOT(V[e])), addEdge(NOT(U[e]), V[e]); n } n order.clear(); n for (auto i : nodes) n if (!vis[i]) dfs1(i); n for (auto u : nodes) vis[u] = 0; n reverse(order.begin(), order.end()); n vector Cmp; n for (auto i : order) { n if (!vis[i]) parent = i, Cmp.push_back(i), dfs2(i); n } n for (auto u : nodes) { n if (comp[u] == comp[NOT(u)]) return INF; n } n reverse(Cmp.begin(), Cmp.end()); n int a = 0, b = 0; n for (auto u : Cmp) { n if (!val[u]) { n val[u] = 1; n val[comp[NOT(u)]] = -1; n } n } n for (auto u : nodes) n if (u < M) (val[comp[u]] == 1) ? a++ : b++; n int V = (a > b ? 0 : 1); n for (auto u : nodes) n if (u < M && val[comp[u]] == 1) n ans[u] = V; n else if (u < M) n ans[u] = 1 - V; n return min(a, b); n } n int main() { n scanf( %d %d , &n, &m); n for (int i = 1; i <= m; i++) { n char x; n scanf( %d %d %c , U + i, V + i, &x); n G[U[i]].push_back(i); n G[V[i]].push_back(i); n W[i] = (x == R ? 1 : 0); n } n long long int Ans1 = 0, Ans2 = 0; n for (int i = 1; i <= n; i++) n if (!vis[i]) { n nodes.clear(); n get(i); n Ans1 += go(0); n Ans2 += go(1); n } n long long int Ans = min(Ans1, Ans2); n if (Ans >= INF) n puts( -1 ); n else { n printf( %lld n , Ans); n int t = (Ans == Ans1 ? 0 : 1); n memset(vis, 0, sizeof(vis)); n for (int i = 1; i <= n; i++) n if (!vis[i]) { n nodes.clear(); n get(i); n go(t); n } n for (int i = 1; i <= n; i++) n if (ans[i]) printf( %d , i); n puts( ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long n; n cin >> n; n if (n == 47 || n == 74 || n == 477 || n == 477) n cout << YES ; n else if (n % 4 == 0 || n % 7 == 0 || n % 47 == 0) n cout << YES ; n else n cout << NO ; n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int a, int b) { n if (a == 0) return b; n return gcd(b % a, a); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n int n, arr[105]; n cin >> n; n for (int i = 0; i < n; i++) cin >> arr[i]; n int ans = arr[0]; n for (int i = 1; i < n; i++) { n ans = gcd(ans, arr[i]); n } n cout << ans * n << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, r; n cin >> n >> m >> r; n vector v(n); n vector v1(m); n for (int i = 0; i < n; i++) { n cin >> v[i]; n } n for (int i = 0; i < m; i++) { n cin >> v1[i]; n } n sort(v.begin(), v.end()); n sort(v1.rbegin(), v1.rend()); n if (v[0] > v1[0]) { n cout << r << endl; n return 0; n } n int cnt = 0; n cnt += r % v[0]; n cnt += (r / v[0]) * v1[0]; n cout << cnt; n } n "} +{"func_code_string": "#include n using namespace std; n int ured() { n int re = 0, ch; n do { n ch = getchar(); n } while ( 9 < ch || ch < 0 ); n do { n re = re * 10 + (ch ^ 0 ); n } while ( 0 <= (ch = getchar()) && ch <= 9 ); n return re; n } n void uwit(int da) { n int cn = 0, ch[21]; n do { n ch[++cn] = da - da / 10 * 10; n } while (da /= 10); n do { n putchar( 0 ^ ch[cn]); n } while (--cn); n } n inline void dmax(int& fr, int to) { n if (fr < to) { n fr = to; n } n } n inline void dmin(int& fr, int to) { n if (fr > to) { n fr = to; n } n } n inline int mabs(int da) { return da >= 0 ? da : -da; } n const int _maxn = 200011, _mods = 1000000007; n int t, n, m, pdif; n char s[_maxn]; n int main() { n t = ured(); n while (t--) { n n = ured(); n m = ured(); n if (m >= 2 * n) { n uwit((m + 1) / 2 - 1); n } else { n uwit(m - n); n } n putchar( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k, res = 1; n long long a[100005]; n long long b[100005]; n long long d = 1, ans; n int main() { n cin >> n >> k; n for (int i = 0; i < k; i++) d *= 10; n for (int i = 0; i < n / k; i++) cin >> a[i]; n for (int i = 0; i < n / k; i++) cin >> b[i]; n for (int i = 0; i < n / k; i++) { n ans = (d - 1) / a[i] + 1; n if (b[i] == 0) n ans -= ((d / 10) - 1) / a[i] + 1; n else n ans -= n ((b[i] + 1) * (d / 10) - 1) / a[i] - ((b[i]) * (d / 10) - 1) / a[i]; n res = (res * ans) % (1000000007); n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long read() { n long long X = 0, w = 1; n char c = getchar(); n while (c < 0 || c > 9 ) { n if (c == - ) w = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) X = X * 10 + c - 0 , c = getchar(); n return X * w; n } n const long long _ = 1e18; n signed main() { n long long a = read(), q = (_ % a * 9 % a * 9 % a + 1) % a; n printf( %lld %lld n , a - q + 1, a - q + _); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long double PI = acosl(-1); n bool compare_int(int a, int b) { return (a > b); } n bool compare_string(string a, string b) { return a.size() < b.size(); } n bool compare_pair(const pair &a, const pair &b) { n if (a.second == b.second) n return a.first < b.first; n else n return (a.second > b.second); n } n bool cmp(pair x, pair y) { n return (x.second < y.second); n } n long long int bigmod(long long int a, long long int b, long long int m) { n if (b == 0) return 1 % m; n long long int x = bigmod(a, b / 2, m); n x = (x * x) % m; n if (b % 2 == 1) x = (x * a) % m; n return x; n } n void NA() { n printf( NO n ); n exit(0); n } n void YA() { n printf( YES n ); n exit(0); n } n int32_t main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n vector a(n); n for (int i = 0; i < n; i++) cin >> a[i]; n long long int mx = 0LL, mn = 0LL; n sort(a.begin(), a.end()); n for (int i = 0; i < n; i++) { n mx = (mx + bigmod(2, i, 1000000007) * a[i]) % 1000000007; n mn = (mn + bigmod(2, n - i - 1, 1000000007) * a[i]) % 1000000007; n } n cout << (mx - mn + 1000000007) % 1000000007 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n void abc() { cout << endl; } n template n void abc(T a, U... b) { n cout << a << , abc(b...); n } n template n void printv(T l, T r) { n while (l != r) cout << *l << n [++l == r]; n } n template n istream& operator>>(istream& o, pair& a) { n return o >> a.first >> a.second; n } n template n ostream& operator<<(ostream& o, pair a) { n return o << ( << a.first << , << a.second << ) ; n } n template n ostream& operator<<(ostream& o, vector a) { n bool is = false; n for (T i : a) { n o << (is ? : { ), is = true, o << i; n } n return o << } ; n } n template n struct vv : vector> { n vv(int n, int m, T v) : vector>(n, vector(m, v)) {} n vv() {} n }; n template n struct vvv : vector> { n vvv(int n, int m, int k, T v) : vector>(n, vv(m, k, v)) {} n vvv() {} n }; n const int mod = 1e9 + 7, N = 200001, logN = 20, K = 80000; n long long int modpow(long long int a, int b) { n long long int ans = 1; n for (; b; b >>= 1, a = a * a % mod) { n if (b & 1) ans = ans * a % mod; n } n return ans; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int n; n cin >> n; n vector a(n); n vv inv(n, n, 0); n for (int i = 0; i < n; ++i) { n cin >> a[i]; n } n for (int i = 0; i < n; ++i) n for (int j = 0; j < n; ++j) { n inv[i][j] = modpow((a[i] + a[j]) % mod, mod - 2); n } n vv pre(1 << n, n, 1); n vv pw(n, n + 1, 1); n for (int i = 0; i < n; ++i) { n for (int j = 1; j <= n; ++j) { n pw[i][j] = pw[i][j - 1] * a[i] % mod; n } n } n for (int i = 0; i < n; ++i) { n for (int s = 0; s < 1 << n; ++s) { n for (int j = 0; j < n; ++j) n if (s >> j & 1) { n pre[s][i] = pre[s][i] * inv[i][j] % mod; n } n } n } n vector dp(1 << n, 1); n for (int s = 0; s < 1 << n; ++s) { n for (int t = s ^ (s & (-s)); t > 0; t = (t - 1) & s) { n long long int res = dp[t]; n for (int j = 0; j < n; ++j) n if (t >> j & 1) { n res = res * pre[t ^ s][j] % mod * pw[j][__builtin_popcount(t ^ s)] % n mod; n } n dp[s] -= res; n if (dp[s] < 0) dp[s] += mod; n } n } n long long int ans = 0; n for (int s = 0; s < 1 << n; ++s) { n int k = __builtin_popcount(s); n long long int res = dp[s]; n for (int i = 0; i < n; ++i) n if (s >> i & 1) { n for (int j = 0; j < n; ++j) n if (~s >> j & 1) { n res = res * a[i] % mod * inv[i][j] % mod; n } n } n ans += res * k % mod; n if (ans >= mod) ans -= mod; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n int main() { n int t, res = 0; n long x, y, n; n std::cin >> t; n for (int i = 0; i < t; i++) { n std::cin >> x >> y >> n; n if (n > 0) { n res = (n - y) % x; n std::cout << n - res << n ; n } else { n std::cout << 0 << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int N, i, j; n string S, R; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> N >> S; n for (i = N - 2; i >= 0; i -= 2) { n R = R + S[i]; n } n if (N % 2 == 0) n i = 1; n else n i = 0; n for (i = i; i < N; i += 2) { n R = R + S[i]; n } n cout << R << endl; n } n "} +{"func_code_string": "#include n template n inline void read(T &x) { n x = 0; n char c = getchar(); n bool flag = false; n while (!isdigit(c)) { n if (c == - ) flag = true; n c = getchar(); n } n while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar(); n if (flag) x = -x; n } n using namespace std; n int n, q, nn; n bitset<2011> bt[1011][2], h[2011]; n int htot; n int ans[2011], pos[2011]; n inline void Gauss() { n int nw = 1; n for (int i = 1; i < nn; ++i) { n int id = -1; n for (int hang = nw; hang <= htot; ++hang) n if (h[hang][i]) { n id = hang; n break; n } n if (id == -1) continue; n swap(h[id], h[nw]); n pos[i] = nw; n for (int hang = 1; hang <= htot; ++hang) n if (hang != nw && h[hang][i]) { n h[hang] = h[hang] ^ h[nw]; n } n ++nw; n if (nw > htot) break; n } n for (int i = 1; i <= htot; ++i) n if (h[i][nn]) { n bool flag = false; n for (int j = 1; j < nn; ++j) n if (h[i][j]) { n flag = true; n break; n } n if (!flag) { n puts( NO ); n exit(0); n } n } n for (int i = 1; i < nn; ++i) { n ans[i] = h[pos[i]][nn]; n } n puts( YES ); n for (int i = 1; i <= n; ++i) { n if (ans[i] == 0 && ans[i + n] == 0) n putchar( . ); n else if (ans[i] == 1 && ans[i + n] == 0) n putchar( R ); n else if (ans[i] == 0 && ans[i + n] == 1) n putchar( B ); n else n putchar( Y ); n } n putchar( n ); n } n int main() { n read(n), read(q); n nn = n + n + 1; n for (int i = 1; i <= n; ++i) bt[i][0][i] = bt[i][1][i + n] = 1; n for (int i = 1; i <= q; ++i) { n char opt[6]; n scanf( %s , opt); n if (opt[0] == m ) { n int k; n read(k); n htot += 2; n for (int j = 1; j <= k; ++j) { n int p; n read(p); n h[htot - 1] ^= bt[p][0]; n h[htot] ^= bt[p][1]; n } n char res[3]; n scanf( %s , res); n if (res[0] == W ) n h[htot - 1][nn] = 0, h[htot][nn] = 0; n else if (res[0] == R ) n h[htot - 1][nn] = 1, h[htot][nn] = 0; n else if (res[0] == B ) n h[htot - 1][nn] = 0, h[htot][nn] = 1; n else n h[htot - 1][nn] = 1, h[htot][nn] = 1; n } else if (opt[0] == R && opt[1] == Y ) { n int k; n read(k); n for (int j = 1; j <= k; ++j) { n int p; n read(p); n bt[p][1] = bt[p][1] ^ bt[p][0]; n } n } else if (opt[0] == R && opt[1] == B ) { n int k; n read(k); n for (int j = 1; j <= k; ++j) { n int p; n read(p); n swap(bt[p][0], bt[p][1]); n } n } else if (opt[0] == Y && opt[1] == B ) { n int k; n read(k); n for (int j = 1; j <= k; ++j) { n int p; n read(p); n bt[p][0] = bt[p][0] ^ bt[p][1]; n } n } n } n Gauss(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long i, j, t, n, k, a, b; n double v; n string line; n char s[4]; n int main() { n while (cin >> n >> a >> b) { n if (b < 0) b = n + b; n a = a + b; n a = a % n; n if (a == 0) n a = n; n else if (a < 0) n a = n + a; n cout << a; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 300005; n pair p[N]; n int main() { n int n; n cin >> n; n int a[n]; n for (int i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n int i = 0, j = 0; n while (j < n) { n if (a[i] < a[j]) i++; n j++; n } n cout << i << endl; n return 0; n } n "} +{"func_code_string": "#include n const int INF = (int)1e9; n using namespace std; n const int MAX = 1e3 + 5; n int n, xa, ya, xb, yb; n pair, int> arr[MAX]; n vector > vec; n bool covered(int x1, int y1, int x2, int y2, int R) { n double dist = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); n return dist <= (double)R; n } n int main() { n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); n cin >> xa >> ya >> xb >> yb >> n; n for (int i = 0; i < n; i++) { n cin >> arr[i].first.first >> arr[i].first.second >> arr[i].second; n } n if (xa > xb) swap(xa, xb); n if (ya > yb) swap(ya, yb); n for (int i = ya; i <= yb; i++) { n vec.push_back(make_pair(xa, i)); n vec.push_back(make_pair(xb, i)); n } n for (int i = xa + 1; i < xb; i++) { n vec.push_back(make_pair(i, ya)); n vec.push_back(make_pair(i, yb)); n } n int res = 0; n for (int i = 0; i < vec.size(); i++) { n bool flag = false; n for (int j = 0; j < n; j++) { n if (covered(vec[i].first, vec[i].second, arr[j].first.first, n arr[j].first.second, arr[j].second)) { n flag = true; n break; n } n } n if (!flag) res++; n } n cout << res << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 5; n int n, m, fa[N], f[N], d[N], head[N], xx, yy, ww, fr[N]; n int ans; n bool in[N], c[N]; n struct nd { n int x, y, w, id; n } a[N]; n bool operator<(nd a, nd b) { return a.w < b.w || (a.w == b.w && a.id < b.id); } n struct ndd { n int ne, to, w; n } e[N]; n void ins(int x, int y, int w) { n static int cnt; n e[++cnt].to = y; n e[cnt].ne = head[x]; n head[x] = cnt; n e[cnt].w = w; n } n int gf(int x) { return fa[x] == x ? x : fa[x] = gf(fa[x]); } n void dfs(int x) { n for (int i = head[x]; i; i = e[i].ne) n if (e[i].to != f[x]) { n int y = e[i].to; n f[y] = x; n d[y] = d[x] + 1; n fr[y] = e[i].w; n dfs(y); n } n } n void col(int x, int b) { n c[x] = 1; n for (int i = head[x]; i; i = e[i].ne) n if (e[i].to != b) { n int y = e[i].to; n col(y, x); n } n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; ++i) { n scanf( %d%d%d , &a[i].x, &a[i].y, &a[i].w); n a[i].id = i; n } n xx = a[1].x, yy = a[1].y, ww = a[1].w; n sort(a + 1, a + m + 1); n for (int i = 1; i <= n; ++i) fa[i] = i; n for (int i = 1; i <= m; ++i) { n int fx = gf(a[i].x), fy = gf(a[i].y); n if (fx != fy) { n fa[fx] = fy; n in[a[i].id] = 1; n ins(a[i].x, a[i].y, a[i].w); n ins(a[i].y, a[i].x, a[i].w); n } n } n d[1] = 1; n dfs(1); n if (!in[1]) { n while (xx != yy) { n if (d[xx] < d[yy]) swap(xx, yy); n ans = max(ans, fr[xx]); n xx = f[xx]; n } n } else { n ans = 1e9; n col(yy, xx); n for (int i = 1; i <= m; ++i) n if (!in[a[i].id]) { n if (c[a[i].x] ^ c[a[i].y]) ans = min(ans, a[i].w); n } n } n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n struct point { n long long x, y, z; n point() {} n point(long long a, long long b, long long c) : x(a), y(b), z(c) {} n double operator()(point y) { n return sqrt((this->x - y.x) * (this->x - y.x) + n (this->y - y.y) * (this->y - y.y) + n (this->z - y.z) * (this->z - y.z)); n } n }; n vector> ans; n int taken[10005]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n long long a, b, c; n point arr[n]; n for (int i = 0; i < n; i++) { n cin >> a >> b >> c; n point p(a, b, c); n arr[i] = p; n } n for (int i = 0; i < n; i++) { n double minimum = 1e11; n int correct; n if (taken[i]) continue; n for (int j = 0; j < n; j++) { n if (i == j || taken[j]) continue; n double x = arr[i](arr[j]); n if (x < minimum) { n minimum = x; n correct = j; n } n } n taken[correct] = 1; n taken[i] = 1; n ans.push_back({i, correct}); n } n for (int i = 0; i < n / 2; i++) n cout << ans[i].first + 1 << << ans[i].second + 1 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N, M; n int d[300010]; n int h[300010]; n pair L[8 * 300010]; n pair R[8 * 300010]; n void aggL(int nodo, int left, int right, int pos, long long val) { n if (left == right) { n L[nodo] = pair(val, pos); n return; n } n int mid = (left + right) / 2; n if (pos <= mid) n aggL(nodo * 2, left, mid, pos, val); n else n aggL(nodo * 2 + 1, mid + 1, right, pos, val); n L[nodo] = max(L[nodo * 2], L[nodo * 2 + 1]); n } n void aggR(int nodo, int left, int right, int pos, long long val) { n if (left == right) { n R[nodo] = pair(val, pos); n return; n } n int mid = (left + right) / 2; n if (pos <= mid) n aggR(nodo * 2, left, mid, pos, val); n else n aggR(nodo * 2 + 1, mid + 1, right, pos, val); n R[nodo] = max(R[nodo * 2], R[nodo * 2 + 1]); n } n pair qL(int nodo, int left, int right, int l, int r) { n if (left == l && right == r) return L[nodo]; n int mid = (left + right) / 2; n if (r <= mid) return qL(nodo * 2, left, mid, l, r); n if (l >= mid + 1) return qL(nodo * 2 + 1, mid + 1, right, l, r); n if (l <= mid && r >= mid + 1) n return max(qL(nodo * 2, left, mid, l, mid), n qL(nodo * 2 + 1, mid + 1, right, mid + 1, r)); n } n pair qR(int nodo, int left, int right, int l, int r) { n if (left == l && right == r) return R[nodo]; n int mid = (left + right) / 2; n if (r <= mid) return qR(nodo * 2, left, mid, l, r); n if (l >= mid + 1) return qR(nodo * 2 + 1, mid + 1, right, l, r); n if (l <= mid && r >= mid + 1) n return max(qR(nodo * 2, left, mid, l, mid), n qR(nodo * 2 + 1, mid + 1, right, mid + 1, r)); n } n int main() { n ifstream in( input.txt ); n cin >> N >> M; n for (int i = 0; i < N; i++) cin >> d[i]; n for (int i = 0; i < N; i++) cin >> h[i]; n for (int i = 0; i < 8 * 300010; i++) L[i].first = R[i].first = LLONG_MIN; n long long temp = 0; n for (int i = 0; i < N; i++) { n aggR(1, 0, 2 * 300010 - 1, i, temp + h[i] * 2); n aggL(1, 0, 2 * 300010 - 1, i, h[i] * 2 - temp); n temp += d[i]; n } n for (int i = 0; i < N; i++) { n aggR(1, 0, 2 * 300010 - 1, i + N, temp + h[i] * 2); n aggL(1, 0, 2 * 300010 - 1, i + N, h[i] * 2 - temp); n temp += d[i]; n } n for (int i = 0; i < M; i++) { n int a, b; n cin >> a >> b; n a--; n b--; n if (a <= b) { n temp = qR(1, 0, 2 * 300010 - 1, b + 2, N + a - 1).first; n int pos = qR(1, 0, 2 * 300010 - 1, b + 2, N + a - 1).second; n temp += qL(1, 0, 2 * 300010 - 1, b + 1, pos - 1).first; n long long res = temp; n temp = qL(1, 0, 2 * 300010 - 1, b + 1, N + a - 2).first; n pos = qL(1, 0, 2 * 300010 - 1, b + 1, N + a - 2).second; n temp += qR(1, 0, 2 * 300010 - 1, pos + 1, N + a - 1).first; n res = max(res, temp); n cout << res << endl; n } else { n temp = qR(1, 0, 2 * 300010 - 1, b + 2, a - 1).first; n int pos = qR(1, 0, 2 * 300010 - 1, b + 2, a - 1).second; n temp += qL(1, 0, 2 * 300010 - 1, b + 1, pos - 1).first; n long long res = temp; n temp = qL(1, 0, 2 * 300010 - 1, b + 1, a - 2).first; n pos = qL(1, 0, 2 * 300010 - 1, b + 1, a - 2).second; n temp += qR(1, 0, 2 * 300010 - 1, pos + 1, a - 1).first; n res = max(res, temp); n cout << res << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 200005, INF = 2000000000000000000; n long double pi = 3.1415926535897932; n long long powere(long long a, long long b, long long p) { n if (a == 0) return 0; n long long res = 1; n a %= p; n while (b > 0) { n if (b & 1) res = (res * a) % p; n b >>= 1; n a = (a * a) % p; n } n return res; n } n void copy(long long a[2][2], long long b[2][2]) { n for (long long i = 0; i < 2; i++) { n for (long long j = 0; j < 2; j++) b[i][j] = a[i][j]; n } n } n void matmult(long long m1[2][2], long long m2[2][2], long long m3[2][2]) { n for (long long i = 0; i < 2; i++) { n for (long long j = 0; j < 2; j++) { n m3[i][j] = 0; n for (long long k = 0; k < 2; k++) { n m3[i][j] += n (m1[i][k] % 1000000007 * m2[k][j] % 1000000007) % 1000000007; n m3[i][j] %= 1000000007; n } n } n } n } n void power(long long mat[2][2], long long b, long long p, n long long finres[2][2]) { n long long res[2][2] = {{0}}, cc[2][2]; n res[0][0] = res[1][1] = 1; n while (b > 0) { n copy(res, cc); n if (b & 1) matmult(mat, cc, res); n copy(mat, cc); n b >>= 1; n matmult(cc, cc, mat); n } n copy(res, finres); n } n int32_t main() { n std::ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cout.precision(std::numeric_limits::max_digits10); n ; n long long t; n cin >> t; n while (t--) { n long long x1, y1, x2, y2; n cin >> x1 >> y1 >> x2 >> y2; n long long x = abs(x1 - x2), y = abs(y1 - y2); n if (y < x) swap(x, y); n long long ans = (x * (x + 1)); n ans += ((y - x - 1) * x); n cout << ans + 1 << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n void fun(long long int a, long long int b, long long int u, n vector &t) { n long long int i, j, k, n; n for (i = 1; i < b; i++) { n if (u) t[i]++; n } n u = 1 - u; n i = b; n while (i < 1000) { n for (j = 0; j < a; j++) { n if (i >= 1000) return; n if (u) t[i]++; n i++; n } n u = 1 - u; n } n } n void solve() { n long long int i, j, k, n; n cin >> n; n string s; n cin >> s; n vector > v(n); n vector t(1000, 0); n for (i = 0; i < n; i++) { n if (s[i] == 1 ) t[0]++; n } n for (i = 0; i < n; i++) { n cin >> v[i].first >> v[i].second; n } n for (i = 0; i < n; i++) { n fun(v[i].first, v[i].second, s[i] - 0 , t); n } n long long int mx = t[0]; n for (i = 1; i < (int)t.size(); i++) mx = max(mx, t[i]); n cout << mx; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long int t = 1; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, q, x, y; n char type; n map > Data; n int solve() { n auto fi = Data.lower_bound(x); n if (fi->first == x) return 0; n if (type == L ) fi--; n int ans = abs(x - fi->first); n if (fi->second.first == type) ans += fi->second.second; n Data[x] = make_pair(type, ans); n return ans; n } n int main() { n scanf( %d %d , &n, &q); n Data[0] = make_pair( U , 0); n Data[n + 1] = make_pair( L , 0); n while (q--) { n cin >> x >> y >> type; n printf( %d n , solve()); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 15, N = 15; n int m, n; n pair a[M], b[N]; n vector tot, cur; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cin >> m >> n; n for (int i = 1; i <= m; i++) { n cin >> a[i].first >> a[i].second; n } n for (int i = 1; i <= n; i++) { n cin >> b[i].first >> b[i].second; n } n for (int i = 1; i <= m; i++) { n cur.clear(); n for (int j = 1; j <= n; j++) { n int cnt = 0; n if (a[i].first == b[j].first || a[i].first == b[j].second) { n cnt++; n } n if (a[i].second == b[j].first || a[i].second == b[j].second) { n cnt++; n } n if (cnt == 1) { n if (a[i].first == b[j].first || a[i].first == b[j].second) { n cur.push_back(a[i].first); n } else { n cur.push_back(a[i].second); n } n } n } n sort(cur.begin(), cur.end()); n cur.erase(unique(cur.begin(), cur.end()), cur.end()); n if (cur.size() >= 2) { n return cout << -1, 0; n } else if (cur.size() == 1) { n tot.push_back(cur[0]); n } n } n for (int i = 1; i <= n; i++) { n cur.clear(); n for (int j = 1; j <= m; j++) { n int cnt = 0; n if (b[i].first == a[j].first || b[i].first == a[j].second) { n cnt++; n } n if (b[i].second == a[j].first || b[i].second == a[j].second) { n cnt++; n } n if (cnt == 1) { n if (b[i].first == a[j].first || b[i].first == a[j].second) { n cur.push_back(b[i].first); n } else { n cur.push_back(b[i].second); n } n } n } n sort(cur.begin(), cur.end()); n cur.erase(unique(cur.begin(), cur.end()), cur.end()); n if (cur.size() >= 2) { n return cout << -1, 0; n } else if (cur.size() == 1) { n tot.push_back(cur[0]); n } n } n sort(tot.begin(), tot.end()); n tot.erase(unique(tot.begin(), tot.end()), tot.end()); n if (tot.size() >= 2) { n cout << 0; n } else { n cout << tot[0]; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, t, i; n cin >> t; n for (i = 0; i < t; i++) { n cin >> a >> b; n cout << a + b; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long k, b, n, t, ans, cur; n int main() { n ios_base::sync_with_stdio(0); n cin >> k >> b >> n >> t; n ans = n; n cur = k + b; n while (cur <= t) { n cur = cur * k + b; n --ans; n } n if (ans < 0) ans = 0; n cout << ans << endl; n cin.get(); n cin.get(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100010; n int n, q, L[maxn << 2], R[maxn << 2]; n double sum[maxn << 2], add[maxn << 2], mul[maxn << 2]; n void pushup(int o) { sum[o] = sum[o * 2] + sum[o * 2 + 1]; } n void pushdown(int o) { n sum[o * 2] = sum[o * 2] * mul[o] + add[o] * (R[o * 2] - L[o * 2] + 1); n sum[o * 2 + 1] = n sum[o * 2 + 1] * mul[o] + add[o] * (R[o * 2 + 1] - L[o * 2 + 1] + 1); n add[o * 2] = add[o * 2] * mul[o] + add[o]; n add[o * 2 + 1] = add[o * 2 + 1] * mul[o] + add[o]; n mul[o * 2] = mul[o * 2] * mul[o]; n mul[o * 2 + 1] = mul[o * 2 + 1] * mul[o]; n mul[o] = 1; n add[o] = 0; n } n void build(int o, int l, int r) { n L[o] = l; n R[o] = r; n add[o] = 0; n mul[o] = 1; n if (l == r) { n cin >> sum[o]; n return; n } n int mid = (l + r) >> 1; n build(o * 2, l, mid); n build(o * 2 + 1, mid + 1, r); n pushup(o); n } n double query(int o, int l, int r, int x, int y) { n if (x <= l && r <= y) { n return sum[o]; n } n pushdown(o); n int mid = (l + r) >> 1; n double res = 0.0; n if (x <= mid) res += query(o * 2, l, mid, x, y); n if (y > mid) res += query(o * 2 + 1, mid + 1, r, x, y); n return res; n } n void update1(int o, int l, int r, int x, int y, double v) { n if (x <= l && r <= y) { n sum[o] += v * (r - l + 1); n add[o] += v; n return; n } n pushdown(o); n int mid = (l + r) >> 1; n if (x <= mid) update1(o * 2, l, mid, x, y, v); n if (y > mid) update1(o * 2 + 1, mid + 1, r, x, y, v); n pushup(o); n } n void update2(int o, int l, int r, int x, int y, double v) { n if (x <= l && r <= y) { n add[o] *= v; n sum[o] *= v; n mul[o] *= v; n return; n } n pushdown(o); n int mid = (l + r) >> 1; n if (x <= mid) update2(o * 2, l, mid, x, y, v); n if (y > mid) update2(o * 2 + 1, mid + 1, r, x, y, v); n pushup(o); n } n int main() { n scanf( %d%d , &n, &q); n build(1, 1, n); n while (q--) { n int l1, r1, l2, r2; n int id; n scanf( %d , &id); n if (id == 1) { n scanf( %d%d%d%d , &l1, &r1, &l2, &r2); n double sum1 = query(1, 1, n, l1, r1), sum2 = query(1, 1, n, l2, r2); n double len1 = r1 - l1 + 1, len2 = r2 - l2 + 1; n update2(1, 1, n, l1, r1, (len1 - 1) / len1); n update2(1, 1, n, l2, r2, (len2 - 1) / len2); n update1(1, 1, n, l1, r1, 1.0 / len1 * (sum2 / len2)); n update1(1, 1, n, l2, r2, 1.0 / len2 * (sum1 / len1)); n } else { n scanf( %d%d , &l1, &r1); n printf( %.7lf n , query(1, 1, n, l1, r1)); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void connected(vector > chu, vector& v, int s) { n v[s] = 1; n for (int i = 0; i < chu.size(); i++) { n if (chu[s][i] && !v[i]) { n connected(chu, v, i); n } n } n } n int main() { n int n, m; n while (cin >> n >> m) { n if (n != m) { n cout << NO << endl; n break; n } n vector > chu(n, vector(n, 0)); n for (int i = 0; i < m; i++) { n int e1, e2; n cin >> e1 >> e2; n chu[e1 - 1][e2 - 1] = 1; n chu[e2 - 1][e1 - 1] = 1; n } n vector visisted(n, 0); n connected(chu, visisted, 0); n bool allseen = true; n for (int i = 0; i < visisted.size(); i++) { n if (!visisted[i]) allseen = false; n } n if (allseen) { n cout << FHTAGN! << endl; n } else { n cout << NO << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n int n, m, op, det; n int dir[2]; n long long mv[2]; n int ans[1111111]; n int main() { n scanf( %d%d , &n, &m); n dir[1] = 1; n dir[0] = -1; n mv[1] = mv[0] = 0LL; n for (int i = 0; i < m; i++) { n scanf( %d , &op); n if (op == 1) { n scanf( %d , &det); n mv[1] += det; n mv[0] += det; n if (det % 2) { n dir[1] = -dir[1]; n dir[0] = -dir[0]; n } n } else { n mv[1] += dir[1]; n mv[0] += dir[0]; n dir[1] = -dir[1]; n dir[0] = -dir[0]; n } n } n mv[1] %= n; n if (mv[1] < 0) mv[1] += n; n mv[0] %= n; n if (mv[0] < 0) mv[0] += n; n for (int i = 1; i <= n; i++) { n int id = i % 2; n int p = i + mv[id]; n if (p > n) p -= n; n ans[p] = i; n } n for (int i = 1; i <= n; i++) printf( %d%c , ans[i], i < n ? : n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 Rand(time(0)); n const int maxn = 1e5 + 5; n const long long maxc = 1e9 + 7; n int n, m, d, a[maxn]; n long long sum[maxn]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> d >> m; n for (int i = (1); i <= (n); ++i) cin >> a[i]; n sort(a + 1, a + n + 1); n for (int i = (1); i <= (n); ++i) sum[i] = sum[i - 1] + a[i]; n if (a[n] <= m) return cout << sum[n], 0; n int id = upper_bound(a + 1, a + n + 1, m) - a; n long long res = a[n] + sum[id - 1]; n long long ans = res; n for (int i = (n - 1); i >= (id); --i) { n if (1LL * (n - i) * d > n) continue; n int r = (n - i) * d; n if (r - (i - id) < id) { n ans = max(ans, res + sum[n - 1] - sum[i - 1] - sum[max(0, r - (i - id))]); n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n const long long inf = 0x3f3f3f3f; n const long long llinf = 1e18; n const long long nax = 0; n int n, m, batas; n vector> shift; n set simpen; n map sabi; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(); n cout.tie(); n cin >> n >> m >> batas; n char arr[n + 5][m + 5]; n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n cin >> arr[i][j]; n if (arr[i][j] == S ) { n shift.push_back({i, j}); n } else { n simpen.insert(arr[i][j]); n } n } n } n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n for (auto x : shift) { n int x1 = i, x2 = x.first, y1 = j, y2 = x.second; n int hitung = ceil(sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1))); n if (hitung <= batas) { n sabi[arr[i][j]] = 1; n } n } n } n } n int q, ans = 0; n cin >> q; n string s; n cin >> s; n for (int k = 0; k < q; ++k) { n if (s[k] >= 97) { n if (!simpen.count(s[k])) { n cout << -1 << n ; n return 0; n } else n continue; n } else { n if (shift.empty()) { n cout << -1 << n ; n return 0; n } n bool ok = 0, ada = 0; n if (!simpen.count(s[k] + 32)) { n cout << -1 << n ; n return 0; n } else { n if (sabi[s[k] + 32]) n continue; n else n ans++; n } n } n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 55, mod = 1LL * 1000 * 1000 * 1000 + 7; n int dp[N][N][2], ans[N][N][2], n, cnt50, cnt100, W, c[N][N], seen[N][N]; n bool vis[N][N][2], vis2[N][N][2]; n int C(int r, int n) { n if (r == 0 || r == n) return 1; n if (r > n) return 0; n if (seen[r][n]) return c[r][n]; n seen[r][n] = true; n return c[r][n] = (C(r - 1, n - 1) + C(r, n - 1)) % mod; n } n int dfs(int x, int y, int tp) { n if (vis2[x][y][tp]) return ans[x][y][tp]; n vis2[x][y][tp] = true; n if (tp) { n for (int i = 0; i <= cnt50 - x; i++) n for (int j = 0; j <= cnt100 - y; j++) n if (i * 50 + j * 100 <= W && (i || j) && n dp[x][y][tp] == dp[x + i][y + j][!tp] + 1) n (ans[x][y][tp] += 1LL * dfs(x + i, y + j, !tp) * C(i, cnt50 - x) % n mod * C(j, cnt100 - y) % mod) %= mod; n } else { n for (int i = 0; i <= x; i++) n for (int j = 0; j <= y; j++) n if ((i || j) && i * 50 + j * 100 <= W && n dp[x][y][tp] == dp[x - i][y - j][!tp] + 1) n (ans[x][y][tp] += n 1LL * dfs(x - i, y - j, !tp) * C(i, x) % mod * C(j, y) % mod) %= mod; n } n return ans[x][y][tp]; n } n struct Node { n int x = 0, y = 0, tp = 0; n Node(int a = 0, int b = 0, int c = 0) { x = a, y = b, tp = c; } n }; n int main() { n ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); n for (int i = 0; i < N; i++) n for (int j = 0; j < N; j++) n for (int k = 0; k < 2; k++) dp[i][j][k] = 1 << 29; n cin >> n >> W; n for (int i = 0, a; i < n; i++) { n cin >> a; n cnt50 += (a == 50); n cnt100 += (a == 100); n } n dp[0][0][0] = dp[0][0][1] = 0; n vis[0][0][0] = vis[0][0][1] = true; n ans[0][0][0] = ans[0][0][1] = 1; n queue q; n q.push(Node(0, 0, 0)), q.push(Node(0, 0, 1)); n while (q.size()) { n Node tmp = q.front(); n q.pop(); n int x = tmp.x, y = tmp.y, tp = tmp.tp; n if (tp) { n for (int i = 0; i <= cnt50 - x; i++) n for (int j = 0; j <= cnt100 - y; j++) n if (i * 50 + j * 100 <= W && (i || j) && !vis[x + i][y + j][!tp]) { n q.push(Node(x + i, y + j, !tp)); n dp[x + i][y + j][!tp] = dp[x][y][tp] + 1; n vis[x + i][y + j][!tp] = true; n } n } else { n for (int i = 0; i <= x; i++) n for (int j = 0; j <= y; j++) n if ((i || j) && i * 50 + 100 * j <= W && !vis[x - i][y - j][!tp]) { n q.push(Node(x - i, y - j, !tp)); n dp[x - i][y - j][!tp] = dp[x][y][tp] + 1; n vis[x - i][y - j][!tp] = true; n } n } n } n dfs(cnt50, cnt100, 0); n if (dp[cnt50][cnt100][0] >= (1 << 29)) dp[cnt50][cnt100][0] = -1; n cout << dp[cnt50][cnt100][0] << n << ans[cnt50][cnt100][0] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 100005; n const int inf = 2147483647; n long long f[maxN], s[maxN], ans[maxN]; n int n, m, c, g, r, l[maxN], a[maxN], sa[maxN]; n int t[maxN * 8], b[maxN], h, mm; n int query(int l, int r) { n l = lower_bound(b + 1, b + 1 + c, l) - b; n r = upper_bound(b + 1, b + 1 + c, r) - b - 1; n l += mm - 1; n r += mm + 1; n int k = inf; n for (; l != r - 1; l >>= 1, r >>= 1) { n if ((l & 1) == 0) k = ((k) < (t[l + 1]) ? (k) : (t[l + 1])); n if ((r & 1) == 1) k = ((k) < (t[r - 1]) ? (k) : (t[r - 1])); n } n return k; n } n int ask(int x, int y) { n if (x < 0) x += g + r; n if (y < 0) y += g + r; n if (x <= y) return query(x, y); n int k = query(x, g + r - 1), t = query(0, y); n return ((k) < (t) ? (k) : (t)); n } n void chg(int x, int d) { n x = lower_bound(b + 1, b + 1 + c, x) - b; n x += mm; n t[x] = d; n for (x >>= 1; x; x >>= 1) n t[x] = ((t[x + x]) < (t[x + x + 1]) ? (t[x + x]) : (t[x + x + 1])); n } n void Init() { n scanf( %d%d%d , &n, &g, &r); n for (int i = 0; i <= n; ++i) scanf( %d , l + i); n for (int i = n; i; --i) { n s[i] = s[i + 1] + l[i]; n b[i] = s[i] % (g + r); n } n sort(b + 1, b + 1 + n); n c = unique(b + 1, b + 1 + n) - b - 1; n for (; (c + 1) >> h; ++h) n ; n mm = 1 << h; n for (int i = 1; i <= mm + 1 + c; ++i) t[i] = inf; n for (int i = n; i; --i) { n int k = ask((s[i] - (g + r - 1)) % (g + r), (s[i] - g) % (g + r)); n if (k > n) n f[i] = s[i]; n else n f[i] = (s[i] - s[k] + g + r - 1) / (g + r) * (g + r) + f[k]; n chg(s[i] % (g + r), i); n } n } n void Work() { n long long p; n scanf( %d , &m); n for (int i = 1; i <= m; ++i) { n scanf( %d , a + i); n p = a[i] + l[0] + s[1]; n int k = ask((p - (g + r - 1)) % (g + r), (p - g) % (g + r)); n if (k > n) n printf( %I64d n , p); n else n printf( %I64d n , (p - s[k] + g + r - 1) / (g + r) * (g + r) + f[k]); n } n } n int main() { n Init(); n Work(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, k; n int main() { n cin >> n >> m >> k; n if (k > n + m - 2) { n cout << -1 << endl; n return 0; n } n long long ans1, ans2; n if (k >= m) { n ans1 = n / (k - m + 2); n } else { n ans1 = (m / (k + 1)) * n; n } n if (k >= n) { n ans2 = m / (k - n + 2); n } else { n ans2 = (n / (k + 1)) * m; n } n cout << max(ans1, ans2) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N, M, dbg[100005]; n pair A[100005]; n map mp; n int main() { n scanf( %d , &N); n for (int i = 0; i < N; i++) { n int a; n scanf( %d , &a); n mp[a]++; n } n for (map::iterator it = mp.begin(); it != mp.end(); it++) n A[M++] = *it; n for (int i = 1; i < M; i++) n if (A[i].first != A[i - 1].first + 1) { n puts( NO ); n return 0; n } n int p = 0; n for (int i = 0; i < M; i++) { n A[i].second--; n dbg[p++] = A[i].first; n } n for (int i = M - 1; i > 1; i--) { n while (A[i].second) { n if (!A[i - 1].second) { n puts( NO ); n return 0; n } n A[i - 1].second--; n A[i].second--; n dbg[p++] = A[i - 1].first; n dbg[p++] = A[i].first; n } n if (!A[i - 1].second) { n puts( NO ); n return 0; n } n A[i - 1].second--; n dbg[p++] = A[i - 1].first; n } n while (A[1].second) { n if (!A[0].second) { n puts( NO ); n return 0; n } n A[0].second--; n A[1].second--; n dbg[p++] = A[0].first; n dbg[p++] = A[1].first; n } n if (A[0].second) { n puts( NO ); n return 0; n } n puts( YES ); n return 0; n } n "} +{"func_code_string": "#include n int aa[120][5], kk[5]; n int solve(int *bb, int n) { n int k, sum1, sum2, j, bad; n sum1 = sum2 = 0; n for (j = 0; j < 5; j++) { n if (aa[0][j] != -1) sum1 += (bb[j] + 1) * (250 - aa[0][j]) * 2; n if (aa[1][j] != -1) sum2 += (bb[j] + 1) * (250 - aa[1][j]) * 2; n } n if (sum1 <= sum2) return n * 32 + 1; n for (k = 0; k <= n * 32; k++) { n bad = 0; n for (j = 0; j < 5; j++) n if (aa[0][j] != -1) { n int lower = bb[j] == 5 ? 0 : (n + k) / (1 << (bb[j] + 1)) + 1 - kk[j]; n int upper = (n + k) / (1 << bb[j]) - kk[j]; n if (upper < 0 || lower > upper || lower > k) { n bad = 1; n break; n } n } else if ((bb[j] != 5 && kk[j] << (bb[j] + 1) <= (n + k)) || n (kk[j] << bb[j] > (n + k))) { n bad = 1; n break; n } n if (!bad) return k; n } n return n * 32 + 1; n } n int main() { n static int bb[5]; n int n, i, j, b, b_, min, k; n scanf( %d , &n); n for (i = 0; i < n; i++) n for (j = 0; j < 5; j++) { n scanf( %d , &aa[i][j]); n if (aa[i][j] != -1) kk[j]++; n } n min = n * 32 + 1; n for (b = 0; b < 7776; b++) { n for (j = 0, b_ = b; j < 5; j++, b_ /= 6) bb[j] = b_ % 6; n k = solve(bb, n); n if (min > k) min = k; n } n printf( %d n , min == n * 32 + 1 ? -1 : min); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[1000010]; n int n; n bool check(int len) { n int now = 0, lft = 0; n bool flag = 1; n for (int i = 0; i < n; i++) { n if (s[i] == R ) { n flag = 0; n if (now + 1 != len) now++; n } else n now--; n if (now < lft) { n lft = now; n flag = 1; n } n } n return flag; n } n int main() { n scanf( %s , s); n n = strlen(s); n if (s[n - 1] == R ) { n for (int i = 0; i < n; i++) { n if (s[i] == R ) n s[i] = L ; n else n s[i] = R ; n } n } n if (check(n + 5)) { n puts( 1 ); n return 0; n } n int l = 0, r = n + 5, ret = 0; n while (l <= r) { n int mid = (l + r) >> 1; n if (check(mid)) n ret = mid, l = mid + 1; n else n r = mid - 1; n } n printf( %d n , ret); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, cnt, flag; n vector graph[100005]; n bool vis[100005]; n void dfs(int node, int parent) { n vis[node] = 1; n int x, u, v, i; n cnt++; n for (i = 0; i < graph[node].size(); i++) { n v = graph[node][i]; n if (v == parent) continue; n if (vis[v] == 1) n flag = 1; n else n dfs(v, node); n } n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> n >> m; n int i, j, k, u, v, x, sum = 0; n for (i = 0; i < m; i++) { n cin >> u >> v; n graph[u].push_back(v); n graph[v].push_back(u); n } n for (i = 1; i <= n; i++) { n if (vis[i] == 0) { n cnt = 0; n flag = 0; n dfs(i, 0); n if (flag == 1) n sum += cnt; n else n sum += (cnt - 1); n } n } n cout << n - sum << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n cin >> n >> k; n vector g(n); n int mm = 99999; n for (int i = 0; i < n; i++) { n cin >> g[i]; n mm = min(mm, abs(g[i])); n } n sort(g.begin(), g.end()); n int rest = k; n for (int i = 0; i < k; i++) { n if (i < g.size() && g[i] < 0) { n g[i] = -g[i]; n rest--; n } n } n int ans = 0; n for (int i = 0; i < g.size(); i++) { n ans += g[i]; n } n if (rest % 2) { n ans -= 2 * mm; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector> g[500010]; n int rad[2][500010], tata[500010], niv[500010]; n char in[500010], vaz[500010], tip[500010]; n struct edge { n int x, y, c; n }; n edge v[500010]; n int radacina(int x, int t) { n int y = x; n while (y != rad[t][y]) y = rad[t][y]; n while (rad[t][x] != y) { n int aux = rad[t][x]; n rad[t][x] = y; n x = aux; n } n return y; n } n void unite(int x, int y) { n x = radacina(x, 0); n y = radacina(y, 0); n rad[0][x] = y; n } n void dfs(int nod) { n vaz[nod] = 1; n for (int i = 0; i < g[nod].size(); i++) { n int vec = g[nod][i].first; n if (vaz[vec] == 1) continue; n niv[vec] = niv[nod] + 1; n tata[vec] = nod; n tip[vec] = g[nod][i].second; n dfs(vec); n } n } n int main() { n int n, k, m, x, y; n long long sol = 0; n scanf( %d%d%d , &n, &k, &m); n for (int i = 1; i <= n; i++) rad[0][i] = rad[1][i] = i; n for (int i = 1; i <= k; i++) { n scanf( %d%d , &x, &y); n unite(x, y); n g[x].push_back({y, 1}); n g[y].push_back({x, 1}); n } n for (int i = 1; i <= m; i++) { n scanf( %d%d%d , &v[i].x, &v[i].y, &v[i].c); n if (radacina(v[i].x, 0) != radacina(v[i].y, 0)) { n unite(v[i].x, v[i].y); n in[i] = 1; n g[v[i].x].push_back({v[i].y, 0}); n g[v[i].y].push_back({v[i].x, 0}); n } n } n dfs(1); n tata[1] = 1; n int nr = 0; n for (int i = 1; i <= m; i++) { n if (in[i] == 1) continue; n x = v[i].x; n y = v[i].y; n x = radacina(x, 1); n y = radacina(y, 1); n while (x != y) { n if (niv[x] < niv[y]) swap(x, y); n sol += tip[x] * v[i].c; n nr += tip[x]; n rad[1][x] = tata[x]; n x = radacina(x, 1); n } n } n if (nr < k) n printf( -1 ); n else n printf( %I64d , sol); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n long long rot = 0; n long long last = 0; n long long ans; n for (int i = 0; i < m; i++) { n long long t; n cin >> t; n if (last > t) { n rot++; n } n last = t; n } n ans = rot * n + last - 1; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int f(int y) { n return y % 400 == 0 ? 2 : y % 100 == 0 ? 1 : y % 4 == 0 ? 2 : 1; n } n int main() { n int n, r = 0, t; n scanf( %d , &n); n t = f(n); n while (r % 7 != 0 || r == 0 || t != f(n)) { n r += f(n); n n++; n } n printf( %d n , n); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long binSearch(long long n, long long pow2) { n long long L = 0, R = (n / pow2) + 10, M; n while (R - L > 1) { n M = (L + R) / 2; n double dM = M + 0.0; n if ((2.0 * dM + 1.0) * (pow2 + dM - 1.0) < n + 0.0) n L = M; n else n R = M; n } n if ((2 * L + 1) * (pow2 + L - 1) == n) n return L; n else if ((2 * R + 1) * (pow2 + R - 1) == n) n return R; n else n return -1; n } n int main() { n long long n; n cin >> n; n vector result; n for (long long pow2 = 1; pow2 - 1 <= n; pow2 *= 2) { n long long v = binSearch(n, pow2); n if (v != -1) result.push_back((2 * v + 1) * pow2); n } n sort(result.begin(), result.end()); n if (result.size() == 0) n cout << -1; n else { n for (int i = 0; i < result.size(); i++) cout << result[i] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int max(int a, int b) { return a > b ? a : b; } n pair a[100], ans[1000], p; n vector> v; n int main() { n int n, k; n cin >> n >> k; n for (int i = 0; i < n; i++) { n cin >> a[i].first; n a[i].second = i + 1; n } n sort(a, a + n); n int i = 0; n while (i < k) { n if (a[0].first - a[n - 1].first >= -1) break; n a[0].first++; n a[n - 1].first--; n p.first = a[0].second; n p.second = a[n - 1].second; n v.push_back(p); n sort(a, a + n); n i++; n } n cout << a[n - 1].first - a[0].first << << i << endl; n for (int k = 0; k < i; k++) { n cout << v[k].second << << v[k].first << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector E[100010]; n int color[100010]; n int seen[100010]; n set sets[100010]; n void dfs(int u) { n for (int i = 0; i < E[u].size(); ++i) { n int v = E[u][i]; n if (color[u] != color[v]) sets[color[u]].insert(color[v]); n if (!seen[v]) { n seen[v] = true; n dfs(v); n } n } n } n int main() { n int n, m, u, v; n cin >> n >> m; n set colorids; n for (int i = 0; i < n; ++i) { n cin >> color[i]; n colorids.insert(color[i]); n } n for (int i = 0; i < m; ++i) { n cin >> u >> v; n --u; n --v; n E[u].push_back(v); n E[v].push_back(u); n } n memset(seen, 0, sizeof(seen)); n for (int i = 0; i < n; ++i) n if (!seen[i]) { n seen[i] = true; n dfs(i); n } n int maxcolor = -1; n int maxn = -(1 << 30); n for (typeof(colorids.begin()) it = colorids.begin(); it != colorids.end(); n ++it) { n int color = *it; n int ncolors = sets[*it].size(); n if (maxn < ncolors) { n maxn = ncolors; n maxcolor = *it; n } n } n cout << maxcolor << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c, d, e, f; n cin >> a >> b >> c >> d >> e >> f; n cout << (a + b + c) * (a + b + c) - (a * a + c * c + e * e); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const ll N = 1e6 + 100; n ll n; n ll m; n ll **arr() { n ll **res = new ll *[n + 2]; n for (ll i = 0; i < n + 2; ++i) { n res[i] = new ll[m + 2]; n fill_n(res[i], m + 2, 0); n } n return res; n } n ll **inp; n ll **ans; n void pref(ll **a) { n for (ll i = 1; i <= n + 1; ++i) { n for (ll j = 1; j <= m + 1; ++j) { n a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1]; n } n } n } n ll sum(ll **a, ll il, ll ir, ll jl, ll jr) { n il = max(il, 1ll); n ir = min(ir, n); n jl = max(jl, 1ll); n jr = min(jr, m); n --il; n --jl; n return a[ir][jr] - a[ir][jl] - a[il][jr] + a[il][jl]; n } n ll sq(ll first) { return first * first; } n bool check(ll t) { n for (ll i = 1; i <= n; ++i) { n for (ll j = 1; j <= m; ++j) { n ans[i][j] = sum(inp, i - t, i + t, j - t, j + t) == sq(2 * t + 1); n } n } n pref(ans); n for (ll i = 1; i <= n; ++i) { n for (ll j = 1; j <= m; ++j) { n if (sum(inp, i, i, j, j) && sum(ans, i - t, i + t, j - t, j + t) == 0) { n return false; n } n } n } n return true; n } n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n >> m; n inp = arr(); n ans = arr(); n for (ll i = 1; i <= n; ++i) { n string s; n cin >> s; n for (ll j = 1; j <= m; ++j) { n inp[i][j] = s[j - 1] == X ; n } n } n pref(inp); n ll lef = 0, rig = N; n while (rig - lef > 1) { n ll mid = (lef + rig) / 2; n if (check(mid)) { n lef = mid; n } else { n rig = mid; n } n } n assert(check(lef)); n cout << lef << n ; n for (ll i = 1; i <= n; ++i) { n for (ll j = 1; j <= m; ++j) { n cout << .X [sum(ans, i, i, j, j)]; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int x = 0, f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = (x << 1) + (x << 3) + (ch ^ 48); n ch = getchar(); n } n return x * f; n } n const int N = 1e3 + 5; n int f[N][N]; n struct node { n long long x, y; n } a[N], b[N]; n bool cmp(node x, node y) { return x.y < y.y; } n long long area(node a, node b, node c) { n return a.x * b.y - a.y * b.x + b.x * c.y - b.y * c.x + c.x * a.y - c.y * a.x; n } n bool toleft(node a, node b, node c) { n if (c.y <= a.y || c.y > b.y) return 0; n return area(a, b, c) > 0; n } n int n, m; n int main() { n cin >> n >> m; n for (int i = 1; i <= n; ++i) scanf( %lld%lld , &a[i].x, &a[i].y); n for (int i = 1; i <= m; ++i) scanf( %lld%lld , &b[i].x, &b[i].y); n sort(a + 1, a + n + 1, cmp); n int ans = 0; n for (int i = 1; i < n; ++i) n for (int j = i + 1; j <= n; ++j) n for (int k = 1; k <= m; ++k) n if (toleft(a[i], a[j], b[k])) f[i][j]++; n for (int i = 1; i < n; ++i) n for (int j = i + 1; j < n; ++j) n for (int k = j + 1; k <= n; ++k) n if (f[i][j] + f[j][k] == f[i][k]) ans++; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 998244353; n const int INF = 2000000000; n const long long BIG = 1446803456761533460LL; n const int maxn = 5010; n int n, m, k, dp[maxn][maxn]; n int poww(int a, int b) { n int r = 1; n while (b) { n if (b & 1) r = (1LL * (r) * (a)) % MOD; n a = (1LL * (a) * (a)) % MOD; n b >>= 1; n } n return r; n } n int main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n cin >> n >> m >> k; n int mi = poww(m, MOD - 2); n dp[0][0] = 1; n for (int i = 0; i < k; ++i) { n for (int j = 0; j < k + 1; ++j) { n dp[i + 1][j] = ((dp[i + 1][j]) + (1LL * dp[i][j] * j % MOD)) % MOD; n dp[i + 1][j + 1] = n ((dp[i + 1][j + 1]) + (1LL * dp[i][j] * (n - j) % MOD * mi % MOD)) % n MOD; n } n } n int ans = 0; n for (int i = 0; i < k + 1; ++i) ans = ((ans) + (dp[k][i])) % MOD; n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 400000; n int a[N], t[N], type[N], us[N]; n int main() { n ios::sync_with_stdio(0); n int n, w, k; n cin >> n >> w >> k; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n for (int i = 0; i < n; i++) { n cin >> t[i]; n } n int r = -1; n int curr_time = 0; n int earn = 0; n set > half, full; n int ans = 0; n for (int i = 0; i < n; i++) { n r = max(r, i - 1); n while (r < n - 1) { n r++; n int temp = curr_time; n vector > pers_full, pers_half, pers_type; n half.insert(make_pair(t[r], r)); n pers_half.push_back(make_pair(+1, r)); n pers_type.push_back(make_pair(r, type[r])); n type[r] = 0; n curr_time += (t[r] + 1) / 2; n if (half.size() > w) { n auto p = *half.begin(); n curr_time -= (p.first + 1) / 2; n half.erase(half.find(p)); n pers_half.push_back(make_pair(-1, p.second)); n curr_time += p.first; n full.insert(p); n pers_full.push_back(make_pair(+1, p.second)); n pers_type.push_back(make_pair(p.second, type[p.second])); n type[p.second] = 1; n } n if (curr_time > k) { n while (pers_full.size()) { n auto p = pers_full.back(); n pers_full.pop_back(); n if (p.first == -1) n full.insert(make_pair(t[p.second], p.second)); n else n full.erase(make_pair(t[p.second], p.second)); n } n while (pers_half.size()) { n auto p = pers_half.back(); n pers_half.pop_back(); n if (p.first == -1) n half.insert(make_pair(t[p.second], p.second)); n else n half.erase(make_pair(t[p.second], p.second)); n } n while (pers_type.size()) { n auto p = pers_type.back(); n pers_type.pop_back(); n type[p.first] = p.second; n } n curr_time = temp; n r--; n break; n } else { n earn += a[r]; n us[r] = 1; n } n } n ans = max(earn, ans); n if (us[i] == 1) { n if (type[i] == 0) { n half.erase(make_pair(t[i], i)); n curr_time -= (t[i] + 1) / 2; n } else { n full.erase(make_pair(t[i], i)); n curr_time -= t[i]; n } n earn -= a[i]; n us[i] = 0; n while (full.size() && half.size() < w) { n auto p = *full.rbegin(); n full.erase(full.find(p)); n half.insert(p); n curr_time -= p.first; n curr_time += (p.first + 1) / 2; n type[p.second] = 0; n } n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n using ll = long long; n using pii = pair; n const int INF = 1e9 + 1e2; n void fin() {} n const bool flag = 0; n const int N = 1e5 + 10; n int MOD; n int mult(ll a, ll b) { return a * 1ll * b % MOD; } n ll binpow(ll a, int b) { n ll res = 1; n while (b) { n if (b & 1) { n res = mult(res, a); n } n a = mult(a, a); n b >>= 1; n } n return res; n } n vector adj[N]; n int sz[N], po[N]; n bool cent[N]; n void calc_sz(int first, int p = -1) { n sz[first] = 1; n for (pii to : adj[first]) { n if (to.first != p && !cent[to.first]) { n calc_sz(to.first, first); n sz[first] += sz[to.first]; n } n } n } n int c_sz; n int fnd(int first, int p = -1) { n for (pii to : adj[first]) { n if (to.first != p && !cent[to.first] && sz[to.first] > c_sz / 2) { n return fnd(to.first, first); n } n } n return first; n } n ll ans; n int add(ll a, int b) { return (a + b + MOD) % MOD; } n map cnt; n void dfsadd(int first, int d, int r, int p = -1) { n cnt[r]++; n for (pii to : adj[first]) { n if (to.first != p && !cent[to.first]) { n dfsadd(to.first, d + 1, add(r, mult(po[d], to.second)), first); n } n } n } n void dfscalc(int first, int d, int r1, int r2, int p = -1) { n ans += (r1 == 0) + (r2 == 0); n for (pii to : adj[first]) { n if (to.first != p && !cent[to.first]) { n dfscalc(to.first, d + 1, add(mult(r1, 10), to.second), n add(r2, mult(po[d], to.second)), first); n } n } n } n int phi; n void dfsget(int first, int d, int r, int p = -1) { n int inv = mult(MOD - r, binpow(po[d], phi - 1)); n ans += cnt[inv]; n for (pii to : adj[first]) { n if (to.first != p && !cent[to.first]) { n dfsget(to.first, d + 1, add(mult(r, 10), to.second), first); n } n } n } n void solve(int first = 0) { n calc_sz(first); n c_sz = sz[first]; n first = fnd(first); n cent[first] = 1; n for (pii to : adj[first]) { n if (!cent[to.first]) { n dfsget(to.first, 1, to.second); n dfsadd(to.first, 1, to.second); n dfscalc(to.first, 1, to.second, to.second); n } n } n cnt.clear(); n reverse((adj[first]).begin(), (adj[first]).end()); n for (pii to : adj[first]) { n if (!cent[to.first]) { n dfsget(to.first, 1, to.second); n dfsadd(to.first, 1, to.second); n } n } n cnt.clear(); n for (pii to : adj[first]) { n if (!cent[to.first]) { n solve(to.first); n } n } n } n void ma1n() { n int n; n cin >> n >> MOD; n for (int i = 1; i < n; ++i) { n int u, v, w; n cin >> u >> v >> w; n w %= MOD; n adj[u].push_back({v, w}); n adj[v].push_back({u, w}); n } n int first = MOD; n phi = MOD; n for (int i = 2; i <= sqrt(first); ++i) { n if (first % i == 0) { n while (first % i == 0) { n first /= i; n } n phi -= phi / i; n } n } n if (first > 1) { n phi -= phi / first; n } n po[0] = 1; n for (int i = 1; i < N; ++i) { n po[i] = mult(po[i - 1], 10); n } n solve(); n cout << ans; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(nullptr), fin(); n int ts = 1; n if (flag) { n cin >> ts; n } n while (ts--) { n ma1n(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool sePuede(int rango[], int x) { n if (x % 2 == 1 && rango[0] == 1 && rango[x - 1] == 1) return true; n return false; n } n int main() { n int x = 0; n int impar = 0; n cin >> x; n int rango[x]; n for (int y = 0; y < x; y++) { n cin >> rango[y]; n rango[y] = rango[y] % 2; n } n if (sePuede(rango, x)) n cout << YES << endl; n else n cout << NO << endl; n } n "} +{"func_code_string": "#include n using namespace std; n void go(int parent, int node, int depth, int& odd_count, int& even_count, n vector>& tree) { n int count = 0; n for (int i = 0; i < tree[node].size(); i++) { n if (tree[node][i] != parent) { n count++; n go(node, tree[node][i], depth + 1, odd_count, even_count, tree); n } n } n if (count == 0) { n odd_count += depth % 2; n even_count += !(depth % 2); n } n } n int main() { n int n; n scanf( %d , &n); n vector> tree(n); n for (int i = 0; i < n - 1; i++) { n int u, v; n scanf( %d %d , &u, &v); n tree[u - 1].push_back(v - 1); n tree[v - 1].push_back(u - 1); n } n int root = -1; n for (int i = 0; i < tree.size(); i++) { n if (tree[i].size() > 1) { n root = i; n break; n } n } n int odd_count = 0, even_count = 0; n go(-1, root, 0, odd_count, even_count, tree); n int min_ans = 0, max_ans = n - 1; n if (!odd_count || !even_count) { n min_ans = 1; n } else { n min_ans = 3; n } n vector parent_leaf_count(n, 0); n for (int i = 0; i < n; i++) { n if (tree[i].size() == 1) { n parent_leaf_count[tree[i][0]]++; n } n } n for (int i = 0; i < n; i++) { n if (parent_leaf_count[i]) { n max_ans -= (parent_leaf_count[i] - 1); n } n } n printf( %d %d n , min_ans, max_ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s; n int main() { n cin >> s; n bool ms = false; n string a; n string b; n if (s[0] == - ) ms = true; n bool flag = false; n bool p = ms; n for (int i = 0; i < s.size(); i++) { n if (p) { n p = false; n continue; n } n if (s[i] == . ) { n flag = true; n continue; n } n if (!flag) n a.push_back(s[i]); n else n b.push_back(s[i]); n } n int l = a.size(); n if (ms) cout << ( ; n cout << $ ; n for (int i = 0; i < l; i++) { n if ((l - i) % 3 == 0 && i != 0) cout << , ; n cout << a[i]; n } n cout << . ; n if (b.size() >= 2) n cout << b[0] << b[1]; n else if (b.size() == 1) n cout << b[0] << 0 ; n else n cout << 00 ; n if (ms) cout << ) ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n int a[n], b[n]; n for (int i = 0; i < n; i++) cin >> a[i]; n string s; n cin >> s; n vector>> c(n); n for (int i = 0; i < n; i++) { n c[i].second.first = a[i]; n c[i].second.second = i; n c[i].first = (s[i] - 0 ); n } n sort(c.begin(), c.end()); n long long cnt = 1; n for (int i = 0; i < n; i++) { n b[c[i].second.second] = cnt; n cnt++; n } n for (int i = 0; i < n; i++) { n cout << b[i] << ; n } n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long dp_cata[3021][5021]; n int main() { n dp_cata[0][0] = 1; n for (long long j = 0; j <= 5001; j++) n for (long long i = 0; i <= 3001; i++) { n if (i == 0) { n if (j != 0) dp_cata[i][j] = dp_cata[i + 1][j - 1]; n } else n dp_cata[i][j] = n (dp_cata[i + 1][j - 1] + dp_cata[i - 1][j - 1]) % 1000000007; n } n long long n, m; n string s; n cin >> n >> m >> s; n if (n % 2 != 0) { n cout << 0; n exit(0); n } n long long x = 0, y = 0; n long long lientiep = 0; n for (long long i = 0; i < s.size(); i++) { n if (s[i] == ( ) n x++; n else n y++; n lientiep = max(lientiep, y - x); n } n if (x > n / 2 || y > n / 2) { n cout << 0; n exit(0); n } n long long X = n / 2 - x; n long long Y = n / 2 - y; n long long ans = 0; n for (int i = 0; i <= n - m; i++) { n for (int j = 0; j <= i; j++) n if (j + x >= i - j + y && j - (i - j) >= lientiep) { n if (j < i - j) continue; n ans = n (ans + n dp_cata[j - (i - j)][i] * n dp_cata[2 * (n / 2 - (i - j + y)) - (n - m - i)][n - m - i]) % n 1000000007; n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, ans; n int G[10][10]; n int p[10]; n bool vis[10][10]; n void dfs(int cur) { n if (cur > n) { n memset(vis, 0, sizeof(vis)); n int cnt = 0; n for (int i = 1; i <= n; i++) { n for (int j = i + 1; j <= n; j++) { n if (!G[i][j]) continue; n int u = p[i]; n int v = p[j]; n if (!vis[u][v]) { n vis[u][v] = vis[v][u] = true; n cnt++; n } n } n } n ans = max(ans, cnt); n return; n } n for (int i = 1; i <= 6; i++) { n p[cur] = i; n dfs(cur + 1); n } n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < m; i++) { n int u, v; n scanf( %d%d , &u, &v); n G[u][v] = G[v][u] = 1; n } n dfs(1); n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": " n #include n #define ll long long n #define ld long double n #define ff first n #define ss second n #define eb emplace_back n #define pb push_back n #define mp make_pair n #define all(x) begin(x), end(x) n #define endl n n int dx[4] = {1, -1, 0, 0}; n int dy[4] = {0, 0, -1, 1}; n // ll dp[100005]; n ll mod = 1e9 + 7; n bool vis[100000]; n using namespace std; n bool isPrime(ll n) { n ll j; n for ( j = 2; j <= sqrt(n); j++) { n if (n % j == 0) { n break; n } n } n if (j > sqrt(n)) { n return 1; n } n else { n return 0; n } n } n ll modexpo(ll a, ll b) { n ll ans = 1; n a = a % mod; n while (b > 0) { n if ((b & 1) == 1) { n ans = ((ans % mod) * (a % mod)) % mod; n } n b = b >> 1; n a = ((a % mod) * (a % mod)) % mod; n } n return ans; n } n ll invmod(ll n) { n return modexpo(n, mod - 2); n } n n ll comb(ll n, ll r) { n if (r == 0) { n return 1; n } n ll fact[n + 1]; n fact[0] = 1; n for (ll i = 1; i <= n; i++) { n fact[i] = (fact[i - 1] * i) % mod; n } n return (fact[n] * invmod(fact[r]) % mod * invmod(fact[n - r]) % mod) % mod; n } n ll gcd(ll a, ll b) { n if (a == 0) { n return b; n } n return gcd(b % a, a); n } n ll lcm(ll a, ll b) { n return (a * b) / gcd(a, b); n } n void dfs(ll i, vectoradj[], bool visited[]) { n visited[i] = 1; n for (auto j : adj[i]) { n if (visited[j] == 0) { n dfs(j, adj, visited); n } n } n } n bool sortbysecdesc(const pair &a, const pair &b) n { n return a.second > b.second; n } n void solve(ll k) { n ll n; n cin >> n; n ll w[n + 1], ans = 0; n w[0] = 0; n vector>p; n for (ll i = 0; i < n; i++) { n cin >> w[i + 1]; n p.pb(mp(i + 1, w[i + 1])); n ans += w[i + 1]; n } n ll in[n + 1]; n // memset(in, -1, sizeof(in)); n for (ll i = 0; i <= n; i++) { n in[i] = -1; n } n for (ll i = 0; i < n - 1; i++) { n ll u, v; n cin >> u >> v; n in[u]++, in[v]++; n } n cout << ans << ; n sort(p.begin(), p.end(), sortbysecdesc); n for (ll i = 0; i < p.size(); i++) { n while (in[p[i].first] > 0) { n ans += p[i].second; n cout << ans << ; n in[p[i].first]--; n } n } n cout << endl; n } n n n int main() { n #ifndef ONLINE_JUDGE n // for getting input from input.txt n freopen( input.txt , r , stdin); n // for writing output to output.txt n freopen( output.txt , w , stdout); n #endif n n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ll t = 1; n cin >> t; n ll k = 1; n while (k <= t) { n solve(k); n k++; n } n return 0; n } n // f3=f2-f1,f4=-f1,f5=-f2,f6=f1-f2,f7=f1,f8=f2,f9=f2-f1,"} +{"func_code_string": "#include n using namespace std; n int main() { n map, int> dat; n vector > p; n int np; n cin >> np; n int res = 0; n while (np--) { n int x, y; n cin >> x >> y; n p.push_back(make_pair(x, y)); n dat[make_pair(x, y)] = 1; n } n int sz = p.size(); n for (int i = 0; i < sz; i++) n for (int j = i + 1; j < sz; j++) { n double x = p[i].first + p[j].first; n double y = p[i].second + p[j].second; n x /= 2.0; n y /= 2.0; n pair tmp; n if (fabs(x - int(x)) < 1e-9 && fabs(y - int(y)) < 1e-9) { n tmp = make_pair(int(x), int(y)); n if (dat.find(tmp) != dat.end()) res++; n } n } n cout << res << endl; n } n "} +{"func_code_string": "#include n #include n #define mod 998244353 n #define int long long n using namespace std; n int n,k,sa[200005],rk[200005]; n int num; n inline int Qpow(register int a,register int p){ n if (p==0)return 1; n register int t=Qpow(a,p/2); n t=t*t%mod; n if (p%2==1)t=t*a%mod; n return t; n } n inline int inv(register int x){ n return Qpow(x,mod-2); n } n inline int C(register int n,register int m){ n if (n>n>>k; n for (register int i=1;i<=n;i++){ n scanf( %d ,&sa[i]); n sa[i]++; n rk[sa[i]]=i; n } n for (register int i=1;irk[sa[i+1]+1])k--; n cout< n using namespace std; n int arr[7]; n int main() { n int n, len; n string str; n scanf( %d n , &n); n for (int i = 0; i < n; i++) { n getline(cin, str); n for (int j = 0; j < 7; j++) { n arr[j] += (str[j] - 0 ); n } n } n int mx = 0; n for (int i = 0; i < 7; i++) mx = max(arr[i], mx); n printf( %d n , mx); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct P { n double x, y; n } a[259]; n long long f[259][259]; n int n; n int read() { n long long x = 0, f = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (isdigit(ch)) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n return x * f; n } n double cross(P a, P b, P c) { n P x = (P){b.x - a.x, b.y - a.y}; n P y = (P){c.x - a.x, c.y - a.y}; n return x.x * y.y - x.y * y.x; n } n bool jud() { n double ans = 0; n for (int i = 2; i <= n; i++) ans += cross(a[1], a[i - 1], a[i]); n if (ans > 0) return 1; n return 0; n } n void rever() { n for (int i = 1; i <= n / 2; i++) swap(a[i], a[n - i + 1]); n } n int main() { n n = read(); n for (int i = 1; i <= n; i++) scanf( %lf%lf , &a[i].x, &a[i].y); n if (jud()) rever(); n for (int i = 1; i <= n; i++) f[i][i + 1] = 1; n for (int l = 1; l <= n - 1; l++) n for (int i = 1; i + l <= n; i++) n for (int j = i + 1; j < i + l; j++) n f[i][i + l] = n (f[i][i + l] + f[i][j] % 1000000007 * f[j][i + l] % 1000000007 * n (cross(a[i], a[j], a[i + l]) < 0 ? 1 : 0)) % n 1000000007; n printf( %lld n , f[1][n] % 1000000007); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, f, a, b; n vector V; n long long ans; n int main() { n scanf( %lld %lld , &n, &f); n for (int i = 1; i <= n; i++) { n scanf( %lld %lld , &a, &b); n if (a >= b) { n V.push_back(0); n ans += b; n } else { n if (a * 2 <= b) { n V.push_back(a); n } else { n V.push_back(b - a); n } n ans += a; n } n } n sort(V.begin(), V.end()); n reverse(V.begin(), V.end()); n for (int i = 0; i < f; i++) { n ans += V[i]; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int customer[1000][1000]; n int main() { n int n, m, k; n cin >> n >> m >> k; n deque dq; n for (int i = 0; i < k; i++) { n int x; n cin >> x; n dq.push_back(x); n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) cin >> customer[i][j]; n } n int t = 0; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n int cnt = 0; n for (deque::iterator l = dq.begin(); l != dq.end(); l++) { n cnt++; n if (*l == customer[i][j]) { n int x = *l; n dq.erase(l); n dq.push_front(x); n t += cnt; n break; n } n } n } n } n cout << t; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n; n string s; n cin >> n >> s; n string an = ; n for (int i = 0; i < s.length(); i += 2) { n cout << s[i]; n } n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin >> n; n if (n == 1) { n cout << 1; n return 0; n } n for (long long i = 2; i * i <= n; i++) { n if (n % i == 0) { n while (n % i == 0) { n n /= i; n } n if (n == 1) { n cout << i; n } else { n cout << 1; n } n getchar(); n getchar(); n return 0; n } n } n cout << n; n getchar(); n getchar(); n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int n; n cin >> n; n string s = bitset<32>(n).to_string(); n vector v; n for (int i = 31; i >= 0; i--) { n if (s[i] == 1 ) { n v.push_back(32 - i); n } n } n reverse(v.begin(), v.end()); n for (int& a : v) { n cout << a << ; n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int t = 1, i = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 42; n long long dp[N][N]; n int f[N], n; n string s; n long long Solve(int x) { n memset(dp, 0, sizeof dp); n dp[0][x] = 1; n for (int i = 0; i < n; i++) { n for (int j = 0; j < s.size(); j++) { n int m = j; n while (m && s[m] != 0 ) m = f[m]; n if (s[m] == 0 ) m++; n dp[i + 1][m] += dp[i][j]; n m = j; n while (m && s[m] != 1 ) m = f[m]; n if (s[m] == 1 ) m++; n dp[i + 1][m] += dp[i][j]; n } n } n return dp[n][x]; n } n int main() { n cin >> n >> s; n for (int i = 2; i <= s.size(); i++) { n f[i] = f[i - 1]; n while (f[i] && s[f[i]] != s[i - 1]) f[i] = f[f[i]]; n if (s[f[i]] == s[i - 1]) f[i]++; n } n long long ans = 0; n for (int i = 0; i < s.size(); i++) ans += Solve(i); n cout << (1ll << n) - ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 200000 + 10; n const int hashnum = 3; n long long base[] = {233, 23, 97}; n long long mod[] = {122420729, 1000000007, 1000000009}; n int sum[maxn]; n char s[maxn]; n long long power[hashnum][maxn]; n int n; n struct node { n long long hv[hashnum]; n int pref, suf, len; n }; n node zer; n inline void init() { n zer.pref = zer.suf = zer.len = 0; n for (int i = (0); i < (hashnum); ++i) zer.hv[i] = 0; n for (int i = (0); i < (hashnum); ++i) { n power[i][0] = 1; n for (int j = (1); j < (maxn); ++j) n power[i][j] = power[i][j - 1] * base[i] % mod[i]; n } n } n node merge(node& a, node& b) { n node c = zer; n if (a.len == 0 && b.len == 0) n c.suf = c.pref = a.pref + b.pref; n else if (a.len == 0) n c = b, c.pref += a.pref; n else if (b.len == 0) n c = a, c.suf += b.pref; n else { n c.len = a.len + b.len + (a.suf + b.pref) % 2; n c.pref = a.pref; n c.suf = b.suf; n for (int i = (0); i < (hashnum); ++i) { n if ((a.suf + b.pref) % 2 == 1) { n c.hv[i] = a.hv[i] * power[i][b.len + 1] % mod[i]; n (c.hv[i] += 2 * power[i][b.len] % mod[i]) %= mod[i]; n (c.hv[i] += b.hv[i]) %= mod[i]; n } else { n c.hv[i] = a.hv[i] * power[i][b.len] % mod[i]; n (c.hv[i] += b.hv[i]) %= mod[i]; n } n } n } n return c; n } n struct segtree { n node t[maxn << 2]; n int n, ql, qr; n node ans; n void init(int n) { this->n = n; } n void maintain(int o) { t[o] = merge(t[o << 1], t[o << 1 | 1]); } n void build(int l, int r, int o) { n t[o] = zer; n if (l == r) { n if (s[l] == 0 ) { n t[o].len++; n for (int i = (0); i < (hashnum); ++i) t[o].hv[i] = 1; n } else n t[o].suf = t[o].pref = 1; n return; n } n int mid = l + r >> 1; n build(l, mid, o << 1), build(mid + 1, r, o << 1 | 1); n maintain(o); n } n void query(int l, int r, int o) { n if (ql <= l && qr >= r) n ans = merge(ans, t[o]); n else { n int mid = l + r >> 1; n if (ql <= mid) query(l, mid, o << 1); n if (qr > mid) query(mid + 1, r, o << 1 | 1); n } n } n node Query(int l, int r) { n ans = zer; n ql = l, qr = r; n query(1, n, 1); n return ans; n } n }; n segtree tree; n bool judge(node& a, node& b) { n if (a.suf % 2 != b.suf % 2 || a.pref % 2 != b.pref % 2 || a.len != b.len) n return false; n for (int i = (0); i < (hashnum); ++i) n if (a.hv[i] != b.hv[i]) return false; n return true; n } n int main(void) { n scanf( %d%s , &n, s + 1); n init(); n tree.init(n); n tree.build(1, n, 1); n for (int i = (1); i <= (n); ++i) { n sum[i] = sum[i - 1]; n if (s[i] == 1 ) sum[i]++; n } n int q; n scanf( %d , &(q)); n for (; q--;) { n int l1, l2, r1, r2, len; n scanf( %d%d%d , &l1, &l2, &len); n r1 = l1 + len - 1; n r2 = l2 + len - 1; n if (sum[r2] - sum[l2 - 1] != sum[r1] - sum[l1 - 1]) { n puts( No ); n continue; n } n node x = tree.Query(l1, r1); n node y = tree.Query(l2, r2); n if (judge(x, y)) n puts( Yes ); n else n puts( No ); n } n return 0; n } n "} +{"func_code_string": "#include n const double Pi = 3.14159265; n const int N = 1e6 + 50; n const int M = 1e5 + 15; n const unsigned long long base = 163; n const int INF = 0x3f3f3f3f; n using namespace std; n int a[N]; n int main() { n int n; n scanf( %d , &n); n int l = 0, r = 0; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n } n int pre = 1; n int now = -1; n int flag = 0; n for (int i = 1; i <= n - 1; i++) { n if (a[i] == a[i + 1]) { n pre++; n } else { n flag = 1; n if (now == -1) n now = pre; n else { n if (pre != now) { n cout << NO << endl; n return 0; n } n } n pre = 1; n } n } n if (pre != now && flag) return cout << NO n , 0; n cout << YES << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9 + 7; n const int MOD = 1e9 + 7; n const int MAXN = 1e6 + 3; n struct Rcompare { n bool operator()(pair lhs, pair rhs) { n return lhs.first > rhs.first; n } n }; n struct compare { n bool operator()(pair lhs, pair rhs) { n return lhs.first < rhs.first; n } n }; n int solve(int x) { n if (x < 4 || x == 5 || x == 7 || x == 11) { n return -1; n } n if (x % 4 == 0) { n return x / 4; n } n if (x % 4 == 2) { n return x / 4; n } n if (x % 4 == 1) { n return x / 4 - 1; n } n return x / 4 - 1; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n cin >> n; n for (int i = 0; i < (n); ++i) { n int x; n cin >> x; n cout << solve(x) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int bin[31]; n int cnt; n int ch[6000010][2]; n void insert(int x) { n for (int i = 30; i >= 0; --i) { n bin[i] = x & 1; n x >>= 1; n } n int now = 0; n for (int i = 0; i <= 30; ++i) { n if (!ch[now][bin[i]]) { n ch[now][bin[i]] = ++cnt; n } n now = ch[now][bin[i]]; n } n } n int getans(int l, int r, int k) { n if (k == 32) return 0; n int firmin = 1 << 30; n if (ch[l][0] && ch[r][0]) n firmin = min(firmin, getans(ch[l][0], ch[r][0], k + 1)); n if (ch[l][1] && ch[r][1]) n firmin = min(firmin, getans(ch[l][1], ch[r][1], k + 1)); n if (firmin != 1 << 30) return firmin; n int secmin = 1 << 30; n if (ch[l][1] && ch[r][0]) n secmin = min(secmin, getans(ch[l][1], ch[r][0], k + 1)) + (1 << (31 - k)); n if (ch[l][0] && ch[r][1]) n secmin = min(secmin, getans(ch[l][0], ch[r][1], k + 1)) + (1 << (31 - k)); n return secmin; n } n long long ans; n void dfs(int x, int k) { n if (ch[x][0] && ch[x][1]) { n ans += 1ll * (getans(ch[x][0], ch[x][1], k + 1) + (1 << (31 - k))); n } n if (ch[x][0]) dfs(ch[x][0], k + 1); n if (ch[x][1]) dfs(ch[x][1], k + 1); n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; ++i) { n int x; n scanf( %d , &x); n insert(x); n } n dfs(0, 1); n printf( %lld n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int arr[4], sum; n string s; n int main() { n cin >> arr[0] >> arr[1] >> arr[2] >> arr[3] >> s; n for (int i = 0; i < s.size(); i++) { n sum += arr[s[i] - 49]; n } n cout << sum; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const long long INFL = 0x3f3f3f3f3f3f3f3fLL; n const long double eps = 1e-8; n const int MAXN = 100000 + 5; n pair X[MAXN << 2]; n inline pair calc(const int& a, const int& b) { n long double x = (long double)(b - a) / (long double)a; n return make_pair(x, x); n } n inline void pushUp(const int& rt) { n X[rt].first = X[rt << 1].first * X[rt << 1 | 1].first; n X[rt].second = X[rt << 1].second + X[rt << 1 | 1].second * X[rt << 1].first; n } n void build(int l, int r, int rt) { n static int ax, bx; n if (l == r) { n scanf( %d %d , &ax, &bx); n X[rt] = calc(ax, bx); n return; n } n int mid = (l + r) >> 1; n build(l, mid, rt << 1); n build(mid + 1, r, rt << 1 | 1); n pushUp(rt); n } n void update(const int& p, const pair& v, int l, int r, n int rt) { n if (l == r) { n X[rt] = v; n return; n } n int mid = (l + r) >> 1; n if (p <= mid) n update(p, v, l, mid, rt << 1); n else n update(p, v, mid + 1, r, rt << 1 | 1); n pushUp(rt); n } n pair query(const int& L, const int& R, int l, int r, n int rt) { n static pair z = n make_pair((long double)1.0, (long double)0.0); n if (L <= l && r <= R) return X[rt]; n int mid = (l + r) >> 1; n pair x = z, y = z, ret; n if (L <= mid) x = query(L, R, l, mid, rt << 1); n if (R > mid) y = query(L, R, mid + 1, r, rt << 1 | 1); n ret.first = x.first * y.first; n ret.second = x.second + y.second * x.first; n return ret; n } n int main() { n static int n, q, op, x, ax, bx, lx, rx; n while (~scanf( %d %d , &n, &q)) { n build(1, n, 1); n while (q--) { n scanf( %d , &op); n if (op == 1) { n scanf( %d %d %d , &x, &ax, &bx); n update(x, calc(ax, bx), 1, n, 1); n } else { n scanf( %d %d , &lx, &rx); n long double ans = query(lx, rx, 1, n, 1).second; n if (ans != ans || ans >= 1e20) n ans = 0.0; n else n ans = 1 / (1 + ans); n cout << fixed << setprecision(8) << ans << n ; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline T read() { n T x = 0, f = 0; n char c = getchar(); n while (!isdigit(c)) f = c == - , c = getchar(); n while (isdigit(c)) x = x * 10 + c - 48, c = getchar(); n return f ? -x : x; n } n namespace run { n const long long N = 2e5 + 9; n map mp; n long long n, a[N], ans; n long long main() { n n = read(); n for (long long i = 1; i <= n; i++) a[i] = read(); n mp[0] = 1; n for (long long i = 1, sum = 0, las = 0; i <= n; i++) { n sum += a[i]; n las = max(las, mp[sum]); n ans += i - las; n mp[sum] = i + 1; n } n printf( %lld n , ans); n return 0; n } n } // namespace run n int main() { return run::main(); } n "} +{"func_code_string": "#include n using namespace std; n struct Node { n int id, a, b; n } node[111111], zhan[111111]; n bool cmp1(Node a, Node b) { return a.a > b.a || (a.a == b.a && a.b > b.b); } n bool cmp2(Node a, Node b) { return a.b > b.b || (a.b == b.b && a.a < b.a); } n int main() { n int n, p, k; n scanf( %d%d%d , &n, &p, &k); n for (int i = 0; i < n; i++) n scanf( %d%d , &node[i].a, &node[i].b), node[i].id = i + 1; n sort(node, node + n, cmp2); n sort(node, node + n - p + k, cmp1); n int flag = 1 << 30, flag1 = -1; n for (int i = 0; i < k; i++) { n zhan[i] = node[i]; n if (flag >= zhan[i].b) { n if (flag == zhan[i].b) n flag1 = max(zhan[i].a, flag1); n else n flag1 = zhan[i].a; n flag = zhan[i].b; n } n } n sort(node + k, node + n, cmp2); n int cnt = k; n for (int i = k; cnt < p; i++) { n if (node[i].b < flag || (node[i].b == flag && node[i].a >= flag1)) n zhan[cnt++] = node[i]; n } n for (int i = 0; i < p; i++) printf( %d , zhan[i].id); n printf( n ); n } n "} +{"func_code_string": "#include n using namespace std; n struct ent { n int val, pos; n inline bool operator<(const ent &cpr) const { return val < cpr.val; } n }; n set pq; n int n; n int val[300005]; n long long sum[300005]; n long long ret; n int a, b; n int del[300005]; n int dcnt; n int main() { n ret = -1000000000000ll; n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &val[i]); n for (int i = 1; i <= n; i++) { n sum[i] = sum[i - 1] + max(val[i], 0); n ent nw; n nw.pos = i; n nw.val = val[i]; n set::iterator it; n it = pq.find(nw); n if (it == pq.end()) n pq.insert(nw); n else { n if (ret < 2 * val[i] + sum[i - 1] - sum[(*it).pos]) { n ret = 2 * val[i] + sum[i - 1] - sum[(*it).pos]; n a = (*it).pos; n b = i; n } n } n } n cout << ret; n for (int i = 1; i < a; i++) del[++dcnt] = i; n for (int i = a + 1; i < b; i++) n if (val[i] < 0) del[++dcnt] = i; n for (int i = b + 1; i <= n; i++) del[++dcnt] = i; n printf( %d n , dcnt); n for (int i = 1; i <= dcnt; i++) printf( %d , del[i]); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 100; n const int LVL = 18; n int n, m; n int a[N]; n int b[N]; n int c[N]; n int h[N]; n int inplace[N], parent[N]; n int inmst[N]; n int dp[N][LVL], mini[N][LVL], maxi[N][LVL]; n int ans[N]; n vector tree[N]; n int find(int node) { n if (parent[node] == node) { n return node; n } n return parent[node] = find(parent[node]); n } n void addEdge(int edgeNo) { n if (find(a[edgeNo]) != find(b[edgeNo])) { n inmst[edgeNo] = true; n parent[find(a[edgeNo])] = find(b[edgeNo]); n tree[a[edgeNo]].push_back(edgeNo); n tree[b[edgeNo]].push_back(edgeNo); n } else { n inmst[edgeNo] = false; n } n } n pair lca(int a, int b) { n if (h[a] > h[b]) { n int temp = a; n a = b; n b = temp; n } n int diff = abs(h[a] - h[b]); n int max_weight_edge = 0; n for (int i = 0; i <= 17; i++) { n if ((diff >> i) & 1) { n max_weight_edge = max(maxi[b][i], max_weight_edge); n b = dp[b][i]; n } n } n if (b == a) { n return make_pair(a, max_weight_edge); n } n for (int i = 17; i >= 0; i--) { n if (dp[a][i] != dp[b][i]) { n max_weight_edge = max(max_weight_edge, maxi[a][i]); n max_weight_edge = max(max_weight_edge, maxi[b][i]); n a = dp[a][i]; n b = dp[b][i]; n } n } n return make_pair(dp[a][0], max(max_weight_edge, max(maxi[a][0], maxi[b][0]))); n } n void dfs(int node, int par) { n dp[node][0] = par; n for (int edgeNo : tree[node]) { n int child = a[edgeNo] ^ b[edgeNo] ^ node; n if (child != par) { n maxi[child][0] = c[edgeNo]; n h[child] = h[node] + 1; n dfs(child, node); n } n } n } n void dfs2(int node, int par) { n for (int edgeNo : tree[node]) { n int next = a[edgeNo] ^ b[edgeNo] ^ node; n if (next != par) { n ans[edgeNo] = mini[next][0]; n dfs2(next, node); n } n } n } n void update(int node, int lca, int val) { n int diff = abs(h[node] - h[lca]); n for (int i = LVL - 1; i >= 0; i--) { n if (diff & (1 << i)) { n mini[node][i] = min(mini[node][i], val); n node = dp[node][i]; n } n } n } n int main() { n cin >> n >> m; n for (int i = 1; i <= m; i++) { n cin >> a[i] >> b[i] >> c[i]; n inplace[i] = i; n } n for (int i = 1; i <= n; i++) { n parent[i] = i; n } n sort(inplace + 1, inplace + 1 + m, [](int x, int y) { n return make_pair(c[x], make_pair(a[x], b[x])) < n make_pair(c[y], make_pair(a[y], b[y])); n }); n for (int i = 1; i <= m; i++) { n addEdge(inplace[i]); n } n h[1] = 0; n dfs(1, 0); n for (int l = 1; l < LVL; l++) { n for (int i = 1; i <= n; i++) { n dp[i][l] = dp[dp[i][l - 1]][l - 1]; n maxi[i][l] = max(maxi[i][l - 1], maxi[dp[i][l - 1]][l - 1]); n } n } n for (int j = 0; j < LVL; j++) { n for (int i = 1; i <= n; i++) { n mini[i][j] = 1e9 + 7; n } n } n for (int i = 1; i <= m; i++) { n if (inmst[i]) { n ans[i] = 1e9 + 7; n } else { n pair result = lca(a[i], b[i]); n ans[i] = result.second; n update(a[i], result.first, c[i]); n update(b[i], result.first, c[i]); n } n } n for (int l = LVL - 1; l > 0; l--) { n for (int i = 1; i <= n; i++) { n mini[i][l - 1] = min(mini[i][l - 1], mini[i][l]); n mini[dp[i][l - 1]][l - 1] = min(mini[i][l], mini[dp[i][l - 1]][l - 1]); n } n } n dfs2(1, 0); n for (int i = 1; i <= m; i++) { n if (ans[i] == 1e9 + 7) { n ans[i] = 0; n } n } n for (int i = 1; i <= m; i++) { n cout << ans[i] - 1 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void smin(T &a, U b) { n if (a > b) a = b; n } n template n inline void smax(T &a, U b) { n if (a < b) a = b; n } n template n inline void gn(T &first) { n char c, sg = 0; n while (c = getchar(), (c > 9 || c < 0 ) && c != - ) n ; n for ((c == - ? sg = 1, c = getchar() : 0), first = 0; c >= 0 && c <= 9 ; n c = getchar()) n first = (first << 1) + (first << 3) + c - 0 ; n if (sg) first = -first; n } n template n inline void gn(T &first, T1 &second) { n gn(first); n gn(second); n } n template n inline void gn(T &first, T1 &second, T2 &z) { n gn(first); n gn(second); n gn(z); n } n template n inline void print(T first) { n if (first < 0) { n putchar( - ); n return print(-first); n } n if (first < 10) { n putchar( 0 + first); n return; n } n print(first / 10); n putchar(first % 10 + 0 ); n } n template n inline void println(T first) { n print(first), putchar( n ); n } n template n inline void printsp(T first) { n print(first), putchar( ); n } n template n inline void print(T first, T1 second) { n printsp(first), println(second); n } n template n inline void print(T first, T1 second, T2 z) { n printsp(first), printsp(second), println(z); n } n int power(int a, int b, int m, int ans = 1) { n for (; b; b >>= 1, a = 1LL * a * a % m) n if (b & 1) ans = 1LL * ans * a % m; n return ans; n } n int E, head[5050], to[5050], nxt[5050]; n void init(int n) { n E = 0; n for (int i = 1; i <= n; i++) head[i] = -1; n } n void add_edge(int u, int v) { n nxt[E] = head[u]; n to[E] = v; n head[u] = E++; n } n int dp[2][5050][5050], c[5050], d[5050]; n int sz[5050]; n void dfs(int u) { n dp[1][u][0] = 0; n dp[0][u][0] = 0; n dp[1][u][1] = c[u] - d[u]; n dp[0][u][1] = c[u]; n sz[u] = 1; n for (int e = head[u]; ~e; e = nxt[e]) { n int v = to[e]; n dfs(v); n for (int i = sz[u] + sz[v]; i >= 1; i--) { n for (int j = min(i, sz[v]); j >= 0 && i - j <= sz[u]; j--) { n smin(dp[0][u][i], dp[0][u][i - j] + dp[0][v][j]); n if (i && j < i) smin(dp[1][u][i], dp[1][u][i - j] + dp[1][v][j]); n } n } n sz[u] += sz[v]; n } n for (int i = 1; i <= sz[u]; i++) smin(dp[1][u][i], dp[0][u][i]); n } n int main() { n int n, b; n gn(n, b); n init(n); n memset(dp, 0x3f, sizeof(dp)); n for (int i = 1, first; i <= n; i++) { n gn(c[i], d[i]); n if (i > 1) { n gn(first); n add_edge(first, i); n } n } n dfs(1); n int ans = 0; n for (int i = 1; i <= n; i++) n if (dp[1][1][i] <= b) ans = i; n println(ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n set s1, s2, s3; n s3.clear(); n s1.clear(); n s2.clear(); n int n, m; n cin >> n >> m; n string str = ; n for (int i = 0; i < n; i++) { n cin >> str; n s1.insert(str); n } n for (int i = 0; i < m; i++) { n cin >> str; n s2.insert(str); n } n set::iterator it; n for (it = s1.begin(); it != s1.end(); it++) { n if (s2.find(*it) != s2.end()) { n s3.insert(*it); n } n } n int z = s3.size(); n int x = s1.size() - z; n int y = s2.size() - z; n if (z % 2 != 0) { n if (x >= y) { n cout << YES n ; n } else { n cout << NO n ; n } n } else { n if (x - y >= 1) n cout << YES n ; n else { n cout << NO n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int card[10010]; n int main() { n int n, r, s = 0, d = 0, l = 1, num = 0; n cin >> n; n r = n; n for (int i = 1; i <= n; i++) { n cin >> card[i]; n } n while (l <= r) { n num++; n if (num & 1) { n if (card[l] > card[r]) { n s += card[l]; n l++; n } else { n s += card[r]; n r--; n } n } else { n if (card[l] > card[r]) { n d += card[l]; n l++; n } else { n d += card[r]; n r--; n } n } n } n cout << s << << d << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int dp[200010][33]; n void generate() { n for (long long i = 1; i <= (200000); i++) { n for (long long j = 0; j < (32); j++) { n dp[i][j] = dp[i - 1][j] + !((1 << j) & i); n } n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n generate(); n int t; n cin >> t; n while (t--) { n int l, r, mn = 0x3F3F3F3F; n cin >> l >> r; n for (long long j = 0; j < (32); j++) { n mn = min(mn, dp[r][j] - dp[l - 1][j]); n } n cout << mn << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 10; n const long long inf = 9e18; n struct NODE { n long long v, id; n bool operator<(const NODE& other) const { n return v > other.v || (v == other.v && id > other.id); n } n } node[N]; n long long a[N], b[N]; n long long n; n long long f(long long x, long long y) { return x - 3LL * y * y + 3LL * y - 1; } n long long find(long long v, long long x) { n long long l, r, mid; n l = 0; n r = x + 1; n while (r - l > 1) { n mid = (l + r) >> 1; n if (f(x, mid) >= v) n l = mid; n else n r = mid; n } n return l; n } n long long solve(long long x) { n long long tot = 0; n int i; n for (i = 1; i <= n; i++) { n tot += (b[i] = find(x, a[i])); n } n return tot; n } n int main() { n long long k; n int i, cnt = 0; n long long l = inf, r = -inf, mid, tot; n cin >> n >> k; n for (i = 1; i <= n; i++) { n cin >> a[i]; n l = min(l, f(a[i], a[i])); n r = max(r, f(a[i], 1)); n } n while (r - l > 1) { n mid = (l + r) >> 1; n if (solve(mid) <= k) n r = mid; n else n l = mid; n } n tot = solve(r); n for (i = 1; i <= n; i++) n if (b[i] < a[i]) node[++cnt].v = f(a[i], b[i] + 1), node[cnt].id = i; n sort(node + 1, node + cnt + 1); n for (i = 1; i <= cnt; i++) { n if (tot == k) break; n b[node[i].id]++; n tot++; n } n for (i = 1; i <= n; i++) cout << b[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5, M = 2e4 + 5, inf = 0x3f3f3f3f, mod = 1e9 + 7; n void Print(int *a, int n) { n for (int i = 1; i < n; i++) printf( %d , a[i]); n printf( %d n , a[n]); n } n int e[N], nt[N]; n void Gnt(string a, int *nt) { n int k = 0, p = 0, n = (int)a.size(); n nt[0] = n; n for (int i = 1; i < n; i++) { n if (i + nt[i - k] < p) n nt[i] = nt[i - k]; n else { n if (i >= p) p = i; n while (p < n && a[p] == a[p - i]) p++; n nt[i] = p - i; n k = i; n } n } n } n void Exd(string a, string b, int *e, int *nt) { n int k = 0, p = 0, n = (int)a.size(), m = (int)b.size(); n Gnt(b, nt); n for (int i = 0; i < n; i++) { n if (i + nt[i - k] < p) n e[i] = nt[i - k]; n else { n if (i >= p) p = i; n while (p < n && p - i < m && a[p] == b[p - i]) p++; n e[i] = p - i; n k = i; n } n } n } n int cycle(string a) { n int n = a.size(); n Gnt(a, nt); n int t = n; n for (int i = 1; i < n; i++) n if (i + nt[i] == n) { n t = n % i ? n : i; n break; n } n return t; n } n string a, b; n int k, dp[N][2]; n int main() { n ios::sync_with_stdio(false), cin.tie(0); n cin >> a >> b >> k; n dp[0][a != b] = 1; n int n = (int)a.size(); n a = a + a; n Exd(a, b, e, nt); n int x = 0, len = (int)b.size(); n for (int i = 0; i < n; i++) { n if (e[i] >= len) x++; n } n int y = n - x; n for (int i = 1; i <= k; i++) { n dp[i][0] = (1LL * x * dp[i - 1][1] + 1LL * (x - 1) * dp[i - 1][0]) % mod; n dp[i][1] = (1LL * y * dp[i - 1][0] + 1LL * (y - 1) * dp[i - 1][1]) % mod; n } n printf( %d n , dp[k][0]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector gr[50005]; n int parent[50005]; n void dfs(int src, int par) { n parent[src] = par; n for (auto nbr : gr[src]) { n if (nbr != par) dfs(nbr, src); n } n } n int main() { n int n, x, y; n cin >> n >> x >> y; n for (int i = 1; i <= n; i++) { n if (i == x) continue; n int p; n cin >> p; n gr[i].push_back(p); n gr[p].push_back(i); n } n dfs(y, 0); n for (int i = 1; i <= n; i++) { n if (i == y) continue; n cout << parent[i] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int casos; n cin >> casos; n while (casos > 0) { n int a, b; n cin >> a >> b; n if (a > b) { n int dif = a - b; n b -= dif; n a -= dif * 2; n } else if (b > a) { n int dif = b - a; n a -= dif; n b -= dif * 2; n } n if (a % 3 == 0 && a == b && a >= 0) { n printf( YES n ); n } else { n printf( NO n ); n } n casos--; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, a[100005], is[100005], isn[100005], N, used[100005]; n vector v; n int main() { n cin >> n >> m; n for (int i = 1; i <= n; i++) { n char t; n int ind; n cin >> t >> ind; n a[i] = ind; n if (t == + ) n is[ind]++; n else { n a[i] *= -1; n isn[ind]++; n N++; n } n } n for (int i = 1; i <= n; i++) n if (is[i] + N - isn[i] == m) { n v.push_back(i); n used[i] = 1; n } n if (v.size() == 1) { n for (int i = 1; i <= n; i++) n if (a[i] == v[0] || (a[i] < 0 && -a[i] != v[0])) n cout << Truth << endl; n else n cout << Lie << endl; n } else { n for (int i = 1; i <= n; i++) n if (a[i] > 0 && !used[a[i]]) n cout << Lie << endl; n else if (a[i] < 0 && !used[-a[i]]) n cout << Truth << endl; n else n cout << Not defined << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool solved; n const int MX = 1500000; n int cache_map[1 << 22]; n int nxt; n int cache[MX][22]; n void check_solution(vector& g, vector& sol, int n) { n int mask(0); n int ind(nxt); n nxt += 1; n if (nxt == MX) nxt = 0; n if (((int)sol.size()) != 1) { n for (int i(0), _l((int)(((int)sol.size())) - 1); i <= _l; ++i) n mask |= (1 << sol[i]); n int mask_prev = mask ^ (1 << sol.back()); n int ind_prev(cache_map[mask_prev]); n memcpy(cache[ind], cache[ind_prev], 22 * sizeof(int)); n } else { n mask |= (1 << sol.back()); n for (int i(0), _l((int)(n)-1); i <= _l; ++i) cache[ind][i] = g[i]; n } n cache_map[mask] = ind; n int v(sol.back()); n for (int j(0), _l((int)(n)-1); j <= _l; ++j) { n if ((cache[ind][v] & (1 << j)) != 0) { n cache[ind][j] |= cache[ind][v]; n } n } n int need((1 << n) - 1); n for (int i(0), _l((int)(n)-1); i <= _l; ++i) n if (cache[ind][i] != need) return; n printf( %d n , ((int)sol.size())); n for (int i(0), _l((int)(((int)sol.size())) - 1); i <= _l; ++i) n printf( %d%c , sol[i] + 1, i + 1 == ((int)sol.size()) ? n : ); n solved = true; n } n void try_solve(vector& g, int n, int k, vector& cur, int ind) { n if (solved) return; n if (((int)cur.size()) == k) { n check_solution(g, cur, n); n } else { n if (ind == n) return; n cur.push_back(ind); n try_solve(g, n, k, cur, ind + 1); n cur.pop_back(); n if (solved) return; n try_solve(g, n, k, cur, ind + 1); n } n } n void solve() { n nxt = 0; n int n, m; n scanf( %d%d , &n, &m); n vector g(n); n for (int i(0), _l((int)(n)-1); i <= _l; ++i) { n g[i] |= (1 << i); n } n for (int i(0), _l((int)(m)-1); i <= _l; ++i) { n int a, b; n scanf( %d%d , &a, &b); n --a, --b; n g[a] |= (1 << b); n g[b] |= (1 << a); n } n if (m == n * (n - 1) / 2) { n puts( 0 ); n return; n } n solved = false; n vector s; n for (int i(1), _l(n); i <= _l; ++i) { n try_solve(g, n, i, s, 0); n if (solved) break; n } n } n int main() { n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100009; n int n; n long long a[N]; n void print_ans(int l, int r, vector& v) { n cout << l << << r << n ; n for (long long vv : v) { n cout << vv << ; n } n cout << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n; n for (int i = 0; i < n; ++i) { n cin >> a[i]; n } n vector fst; n fst.push_back(-a[0]); n a[0] = 0; n print_ans(1, 1, fst); n if (n == 1) { n vector zero = {0}; n print_ans(1, 1, zero); n print_ans(1, 1, zero); n return 0; n } n vector scd; n for (int i = 1; i < n; ++i) { n long long md = a[i] % n; n if (md < 0) md += n; n long long nm = md * (n - 1); n scd.push_back(nm); n a[i] += nm; n } n print_ans(2, n, scd); n vector all; n for (int i = 0; i < n; ++i) { n assert(a[i] % n == 0); n all.push_back(-a[i]); n } n print_ans(1, n, all); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin >> n; n long long f = n * (n - 1) * (n - 2) * (n - 3) * (n - 4); n cout << (f / 120) * ((n * n) - (4 * n) + 37) / 42; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, x; n vector a; n void ans() { n for (int i = 0; i < n; i++) { n cout << a[i] << ; n } n exit(0); n } n int main(int argc, char* argv[]) { n srand((unsigned int)time(NULL)); n cin >> n >> k >> x; n a.resize(n); n int ch = 1; n for (int i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] < 0) { n ch *= -1; n } n } n if (ch == 1) { n set > s; n for (int i = 0; i < n; i++) { n if (a[i] >= 0) { n s.insert({abs(-1 - a[i]), i}); n } else { n s.insert({abs(1 - a[i]), i}); n } n } n auto q = *s.begin(); n int id = q.second; n if (a[id] >= 0) { n while (a[id] >= 0) { n a[id] -= x; n k--; n if (k == 0) { n ans(); n } n } n } else { n while (a[id] <= 0) { n a[id] += x; n k--; n if (k == 0) { n ans(); n } n } n } n } n set > s; n for (int i = 0; i < n; i++) { n s.insert({abs(a[i]), i}); n } n while (k > 0) { n auto q = *s.begin(); n s.erase(s.begin()); n int id = q.second; n if (a[id] >= 0) { n a[id] += x; n } else { n a[id] -= x; n } n k--; n s.insert({abs(a[id]), id}); n } n ans(); n } n "} +{"func_code_string": "#include n using namespace std; n int t; n long long n; n int main() { n cin >> t; n while (t--) { n cin >> n; n long long num; n for (long long i = 1; i < n; i++) { n if (i * i > n) { n num = i - 1; n break; n } else if (i * i == n) { n num = i; n break; n } n } n long long out = 0; n if (n == 1) { n out = 0; n } else if (n == 2) { n out = 1; n } else if (num * num == n) { n out = (num - 1) * 2; n } else if (num * (num + 1) >= n) { n out = 2 * num - 1; n } else { n out = 2 * num; n } n cout << to_string(out) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n vector v(n), v1(m); n for (int i = 0; i < n; ++i) { n cin >> v[i]; n } n for (int i = 0; i < m; ++i) { n cin >> v1[i]; n } n vector ans; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (v[i] == v1[j]) { n ans.push_back(v[i]); n break; n } n } n } n for (auto i : ans) { n cout << i << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, d; n int main() { n cin >> n >> d; n int m; n cin >> m; n for (int i = 1; i <= m; i++) { n int x, y; n cin >> x >> y; n puts((d <= x + y && x + y <= 2 * n - d && -d <= x - y && x - y <= d) n ? YES n : NO ); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int x[2600], y[2600]; n string a[60]; n bool valid(int y, int x1, int y1, int x, int x2, int y2) { n for (int i = min(x1, x2); i <= max(x1, x2); i++) { n if (a[i][y] != B ) { n return false; n } n } n for (int i = min(y1, y2); i <= max(y1, y2); i++) { n if (a[x][i] != B ) { n return false; n } n } n return true; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n >> m; n int k = 0; n for (int i = 0; i < n; i++) { n cin >> a[i]; n for (int j = 0; j < m; j++) { n if (a[i][j] == B ) { n x[k] = i; n y[k] = j; n k++; n } n } n } n for (int i = 0; i < k; i++) { n for (int j = i + 1; j < k; j++) { n if (valid(y[i], x[i], y[i], x[j], x[j], y[j])) { n continue; n } n if (valid(y[j], x[i], y[i], x[i], x[j], y[j])) { n continue; n } n cout << NO << endl; n return 0; n } n } n cout << YES << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MAX_N = 1e5 + 5; n long long n, val; n pair, pair > edge[MAX_N]; n long long par[MAX_N]; n long long len[MAX_N]; n vector h; n vector ans; n vector > G[MAX_N]; n vector rot, ver; n long long P[MAX_N]; n long long down[MAX_N]; n long long up[MAX_N]; n bool mark[MAX_N]; n long long root(long long v) { n return (par[v] == v ? v : par[v] = root(par[v])); n } n void cheak(long long tmp, long long id) { n if (val < tmp) { n val = tmp; n ans.clear(); n } n if (val == tmp) ans.push_back(id); n } n long long dfs1(long long v, long long p) { n P[v] = p; n down[v] = len[v]; n mark[v] = true; n for (pair u : G[v]) n if (!mark[u.first]) down[v] += dfs1(u.first, v); n return down[v]; n } n void dfs2(long long v, long long uval) { n up[v] = uval; n for (pair u : G[v]) n if (u.first != P[v]) dfs2(u.first, uval + down[v] - down[u.first]); n } n void dfs3(long long v) { n for (pair u : G[v]) n if (u.first != P[v]) { n dfs3(u.first); n cheak(up[u.first] * down[u.first], u.second); n } n } n void calc() { n for (long long id : h) { n ver.push_back(root(edge[id].second.first)); n ver.push_back(root(edge[id].second.second)); n } n sort(ver.begin(), ver.end()); n ver.resize(unique(ver.begin(), ver.end()) - ver.begin()); n for (long long id : h) { n G[root(edge[id].second.first)].push_back( n {root(edge[id].second.second), edge[id].first.second}); n G[root(edge[id].second.second)].push_back( n {root(edge[id].second.first), edge[id].first.second}); n } n for (long long v : ver) n if (!mark[v]) { n rot.push_back(v); n dfs1(v, v); n } n for (long long v : rot) dfs2(v, 0); n for (long long v : rot) dfs3(v); n rot.clear(); n for (long long v : ver) { n G[v].clear(); n mark[v] = false; n } n ver.clear(); n } n int main() { n ios::sync_with_stdio(false), cin.tie(0); n cin >> n; n for (long long i = 0; i < n - 1; i++) { n long long v, u, d; n cin >> edge[i].second.first >> edge[i].second.second >> edge[i].first.first; n edge[i].first.second = i + 1; n edge[i].second.first--, edge[i].second.second--; n } n sort(edge, edge + n - 1); n for (long long i = 0; i < n; i++) { n par[i] = i; n len[i] = 1; n } n h.push_back(0); n for (long long i = 1; i < n - 1; i++) { n if (edge[i].first.first != edge[i - 1].first.first) { n calc(); n for (long long id : h) { n len[root(edge[id].second.second)] += len[root(edge[id].second.first)]; n par[root(edge[id].second.first)] = root(edge[id].second.second); n } n h.clear(); n } n h.push_back(i); n } n calc(); n cout << 2 * val << << ans.size() << n ; n sort(ans.begin(), ans.end()); n for (long long u : ans) cout << u << ; n return 0; n } n "} +{"func_code_string": "#include n template n struct xgcd_s { n T m, n, gcd; n }; n template n xgcd_s xgcd(T a, T b) { n T m[] = {1, 0}, n[] = {0, 1}, q[] = {0, 0}; n for (int i = 0;; i ^= 1) { n m[i] -= m[i ^ 1] * q[i]; n n[i] -= n[i ^ 1] * q[i]; n if (!b) return xgcd_s{m[i], n[i], a}; n q[i] = a / b; n a %= b; n std::swap(a, b); n } n } n template n struct _intmod { n private: n struct _p { n unsigned x; n }; n _intmod(_p x) { n = x.x; } n n public: n unsigned n; n _intmod() { n = 0; } n _intmod(int x) { n = x < 0 ? M() + x % (int)M() : x % M(); } n _intmod(unsigned x) { n = x % M(); } n _intmod(long x) { n = unsigned(x < 0 ? M() + x % (long)M() : x % M()); } n _intmod(unsigned long x) { n = x % M(); } n _intmod(long long x) { n n = unsigned(x < 0 ? M() + x % (long long)M() : x % M()); n } n _intmod(unsigned long long x) { n = x % M(); } n _intmod operator+(_intmod b) const { return {n + b.n}; } n _intmod operator*(_intmod b) const { n return {_p{unsigned((unsigned long long)n * b.n % M())}}; n } n _intmod operator-(_intmod b) const { n return {_p{n >= b.n ? n - b.n : M() + n - b.n}}; n } n _intmod operator-() const { return {_p{n ? M() - n : 0U}}; } n _intmod& operator+=(_intmod b) { return (*this = *this + b); } n _intmod& operator-=(_intmod b) { return (*this = *this - b); } n _intmod& operator/=(_intmod b) { return (*this = *this / b); } n _intmod& operator*=(_intmod b) { return (*this = *this * b); } n static _intmod mulinv(_intmod n) { n xgcd_s x = xgcd(n.n, M()); n (void)0; n return x.m; n } n _intmod operator/(_intmod b) const { return *this * mulinv(b); } n bool operator==(_intmod b) const { return n == b.n; } n bool operator!=(_intmod b) const { return n != b.n; } n explicit operator int() const { return n; } n }; n template n std::ostream& operator<<(std::ostream& o, _intmod n) { n return o << n.n; n } n template n std::istream& operator>>(std::istream& i, _intmod& n) { n long long x; n i >> x; n n = x; n return i; n } n template n unsigned intmod_unsignedconst() { n static_assert(M > 0 && M < (1U << 31), modulus bad ); n return M; n } n template n unsigned intmod_unsignedptr() { n return *M; n } n template n using intmod = _intmod >; n template n using intmodv = _intmod >; n static_assert(std::is_trivially_copyable >::value, ); n using namespace std; n using I = intmod<998244353>; n I topGroupSizeP[2001][2001]; n I favoritePow[2001]; n I upsetPow[2001]; n I expGames[2001]; n I rrGames[2001]; n int main() { n int n, a, b; n cin >> n >> a >> b; n I favoriteP = I(a) / b; n I upsetP = I(1) - favoriteP; n favoritePow[0] = upsetPow[0] = 1; n for (int i = 1; i <= n; i++) favoritePow[i] = favoriteP * favoritePow[i - 1]; n for (int i = 1; i <= n; i++) upsetPow[i] = upsetP * upsetPow[i - 1]; n for (int i = 1; i <= n; i++) rrGames[i] = i * (i - 1) / 2; n for (int m = 1; m <= n; m++) { n I notAllTiedP = 0; n for (int tgSize = 1; tgSize < m; tgSize++) { n I tgSizeP = topGroupSizeP[m - 1][tgSize] * favoritePow[tgSize]; n I superiorGroupExcludingLastP; n if (tgSize == 1) n superiorGroupExcludingLastP = 1; n else if (tgSize == 3) n superiorGroupExcludingLastP = n topGroupSizeP[m - 1][1] * topGroupSizeP[m - 2][1]; n else n superiorGroupExcludingLastP = topGroupSizeP[m - 1][tgSize - 1] / n topGroupSizeP[tgSize - 1][tgSize - 1]; n tgSizeP += superiorGroupExcludingLastP * topGroupSizeP[tgSize][tgSize] * n upsetPow[m - tgSize]; n notAllTiedP += tgSizeP; n topGroupSizeP[m][tgSize] = tgSizeP; n } n topGroupSizeP[m][m] = I(1) - notAllTiedP; n } n expGames[1] = 0; n for (int m = 2; m <= n; m++) { n I costExcludingAllTied = 0; n for (int tgSize = 1; tgSize < m; tgSize++) n costExcludingAllTied += n topGroupSizeP[m][tgSize] * n (expGames[tgSize] + expGames[m - tgSize] - rrGames[m - tgSize]); n I allTiedP = topGroupSizeP[m][m]; n costExcludingAllTied /= I(1) - allTiedP; n I allTiedCost = rrGames[m] / (I(1) - allTiedP); n expGames[m] = costExcludingAllTied + allTiedCost; n } n cout << expGames[n]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int m, k, d; n void print(int a, int b) { n printf( %d %d n , a, b); n a += d, b += d; n printf( %d %d n , a, b); n } n int main() { n cin >> k; n if (k % 2 == 0) { n cout << NO ; n return 0; n } n cout << YES << endl; n d = 4 * k - 2, m = (k * d) / 2; n cout << d << << m << endl; n d /= 2; n cout << 1 << << 1 + d << endl; n for (int i = 2; i <= k; i++) print(1, i); n for (int i = 2; i <= k; i++) n for (int j = k + 1; j <= 2 * k - 1; j++) print(i, j); n for (int i = 0; i < (k / 2); i++) print(k + 1 + 2 * i, k + 2 + 2 * i); n return 0; n } n "} +{"func_code_string": "#include n const long long int mod = 9999999999999983; n long long int primes[6] = {1125899906842597, 1495921043, 1005985879, n 1495921043, 1005985879, 1495921043}; n using namespace std; n vector vect; n long long int level[1000009]; n vector vt[1000009]; n map mp; n void printWords(string str) { n string word; n stringstream iss(str); n while (iss >> word) vect.push_back(word); n } n int main() { n int start_s = clock(); n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long int i, j, k, n, m, store, mxlevel = 0; n stack stk; n string str, str1; n cin >> str; n for (i = 0; i < str.size(); i++) { n if (str[i] == , ) str[i] = ; n } n printWords(str); n for (i = 0; i < vect.size(); i++) { n str1 = vect[i]; n if (str1[0] - 0 >= 0 && str1[0] - 0 <= 9) { n string s = str1; n stringstream geek(s); n long long int number = 0; n geek >> number; n if (number != 0) stk.push(number); n continue; n } n if (stk.size() == 0) n level[i] = 0; n else { n level[i] = stk.size(); n store = stk.top(); n stk.pop(); n if (store - 1 != 0) stk.push(store - 1); n if (store - 1 == 0 && vect[i + 1] != 0 ) stk.push(0); n if (store - 1 == 0 && vect[i + 1] == 0 ) { n while (stk.size() > 0) { n if (stk.top() == 0) n stk.pop(); n else n break; n } n } n } n } n for (i = 0; i < vect.size(); i++) { n str1 = vect[i]; n if (str1[0] - 0 >= 0 && str1[0] - 0 <= 9) { n continue; n } else { n mxlevel = max(mxlevel, level[i]); n vt[level[i]].push_back(vect[i]); n } n } n cout << mxlevel + 1 << n ; n for (i = 0; i < mxlevel + 1; i++) { n for (j = 0; j < vt[i].size(); j++) { n cout << vt[i][j] << ; n } n cout << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n int a[100005]; n long long s[100005], b[100005]; n int main() { n int n; n cin >> n; n for (int i = 0; i < n; ++i) scanf( %d , a + i); n sort(a, a + n); n s[0] = a[0]; n b[n] = 0; n for (int i = 1; i <= n; ++i) s[i] = s[i - 1] + a[i]; n for (int i = n - 1; i >= 0; --i) b[i] = b[i + 1] + a[i]; n long long ll = 0, rr = n; n for (int i = 0; i < n; ++i) { n ll += (a[i] * (i + 1LL) - s[i] + b[i] - a[i] * (n - i + 0LL) + a[i]); n } n long long g = gcd(ll, rr); n cout << ll / g << << rr / g << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, count = 0; n vector vect, keep; n cin >> n; n while (n != 0) { n keep.push_back(n % 10); n n = n / 10; n ++count; n } n reverse(keep.begin(), keep.end()); n for (auto itr = keep.begin(); itr != keep.end(); itr++) { n int num = pow(10, count - 1); n int k; n vector::iterator itc; n for (itc = vect.begin(), k = *itr; itc != vect.end() && k > 0; itc++, k--) { n *itc = *itc + num; n } n if (k > 0) { n while (k--) { n vect.push_back(num); n } n } n count--; n } n cout << vect.size() << endl; n for (auto itr = vect.begin(); itr != vect.end(); itr++) cout << *itr << ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct QUERY { n int query, time, number; n }; n vector > tree; n void update(int v, int tl, int tr, int pos, int query, int value) { n int tm = (tl + tr) / 2; n if (query == 1) { n if (tl == tr) return; n tree[v][value]++; n if (pos <= tm) n update(2 * v, tl, tm, pos, query, value); n else n update(2 * v + 1, tm + 1, tr, pos, query, value); n } else if (query == 2) { n if (tl == tr) return; n tree[v][value]--; n if (pos <= tm) n update(2 * v, tl, tm, pos, query, value); n else n update(2 * v + 1, tm + 1, tr, pos, query, value); n } n } n int sum(vector > &tree, int v, int tl, int tr, int i, int j, n int value) { n if (i > tr || j < tl) return 0; n if (tl == i && tr == j) return tree[v][value]; n int tm = (tl + tr) / 2; n return sum(tree, 2 * v, tl, (tr + tl) / 2, i, min(j, tm), value) + n sum(tree, 2 * v + 1, (tr + tl) / 2 + 1, tr, max(i, tm + 1), j, value); n } n int main() { n int n; n cin >> n; n vector a(n + 1); n vector num(n + 1); n vector t(n + 1); n for (int i = 1; i <= n; ++i) { n cin >> a[i].query >> a[i].time >> a[i].number; n num[i] = a[i].number; n t[i] = a[i].time; n } n sort(num.begin(), num.end()); n num.erase(unique(num.begin(), num.end()), num.end()); n sort(t.begin(), t.end()); n t.erase(unique(t.begin(), t.end()), t.end()); n map help; n for (unsigned int i = 1; i < num.size(); ++i) { n help.insert(make_pair(num[i], i)); n } n for (int i = 1; i <= n; ++i) { n a[i].number = help[a[i].number]; n } n help.clear(); n for (unsigned int i = 1; i < t.size(); ++i) { n help.insert(make_pair(t[i], i)); n } n for (int i = 1; i <= n; ++i) { n a[i].time = help[a[i].time]; n } n int len = t.size() - 1; n int tree_size = 4 * len; n tree.resize(tree_size); n for (int i = 1; i <= n; ++i) { n if (a[i].query != 3) n update(1, 1, len, a[i].time, a[i].query, a[i].number); n else n cout << sum(tree, 1, 1, len, 1, a[i].time, a[i].number) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1010; n set X, Y; n int n, m; n char st[maxn][maxn], sz[maxn][maxn]; n bool fill(int x1, int y1, int x2, int y2) { n int i; n for (i = x1; i <= x2; ++i) { n if (st[i][y1] == . ) return 0; n if (st[i][y2] == . ) return 0; n sz[i][y1] = sz[i][y2] = # ; n } n for (i = y1; i <= y2; ++i) { n if (st[x1][i] == . ) return 0; n if (st[x2][i] == . ) return 0; n sz[x1][i] = sz[x2][i] = # ; n } n return true; n } n int main() { n int i, j; n scanf( %d %d n , &n, &m); n for (i = 1; i <= n; ++i) scanf( %s , st[i] + 1); n for (i = 1; i <= n; ++i) n for (j = 1; j <= m; ++j) { n if (st[i][j - 1] == # && st[i][j] == # && st[i][j + 1] == # ) n X.insert(i); n if (st[i - 1][j] == # && st[i][j] == # && st[i + 1][j] == # ) n Y.insert(j); n } n if (X.size() > 4) X.erase(++ ++X.begin(), -- --X.end()); n if (Y.size() > 4) Y.erase(++ ++Y.begin(), -- --Y.end()); n for (set::iterator x1 = X.begin(); x1 != X.end(); ++x1) n for (set::iterator x2 = X.begin(); x2 != X.end(); ++x2) n for (set::iterator x3 = X.begin(); x3 != X.end(); ++x3) n for (set::iterator x4 = X.begin(); x4 != X.end(); ++x4) n for (set::iterator y1 = Y.begin(); y1 != Y.end(); ++y1) n for (set::iterator y2 = Y.begin(); y2 != Y.end(); ++y2) n for (set::iterator y3 = Y.begin(); y3 != Y.end(); ++y3) n for (set::iterator y4 = Y.begin(); y4 != Y.end(); ++y4) n if (*x1 + 1 < *x2 && *x3 + 1 < *x4 && *y1 + 1 < *y2 && n *y3 + 1 < *y4) { n memset(sz, . , sizeof(sz)); n if (fill(*x1, *y1, *x2, *y2) && fill(*x3, *y3, *x4, *y4)) { n bool ok = true; n for (i = 1; i <= n; ++i) n for (j = 1; j <= m; ++j) n if (st[i][j] != sz[i][j]) ok = false; n if (ok) { n printf( YES n ); n printf( %d %d %d %d n , *x1, *y1, *x2, *y2); n printf( %d %d %d %d n , *x3, *y3, *x4, *y4); n return 0; n } n } n } n printf( NO n ); n return 0; n } n "} +{"func_code_string": "#include n int s, k; n long long f[1000], res[1000]; n int main() { n scanf( %d %d , &s, &k); n f[0] = 0; n f[1] = 1; n int i; n for (i = 2; f[i - 1] <= s; i++) n for (int j = 1; i - j > 0 && j <= k; j++) f[i] += f[i - j]; n int cnt = 0; n for (i = i - 1; i >= 0; i--) n if (f[i] <= s) { n s -= f[i]; n res[cnt++] = f[i]; n } n printf( %d n , cnt); n for (int i = 0; i < cnt; i++) printf( %d , res[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int w, h, h1, w1, h2, w2; n cin >> w >> h >> w1 >> h1 >> w2 >> h2; n for (int i = h; i >= 0; i--) { n w += i; n if (i == h1) w -= w1; n if (i == h2) w -= w2; n if (w < 0) w = 0; n } n cout << w << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, cnt, num, sub_d[(2600)], d[(2600)], root, cut[(2600)], t; n char s[55][55]; n bool mark[(2600)], p, cycle; n vector e[(2600)]; n void dfs(long long x, long long par = 0) { n bool tmp = 0; n if (!t) cnt++; n mark[x] = 1; n sub_d[x] = d[x]; n for (int i = 0; i < e[x].size(); i++) { n if (mark[e[x][i]] && e[x][i] != par) cycle = 1; n if (!mark[e[x][i]]) { n d[e[x][i]] = d[x] + 1; n dfs(e[x][i], x); n sub_d[x] = min(sub_d[x], sub_d[e[x][i]]); n if (sub_d[e[x][i]] >= d[x]) tmp = 1; n } else if (e[x][i] != par) n sub_d[x] = min(sub_d[x], d[e[x][i]]); n } n cut[x] += tmp; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> m; n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) { n cin >> s[i][j]; n if (s[i][j] == # ) num++; n } n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) n for (int p = -1; p <= 1; p++) n for (int q = -1; q <= 1; q++) n if ((!p ^ !q) && i + p >= 0 && j + q >= 0 && i + p < n && j + q < m && n s[i][j] == # && s[i + p][j + q] == # ) n e[i * m + j].push_back((i + p) * m + j + q); n for (int i = 0; i < n * m && t < 2; i++) n if (s[i / m][i % m] == # ) { n for (int j = 0; j < n * m; j++) mark[j] = d[j] = sub_d[j] = 0; n root = i; n dfs(i); n t++; n } n for (int i = 0; i < n * m; i++) n if (cut[i] == 2) p = 1; n if (p) n cout << 1; n else if (cnt != num) n cout << 0; n else if (cycle) n cout << 2; n else n cout << -1; n return 0; n } n "} +{"func_code_string": "#include n using ll = long long int; n int main() { n int n, m; n std::cin >> n >> m; n std::vector> matr1(n); n std::vector> matr2(n); n std::vector> matr_min(n); n std::vector> matr_max(n); n for (int i = 0; i < n; i++) { n matr1[i].resize(m); n matr2[i].resize(m); n matr_min[i].resize(m); n matr_max[i].resize(m); n } n for (int i = 0; i < n; i++) { n for (auto &it : matr1[i]) { n std::cin >> it; n } n } n for (int i = 0; i < n; i++) { n for (auto &it : matr2[i]) { n std::cin >> it; n } n } n for (int i = 0; i < n; i++) { n for (int z = 0; z < m; z++) { n matr_min[i][z] = std::min(matr1[i][z], matr2[i][z]); n matr_max[i][z] = std::max(matr1[i][z], matr2[i][z]); n } n } n for (int i = 0; i < n; i++) { n for (int z = 0; z < m; z++) { n if (z - 1 >= 0 && matr_min[i][z - 1] >= matr_min[i][z]) { n std::cout << Impossible << std::endl; n return 0; n } n if (i - 1 >= 0 && matr_min[i - 1][z] >= matr_min[i][z]) { n std::cout << Impossible << std::endl; n return 0; n } n if (z - 1 >= 0 && matr_max[i][z - 1] >= matr_max[i][z]) { n std::cout << Impossible << std::endl; n return 0; n } n if (i - 1 >= 0 && matr_max[i - 1][z] >= matr_max[i][z]) { n std::cout << Impossible << std::endl; n return 0; n } n } n } n std::cout << Possible << std::endl; n } n "} +{"func_code_string": "#include n using namespace std; n int ans[15]; n int n, q; n string in; n string tmp; n void go(int l, int r) { n tmp = + in.substr(l - 1, r - l + 1); n string::iterator cp = tmp.begin() + 1; n int dp = 1; n while (cp != tmp.begin() && cp != tmp.end()) { n if (*cp >= 0 && *cp <= 9 ) { n ans[*cp - 0 ]++; n *cp -= 1; n if (*cp == 0 - 1) { n tmp.erase(cp); n if (dp == -1) cp--; n } else n cp += dp; n } else { n if (*cp == < ) n dp = -1; n else n dp = 1; n if (*(cp + dp) == < || *(cp + dp) == > ) { n tmp.erase(cp); n if (dp == -1) cp--; n } else n cp = cp + dp; n } n } n } n int main() { n scanf( %d %d , &n, &q); n cin >> in; n for (int tt = 0; tt < q; tt++) { n int l, r; n memset(ans, 0, sizeof(ans)); n scanf( %d %d , &l, &r); n go(l, r); n for (int i = 0; i < 10; i++) printf( %d , ans[i]); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string to_string(char c) { return string(1, c); } n string to_string(bool b) { return b ? true : false ; } n string to_string(const char* s) { return (string)s; } n string to_string(string s) { return s; } n template n string to_string(complex c) { n stringstream ss; n ss << c; n return ss.str(); n } n string to_string(vector v) { n string res = { ; n for (int i = 0; i < (int)v.size(); i++) res += char( 0 + v[i]); n res += } ; n return res; n } n template n string to_string(bitset b) { n string res = ; n for (size_t i = 0; i < SZ; i++) res += char( 0 + b[i]); n return res; n } n template n string to_string(pair p); n template n string to_string(T v) { n bool fst = 1; n string res = { ; n for (const auto& x : v) { n if (!fst) res += , ; n fst = 0; n res += to_string(x); n } n res += } ; n return res; n } n template n string to_string(pair p) { n return ( + to_string(p.first) + , + to_string(p.second) + ) ; n } n void DBG() { cerr << ] << endl; } n template n void DBG(H h, T... t) { n cerr << to_string(h); n if (sizeof...(t)) cerr << , ; n DBG(t...); n } n inline void test_case() { n int n; n cin >> n; n vector a(n); n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n int l = a[0]; n int r = a[n - 1]; n n = a.size(); n int negah = 0; n for (int& i : a) { n if (i < negah) { n cout << NO << n ; n return; n } n if (i > l && i - l > negah) { n negah = i - l; n i -= l; n } else { n l = min(l, i - negah); n i -= l; n } n } n reverse((a).begin(), (a).end()); n for (int& i : a) { n r = min(r, i); n i = max(i - r, 0); n } n if (count((a).begin(), (a).end(), 0) == (int)a.size()) { n cout << YES << n ; n } else { n cout << NO << n ; n } n } n int main() { n ios::sync_with_stdio(0); n int tt; n cin >> tt; n while (tt--) { n test_case(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n; n string s[] = { Mahmoud , Ehab }; n int main() { n cin >> n; n cout << s[n % 2]; n } n "} +{"func_code_string": "#include n using namespace std; n using pii = pair; n int m, n; n pii a[100001]; n vector adj[100001]; n bool is_chosen[100001]; n bool is_visited[100001]; n int cnt = 0; n template n inline T read() { n T x = 0; n T multiplier = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) { n multiplier = -1; n } n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = (x << 3) + (x << 1) + (ch & 15); n ch = getchar(); n } n return x * multiplier; n } n void dfs(int u, int prt) { n if (is_chosen[a[u].first] && is_chosen[a[u].second]) { n return; n } n if (is_visited[u]) { n return; n } n is_visited[u] = true; n bool x = is_chosen[a[u].first], y = is_chosen[a[u].second]; n if (!x) { n is_chosen[a[u].first] = true; n is_chosen[a[u].second] = true; n for (auto v : adj[a[u].first]) { n if (v != prt) { n dfs(v, u); n } n } n } n if (!y) { n is_chosen[a[u].first] = true; n is_chosen[a[u].second] = true; n for (auto v : adj[a[u].second]) { n if (v != prt) { n dfs(v, u); n } n } n } n is_chosen[a[u].first] = true; n is_chosen[a[u].second] = true; n } n int main() { n n = read(), m = read(); n for (int i = 1; i <= m; i++) { n a[i].first = read(); n a[i].second = read(); n } n sort(a + 1, a + m + 1); n for (int i = 1; i <= m; i++) { n adj[a[i].first].push_back(i); n adj[a[i].second].push_back(i); n } n for (int i = 1; i <= m; i++) { n if (!is_visited[i]) { n dfs(i, -1); n } n } n for (int i = 1; i <= m; i++) { n cnt += !is_visited[i]; n } n printf( %d n , cnt); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n long long n; n cin >> n; n long long result = 1; n long long x = n; n for (long long i = 2; i * i <= x; ++i) { n if (n % i == 0) { n result *= i; n while (n % i == 0) n /= i; n } n } n result *= n; n cout << result << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, a[100005], vis[100005], cnt, t; n void Solve() { n scanf( %d %d , &n, &k); n for (int i = 1; i <= n; ++i) { n scanf( %d , &a[i]); n if (!vis[a[i]]) cnt++; n ++vis[a[i]]; n if (cnt == k) { n t = 1; n while (cnt == k) { n --vis[a[t]]; n if (!vis[a[t]]) --cnt; n t++; n } n printf( %d %d n , t - 1, i); n return; n } n } n printf( -1 -1 n ); n } n int main(void) { n Solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[200010]; n int n; n bool query(int x) { n int t = -1, l = -1; n for (int i = 0; i < n; i++) { n l--; n if (s[i] == . ) continue; n if (s[i] == P ) { n if (t == -1) t = i; n int tmp = max(x - (i - t) * 2, (x - (i - t)) / 2); n l = max(tmp, l); n if (i - t > x) return 0; n t = -1; n } n if (s[i] == * ) { n if (l >= 0) continue; n if (t == -1) t = i; n } n } n if (t != -1) return 0; n return 1; n } n int bs(int l, int r) { n if (l == r) return l; n int m = (l + r) / 2; n if (query(m)) n return bs(l, m); n else n return bs(m + 1, r); n } n int main() { n cin >> n; n scanf( %s , s); n cout << bs(0, n * 2) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int read() { n int x = 0, sgn = 1; n char ch = getchar(); n for (; !isdigit(ch); ch = getchar()) n if (ch == - ) sgn = -1; n for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48); n return x * sgn; n } n const int N = 1e5 + 10; n int n; n long long ans1, ans2; n struct line { n int x, y, l, r; n } seg[N]; n bool cmp1(line a, line b) { return a.x < b.x; } n bool cmp2(line a, line b) { return a.y < b.y; } n struct BITT { n int arr[N << 1]; n void add(int x, int v = 1) { n for (; x <= (n * 2); x += x & -x) arr[x] += v; n return; n } n int q(int x, int v = 0) { n for (; x; x -= x & -x) v += arr[x]; n return v; n } n void clear() { memset(arr, 0, sizeof(arr)); } n } BIT; n int main() { n n = read(); n for (int i = 1; i <= n; i++) seg[i].x = read(), seg[i].y = read(); n for (int i = 1; i <= n; i++) n if (seg[i].x > seg[i].y) swap(seg[i].x, seg[i].y); n sort(seg + 1, seg + n + 1, cmp1); n for (int i = 1; i <= n; i++) { n seg[i].l += BIT.q(seg[i].x) + BIT.q(n << 1) - BIT.q(seg[i].y); n BIT.add(seg[i].y); n } n BIT.clear(); n for (int i = n; i >= 1; i--) { n seg[i].r += BIT.q(seg[i].y); n BIT.add(seg[i].y); n } n BIT.clear(); n sort(seg + 1, seg + n + 1, cmp2); n for (int i = n; i >= 1; i--) { n seg[i].l += BIT.q(n << 1) - BIT.q(seg[i].y); n BIT.add(seg[i].x); n } n ans1 = 1ll * n * (n - 1) * (n - 2) / 6; n for (int i = 1; i <= n; i++) { n ans1 -= 1ll * seg[i].l * seg[i].r; n ans2 += 1ll * (seg[i].l + seg[i].r) * (n - seg[i].l - seg[i].r - 1); n } n printf( %lld n , ans1 - ans2 / 2); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e5 + 5; n const long long mod = 1e9 + 7; n void solve(); n signed main() { n ios::sync_with_stdio(false); n cin.tie(0); n long long tests = 1; n while (tests--) solve(); n return 0; n } n void solve() { n long long n; n cin >> n; n pair a[n]; n for (long long i = 0; i < n; i++) { n cin >> a[i].second; n long long x = a[i].second; n long long cnt = 0; n while (x % 3 == 0) { n x = x / 3; n ++cnt; n } n a[i].first = -cnt; n } n sort(a, a + n); n for (long long i = 0; i < n; i++) { n cout << a[i].second << ; n } n cout << endl; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n template n inline T readInt(); n inline double readDouble(); n inline int readUInt(); n inline int readChar(); n inline void readWord(char *s); n inline bool readLine(char *s); n inline bool isEof(); n inline int getChar(); n inline int peekChar(); n inline bool seekEof(); n inline void skipBlanks(); n inline std::string readString(); n template n inline void writeInt(T x, char end = 0, int len = -1); n inline void writeChar(int x); n inline void writeWord(const char *s); n inline void writeDouble(double x, int len = 0); n inline void flush(); n static struct buffer_flusher_t { n ~buffer_flusher_t() { flush(); } n } buffer_flusher; n using namespace std; n int n, m, l; n const int MAXN = 1e5 + 42; n int h[MAXN]; n string pn[MAXN]; n string nn[MAXN]; n vector z_function(const string &second) { n int n = second.size(); n vector z(n, 0); n for (int i = 1, L = 0, R = 1; i < n; ++i) { n z[i] = min(R - i, z[i - L]); n while (i + z[i] < n && second[i + z[i]] == second[z[i]]) ++z[i]; n if (i + z[i] + !z[i] > R) L = i, R = i + z[i] + !z[i]; n } n return z; n } n inline bool check(const string &pat, const string &rep) { n int len = rep.size(); n for (int i = 0; i < n; ++i) { n string second = pat + # + pn[i]; n auto tz = z_function(second); n vector z; n for (int j = pat.size() + 1; j < tz.size(); ++j) { n z.push_back(tz[j]); n } n bool have = 0; n int pos_st = 0; n for (int j = 0; j < nn[i].size(); ++j) { n if (have) { n if (j - pos_st + 1 <= len) { n if (nn[i][j] != rep[j - pos_st]) return 0; n } else { n if (nn[i][j] != pn[i][j]) return 0; n } n } else if (z[j] == len) { n have = 1; n pos_st = j; n --j; n continue; n } else { n if (nn[i][j] != pn[i][j]) return 0; n } n } n } n return 1; n } n vector same; n vector dif; n inline pair get_strs() { n vector lptr; n vector rptr; n for (int sid : dif) { n string pna = pn[sid]; n string nna = nn[sid]; n lptr.push_back(5000); n rptr.push_back(-1); n for (int i = 0; i < pna.size(); ++i) { n if (pna[i] != nna[i]) { n lptr.back() = min(lptr.back(), i); n rptr.back() = i; n } n } n } n int lp = lptr[0]; n int rp = rptr[0]; n cerr << lp << << rp << endl; n int ss = dif[0]; n while (lp > 0) { n bool flag = 1; n for (int i = 1; i < dif.size(); ++i) { n int sid = dif[i]; n if (lptr[i] == 0 || !(pn[sid][lptr[i] - 1] == pn[ss][lp - 1] && n nn[sid][lptr[i] - 1] == nn[ss][lp - 1])) { n flag = 0; n break; n } n --lptr[i]; n } n if (!flag) break; n --lp; n } n while (rp < pn[ss].size() - 1) { n bool flag = 1; n for (int i = 1; i < dif.size(); ++i) { n int sid = dif[i]; n if (rptr[i] == pn[sid].size() - 1 || n !(pn[sid][rptr[i] + 1] == pn[ss][rp + 1] && n nn[sid][rptr[i] + 1] == nn[ss][rp + 1])) { n flag = 0; n break; n } n ++rptr[i]; n } n if (!flag) break; n ++rp; n } n cerr << lp << << rp << endl; n return {pn[ss].substr(lp, rp - lp + 1), nn[ss].substr(lp, rp - lp + 1)}; n } n int main() { n n = readInt(); n int pos = 0; n for (int i = 0; i < n; ++i) { n pn[i] = readString(); n } n for (int i = 0; i < n; ++i) { n nn[i] = readString(); n if (nn[i] != pn[i]) { n dif.push_back(i); n } else { n same.push_back(i); n } n } n auto [pat, rep] = get_strs(); n if (check(pat, rep)) { n writeWord( YES n ); n writeWord(pat.c_str()); n writeChar( n ); n writeWord(rep.c_str()); n writeChar( n ); n } else { n writeWord( NO n ); n } n } n static const int buf_size = 4096; n static unsigned char buf[buf_size]; n static int buf_len = 0, buf_pos = 0; n inline string readString() { n const int MAX = 1e6 + 42; n static char buf[MAX]; n readWord(buf); n return string(buf); n } n inline bool isEof() { n if (buf_pos == buf_len) { n buf_pos = 0, buf_len = fread(buf, 1, buf_size, stdin); n if (buf_pos == buf_len) return 1; n } n return 0; n } n inline int getChar() { return isEof() ? -1 : buf[buf_pos++]; } n inline int peekChar() { return isEof() ? -1 : buf[buf_pos]; } n inline bool seekEof() { n int c; n while ((c = peekChar()) != -1 && c <= 32) buf_pos++; n return c == -1; n } n inline void skipBlanks() { n while (!isEof() && buf[buf_pos] <= 32U) buf_pos++; n } n inline int readChar() { n int c = getChar(); n while (c != -1 && c <= 32) c = getChar(); n return c; n } n inline int readUInt() { n int c = readChar(), x = 0; n while ( 0 <= c && c <= 9 ) x = x * 10 + c - 0 , c = getChar(); n return x; n } n template n inline T readInt() { n int second = 1, c = readChar(); n T x = 0; n if (c == - ) n second = -1, c = getChar(); n else if (c == + ) n c = getChar(); n while ( 0 <= c && c <= 9 ) x = x * 10 + c - 0 , c = getChar(); n return second == 1 ? x : -x; n } n inline double readDouble() { n int second = 1, c = readChar(); n double x = 0; n if (c == - ) second = -1, c = getChar(); n while ( 0 <= c && c <= 9 ) x = x * 10 + c - 0 , c = getChar(); n if (c == . ) { n c = getChar(); n double coef = 1; n while ( 0 <= c && c <= 9 ) x += (c - 0 ) * (coef *= 1e-1), c = getChar(); n } n return second == 1 ? x : -x; n } n inline void readWord(char *second) { n int c = readChar(); n while (c > 32) *second++ = c, c = getChar(); n *second = 0; n } n inline bool readLine(char *second) { n int c = getChar(); n while (c != n && c != -1) *second++ = c, c = getChar(); n *second = 0; n return c != -1; n } n static int write_buf_pos = 0; n static char write_buf[buf_size]; n inline void writeChar(int x) { n if (write_buf_pos == buf_size) n fwrite(write_buf, 1, buf_size, stdout), write_buf_pos = 0; n write_buf[write_buf_pos++] = x; n } n inline void flush() { n if (write_buf_pos) n fwrite(write_buf, 1, write_buf_pos, stdout), write_buf_pos = 0; n } n template n inline void writeInt(T x, char end, int output_len) { n if (x < 0) writeChar( - ), x = -x; n char second[24]; n int n = 0; n while (x || !n) second[n++] = 0 + x % 10, x /= 10; n while (n < output_len) second[n++] = 0 ; n while (n--) writeChar(second[n]); n if (end) writeChar(end); n } n inline void writeWord(const char *second) { n while (*second) writeChar(*second++); n } n inline void writeDouble(double x, int output_len) { n if (x < 0) writeChar( - ), x = -x; n int t = (int)x; n writeInt(t), x -= t; n writeChar( . ); n for (int i = output_len - 1; i > 0; i--) { n x *= 10; n t = std::min(9, (int)x); n writeChar( 0 + t), x -= t; n } n x *= 10; n t = std::min(9, (int)(x + 0.5)); n writeChar( 0 + t); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 10; n const long long INF = 1e9 + 19; n int n; n pair b[N]; n long long T; n void read() { n scanf( %d , &n); n long long w; n scanf( %lld%lld , &T, &w); n n--; n for (int i = 0; i < n; i++) { n scanf( %lld%lld , &b[i].first, &b[i].second); n } n } n void solve() { n sort(b, b + n, greater>()); n multiset q; n int answer = INF; n int rem = 0; n int cur = 0; n for (;;) { n for (; cur < n && b[cur].first > T; cur++) { n q.insert(b[cur].second - b[cur].first + 1); n } n answer = min(answer, cur - rem); n if (q.empty()) break; n long long x = *q.begin(); n if (T >= x) { n T -= x; n rem++; n q.erase(q.begin()); n } else n break; n } n cout << answer + 1 << endl; n } n void stress() {} n int main() { n if (1) { n int k = 1; n for (int tt = 0; tt < k; tt++) { n read(); n solve(); n } n } else { n stress(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cout.precision(10); n int n; n cin >> n; n if (n % 2) { n cout << black n ; n } else { n cout << white n ; n cout << 1 << << 2 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e6 + 10, inf = 1e18, mod = 1e9 + 7; n long long a[N], b[N], q[N], q2[N]; n unordered_map mp; n vector cmp; n struct node { n int l, r, col = 0; n int size() { return r - l; } n int unity(int lq, int rq) { return max(0, min(r, rq) - max(l, lq)); } n bool init(int lq, int rq) { return unity(lq, rq) == size(); } n bool leaf() { return size() == 1; } n }; n node seg[4 * N]; n void build(int v, int l, int r) { n seg[v].l = l; n seg[v].r = r; n if (seg[v].leaf()) return; n int mid = (l + r) / 2; n build(2 * v, l, mid); n build(2 * v + 1, mid, r); n } n void add(int v, int l, int r, int cl) { n if (!seg[v].unity(l, r)) return; n if (seg[v].init(l, r)) { n seg[v].col = cl; n return; n } n add(v * 2, l, r, cl); n add(v * 2 + 1, l, r, cl); n } n int get(int v, int ind) { n if (!seg[v].unity(ind, ind + 1)) return 0; n if (seg[v].leaf()) { n return seg[v].col; n } n return max(max(get(v * 2, ind), get(v * 2 + 1, ind)), seg[v].col); n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n, m; n cin >> n >> m; n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int i = 1; i <= n; i++) cin >> b[i]; n long long id = 1; n build(1, 1, n + 1); n for (int i = 0; i < m; i++) { n int tp; n cin >> tp; n if (tp == 1) { n long long x, y, k; n cin >> x >> y >> k; n q[id] = x; n q2[id] = y; n add(1, y, y + k, id); n id++; n } else { n long long ind; n cin >> ind; n long long c = get(1, ind); n if (c == 0) n cout << b[ind] << n ; n else { n long long x = q[c], y = q2[c]; n cout << a[x + ind - y] << n ; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n long long n, x; n cin >> n >> x; n set s; n long long a; n for (long long i = 0; i < n; i++) { n cin >> a; n s.insert(a); n } n for (auto it = s.begin(); it != s.end(); it++) { n if (*it <= x) n x++; n else { n if (x + 1 == *it) x++; n } n } n cout << x << n ; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long test; n cin >> test; n while (test--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, flow[200100][2], dtion[200100], Eg[200100]; n bool vis[200100]; n queue q; n struct node { n int v, d, i; n node *next; n } edge[200100 * 2]; n node *cnt = &edge[0]; n node *adj[200100]; n void Addedge(int u, int v, int d, int i) { n node *p = ++cnt; n p->v = v; n p->d = d; n p->i = i; n p->next = adj[u]; n adj[u] = p; n } n void Solve() { n int u, v, d; n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n scanf( %d%d%d , &Eg[i], &v, &d); n Addedge(Eg[i], v, d, i); n flow[Eg[i]][0] += d; n Addedge(v, Eg[i], d, i); n flow[v][0] += d; n } n q.push(1); n vis[1] = true; n while (!q.empty()) { n u = q.front(); n q.pop(); n for (node *p = adj[u]; p; p = p->next) { n v = p->v; n d = p->d; n if (vis[v]) continue; n dtion[p->i] = u; n flow[v][1] += d; n flow[v][0] -= d; n if (v != n && flow[v][1] == flow[v][0]) { n vis[v] = true; n q.push(v); n } n } n } n for (int i = 1; i <= m; i++) { n if (dtion[i] == Eg[i]) n printf( 0 n ); n else n printf( 1 n ); n } n } n int main() { n Solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x3f3f3f3f; n const long long mod = 1e9 + 7; n const int maxn = 1e5 + 5; n long long a[15], b[15]; n int main() { n for (int i = 0; i < 14; ++i) { n cin >> a[i]; n } n long long ans = 0; n for (int i = 0; i < 14; ++i) { n if (a[i] == 0) continue; n for (int j = 0; j < 14; ++j) b[j] = a[j]; n b[i] = 0; n for (int j = 0; j < 14; ++j) b[j] += a[i] / 14; n long long tmp = a[i] % 14; n int now = (i + 1) % 14; n while (tmp--) { n ++b[now]; n now = (now + 1) % 14; n } n long long ans1 = 0; n for (int j = 0; j < 14; ++j) { n if (b[j] & 1) continue; n ans1 += b[j]; n } n ans = max(ans, ans1); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int N; n cin >> N; n int arr[N + 1]; n for (int i = 0; i < N; i++) { n cin >> arr[i]; n } n sort(arr, arr + N); n if (arr[0] != arr[N / 2]) n cout << Alice << endl; n else n cout << Bob << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int ans = 0; n int n; n int tree[10001]; n int dp[10001] = {0}; n int main() { n cin >> n; n int a[100001]; n int tot = pow(2, n + 1) - 2; n for (int i = 2; i <= tot + 1; i++) { n cin >> a[i]; n } n tree[0] = 0; n tree[1] = 0; n int ma = 0; n for (int i = 2; i <= pow(2, n + 1) - 1; i++) { n tree[i] = tree[i / 2] + a[i]; n ma = max(tree[i], ma); n } n for (int i = n - 1; i >= 1; i--) { n for (int j = pow(2, n); j < pow(2, n + 1); j += pow(2, i)) { n int mi = ma - tree[j]; n for (int k = 0; k < pow(2, i); k++) { n mi = min(mi, ma - tree[j + k]); n } n ans += mi; n for (int k = 0; k < pow(2, i); k++) { n tree[j + k] += mi; n } n } n } n for (int i = pow(2, n); i < pow(2, n + 1); i++) { n ans += (ma - tree[i]); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mod = 1e9 + 7; n int mem[2005][2005], n, h, l, r; n int arr[2005]; n int f(int inx, int hour) { n if (inx >= n) return 0; n if (mem[inx][hour] != -1) return mem[inx][hour]; n int a = f(inx + 1, (hour + arr[inx]) % h); n int b = f(inx + 1, (hour + arr[inx] - 1) % h); n if ((hour + arr[inx]) % h >= l && (hour + arr[inx]) % h <= r) ++a; n if ((hour + arr[inx] - 1) % h >= l && (hour + arr[inx] - 1) % h <= r) { n ++b; n } n return mem[inx][hour] = max(a, b); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> h >> l >> r; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n } n memset(mem, -1, sizeof mem); n cout << f(0, 0) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k, i = 0, d = 2; n cin >> n >> k; n vector v; n while (i < k - 1 && n != 1) { n if (n % d == 0) { n n /= d; n v.push_back(d); n i++; n } else { n d++; n } n } n if (n != 1) v.push_back(n); n if (k != v.size()) n cout << -1 ; n else { n for (int i = 0; i < k; i++) cout << v[i] << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 1000000 + 20; n int used[MAX_N]; n int a[MAX_N]; n int n, k; n int main() { n ios::sync_with_stdio(false); n cin >> n >> k; n for (int i(0); i < int(n); i++) { n int x; n cin >> x; n ++used[x]; n } n int sum = 0; n for (int i = 0; i <= 1000000; i++) { n a[i] = sum; n sum += used[i]; n } n int ans = 0; n for (int i = 1; i <= 1000000; i++) { n int res = 0, p = min(k, i - 1); n for (int j = i; j < 1000001; j += i) { n int y = min(1000000, j + p); n res += a[y] - a[j] + used[y]; n } n if (res == n) ans = max(ans, i); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, a; n long long k; n cin >> n >> k; n vector arr(n), c(n); n for (int i = 0; i < n; i++) { n cin >> arr[i]; n } n cin >> a; n for (int i = 0; i < n; i++) { n cin >> c[i]; n } n set m; n long long ans = 0; n for (int i = 0; i < n; i++) { n m.insert(c[i]); n while (k < arr[i]) { n if (m.empty()) { n cout << -1; n return 0; n } n ans += *(m.begin()); n k += a; n m.erase(m.begin()); n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int dpr[300005]; n int dpl[300005]; n int A[300005]; n pair B[300005]; n int fr(int pos) { n if (A[pos] == 0) return pos - 1; n if (pos == n - 1) return n - 1; n if (dpr[pos] != -1) return dpr[pos]; n dpr[pos] = fr(pos + 1); n return dpr[pos]; n } n int fl(int pos) { n if (A[pos] == 0) return pos + 1; n if (pos == 0) return 0; n if (dpl[pos] != -1) return dpl[pos]; n dpl[pos] = fl(pos - 1); n return dpl[pos]; n } n int main() { n int k; n cin >> n >> k; n memset(dpl, -1, sizeof dpl); n memset(dpr, -1, sizeof dpr); n int maxx = 0; n int coun = 0; n for (int i = 0; i < n; i++) { n cin >> A[i]; n if (A[i] == 0) { n if (coun > maxx) { n maxx = coun; n } n coun = 0; n } else { n coun++; n } n } n if (coun > maxx) maxx = coun; n coun = maxx; n vector C; n for (int i = 0; i < n; i++) { n if (A[i] == 0) { n if (i == 0) { n B[i].first = 0; n B[i].second = fr(i + 1); n } else if (i == n - 1) { n B[i].second = n - 1; n B[i].first = fl(i - 1); n } else { n B[i].first = fl(i - 1); n B[i].second = fr(i + 1); n } n C.push_back(i); n } n } n int sta = 0; n int fin = k - 1; n int a; n int smax = 0; n while ((fin < C.size()) && (k > 0) && (C.size() > 0)) { n a = (C[fin] - C[sta] + 1) + (C[sta] - B[C[sta]].first) + n (B[C[fin]].second - C[fin]); n if (a > maxx) { n maxx = a; n smax = B[C[sta]].first; n } n sta++; n fin++; n } n if ((sta < C.size()) && (C.size() > 0) && (k > 0)) { n a = n - C[sta] + (C[sta] - B[C[sta]].first); n if (a > maxx) { n maxx = a; n smax = B[C[sta]].first; n } n } n cout << maxx << endl; n if (coun != maxx) { n for (int i = smax; i < smax + maxx; i++) { n A[i] = 1; n } n } n for (int i = 0; i < n - 1; i++) { n cout << A[i] << ; n } n cout << A[n - 1] << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 , unroll-loops ) n #pragma GCC target( avx2 ) n using namespace std; n inline long long add(long long a, long long b) { n return ((a + b) < 1000000007 ? (a + b) : (a + b - 1000000007)); n } n int prime[1000005]; n void seive() { n prime[0] = prime[1] = 1; n for (int i = 2; i <= sqrt(1000005); i++) { n if (prime[i]) continue; n for (int j = 2 * i; j <= 1000005; j += i) { n prime[j] = 1; n } n } n } n inline long long sub(long long a, long long b) { n return ((a - b) < 0 ? a - b + 1000000007 : a - b); n } n long long power(long long a, long long b) { n if (b == 0) return 1; n long long y = power(a, b / 2); n y = (y * y) % 1000000007; n if (b & 1) y = (a * y) % 1000000007; n return y; n } n using namespace std; n int main() { n long long n; n cin >> n; n vector v; n long long fr = 0, tw = 0; n long long a[100005] = {0}; n for (long long i = 0; i < n; i++) { n long long x; n cin >> x; n v.push_back(x); n a[x]++; n if (a[x] % 4 == 0) { n fr++; n tw--; n } else if (a[x] % 2 == 0) { n tw++; n } n } n long long q; n cin >> q; n for (long long i = 0; i < q; i++) { n char k; n cin >> k; n long long x; n cin >> x; n if (k == - ) { n if (a[x] % 4 == 0) { n fr--; n tw++; n } else if (a[x] % 2 == 0) n tw--; n a[x]--; n } else { n a[x]++; n if (a[x] % 4 == 0) { n fr++; n tw--; n } else if (a[x] % 2 == 0) { n tw++; n } n } n if (fr > 1 || (tw > 1 && fr == 1)) n cout << YES << endl; n else n cout << NO << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n map f, reff; n int n, m, q, w[13], ans[4097][101]; n string s; n string tob(int x) { n string t = ; n while (x > 0) { n x % 2 == 0 ? t = 0 + t : t = 1 + t; n x /= 2; n } n while (t.length() < n) { n t = 0 + t; n } n return t; n } n int tod(string x) { n int r = 0, v = 1; n for (int i = n - 1; i >= 0; i--) { n if (x[i] == 1 ) r += v; n v *= 2; n } n return r; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n >> m >> q; n for (int i = 0; i < n; i++) cin >> w[i]; n while (m--) { n getline(cin >> ws, s); n f[s]++; n } n int maxnum = (1 << n) - 1; n for (int i = 0; i <= maxnum; i++) { n string tmp = tob(i); n map::iterator j; n for (j = f.begin(); j != f.end(); j++) { n int v = 0; n for (int k = 0; k < n; k++) n if (tmp[k] == j->first[k]) v += w[k]; n if (v <= 100) ans[i][v] += j->second; n } n } n for (int i = 0; i <= maxnum; i++) n for (int j = 1; j <= 100; j++) ans[i][j] += ans[i][j - 1]; n while (q--) { n int kk; n cin >> ws >> s >> kk; n cout << ans[tod(s)][kk] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n int main(int agrc, char* argv[]) { n int N, M; n scanf( %d %d , &N, &M); n char room[625]; n for (int i = 0; i < N * M; i++) scanf( %c , room + i); n int dp[625]; n for (int i = 0; i < M * M; i++) dp[i] = 0; n int best = 0; n for (int r = 0; r < N; r++) { n for (int pl = 0; pl < M; pl++) n for (int pr = pl; pr < M; pr++) { n bool free = true; n for (int i = pl; i <= pr && free; i++) free &= room[M * r + i] == 0 ; n if (free) { n if (dp[pl * M + pr] == 0) { n dp[pl * M + pr] = 2 + 2 * (pr - pl + 1); n } else { n dp[pl * M + pr] += 2; n } n } else { n dp[pl * M + pr] = 0; n } n } n for (int i = 0; i < M * M; i++) n if (dp[i] > best) best = dp[i]; n } n printf( %d n , best); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = (1LL << 60); n priority_queue pqr, pqc; n int sum_r[1005], sum_c[1005], k, p; n long long row[1000001], col[1000001]; n void cal(int cnt, priority_queue pq, long long res[1000001]) { n long long ans = 0; n for (int i = 1; i <= k; i++) { n long long tmp = pq.top(); n pq.pop(); n pq.push(tmp - cnt * 1LL * p); n ans += tmp; n res[i] = ans; n } n res[0] = 0; n } n int main() { n int n, m; n scanf( %d%d%d%d , &n, &m, &k, &p); n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n int tmp; n scanf( %d , &tmp); n sum_r[i] += tmp; n sum_c[j] += tmp; n } n } n for (int i = 0; i < n; i++) pqr.push(sum_r[i]); n for (int i = 0; i < m; i++) pqc.push(sum_c[i]); n cal(m, pqr, row); n cal(n, pqc, col); n long long ans = -INF; n for (int i = 0; i <= k; i++) { n long long tmp = row[i] + col[k - i] - i * 1LL * (k - i) * p; n if (tmp > ans) ans = tmp; n } n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n #include n using namespace std; n n int main() { n int t; n cin >> t; n while (t--) { n double n; n cin >> n; n if (sqrt(n / 2) == (int)sqrt(n / 2)) { n cout << YES n ; n } n else { n if (sqrt(n / 4) == (int)sqrt(n / 4)) { n cout << YES n ; n } n else cout << NO n ; n } n } n }"} +{"func_code_string": "#include n using namespace std; n bool cmp(int a, int b) { return a > b; } n int main() { n long long a[100005]; n long long b[100005]; n int n; n cin >> n; n long long sum = 0; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n sum += a[i]; n } n for (int i = 1; i <= n; i++) cin >> b[i]; n if (n == 2) { n cout << YES << endl; n return 0; n } n if (n == 1 || n == 0) { n cout << NO << endl; n return 0; n } n sort(b + 1, b + n + 1, cmp); n if (b[1] + b[2] >= sum) { n cout << YES << endl; n } else n cout << NO << endl; n } n "} +{"func_code_string": "/* n Miles Morales : When will I know I m ready? n Peter B. Parker : You won t. It s a leap of faith. That s all it is, Miles. A leap of faith. n */ n //KEEP IT SIMPLE STUPID n n #include n n #pragma GCC optimize( O3 ) n #pragma GCC target( avx ) n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( unroll-loops ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n n #define ll long long n #define MP make_pair n #define ERR cout << ================================================ n n #define fi first n #define se second n #define PB push_back n #define all(x) (x).begin(), (x).end() n #define rall(x) (x).rbegin(), (x).rend() n #define forn(i, n) for (ll i = 0; i < (ll)(n); ++i) n #define for1(i, n) for (ll i = 1; i <= (ll)(n); ++i) n #define ford(i, n) for (ll i = (ll)(n)-1; i >= 0; --i) n #define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i) n #define print(v) n for (auto x : v) n { n cout << x << ; n } n #define umin(...) min({__VA_ARGS__}) n #define umax(...) max({__VA_ARGS__}) n #define MAX(v) *max_element(all(v)) n #define MIN(v) *min_element(all(v)) n #define SP << << n #define W(t) n ll t; n cin >> t; n while (t--) n #define FIO n freopen( input.txt , r , stdin); n freopen( output.txt , w , stdout); n #define FAST n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n n using namespace std; n n typedef pair pii; n typedef vector vi; n typedef vector vvi; n typedef vector vll; n typedef vector vvll; n n const ll INF = 1e18; n const ll NEG_INF = -1 * (1e18); n using namespace std; n n void usaco(string prob) n { n freopen((prob + .in ).c_str(), r , stdin); n freopen((prob + .out ).c_str(), w , stdout); n } n n /* Function to check primality in O(sqrt(n)) */ n bool prime(int n) n { n if (n < 2) n return false; n for (int x = 2; x * x <= n; x++) n { n if (n % x == 0) n return false; n } n return true; n } n n /* Function to get prime factorization of n */ n vector getFactors(int n) n { n vector f; n for (int x = 2; x * x <= n; x++) n { n while (n % x == 0) n { n f.push_back(x); n n /= x; n } n } n if (n > 1) n f.push_back(n); n return f; n } n n void solve() n { n ll n; n cin >> n; n vll a(n); n forn(i, n) cin >> a[i]; n ll r = n; n vll b(n + 1); n ll m = a[0]; n for (ll k = 0; k < n; k++) n { n if (a[k] >= m) n { n b[k] = k; n m = a[k]; n } n else n { n b[k] = b[k - 1]; n } n } n while (r) n { n ll l = b[r - 1]; n n for (ll i = l; i < r; i++) n { n cout << a[i] << ; n } n r = l; n } n // forn(i, n) n // { n // cout << b[i] << ; n // } n cout << n ; n } n n int main() n { n //FIO n FAST n n //usaco( cowlands ); n n ll TC = 1; n /* n Uncomment when multiple test cases n */ n n cin >> TC; n for1(tt, TC) n { n solve(); n } n return 0; n } n n /* stuff you should look for n * int overflow, array bounds n * special cases (n=1?) n * do smth instead of nothing and stay organized n * WRITE STUFF DOWN n */ n "} +{"func_code_string": "#include n using namespace std; n const int N = 2004; n int dp[N], dq[N], a[N], n; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1; i <= n; i++) { n dp[i] = 1; n for (int j = 1; j < i; j++) n if (a[i] >= a[j]) dp[i] = max(dp[i], dp[j] + 1); n } n for (int i = n; i >= 1; i--) { n dq[i] = 1; n for (int j = n; j > i; j--) n if (a[i] <= a[j]) dq[i] = max(dq[i], dq[j] + 1); n } n int ans = dp[n]; n for (int i = 1; i <= n; i++) ans = max(ans, dp[i] + dq[i + 1]); n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = 3.14159265358979323846; n const double eps = (1e-9); n int dcmp(double x, double y) { return fabs(x - y) <= eps ? 0 : x < y ? -1 : 1; } n int n, m; n int mem[200000]; n int minMoves(int x) { n if (x == m) return 0; n int& ret = mem[x]; n if (ret != -1) return ret; n ret = (1 << 20); n if (x < m) ret = min(ret, 1 + minMoves(x * 2)); n if (x > 1) ret = min(ret, 1 + minMoves(x - 1)); n return ret; n } n int main() { n ios_base::sync_with_stdio(false); n memset(mem, -1, sizeof(mem)); n cin >> n >> m; n cout << minMoves(n); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, f, k; n cin >> a >> b >> f >> k; n int now = b; n int ret = 0; n for (int i = 1; i <= k; i++) { n if (i % 2 == 1) { n if (now < f) { n return puts( -1 ), 0; n } n if (i == k) { n if (now < a) { n ret++; n } n if (b < a - f) { n return puts( -1 ), 0; n } n } else { n if (now < a + a - f) { n ret++; n now = b - (a - f); n } else { n now = now - a; n } n } n } else { n if (now < a - f) { n return puts( -1 ), 0; n } n if (i == k) { n if (now < a) { n ret++; n } n if (b < f) { n return puts( -1 ), 0; n } n } else { n if (now < a + f) { n ret++; n now = b - f; n } else { n now = now - a; n } n } n } n } n cout << ret << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n typedef struct SPoint { n double X, Y; n SPoint(double X = 0, double Y = 0) : X(X), Y(Y) {} n double abs() { return sqrt(X * X + Y * Y); } n double sqrAbs() { return X * X + Y * Y; } n } TPoint; n TPoint operator-(const TPoint& shl, const TPoint& shr) { n return TPoint(shl.X - shr.X, shl.Y - shr.Y); n } n istream& operator>>(istream& is, TPoint& getPoint) { n return is >> getPoint.X >> getPoint.Y; n } n const int MAX_POINT = 5; n const double ESP = 1e-8; n double squareOfRect; n TPoint outRect[MAX_POINT], inRect[MAX_POINT]; n double squareOf(const TPoint& A, const TPoint& B, const TPoint& C) { n double a = (B - C).abs(); n double b = (C - A).abs(); n double c = (A - B).abs(); n double p = (a + b + c) / 2; n return sqrt(p * (p - a) * (p - b) * (p - c)); n } n bool inSide(const TPoint& checkPoint) { n double minX = 100, minY = 100, maxX = -100, maxY = -100; n for (int i = 1; i <= 4; ++i) minX = min(minX, outRect[i].X); n for (int i = 1; i <= 4; ++i) minY = min(minY, outRect[i].Y); n for (int i = 1; i <= 4; ++i) maxX = max(maxX, outRect[i].X); n for (int i = 1; i <= 4; ++i) maxY = max(maxY, outRect[i].Y); n if (checkPoint.X < minX || checkPoint.X > maxX || checkPoint.Y < minY || n checkPoint.Y > maxY) n return false; n double square = 0; n for (int i = 1; i <= 4; ++i) n square += squareOf(checkPoint, outRect[i], outRect[i - 1]); n return abs(square - squareOfRect) < ESP; n } n void checker() { n outRect[0] = outRect[4]; n squareOfRect = (outRect[0] - outRect[1]).sqrAbs(); n for (int i = 1; i <= 4; ++i) n if (inSide(inRect[i])) cout << YES n , exit(0); n TPoint center((inRect[1].X + inRect[3].X) / 2, n (inRect[1].Y + inRect[3].Y) / 2); n if (inSide(center)) cout << YES n , exit(0); n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0), cout.tie(0); n for (int i = 1; i <= 4; ++i) cin >> outRect[i]; n for (int i = 1; i <= 4; ++i) cin >> inRect[i]; n checker(); n swap(inRect, outRect); n checker(); n cout << NO n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e5 + 7; n int a[MAXN], n, p, lim = 0; n bool check(int val) { n for (int i = 1; i <= n; ++i) n if (val + i - 1 < a[i]) return 0; n return 1; n } n bool valid(int val) { n int sta = 0; n for (int i = 0; i < n; ++i) { n while (sta + 1 <= n && val + i >= a[sta + 1]) ++sta; n if (sta - i >= p) return 0; n } n return 1; n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n cin >> n >> p; n for (int i = 1; i <= n; ++i) cin >> a[i], lim = max(lim, a[i]); n sort(a + 1, a + 1 + n); n int l = 0, r = lim, sta = -1; n while (l <= r) { n int mid = (l + r) >> 1; n if (check(mid)) n sta = mid, r = mid - 1; n else n l = mid + 1; n } n l = sta, r = lim; n int fin = sta - 1; n while (l <= r) { n int mid = (l + r) >> 1; n if (valid(mid)) n fin = mid, l = mid + 1; n else n r = mid - 1; n } n cout << fin - sta + 1 << n ; n for (int i = sta; i <= fin; ++i) cout << i << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n long long p = 1000000000; n vector a; n a.resize(n); n long long fib[100]; n fib[0] = 1; n fib[1] = 1; n for (long long i = 2; i < 100; i++) fib[i] = (fib[i - 1] + fib[i - 2]) % p; n for (int i = 0; i < n; i++) cin >> a[i]; n long long t, x, y; n for (int i = 0; i < m; i++) { n cin >> t >> x >> y; n if (t == 1) { n x--; n a[x] = y; n } else { n x--; n y--; n long long res = 0; n for (long long j = 0; j + x <= y; j++) { n res += a[x + j] * fib[j]; n res = res % p; n } n cout << res << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 5555; n const int N = 205; n int col[2][M][N]; n void dfs(int p, int x, int y, int c0, int c1) { n int t = col[p ^ 1][y][c0]; n col[p][x][c0] = y; n col[p ^ 1][y][c0] = x; n if (!t) { n col[p ^ 1][y][c1] = 0; n return; n } n dfs(p ^ 1, y, t, c1, c0); n } n int n, m, k, s; n int sz[2][N], id[2][N]; n int Id[M][M], ans[M]; n int main() { n scanf( %d%d%d%d , &n, &m, &k, &s); n if (s == 1) { n puts( 0 ); n for (int i = (int)(1); i <= (int)(k); i++) printf( 1 ); n return 0; n } n int nd = 0, mx = 0; n for (int i = (int)(1); i <= (int)(n); i++) sz[0][i] = s; n for (int i = (int)(1); i <= (int)(m); i++) sz[1][i] = s; n for (int i = (int)(1); i <= (int)(k); i++) { n int x, y; n scanf( %d%d , &x, &y); n if (sz[0][x] == s) sz[0][x] = 0, id[0][x] = ++nd; n sz[0][x]++; n x = id[0][x]; n if (sz[1][y] == s) sz[1][y] = 0, id[1][y] = ++nd; n sz[1][y]++; n y = id[1][y]; n Id[x][y] = i; n int c0 = 1, c1 = 1; n for (; col[0][x][c0]; c0++) n ; n for (; col[1][y][c1]; c1++) n ; n mx = max(mx, max(c0, c1)); n if (c0 == c1) { n col[0][x][c0] = y; n col[1][y][c0] = x; n } else n dfs(0, x, y, c0, c1); n } n int mn = 0; n for (int i = (int)(1); i <= (int)(n); i++) mn += (sz[0][i] != s); n for (int i = (int)(1); i <= (int)(m); i++) mn += (sz[1][i] != s); n printf( %d n , mn); n for (int i = (int)(1); i <= (int)(nd); i++) n for (int j = (int)(1); j <= (int)(mx); j++) n if (col[0][i][j]) ans[Id[i][col[0][i][j]]] = j; n for (int i = (int)(1); i <= (int)(k); i++) printf( %d , ans[i]); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, a; n cin >> n; n long long arr[n], sum[n], ans[n]; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n sum[i] = arr[i]; n if (i > 0) sum[i] += sum[i - 1]; n } n sort(arr, arr + n); n for (int i = 0; i < n; i++) { n ans[i] = arr[i]; n if (i > 0) ans[i] += ans[i - 1]; n } n int m; n cin >> m; n for (int i = 0; i < m; i++) { n int a, b, c; n cin >> a >> b >> c; n b--; n c--; n if (a == 1) { n if (b != 0) { n cout << (sum[c] - sum[b - 1]) << endl; n } else n cout << sum[c] << endl; n } else { n if (b != 0) { n cout << (ans[c] - ans[b - 1]) << endl; n } else n cout << ans[c] << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int i, n, k; n cin >> n >> k; n for (i = 0; i < k; i++) { n if (n % 10 == 0) { n n /= 10; n } else { n n--; n } n } n cout << n << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n class BigInt { n public: n int sign; n string s; n BigInt() : s( ) {} n BigInt(string x) { *this = x; } n BigInt(int x) { *this = to_string(x); } n BigInt negative() { n BigInt x = *this; n x.sign *= -1; n return x; n } n BigInt normalize(int newSign) { n for (int a = s.size() - 1; a > 0 && s[a] == 0 ; a--) n s.erase(s.begin() + a); n sign = (s.size() == 1 && s[0] == 0 ? 1 : newSign); n return *this; n } n void operator=(string x) { n int newSign = (x[0] == - ? -1 : 1); n s = (newSign == -1 ? x.substr(1) : x); n reverse(s.begin(), s.end()); n this->normalize(newSign); n } n bool operator==(const BigInt& x) const { n return (s == x.s && sign == x.sign); n } n bool operator<(const BigInt& x) const { n if (sign != x.sign) return sign < x.sign; n if (s.size() != x.s.size()) n return (sign == 1 ? s.size() < x.s.size() : s.size() > x.s.size()); n for (int a = s.size() - 1; a >= 0; a--) n if (s[a] != x.s[a]) return (sign == 1 ? s[a] < x.s[a] : s[a] > x.s[a]); n return false; n } n bool operator<=(const BigInt& x) const { return (*this < x || *this == x); } n bool operator>(const BigInt& x) const { n return (!(*this < x) && !(*this == x)); n } n bool operator>=(const BigInt& x) const { return (*this > x || *this == x); } n BigInt operator+(BigInt x) { n BigInt curr = *this; n if (curr.sign != x.sign) return curr - x.negative(); n BigInt res; n for (int a = 0, carry = 0; a < s.size() || a < x.s.size() || carry; a++) { n carry += (a < curr.s.size() ? curr.s[a] - 0 : 0) + n (a < x.s.size() ? x.s[a] - 0 : 0); n res.s += (carry % 10 + 0 ); n carry /= 10; n } n return res.normalize(sign); n } n BigInt operator-(BigInt x) { n BigInt curr = *this; n if (curr.sign != x.sign) return curr + x.negative(); n int realSign = curr.sign; n curr.sign = x.sign = 1; n if (curr < x) return ((x - curr).negative()).normalize(-realSign); n BigInt res; n for (int a = 0, borrow = 0; a < s.size(); a++) { n borrow = (curr.s[a] - borrow - (a < x.s.size() ? x.s[a] : 0 )); n res.s += (borrow >= 0 ? borrow + 0 : borrow + 0 + 10); n borrow = (borrow >= 0 ? 0 : 1); n } n return res.normalize(realSign); n } n BigInt operator*(BigInt x) { n BigInt res( 0 ); n for (int a = 0, b = s[a] - 0 ; a < s.size(); a++, b = s[a] - 0 ) { n while (b--) res = (res + x); n x.s.insert(x.s.begin(), 0 ); n } n return res.normalize(sign * x.sign); n } n BigInt operator/(BigInt x) { n if (x.s.size() == 1 && x.s[0] == 0 ) x.s[0] /= (x.s[0] - 0 ); n BigInt temp( 0 ), res; n for (int a = 0; a < s.size(); a++) res.s += 0 ; n int newSign = sign * x.sign; n x.sign = 1; n for (int a = s.size() - 1; a >= 0; a--) { n temp.s.insert(temp.s.begin(), 0 ); n temp = temp + s.substr(a, 1); n while (!(temp < x)) { n temp = temp - x; n res.s[a]++; n } n } n return res.normalize(newSign); n } n BigInt operator%(BigInt x) { n if (x.s.size() == 1 && x.s[0] == 0 ) x.s[0] /= (x.s[0] - 0 ); n BigInt res( 0 ); n x.sign = 1; n for (int a = s.size() - 1; a >= 0; a--) { n res.s.insert(res.s.begin(), 0 ); n res = res + s.substr(a, 1); n while (!(res < x)) res = res - x; n } n return res.normalize(sign); n } n string toString() const { n string ret = s; n reverse(ret.begin(), ret.end()); n return (sign == -1 ? - : ) + ret; n } n BigInt toBase10(int base) { n BigInt exp(1), res( 0 ), BASE(base); n for (int a = 0; a < s.size(); a++) { n int curr = (s[a] < 0 || s[a] > 9 ? (toupper(s[a]) - A + 10) n : (s[a] - 0 )); n res = res + (exp * BigInt(curr)); n exp = exp * BASE; n } n return res.normalize(sign); n } n BigInt toBase10(int base, BigInt mod) { n BigInt exp(1), res( 0 ), BASE(base); n for (int a = 0; a < s.size(); a++) { n int curr = (s[a] < 0 || s[a] > 9 ? (toupper(s[a]) - A + 10) n : (s[a] - 0 )); n res = (res + ((exp * BigInt(curr) % mod)) % mod); n exp = ((exp * BASE) % mod); n } n return res.normalize(sign); n } n string convertToBase(int base) { n BigInt ZERO(0), BASE(base), x = *this; n string modes = 0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ ; n if (x == ZERO) return 0 ; n string res = ; n while (x > ZERO) { n BigInt mod = x % BASE; n x = x - mod; n if (x > ZERO) x = x / BASE; n res = modes[stoi(mod.toString())] + res; n } n return res; n } n BigInt toBase(int base) { return BigInt(this->convertToBase(base)); } n friend ostream& operator<<(ostream& os, const BigInt& x) { n os << x.toString(); n return os; n } n }; n const double EPS = (1e-5); n int dcmp(double a, double b) { return fabs(a - b) <= EPS ? 0 : a < b ? -1 : 1; } n struct line { n double a, b, c; n }; n long long binpowmod(long long a, long long b, long long m) { n a %= m; n long long res = 1; n while (b > 0) { n if (b & 1) res = res * a % m; n a = a * a % m; n b >>= 1; n } n return res; n } n long long binpow(long long a, long long b) { n long long res = 1; n while (b > 0) { n if (b & 1) res = res * a; n a = a * a; n b >>= 1; n } n return res; n } n int findXOR(int n) { n switch (n % 4) { n case 0: n return n; n case 1: n return 1; n case 2: n return n + 1; n case 3: n return 0; n } n } n int rangeXOR(int l, int r) { return (findXOR(l - 1) ^ findXOR(r)); } n int getbit(int mask, int bit) { return (mask & (1 << bit)); } n void setbit(int& mask, int bit, int val) { n if (val) n mask |= (1 << bit); n else n mask &= ~(1 << bit); n } n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } n const int N = 1e5 + 10; n const int M = 500 + 10; n const int MOD = 998244353; n const long long INF = 1e15 + 100; n void solve() { n int n; n cin >> n; n vector cnt(1e5 + 1); n for (int i = 0; i < n; ++i) { n int x; n cin >> x; n vector divisors; n int mx = 0; n for (int i = 1; i * i <= x; ++i) { n if (x % i == 0) { n if (i != 1) { n mx = max(mx, cnt[i] + 1); n divisors.push_back(i); n } n if (x / i != i) { n mx = max(mx, cnt[x / i] + 1); n divisors.push_back(x / i); n } n } n } n for (int i = 0; i < (int)divisors.size(); ++i) cnt[divisors[i]] = mx; n } n int ans = *max_element(cnt.begin(), cnt.end()); n cout << max(1, ans) << n ; n } n int main(void) { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int tc = 1; n while (tc--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int ans, n, m; n cin >> n >> m; n ans = (n * m) / 2; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n const double PI = acos(-1.0); n const double e = exp(1.0); n const int INF = 0x7fffffff; n ; n template n T gcd(T a, T b) { n return b ? gcd(b, a % b) : a; n } n template n T lcm(T a, T b) { n return a / gcd(a, b) * b; n } n template n inline T Min(T a, T b) { n return a < b ? a : b; n } n template n inline T Max(T a, T b) { n return a > b ? a : b; n } n bool cmpbig(int a, int b) { return a > b; } n bool cmpsmall(int a, int b) { return a < b; } n using namespace std; n int cnt, n; n int vis_line[110]; n int vis[110][3]; n void dfs(int j, int pos) { n if (j >= 3) { n cnt = min(cnt, pos); n return; n } n if (pos >= cnt) return; n for (int i = 0; i < n; i++) { n if (!vis_line[i]) { n vis_line[i] = 1; n dfs(j + 1, pos + vis[i][j]); n vis_line[i] = 0; n } n } n } n int main() { n int m; n while (~scanf( %d%d , &n, &m)) { n char str[110][110]; n int i, j; n memset(vis, 9999, sizeof(vis)); n memset(vis_line, 0, sizeof(vis_line)); n for (i = 0; i < n; i++) { n scanf( %s , str[i]); n for (j = 0; j < m; j++) { n if (str[i][j] >= a && str[i][j] <= z ) n vis[i][0] = min(vis[i][0], min(j, m - j)); n else if (str[i][j] <= 9 && str[i][j] >= 0 ) n vis[i][1] = min(vis[i][1], min(j, m - j)); n else n vis[i][2] = min(vis[i][2], min(j, m - j)); n } n } n cnt = INF; n dfs(0, 0); n printf( %d n , cnt); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct edge { n long long a, b, index; n long long u, v; n }; n bool compare(edge i, edge j) { n if (i.a == j.a) return i.b > j.b; n return i.a < j.a; n } n bool compare2(edge i, edge j) { return i.index < j.index; } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n long long n, m; n cin >> n >> m; n edge a[m]; n for (long long i = 0; i < m; i++) { n cin >> a[i].a >> a[i].b; n a[i].index = i; n } n long long suc = 0, unsuc = 0; n sort(a, a + m, compare); n long long u1 = 2, v1 = 3; n for (long long i = 0; i < m; i++) { n if (a[i].b == 1) { n a[i].u = 1; n a[i].v = suc + 2; n suc++; n } else { n unsuc++; n long long edges = ((suc + 1) * (suc)) / 2 - (suc); n if (edges < unsuc) { n cout << -1 << n ; n return 0; n } n a[i].u = u1; n a[i].v = v1; n if (u1 + 1 == v1) { n u1 = 2; n v1++; n } else { n u1++; n } n } n } n sort(a, a + m, compare2); n for (long long i = 0; i < m; i++) cout << a[i].u << << a[i].v << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1086; n const int MAXT = 1586; n const long long R = 1000000; n struct query { n long long ts, tl; n long double ss, sl, p; n query() {} n query(long double _ss, long double _sl, long long _ts, long long _tl, n long double _p) n : ss(_ss), sl(_sl), ts(_ts), tl(_tl), p(_p) {} n void init() { n cin >> ss >> sl >> ts >> tl >> p; n ss *= R, sl *= R; n } n } Q[MAXN]; n pair dp[MAXN][MAXT]; n inline bool cmp(const query &a, const query &b) { n return a.tl * (1 - b.p) * a.p < b.tl * (1 - a.p) * b.p; n } n void update(pair &a, n pair b) { n if (b.first > a.first || a.first == b.first && a.second > b.second) a = b; n } n int main() { n int i, j; n int m, n; n scanf( %d%d , &n, &m); n for (i = 0; i < n; ++i) Q[i].init(); n sort(Q, Q + n, cmp); n for (i = 0; i < n; ++i) n for (j = 0; j <= m; ++j) dp[i][j].first = dp[i][j].second = -1; n dp[0][0].first = dp[0][0].second = 0; n for (i = 0; i < n; ++i) { n long long ts = Q[i].ts, tl = Q[i].tl; n long double ss = Q[i].ss, sl = Q[i].sl, p = Q[i].p; n for (j = 0; j <= m; ++j) n if (dp[i][j].first != -1) { n long double cs = dp[i][j].first, cp = dp[i][j].second; n update(dp[i + 1][j], dp[i][j]); n if (j + ts <= m) n update(dp[i + 1][j + ts], n pair(cs + ss, cp + ts)); n if (j + ts + tl <= m) n update(dp[i + 1][j + ts + tl], n pair( n cs + ss + (1 - p) * sl, ts + (j + tl) * (1 - p) + p * cp)); n } n } n pair res(0, 0); n for (i = 0; i <= m; ++i) update(res, dp[n][i]); n cout << setprecision(20) << res.first / R << << res.second << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n, d; n cin >> n; n unordered_set s; n int mx = n; n int c = 0; n for (int i = 0; i < n; i++) { n cin >> d; n if (d == mx) { n for (int i = 0; i < c; i++) cout << n ; n cout << mx; n c = 0; n int k = mx - 1; n while (s.find(k) != s.end()) { n cout << << k; n s.erase(k); n k--; n } n cout << n ; n mx = k; n } else { n s.insert(d); n c++; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool a[2][100010]; n int n, q, nr, x, y; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> q; n for (int i = 1; i <= q; i++) { n cin >> x >> y; n x--; n if (a[x][y]) n nr -= a[(x + 1) % 2][y - 1] + a[(x + 1) % 2][y] + a[(x + 1) % 2][y + 1], n a[x][y] = 0; n else n nr += a[(x + 1) % 2][y - 1] + a[(x + 1) % 2][y] + a[(x + 1) % 2][y + 1], n a[x][y] = 1; n if (!nr) n cout << YES n ; n else n cout << NO n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n double n, h; n char c[10]; n double ans; n double ksm(double x, long long y) { n double maretu = 1.0; n for (; y; y >>= 1) { n if (y & 1) { n maretu *= x; n } n x *= x; n } n return maretu; n } n int main() { n scanf( %s , c); n if (c[0] == A ) { n scanf( %lf%lf , &n, &h); n ans = n; n for (double i = 1; i <= h; ++i) { n for (double j = 1; j <= n; ++j) { n ans += n (n - j) * (1.0 / (double)(1LL << (long long)(2 * i))) * n ksm(1.0 - (1.0 / (double)(1LL << (long long)i)), n (long long)(j - 1.0)) * n ((double)(1LL << ((long long)i)) - n (double)(1LL << (long long)(i - 1)) * n (1.0 + (j - 1.0) / ((double)(1LL << (long long)(i)) - 1.0))); n } n } n printf( %.10lf , ans); n } else { n scanf( %lf%lf , &n, &h); n printf( %lf , n); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, t, cont[8] = {0}, i; n cin >> n; n for (int i = 0; i < n && cin >> t; i++) cont[t]++; n if (cont[1] != n / 3 || cont[5] + cont[7] || cont[4] > cont[2] || n cont[3] > cont[6] || cont[2] + cont[3] != cont[4] + cont[6]) n cout << -1; n else { n for (i = 0; i < cont[3]; i++) cout << 1 << << 3 << << 6 << endl; n for (i = 0; i < cont[4]; i++) cout << 1 << << 2 << << 4 << endl; n for (i = 0; i < cont[2] - cont[4]; i++) n cout << 1 << << 2 << << 6 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxm = 2e5 + 5; n vector g[maxm]; n long long mark[maxm]; n long long p[maxm]; n long long c[maxm]; n long long ans; n long long n; n void solve(long long x) { n vector s; n while (!mark[x]) { n s.push_back(x); n mark[x] = 1; n x = p[x]; n } n long long len = s.size(); n for (long long i = 1; i <= len; i++) { n if (len % i == 0) { n for (long long j = 0; j < i; j++) { n long long ok = 1; n for (long long k = j; k + i < len; k += i) { n if (c[s[k]] != c[s[k + i]]) { n ok = 0; n break; n } n } n if (ok) { n ans = min(ans, i); n return; n } n } n } n } n } n signed main() { n long long T; n cin >> T; n while (T--) { n cin >> n; n ans = n; n for (long long i = 1; i <= n; i++) cin >> p[i]; n for (long long i = 1; i <= n; i++) cin >> c[i]; n for (long long i = 1; i <= n; i++) mark[i] = 0; n for (long long i = 1; i <= n; i++) n if (!mark[i]) solve(i); n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n int n = s.size(); n int pref = 0; n int kol = 0; n for (int i = 0; i < n; i++) { n if (s[i] == # ) kol++; n if (s[i] == ( ) n pref++; n else n pref--; n if (pref < 0) { n cout << -1 ; n return 0; n } n } n string t; n int sz = 0; n int r = 0; n while (sz < kol) { n if (s[r] == # ) { n sz++; n t += ) ; n if (sz == kol) { n for (int j = 0; j < pref; j++) t += ) ; n } n } else { n t += s[r]; n } n r++; n } n while (r < n) { n t += s[r]; n r++; n } n n = t.size(); n int preff = 0; n for (int i = 0; i < n; i++) { n if (t[i] == ( ) n preff++; n else n preff--; n if (preff < 0) { n cout << -1 ; n return 0; n } n } n for (int i = 0; i < kol - 1; i++) { n cout << 1 << endl; n } n cout << pref + 1; n } n "} +{"func_code_string": "#include n using namespace std; n map dist; n int main() { n long long n, m; n cin >> n >> m; n long long x; n queue q; n for (long long i = 0; i < n; i++) { n cin >> x; n dist[x] = 0; n q.push(x); n } n long long total = 0; n vector ans; n while (!q.empty()) { n x = q.front(); n q.pop(); n if (dist[x] != 0) { n ans.push_back(x); n total += (dist[x]); n if (ans.size() == m) break; n } n if (dist.find(x - 1) == dist.end()) { n q.push(x - 1); n dist[x - 1] = dist[x] + 1; n } n if (dist.find(x + 1) == dist.end()) { n q.push(x + 1); n dist[x + 1] = dist[x] + 1; n } n } n cout << total << n ; n for (long long i = 0; i < ans.size(); i++) { n cout << ans[i] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, A, B; n long long toi(string s) { n istringstream is(s); n long long x; n is >> x; n return x; n } n string tos(long long t) { n stringstream st; n st << t; n return st.str(); n } n long long F[1000005], FP[1000005]; n bool f(long long x) { n while (x > 0) { n if (x % 10 != A && x % 10 != B) return 0; n x /= 10; n } n return 1; n } n long long pow(long long a, long long b, long long c) { n long long x = 1, y = a; n while (b > 0) { n if (b & 1) x = (x * y) % c; n y = (y * y) % c; n b >>= 1; n } n return x; n } n int main() { n F[0] = 1; n for (int i = 1; i < 1000005; ++i) { n F[i] = i * F[i - 1]; n if (F[i] >= 1000000007) F[i] %= 1000000007; n } n FP[1000005 - 1] = pow(F[1000005 - 1], 1000000007 - 2, 1000000007); n for (int i = 1000005 - 2; i >= 0; --i) { n FP[i] = FP[i + 1] * (i + 1); n if (FP[i] >= 1000000007) FP[i] %= 1000000007; n } n while (cin >> A >> B >> n) { n long long cnt = 0; n for (int i = 0; i <= n; ++i) n if (f(i * A + (n - i) * B)) { n long long num = F[n], den = FP[i] * FP[n - i]; n if (den >= 1000000007) den %= 1000000007; n num *= den; n if (num >= 1000000007) num %= 1000000007; n cnt += num; n if (cnt >= 1000000007) cnt -= 1000000007; n } n cout << cnt << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n class qry { n public: n int l, r, idx; n qry(int l, int r, int idx) : l(l), r(r), idx(idx) {} n }; n int a[500001], n, m, res[500001]; n vector q; n int getans(vector b) { n int res = 0; n for (int i = 0; i < b.size(); i++) { n if ((res ^ b[i]) > res) res ^= b[i]; n } n return res; n } n void ins(vector& b, int x) { n for (int i = 0; i < b.size(); i++) { n if ((b[i] ^ x) < x) x ^= b[i]; n } n if (!x) return; n int t = 31 - __builtin_clz(x); n for (int i = 0; i < b.size(); i++) { n if (b[i] & (1 << t)) b[i] ^= x; n } n b.push_back(x); n } n vector merge(vector& a, vector& b) { n vector ret = a; n for (int i = 0; i < b.size(); i++) ins(ret, b[i]); n return ret; n } n void solve(vector& q, int L, int R) { n if (q.empty()) return; n if (q.size() <= 3 || R - L <= 3) { n for (int i = 0; i < q.size(); i++) { n int l = q[i].l, r = q[i].r; n vector bs; n for (int j = l; j <= r; j++) ins(bs, a[j]); n res[q[i].idx] = getans(bs); n } n return; n } n vector l, r, my; n int mid = (L + R) / 2; n for (int i = 0; i < q.size(); i++) { n if (q[i].r <= mid) n l.push_back(q[i]); n else if (q[i].l >= mid + 1) n r.push_back(q[i]); n else n my.push_back(q[i]); n } n solve(l, L, mid); n solve(r, mid + 1, R); n sort(my.begin(), my.end(), [](const qry& i, const qry& j) { n if (i.l != j.l) n return i.l > j.l; n else n return i.r < j.r; n }); n vector lb; n int cur = 0, pt = mid; n vector > rb; n vector t; n for (int i = mid + 1; i <= R; i++) { n ins(t, a[i]); n rb.push_back(t); n } n while (cur < my.size()) { n bool found = false; n while (my[cur].l <= pt) { n found = true; n ins(lb, a[pt--]); n } n res[my[cur].idx] = getans(merge(lb, rb[my[cur].r - mid - 1])); n cur++; n } n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n scanf( %d , &m); n for (int i = 1; i <= m; i++) { n int l, r; n scanf( %d %d , &l, &r); n q.push_back(qry(l, r, i)); n } n solve(q, 1, n); n for (int i = 1; i <= m; i++) printf( %d n , res[i]); n return 0; n } n "} +{"func_code_string": "#include n int main(int argc, const char* argv[]) { n int n, k; n scanf( %d%d , &n, &k); n if (k > n / 2) k = n / 2; n printf( %I64d n , k * (2 * n - 2 * k - 1ll)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1005, MAXM = 200005; n int n, m, q, f[MAXN][MAXN], head[MAXM], nxt[MAXM], x[MAXM], y[MAXM]; n struct Q { n int l, r, s, t; n } s[MAXM]; n bool ans[MAXM]; n int main() { n scanf( %d%d%d , &n, &m, &q); n for (register int i = 1; i <= m; ++i) scanf( %d%d , x + i, y + i); n for (register int i = 1; i <= q; ++i) { n scanf( %d%d%d%d , &s[i].l, &s[i].r, &s[i].s, &s[i].t); n nxt[i] = head[s[i].r]; n head[s[i].r] = i; n } n for (register int u, v, k = 1; k <= m; ++k) { n u = x[k]; n v = y[k]; n f[u][v] = f[v][u] = k; n for (register int i = 1; i <= n; ++i) n f[u][i] = f[v][i] = max(f[u][i], f[v][i]); n for (register int i = head[k]; i; i = nxt[i]) n ans[i] = s[i].l <= f[s[i].t][s[i].s]; n } n for (register int i = 1; i <= q; ++i) puts(ans[i] ? Yes : No ); n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = (int)1e9; n const long long int INF = (long long int)1e18; n const int N = 100005; n const long long int MOD = 1000000007; n const double EPS = 1e-7; n const double PI = acos(-1.0); n const int dx[] = {+1, -1, +0, +0}; n const int dy[] = {+0, +0, +1, -1}; n const int hx[] = {-2, -2, -1, -1, +1, +1, +2, +2}; n const int hy[] = {+1, -1, +2, -2, +2, -2, +1, -1}; n const int fx[] = {-1, +0, +1, +0, +1, +1, -1, -1, +0}; n const int fy[] = {+0, -1, +0, +1, +1, -1, +1, -1, +0}; n template n inline T GCD(T a, T b) { n a = abs(a), b = abs(b); n return !b ? a : GCD(b, a % b); n } n template n inline T LCM(T x, T y) { n T g = GCD(x, y); n return x * y / g; n } n template n inline T BigMod(T b, T p, T mod) { n T res = 1 % mod, x = b % mod; n while (p) { n if (p & 1) res = (res * x) % mod; n x = (x * x) % mod; n p >>= 1; n } n return res; n } n template n inline T ModInv(T val, T mod) { n return BigMod(val, mod - 2, mod); n } n template n inline T bigmod(T b, T p, T mod) { n if (p == 0) return 1; n T x = bigmod(b, p / 2, mod); n x = (x * x) % mod; n if (p % 2 == 1) x = (b * x) % mod; n return x; n } n template n inline T NumDigit(T num, T base) { n return ((T)(log10((num)) / log10((base)))) + 1; n } n template n inline T Power(T b, T p) { n T res = 1, x = b; n while (p) { n if (p & 1) res = (res * x); n x = (x * x); n p >>= 1; n } n return res; n } n template n inline T IsPrime(T x) { n if (x < 2) return false; n for (T i = 2; i * i <= x; i++) { n if (x % i == 0) return false; n } n return true; n } n template n inline T SumDigit(T x) { n T ret = 0; n while (x) { n ret += x % 10, x /= 10; n } n return ret; n } n int main(int argc, char const *argv[]) { n int n; n scanf( %d , &n); n for (int i = 0; i * 4 <= n; i++) { n for (int j = 0; i * 4 + j * 7 <= n; j++) { n if (4 * i + j * 7 == n) { n for (int m = 1; m <= i; m++) printf( 4 ); n for (int m = 1; m <= j; m++) printf( 7 ); n return 0; n } n } n } n printf( -1 n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n set E[100005]; n vector L[100005]; n int True = 0; n int vst[100005]; n int main() { n int n, m, h, t, i, u, v, _h, _t, j, k; n cin >> n >> m >> h >> t; n for (i = 0; i < (m); i++) { n scanf( %d%d , &u, &v); n L[u].push_back(v); n L[v].push_back(u); n E[u].insert(v); n E[v].insert(u); n } n for (i = (1); i <= (n); i++) { n u = i; n if (((int)(E[u]).size()) < h + 1) continue; n for (j = 0; j < (((int)(L[i]).size())); j++) { n v = L[i][j]; n if (((int)(E[u]).size()) + ((int)(E[v]).size()) < h + t + 2) continue; n if (((int)(E[v]).size()) < t + 1) continue; n bool sp = 0; n if (((int)(E[u]).size()) > ((int)(E[v]).size())) { n swap(u, v); n sp = 1; n } n set::iterator it = E[u].begin(); n _h = 0; n vector cmn; n True++; n for (k = 0; k < (((int)(L[u]).size())); k++) vst[L[u][k]] = True; n for (k = 0; k < (((int)(L[v]).size())); k++) { n if (vst[L[v][k]] == True) { n _h++; n cmn.push_back(L[v][k]); n } n } n if (sp) swap(u, v); n if (((int)(E[u]).size()) + ((int)(E[v]).size()) - _h < h + t + 2) n continue; n printf( YES n ); n printf( %d %d n , u, v); n it = E[u].begin(); n while (it != E[u].end()) { n if (E[v].find(*it) == E[v].end()) { n if (*it == v) { n it++; n continue; n } n h--; n printf( %d , *it); n } n if (!h) break; n it++; n } n while (h--) { n printf( %d , cmn[((int)(cmn).size()) - 1]); n cmn.pop_back(); n } n printf( n ); n it = E[v].begin(); n while (it != E[v].end()) { n if ((E[u].find(*it) == E[u].end())) { n if (*it == u) { n it++; n continue; n } n t--; n printf( %d , *it); n } n if (!t) break; n it++; n } n while (t--) { n printf( %d , cmn[((int)(cmn).size()) - 1]); n cmn.pop_back(); n } n printf( n ); n return 0; n } n } n printf( NO n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const int mod2 = 1e9 + 9; n inline int pow_(long long a, int n, int p = mod) { n int r = 1; n while (n) { n if (n & 1) r = r * a % p; n n >>= 1; n a = a * a % p; n } n return r; n } n int main(void) { n int n, l; n long long s; n cin >> n >> l >> s; n int w[n + 1], p[n + 1]; n memset(p, 0, sizeof(p)); n memset(w, 0, sizeof(w)); n for (int i = 1; i <= n; i++) cin >> w[i]; n for (int i = 2; i <= n; i++) cin >> p[i]; n bool done[n + 1]; n memset(done, false, sizeof(done)); n for (int i = 1; i <= n; i++) n if (w[i] > s) return 0 * printf( -1 n ); n int ans = 0; n for (int i = n; i >= 1; i--) { n if (done[i]) continue; n ans++; n int cur = i; n int L = l; n long long S = s; n while (cur and L > 0 and S >= w[cur]) { n done[cur] = true; n S -= w[cur]; n L--; n cur = p[cur]; n } n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int x, y, n, m, i, k, ans; n string s[30], s1[30]; n int main() { n cin >> n >> m; n for (i = 0; i < n; i++) { n cin >> s[i]; n } n for (i = 0; i < m; i++) { n cin >> s1[i]; n } n cin >> k; n for (i = 0; i < k; i++) { n cin >> x; n if (x % n == 0) n cout << s[n - 1]; n else n cout << s[x % n - 1]; n if (x % m == 0) n cout << s1[m - 1]; n else n cout << s1[x % m - 1]; n cout << endl; n } n } n "} +{"func_code_string": "#include n const int MAXN = 1e9 + 7; n const int INF = 1e9 + 7; n const signed long long MOD = 1e9 + 7; n using namespace std; n bool comp1(signed long long a, signed long long b) { return (sin(a) < sin(b)); } n signed long long binpow(signed long long a, signed long long b) { n signed long long res = 1; n while (b) { n if (b & 1) res = (res * a); n a = (a * a); n b >>= 1; n } n return res; n } n signed long long phi(signed long long n) { n signed long long result = n; n for (signed long long i = 2; i * i <= n; ++i) n if (n % i == 0) { n while (n % i == 0) n /= i; n result -= result / i; n } n if (n > 1) result -= result / n; n return result; n } n signed long long gcd(signed long long a, signed long long b) { n if (a == 0) return b; n return gcd(b % a, a); n } n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int t; n cin >> t; n for (size_t jj = 0; jj < t; jj++) { n signed long long n, k; n cin >> n >> k; n vector mas(n); n signed long long mx = -1e9 - 47; n for (size_t i = 0; i < n; i++) { n cin >> mas[i]; n mx = max(mx, mas[i]); n } n signed long long mx1 = -1e9 - 47; n for (size_t i = 0; i < n; i++) { n mas[i] = mx - mas[i]; n mx1 = max(mx1, mas[i]); n } n k--; n if (k % 2) { n for (size_t i = 0; i < n; i++) { n mas[i] = mx1 - mas[i]; n } n } n for (size_t i = 0; i < n; i++) { n cout << mas[i] << ; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector > ans; n bool is_prime(int v) { n if (v == 1 || v == 0) return 0; n for (int i = 2; i * i <= v; i++) { n if (v % i == 0) return 0; n } n return 1; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long n; n cin >> n; n long long cnt = n - 1; n ans.push_back(make_pair(n, 1)); n for (int i = 2; i <= n; i++) { n ans.push_back(make_pair(i, i - 1)); n } n for (int i = 1; i <= n / 2; i++) { n if (is_prime(ans.size())) break; n ans.push_back(make_pair(i, i + n / 2)); n ++cnt; n } n cout << ans.size() << endl; n for (int i = 0; i < ans.size(); i++) { n cout << ans[i].first << << ans[i].second << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e9 + 7; n const int N = 3e5 + 10; n int flag[N]; n set s[N]; n int a[N]; n int pos[N]; n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n pos[a[i]] = i; n } n while (m--) { n int x, y; n scanf( %d%d , &x, &y); n if (x == a[n]) continue; n if (y == a[n]) { n flag[x] = 1; n } n s[x].emplace(y); n } n int ans = n; n for (int i = n - 1; i > 0; i--) { n if (flag[a[i]]) { n int cnt = 0; n for (auto& x : s[a[i]]) { n if (pos[x] < i) continue; n if (pos[x] >= ans) continue; n cnt++; n } n if (cnt != ans - i - 1) n flag[a[i]] = 0; n else { n for (int j = i; j < ans; j++) { n int x = a[j], y = a[j + 1]; n swap(a[j], a[j + 1]); n swap(pos[x], pos[y]); n } n ans--; n } n } n } n printf( %d n , n - ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 rd(time(0)); n vector v(100010), val(100010), con[100010], st(100010, 0), n en(100010, 0), d(100010, 0); n pair t[20][100010]; n long long cur = 0; n void dfs(long long node, long long par, long long dep) { n st[node] = ++cur; n d[st[node]] = dep; n for (auto i : con[node]) { n if (i != par) dfs(i, node, dep + 1); n } n en[node] = cur; n } n void build(long long c, long long l, long long r) { n if (l == r) n t[c][l] = {d[l], val[l]}; n else { n long long mid = (l + r) / 2; n build(c + 1, l, mid); n build(c + 1, mid + 1, r); n long long i = l, j = mid + 1, k = l; n while (i <= mid && j <= r) { n if (t[c + 1][i].first < t[c + 1][j].first) n t[c][k++] = t[c + 1][i++]; n else n t[c][k++] = t[c + 1][j++]; n } n while (i <= mid) t[c][k++] = t[c + 1][i++]; n while (j <= r) t[c][k++] = t[c + 1][j++]; n for (i = l + 1; i <= r; i++) n t[c][i].second = min(t[c][i].second, t[c][i - 1].second); n } n } n long long query(long long c, long long l, long long r, long long l1, n long long r1, long long k) { n if (r1 < l || l1 > r) return 1000000007; n if (l >= l1 && r <= r1) { n pair temp = {k, 1000000007}; n long long w = upper_bound(t[c] + l, t[c] + r + 1, temp) - (t[c]); n if (w == l) return 1000000007; n return t[c][w - 1].second; n } else { n long long mid = (l + r) / 2; n return min(query(c + 1, l, mid, l1, r1, k), n query(c + 1, mid + 1, r, l1, r1, k)); n } n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n, r, m, l, x, k; n cin >> n >> r; n for (long long i = 1; i < n + 1; i++) cin >> v[i]; n for (long long i = 0; i < n - 1; i++) { n long long u, v; n cin >> u >> v; n con[u].push_back(v); n con[v].push_back(u); n } n dfs(r, -1, 0); n for (long long i = 1; i <= n; i++) val[st[i]] = v[i]; n build(1, 1, cur); n cin >> m; n l = 0; n while (m--) { n cin >> x >> k; n x = (x + l) % n + 1; n k = (k + l) % n; n l = query(1, 1, cur, st[x], en[x], k + d[st[x]]); n cout << l << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct edge { n short to, cap, rev; n edge(int _a = 0, int _b = 0, int _c = 0) { n to = _a; n cap = _b; n rev = _c; n } n }; n int S, T; n int dist[30010]; n int cur[30010]; n vector adj[30010]; n int q[30010]; n int hd, tl; n inline void addedge(int u, int v, int cap) { n adj[u].push_back(edge(v, cap, adj[v].size())); n adj[v].push_back(edge(u, 0, adj[u].size() - 1)); n } n int dfs(int i, short fl) { n if (i == T) return fl; n short lf = fl; n for (int &j = cur[i]; ~j; --j) { n edge &e = adj[i][j]; n if (e.cap && dist[e.to] == dist[i] + 1) { n short d = dfs(e.to, min(lf, e.cap)); n e.cap -= d; n adj[e.to][e.rev].cap += d; n lf -= d; n if (!lf) return fl; n } n } n dist[i] = -1; n return fl - lf; n } n int Dinic() { n int res = 0; n while (true) { n memset(dist, 0, sizeof(dist)); n dist[q[hd = tl = 0] = S] = 1; n while (hd <= tl) { n int i = q[hd++]; n cur[i] = adj[i].size() - 1; n for (int j = cur[i]; ~j; --j) { n edge &e = adj[i][j]; n if (e.cap && !dist[e.to]) { n dist[e.to] = dist[i] + 1; n q[++tl] = e.to; n } n } n } n if (!dist[T]) break; n int fl; n while (fl = dfs(S, 10000)) res += fl; n } n return res; n } n int bel[5010]; n int tpe[5010]; n int main(void) { n int n, m; n scanf( %d%d , &n, &m); n S = 0; n T = 30000; n vector, int> > v; n for (int i = 1; i <= 8191; ++i) { n addedge(n + i, n + (i << 1), 10000); n addedge(n + i, n + (i << 1 | 1), 10000); n } n for (int i = 1; i <= n; ++i) { n int a, b, c; n scanf( %d%d , &tpe[i], &a); n switch (tpe[i]) { n case 0: { n while (a--) { n scanf( %d , &b); n addedge(i, b + 8191 + n, 1); n } n break; n } n case 1: { n scanf( %d , &b); n v.push_back(make_pair(make_pair(a, b), i)); n int l = a + 8191, r = b + 8191; n while (l <= r) { n if (l & 1) addedge(i, n + l, 1), l++; n if (!(r & 1)) addedge(i, n + r, 1), r--; n l >>= 1; n r >>= 1; n } n break; n } n case 2: { n scanf( %d%d , &b, &c); n addedge(i, a + 8191 + n, 1); n addedge(i, b + 8191 + n, 1); n addedge(i, c + 8191 + n, 1); n break; n } n } n } n sort(v.begin(), v.end()); n for (int i = 1; i <= n; ++i) { n if (tpe[i] != 2) { n addedge(S, i, 1); n } n } n for (int i = 1; i <= n; ++i) { n if (tpe[i] == 2) { n addedge(S, i, 2); n } n } n for (int i = 1; i <= m; ++i) { n addedge(n + 8191 + i, T, 1); n } n printf( %d n , Dinic()); n for (int i = 1; i <= m; ++i) { n for (int j = adj[i + 8191 + n].size() - 1; ~j; --j) { n edge &e = adj[i + 8191 + n][j]; n if (e.cap && e.to != T) { n bel[i] = e.to; n } n } n } n multiset, int> > s; n int pnt = 0, vs = v.size(); n for (int i = 1; i <= m; ++i) { n if (bel[i] <= n && tpe[bel[i]] != 1) continue; n while (pnt < vs && v[pnt].first.first <= i) { n s.insert(make_pair(make_pair(v[pnt].first.second, v[pnt].first.first), n v[pnt].second)); n ++pnt; n } n while (!s.empty() && s.begin()->first.first < i) s.erase(s.begin()); n if (!s.empty()) bel[i] = s.begin()->second, s.erase(s.begin()); n } n for (int i = 1; i <= m; ++i) { n if (bel[i]) printf( %d %d n , bel[i], i); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ld = long double; n template n ostream &operator<<(ostream &os, const pair v) { n os << ( << v.first << , << v.second << ) ; n return os; n } n template n ostream &operator<<(ostream &os, const vector &v) { n for (int i = 0; i < v.size(); i++) { n if (i > 0) { n os << ; n } n os << v[i]; n } n return os; n } n template n ostream &operator<<(ostream &os, const vector> &v) { n for (int i = 0; i < v.size(); i++) { n if (i > 0) { n os << endl; n } n os << v[i]; n } n return os; n } n template n ostream &operator<<(ostream &os, const vector> &v) { n for (int i = 0; i < v.size(); i++) { n if (i > 0) { n os << endl; n } n os << v[i]; n } n return os; n } n template n ostream &operator<<(ostream &os, const set &v) { n int i = 0; n for (auto it : v) { n if (i > 0) { n os << ; n } n os << it; n i++; n } n return os; n } n using Graph = vector>; n const ll MAX_S = 2e5; n vector check(vector &x) { n vector anss(x.size()); n for (int i = 0; i < int(x.size()) - 1; ++i) { n anss[i + 1] = x[i + 1] - x[i]; n } n anss[0] = x[0]; n return anss; n } n using Value = ll; n const Value ini = ll(1e18); n Value connect(Value al, const Value ar) { return min(al, ar); } n Value dat[1100001]; n struct segtree { n int N; n segtree() {} n segtree(int n) { n N = 1; n while (N < n) N *= 2; n for (int x = 0; x < N; ++x) { n dat[x + N - 1] = ini; n } n for (int x = N - 2; x >= 0; --x) { n dat[x] = connect(dat[x * 2 + 1], dat[x * 2 + 2]); n } n } n void update(int k, const Value &a) { n k += N - 1; n dat[k] = a; n while (k > 0) { n k = (k - 1) >> 1; n dat[k] = connect(dat[k * 2 + 1], dat[k * 2 + 2]); n } n } n Value query(int a, int b) { return query(a, b, 0, 0, N); } n Value query(int a, int b, int k, int l, int r) { n if (r <= a || b <= l) return ini; n if (a <= l && r <= b) return dat[k]; n const int m = (l + r) / 2; n return connect(query(a, b, k * 2 + 1, l, m), query(a, b, k * 2 + 2, m, r)); n } n }; n vector nums(int(3e5)); n ll to_n(string st) { n ll num = 0; n for (auto c : st) { n num *= 2; n num += c - 0 ; n } n return num; n } n string to_s(int sz, ll num) { n string st; n for (int i = 0; i < sz; ++i) { n st.push_back( 0 + (num % 2)); n num /= 2; n } n reverse(st.begin(), st.end()); n return st; n } n const int mod = 998244353; n struct Mod { n public: n int num; n Mod() : Mod(0) { ; } n Mod(long long int n) : num((n % mod + mod) % mod) {} n Mod(int n) : Mod(static_cast(n)) { ; } n operator int() { return num; } n }; n Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); } n Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; } n Mod operator+(const Mod a, const long long int b) { return b + a; } n Mod operator++(Mod &a) { return a + Mod(1); } n Mod operator-(const Mod a, const Mod b) { n return Mod((mod + a.num - b.num) % mod); n } n Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; } n Mod operator--(Mod &a) { return a - Mod(1); } n Mod operator*(const Mod a, const Mod b) { n return Mod(((long long)a.num * b.num) % mod); n } n Mod operator*(const long long int a, const Mod b) { return Mod(a) * b; } n Mod operator*(const Mod a, const long long int b) { return Mod(b) * a; } n Mod operator*(const Mod a, const int b) { return Mod(b) * a; } n Mod operator+=(Mod &a, const Mod b) { return a = a + b; } n Mod operator+=(long long int &a, const Mod b) { return a = a + b; } n Mod operator-=(Mod &a, const Mod b) { return a = a - b; } n Mod operator-=(long long int &a, const Mod b) { return a = a - b; } n Mod operator*=(Mod &a, const Mod b) { return a = a * b; } n Mod operator*=(long long int &a, const Mod b) { return a = a * b; } n Mod operator*=(Mod &a, const long long int &b) { return a = a * b; } n Mod operator^(const Mod a, const int n) { n if (n == 0) return Mod(1); n Mod res = (a * a) ^ (n / 2); n if (n % 2) res = res * a; n return res; n } n Mod mod_pow(const Mod a, const long long n) { n if (n == 0) return Mod(1); n Mod res = mod_pow((a * a), (n / 2)); n if (n % 2) res = res * a; n return res; n } n Mod inv(const Mod a) { return a ^ (mod - 2); } n Mod operator/(const Mod a, const Mod b) { n assert(b.num != 0); n return a * inv(b); n } n Mod operator/(const long long int a, const Mod b) { return Mod(a) / b; } n Mod operator/=(Mod &a, const Mod b) { return a = a / b; } n Mod fact[1024000], factinv[1024000]; n void init(const int amax = 1024000) { n fact[0] = Mod(1); n factinv[0] = 1; n for (int i = 0; i < amax - 1; ++i) { n fact[i + 1] = fact[i] * Mod(i + 1); n factinv[i + 1] = factinv[i] / Mod(i + 1); n } n } n Mod comb(const int a, const int b) { n return fact[a] * factinv[b] * factinv[a - b]; n } n int main() { n int N; n cin >> N; n vector pers(int(1e6)); n vector cnts(int(1e6)); n for (int i = 0; i < N; ++i) { n int k; n scanf( %d , &k); n for (int j = 0; j < k; ++j) { n int a; n scanf( %d , &a); n a--; n cnts[a]++; n pers[a] += Mod(1) / Mod(N) / Mod(k); n } n } n Mod answer = Mod(0); n for (int i = 0; i < int(1e6); ++i) { n answer += pers[i] * Mod(cnts[i]) / Mod(N); n } n cout << answer.num << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void print(T v) { n cout << v << n ; n } n template n void print(vector a) { n for (int i = 0; i < a.size(); i++) { n cout << a[i] << ; n } n cout << n ; n } n long long help(long long a, long long b, long long x, long long y, n long long n) { n long long da = min(n, a - x); n a -= da; n n -= da; n long long db = min(n, b - y); n b -= db; n return a * b; n } n void solve() { n long long a, b, x, y, n; n cin >> a >> b >> x >> y >> n; n print(min(help(a, b, x, y, n), help(b, a, y, x, n))); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n char ch[201][201]; n int main() { n cin >> m >> n; n n *= 2; n m *= 2; n for (int i = 1; i <= n; i += 2) n for (int j = 1; j <= m; j += 2) { n cin >> ch[i][j]; n ch[i + 1][j] = ch[i][j + 1] = ch[i + 1][j + 1] = ch[i][j]; n } n for (int j = 1; j <= m; j++) { n for (int i = 1; i <= n; i++) cout << ch[i][j]; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n int n; n int arr[26]; n int arr2[26]; n cin >> s; n int value; n int sum = 0; n int add; n int length = s.size(); n cin >> n; n for (int i = 0; i < 26; i++) { n cin >> arr[i]; n arr2[i] = arr[i]; n } n sort(arr2, arr2 + 26); n int largest = arr2[25]; n for (int i = 0; i < length; i++) { n value = s[i]; n int x = abs(97 - value); n sum = sum + ((i + 1) * arr[x]); n } n int last = length + n; n int sum1 = 0; n for (int i = length + 1; i <= last; i++) { n sum1 = sum1 + (i * largest); n } n cout << sum1 + sum; n } n "} +{"func_code_string": "#include n using namespace std; n template n std::istream& operator>>(std::istream& i, pair& p) { n i >> p.first >> p.second; n return i; n } n template n std::istream& operator>>(std::istream& i, vector& t) { n for (auto& v : t) { n i >> v; n } n return i; n } n template n std::ostream& operator<<(std::ostream& o, const pair& p) { n o << p.first << << p.second; n return o; n } n template n std::ostream& operator<<(std::ostream& o, const vector& t) { n if (t.empty()) o << n ; n for (size_t i = 0; i < t.size(); ++i) { n o << t[i] << n [i == t.size() - 1]; n } n return o; n } n template n using minheap = priority_queue, greater>; n template n using maxheap = priority_queue, less>; n template n bool in(T a, T b, T c) { n return a <= b && b < c; n } n unsigned int logceil(int first) { n return first ? 8 * sizeof(int) - __builtin_clz(first) : 0; n } n namespace std { n template n struct hash> { n hash t; n hash u; n size_t operator()(const pair& p) const { n return t(p.first) ^ (u(p.second) << 7); n } n }; n } // namespace std n template n T bsh(T l, T h, const F& f) { n T r = -1, m; n while (l <= h) { n m = (l + h) / 2; n if (f(m)) { n l = m + 1; n r = m; n } else { n h = m - 1; n } n } n return r; n } n template n double bshd(double l, double h, const F& f, double p = 1e-9) { n unsigned int r = 3 + (unsigned int)log2((h - l) / p); n while (r--) { n double m = (l + h) / 2; n if (f(m)) { n l = m; n } else { n h = m; n } n } n return (l + h) / 2; n } n template n T bsl(T l, T h, const F& f) { n T r = -1, m; n while (l <= h) { n m = (l + h) / 2; n if (f(m)) { n h = m - 1; n r = m; n } else { n l = m + 1; n } n } n return r; n } n template n double bsld(double l, double h, const F& f, double p = 1e-9) { n unsigned int r = 3 + (unsigned int)log2((h - l) / p); n while (r--) { n double m = (l + h) / 2; n if (f(m)) { n h = m; n } else { n l = m; n } n } n return (l + h) / 2; n } n template n T gcd(T a, T b) { n if (a < b) swap(a, b); n return b ? gcd(b, a % b) : a; n } n template n class vector2 : public vector> { n public: n vector2() {} n vector2(size_t a, size_t b, T t = T()) n : vector>(a, vector(b, t)) {} n }; n template n class vector3 : public vector> { n public: n vector3() {} n vector3(size_t a, size_t b, size_t c, T t = T()) n : vector>(a, vector2(b, c, t)) {} n }; n template n class vector4 : public vector> { n public: n vector4() {} n vector4(size_t a, size_t b, size_t c, size_t d, T t = T()) n : vector>(a, vector3(b, c, d, t)) {} n }; n template n class vector5 : public vector> { n public: n vector5() {} n vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T()) n : vector>(a, vector4(b, c, d, e, t)) {} n }; n class TaskD { n public: n vector P; n void fact(int a, vector& f) { n while (a != 1) { n int b = P[a], c = 0; n while (P[a] == b) { n c++; n a /= b; n } n f.push_back(c + 1); n } n sort(f.begin(), f.end()); n reverse(f.begin(), f.end()); n while (f.size() < Prm.size()) f.push_back(1); n } n vector> HH; n vector Used, CNT; n map, int> J; n vector X; n void genAll(int p, int m, int c, int d) { n if (p == Prm.size()) { n HH.push_back(X); n CNT.push_back(d); n int second = J.size(); n if (c <= 1e6) Used.push_back(second); n J[X] = second; n } else { n X[p] = 1; n genAll(p + 1, 1, c, d * X[p]); n while (true) { n X[p]++; n c *= Prm[p]; n if (c > 55050240) return; n if (X[p] > m) return; n genAll(p + 1, X[p], c, d * X[p]); n } n } n } n vector Prm; n void solve(istream& cin, ostream& cout) { n Prm = {2, 3, 5, 7, 11, 13, 17}; n P.assign(1e6 + 5, 0); n for (int i = 2; i < 1e6 + 3; ++i) { n if (P[i] == 0) { n for (int j = i; j < 1e6 + 3; j += i) P[j] = i; n } n } n map, int> IDX{ n {{1, 1, 1, 1, 1, 1, 1}, 0}, {{2, 1, 1, 1, 1, 1, 1}, 1}, n {{2, 2, 1, 1, 1, 1, 1}, 2}, {{2, 2, 2, 1, 1, 1, 1}, 3}, n {{2, 2, 2, 2, 1, 1, 1}, 4}, {{2, 2, 2, 2, 2, 1, 1}, 5}, n {{2, 2, 2, 2, 2, 2, 1}, 6}, {{2, 2, 2, 2, 2, 2, 2}, 7}, n {{3, 1, 1, 1, 1, 1, 1}, 8}, {{3, 2, 1, 1, 1, 1, 1}, 9}, n {{3, 2, 2, 1, 1, 1, 1}, 10}, {{3, 2, 2, 2, 1, 1, 1}, 11}, n {{3, 2, 2, 2, 2, 1, 1}, 12}, {{3, 2, 2, 2, 2, 2, 1}, 13}, n {{3, 3, 1, 1, 1, 1, 1}, 14}, {{3, 3, 2, 1, 1, 1, 1}, 15}, n {{3, 3, 2, 2, 1, 1, 1}, 16}, {{3, 3, 2, 2, 2, 1, 1}, 17}, n {{3, 3, 2, 2, 2, 2, 1}, 18}, {{3, 3, 3, 1, 1, 1, 1}, 19}, n {{3, 3, 3, 2, 1, 1, 1}, 20}, {{3, 3, 3, 2, 2, 1, 1}, 21}, n {{3, 3, 3, 2, 2, 2, 1}, 22}, {{3, 3, 3, 3, 1, 1, 1}, 23}, n {{3, 3, 3, 3, 2, 1, 1}, 24}, {{4, 1, 1, 1, 1, 1, 1}, 25}, n {{4, 2, 1, 1, 1, 1, 1}, 26}, {{4, 2, 2, 1, 1, 1, 1}, 27}, n {{4, 2, 2, 2, 1, 1, 1}, 28}, {{4, 2, 2, 2, 2, 1, 1}, 29}, n {{4, 2, 2, 2, 2, 2, 1}, 30}, {{4, 3, 1, 1, 1, 1, 1}, 31}, n {{4, 3, 2, 1, 1, 1, 1}, 32}, {{4, 3, 2, 2, 1, 1, 1}, 33}, n {{4, 3, 2, 2, 2, 1, 1}, 34}, {{4, 3, 2, 2, 2, 2, 1}, 35}, n {{4, 3, 3, 1, 1, 1, 1}, 36}, {{4, 3, 3, 2, 1, 1, 1}, 37}, n {{4, 3, 3, 2, 2, 1, 1}, 38}, {{4, 3, 3, 3, 1, 1, 1}, 39}, n {{4, 3, 3, 3, 2, 1, 1}, 40}, {{4, 4, 1, 1, 1, 1, 1}, 41}, n {{4, 4, 2, 1, 1, 1, 1}, 42}, {{4, 4, 2, 2, 1, 1, 1}, 43}, n {{4, 4, 2, 2, 2, 1, 1}, 44}, {{4, 4, 3, 1, 1, 1, 1}, 45}, n {{4, 4, 3, 2, 1, 1, 1}, 46}, {{4, 4, 3, 2, 2, 1, 1}, 47}, n {{4, 4, 3, 3, 1, 1, 1}, 48}, {{4, 4, 4, 1, 1, 1, 1}, 49}, n {{4, 4, 4, 2, 1, 1, 1}, 50}, {{5, 1, 1, 1, 1, 1, 1}, 51}, n {{5, 2, 1, 1, 1, 1, 1}, 52}, {{5, 2, 2, 1, 1, 1, 1}, 53}, n {{5, 2, 2, 2, 1, 1, 1}, 54}, {{5, 2, 2, 2, 2, 1, 1}, 55}, n {{5, 2, 2, 2, 2, 2, 1}, 56}, {{5, 3, 1, 1, 1, 1, 1}, 57}, n {{5, 3, 2, 1, 1, 1, 1}, 58}, {{5, 3, 2, 2, 1, 1, 1}, 59}, n {{5, 3, 2, 2, 2, 1, 1}, 60}, {{5, 3, 2, 2, 2, 2, 1}, 61}, n {{5, 3, 3, 1, 1, 1, 1}, 62}, {{5, 3, 3, 2, 1, 1, 1}, 63}, n {{5, 3, 3, 2, 2, 1, 1}, 64}, {{5, 3, 3, 3, 1, 1, 1}, 65}, n {{5, 4, 1, 1, 1, 1, 1}, 66}, {{5, 4, 2, 1, 1, 1, 1}, 67}, n {{5, 4, 2, 2, 1, 1, 1}, 68}, {{5, 4, 2, 2, 2, 1, 1}, 69}, n {{5, 4, 3, 1, 1, 1, 1}, 70}, {{5, 4, 3, 2, 1, 1, 1}, 71}, n {{5, 4, 3, 2, 2, 1, 1}, 72}, {{5, 4, 3, 3, 1, 1, 1}, 73}, n {{5, 4, 4, 1, 1, 1, 1}, 74}, {{5, 4, 4, 2, 1, 1, 1}, 75}, n {{5, 5, 1, 1, 1, 1, 1}, 76}, {{5, 5, 2, 1, 1, 1, 1}, 77}, n {{5, 5, 2, 2, 1, 1, 1}, 78}, {{5, 5, 2, 2, 2, 1, 1}, 79}, n {{5, 5, 3, 1, 1, 1, 1}, 80}, {{5, 5, 3, 2, 1, 1, 1}, 81}, n {{5, 5, 4, 1, 1, 1, 1}, 82}, {{5, 5, 5, 1, 1, 1, 1}, 83}, n {{6, 1, 1, 1, 1, 1, 1}, 84}, {{6, 2, 1, 1, 1, 1, 1}, 85}, n {{6, 2, 2, 1, 1, 1, 1}, 86}, {{6, 2, 2, 2, 1, 1, 1}, 87}, n {{6, 2, 2, 2, 2, 1, 1}, 88}, {{6, 2, 2, 2, 2, 2, 1}, 89}, n {{6, 3, 1, 1, 1, 1, 1}, 90}, {{6, 3, 2, 1, 1, 1, 1}, 91}, n {{6, 3, 2, 2, 1, 1, 1}, 92}, {{6, 3, 2, 2, 2, 1, 1}, 93}, n {{6, 3, 3, 1, 1, 1, 1}, 94}, {{6, 3, 3, 2, 1, 1, 1}, 95}, n {{6, 3, 3, 2, 2, 1, 1}, 96}, {{6, 3, 3, 3, 1, 1, 1}, 97}, n {{6, 4, 1, 1, 1, 1, 1}, 98}, {{6, 4, 2, 1, 1, 1, 1}, 99}, n {{6, 4, 2, 2, 1, 1, 1}, 100}, {{6, 4, 2, 2, 2, 1, 1}, 101}, n {{6, 4, 3, 1, 1, 1, 1}, 102}, {{6, 4, 3, 2, 1, 1, 1}, 103}, n {{6, 4, 4, 1, 1, 1, 1}, 104}, {{6, 4, 4, 2, 1, 1, 1}, 105}, n {{6, 5, 1, 1, 1, 1, 1}, 106}, {{6, 5, 2, 1, 1, 1, 1}, 107}, n {{6, 5, 2, 2, 1, 1, 1}, 108}, {{6, 5, 2, 2, 2, 1, 1}, 109}, n {{6, 5, 3, 1, 1, 1, 1}, 110}, {{6, 5, 3, 2, 1, 1, 1}, 111}, n {{6, 5, 4, 1, 1, 1, 1}, 112}, {{6, 6, 1, 1, 1, 1, 1}, 113}, n {{6, 6, 2, 1, 1, 1, 1}, 114}, {{6, 6, 2, 2, 1, 1, 1}, 115}, n {{6, 6, 3, 1, 1, 1, 1}, 116}, {{6, 6, 4, 1, 1, 1, 1}, 117}, n {{7, 1, 1, 1, 1, 1, 1}, 118}, {{7, 2, 1, 1, 1, 1, 1}, 119}, n {{7, 2, 2, 1, 1, 1, 1}, 120}, {{7, 2, 2, 2, 1, 1, 1}, 121}, n {{7, 2, 2, 2, 2, 1, 1}, 122}, {{7, 2, 2, 2, 2, 2, 1}, 123}, n {{7, 3, 1, 1, 1, 1, 1}, 124}, {{7, 3, 2, 1, 1, 1, 1}, 125}, n {{7, 3, 2, 2, 1, 1, 1}, 126}, {{7, 3, 2, 2, 2, 1, 1}, 127}, n {{7, 3, 3, 1, 1, 1, 1}, 128}, {{7, 3, 3, 2, 1, 1, 1}, 129}, n {{7, 3, 3, 3, 1, 1, 1}, 130}, {{7, 4, 1, 1, 1, 1, 1}, 131}, n {{7, 4, 2, 1, 1, 1, 1}, 132}, {{7, 4, 2, 2, 1, 1, 1}, 133}, n {{7, 4, 2, 2, 2, 1, 1}, 134}, {{7, 4, 3, 1, 1, 1, 1}, 135}, n {{7, 4, 3, 2, 1, 1, 1}, 136}, {{7, 4, 4, 1, 1, 1, 1}, 137}, n {{7, 5, 1, 1, 1, 1, 1}, 138}, {{7, 5, 2, 1, 1, 1, 1}, 139}, n {{7, 5, 2, 2, 1, 1, 1}, 140}, {{7, 5, 3, 1, 1, 1, 1}, 141}, n {{7, 5, 3, 2, 1, 1, 1}, 142}, {{7, 5, 4, 1, 1, 1, 1}, 143}, n {{7, 6, 1, 1, 1, 1, 1}, 144}, {{7, 6, 2, 1, 1, 1, 1}, 145}, n {{7, 6, 2, 2, 1, 1, 1}, 146}, {{7, 6, 3, 1, 1, 1, 1}, 147}, n {{7, 7, 1, 1, 1, 1, 1}, 148}, {{7, 7, 2, 1, 1, 1, 1}, 149}, n {{8, 1, 1, 1, 1, 1, 1}, 150}, {{8, 2, 1, 1, 1, 1, 1}, 151}, n {{8, 2, 2, 1, 1, 1, 1}, 152}, {{8, 2, 2, 2, 1, 1, 1}, 153}, n {{8, 2, 2, 2, 2, 1, 1}, 154}, {{8, 3, 1, 1, 1, 1, 1}, 155}, n {{8, 3, 2, 1, 1, 1, 1}, 156}, {{8, 3, 2, 2, 1, 1, 1}, 157}, n {{8, 3, 2, 2, 2, 1, 1}, 158}, {{8, 3, 3, 1, 1, 1, 1}, 159}, n {{8, 3, 3, 2, 1, 1, 1}, 160}, {{8, 4, 1, 1, 1, 1, 1}, 161}, n {{8, 4, 2, 1, 1, 1, 1}, 162}, {{8, 4, 2, 2, 1, 1, 1}, 163}, n {{8, 4, 3, 1, 1, 1, 1}, 164}, {{8, 4, 3, 2, 1, 1, 1}, 165}, n {{8, 4, 4, 1, 1, 1, 1}, 166}, {{8, 5, 1, 1, 1, 1, 1}, 167}, n {{8, 5, 2, 1, 1, 1, 1}, 168}, {{8, 5, 2, 2, 1, 1, 1}, 169}, n {{8, 5, 3, 1, 1, 1, 1}, 170}, {{8, 6, 1, 1, 1, 1, 1}, 171}, n {{8, 6, 2, 1, 1, 1, 1}, 172}, {{8, 6, 3, 1, 1, 1, 1}, 173}, n {{8, 7, 1, 1, 1, 1, 1}, 174}, {{8, 7, 2, 1, 1, 1, 1}, 175}, n {{8, 8, 1, 1, 1, 1, 1}, 176}, {{9, 1, 1, 1, 1, 1, 1}, 177}, n {{9, 2, 1, 1, 1, 1, 1}, 178}, {{9, 2, 2, 1, 1, 1, 1}, 179}, n {{9, 2, 2, 2, 1, 1, 1}, 180}, {{9, 2, 2, 2, 2, 1, 1}, 181}, n {{9, 3, 1, 1, 1, 1, 1}, 182}, {{9, 3, 2, 1, 1, 1, 1}, 183}, n {{9, 3, 2, 2, 1, 1, 1}, 184}, {{9, 3, 2, 2, 2, 1, 1}, 185}, n {{9, 3, 3, 1, 1, 1, 1}, 186}, {{9, 3, 3, 2, 1, 1, 1}, 187}, n {{9, 4, 1, 1, 1, 1, 1}, 188}, {{9, 4, 2, 1, 1, 1, 1}, 189}, n {{9, 4, 2, 2, 1, 1, 1}, 190}, {{9, 4, 3, 1, 1, 1, 1}, 191}, n {{9, 4, 4, 1, 1, 1, 1}, 192}, {{9, 5, 1, 1, 1, 1, 1}, 193}, n {{9, 5, 2, 1, 1, 1, 1}, 194}, {{9, 5, 2, 2, 1, 1, 1}, 195}, n {{9, 5, 3, 1, 1, 1, 1}, 196}, {{9, 6, 1, 1, 1, 1, 1}, 197}, n {{9, 6, 2, 1, 1, 1, 1}, 198}, {{9, 7, 1, 1, 1, 1, 1}, 199}, n {{9, 7, 2, 1, 1, 1, 1}, 200}, {{9, 8, 1, 1, 1, 1, 1}, 201}, n {{10, 1, 1, 1, 1, 1, 1}, 202}, {{10, 2, 1, 1, 1, 1, 1}, 203}, n {{10, 2, 2, 1, 1, 1, 1}, 204}, {{10, 2, 2, 2, 1, 1, 1}, 205}, n {{10, 2, 2, 2, 2, 1, 1}, 206}, {{10, 3, 1, 1, 1, 1, 1}, 207}, n {{10, 3, 2, 1, 1, 1, 1}, 208}, {{10, 3, 2, 2, 1, 1, 1}, 209}, n {{10, 3, 3, 1, 1, 1, 1}, 210}, {{10, 3, 3, 2, 1, 1, 1}, 211}, n {{10, 4, 1, 1, 1, 1, 1}, 212}, {{10, 4, 2, 1, 1, 1, 1}, 213}, n {{10, 4, 2, 2, 1, 1, 1}, 214}, {{10, 4, 3, 1, 1, 1, 1}, 215}, n {{10, 5, 1, 1, 1, 1, 1}, 216}, {{10, 5, 2, 1, 1, 1, 1}, 217}, n {{10, 6, 1, 1, 1, 1, 1}, 218}, {{10, 6, 2, 1, 1, 1, 1}, 219}, n {{10, 7, 1, 1, 1, 1, 1}, 220}, {{11, 1, 1, 1, 1, 1, 1}, 221}, n {{11, 2, 1, 1, 1, 1, 1}, 222}, {{11, 2, 2, 1, 1, 1, 1}, 223}, n {{11, 2, 2, 2, 1, 1, 1}, 224}, {{11, 3, 1, 1, 1, 1, 1}, 225}, n {{11, 3, 2, 1, 1, 1, 1}, 226}, {{11, 3, 2, 2, 1, 1, 1}, 227}, n {{11, 3, 3, 1, 1, 1, 1}, 228}, {{11, 4, 1, 1, 1, 1, 1}, 229}, n {{11, 4, 2, 1, 1, 1, 1}, 230}, {{11, 4, 2, 2, 1, 1, 1}, 231}, n {{11, 4, 3, 1, 1, 1, 1}, 232}, {{11, 5, 1, 1, 1, 1, 1}, 233}, n {{11, 5, 2, 1, 1, 1, 1}, 234}, {{11, 6, 1, 1, 1, 1, 1}, 235}, n {{11, 7, 1, 1, 1, 1, 1}, 236}, {{12, 1, 1, 1, 1, 1, 1}, 237}, n {{12, 2, 1, 1, 1, 1, 1}, 238}, {{12, 2, 2, 1, 1, 1, 1}, 239}, n {{12, 2, 2, 2, 1, 1, 1}, 240}, {{12, 3, 1, 1, 1, 1, 1}, 241}, n {{12, 3, 2, 1, 1, 1, 1}, 242}, {{12, 3, 2, 2, 1, 1, 1}, 243}, n {{12, 3, 3, 1, 1, 1, 1}, 244}, {{12, 4, 1, 1, 1, 1, 1}, 245}, n {{12, 4, 2, 1, 1, 1, 1}, 246}, {{12, 5, 1, 1, 1, 1, 1}, 247}, n {{12, 5, 2, 1, 1, 1, 1}, 248}, {{12, 6, 1, 1, 1, 1, 1}, 249}, n {{13, 1, 1, 1, 1, 1, 1}, 250}, {{13, 2, 1, 1, 1, 1, 1}, 251}, n {{13, 2, 2, 1, 1, 1, 1}, 252}, {{13, 2, 2, 2, 1, 1, 1}, 253}, n {{13, 3, 1, 1, 1, 1, 1}, 254}, {{13, 3, 2, 1, 1, 1, 1}, 255}, n {{13, 3, 3, 1, 1, 1, 1}, 256}, {{13, 4, 1, 1, 1, 1, 1}, 257}, n {{13, 4, 2, 1, 1, 1, 1}, 258}, {{13, 5, 1, 1, 1, 1, 1}, 259}, n {{13, 6, 1, 1, 1, 1, 1}, 260}, {{14, 1, 1, 1, 1, 1, 1}, 261}, n {{14, 2, 1, 1, 1, 1, 1}, 262}, {{14, 2, 2, 1, 1, 1, 1}, 263}, n {{14, 2, 2, 2, 1, 1, 1}, 264}, {{14, 3, 1, 1, 1, 1, 1}, 265}, n {{14, 3, 2, 1, 1, 1, 1}, 266}, {{14, 4, 1, 1, 1, 1, 1}, 267}, n {{14, 5, 1, 1, 1, 1, 1}, 268}, {{15, 1, 1, 1, 1, 1, 1}, 269}, n {{15, 2, 1, 1, 1, 1, 1}, 270}, {{15, 2, 2, 1, 1, 1, 1}, 271}, n {{15, 3, 1, 1, 1, 1, 1}, 272}, {{15, 3, 2, 1, 1, 1, 1}, 273}, n {{15, 4, 1, 1, 1, 1, 1}, 274}, {{16, 1, 1, 1, 1, 1, 1}, 275}, n {{16, 2, 1, 1, 1, 1, 1}, 276}, {{16, 2, 2, 1, 1, 1, 1}, 277}, n {{16, 3, 1, 1, 1, 1, 1}, 278}, {{16, 4, 1, 1, 1, 1, 1}, 279}, n {{17, 1, 1, 1, 1, 1, 1}, 280}, {{17, 2, 1, 1, 1, 1, 1}, 281}, n {{17, 2, 2, 1, 1, 1, 1}, 282}, {{17, 3, 1, 1, 1, 1, 1}, 283}, n {{18, 1, 1, 1, 1, 1, 1}, 284}, {{18, 2, 1, 1, 1, 1, 1}, 285}, n {{19, 1, 1, 1, 1, 1, 1}, 286}, {{19, 2, 1, 1, 1, 1, 1}, 287}, n {{20, 1, 1, 1, 1, 1, 1}, 288}}; n vector DIST{ n 0 , n 10 , n 210 , n 3210 , n 43210 , n 543210 , n 6543210 , n 76543210 , n 211234560 , n 3211234510 , n 43211234210 , n 543211233210 , n 6543211243210 , n 76543211543210 , n 432223452112340 , n 5432223432112310 , n 65432223432112210 , n 765432225432113210 , n 8765432265432143210 , n 65433334432223211230 , n 765433335432223211210 , n 8765433365432243211210 , n 98765433765432543213210 , n 876544446543334322221120 , n 9876544476543354322321110 , n 21012345112345234564567670 , n 321012342112342234534565610 , n 4321012332112322234334545210 , n 54321012432112322233334443210 , n 654321015432114322233334443210 , n 7654321065432154322433344543210 , n 43211234210123112342345452112340 , n 543211233210122112322343432112310 , n 6543211243210132112222333432112210 , n 76543211543210432113222335432113210 , n 876543216543215432143223365432143210 , n 6543222343211221012112323432223211230 , n 76543222543211321012112225432223211210 , n 876543226543214321032112265432243211210 , n 8765433365432243211210111654333432222110 , n 98765433765432543213210217654335432232110 , n 432101233211232223433454521012311234234450 , n 5432101243211232223333444321012211232233410 , n 65432101543211432223333444321013211222233210 , n 765432106543215432243334454321043211322333210 , n 6543211243210132112222333432112210121122321120 , n 76543211543210432113222335432113210121122321110 , n 876543216543215432143223365432143210321224321210 , n 8765432265432143210321122654322432112101143222110 , n 65432101543211432223333444321013211222233210111220 , n 765432106543215432243334454321043211322333210211210 , n 3212345621234523456456767123456234564566734564566560 , n 43212345321234223453456562123451234534556234534554510 , n 543212344321233223433454532123421234234451234234434210 , n 6543212354321243223333444432123321232233421231233233210 , n 76543212654321543224333445432124321232233321221221243210 , n 876543217654326543254334465432154321432334321321221543210 , n 5432234532123421234234545322345123452344523453454452112340 , n 65432234432123321232234344322342123412334223423433432112310 , n 765432235432124321232233354322332123212233223123223432112210 , n 8765432265432154321432233654322432123212243222121225432113210 , n 98765432765432654325432437654325432143232543232123265432143210 , n 765433345432233212321232354333432234123233334234334432223211230 , n 8765433365432243212321222654333432232121243332232335432223211210 , n 98765433765432543214321327654335432232121543332213365432243211210 , n 987654447654335432232122176544454333322125444333244654333432222110 , n 5432123443212332234334545321234212342344512342344342101231123423440 , n 65432123543212432233334444321233212322334212312332332101221123223310 , n 765432126543215432243334454321243212322333212212212432101321122223210 , n 876543217654326543254334465432154321432334321321221543210432113223321 n 0 , n 7654322354321243212322333543223321232122332231232234321122101211222112 n 0 , n 8765432265432154321432233654322432123212243222121225432113210121123211 n 10 , n 9876543276543265432543243765432543214323254323212326543214321032124321 n 210 , n 9876543376543254321432132765433543223212154333221336543224321121014322 n 2110 , n 7654321265432154322433344543212432123223332122122124321013211222232101 n 11220 , n 8765432176543265432543344654321543214323343213212215432104321132233210 n 211210 , n 6543234554323443234334545432345323452344523453454453212342123423441234 n 2344340 , n 7654323465432354323433444543234432343233432342343344321233212322332123 n 12332310 , n 8765432376543265432543344654323543234323343233232235432124321232233212 n 212212210 , n 9876543287654376543654354765432654325434354324323326543215432143234321 n 3212213210 , n 8765433465432354323432333654334432343232343342343345432233212321223223 n 12322321120 , n 9876543376543265432543243765433543234323254333232336543224321232124322 n 212122321110 , n 8765432376543265432543344654323543234323343233232235432124321232233212 n 2122122101110 , n 9876543487654376543654354765434654345434354344343346543235432343234323 n 32322332122110 , n 3212345610123412345345656212345123453455623453455451234562345645663456 n 456656456756670 , n 4321234521012311234234545211234012342344512342344342123451234534552345 n 3455453456455610 , n 5432123432101221123223434321123101231233421231233233212342123423441234 n 23443423453445210 , n 6543212343210132112222333432112210121122321120122124321233212322332123 n 123323323423343210 , n 7654321254321043211322233543211321012112232111011215432124321232233212 n 2122124323322343210 , n 8765432165432154321432233654321432103212243212101216543215432143234321 n 32122154324334543210 , n 5432234532112310123123434322234112341233422342343343223451234523442345 n 345445345645562112340 , n 6543223443211221012112323432223211230122332231232234322342123412332234 n 2343342345344532112310 , n 7654322354321132101211222543222321121011232221121225432233212321223223 n 12322332342334432112210 , n 8765432265432143210321122654322432112101143222110326543224321232124322 n 212122432332235432113210 , n 7654333454322232112101212543333322231121243332232335433343223412323334 n 2343343345344543222321120 , n 8765433365432243211210111654333432222110143332221336543334322321214333 n 22323343342334543222321110 , n 9876543376543254321321021765433543223211054333221437654335432232125433 n 322133543332336543224321210 , n 9876544476543354322321110765444543333221154443332447654445433332215444 n 3332445444334465433343222110 , n 5432123432101221123223434321123101231233421231233233212342123423441234 n 23443423453445210123112323440 , n 6543212343210132112222333432112210121122321120122124321233212322332123 n 123323323423343210122112223310 , n 7654321254321043211322233543211321012112232111011215432124321232233212 n 2122124323322343210132112223210 , n 8765432165432154321432233654321432103212243212101216543215432143234321 n 32122154324334543210432132233210 , n 7654322354321132101211222543222321121011232221121225432233212321223223 n 123223323423344321122101112221120 , n 8765432265432143210321122654322432112101143222110326543224321232124322 n 2121224323322354321132102112321110 , n 7654321254321043211322233543211321012112232111011215432124321232233212 n 21221243233223432101321122232101110 , n 8765432165432154321432233654321432103212243212101216543215432143234321 n 321221543243345432104321322332102110 , n 6543234543212332123223434432234212341233432342343343212341012312332123 n 1233231234233432123421232344123423340 , n 7654323454321243212322333543223321232122332231232234321232101211222112 n 01221221231223432123321222332123122310 , n 8765432365432154321432233654322432123212243222121325432123210121123211 n 101121321221125432124321322332122112210 , n 9876543276543265432543243765432543214323254323212326543214321032124321 n 2101214321322365432154324323432132213210 , n 8765433465432243212321222654333432232121243332232335432233211210113222 n 11212232231223543223321221223223122321120 , n 9876543376543254321432132765433543223212154333221436543224321121014322 n 211032432221226543224321321243222122321110 , n 8765432365432154321432233654322432123212243222121325432123210121123211 n 1011213212211254321243213223321221122101110 , n 6543234543212321012112323432234211230122332231232234323452123412333234 n 23433423453445321234101212332123122312342330 , n 7654323454321232101211222543223321121011243222121325432343212321223223 n 123223323423344321232101112221120112212312210 , n 8765432365432143210321122654322432112101143222110326543234321232124322 n 2121324323322354321232102112321110213212211210 , n 8765433465432243211210111654333432222110154333221436543344322321214333 n 22323343342334543223321110113222112232231222110 , n 8765432365432143210321122654322432112101143222110326543234321232124322 n 212132432332235432123210211232111021321221121010 , n 4321234521234523456456767212345234564566723454566452234563456756773456 n 5677564567676712345634565677345656564567676456660 , n 5432123432123422345345656321234123453455612343455343223452345645662345 n 45664534565656212345234545662345454534565653455510 , n 6543212343212332234334545432123212342344521232344234322343234534552234 n 345534334545453212342234345512343434234545423444210 , n 7654321254321243223333444543212321232233432121233125432234323433443223 n 2344234334343443212332233344212323233234343323333210 , n 8765432165432154322433344654321432123223343212122216543225432343344322 n 32332254334334543212432233343212221243233324323243210 , n 9876543276543265432543344765432543214323354323212327654326543254345432 n 432332654354456543215432433443213221543243354343543210 , n 6543223443212321234234545432234212342344522342344344323452234534552345 n 3455453456455632123412343455123434342345454234442112340 , n 7654322354321232123223434543223321231233432231233235432343223423443234 n 23443433453445432123212323442123232322343431233332112310 , n 8765432265432143212322333654322432122122343222122226543234322332334323 n 223323433433345432123212223332121212322323221222432112210 , n 9876543276543254321432233765432543213212254323211327654325432243235432 n 3222325433433465432143213223432121214322322321215432113210 , n 8765433365432243212212323654333432232122343332232336543344323422334334 n 23433443453445543223321212333223122332342332122243222321120 , n 9876543376543254321321222765433543223211254333221337654335432332225433 n 323233543433346543224321212243222122432322232111543222321110 , n :987654487654365432432121876544654334322165444332448765446543343226544 n 4332446544434476543354323211543332335433323432226543334322210 , n 6543212343212332234334545432123212342344521232344234322343234534552234 n 34553433454545321234223434551234343423454542344421012311232340 , n 7654321254321243223333444543212321232233432121233125432234323433443223 n 234423433434344321233223334421232323323434322333321012211222310 , n 8765432165432154322433344654321432123223343212122216543225432343344322 n 3233225433433454321243223334321222124323332322324321013211223210 , n 9876543276543265432543344765432543214323354323212327654326543254345432 n 43233265435445654321543243344321322154324334323254321043213233210 , n 8765432265432143212322333654322432122122343222122226543234322332334323 n 223323433433345432123212223332121212322323221222432112210111221120 , n 9876543276543254321432233765432543213212254323211327654325432243235432 n 3222325433433465432143213223432121214322322321215432113210212321110 , n 8765432165432154322433344654321432123223343212122216543225432343344322 n 32332254334334543212432233343212221243233323223243210132112232101110 , n 7654323454322343234334545543234322342344532342344344321232123423442123 n 234423223434344322343234345522343434123434323444321234212323412342330 , n 8765432365432254323433444654323432233233443232233235432123212322333212 n 123312322323235432234323334432232323212323232333432123321222321231221 n 0 , n 9876543276543265432543344765432543224323354323222326543214321232234321 n 2122214322322365432254324334432232223212221432325432124321323321221121 n 0 , n 9876543376543254322432333765433543233222354333232336543224321221224322 n 2122224323222365432343223233432322233212121322225432233212212322312221 n 10 , n :987654387654365432543243876543654324323265434322437654325432132125432 n 3211325432323376543254324323543232324321212432326543224321322432221232 n 110 , n 9876543276543265432543344765432543224323354323222326543214321232234321 n 2122214322322365432254324334432232223212221432325432124321323321221121 n 0110 , n 7654323454321232123223434543223321231233432231233235432343223423443234 n 2344343345344543212321232344212323232234343123333212341012123212312212 n 32330 , n 8765432365432143212322333654322432122122343222122326543234322332334323 n 2233234334333454321232122233321212123223232212224321232101112211201121 n 212210 , n 9876543276543254321432233765432543213212254323211327654325432243235432 n 3222325433433465432143213223432121214322322321215432123210212321110232 n 1211210 , n 9876543376543254321321222765433543223211254333221437654335432332225433 n 3232335434333465432243212122432221224323222321115432233211101322211232 n 21222110 , n 8765432365432343234334545654323432342344543232344236543344334534554334 n 3455344445454554323432343455323434343345454234444321232123234212323222 n 334312330 , n 9876543276543254323433444765432543233233454323233327654335433443445433 n 3344335444444565432343233344432323234334343323335432123212223321212132 n 2232212210 , n 3210123421123412345345656101234123453455612343455342123452345645662345 n 4566453456565622234523454566234545453456565345551234563456567345656545 n 66764566560 , n 4321012332112321234234545210123112342344501232344233212342234534551234 n 3455342345454532123412343455123434342345454234442123452345456234545434 n 556534554510 , n 5432101243211232123223434321012211231233410121233124321233223423442123 n 2344233234343443212321232344212323232234343123333212342234345123434323 n 4454234434210 , n 6543210154321143212322333432101321122122321011122015432124322332333212 n 2233124323332354321232122233321212123223232212224321233223234212323232 n 33433233233210 , n 7654321065432154321432233543210432113212232102111106543215432243234321 n 3222215432433465432143213223432121214322322321215432124322323321222143 n 233243223243210 , n 5432112332101221123123434321123101231233411231233233212342123423441234 n 2344342345344521012311232344012323231234343223333212341234345123434323 n 4454234434211230 , n 6543211243210132112212323432112210121122321120122124321233212322332123 n 1233233234233432101221121233101212122123232212224321232123234212323222 n 33431233233211210 , n 7654321154321043211321222543211321012111232111011115432124321232223212 n 2122124323322343210132112122210111013212221321115432123212223321212132 n 223221223243211210 , n 8765432165432154321432132654321432103212143212101216543215432143234321 n 3212215432433454321043213212321021104321322432226543214321322432121243 n 2322321243543213210 , n 7654322254321132101211212543222321121011232221121225432233212321223223 n 1232233234233443211221011122211201122123122101115432233212123322312232 n 32332122324321221120 , n 8765432265432143210321121654322432112101143222110226543224321232124322 n 2121224323322354321132102111321110113212211210106543224321212432221243 n 222232114354321321110 , n 5432101243211232123223434321012211231233410121233124321233223423442123 n 2344233234343432122321232344122323232334343123333212342234345123434323 n 4454234434210121123230 , n 6543210154321143212322333432101321122122321011122015432124322332333212 n 2233124323332343211232122233211212123223232212224321233223234212323232 n 33432233233210121121210 , n 7654321065432154321432233543210432113212232102111106543215432243234321 n 3222215432433454321143213223321121114322322321215432124322323321222143 n 233232223243210321121210 , n 7654321154321043211321222543211321012111232111011115432124321232223212 n 2122124323322343210132112122210111013212221212125432123212223321212132 n 2232212232432112101112110 , n 8765432165432154321432132654321432103212143212101216543215432143234321 n 3212215432433454321043213212321021104321322321216543214321322432121243 n 23223212435432132102132110 , n 7654321065432154321432233543210432113212232102111106543215432243234321 n 3222215432433454321243213223321221124323322321215432124322323321222143 n 233232223243210321121210110 , n 6543212354321243223323434432123321232233421231233233210122112312331012 n 1233122123232343212332232344212323232223232233334322343234345223434312 n 3343234434321232123231232330 , n 7654321265432154322432333543212432123222332122122124321013211221222101 n 1122013212221254321243223233321222123212121322225432234323334322323221 n 22323233334321232122221212210 , n 8765432176543265432543243654321543214323243213212215432104321132123210 n 2111104321322365432154324323432132214321212432326543225432433432232232 n 122143234354321432132321211210 , n 8765432265432154321432232654322432123212243222121225432113210121113211 n 1011113212211254321243213222321221122101110321216543234322323432322232 n 1121322243543223212213221222110 , n 6543212343210132112212323432112210121122321120122124321233212322332123 n 1233233234233432101221121233101212122123232222224321232123234212323222 n 33431233233212310121221212212320 , n 7654321254321043211321222543211321012111232111011215432124321232223212 n 2122124323322343210132112122210111013212221321115432123212223321212132 n 223221223243212210111211011212110 , n 8765432265432143210321121654322432112101143222110326543224321232124322 n 2121224323322354321132102111321110113212211210106543224321212432221243 n 2222321143543213211103211113221210 , n 7654321254321243223323434543212321232233432121233125432234323433443223 n 2344234334343443212332232344212323233234343323333210122112123101212121 n 22322222124321221232321223222331230 , n 8765432165432154322432333654321432123222343212122216543225432343334322 n 3233225433433454321243223233321222124323332432224321013211212210111032 n 122132112154321321222321121322221210 , n 6543210154321143212322323432101321122122321011122015432124322332333212 n 2233124323332354322232122233322212223233233212224321233223234212323232 n 3343323323321012112121011212122222120 , n 4321234521234501234234545212345123452344523453454452123452345634552345 n 4565453456565632345612343455234534453456455234442345672345456345645545 n 65663455451234534563434545534554545640 , n 5432123432123410123123434321234212341233412342343343212341234523441234 n 3454342345454521234501232344123423342345344123333234561234345234534434 n 545523443421234234523234344234434345310 , n 6543212343212321012112323432123211230122321231232234321232123412332123 n 2343232234343432123410121233212312231234233012224323452123234223423323 n 4344123323321232234121232331233232342210 , n 7654321254321232101211222543212321121011232122121125432123212321223212 n 1232123223232343212321011122211201122123122101115432343212123322312232 n 32332122324321221230121212221223212313210 , n 8765432165432143210321122654321432112101143212110216543214321232124321 n 2121214322322354321232102112321110213212211210106543234321212432221243 n 222232114354321321210321211321121032243210 , n 6543223443212321123012323432234212341232322342343344322342123423432234 n 2344342345344532123411231233123423341234343123234323452234234234534423 n 4454234334322341234232343442343233343211230 , n 7654322354321232112101212543223321231121232231232235432233212312323223 n 1233233234233443212321120122212312232123232112125432343223123323423332 n 33432232334322321231222323322321222323211210 , n 8765432265432143211210111654322432122110143222121226543224321221214322 n 2122224323222354321232111011321211123212121211016543234322212432322243 n 223232214354322321211322122322121132243211210 , n 9876543276543254321321021765432543213211054323211327654325432132125432 n 3211325432323365432143212101432121214321212321117654325432321543232354 n 3323432254654324321214322124322321433543213210 , n 8765433365432243212211201654333432232121243332232336543334322321224333 n 2232334334233454322332121121322312233223122212126543344323222433423343 n 32333232435432332231232323332322223324321221120 , n 9876543376543254321321110765433543223211154333221337654335432232115433 n 3221335433323365432243212110432221224322212321117654335432321543332354 n 332343225465432432221432222432232143354321321110 , n 6543212343212321012112323432123211230122321231232234321232123412332123 n 2343232234343432123410121233212312231234233012224323452123234223423323 n 4344123323321232234121232331233232342210121123230 , n 7654321254321232101211222543212321121011232122121125432123212321223212 n 1232123223232343212321011122211201122123122101115432343212123322312232 n 32332122324321221230121212221222212313210121121210 , n 8765432165432143210321122654321432112101143212110216543214321232124321 n 2121214322322354321232102112321110213212211210106543234321212432221243 n 222232114354321321210321211321121032243210321121210 , n 8765432265432143211210111654322432122110143222121226543224321221214322 n 2122224323222354321232111011321211123212121211016543234322212432322243 n 2232322143543223212113221223221211322432112101112110 , n 8765432165432143210321122654321432112101143212110216543214321232124321 n 2121214322322354321232102112321110213212211210106543234321212432221243 n 22223211435432132121032121132112103224321032112121010 , n 7654323454322332123212323543234322341232332342343344321232123401222123 n 1232232123232343223421231233323423342234122123235433453234234334534423 n 423323433443234323423234344123323334332123212323123230 , n 8765432365432243212321222654323432232121243233232235432123212310113212 n 2121123212121254322332122122322312232123011212126543344323223433423332 n 3122323243543233223123232332122322332432123212122121210 , n 9876543276543254321432132765432543223212154323221326543214321221014321 n 2110214321212265432243213212432221323212102321217654335432322543332343 n 22124322546543243222143232232123214335432143212132121210 , n 9876543376543254322321221765433543233221254333232336543224321221104322 n 2121224322212265432343222121432322233212111322127654345433322543433343 n 222243325465433432322433233322132243354322321221322122110 , n 7654323454321232123101212543223321232121232231232235432343212312323223 n 1233233234233443212321230122212312232123232223125432343234123323423332 n 3343234234432342123233232332342123233321231012122121212320 , n 8765432365432143212210111654322432122110143222121326543234321221214322 n 2122224323222354321232121011321221123212121212016543234323212432322243 n 22323231435432332122232212232312123234321221011121101212110 , n 8765432365432343212212323654323432232122343232232236543234323422334323 n 2343234334343454323432121233322312233234233212224321232123012212312221 n 223232312354323323412323233323323212243212212323212222233120 , n 9876543276543254321321222765432543223211254323221327654325432332225432 n 3232325433333465432343212122432221224323222321115432123212101321221132 n 1121212032654324323214322224322321213543213212223211132222110 , n 7654321254321232101211212543212321121011232122121125432123212321223212 n 1232123223232343212321011122211201122123122101115432343212123322312232 n 32332122324321221230121212221223212313210121121210111212222120 , n 5432345632234512345345656212345234563455623454565451012341234534551234 n 3455342345454521234523454566234545452345454345553234563456567345656534 n 556545665623456345645345565234434545512345345656345553455455640 , n 6543234543223421234234545321234223452344512343454342101231123423440123 n 2344231234343432123412343455123434341234343234444323452345456234545423 n 4454345545323452345342344541233234344212342345452344423443445310 , n 7654323454322332123223434432123322341233421232343233210122112322331012 n 1233122123232343212321232344212323232123232123335432343234345223434312 n 33432344344323422342312334301221232333212322343412333123323342210 , n 8765432365432243212322333543212432232122332122232124321013211222232101 n 1122013212221254321232122233321212123212221212226543234323234322323221 n 223232334354323322312212232101121232243212322323212222122322313210 , n 9876543276543254321432233654321543223212243213221215432104321132233210 n 2112104321322365432143213223432121214321322321217654325432323432232232 n 1221432254654324322213212212101321433543214322323212132124332243210 , n 7654334554323432234123434432234212342343422342344343211231012312331123 n 1233231234233443223421232344123423340123232123335433453234345234534412 n 33432344344334523453423434412322333443223412343423434223323343211230 , n 8765433465432343223212323543223321232232332231233234321122101211222112 n 0122122123122354322332121233212312231012121212226543344323234323423321 n 223232334354334323423223233112122233343223212323223232122122323211210 , n 9876543376543254322321222654322432123221243222122225432113210121123211 n 1011113212211265432243212122321221122101110321117654335432323432322232 n 112143225465433432322322122211032143354322321222322123211213224321121 n 0 , n 9876544476543354323322312654333432232122343332232335432223211210113222 n 1121223223122365433343222122322312232112011322127654445433323433423332 n 2122433254654344334233232332121322433543233223122122210112132243222211 n 0 , n :987654487654365432432221765433543223212254333221336543224321121014322 n 2110224322212276543354323211432221223211101432218765446543432543332343 n 2212543365765435433324322223211432544654324322213212121013243354322321 n 10 , n 7654323454322332123223434432123322341233421232343233210122112322331012 n 1233122123232343212321232344212323231223332123335432343234345223434312 n 3343234434432342234231233430122123233321232234341233312332334221012112 n 230 , n 8765432365432243212322333543212432232122332122232124321013211222232101 n 1122013212221254321232122233321212122112221212226543234323234322323221 n 2232323343543233223122122321011212322432123223232122221222223132101211 n 2210 , n 9876543276543254321432233654321543223212243213221215432104321132233210 n 2112104321322365432143213223432121213211221321217654325432323432232232 n 1221432254654324322213212212101321433543214322323212132123232243210321 n 22210 , n 9876543376543254322321222654322432123221243222122225432113210121123211 n 1011113212211265432243212122321221122101110321117654335432323432322232 n 1121432254654334323223221222110321433543223212223221221212132243211210 n 112110 , n 8765434565433443234323434543234432342343432342344344321233212312332123 n 1233231012121254323432232344323423342123232223336543454334345334534422 n 3343334444543453345342343441232233344432343234342343412332334332123212 n 2312320 , n 9876543476543354323432333654323543233232343233233235432124321221223212 n 2122122101110165432343223233432322233212121322227654345433334433433332 n 2232433354654344334233232332121322433543234323233232321223233243212321 n 12212110 , n 8765434565432343223212323543234321232232332231233234321232101211222112 n 0122122123122354323432121233212312231012121212226543454323234323423321 n 2232323343543343234233342332231232343432232123233232323221223232123101 n 122121120 , n 9876543476543254322321222654323432123221243222122325432123210121123211 n 1011213212211265432343212122321221122101110321117654345432323432322232 n 1121432254654334323223231222120321434543223212223221232112132343212210 n 1121102110 , n 9876543476543354323323434654323432343233443232343235432123212322333212 n 1233123223232365432343232344322323232123232323335432343223123212323210 n 1121212232654344334233233432122323233543233234343233332332312243212212 n 23212222120 , n 5432345632123422345345656322345123453455623453455452123452345645662345 n 4566453456565621234523454566234545453456565345553234563456567345656545 n 6676456656334562345453454553455345455233453456563455545664556412345345 n 563455454550 , n 6543234543212332234334545432234212342344522342344343212342234534551234 n 3455342345454532123422343455123434342345454234444323452345456234545434 n 5565345545323451234342343442344234344322342345452344434553445321234234 n 4523443434410 , n 7654323454321243223333444543223321232233432231233234321233223433442123 n 2344233234343443212332233344212323233234343223335432343234345323434323 n 4454234434432342123232232331233123233432233234342233323442334232123223 n 34123323233210 , n 8765432365432154322433344654322432123223343222122225432124322333343212 n 2233124323332354321243223334321222124323332322326543234323334432323232 n 3343323343543233212223221222122212323543224323333222232333233243212322 n 332122323223210 , n 7654334554322332123223434543334322341233433342343344322342123423442234 n 2344342345344543223421232344223423341234343123335433453234345334534423 n 4454234434432342234232343442343233343321232234341233323443334232234123 n 3423433423321120 , n 8765433465432243212322333654333432232122343332232335432233212322333223 n 1233233234233454322332122233322312232123232212226543344323234433423332 n 3343323343543233223123232332232222332432123223232122232332223143223212 n 23223223122321110 , n 9876543376543254321432233765433543223212254333221336543224321232234322 n 2122224323322365432243213223432221223212221321217654335432323543332343 n 2232432254654324322214322223221321433543214322323212143223232254322321 n 223221322134321210 , n 9876544476543354322321222765444543333221254443332446543334322321224333 n 2232334334233465433343222122433322333223122322127654445433323544433443 n 3233433254654334323224332333232322433543223212223221221222132254333322 n 1233323222343222110 , n 7654323454321243223333444543223321232233432231233234321233223433442123 n 2344233234343443212332233344212323232234343233435432343234345323434323 n 4454234434432342123232232331233123233432333234342333323442334332123223 n 34123323233210111220 , n 8765432365432154322433344654322432123223343222122225432124322333343212 n 2233124323332354321243223334321222123223332322326543234323334432323232 n 3343323343543233212223221222122212323543224323333222232333233243212322 n 332122322223210211210 , n 9876543276543265432543344765432543214323354323212326543215432243344321 n 3223215432433465432154324334432132214322332432327654325432434543232343 n 2332432354654324321324322123212322433654325432434323243234343354321432 n 3332124332343213212210 , n 9876543376543254321432233765433543223212254333221336543224321232234322 n 2122224323322365432243213223432221223212221321217654335432323543332343 n 2232432254654324322214322223221321433543214322323212132223232254322321 n 22322132213432121012110 , n 8765434565432354323433444654334432343233443342343345432343212322333223 n 1233232123232354323443233344323423342123232323336543454334345434534432 n 3343334444543343234233343442342233343543233234343233323332334243234212 n 232232121223212212212320 , n 9876543476543265432543344765433543234323354333232336543234321232234322 n 2122223212221265432354324334432332233212221432327654345433434543433343 n 2232433354654334323324332333231322434654324323334322232223243354323321 n 2232212121343213212212110 , n 8765434565432343212322333654334432232122343332232335432343212322333223 n 1233233234233454323432122233322312232123232212226543454323234433423332 n 3343323343543233234123232333342332342432123223232122232332323143223212 n 23323223122321210112121120 , n 9876543476543254323433444765433543233233454333233336543234323433444323 n 2344234334343465432343233344432323233234343323335432343212223322312221 n 2232212232654344323234332333233323333543234334343233343443323254323323 n 343233332314321212221222210 , n 4321234521012311234234545211234012342344512342344342123451234534552345 n 3455453456455610123412343455123434342345454234442123452345456234545434 n 5565345545323451234342343443454234344332342345452344434553445323345345 n 5634554545512343455345545450 , n 5432123432101221123223434321123101231233421231233233212342123423441234 n 2344342345344521012311232344012323231234343123333212341234345123434323 n 4454234434212340123231232332343123233321231234341233323442334232234234 n 45234434344212323442344343410 , n 6543212343210132112222333432112210121122321120122124321233212322332123 n 1233233234233432101221122233101212122123232212224321232123234212323222 n 3343123323321231012122121221232012122432122123232122222331223143223323 n 342233332333212223312332323210 , n 7654321254321043211322233543211321012112232111011215432124321232233212 n 2122124323322343210132112223210111013212221321215432123212223321212132 n 2232212232432122101112110112121101213543213212223211132222132254322432 n 3332224332343213223212232323210 , n 6543223443211221012112323432223211230122332231232234322342123412332234 n 2343342345344532112310121233112312231234233012224322342123234223423323 n 4344123323321231123121232332343122232210121123230122212332223132123223 n 34123323233322312332343342321120 , n 7654322354321132101211222543222321121011232221121225432233212321223223 n 1232233234233443211221011122211201122123122101115432233212123322312232 n 3233212232432122112012121222232111221321012112121011121222112043212322 n 232122322224322212222322312321110 , n 8765432265432143210321122654322432112101143222110326543224321232124322 n 2121224323322354321132102112321110113212211210106543224321212432221243 n 2222321143543213211103211113221210322432103211212101032123221154321432 n 3232124332354323212322132234321210 , n 8765433365432243211210111654333432222110143332221336543334322321214333 n 2232334334233454322232111011322211223223122211016543334322212433322343 n 3233322143543223212113221223232211322432112101112110121211021154322321 n 22322132213543332213332332343222110 , n 6543212343210132112222333432112210121122321120122124321233212322332123 n 1233233234233432101221122233101212122123232122324321232123234212323222 n 3343123323321231012122121221232012122321222123231222223331223243233212 n 232232231223212223312332323210111220 , n 7654321254321043211322233543211321012112232111011215432124321232233212 n 2122124323322343210132112223210111013212221211215432123212223321212132 n 2232212232432122101112110112121101212432113212222111132222122154322321 n 2232213221343213223212232223210211210 , n 7654323454321243212322333543223321232122332231232234321232101211222112 n 0122122123122343212332122233212312231012121212225432343223234323423321 n 2232223333432232123123232332231122232432122123232122222221223132123101 n 12212112011432321222232121232122122120 , n 8765432365432154321432233654322432123212243222121325432123210121123211 n 1011213212211254321243213223321221122101110321216543234322323432322232 n 1121322243543223212213221222120211323543213212223211132112132243212210 n 112110211025432321232212123432132122110 , n 7654323454321232101211222543223321121011243222121325432343212321223223 n 1232233234233443212321011122211201122123122101115432343212123322312232 n 3233212232432122123012121223232221231321012112121011121222212043212212 n 2321222212243222122323223123212101121120 , n 5432345632123422345345656322345123453455623453455453234562345645663456 n 4566564567566721234523454566234545453456565345552123452345456234545434 n 5565345545323452345453454554565345344433453456563455545664545434456345 n 56456556455234545664566565512343455344540 , n 6543234543212332234334545432234212342344532342344344323453234534552345 n 3455453456455632123422343455123434342345454234443212342234345123434323 n 4454234434322341234342343443454234233432342345452344434553434343345234 n 453454453443234345534554544212323442334310 , n 7654323454321243223333444543223321232233432231233235432344323433443234 n 2344344345344543212332233344212323233234343323334321233223334212323232 n 3343223323432232123233232332343123122543233234343233333442323254334323 n 3433433423343233344234434333212223312232210 , n 8765432365432154322433344654322432123223343222122326543235432343344323 n 3233235434433454321243223334321222124323332432325432124322334321222143 n 2332322332543223212223221223232212213654324323334322243333232365433432 n 33433243324543243343233434343213223213233210 , n 7654334554322332123223434543334322341233443342343345433453234523443345 n 3454453456455643223421232344223423342345344123334322342123234223423323 n 4344123323432342234232343443454233233321232234341233323443333243234334 n 342344343434334234434544533322312332334221120 , n 8765433465432243212322333654333432232122343332232336543344323432334334 n 2343344345344554322332122233322312233234233212225432233212223322312232 n 3233212232543233223123232333343222222432123223232122232333222154323433 n 2332334333354333233334334224322212222231321110 , n 9876544476543354322321222765444543333221254443332447654445433432325444 n 3343445445344565433343222122433322334334233322126543334322212433322343 n 3233322143654334323224332334343322323543223212223221232322121265433432 n 33433243323654443324443443354333221333324322210 , n 7654323454321243223333444543223321232233432231233235432344323433443234 n 2344344345344543212332233344212323233234343233434321233223334212323232 n 3343233423432232123233232332343123122432333234342333334442323354344323 n 343343342324323334423443433321222331223321011120 , n 8765432365432154322433344654322432123223343222122326543235432343344323 n 3233235434433454321243223334321222124323332322325432124322334321222143 n 2332322332543223212223221223232212213543224323333222243333232265433432 n 3343324332354324334323343334321322321322321021210 , n 8765434565432354323433444654334432343233443342343345432343212322333223 n 1233233234233454323443233344323423342123232323335432344323334323423321 n 2232323333543343234234343443232233233543233234343233333332323243234212 n 23323223121543432333343232243233233231223212212120 , n 8765434565432343212322333654334432232122354333232436543454323432334334 n 2343344345344554323432122233322312233234233212225432343212223322312232 n 3233212232543233223123232334343322332432123223232122232333323154323323 n 233233332325433323343433422432321223223132121012110 , n 6543234543234533456456767432345234564566723454566453234561234534552345 n 3455453456455621234523454566234545452345454345551012341234345123434323 n 4454234434212342345452344543454345233323453456563455534554534443456234 n 4534544534434563455456545442345456645344123434534440 , n 7654323454323443345445656543234323453455632343455344323452123423442234 n 2344342345344532123422343455123434341234343234442101231123234012323212 n 3343123323321232234341233432343234122432342345452344423443423332345123 n 34234334233434523443454343332343455342332123234233310 , n 8765432365432354334444555654323432343344543232344235432343212322333223 n 1233233234233443212332233344212323232123232323333210122112223101212121 n 2232212212432123223332122322232123011543233234343233332332312243234212 n 233232231225434323333432322432333442312232122231222210 , n 9876543276543265433544455765432543234334454323233326543234321232234322 n 2122224323322354321243223334321222123212221432324321013211223210111032 n 1221321221543214322333212213221212102654324323334322243223221354323321 n 2232213221365434323433232335432433432213432132321333210 , n 8765433465432343234334545654334432342344543342344345433453223412333334 n 2343343345344543223421232344223423342234233123333211231012123112312212 n 3233012212432232123232232332343123122432343234342343412332322343345223 n 23334323232543433433454343243232344232323223123233221120 , n 9876543376543254323433444765433543233233454333233336543344322321224333 n 2232334334233454322332122233322312233223122212224321122101112211201121 n 2122101121543223212223221223232212112543234323233232321223221254334322 n 124332322226543433243433321543232333222143222122221321110 , n 8765432365432354334444555654323432343344543232344235432343212322333223 n 1233233234233443212332233344212323232123232223333210122112223101212121 n 2232122312432123223332122322232123011543233234343233323332312243234212 n 2332322312154343233334323224323334423122321222312232101110 , n 9876543476543365434544555765434543344344554343344346543234323432334323 n 2343233234122354323443233344323423342123232323334321233212223212312210 n 1121212222543234323333232332122223122654344334344343432332312254323323 n 23323323120654343434344342154334344332324323323231232122110 , n 5432123443223423345445656321234123453455612343455342123450123423441234 n 2344342345344532334512343455234534451234343234442123452345456234545423 n 4454345545212342345452344543453344343323452345453454523443445432345123 n 342343342334345234434543434343434553423323454564534123434340 , n 6543212354322332334344555432123212342344521232344233212341012312332123 n 1233231234233443223421232344123423340123232123333212342234345123434312 n 3343234434321232234341233432342233232322341234342343412332334321234012 n 2312322312232341233234323234323234423122323434534232123232310 , n 7654321265432243233334445543212321232233432121233124321232101211222112 n 0122122123122354322332122233212312231012121212224321233223334212323221 n 2232323323432123223332122323231222121432232123233232321221223232123101 n 12212112011432321222232121243322233120114323334231232122212210 , n 7654322354321243223233444543223321231233432231233234322342112301223223 n 1232232234233443212332231233212323231123122223234322342123234223423322 n 3233123323432232123232232331232123232433332234231233301221223332234112 n 122232121224323223223432323321222331212243232342323322312232110 , n 8765432265432154322323334654322432122122343222122225432233211210113222 n 1121223223122354321243222122321212122112011322125432233212223322312232 n 2122212232543223212223221222121212222543323223122122210112132243223211 n 0132212111254323221323222224321322221112543232332224322212232110 , n 7654321265432243233334445543212321232233432121233124321232101211222112 n 0122122123122354323332122233212312231012121212224321233223334212323221 n 2232223323432123223332122322231232121432232123232232312221223232123101 n 12212112011432321222232121243232233120114323334231232122212210110 , n 4321012332112322234334545210123112342344501232344233212341234534551234 n 3455342345454532223423344455223434342345454344542123452345456234545434 n 5565345545101231234341233432344234342212342345452344434553445332345234 n 453454453444334345534554545432333442334434344453445234545451233430 , n 5432101243211232223333444321012211232233410121233124321232123423442123 n 2344232234343443212332233344212323231234343233433212342234345123434323 n 4454234434210121123230122321233123231321232234341233323442334232234123 n 3423433423343232344234434343212223312233432333423343234343421223210 , n 6543210154321143222333344432101321122223321011122015432123212322333212 n 1233123223232354321243223334321222122123232322324321233223334212323232 n 3343323323321012112221011212122212120432123223332122232332223143223212 n 23323223122543232333233232343213223211225432434322343233323321221210 , n 6543211243210132112222333432112210121122321120122124321233212312332123 n 1233233234233432101221122233101212122123232222324321232123234212323222 n 3343123323321121012121121221232012121432222123232222212331223243223223 n 232233232333212223312332333210111220112232122231223432323233221222110 , n 6543210154321143222333344432101321122223321011122015432123212322333212 n 1233123223232343212232233344212223222123232323334321233223334212323232 n 3343233423321012112221011212122123120432123223332122222332323143212212 n 232122221224322323322332323321222331212243233342323432333233212212101 n 0 , n 5432123443223421234234545321234223452344512343454344323452345634552345 n 4565453456565632334512343455234534453456455234443234562345456345645545 n 6566345545212342345342344543455344453212342345452344434553445332345345 n 5634554545543453455456556454334234434453444534545543456455623445412333 n 0 , n 6543212354322332123223434432123322341233421232343235432343234523443234 n 3454343345454543223421232344323423342345344123334323453234345234534434 n 5455234434321232234231233432344233342321232234341233323442334243234234 n 4523443434443342344345445343223123323342433423434434345344532334321222 n 10 , n 7654321265432243212322333543212432232122332122232126543234323432334323 n 2343234334343454322332122233322312233234233212225432344323234323423343 n 4344323333432123223122122323233322231432123223232122232333223154323323 n 3432333323354333233434334234322212232231543332343325434433443233232121 n 210 , n 7654322354321243223212323543223321232232332231233235432344323423433234 n 2344344345344543212332231233212323233234343223235432343234234323434333 n 4454234334432232123232232332343123232432232123232232323431223254334323 n 3433433423343233343234434343212223212232432333323335434343443323332212 n 2110 , n 5432234532123410123123434432345212341233422342343343223451234523442345 n 3454453456455621234501232344123423342345344123333234561234345234534434 n 5455234434212342345232343443454343453101231234341233323442334221234234 n 4523443434432342344345445343234123323342434523434434456344534444423444 n 12330 , n 6543223443212321012112323432234211230122332231232234322342123412333234 n 2343342345344532123410121233212312231234233012224323452123234223423323 n 4344123323321232234121232332343232342210121123230122212331223132123223 n 3412332323332231233234334232123012212231323412323324345233443333332333 n 212210 , n 6543345643234521234234545432345323452344523453454453212342234534551234 n 3455342345454532234512343455234534453345454234444334562345456345645534 n 5565345545323453456343454552344344454212342345452344434553445321234234 n 4523443434432343455345545454345234434343545634545445445344544344334454 n 2344120 , n 7654334554323432123223434543234322341233432342343344321233223423442123 n 2344233234343443223421232344323423342234343123335433453234345334534423 n 4454234434432343345232343441233233343321232234341233323442334232123223 n 3412332323343232344234434343234123323232434523434334334233443233243343 n 32332110 , n 6543456743234532345345656321234223453455612343455342101231123423440123 n 2344231234343432123422343455123434342234343334443223451234345234534423 n 4454234434323452345452344541233234344212342345452344423443434310123123 n 3412332323321232344234434343234345534233434534545344334233443233244343 n 344523120 }; n int T; n cin >> T; n for (int t = 0; t < T; ++t) { n int a, b; n cin >> a >> b; n vector F, G; n fact(a, F); n fact(b, G); n int i = IDX[F], j = IDX[G]; n if (i < j) swap(i, j); n cout << (DIST[i][j] - 0 ) << n ; n } n } n }; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n TaskD solver; n std::istream& in(std::cin); n std::ostream& out(std::cout); n solver.solve(in, out); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n vector> G[262144]; n int d1[26][262144]; n pair d2[2][262144]; n int vis[2][262144]; n long long mod = 998244353ll; n long long qpow(long long x, long long y) { n long long a = x, ans = 1; n while (y) { n if (y & 1) ans = (ans * a) % mod; n y >>= 1; n a = (a * a) % mod; n } n return ans; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> n >> m; n for (int i = 0; i < m; i++) { n int u, v; n cin >> u >> v; n G[u].push_back(make_pair(v, 0)); n G[v].push_back(make_pair(u, 1)); n } n queue> q; n q.push(make_pair(0, 1)); n for (int i = 1; i <= n; i++) n for (int j = 0; j <= 25; j++) d1[j][i] = -1; n d1[0][1] = 0; n while (!q.empty()) { n pair top = q.front(); n q.pop(); n int flips = top.first, u = top.second; n for (auto i : G[u]) { n int v = i.first, f = i.second; n int flip = ((flips & 1) ^ f); n if (flips + flip > 25) continue; n if (d1[flips + flip][v] == -1) { n d1[flips + flip][v] = d1[flips][u] + 1; n q.push(make_pair(flips + flip, v)); n } n } n } n int ans = 2100000000; n for (int j = 0; j <= 25; j++) n if (d1[j][n] != -1) { n ans = min(ans, (1 << j) - 1 + d1[j][n]); n } n if (ans < 2100000000) { n cout << ans << endl; n return 0; n } n priority_queue, pair>> q2; n q2.push(make_pair(make_pair(0, 0), make_pair(0, 1))); n for (int i = 1; i <= n; i++) n for (int j = 0; j <= 1; j++) d2[j][i] = make_pair(2100000000, 2100000000); n d2[0][1] = make_pair(0, 0); n while (!q2.empty()) { n pair, pair> top = q2.top(); n q2.pop(); n int flipsbit = top.second.first, u = top.second.second; n if (vis[flipsbit][u]) continue; n vis[flipsbit][u] = 1; n int flips = d2[flipsbit][u].first, dist = d2[flipsbit][u].second; n for (auto i : G[u]) { n int v = i.first, f = i.second; n int flip = (flipsbit ^ f); n int vflipsbit = ((flips + flip) & 1); n pair dv = make_pair(flips + flip, dist + 1); n if (d2[vflipsbit][v] > dv) { n d2[vflipsbit][v] = dv; n q2.push(make_pair(make_pair(-dv.first, -dv.second), n make_pair(vflipsbit, v))); n } n } n } n int flips = d2[0][n].first, dist = d2[0][n].second; n if (d2[1][n].first < d2[0][n].first) { n flips = d2[1][n].first, dist = d2[1][n].second; n } n long long ans2 = (qpow(2, flips) + dist - 1) % mod; n cout << ans2 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n long long ans = 0; n for (int i = (0); i < (n); ++i) { n long long t, T, x, cost; n cin >> t >> T >> x >> cost; n if (t >= T) { n ans += cost + m * x; n continue; n } n long long aux1 = cost; n if (m > (T - t)) aux1 += m * x; n long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1; n aux2 *= cost; n ans += min(aux1, aux2); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n scanf( %d %d , &n, &m); n vector att, def, my(m); n for (int i = 0; i < n; i++) { n char a, b, c; n int s; n scanf( %c%c%c %d , &a, &b, &c, &s); n if (a == A ) n att.push_back(s); n else n def.push_back(s); n } n for (int i = 0; i < m; i++) { n scanf( %d , &my[i]); n } n sort(att.begin(), att.end()); n sort(def.begin(), def.end()); n sort(my.begin(), my.end()); n int res = 0; n vector used(m, 0); n int pres = 0; n int cm = 0; n for (int i = 0; i < def.size(); i++) { n while (my[cm] <= def[i] || used[cm]) { n cm++; n if (cm >= m) { n pres = -1023456789; n break; n } n } n if (cm < m) { n used[cm] = 1; n } else n break; n } n if (pres > -1023456789) { n cm = 0; n for (int i = 0; i < att.size(); i++) { n while (my[cm] < att[i] || used[cm]) { n cm++; n if (cm >= m) { n pres = -1023456789; n break; n } n } n if (cm < m) { n used[cm] = 1; n pres += my[cm] - att[i]; n } else n break; n } n } n if (pres > -1023456789) { n for (int i = 0; i < m; i++) n if (!used[i]) pres += my[i]; n } n res = max(res, pres); n for (int i = 1; i <= min(m, (int)(att.size())); i++) { n int suc = 0; n for (int j = 0; j < i; j++) { n if (my[m - i + j] >= att[j]) { n suc += my[m - i + j] - att[j]; n } else n suc = -1023456789; n } n res = max(res, suc); n } n printf( %d n , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n long long a[1010]; n long long ans; n long long vis[1010]; n map mp; n void dfs(long long x, long long y, long long cnt) { n ans = max(cnt, ans); n if (mp[x + y]) { n mp[x + y]--; n dfs(y, x + y, cnt + 1); n mp[x + y]++; n } n } n int main() { n while (cin >> n) { n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int i = 1; i <= n; i++) mp[a[i]]++; n long long kk = 0; n for (int i = 1; i <= n; i++) n if (a[i] == 0) kk++; n ans = 0; n for (int i = 0; i <= n; i++) vis[i] = 0; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n if (i != j) { n if (a[i] == 0 && a[j] == 0) { n ans = max(ans, kk); n continue; n } n mp[a[i]]--; n mp[a[j]]--; n dfs(a[i], a[j], 2); n mp[a[i]]++, mp[a[j]]++; n } n } n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int t[24], n; n bool ok(int n) { n set u; n int e = 0; n for (int(i) = (0); (i) < (n); (i)++) n for (int(j) = (0); (j) < (i); (j)++) { n e++; n u.insert(abs(t[i] + t[j])); n } n return (e == u.size()); n } n int main() { n scanf( %d , &n); n for (int(i) = (0); (i) < (n); (i)++) { n t[i] = i; n while (!ok(i + 1)) t[i]++; n } n for (int(i) = (0); (i) < (n); (i)++) { n for (int(j) = (0); (j) < (n); (j)++) n printf( %d , i == j ? 0 : abs(t[i] + t[j])); n puts( ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int sum; n cin >> sum; n int a, b, c = -1; n for (int i = 0; i * 7 <= sum; i++) { n if ((sum - i * 7) % 4 == 0) { n int j = (sum - i * 7) / 4; n if (c == -1 || i + j < c) { n c = i + j; n a = j; n b = i; n } n } n } n if (c == -1) n cout << -1; n else { n for (int i = 0; i < a; i++) cout << 4 ; n for (int j = 0; j < b; j++) cout << 7 ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, l, r; n vector A[200001]; n set > se; n void add(long long y) { n for (auto b : A[y]) se.insert({b, y}); n } n void del(long long y) { n for (auto b : A[y]) se.erase({b, y}); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> n >> m >> l >> r; n for (long long i = 1; i <= 200000; ++i) n for (long long j = i; j <= 200000; j += i) n if (j <= 200000) A[j].push_back(i); n long long L = m + 1; n long long R = m; n for (long long x = 1; x <= n; ++x) { n long long L_ = (l + x - 1) / x; n long long R_ = min(m, r / x); n if (L_ > R_) goto L1; n while (L > L_) add(--L); n while (R > R_) del(R--); n for (long long a : A[x]) { n auto it = se.upper_bound({a + 1, 0}); n if (it != se.end()) { n long long b = it->first; n long long y = it->second; n if (x * b <= n * a) { n cout << x << << y << << x * b / a << << y * a / b; n goto L2; n } n } else n goto L1; n } n L1: n cout << -1; n L2: n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n static int vv[100][100], tt[100][100], kk[100]; n int n, s, h, i, j, k, t, t_, d1, d2, cnt, lead; n scanf( %d%d , &n, &s); n for (i = 0; i < n; i++) { n scanf( %d , &kk[i]); n for (j = 0; j < kk[i]; j++) scanf( %d%d , &vv[i][j], &tt[i][j]); n for (j = 1; j < kk[i]; j++) tt[i][j] += tt[i][j - 1]; n } n cnt = 0; n for (h = 0; h < n; h++) n for (i = 0; i < n; i++) n if (h != i) n for (lead = 1, d1 = d2 = 0, j = k = 0, t = 0; j < kk[h] && k < kk[i];) { n if (tt[h][j] < tt[i][k]) n t_ = tt[h][j]; n else n t_ = tt[i][k]; n if (t != t_) { n if ((d1 < d2 || (d1 == d2 && !lead)) && n d1 + vv[h][j] * (t_ - t) > d2 + vv[i][k] * (t_ - t)) n cnt++; n d1 += vv[h][j] * (t_ - t); n d2 += vv[i][k] * (t_ - t); n if (d1 != d2) lead = d1 > d2; n } n if (tt[h][j] < tt[i][k]) n j++; n else n k++; n t = t_; n } n printf( %d n , cnt); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-8; n long long ii = 1; n vector prime; n bitset<1000000> bs; n void sieve() { n bs.set(); n bs[0] = bs[1] = 0; n prime.push_back(2); n for (long long i = 3; i <= 1000000; i += 2) { n if (bs[i]) { n for (long long j = i * i; j <= 1000000; j += i) bs[j] = 0; n prime.push_back(i); n } n } n } n void solve() { n long long n; n cin >> n; n long long l = 0; n long long r = prime.size() - 1; n long long p = sqrt(n); n while (l <= r) { n long long mid = (l + r) / 2; n if (prime[mid] <= p) n l = mid + 1; n else n r = mid - 1; n } n long long cn = l - 1; n l = 0; n r = prime.size() - 1; n while (l <= r) { n long long mid = (l + r) / 2; n if (prime[mid] <= n) n l = mid + 1; n else n r = mid - 1; n } n cout << r - cn + 1 << n ; n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long TestCase; n sieve(); n cin >> TestCase; n while (TestCase--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Lem { n int m, v, id; n bool operator<(Lem b) const { return m < b.m || (m == b.m && v < b.v); } n }; n int n, k, h; n Lem a[(100000 + 10)]; n bool can(long double t) { n int j = k; n for (int i(n - 1), _l(0); i >= _l; --i) { n if (j > 0 && (long double)j * h / a[i].v - t <= -1e-7) j--; n } n return j == 0; n } n void putAns(long double t) { n int ans[(100000 + 10)]; n int j = k; n for (int i(n - 1), _l(0); i >= _l; --i) { n if (j > 0 && (long double)j * h / a[i].v - t <= -1e-7) ans[--j] = a[i].id; n } n for (int i(0), _n(k - 1); i < _n; ++i) printf( %d , ans[i]); n printf( %d n , (ans[k - 1])); n } n int main() { n scanf( %d , &(n)), scanf( %d , &(k)), scanf( %d , &(h)); n for (int i(0), _n(n); i < _n; ++i) scanf( %d , &(a[i].m)), a[i].id = i + 1; n for (int i(0), _n(n); i < _n; ++i) scanf( %d , &(a[i].v)); n sort(a, a + n); n long double l = 0, r = 1e10; n int cnt = 100; n while (cnt--) { n long double mid = (l + r) / 2.0; n if (can(mid)) n r = mid; n else n l = mid; n } n putAns(r); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, k, l, r; n int rd() { n int re = 0, f = 1; n char c = getchar(); n while ((c < 0 ) || (c > 9 )) { n if (c == - ) f = -f; n c = getchar(); n } n while ((c >= 0 ) && (c <= 9 )) { n re = re * 10 + c - 0 ; n c = getchar(); n } n return re * f; n } n int main() { n cin >> m >> k; n cin >> n; n l = (n > k) ? (n - k) : 0; n r = (m < n) ? m : n; n cout << (r - l + 1) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 130; n int a[MAXN]; n int main() { n int N; n cin >> N; n for (int i = 1; i < (N + 1); ++i) cin >> a[i]; n bool ok = 0; n if ((a[N] & 1) == 0 || (a[1] & 1) == 0) n ok = 0; n else if (N & 1) n ok = 1; n if (ok) n cout << Yes << endl; n else n cout << No << endl; n } n "} +{"func_code_string": "#include n using namespace std; n struct segment_tree { n long long a[1 << 20][5]; n int sz[1 << 20]; n int N; n void initi(int x) { n N = 1; n while (N < x) N <<= 1; n } n void pushup(int x) { n int pos = x + N - 1; n while (x > 0) { n x = (x - 1) >> 1; n sz[x] = sz[(x << 1) + 1] + sz[(x << 1) + 2]; n for (int i = 0; i < 5; i++) a[x][i] = 0; n for (int i = 0; i < 5; i++) { n a[x][i] += a[(x << 1) + 1][i]; n a[x][(i + sz[(x << 1) + 1]) % 5] += a[(x << 1) + 2][i]; n } n } n } n void ins(int x, int y) { n int pos = x + N - 1; n sz[pos]++; n a[pos][0] = y; n pushup(pos); n } n void del(int x) { n int pos = x + N - 1; n sz[pos]--; n a[pos][0] = 0; n pushup(pos); n } n } tr; n int n; n int s[100010]; n vector v; n vector vc; n map mp; n int l; n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n string t; n int x; n cin >> t; n if (t == add ) { n cin >> x; n v.push_back(x); n vc.push_back(x); n } else if (t == del ) { n cin >> x; n v.push_back(-x); n } else { n v.push_back(0); n } n } n sort(vc.begin(), vc.end()); n tr.initi((int)vc.size()); n for (int i = 0; i < vc.size(); i++) { n mp[vc[i]] = i; n } n for (int i = 0; i < v.size(); i++) { n if (!v[i]) { n printf( %lld n , tr.a[0][2]); n } else if (v[i] < 0) { n tr.del(mp[-v[i]]); n } else { n tr.ins(mp[v[i]], v[i]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n void answer(int u) { n printf( ! %d n , u); n fflush(stdout); n } n int ask(int u) { n printf( ? %d n , u); n fflush(stdout); n int res; n scanf( %d , &res); n return res; n } n bool inside(int u, pair v) { n return ((u > v.first) ^ (u >= v.second)) == 1; n } n bool check(pair u, pair v) { n if (inside(u.first, v) && inside(u.second, v)) { n return 1; n } n if (inside(v.first, u) && inside(v.second, u)) { n return 1; n } n if (inside(u.first, v) && inside(v.first, u)) { n return 1; n } n if (inside(u.second, v) && inside(v.second, u)) { n return 1; n } n return 0; n } n int main() { n int n; n scanf( %d , &n); n if ((n / 2) % 2 != 0) { n answer(-1); n return 0; n } n int x = ask(1); n int y = ask(1 + n / 2); n if (x == y) { n answer(1); n return 0; n } n pair u(x, y); n pair v(y, x); n int low = 1, high = n / 2 + 1; n while (high - low > 1) { n int mid = (high + low) / 2; n int foo = ask(mid); n int bar = ask(mid + n / 2); n if (foo == bar) { n answer(mid); n return 0; n } n pair a(u.first, foo); n pair b(v.first, bar); n if (check(a, b)) { n high = mid; n u = a; n v = b; n } else { n low = mid; n u = make_pair(foo, u.second); n v = make_pair(bar, v.second); n } n } n answer(low); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INFL = (int)1e9; n const long long int INFLL = (long long int)1e18; n const double INFD = numeric_limits::infinity(); n const double PI = 3.14159265358979323846; n bool nearlyeq(double x, double y) { return abs(x - y) < 1e-9; } n bool inrange(int x, int t) { return x >= 0 && x < t; } n long long int rndf(double x) { n return (long long int)(x + (x >= 0 ? 0.5 : -0.5)); n } n long long int floorsqrt(long long int x) { n long long int m = (long long int)sqrt((double)x); n return m + (m * m <= x ? 0 : -1); n } n long long int ceilsqrt(long long int x) { n long long int m = (long long int)sqrt((double)x); n return m + (x <= m * m ? 0 : 1); n } n long long int rnddiv(long long int a, long long int b) { n return (a / b + (a % b * 2 >= b ? 1 : 0)); n } n long long int ceildiv(long long int a, long long int b) { n return (a / b + (a % b == 0 ? 0 : 1)); n } n long long int gcd(long long int m, long long int n) { n if (n == 0) n return m; n else n return gcd(n, m % n); n } n long long int lcm(long long int m, long long int n) { n return m * n / gcd(m, n); n } n class Max_Queue { n private: n stack > stk0, stk1; n void rebuffer() { n while (stk1.size()) { n long long int x = stk1.top().first; n long long int y = stk0.size() ? stk0.top().second : LLONG_MIN; n stk0.push({x, max(x, y)}); n stk1.pop(); n } n } n n public: n void push(long long int x) { n long long int y = stk1.size() ? stk1.top().second : LLONG_MIN; n stk1.push({x, max(x, y)}); n } n long long int front() { n if (stk0.empty()) rebuffer(); n return stk0.top().first; n } n void pop() { n if (stk0.empty()) rebuffer(); n stk0.pop(); n } n size_t size() { return stk0.size() + stk1.size(); } n void clear() { n while (stk0.size()) stk0.pop(); n while (stk1.size()) stk1.pop(); n } n long long int get_max() { n long long int x = LLONG_MIN, y = LLONG_MIN; n if (stk0.size()) x = stk0.top().second; n if (stk1.size()) y = stk1.top().second; n return max(x, y); n } n }; n long long int dist(long long int s, long long int t, long long int n) { n if (s <= t) n return t - s; n else n return t + n - s; n } n int main() { n int n, m; n cin >> n >> m; n vector a(n, LLONG_MAX); n vector cnt(n, 0); n for (int i = 0; i < (int)(m); i++) { n long long int s, t; n cin >> s >> t; n s--; n t--; n a[s] = min(a[s], dist(s, t, n)); n cnt[s]++; n } n vector ans(n, 0); n Max_Queue mq; n for (int j = 0; j < (int)(n); j++) { n long long int buf = -n; n if (cnt[j] > 0) buf = dist(0, j, n) + (cnt[j] - 1) * n + a[j]; n mq.push(buf); n } n for (int i = 0; i < (int)(n); i++) { n ans[i] = mq.get_max() - i; n long long int x = mq.front(); n mq.pop(); n mq.push(x + n); n } n for (int extra_i = 0; extra_i < (int)(ans.size()); extra_i++) { n cout << ans[extra_i] << ; n } n cout << endl; n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n for (int i = 0; i < n; i++) { n cout << 1 << ; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void display(vector v1) { n for (long long int i = 0; i < v1.size(); i++) { n cout << v1[i] << ; n } n cout << endl; n } n long long int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1}; n long long int dy[8] = {1, 0, -1, 0, 1, -1, 1, -1}; n int n, dp[9000][2]; n vector v1[2]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> n; n memset(dp, -1, sizeof(dp)); n for (int p = 0, k; p < 2; p += 1) { n cin >> k; n v1[p].resize(k); n for (long long int i = 0; i < k; i++) { n cin >> v1[p][i]; n } n } n dp[1][0] = 0; n dp[1][1] = 0; n bool flag = true; n while (flag) { n flag = false; n for (int i = n; i >= 2; i--) n for (int p = 0; p < 2; p++) n if (dp[i][p] == -1) { n bool can = false; n for (int x : v1[p]) { n int nxt = (i + x) % n + n * !bool((i + x) % n); n if (!dp[nxt][p ^ 1]) { n dp[i][p] = 1; n flag = true; n can = true; n break; n } else if (dp[nxt][p ^ 1] == -1) n can = true; n } n if (!can) dp[i][p] = 0, flag = true; n } n } n for (int p = 0; p < 2; p++) { n for (int i = 2; i <= n; i++) { n if (dp[i][p] == -1) { n cout << Loop ; n } else if (dp[i][p] == 1) { n cout << Win ; n } else { n cout << Lose ; n } n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 998244353; n const int N = 5e5 + 5; n long long l[N], r[N], x[N], d[N], s[N], pre[N], dp[N]; n int n, m; n inline long long solve(int u) { n for (int i = 1; i <= n; i++) d[i] = s[i] = pre[i] = 0; n for (int i = 1; i <= m; i++) { n if (x[i] >> u & 1) { n d[r[i] + 1]--; n d[l[i]]++; n } else { n pre[r[i]] = max(pre[r[i]], l[i]); n } n } n dp[0] = s[0] = 1; n for (int i = 1; i <= n; i++) { n d[i] += d[i - 1]; n pre[i] = max(pre[i], pre[i - 1]); n if (d[i] > 0) n dp[i] = 0; n else if (pre[i - 1] > 0) n dp[i] = (s[i - 1] - s[pre[i - 1] - 1]) % mod; n else n dp[i] = s[i - 1]; n s[i] = (s[i] + s[i - 1] + dp[i]) % mod; n } n return pre[n] == 0 ? s[n] % mod : (s[n] - s[pre[n] - 1]) % mod; n } n int main() { n int k; n scanf( %d%d%d , &n, &k, &m); n for (int i = 1; i <= m; i++) scanf( %lld%lld%lld , &l[i], &r[i], &x[i]); n long long ans = 1; n for (int i = 0; i < k; i++) ans = ans * solve(i) % mod; n printf( %lld n , (ans + mod) % mod); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mod = 1e9 + 7; n int inf = 1e9; n double eps = 1e-6; n int main() { n int n, k; n cin >> n >> k; n vector a; n for (int i = 0; i < n; i++) { n int t; n cin >> t; n a.push_back(t); n } n if (k == 1) { n int ans = a[0]; n for (int i = 1; i < n; i++) { n ans = min(ans, a[i]); n } n cout << ans; n } else if (k > 2) { n int ans = a[0]; n for (int i = 1; i < n; i++) { n ans = max(ans, a[i]); n } n cout << ans; n } else { n int ans = INT_MIN; n multiset p; n multiset q; n p.insert(a[0]); n for (int i = 1; i < n; i++) { n q.insert(a[i]); n } n ans = max(ans, max(*q.begin(), *p.begin())); n for (int i = 1; i < n - 1; i++) { n p.insert(a[i]); n q.erase(q.find(a[i])); n ans = max(ans, max(*q.begin(), *p.begin())); n } n cout << ans; n } n return 0; n } n "} +{"func_code_string": "#include n int a[100005] = {}; n int p[100005] = {}; n int mbuy[100005] = {}; n int main() { n std::ios_base::sync_with_stdio(false); n std::cin.tie(NULL); n std::cout.tie(NULL); n int n, currmin = 1000000, buy = 0, last = 0; n std::cin >> n; n for (int i = 0; i < n; i++) std::cin >> a[i] >> p[i]; n for (int i = 0; i < n; i++) { n if (p[i] < currmin) { n mbuy[last] = buy; n currmin = p[i]; n last = i; n buy = 0; n } n buy += a[i]; n } n mbuy[last] = buy; n long long int ans = 0; n for (int i = 0; i < n; i++) { n ans += mbuy[i] * p[i]; n } n std::cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5; n const int inf = 1e7; n int tree[4 * N + 100], ans[2 * N + 100]; n vector R[N + 100], C[N + 100]; n vector, pair > > qr[N + 100], qc[N + 100]; n void update(int v, int tl, int tr, int idx, int val) { n if (tl == tr) { n tree[v] = val; n } else { n int tm = (tl + tr) / 2; n if (idx <= tm) { n update(v * 2, tl, tm, idx, val); n } else { n update(v * 2 + 1, tm + 1, tr, idx, val); n } n tree[v] = min(tree[v * 2], tree[v * 2 + 1]); n } n } n int getMin(int v, int tl, int tr, int l, int r) { n if (l > r) { n return inf; n } n if (l == tl && r == tr) { n return tree[v]; n } n int tm = (tl + tr) / 2; n return min(getMin(v * 2, tl, tm, l, min(r, tm)), n getMin(v * 2 + 1, tm + 1, tr, max(tm + 1, l), r)); n } n int main() { n int n, m, k, q; n scanf( %d%d%d%d , &n, &m, &k, &q); n for (int i = 1; i <= k; i++) { n int x, y; n scanf( %d%d , &x, &y); n R[y].push_back(x); n C[x].push_back(y); n } n for (int i = 1; i <= q; i++) { n int x1, y1, x2, y2; n scanf( %d%d%d%d , &x1, &y1, &x2, &y2); n qc[x2].push_back(make_pair(make_pair(y1, y2), make_pair(x1, i))); n qr[y2].push_back(make_pair(make_pair(x1, x2), make_pair(y1, i))); n } n memset(tree, 0, sizeof tree); n for (int i = 1; i <= n; i++) { n for (auto it : C[i]) { n update(1, 1, m, it, i); n } n for (auto it : qc[i]) { n int mn = getMin(1, 1, m, it.first.first, it.first.second); n if (mn >= it.second.first) { n ans[it.second.second] = 1; n } n } n } n memset(tree, 0, sizeof tree); n for (int i = 1; i <= m; i++) { n for (auto it : R[i]) { n update(1, 1, n, it, i); n } n for (auto it : qr[i]) { n int mn = getMin(1, 1, n, it.first.first, it.first.second); n if (mn >= it.second.first) { n ans[it.second.second] = 1; n } n } n } n for (int i = 1; i <= q; i++) { n if (ans[i]) { n printf( YES n ); n } else { n printf( NO n ); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1 << 30; n const long long INF = 1ll << 60; n const double Inf = 1e20; n const double eps = 1e-9; n void gmax(int &a, int b) { a = (a > b ? a : b); } n void gmin(int &a, int b) { a = (a < b ? a : b); } n const int P = 1e9 + 7; n const int maxn = 1000050; n int n, m, x[5], y[5], sz[maxn], Ans; n set key; n map id, g; n vector adj[maxn]; n bool vis[maxn]; n int calc(int x) { n int l = x, r = x, ret = 0; n while (l <= n) { n ret = (ret + min(r, n) - l + 1) % P; n l = l << 1; n r = r << 1 | 1; n } n return ret; n } n void dfs(int x, int t) { n Ans = (Ans + 1ll * sz[x] * t) % P; n vis[x] = true; n for (auto p : adj[x]) n if (!vis[p]) dfs(p, t); n vis[x] = false; n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; ++i) { n scanf( %d%d , &x[i], &y[i]); n int t = x[i]; n while (t) { n key.insert(t); n t >>= 1; n } n t = y[i]; n while (t) { n key.insert(t); n t >>= 1; n } n } n key.insert(1); n for (auto p : key) { n if (key.find(p << 1) == key.end() && key.find(p << 1 | 1) == key.end()) n g[p] = calc(p); n else { n g[p] = 1; n if (key.find(p << 1) == key.end() && (p << 1) <= n) n g[p << 1] = calc(p << 1); n if (key.find(p << 1 | 1) == key.end() && (p << 1 | 1) <= n) n g[p << 1 | 1] = calc(p << 1 | 1); n } n } n for (pair p : g) { n id[p.first] = ((int)(id).size()); n sz[id[p.first]] = p.second; n } n for (pair p : id) n if (p.first != 1) { n adj[id[p.first >> 1]].push_back(p.second); n adj[p.second].push_back(id[p.first >> 1]); n } n for (int i = 1; i <= m; ++i) n adj[id[x[i]]].push_back(id[y[i]]), adj[id[y[i]]].push_back(id[x[i]]); n for (pair p : id) dfs(p.second, sz[p.second]); n printf( %d n , Ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5e5 + 7; n const int MX = 1e9 + 7; n const long long int INF = 1e18 + 9LL; n int n, m, k; n long long int value[N]; n pair > edge[N]; n int pt[N]; n int rep[N]; n int res = 0; n int Find(int a) { n if (rep[a] == a) return a; n return rep[a] = Find(rep[a]); n } n bool Union(int a, int b) { n a = Find(a), b = Find(b); n if (a == b) return false; n rep[a] = b; n return true; n } n void solve(int from, int to) { n int cnt = n; n for (int i = from; i <= to; ++i) n if (Union(edge[i].second.first, edge[i].second.second)) --cnt; n res = (res + pt[cnt]) % MX; n for (int i = from; i <= to; ++i) n rep[edge[i].second.first] = edge[i].second.first, n rep[edge[i].second.second] = edge[i].second.second; n } n int main() { n scanf( %d %d %d , &n, &m, &k); n for (int i = 1; i <= n; ++i) { n scanf( %lld , &value[i]); n rep[i] = i; n } n pt[0] = 1; n for (int i = 1; i < N; ++i) pt[i] = (pt[i - 1] + pt[i - 1]) % MX; n for (int i = 1; i <= m; ++i) { n int u, v; n scanf( %d %d , &u, &v); n edge[i] = {value[u] ^ value[v], {u, v}}; n } n long long int ok = pt[k]; n sort(edge + 1, edge + m + 1); n for (int i = 1; i <= m; ++i) { n int t = i; n while (t < m && edge[t + 1].first == edge[t].first) ++t; n solve(i, t); n i = t; n --ok; n } n res = (res + 1LL * pt[n] * (ok % MX)) % MX; n printf( %d n , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n string s; n while (n--) cin >> s; n bool wall = false; n int segments = 0, i = 0; n while (i < s.size()) { n if (!wall && s[i] == B ) { n segments++; n wall = true; n } else if (wall && s[i] == . ) { n wall = false; n } n i++; n } n cout << segments << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = (long long)1e18; n const int mod = (int)1e9 + 7; n const int MAXN = (int)3e5 + 5; n long long n; n string s; n bool vr[27]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n cin >> s; n for (int i = 0; i < s.length(); i++) { n if (s[i] == a ) { n vr[0] = 1; n cout << Mike << n ; n } else { n bool cnt = 1; n for (int j = 0; j < s[i] - a ; j++) { n if (vr[j]) { n cnt = 0; n cout << Ann << n ; n break; n } n } n if (cnt) { n vr[s[i] - a ] = true; n cout << Mike << n ; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int nax = 200005; n const int mod = 998244353; n vector graph[nax]; n vector degree(nax); n vector level(nax); n vector vis(nax); n vector parent(nax); n vector str[nax]; n void dfs(int node, int l) { n vis[node] = 1; n level[node] = l + 1; n str[l + 1].push_back(node); n int d = 0; n for (auto i : graph[node]) { n if (vis[i] == 0) { n dfs(i, l + 1); n parent[i] = node; n d++; n } n } n degree[node] = d; n return; n } n void solve() { n int n; n cin >> n; n for (int i = 1; i < n + 1; i++) degree[i] = 0; n for (int i = 1; i < n + 1; i++) level[i] = 0; n for (int i = 1; i < n + 1; i++) parent[i] = 0; n for (int i = 1; i < n + 1; i++) vis[i] = 0; n for (int i = 1; i <= n; ++i) { n graph[i].clear(); n str[i].clear(); n } n for (int i = 0; i < n - 1; i++) { n int a, b; n cin >> a >> b; n graph[a].push_back(b); n graph[b].push_back(a); n } n dfs(1, 0); n int ans = 0; n for (int i = 1; i < n + 1; i++) n if (degree[i] == 0) ans++; n vector rem(n + 1); n for (int i = n; i >= 2; i--) { n for (auto item : str[i]) { n if (degree[item] == 0) continue; n int check = 1; n for (auto child : graph[item]) { n if (level[child] > level[item] && rem[child] == 0) { n check = check & (!degree[child]); n } n } n if (check) { n rem[item] = 1; n degree[parent[item]]--; n if (degree[parent[item]] > 0) ans--; n } n } n } n cout << ans << endl; n return; n } n int main() { n int T; n T = 1; n scanf( %d , &T); n while (T--) { n solve(); n } n } n "} +{"func_code_string": "#include n int main() { n int t; n scanf( %d , &t); n while (t--) { n int n; n scanf( %d , &n); n int flag; n if (n & 1) { n flag = 2; n for (int i = 1, tmp; i <= n; i++) { n scanf( %1d , &tmp); n if ((i & 1) && (tmp & 1)) flag = 1; n } n printf( %d n , flag); n } else { n flag = 1; n for (int i = 1, tmp; i <= n; i++) { n scanf( %1d , &tmp); n if (!(i & 1) && !(tmp & 1)) flag = 2; n } n printf( %d n , flag); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const string T = abacaba ; n bool check(string s) { n int cnt = 0; n for (int i = 0; i < s.length() - 6; i++) n if (s.substr(i, 7) == T) cnt++; n return (cnt == 1); n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n int n, f = 0, q = 0, qq = 0, p = 0; n cin >> n; n string s; n cin >> s; n bool flag = true; n for (int i = 0; i < n - 6; i++) { n string ss = s; n bool f = true; n for (int j = 0; j < 7; j++) { n if (s[i + j] != T[j] && s[i + j] != ? ) { n f = false; n break; n } n ss[i + j] = T[j]; n } n if (f && check(ss)) { n flag = false; n cout << Yes << endl; n for (int i = 0; i < n; i++) cout << ((ss[i] == ? ) ? z : ss[i]); n cout << endl; n break; n } n } n if (flag) cout << No n ; n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int i = 0, j = 0, l, k; n char a[100], s[100], shift; n scanf( %c , &shift); n scanf( %s , a); n l = strlen(a); n for (k = 0; k < l; k++) { n if (shift == R && i <= l && a[i] == w ) { n a[i] = q ; n i++; n } else if (shift == R && i <= l && a[i] == e ) { n a[i] = w ; n i++; n } else if (shift == L && j < l && a[j] == w ) { n a[j] = e ; n j++; n } else if (shift == R && i <= l && a[i] == r ) { n a[i] = e ; n i++; n } else if (shift == L && j < l && a[j] == e ) { n a[j] = r ; n j++; n } else if (shift == R && i <= l && a[i] == t ) { n a[i] = r ; n i++; n } else if (shift == L && j < l && a[j] == r ) { n a[j] = t ; n j++; n } else if (shift == R && i <= l && a[i] == y ) { n a[i] = t ; n i++; n } else if (shift == L && j < l && a[j] == t ) { n a[j] = y ; n j++; n } else if (shift == R && i <= l && a[i] == u ) { n a[i] = y ; n i++; n } else if (shift == L && j < l && a[j] == y ) { n a[j] = u ; n j++; n } else if (shift == R && i <= l && a[i] == i ) { n a[i] = u ; n i++; n } else if (shift == L && j < l && a[j] == u ) { n a[j] = i ; n j++; n } else if (shift == R && i <= l && a[i] == o ) { n a[i] = i ; n i++; n } else if (shift == L && j < l && a[j] == i ) { n a[j] = o ; n j++; n } else if (shift == R && i <= l && a[i] == p ) { n a[i] = o ; n i++; n } else if (shift == L && j < l && a[j] == o ) { n a[j] = p ; n j++; n } else if (shift == R && i <= l && a[i] == s ) { n a[i] = a ; n i++; n } else if (shift == L && j < l && a[j] == a ) { n a[j] = s ; n j++; n } else if (shift == R && i <= l && a[i] == d ) { n a[i] = s ; n i++; n } else if (shift == L && j < l && a[j] == s ) { n a[j] = d ; n j++; n } else if (shift == R && i <= l && a[i] == f ) { n a[i] = d ; n i++; n } else if (shift == L && j < l && a[j] == d ) { n a[j] = f ; n j++; n } else if (shift == R && i <= l && a[i] == g ) { n a[i] = f ; n i++; n } else if (shift == L && j < l && a[j] == f ) { n a[j] = g ; n j++; n } else if (shift == R && i <= l && a[i] == h ) { n a[i] = g ; n i++; n } else if (shift == L && j < l && a[j] == g ) { n a[j] = h ; n j++; n } else if (shift == R && i <= l && a[i] == j ) { n a[i] = h ; n i++; n } else if (shift == L && j < l && a[j] == h ) { n a[j] = j ; n j++; n } else if (shift == R && i <= l && a[i] == k ) { n a[i] = j ; n i++; n } else if (shift == L && j < l && a[j] == j ) { n a[j] = k ; n j++; n } else if (shift == R && i <= l && a[i] == l ) { n a[i] = k ; n i++; n } else if (shift == L && j < l && a[j] == k ) { n a[j] = l ; n j++; n } else if (shift == R && i <= l && a[i] == ; ) { n a[i] = l ; n i++; n } else if (shift == L && j < l && a[j] == l ) { n a[j] = ; ; n j++; n } else if (shift == R && i <= l && a[i] == x ) { n a[i] = z ; n i++; n } else if (shift == L && j < l && a[j] == z ) { n a[j] = x ; n j++; n } else if (shift == R && i <= l && a[i] == c ) { n a[i] = x ; n i++; n } else if (shift == L && j < l && a[j] == x ) { n a[j] = c ; n j++; n } else if (shift == R && i <= l && a[i] == v ) { n a[i] = c ; n i++; n } else if (shift == L && j < l && a[j] == c ) { n a[j] = v ; n j++; n } else if (shift == R && i <= l && a[i] == b ) { n a[i] = v ; n i++; n } else if (shift == L && j < l && a[j] == v ) { n a[j] = b ; n j++; n } else if (shift == R && i <= l && a[i] == n ) { n a[i] = b ; n i++; n } else if (shift == L && j < l && a[j] == b ) { n a[j] = n ; n j++; n } else if (shift == R && i <= l && a[i] == m ) { n a[i] = n ; n i++; n } else if (shift == L && j < l && a[j] == n ) { n a[j] = m ; n j++; n } else if (shift == R && i <= l && a[i] == , ) { n a[i] = m ; n i++; n } else if (shift == L && j < l && a[j] == m ) { n a[j] = , ; n j++; n } else if (shift == R && i <= l && a[i] == . ) { n a[i] = , ; n i++; n } else if (shift == L && j < l && a[j] == , ) { n a[j] = . ; n j++; n } else if (shift == R && i <= l && a[i] == / ) { n a[i] = . ; n i++; n } else if (shift == L && j < l && a[j] == . ) { n a[j] = / ; n j++; n } else if (shift == L && j < l && a[j] == q ) { n a[j] = w ; n j++; n } n } n printf( %s , a); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int cnt[26]; n bool work() { n char ch; n while (isalpha(ch = getchar())) ++cnt[ch - a ]; n int c = 0; n for (int x = 0; x < 26; ++x) n if (cnt[x] & 1) ++c; n return c == 0 || (c & 1); n } n int main() { puts(work() ? First : Second ); } n "} +{"func_code_string": "#include n const int mod = 998244353; n using namespace std; n long long gcd(long long a, long long b) { n if (a == 0) return b; n return gcd(b % a, a); n } n long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } n long long power(long long x, long long y) { n long long res = 1; n while (y > 0) { n if (y & 1) res = res * x; n y = y >> 1; n x = x * x; n } n return res; n } n long long pwr(long long a, long long b) { n if (b == 0) { n return 1; n } n long long p = pwr(a, b / 2); n p = (p * p) % mod; n if (b % 2 != 0) { n p = (p * a) % mod; n } n return p; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long n, m; n cin >> n >> m; n string a, b; n cin >> a >> b; n reverse(a.begin(), a.end()); n reverse(b.begin(), b.end()); n while (m > n) { n a += 0 ; n n++; n } n while (n > m) { n b += 0 ; n m++; n } n reverse(a.begin(), a.end()); n reverse(b.begin(), b.end()); n long long ans = 0; n long long settillnow = 0; n for (long long i = 0; i < n; i++) { n if (b[i] == 1 ) { n settillnow++; n } n if (a[i] == 1 ) { n long long c = pwr(2, n - 1 - i); n c = (c * settillnow) % mod; n ans += c; n ans %= mod; n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n long long t, n, m, xa, ya, xb, yb; n scanf( %lld , &t); n while (t--) { n scanf( %lld%lld%lld%lld%lld%lld , &n, &m, &xa, &ya, &xb, &yb); n long long miny = min(ya, yb), minx = min(xa, xb), maxy = max(ya, yb), n maxx = max(xa, xb); n long long s = (m - (maxy - miny)) * (n - (maxx - minx)) * 2; n long long lx = n - (maxx - minx), ly = m - (maxy - miny); n long long len1 = max(0ll, lx - (maxx - minx + 1) + 1), n len2 = max(0ll, ly - (maxy - miny + 1) + 1); n printf( %lld n , max(0ll, n * m - (s - len1 * len2))); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int N = 5e3 + 7; n vector > v(N); n long long int cl[N]; n void dfs(long long int s, long long int c) { n if (cl[s] == -1 || cl[s] == c) return; n cl[s] = c; n for (auto it = v[s].begin(); it != v[s].end(); it++) { n if (cl[*it] != c) dfs(*it, c); n } n } n int main() { n long long int n, m, s, i, j, k; n cin >> n >> m >> s; n memset(cl, 0, sizeof cl); n for (i = 0; i < m; i++) { n scanf( %lld%lld , &j, &k); n v[j].push_back(k); n } n dfs(s, -1); n for (i = 1; i <= n; i++) { n if (!cl[i]) dfs(i, i); n } n set se; n for (i = 1; i <= n; i++) se.insert(cl[i]); n cout << se.size() - 1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e18; n const int INF = 0x3f3f3f3f; n int a[200010]; n int dp[1000010]; n int main() { n int n, m, k; n cin >> n >> m >> k; n for (int i = 0; i < n; i++) { n cin >> a[i]; n dp[a[i]] = 1; n } n int t = 0, p = 0; n int res = 0; n for (int i = 1; i <= 1e6; i++) { n t += dp[i]; n if (i > m) t -= dp[i - m]; n if (t == k) { n dp[i] = 0; n res++; n t--; n } n } n cout << res << endl; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, W, B, X, dp[1001][10001], c[1001], cum[1001], cost[1001]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n cin >> n >> W >> B >> X; n for (int i = 0; i < n; i++) { n cin >> c[i]; n if (i == 0) n cum[i] = c[i]; n else n cum[i] = cum[i - 1] + c[i]; n } n for (int i = 0; i < n; i++) cin >> cost[i]; n for (int i = 0; i < 1001; i++) n for (int j = 0; j < 10001; j++) dp[i][j] = 10000000000; n dp[0][0] = W; n for (int i = 0; i <= c[0]; i++) { n if (W >= i * cost[0]) dp[0][i] = W - i * cost[0]; n } n for (int i = 1; i < n; i++) { n for (int j = 0; j <= cum[i]; j++) { n for (int k = 0; k <= min((long long)j, c[i]); k++) { n if (dp[i - 1][j - k] != 10000000000) { n if (min(dp[i - 1][j - k] + X, W + (j - k) * B) - k * cost[i] >= 0) { n dp[i][j] = n max((dp[i][j] == 10000000000 ? 0 : dp[i][j]), n min(dp[i - 1][j - k] + X, W + (j - k) * B) - k * cost[i]); n } n } n } n } n } n for (int i = cum[n - 1]; i >= 0; i--) { n if (dp[n - 1][i] != 10000000000) return cout << i, 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int temp; n vector v; n long long int n; n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int t = 1; n cin >> t; n while (t--) { n long long int n, strt, cnst, lwr = 0, upr = 0, t, l, r, pt = 0, flag = 0; n cin >> n >> strt; n lwr = strt, upr = strt; n for (long long int i = 0; i < n; i++) { n cin >> t >> l >> r; n temp = t - pt; n lwr = lwr - temp; n upr = upr + temp; n if (lwr <= l && upr >= r) n lwr = l, upr = r; n else if (lwr <= l && upr <= r && upr >= l) n lwr = l; n else if (lwr >= l && upr >= r && lwr <= r) n upr = r; n else if (lwr > l && upr < r) n lwr = lwr, upr = upr; n else n flag = 1; n pt = t; n } n if (flag == 1) n cout << NO ; n else n cout << YES ; n cout << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n #pragma optimize( O3 ) n const int N = 200005; n int arr[N]; n int fst[1000000], lst[1000000]; n int minVal(int x, int y) { return (x < y) ? x : y; } n int getMid(int s, int e) { return s + (e - s) / 2; } n int RMQUtil(int *st, int ss, int se, int qs, int qe, int index) { n if (qs <= ss && qe >= se) return st[index]; n if (se < qs || ss > qe) return INT_MAX; n int mid = getMid(ss, se); n return minVal(RMQUtil(st, ss, mid, qs, qe, 2 * index + 1), n RMQUtil(st, mid + 1, se, qs, qe, 2 * index + 2)); n } n int RMQ(int *st, int n, int qs, int qe) { n if (qs < 0 || qe > n - 1 || qs > qe) { n printf( Invalid Input ); n return -1; n } n return RMQUtil(st, 0, n - 1, qs, qe, 0); n } n int constructSTUtil(int arr[], int ss, int se, int *st, int si) { n if (ss == se) { n st[si] = arr[ss]; n return arr[ss]; n } n int mid = getMid(ss, se); n st[si] = minVal(constructSTUtil(arr, ss, mid, st, si * 2 + 1), n constructSTUtil(arr, mid + 1, se, st, si * 2 + 2)); n return st[si]; n } n int *constructST(int arr[], int n) { n int x = (int)(ceil(log2(n))); n int max_size = 2 * (int)pow(2, x) - 1; n int *st = new int[max_size]; n constructSTUtil(arr, 0, n - 1, st, 0); n return st; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n, q; n cin >> n >> q; n for (int i = 1; i <= q; i++) fst[i] = lst[i] = -1; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n fst[arr[i]] = (fst[arr[i]] == -1 ? i : fst[arr[i]]); n lst[arr[i]] = i; n if (arr[i] == 0) arr[i] = INT_MAX; n } n int *st = constructST(arr, n); n for (int i = 1; i <= q; i++) { n if (fst[i] == -1) continue; n int a = RMQ(st, n, fst[i], lst[i]); n if (a < i) { n cout << NO << ( n ); n return 0; n } n } n if (lst[q] == -1) { n bool b = false; n for (int i = 0; i < n; i++) { n if (arr[i] == INT_MAX) { n b = true, arr[i] = q; n break; n } n } n if (!b) { n cout << NO << ( n ); n return 0; n } n } n vector pos; n for (int i = 0; i < n; i++) n if (arr[i] != INT_MAX) pos.push_back(i); n for (auto i : pos) { n int s = i - 1, e = i + 1; n bool poss = true; n while (poss) { n if (s >= 0 && arr[s] != INT_MAX) s = -1; n if (e < n && arr[e] != INT_MAX) e = n; n if (s >= 0) arr[s] = arr[i]; n if (e < n) arr[e] = arr[i]; n s--; n e++; n if (s < 0 && e >= n) poss = false; n } n } n cout << YES << ( n ); n for (int i = 0; i < n; i++) cout << arr[i] << ; n cout << ( n ); n } n "} +{"func_code_string": "#include n using namespace std; n template n bool umin(T& a, T b) { n if (a > b) { n a = b; n return 1; n } n return 0; n } n template n bool umax(T& a, T b) { n if (a < b) { n a = b; n return 1; n } n return 0; n } n int arr[100009], val[100009], n, k; n int ok(int x) { n long long res = 0; n for (int i = 1; i <= n; i++) res += (arr[i] + x - 1) / x; n return (res <= k); n } n long long f(int x, int y) { n int a = x % y, aa = x / y + 1; n int b = y - a, bb = x / y; n return aa * 1LL * aa * a + bb * 1LL * bb * b; n } n set > s; n int main() { n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; i++) { n scanf( %d , &arr[i]); n val[i] = 1; n if (arr[i] > 1) n s.insert(make_pair(f(arr[i], val[i] + 1) - f(arr[i], val[i]), i)); n } n for (int j = 0; j < k - n; j++) { n pair nd = *s.begin(); n s.erase(nd); n int i = nd.second; n val[i]++; n if (val[i] < arr[i]) n s.insert(make_pair(f(arr[i], val[i] + 1) - f(arr[i], val[i]), i)); n } n long long res = 0; n for (int i = 1; i <= n; i++) res += f(arr[i], val[i]); n printf( %lld n , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool check[41][41]; n int above[41][41]; n int dp[41][41][41][41]; n int main() { n int n, m, q, s1, s2, s3, s4; n char s[42]; n scanf( %d %d %d , &n, &m, &q); n for (int i = 1; i <= n; i++) { n scanf( %s , s + 1); n for (int j = 1; j <= m; j++) n if (s[j] == 0 ) check[i][j] = 1, above[i][j] = above[i - 1][j] + 1; n } n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n for (int k = i; k <= n; k++) n for (int l = j; l <= m; l++) { n dp[i][j][k][l] = n dp[i][j][k - 1][l] + dp[i][j][k][l - 1] - dp[i][j][k - 1][l - 1]; n int temp = min(k - i + 1, above[k][l]); n for (int p = l; p >= j; p--) { n temp = min(temp, above[k][p]); n if (temp == 0) n break; n else n dp[i][j][k][l] += temp; n } n } n for (int i = 0; i < q; i++) n scanf( %d %d %d %d , &s1, &s2, &s3, &s4), n printf( %d n , dp[s1][s2][s3][s4]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n long long n; n cin >> n; n set used; n for (int i = 2; i * i <= n; i++) { n if (n % i == 0 && !used.count(i)) { n used.insert(i); n n /= i; n break; n } n } n for (int i = 2; i * i <= n; i++) { n if (n % i == 0 && !used.count(i)) { n used.insert(i); n n /= i; n break; n } n } n if (used.size() < 2 || used.count(n) || n == 1) { n cout << NO << endl; n } else { n cout << YES n << n ; n used.insert(n); n for (auto it : used) cout << it << ; n cout << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int q; n cin >> q; n for (int i = 0; i < q; ++i) { n int n; n cin >> n; n vector a(n); n for (int j = 0; j < n; ++j) { n cin >> a[j]; n --a[j]; n } n int pos = 0; n while (pos < n) { n int nxt = min_element(a.begin() + pos, a.end()) - a.begin(); n int el = a[nxt]; n a.erase(a.begin() + nxt); n a.insert(a.begin() + pos, el); n if (pos == nxt) n pos = nxt + 1; n else n pos = nxt; n } n for (auto it : a) cout << it + 1 << ; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int ar[1000000], br[1000000]; n int main() { n int t; n cin >> t; n while (t--) { n int a, b, c, d; n cin >> a >> b >> c; n int ans = 0; n if (a > 0) { n ans++; n a--; n } n if (b > 0) { n ans++; n b--; n } n if (c > 0) { n ans++; n c--; n } n ar[0] = a; n ar[1] = b; n ar[2] = c; n sort(ar, ar + 3); n if (ar[2] > 0 && ar[1] > 0) { n ans++; n ar[2]--; n ar[1]--; n } n if (ar[2] > 0 && ar[0] > 0) { n ans++; n ar[2]--; n ar[0]--; n } n if (ar[0] > 0 && ar[1] > 0) { n ans++; n ar[0]--; n ar[1]--; n } n if (ar[2] > 0 && ar[1] > 0 && ar[0] > 0) { n ans++; n ar[2]--; n ar[1]--; n } n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n typedef long long ll; n typedef pair PII; n const int maxn=111111,mod=998244353; n const double PI=3.141592653589793; n #define MP make_pair n #define PB push_back n #define lson o<<1,l,mid n #define rson o<<1|1,mid+1,r n #define FOR(i,a,b) for(int i=(a);i<=(b);i++) n #define ROF(i,a,b) for(int i=(a);i>=(b);i--) n #define MEM(x,v) memset(x,v,sizeof(x)) n inline ll read(){ n char ch=getchar();ll x=0,f=0; n while(ch< 0 || ch> 9 ) f|=ch== - ,ch=getchar(); n while(ch>= 0 && ch<= 9 ) x=x*10+ch- 0 ,ch=getchar(); n return f?-x:x; n } n inline int qpow(int a,int b){ n int ans=1; n for(;b;b>>=1,a=1ll*a*a%mod) if(b&1) ans=1ll*ans*a%mod; n return ans; n } n int n,at,id[maxn],a[maxn],cnt,ans[maxn][2],al; n bool vis[maxn]; n struct point{ n int x,y,id; n point operator-(const point &p)const{return (point){x-p.x,y-p.y,id};} n double ang()const{return atan2(y,x);} n bool operator<(const point &p)const{ n if(p.id==at) return false; n if(id==at) return true; n return ang()PI){ n ROF(i,n,2) if(p[i].ang()-p[2].ang() cl; n double current_time() { return (double)(chrono::steady_clock::now() - cl).count() / 1e9; } n //------------------------------------------// n n n n n int32_t main(){ n cl = chrono::steady_clock::now(); n ios_base::sync_with_stdio(false); n cout << fixed << setprecision(10); n cin.tie(nullptr); n #ifdef _MY n freopen( VimProject/input.txt , r , stdin); n freopen( VimProject/output.txt , w , stdout); n #endif n n int n, k; n cin >> n >> k; n if (k == 1) { n cout << 0; n return 0; n } n vector a(n); n vector sieve(1300000, 1); n sieve[0] = sieve[1] = 0; n vector primes; n map> ma; n vector>> gen; n for (int i = 2; i < (int)sieve.size(); ++i){ n if (sieve[i] == 0) continue; n primes.push_back(i); n for (int j = 2*i; j < (int)sieve.size(); j += i) n sieve[j] = 0; n } n n auto isprime = [&](int aa)->bool{ n if (aa > ll(100000)*ll(100000)) return false; n if (aa == 1) return false; n for (int i = 2; i * i <= aa; ++i){ n if (aa % i == 0) return false; n } n return true; n }; n for (auto& it : a) cin >> it; n for (auto& it : a){ n int cur = it; n int rt = (int)sqrt((double)cur+0.1); n if (rt*rt == cur && isprime(rt)) n ma[rt].push_back(cur); n else{ n //cout << cur << endl; n map dec; n for (auto& p : primes){ n if (p*p > cur) break; n while(cur % p == 0) { n dec[p]++; n cur /= p; n } n } n if (isprime(cur)) { n dec[cur]++; n cur = 1; n } n //for (auto& it : dec) cout << it.first << << it.second << endl; n if (cur != 1) continue; n if (dec.size() == 0) continue; n if (dec.size() == 1) ma[dec.begin()->first].push_back(it); n if (dec.size() >= 2) { n gen.push_back(make_pair(it, vector())); n for (auto& itt : dec) gen.back().second.push_back(itt.first); n } n } n } n //for (auto& it : ma) { n // cout << it.first << : ; n // for (auto& itt : it.second) cout << itt << ; n // cout << endl; n //} n vector bad; n for (auto& it : ma){ n sort(all(it.second)); n if (it.second.size() == 1) n bad.push_back(it.first); n } n for (auto& it : bad) ma.erase(it); n n vector res; n int cnt = 0; n for (auto& it : ma) cnt += (int)it.second.size(); n if (cnt <= k){ n for (auto& it : ma){ n for (auto& itt : it.second) n res.push_back(itt); n } n for (auto& it : gen){ n if ((int)res.size() == k) break; n bool good = true; n for (auto& itt : it.second) n if (ma.count(itt) == 0) good = false; n if (good) res.push_back(it.first); n } n if ((int)res.size() != k) cout << 0; n else for (auto& it : res) cout << it << ; n return 0; n } else{ n for (auto& it : ma) reverse(all(it.second)); n if (k % 2 == 0){ n for (auto& it : ma) { n if ((int)res.size() == k) break; n for (int i = 0; i < 2; ++i){ n res.push_back(it.second.back()); n it.second.pop_back(); n } n } n for (auto& it : ma){ n for (auto& itt : it.second){ n if ((int)res.size() == k) break; n res.push_back(itt); n it.second.pop_back(); n } n } n for (auto& it: res) cout << it << ; n return 0; n } else { n int ok = -1; n for (auto& it : ma){ n if (ok != -1) break; n if (it.second.size() > 2) ok = it.first; n } n if (ok != -1){ n for (int i = 0; i < 3; ++i){ n res.push_back(ma[ok].back()); n ma[ok].pop_back(); n } n for (auto& it : ma){ n if (it.first == ok) continue; n if ((int)res.size() == k) break; n for (int i = 0; i < 2; ++i){ n res.push_back(it.second.back()); n it.second.pop_back(); n } n } n for (auto& it : ma){ n for (auto& itt : it.second){ n if ((int)res.size() == k) break; n res.push_back(itt); n } n } n for (auto& it : res) cout << it << ; n } else{ n pair> fine(-1, vector()); n for (auto& it : gen){ n bool good = true; n for (auto& itt : it.second) n if (ma.count(itt) == 0) good = false; n if (!good) continue; n if (fine.first == -1 || fine.second.size() > it.second.size()) n fine = it; n } n if (fine.first == -1) { n cout << 0; n return 0; n } n res.push_back(fine.first); n set used; n for (auto& it : fine.second){ n used.insert(it); n for (int i = 0; i < 2; ++i){ n res.push_back(ma[it].back()); n ma[it].pop_back(); n } n } n if ((int)res.size() > k){ n cout << 0; n return 0; n } n for (auto& it : ma){ n if (used.count(it.first)) continue; n if ((int)res.size() == k) break; n for (int i = 0; i < 2; ++i){ n res.push_back(it.second.back()); n it.second.pop_back(); n } n } n for (auto& it : ma){ n for (auto& itt : it.second){ n if ((int)res.size() == k) break; n res.push_back(itt); n } n } n for (auto& it : res) cout << it << ; n } n } n n } n n n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000007; n const int inf = 1e9 + 10; n const long long INF = 1e18; n const long double EPS = 1e-10; n const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; n const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; n template n bool chmax(T &a, const T &b) { n if (a < b) { n a = b; n return 1; n } n return 0; n } n template n bool chmin(T &a, const T &b) { n if (a > b) { n a = b; n return 1; n } n return 0; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout << fixed << setprecision(25); n int t; n cin >> t; n while (t--) { n int n; n string s; n cin >> n >> s; n string ans = ; n int idx = 0; n while (idx < n && s[idx] == 0 ) { n ans += s[idx]; n idx++; n } n s = s.substr(idx); n reverse(s.begin(), s.end()); n n = s.size(); n string ans2 = ; n idx = 0; n while (idx < n && s[idx] == 1 ) { n ans2 += s[idx]; n idx++; n } n s = s.substr(idx); n n = s.size(); n if (n) ans += 0 ; n ans += ans2; n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int test; n cin >> test; n for (int t = 0; t < test; t++) { n int n; n cin >> n; n int k = 2; n while (n % (int)(pow(2, k) - 1) != 0) { n k++; n } n int ans = n / (pow(2, k) - 1); n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int Max = 1e5 + 5; n struct node { n int x, y; n } Node1[Max], Node2[Max]; n int hash1[Max], hash2[Max]; n bool cmp(const node a, const node b) { n if (a.y == b.y) return a.x < b.x; n return a.y < b.y; n } n int main() { n int n, m; n while (scanf( %d%d , &n, &m) != EOF) { n memset(hash1, 0, sizeof(hash1)); n memset(hash2, 0, sizeof(hash2)); n for (int i = 0; i < n; ++i) { n scanf( %d%d , &Node1[i].x, &Node1[i].y); n hash1[Node1[i].y]++; n } n for (int i = 0; i < m; ++i) { n scanf( %d%d , &Node2[i].x, &Node2[i].y); n hash2[Node2[i].y]++; n } n int coun = 0; n for (int i = 0; i <= 1000; ++i) { n if (hash1[i] > 0 && hash2[i] > 0) n coun += (max(hash1[i], hash2[i]) - abs(hash1[i] - hash2[i])); n } n sort(Node1, Node1 + n, cmp); n sort(Node2, Node2 + m, cmp); n int i = 0, j = 0, cou = 0; n while (i < n && j < m) { n if (Node1[i].y == Node2[j].y) { n if (Node1[i].x == Node2[j].x) { n cou++; n i++; n j++; n } else if (Node1[i].x < Node2[j].x) n i++; n else n j++; n } else if (Node1[i].y < Node2[j].y) n i++; n else n j++; n } n printf( %d %d n , coun, cou); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n, m; n cin >> n >> m; n string a, b; n cin >> a >> b; n if (a.size() - 1 > b.size()) { n cout << NO n ; n return 0; n } n if (a == b) { n cout << YES n ; n return 0; n } n int l = 0, r = m - 1; n while (a[l] == b[l] && l < min(n, m)) l++; n while (a.back() == b.back() && min(a.size(), b.size()) > l) n a.pop_back(), b.pop_back(); n if (a.size() - l == 1 && a.back() == * ) { n cout << YES ; n } else { n cout << NO n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 100010; n char str[MAXN]; n int k1, k0, k2; n int main() { n scanf( %s , str); n int n = strlen(str); n k1 = k2 = k0 = 0; n for (int i = 0; i < n; i++) { n if (str[i] == 0 ) k0++; n if (str[i] == 1 ) k1++; n if (str[i] == ? ) k2++; n } n if (k2 + k0 >= (n - 2) / 2 + 2) cout << 00 << endl; n if (k0 + k2 > (n - 2) / 2 && k1 + k2 > (n - 1) / 2) { n if (str[n - 1] == 1 || (str[n - 1] == ? && k0 + k2 - 1 > (n - 2) / 2)) n cout << 01 << endl; n if (str[n - 1] == 0 || (str[n - 1] == ? && k1 + k2 - 1 > (n - 1) / 2)) n cout << 10 << endl; n } n if (k2 + k1 >= (n - 1) / 2 + 2) cout << 11 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n unsigned int dp[100010][400]; n vector nima[100010]; n int a[100010], b[100010]; n int n, m, s, e; n int main() { n while (cin >> n >> m >> s >> e) { n memset(dp, -1, sizeof(dp)); n for (int i = 0; i < n; ++i) { n scanf( %d , &a[i]); n } n for (int i = 0; i < m; ++i) { n scanf( %d , &b[i]); n nima[b[i]].push_back(i + 1); n } n int ans = 0; n int cnt = s / e; n for (int i = 0; i < n; ++i) { n dp[i][0] = 0; n if (nima[a[i]].size()) n dp[i][1] = nima[a[i]][0]; n else n dp[i][1] = -1; n if (i == 0) continue; n for (int j = 1; j <= cnt; ++j) { n unsigned int now = -1; n int w = a[i]; n int last = dp[i - 1][j - 1]; n now = n upper_bound(nima[w].begin(), nima[w].end(), last) - nima[w].begin(); n if (now == nima[w].size() || dp[i - 1][j - 1] == -1) { n now = -1; n } else { n now = nima[w][now]; n } n dp[i][j] = min(dp[i - 1][j], now); n } n } n for (int i = 0; i < n; ++i) n for (int j = 0; j < cnt + 1; ++j) { n if (dp[i][j] != -1) { n if (i + dp[i][j] + 1 + j * e <= s) ans = max(ans, j); n } n } n cout << ans << endl; n return 0; n } n } n "} +{"func_code_string": "#include n using namespace std; n struct compleks { n double x, y; n }; n compleks operator*(compleks a, compleks b) { n compleks c; n c.x = a.x * b.x - a.y * b.y; n c.y = a.x * b.y + a.y * b.x; n return c; n } n compleks operator-(compleks a, compleks b) { n compleks c; n c.x = a.x - b.x, c.y = a.y - b.y; n return c; n } n compleks operator+(compleks a, compleks b) { n compleks c; n c.x = a.x + b.x, c.y = a.y + b.y; n return c; n } n int pos[65536 * 8]; n void fft(compleks a[], int typ) { n for (int i = 0; i < 65536 * 8; i++) n if (pos[i] > i) swap(a[i], a[pos[i]]); n for (int p = 1; p < 65536 * 8; p <<= 1) { n int m = p + p; n compleks wx; n wx.x = cos(2 * 3.141592653589793 / m * typ), n wx.y = sin(2 * 3.141592653589793 / m * typ); n for (int i = 0; i < 65536 * 8; i += m) { n compleks w; n w.x = 1, w.y = 0; n for (int j = 0; j < p; j++, w = w * wx) { n compleks e = a[i + j], f = a[i + j + p] * w; n a[i + j] = e + f, a[i + j + p] = e - f; n } n } n } n if (typ == -1) n for (int i = 0; i < 65536 * 8; i++) n a[i].x /= 65536 * 8, a[i].y /= 65536 * 8; n } n void getpos() { n for (int i = 0; i < 65536 * 8; i++) n pos[i] = (pos[i >> 1] >> 1) | ((i & 1) << 16 + 3 - 1); n } n int a[65536 * 8]; n int n; n int x; n int pre[65536 * 8]; n int cnt[65536 * 8]; n compleks c[65536 * 8], d[65536 * 8]; n int main() { n cin >> n >> x; n cnt[0]++; n long long di = 0; n for (int i = 1; i <= n; i++) n scanf( %d , &a[i]), pre[i] = pre[i - 1] + (a[i] < x), di += cnt[pre[i]], n cnt[pre[i]]++; n getpos(); n for (int i = 0; i <= n; i++) n c[i].x = cnt[i], d[-i + 65536 * 8 / 2].x = cnt[i]; n fft(c, 1); n fft(d, 1); n for (int i = 0; i < 65536 * 8; i++) c[i] = c[i] * d[i]; n fft(c, -1); n for (int i = 0; i <= n; i++) { n long long ai = (long long)(c[i + 65536 * 8 / 2].x + 0.5); n if (i == 0) ai = di; n printf( %lld , ai); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, deg[8012], ans1, ans2, ans3, cn = 0, mx[8012], X[8012]; n bool w[8012][8012], vis[8012]; n queue q; n long long ans = 0; n int main() { n scanf( %d , &n); n m = n >> 2; n int i, j, k, v, x, y, o; n char ch; n for (i = 0, getchar(); i < n; ++i, getchar()) n for (x = j = 0; j < m; ++j) { n ch = getchar(); n v = (ch <= 9 ) ? (ch - 0 ) : (10 + ch - A ); n for (k = 3; ~k; --k, ++x) n if ((v >> k) & 1) { n w[i][x] = 1; n ++deg[x]; n } n } n for (i = 0; i < n; i++) n if (!deg[i]) q.push(i); n while (!q.empty()) { n vis[x = q.front()] = 1; n q.pop(); n ++cn; n bool *p = w[x]; n for (y = 0; y < n; y++) n if (p[y]) { n p[y] = 0; n if (!(--deg[y])) q.push(y); n } n } n ans = 1ll * cn * (cn - 1) / 2 * (1 + 614 * n) + n 1ll * cn * (n - cn) * (1 + 614 * n); n ans1 = (n - cn) * (n - cn - 1) / 2; n for (x = 0; x < n; ++x) X[x] = x; n for (x = 0; x < n; ++x) n if (!vis[x]) { n bool *p = w[x]; n v = deg[x]; n for (y = 0; y < n; ++y) n if (p[y]) n mx[y] = max(mx[y], v - deg[y] + 1), o = X[y], X[y] = p[o] ? x : o; n } n for (x = 0; x < n; ++x) ans2 += max(mx[x], deg[X[x]]); n ans3 = (n - cn) * (n - cn - 1) - ans1 - ans2; n ans += ans1 + ans2 * 2 + ans3 * 3; n printf( %lld , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long i, n, m, k, x, z, c, a[500007], b[500007], ans, bad, total; n int main() { n cin >> n; n for (i = 1; i <= n; i++) cin >> a[i]; n set st; n for (i = 1; i <= n; i++) { n st.insert(a[i]); n if (st.find(i) != st.end()) st.erase(i); n if (st.size() == 0) c++; n } n cout << c << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector primes; n void Sieve(long long int n) { n vector prime(n + 1, true); n for (long long int p = 2; p * p <= n; p++) { n if (prime[p] == true) { n for (long long int i = p * p; i <= n; i += p) prime[i] = false; n } n } n for (long long int p = 2; p <= n; p++) n if (prime[p]) primes.push_back(p); n } n vector vis; n long long int dia = 0; n long long int dfs(long long int x, vector>& vec) { n vis[x] = true; n priority_queue pq; n for (auto it : vec[x]) { n if (vis[it] != true) pq.push(dfs(it, vec) + 1); n } n if (pq.size() == 0) n return 0; n else if (pq.size() == 1) { n long long int p = pq.top(); n dia = max(dia, p); n return p; n } else { n long long int p = pq.top(); n pq.pop(); n long long int y = pq.top(); n dia = max(dia, p + y); n return p; n } n } n int main() { n long long int t; n cin >> t; n while (t--) { n long long int n, a, b, da, db; n cin >> n; n cin >> a; n cin >> b; n cin >> da; n cin >> db; n vector> vec(n + 1); n for (long long int i = 0; i < n - 1; i++) { n long long int x, y; n cin >> x; n cin >> y; n vec[x].push_back(y); n vec[y].push_back(x); n } n vector visited(n + 1, 0); n queue> q; n q.push({a, 0}); n long long int dis = 0; n while (!q.empty()) { n pair p = q.front(); n q.pop(); n if (p.first == b) { n dis = p.second; n break; n } n for (auto it : vec[p.first]) { n if (!visited[it]) { n q.push({it, p.second + 1}); n visited[it] = true; n } n } n } n vis = vector(n + 1, 0); n dfs(1, vec); n cout << (2 * da >= min(dia, db) || dis <= da ? Alice : Bob ) << n ; n dia = 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int d; n cin >> d; n for (int i = 0; i < d; ++i) { n long long n; n cin >> n; n if (n * (n - 4) >= 0) { n cout << Y << fixed << setprecision(9) << (n + sqrt(n * n - 4 * n)) / 2 n << << n - (n + sqrt(n * n - 4 * n)) / 2; n cout << n ; n } else { n cout << N n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 10; n char s[N], t[N]; n int vis[N], vs[N]; n int main() { n cin >> s + 1 >> t + 1; n int j = 1; n int n = strlen(s + 1); n int m = strlen(t + 1); n for (int i = 1; i <= n && j <= m; ++i) { n if (s[i] == t[j]) { n vis[j] = i; n ++j; n } n } n j = m; n for (int i = n; i >= 1 && j >= 1; --i) { n if (s[i] == t[j]) { n vs[j] = i; n --j; n } n } n int ans = max(vis[1] - 1, n - vis[m]); n ans = max(ans, vs[1] - 1); n ans = max(ans, n - vs[m]); n for (int i = 1; i <= m; ++i) { n ans = max(ans, vs[i] - vis[i - 1] - 1); n } n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n long long modexpo(long long x, long long p) { n long long res = 1; n x = x % 1000000007; n while (p) { n if (p % 2) res = res * x; n p >>= 1; n x = x * x % 1000000007; n res %= 1000000007; n } n return res; n } n struct compare { n bool operator()(const pair a, n const pair b) const { n return a.first < b.first; n } n }; n void __solve__(long long testCase) { n long long x, y, ans = 2e18 + 7; n cin >> y >> x; n vector c(6); n for (long long &e : c) cin >> e; n for (long long i = 0; i < 3; i++) n for (long long j = 0; j < 3; j++) { n long long s = 0; n if (i == j) { n if (i == 0 && y == 0) n if (x > 0) n s += c[1] * x; n else n s += c[4] * -x; n if (i == 1 && x == 0) n if (y > 0) n s += c[5] * y; n else n s += c[2] * -y; n if (i == 2 && x == y) n if (x > 0) n s += c[0] * x; n else n s += c[3] * -x; n if (s) ans = min(ans, s); n continue; n } else if (i != 2 && j != 2) { n if (x > 0) n s += c[1] * x; n else n s += c[4] * -x; n if (y > 0) n s += c[5] * y; n else n s += c[2] * -y; n } else { n if (j == 0 || i == 0) { n if (y > 0) n s += c[0] * y; n else n s += c[3] * -y; n if (x - y > 0) n s += c[1] * (x - y); n else n s += c[4] * -(x - y); n } else { n if (x > 0) n s += c[0] * x; n else n s += c[3] * -x; n if (y - x > 0) n s += c[5] * (y - x); n else n s += c[2] * -(y - x); n } n } n ans = min(ans, s); n } n cout << ans << n ; n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long testCase = 1; n cin >> testCase; n for (long long tc = 1; tc <= testCase; tc++) { n __solve__(tc); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1 << 18; n const long long INF = 0x3f3f3f3f; n int n, k; n bool fav[MAXN]; n long long dp[MAXN][18][2][2]; n inline void get_max(long long &, long long); n int main() { n scanf( %d%d , &n, &k); n for (register int i = 1; i <= k; ++i) { n int tmp; n scanf( %d , &tmp); n fav[tmp - 1] = true; n } n for (int k = 0; k < (1 << n); ++k) n for (int t = 1; t <= n; ++t) n for (int a = 0; a <= 1; ++a) n for (int b = 0; b <= 1; ++b) dp[k][t][a][b] = -INF; n for (int i = 0; i < (1 << n - 1); ++i) n dp[i][1][fav[i << 1]][fav[i << 1 | 1]] = n dp[i][1][fav[i << 1 | 1]][fav[i << 1]] = fav[i << 1] | fav[i << 1 | 1]; n for (int t = 2; t <= n; ++t) n for (int k = 0; k < (1 << n - t); ++k) { n for (register int a = 0; a <= 1; ++a) n for (register int b = 0; b <= 1; ++b) n for (register int c = 0; c <= 1; ++c) n for (register int d = 0; d <= 1; ++d) { n get_max(dp[k][t][a][c], n dp[k << 1][t - 1][a][b] + dp[k << 1 | 1][t - 1][c][d] + n (a | c) + (b | d) + max(c | b, c | d)); n get_max(dp[k][t][a][b], dp[k << 1][t - 1][a][b] + n dp[k << 1 | 1][t - 1][c][d] + n (a | c) + (b | d) + (b | c)); n get_max(dp[k][t][a][d], dp[k << 1][t - 1][a][b] + n dp[k << 1 | 1][t - 1][c][d] + n (a | c) + (b | d) + (d | c)); n get_max(dp[k][t][c][a], n dp[k << 1][t - 1][a][b] + dp[k << 1 | 1][t - 1][c][d] + n (a | c) + (b | d) + max(a | b, a | d)); n get_max(dp[k][t][c][b], dp[k << 1][t - 1][a][b] + n dp[k << 1 | 1][t - 1][c][d] + n (a | c) + (b | d) + (a | b)); n get_max(dp[k][t][c][d], dp[k << 1][t - 1][a][b] + n dp[k << 1 | 1][t - 1][c][d] + n (a | c) + (b | d) + (a | d)); n } n } n printf( %lld n , max(max(dp[0][n][0][0], dp[0][n][0][1] + 1), n max(dp[0][n][1][0] + 1, dp[0][n][1][1] + 1))); n return 0; n } n inline void get_max(long long &a, long long b) { a = max(a, b); } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 3e5 + 7; n const int inf = 1e9; n char s[60][60]; n char s1[60]; n int l; n int n; n int num[60]; n int check(char *s) { n for (int i = 0; i < l; ++i) { n int j; n for (j = 0; j < l; ++j) { n if (s1[j] != s[(j + i) % l]) break; n } n if (j >= l) return i; n } n return -1; n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n; ++i) scanf( %s , s[i]); n l = strlen(s[0]); n int ans = inf; n for (int i = 0; i < l; ++i) { n int sum = 0; n for (int j = 0; j < l; ++j) s1[j] = s[0][(j + i) % l]; n for (int j = 0; j < n; ++j) { n int t = check(s[j]); n if (t == -1) { n puts( -1 ); n return 0; n } n sum += t; n } n ans = min(ans, sum); n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[2][100]; n int fun(char a, char b) { n if (a == 8 ) { n if (b == [ ) n return 1; n else if (b == ( ) n return -1; n else n return 0; n } n if (a == [ ) { n if (b == 8 ) n return -1; n else if (b == ( ) n return 1; n else n return 0; n } n if (a == ( ) { n if (b == [ ) n return -1; n else if (b == 8 ) n return 1; n else n return 0; n } n } n int main() { n while (cin >> s[0] >> s[1]) { n int sum1 = 0, sum2 = 0; n for (int i = 0; s[0][i]; i += 2) sum1 += fun(s[0][i], s[1][i]); n if (sum1 > 0) n printf( TEAM 1 WINS n ); n else if (sum1 < 0) n printf( TEAM 2 WINS n ); n else n printf( TIE n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char c1, c2; n cin >> c1 >> c2; n int n; n cin >> n; n if (n % 2 == 0) { n cout << undefined << endl; n } else { n int n1, n2; n switch (c1) { n case ^ : n n1 = 1; n break; n case > : n n1 = 2; n break; n case v : n n1 = 3; n break; n case < : n n1 = 4; n break; n } n switch (c2) { n case ^ : n n2 = 1; n break; n case > : n n2 = 2; n break; n case v : n n2 = 3; n break; n case < : n n2 = 4; n break; n } n n %= 4; n if (n1 != 4) { n if (n2 - n1 == 1) { n if (n == 1) n cout << cw << endl; n else n cout << ccw << endl; n } else { n if (n == 1) n cout << ccw << endl; n else n cout << cw << endl; n } n } else { n if (n1 - n2 == 3) { n if (n == 1) n cout << cw << endl; n else n cout << ccw << endl; n } else { n if (n == 1) n cout << ccw << endl; n else n cout << cw << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n const int MOD = 1000000007; n long long power(long long a, long long n, long long m) { n if (n == 0) return 1; n long long p = power(a, n / 2, m); n p = (p * p) % m; n if (n % 2) p = (p * a) % m; n return p; n } n int fact[N]; n int ifact[N]; n int main() { n fact[0] = 1; n for (int i = 1; i < N; i++) { n fact[i] = ((long long)i * fact[i - 1]) % MOD; n } n ifact[N - 1] = power(fact[N - 1], MOD - 2, MOD); n for (int i = N - 1; i >= 1; i--) { n ifact[i - 1] = ((long long)i * ifact[i]) % MOD; n } n int n; n scanf( %d , &n); n int ans = fact[2 * n - 1]; n ans = ((long long)ans * ifact[n]) % MOD; n ans = ((long long)ans * ifact[n - 1]) % MOD; n ans = (2 * ans) % MOD; n ans = (ans - n + MOD) % MOD; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long power(long long x, long long y) { n long long res = 1; n while (y > 0) { n if (y & 1) res = (res * x); n y = y >> 1; n x = (x * x); n } n return res; n } n long long summ(long long a) { n long long ans = 0; n while (a) { n ans += a % 10; n a = a / 10; n } n return ans; n } n long long digit(int n) { n int count = 0; n while (n) { n n = n / 10; n count++; n } n return count; n } n long long sum(long long a) { n long long ans = 0; n while (a) { n ans += (a % 10); n a = a / 10; n } n return ans; n } n int main() { n long long n; n cin >> n; n long long a = n; n long long b; n long long count = 0; n while (a) { n b = a % 10; n a = a / 10; n count++; n } n count--; n b--; n b = b * pow(10, count); n long long c = 0; n for (int i = 0; i < count; i++) { n c = (10 * c) + 9; n } n b = b + c; n c = n - b; n cout << sum(b) + sum(c); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n long long k, x; n long long a[200010]; n int main() { n int n; n while (cin >> n >> k >> x) { n int negative = 0; n for (int i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] < 0) ++negative; n } n if (negative % 2 == 0) { n int minId = 0; n for (int i = 1; i < n; i++) { n if (abs(a[i]) < abs(a[minId])) minId = i; n } n long long num = abs(a[minId]) / x + 1; n if (a[minId] >= 0) n a[minId] -= min(num, k) * x; n else n a[minId] += min(num, k) * x; n k = max(k - num, 0LL); n } n priority_queue, vector >, n greater > > n que; n for (int i = 0; i < n; i++) { n que.push(make_pair(abs(a[i]), i)); n } n while (k--) { n pair cur = que.top(); n que.pop(); n int id = cur.second; n if (a[id] >= 0) n a[id] += x; n else n a[id] -= x; n que.push(make_pair(abs(a[id]), id)); n } n for (int i = 0; i < n; i++) { n if (i != n - 1) n cout << a[i] << ; n else n cout << a[i] << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline T sqr(T x) { n return x * x; n } n const double PI = acos(-1.0); n using namespace std; n double dp[1005][1005]; n int main(void) { n int n, m; n scanf( %d %d , &n, &m); n if (n == 1) { n puts( 1.0000000 ); n return 0; n } n dp[0][0] = 1; n for (int i = 1; i <= n - 1; i++) { n dp[i][0] = dp[i - 1][0] * (1 - (m - 1.0) / (n * m - i)); n for (int j = 1; j <= i && j <= m; j++) { n dp[i][j] = dp[i - 1][j - 1] * (m - j + 0.0) / (n * m - i) + n dp[i - 1][j] * (1 - (m - j - 1.0) / (n * m - i)); n } n } n double ans = 0; n for (int i = 0; i <= n - 1; i++) { n ans += dp[n - 1][i] * (i + 1.0) / n; n } n printf( %.10lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n; n scanf( %d , &n); n std::vector > a(n + 1); n for (int p = 0; p < n; p++) { n int x; n scanf( %d , &x); n a[p] = std::make_pair(x, p + 1); n } n sort(++a.begin(), a.end(), std::greater >()); n int ind(0); n std::vector > comm; n for (int p = 0; p < n; p++) { n for (int q = ind + 1; q <= ind + a[p].first; q++) { n if (q >= n) { n break; n } n comm.push_back(std::make_pair(a[p].second, a[q].second)); n } n ind += a[p].first; n if (ind <= p) { n break; n } n } n if (comm.size() < n - 1) { n puts( -1 ); n } else { n printf( %d n , n - 1); n for (int p = 0; p < comm.size(); p++) { n printf( %d %d n , comm[p].first, comm[p].second); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 200005; n int main() { n long long n, z, x, y; n cin >> n; n z = (n * (n - 1) * (n - 2) * (n - 3) * (n - 4)) / 120; n x = (z * (n - 5)) / 6; n y = (x * (n - 6)) / 7; n cout << z + x + y << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = int64_t; n int main(int argc, char* argv[]) { n std::ios::sync_with_stdio(false); n cin.tie(nullptr); n cout.precision(10); n int n; n cin >> n; n auto g = vector>(n, vector(n, 2000000000)); n for (int i = 0; i < (n - 1); ++i) n for (int j = 0; j < (n - i - 1); ++j) { n int d; n cin >> d; n g[i][i + j + 1] = g[i + j + 1][i] = d; n } n auto min_adj = vector(n); n for (int i = 0; i < (n); ++i) n min_adj[i] = *min_element((g[i]).begin(), (g[i]).end()); n auto smallest = *min_element((min_adj).begin(), (min_adj).end()); n for (int i = 0; i < (n); ++i) n for (int j = 0; j < (n); ++j) g[i][j] -= smallest; n auto dist = move(min_adj); n for (int i = 0; i < (n); ++i) dist[i] = 2 * (dist[i] - smallest); n auto done = vector(n, false); n for (int _ = 0; _ < (n); ++_) { n int v = -1; n for (int i = 0; i < (n); ++i) n if (!done[i] && (v == -1 || dist[i] < dist[v])) v = i; n done[v] = true; n for (int i = 0; i < (n); ++i) dist[i] = min(dist[i], dist[v] + g[i][v]); n } n for (int i = 0; i < (n); ++i) cout << dist[i] + (n - 1) * smallest << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 99; n int n, m, pre[maxn], nxt[maxn], vst[maxn], flag[maxn]; n vector G[maxn]; n void del(int i) { n nxt[pre[i]] = nxt[i]; n if (~nxt[i]) pre[nxt[i]] = pre[i]; n } n void bfs(int id) { n queue que; n que.push(id); n while (!que.empty()) { n int now = que.front(); n que.pop(); n for (int x : G[now]) n if (!vst[x]) flag[x] = 1; n for (int i = nxt[0]; ~i; i = nxt[i]) { n if (flag[i]) n flag[i] = 0; n else n vst[i] = 1, que.push(i), del(i); n } n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n cin >> n >> m; n for (int i = 0; i < m; i++) { n int a, b; n cin >> a >> b; n G[a].push_back(b); n G[b].push_back(a); n } n nxt[0] = 1; n nxt[n] = -1; n for (int i = 1; i < n; i++) pre[i + 1] = i, nxt[i] = i + 1; n int ans = 0; n for (int i = 1; i <= n; i++) { n if (vst[i]) continue; n ans++; n bfs(i); n } n cout << ans - 1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int t[200001]; n int main() { n memset(t, 0x3f, sizeof(t)); n int n, k; n string str; n cin >> n >> k >> str; n for (int x = 0; x < n; x++) n if (str[x] == str[(x + 1) % n] || str[x] == str[(x - 1 + n) % n]) t[x] = 0; n for (int x = 0; x < 2 * n; x++) n t[x % n] = min(t[x % n], t[(x - 1 + n) % n] + 1); n for (int x = 2 * n - 1; x >= 0; x--) n t[x % n] = min(t[x % n], t[(x + 1) % n] + 1); n for (int x = 0; x < n; x++) n if (min(t[x], k) % 2) str[x] = 153 - str[x]; n cout << str << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int arr[1000000]; n int main() { n int n; n while (scanf( %d , &n) != -1) { n if (n == 1) { n printf( 1 n ); n continue; n } n if ((n & 1) && (n - 1) % 4) { n printf( -1 n ); n continue; n } n if (!(n & 1) && n % 4) { n printf( -1 n ); n continue; n } n for (int i = 1; i + i <= n; i += 2) n arr[i] = i + 1, arr[i + 1] = n - i + 1, arr[n - i + 1] = n - i, n arr[n - i] = i; n if (n % 2) arr[n / 2 + 1] = n / 2 + 1; n for (int i = 1; i <= n; ++i) printf(i > 1 ? %d : %d , arr[i]); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n const int INF = 1e9; n const long long mod = 1e9 + 7; n bool dp[105][55][2][2][205]; n string s; n int n, sz, realans; n int offset(int x) { return x + 100; } n bool f(int idx, int sisa, bool flip, bool arah, int ans) { n if (idx == sz + 1) { n if (sisa == 0) { n realans = max(realans, abs(ans)); n } n return 1; n } n bool &res = dp[idx][sisa][flip][arah][offset(ans)]; n if (res == 1) return res; n char now = s[idx - 1]; n if (flip) { n if (now == F ) n now = T ; n else n now = F ; n } n if (now == F ) { n res = f(idx + 1, sisa, 0, arah, ans + (arah ? 1 : -1)); n if (sisa) res = f(idx, sisa - 1, !flip, arah, ans); n } else if (now == T ) { n res = f(idx + 1, sisa, 0, !arah, ans); n if (sisa) res = f(idx, sisa - 1, !flip, arah, ans); n } n return res = 1; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cin >> s; n cin >> n; n sz = s.size(); n f(1, n, 0, 1, 0); n cout << realans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[500005], tot, s[500005], c[500005], tmp[1500005], num; n priority_queue q; n bool cmp(int x, int y) { return x > y; } n int main() { n long long ans = 0; n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]), ans += a[i]; n sort(a + 1, a + n + 1, cmp); n for (int i = 1; i <= n; i++) { n if (i == 1 || a[i] != a[i - 1]) n s[++tot] = a[i], c[tot]++; n else n c[tot]++; n } n int sum = 0; n for (int i = 1; i <= tot; i++) { n int pt = min((int)(sum - (int)2 * q.size()), c[i]); n int rst = min(c[i] - pt, sum - pt); n num = 0; n for (int j = 1; j <= pt; j++) tmp[++num] = s[i]; n for (int j = 1; j <= rst; j += 2) { n int k = -q.top(); n q.pop(); n if (k < s[i]) { n tmp[++num] = s[i]; n if (j < rst) tmp[++num] = s[i]; n } else { n tmp[++num] = k; n if (j < rst) tmp[++num] = 2 * s[i] - k; n } n } n for (int j = 1; j <= num; j++) n if (tmp[j] >= 0) q.push(-tmp[j]); n sum += c[i]; n } n while (!q.empty()) ans += q.top(), q.pop(); n printf( %lld n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int ar[2111111], br[2111111], cr[2111111], dr[2111111]; n int main() { n cin.sync_with_stdio(false); n int n, i, j, x, y, pos, m; n cin >> n; n for (i = 1; i <= n; i++) { n cin >> ar[i]; n if (ar[i] == 0) pos = i; n } n for (i = n + 1; i < n + n; i++) ar[i] = ar[i - n]; n for (j = 1, i = pos + 1; i <= pos + n - 1; i++, j++) cr[j] = ar[i]; n m = j - 1; n for (i = m + 1; i <= m + m; i++) cr[i] = cr[i - m]; n for (i = 1; i <= n; i++) { n cin >> br[i]; n if (br[i] == 0) pos = i; n } n for (i = n + 1; i < n + n; i++) br[i] = br[i - n]; n for (j = 1, i = pos + 1; i <= pos + n - 1; i++, j++) dr[j] = br[i]; n for (i = 1; i <= m + m; i++) n if (cr[i] == dr[1]) { n pos = i; n break; n } n bool cond = true; n for (j = 1, i = pos; i <= pos + m - 1 && cond; i++, j++) n if (cr[i] != dr[j]) cond = false; n if (cond) n puts( YES ); n else n puts( NO ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void fre() { n freopen( c://test//input.in , r , stdin); n freopen( c://test//output.out , w , stdout); n } n template n inline void gmax(T1 &a, T2 b) { n if (b > a) a = b; n } n template n inline void gmin(T1 &a, T2 b) { n if (b < a) a = b; n } n const int N = 1e5 + 10, M = 0, Z = 1e9 + 7, inf = 0x3f3f3f3f; n template n inline void gadd(T1 &a, T2 b) { n a = (a + b) % Z; n } n int casenum, casei; n int D, n, m; n int lft[N], rgt[N], bot[N], top[N]; n struct A { n int l, r, t, b; n } a[N]; n int main() { n while (~scanf( %d%d%d , &D, &n, &m)) { n memset(lft, 0, sizeof(lft)); n memset(rgt, 0, sizeof(rgt)); n memset(top, 0, sizeof(top)); n memset(bot, 0, sizeof(bot)); n int x1, y1, x2, y2; n for (int i = 1; i <= D; ++i) { n scanf( %d%d%d%d , &x1, &y1, &x2, &y2); n if (x1 > x2) swap(x1, x2); n if (y1 > y2) swap(y1, y2); n a[i] = {x1, x2, y2, y1}; n ++lft[x1]; n ++rgt[x2]; n ++bot[y1]; n ++top[y2]; n } n for (int i = 1; i <= n + 1; ++i) { n lft[i] += lft[i - 1]; n } n for (int i = 1; i <= m + 1; ++i) { n bot[i] += bot[i - 1]; n } n for (int i = n; i >= 0; --i) { n rgt[i] += rgt[i + 1]; n } n for (int i = m; i >= 0; --i) { n top[i] += top[i + 1]; n } n int L, R, T, B; n scanf( %d%d%d%d , &L, &R, &T, &B); n int ans = -1; n for (int i = 1; i <= D; ++i) { n int lr = (a[i].r > a[i].l); n int tb = (a[i].t > a[i].b); n if (lft[a[i].r - 1] - lr == L && rgt[a[i].l + 1] - lr == R && n top[a[i].b + 1] - tb == B && bot[a[i].t - 1] - tb == T) { n ans = i; n break; n } n } n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n int n, m, c[256]; n int main() { n int a, j; n scanf( %d%d , &n, &m); n memset(c, -1, sizeof(c)); n for (int i = 0; i < n; ++i) { n scanf( %d , &a); n if (~c[a]) n printf( %d , c[a]); n else { n j = a; n while (j && !~c[j - 1] && j > a - m + 1) --j; n if (j && ~c[j - 1] && a - c[j - 1] < m) n c[j] = c[j - 1]; n else n c[j] = j; n for (int k = j + 1; k <= a; ++k) c[k] = c[j]; n printf( %d , c[j]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n long long a[200000 + 5]; n int main() { n long long i, j, k, l; n long long n, m; n cin >> n; n for (i = 0; i < n; i++) cin >> a[i]; n a[n] = 2000000009; n long long maxn = 0; n k = 0; n for (i = 1; i <= n; i++) { n if (a[i] > a[i - 1] * 2) { n maxn = max(maxn, i - k); n k = i; n } n } n cout << maxn << endl; n } n "} +{"func_code_string": "#include n const double pi = 3.141592653589793238462643383279; n using namespace std; n long long GCD(long long a, long long b) { n if (b == 0) return a; n return GCD(b, a % b); n } n int arr[1000010]; n int rev[1000010]; n int main() { n cin.tie(0); n ios::sync_with_stdio(false); n cout << fixed << setprecision(10); n int n; n cin >> n; n string s; n cin >> s; n if (s[0] == ) && s[s.size() - 1] == ( ) { n cout << 0 << endl; n return 0; n } else if (s[0] == ) ) { n arr[0]++; n arr[1] += arr[0]; n bool f = true; n for (int i = 1; i < s.size(); i++) { n if (s[i] == ( ) n arr[i]++; n else n arr[i]--; n arr[i + 1] += arr[i]; n if (arr[i] < 0) f = false; n } n if (f && arr[s.size() - 1] == 0) n cout << 1 << endl; n else n cout << 0 << endl; n return 0; n } else if (s[s.size() - 1] == ( ) { n bool f = true; n for (int i = 0; i < s.size() - 1; i++) { n if (s[i] == ( ) n arr[i]++; n else n arr[i]--; n arr[i + 1] += arr[i]; n if (arr[i] < 0) f = false; n } n arr[s.size() - 1]--; n if (f && arr[s.size() - 1] == 0) n cout << 1 << endl; n else n cout << 0 << endl; n return 0; n } n for (int i = 0; i < s.size(); i++) { n if (s[i] == ( ) { n arr[i]++; n } else { n arr[i]--; n } n arr[i + 1] += arr[i]; n } n for (int i = s.size() - 1; i >= 0; i--) { n if (s[i] == ( ) { n rev[i]++; n } else { n rev[i]--; n } n rev[i] += rev[i + 1]; n } n if (arr[s.size() - 1] == 2) { n int ans = 0; n for (int i = 0; i < s.size(); i++) { n if (arr[i] < 0) { n cout << 0 << endl; n return 0; n } n } n for (int i = s.size() - 1; i >= 0; i--) { n if (arr[i] <= 1) break; n if (s[i] == ( ) ans++; n } n cout << ans << endl; n } else if (arr[s.size() - 1] == -2) { n int ans = 0; n for (int i = 0; i < s.size(); i++) { n if (arr[i] <= -3) { n cout << 0 << endl; n return 0; n } n } n for (int i = 0; i < s.size(); i++) { n if (s[i] == ) ) { n ans++; n if (arr[i] < 0) { n break; n } n } n } n cout << ans << endl; n } else { n cout << 0 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2000210; n inline int scan() { n char c = getchar(); n int x = 0; n while (c < 0 || c > 9 ) { n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n x = (x << 1) + (x << 3) + c - 0 ; n c = getchar(); n } n return x; n } n long long int n, m; n long long int a[N]; n long long int parent[N]; n long long int sz[N]; n void reset() { n for (long long int i = 0; i <= n; i++) parent[i] = i, sz[i] = 1; n } n long long int findparent(long long int x) { n if (x != parent[x]) return findparent(parent[x]); n return parent[x]; n } n void merge(long long int x, long long int y) { n x = findparent(x); n y = findparent(y); n if (sz[x] < sz[y]) swap(x, y); n sz[x] += sz[y]; n parent[y] = x; n } n vector g[N]; n vector l[N]; n bool comp1(long long int x, long long int y) { return x < y; } n bool comp2(long long int x, long long int y) { return x > y; } n long long int minparent = INT_MAX, maxparent = INT_MIN; n int main() { n scanf( %lld %lld , &n, &m); n for (long long int i = 1; i <= n; i++) scanf( %lld , &a[i]); n reset(); n while (m--) { n long long int a, b; n scanf( %lld %lld , &a, &b); n merge(a, b); n } n for (long long int i = 1; i <= n; i++) { n g[findparent(i)].push_back(i); n l[findparent(i)].push_back(a[i]); n minparent = min(minparent, parent[i]); n maxparent = max(maxparent, parent[i]); n } n for (long long int i = 1; i <= n; i++) { n if (findparent(i) == i) { n sort(l[i].begin(), l[i].end(), comp2); n sort(g[i].begin(), g[i].end(), comp1); n for (long long int j = 0; j < g[i].size(); j++) { n a[g[i][j]] = l[i][j]; n } n } n } n for (long long int i = 1; i <= n; i++) printf( %lld , a[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int MAXN = 200000; n using namespace std; n void RI() {} n template n void RI(int& head, T&... tail) { n scanf( %d , &head); n RI(tail...); n } n int a[200000]; n vector > lines; n double intersection(pair a, pair b) { n double x = (a.second - b.second) / (a.first - b.first); n double y = (a.first * x) - a.second; n return x; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n RI(n); n for (int i = 0; i < int(n); i++) RI(a[i]); n double c = 0; n lines.push_back(make_pair(0, 0)); n for (int i = 0; i < int(n); i++) { n c = c + a[i]; n lines.push_back(make_pair(i + 1, c)); n } n vector s1; n vector s2; n s1.push_back(n); n s1.push_back(n - 1); n for (int j = n - 2; j >= 0; j--) { n while (1) { n if (s1.size() == 1) { n break; n } n if (intersection(lines[s1[s1.size() - 2]], lines[j]) >= n intersection(lines[s1[s1.size() - 2]], lines[s1[s1.size() - 1]])) { n s1.pop_back(); n } else { n break; n } n } n s1.push_back(j); n } n s2.push_back(0); n s2.push_back(1); n for (int j = 2; j <= n; j++) { n while (1) { n if (s2.size() == 1) { n break; n } n if (intersection(lines[s2[s2.size() - 2]], lines[j]) >= n intersection(lines[s2[s2.size() - 2]], lines[s2[s2.size() - 1]])) { n s2.pop_back(); n } else { n break; n } n } n s2.push_back(j); n } n int curr_line = 0; n double ans = 1000000000.0; n for (int j = 0; j < s2.size() - 1; j++) { n double inter1 = intersection(lines[s2[j]], lines[s2[j + 1]]); n while (1) { n if (curr_line >= s1.size() - 1) { n break; n } n double inter = n intersection(lines[s1[curr_line]], lines[s1[curr_line + 1]]); n if (inter <= inter1) { n break; n } else { n curr_line++; n } n } n double y1 = (lines[s2[j]].first * inter1) - lines[s2[j]].second; n double y2 = n (lines[s1[curr_line]].first * inter1) - lines[s1[curr_line]].second; n ans = min(abs(y2 - y1), ans); n } n curr_line = 0; n for (int j = 0; j < s1.size() - 1; j++) { n double inter1 = intersection(lines[s1[j]], lines[s1[j + 1]]); n while (1) { n if (curr_line >= s2.size() - 1) { n break; n } n double inter = n intersection(lines[s2[curr_line]], lines[s2[curr_line + 1]]); n if (inter <= inter1) { n break; n } else { n curr_line++; n } n } n double y1 = (lines[s1[j]].first * inter1) - lines[s1[j]].second; n double y2 = n (lines[s2[curr_line]].first * inter1) - lines[s2[curr_line]].second; n ans = min(abs(y2 - y1), ans); n } n printf( %.12f n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool judge(char c) { n if (c == a || c == e || c == i || c == o || c == u || c == y ) n return false; n else n return true; n } n int main() { n char a[110]; n int n, m = 0; n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) { n if (judge(a[i])) { n cout << a[i]; n m = 0; n } else if (m == 1) n continue; n else if (!judge(a[i])) n cout << a[i], m = 1; n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize(2) n #pragma GCC optimize(3) n #pragma GCC optimize(4) n using namespace std; n const int N = 2e5 + 7; n const int inf = 0x3f3f3f3f; n const long long INF = 0x3f3f3f3f3f3f3f3f; n const int mod = 998244353; n const double eps = 1e-8; n const double PI = acos(-1); n template n inline void add(T &a, S b) { n a += b; n if (a >= mod) a -= mod; n } n template n inline void sub(T &a, S b) { n a -= b; n if (a < 0) a += mod; n } n template n inline bool chkmax(T &a, S b) { n return a < b ? a = b, true : false; n } n template n inline bool chkmin(T &a, S b) { n return a > b ? a = b, true : false; n } n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n int n, m, k, q; n int mx[N], mn[N]; n int cnt; n int tot[N]; n map Map[N]; n vector V; n int calc(int p, int p1, int p2) { return abs(p - p1) + abs(p1 - p2); } n int main() { n memset(mx, 0xc0, sizeof(mx)); n memset(mn, 0x3f, sizeof(mn)); n scanf( %d%d%d%d , &n, &m, &k, &q); n for (int i = 1; i <= k; i++) { n int r, c; n scanf( %d%d , &r, &c); n chkmax(mx[r], c); n chkmin(mn[r], c); n tot[r]++; n cnt++; n } n if (!cnt) { n puts( 0 ); n return 0; n } n while (!tot[n]) n--; n V.push_back(0); n V.push_back(m + 1); n for (int i = 1; i <= q; i++) { n int b; n scanf( %d , &b); n V.push_back(b); n } n sort((V).begin(), (V).end()); n if (tot[1]) { n Map[1][mx[1]] = mx[1] - 1; n } else { n Map[1][1] = 0; n } n for (int i = 1; i < n; i++) { n assert(((int)Map[i].size()) <= 2); n int d = 1; n int cur = i; n while (!tot[i + 1]) { n i++; n d++; n } n for (auto &t : Map[cur]) { n int p = t.first; n long long val = t.second; n int pos = lower_bound((V).begin(), (V).end(), p) - V.begin(); n if (V[pos] != m + 1) { n long long dis = abs(V[pos] - p) + d; n long long nVal = calc(V[pos], mn[i + 1], mx[i + 1]); n if (!Map[i + 1].count(mx[i + 1])) { n Map[i + 1][mx[i + 1]] = val + dis + nVal; n } else { n chkmin(Map[i + 1][mx[i + 1]], val + dis + nVal); n } n nVal = calc(V[pos], mx[i + 1], mn[i + 1]); n if (!Map[i + 1].count(mn[i + 1])) { n Map[i + 1][mn[i + 1]] = val + dis + nVal; n } else { n chkmin(Map[i + 1][mn[i + 1]], val + dis + nVal); n } n } n pos--; n if (V[pos] != 0) { n long long dis = abs(V[pos] - p) + d; n long long nVal = calc(V[pos], mn[i + 1], mx[i + 1]); n if (!Map[i + 1].count(mx[i + 1])) { n Map[i + 1][mx[i + 1]] = val + dis + nVal; n } else { n chkmin(Map[i + 1][mx[i + 1]], val + dis + nVal); n } n nVal = calc(V[pos], mx[i + 1], mn[i + 1]); n if (!Map[i + 1].count(mn[i + 1])) { n Map[i + 1][mn[i + 1]] = val + dis + nVal; n } else { n chkmin(Map[i + 1][mn[i + 1]], val + dis + nVal); n } n } n } n Map[cur].clear(); n } n long long ans = INF; n for (auto &t : Map[n]) { n chkmin(ans, t.second); n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[55][55]; n int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, 1, -1}, n, vis[55][55]; n bool check(int x, int y) { n for (int i = 0; i < 4; i++) { n int tx = x + dx[i], ty = y + dy[i]; n if (tx < 1 || tx > n || ty < 1 || ty > n || s[tx][ty] == # || vis[tx][ty]) n return false; n } n return true; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %s , s[i] + 1); n } n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n if (vis[i][j] || s[i][j] == # ) continue; n if (check(i, j)) { n vis[i][j] = 1; n for (int k = 0; k < 4; k++) vis[i + dx[k]][j + dy[k]] = 1; n } n } n } n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n if (vis[i][j]) n continue; n else if (s[i][j] == # ) n continue; n printf( NO n ); n return 0; n } n } n printf( YES n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool notis[30] = {false}, mayis[30] = {false}; n string str; n int main() { n int n, flag = 0, cnt = 0, tem, i, j; n char p; n std::ios::sync_with_stdio(false); n cin >> n; n for (i = 0; i < n; i++) { n cin >> p >> str; n if (flag && (p == ! || p == ? )) n cnt++; n else { n tem = str.length(); n if (p == ! ) { n for (j = 0; j < tem; j++) mayis[str[j] - a ] = true; n for (j = 0; j < 26; j++) { n if (!mayis[j]) notis[j] = true; n mayis[j] = false; n } n } else n for (j = 0; j < tem; j++) notis[str[j] - a ] = true; n for (tem = j = 0; j < 26; j++) n if (!notis[j]) tem++; n if (tem == 1) flag = 1; n } n } n printf( %d , cnt > 0 ? (cnt - 1) : 0); n } n "} +{"func_code_string": "#include n using namespace std; n long long dp[2005][2005]; n string s; n long long cnt[2005]; n long long powr[2005]; n long long solve(int l, int r) { n if (dp[l][r] != -1) { n return dp[l][r]; n } n if (l >= r) return 0; n dp[l][r] = 0; n if (s[l] == ) ) { n dp[l][r] += solve(l + 1, r); n } n if (s[r] == ( ) { n dp[l][r] += solve(l, r - 1); n } n if (s[l] == ) && s[r] == ( ) { n dp[l][r] -= solve(l + 1, r - 1); n } n if (s[l] == ( && s[r] == ) ) { n dp[l][r] += solve(l + 1, r - 1) + powr[cnt[r] - cnt[l + 1]]; n } n if (s[l] == ? && s[r] == ? ) { n dp[l][r] += solve(l + 1, r) + solve(l, r - 1) + powr[cnt[r] - cnt[l + 1]]; n } n if (s[l] == ? && s[r] == ) ) { n dp[l][r] += n solve(l + 1, r - 1) + solve(l + 1, r) + powr[cnt[r] - cnt[l + 1]]; n } n if (s[r] == ? && s[l] == ( ) { n dp[l][r] += n solve(l + 1, r - 1) + solve(l, r - 1) + powr[cnt[r] - cnt[l + 1]]; n } n return (dp[l][r] + 2LL * 998244353) % 998244353; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n ; n int t; n t = 1; n while (t--) { n cin >> s; n for (int i = 0; i < s.size(); i++) { n if (s[i] == ? ) { n cnt[i + 1] = cnt[i] + 1; n } else n cnt[i + 1] = cnt[i]; n } n powr[0] = 1; n for (int i = 1; i < 2005; i++) { n powr[i] = powr[i - 1] * 2 % 998244353; n } n memset(dp, -1, sizeof(dp)); n cout << solve(0, s.size() - 1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long M = 1e9 + 7; n const long long N = 5e5 + 1; n bool prime[N]; n void solve() { n long long n, k; n cin >> n >> k; n string s; n cin >> s; n vector> v(k); n long long cnt = 0, c = 0; n string t = s; n bool f = 0; n while (1) { n bool b = 0; n for (long long i = 0; i < n; i++) { n if (t[i] == R && t[i + 1] == L ) { n if (cnt >= k) { n f = 1; n break; n } n b = 1; n t[i] = L ; n t[i + 1] = R ; n i++; n v[cnt].push_back(i); n c++; n } n } n if (f) break; n if (b == 0) break; n cnt++; n } n if (cnt > k || c < k || f) { n cout << -1 << n ; n return; n } else if (cnt == k) { n for (auto i : v) { n cout << i.size() << ; n for (auto j : i) cout << j << ; n cout << n ; n } n } else { n long long t = cnt - 1, b = k - 1; n while (t < b) { n long long m = v[t].size(); n while (!v[t].empty()) { n v[b].push_back(v[t].back()); n b--; n v[t].pop_back(); n if (t >= b) break; n } n if (t == b && v[t].size()) break; n t--; n } n for (auto i : v) { n cout << i.size() << ; n for (auto j : i) cout << j << ; n cout << n ; n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t = 1; n while (t--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector v(n); n for (int i = 0; i < n; i++) cin >> v[i]; n sort(begin(v), end(v)); n v.erase(unique(begin(v), end(v)), end(v)); n n = v.size(); n for (int i = 2; i < n; i++) { n int a = v[i - 2]; n int b = v[i - 1]; n int c = v[i]; n if (a + 1 == b && b + 1 == c) { n cout << YES << endl; n return 0; n } n } n cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 10; n int a[maxn], b[maxn]; n int main() { n int n, x, T; n cin >> T; n while (T--) { n cin >> n; n set s; n s.clear(); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1; i <= n; i++) { n scanf( %d , &b[i]); n } n int l = 1, r = n; n while (l <= n && a[l] == b[l]) l++; n while (r >= 1 && a[r] == b[r]) r--; n if (l > r) { n cout << YES n ; n continue; n } n int flag = 1; n if (a[l] - b[l] > 0) flag = 0; n for (int i = l + 1; i <= r; i++) { n if (a[l] - b[l] != a[i] - b[i]) flag = 0; n } n if (flag) n cout << YES n ; n else n cout << NO n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, sum, ans, a[100005]; n inline long long read() { n long long q = 0, f = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) f = 0; n ch = getchar(); n } n while (isdigit(ch)) { n q = (q << 3) + (q << 1) + (ch ^ 48); n ch = getchar(); n } n return f ? q : -q; n } n inline void print(long long x) { n if (x < 0) { n putchar( - ); n x = -x; n } n if (x > 9) print(x / 10); n putchar(x % 10 + 48); n } n signed main() { n n = read(); n for (register long long i = 1; i <= n; ++i) a[i] = read(), sum += a[i]; n sort(a + 1, a + n + 1, greater()); n for (register long long i = 1; i <= (sum % n); ++i) n ans += abs(a[i] - sum / n - 1); n for (register long long i = (sum % n) + 1; i <= n; ++i) n ans += abs(a[i] - sum / n); n print(ans >> 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 66666; n const int M = 55; n const int sM = 105; n const int inf = 1e9 + 7; n const double pi = acos(-1); n inline int read() { n int x = 0, f = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); n return x * f; n } n int lim, pp[N]; n struct CP { n double x, y; n CP(double xx = 0, double yy = 0) { x = xx, y = yy; } n }; n CP operator+(CP aa, CP bb) { return CP(aa.x + bb.x, aa.y + bb.y); } n CP operator-(CP aa, CP bb) { return CP(aa.x - bb.x, aa.y - bb.y); } n CP operator*(CP aa, CP bb) { n return CP(aa.x * bb.x - aa.y * bb.y, aa.x * bb.y + aa.y * bb.x); n } n void FFT(CP *f, int flag) { n for (int i = (0), iE = (lim - 1); i <= iE; i++) n if (i < pp[i]) swap(f[i], f[pp[i]]); n for (int i = 2; i <= lim; i <<= 1) { n CP ch(cos(2 * pi / i), flag * sin(2 * pi / i)); n for (int l = (i >> 1), j = 0; j < lim; j += i) { n CP now(1, 0); n for (int k = j; k < j + l; k++) { n CP pa = f[k], pb = now * f[k + l]; n f[k] = pa + pb, f[k + l] = pa - pb, now = now * ch; n } n } n } n if (flag == -1) n for (int i = (0), iE = (lim - 1); i <= iE; i++) n f[i].x /= lim, f[i].y /= lim; n } n CP A[N], B[N]; n int n, m, t, x, dis[N]; n int fu[N], fv[N], fval[N]; n double ans[M][N], p[sM][N], calc[sM][N]; n void Solve(int l, int mid, int r) { n for (int d = (1), dE = (m); d <= dE; d++) { n int tota = -1, totb = 0; n B[0] = CP(0, 0); n for (int i = (l), iE = (mid); i <= iE; i++) n A[++tota] = CP(ans[fv[d]][i], 0); n for (int i = (1), iE = (min(r - l + 1, t)); i <= iE; i++) n B[++totb] = CP(p[d][i], 0); n for (lim = 1; lim <= tota + totb; lim <<= 1) n ; n for (int i = (0), iE = (lim - 1); i <= iE; i++) n pp[i] = ((pp[i >> 1] >> 1) | ((i & 1) * (lim >> 1))); n for (int i = (tota + 1), iE = (lim - 1); i <= iE; i++) A[i] = CP(0, 0); n for (int i = (totb + 1), iE = (lim - 1); i <= iE; i++) B[i] = CP(0, 0); n FFT(A, 1), FFT(B, 1); n for (int i = (0), iE = (lim - 1); i <= iE; i++) A[i] = A[i] * B[i]; n FFT(A, -1); n for (int i = (1), iE = (r - mid); i <= iE; i++) n calc[d][i + mid] += A[i + tota].x; n } n } n void Divide(int l, int r) { n if (l == r) { n for (int j = (1), jE = (m); j <= jE; j++) n ans[fu[j]][l] = min(ans[fu[j]][l], calc[j][l] + fval[j]); n return; n } n int mid = (l + r) / 2; n Divide(l, mid); n Solve(l, mid, r); n Divide(mid + 1, r); n } n int main() { n n = read(), m = read(), t = read(), x = read(); n dis[n] = 0; n for (int i = (1), iE = (n - 1); i <= iE; i++) dis[i] = inf; n for (int i = (1), iE = (n - 1); i <= iE; i++) n for (int j = (t), jE = (t * 2); j <= jE; j++) ans[i][j] = inf; n for (int i = (1), iE = (m); i <= iE; i++) { n fu[i] = read(), fv[i] = read(), fval[i] = read(); n for (int j = (1), jE = (t); j <= jE; j++) p[i][j] = 1. * read() / 100000; n } n for (int i = (1), iE = (n); i <= iE; i++) n for (int j = (1), jE = (m); j <= jE; j++) n dis[fu[j]] = min(dis[fu[j]], dis[fv[j]] + fval[j]); n for (int i = (1), iE = (n); i <= iE; i++) n for (int j = (0), jE = (t - 1); j <= jE; j++) ans[i][j] = dis[i] + x; n Solve(0, t - 1, t * 2); n Divide(t, t * 2); n printf( %.10lf n , ans[1][2 * t]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main(void) { n int n, i; n scanf( %d , &n); n printf( %d , n); n for ((i) = 0; (i) < (int)(n - 1); (i)++) printf( %d , i + 1); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n struct City { n long long g; n long long w; n long long gf; n long long bg; n long long minbg; n }; n class Data { n public: n City cities[100000]; n int n; n int k; n long long gifts; n long long gas; n long long nextGas; n int maxL; n City* end; n City* head; n City* tail; n City* start; n City* finish; n City* lastMinBackwardGasCity; n City* firstMinBackwardGasCity; n void init() { n std::streambuf* sbuf = std::cin.rdbuf(); n auto getCinValue = [=]() -> long long { n long long retVal = 0; n int ch = ; n while (ch == || ch == r || ch == n ) ch = sbuf->sbumpc(); n while (ch >= 0 && ch <= 9 ) { n retVal = retVal * 10 + ch - 0 ; n ch = sbuf->sbumpc(); n } n return retVal; n }; n n = getCinValue(); n k = getCinValue(); n for (int i = 0; i < n - 1; i++) cities[i].w = getCinValue(); n for (int i = 0; i < n; i++) cities[i].g = getCinValue(); n end = cities + n; n head = cities; n tail = cities; n start = cities; n finish = cities; n lastMinBackwardGasCity = cities; n firstMinBackwardGasCity = cities; n gifts = k; n gas = 0; n nextGas = 0; n maxL = 1; n } n }; n struct Result { n City* start; n City* finish; n int length() { return finish - start + 1; } n }; n void backCount(City* city, Data& data) { n if (city == data.tail) { n city->bg = city->minbg = 0; n data.firstMinBackwardGasCity = data.lastMinBackwardGasCity = data.tail; n } else { n city->bg = (city - 1)->bg + (city - 1)->w - city->g - city->gf; n if (city->bg < (city - 1)->minbg) { n city->minbg = city->bg; n data.firstMinBackwardGasCity = city; n data.lastMinBackwardGasCity = city; n } else if (city->bg == (city - 1)->minbg) { n city->minbg = city->bg; n data.lastMinBackwardGasCity = city; n } else n city->minbg = (city - 1)->minbg; n } n }; n void backRecountAll(Data& data) { n for (City* city = data.tail; city < data.head; city++) backCount(city, data); n }; n bool backCheck(City* city, long long gifts, Data& data) { n if (gifts + city->g >= (city - 1)->bg - (city - 1)->minbg + (city - 1)->w) { n int l = city - data.tail + 1; n if (l > data.maxL) { n data.maxL = l; n data.start = data.tail; n data.finish = city; n return true; n } n } n return false; n }; n long long backCheckAll(Data& data) { n long long gifts_ = data.gifts; n long long minGiftsDeficit = 9223372036854775807LL; n for (City* city = data.head; n city > (((data.tail) > (data.tail + data.maxL - 1)) n ? (data.tail) n : (data.tail + data.maxL - 1)); n city--) { n gifts_ += city->gf; n long long giftsLeft = n gifts_ + city->g - ((city - 1)->bg - (city - 1)->minbg + (city - 1)->w); n if (giftsLeft >= 0) { n data.maxL = city - data.tail + 1; n data.start = data.tail; n data.finish = city; n break; n } else n minGiftsDeficit = (((minGiftsDeficit) < (-giftsLeft)) ? (minGiftsDeficit) n : (-giftsLeft)); n } n return minGiftsDeficit; n }; n Result testData(Data& data) { n while (1) { n while (data.head < data.end - 1) { n long long g = data.head->g; n long long w = data.head->w; n long long gf = 0; n data.nextGas = (data.head == data.end - 1) ? (-9223372036854775807LL - 1) n : data.gas + g - w; n if (data.nextGas >= 0) { n data.gas = data.nextGas; n data.head->gf = gf = 0; n data.nextGas = 0; n } else if (data.gifts >= -data.nextGas) { n data.head->gf = gf = -data.nextGas; n data.gifts += data.nextGas; n data.gas = 0; n data.nextGas = 0; n } else n break; n backCount(data.head, data); n data.head++; n backCheck(data.head, data.gifts, data); n } n long long minGiftsDeficit = 0; n while (data.tail < data.head) { n if (data.k < -data.nextGas && data.head - data.tail + 1 <= data.maxL) n break; n if (data.head - data.tail + 1 <= data.maxL) { n while (!data.tail->gf) data.tail++; n } n while (!data.tail->gf && data.tail->w <= (data.tail + 1)->g) data.tail++; n if (long long tailGifts = data.tail->gf) { n data.gifts += tailGifts; n data.tail->gf = 0; n data.tail++; n minGiftsDeficit -= tailGifts; n if (minGiftsDeficit <= 0) minGiftsDeficit = backCheckAll(data); n } else { n data.tail++; n long long gas_ = 0; n bool gasChanged = true; n for (City* city = data.tail; city < data.head; city++) { n gas_ += city->g + city->gf - city->w; n if (gas_ <= 0 && city->gf) { n data.gifts += gas_; n city->gf -= gas_; n gas_ = 0; n gasChanged = false; n break; n } else if (gas_ < 0) { n data.gifts += gas_; n city->gf = -gas_; n gas_ = 0; n } n } n if (gasChanged) data.gas = gas_; n while (data.gifts < 0) { n data.head--; n data.gas -= data.head->g + data.head->gf - data.head->w; n data.gifts += data.head->gf; n data.head->gf = 0; n data.head->bg = 0; n data.head->minbg = 0; n minGiftsDeficit = 0; n } n data.nextGas = data.gas + data.head->g - data.head->w; n if (data.head <= data.firstMinBackwardGasCity) { n backRecountAll(data); n minGiftsDeficit = backCheckAll(data); n } else if (data.head <= data.lastMinBackwardGasCity) n while (data.lastMinBackwardGasCity->bg != n data.lastMinBackwardGasCity->minbg) n data.lastMinBackwardGasCity--; n } n if (data.tail == data.head) break; n if (data.tail > data.lastMinBackwardGasCity) { n backRecountAll(data); n minGiftsDeficit = backCheckAll(data); n } else if (data.tail > data.firstMinBackwardGasCity) n while (data.firstMinBackwardGasCity->bg != n data.firstMinBackwardGasCity->minbg) n data.firstMinBackwardGasCity++; n if (data.head == data.end - 1) { n if (data.maxL >= data.head - data.tail + 1) break; n } else if (data.gifts >= -data.nextGas) { n data.head->gf = -data.nextGas; n data.gifts -= -data.nextGas; n data.gas = 0; n data.nextGas = 0; n backCount(data.head, data); n data.head++; n backCheck(data.head, data.gifts, data); n break; n } n } n if (data.k < -data.nextGas && data.head - data.tail + 1 <= data.maxL) { n data.head++; n data.tail = data.head; n } n if (data.tail == data.head) { n data.tail = data.head; n data.firstMinBackwardGasCity = data.head; n data.lastMinBackwardGasCity = data.head; n data.gifts = data.k; n data.gas = 0; n data.nextGas = 0; n } n if (data.maxL >= data.end - data.tail) break; n } n return {data.start, data.finish}; n } n int test() { n static Data data; n data.init(); n Result result = testData(data); n return result.length(); n } n int main() { std::cout << test(); } n "} +{"func_code_string": "#include n using namespace std; n vector > T; n int n, sum; n vector > loc; n void input(); n void solve(); n int main() { n input(); n solve(); n return 0; n } n void input() { n assert(scanf( %d , &n) == 1); n T.resize(n); n for (int i = 0; i < n; i++) { n int c; n assert(scanf( %d , &c) == 1); n sum += c; n T[i].resize(c); n } n loc.resize(sum); n for (int i = 0; i < n; i++) n for (int j = 0; j < ((int)(T[i].size())); j++) { n assert(scanf( %d , &T[i][j]) == 1); n loc[T[i][j] - 1] = make_pair(i, j); n } n } n void solve() { n vector ans[4]; n int cnt = 0; n for (int i = 0; i < n; i++) n for (int j = 0; j < ((int)(T[i].size())); j++) { n int x = loc[cnt].first, y = loc[cnt].second; n if (i != x || j != y) { n ans[0].push_back(i + 1); n ans[1].push_back(j + 1); n ans[2].push_back(x + 1); n ans[3].push_back(y + 1); n swap(T[i][j], T[x][y]); n swap(loc[T[i][j] - 1], loc[T[x][y] - 1]); n } n cnt++; n } n cout << ((int)(ans[0].size())) << endl; n for (int i = 0; i < ((int)(ans[0].size())); i++) { n for (int j = 0; j < 4; j++) cout << ans[j][i] << ; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, a[200000], money, energy, i; n scanf( %d , &n); n for (i = 0; i <= n - 1; i++) { n scanf( %d , &a[i]); n } n energy = 0; n money = a[0]; n for (i = 0; i <= n - 2; i++) { n if (energy + a[i] - a[i + 1] < 0) { n money += a[i + 1] - a[i] - energy; n energy = 0; n } else { n energy += a[i] - a[i + 1]; n } n } n printf( %d n , money); n return 0; n } n "} +{"func_code_string": "#include n template n inline char smax(A &a, const B &b) { n return a < b ? a = b, 1 : 0; n } n template n inline char smin(A &a, const B &b) { n return b < a ? a = b, 1 : 0; n } n template n inline void read(I &x) { n int f = 0, c; n while (!isdigit(c = getchar())) c == - ? f = 1 : 0; n x = c & 15; n while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + (c & 15); n f ? x = -x : 0; n } n const int N = 500 + 7; n const int M = (1 << 16) + 7; n const int P = 1e9 + 7; n int n, m, S, nod; n int A, B, C, D, F; n int fa[N], lc[N], rc[N], v[N], dp[N][M]; n char a[N]; n inline void sadd(int &x, const int &y) { n x += y; n x >= P ? x -= P : x; n } n inline int smod(const int &x) { return x >= P ? x - P : x; } n inline int fpow(int x, int y) { n int ans = 1; n for (; y; y >>= 1, x = (long long)x * x % P) n if (y & 1) ans = (long long)ans * x % P; n return ans; n } n inline void fwt_and(int *a, int n, int f) { n for (int i = 1; i < n; i <<= 1) n for (int j = 0; j < n; j += i << 1) n for (int k = 0; k < i; ++k) { n int x = a[j + k], y = a[i + j + k]; n if (f > 0) n a[j + k] = smod(x + y); n else n a[j + k] = smod(x + P - y); n } n } n inline void fwt_or(int *a, int n, int f) { n for (int i = 1; i < n; i <<= 1) n for (int j = 0; j < n; j += i << 1) n for (int k = 0; k < i; ++k) { n int x = a[j + k], y = a[i + j + k]; n if (f > 0) n a[i + j + k] = smod(x + y); n else n a[i + j + k] = smod(y + P - x); n } n } n int tA[M], tB[M]; n inline void mul_and(int *a, int *b, int *c) { n memcpy(tA, a, sizeof(*a) * S); n memcpy(tB, b, sizeof(*b) * S); n fwt_and(tA, S, 1), fwt_and(tB, S, 1); n for (int i = 0; i < S; ++i) tA[i] = (long long)tA[i] * tB[i] % P; n fwt_and(tA, S, -1); n for (int i = 0; i < S; ++i) sadd(c[i], tA[i]); n } n inline void mul_or(int *a, int *b, int *c) { n memcpy(tA, a, sizeof(*a) * S); n memcpy(tB, b, sizeof(*b) * S); n fwt_or(tA, S, 1), fwt_or(tB, S, 1); n for (int i = 0; i < S; ++i) tA[i] = (long long)tA[i] * tB[i] % P; n fwt_or(tA, S, -1); n for (int i = 0; i < S; ++i) sadd(c[i], tA[i]); n } n inline void dfs(int x, int fa = 0) { n if (!lc[x]) { n if (v[x] == 1) n dp[x][A] = 1; n else if (v[x] == 2) n dp[x][B] = 1; n else if (v[x] == 3) n dp[x][C] = 1; n else if (v[x] == 4) n dp[x][D] = 1; n else if (v[x] == 5) n dp[x][(S - 1) ^ A] = 1; n else if (v[x] == 6) n dp[x][(S - 1) ^ B] = 1; n else if (v[x] == 7) n dp[x][(S - 1) ^ C] = 1; n else if (v[x] == 8) n dp[x][(S - 1) ^ D] = 1; n else if (v[x] == 0) n ++dp[x][A], ++dp[x][(S - 1) ^ A], ++dp[x][B], ++dp[x][(S - 1) ^ B], n ++dp[x][C], ++dp[x][(S - 1) ^ C], ++dp[x][D], ++dp[x][(S - 1) ^ D]; n } else { n dfs(lc[x], x), dfs(rc[x], x); n if (v[x] == -1 || v[x] == 0) mul_and(dp[lc[x]], dp[rc[x]], dp[x]); n if (v[x] == -2 || v[x] == 0) mul_or(dp[lc[x]], dp[rc[x]], dp[x]); n } n } n inline void build() { n int curs = nod = 1; n n = strlen(a + 1); n for (int i = 1; i <= n; ++i) { n if (a[i] == ( ) n fa[++nod] = curs, curs = nod; n else if (a[i] == ) ) { n if (lc[fa[curs]]) n rc[fa[curs]] = curs; n else n lc[fa[curs]] = curs; n curs = fa[curs]; n } else if (a[i] >= A && a[i] <= D ) n v[curs] = a[i] - A + 1; n else if (a[i] >= a && a[i] <= d ) n v[curs] = a[i] - a + 5; n else if (a[i] == & ) n v[curs] = -1; n else if (a[i] == | ) n v[curs] = -2; n } n } n inline void work() { n build(); n dfs(1); n printf( %d n , dp[1][F]); n } n inline void init() { n scanf( %s , a + 1); n read(m), S = 1 << m; n int x; n for (int i = 1; i <= m; ++i) { n read(x), x && (A |= 1 << (i - 1)); n read(x), x && (B |= 1 << (i - 1)); n read(x), x && (C |= 1 << (i - 1)); n read(x), x && (D |= 1 << (i - 1)); n read(x), x && (F |= 1 << (i - 1)); n } n } n int main() { n init(); n work(); n fclose(stdin), fclose(stdout); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e4 + 6; n int n, l, r, h[N], b[N], ans[N], S; n vector X, Y; n int main() { n scanf( %d%d%d , &n, &l, &r); n for (int i = 1; i <= n; ++i) scanf( %d , h + i), S += h[i]; n for (int i = 1; i <= n; ++i) scanf( %d , b + i); n int _l = S - r, _r = S - l; n for (int i = 1; i <= n; ++i) (b[i] ? Y : X).push_back(h[i]); n sort(X.rbegin(), X.rend()), sort(Y.rbegin(), Y.rend()); n for (int i = 1; i <= 10000; ++i) ans[i] = -1e9; n for (int s : X) n for (int i = 10000; i >= s; --i) n if (ans[i - s] >= 0) ans[i] = max(ans[i], ans[i - s]); n for (int s : Y) n for (int i = 10000; i >= s; --i) n if (ans[i - s] >= 0) n ans[i] = max(ans[i], ans[i - s] + (_l <= i && i <= _r)); n printf( %d n , *max_element(ans, ans + 10001)); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1000100; n int n, p[N]; n int mx1[N], mx2[N], ans[N]; n int main() { n scanf( %d , &n); n for (int v, best, i = 2; i <= n + 1; i++) { n scanf( %d , p + i); n v = i; n while (v != 0) { n best = max(mx1[v], mx2[v] + 1); n if (best <= ans[v]) break; n ans[v] = best; n if (mx2[p[v]] < best) mx2[p[v]] = best; n if (mx1[p[v]] < mx2[p[v]]) swap(mx1[p[v]], mx2[p[v]]); n v = p[v]; n } n printf( %d , max(mx1[1], mx2[1])); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MaxD = 1001; n vector temp; n int main() { n int n, w[MaxD] = {0}, h[MaxD] = {0}, maximum = 0, minimum = MaxD, ilgis; n unsigned long long ats = 1e18; n bool ar; n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> w[i] >> h[i]; n if (max(w[i], h[i]) > maximum) maximum = max(w[i], h[i]); n if (min(w[i], h[i]) < minimum) minimum = min(w[i], h[i]); n } n for (int i = minimum; i <= maximum; i++) { n ilgis = 0; n int vietos = n / 2; n ar = true; n temp.clear(); n for (int j = 1; j <= n; j++) { n if (min(w[j], h[j]) > i) { n ar = false; n break; n } n if (h[j] > i && w[j] <= i) { n vietos--; n ilgis += h[j]; n } else if (w[j] > i && h[j] <= i) { n ilgis += w[j]; n } else { n ilgis += w[j]; n if (w[j] > h[j] && w[j] <= i) temp.push_back(h[j] - w[j]); n } n if (vietos < 0) { n ar = false; n break; n } n } n sort(temp.begin(), temp.end()); n if (ar) { n for (int j = 0; j < temp.size() && vietos; j++) { n ilgis += temp[j]; n vietos--; n } n } n if (ar && (ilgis * i) < ats) ats = ilgis * i; n } n cout << ats; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n unsigned long long int x; n cin >> x; n cout << 25; n } n "} +{"func_code_string": "#include n using namespace std; n int n, dp[300005], k = 0, b[300005]; n vector ke[300005]; n void dfs(int u, int par) { n if (ke[u].size() == 1 && u != 1) { n dp[u] = 1; n k++; n return; n } n if (b[u]) n dp[u] = 1e9; n else n dp[u] = 0; n for (int v : ke[u]) n if (v != par) { n dfs(v, u); n if (b[u]) n dp[u] = min(dp[u], dp[v]); n else n dp[u] += dp[v]; n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(); n cout.tie(); n cin >> n; n for (int i = 1; i <= n; i++) cin >> b[i]; n int u; n for (int i = 2; i <= n; i++) { n cin >> u; n ke[u].push_back(i); n ke[i].push_back(u); n } n dfs(1, 0); n cout << k - dp[1] + 1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double PI = 3.14159265359; n const long long MOD = (long long)1e9 + 7; n const long long MAXN = (long long)2e3 + 10; n const long long INF = (long long)2242545357980376863; n const long double EPS = (long double)1e-8; n long long dp[MAXN][2048]; n long long pw[MAXN], cnt[MAXN]; n long long a[MAXN]; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n pw[0] = 1; n for (int i = 1; i < MAXN; i++) pw[i] = (pw[i - 1] << 1) % MOD; n long long n, k; n cin >> n >> k; n k = (1ll << k); n for (int i = 1; i <= n; i++) cin >> a[i]; n long long c0 = 0; n for (int i = n; i >= 0; i--) { n cnt[i] = c0; n if (a[i] == 0) c0++; n } n if (a[1] == 2) { n dp[1][2] = 1; n } n if (a[1] == 4) { n dp[1][4] = 1; n } n if (a[1] == 0) { n dp[1][2] = dp[1][4] = 1; n } n long long ans = 0; n for (int i = 1; i < n; i++) { n for (int j = 2; j < 2048; j++) { n if (dp[i][j] == 0) continue; n long long nx = a[i + 1]; n if (nx != 4) { n long long sm = j + 2; n if (sm >= k) { n ans += (pw[cnt[i + 1]] * dp[i][j]); n ans %= MOD; n } else { n dp[i + 1][sm] += dp[i][j]; n dp[i + 1][sm] %= MOD; n } n } n if (nx != 2) { n if (j % 4 == 2) { n dp[i + 1][4] += dp[i][j]; n } else { n long long sm = j + 4; n if (sm >= k) { n ans += (pw[cnt[i + 1]] * dp[i][j]); n ans %= MOD; n } else { n dp[i + 1][sm] += dp[i][j]; n dp[i + 1][sm] %= MOD; n } n } n } n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n long long t; n cin >> t; n while (t--) { n long long a, b, c; n cin >> a >> b >> c; n long long ans = (a + b + c) / 2; n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using vi = vector; n using pii = pair; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n; n cin >> n; n vector A(n); n vector P(n + 1); n for (auto &x : A) cin >> x; n for (int i = 0; i < n; ++i) P[A[i]] = i; n int cnt = 0; n vector> sol; n for (int kk = 0; kk < n; ++kk) { n if (is_sorted(A.begin(), A.end())) break; n ++cnt; n int goal = -1; n for (int i = 1; i <= n - 1; ++i) { n if (P[i] > P[i + 1]) { n goal = i; n break; n } n } n vector> G; n G.push_back({}); n int state = 0; n for (int i = 0; i < n; ++i) { n if (state == 0) { n if (A[i] != goal + 1) { n G.back().push_back(A[i]); n } else { n G.push_back({A[i]}); n state = 1; n } n } else if (state == 1) { n if (A[i] == goal) { n G.push_back({A[i]}); n state = 3; n G.push_back({}); n } else if (A[i] == A[i - 1] + 1) n G.back().push_back(A[i]); n else { n G.push_back({A[i]}); n state = 2; n } n } else if (state == 2) { n G.back().push_back(A[i]); n if (A[i] == goal) { n state = 3; n G.push_back({}); n } n } else { n G.back().push_back(A[i]); n } n } n sol.push_back({}); n for (auto &x : G) { n if (!x.empty()) sol.back().push_back(x.size()); n } n reverse(G.begin(), G.end()); n { n int i = 0; n for (auto &g : G) n for (auto x : g) A[i++] = x; n } n for (int i = 0; i < n; ++i) P[A[i]] = i; n } n assert(is_sorted(A.begin(), A.end())); n cout << cnt << n ; n for (auto &s : sol) { n cout << s.size() << ; n for (auto &x : s) cout << x << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long p = 1e9 + 7; n int n, a[2505], mx, s, ch, ans; n long long f[100005]; n long long ksm(long long x, int y) { n long long sun = 1; n x %= p; n while (y) { n if (y & 1) sun = sun * x % p; n y >>= 1; n x = x * x % p; n } n return sun; n } n int main() { n cin >> n; n for (int i = 1; i <= n; i++) n scanf( %d , &a[i]), mx = max(a[i], mx), s += a[i]; n f[1] = ksm(s - 1, 2) * ksm(s, p - 2) % p; n ch = f[1]; n for (int i = 2; i <= mx; i++) { n ch = (ch - ksm(s - i + 1, p - 2) * (s - 1) % p + p) % p; n f[i] = (f[i - 1] + ch) % p; n } n for (int i = 1; i <= n; i++) ans = (ans + f[a[i]]) % p; n cout << ans; n } n "} +{"func_code_string": "#include n #include n #include n #include n #include n #include n #include n #include n #include n using namespace std; n typedef long long ll; n typedef unsigned long long ull; n typedef unsigned int uii; n typedef pair pii; n template n inline void rd(T& x) n { n int tmp = 1; char c = getchar(); x = 0; n while (c > 9 || c < 0 ) { if (c == - )tmp = -1; c = getchar(); } n while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } n x *= tmp; n } n const int N = 2e5 + 10; n const int M = 1e6 + 10; n const int mod = 1e9 + 7; n const int inf = 0x3f3f3f3f; n const double eps = 1e-5; n int sgn(double x) { n if (fabs(x) < eps) return 0; n if (x > 0) return 1; n return -1; n } n int n, m, k; n int head[N], cntE; n struct edge { n int to, next; n int w; n }e[M]; n void add(int u, int v, int w = 0) { n e[cntE].to = v; n e[cntE].next = head[u]; n e[cntE].w = w; n head[u] = cntE++; n } n bool vis[N]; n int stk[N], top; n bool dfs(int x) { n if (vis[x ^ 1]) return false; n if (vis[x]) return true; n vis[x] = true; n stk[++top] = x; n for (int i = head[x]; ~i; i = e[i].next) { n int v = e[i].to; n if (!dfs(v)) return false; n } n return true; n } n bool two_sat() { n memset(vis, false, sizeof(bool) * (2 * n + 10)); n for (int i = 0; i < n; ++i) { n if (vis[i << 1] || vis[i << 1 | 1]) continue; n top = 0; n if (!dfs(i << 1)) { n while (top) vis[stk[top--]] = false; n if (!dfs(i << 1 | 1)) return false; n } n } n return true; n } n ll a[N], b[N], c[N], maxn[N]; n ll solve() { n maxn[n] = c[n] - 1 + 2; n ll ans = 0; n for (int i = n - 1; i > 0; --i) { n ans = max(ans, maxn[i + 1] + b[i + 1] - a[i + 1]); n maxn[i] = c[i] - 1; n if (b[i+1] == a[i+1]) { n // maxn[i] = c[i] + 1; n } n else { n maxn[i] = max(maxn[i], maxn[i + 1] + (c[i] - 1 - (b[i + 1] - a[i + 1]))); n } n maxn[i] += 2; n } n return ans; n } n int main() { n #ifdef _DEBUG n FILE* _INPUT = freopen( input.txt , r , stdin); n // FILE* _OUTPUT = freopen( output.txt , w , stdout); n #endif // !_DEBUG n int cas = 0, T; n rd(T); n while (T--) { n // while (~scanf( %d , &n)) { n rd(n); n for (int i = 1; i <= n; ++i) rd(c[i]); n for (int i = 1; i <= n; ++i) rd(a[i]); n for (int i = 1; i <= n; ++i) rd(b[i]); n for (int i = 1; i <= n; ++i) if (a[i] > b[i]) swap(a[i], b[i]); n printf( %lld n , solve()); n } n return 0; n }"} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n cout << n / 2 * 3; n } n "} +{"func_code_string": "#include n using namespace std; n void printv(vector v) { n long long int sz = v.size(); n for (long long int i = 0; i < sz; i++) { n if (i == sz - 1) n cout << v[i] << n ; n else n cout << v[i] << ; n } n } n void input(long long int a[], long long int sz) { n for (long long int i = 0; i < sz; i++) cin >> a[i]; n } n void print(long long int a[], long long int sz) { n for (long long int i = 0; i < sz; i++) { n if (i == sz - 1) n cout << a[i] << n ; n else n cout << a[i] << ; n } n } n long long int dx1[] = {1, 1, 0, -1, -1, -1, 0, 1}; n long long int dy1[] = {0, 1, 1, 1, 0, -1, -1, -1}; n long long int dx2[] = {1, 0, -1, 0}; n long long int dy2[] = {0, 1, 0, -1}; n long long int mul(long long int a, long long int b, n long long int p = 1000000007) { n return ((a % p) * (b % p)) % p; n } n long long int add(long long int a, long long int b, n long long int p = 1000000007) { n return (a % p + b % p) % p; n } n long long int power(long long int x, long long int y, n long long int p = 1000000007) { n long long int res = 1; n x = x % p; n while (y > 0) { n if (y & 1) res = (res * x) % p; n y = y >> 1; n x = (x * x) % p; n } n return res; n } n long long int modInverse(long long int n, long long int p = 1000000007) { n return power(n, p - 2, p); n } n long long int ncrMod(long long int n, long long int r, n long long int p = 1000000007) { n if (r == 0) return 1; n long long int fac[n + 1]; n fac[0] = 1; n for (long long int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p; n return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % n p; n } n bool ispeed2ime(long long int n) { n for (int i = 2; i * i <= n; i++) { n if (n % i == 0) { n return false; n } n } n return true; n } n bool isPowerof2(long long int n) { n while (n > 1) { n if (n % 2 != 0) { n return true; n } n n /= 2; n } n return false; n } n string reverse(string str, int len, int l, int r) { n if (l < 0 || r >= len || l > r) return str; n while (l < r) { n char c = str[l]; n str[l] = str[r]; n str[r] = c; n l++; n r--; n } n return str; n } n void solve() { n long long int n; n cin >> n; n string s; n cin >> s; n string temp = ; n long long int maxi1 = 0, maxi2 = 0; n for (int i = 0; i < n - 1; i++) { n temp += s[i]; n temp += s[i + 1]; n if (temp == 10 ) { n maxi1++; n } else if (temp == 01 ) { n maxi2++; n } n temp = ; n } n long long int maxi = max(maxi1, maxi2); n long long int cnt = n / 2 - (maxi); n cout << cnt << n ; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n long long int t = 1; n cin >> t; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n bool QQQQ; n const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1}; n const int dy[] = {0, 0, -1, 1, 1, -1, 1, -1}; n using namespace std; n int ttt = 1; n int n, k, res = 100256, z, cnt; n string s, t, ans; n void solve() { n cin >> n >> k >> s; n ans = s; n for (int i = 0; i < n; i++) ans[i] = 9 ; n for (int i = 0; i < 10; i++) { n t = s; n z = k; n cnt = 0; n for (int j = 0; j < 10; j++) { n for (int l = 0; l < n; l++) n if (z && t[l] - 0 == i + j) { n z--; n t[l] = i + 0 ; n cnt += j; n } n if (j) n for (int l = n - 1; l >= 0; l--) n if (z && t[l] - 0 == i - j) { n z--; n t[l] = i + 0 ; n cnt += j; n } n } n if (cnt < res) res = cnt, ans = t; n if (cnt == res) ans = min(ans, t); n } n cout << res << endl << ans; n } n int main() { n for (int tt = 1; tt <= (ttt = ttt); tt++) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(); n cin.tie(); n int t, n, a, b; n cin >> t; n while (t--) { n int a, b; n cin >> a >> b; n int c = abs(a - b); n int ans = 0; n int tmp = c / 5; n ans += tmp; n c -= tmp * 5; n tmp = c / 2; n ans += tmp; n c -= tmp * 2; n tmp = c / 1; n ans += tmp; n c -= tmp * 1; n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n unsigned long long int dist[1150][1150], visited[1150][1150]; n char ans[1050][1050]; n void solve() { n long long n, i, j, m; n cin >> n >> m; n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) cin >> ans[i][j]; n } n int startx, starty, endx, endy; n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n if (ans[i][j] == E ) { n endx = i; n endy = j; n } n if (ans[i][j] == S ) { n startx = i; n starty = j; n } n } n } n for (i = 0; i < n; i++) n for (j = 0; j < m; j++) { n dist[i][j] = INT_MAX; n visited[i][j] = 0; n } n int rowcol[] = {0, 0, 1, -1}; n int colcol[] = {1, -1, 0, 0}; n dist[endx][endy] = 0; n visited[endx][endy] = 1; n queue > q; n q.push({endx, endy}); n while (q.empty() == 0) { n pair point = q.front(); n q.pop(); n int x = point.first; n int y = point.second; n for (i = 0; i < 4; i++) { n int x1 = x + rowcol[i]; n int y1 = y + colcol[i]; n if (x1 >= 0 && y1 >= 0 && x1 < n && y1 < m && ans[x1][y1] != T ) { n if (visited[x1][y1] == 0) { n dist[x1][y1] = dist[x][y] + 1; n visited[x1][y1] = 1; n q.push({x1, y1}); n } n } n } n } n unsigned long long int count = 0; n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n if (startx == i && starty == j) { n continue; n } n if (dist[startx][starty] >= dist[i][j] && ans[i][j] != 0 && n ans[i][j] != T && ans[i][j] != E ) n count += ans[i][j] - 0 ; n } n } n cout << count << endl; n } n int main() { n long long n = 1, x1, y1, x2, y2, i; n while (n--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, p[3005], d[3005][3005], p0[3005], p50[3005], p100[3005], ans; n queue x, y; n int main() { n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; i++) { n scanf( %d , p + i); n if (p[i] == 0) n p0[1]++; n else if (p[i] == 100) n p100[1]++; n else n p50[1]++; n } n if (n == 1) { n printf( 1 n ); n return 0; n } n for (int i = 2; i <= n; i++) { n p0[i] = p0[i - 1], p50[i] = p50[i - 1], p100[i] = p100[i - 1]; n if (p[i - 1] == 0) n p0[i]--; n else if (p[i - 1] == 100) n p100[i]--; n else n p50[i]--; n } n d[1][2] = 1; n x.push(1), y.push(2); n while (!x.empty()) { n int a = x.front(), b = y.front(); n x.pop(), y.pop(); n ans++; n if (b > n || d[a][b] > k) continue; n if (p[a] > 0 && (p50[b] || p100[b]) && !d[b + 1][b + 2]) n d[b + 1][b + 2] = d[a][b] + 1, x.push(b + 1), y.push(b + 2); n if (p[a] > 0 && (!p100[b]) && !d[a][b + 1]) n d[a][b + 1] = d[a][b] + 1, x.push(a), y.push(b + 1); n if (p[a] < 100 && (p50[b] || p100[b]) && !d[b][b + 1]) n d[b][b + 1] = d[a][b] + 1, x.push(b), y.push(b + 1); n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e5 + 5; n const int inf = 0x3f3f3f3f; n long long dp[maxn]; n int n, m; n struct node { n int lb, lu; n long long w; n }; n vector ve[maxn]; n int lb, lu; n long long w, cost[maxn]; n struct seg { n long long ma, lazy; n } tr[maxn << 2]; n void build(int o, int l, int r) { n tr[o].ma = 0; n tr[o].lazy = 0; n if (l == r) { n return; n } n int mid = (l + r) >> 1; n build(o << 1, l, mid); n build(o << 1 | 1, mid + 1, r); n } n void pushup(int o) { tr[o].ma = max(tr[o << 1].ma, tr[o << 1 | 1].ma); } n void pushdown(int o) { n if (tr[o].lazy) { n tr[o << 1].ma += tr[o].lazy; n tr[o << 1 | 1].ma += tr[o].lazy; n tr[o << 1].lazy += tr[o].lazy; n tr[o << 1 | 1].lazy += tr[o].lazy; n tr[o].lazy = 0; n } n } n void update(int o, int l, int r, int ql, int qr, long long val) { n if (ql <= l && qr >= r) { n tr[o].ma += val; n tr[o].lazy += val; n return; n } n pushdown(o); n int mid = (l + r) >> 1; n if (ql <= mid) update(o << 1, l, mid, ql, qr, val); n if (qr > mid) update(o << 1 | 1, mid + 1, r, ql, qr, val); n pushup(o); n } n long long query(int o, int l, int r, int ql, int qr) { n if (ql <= l && qr >= r) { n return tr[o].ma; n } n pushdown(o); n int mid = (l + r) >> 1; n long long maxx = 0; n if (ql <= mid) maxx = max(maxx, query(o << 1, l, mid, ql, qr)); n if (qr > mid) maxx = max(maxx, query(o << 1 | 1, mid + 1, r, ql, qr)); n return maxx; n } n int main() { n while (cin >> n >> m) { n for (int i = 1; i <= n; i++) { n scanf( %lld , &cost[i]); n } n for (int i = 1; i <= m; i++) { n scanf( %d%d%lld , &lb, &lu, &w); n ve[lu].push_back({lb, lu, w}); n } n build(1, 0, n + 1); n long long maxx = 0; n for (int i = 1; i <= n + 1; i++) { n dp[i] = dp[i - 1]; n update(1, 0, n + 1, 0, i - 1, -cost[i]); n for (int j = 0; j < ve[i].size(); j++) { n lb = ve[i][j].lb, w = ve[i][j].w; n update(1, 0, n + 1, 0, lb - 1, w); n } n dp[i] = max(dp[i], query(1, 0, n + 1, 0, i - 1)); n update(1, 0, n + 1, i, i, dp[i]); n maxx = max(maxx, dp[i]); n } n printf( %lld n , maxx); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int cntrow[21]; n int cntcol[6]; n vector sol; n vector allmasks[6]; n bool DP[20][11][11][11][11][11][(1 << 5) + 1]; n bool solve(int row, int c1, int c2, int c3, int c4, int c5, int mask) { n if (row == m) { n int tmp = c1 + c2 + c3 + c4 + c5; n if (tmp == 0) return true; n return false; n } n bool &temp = DP[row][c1][c2][c3][c4][c5][mask]; n if (temp) return false; n temp = true; n for (int i = 0; i < allmasks[cntrow[row]].size(); i++) { n int tmp = allmasks[cntrow[row]][i]; n int nc1 = c1; n int nc2 = c2; n int nc3 = c3; n int nc4 = c4; n int nc5 = c5; n if ((mask & (1 << 0)) == 0 && (tmp & (1 << 0)) != 0) nc1--; n if ((mask & (1 << 1)) == 0 && (tmp & (1 << 1)) != 0) nc2--; n if ((mask & (1 << 2)) == 0 && (tmp & (1 << 2)) != 0) nc3--; n if ((mask & (1 << 3)) == 0 && (tmp & (1 << 3)) != 0) nc4--; n if ((mask & (1 << 4)) == 0 && (tmp & (1 << 4)) != 0) nc5--; n if (nc1 < 0 || nc2 < 0 || nc3 < 0 || nc4 < 0 || nc5 < 0) continue; n if (solve(row + 1, nc1, nc2, nc3, nc4, nc5, tmp)) { n sol.push_back(tmp); n return true; n } n } n return false; n } n int main() { n ios_base::sync_with_stdio(0); n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> cntcol[i]; n for (int i = 0; i < m; i++) cin >> cntrow[i]; n for (int i = 0; i < (1 << n); i++) { n int cnt = 0; n for (int j = 0; j < n; j++) { n if (j == 0 || ((i & (1 << (j - 1))) == 0)) n if ((i & (1 << j)) != 0) cnt++; n } n allmasks[cnt].push_back(i); n } n solve(0, cntcol[0], cntcol[1], cntcol[2], cntcol[3], cntcol[4], 0); n reverse(sol.begin(), sol.end()); n for (int j = 0; j < n; j++) { n for (int i = 0; i < sol.size(); i++) { n if (sol[i] & (1 << j)) n cout << * ; n else n cout << . ; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void f(int& r, int& g, int& b) { n if (r >= 3 && g % 3 == 2 && b % 3 == 2) { n r += 4; n g -= 2; n b -= 2; n } n } n int main(void) { n int r, g, b; n cin >> r >> g >> b; n f(r, g, b); n f(g, r, b); n f(b, r, g); n cout << r / 3 + g / 3 + b / 3 + min(r % 3, min(g % 3, b % 3)) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cout.setf(ios::fixed); n cout.precision(20); n int T; n cin >> T; n while (T--) { n int n; n cin >> n; n n *= 2; n vector a(n); n for (int &x : a) { n cin >> x; n } n map left, right; n map was; n int red = 0, blue = 0; n int res = n; n for (int i = n - 1; i >= n / 2; i--) { n int toEat = n / 2 - (n - i); n red += (a[i] == 1); n blue += (a[i] == 2); n right[red - blue] = toEat; n was[red - blue] = true; n if (i == n / 2 && red == blue) { n res = min(res, n / 2); n } n if (red == blue) { n res = min(res, n / 2 + toEat); n } n } n red = blue = 0; n for (int i = 0; i < n / 2; i++) { n int toEat = n / 2 - i - 1; n red += (a[i] == 1); n blue += (a[i] == 2); n if (red == blue) { n res = min(res, n / 2 + toEat); n } n if (was[blue - red]) { n res = min(res, toEat + right[blue - red]); n } n if (i == n / 2 - 1 && red == blue) { n res = min(res, n / 2); n } n } n cout << res << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string str; n cin >> str; n int n = str.size(); n int fl = 1; n vector v; n for (int i = 0; i < str.size(); i++) { n if (str[i] == / ) { n while (str[i] == / ) { n i++; n } n i--; n v.push_back( / ); n } else { n v.push_back(str[i]); n } n } n for (int i = 0; i < v.size(); i++) { n if (v[i] != / ) { n fl = 0; n break; n } n } n if (fl == 1) { n cout << / << endl; n } else { n int t = v.size(); n for (int i = 0; i < t; i++) { n if (i == t - 1 && v[i] == / ) { n continue; n } else { n cout << v[i]; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int k; n cin >> k; n string s; n cin >> s; n long long tot = 0; n int av[11]; n memset(av, 0, sizeof(av)); n int ans = 0; n for (char a : s) tot += a - 0 , av[9 - (a - 0 )]++; n for (int i = 10; i; i--) { n if (tot >= k) break; n if (k - av[i] * i < tot) { n while (k > tot) { n k -= i; n ans++; n } n break; n } else { n k -= av[i] * i; n ans += av[i]; n } n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, i, j; n scanf( %d , &n); n if (n == 1) n printf( 1 n1 n ); n else if (n == 2) n printf( 1 n1 n ); n else if (n == 3) n printf( 2 n1 3 n ); n else if (n == 4) n printf( 4 n2 4 1 3 n ); n else { n printf( %d n , n); n for (j = 2; j <= n; j += 2) printf( %d , j); n for (j = 1; j <= n; j += 2) printf( %d , j); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int ar[11000111]; n int el[5100]; n int q, x, k, n; n long long t; n int min(int a, int b) { n if (a < b) { n return a; n } n return b; n } n int main() { n scanf( %d , &n); n scanf( %d , &k); n for (int i = 0; i < n; ++i) { n scanf( %d , &x); n ar[x] = 1; n el[i] = x; n } n scanf( %d , &q); n for (int qq = 0; qq < q; ++qq) { n scanf( %I64d , &t); n int ans = 100; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < k + 1; ++j) { n long long temp = t - el[i] * j; n if (temp > 0) { n for (int l = 1; l <= k - l + 1; ++l) { n if (temp % l == 0 && temp / l <= 10111000 && ar[temp / l] == 1) { n ans = min(ans, l + j); n } n } n } n } n } n if (ans <= k) { n printf( %d n , ans); n } else { n printf( -1 n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0), n cout.precision(15); n int t; n cin >> t; n while (t--) { n int n, x; n set s; n cin >> n; n for (int i = int(0); i < int(n); i++) { n cin >> x; n s.insert(x); n } n cout << s.size() << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[10000000], b[10000000], memo[10000000], pos[10000000]; n int min(int l, int r) { n if (l <= r) { n return l; n } n return r; n } n int main() { n int n, m, i, j, k, ind, p, l, x; n fscanf(stdin, %d %d , &n, &m); n for (i = 1; i <= n; i++) { n fscanf(stdin, %d , &a[i]); n } n i = 1; n ind = 1; n while (i <= n) { n j = i; n k = a[i]; n memo[ind] = k; n pos[ind] = i; n while (j <= n && a[j] == k) { n b[j] = ind; n j++; n } n i = j; n ind++; n } n for (i = 1; i <= m; i++) { n fscanf(stdin, %d %d %d , &p, &l, &x); n if (b[p] == b[l]) { n if (x == a[p]) { n cout << -1 << endl; n } else { n cout << p << endl; n } n } else { n ind = b[p]; n if (memo[b[p]] != x) { n cout << p << endl; n } else { n ind = 1; n while (pos[b[p] + ind] == x) { n ind++; n } n cout << pos[b[p] + ind] << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[1005]; n long long t, ans = 0; n int x, l; n int main() { n scanf( %s , s); n int len = strlen(s); n for (int i = 0; i < len; i++) { n if (isalpha(s[i])) { n if (t) { n if (l == 2) n ans += t; n else n ans += t * 100; n } n t = 0; n x = 0; n l = 0; n } else { n if (isdigit(s[i])) { n t = t * 10 + s[i] - 0 ; n if (x) { n l++; n } n } else { n x = 1; n l = 0; n } n } n } n if (t) { n if (l == 2) { n ans += t; n } else n ans += t * 100; n } n long long temp = ans / 100; n long long temp1 = ans % 100; n len = 0; n string A = ; n if (temp == 0) A = A + 0 ; n while (temp) { n if (len && len % 3 == 0) { n A = A + . ; n } n char c = 0 + temp % 10; n A = A + c; n temp /= 10; n len++; n } n reverse(A.begin(), A.end()); n cout << A; n if (temp1) { n printf( .%.2I64d , temp1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector g[1000010]; n int n, k; n bool r[1000010]; n int s[1000010]; n int m[1000010]; n int main() { n scanf( %d %d , &n, &k); n for (int i = 0; i < k; i++) { n int x, y; n scanf( %d %d , &x, &y); n g[x].push_back(y); n } n int v = 0; n for (int i = 1; i <= n; i++) { n if (r[i]) continue; n s[v++] = i; n r[i] = true; n for (int j = 0; j < (int)g[i].size(); j++) r[g[i][j]] = true; n } n int sz = 0; n for (int i = 1; i <= n; i++) r[i] = false; n for (int i = v - 1; i >= 0; i--) { n if (!r[s[i]]) { n m[sz++] = s[i]; n for (int j = 0; j < (int)g[s[i]].size(); j++) r[g[s[i]][j]] = true; n } n } n printf( %d n , sz); n for (int i = 0; i < sz; i++) printf( %d , m[i]); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n using namespace std; n int n, k, a[1010][1010]; n vector> ans; n int main() { n int is = 0; n ans.clear(); n memset(a, 0, sizeof(a)); n cin >> n >> k; n for (int i = 1; i <= n; ++i) { n int cnt = 0; n for (int j = 1; j <= n; ++j) { n if (i == j) continue; n if (cnt == k) break; n if (a[j][i] == 0) { n a[i][j] = 1; n ++cnt; n ans.push_back({i, j}); n } n } n if (cnt != k) { n cout << -1 ; n return 0; n } n } n if (!is) { n cout << ans.size() << n ; n for (auto i : ans) { n cout << i.first << << i.second << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n vector adjs[510]; n char type[510]; n bool visited[510]; n int dfs(int v, int adj, char c) { n visited[v] = true; n type[v] = c; n int totV = 1; n for (int i = 0; i < (adj); i++) { n int adjV = adjs[v][i]; n if (!visited[adjV] && adjs[adjV].size() == adj) totV += dfs(adjV, adj, c); n } n return totV; n } n int main(int argc, char **argv) { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n >> m; n for (int var = 0; var < (n); var++) type[var] = ( x ); n for (int var = 0; var < (n); var++) visited[var] = (false); n for (int i = 0; i < (m); i++) { n int u, v; n cin >> u >> v; n u--; n v--; n adjs[u].push_back(v); n adjs[v].push_back(u); n } n int adja = -1, adjb = n - 1, adjc = -1; n int na = 0, nb = 0, nc = 0; n bool pos = true; n for (int i = 0; i < (n); i++) { n int k = adjs[i].size(); n if (k == adjb) { n nb++; n type[i] = b ; n visited[i] = true; n } else if (!visited[i]) { n if (na == 0) { n adja = adjs[i].size(); n na = dfs(i, adja, a ); n } else if (nc == 0) { n adjc = adjs[i].size(); n nc = dfs(i, adjc, c ); n } else n pos = false; n } n } n type[n] = 0 ; n if (pos && na + nb + nc == n && (adja == -1 || adja == na + nb - 1) && n (adjc == -1 || adjc == nb + nc - 1)) { n cout << ( Yes ) << n ; n cout << (type) << n ; n } else { n cout << ( No ) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 9; n const int L = 301; n const int INF = 1e9 + 239; n int n; n int a[N]; n int cnt[N]; n vector pos[N]; n int mn[2 * N]; n void solve(vector> v, int &ans) { n v.push_back({n - 1, 0}); n int prev = -1; n int c = 0; n mn[N] = 0; n for (auto [pos, val] : v) { n if (abs(prev) < 2) ans = max(ans, (pos - 1) - mn[c + N] + 1); n c += val; n ans = max(ans, pos - mn[c + N] + 1); n mn[c + N] = min(mn[c + N], pos + 1); n prev = val; n } n c = 0; n mn[0] = INF; n for (auto [pos, val] : v) { n c += val; n mn[c + N] = INF; n } n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n fill(mn, mn + 2 * N, INF); n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i]; n cnt[a[i]]++; n pos[a[i]].push_back(i); n } n int ans = 0; n int mx = max_element(cnt, cnt + N) - cnt; n int pnt = -1; n int sz = -1; n vector> vplus, vminus; n auto add = [&](int p) { n int imx = lower_bound(pos[mx].begin(), pos[mx].end(), p) - pos[mx].begin(); n int l = max(pnt + 1, imx - (sz + 3)); n if (pnt + 1 < imx - (sz + 3)) { n vplus.push_back({pos[mx][pnt + 1], imx - (sz + 3) - (pnt + 1)}); n } n for (int i = l; i <= imx + (sz + 3) && i < (int)pos[mx].size(); i++) { n vplus.push_back({pos[mx][i], 1}); n pnt = i; n } n }; n auto relax_small = [&](int s) { n if (pos[s].empty()) { n return; n } n vplus.clear(); n vminus.clear(); n sz = (int)pos[s].size(); n pnt = -1; n { add(0); } n for (auto p : pos[s]) { n add(p); n vminus.push_back({p, -1}); n } n { add(n - 1); } n vector> vall(vplus.size() + vminus.size()); n merge(vplus.begin(), vplus.end(), vminus.begin(), vminus.end(), n vall.begin()); n solve(vall, ans); n }; n auto relax_big = [&](int s) { n if (pos[s].empty()) { n return; n } n vplus.clear(); n vminus.clear(); n for (auto p : pos[mx]) { n vplus.push_back({p, 1}); n } n for (auto p : pos[s]) { n vminus.push_back({p, -1}); n } n vector> vall(vplus.size() + vminus.size()); n merge(vplus.begin(), vplus.end(), vminus.begin(), vminus.end(), n vall.begin()); n solve(vall, ans); n }; n for (int other = 0; other < N; other++) { n if (other == mx) { n continue; n } n if (pos[other].size() > L) { n relax_big(other); n } else { n relax_small(other); n } n } n cout << ans << n ; n } n "} +{"func_code_string": "#pragma GCC optimize ( O3 ) n #pragma GCC target ( sse4 ) n #include n using namespace std; n typedef long long ll; n typedef long double ld; n typedef vector vi; n typedef pair pi; n #define debug(x) cerr << #x << : << x << n n #define debug2(x, y) debug(x), debug(y) n #define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++) n #define rep(i, a) for(int i = 0; i < (int)(a); i++) n #define all(v) v.begin(), v.end() n #define mp make_pair n #define pb push_back n #define lb lower_bound n #define ub upper_bound n #define fi first n #define se second n #define sq(x) ((x) * (x)) n const int MOD = 1e9 + 7; n const int mxN = 205; n n template T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); } n n vi g[mxN]; n int up[mxN][10]; n ll p[mxN][mxN]; n int st[mxN], en[mxN], d[mxN]; n int cnt = 0; n n void dfs(int cur, int prev, int di = 0){ n st[cur] = cnt++; n d[cur] = di; n up[cur][0] = prev; n repn(i, 1, 10) up[cur][i] = up[up[cur][i - 1]][i - 1]; n for(int x : g[cur]) if(x != prev) dfs(x, cur, di + 1); n en[cur] = cnt++; n } n n bool upper(int a, int b){ n return st[a] <= st[b] && en[a] >= en[b]; n } n n int lca(int a, int b){ n if(upper(a, b)) return a; n if(upper(b, a)) return b; n for(int i = 9; i >= 0; i--) if(!upper(up[a][i], b)) a = up[a][i]; n return up[a][0]; n } n n ll mypow(ll a, ll p){ n if(p == 0) return 1; n if(p == 1) return (a % MOD); n if(p & 1) return ((a % MOD) * (mypow(a, p - 1) % MOD)) % MOD; n ll x = mypow(a, p / 2) % MOD; n return (x * x) % MOD; n } n n ll inv(ll base){ n return mypow(base, MOD - 2); n } n n int main(){ n ios_base::sync_with_stdio(false); n cin.tie(0); n //freopen( input.in , r , stdin); n //freopen( output.out , w , stdout); n ll n; n cin >> n; n rep(i, n - 1){ n int x, y; n cin >> x >> y; n x--, y--; n g[x].pb(y); n g[y].pb(x); n } n p[0][0] = 1LL; n rep(i, mxN - 1){ n rep(j, i + 1){ n int k = i - j; n (p[j + 1][k] += (p[j][k] * inv(2)) % MOD) %= MOD; n (p[j][k + 1] += (p[j][k] * inv(2)) % MOD) %= MOD; n } n } n rep(k, n) repn(j, 1, n) (p[j][k] += p[j - 1][k]) %= MOD; n ll ans = 0LL; n rep(i, n){ n cnt = 0; n dfs(i, i); n rep(j, n) repn(k, j + 1, n){ n if(upper(k, j)) ans++; n else if(!upper(j, k)){ n int c = lca(j, k); n int a = d[j] - d[c], b = d[k] - d[c]; n (ans += (p[a - 1][b - 1] * inv(2)) % MOD) %= MOD; n } n } n } n cout << (ans * inv(n)) % MOD << n ; n return 0; n } n /* n Things to look out for: n - Integer overflows n - Make sure that max is large enough (2e9, 4e18) n - Special cases n Be careful! n */ n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:2000000 ) n #pragma comment(linker, /HEAP:2000000 ) n using namespace std; n void print_width(long long x) { n std::cout << std::fixed; n std::cout << std::setprecision(x); n } n long long power(long long x, long long y, long long p = 1000000007) { n long long res = 1; n x = x % p; n while (y > 0) { n if (y & 1) res = (res * x) % p; n y = y >> 1; n x = (x * x) % p; n } n return res; n } n void printArr(long long a[], long long n) { n for (long long i = 0; i < n; i++) cout << a[i] << ; n cout << n ; n } n void printVector(std::vector v) { n for (long long i = 0; i < v.size(); i++) cout << v[i] << ; n cout << n ; n } n void printVectorPair(std::vector> v) { n for (long long i = 0; i < v.size(); i++) n cout << v[i].first << << v[i].second << n ; n ; n cout << n ; n } n void initialize(long long arr[], long long n) { n for (long long i = 0; i <= n; i++) arr[i] = i; n } n long long root(long long arr[], long long i) { n while (arr[i] != i) { n arr[i] = arr[arr[i]]; n i = arr[i]; n } n return i; n } n void Union(long long arr[], long long a, long long b) { n long long root_a = root(arr, a); n long long root_b = root(arr, b); n arr[root_a] = root_b; n } n long long gcd(long long a, long long b) { n if (b == 0) n return a; n else n return gcd(b, a % b); n } n long long power_wm(long long x, long long y) { n long long res = 1; n while (y > 0) { n if (y & 1) res = (res * x); n y = y >> 1; n x = (x * x); n } n return res; n } n std::vector vsum(std::vector a) { n std::vector s(a.size()); n s[0] = a[0]; n for (long long i = 1; i <= a.size() - 1; i++) { n s[i] = s[i - 1] + a[i]; n } n return s; n } n void time() {} n long long sti(string s) { n long long ans = 0; n long long p = 1; n for (long long i = s.size() - 1; i >= 0; i--) { n ans = (ans + ((long long)(s[i] - 0 ) * p) % 1000000007) % 1000000007; n p = (p * 10) % 1000000007; n } n return ans; n } n long long bfs(long long x, long long y, vector> &g) { n std::vector vis(100001, 0); n vis[x] = 1; n queue q; n q.push(x); n std::vector level(100001, (long long)1e18); n level[x] = 0; n while (!q.empty()) { n long long p = q.front(); n q.pop(); n for (long long i = 0; i < g[p].size(); i++) { n long long p2 = g[p][i]; n if (vis[p2] == 0) { n if (x == p and y == p2) { n continue; n } else { n q.push(p2); n vis[p2] = 1; n level[p2] = level[p] + 1; n } n } n } n } n return level[y]; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long N = 5000001; n std::vector lp(N, 0); n std::vector pr; n for (long long i = 2; i <= N - 1; i++) { n if (lp[i] == 0) { n lp[i] = i; n pr.push_back(i); n } n for (long long j = 0; n j < (long long)pr.size() and pr[j] <= lp[i] and i * pr[j] <= N; j++) n lp[i * pr[j]] = pr[j]; n } n lp[1] = 1; n std::vector count(N, 0); n for (long long i = 2; i <= N - 1; i++) { n long long prm = i; n count[i]++; n while (lp[prm] != prm) { n count[i]++; n prm = prm / lp[prm]; n } n } n count = vsum(count); n long long t; n cin >> t; n while (t--) { n long long a, b; n cin >> a >> b; n cout << count[a] - count[b] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n clock_t __stt; n inline void TStart() { __stt = clock(); } n inline void TReport() { n printf( nTaken Time : %.3lf sec n , n (double)(clock() - __stt) / CLOCKS_PER_SEC); n } n template n T MIN(T a, T b) { n return a < b ? a : b; n } n template n T MAX(T a, T b) { n return a > b ? a : b; n } n template n T ABS(T a) { n return a > 0 ? a : (-a); n } n template n void UMIN(T &a, T b) { n if (b < a) a = b; n } n template n void UMAX(T &a, T b) { n if (b > a) a = b; n } n const int bc = 6, mc = 64; n int n, m, subcnt[mc], chcnt[mc], avai[100005]; n char s[100005], tmp[10]; n int main() { n int i, j, k; n scanf( %s , s); n n = strlen(s); n scanf( %d , &m); n fill(avai, avai + n, mc - 1); n while (m--) { n scanf( %d%s , &j, tmp); n k = strlen(tmp); n avai[--j] = 0; n for (i = 0; i < k; ++i) { n avai[j] += (1 << (tmp[i] - a )); n } n } n for (i = 0; i < n; ++i) { n for (j = 0; j < mc; ++j) { n if ((avai[i] & j) == avai[i]) { n ++subcnt[j]; n } n if ((1 << (s[i] - a )) & j) { n ++chcnt[j]; n } n } n } n for (i = 0; i < n; ++i) { n for (j = 0; j < bc; ++j) { n if (!(avai[i] & (1 << j))) continue; n s[i] = a + j; n for (k = 0; k < mc; ++k) { n if ((avai[i] & k) == avai[i]) { n --subcnt[k]; n } n if ((1 << j) & k) { n --chcnt[k]; n } n } n for (k = 0; k < mc; ++k) { n if (chcnt[k] < subcnt[k]) break; n } n if (k == mc) break; n for (k = 0; k < mc; ++k) { n if ((avai[i] & k) == avai[i]) { n ++subcnt[k]; n } n if ((1 << j) & k) { n ++chcnt[k]; n } n } n } n if (j == bc) { n printf( Impossible n ); n return 0; n } n } n printf( %s n , s); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int lastr, lastc; n int n, m, a, b; n int row1[10], rcnt, ans; n int main() { n int i, j, k; n while (scanf( %d%d%d%d , &n, &m, &a, &b) != EOF) { n if (m == 1) { n printf( 1 n ); n continue; n } n lastr = (n + m - 1) / m; n lastc = n % m; n lastc = lastc == 0 ? m : lastc; n ans = 0, rcnt = 0; n row1[++rcnt] = (a + m - 1) / m; n if ((b + m - 1) / m != (a + m - 1) / m) { n if ((b + m - 1) / m == (a + m - 1) / m + 1) n row1[++rcnt] = (b + m - 1) / m; n else n row1[++rcnt] = row1[1] + 1, row1[++rcnt] = (b + m - 1) / m; n } n int ta = a % m, tb = b % m; n if (ta == 0) ta = m; n if (tb == 0) tb = m; n if (rcnt == 1) n printf( 1 n ); n else if (rcnt == 2) { n if (ta == 1 && n (row1[2] != lastr && tb == m || row1[2] == lastr && tb == lastc)) n printf( 1 n ); n else n printf( 2 n ); n } else { n if (ta == 1 && n (row1[3] != lastr && tb == m || row1[3] == lastr && tb == lastc)) n printf( 1 n ); n else if (ta == 1 || tb == m || ta - 1 == tb || n (lastr == row1[3] && lastc == tb)) n printf( 2 n ); n else n printf( 3 n ); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n void solve() { n int n; n cin >> n; n string s = string(n, ( ) + string(n, ) ); n cout << s << n ; n for (int i = 0; i + 1 < n; ++i) { n s[i + 1] = ) ; n s[2 * n - 2] = ( ; n cout << s << n ; n s[2 * n - 2] = ) ; n s[i + 1] = ( ; n } n } n int main() { n ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr), n cout.precision(12); n int t; n cin >> t; n while (t--) solve(); n } n "} +{"func_code_string": "#include n long long minus(long long k) { return (1000000009LL - 1 + k) % 1000000009LL; } n long long multiply(long long k) { return (k * 2) % 1000000009LL; } n long long multiply(long long a, long long b) { return (a * b) % 1000000009LL; } n int main() { n int n, m; n scanf( %d %d , &n, &m); n long long p = 1; n for (int i = 0; i < m; i++) p = multiply(p); n if (m < 20 && p < n) { n printf( 0 n ); n return 0; n } n long long ans = 1; n for (int i = 0; i < n; i++) { n p = minus(p); n ans = multiply(ans, p); n } n printf( %I64d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e6 + 5; n const long long MOD = 1e9 + 7; n set seen; n void solve() { n int n; n cin >> n; n string a; n string b; n cin >> a >> b; n for (int i = 0; i < n; i++) { n if (a[i] > b[i]) { n cout << -1 n ; n return; n } n } n int ans = 0; n for (char c = a ; c <= t ; c++) { n char smallest = z ; n for (int i = 0; i < n; i++) { n if (a[i] == c) { n if (a[i] != b[i]) smallest = min(smallest, b[i]); n } n } n if (smallest != z ) { n ans++; n for (int i = 0; i < n; i++) { n if (a[i] == c) { n if (a[i] != b[i]) { n a[i] = smallest; n } n } n } n } n } n cout << ans << n ; n } n int main() { n cin.sync_with_stdio(0); n cin.tie(0); n int TC; n cin >> TC; n while (TC--) { n solve(); n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize(2) n #pragma G++ optimize(2) n using namespace std; n char nc() { return getchar(); } n int read() { n int x = 0, y = 1; n char c = nc(); n while (!isdigit(c)) { n if (c == - ) y = -1; n c = nc(); n } n while (isdigit(c)) { n x = (x << 1) + (x << 3) + (c ^ 48); n c = nc(); n } n return x * y; n } n int n, p, q, up, prime[135], vst[135], bin[135]; n unsigned int now = 1, C[135], ANS = 0; n void divide(int x, int op) { n for (int i = 1; i <= prime[0]; i++) n while (!(x % prime[i])) bin[i] += op, x /= prime[i]; n if (op == 1 && x > 1) now *= (unsigned int)x; n } n unsigned int quick_pow(unsigned int x, int y) { n unsigned int re = 1; n while (y) { n if (y & 1) re = re * x; n x = x * x; n y >>= 1; n } n return re; n } n void pre() { n for (int i = 2; i <= up; i++) { n if (!vst[i]) prime[++prime[0]] = i; n for (int j = 1; j <= prime[0]; j++) { n if (i * prime[j] > up) break; n vst[i * prime[j]] = 1; n if (!(i % prime[j])) break; n } n } n C[0] = 1; n for (int i = 1; i <= up; i++) { n divide(n - i + 1, 1); n divide(i, -1); n C[i] = now; n for (int j = 1; j <= prime[0]; j++) C[i] *= quick_pow(prime[j], bin[j]); n } n } n int main() { n n = read(); n p = read(); n q = read(); n up = min(n - 1, p); n pre(); n for (int i = 1; i <= q; i++) { n unsigned int sm = 0, ha = 1; n for (int j = 0; j <= up; j++) sm += C[j] * ha, ha *= (unsigned int)i; n ANS ^= (sm * (unsigned int)i); n } n cout << ANS; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, k; n string s; n long long ans; n bool flag; n struct A { n int id, p, s; n }; n bool comp(A a, A b) { n if (a.p > b.p) return true; n return false; n } n void solve() { n cin >> n >> m >> k; n vector p(n); n for (auto i = 0; i < n; i++) cin >> p[i]; n ; n vector s(n); n for (auto i = 0; i < n; i++) cin >> s[i]; n ; n vector v(n); n for (auto i = 0; i < n; i++) { n v[i].id = i + 1; n v[i].s = s[i]; n v[i].p = p[i]; n } n sort(v.begin(), v.end(), comp); n unordered_set school; n unordered_set kid; n for (auto i = 0; i < n; i++) { n if (school.find(v[i].s) == school.end()) { n school.insert(v[i].s); n kid.insert(v[i].id); n } n int mm = school.size(); n if (mm == m) break; n } n vector K(k); n for (auto i = 0; i < k; i++) cin >> K[i]; n ; n int count = 0; n for (auto i = 0; i < k; i++) { n if (kid.find(K[i]) == kid.end()) { n count++; n } n } n cout << count; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 2e5 + 3, mod = 1e9 + 7, inf = 3e18 + 7; n long long tc, n, m, a, b, c, d, i, j, k; n long long A[N], odd[N], even[N]; n string s[N]; n vector vec; n int main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n cin >> tc; n while (tc--) { n cin >> n; n long long sum = 0, ans = 0, mx; n for (i = 1; i <= n; i++) cin >> A[i], sum += (i % 2 ? A[i] : 0); n A[n + 1] = A[n]; n for (i = 2; i <= n; i += 2) even[i] = even[i - 2] + A[i] - A[i - 1]; n for (i = 2; i <= n; i += 2) odd[i] = odd[i - 2] + A[i] - A[i + 1]; n if (n % 2) n--; n for (i = n, mx = even[n]; i > 0; i -= 2) n mx = max(mx, even[i]), ans = max(ans, mx - even[i - 2]); n for (i = n, mx = odd[n]; i > 0; i -= 2) n mx = max(mx, odd[i]), ans = max(ans, mx - odd[i - 2]); n cout << ans + sum << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long x, y; n cin >> x >> y; n long long n; n cin >> n; n n %= 6; n if (n == 0) n = 6; n long long data[7]; n data[1] = x; n data[2] = y; n for (int i = 3; i <= 6; i++) { n data[i] = data[i - 1] - data[i - 2]; n } n for (int i = 1; i <= 6; i++) n if (data[i] < 0) data[i] += 1000000007; n if (data[n] < 0) data[n] += 1000000007; n cout << data[n] % 1000000007 << n ; n return 0; n } n "} +{"func_code_string": "#include n long long read() { n long long res = 0, flag = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) flag = -1; n ch = getchar(); n } n while (isdigit(ch)) res = res * 10 + ch - 48, ch = getchar(); n return res * flag; n } n void print(long long x) { n if (x < 0) putchar( - ), x = -x; n if (x > 9) print(x / 10); n putchar(x % 10 + 48); n } n const long long N = 5000 + 5; n long long n, k, a[N], c[N]; n std::vector g[N]; n void solution() { n n = read(), k = read(); n long long tot = 0; n for (long long i = (1); i <= (n); ++i) a[i] = read(), g[a[i]].push_back(i); n for (long long i = (1); i <= (N - 1); ++i) { n if (g[i].size() > k) { n puts( NO ); n return; n } n for (auto v : g[i]) c[v] = ++tot, tot %= k; n } n puts( YES ); n for (long long i = (1); i <= (n); ++i) print(c[i]), putchar( ); n putchar( n ); n } n signed main() { n 42; n solution(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n vector v(n), vec; n for (int i = 0; i < n; i++) cin >> v[i]; n for (int i = 0; i < n; i++) { n if (v[i] == -1) continue; n if (i - 1 >= 0 && v[i - 1] == -1) vec.push_back(v[i]); n if (i + 1 < n && v[i + 1] == -1) vec.push_back(v[i]); n } n sort(vec.begin(), vec.end()); n long long num, res = -1; n if (vec.size() == 0) num = 1; n if (vec.size() == 1) num = vec[0]; n if (vec.size() >= 2) num = (vec[vec.size() - 1] + vec[0]) / 2; n for (int i = 0; i < n; i++) { n if (v[i] == -1) v[i] = num; n } n for (int i = 0; i < n - 1; i++) { n res = max(res, abs(v[i] - v[i + 1])); n } n cout << res << << num << endl; n } n return 0; n } n "} +{"func_code_string": "// annotshy n n #include n #define Task CF n #define pb push_back n #define MOD 1000000007 n #define F first n #define S second n #define int long long n n using namespace std; n n const int maxn = 2005; n n int n, m, w; n int a[maxn][maxn]; n int dx[5] = {1, 0, -1, 0}; n int dy[5] = {0, 1, 0, -1}; n long long dp[maxn][maxn], to1 = 0, to2 = 0; n n long long BFS(int i, int j) { n queue > Q; n Q.push({i, j}); n for(int p = 1; p <= n; ++ p) { n for(int q = 1; q <= m; ++ q) dp[p][q] = 1e18; n } n dp[i][j] = 0; n while(Q.size()) { n int u = Q.front().F; n int v = Q.front().S; n Q.pop(); n for(int k = 0; k < 4; ++ k) { n int x = u + dx[k]; n int y = v + dy[k]; n if(x < 1 || y < 1 || x > n || y > m || a[x][y] == -1) continue; n if(dp[x][y] > dp[u][v] + w) { n dp[x][y] = dp[u][v] + w; n Q.push({x, y}); n } n } n } n long long res = 1e18; n if(i == 1 && j == 1) to1 = dp[n][m]; n if(i == n && j == m) to2 = dp[1][1]; n for(int i = 1; i <= n; ++ i) { n for(int j = 1; j <= m; ++ j) if(a[i][j] > 0) { n res = min(res, dp[i][j] + a[i][j]); n } n } n return res; n } n n void Solve() { n cin >> n >> m >> w; n for(int i = 1; i <= n; ++ i) { n for(int j = 1; j <= m; ++ j) cin >> a[i][j]; n } n long long res1 = BFS(1, 1); n long long res2 = BFS(n, m); n if(res1 + res2 >= 1e18 && to1 == 1e18 && to2 == 1e18) cout << - 1 << n ; n else cout << min({to1, to2, res1 + res2}) << n ; n } n n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0), cout.tie(0); n if(fopen(Task .inp , r )) { n freopen(Task .inp , r , stdin); n freopen(Task .out , w , stdout); n } n int test = 1; n // cin >> test; n while(test --) { n Solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int mx, n, m, sum, hh, la, v[1000001], a[100001], sz[1000010], tot, e[10000001], n nt[10000001], hd[1000010]; n void build(int x, int y) { n tot++; n e[tot] = y; n nt[tot] = hd[x]; n hd[x] = tot; n } n int main() { n int i, j, k; n mx = 1e6; n scanf( %d%d , &n, &m); n la = m; n m = m * (m + 1) / 2; n for (i = 1; i <= n; i++) scanf( %d , &a[i]); n sort(a + 1, a + n + 1); n for (i = 1; i <= n; i++) n for (j = 1; j < i; j++) sz[a[i] - a[j]]++; n for (i = 1; i <= n; i++) n for (j = 1; j < i; j++) n if (sz[a[i] - a[j]] <= m) build(a[i] - a[j], a[j]); n for (i = 1; i <= mx + 1; i++) { n sum = 0; n for (j = i; j <= mx + 1; j += i) sum += sz[j]; n if (sum > m) continue; n for (j = i; j <= mx + 1; j += i) n for (k = hd[j]; k; k = nt[k]) n if (v[e[k]] != i) { n v[e[k]] = i; n hh++; n } n if (hh <= la) return printf( %d , i), 0; n hh = 0; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, cv; n long long level[3501]; n long long vis[3501] = {}; n vector graph[3501]; n vector cycles[3501]; n vector z; n void dfs_cycle(long long u, long long p, long long color[], long long mark[], n long long par[], long long& cyclenumber) { n if (color[u] == 2) { n return; n } n if (color[u] == 1) { n cyclenumber++; n long long cur = p; n mark[cur] = cyclenumber; n while (cur != u) { n cur = par[cur]; n mark[cur] = cyclenumber; n } n return; n } n par[u] = p; n color[u] = 1; n for (long long v : graph[u]) { n if (v == par[u]) { n continue; n } n dfs_cycle(v, u, color, mark, par, cyclenumber); n } n color[u] = 2; n } n void printCycles(long long edges, long long mark[], long long& cyclenumber) { n for (long long i = 1; i <= edges; i++) { n if (mark[i] != 0) cycles[mark[i]].push_back(i); n } n for (long long i = 1; i <= cyclenumber; i++) { n for (long long x : cycles[i]) z.push_back(x); n } n } n void bfs(long long s) { n queue q; n q.push(s); n level[s] = 0; n vis[s] = 1; n while (!q.empty()) { n long long p = q.front(); n q.pop(); n for (long long i = 0; i < graph[p].size(); i++) { n if (vis[graph[p][i]] == 0) { n level[graph[p][i]] = min(level[graph[p][i]], level[p] + 1); n q.push(graph[p][i]); n vis[graph[p][i]] = 1; n } n } n } n } n void quickly_quickly_kro() { n cin >> n; n for (long long i = 1; i < n + 1; i++) { n long long a, b; n cin >> a >> b; n graph[a].push_back(b); n graph[b].push_back(a); n } n long long color[3501]; n long long par[3501]; n long long mark[3501]; n long long cyclenumber = 0; n long long edges = n; n dfs_cycle(1, 0, color, mark, par, cyclenumber); n printCycles(edges, mark, cyclenumber); n for (long long i = 1; i < n + 1; i++) level[i] = (long long)2e18; n for (auto k : z) { n for (long long i = 1; i < n + 1; i++) { n vis[i] = 0; n } n bfs(k); n } n for (long long i = 1; i < n + 1; i++) { n cout << level[i] << ; n } n } n signed main() { n std::ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long t; n t = 1; n while (t--) { n quickly_quickly_kro(); n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #define Buff std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0) n #define ll long long n #define inf LONG_LONG_MAX n #define Inf INT_MAX n #define endl n n n using namespace std; n n const int Maxn = 1e3 + 10; n const ll Mod = 1e9 + 7; n n int t, n; n char bd[Maxn][Maxn]; n bool firPos1; n int posX1, posX2, posX3, posX4; n int posY1, posY2, posY3, posY4; n int dis; n n void work() n { n firPos1 = false; n cin >> n; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= n; j++) n { n cin >> bd[i][j]; n if (bd[i][j] == * ) n { n if (firPos1 == false) n { n posX1 = i; n posY1 = j; n firPos1 = true; n }else n { n posX2 = i; n posY2 = j; n } n } n } n if (posX2 == posX1) n { n dis = 1; n if (posX1 - dis >= 1) n { n posX3 = posX1 - dis; n posX4 = posX1 - dis; n posY3 = posY1; n posY4 = posY2; n }else n { n posX3 = posX1 + dis; n posX4 = posX1 + dis; n posY3 = posY1; n posY4 = posY2; n } n }else n if (posY2 == posY1) n { n dis = 1; n if (posY1 - dis >= 1) n { n posY3 = posY1 - dis; n posY4 = posY1 - dis; n posX3 = posX1; n posX4 = posX2; n }else n { n posY3 = posY1 + dis; n posY4 = posY1 + dis; n posX3 = posX1; n posX4 = posX2; n } n }else n { n int minx = min(posX1,posX2); n int maxx = max(posX1,posX2); n int miny = min(posY1,posY2); n int maxy = max(posY1,posY2); n posX1 = minx; n posY1 = miny; n posX2 = minx; n posY2 = maxy; n posX3 = maxx; n posY3 = miny; n posX4 = maxx; n posY4 = maxy; n } n bd[posX1][posY1] = * ; n bd[posX2][posY2] = * ; n bd[posX3][posY3] = * ; n bd[posX4][posY4] = * ; n for (int i = 1; i <= n; i++) n { n for (int j = 1; j <= n; j++) n cout << bd[i][j]; n cout << endl; n } n } n n int main() n { n Buff; n cin >> t; n while (t--) n work(); n return 0; n }"} +{"func_code_string": "#include n int main() { n int t, i, j, k; n scanf( %d , &t); n int ranges[t][2000]; n int len[t]; n for (i = 0; i < t; ++i) { n scanf( %d , &len[i]); n for (j = 0; j < (2 * len[i]); j += 2) { n scanf( %d %d , &ranges[i][j], &ranges[i][j + 1]); n } n } n for (i = 0; i < t; ++i) { n int num[len[i]]; n for (j = 0; j < len[i]; ++j) { n num[j] = j + 1; n } n int sort[2 * len[i]]; n int c = 0, diff = 0; n while (c < 2 * len[i]) { n for (j = 0; j < (2 * len[i]); j += 2) { n if (ranges[i][j + 1] - ranges[i][j] == diff) { n sort[c] = ranges[i][j]; n sort[c + 1] = ranges[i][j + 1]; n c += 2; n } n } n diff += 1; n } n for (j = 0; j < (2 * len[i]); j += 2) { n int d; n diff = sort[j + 1] - sort[j]; n if (diff == 0) { n d = sort[j]; n num[d - 1] = 0; n printf( %d %d %d n , sort[j], sort[j + 1], d); n } else { n c = sort[j + 1]; n while (c >= sort[j]) { n if (num[c - 1] != 0) { n d = c; n num[c - 1] = 0; n printf( %d %d %d n , sort[j], sort[j + 1], d); n break; n } n c -= 1; n } n } n } n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int pp(int n) { n for (int i = 2; i <= floor(sqrt(n)); i++) { n if (n % i == 0) return i; n } n return 1; n } n void solve() { n long long int n, k; n cin >> n >> k; n if (k > n) n cout << max(0ll, n - k / 2) << endl; n else n cout << max(0ll, (k - 1) / 2) << endl; n } n int main() { n int t = 1; n while (t--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n int main() { n ios::sync_with_stdio(0), cin.tie(0); n ; n int n, m; n cin >> n >> m; n vector> v(n, vector(m)); n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) cin >> v[i][j]; n bool st = 1; n int mx = 0; n set se; n for (int i = 0; i < n; i++) { n int s = -1, g = -1; n for (int j = 0; j < m; j++) { n if (v[i][j] == G ) n g = j; n else if (v[i][j] == S ) n s = j; n } n if (s < g) n st = 0; n else n se.insert(s - g); n } n if (st) n cout << se.size(); n else n cout << -1; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n priority_queue, greater > a; n int temp; n int n, i; n int sum = 0; n scanf( %d , &n); n for (i = 1; i <= n; i++) { n scanf( %d , &temp); n a.push(temp); n } n temp = -1; n while (!a.empty()) { n if (a.top() == temp) { n printf( -1 n ); n return 0; n } else if (a.top() == 0) { n a.pop(); n } else { n temp = a.top(); n a.pop(); n if (!a.empty() && a.top() == temp) { n sum++; n a.pop(); n } n } n } n printf( %d n , sum); n return 0; n } n "} +{"func_code_string": "#include n int main() { n using namespace std; n int num, t1, t2, k; n cin >> num >> t1 >> t2 >> k; n double ms[1000]; n double ms2[1000]; n for (int i = 0; i < 1000; i++) { n ms[i] = 0; n ms2[i] = 0; n } n for (int i = 0; i < num; i++) { n int a, b; n cin >> a >> b; n double s1, s2; n s1 = a * t1 * ((100 - k) / 100.0) + t2 * b; n s2 = b * t1 * ((100 - k) / 100.0) + t2 * a; n if (s1 >= s2) n ms[i] = s1; n else n ms[i] = s2; n ms2[i] = ms[i]; n } n stable_sort(ms, ms + num); n int same; n for (int i = num - 1; i >= 0; i--) { n if (i < num - 1 && ms[i] == ms[i + 1]) n same++; n else n same = 0; n int p; n int pass = same; n for (int j = 0; j < num; j++) { n if (ms2[j] == ms[i]) { n if (pass > 0) { n pass--; n continue; n } n p = j + 1; n break; n } n } n double d = ((int)(ms[i] * 100 + 0.5)) / 100.0; n printf( %d %3.2f n , p, d); n } n } n "} +{"func_code_string": "#include n using namespace std; n long long int x[1000007], y[1000007], z[1000007], n; n string s, S; n vector v; n int main() { n { n long long int a = 0, b = 0, c = 0, d, e, f, g, i, j, k, l, m, p, q, r, u, w, n t, tc, in, mod, loc, diff, val, sz, lo, hi, mid, n mn = 2134567891, mx = 0, sum = 0, ans = 0; n cin >> s; n l = s.size(); n for (i = 0; i < l; i++) n if (s[i] == a ) a++; n if (a * 2 > l) n cout << l << endl; n else n cout << a * 2 - 1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double PI = 3.141592653589793238462643l; n void solve(); n int main() { n solve(); n return 0; n } n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n void solve() { n long long a, b, x1, y1, x2, y2; n cin >> a >> b >> x1 >> y1 >> x2 >> y2; n long long ans1, ans2; n long long eps11 = 0, eps12 = 0, eps21 = 0, eps22 = 0; n if (x1 + y1 < 0) eps11 = -2 * a; n if (x2 + y2 < 0) eps12 = -2 * a; n if (x1 - y1 < 0) eps21 = -2 * b; n if (x2 - y2 < 0) eps22 = -2 * b; n ans1 = (x1 + y1 + eps11) / (2 * a) - (eps12 + x2 + y2) / (2 * a); n ans2 = (eps21 + x1 - y1) / (2 * b) - (eps22 + x2 - y2) / (2 * b); n if (ans1 < 0) ans1 = -ans1; n if (ans2 < 0) ans2 = -ans2; n cout << max(ans1, ans2); n } n "} +{"func_code_string": "#include n using namespace std; n long long a, b, c, d, L, R, k, l, kk, ll, l1, r1, l2, r2, x, gcd, lcm; n inline long long exgcd(long long a, long long b, long long &x, long long &y) { n if (!b) { n return x = 1, y = 0, a; n } n long long t = exgcd(b, a % b, y, x); n return y -= a / b * x, t; n } n int main() { n scanf( %lld%lld%lld%lld%lld%lld , &a, &c, &b, &d, &L, &R); n gcd = exgcd(a, b, k, l), lcm = a * b / gcd; n if ((d - c) % gcd) return puts( 0 ), 0; n k *= (d - c) / gcd, kk = lcm / a; n l *= (c - d) / gcd, ll = lcm / b; n l1 = max(0ll, (L - c) / a + (L - c > 0 ? (!!((L - c) % a)) : 0)); n r1 = (R - c) / a - (R - c < 0 ? (!!((R - c) % a)) : 0); n l2 = max(0ll, (L - d) / b + (L - d > 0 ? (!!((L - d) % b)) : 0)); n r2 = (R - d) / b - (R - d < 0 ? (!!((R - d) % b)) : 0); n x = max((l1 - k) / kk, (l2 - l) / ll); n k += x * kk, l += x * ll; n if (k < l1 || l < l2) k += kk, l += ll; n if (k > r1 || l > r2) return puts( 0 ), 0; n printf( %lld n , min((r1 - k) / kk, (r2 - l) / ll) + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long t = 1; n template n void print_arr(myType &arr, long long L, string sep) { n for (long long(i) = (0); (i) < (L); ++(i)) { n cout << arr[i]; n if (i < L - 1) { n cout << sep; n } n } n cout << n ; n return; n } n long long merge(long long arr[], long long temp_arr[], long long left, n long long mid, long long right) { n long long i, j, k; n i = left; n j = mid + 1; n k = left; n long long inv_count = 0; n while (i <= mid && j <= right) { n if (arr[i] <= arr[j]) { n temp_arr[k] = arr[i]; n k += 1; n i += 1; n } else { n temp_arr[k] = arr[j]; n inv_count += (mid - i + 1); n k += 1; n j += 1; n } n } n while (i <= mid) { n temp_arr[k] = arr[i]; n k += 1; n i += 1; n } n while (j <= right) { n temp_arr[k] = arr[j]; n k += 1; n j += 1; n } n for (long long loop_var = left; loop_var <= right; loop_var++) { n arr[loop_var] = temp_arr[loop_var]; n } n return inv_count; n } n long long _mergeSort(long long arr[], long long temp_arr[], long long left, n long long right) { n long long inv_count = 0; n if (left < right) { n long long mid; n mid = (left + right) / 2; n inv_count += _mergeSort(arr, temp_arr, left, mid); n inv_count += _mergeSort(arr, temp_arr, mid + 1, right); n inv_count += merge(arr, temp_arr, left, mid, right); n } n return inv_count; n } n long long mergeSort(long long arr[], long long n) { n long long temp_arr[n]; n for (long long(i) = (0); (i) < (n); ++(i)) temp_arr[i] = 0; n return _mergeSort(arr, temp_arr, 0, n - 1); n } n void solve() { n long long n; n cin >> n; n long long a[n]; n for (long long(i) = (0); (i) < (n); ++(i)) cin >> a[i]; n long long invs, invs2; n long long b[n]; n for (long long(i) = (0); (i) < (n); ++(i)) b[i] = a[i]; n invs = mergeSort(b, n); n long long ans = 0; n long long p; n for (long long(i) = (0); (i) < (30); ++(i)) { n p = (1 << i); n for (long long(j) = (0); (j) < (n); ++(j)) b[j] = a[j] ^ p; n invs2 = mergeSort(b, n); n if (invs2 < invs) { n ans += p; n } n } n for (long long(j) = (0); (j) < (n); ++(j)) b[j] = a[j] ^ ans; n cout << mergeSort(b, n) << << ans << n ; n return; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n cin >> n >> k; n string s; n cin >> s; n bool arr[26] = {false}; n for (int i = 0; i < k; i++) { n char c; n cin >> c; n arr[c - a ] = true; n } n long long ans = 0; n long long co = 0; n for (int i = 0; i < n; i++) { n int x; n x = s[i] - a ; n if (arr[s[i] - a ] == true) n co++; n else { n ans += (co * (co + 1)) / 2; n co = 0; n } n } n ans += (co * (co + 1)) / 2; n cout << ans; n } n "} +{"func_code_string": "#include n inline int gi() { n int x = 0, f = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); n return x * f; n } n std::set > M; n struct yyb { n int x, y, i; n long double k, b; n } s[300010], stk[300010]; n inline bool cmp_k(const yyb& a, const yyb& b) { n if (a.y != b.y) n return a.y < b.y; n else n return a.x > b.x; n } n inline bool cmp_i(const yyb& a, const yyb& b) { return a.i < b.i; } n int main() { n int n = gi(); n for (int i = 1; i <= n; ++i) n s[i].x = gi(), s[i].y = gi(), s[i].i = i, s[i].k = 1000000000.0 / s[i].y, n s[i].b = 1000000000.0 / s[i].x; n std::sort(s + 1, s + n + 1, cmp_k); n int top = 0; n stk[++top] = (yyb){0, 0, 0, 1e18, 0}; n for (int i = 1; i <= n; ++i) { n if (s[i].y == s[i - 1].y) continue; n while (top > 1 && stk[top].y != stk[top - 1].y && n (-(s[i].b - stk[top].b) / (s[i].k - stk[top].k) + 1e-15 < n -(stk[top].b - stk[top - 1].b) / (stk[top].k - stk[top - 1].k))) { n --top; n } n stk[++top] = s[i]; n } n std::sort(s + 1, s + n + 1, cmp_i); n for (int i = 1; i <= top; ++i) M.insert(std::make_pair(stk[i].x, stk[i].y)); n for (int i = 1; i <= n; ++i) n if (M.find(std::make_pair(s[i].x, s[i].y)) != M.end()) printf( %d , i); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 2e6 + 1; n const int INF = 2e9 + 1; n const int MOD = (1e9 + 7); n void bye(string s = ) { n cout << s << n ; n exit(0); n } n signed main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int t = 1; n cin >> t; n while (t--) { n int n; n cin >> n; n vector arr(2); n for (int i = 0; i < n; i++) { n int a; n cin >> a; n arr[a % 2]++; n } n if (arr[1] % 2 || (arr[1] && arr[0])) { n cout << YES n ; n } else { n cout << NO n ; n } n } n bye(); n } n "} +{"func_code_string": "#include n using namespace std; n const bool debug = false; n const int maxn = 1002003; n const long long magic = 1000 * 1000 * 1000 + 7; n int n, k; n long long aa[maxn]; n struct RMQ { n int l, r; n RMQ *left, *right; n long long res; n int resIndex; n }; n RMQ* build(long long* vs, int l, int r) { n RMQ* res = new RMQ(); n res->l = l; n res->r = r; n if (r - l >= 2) { n int m = (l + r) / 2; n res->left = build(vs, l, m); n res->right = build(vs, m, r); n if (res->left->res >= res->right->res) { n res->res = res->left->res; n res->resIndex = res->left->resIndex; n } else { n res->res = res->right->res; n res->resIndex = res->right->resIndex; n } n } else { n res->left = nullptr; n res->right = nullptr; n res->res = vs[l]; n res->resIndex = l; n } n return res; n } n pair rmqGet(RMQ* q, int l, int r) { n if (q->r <= l || r <= q->l) return make_pair(-100, -1); n if (l <= q->l && q->r <= r) return make_pair(q->res, q->resIndex); n auto [res1, res1index] = rmqGet(q->left, l, r); n auto [res2, res2index] = rmqGet(q->right, l, r); n if (res1 >= res2) n return make_pair(res1, res1index); n else n return make_pair(res2, res2index); n } n int ls[maxn]; n int rs[maxn]; n RMQ* rmq; n void findLR(int l, int r) { n if (debug) cout << findLR: << l << << r << endl; n if (r - l < 2) return; n auto [res, resIndex] = rmqGet(rmq, l + 1, r); n if (debug) n cout << rmqGet: << (l + 1) << << r << << res << << resIndex n << endl; n ls[resIndex] = l; n rs[resIndex] = r; n findLR(l, resIndex); n findLR(resIndex, r); n } n long long countLen(int len) { n if (len < k) return 0; n int rest = len - k; n long long count = rest / (k - 1); n long long res = n (len + 1) * (count + 1) - (count + 1) * (k + k + count * (k - 1)) / 2; n return res; n } n long long countIndex(int i) { n int len = rs[i] - (ls[i] + 1); n long long res = n countLen(len) - countLen(i - (ls[i] + 1)) - countLen(rs[i] - (i + 1)); n if (debug) cout << countIndex: << i << << res << endl; n return res; n } n int main() { n ios::sync_with_stdio(false); n cin >> n >> k; n for (int i = 1; i <= n; i++) cin >> aa[i]; n aa[0] = aa[n + 1] = 1200ll * 1000 * 1000; n rmq = build(aa, 0, n + 2); n findLR(0, n + 1); n if (debug) n for (int i = 1; i <= n; i++) cout << ls[i] << << rs[i] << endl; n long long res = 0; n for (int i = 1; i <= n; i++) { n long long c = countIndex(i) % magic; n res = (res + aa[i] * c) % magic; n } n cout << res << endl; n if (debug) n for (int i = 0; i <= 20; i++) n cout << len: << i << : << countLen(i) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string ans = 1001010111001010 ; n int n; n int main() { n cin >> n; n cout << ans[n - 1]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e5 + 5; n int n, k, size[maxn]; n bool f[maxn]; n long long dp[maxn]; n vector g[maxn]; n void dfs(int u, int fa) { n if (f[u]) n size[u] = 1; n else n size[u] = 0; n for (int i = 0; i < g[u].size(); i++) { n int v = g[u][i]; n if (v == fa) continue; n dfs(v, u); n size[u] += size[v]; n dp[u] += dp[v] + size[v]; n } n } n long long ans = 0; n int solve(int u, int fa) { n int sum = (f[u] ? 1 : 0); n for (int i = 0; i < g[u].size(); i++) { n int v = g[u][i]; n if (v == fa) continue; n sum += solve(v, u); n } n ans += min(sum, 2 * k - size[u]); n return min(sum, 2 * k - size[u]); n } n int main() { n scanf( %d%d , &n, &k); n int x; n for (int i = 1; i <= 2 * k; i++) scanf( %d , &x), f[x] = 1; n int u, v; n for (int i = 1; i <= n - 1; i++) n scanf( %d%d , &u, &v), g[u].push_back(v), g[v].push_back(u); n dfs(1, -1); n solve(1, -1); n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n vector c(n); n bool d[2]; n for (int i = 0; i < n; i++) { n cin >> c[i]; n d[c[i] % 2] = 1; n } n if (d[0] && d[1]) { n sort(c.begin(), c.end()); n } n for (int i : c) { n cout << i << ; n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n const int MAX = 5e5 + 5; n const long long MAX2 = 11; n const long long MOD = 1000000007; n const long long MOD2 = 1000000006; n const long long INF = 2e18; n const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; n const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0}; n const double pi = acos(-1); n const double EPS = 1e-9; n const int block = 2000; n int n, id, a, b; n vector v[MAX], ans[MAX]; n void dfs(int nw, int par) { n for (auto i : v[nw]) { n if (i == par) continue; n ans[i].push_back(++id); n } n ans[nw].push_back(++id); n reverse(v[nw].begin(), v[nw].end()); n for (auto i : v[nw]) { n if (i == par) continue; n dfs(i, nw); n } n return; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 2; i <= n; ++i) n cin >> a >> b, v[a].push_back(b), v[b].push_back(a); n ans[1].push_back(++id); n dfs(1, 0); n for (int i = 1; i <= n; ++i) cout << ans[i][0] << << ans[i][1] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1000000007; n const vector mods = {998244353, 1000000007, 1000000009}; n const long long inf = 3e18; n const double pi = acos(-1.0); n const double eps = 0.0000001; n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n template n using umap = unordered_map; n template n using uset = unordered_set; n double dp[200]; n long long lad[200]; n int main() { n cin.sync_with_stdio(0); n cin.tie(0); n cout.precision(13); n fill(&dp[0], &dp[0] + sizeof(dp) / sizeof(dp[0]), 0); n for (long long i = (0); i < (10); ++i) n for (long long j = (0); j < (10); ++j) { n long long fw = i & 1; n long long up; n cin >> up; n if (!up) continue; n long long node = 10 * (9 - i) + (fw ? j : 9 - j); n long long nxfw = (i + up) & 1; n long long nx = 10 * (9 - i + up) + (nxfw ? j : 9 - j); n lad[node] = nx; n } n dp[99] = 0.0; n for (long long i = 98; i >= 0; i--) { n double mv = 0; n double ex = 0; n for (long long j = (1); j < (7); ++j) { n double nx = dp[i + j]; n if (lad[i + j]) { n nx = min(nx, dp[lad[i + j]]); n } n mv += 1.0 / 6 * nx; n if (i + j > 99) ex++; n } n mv++; n mv /= (1 - ex / 6.0); n dp[i] = mv; n } n cout << dp[0] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int ans = 0; n for (int i = 0; i < n; i++) { n int val; n cin >> val; n if (val >= 0) n ans += val; n else n ans -= val; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n using namespace std; n #define ll long long int n const int MOD = 1e9 + 7; n ll facto[200010]; n void fact() n { n facto[0] = 1; n for (ll i = 1; i < 200010; i++) n { n facto[i] = (i * facto[i - 1]) % MOD; n } n } n bool is(ll cnt[]) n { n for (int i = 0; i < 26; i++) n { n if (cnt[i] >= 2) n return false; n } n return true; n } n int main() n { n // fact(); n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ll n; n cin >> n; n ll a[n]; n ll sum = 0; n for (ll i = 0; i < n; i++) n { n cin >> a[i]; n sum += a[i]; n } n if ((sum % 2) != 0) n { n cout << 0 n ; n return 0; n } n bool dp[n + 1][sum / 2 + 1]; n for (ll i = 0; i <= n; i++) n { n for (ll j = 0; j <= sum / 2; j++) n { n dp[i][j] = false; n } n } n for (ll i = 0; i <= n; i++) n { n dp[i][0] = true; n } n for (ll j = 0; j <= sum / 2; j++) n { n dp[0][j] = false; n } n for (ll i = 1; i <= n; i++) n { n for (ll j = 1; j <= sum / 2; j++) n { n dp[i][j] = dp[i - 1][j]; n if (j - a[i - 1] >= 0) n { n dp[i][j] = dp[i][j] || dp[i - 1][j - a[i - 1]]; n } n } n } n if (dp[n][sum / 2] == false) n { n cout << 0 n ; n return 0; n } n ll mini = LLONG_MAX; n ll pos = -1; n for (ll i = 0; i < n; i++) n { n if (a[i] % 2) n { n cout << 1 n ; n cout << i + 1 << n ; n return 0; n } n } n for (ll i = 0; i < n; i++) n { n ll steps = 0; n while (a[i] % 2 == 0) n { n a[i] /= 2; n steps++; n } n if (mini > steps) n { n mini = steps; n pos = i; n } n } n cout << 1 n ; n cout << pos + 1 << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 2000; n int n, t; n double p, dp[MAXN + 1][MAXN + 1], ans = 0; n int main() { n cin >> n >> p >> t; n dp[0][0] = 1; n for (int i = 0; i < t; i++) n for (int j = 0; j <= n; j++) { n if (j < n) { n dp[i + 1][j + 1] += dp[i][j] * p; n dp[i + 1][j] += dp[i][j] * (1 - p); n } else n dp[i + 1][j] += dp[i][j]; n } n for (int i = 1; i <= n; i++) ans += dp[t][i] * i; n cout << fixed; n cout << setprecision(9) << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long q_pow(long long n, long long temp) { n long long ans = 1; n long long x = temp; n while (n) { n if (n & 1) { n ans *= x; n ans %= 1000000007; n } n x *= x; n x %= 1000000007; n n /= 2; n } n return ans; n } n int main() { n string str; n long long k; n while (cin >> str >> k) { n int len = str.size(); n long long sum = 0; n for (int i = 0; i < len; i++) { n if (str[i] == 0 || str[i] == 5 ) { n long long a1 = q_pow(i, 2); n sum += a1; n sum %= 1000000007; n } n } n long long a = (q_pow(len * k, 2) - 1 + 1000000007) % 1000000007; n long long b = (q_pow(len, 2) - 1 + 1000000007) % 1000000007; n long long c = (a * q_pow(1000000007 - 2, b)) % 1000000007; n printf( %I64d n , (sum * c) % 1000000007); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct info { n int id, d; n bool operator<(const info &rhs) const { return d < rhs.d; } n } a[200007]; n vector > res; n priority_queue q; n stack st; n int main() { n int n, m; n int k = 0; n int M = 0; n scanf( %d%d , &n, &m); n for (int i = 1, v; i <= n; i++) { n scanf( %d , &v); n if (v == 0) continue; n M = max(M, v); n a[i] = {i, v}; n q.push(a[i]); n k++; n } n if (M >= k) { n puts( No ); n return 0; n } n while (!q.empty()) { n info x = q.top(); n q.pop(); n if (x.d != a[x.id].d) continue; n while (x.d--) { n info g; n if (q.empty()) { n puts( No ); n return 0; n } n while (!q.empty()) { n g = q.top(); n q.pop(); n if (g.d == a[g.id].d) break; n } n g.d--; n a[g.id].d--; n res.push_back({g.id, x.id}); n if (g.d != 0) st.push(g); n } n a[x.id].d = 0; n while (!st.empty()) { n q.push(st.top()); n st.pop(); n } n } n puts( Yes ); n if (res.size() != 0) printf( %d n , (int)res.size()); n for (auto e : res) printf( %d %d n , e.first, e.second); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n double dist(double x1, double y1, double x2, double y2) { n return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); n } n int main() { n double r, x1, y1, x2, y2; n cin >> r >> x1 >> y1 >> x2 >> y2; n if (dist(x1, y1, x2, y2) >= r) { n printf( %.12f %.12f %.12f n , x1, y1, r); n } else if (x1 == x2 && y1 == y2) { n double r1 = r / 2.0; n double x3 = x1 - r1; n double y3 = y1; n printf( %.12f %.12f %.12f n , x3, y3, r1); n } else { n double r1 = (dist(x1, y1, x2, y2) + r) / 2.0; n double d1 = dist(x1, y1, x2, y2); n double d2 = r1 - d1; n double alpha1 = d1 / (d1 + d2); n double alpha2 = d2 / (d1 + d2); n double x3 = (x1 - alpha2 * x2) / alpha1; n double y3 = (y1 - alpha2 * y2) / alpha1; n printf( %.12f %.12f %.12f n , x3, y3, r1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin >> n; n int m = 0; n while (n > 9) { n n -= 9; n m += 9 + n % 10; n n /= 10; n } n cout << m + n << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n int t, n, i; n cin >> n; n int a[n]; n for (i = 0; i < n; i++) cin >> a[i]; n long long int ans = 0; n long long int pre[n + 1]; n memset(pre, 0, sizeof(pre)); n for (i = 1; i < n + 1; i++) pre[i] = pre[i - 1] + a[i - 1]; n set s; n int start = -1; n for (i = 0; i < n; i++) { n if (start < i) { n start = i; n s.insert(pre[i]); n } n while (start < n && !s.count(pre[start + 1])) { n start++; n s.insert(pre[start]); n } n s.erase(pre[i]); n ans += start - i; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int dx[] = {0, -1, 0, 1}; n int dy[] = {-1, 0, 1, 0}; n char a[505][505]; n int main() { n cin >> n >> m; n for (int i = 1; i <= n; i++) cin >> a[i] + 1; n bool flag = 1; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) { n for (int k = 0; k <= 3; k++) { n if (a[i + dx[k]][j + dy[k]] == S && a[i][j] == W ) flag = 0; n if (a[i + dx[k]][j + dy[k]] == W && a[i][j] == S ) flag = 0; n } n if (a[i][j] != W && a[i][j] != S ) a[i][j] = D ; n } n if (flag == 0) { n cout << No << endl; n } else { n cout << Yes << endl; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n cout << a[i][j]; n } n cout << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1000010; n int fa[N], mx[N], n; n vector son[N]; n vector ans; n bool cmp(const int x, const int y) { return mx[x] < mx[y]; } n void dfs(int x) { n int s = son[x].size(); n for (int i = 0; i < s; ++i) { n int& sn = son[x][i]; n dfs(sn); n mx[x] = max(mx[x], mx[sn] + 1); n } n sort(son[x].begin(), son[x].end(), cmp); n } n void DFS(int x) { n printf( %d , x); n for (int i = 0; i < son[x].size(); ++i) { n int& sn = son[x][i]; n DFS(sn); n if (i == 0) continue; n for (int j = 0; j <= mx[son[x][i - 1]]; ++j) ans.push_back(sn); n } n } n int main() { n scanf( %d , &n); n for (int i = 1; i < n; ++i) { n scanf( %d , &fa[i]); n son[fa[i]].push_back(i); n } n dfs(0); n DFS(0); n int s = ans.size(); n printf( n%d n , s); n for (int i = 0; i < s; ++i) printf( %d , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using db = long double; n using str = string; n using pi = pair; n template n using V = vector; n template n using AR = array; n using vi = V; n using vb = V; n using vpi = V; n const int MOD = 1e9 + 7; n const db PI = acos((db)-1); n mt19937 rng(0); n template n bool ckmin(T& a, const T& b) { n return b < a ? a = b, 1 : 0; n } n template n bool ckmax(T& a, const T& b) { n return a < b ? a = b, 1 : 0; n } n template n T fstTrue(T lo, T hi, U first) { n ++hi; n assert(lo <= hi); n while (lo < hi) { n T mid = lo + (hi - lo) / 2; n first(mid) ? hi = mid : lo = mid + 1; n } n return lo; n } n using T = db; n const T EPS = 1e-9; n using P = pair; n using vP = V

; n using Line = pair; n int sgn(T a) { return (a > EPS) - (a < -EPS); } n T sq(T a) { return a * a; } n T norm(P p) { return sq(p.first) + sq(p.second); } n T abs(P p) { return sqrt(norm(p)); } n T arg(P p) { return atan2(p.second, p.first); } n P conj(P p) { return P(p.first, -p.second); } n P perp(P p) { return P(-p.second, p.first); } n P dir(T ang) { return P(cos(ang), sin(ang)); } n const int mx = 100005; n struct Eff { n int n, k; n P hab[mx]; n bool works(db r) { n V> ch; n for (int i = 1; i <= n; i++) { n if (abs(hab[i]) <= 2.0 * r - EPS) { n db theta_diff = PI / 2.0 - asin(abs(hab[i]) / 2.0 / r); n db theta = arg(hab[i]); n assert(theta_diff <= PI / 2.0); n ch.push_back(make_pair(theta - theta_diff, +1)); n ch.push_back(make_pair(theta + theta_diff, -1)); n ch.push_back(make_pair(theta - theta_diff + 2 * PI, +1)); n ch.push_back(make_pair(theta + theta_diff + 2 * PI, -1)); n } n } n sort(begin(ch), end(ch)); n int running_sum = 0; n for (auto u : ch) { n running_sum += u.second; n if (0 <= u.first && u.first <= 2 * PI) { n if (running_sum >= k) return true; n } n } n return false; n } n void solve() { n cin >> n >> k; n for (int i = 1; i <= n; i++) { n cin >> hab[i].first >> hab[i].second; n } n db lo = EPS; n db hi = 200005.0; n for (int i = 0; i < 50; i++) { n db mid = (lo + hi) / 2; n if (works(mid)) { n hi = mid; n } else { n lo = mid; n } n } n cout << lo << n ; n } n }; n int main() { n cin.tie(0)->sync_with_stdio(0); n cout << fixed << setprecision(10); n Eff e; n e.solve(); n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream &operator<<(ostream &os, vector V) { n os << [ ; n for (auto v : V) os << v << ; n os << ] ; n return os; n } n template n ostream &operator<<(ostream &os, set S) { n os << { ; n for (auto s : S) os << s << ; n return os << } ; n } n template n ostream &operator<<(ostream &os, pair P) { n return os << ( << P.first << , << P.second << ) ; n } n template n ostream &operator<<(ostream &os, map M) { n os << { ; n for (auto m : M) os << ( << m.first << : << m.second << ) ; n return os << } ; n } n long long n, a[200005], c[200005], cc[200005]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long t; n cin >> t; n while (t--) { n cin >> n; n for (long long i = 1; i < n + 1; i++) cin >> a[i]; n for (long long i = 1; i < n + 1; i++) { n long long k = 1; n if (c[i - 1] == 1) k = 2; n long long j = i; n while (j <= n && a[j] == a[i]) c[j] = k, j++; n i = j - 1; n } n if (c[1] == c[n] && a[1] != a[n]) { n bool ok = false; n for (long long i = 1; i < n; i++) { n if (c[i] == c[i + 1]) { n for (long long j = i + 1; j < n + 1; j++) { n if (c[j] == 1) n c[j] = 2; n else n c[j] = 1; n } n ok = true; n break; n } n } n if (!ok) c[n] = 3; n } n long long mx = 0; n for (long long i = 1; i < n + 1; i++) mx = max(mx, c[i]); n cout << mx << n ; n for (long long i = 1; i < n + 1; i++) cout << c[i] << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int h1, h2, n; n int v[111]; n char c[111]; n int a[111]; n int b[111]; n const double eps = 1e-9; n int main() { n cin >> h1 >> h2 >> n; n for (int i = (0); i < (n); i++) cin >> v[i] >> c[i] >> a[i] >> b[i]; n int best = 0; n for (int i = -200; i <= 200; i++) { n bool good = 1; n int sum = 0; n set used; n int x1 = 0; n int y1 = h1; n int x2 = 100000; n int y2 = h2 + i * 100; n if (i % 2) y2 = 100 - h2 + i * 100; n if (i > 0) { n for (int j = (0); j < (i); j++) { n int y = 100 + 100 * j; n double x = double(x2 - x1) / (y2 - y1) * (y - y1); n bool found = 0; n for (int k = (0); k < (n); k++) n if (a[k] <= x + eps && b[k] >= x - eps) { n if (j % 2 == 0 && c[k] == T || j % 2 == 1 && c[k] == F ) { n if (used.count(k)) good = 0; n used.insert(k); n sum += v[k]; n found = 1; n break; n } n } n if (!found) good = 0; n } n } else if (i < 0) { n for (int j = (0); j < (-i); j++) { n int y = -100 * j; n double x = double(x2 - x1) / double(y2 - y1) * (y - y1); n bool found = 0; n for (int k = (0); k < (n); k++) n if (a[k] <= x + eps && b[k] >= x - eps) { n if (j % 2 == 0 && c[k] == F || j % 2 == 1 && c[k] == T ) { n if (used.count(k)) good = 0; n used.insert(k); n sum += v[k]; n found = 1; n break; n } n } n if (!found) good = 0; n } n } n if (good) best = max(best, sum); n } n cout << best << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int t; n cin >> t; n while (t--) { n long long int n, i, j, b, c, a; n cin >> a >> b >> c; n long long int y = a + b + c; n y--; n cout << y << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, s, a[5][205]; n struct node { n int id, x, y; n }; n vector ans; n inline void park() { n for (int i = 0; i <= 2 * n - 1; ++i) n if (a[1][i] && a[1][i] == a[0][i]) { n ans.push_back(node{a[1][i], i / n ? 4 : 1, i % n + 1}); n a[1][i] = 0; n k--; n } n } n inline bool judge() { n park(); n for (int i = 0; i <= 2 * n - 1; ++i) n if (!a[1][i]) return 1; n return 0; n } n inline void turn() { n vector t1, t2; n int t = a[1][2 * n - 1]; n for (int i = 2 * n - 1; i >= 1; --i) { n a[1][i] = a[1][i - 1]; n if (a[1][i]) { n if (i > s) n t1.push_back(node{a[1][i], i / n ? 3 : 2, i % n + 1}); n else n t2.push_back(node{a[1][i], i / n ? 3 : 2, i % n + 1}); n } n } n a[1][0] = t; n if (t) t2.push_back(node{t, 2, 1}); n int sz1 = t1.size(), sz2 = t2.size(); n for (int i = 0; i <= sz2 - 1; ++i) ans.push_back(t2[i]); n for (int i = 0; i <= sz1 - 1; ++i) ans.push_back(t1[i]); n } n int main() { n scanf( %d%d , &n, &k); n for (int i = 0; i <= n - 1; ++i) scanf( %d , &a[0][i]); n for (int i = 0; i <= n - 1; ++i) scanf( %d , &a[1][i]); n for (int i = 2 * n - 1; i >= n; --i) scanf( %d , &a[1][i]); n for (int i = 2 * n - 1; i >= n; --i) scanf( %d , &a[0][i]); n if (!judge()) return puts( -1 ), 0; n for (int i = 0; i <= 2 * n - 1; ++i) n if (!a[1][i]) { n s = i; n break; n } n while (k) { n turn(); n park(); n s = (s + 1) % (2 * n); n } n int sz = ans.size(); n printf( %d n , sz); n for (int i = 0; i < sz; ++i) { n if (ans[i].x == 3 || ans[i].x == 4) ans[i].y = n - ans[i].y + 1; n printf( %d %d %d n , ans[i].id, ans[i].x, ans[i].y); n } n return 0; n } n "} +{"func_code_string": "#include n #define int long long n using namespace std; n signed main(){ n int t; n cin >> t; n while(t--){ n int k, n, m; n cin >> k >> n >> m; n int a[n + 1], b[m + 1]; n for(int i = 0;i < n;i++){ n cin >> a[i]; n } n for(int i = 0;i < m;i++){ n cin >> b[i]; n } n a[n] = 0x3f3f3f3f, b[m] = 0x3f3f3f3f; n vector ans; //答案序列 n int l = k, ai = 0, bi = 0; //ai，bi分别表示两个数组分别删到了哪里，l为行数 n bool flag = false; n while(ans.size() < n + m){ n if(a[ai] == 0){ n ai++, ans.push_back(0); n l++; n continue; n } n else if(b[bi] == 0){ n bi++, ans.push_back(0); n l++; n continue; n } n int p = min(a[ai], b[bi]); n if(p == a[ai]){ n ai++; n } n else{ n bi++; n } n if(p > l){ n flag = true; n break; n } n ans.push_back(p); n } n if(flag){ n cout << -1 << endl; n } n else{ n for(int i = 0;i < ans.size();i++){ n cout << ans[i] << ; //输出答案序列 n } n cout << endl; n } n } n return 0; n }"} +{"func_code_string": "#include n const int M = 2000; n int T, n, x, ans, f0[M + 10], f1[M + 10]; n inline int min(int x, int y) { return x < y ? x : y; } n inline int max(int x, int y) { return x > y ? x : y; } n void work() { n for (int i = 0; i <= M; ++i) f0[i] = i; n scanf( %d , &n), ans = 114514; n while (n--) { n scanf( %d , &x), memset(f1, 0x3f, sizeof f1); n for (int i = 0; i <= M; ++i) n i - x >= 0 && (f1[i] = min(f1[i], max(f0[i - x], i))), n i + x <= M && (f1[i] = min(f1[i], f0[i + x])); n memcpy(f0, f1, sizeof f0); n } n for (int i = 0; i <= M; ++i) ans = min(ans, f0[i]); n printf( %d n , ans); n } n int main() { n scanf( %d , &T); n while (T--) work(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int L = 332748118, M = 998244353, N = 1e6 + 5; n int l[N]; n int ksm(int a, long long b) { n int an = 1; n while (b) { n if (b & 1) an = 1ll * an * a % M; n a = 1ll * a * a % M; n b >>= 1; n } n return an; n } n int main() { n int n, c = 1, a = 0, b = 0, f = 1, s, d = 1, e, g, h; n scanf( %d , &n); n e = s = ksm(L, n); n h = g = ksm(3, 1ll * n * n); n l[1] = 1; n for (int i = 1; i <= n; i++) { n if (i != 1) l[i] = (M - 1ll * M / i * l[M % i]) % M; n c = 1ll * (n - i + 1) * l[i] % M * c % M; n d = 1ll * d * s % M; n e = 3ll * e % M; n h = 3ll * h * s % M; n a = (a + 1ll * f * c % M * h % M) % M; n b = (b + 1ll * f * c * d % M * (ksm(1 - e, n) - 1) % M) % M; n f = -f; n } n printf( %lld , (((a << 1) + 3ll * g * b) % M + M) % M); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k, d; n cin >> n >> k >> d; n vector U(k, 0); n for (int i = 0; i < k; i++) U[i] = i + 1; n vector V(d - 1, 0); n for (int i = 0; i < d - 1; i++) V[i] = i + 1; n vector dp2(n + 1, 0); n vector dp1(n + 1, 0); n dp2[0] = 1; n dp1[0] = 1; n for (int i = 0; i < n; i++) { n for (int j = 0; j < U.size(); j++) { n if (i + U[j] <= n) n dp2[i + U[j]] = (dp2[i + U[j]] % (long long)1000000007 + n dp2[i] % (long long)1000000007) % n (long long)1000000007; n } n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < V.size(); j++) { n if (i + V[j] <= n) n dp1[i + V[j]] = (dp1[i + V[j]] % (long long)1000000007 + n dp1[i] % (long long)1000000007) % n (long long)1000000007; n } n } n cout << (dp2[n] - dp1[n] + (long long)1000000007) % (long long)1000000007 n << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct triple { n int x, y, z; n }; n int n, x1, y11, x2, y22; n string s[9]; n int main() { n cin >> n; n while (n--) { n for (__typeof(8) i = 1; i <= 8; i++) cin >> s[i], s[i] = # + s[i]; n bool tmp = false; n for (__typeof(8) i = 1; i <= 8; i++) { n for (__typeof(8) j = 1; j <= 8; j++) n if (s[i][j] == K ) { n if (tmp == false) { n tmp = true; n x1 = i; n y11 = j; n } else { n x2 = i; n y22 = j; n } n } n } n tmp = false; n for (__typeof(8) i = 1; i <= 8; i++) n for (__typeof(8) j = 1; j <= 8; j++) n if (tmp == false && s[i][j] != # ) { n int tx1 = abs(i - x1), ty1 = abs(j - y11), tx2 = abs(i - x2), n ty2 = abs(j - y22); n if (tx1 % 2 == 0 && ty1 % 2 == 0 && tx2 % 2 == 0 && ty2 % 2 == 0 && n (tx1 / 2 + ty1 / 2) % 2 == 0 && (tx2 / 2 + ty2 / 2) % 2 == 0 && n (max(tx1 / 2, ty1 / 2) + max(tx2 / 2, ty2 / 2)) % 2 == 0) { n cout << YES n ; n tmp = true; n } n } n if (tmp == false) cout << NO n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, b; n int t[200005], d[200005]; n queue > > Q; n long long ans[200005]; n int main() { n int i, j; n scanf( %d , &n); n scanf( %d , &b); n for (i = 1; i <= n; i++) { n scanf( %d , &t[i]); n scanf( %d , &d[i]); n } n memset(ans, -1, sizeof(ans)); n long long curr = 0; n i = 1; n while (1) { n if (i <= n && Q.size() == 0) { n Q.push({i, {t[i], d[i]}}); n i++; n } n if (Q.size() == 0) break; n pair > now = Q.front(); n Q.pop(); n curr = max(curr, (long long)now.second.first); n long long en = curr + now.second.second; n ans[now.first] = en; n while (i <= n && Q.size() < b) { n Q.push({i, {t[i], d[i]}}); n i++; n } n while (i <= n && t[i] < en) { n i++; n } n curr = en; n } n for (i = 1; i <= n; i++) printf( %lld , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n constexpr int SIZE = (int)1e6; n int n, k, from, to; n vector g[SIZE], h[SIZE]; n vector ord; n vector check; n string ans; n int component[SIZE]; n int comp; n void dfs1(int v) { n check[v] = true; n for (int i : g[v]) { n if (!check[i]) { n dfs1(i); n } n } n ord.push_back(v); n } n void dfs2(int v) { n check[v] = true; n component[v] = comp; n for (int i : h[v]) { n if (!check[i]) { n dfs2(i); n } n } n } n int main() { n cin >> n >> k; n for (int j = 0; j < 2; j++) { n cin >> from; n from--; n for (int i = 1; i < n; i++) { n cin >> to; n to--; n g[from].push_back(to); n h[to].push_back(from); n from = to; n } n } n check.resize(n, false); n for (int i = 0; i < n; i++) { n if (!check[i]) { n dfs1(i); n } n } n for (int i = 0; i < n; i++) { n check[i] = false; n } n for (int i = ord.size() - 1; i >= 0; i--) { n if (!check[ord[i]]) { n dfs2(ord[i]); n comp++; n } n } n if (comp < k) { n cout << NO ; n return 0; n } n ans.resize(n); n cout << YES << endl; n for (int i = 0; i < ans.size(); i++) { n if (k - 1 < component[i]) { n ans[i] = char( a + k - 1); n } else { n ans[i] = char( a + component[i]); n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long p, k, ans, cnt, num[1000005], check[1000005], a, now, fac[100005]; n int main() { n fac[0] = fac[1] = 1; n ans = 1; n scanf( %lld%lld , &p, &k); n if (k == 0) { n for (int i = 1; i < p; i++) { n ans *= p; n ans %= 1000000007; n } n printf( %lld , ans); n return 0; n } n if (k == 1) { n for (int i = 0; i < p; i++) { n ans *= p; n ans %= 1000000007; n } n printf( %lld , ans); n return 0; n } n check[0] = 1; n for (int i = 1; i < p; i++) { n a = (k * i) % p; n num[i] = a; n } n for (int i = 1; i < p; i++) { n if (!check[i]) { n now = i; n while (!check[now]) { n check[now] = 1; n now = num[now]; n cnt++; n } n } n if (cnt > 1) ans *= p; n cnt = 0; n ans %= 1000000007; n } n printf( %lld , ans); n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 10; n int main() { n int t; n cin >> t; n while (t--) { n long long n; n cin >> n; n long long tmp = sqrt(n); n vector ans; n ans.push_back(0); n for (long long i = 1; i <= tmp; i++) { n ans.push_back(i); n if (n / i != i) { n ans.push_back(n / i); n } n } n sort(ans.begin(), ans.end()); n cout << ans.size() << endl; n for (long long v : ans) cout << v << ; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int is_prime(long long int n) { n for (long long int i = 2; i * i <= n; i++) { n if (n % i == 0) return 0; n } n return 1; n } n int main() { n int t; n cin >> t; n for (int i = 0; i < t; i++) { n int a, b, c, d, k; n cin >> a >> b >> c >> d >> k; n a = (a + c - 1) / c; n b = (b + d - 1) / d; n if (a + b <= k) n cout << a << << b << endl; n else n cout << -1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n #include n using namespace std; n n long long l,r,d; n n int main() n { n int t; n cin >> t; n while(t--) n { n scanf( %lld %lld %lld ,&l,&r,&d); n if(min(l,r) * d >= max(l,r) - min(l,r)) cout << YES << endl; n else cout << NO << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char st[100000 + 123]; n bool inm[256]; n int main() { n scanf( %s , st); n memset(inm, 0, sizeof(inm)); n inm[ A ] = true; n inm[ H ] = true; n inm[ I ] = true; n inm[ M ] = true; n inm[ O ] = true; n inm[ T ] = true; n inm[ U ] = true; n inm[ V ] = true; n inm[ W ] = true; n inm[ X ] = true; n inm[ Y ] = true; n int r = strlen(st) - 1; n int l = 0; n bool flag = true; n while (l <= r) { n if (st[l] != st[r] || !inm[st[l]]) { n flag = false; n break; n } n l++; n r--; n } n if (flag) n puts( YES ); n else n puts( NO ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma GCC optimize( Ofast ) n #pragma GCC target( avx,avx2,fma ) n long long niz[300005]; n long long ima[605][605]; n long long res[300005]; n long long dp[300005]; n struct strukt { n int a, b, ind; n } query[300005]; n bool cmp(strukt a, strukt b) { return a.b < b.b; } n const int k = 600; n int main() { n ios_base::sync_with_stdio(false); n cout.precision(10); n cout << fixed; n int n; n cin >> n; n for (int i = 1; i <= n; i++) cin >> niz[i]; n int q; n cin >> q; n for (int i = 1; i <= q; i++) { n cin >> query[i].a >> query[i].b; n query[i].ind = i; n } n sort(query + 1, query + 1 + q, cmp); n for (int i = 1; i <= q; i++) { n if (query[i].b > k) { n long long sum = 0; n int a = query[i].a; n int b = query[i].b; n for (int j = a; j <= n; j += b) { n sum += niz[j]; n } n res[query[i].ind] = sum; n } else if (query[i].b == query[i - 1].b) { n res[query[i].ind] = dp[query[i].a]; n } else { n int b = query[i].b; n for (int j = n; j >= 1; j--) { n if (j + b > n) n dp[j] = niz[j]; n else n dp[j] = niz[j] + dp[j + b]; n } n res[query[i].ind] = dp[query[i].a]; n } n } n for (int i = 1; i <= q; i++) cout << res[i] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n int m; n cin >> n >> m; n int l; n int r; n int arr[n]; n int pos = 0; n int neg = 0; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n if (arr[i] == -1) { n neg++; n } else { n pos++; n } n } n int mn = min(neg, pos); n for (int i = 0; i < m; i++) { n cin >> l >> r; n int c = 0; n if (l == r) { n cout << 0 << endl; n c++; n } n if (c == 0) { n if ((abs(l - r) + 1) / 2 <= mn && (abs(l - r) + 1) % 2 == 0) { n cout << 1 << endl; n } else { n cout << 0 << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MX = 1147483646; n const long long MX2 = 9223372036854775800; n const int MOD = 1000000007; n int p[30]; n int find(int n) { n if (p[n] < 0) return n; n return p[n] = find(p[n]); n } n void uni(int e1, int e2) { n e1 = find(e1); n e2 = find(e2); n if (e1 == e2) return; n p[e1] = e2; n return; n } n int main() { n int n; n scanf( %d , &n); n char s1[100011], s2[100011]; n vector > ans; n fill(p, p + 30, -1); n scanf( %s %s , s1, s2); n int a1, a2; n for (int i = 0; i < n; i++) { n a1 = find(int(s1[i] - a )); n a2 = find(int(s2[i] - a )); n if (a1 != a2) { n ans.push_back({a1, a2}); n uni(a1, a2); n } n } n printf( %d n , ans.size()); n for (pair x : ans) { n printf( %c %c n , x.first + a , x.second + a ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int i, j, k, n, m, ans = 0, cnt = 0, sum = 0; n cin >> n; n int a[n]; n for (int i = 0; i < n; i++) cin >> a[i]; n vector res; n res.push_back(a[0]); n int last = a[0], flag = 1; n for (int i = 1; i < n - 1;) { n if (abs(a[i] - last) + abs(a[i] - a[i + 1]) > abs(last - a[i + 1])) { n res.push_back(a[i]); n last = a[i]; n i++; n } else n i++; n } n if (flag) res.push_back(a[n - 1]); n cout << res.size() << n ; n for (auto x : res) cout << x << ; n cout << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool valid(int i, int j, int n, int m) { n return i >= 0 && i < n && j >= 0 && j < m; n } n void solve() { n int n, m; n int dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; n cin >> n >> m; n char a[n][m]; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) cin >> a[i][j]; n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (a[i][j] == B ) { n for (int p = 0; p < 4; p++) { n if (valid(i + dir[p][0], j + dir[p][1], n, m) && n a[i + dir[p][0]][j + dir[p][1]] == . ) n a[i + dir[p][0]][j + dir[p][1]] = # ; n } n } n } n } n bool visited[n][m]; n memset(visited, false, sizeof(visited)); n queue > q; n if (a[n - 1][m - 1] == . ) { n q.push(make_pair(n - 1, m - 1)); n visited[n - 1][m - 1] = true; n } n while (!q.empty()) { n pair temp = q.front(); n q.pop(); n for (int p = 0; p < 4; p++) { n int x = temp.first + dir[p][0]; n int y = temp.second + dir[p][1]; n if (valid(x, y, n, m)) { n if (!visited[x][y] && a[x][y] != # ) { n q.push(make_pair(x, y)); n visited[x][y] = true; n } n } n } n } n bool ans = true; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (a[i][j] == G && visited[i][j] != true) { n ans = false; n break; n } else if (a[i][j] == B && visited[i][j] != false) { n ans = false; n break; n } n } n } n cout << (ans ? Yes : No ); n } n int main() { n int t, c = 0; n cin >> t; n while (t--) { n solve(); n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e3 + 5; n const int md = 1e9 + 7; n string mat[2], pat; n long long n, m, dp[2][maxn][2], pr[2][maxn][2], re, is[2][maxn][maxn], n ris[2][maxn][maxn]; n long long sum(long long a, long long b) { return (a + b) % md; } n long long mul(long long a, long long b) { return (a * b) % md; } n void solve() { n memset(dp, 0, sizeof dp); n memset(is, 0, sizeof is); n memset(ris, 0, sizeof ris); n for (int r = 0; r < 2; ++r) { n for (int j = 0; j < m; ++j) { n is[r][0][j] = mat[r][0] == pat[j]; n } n for (int i = 1; i < n; ++i) { n is[r][i][0] = mat[r][i] == pat[0]; n for (int j = 1; j < m; ++j) { n if (mat[r][i] == pat[j]) is[r][i][j] = is[r][i - 1][j - 1] + 1; n } n } n for (int i = n - 1; i >= 0; i--) { n ris[r][i][0] = mat[r][i] == pat[0]; n for (int j = 1; j < m; ++j) { n if (mat[r][i] == pat[j]) ris[r][i][j] = ris[r][i + 1][j - 1] + 1; n } n } n } n for (int i = 0; i < n; ++i) { n memcpy(pr, dp, sizeof dp); n memset(dp, 0, sizeof dp); n dp[0][0][0] = (mat[0][i] == pat[0]); n dp[1][0][0] = (mat[1][i] == pat[0]); n for (int j = 1; j < m; ++j) { n for (int r = 0; r < 2; ++r) n if (mat[r][i] == pat[j]) { n dp[r][j][0] = pr[r][j - 1][0]; n dp[r][j][0] = sum(dp[r][j][0], pr[r][j - 1][1]); n int x = j + 1; n if (x % 2 == 0 && x / 2 > 1 && i >= x / 2 - 1) { n x /= 2; n dp[r][j][1] = n sum(dp[r][j][1], n (is[r][i][j] >= x) * (ris[r ^ 1][i - x + 1][j - x] >= x)); n } n dp[r][j][1] += dp[r ^ 1][j - 1][0]; n } n } n for (int j = 0; j < m; ++j) { n if (j == m - 1) { n re = sum(re, dp[0][j][0] + dp[0][j][1] + dp[1][j][1] + dp[1][j][0]); n continue; n } n for (int r = 0; r < 2; ++r) { n int x = m - 1 - j; n if (x % 2) continue; n x /= 2; n if (x == 1) continue; n int y = i + x; n if (y >= n) continue; n re = sum(re, dp[r][j][0] * (is[r][y][j + x] >= x) * n (ris[r ^ 1][i + 1][m - 1] >= x)); n re = sum(re, dp[r][j][1] * (is[r][y][j + x] >= x) * n (ris[r ^ 1][i + 1][m - 1] >= x)); n } n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n for (int i = 0; i < 2; ++i) { n cin >> mat[i]; n } n n = mat[0].size(); n cin >> pat; n m = pat.size(); n if (m == 1) { n for (auto u : mat[0]) { n if (u == pat[0]) { n re = re + 1; n } n } n for (auto u : mat[1]) { n if (u == pat[0]) { n re = re + 1; n } n } n cout << re << n ; n return 0; n } n if (m == 2) { n for (int r = 0; r < 2; ++r) { n for (int i = 0; i < n; ++i) { n if (i > 0 && mat[r][i] == pat[1] && mat[r][i - 1] == pat[0]) { n re = re + 1; n } n if (i < n - 1 && mat[r][i] == pat[1] && mat[r][i + 1] == pat[0]) { n re = re + 1; n } n if (mat[r][i] == pat[1] && mat[r ^ 1][i] == pat[0]) { n re = re + 1; n } n } n } n cout << re << n ; n return 0; n } n solve(); n for (int r = 0; r < 2; ++r) { n reverse(mat[r].begin(), mat[r].end()); n } n solve(); n cout << re << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f; n int main() { n int T; n cin >> T; n while (T--) { n int n, k; n cin >> n >> k; n int mn = INF, mx = -1; n for (int i = 1; i <= n; ++i) { n int x; n scanf( %d , &x); n mn = min(mn, x); n mx = max(mx, x); n } n int m = (mx + mn) >> 1; n printf( %d n , max(m - mn, mx - m) <= k ? mn + k : -1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n #ifdef DEBUG n freopen( a.in , r , stdin); n #endif n ios_base::sync_with_stdio(false), cin.tie(0); n int T; n cin >> T; n while (T--) { n int a[2]; n cin >> a[0] >> a[1]; n string s; n cin >> s; n int n = a[0] + a[1]; n vector> x; n for (int i = 0; i < n / 2; ++i) { n if (s[i] == ? && s[n - 1 - i] == ? ) { n x.emplace_back(i, n - 1 - i); n } else if (s[i] == ? ) { n a[s[n - 1 - i] - 0 ] -= 2; n s[i] = s[n - 1 - i]; n } else if (s[n - 1 - i] == ? ) { n a[s[i] - 0 ] -= 2; n s[n - 1 - i] = s[i]; n } else { n if (s[i] != s[n - 1 - i]) { n a[0] = -1; n } else { n a[s[i] - 0 ] -= 2; n } n } n } n if (a[0] < 0 || a[1] < 0) { n cout << -1 << n ; n continue; n } n for (int i = 0; i < x.size(); ++i) { n if (a[0] >= 2) { n s[x[i].first] = s[x[i].second] = 0 ; n a[0] -= 2; n } else if (a[1] >= 2) { n s[x[i].first] = s[x[i].second] = 1 ; n a[1] -= 2; n } else { n a[0] = -1; n } n } n if (a[0] < 0 || a[1] < 0) { n cout << -1 << n ; n continue; n } n if ((n & 1) && s[n / 2] != ? ) a[s[n / 2] - 0 ]--; n if ((n & 1) && s[n / 2] == ? ) s[n / 2] = a[0] ? 0 : 1 ; n if (a[0] < 0 || a[1] < 0) n cout << -1 << n ; n else n cout << s << n ; n } n return 0; n }"} +{"func_code_string": "#include n int main() { n int n, k, i, j, swap; n scanf( %d %d , &n, &k); n int ara[n + 1][3]; n for (i = 1; i <= n; i++) { n scanf( %d , &ara[i][1]); n ara[i][2] = i; n } n for (i = 1; i <= n; i++) { n for (j = 1; j <= (n - i); j++) { n if (ara[j][1] > ara[j + 1][1]) { n swap = ara[j][1]; n ara[j][1] = ara[j + 1][1]; n ara[j + 1][1] = swap; n swap = ara[j][2]; n ara[j][2] = ara[j + 1][2]; n ara[j + 1][2] = swap; n } n } n } n int sum = 0, p = 0; n for (i = 1; i <= n; i++) { n sum = sum + ara[i][1]; n if (sum <= k) n p++; n else n break; n } n if (p == 0) n printf( 0 n ); n else { n printf( %d n , p); n for (i = 1; i <= p; i++) printf( %d , ara[i][2]); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int p[n + 1]; n for (int i = 1; i <= n; i++) cin >> p[i]; n bool done[n + 1]; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) done[j] = false; n int start = i; n while (1) { n if (done[start] == true) { n cout << start << ; n break; n } n done[start] = true; n start = p[start]; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1}; n const double EPS = 1e-8; n const double PI = acos(-1.0); n int popcount(int n) { return __builtin_popcount(n); } n int popcount(long long n) { return __builtin_popcountll(n); } n template n int SIZE(T a) { n return a.size(); n } n template n string IntToString(T num) { n string res; n stringstream ss; n ss << num; n return ss.str(); n } n template n T StringToInt(string str) { n T res = 0; n for (int i = 0; i < SIZE(str); i++) res = (res * 10 + str[i] - 0 ); n return res; n } n template n T gcd(T a, T b) { n if (b == 0) return a; n return gcd(b, a % b); n } n template n T lcm(T a, T b) { n return a / gcd(a, b) * b; n } n template n void PrintSeq(T &a, int sz) { n for (int i = 0; i < sz; i++) { n cout << a[i]; n if (sz == i + 1) n cout << endl; n else n cout << ; n } n } n bool EQ(double a, double b) { return abs(a - b) < EPS; } n void fastStream() { n cin.tie(0); n std::ios_base::sync_with_stdio(0); n } n vector split(string str, char del) { n vector res; n for (int i = 0, s = 0; i < SIZE(str); i++) { n if (str[i] == del) { n if (i - s != 0) res.push_back(str.substr(s, i - s)); n s = i + 1; n } else if (i == SIZE(str) - 1) { n res.push_back(str.substr(s)); n } n } n return res; n } n int froms[1000001]; n int tos[1000001]; n vector > G[1000001]; n bool used[1000001]; n void dfs(int pprv, int prv, int now) { n used[now] = true; n for (int i = 0; i < (int)G[now].size(); i++) { n int to = G[now][i].first; n int en = G[now][i].second; n if (!used[to]) { n dfs(prv, en, to); n } n } n if (prv != -1 && pprv != -1) cout << pprv << << prv << endl; n } n int main() { n fastStream(); n int N; n cin >> N; n for (int i = 0; i < N - 1; i++) { n cin >> froms[i] >> tos[i]; n G[froms[i]].push_back(make_pair(tos[i], i + 1)); n G[tos[i]].push_back(make_pair(froms[i], i + 1)); n } n cout << N - 1 << endl; n for (int i = 0; i < N - 1; i++) n cout << 2 << << froms[i] << << tos[i] << endl; n for (int i = 0; i < N; i++) { n if (G[i + 1].size() == 1) { n dfs(-1, -1, i + 1); n break; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long x, val, i, j, k, n, m, val2; n vector > ans; n cin >> x; n for (n = 1; n <= (3000000); n++) { n val = x; n val -= (n - 1) * n * (2 * n - 1) / 6; n val += n * n * (n - 1) / 2; n val2 = n * n - ((n - 1) * n) / 2; n if (val % val2 == 0) { n val2 = val / val2; n if (val2 >= n) { n ans.push_back(make_pair(n, val2)); n if (n != val2) ans.push_back(make_pair(val2, n)); n } n } n } n printf( %d n , ans.size()); n sort(ans.begin(), ans.end()); n for (i = 0; i < ans.size(); i++) n printf( %lld %lld n , ans[i].first, ans[i].second); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 10; n int n, m, f[N], vis[N], cnt; n int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); } n struct node { n int x, y, w; n } a[N]; n bool cmp(node a, node b) { return a.w < b.w; } n int main() { n while (cin >> n >> m) { n int ans = 0; n for (int i = 1; i <= n; i++) f[i] = i; n for (int i = 1; i <= m; i++) { n int x, y, k; n cin >> x >> y >> k; n a[i].x = x; n a[i].y = y; n a[i].w = k; n } n sort(a + 1, a + 1 + m, cmp); n int mx = 0; n for (int i = 1; i <= m;) { n int j = i; n while (a[i].w == a[j].w) j++; n cnt = 0; n for (int k = i; k < j; k++) n if (find(a[k].x) != find(a[k].y)) cnt++; n for (int k = i; k < j; k++) { n if (find(a[k].x) != find(a[k].y)) { n f[find(a[k].x)] = find(a[k].y); n cnt--; n } n } n ans += cnt; n i = j; n } n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m; n long long x[105]; n double f[105][105525]; n double sum[105525]; n inline void read() { n cin >> n >> m; n for (long long i = 0; i <= n - 1; i++) { n cin >> x[i]; n } n } n inline void solve() { n long long ms = n * m; n if (m == 1) { n puts( 1 ); n return; n } n f[0][0] = 1; n for (long long i = 0; i <= n - 1; i++) { n for (long long s = 0; s <= ms; s++) { n if (s) { n sum[s] = sum[s - 1] + f[i][s]; n } else { n sum[s] = f[i][s]; n } n if (s > m) { n f[i + 1][s] = sum[s - 1] - sum[s - m - 1]; n } else { n f[i + 1][s] = sum[s - 1]; n } n if (s >= x[i]) { n f[i + 1][s] -= f[i][s - x[i]]; n } n f[i + 1][s] /= (m - 1); n } n } n long long score = 0; n for (long long i = 0; i <= n - 1; i++) { n score += x[i]; n } n double prob = 0; n for (long long s = 0; s <= score - 1; s++) { n prob += f[n][s]; n } n prob *= (m - 1); n prob += 1.0; n cout.precision(20); n cout << fixed << prob; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(); n read(); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using std::cin; n using std::cout; n using std::fixed; n using std::make_pair; n using std::max; n using std::min; n using std::pair; n using std::set; n using std::sort; n const long long base = (long long)(5 * 1e8 + 5); n const long long coefficient = (long long)(4 * 1e9); n long long convertCoordinate(long long x, long long y) { n return (x + base) * coefficient + (y + base); n } n pair convertCoordinateBack(long long pos) { n long long x = pos / coefficient - base - base; n long long y = pos % coefficient - base - base; n return make_pair(x, y); n } n const int MaxN = 200000 + 9; n int n, k, l, r, used; n long long points[MaxN]; n long long x, y, now; n set waitList; n set > ans; n set::iterator it; n set >::iterator pit; n int main() { n waitList.clear(); n ans.clear(); n scanf( %d%d , &n, &k); n if (k >= n) return cout << -1 n , 0; n for (int i = 1; i <= n; i++) { n scanf( %I64d%I64d , &x, &y); n points[i] = convertCoordinate(x, y); n } n sort(points + 1, points + n + 1); n for (int i = 1; i <= min(k + 2, n); i++) { n for (int j = max(n - k - 2, 1); j <= n; j++) { n waitList.insert(points[i] + points[j]); n } n } n for (it = waitList.begin(); it != waitList.end(); it++) { n l = 1; n r = n; n used = 0; n while (l <= r) { n now = points[l] + points[r]; n if (now < (*it)) n l++, used++; n else if (now > (*it)) n r--, used++; n else n l++, r--; n } n if (used <= k) ans.insert(convertCoordinateBack(*it)); n } n if (ans.size() == 0) n printf( 0 n ); n else { n printf( %d n , ans.size()); n for (pit = ans.begin(); pit != ans.end(); pit++) { n printf( %.2lf %.2lf n , (double)(*pit).first * 0.5, n (double)(*pit).second * 0.5); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int t; n string s; n cin >> s; n long long int n = s.length(); n long long int dp[s.length() + 5][27]; n for (int i = 0; i <= s.length(); i++) { n for (int j = 0; j < 27; j++) dp[i][j] = 0; n } n for (int i = 0; i < s.length(); i++) { n if (i != 0) { n for (int j = 0; j < 27; j++) { n dp[i + 1][j] = dp[i][j]; n } n } n dp[i + 1][s[i] - a ]++; n } n long long int ans = 1000000000000000000; n for (char c = a ; c <= z ; c++) { n long long int low = 1, high = n; n long long int mid; n while (low <= high) { n mid = (low + high) / 2; n bool f = 1; n for (int i = mid; i <= n; i++) { n if (dp[i][c - a ] - dp[i - mid][c - a ] <= 0) { n f = 0; n } n } n if (f) { n high = mid - 1; n } else { n low = mid + 1; n } n } n ans = min(low, ans); n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n template n struct rge { n c b, e; n }; n template n rge range(c i, c j) { n return rge{i, j}; n } n template n auto dud(c* x) -> decltype(cerr << *x, 0); n template n char dud(...); n struct debug { n template n debug& operator<<(const c&) { n return *this; n } n }; n template n void clr(T& a, int n) { n a.clear(); n a.resize(n + 1); n } n void solve(); n const int N = 2e5 + 10; n const int INF = 1e9; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t = 1; n while (t--) { n solve(); n } n } n int n; n void solve() { n cin >> n; n vector a(n + 1); n for (int i = int(1); i <= int(n); i++) { n cin >> a[i]; n } n const int B = 20; n vector count(B + 1); n for (int i = int(1); i <= int(n); i++) { n for (int j = int(0); j <= int(B); j++) { n long long mask = (1ll << j); n count[j] += (mask & a[i] ? 1 : 0); n } n } n debug() << [ n << count n : n << (count) << ] ; n long long ans = 0; n for (int i = int(1); i <= int(n); i++) { n long long curr = 0; n for (int j = int(0); j <= int(B); j++) { n if (count[j] == 0) continue; n curr += (1ll << j); n count[j]--; n } n ans += curr * curr; n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n class state { n public: n int d[4]; n int e; n state() : d{0, 0, 0, 0}, e(1) {} n bool operator<(const state &x) const { n for (int i = 0; i < 4; ++i) { n if (d[i] == x.d[i]) continue; n return d[i] > x.d[i]; n } n return e > x.e; n } n bool operator!=(const state &x) const { n for (int i = 0; i < 4; ++i) n if (d[i] != x.d[i]) return true; n return e != x.e; n } n }; n std::map mp; n int main() { n int n; n scanf( %d , &n); n mp[state()] = 0; n while (n--) { n int a, b; n scanf( %d%d , &a, &b); n std::map nmp; n for (auto it = mp.begin(); it != mp.end(); ++it) { n if (it->first.d[0] != 0) continue; n state s = it->first; n int t = it->second; n t += abs(a - s.e) + 1; n s.e = a; n s.d[0] = b; n std::sort(s.d, s.d + 4); n auto it2 = nmp.lower_bound(s); n if (it2 == nmp.end() || it2->first != s) n it2 = nmp.insert(it2, std::pair(s, t)); n it2->second = std::min(it2->second, t); n } n mp.swap(nmp); n 0; n for (auto it = mp.begin(); it != mp.end(); ++it) { n 0; n for (int i = 0; i < 4; ++i) { n if (!it->first.d[i]) continue; n state s = it->first; n int t = it->second; n t += abs(s.d[i] - s.e) + 1; n s.e = s.d[i]; n s.d[i] = 0; n std::sort(s.d, s.d + 4); n auto it2 = mp.lower_bound(s); n if (it2 == mp.end() || it2->first != s) n it2 = mp.insert(it2, std::pair(s, t)); n it2->second = std::min(it2->second, t); n } n } n } n int ans = ((int)1e9); n for (auto it = mp.begin(); it != mp.end(); ++it) { n if (it->first.d[0] || it->first.d[1] || it->first.d[2] || it->first.d[3]) n continue; n ans = std::min(ans, it->second); n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int arr[15], cnt[7] = {0}, ans = 0; n int j, hr = 0, mi = 0; n int se[100] = {0}; n vector na, ma; n void rec(int pos, int a) { n int i; n if (pos == -1) { n ans++; n return; n } n if (pos == mi - 1) { n for (i = 0; i <= na[pos]; i++) { n if (cnt[i] != 1) { n cnt[i] = 1; n if (i == na[pos]) se[pos] = 1; n rec(pos - 1, i); n cnt[i] = 0; n } n se[pos] = 0; n } n } else if (se[pos + 1] == 0) { n for (i = 0; i < 7; i++) { n if (cnt[i] != 1) { n cnt[i] = 1; n rec(pos - 1, i); n cnt[i] = 0; n } n } n } else { n for (i = 0; i <= na[pos]; i++) { n if (cnt[i] != 1) { n cnt[i] = 1; n if (i == na[pos]) { n se[pos] = 1; n } n rec(pos - 1, i); n cnt[i] = 0; n } n se[pos] = 0; n } n } n } n bool chk(int *a, int n) { n int i, flg = 0; n for (i = 0; i < n - 1; i++) { n if (a[i] <= a[i + 1]) n flg = 1; n else { n flg = 0; n break; n } n } n return flg; n } n int main() { n arr[0] = 1; n for (int i = 1; i <= 10; i++) { n arr[i] = arr[i - 1] * 7; n } n int n, m, i; n cin >> n >> m; n n = n - 1; n m = m - 1; n int x = n, y = m; n if (y == 0) { n na.push_back(0); n mi++; n } n while (y != 0) { n na.push_back(y % 7); n mi++; n y = y / 7; n } n if (x == 0) { n na.push_back(0); n hr++; n } n while (x != 0) { n na.push_back(x % 7); n hr++; n x = x / 7; n } n if (hr + mi > 7) n ans = 0; n else { n int pos = na.size() - 1; n for (i = 0; i <= na[pos]; i++) { n cnt[i] = 1; n if (i == na[pos]) se[pos] = 1; n rec(pos - 1, i); n cnt[i] = 0; n se[pos] = 0; n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[55][55]; n int main() { n int n; n scanf( %d , &n); n memset(a, 0, sizeof(a)); n int p = 1, q = 2, nn = n / 2 + 1; n for (int i = 1; i <= n; ++i) { n a[nn][i] = p; n p += 2; n } n for (int i = 1; i <= n; ++i) { n if (i != nn) { n a[i][nn] = p; n p += 2; n } n } n int maxn = n * n; n for (int i = 1; i < nn; ++i) { n for (int j = 1; j < nn; ++j) { n if (p <= maxn) { n a[i][j] = p; n a[n + 1 - i][j] = p + 2; n a[n + 1 - i][n + 1 - j] = p + 4; n a[i][n + 1 - j] = p + 6; n p += 8; n } else { n a[i][j] = q; n a[n + 1 - i][j] = q + 2; n a[n + 1 - i][n + 1 - j] = q + 4; n a[i][n + 1 - j] = q + 6; n q += 8; n } n } n } n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= n; ++j) printf( %d , a[i][j]); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int max(int a, int b) { return (a > b) ? a : b; } n struct player { n int i; n int j; n int pos; n }; n int main() { n bool firstwon1 = false; n bool secondwon1 = false; n bool firstwon2 = false, firstwon3 = false, firstwon4 = false; n bool secondwon2 = false, secondwon3 = false, secondwon4 = false; n int won = 0; n player a[2], b[2]; n cin >> a[0].i >> a[0].j; n cin >> a[1].i >> a[1].j; n cin >> b[0].i >> b[0].j; n cin >> b[1].i >> b[1].j; n if (a[0].i > b[1].j && a[1].j > b[0].i) firstwon1 = true; n if (a[0].i < b[1].j && a[1].j < b[0].i) secondwon1 = true; n if (a[0].i > b[0].j && a[1].j > b[1].i) firstwon2 = true; n if (a[0].i < b[0].j && a[1].j < b[1].i) secondwon2 = true; n if (a[1].i > b[1].j && a[0].j > b[0].i) firstwon3 = true; n if (a[1].i < b[1].j && a[0].j < b[0].i) secondwon3 = true; n if (a[1].i > b[0].j && a[0].j > b[1].i) firstwon4 = true; n if (a[1].i < b[0].j && a[0].j < b[1].i) secondwon4 = true; n if ((firstwon1 == true && firstwon2 == true) || n (firstwon3 == true && firstwon4 == true)) n won = 1; n if ((secondwon1 == true || secondwon2 == true) && n (secondwon3 == true || secondwon4 == true)) n won = 2; n switch (won) { n case 1: { n cout << Team 1 n ; n break; n } n case 2: { n cout << Team 2 n ; n break; n } n case 0: { n cout << Draw n ; n break; n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n using namespace std; n const double pi = acos(-1.0); n void cp(); n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } n long long fact(long long n) { n if (n <= 1) return n; n return n * fact(n - 1); n } n bool prime[100001]; n void sieve() { n int n = 10000; n memset(prime, true, sizeof(prime)); n for (int p = 2; p * p <= n; p++) { n if (prime[p] == true) { n for (int i = p * p; i <= n; i += p) prime[i] = false; n } n } n } n void solve() { n int n, i; n cin >> n; n string s; n cin >> s; n for (i = 0; i <= (2 * n) - 1; i++) { n if (i % 2 == 0) cout << s[i]; n } n cout << n ; n } n int main() { n cp(); n int t; n cin >> t; n while (t--) solve(); n return 0; n } n void cp() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n } n "} +{"func_code_string": "#include n using namespace std; n using namespace std; n void enumerateSubmasks(int m) { n for (int s = m;; s = (s - 1) & m) { n if (s == 0) { n break; n } n } n } n int mpow(int a, int b, int m) { n if (b == 0) return 1; n int x = mpow(a, b / 2, m); n x = (x * x) % m; n if (b % 2) { n x = (x * a) % m; n } n return x; n } n void update(int s, int e, int qs, int qe, vector &seg, vector &lazy, n int index, int value) { n if (lazy[index] != -1) { n seg[index] = max(seg[index], lazy[index]); n if (s != e) { n if (lazy[2 * index] == -1) n lazy[2 * index] = lazy[index]; n else n lazy[2 * index] = max(lazy[2 * index], lazy[index]); n if (lazy[2 * index + 1] == -1) n lazy[2 * index + 1] = lazy[index]; n else n lazy[2 * index + 1] = max(lazy[2 * index + 1], lazy[index]); n } n lazy[index] = -1; n } n if (qs > e || qe < s) return; n if (s >= qs && e <= qe) { n seg[index] = max(seg[index], value); n if (s != e) { n if (lazy[2 * index] == -1) n lazy[2 * index] = value; n else n lazy[2 * index] = max(lazy[2 * index], value); n if (lazy[2 * index + 1] == -1) n lazy[2 * index + 1] = value; n else n lazy[2 * index + 1] = max(lazy[2 * index + 1], value); n } n return; n } n int mid = (s + e) / 2; n update(s, mid, qs, qe, seg, lazy, 2 * index, value); n update(mid + 1, e, qs, qe, seg, lazy, 2 * index + 1, value); n } n int query(int s, int e, int qs, int qe, vector &seg, vector &lazy, n int index) { n if (lazy[index] != -1) { n seg[index] = max(seg[index], lazy[index]); n if (s != e) { n if (lazy[2 * index] == -1) n lazy[2 * index] = lazy[index]; n else n lazy[2 * index] = max(lazy[2 * index], lazy[index]); n if (lazy[2 * index + 1] == -1) n lazy[2 * index + 1] = lazy[index]; n else n lazy[2 * index + 1] = max(lazy[2 * index + 1], lazy[index]); n } n lazy[index] = -1; n } n if (qs > e || qe < s) return LLONG_MIN; n if (s >= qs && e <= qe) { n return seg[index]; n } n int mid = (s + e) / 2; n int a = query(s, mid, qs, qe, seg, lazy, 2 * index); n int b = query(mid + 1, e, qs, qe, seg, lazy, 2 * index + 1); n return max(a, b); n } n void printBinaryString(int n) { n vector temp; n while (n) { n if (n & 1) n temp.push_back(1); n else n temp.push_back(0); n n = n >> 1; n } n reverse(temp.begin(), temp.end()); n for (auto node : temp) cout << node << ; n cout << endl; n } n void readVector(vector &a) { n int n = a.size(); n for (int i = 0; i < n; ++i) cin >> a[i]; n } n vector> adj(100002); n vector par(100002); n void dfs(int node, int parent) { n par[node] = parent; n for (auto child : adj[node]) { n if (child == parent) continue; n dfs(child, node); n } n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n cin >> n; n vector> graph; n for (int i = 0; i < n - 1; ++i) { n int u, v; n cin >> u >> v; n adj[u].push_back(v); n adj[v].push_back(u); n graph.push_back({u, v}); n } n dfs(1, 1); n cout << n - 1 << endl; n for (int i = 2; i <= n; i++) { n cout << 2 << << i << << par[i] << endl; n } n int oneCousin = *adj[1].begin(); n for (auto node : adj[1]) { n if (node == oneCousin) continue; n graph.push_back({oneCousin, node}); n } n for (auto node : graph) n if (node.first != 1 && node.second != 1) n cout << node.first - 1 << << node.second - 1 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n typedef pair P; n const int OO = 1e18; n const int md = 1e9 + 7; n int X[] = {0, 0, 1, -1}, Y[] = {1, -1, 0, 0}; n void fast() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n } n int dp[int(1e4 + 4)], t = 0, x, y, z, n, q, g[int(1e4 + 4)], res; n pair p[int(1e4 + 4)]; n int main() { n scanf( %d%d , &n, &q); n for (int i = 0; i < q; i++) n scanf( %d%d%d , &p[i].first.first, &p[i].first.second, &p[i].second); n sort(p, p + q); n memset(dp, -1, sizeof dp); n memset(g, -1, sizeof g); n dp[0] = g[0] = n; n for (int i = 0; i < q; i++) { n for (int j = 0; j <= n; j++) { n g[j] = max(g[j], dp[j]); n if (dp[j] >= p[i].first.first && j + p[i].second <= n) n g[j + p[i].second] = n max(dp[j + p[i].second], min(dp[j], p[i].first.second)); n } n g[p[i].second] = max(g[p[i].second], p[i].first.second); n swap(dp, g); n } n for (int i = 1; i <= n; i++) n if (dp[i] != -1) res++; n printf( %d n , res); n for (int i = 1; i <= n; i++) n if (dp[i] != -1) printf( %d , i); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x3f3f3f3f; n const int Maxn = 10010; n int a[Maxn]; n int tot = 0; n int main() { n int n; n cin >> n; n long long sum = 0; n for (int i = 2; i <= n; i++) { n for (int j = 2 * i; j <= n; j += i) { n sum += 4ll * (j / i); n } n } n cout << sum << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct PR { n int to; n int ne; n } Prise[200010]; n bool compare(PR a, PR b) { return (a.to - a.ne) < (b.to - b.ne); } n int main(int argc, char const *argv[]) { n int n, k; n cin >> n >> k; n int i; n for (i = 0; i < n; i++) { n cin >> Prise[i].to; n } n for (i = 0; i < n; i++) { n cin >> Prise[i].ne; n } n sort(Prise, Prise + n, compare); n int count = 0; n for (i = 0; i < k; i++) { n count += Prise[i].to; n } n for (i = k; i < n; i++) { n if (Prise[i].to < Prise[i].ne) { n count += Prise[i].to; n } else { n count += Prise[i].ne; n } n } n cout << count << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long far(long long x, long long y) { return x * x + y * y; } n vector val; n vector dsu; n vector rang; n long long pred(long long a) { n if (a == dsu[a]) { n return a; n } else { n long long to = pred(dsu[a]); n if (to != dsu[a]) { n val[a] *= val[dsu[a]]; n } n dsu[a] = to; n return to; n } n } n void unite(long long a, long long b) { n a = pred(a); n b = pred(b); n if (a != b) { n if (rang[a] < rang[b]) { n swap(a, b); n } n if (val[a] == -1) { n val[b] *= -1; n } n dsu[b] = a; n if (rang[a] == rang[b]) { n rang[a]++; n } n } n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long n; n cin >> n; n val.resize(n); n dsu.resize(n); n rang.resize(n); n vector > x(n); n vector type(n, 1); n long long stx = 0, sty = 0; n for (long long i = 0; i < n; i++) { n cin >> x[i].first >> x[i].second; n } n long long p = 1e6; n p = p * p; n vector ind(n); n for (long long i = 0; i < n; i++) { n ind[i] = i; n dsu[i] = i; n rang[i] = 1; n val[i] = 1; n } n for (long long i = 0; i < n - 2; i++) { n for (long long j = i + 0; j < min(n, 3 + i); j++) { n for (long long d = j + 1; d < min(n, 3 + i); d++) { n if (far(x[j].first + x[d].first, x[j].second + x[d].second) <= p) { n unite(ind[j], ind[d]); n x[d].first += x[j].first; n x[d].second += x[j].second; n if (j != i) { n x[i + 1] = x[i]; n ind[i + 1] = ind[i]; n } n j = 3 + i; n break; n } else if (far(x[j].first - x[d].first, x[j].second - x[d].second) <= n p) { n val[pred(ind[d])] *= -1; n unite(ind[j], ind[d]); n x[d].first = x[j].first - x[d].first; n x[d].second = x[j].second - x[d].second; n if (j != i) { n x[i + 1] = x[i]; n ind[i + 1] = ind[i]; n } n j = 3 + i; n break; n } n } n } n } n long long p1 = 1.5e6; n p1 = p1 * p1; n if (n > 1) { n if (far(x[n - 2].first + x[n - 1].first, n x[n - 2].second + x[n - 1].second) <= p1) { n unite(ind[n - 2], ind[n - 1]); n } else { n val[pred(ind[n - 1])] *= -1; n unite(ind[n - 2], ind[n - 1]); n } n } n for (long long i = 0; i < n; i++) { n long long t = pred(i); n if (t != i) { n cout << val[t] * val[i] << ; n } else { n cout << val[i] << ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = 3.14159265358979323846; n const double EPS = 1e-15; n const int INF = 1e9 + 7; n const long long LINF = 8e18 + 7; n const int N = 2e5 + 7; n vector t[4 * N]; n int a[N]; n long long s[N]; n void build(int v, int L, int R) { n if (L + 1 == R) { n t[v].push_back(s[L]); n return; n } n int M = L + R >> 1; n build(v << 1, L, M); n build(v << 1 | 1, M, R); n t[v].resize(t[v << 1].size() + t[v << 1 | 1].size()); n merge(t[v << 1].begin(), t[v << 1].end(), t[v << 1 | 1].begin(), n t[v << 1 | 1].end(), t[v].begin()); n } n int get(int v, int L, int R, int l, int r, long long val) { n if (L == l && R == r) { n return t[v].end() - upper_bound(t[v].begin(), t[v].end(), val); n } n int M = L + R >> 1; n int ans = 0; n if (l < M) { n ans += get(v << 1, L, M, l, min(M, r), val); n } n if (r > M) { n ans += get(v << 1 | 1, M, R, max(l, M), r, val); n } n return ans; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int n; n long long t; n cin >> n >> t; n for (int i = 0; i < int(n); ++i) { n cin >> a[i]; n s[i + 1] = a[i] + s[i]; n } n build(1, 0, n + 1); n long long ans = 0; n for (int i = 0; i < int(n); ++i) { n ans += get(1, 0, n + 1, 0, i + 1, s[i + 1] - t); n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int MX = 1e5 + 3; n int t; n long long m, n; n pair v[MX]; n long long p[MX]; n int main() { n scanf( %d , &t); n while (t--) { n scanf( %lld %lld , &n, &m); n long long ans = 0; n for (int i = 0; i < m; i++) { n scanf( %lld %lld , &v[i].first, &v[i].second); n } n sort(v, v + m, greater>()); n for (int i = 0; i < m; i++) { n p[i] = v[i].first + (i ? p[i - 1] : 0); n if (i < n) ans += v[i].first; n } n for (int i = 0; i < m; i++) { n int l = 0; n int r = m - 1; n int md; n while (l != r) { n md = (l + r) / 2; n if (v[md].first < v[i].second) n r = md; n else n l = md + 1; n } n int cnt = l; n if (v[m - 1].first >= v[i].second) cnt++, l++; n long long sum = 0; n if (l) sum = p[l - 1]; n if (l > i && cnt) { n cnt--; n sum -= v[i].first; n } n if (cnt > n - 2) { n continue; n } n long long ret = v[i].first + v[i].second * (n - cnt - 1) + sum; n ans = max(ans, ret); n } n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string equalString(string a) { n int len = a.size(); n if (len % 2 == 1) return a; n string a1 = a.substr(0, len / 2); n string a2 = a.substr(len / 2, len / 2); n a1 = equalString(a1); n a2 = equalString(a2); n return a1.compare(a2) < 0 ? a1 + a2 : a2 + a1; n } n int main() { n string a, b; n cin >> a >> b; n string nor_a = equalString(a); n string nor_b = equalString(b); n if (nor_a.compare(nor_b) == 0) n cout << YES n ; n else n cout << NO n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector > seq; n const int mod = 1e6; n const long long A = 42344; n const long long B = 333; n int seed = 239; n int mrand() { n static int now = -1; n if (now == -1) n now = seed; n else n now = (A * now + B) % mod; n return now; n } n struct line { n long long a, b, c; n int id; n line() {} n line(long long A, long long B, long long C, int i) n : a(A), b(B), c(C), id(i) {} n }; n void run(vector a, int k) { n int n = (int)a.size(); n if (k >= n) { n for (int i = 0; i < n; i++) seq.push_back(make_pair(a[i].id, -1)); n sort(seq.begin(), seq.end()); n seq.resize(unique(seq.begin(), seq.end()) - seq.begin()); n puts( YES ); n printf( %d n , (int)seq.size()); n for (int i = 0; i < (int)seq.size(); i++) n printf( %d %d n , seq[i].first, seq[i].second); n exit(0); n } n if (k == 0) return; n vector go; n for (int iter = 0; iter < k * k; iter++) { n int i = mrand() % n, j = mrand() % (n - 1); n if (j >= i) j++; n if (a[i].a * a[j].b == a[j].a * a[i].b) continue; n go.resize(0); n int kol = 0; n double lim = max(1.0 * kol, n * (1.0 - 1.0 / (2.0 * k))); n for (int q = 0; q < n; q++) n if (a[i].a * a[j].b * a[q].c + a[i].b * a[j].c * a[q].a + n a[i].c * a[j].a * a[q].b != n a[i].c * a[j].b * a[q].a + a[i].b * a[j].a * a[q].c + n a[i].a * a[j].c * a[q].b) { n go.push_back(a[q]); n kol++; n if (kol > lim) break; n } n if (kol > lim) continue; n seq.push_back(make_pair(a[i].id, a[j].id)); n run(go, k - 1); n seq.pop_back(); n } n } n int main() { n srand(123654); n int n, k; n scanf( %d%d , &n, &k); n vector l(n); n for (int i = 0; i < n; i++) { n int a, b, c; n scanf( %d%d%d , &a, &b, &c); n l[i] = line(a, b, c, i + 1); n } n run(l, k); n puts( NO ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string express(int layers) { n string ans = ; n for (int i = 1; i <= layers; i++) { n if (i % 2 == 1) { n if (i == layers) { n ans += I hate it ; n } else { n ans += I hate that ; n } n } else { n if (i == layers) { n ans += I love it ; n } else { n ans += I love that ; n } n } n } n return ans; n } n int main() { n int layers; n cin >> layers; n cout << express(layers); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector vec; n vec.push_back(0LL); n for (int i = 0; i < n; i++) { n long long k; n cin >> k; n vec.push_back(k); n } n int m; n cin >> m; n vector v; n long long x = 0, y = 0; n for (int i = 0; i < m; i++) { n long long a, b; n cin >> a >> b; n if (vec[a] >= y) { n v.push_back(vec[a]); n y = vec[a] + b; n } else { n v.push_back(y); n y += b; n } n } n for (int i = 0; i < m; i++) cout << v[i] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mx1 = 20; n const int mx2 = 405; n const int mx3 = 2005; n const int mx4 = 30005; n const int mx5 = 100005; n const int mx6 = 1000005; n int _toggle(int N, int pos) { return N = N ^ (1 << pos); } n int _set(int N, int pos) { return N = N | (1 << pos); } n int _reset(int N, int pos) { return N = N & ~(1 << pos); } n bool _check(int N, int pos) { return (bool)(N & (1 << pos)); } n bool _upper(char a) { return a >= A && a <= Z ; } n bool _lower(char a) { return a >= a && a <= z ; } n bool _digit(char a) { return a >= 0 && a <= 9 ; } n int dx[] = {1, -1, 0, 0, -1, -1, 1, 1}; n int dy[] = {0, 0, 1, -1, -1, 1, -1, 1}; n const int inf = 1e9 + 7; n int n, a[mx5]; n int fnd(int x, int y) { n int cnt = (x != 0) + (y != 0); n int A = a[1] + x, B = a[2] + y, d = B - A, pre = B; n for (int i = 3; i <= n; i++) { n bool f = 0; n for (int j = -1; j < 2; j++) { n int now = a[i] + j; n if (now - pre == d) { n f = 1; n pre = now; n cnt += (j != 0); n break; n } n } n if (!f) { n return inf; n } n } n return cnt; n } n void solve() { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n } n if (n < 3) { n cout << 0 << n ; n return; n } n int ans = inf; n for (int i = -1; i < 2; i++) { n for (int j = -1; j < 2; j++) { n ans = min(ans, fnd(i, j)); n } n } n if (ans == inf) { n cout << -1 << n ; n } else { n cout << ans << n ; n } n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int tc = 1; n while (tc--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n long long l, r, lim[60]; n long long f[60][60][2][2]; n inline long long read() { n long long x = 0, f = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (isdigit(ch)) { n (x *= 10) += ch - 0 ; n ch = getchar(); n } n return x * f; n } n long long dfs(long long at, long long sum, bool is_lim, bool is_pre) { n if (at == 0) return sum <= 3 && !is_pre; n if (f[at][sum][is_lim][is_pre] != -1) return f[at][sum][is_lim][is_pre]; n long long mx = is_lim ? lim[at] : 9, res = 0; n for (long long i = 0; i <= mx; i++) { n if (i == 0 && is_pre) n res += dfs(at - 1, sum, is_lim && i == mx, is_pre); n else n res += dfs(at - 1, sum + (i != 0), is_lim && i == mx, 0); n } n return f[at][sum][is_lim][is_pre] = res; n } n long long solve(long long x) { n memset(f, -1, sizeof(f)); n memset(lim, 0, sizeof(lim)); n long long mx_pos = 0; n while (x) lim[++mx_pos] = x % 10, x /= 10; n return dfs(mx_pos, 0, 1, 1); n } n signed main() { n long long T = read(); n while (T--) { n l = read(), r = read(); n printf( %lld n , solve(r) - solve(l - 1)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1000100, mod = 998244353; n inline int read() { n int x = 0, f = 0; n char ch = getchar(); n while (ch < 0 || ch > 9 ) f |= ch == - , ch = getchar(); n while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); n return f ? -x : x; n } n int n, el, head[maxn], to[maxn * 2], nxt[maxn * 2], len[maxn], fa[maxn], n son[maxn], ans[maxn], *f[maxn]; n inline void add(int u, int v) { n to[++el] = v; n nxt[el] = head[u]; n head[u] = el; n } n void dfs1(int u, int f) { n fa[u] = f; n for (int i = head[u]; i; i = nxt[i]) { n int v = to[i]; n if (v == f) continue; n dfs1(v, u); n if (len[v] + 1 > len[u]) son[u] = v, len[u] = len[v] + 1; n } n } n void dfs2(int u) { n if (son[fa[u]] != u) f[u] = new int[len[u] + 5](); n if (son[u]) { n f[son[u]] = f[u] + 1; n dfs2(son[u]); n if (f[u][ans[son[u]] + 1] > 1) ans[u] = ans[son[u]] + 1; n } n f[u][0]++; n for (int i = head[u]; i; i = nxt[i]) { n int v = to[i]; n if (v == fa[u] || v == son[u]) continue; n dfs2(v); n for (int j = (0); j <= (len[v]); j++) { n f[u][j + 1] += f[v][j]; n if (f[u][j + 1] == f[u][ans[u]]) ans[u] = min(ans[u], j + 1); n if (f[u][j + 1] > f[u][ans[u]]) ans[u] = j + 1; n } n } n } n int main() { n n = read(); n for (int i = (1); i <= (n - 1); i++) { n int u = read(), v = read(); n add(u, v); n add(v, u); n } n dfs1(1, 0); n dfs2(1); n for (int i = (1); i <= (n); i++) n if (son[fa[i]] != i) delete[] f[1]; n for (int i = (1); i <= (n); i++) printf( %d n , ans[i]); n } n "} +{"func_code_string": "#include n using namespace std; n long long n; n long long N[100006]; n long long sum[1000006], S[1000006]; n long long t[1000006]; n long long t1[1000006]; n long long lowbit(long long u) { return u & (-u); } n void add(long long u, long long w) { n while (u <= n) { n t[u] += w; n u += lowbit(u); n } n } n long long Find(long long u) { n long long ans = 0; n while (u) { n ans += t[u]; n u -= lowbit(u); n } n return ans; n } n void add1(long long u, long long w) { n while (u <= n) { n t1[u] += w; n u += lowbit(u); n } n } n long long Find1(long long u) { n long long ans = 0; n while (u) { n ans += t1[u]; n u -= lowbit(u); n } n return ans; n } n double ans; n signed main() { n scanf( %lld , &n); n for (long long i = 1; i <= n; i++) scanf( %lld , &N[i]); n for (long long i = 1; i <= n; i++) { n sum[i] += Find(n) - Find(N[i]); n S[i] += Find1(n) - Find1(N[i]); n if (sum[i] != 0) n ans += ((double)(n * (n + 1ll) / 2ll) * sum[i] - n (double)(n - i + 1ll) * S[i]) / n (double)(n * (n + 1ll) / 2ll); n add(N[i], 1); n add1(N[i], i); n } n for (long long i = 2; i <= n; i++) n ans += (double)((i - 1) * i) / 2.00 / 2.00 * (double)(n - i + 1) / n (double)(n * (n + 1ll) / 2ll); n printf( %.12lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, nq, tr, tg, z, tot, root; n int ls[7000010], rs[7000010], s[7000010]; n long long mod, ans, x, y; n long long b[100010], a[100010]; n void push_down(int p) { n if (!ls[p]) ls[p] = ++tot; n if (!rs[p]) rs[p] = ++tot; n if (s[ls[p]] == 0 || s[p] < s[ls[p]]) s[ls[p]] = s[p]; n if (s[rs[p]] == 0 || s[p] < s[rs[p]]) s[rs[p]] = s[p]; n s[p] = 0; n } n void change(int &p, long long l, long long r) { n if (l > y || r < x) return; n if (!p) p = ++tot; n if (l >= x && r <= y) { n if (s[p] == 0 || z < s[p]) s[p] = z; n return; n } n if (s[p]) push_down(p); n change(ls[p], l, (l + r) / 2); n change(rs[p], (l + r) / 2 + 1, r); n } n int query(int &p, long long l, long long r) { n if (!p) p = ++tot; n if (l == r) return s[p]; n if (s[p]) push_down(p); n if (x <= (l + r) / 2) n return query(ls[p], l, (l + r) / 2); n else n return query(rs[p], (l + r) / 2 + 1, r); n } n int main() { n int i, j, q; n long long tx, ty; n scanf( %d%d%d , &n, &tg, &tr); n mod = tg + tr; n for (i = 1; i <= n + 1; i++) scanf( %I64d , &a[i]); n for (i = 1; i <= n + 1; i++) a[i] += a[i - 1]; n for (i = n; i >= 1; i--) { n x = mod - a[i] % mod; n y = query(root, 1, mod); n if (!y) n b[i] = 0; n else n b[i] = b[y] + (mod - (a[y] - a[i]) % mod); n tx = ((tg - a[i]) % mod + mod - 1) % mod + 1; n ty = ((mod - 1 - a[i]) % mod + mod - 1) % mod + 1; n z = i; n if (tx <= ty) { n x = tx; n y = ty; n change(root, 1, mod); n } else { n x = 1; n y = ty; n change(root, 1, mod); n x = tx; n y = mod; n change(root, 1, mod); n } n } n scanf( %d , &nq); n for (q = 1; q <= nq; q++) { n scanf( %d , &x); n ans = x + a[n + 1]; n x = (x - 1) % mod + 1; n y = query(root, 1, mod); n if (y) ans += mod - (a[y] + x) % mod + b[y]; n printf( %I64d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n istream &operator>>(istream &in, vector &arr) { n for (auto &x : arr) in >> x; n return in; n } n long long n, m; n const long long N = 1e6 + 100; n vector> g[N]; n long long col[N]; n bool cyc; n long long res[N]; n void dfs(long long r) { n col[r] = 1; n for (auto x : g[r]) { n long long to = x.first, ind = x.second; n if (col[to] == 0) { n res[ind] = 1; n dfs(to); n } else if (col[to] == 1) { n res[ind] = 2; n cyc = true; n } else { n res[ind] = 1; n } n } n col[r] = 2; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> n >> m; n for (long long i = 0; i < m; ++i) { n long long u, v; n cin >> u >> v; n --u, --v; n g[u].push_back({v, i}); n } n for (long long i = 0; i < n; ++i) { n if (col[i] == 0) { n dfs(i); n } n } n cout << (cyc ? 2 : 1) << n ; n for (long long i = 0; i < m; ++i) { n cout << res[i] << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n char s1[1010000]; n char s2[1010000]; n int main() { n scanf( %s , s1); n scanf( %s , s2); n int len1, len2, i; n len1 = strlen(s1); n len2 = strlen(s2); n int ans; n if (len1 - len2) n ans = 0; n else if (len1 == 1) { n if (s1[0] == s2[0]) n ans = 1; n else n ans = 0; n } else { n if (strcmp(s1, s2) == 0) n ans = 1; n else { n int j1, j2; n j1 = j2 = 0; n for (i = 0; s1[i]; ++i) n if (s1[i] == 1 ) j1 = 1; n for (i = 0; s2[i]; ++i) n if (s2[i] == 1 ) j2 = 1; n if (j1 && j2) n ans = 1; n else n ans = 0; n } n } n if (ans) n puts( YES ); n else n puts( NO ); n } n "} +{"func_code_string": "#include n using namespace std; n int N, M, lb[300010], ind[300010]; n vector g[300010], g2[300010]; n int val[300010]; n bool viz[300010]; n int dfs(int nod, int v) { n val[nod] = v; n viz[nod] = 1; n for (int nxt : g2[nod]) { n if (viz[nxt]) continue; n return dfs(nxt, v + 1); n } n return nod; n } n int main() { n cin >> N >> M; n int i, x, y; n for (i = 1; i <= M; i++) { n cin >> x >> y; n g[x].push_back(y); n g[y].push_back(x); n } n for (i = 1; i <= N; i++) { n g[i].push_back(i); n sort(g[i].begin(), g[i].end()); n ind[i] = i; n } n sort(ind + 1, ind + N + 1, [](int x, int y) { return g[x] < g[y]; }); n lb[ind[1]] = 1; n for (i = 2; i <= N; i++) n if (g[ind[i]] == g[ind[i - 1]]) n lb[ind[i]] = lb[ind[i - 1]]; n else n lb[ind[i]] = 1 + lb[ind[i - 1]]; n for (i = 1; i <= N; i++) n for (int nxt : g[i]) { n if (lb[nxt] == lb[i]) continue; n g2[lb[i]].push_back(lb[nxt]); n } n int cr = dfs(1, 1); n memset(val, 0, sizeof(val)); n memset(viz, 0, sizeof(viz)); n dfs(cr, 1); n for (i = 1; i <= lb[ind[N]]; i++) n if (val[i] == 0) { n cout << NO n ; n return 0; n } n cout << YES n ; n for (i = 1; i <= N; i++) cout << val[lb[i]] << ; n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int INF = 9223372036854775807LL; n #pragma GCC optimize( Ofast ) n #pragma GCC target( avx,avx2,fma ) n #pragma GCC optimization( unroint-loops ) n long long int power(long long int b, long long int e, long long int m) { n if (b == 0) return 0; n if (e == 0) return 1; n if (e & 1) return b * power(b * b % m, e / 2, m) % m; n return power(b * b % m, e / 2, m); n } n long long int power(long long int b, long long int e) { n if (b == 0) return 0; n if (e == 0) return 1; n if (e & 1) return b * power(b * b, e / 2); n return power(b * b, e / 2); n } n bool isPowerOfTwo(long long int x) { return (x && !(x & (x - 1))); } n void solve() { n long long int n, m; n cin >> n >> m; n vector v(n + 1); n cin >> v[1]; n for (long long int i = 2; i <= n; i++) { n cin >> v[i]; n v[i] += v[i - 1]; n } n long long int ans = 0; n while (m--) { n long long int a, b; n cin >> a >> b; n if (v[b] - v[a - 1] >= 0) ans += v[b] - v[a - 1]; n } n cout << ans; n } n signed main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long int tt = 1; n for (long long int i = 1; i <= tt; i++) { n solve(); n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 1e5 + 55; n int x[MAX]; n long long poww(long long x, long long y) { n if (y == 0) return 1; n long long s = poww(x, y / 2); n s = (s * s); n if (y % 2 == 1) s = (s * x); n return s; n } n int main() { n string s = OYGR ; n string c = BIV ; n int t = 0; n int n; n cin >> n; n string b = ; n for (int i = 0; i < n - 3; i++) { n if (t == 4) t = 0; n b += s[t]; n t++; n } n cout << b + c; n return 0; n } n "} +{"func_code_string": "#include n int a[1511]; n int main() { n int n, m, i, j, s(0); n scanf( %d , &n); n for (i = 0; i < n; ++i) scanf( %d , &a[i]); n for (i = 0; i < n; ++i) n for (j = i + 1; j < n; ++j) n if (a[i] > a[j]) s ^= 1; n scanf( %d , &m); n while (m--) { n scanf( %d%d , &i, &j); n if ((j - i + 1) * (j - i) / 2 & 1) s ^= 1; n printf( %s n , s ? odd : even ); n } n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:1000000000 ) n #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops ) n using namespace std; n const int maxn = (int)1e5 + 10; n struct vt { n long double x, y; n }; n vt operator-(vt a, vt b) { n a.x -= b.x; n a.y -= b.y; n return a; n } n vt operator+(vt a, vt b) { n a.x += b.x; n a.y += b.y; n return a; n } n vt operator*(vt a, long double x) { n a.x *= x; n a.y *= x; n return a; n } n long double dst(vt a) { return hypotl(a.x, a.y); } n vt operator/(vt a, long double x) { n a.x /= x; n a.y /= x; n return a; n } n const long double eps = 1e-18; n vector inter(vt a, long double r) { n long double d = dst(a); n if (d * d <= r * r) { n return {}; n } n long double x = r * r / d; n long double y = r * sqrt(1. - (r / d) * (r / d)); n vt b = a * (x / dst(a)); n vt n = {-a.y, a.x}; n n = n / dst(n); n return {b - n * y, b + n * y}; n } n long double operator*(vt a, vt b) { return a.x * b.y - a.y * b.x; } n int tp(vt a) { return a.y > eps || (abs(a.y) < eps && a.x > eps); } n vt v[maxn]; n bool operator<(vt a, vt b) { n int tpa = tp(a); n int tpb = tp(b); n if (tpa != tpb) { n return tpa < tpb; n } n return a * b > eps; n } n int tr[4 * maxn]; n void change(int pos) { n for (; pos < 4 * maxn; pos |= pos + 1) { n tr[pos]++; n } n } n int go(int pos) { n int ans = 0; n for (; pos >= 0; pos = (pos & (pos + 1)) - 1) { n ans += tr[pos]; n } n return ans; n } n int go(int l, int r) { return go(r) - go(l - 1); } n ostream& operator<<(ostream& out, vt a) { return out << a.x << << a.y; } n mt19937 rr; n int main() { n int n; n long long k; n cin >> n >> k; n for (int i = 0; i < n; i++) { n cin >> v[i].x >> v[i].y; n } n k = (long long)n * (n - 1) / 2 - k; n long double l = 0; n long double r = sqrt(2.) * 1e4; n for (int itr = 0; itr < 36; itr++) { n long double m = (l + r) / 2; n vector g; n vector > f; n for (int i = 0; i < n; i++) { n auto a = inter(v[i], m); n if (a.empty()) { n continue; n } n f.push_back(make_pair(a[0], a[1])); n g.push_back(a[0]); n g.push_back(a[1]); n } n sort((g).begin(), (g).end()); n vector > a; n memset(tr, 0, sizeof tr); n for (int i = 0; i < (int)f.size(); i++) { n a.push_back(make_pair( n lower_bound((g).begin(), (g).end(), f[i].first) - g.begin(), n lower_bound((g).begin(), (g).end(), f[i].second) - g.begin())); n if (a.back().first > a.back().second) { n change(a.back().second); n a.back().second += (int)g.size(); n } n } n sort((a).begin(), (a).end()); n long long tot = 0; n for (int i = 0; i < (int)a.size(); i++) { n tot += go(a[i].first, a[i].second); n change(a[i].second); n } n if (tot <= k) { n r = m; n } else { n l = m; n } n } n printf( %.10lf n , (double)r); n } n "} +{"func_code_string": "#include n n using namespace std; n n #define mp make_pair n #define fi first n #define se second n #define pb push_back n #define FOR(i,a,b) for(int i=a;i<=b;i++) n #define FORD(i,a,b) for(int i=a;i>=b;i--) n #define faster() ios_base::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL); n n typedef long long ll; n typedef vector vi; n typedef vector vll; n n int main() n { n faster(); n int t; n cin>>t; n while(t--) n { n int a[4]; n FOR(i,0,3) cin>>a[i]; n int max1=max(a[0],a[1]),max2=max(a[2],a[3]); n sort(a,a+4); n if(max1>max2 && max1==a[3] && max2==a[2]) cout<< YES < n using namespace std; n inline long long read() { n long long sum = 0, ff = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) { n ff = -1; n } n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n sum = sum * 10 + ch - 48; n ch = getchar(); n } n return sum * ff; n } n void write(long long x) { n if (x < 0) putchar( - ), x = -x; n if (x > 9) write(x / 10); n putchar(x % 10 + 0 ); n } n const int N = 1000007; n int n, m; n struct edge { n int from, to, dis, next; n } e[N], a[N]; n int he[N], cnt; n void add(int u, int v, int w) { n e[++cnt].from = u; n e[cnt].to = v; n e[cnt].dis = w; n e[cnt].next = he[u]; n he[u] = cnt; n } n bool cmp(edge x, edge y) { n if (x.from == y.from) return x.to < y.to; n return x.from < y.from; n } n int col[N]; n queue q; n struct node { n int pos, dis; n }; n queue que; n bool vis[N]; n int bfs() { n que.push((node){n, 0}); n vis[n] = true; n while (!que.empty()) { n node now = que.front(); n que.pop(); n if (now.pos == 1) return now.dis; n for (int i = he[now.pos]; i; i = e[i].next) { n int v = e[i].to; n if (vis[v]) continue; n if (col[v] == -1 || col[v] == 1 - e[i].dis) n col[v] = 1 - e[i].dis; n else { n vis[v] = true; n que.push((node){v, now.dis + 1}); n } n } n } n return -1; n } n map, bool> mp; n int main() { n n = read(), m = read(); n for (int i = 1; i <= m; i++) { n a[i].from = read(), a[i].to = read(), a[i].dis = read(); n add(a[i].to, a[i].from, a[i].dis); n } n memset(col, -1, sizeof(col)); n write(bfs()), puts( ); n for (int i = 1; i <= n; i++) n if (col[i] == -1) n printf( 0 ); n else n write(col[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2010; n struct point { n point(int xx, int yy) : x(xx), y(yy) {} n int x, y; n }; n int n, m; n char a[N][N]; n queue q; n int dx[4] = {-1, 1, 0, 0}; n int dy[4] = {0, 0, -1, 1}; n long long pp; n bool uniq(int xx, int yy) { n if (a[xx][yy] != . ) { n return false; n } n int counter = 0; n for (int i = 0; i < 4; ++i) { n int x = xx + dx[i]; n int y = yy + dy[i]; n if (a[x][y] == . ) { n ++counter; n } n } n return (counter == 1); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n >> m; n for (int i = 0; i <= n + 1; ++i) { n for (int j = 0; j <= m + 1; ++j) { n if (i == 0 || j == 0 || i == n + 1 || j == m + 1) { n a[i][j] = * ; n continue; n } n cin >> a[i][j]; n if (a[i][j] == . ) { n ++pp; n } n } n } n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n if (a[i][j] == * ) { n continue; n } n int counter = 0; n if (a[i][j + 1] == . ) { n ++counter; n } n if (a[i][j - 1] == . ) { n ++counter; n } n if (a[i - 1][j] == . ) { n ++counter; n } n if (a[i + 1][j] == . ) { n ++counter; n } n if (counter == 0) { n cout << Not unique ; n return 0; n } n if (counter == 1) { n q.push(point(i, j)); n } n } n } n while (true) { n if (q.empty()) { n break; n } n point cur = q.front(); n q.pop(); n if (a[cur.x][cur.y] != . ) { n continue; n } n if (!uniq(cur.x, cur.y)) { n cout << Not unique ; n return 0; n } n int xx = cur.x; n int yy = cur.y; n for (int i = 0; i < 4; ++i) { n xx += dx[i]; n yy += dy[i]; n if (a[xx][yy] == . ) { n break; n } n xx -= dx[i]; n yy -= dy[i]; n } n if (yy == cur.y) { n if (xx < cur.x) { n a[cur.x][cur.y] = v ; n a[xx][yy] = ^ ; n } else { n a[xx][yy] = v ; n a[cur.x][cur.y] = ^ ; n } n } n if (xx == cur.x) { n if (yy < cur.y) { n a[cur.x][cur.y] = > ; n a[xx][yy] = < ; n } else { n a[cur.x][cur.y] = < ; n a[xx][yy] = > ; n } n } n pp -= 2; n for (int i = 0; i < 4; ++i) { n if (uniq(xx + dx[i], yy + dy[i])) { n q.push(point(xx + dx[i], yy + dy[i])); n } n } n } n if (pp > 0) { n cout << Not unique ; n return 0; n } n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) { n cout << a[i][j]; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, i, ans; n map m, ind; n long long b[150001], a; n int main() { n scanf( %d , &n); n ans = n; n for (i = 1; i <= n; i++) { n scanf( %I64d , &a); n m[a]++; n b[i] = a; n while (m[a] > 1) { n ans--; n m[a] = 0; n b[ind[a]] = 0; n a *= 2; n b[i] = a; n m[a]++; n } n ind[a] = i; n } n printf( %d n , ans); n for (i = 1; i <= n; i++) n if (b[i] > 0) printf( %I64d , b[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector > > regions; n int main() { n int n, m; n cin >> n >> m; n regions.resize(m); n string name; n int r, s; n for (int i = 0; i < n; ++i) { n cin >> name >> r >> s; n regions[r - 1].push_back(make_pair(s, name)); n } n for (int i = 0; i < m; ++i) { n sort(regions[i].rbegin(), regions[i].rend()); n if (regions[i].size() == 2 || regions[i][1].first > regions[i][2].first) n cout << regions[i][0].second << << regions[i][1].second << endl; n else n cout << ? << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long MAXN = 2e5 + 7; n const long long INF = 3e18 + 7; n long long n, t; n long long a[MAXN], p[MAXN], l[MAXN], r[MAXN]; n long long ans[MAXN]; n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> n >> t; n for (long long i = 0; i < n; ++i) cin >> a[i]; n for (long long i = 0; i < n; ++i) { n cin >> p[i]; n --p[i]; n } n for (long long i = 0; i < n - 1; ++i) { n if (p[i + 1] < p[i]) { n cout << No n ; n exit(0); n } n } n for (long long i = 0; i < n; ++i) { n l[i] = 1; n r[i] = INF; n } n for (long long i = 0; i < n; ++i) { n l[p[i]] = max(l[p[i]], a[i] + t); n } n for (long long i = 0; i < n; ++i) { n l[i] = max(l[i], a[i] + t); n } n long long mx = -1; n for (long long i = 0; i < n - 1; ++i) { n mx = max(mx, p[i]); n if (i < mx) { n l[i] = max(l[i], a[i + 1] + t); n } n } n for (long long i = 0; i < n - 1; ++i) { n if (p[i] < i) { n r[p[i]] = min(r[p[i]], a[p[i]] + t - 1); n } else { n r[p[i]] = min(r[p[i]], a[p[i] + 1] + t - 1); n } n } n for (long long i = 0; i < n; ++i) { n if (!i) n ans[i] = l[i]; n else n ans[i] = max(ans[i - 1] + 1, l[i]); n } n for (long long i = 0; i < n - 1; ++i) { n if (ans[i + 1] <= a[i]) { n cout << No n ; n exit(0); n } n if (!(l[i] <= ans[i] && ans[i] <= r[i])) { n cout << No n ; n exit(0); n } n } n cout << Yes n ; n for (long long i = 0; i < n; ++i) { n cout << ans[i] << ; n } n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void JIZZ(string output = ) { n cout << output; n exit(0); n } n const long double PI = 3.14159265358979323846264338327950288; n const long double eps = 1e-13; n const long long mod = 1e9 + 7; n struct node { n node *l, *r; n int mx; n node() : l(0), r(0), mx(-(1 << 30)) {} n } * root, pool[100000]; n int pptr = -1; n int a[20005], pre[20005], dp[53][20005]; n node *nnode() { n ++pptr; n pool[pptr].l = pool[pptr].r = 0; n pool[pptr].mx = -(1 << 30); n return &pool[pptr]; n } n void build(node *now, int l, int r) { n if (l == r) return; n build(now->l = nnode(), l, ((l + r) >> 1)); n build(now->r = nnode(), ((l + r) >> 1) + 1, r); n } n void modify(node *now, int l, int r, int x, int v) { n if (l == r) { n now->mx = max(now->mx, v); n return; n } n if (x <= ((l + r) >> 1)) n modify(now->l, l, ((l + r) >> 1), x, v); n else n modify(now->r, ((l + r) >> 1) + 1, r, x, v); n now->mx = max(now->l->mx, now->r->mx); n } n int query(node *now, int l, int r, int ql, int qr) { n ; n ; n if (qr < l || r < ql) return -(1 << 30); n if (ql <= l && r <= qr) return now->mx; n return max(query(now->l, l, ((l + r) >> 1), ql, qr), n query(now->r, ((l + r) >> 1) + 1, r, ql, qr)); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int n, k, p; n cin >> n >> k >> p; n for (int i = 1; i <= n; ++i) cin >> a[i], a[i] %= p; n for (int i = 1; i <= n; ++i) pre[i] = (pre[i - 1] + a[i]) % p; n for (int i = 1; i <= n; ++i) dp[0][i] = -(1 << 30); n for (int i = 1; i <= k; ++i) { n pptr = -1; n build(root = nnode(), 0, p - 1); n modify(root, 0, p - 1, 0, 0); n for (int j = 1; j <= n; ++j) { n dp[i][j] = pre[j] + query(root, 0, p - 1, 0, pre[j]); n if (pre[j] != p - 1) n dp[i][j] = max(dp[i][j], n pre[j] + query(root, 0, p - 1, pre[j] + 1, p - 1) + p); n modify(root, 0, p - 1, pre[j], -pre[j] + dp[i - 1][j]); n ; n ; n } n } n cout << dp[k][n] << endl; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:102400000,102400000 ) n using namespace std; n int n, cnt; n int ans[1005]; n bool prime(int x) { n for (int i = 2; i < x; i++) n if (x % i == 0) return 0; n return 1; n } n int main() { n scanf( %d , &n); n for (int i = 2; i <= n; i++) { n if (!prime(i)) continue; n int p = i; n while (p <= n) { n ans[++cnt] = p; n p *= i; n } n } n printf( %d n , cnt); n for (int i = 1; i < cnt; i++) printf( %d , ans[i]); n if (cnt) printf( %d n , ans[cnt]); n } n "} +{"func_code_string": "#include n using namespace std; n int NewMessages(int right, int left, int k, int size) { n int right_border = min(right + k, size - 1); n int left_border = max(min(left + k, size - 1), max(0, right - k - 1)); n return right_border - left_border; n } n int main() { n int n, k; n cin >> n >> k; n vector messages(n); n for (auto& x : messages) { n cin >> x; n --x; n } n vector counts(n, 0); n counts[0] = min(static_cast(counts.size()) - 1, k) + 1; n for (int i = 1; i < counts.size(); ++i) { n if (messages[i] == -1) { n counts[i] = n min(static_cast(counts.size()) - 1, i + k) - max(0, i - k) + 1; n } else { n counts[i] = n counts[messages[i]] + n NewMessages(i, messages[i], k, static_cast(counts.size())); n } n } n for (auto x : counts) { n cout << x << ; n } n cout << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = acos(-1.0); n const long long INFLL = 0x3f3f3f3f3f3f3f3fll; n const int maxn = 2e5 + 5; n const int mod = 1e9 + 7; n int n, k; n char ans[55][3]; n int main() { n cin >> n >> k; n char ch1 = A , ch2 = a ; n for (int i = 0; i < n - k + 1; i++) { n string s; n cin >> s; n if (i == 0) { n if (s == YES ) { n for (int j = i; j < i + k; j++) { n ans[j][0] = ch1; n ans[j][1] = ch2++; n if (ch2 > z ) ch1 = B , ch2 = a ; n } n } else { n ans[i][0] = ans[i + k - 1][0] = ch1; n ans[i][1] = ans[i + k - 1][1] = ch2++; n for (int j = i + 1; j < i + k - 1; j++) { n ans[j][0] = ch1; n ans[j][1] = ch2++; n if (ch2 > z ) ch1 = B , ch2 = a ; n } n } n } else { n if (s == YES ) { n ans[i + k - 1][0] = ch1; n ans[i + k - 1][1] = ch2++; n } else { n ans[i + k - 1][0] = ans[i][0]; n ans[i + k - 1][1] = ans[i][1]; n } n if (ch2 > z ) ch1 = B , ch2 = a ; n } n } n for (int i = 0; i < n; i++) { n cout << ans[i][0] << ans[i][1] << ; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, k, a[100][100], ans, ma[100]; n bool mark[10]; n int seen[100000]; n void BT(int n) { n if (n > ::n) { n int ans = 0; n for (int i = 1; i <= ::n; i++) { n if (a[i][ma[i]] == 0 && ma[i] != 0) return; n ans += a[i][ma[i]]; n } n seen[ans]++; n return; n } n for (int i = 0; i <= ::n; i++) { n if (i == 0 || !mark[i]) { n ma[n] = i; n mark[i] = true; n BT(n + 1); n ma[n] = 0; n mark[i] = false; n } n } n return; n } n int main() { n cin >> n >> m >> k; n for (int i = 0; i < m; i++) { n int A, b, c; n cin >> A >> b >> c; n a[A][b] = c; n } n int t = 0, i = 0; n BT(1); n seen[0] = 1; n while (t < k) { n if (seen[i]) t += seen[i]; n i++; n } n cout << i - 1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 300005; n int f[maxn], n; n struct struc { n long long a[maxn]; n int go[19][maxn], nxt[maxn]; n void build(int ty = 0) { n if (!ty) { n for (int i = 1; i <= n; i++) scanf( %lld , &a[i]); n for (int i = n; i; i--) a[i] += a[i + 1]; n } n static map pos; n pos.clear(); n pos[0] = n + 1; n for (int i = n; i; i--) nxt[i] = pos[a[i]], pos[a[i]] = i; n } n } sav[3]; n vector > up[maxn], dow[maxn]; n int c[maxn]; n void push(int i, int j, int v) { n c[max(i, j)] = max(c[max(i, j)], v); n if (i <= j) up[i].push_back(pair(j, v)); n if (j <= i) dow[j].push_back(pair(i, v)); n } n void trans(int i, int j, int v) { n push(i + 1, j, v), push(i, j + 1, v); n if (sav[0].nxt[i]) push(sav[0].nxt[i], j, v + 1); n if (sav[1].nxt[j]) push(i, sav[1].nxt[j], v + 1); n if (i == j && sav[2].nxt[i]) push(sav[2].nxt[i], sav[2].nxt[i], v + 1); n } n int main() { n scanf( %d , &n); n sav[0].build(), sav[1].build(); n for (int i = 1; i <= n; i++) sav[2].a[i] = sav[0].a[i] + sav[1].a[i]; n sav[2].build(1); n for (int i = 1; i <= n; i++) { n int go_up = (1 << 30), go_dow = (1 << 30); n trans(i, i, c[i]); n for (auto p : up[i]) n if (p.second == c[i] + 1) go_dow = min(go_dow, p.first); n for (auto p : dow[i]) n if (p.second == c[i] + 1) go_up = min(go_up, p.first); n if (go_up <= n + 1) trans(go_up, i, c[i] + 1); n if (go_dow <= n + 1) trans(i, go_dow, c[i] + 1); n } n printf( %d n , c[n + 1]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, l; n string s; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> l >> s; n int first = s[0] - 0 ; n int second = s[1] - 0 ; n if (s.length() == 2 && first >= second) { n cout << NO << endl; n continue; n } n cout << YES << endl; n cout << 2 << endl; n cout << s[0] << << s.substr(1) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void debugger(const char* varname, arg&& var) { n cout << varname << = << var << endl; n } n template n void debugger(const char* varnames, arg&& var, args&&... vars) { n const char* comma = strchr(varnames + 1, , ); n cout.write(varnames, comma - varnames) << = << var << | ; n int sz = 1; n if (isspace(comma[sz])) sz++; n debugger(comma + sz, vars...); n } n using ll = long long; n using ii = pair; n using vi = vector; n extern const int INF = INT_MAX - 5; n extern const ll LINF = LLONG_MAX - 5; n extern const int MOD = 1e9 + 7; n extern const int N = 2e5 + 200; n int t, n; n string s; n vi find_min() { n vi ret(n), pos; n if (s[0] == < ) pos.emplace_back(0); n for (int i = 1; i < (int)s.size(); ++i) { n if (s[i - 1] == > and s[i] == < ) { n pos.emplace_back(i); n } n } n if (s[(int)s.size() - 1] == > ) pos.emplace_back(n - 1); n int c = 1; n for (int i = (int)pos.size() - 1; i >= 0; --i) { n ret[pos[i]] = c; n c++; n } n for (int i = pos[pos.size() - 1] + 1; i < n; ++i) { n ret[i] = c; n c++; n } n for (int i = (int)pos.size() - 1; i >= 1; --i) { n int r = pos[i] - 1, l = pos[i - 1]; n while (s[r] == > and s[r - 1] == > ) { n ret[r] = c; n r--, c++; n } n while (s[l] == < and s[l + 1] == < ) { n ret[l + 1] = c; n l++, c++; n } n ret[l + 1] = c; n c++; n } n for (int i = pos[0] - 1; i >= 0; --i) { n ret[i] = c; n c++; n } n return ret; n } n vi find_max() { n vi ret(n); n vector rng; n int ant = 0; n for (int i = 0; i < (int)s.size(); ++i) { n if (s[i] == < ) { n rng.emplace_back(ant, i); n ant = i + 1; n } n } n rng.emplace_back(ant, n - 1); n int c = 1; n for (auto i : rng) { n ret[i.second] = c; n c++; n } n for (auto i : rng) { n for (int k = i.second - 1; k >= i.first; --k) { n ret[k] = c; n c++; n } n } n return ret; n } n int main() { n cin >> t; n while (t--) { n cin >> n >> s; n vi mn = find_min(); n vi mx = find_max(); n for (int i = 0; i < n; ++i) { n if (i != 0) cout << ; n cout << mn[i]; n } n cout << n ; n for (int i = 0; i < n; ++i) { n if (i != 0) cout << ; n cout << mx[i]; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e5 + 5; n const int inf = 2e9 + 9; n int n, m, p; n pair a[maxn], b[maxn]; n pair, int> mon[maxn]; n struct segment_tree { n int val[maxn * 4], lazy[maxn * 4]; n void build(int x, int l, int r) { n if (l == r) { n val[x] = -b[l].second; n return; n } n int mid = (l + r) / 2; n build(x * 2, l, mid); n build(x * 2 + 1, mid + 1, r); n val[x] = max(val[x * 2], val[x * 2 + 1]); n } n void push(int x) { n if (lazy[x] == 0) return; n int t = lazy[x]; n val[x * 2] += t; n lazy[x * 2] += t; n val[x * 2 + 1] += t; n lazy[x * 2 + 1] += t; n lazy[x] = 0; n } n void upd(int x, int l, int r, int L, int R, int k) { n if (L > r || l > R || L > R) return; n if (l >= L && r <= R) { n val[x] += k; n lazy[x] += k; n return; n } n push(x); n int mid = (l + r) / 2; n upd(x * 2, l, mid, L, R, k); n upd(x * 2 + 1, mid + 1, r, L, R, k); n val[x] = max(val[x * 2], val[x * 2 + 1]); n } n int get() { return val[1]; } n } tree; n void read_input() { n cin >> n >> m >> p; n for (int i = 1; i <= n; ++i) cin >> a[i].first >> a[i].second; n for (int i = 1; i <= m; ++i) cin >> b[i].first >> b[i].second; n for (int i = 1; i <= p; ++i) { n int x, y, z; n cin >> x >> y >> z; n mon[i] = make_pair(pair(x, y), z); n } n } n void init() { n sort(a + 1, a + n + 1); n sort(b + 1, b + m + 1); n sort(mon + 1, mon + p + 1); n tree.build(1, 1, m); n } n void solve() { n int cur = 1; n int ans = -inf; n for (int i = 1; i <= n; ++i) { n int ap = a[i].first; n while (cur <= p && mon[cur].first.first < ap) { n int p = upper_bound(b + 1, b + m + 1, n pair(mon[cur].first.second, inf)) - n b; n tree.upd(1, 1, m, p, m, mon[cur].second); n ++cur; n } n ans = max(ans, -a[i].second + tree.get()); n } n cout << ans << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n read_input(); n init(); n solve(); n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:1024000000,1024000000 ) n using namespace std; n int main() { n cin.tie(0); n ios::sync_with_stdio(false); n int n, w; n cin >> w >> n; n if (w <= 3) { n cout << YES << endl; n return 0; n } n while (n > 0) { n if (n % w > 1 && n % w < w - 1) { n cout << NO << endl; n return 0; n } n n = (n + 1) / w; n } n cout << YES << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int Read() { n char c = getchar(); n while (c < 0 || c > 9 ) c = getchar(); n int t = c - 0 ; n c = getchar(); n while (c >= 0 && c <= 9 ) t = (t << 3) + (t << 1) + c - 0 , c = getchar(); n return t; n } n int n, Q, s; n int Head[900001], To[3200001], Next[3200001], t1; n int W[3200001]; n void add(int a, int b, int c) { n t1++; n Next[t1] = Head[a]; n Head[a] = t1; n To[t1] = b; n W[t1] = c; n } n void Build(int bh, int x, int y) { n if (x == y) { n add(bh, n * 8 + x, 0), add(n * 8 + x, bh, 0); n add(n * 4 + bh, n * 8 + x, 0), add(n * 8 + x, n * 4 + bh, 0); n return; n } n add(bh, bh * 2, 0), add(bh, bh * 2 + 1, 0); n add(n * 4 + bh * 2, n * 4 + bh, 0), add(n * 4 + bh * 2 + 1, n * 4 + bh, 0); n int mid = (x + y) / 2; n Build(bh * 2, x, mid); n Build(bh * 2 + 1, mid + 1, y); n } n void add(int bh, int x, int y, int a, int b, int c, bool t, int u) { n if (x == a && y == b) { n if (!t) n add(n * 8 + u, bh, c); n else n add(n * 4 + bh, n * 8 + u, c); n return; n } n int mid = (x + y) / 2; n if (b <= mid) n add(bh * 2, x, mid, a, b, c, t, u); n else if (a > mid) n add(bh * 2 + 1, mid + 1, y, a, b, c, t, u); n else n add(bh * 2, x, mid, a, mid, c, t, u), n add(bh * 2 + 1, mid + 1, y, mid + 1, b, c, t, u); n } n struct Node { n int id; n long long d; n bool operator<(const Node& a) const { return a.d < d; } n } t; n priority_queue q; n bool vis[900001]; n long long dis[900001]; n void Dij() { n for (int i = 1; i <= n * 9; i++) dis[i] = 1e18; n dis[n * 8 + s] = 0; n t.id = n * 8 + s; n t.d = 0; n q.push(t); n while (!q.empty()) { n while (!q.empty() && vis[q.top().id]) q.pop(); n if (q.empty()) break; n int curr = q.top().id; n q.pop(); n vis[curr] = 1; n for (int i = Head[curr]; i; i = Next[i]) { n if (!vis[To[i]]) { n if (dis[To[i]] > dis[curr] + W[i]) { n dis[To[i]] = dis[curr] + W[i]; n t.id = To[i]; n t.d = dis[To[i]]; n q.push(t); n } n } n } n } n } n int main() { n n = Read(); n Q = Read(); n s = Read(); n Build(1, 1, n); n for (int i = 1, t, u, v, w, l, r; i <= Q; i++) { n t = Read(); n if (t == 1) { n u = Read(); n v = Read(); n w = Read(); n add(n * 8 + u, n * 8 + v, w); n } else if (t == 2) { n u = Read(); n l = Read(); n r = Read(); n w = Read(); n add(1, 1, n, l, r, w, 0, u); n } else { n u = Read(); n l = Read(); n r = Read(); n w = Read(); n add(1, 1, n, l, r, w, 1, u); n } n } n Dij(); n for (int i = n * 8 + 1; i <= n * 8 + n; i++) { n if (!vis[i]) n printf( -1 ); n else n printf( %lld , dis[i]); n } n return 0; n } n "} +{"func_code_string": "#include n const int INF = (int)1e9 + 7; n int f(const std::vector &arr, int k, int d) { n std::list> events, se; n for (auto &it : arr) { n events.push_back({it - d, 0}); n se.push_back({it + d, 1}); n } n events.merge(se); n int bal = 0; n for (auto it : events) { n bal += (it.second ? -1 : +1); n if (bal > k) { n return it.first; n } n } n return -INF; n } n int main() { n std::ios_base::sync_with_stdio(false); n std::cin.tie(0); n int t; n std::cin >> t; n while (t--) { n int n, k; n std::cin >> n >> k; n std::vector arr(n); n for (auto &it : arr) { n std::cin >> it; n } n std::sort((arr).begin(), (arr).end()); n int low = -1, high = (int)1e9; n while (high - low > 1) { n int mid = (low + high) / 2; n if (f(arr, k, mid) > -INF) { n high = mid; n } else { n low = mid; n } n } n std::cout << f(arr, k, high) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n char a[n][m]; n int num = 0; n int mn[m]; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n cin >> a[i][j]; n } n } n for (int i = 0; i < m; i++) { n num = 0; n for (int j = 0; j < n; j++) { n num = max(num, a[j][i] - 0 ); n } n mn[i] = num; n } n int c = 0, ans = 0; n for (int i = 0; i < n; i++) { n c = 0; n for (int j = 0; j < m; j++) { n if (mn[j] == a[i][j] - 0 ) { n c = 3; n } n } n if (c == 3) { n ans++; n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 105; n char arr[N], dp[N][N * N], ndp[N][N * N]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int n; n cin >> n; n int sz = 0; n for (int i = 0; i < n; i++) { n int x; n cin >> x; n arr[x]++; n if (arr[x] == 1) sz++; n } n dp[0][0] = 1; n for (int i = 1; i < N; i++) { n for (int x1 = 0; x1 < N; x1++) n for (int x2 = 0; x2 < N * N; x2++) ndp[x1][x2] = 0; n for (int f = 0; f <= arr[i]; f++) n for (int x1 = 0; x1 < N; x1++) n for (int x2 = 0; x2 < N * N; x2++) n if (x2 + f * i < N * N && x1 + f < N) n ndp[x1 + f][x2 + f * i] = n min(100, ndp[x1 + f][x2 + f * i] + dp[x1][x2]); n for (int x1 = 0; x1 < N; x1++) n for (int x2 = 0; x2 < N * N; x2++) dp[x1][x2] = ndp[x1][x2]; n } n if (sz <= 2) { n cout << n << n ; n return 0; n } n int ans = 0; n for (int i = 1; i < N; i++) n for (int f = 1; f <= arr[i]; f++) n if (dp[f][f * i] == 1) ans = max(ans, f); n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n ifstream in( in.txt ); n bool needToDelete(char c) { n return tolower(c) == a || tolower(c) == o || tolower(c) == y || n tolower(c) == e || tolower(c) == u || tolower(c) == i ; n } n int main(int argc, char** argv) { n string s; n cin >> s; n string ans; n for (int i = 0; i < s.size(); i++) { n if (!needToDelete(s[i])) { n ans += . ; n ans += tolower(s[i]); n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n long long MAX(long long x, long long y) { return (x > y) ? x : y; } n long long MIN(long long x, long long y) { return (x < y) ? x : y; } n const int MAXN = 123; n const int MAXNM = 223; n const int MAXK = 7; n const int inf = 0x3f3f3f3f; n using namespace std; n inline int Read() { n register int x = 0; n bool flag = false; n register char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) flag = true; n ch = getchar(); n } n if (flag) { n while ( 0 <= ch && ch <= 9 ) { n x = x * 10 - ch + 0 ; n ch = getchar(); n } n } else { n while ( 0 <= ch && ch <= 9 ) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n } n return x; n } n int N, M, K; n int cg(int x, int y) { return (x - 1) * M + y; } n pair split(int z) { n int y = (z - 1) % M + 1; n return make_pair((z - y) / M + 1, y); n } n int dirx[4] = {1, 0, -1, 0}; n int diry[4] = {0, 1, 0, -1}; n int trans(int z, int dir) { n pair p = split(z); n p = make_pair(p.first + dirx[dir], p.second + diry[dir]); n if (1 <= p.first && p.first <= N && 1 <= p.second && p.second <= M) n return cg(p.first, p.second); n else n return -1; n } n int a[MAXNM]; n int f[MAXNM][(1 << MAXK) - 1]; n vector > frm[MAXNM][(1 << MAXK) - 1]; n int ele[MAXK]; n queue q; n bool inq[MAXNM]; n void spfa(int s) { n while (!q.empty()) { n int hd = q.front(); n q.pop(); n inq[hd] = false; n for (int i = 0; i <= 3; i++) { n int v = trans(hd, i); n if (~v) { n if (f[v][s] > f[hd][s] + a[v]) { n f[v][s] = f[hd][s] + a[v]; n frm[v][s].clear(); n frm[v][s].push_back(make_pair(hd, s)); n if (!inq[v]) { n q.push(v); n inq[v] = true; n } n } n } n } n } n } n char mp[MAXN][MAXN]; n void print(int i, int s) { n pair p = split(i); n mp[p.first][p.second] = X ; n for (auto &v : frm[i][s]) print(v.first, v.second); n } n int main() { n memset(f, 0x3f, sizeof(f)); n N = Read(); n M = Read(); n K = Read(); n for (int i = 1; i <= N; i++) n for (int j = 1; j <= M; j++) mp[i][j] = . ; n for (int i = 1; i <= N * M; i++) a[i] = Read(); n for (int i = 0; i <= K - 1; i++) { n int x = Read(), y = Read(); n ele[i] = cg(x, y); n f[ele[i]][1 << i] = a[ele[i]]; n } n for (int s = 1; s <= (1 << K) - 1; s++) { n for (int ss = s & (s - 1); ss; ss = s & (ss - 1)) n for (int i = 1; i <= N * M; i++) n if (f[i][s] > f[i][ss] + f[i][s ^ ss] - a[i]) { n f[i][s] = f[i][ss] + f[i][s ^ ss] - a[i]; n frm[i][s].clear(); n frm[i][s].push_back(make_pair(i, ss)); n frm[i][s].push_back(make_pair(i, s ^ ss)); n } n for (int i = 1; i <= N * M; i++) n if (f[i][s] < inf) { n q.push(i); n inq[i] = true; n } n spfa(s); n } n int ans = inf, id; n for (int i = 1; i <= N * M; i++) n if (f[i][(1 << K) - 1] < ans) ans = f[id = i][(1 << K) - 1]; n printf( %d n , ans); n print(id, (1 << K) - 1); n for (int i = 1; i <= N; i++) printf( %s n , mp[i] + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector getPrimes(int n) { n vector sieve(n + 1, true); n sieve[0] = sieve[1] = false; n for (int i = 2; i * i <= n; i++) n if (sieve[i]) n for (int j = i * i; j <= n; j += i) sieve[j] = false; n vector primes; n for (int i = 2; i <= n; i++) n if (sieve[i]) primes.push_back(i); n return primes; n } n void storePrimes(int n, unordered_map &m, vector &primes) { n for (int p : primes) { n if (p * p > n) break; n while (n % p == 0) { n m[p]++; n n /= p; n } n if (n == 1) break; n } n if (n > 1) m[n]++; n } n void removePrimes(int n, unordered_map &m, vector &primes) { n for (int p : primes) { n if (p * p > n) break; n while (n % p == 0) { n m[p]--; n n /= p; n } n if (n == 1) break; n } n if (n > 1) m[n]--; n } n bool isAtleast(unordered_map &m1, unordered_map &m2) { n for (auto it = m2.begin(); it != m2.end(); it++) { n int num = it->first, freq = it->second; n if (m1.find(num) == m1.end() or m1[num] < freq) return false; n } n return true; n } n void printMap(unordered_map &m) { n for (auto it = m.begin(); it != m.end(); it++) n cout << it->first << : << it->second << n ; n } n long long int solve(int arr[], int n, int k) { n vector primes = getPrimes(1000003); n unordered_map mapK, currMap; n storePrimes(k, mapK, primes); n int i = 0, j = 0; n long long int count = 0; n while (j < n) { n storePrimes(arr[j], currMap, primes); n if (isAtleast(currMap, mapK)) { n while (i <= j and isAtleast(currMap, mapK)) { n count += (n - j); n removePrimes(arr[i], currMap, primes); n i++; n } n } n j++; n } n return count; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n, k; n cin >> n >> k; n int arr[n]; n for (int i = 0; i < n; i++) cin >> arr[i]; n long long int ans = solve(arr, n, k); n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, q, p, p1, maxi, a[1000000], idx; n stack t, t1, id; n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %d , &a[i]); n maxi = -1; n id.push(0); n t.push(200000); n t1.push(-1); n for (int i = 1; i < n; i++) { n p = 0; n q = 5; n while (q == 5) { n idx = id.top(); n p1 = t.top(); n p = t1.top() + 1; n if (a[idx] > a[i] && p <= p1) { n q = 6; n t1.top() = p; n if (p > maxi) maxi = p; n id.push(i); n t.push(p); n t1.push(-1); n } else if (p1 == 200000) { n q = 7; n id.push(i); n t.push(200000); n t1.push(-1); n } else { n id.pop(); n t.pop(); n t1.pop(); n } n } n } n printf( %d , maxi + 1); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( unroll-loops ) n using namespace std; n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int i, n, m; n cin >> n >> m; n vector a(n + m); n for (i = 0; i < n + m; i++) { n cin >> a[i]; n } n set tax, per; n for (i = 0; i < n + m; i++) { n int t; n cin >> t; n if (t == 0) { n per.insert(a[i]); n } else { n tax.insert(a[i]); n } n } n map ans; n for (auto cur : per) { n auto right = tax.upper_bound(cur); n auto left = --tax.upper_bound(cur); n if (left == tax.end()) { n ans[*right]++; n } else if (right == tax.end()) { n ans[*left]++; n } else { n int l = *left, r = *right; n if (cur - l <= r - cur) { n ans[l]++; n } else { n ans[r]++; n } n } n } n for (auto cur : tax) { n cout << ans[cur] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n auto fio = (ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)); n int32_t main() { n long long n; n cin >> n; n vector g(n); n for (long long& x : g) cin >> x; n vector> idx(8192); n for (long long i = 0; i < n; i++) idx[g[i]].push_back(i); n vector mn(8192, n); n mn[0] = -1; n for (long long i = 0; i <= 5000; i++) { n if (idx[i].empty()) continue; n for (long long j = 0; j < 8192; j++) { n if (mn[j] <= mn[i ^ j] || mn[i ^ j] >= idx[i].back()) continue; n auto it = upper_bound(idx[i].begin(), idx[i].end(), mn[i ^ j]); n if (it != idx[i].end() && *it < mn[j]) mn[j] = *it; n } n } n cout << 8192 - count(mn.begin(), mn.end(), n) << endl; n for (long long i = 0; i < 8192; i++) n if (mn[i] != n) cout << i << ; n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n struct _ { n _() { ios_base::sync_with_stdio(0); } n } _; n template n void PV(T a, T b) { n while (a != b) cout << *a++, cout << (a != b ? : n ); n } n template n inline bool chmin(T &a, T b) { n return a > b ? a = b, 1 : 0; n } n template n inline bool chmax(T &a, T b) { n return a < b ? a = b, 1 : 0; n } n const int inf = 0x3f3f3f3f; n const int mod = int(1e9) + 7; n const int N = 3 * 111111; n int n, q; n int d[N]; n int p[N]; n int v[N]; n void add(int first, int t) { n if (first == 0) return; n while (first <= n) { n v[first] += t; n first += first & (first ^ (first - 1)); n } n } n int sum(int first) { n int r = 0; n while (first > 0) { n r += v[first]; n first -= first & (first ^ (first - 1)); n } n return r; n } n int main() { n cin >> n; n p[0] = 0, p[n + 1] = n + 1; n for (int i = 1; i <= n; i++) cin >> d[i], p[d[i]] = i; n for (int i = 1; i <= n; i++) n if (p[d[i] - 1] > i) add(d[i], 1); n cin >> q; n while (q--) { n int op, l, r, t; n cin >> op >> l >> r; n if (op == 1) { n cout << sum(r) - sum(l) + 1 << endl; n } else { n if (d[l] > d[r]) { n t = p[d[r] - 1]; n if (l < t && t < r) add(d[r], 1); n t = p[d[r] + 1]; n if (l < t && t < r) add(d[r] + 1, -1); n t = p[d[l] + 1]; n if (l < t && t < r) add(d[l] + 1, 1); n t = p[d[l] - 1]; n if (l < t && t < r) add(d[l], -1); n if (d[l] == d[r] + 1) add(d[l], -1); n } else if (d[l] < d[r]) { n t = p[d[l] - 1]; n if (l < t && t < r) add(d[l], -1); n t = p[d[l] + 1]; n if (l < t && t < r) add(d[l] + 1, 1); n t = p[d[r] + 1]; n if (l < t && t < r) add(d[r] + 1, -1); n t = p[d[r] - 1]; n if (l < t && t < r) add(d[r], 1); n if (d[l] == d[r] - 1) add(d[r], 1); n } n swap(d[l], d[r]); n p[d[l]] = l, p[d[r]] = r; n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC target( popcnt ) n using namespace std; n mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count()); n const long long N = 2e5 + 100; n const long long mod = 1e9 + 7; n const long long big = 1e17; n long long t, n, h; n long long a[N]; n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n cin >> t; n while (t--) { n cin >> n >> h; n for (int i = 1; i <= n; i++) cin >> a[i]; n sort(a + 1, a + n + 1); n long long l = 1, r = 1e18, ans = h; n while (l <= r) { n long long m = (l + r) >> 1ll; n long long sum = 0, rtst = 0; n for (int i = 1; i <= n; i++) { n long long l = max(a[i] - 1ll, rtst), r = a[i] + m - 1; n sum = sum + (r - l); n rtst = r; n } n if (sum >= h) n r = m - 1ll, ans = m; n else n l = m + 1ll; n } n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int in(char &c) { return scanf( %c , &c); } n int in(char s[]) { return scanf( %s , s); } n int in(int &x) { return scanf( %d , &x); } n int in(long long &x) { return scanf( %lld , &x); } n int in(double &x) { return scanf( %lf , &x); } n int in(pair &p) { return scanf( %d%d , &p.first, &p.second); } n int in(pair &p) { n return scanf( %lld%lld , &p.first, &p.second); n } n int in(pair &p) { return scanf( %lf%lf , &p.first, &p.second); } n int in(long double &a) { return scanf( %Lf , &a); } n int in(int &x, long long &y) { return scanf( %d%lld , &x, &y); } n int in(long long &x, int &y) { return scanf( %lld%d , &x, &y); } n int in(int &x, int &y) { return scanf( %d%d , &x, &y); } n int in(long long &x, long long &y) { return scanf( %lld%lld , &x, &y); } n int in(int &n, char s[]) { return scanf( %d%d , &n, s); } n int in(char a[], char b[]) { return scanf( %s%s , a, b); } n int in(double &x, double &y) { return scanf( %lf%lf , &x, &y); } n int in(int &x, int &y, int &z) { return scanf( %d%d%d , &x, &y, &z); } n int in(long long &x, long long &y, long long &z) { n return scanf( %lld%lld%lld , &x, &y, &z); n } n int in(double &x, double &y, double &z) { n return scanf( %lf%lf%lf , &x, &y, &z); n } n int in(int &x, int &y, int &z, int &k) { n return scanf( %d%d%d%d , &x, &y, &z, &k); n } n int in(long long &x, long long &y, long long &z, long long &k) { n return scanf( %lld%lld%lld%lld , &x, &y, &z, &k); n } n int in(double &x, double &y, double &z, double &k) { n return scanf( %lf%lf%lf%lf , &x, &y, &z, &k); n } n const int N = 3e5 + 10, M = 1e3 + 10, mod = 1e9 + 7; n const double eps = 1e-6, Pi = acos(-1.0); n int a[N], b[N], L[N], R[N], s[N]; n vector vc[N]; n int check(int x, int y) { return (L[y] > R[x]); } n int query(int x, int p) { n x = max(0, x); n p = max(0, p); n int pos = upper_bound(vc[x].begin(), vc[x].end(), p) - vc[x].begin(); n return pos; n } n int main() { n int T, t; n in(T); n t = T; n while (T--) { n int n; n in(n); n for (int i = 1; i <= n; i++) { n in(a[i]); n b[i] = a[i]; n } n sort(b + 1, b + 1 + n); n int m = unique(b + 1, b + 1 + n) - b; n for (int i = 1; i <= n; i++) n a[i] = lower_bound(b + 1, b + m, a[i]) - b, s[a[i]]++, n vc[a[i]].push_back(i); n for (int i = n; i >= 1; i--) L[a[i]] = i; n for (int i = 1; i <= n; i++) s[i] += s[i - 1], R[a[i]] = i; n m--; n int l, r, ans = 0; n l = r = 1; n L[m + 1] = L[m]; n R[m + 1] = R[m]; n for (int i = 1; i <= m; i++) { n while (r <= m && check(r, r + 1)) r++; n int t = query(l - 1, L[l]) + (int)vc[r + 1].size() - query(r + 1, R[r]); n ans = max(ans, s[r] - s[l - 1] + t); n if (l == r) { n for (int j = 0; j < vc[l].size(); j++) { n ans = max(ans, (int)vc[l].size() + query(l - 1, vc[l][j]) - j); n } n } n ans = max(ans, s[r] - s[l - 1] + query(l - 1, L[l])); n if (r == m) break; n l = r + 1; n r++; n } n printf( %d n , n - ans); n for (int i = 1; i <= n; i++) s[i] = 0, vc[i].clear(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, i, j, k = -1, c, d; n int main() { n scanf( %d%d , &n, &m); n for (i = 1; i <= m; i++) { n scanf( %d %d , &c, &d); n if (k == -1 || (d - c + 1) < k) { n k = d - c + 1; n } n } n printf( %d n , k); n c = 0; n for (i = 1; i <= n; i++) { n printf( %d , c); n c = (c + 1) % k; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long xa, ya, xb, yb, xc, yc; n cin >> xa >> ya >> xb >> yb >> xc >> yc; n long long s1 = (ya - yb) * (xa - xc); n long long s2 = (xa - xb) * (ya - yc); n if (s1 == s2) { n cout << TOWARDS ; n return 0; n } n if (s1 > s2) n cout << RIGHT ; n else n cout << LEFT ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n int big = 0, small = 1000000000; n int a[1000]; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] > big) { n big = a[i]; n } n if (a[i] < small) { n small = a[i]; n } n } n cout << big - small + 1 - n; n } n "} +{"func_code_string": "#include n using namespace std; n int a, ta, b, tb, hh, mm, res1, res2; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> a >> ta >> b >> tb; n char tmp; n cin >> hh >> tmp >> mm; n hh -= 5; n mm += hh * 60; n if (mm - tb >= 0) res1 = (mm - tb) / b + 1; n mm += ta; n mm = min(mm, (24 - 5) * 60); n mm--; n res2 = mm / b + 1; n cout << res2 - res1 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int maxl[300005][20], minl[300005][20]; n int vis[2 * 300005]; n int a[300005]; n int lmax[300005], lmin[300005], rmax[300005], rmin[300005]; n int min(int a, int b) { n if (a > b) return b; n return a; n } n int max(int a, int b) { n if (a > b) return a; n return b; n } n void S_table(int n) { n int l = int(log((double)n) / log(2.0)); n for (int j = 1; j <= l; j++) { n for (int i = 1; i + (1 << (j - 1)) - 1 <= n; ++i) { n maxl[i][j] = max(maxl[i][j - 1], maxl[i + (1 << (j - 1))][j - 1]); n minl[i][j] = min(minl[i][j - 1], minl[i + (1 << (j - 1))][j - 1]); n } n } n } n int w[300005]; n int rmq(int l, int r) { n int k = w[r - l + 1]; n int a1 = max(maxl[l][k], maxl[r - (1 << k) + 1][k]); n return a1; n } n void init(void) { n int i; n for (i = 1; i <= 300002; i++) { n int k = int(log((double)(i)) / log(2.0)); n w[i] = k; n } n } n int rmq1(int l, int r) { n int k = w[r - l + 1]; n int a2 = min(minl[l][k], minl[r - (1 << k) + 1][k]); n return a2; n } n struct pi { n int a, b; n } pp[300005]; n int cmp(pi a, pi b) { return a.a < b.a; } n long long dfs(int x, int y) { n if (x == y) return 1; n if (y - x == 1) { n if (abs(pp[y].b - pp[x].b) == 1) return 3; n return 2; n } n long long s = 0; n s = dfs(x, (x + y) / 2); n s += dfs((x + y) / 2 + 1, y); n int mid = (x + y) / 2; n int i; n lmin[mid + 1] = 1000000000; n lmax[mid + 1] = -1000000000; n for (i = mid; i >= x; i--) { n lmin[i] = min(lmin[i + 1], pp[i].b); n lmax[i] = max(lmax[i + 1], pp[i].b); n } n rmin[mid] = 1000000000; n rmax[mid] = -1000000000; n for (i = mid + 1; i <= y; i++) { n rmin[i] = min(rmin[i - 1], pp[i].b); n rmax[i] = max(rmax[i - 1], pp[i].b); n } n for (i = mid; i >= x; i--) { n int a, b; n a = lmax[i]; n b = lmin[i]; n if (a - b + 1 > mid - i + 1) { n int p = a - b + 1 - (mid - i + 1); n if (p <= y - mid) { n if (rmax[mid + p] < a && rmin[mid + p] > b) { n s++; n } n } n } n } n for (i = mid + 1; i <= y; i++) { n int a, b; n a = rmax[i]; n b = rmin[i]; n if (a - b + 1 > i - mid) { n int p = a - b + 1 - (i - mid); n if (p <= mid - x + 1) { n if (lmax[mid - p + 1] < a && lmin[mid - p + 1] > b) { n s++; n } n } n } n } n int ss, tt; n ss = mid + 1; n tt = mid + 1; n for (i = mid; i >= x; i--) { n int a = lmax[i]; n int b = lmin[i]; n while (tt <= y && rmin[tt] >= b) { n vis[rmax[tt] - tt + 300005]++; n tt++; n } n while (ss <= y && rmax[ss] < a) { n vis[rmax[ss] - ss + 300005]--; n ss++; n } n if (tt <= ss) continue; n int p = vis[lmin[i] - i + 300005]; n if (p > 0) s += p; n } n ss = mid; n tt = mid; n for (i = mid + 1; i <= y; i++) { n vis[rmax[i] - i + 300005] = 0; n } n for (i = mid + 1; i <= y; i++) { n int a = rmax[i]; n int b = rmin[i]; n while (tt >= x && lmin[tt] >= b) { n vis[lmax[tt] + tt]++; n tt--; n } n while (ss >= x && lmax[ss] < a) { n vis[lmax[ss] + ss]--; n ss--; n } n if (tt >= ss) continue; n int p = vis[rmin[i] + i]; n if (p > 0) s += p; n } n for (i = x; i <= mid; i++) { n vis[lmax[i] + i] = 0; n } n return s; n } n int main() { n int i, n; n init(); n cin >> n; n for (i = 1; i <= n; i++) { n int a, b; n scanf( %d%d , &a, &b); n pp[a].b = b; n } n for (i = 1; i <= n; i++) { n maxl[i][0] = pp[i].b; n minl[i][0] = pp[i].b; n } n S_table(n); n cout << dfs(1, n) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n cin >> n >> k; n string K; n cin >> K; n if (K.size() == 1 and k != 0) { n cout << 0; n return 0; n } n if (k == 0) { n cout << K; n return 0; n } n if (K[0] != 1 ) { n K[0] = 1 ; n k -= 1; n for (int i = 1; i < n; ++i) { n if (k == 0) { n cout << K; n return 0; n } n if (K[i] != 0 ) { n K[i] = 0 ; n k--; n } n } n } else { n for (int i = 1; i < n; ++i) { n if (k == 0) { n cout << K; n return 0; n } n if (K[i] != 0 ) { n K[i] = 0 ; n k--; n } n } n } n cout << K; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n int n, p, a[100000], sum = 0; n cin >> n >> p; n for (int i = 0; i < n; i++) { n cin >> a[i]; n sum += a[i]; n sum %= p; n } n sum = (sum + p - (a[0] % p)) % p; n int cur = a[0] % p, ans = cur + sum; n for (int i = 1; i < n - 1; ++i) { n cur = (cur + a[i]) % p, sum = (sum + p - (a[i] % p)) % p; n ans = max(ans, cur + sum); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int r, c, i, j, flag = 0; n cin >> r >> c; n char a1[r][c]; n for (i = 0; i < r; i++) { n for (j = 0; j < c; j++) { n cin >> a1[i][j]; n } n } n for (i = 0; i < r; i++) { n for (j = 0; j < c; j++) { n if (a1[i][j] == . ) { n a1[i][j] = D ; n } n } n } n for (i = 0; i < r; i++) { n for (j = 0; j < c; j++) { n if (a1[i][j] == S ) { n if (i > 0) { n if (a1[i - 1][j] == W ) { n cout << No ; n return 0; n } n } n if (i < r - 1) { n if (a1[i + 1][j] == W ) { n cout << No ; n return 0; n } n } n if (j > 0) { n if (a1[i][j - 1] == W ) { n cout << No ; n return 0; n } n } n if (j < c - 1) { n if (a1[i][j + 1] == W ) { n cout << No ; n return 0; n } n } n } n } n } n cout << Yes << endl; n for (i = 0; i < r; i++) { n for (j = 0; j < c; j++) { n cout << a1[i][j]; n } n cout << endl; n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n long long w, m, k; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n cin >> w >> m >> k; n long long aa = 0; n int nc = 0; n while (aa < m) aa = aa * 10 + 9, ++nc; n long long m2 = m; n while (w) { n if ((aa - m + 1) <= w / k / nc) { n w = w - k * (aa - m + 1) * nc; n ++nc; n m = aa + 1; n aa = aa * 10 + 9; n } else { n m = m + w / k / nc; n break; n } n } n cout << m - m2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, x; n vector w; n vector v; n bool volt[1111]; n int main() { n ios_base::sync_with_stdio(false); n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> x; n v.push_back(x); n } n reverse(v.begin(), v.end()); n for (int i = 0; i < v.size(); i++) { n if (volt[v[i]] == false) { n w.push_back(v[i]); n volt[v[i]] = true; n } n } n reverse(w.begin(), w.end()); n cout << w.size() << endl; n for (int i = 0; i < w.size(); i++) { n cout << w[i] << ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2005; n int n, m; n int a[maxn]; n int cnt[maxn], vis[maxn]; n int ans2 = 0; n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n int ans1 = n / m; n int p = n % m; n for (int i = 1; i <= n; i++) { n if (a[i] > m) continue; n if (cnt[a[i]] >= ans1) continue; n cnt[a[i]]++; n vis[i] = 1; n } n for (int i = 1; i <= n; i++) { n if (vis[i]) continue; n int Ans1 = 1e9, Ans2 = 1e9; n for (int j = 1; j <= m; j++) { n if (cnt[j] < Ans2) Ans2 = cnt[j], Ans1 = j; n } n if (Ans2 == ans1) continue; n ans2++; n cnt[Ans1]++, a[i] = Ans1; n } n cout << ans1 << << ans2 << endl; n for (int i = 1; i <= n; i++) cout << a[i] << ; n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int i = 0, j = 0, cs = 0, in; n int n; n cin >> n; n vector v; n int sum = 0, s = 0; n for (int i = 1; i < n; i++) { n cout << ? << i << << n << n ; n int x; n cin >> x; n if (i > 1) { n v.push_back(sum - x - s); n s += v.back(); n } else n sum = x; n } n cout << ? << 1 << << n - 1 << n ; n int x; n cin >> x; n cout << ! ; n for (int i = 0; i < v.size(); i++) cout << v[i] << ; n cout << x - s << << sum - x << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e5; n int N, M, A[MAXN + 10], ans[MAXN + 10]; n int main() { n int i, j; n scanf( %d%d , &N, &M); n long long sum = 0; n for (i = 1; i <= M; i++) scanf( %d , &A[i]), sum += A[i]; n if (sum < N) return !printf( -1 ); n int last = 987654321; n for (i = M; i >= 1; i--) { n int t = min(N - A[i] + 1, last - 1); n if (t <= 0) return !printf( -1 ); n ans[i] = t; n last = t; n } n int start = 1; n for (i = 1; i <= M; i++) { n if (start >= ans[i]) break; n ans[i] = start; n start = A[i] + ans[i]; n } n for (i = 1; i <= M; i++) printf( %d , ans[i]); n } n "} +{"func_code_string": "#include n using namespace std; n int n; n double p[100008]; n struct Tprogram { n void open() { n freopen( 1.in , r , stdin); n freopen( 1.out , w , stdout); n } n void close() {} n void init() { n scanf( %d , &n); n for (int i = 0; i <= n; i++) scanf( %lf , &p[i]); n } n void work() { n double ans = 0; n for (int i = 0; i <= n >> 1; i++) n for (int j = (n >> 1) + 1; j <= n; j++) n ans = ((p[i] * (2 * j - n) + p[j] * (n - 2 * i)) / (2 * j - 2 * i) > ans n ? (p[i] * (2 * j - n) + p[j] * (n - 2 * i)) / (2 * j - 2 * i) n : ans); n printf( %.10lf n , ans); n } n } Program; n int main() { n Program.init(); n Program.work(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n int m; n cin >> n >> m; n vector zahlen(n); n for (int i = 0; i < n; i++) cin >> zahlen[i]; n for (int i = 0; i < m; i++) { n int l, r, x; n cin >> l >> r >> x; n l--; n x--; n r--; n int tr = zahlen[x]; n int count = 0; n for (int i = l; i <= r; i++) { n if (zahlen[i] < tr) count++; n } n if ((l + count) == x) n cout << Yes << endl; n else n cout << No << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ii = pair; n using vi = vector; n using vll = vector; n using vii = vector; n const ll MOD = 998244353; n const ll INF = 1e15 + 9; n const int MAXN = 1000006; n int n, m, a[MAXN], p[MAXN], b[MAXN]; n int rev[MAXN]; n vi pos[MAXN]; n vll sum[MAXN]; n ll dp[MAXN], negsum[MAXN]; n inline ll isum(int val, int R) { n int index = n lower_bound(pos[val].begin(), pos[val].end(), R) - pos[val].begin(); n return sum[val][index]; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n; n for (int i = 1; i <= n; ++i) { n cin >> a[i]; n } n for (int i = 1; i <= n; ++i) { n cin >> p[i]; n } n cin >> m; n for (int i = 1; i <= m; ++i) { n cin >> b[i]; n } n a[n + 1] = n + 1; n b[m + 1] = n + 1; n ++n, ++m; n for (int i = 0; i <= m; ++i) { n sum[2 * i + 1] = sum[2 * i] = vll(1); n } n for (int i = 0; i <= n; ++i) { n int bi = lower_bound(b, b + m, a[i]) - b; n a[i] = 2 * bi - (b[bi] != a[i]); n pos[a[i]].push_back(i); n ll prevsum = sum[a[i]].back(); n sum[a[i]].push_back(prevsum + max(p[i], 0)); n negsum[i + 1] = negsum[i] + min(p[i], 0); n } n for (int i = 1; i <= n; ++i) { n if (a[i] & 1) { n dp[i] = INF; n continue; n } n auto it = lower_bound(pos[a[i] - 2].begin(), pos[a[i] - 2].end(), i); n if (it == pos[a[i] - 2].begin()) { n dp[i] = INF; n continue; n } n --it; n dp[i] = dp[*it] + isum(a[i] - 1, i) + isum(a[i], i) + negsum[i] - n negsum[*it + 1]; n it = lower_bound(pos[a[i]].begin(), pos[a[i]].end(), i); n if (it != pos[a[i]].begin()) { n --it; n dp[i] = min(dp[i], dp[*it] + negsum[i + 1] - negsum[*it + 1]); n } n } n if (dp[n] >= INF / 2) { n cout << NO n ; n } else { n cout << YES n << dp[n] << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, a, b, ans; n vector v[100005]; n vector res; n long long cost(long long num) { n res.clear(); n long long sum = 0; n long long need = num - v[0].size(); n for (long long i = 1; i <= 100000; i++) { n for (long long j = 0; j < v[i].size(); j++) { n if (v[i].size() - j >= num) { n need--; n sum += v[i][j]; n } else n res.push_back(v[i][j]); n } n } n sort(res.begin(), res.end()); n for (long long i = 1; i <= need; i++) { n sum += res[i - 1]; n } n return sum; n } n int main() { n scanf( %lld , &n); n for (long long i = 1; i <= n; i++) { n scanf( %lld%lld , &a, &b); n v[a].push_back(b); n } n for (long long i = 1; i <= 100000; i++) sort(v[i].begin(), v[i].end()); n long long l = v[0].size(), r = n, m1, m2; n ans = min(cost(l), cost(r)); n while (l + 2 < r) { n m1 = l + (r - l) / 3; n m2 = r - (r - l) / 3; n long long a1 = cost(m1); n long long a2 = cost(m2); n if (a1 > a2) n l = m1, ans = min(ans, a2); n else n r = m2, ans = min(ans, a1); n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void print(Container& container) { n auto Start = container.begin(), End = container.end(); n while (Start != End) cout << *(Start++) << ; n cout << n ; n } n const int N = 5e2 + 1; n int dp[2][N][N], a[N]; n inline void solve() { n int n, m, b, mod; n cin >> n >> m >> b >> mod; n for (int i = 1; i <= n; ++i) cin >> a[i]; n dp[0][0][0] = 1; n for (int i = 1; i <= n; ++i) { n for (int j = 0; j <= m; ++j) { n for (int k = 0; k <= b; ++k) { n dp[i & 1][j][k] = dp[i & 1 ^ 1][j][k]; n if (j && k >= a[i]) dp[i & 1][j][k] += dp[i & 1][j - 1][k - a[i]]; n dp[i & 1][j][k] %= mod; n } n } n } n int ans = 0; n for (int k = 0; k <= b; ++k) ans = (ans + dp[n & 1][m][k]) % mod; n cout << ans << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n int T = 1; n while (T--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s1, s2; n getline(cin, s1); n getline(cin, s2); n sort(s1.begin(), s1.end()); n sort(s2.begin(), s2.end()); n int j(0); n for (int i = 0; i < s1.size(); i++) { n while (s2[j] == ) j++; n while (s1[i] == ) i++; n if (s1[i] == s2[j]) j++; n if (j == s2.size()) { n cout << YES ; n return 0; n } n } n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n long long n; n cin >> n; n vector list; n int maxx, ma; n for (int i = 0; i < n; i++) { n int u; n cin >> u; n list.push_back(u); n } n int u1, u2, u3; n int flag; n for (int i = 1; i < n - 1; i++) { n flag = 0; n for (int j = 0; j < i; j++) { n if (list[i] > list[j]) { n flag = 1; n u1 = j; n break; n } n } n for (int j = i + 1; j < n; j++) { n if (list[i] > list[j]) { n if (flag == 1) { n flag = 2; n u2 = j; n break; n } else { n break; n } n } n } n if (flag == 2) { n u3 = i; n break; n } n } n if (flag == 2) { n cout << YES << endl; n cout << u1 + 1 << << u3 + 1 << << u2 + 1 << endl; n } else { n cout << NO << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a1[1000007], b1[1000007]; n int main() { n long long n, i, j, k = 0; n cin >> n; n for (i = 0; i < n; i++) { n string st; n cin >> st; n long long si = st.size(), c1 = 0, c2 = 0; n for (j = 0; j < si; j++) { n if (st[j] == ( ) { n c1++; n } n if (st[j] == ) ) { n if (c1 > 0) { n c1--; n } else { n c2++; n } n } n } n if (c1 == 0 && c2 == 0) n k++; n else if (c2 == 0) n a1[c1]++; n else if (c1 == 0) n b1[c2]++; n } n long long ans = 0; n ans = ans + (k / 2); n for (i = 0; i <= 1000007; i++) { n ans = ans + min(a1[i], b1[i]); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int DEBUG = 0; n bool isss(vector s1, vector s2) { n int si1, si2; n si1 = s1.size(); n si2 = s2.size(); n for (int i = 0; i < si1; i++) { n bool ttt = false; n for (int j = 0; j < si2; j++) { n if (s1[i] == s2[j]) { n ttt = true; n } n } n if (!ttt) return false; n } n return true; n } n int main(int argc, char **argv) { n DEBUG = (argc >= 2) ? atoi(argv[1]) : 0; n int n; n cin >> n; n int m[n]; n vector a[n]; n for (int i = 0; i < n; i++) { n cin >> m[i]; n for (int j = 0; j < m[i]; j++) { n int tmp; n cin >> tmp; n a[i].push_back(tmp); n } n } n bool isp[n]; n for (int i = 0; i < n; i++) isp[i] = true; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n if (i != j) { n if (isss(a[i], a[j])) { n isp[j] = false; n } n } n } n } n for (int i = 0; i < n; i++) n if (isp[i]) n cout << YES << endl; n else n cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int arr[3][3]; n for (int i = 0; i < 3; i++) { n for (int j = 0; j < 3; j++) cin >> arr[i][j]; n } n bool chk[3][3]; n for (int i = 0; i < 3; i++) { n for (int j = 0; j < 3; j++) chk[i][j] = 1; n } n for (int i = 0; i < 3; i++) { n for (int j = 0; j < 3; j++) { n if (arr[i][j] % 2 == 0) n continue; n else { n if (chk[i][j] == 1) n chk[i][j] = 0; n else n chk[i][j] = 1; n if (j + 1 <= 2) { n if (chk[i][j + 1] == 1) n chk[i][j + 1] = 0; n else n chk[i][j + 1] = 1; n } n if (j - 1 >= 0) { n if (chk[i][j - 1] == 1) n chk[i][j - 1] = 0; n else n chk[i][j - 1] = 1; n } n if (i + 1 <= 2) { n if (chk[i + 1][j] == 1) n chk[i + 1][j] = 0; n else n chk[i + 1][j] = 1; n } n if (i - 1 >= 0) { n if (chk[i - 1][j] == 1) n chk[i - 1][j] = 0; n else n chk[i - 1][j] = 1; n } n } n } n } n for (int i = 0; i < 3; i++) { n for (int j = 0; j < 3; j++) { n cout << chk[i][j]; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MAXN = (long long)1e5 + 10; n vector G[MAXN]; n pair p; n vector v; n long long n, x, y, k, ans, sum, flag; n string s; n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n cin >> x >> y; n v.push_back(x); n v.push_back(y); n } n cin >> k; n long long i = 0; n while (!flag) { n if (v[i] < k) { n i++; n } else { n flag = 1; n i--; n } n } n cout << n - (i + 1) / 2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, i, j, k; n cin >> n; n vector v; n vector > v1; n for (i = 0; i < n; i++) { n string s; n cin >> s; n v.push_back(s); n v1.push_back(make_pair(s.length(), s)); n } n sort(v1.begin(), v1.end()); n int flag = 1; n for (i = n - 1; i >= 0; i--) { n pair temp = v1[i]; n string s = temp.second; n for (j = 0; j < i; j++) { n pair temp1 = v1[j]; n string s1 = temp1.second; n if (s.length() != s1.length()) { n if (s.find(s1) != std::string::npos) n continue; n else { n flag = 0; n break; n } n } else { n if (s != s1) { n flag = 0; n break; n } n } n } n if (flag == 0) break; n } n if (flag == 0) n cout << NO n ; n else { n cout << YES n ; n for (i = 0; i < n; i++) cout << v1[i].second << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 50 + 10; n int a[maxn][maxn]; n int dx[10] = {0, 2, 1, 0, -1, -2}; n int dy[10] = {2, 0, 1, -2, -1, 0}; n int sx, sy; n struct Node { n int x, y; n }; n int main() { n int n; n scanf( %d , &n); n memset(a, -1, sizeof(a)); n a[1][1] = 1; n a[n][n] = 0; n queue q; n q.push((Node){1, 1}); n while (!q.empty()) { n Node tmp = q.front(); n q.pop(); n int x = tmp.x, y = tmp.y; n for (int i = 0; i < 3; i++) { n int tx = x + dx[i], ty = y + dy[i]; n if (tx < 1 || ty < 1 || tx > n || ty > n) continue; n if (a[tx][ty] != -1) continue; n cout << ? << << x << << y << << tx << << ty << n ; n cout.flush(); n int t; n cin >> t; n a[tx][ty] = t ? a[x][y] : a[x][y] ^ 1; n q.push((Node){tx, ty}); n } n } n for (int i = 1; i <= n; i++) { n if (i + 2 > n) break; n for (int j = 1; j <= n; j++) { n if (j + 2 > n) break; n if (a[i][j] == 1 && a[i + 2][j + 2] == 0) { n sx = i, sy = j; n break; n } n } n } n int tmp; n cout << ? << << sx << << sy + 1 << << sx + 1 << << sy + 2 n << n ; n cout.flush(); n cin >> tmp; n if (tmp) { n cout << ? << << sx << << sy << << sx + 1 << << sy + 2 n << n ; n cout.flush(); n cin >> tmp; n if (tmp) { n a[sx][sy + 1] = a[sx + 1][sy + 2] = 1; n } else { n if (a[sx][sy + 2] == 1) { n a[sx][sy + 1] = a[sx + 1][sy + 2] = 0; n } else { n cout << ? << << sx << << sy + 1 << << sx + 2 << n << sy + 2 << n ; n cout.flush(); n cin >> tmp; n if (tmp) { n a[sx][sy + 1] = a[sx + 1][sy + 2] = 0; n } else { n a[sx][sy + 1] = a[sx + 1][sy + 2] = 1; n } n } n } n } else { n cout << ? << << sx << << sy << << sx + 1 << << sy + 2 n << n ; n cout.flush(); n cin >> tmp; n if (tmp) { n a[sx][sy + 1] = 0; n a[sx + 1][sy + 2] = 1; n } else { n cout << ? << << sx << << sy + 1 << << sx + 2 << n << sy + 2 << n ; n cout.flush(); n cin >> tmp; n if (tmp) { n a[sx][sy + 1] = 0; n a[sx + 1][sy + 2] = 1; n } else { n a[sx][sy + 1] = 1; n a[sx + 1][sy + 2] = 0; n } n } n } n q.push((Node){sx, sy + 1}); n while (!q.empty()) { n Node tmp = q.front(); n q.pop(); n int x = tmp.x, y = tmp.y; n for (int i = 0; i < 6; i++) { n int tx = x + dx[i], ty = y + dy[i]; n if (tx < 1 || ty < 1 || tx > n || ty > n) continue; n if (a[tx][ty] != -1) continue; n if (i < 3) n cout << ? << << x << << y << << tx << << ty << n ; n else n cout << ? << << tx << << ty << << x << << y << n ; n cout.flush(); n int t; n cin >> t; n a[tx][ty] = t ? a[x][y] : a[x][y] ^ 1; n q.push((Node){tx, ty}); n } n } n cout << ! << n ; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n cout << a[i][j]; n } n cout << n ; n } n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, i, sum = 0, x, count = 0; n cin >> n; n long long int a[n]; n for (i = 0; i < n; i++) { n cin >> a[i]; n sum = sum + a[i]; n } n sort(a, a + n); n if (sum % 2 == 0) { n cout << sum; n return 0; n } else { n for (i = 0; i < n; i++) { n x = sum - a[i]; n if (x % 2 == 0) { n cout << x; n return 0; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n bool m(int i, int j) { return (i % 10) > (j % 10); } n int main() { n int x, y; n cin >> y >> x; n vector vi; n int i = 0, j = 0; n int k = 0; n for (i = 0; i < y; i++) { n cin >> j; n k += (j % 10); n vi.push_back(j); n } n sort(vi.begin(), vi.begin() + y, m); n for (i = 0; i < y && x > 0; i++) { n k = (10 - (vi[i] % 10)); n if (x >= k && (vi[i] + k) <= 100) { n x -= k; n vi[i] += k; n } n } n for (i = 0; i < y && x > 0; i++) { n while ((vi[i] < 100) && (x >= 10)) { n vi[i] += 10; n x -= 10; n } n } n k = 0; n for (i = 0; i < y; i++) k += vi[i] / 10; n cout << k << ; n return EXIT_SUCCESS; n } n "} +{"func_code_string": "#include n using namespace std; n const int T = 1 << 19; n struct nod { n int best = 0, best2 = 0; n int pref0 = 0, pref1 = 0, suf0 = 0, suf1 = 0; n int pref01 = 0, pref10 = 0, suf01 = 0, suf10 = 0; n int cnt0 = 0, cnt1 = 0; n }; n void umax(int &a, int b) { a = max(a, b); } n nod merge(nod a, nod b) { n nod c; n c.cnt0 = a.cnt0 + b.cnt0; n c.cnt1 = a.cnt1 + b.cnt1; n c.best = max({a.best, b.best, a.suf01 + b.pref1, a.suf0 + b.pref01}); n c.best2 = max({a.best2, b.best2, a.suf10 + b.pref0, a.suf1 + b.pref10}); n c.suf0 = (b.cnt1 == 0 ? b.suf0 + a.suf0 : b.suf0); n c.suf1 = (b.cnt0 == 0 ? b.suf1 + a.suf1 : b.suf1); n c.pref0 = (a.cnt1 == 0 ? a.pref0 + b.pref0 : a.pref0); n c.pref1 = (a.cnt0 == 0 ? a.pref1 + b.pref1 : a.pref1); n c.pref01 = (a.cnt1 == 0 ? a.cnt0 + b.pref01 : a.pref01); n if (a.pref01 == a.cnt0 + a.cnt1) umax(c.pref01, a.pref01 + b.pref1); n umax(c.pref01, max(c.pref0, c.pref1)); n c.pref10 = (a.cnt0 == 0 ? a.cnt1 + b.pref10 : a.pref10); n if (a.pref10 == a.cnt0 + a.cnt1) umax(c.pref10, a.pref10 + b.pref0); n umax(c.pref10, max(c.pref0, c.pref1)); n c.suf01 = (b.cnt0 == 0 ? b.cnt1 + a.suf01 : b.suf01); n if (b.suf01 == b.cnt0 + b.cnt1) umax(c.suf01, b.suf01 + a.suf0); n umax(c.suf01, max(c.suf0, c.suf1)); n c.suf10 = (b.cnt1 == 0 ? b.cnt0 + a.suf10 : b.suf10); n if (b.suf10 == b.cnt0 + b.cnt1) umax(c.suf10, b.suf10 + a.suf1); n umax(c.suf10, max(c.suf0, c.suf1)); n return c; n } n nod t[T + T]; n bool tag[T + T]; n int n, m; n char s[T]; n void odwroc(int v) { n swap(t[v].best, t[v].best2); n swap(t[v].cnt0, t[v].cnt1); n swap(t[v].pref01, t[v].pref10); n swap(t[v].suf01, t[v].suf10); n swap(t[v].pref0, t[v].pref1); n swap(t[v].suf0, t[v].suf1); n } n void push(int v) { n if (!tag[v]) return; n for (auto u : {2 * v, 2 * v + 1}) { n tag[u] ^= 1; n odwroc(u); n } n tag[v] = 0; n } n void invert(int x, int y, int v = 1, int l = 0, int r = T - 1) { n if (x <= l && r <= y) { n tag[v] ^= 1; n odwroc(v); n return; n } n push(v); n int m = (l + r) / 2; n if (x <= m) invert(x, y, 2 * v, l, m); n if (m < y) invert(x, y, 2 * v + 1, m + 1, r); n t[v] = merge(t[2 * v], t[2 * v + 1]); n } n nod query(int x, int y, int v = 1, int l = 0, int r = T - 1) { n if (x <= l && r <= y) { n return t[v]; n } n push(v); n nod res; n int m = (l + r) / 2; n if (x <= m) res = merge(res, query(x, y, 2 * v, l, m)); n if (m < y) res = merge(res, query(x, y, 2 * v + 1, m + 1, r)); n return res; n } n int main() { n scanf( %d%d , &n, &m); n scanf( %s , s + 1); n for (int i = 1; i <= n; ++i) { n int v = i + T; n t[v].best = 1; n if (s[i] == > ) n t[v].pref0 = t[v].suf0 = t[v].pref01 = t[v].pref10 = t[v].suf01 = n t[v].suf10 = t[v].cnt0 = t[v].best2 = 1; n else n t[v].pref1 = t[v].suf1 = t[v].pref01 = t[v].pref10 = t[v].suf01 = n t[v].suf10 = t[v].cnt1 = t[v].best2 = 1; n } n for (int i = T - 1; 1 <= i; --i) t[i] = merge(t[2 * i], t[2 * i + 1]); n while (m--) { n int a, b; n scanf( %d%d , &a, &b); n invert(a, b); n printf( %d n , query(a, b).best); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n unsigned long long y = 0; n unsigned int x = 0; n int i; n string s; n cin >> s; n if (s.length() > 19) n printf( BigInteger n ); n else if (s.length() > 10) { n y = 0; n for (i = 0; i < s.length(); i++) { n if (y > 0) y *= 10; n y += s[i] - 0 ; n } n if (y > 9223372036854775807) n printf( BigInteger n ); n else n printf( long n ); n } else if (s.length() > 5) { n y = 0; n for (i = 0; i < s.length(); i++) { n if (y > 0) y *= 10; n y += s[i] - 0 ; n } n if (y > 2147483647) n printf( long n ); n else n printf( int n ); n } else if (s.length() > 3) { n y = 0; n for (i = 0; i < s.length(); i++) { n if (y > 0) y *= 10; n y += s[i] - 0 ; n } n if (y > 32767) n printf( int n ); n else n printf( short n ); n } else if (s.length() > 0) { n y = 0; n for (i = 0; i < s.length(); i++) { n if (y > 0) y *= 10; n y += s[i] - 0 ; n } n if (y > 127) n printf( short n ); n else n printf( byte n ); n } else n printf( byte n ); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, a, sum = 0, p = 0, res = 0; n map m; n cin >> n; n m[0] = 1; n for (long long i = 1; i <= n; i++) { n cin >> a; n sum += a; n p = max(p, m[sum]); n res += i - p; n m[sum] = i + 1; n } n cout << res; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 3e5 + 5; n int lo[N]; n int n, r[N], lb[N], rb[N], i, j, k; n struct ST { n pair f[20][N]; n function(pair, pair)> uni; n void ini(int* a) { n for (int i = 1; i <= n * 3; ++i) f[0][i] = {a[i], i}; n for (int i = 1; (1 << i) <= n * 3; ++i) n for (int j = 1; j + (1 << i) - 1 <= n * 3; ++j) n f[i][j] = uni(f[i - 1][j], f[i - 1][j + (1 << i - 1)]); n } n inline pair ask(int x, int y) { n int l = lo[y - x + 1]; n return uni(f[l][x], f[l][y - (1 << l) + 1]); n } n } ss[2]; n int anc[2][20][N]; n inline int calc(int x, int y) { n int x1, y1, step = 0, x2, y2; n x1 = ss[0].ask(x, y).second; n y1 = ss[1].ask(x, y).second; n for (int i = 19; i >= 0; --i) { n x2 = anc[0][i][x1]; n y2 = anc[1][i][y1]; n if (rb[y2] - lb[x2] + 1 >= n || n (lb[x2] < x && ss[1].ask(lb[x2], x - 1).first > y) || n (y < rb[y2] && ss[0].ask(y + 1, rb[y2]).first < x)) n continue; n step += 1 << i; n x1 = x2; n y1 = y2; n } n x1 = lb[x1]; n y1 = rb[y1]; n ++step; n return y1 - x1 + 1 >= n ? step : calc(x1, y1) + step; n } n int main() { n for (i = 2; i < N; ++i) lo[i] = lo[i >> 1] + 1; n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n; n for (i = 1; i <= n; ++i) cin >> r[i], r[i + n] = r[i + n * 2] = r[i]; n for (i = 1; i <= n * 3; ++i) n lb[i] = max(1, i - r[i]), rb[i] = min(n * 3, i + r[i]); n ss[0].uni = [&](pair a, pair b) { return min(a, b); }; n ss[1].uni = [&](pair a, pair b) { return max(a, b); }; n ss[0].ini(lb); n ss[1].ini(rb); n for (i = 1; i <= n * 3; ++i) n anc[0][0][i] = ss[0].ask(lb[i], rb[i]).second, n anc[1][0][i] = ss[1].ask(lb[i], rb[i]).second; n for (k = 0; k < 2; ++k) n for (i = 1; i < 20; ++i) n for (j = 1; j <= n * 3; ++j) n anc[k][i][j] = anc[k][i - 1][anc[k][i - 1][j]]; n for (i = n + 1; i <= n * 2; ++i) cout << (n == 1 ? 0 : calc(i, i)) << ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void Fast() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n } n int gcd(int a, int b) { n if (b == 0) return a; n gcd(b, a % b); n } n int lcm(int a, int b) { return a * b / gcd(a, b); } n int main() { n Fast(); n string s; n cin >> s; n int cnt = 0; n while (s.size() >= 2) { n int n = 0; n for (int i = 0; i < s.length(); i++) n += s[i] - 0 ; n s = to_string(n); n cnt++; n } n cout << cnt; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } n const int inf = 0x7fffffff; n const int maxn = 505; n const long long mod = 1e9 + 7; n long long dp[maxn][maxn]; n int n; n int main() { n ios::sync_with_stdio(false); n cin >> n; n dp[1][1] = dp[1][0] = 1; n for (int i = 2; i <= n; i++) { n for (int j = 0; j <= n; j++) { n for (int k = 0; k + j <= n; k++) { n long long x = (dp[i - 1][j] * dp[i - 1][k]) % mod; n dp[i][k + j] += x * (2 * (k + j) + 1); n dp[i][k + j] %= mod; n dp[i][k + j + 1] = (dp[i][k + j + 1] + x) % mod; n dp[i][k + j - 1] += x * (k + j) * (k + j - 1); n dp[i][k + j - 1] %= mod; n } n } n } n cout << dp[n][1] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector primes; n int prime_marker[1000000]; n void PrecomputePrimes() { n const int MAX_PRIME = 1000000; n for (int i = 2; i * i < MAX_PRIME; ++i) { n for (int j = i; i * j < MAX_PRIME; ++j) { n prime_marker[i * j] = 1; n } n } n for (int i = 2; i < MAX_PRIME; ++i) { n if (prime_marker[i]) continue; n primes.push_back(i); n } n } n vector prime_factors; n vector factor_max_power; n void ComputePrimeFactors(int64_t val) { n for (int i = 0; i < primes.size(); ++i) { n if (val % primes[i] == 0) { n prime_factors.push_back(primes[i]); n factor_max_power.push_back(0); n while (val % primes[i] == 0) { n val /= primes[i]; n factor_max_power.back()++; n } n } n } n if (val > 1000000) { n prime_factors.push_back(val); n factor_max_power.push_back(1); n } n } n vector arr; n vector cofactor_power; n void ComputeCofactorPower(int64_t val) { n cofactor_power.resize(prime_factors.size()); n for (int i = 0; i < prime_factors.size(); ++i) { n cofactor_power[i] = 0; n if (val % prime_factors[i] == 0) { n while (val % prime_factors[i] == 0) { n val /= prime_factors[i]; n cofactor_power[i]++; n } n } n } n } n vector basis; n void InitializeBasis() { n basis.resize(prime_factors.size()); n basis[0] = 1; n for (int i = 1; i < prime_factors.size(); ++i) { n basis[i] = basis[i - 1] * (factor_max_power[i - 1] + 1); n } n } n void MapToIndices(int hash, vector* indices) { n for (int i = basis.size() - 1; i >= 0; --i) { n (*indices)[i] = hash / basis[i]; n hash -= (*indices)[i] * basis[i]; n } n } n int IndicesToHash(const vector& indices) { n int hash = 0; n for (int i = 0; i < indices.size(); ++i) { n hash += indices[i] * basis[i]; n } n return hash; n } n vector> hash_indices; n void InitHashIndices(int max_hash) { n hash_indices.resize(max_hash, vector(basis.size())); n for (int i = 0; i < max_hash; ++i) { n MapToIndices(i, &hash_indices[i]); n } n } n struct DpState { n int length = 100000; n int64_t cost = 0; n int parent; n bool is_chosen = false; n DpState(int length, int64_t cost, int parent, bool is_chosen) n : length(length), cost(cost), parent(parent), is_chosen(is_chosen) {} n DpState() {} n bool operator<(const DpState& other) const { n if (length == other.length) return cost < other.cost; n return length < other.length; n } n }; n DpState dp[1003][7000]; n void UpdateDP(int cur, int hash, const vector& indices) { n if (cur == 0) { n if (hash == 0) { n dp[cur][hash] = DpState{0, 0, -1, false}; n return; n } n bool is_divisible = true; n for (int i = 0; i < indices.size(); ++i) { n if (indices[i] > cofactor_power[i]) { n is_divisible = false; n break; n } n } n if (is_divisible) { n dp[cur][hash] = DpState{1, arr[cur], -1, true}; n } n return; n } n vector prev_indices(indices.size()); n for (int i = 0; i < indices.size(); ++i) { n prev_indices[i] = max(0, indices[i] - cofactor_power[i]); n } n int prev_hash = IndicesToHash(prev_indices); n DpState state1 = {dp[cur - 1][prev_hash].length + 1, n dp[cur - 1][prev_hash].cost + arr[cur], prev_hash, true}; n DpState state2 = {dp[cur - 1][hash].length, dp[cur - 1][hash].cost, hash, n false}; n if (state1 < state2) { n dp[cur][hash] = state1; n } else { n dp[cur][hash] = state2; n } n } n int main() { n int n; n int64_t k; n PrecomputePrimes(); n scanf( %d , &n); n cin >> k; n int64_t val; n for (int i = 0; i < n; ++i) { n cin >> val; n arr.push_back(val); n } n if (k == 1) { n int lowest_index = 0; n for (int i = 1; i < n; ++i) { n if (arr[i] < arr[lowest_index]) lowest_index = i; n } n printf( 1 n%d n , lowest_index + 1); n return 0; n } n ComputePrimeFactors(k); n InitializeBasis(); n int max_hash = basis.back() * (factor_max_power.back() + 1); n InitHashIndices(max_hash); n for (int i = 0; i < n; ++i) { n ComputeCofactorPower(arr[i]); n for (int hash = 0; hash < max_hash; ++hash) { n UpdateDP(i, hash, hash_indices[hash]); n } n } n int cur_hash = max_hash - 1; n if (dp[n - 1][cur_hash].length >= 100000) { n printf( -1 n ); n return 0; n } n printf( %d n , dp[n - 1][cur_hash].length); n for (int i = n - 1; i >= 0; --i) { n if (dp[i][cur_hash].is_chosen) { n printf( %d , i + 1); n } n cur_hash = dp[i][cur_hash].parent; n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long int n, i, d; n cin >> n; n long int a[n], b[n], c[1000000]; n for (i = 0; i < n; i++) { n cin >> a[i]; n } n for (i = 0; i < n; i++) { n cin >> b[i]; n c[b[i]] = i; n } n d = 0; n for (i = 1; i < n; i++) { n if (c[a[i]] < c[a[i - 1]]) { n d++; n c[a[i]] = c[a[i - 1]]; n } n } n cout << d; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector per, obs; n long long n, k, p; n bool check(long long t) { n long long i = 0; n for (long long j = 0; j <= obs.size() - 1; j++) { n if (abs(per[i] - obs[j]) + abs(p - obs[j]) <= t) { n i++; n if (i == n) return 1; n } n } n return 0; n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long t; n t = 1; n for (long long test = 1; test <= t; test++) { n cin >> n >> k >> p; n per.resize(n); n obs.resize(k); n for (long long i = 0; i <= n - 1; i++) cin >> per[i]; n for (long long i = 0; i <= k - 1; i++) cin >> obs[i]; n sort(per.begin(), per.end()); n sort(obs.begin(), obs.end()); n long long ans = 1e10, st = 0, end = 1e10; n while (st <= end) { n long long mid = (st + end) >> 1; n if (check(mid)) { n ans = min(ans, mid); n end = mid - 1; n } else n st = mid + 1; n } n cout << ans; n } n return 0; n } n "} +{"func_code_string": "#include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #define ll long long n #define ls id << 1 n #define rs id << 1 | 1 n #define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type)) n #define memarray(array, value) memset(array, value, sizeof(array)) n #define fillarray(array, value, begin, end) fill((array) + (begin), (array) + (end) + 1, value) n #define fillvector(v, value) fill((v).begin(), (v).end(), value) n #define pb(x) push_back(x) n #define st(x) (1LL << (x)) n #define pii pair n #define mp(a, b) make_pair((a), (b)) n #define Flush fflush(stdout) n #define vecfirst (*vec.begin()) n #define veclast (*vec.rbegin()) n #define vecall(v) (v).begin(), (v).end() n #define vecupsort(v) (sort((v).begin(), (v).end())) n #define vecdownsort(v, type) (sort(vecall(v), greater())) n #define veccmpsort(v, cmp) (sort(vecall(v), cmp)) n using namespace std; n const int N = 500050; n const int inf = 0x3f3f3f3f; n const ll llinf = 0x3f3f3f3f3f3f3f3f; n const int mod = 998244353; n const int MOD = 1e9 + 7; n const double PI = acos(-1.0); n clock_t TIME__START, TIME__END; n void program_end() n { n #ifdef ONLINE n printf( n nTime used: %.6lf(s) n , ((double)TIME__END - TIME__START) / 1000); n system( pause ); n #endif n } n int n; n int ask1(int x, int y) n { n printf( 1 %d %d n , x, y), Flush; n int ret; n scanf( %d , &ret); n return ret; n } n int ask2(int x, const vector &vec) n { n printf( 2 %d %d , x, (int)vec.size()); n for (auto i : vec) n printf( %d , i); n putchar( n ), Flush; n int ret; n scanf( %d , &ret); n return ret; n } n int ans[105][105]; n vector e; n n vector mergesort(int l, int r) n { n vector ret; n if (l == r) n { n ret.push_back(l); n return ret; n } n int mid = (l + r) >> 1; n auto vl = mergesort(l, mid); n auto vr = mergesort(mid + 1, r); n int i = 0, j = 0; n while (i < (int)vl.size() && j < (int)vr.size()) n { n int r = ask1(vl[i], vr[j]); n if (r == 1) n { n ret.push_back(vl[i]); n i++; n } n else n { n ret.push_back(vr[j]); n j++; n } n } n while (i < (int)vl.size()) n ret.push_back(vl[i]), i++; n while (j < (int)vr.size()) n ret.push_back(vr[j]), j++; n return ret; n } n n void work1() n { n e.clear(); n e = mergesort(0, n - 1); n for (int i = 0; i < (int)e.size(); ++i) n for (int j = i; j < (int)e.size(); ++j) n ans[e[i]][e[j]] = 1; n } n n inline void solve() n { n memarray(ans, 0); n scanf( %d , &n); n work1(); n int u = n - 1, p = n - 2; n #ifdef VINGYING n printf( Hamiton: ); n for (auto i : e) n cout << i << ; n putchar( n ); n #endif n while (u >= 0 && p >= 0) n { n vector v; n for (int i = 0; i <= p; ++i) n v.push_back(e[i]); n int r = ask2(e[u], v); n if (r == 1) n p--; n if (p < 0) n { n ans[e[u]][e[0]]=1; n break; n } n if (r == 0) n { n ans[e[u]][e[p+1]]=1; n u--; n if (p==u)p--; n if (p < 0) n { n ans[e[u]][e[0]]=1; n break; n } n } n } n for(int k=0;k n #pragma comment(linker, /STACK:16777216 ) n using namespace std; n template n inline void checkmin(T &a, T b) { n if (a > b) a = b; n } n template n inline void checkmax(T &a, T b) { n if (a < b) a = b; n } n const int oo = 1 << 30; n const double eps = 1e-7; n const int N = 512; n const int M = 1; n const long long P = 10000000097ll; n int sgn(double x) { return (x > eps) - (x < -eps); } n int fcmp(double a, double b) { return sgn(a - b); } n double sqr(double x) { return x * x; } n struct Point { n double x, y; n Point() {} n Point(double a, double b) : x(a), y(b) {} n Point operator+(const Point &p) const { return Point(x + p.x, y + p.y); } n Point operator-(const Point &p) const { return Point(x - p.x, y - p.y); } n Point operator*(double d) const { return Point(x * d, y * d); } n double operator*(const Point &p) const { return x * p.y - y * p.x; } n Point operator/(double d) const { return Point(x / d, y / d); } n double norm() const { return sqrt(x * x + y * y); } n Point rot(double alpha) const { n return Point(x * cos(alpha) - y * sin(alpha), n x * sin(alpha) + y * cos(alpha)); n } n void cin() { scanf( %lf %lf , &x, &y); } n void cout(char *s = p = ) const { printf( %s %f %f , s, x, y); } n }; n struct Line { n Point a, b; n Line() {} n Line(const Point &p, const Point &q) : a(p), b(q) {} n bool para(const Line &lin) const { n Point u, v; n u = b - a; n v = lin.b - lin.a; n return sgn(u * v) == 0; n } n bool l_to_s(const Line &seg) const { n return sgn((b - a) * (seg.a - a)) * sgn((b - a) * (seg.b - a)) < 0; n } n bool s_to_s(const Line &seg) const { n return l_to_s(seg) && seg.l_to_s(*this); n } n Point l_on_l(const Line &lin) const { n double s1, s2; n s1 = (lin.a - a) * (lin.b - a); n s2 = (lin.b - b) * (lin.a - b); n return (a * s2 + b * s1) / (s1 + s2); n } n int l_to_p(const Point &p) const { return sgn((b - a) * (p - a)); } n }; n Point ar[N][5]; n Point br[N][5]; n Point tmple[2][N]; n Point *x, *y; n double h, f; n int n; n double ans; n double area(Point *p, int pn) { n int i, j, k; n double ans = 0; n for (i = 1; i < pn; i++) ans += (p[i] - p[0]) * (p[i + 1] - p[0]); n if (pn < -11) { n for (i = 0; i < (pn); i++) printf( %.3f %.3f--> , p[i].x, p[i].y); n puts( ); n } n return ans; n } n void read() { n int i, j, k; n double a, b; n double fix, low; n ans = 0; n scanf( %d , &n); n scanf( %lf %lf , &h, &f); n fix = f / (f - h); n low = (f + h) / (f - h); n for (i = 0; i < (n); i++) { n scanf( %lf %lf , &a, &b); n ar[i][0] = Point(a * fix, 0); n ar[i][1] = Point(b * fix, 0); n ar[i][2] = Point(b, h); n ar[i][3] = Point(a, h); n ar[i][4] = ar[i][0]; n br[i][0] = Point(a * fix, 0); n br[i][1] = Point(b * fix, 0); n br[i][2] = Point(b * low, h); n br[i][3] = Point(a * low, h); n br[i][4] = br[i][0]; n ans += area(ar[i], 4) + area(br[i], 4); n } n } n void cut(Point *p) { n int xn, yn; n int i, j, k; n int ii, jj; n Line lin, seg; n for (i = 0; i < (n); i++) { n for (j = 0; j < (5); j++) x[j] = p[j]; n xn = 4; n for (j = 0; j < (4); j++) { n lin = Line(ar[i][j], ar[i][j + 1]); n yn = 0; n for (ii = 1; ii <= xn; ii++) { n seg = Line(x[ii - 1], x[ii]); n if (lin.l_to_s(seg)) y[yn++] = lin.l_on_l(seg); n if (lin.l_to_p(x[ii]) >= 0) y[yn++] = x[ii]; n } n y[yn] = y[0]; n swap(x, y); n swap(xn, yn); n } n ans -= area(x, xn); n } n } n void sub() { n int i, j, k; n x = tmple[0]; n y = tmple[1]; n for (i = 0; i < (n); i++) cut(br[i]); n } n int main() { n int T, _ = 0; n read(); n sub(); n printf( %.6f n , ans); n return 0; n } n "} +{"func_code_string": "#include n int n, c; n void p(int a) { n if (a <= n) { n c++; n p(a * 10); n p(a * 10 + 1); n } n } n int main() { n std::cin >> n; n p(1); n std::cout << c; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 200100; n const int M = 2 * N; n const long long MOD1 = 98764321261LL; n const long long MOD = 998244353LL; n inline int lowbit(int x) { return x & (-x); } n struct fenwick { n long long a[N]; n int n; n void init(int n) { n for (int i = 0; i <= n; ++i) a[i] = 0; n this->n = n; n } n void add(int x, long long v) { n for (int i = x; i <= n; i += lowbit(i)) a[i] += v; n } n long long query(int x) { n long long ret = 0; n for (int i = x; i; i ^= lowbit(i)) ret += a[i]; n return ret; n } n void rangeadd(int l, int r, long long v) { n add(l, v); n add(r + 1, -v); n } n long long rangequery(int l, int r) { n l = max(l, 1); n r = min(r, n); n if (r < l) return 0; n long long ret = query(r); n ret -= query(l - 1); n return ret; n } n }; n inline long long powmod(long long x, long long y, long long MOD) { n long long ret = 1; n while (y) { n if (y & 1LL) ret = ret * x % MOD; n x = x * x % MOD; n y = y >> 1; n } n return ret; n } n struct graph { n int head[N], next[M], to[M]; n int tot; n inline void init(int n) { n for (int i = 0; i <= n; ++i) head[i] = -1; n tot = 0; n } n inline void addedge(int x, int y) { n to[tot] = y; n next[tot] = head[x]; n head[x] = tot; n ++tot; n } n }; n struct point { n long long x, y; n point() {} n point(long long x, long long y) : x(x), y(y) {} n void read() { scanf( %lld%lld , &x, &y); } n point operator+(const point &rhs) const { n return point(x + rhs.x, y + rhs.y); n } n point operator-(const point &rhs) const { n return point(x - rhs.x, y - rhs.y); n } n long long operator^(const point &rhs) const { return x * rhs.y - y * rhs.x; } n bool operator<(const point &rhs) const { n if (y != rhs.y) return y < rhs.y; n return x < rhs.x; n } n }; n long long phi(long long x) { n long long res = x; n for (long long i = 2; i * i <= x; ++i) { n if (x % i == 0) { n res = res / i * (i - 1); n while (x % i == 0) x /= i; n } n } n if (x > 1) res = res / x * (x - 1); n return res; n } n int n, m; n int ans; n int a[N], b[N], deg[N]; n graph G; n void dfs(int x, int p) { n a[x] = 1; n b[x] = 0; n int chcnt = 0; n int maxa = -1; n int maxb = -1; n for (int i = G.head[x]; i != -1; i = G.next[i]) { n int y = G.to[i]; n if (y == p) continue; n dfs(y, x); n int temp; n if (maxa != -1) { n temp = a[maxa] + a[y] + deg[x] - 2; n ans = max(ans, temp); n temp = a[maxa] + b[y] + deg[x] - 2; n ans = max(ans, temp); n } n if (maxb != -1) { n temp = b[maxb] + b[y] + deg[x] - 2; n ans = max(ans, temp); n temp = b[maxb] + b[y] + 1; n ans = max(ans, temp); n temp = b[maxb] + a[y] + deg[x] - 2; n ans = max(ans, temp); n } n a[x] = max(a[x], b[y] + 1); n b[x] = max(b[x], a[y] + deg[x] - 1 - (p != 0)); n b[x] = max(b[x], b[y] + deg[x] - 1 - (p != 0)); n if (maxa == -1 || a[y] > a[maxa]) maxa = y; n if (maxb == -1 || b[y] > b[maxb]) maxb = y; n } n ans = max(ans, a[x]); n ans = max(ans, b[x] + (p != 0)); n } n int main() { n int cases = 1; n for (int iii = 1; iii <= cases; ++iii) { n scanf( %d , &n); n G.init(n); n for (int i = 1; i < n; ++i) { n int x, y; n scanf( %d%d , &x, &y); n G.addedge(x, y); n G.addedge(y, x); n ++deg[x]; n ++deg[y]; n } n ans = 0; n dfs(1, 0); n printf( %d n , ans); n } n } n "} +{"func_code_string": "#include n using namespace std; n void prt(long x) { cerr << x; } n void prt(long long x) { cerr << x; } n void prt(unsigned x) { cerr << x; } n void prt(unsigned long x) { cerr << x; } n void prt(unsigned long long x) { cerr << x; } n void prt(float x) { cerr << x; } n void prt(double x) { cerr << x; } n void prt(long double x) { cerr << x; } n void prt(char x) { cerr << << x << ; } n void prt(const char *x) { cerr << << x << ; } n void prt(const string &x) { cerr << << x << ; } n void prt(bool x) { cerr << (x ? true : false ); } n template n void prt(const pair &x) { n cerr << { ; n prt(x.first); n cerr << , ; n prt(x.second); n cerr << } ; n } n template n void prt(const T &x) { n long long f = 0; n cerr << { ; n for (auto &i : x) cerr << (f++ ? , : ), prt(i); n cerr << } ; n } n void _print() { cerr << ] n ; } n template n void _print(T t, V... v) { n prt(t); n if (sizeof...(v)) cerr << , ; n _print(v...); n } n void err(istream_iterator it) {} n template n void err(istream_iterator it, T a, brgs... args) { n cerr << *it << = << a << endl; n err(++it, args...); n } n long long kadane(long long *a, long long n) { n long long max_so_far = INT_MIN, max_ending_here = 0; n for (__typeof(n) i = (0); i != (n); i += 1 - 2 * ((0) > (n))) { n max_ending_here += a[i]; n max_so_far = max(max_so_far, max_ending_here); n if (max_ending_here < 0) max_ending_here = 0; n } n return max_so_far; n } n void solve() { n long long n; n cin >> n; n double ans = 1.0 / tan(3.1415926535897932384626 / (2 * n)); n cout << fixed; n cout << setprecision(10) << ans << endl; n return; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long t; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n vector > ed[200005]; n int n, m, k; n unsigned long long Hash[200005]; n unsigned long long H = 1e9 + 7; n unsigned long long a[10][10]; n unsigned long long sum; n long long ans = 0; n void dfs(int kk1, unsigned long long s) { n if (kk1 == k) { n if (s == sum) { n ans += 1; n } n return; n } n for (int i = 0; i < kk1 + 1; i++) { n dfs(kk1 + 1, s + a[kk1 + 1][i]); n } n } n int main() { n cin.tie(0); n ios::sync_with_stdio(false); n cin >> n >> m >> k; n for (int i = 0; i < m; i++) { n int u, v, w; n cin >> u >> v >> w; n ed[u].push_back(make_pair(w, v)); n } n for (int i = 1; i <= n; i++) { n sort(ed[i].begin(), ed[i].end()); n } n Hash[1] = 1; n sum = 1; n for (int i = 2; i <= n; i++) { n Hash[i] = Hash[i - 1] * H; n sum += Hash[i]; n } n for (int i = 1; i <= n; i++) { n int tp = ed[i].size(); n for (int j = 0; j < tp; j++) { n int tpp = ed[i][j].second; n a[tp][j] += Hash[tpp]; n } n } n dfs(1, a[1][0]); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int compare(const void *a, const void *b) { n int A = *((int *)a); n int B = *((int *)b); n return B - A; n } n int main() { n long long a[200000], b, c = 0, d, f = 0, i, j, k, n, m, p = 0, q = 0, r, n t = 0, l, mid = 0, sum = 0, x, y, s = 0; n string ch[3000][2]; n cin >> n; n for (i = 0; i < n; i++) cin >> a[i]; n i = 0; n j = n - 1; n while (i <= j) { n c++; n if (c % 2 != 0) { n if (a[i] > a[j]) { n s = s + a[i]; n i++; n } else { n s = s + a[j]; n j--; n } n } else { n if (a[i] > a[j]) { n f = f + a[i]; n i++; n } else { n f = f + a[j]; n j--; n } n } n } n cout << s << << f; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int arr[n + 2]; n vector s; n s.push_back(n); n for (int i = 2; i < n + 1; i++) cin >> arr[i]; n arr[1] = 0; n int k = n; n while (k > 0) { n s.push_back(arr[k]); n k = arr[k]; n } n for (int i = s.size() - 2; i > -1; i--) { n cout << s[i] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long c[105], x[105][105], dp[105][105][105]; n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long n, m, k, i, j, l, p, ans = 10000000000000000; n cin >> n >> m >> k; n for (i = 1; i <= n; i++) cin >> c[i]; n for (i = 1; i <= n; i++) n for (j = 1; j <= m; j++) cin >> x[i][j]; n for (i = 0; i <= 100; i++) n for (j = 0; j <= 100; j++) n for (l = 0; l <= 100; l++) dp[i][j][l] = 10000000000000000; n if (c[1] == 0) { n for (i = 1; i <= m; i++) dp[1][1][i] = x[1][i]; n } else n dp[1][1][c[1]] = 0; n for (i = 2; i <= n; i++) { n if (c[i] == 0) { n for (p = 1; p <= k; p++) { n for (j = 1; j <= m; j++) { n for (l = 1; l <= m; l++) { n if (j == l) { n dp[i][p][l] = min(dp[i][p][l], dp[i - 1][p][j] + x[i][l]); n } else { n dp[i][p + 1][l] = min(dp[i][p + 1][l], dp[i - 1][p][j] + x[i][l]); n } n } n } n } n } else { n for (p = 1; p <= k; p++) { n for (j = 1; j <= m; j++) { n if (j == c[i]) { n dp[i][p][c[i]] = min(dp[i][p][c[i]], dp[i - 1][p][j]); n } else { n dp[i][p + 1][c[i]] = min(dp[i][p + 1][c[i]], dp[i - 1][p][j]); n } n } n } n } n } n if (c[n] == 0) { n for (i = 1; i <= m; i++) ans = min(ans, dp[n][k][i]); n } else n ans = dp[n][k][c[n]]; n if (ans != 10000000000000000) n cout << ans; n else n cout << -1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = (int)1e6; n vector g[MAXN + 1]; n pair arr[MAXN + 1]; n int k; n void dfs(int nod, int par, int lvl) { n arr[nod] = {2 * MAXN, 0}; n for (auto it : g[nod]) { n if (it != par) { n dfs(it, nod, lvl + 1); n if (lvl >= arr[it].first) { n arr[nod].first = min(arr[nod].first, arr[it].first); n arr[nod].second += arr[it].second; n } n } n } n if (g[nod].size() == 0) { n arr[nod] = {lvl - k, 1}; n } n } n int dp[MAXN + 1]; n void dfs1(int nod, int par, int lvl) { n dp[nod] = (g[nod].size() == 0); n for (auto it : g[nod]) { n if (it != par) { n dfs1(it, nod, lvl + 1); n int cur = arr[nod].second; n if (lvl >= arr[it].first) { n cur -= arr[it].second; n } n dp[nod] = max(dp[nod], cur + dp[it]); n } n } n } n int main() { n int i, n, x, y; n ios::sync_with_stdio(false); n cin >> n >> k; n for (i = 2; i <= n; i++) { n cin >> x; n g[x].push_back(i); n } n dfs(1, 0, 1); n dfs1(1, 0, 1); n cout << dp[1]; n return 0; n } n "} +{"func_code_string": "#include n char s[101]; n char t[10] = ><+-.,[] ; n int c[10] = {8, 9, 10, 11, 12, 13, 14, 15}; n void func() { n int n = strlen(s), i, j, ans = 0; n const int mod = 1000003; n for (i = 0; i < n; i++) { n for (j = 0; j < 8; j++) { n if (t[j] == s[i]) { n ans = (ans * 16 + c[j]) % mod; n break; n } n } n } n printf( %d n , ans); n } n int main(int argc, char **argv) { n while (scanf( %s , s) == 1) { n func(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n for (int i = 1; i <= t; i++) { n int x1, x2, y1, y2; n string arr[8]; n for (int i = 0; i < 8; i++) cin >> arr[i]; n bool check = 0; n for (int i = 0; i < 8; i++) { n for (int j = 0; j < 8; j++) { n if (arr[i][j] == K && check == 0) { n check = 1; n x1 = j; n y1 = i; n } else if (arr[i][j] == K ) { n x2 = j; n y2 = i; n } n } n } n if ((x1 == x2 && abs(y1 - y2) == 4) || (y1 == y2 && abs(x1 - x2) == 4)) n cout << YES ; n else if (abs(x1 - x2) == 4 && abs(y1 - y2) == 4) n cout << YES ; n else n cout << NO ; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long MOD = 1e9 + 7; n long long MAX = 9223372036854775807; n int visited[1001][1001]; n int main() { n ios_base::sync_with_stdio(0); n ; n int n, m; n cin >> n >> m; n int a[n][m], l[n][m], r[n][m], u[n][m], d[n][m]; n for (int i = 0; i < n; ++i) { n string s; n cin >> s; n for (int j = 0; j < s.size(); ++j) { n if (s[j] == . ) n a[i][j] = 0; n else n a[i][j] = 1; n } n } n for (int i = 0; i < n; ++i) { n int temp = 0; n for (int j = 0; j < m; ++j) { n l[i][j] = temp; n temp += a[i][j]; n if (a[i][j] == 0) temp = 0; n } n temp = 0; n for (int j = m - 1; j >= 0; j--) { n r[i][j] = temp; n temp += a[i][j]; n if (a[i][j] == 0) temp = 0; n } n } n for (int j = 0; j < m; ++j) { n int temp = 0; n for (int i = 0; i < n; ++i) { n u[i][j] = temp; n temp += a[i][j]; n if (a[i][j] == 0) temp = 0; n } n temp = 0; n for (int i = n - 1; i >= 0; i--) { n d[i][j] = temp; n temp += a[i][j]; n if (a[i][j] == 0) temp = 0; n } n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (a[i][j]) { n l[i][j] = min(min(l[i][j], r[i][j]), min(u[i][j], d[i][j])); n } n } n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n u[i][j] = 0; n r[i][j] = 0; n } n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (a[i][j] and l[i][j] > 0) { n int k = l[i][j]; n u[i - k][j]++; n if (i + k + 1 < n) u[i + k + 1][j]--; n r[i][j - k]++; n if (j + k + 1 < m) r[i][j + k + 1]--; n } n } n } n for (int i = 0; i < n; ++i) { n int temp = 0; n for (int j = 0; j < m; ++j) { n temp += r[i][j]; n visited[i][j] = temp; n } n } n for (int j = 0; j < m; ++j) { n int temp = 0; n for (int i = 0; i < n; ++i) { n temp += u[i][j]; n visited[i][j] += temp; n } n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (a[i][j] and visited[i][j] == 0) { n cout << -1 << n ; n return 0; n ; n } n if (a[i][j] == 0 and visited[i][j] > 0) { n cout << -1 << n ; n return 0; n ; n } n } n } n vector, int> > ans; n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (a[i][j] and l[i][j] > 0) { n ans.push_back({{i + 1, j + 1}, l[i][j]}); n } n } n } n cout << ans.size() << n ; n ; n for (auto i : ans) { n cout << i.first.first << ; n ; n cout << i.first.second << ; n ; n cout << i.second << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int32_t main() { n int n, m, k; n cin >> n >> m >> k; n vector p(n); n for (int i = 0; i < n; ++i) cin >> p[i]; n vector s(n); n for (int i = 0; i < n; ++i) cin >> s[i]; n vector c(k); n for (int i = 0; i < k; ++i) cin >> c[i]; n vector> schools(m + 1, vector()); n for (int i = 0; i < n; ++i) { n schools[s[i]].push_back(p[i]); n } n int ans = 0; n for (int i = 0; i < k; ++i) { n int cur = c[i]; n int school = s[cur - 1]; n int power = p[cur - 1]; n vector ss = schools[school]; n sort(ss.rbegin(), ss.rend()); n if (ss[0] != power) ans++; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1010; n const double oo = 1E7, eps = 1E-7; n struct point { n double x, y; n } P[maxn]; n int n; n double ansl, ansr; n point operator+(point a, point b) { return (point){a.x + b.x, a.y + b.y}; } n point operator-(point a, point b) { return (point){a.x - b.x, a.y - b.y}; } n double operator*(point a, point b) { return a.x * b.x + a.y * b.y; } n double operator/(point a, point b) { return a.x * b.y - b.x * a.y; } n double get(point A, point B) { n double a, b, c, res; n a = A.y - B.y; n b = B.x - A.x; n c = A / B; n if (a) n res = (-c - b * P[1].y) / a; n else n res = oo; n return res; n } n int main() { n int i, j; n double x, sita; n scanf( %d , &n); n scanf( %lf%lf , &P[n].x, &P[n].y); n for (i = 1; i < n; ++i) scanf( %lf%lf , &P[i].x, &P[i].y); n ansl = min(P[1].x, P[n].x), ansr = max(P[1].x, P[n].x); n for (i = 2; i < n; ++i) { n j = i + 1; n x = get(P[i], P[j]); n sita = (P[1].y - P[i].y) * (P[j].x - P[i].x); n if (sita > (P[j].y - P[i].y) * (ansl - P[i].x)) ansl = max(ansl, x); n if (sita > (P[j].y - P[i].y) * (ansr - P[i].x)) ansr = min(ansr, x); n } n if (ansr >= ansl) n printf( %.0lf , floor(ansr) - floor(ansl - eps)); n else n printf( 0 ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int a[100001] = {0}; n long long int d[100001] = {0}; n long long int vis[100001] = {0}; n long long int cons[100001] = {0}; n vector vec[100001]; n void dfs(long long int x, long long int p) { n vis[x] = 1; n if (a[x] == 1) { n if (a[p] == 1) { n cons[x] = cons[p] + 1; n } else { n cons[x] = 1; n } n d[x] = max(d[p], cons[x]); n } else { n cons[x] = 0; n d[x] = d[p]; n } n for (long long int i = 0; i < vec[x].size(); i++) { n if (vis[vec[x][i]] == 1) n continue; n else { n dfs(vec[x][i], x); n } n } n } n signed main() { n long long int n, m; n cin >> n >> m; n for (long long int i = 0; i < n; i++) cin >> a[i + 1]; n for (long long int i = 0; i < n - 1; i++) { n long long int x, y; n cin >> x >> y; n vec[x].push_back(y); n vec[y].push_back(x); n } n dfs(1, 0); n long long int count = 0; n for (long long int i = 2; i <= n; i++) { n if (vec[i].size() == 1 && d[i] <= m) count++; n } n cout << count; n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int res = 0; n int neg; n while (true) { n char ch = getchar(); n if (ch >= 0 && ch <= 9 || ch == - ) { n if (ch == - ) n neg = -1; n else n neg = 1, res = ch - 0 ; n break; n } n } n while (true) { n char ch = getchar(); n if (ch >= 0 && ch <= 9 ) n res *= 10, res += ch - 0 ; n else n break; n } n return res * neg; n } n const int maxn = 100020; n const int MOd = 1e7; n int a, L, R, st[maxn], at; n bool flag, used[maxn]; n vector > > w[maxn]; n vector > w2[maxn]; n int dfs(int n, int back, int sz) { n int ret = 1; n st[++at] = n; n for (int i = 0; i < w[n].size(); i++) n if (w[n][i].first != back && !used[w[n][i].first]) { n int t = dfs(w[n][i].first, n, sz); n w[n][i].second.second = t; n ret += t; n } n for (int i = 0; i < w[n].size(); i++) n if (w[n][i].first == back) w[n][i].second.second = sz - ret; n return ret; n } n vector Cw[maxn]; n int ans1, ans2, sz[maxn]; n void center(int n, int back, int szz) { n at = 0; n dfs(n, 0, szz); n int C = n; n for (int i = 1; i <= at; i++) { n int t = st[i]; n int c = 0; n for (int j = 0; j < w[t].size(); j++) n if (w[t][j].second.second > szz / 2) { n c = 1; n break; n } n if (!c) C = t; n } n Cw[back].push_back(C); n sz[C] = szz; n used[C] = 1; n for (int i = 0; i < w[C].size(); i++) n if (!used[w[C][i].first]) center(w[C][i].first, C, w[C][i].second.second); n } n int N, T; n pair segment[maxn * 3]; n pair > st2[maxn]; n void dfss(int &n, int &back, int der, int s) { n st2[++at].first = n; n st2[at].second.first = der; n st2[at].second.second = s + s - der; n pair t; n t.first = -1e9; n t.second = 0; n int l = L - der, r = R - der; n if (l < N && 0 <= l) { n if (r > N - 1) r = N - 1; n for (l += N, r += N; l <= r; l = (l + 1) >> 1, r = (r - 1) >> 1) { n if (l & 1) t = max(t, (segment[l])); n if (~r & 1) t = max(t, (segment[r])); n } n } n if (t.first + s + s - der >= 0) { n ans1 = n; n ans2 = t.second; n flag = 1; n return; n } n for (int i = 0; i < w2[n].size() && !flag; i++) n if (w2[n][i].first != back && !used[w2[n][i].first]) n dfss(w2[n][i].first, n, der + 1, s + w2[n][i].second); n } n void calc(int &C) { n N = 1; n while (N < sz[C]) N <<= 1; n for (int i = 1; i < N + N; i++) segment[i] = pair(-1e9, 0); n for (int k = N; k; k >>= 1) segment[k] = pair(0, C); n for (int i = 0; i < w2[C].size(); i++) n if (!used[w2[C][i].first]) { n at = 0; n dfss(w2[C][i].first, C, 1, w2[C][i].second); n if (flag) return; n for (int i = 1; i <= at; i++) { n pair > &t = st2[i]; n int k = t.second.first + N; n if (segment[k].first < t.second.second) { n segment[k] = pair(t.second.second, t.first); n for (k >>= 1; k; k >>= 1) n segment[k] = max(segment[k + k], segment[k + k + 1]); n } n } n } n used[C] = 1; n for (int i = 0; i < Cw[C].size(); i++) { n calc(Cw[C][i]); n if (flag) return; n } n } n bool f(int n) { n for (int i = 1; i <= a; i++) n for (int j = 0; j < w[i].size(); j++) n w2[i][j].second = (w[i][j].second.first >= n); n flag = 0; n memset(used, 0, sizeof(used)); n calc(Cw[0][0]); n return flag; n } n int main() { n scanf( %d %d %d , &a, &L, &R); n for (int i = 1, j, k, t; i < a; i++) { n scanf( %d %d %d , &j, &k, &t); n w[j].push_back(pair >(k, pair(t, 0))); n w[k].push_back(pair >(j, pair(t, 0))); n w2[j].push_back(pair(k, 0)); n w2[k].push_back(pair(j, 0)); n } n center(1, 0, a); n int t = -1; n for (int k = 29; k >= 0; k--) n if (f(t + (1 << k))) t += 1 << k; n printf( %d %d n , ans1, ans2); n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /stack:200000000 ) n #pragma GCC optimize( Ofast ) n #pragma target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n using namespace std; n long long read() { n long long x = 0, f = 1; n char c = getchar(); n for (; !isdigit(c); c = getchar()) n if (c == - ) f = -1; n for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48); n return x * f; n } n void write(long long x) { n if (x < 0) x = -x, putchar( - ); n if (x >= 10) write(x / 10); n putchar(x % 10 + 0 ); n } n void writeln(long long x) { n write(x); n puts( ); n } n const int N = 500000; n int E[N], X[N], R[N], D[N]; n int u[N], v[N]; n bool b[N]; n int i, m, n, t, w, x, y, S_E; n inline void A_E(int x, int y) { n S_E++, E[S_E] = y, X[S_E] = R[x], R[x] = S_E, D[x]++; n return; n } n inline int O_E(int x) { return ((x - 1) ^ 1) + 1; } n inline void dfs(int x) { n for (int i = R[x]; R[x] = X[i], i != 0; i = R[x]) n if (!b[i]) { n b[i] = true, b[O_E(i)] = true; n dfs(E[i]); n w++, u[w] = x, v[w] = E[i]; n } n return; n } n int main() { n n = read(), m = read(); n for (i = 1; i <= m; i++) { n x = read(), y = read(); n A_E(x, y), A_E(y, x); n } n for (i = 1; i <= n; i++) n if (D[i] & 1) n if (t) n m++, A_E(i, t), A_E(t, i), t = 0; n else n t = i; n if (m & 1) m++, A_E(1, 1), A_E(1, 1); n writeln(m); n dfs(1); n for (i = w; i > 0; i--) n if (!(i & 1)) n printf( %d %d n , u[i], v[i]); n else n printf( %d %d n , v[i], u[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n int a[100005]; n cin >> n; n int fa = 1; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n if (a[i] != i) { n fa = 0; n } n } n if (fa == 1) { n cout << 0 ; n } else { n int ji = n - 1; n while (a[ji] < a[ji + 1]) { n ji--; n } n cout << ji; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9, MOD = 1e9 + 7, N = 1e5 + 1, M = 20; n void setIO(string name = ) { n ios::sync_with_stdio(false); n cin.tie(0); n if (name.size()) { n freopen((name + .in ).c_str(), r , stdin); n freopen((name + .out ).c_str(), w , stdout); n } n } n int n, m, a[N], s, pxor[1000001], ans[N]; n void pre() { n pxor[0] = 0; n for (int i = 1; i < 1000001; i++) pxor[i] = pxor[i - 1] ^ i; n } n string bit(int j) { n string ans; n for (int i = 0; i < M; i++) { n ans += (j & 1) + 0 ; n j >>= 1; n } n reverse(ans.begin(), ans.end()); n return ans; n } n struct node1 { n int mx = -INF; n node1 *nxt[2]{}; n }; n struct node2 { n int mn = INF; n node2 *nxt[2]{}; n }; n node1 *rt1 = new node1(); n node2 *rt2 = new node2(); n void insert1(node1 *o, int i) { n string s = bit(pxor[i]); n for (char c : s) { n if (!o->nxt[c - 0 ]) o->nxt[c - 0 ] = new node1(); n o = o->nxt[c - 0 ]; n o->mx = max(o->mx, i); n } n } n void insert2(node2 *o, int i) { n string s = bit(pxor[i]); n for (char c : s) { n if (!o->nxt[c - 0 ]) o->nxt[c - 0 ] = new node2(); n o = o->nxt[c - 0 ]; n o->mn = min(o->mn, i); n } n } n void insert(int i) { n insert1(rt1, i); n insert2(rt2, i - 1); n } n int get1(node1 *o, int i) { n string s = bit(pxor[i]); n int ans = 0, shift = M - 1; n for (char c : s) { n int tmp = 1 ^ (c - 0 ); n if (o->nxt[tmp] && o->nxt[tmp]->mx > i) { n o = o->nxt[tmp]; n ans += (1 << shift); n } else if (o->nxt[1 ^ tmp] && o->nxt[1 ^ tmp]->mx > i) { n o = o->nxt[tmp ^ 1]; n } else n return 0; n shift--; n } n return ans; n } n int get2(node2 *o, int i) { n string s = bit(pxor[i]); n int ans = 0, shift = M - 1; n for (char c : s) { n int tmp = 1 ^ (c - 0 ); n if (o->nxt[tmp] && o->nxt[tmp]->mn < i) { n o = o->nxt[tmp]; n ans += (1 << shift); n } else if (o->nxt[1 ^ tmp] && o->nxt[1 ^ tmp]->mn < i) { n o = o->nxt[tmp ^ 1]; n } else n return 0; n shift--; n } n return ans; n } n int get(int i) { return max(get1(rt1, i - 1), get2(rt2, i)); } n void clearall(node1 *o) { n o->mx = -INF; n if (o->nxt[0] && o->nxt[0]->mx != -INF) clearall(o->nxt[0]); n if (o->nxt[1] && o->nxt[1]->mx != -INF) clearall(o->nxt[1]); n } n void clearall(node2 *o) { n o->mn = INF; n if (o->nxt[0] && o->nxt[0]->mn != INF) clearall(o->nxt[0]); n if (o->nxt[1] && o->nxt[1]->mn != INF) clearall(o->nxt[1]); n } n void init() { n clearall(rt1); n clearall(rt2); n } n struct query { n int l, r, id, bl; n query(int ll, int rr, int i) : l(ll), r(rr), id(i), bl(l / s) {} n bool operator<(const query &other) const { n return make_pair(bl, r) < make_pair(other.bl, other.r); n } n }; n query make_query(int ll, int rr, int i) { return query(ll, rr, i); } n vector qry; n signed main() { n setIO(); n pre(); n cin >> n >> m; n s = ceil(sqrt(n)); n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < m; i++) { n int l, r; n cin >> l >> r; n qry.push_back(make_query(l - 1, r - 1, i)); n } n sort(qry.begin(), qry.end()); n for (int i = 0, j = 0; i < m; i = j) { n while (j < m && qry[j].bl == qry[i].bl) j++; n int lmx = 0, mid = j, right, nowmx = 0; n for (int k = i; k < j; k++) right = lmx = max(lmx, qry[k].l); n for (int k = i; k < j; k++) n if (qry[k].r > lmx) { n mid = k; n break; n } n init(); n for (int k = mid; k < j; k++) { n ans[qry[k].id] = nowmx; n while (right <= qry[k].r) { n insert(a[right]); n nowmx = ans[qry[k].id] = max(ans[qry[k].id], get(a[right])); n right++; n } n for (int l = lmx; l >= qry[k].l; l--) { n ans[qry[k].id] = max(ans[qry[k].id], get(a[l])); n } n } n for (int k = i; k < j; k++) { n init(); n for (int l = min(qry[k].r, lmx); l >= qry[k].l; l--) { n insert(a[l]); n ans[qry[k].id] = max(ans[qry[k].id], get(a[l])); n } n } n } n for (int i = 0; i < m; i++) cout << ans[i] << n ; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:65777216 ) n using namespace std; n char s[1111][1111]; n int n, m; n int best; n int now; n int v[1111][1111]; n vector > c; n bool u[1111][1111]; n void dfs(int x, int y) { n if (u[x][y]) return; n u[x][y] = true; n for (int dx(-1); dx < (2); dx++) n for (int dy(-1); dy < (2); dy++) { n int nx = dx + x; n int ny = dy + y; n if (nx >= 0 && nx < n && ny >= 0 && ny < m) n if (s[nx][ny] == 0 ) n dfs(nx, ny); n else n c.push_back(pair(nx, ny)); n else n c.push_back(pair(-1, -1)); n } n } n int startx, starty; n int dfs2(int x, int y, int prevx = -1, int prevy = -1) { n if (x == startx && y == starty && prevx != -1) return 0; n int res = 1; n for (int dx(-1); dx < (2); dx++) n for (int dy(-1); dy < (2); dy++) n if (abs(dx) + abs(dy) == 1) { n int nx = x + dx; n int ny = y + dy; n if (nx >= 0 && nx < n && ny >= 0 && ny < m && v[nx][ny] == v[x][y]) n if (nx != prevx || ny != prevy) { n res += dfs2(nx, ny, x, y); n if (prevx == -1) return res; n } n } n return res; n } n int main() { n cin >> n >> m; n for (int i(0); i < (n); i++) scanf( %s , s[i]); n for (int i(1); i < (n); i++) n for (int j(1); j < (m); j++) n if (s[i][j] == 1 && s[i][j - 1] == 1 && s[i - 1][j - 1] == 1 && n s[i - 1][j] == 1 ) n best = 4; n for (int i(0); i < (n); i++) n for (int j(0); j < (m); j++) n if (s[i][j] == 0 && !u[i][j]) { n c.clear(); n dfs(i, j); n now++; n bool good = 1; n int num = 0; n for (int k(0); k < (c.size()); k++) n if (c[k].first == -1) { n good = 0; n break; n } else if (v[c[k].first][c[k].second] != now) n v[c[k].first][c[k].second] = now, num++; n for (int k(0); k < (c.size()); k++) { n int num = 0; n for (int dx(-1); dx < (2); dx++) n for (int dy(-1); dy < (2); dy++) n if (abs(dx) + abs(dy) == 1) { n int nx = c[k].first + dx; n int ny = c[k].second + dy; n if (nx >= 0 && nx < n && ny >= 0 && ny < m && s[nx][ny] == 1 ) n if (v[nx][ny] == now) num++; n } n if (num != 2) { n good = 0; n break; n } n } n if (good && num > 4) { n startx = c[0].first; n starty = c[0].second; n if (dfs2(c[0].first, c[0].second) == num) best = max(best, num); n } n } n cout << best << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n string l, r; n cin >> l >> r; n vector> l_array; n vector> r_array; n for (int i = 0; i < 27; i++) { n stack buf; n l_array.push_back(buf); n r_array.push_back(buf); n } n for (int i = 0; i < n; i++) { n if (l[i] == ? ) { n l_array[26].push(i); n } else { n l_array[l[i] - a ].push(i); n } n if (r[i] == ? ) { n r_array[26].push(i); n } else { n r_array[r[i] - a ].push(i); n } n } n vector> answer; n for (int i = 0; i < 26; i++) { n while (!l_array[i].empty() && !r_array[i].empty()) { n answer.push_back(make_pair(l_array[i].top(), r_array[i].top())); n l_array[i].pop(); n r_array[i].pop(); n } n while (!l_array[i].empty() && !r_array[26].empty()) { n answer.push_back(make_pair(l_array[i].top(), r_array[26].top())); n l_array[i].pop(); n r_array[26].pop(); n } n while (!r_array[i].empty() && !l_array[26].empty()) { n answer.push_back(make_pair(l_array[26].top(), r_array[i].top())); n l_array[26].pop(); n r_array[i].pop(); n } n } n while (!l_array[26].empty() && !r_array[26].empty()) { n answer.push_back(make_pair(l_array[26].top(), r_array[26].top())); n l_array[26].pop(); n r_array[26].pop(); n } n int count = answer.size(); n cout << count << endl; n for (int i = 0; i < count; i++) { n cout << answer[i].first + 1 << << answer[i].second + 1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, z, x, c, sum, a[101][101], us[101][101]; n char cc, stl; n set s; n void dfs(long long i, long long j) { n if (a[i][j] == 0 || us[i][j] == 1 || i > n || j > m || i < 1 || j < 1) return; n us[i][j] = 1; n if (s.count(a[i][j]) == 0) sum++, s.insert(a[i][j]); n if (a[i][j] == stl - A + 1) { n dfs(i + 1, j); n dfs(i - 1, j); n dfs(i, j + 1); n dfs(i, j - 1); n } n } n int main() { n cin >> n >> m >> stl; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n cin >> cc; n if (cc != . ) a[i][j] = cc - A + 1; n if (cc == stl) z = i, x = j; n } n } n s.insert((int)stl - A + 1); n dfs(z, x); n cout << sum << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int okX[] = {0, 0, 0, 1, 1, 2, 2, 2}; n const int okY[] = {0, 1, 2, 0, 2, 0, 1, 2}; n const int n = 8; n void normalize(int a[n]) { n vector v(a, a + n); n sort(v.begin(), v.end()); n map m; n for (int i = 0; i < v.size(); ++i) n if (!m.count(v[i])) m.insert(make_pair(v[i], m.size())); n for (int i = 0; i < 8; ++i) a[i] = m[a[i]]; n } n int main() { n int x[n], y[n]; n for (int i = 0; i < n; ++i) cin >> x[i] >> y[i]; n normalize(x); n normalize(y); n bool used[n]; n memset(used, false, sizeof(used)); n for (int i = 0; i < 8; ++i) { n bool ok = false; n for (int j = 0; j < 8; ++j) n if (x[i] == okX[j] && y[i] == okY[j] && !used[j]) n ok = true, used[j] = true; n if (!ok) { n printf( ugly n ); n return 0; n } n } n printf( respectable n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool is_prime[100000]; n void gen_is_primes(int n); n void gen_prime_groups(int n, vector& to_match, n list& candidate_primes, n list >& groups); n void gen_prime_groups(int n, int p, vector& to_match, n list >& groups); n void gen_unmatched_multiples(int n, int i, vector& to_match, n list& unmatched_multiples); n void gen_even_groups(vector& to_match, list >& groups); n void gen_is_primes(int n) { n fill_n(is_prime, n, true); n is_prime[0] = false; n is_prime[1] = false; n for (int i = 2; i <= n / 2; i++) { n if (is_prime[i]) { n for (int j = 2 * i; j <= n; j += i) { n is_prime[j] = false; n } n } n } n } n void gen_prime_groups(int n, vector& to_match, n list& candidate_primes, n list >& groups) { n for (list::iterator i = candidate_primes.begin(); n i != candidate_primes.end(); i++) { n gen_prime_groups(n, *i, to_match, groups); n } n } n void gen_prime_groups(int n, int p, vector& to_match, n list >& groups) { n list* unmatched_multiples = new list(); n gen_unmatched_multiples(n, p, to_match, *unmatched_multiples); n for (list::iterator it = unmatched_multiples->begin(); n it != unmatched_multiples->end(); it++) { n int curr = *it; n int curr_partner = *(++it); n to_match[curr] = false; n to_match[curr_partner] = false; n groups.push_back(make_pair(curr, curr_partner)); n } n delete unmatched_multiples; n } n void gen_unmatched_multiples(int n, int i, vector& to_match, n list& unmatched_multiples) { n for (int curr_multiple = i; curr_multiple <= n; curr_multiple += i) { n if (to_match[curr_multiple]) { n unmatched_multiples.push_back(curr_multiple); n } n } n if (unmatched_multiples.size() % 2 != 0) { n unmatched_multiples.remove(2 * i); n } n } n void gen_even_groups(vector& to_match, list >& groups) { n list unmatched; n for (vector::iterator i = to_match.begin(); i != to_match.end(); i++) { n if (*i) { n int i_index = i - to_match.begin(); n unmatched.push_back(i_index); n } n } n if (unmatched.size() % 2 != 0) { n unmatched.erase(unmatched.begin()); n } n for (list::iterator i = unmatched.begin(); i != unmatched.end(); i++) { n int curr = *i; n int curr_partner = *(++i); n groups.push_back(make_pair(curr, curr_partner)); n } n } n int main() { n int n; n cin >> n; n gen_is_primes(n); n vector to_match(n, false); n for (int i = 2; i <= n; i++) { n to_match[i] = !is_prime[i] || (i <= n / 2); n } n list* candidate_primes = new list; n for (int i = n / 2; i >= 3; i--) { n if (is_prime[i]) { n candidate_primes->push_back(i); n } n } n list >* groups = new list >; n gen_prime_groups(n, to_match, *candidate_primes, *groups); n gen_even_groups(to_match, *groups); n cout << groups->size() << endl; n for (list >::iterator it = groups->begin(); n it != groups->end(); it++) { n cout << it->first << << it->second << endl; n } n delete groups; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma ) n #pragma GCC optimize( unroll-loops ) n using namespace std; n long long MOD9 = 998244353; n long long MOD = 1000000007; n double eps = 1e-12; n void solve() { n int n; n cin >> n; n vector > v(n); n for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second; n sort((v).begin(), (v).end()); n int p = 0, c = 0; n for (int i = 1; i < n; i++) { n if (v[i].second < v[p].second) n c++; n else n p = i; n } n cout << c << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n { solve(); } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, d1, d2; n bool d[400001]; n int a[200001]; n int nextprime(int x) { n for (int i = x + 1; i <= 2 * n; ++i) n if (d[i]) return i; n return 2 * n + 1000000; n } n int main() { n ios_base::sync_with_stdio(0); n cin >> n; n int x; n for (int i = 1; i <= n; ++i) { n cin >> x; n d1 += x == 1; n d2 += x == 2; n } n memset(d, sizeof(d), 0); n for (int i = 2; i <= 2 * n; ++i) { n bool f = 1; n for (int j = 2; j * j <= i; ++j) n if (i % j == 0) { n f = 0; n break; n } n d[i] = f; n } n int prime = 0; n int t = n; n while (n > 0) { n int tmp = nextprime(prime); n while (tmp - prime >= 2 && d2 > 0 && n > 0) prime += 2, d2--, a[n] = 2, n--; n while (tmp - prime >= 1 && d1 > 0 && n > 0) prime += 1, d1--, a[n] = 1, n--; n while (tmp - prime >= 1 && d1 == 0 && d2 > 0) n prime += 2, d2--, a[n] = 2, n--; n } n for (int i = t; i > 0; --i) cout << a[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n long long pwr(long long base, long long p, long long mod = (1000000007LL)) { n long long ans = 1; n while (p) { n if (p & 1) ans = (ans * base) % mod; n base = (base * base) % mod; n p /= 2; n } n return ans; n } n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n const double eps = 1e-7; n struct PT { n double x, y; n PT() {} n PT(double x, double y) : x(x), y(y) {} n bool operator<(const PT &rhs) const { n return make_pair(y, x) < make_pair(rhs.y, rhs.x); n } n bool operator==(const PT &rhs) const { n return make_pair(y, x) == make_pair(rhs.y, rhs.x); n } n }; n double cross(PT p, PT q) { return p.x * q.y - p.y * q.x; } n double area2(PT a, PT b, PT c) { n return cross(a, b) + cross(b, c) + cross(c, a); n } n void ConvexHull(vector &pts) { n sort(pts.begin(), pts.end()); n pts.erase(unique(pts.begin(), pts.end()), pts.end()); n vector up, dn; n for (int i = 0; i < pts.size(); i++) { n while (up.size() > 1 && area2(up[up.size() - 2], up.back(), pts[i]) > eps) n up.pop_back(); n while (dn.size() > 1 && area2(dn[dn.size() - 2], dn.back(), pts[i]) < -eps) n dn.pop_back(); n up.push_back(pts[i]); n dn.push_back(pts[i]); n } n pts = dn; n for (int i = (int)up.size() - 2; i >= 1; i--) pts.push_back(up[i]); n } n vector arr; n set banned; n int main() { n int n1, n2; n scanf( %d%d , &n1, &n2); n int X, Y; n scanf( %d%d , &X, &Y); n while (n1--) { n int x, y; n scanf( %d%d , &x, &y); n banned.insert(PT(x, y)); n arr.push_back(PT(x, y)); n } n int max_x = -1, max_y = -1; n while (n2--) { n int x, y; n scanf( %d%d , &x, &y); n arr.push_back(PT(x, y)); n max_x = max(max_x, x); n max_y = max(max_y, y); n } n arr.push_back(PT(0, max_y)); n arr.push_back(PT(max_x, 0)); n arr.push_back(PT(0, 0)); n ConvexHull(arr); n for (auto it : arr) n if (banned.find(it) != banned.end()) { n printf( Max ); n return 0; n } n printf( Min ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 100000 + 10; n const int MAXM = 100 + 10; n const int MOD = 1000000007; n const int INF = 1000000001; n int a[20][120]; n int l[20], r[20]; n int f[20], g[20]; n bool w[20]; n int main() { n ios::sync_with_stdio(false); n int n, m; n cin >> n >> m; n int L = m + 1, R = 0; n for (int i = n; i >= 1; i--) { n l[i] = m + 1; n for (int j = 0; j <= m + 1; j++) { n char c; n cin >> c; n a[i][j] = c - 0 ; n w[i] |= a[i][j]; n if (a[i][j]) { n r[i] = j; n if (l[i] == m + 1) l[i] = j; n } n } n } n while (n > 1 && !w[n]) n--; n for (int i = 0; i <= m + 1; i++) n if (a[n][i]) { n if (i < L) L = i; n if (i > R) R = i; n } n f[1] = r[1] * 2; n g[1] = m + 1; n f[0] = -1; n g[0] = 1000000000; n for (int i = 2; i <= n; i++) { n f[i] = g[i - 1] + m + 2; n g[i] = f[i - 1] + m + 2; n f[i] = min(f[i], f[i - 1] + 1 + r[i] * 2); n g[i] = min(g[i], g[i - 1] + 1 + (m + 1 - l[i]) * 2); n } n cout << min(f[n - 1] + 1 + R, g[n - 1] + 1 + m + 1 - L) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n short n; n int n1, n2; n bool state = false; n char handle[11]; n cin >> n; n for (short i = 0; i < n; i++) { n cin >> handle; n cin >> n1; n cin >> n2; n if (n1 >= 2400 && n2 > n1) state = true; n } n if (state) n cout << YES << endl; n else n cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000 * 1000 * 1000 + 7; n const double EPS = 1e-9; n int bit_count(int first) { n return first == 0 ? 0 : 1 + bit_count(first & (first - 1)); n } n inline int low_bit(int first) { return first & -first; } n inline int sign(double first) { n return first < -EPS ? -1 : first > EPS ? 1 : 0; n } n inline int sign(int first) { return (first > 0) - (first < 0); } n int nextComb(int first) { n if (!first) { n fprintf(stderr, nextComb(0) called n ); n return ((1 << 30) - 1 + (1 << 30)); n } n int smallest = first & -first; n int ripple = first + smallest; n int ones = first ^ ripple; n ones = (ones >> 2) / smallest; n return ripple | ones; n } n template n inline T gcd(T a, T b) { n a = abs(a); n b = abs(b); n while (b) { n int r = a % b; n a = b; n b = r; n } n return a; n } n template n inline T lcm(T a, T b) { n return a / gcd(a, b) * b; n } n inline int getInt() { n int a; n return scanf( %d , &a) ? a : (fprintf(stderr, trying to read n ), -1); n } n inline double getDouble() { n double a; n return scanf( %lf , &a) ? a : (fprintf(stderr, trying to read n ), -1.0); n } n inline double myRand() { n return ((double)rand() / RAND_MAX) + ((double)rand() / RAND_MAX / RAND_MAX); n } n const int N = 109; n int s, c; n int Left[N], Right[N]; n vector > > getOptions(int n) { n vector > > ret; n for (int i = (int)0; i < (int)s; ++i) { n if (Left[i] == -1) { n int L = c - n / 2, R = c + (n - 1) / 2, cost = 0; n for (int j = L; j <= R; ++j) cost += abs(c - i) + abs(c - j); n ret.push_back(make_pair(cost, pair(i, L))); n } else { n int L = Left[i] - n, R = Left[i] - 1, cost = 0; n if (L >= 0) { n for (int j = L; j <= R; ++j) cost += abs(c - i) + abs(c - j); n ret.push_back(make_pair(cost, pair(i, L))); n } n L = Right[i] + 1; n R = Right[i] + n; n cost = 0; n if (R < s) { n for (int j = L; j <= R; ++j) cost += abs(c - i) + abs(c - j); n ret.push_back(make_pair(cost, pair(i, L))); n } n } n } n return ret; n } n void update(int first, int a, int b) { n if (Left[first] == -1) { n Left[first] = a; n Right[first] = b; n } else { n if (a < Left[first]) Left[first] = a; n if (b > Right[first]) Right[first] = b; n } n } n void myCode() { n int n = getInt(); n s = getInt(); n c = s / 2; n for (int i = (int)0; i < (int)s; ++i) Left[i] = Right[i] = -1; n for (int i = (int)0; i < (int)n; ++i) { n int first = getInt(); n if (first > s) { n printf( -1 n ); n continue; n } n vector > > a = getOptions(first); n if (a.empty()) { n printf( -1 n ); n continue; n } n sort((a).begin(), (a).end()); n printf( %d %d %d n , a[0].second.first + 1, a[0].second.second + 1, n a[0].second.second + first); n update(a[0].second.first, a[0].second.second, n a[0].second.second + first - 1); n } n } n int main() { n srand(time(NULL)); n myCode(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int graph[27]; n int grapht[27]; n vector used(27, false); n vector opened(27, false); n string result; n void dfs(int node) { n used[node] = true; n opened[node] = true; n if (graph[node] == -1) { n result += (node + a ); n opened[node] = false; n return; n } n if (opened[graph[node]]) { n cout << NO ; n exit(0); n } n dfs(graph[node]); n opened[node] = false; n result += (node + a ); n } n void dfsn(int node) { n opened[node] = true; n if (graph[node] != -1) { n if (opened[graph[node]]) { n cout << NO ; n exit(0); n } n dfsn(graph[node]); n } n opened[node] = false; n } n set letter; n int main() { n int n; n cin >> n; n fill(graph, graph + 27, -1); n fill(grapht, grapht + 27, -1); n while (n--) { n string s; n cin >> s; n for (int i = 0; i < s.size() - 1; i++) { n int b = s[i] - a ; n int e = s[i + 1] - a ; n if ((graph[b] != -1 && graph[b] != e) || n (grapht[e] != -1 && grapht[e] != b)) { n cout << NO ; n exit(0); n } n graph[b] = e; n grapht[e] = b; n } n for (auto i = s.begin(); i != s.end(); i++) { n letter.insert(*i - a ); n } n } n for (int i = 0; i < 27; i++) { n dfsn(i); n } n for (int i = 26; i >= 0; i--) { n if (letter.find(i) != letter.end() && grapht[i] == -1) { n dfs(i); n } n } n reverse(result.begin(), result.end()); n cout << result; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using pii = pair; n const ll MOD = 1e9 + 7, N = 1e5 + 10; n void test() { n ll n; n cin >> n; n vector a(n); n for (ll i = 0; i < n; i++) { n cin >> a[i]; n } n vector ans; n sort(a.begin(), a.end()); n ll l = 0, h = n - 1; n while (l < h) { n ans.push_back(a[l]); n ans.push_back(a[h]); n l++, h--; n } n if (l == h) ans.push_back(a[l]); n reverse(ans.begin(), ans.end()); n for (ll i = 0; i < n; i++) { n cout << ans[i] << n [i == n - 1]; n } n return; n } n int32_t main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n ll tt = 1; n cin >> tt; n for (ll i = 0; i < tt; i++) test(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9 + 7; n const int N = 1e4 + 10; n int main() { n string str; n cin >> str; n cout << str[0]; n int flag = 0; n for (int i = 1; i < str.length(); i++) { n if (!(i + 2 >= str.length() || flag == 1)) { n if (str.substr(i, 2) == at ) { n cout << @ ; n i++; n flag = 1; n continue; n } n } n if (i + 3 < str.length()) { n if (str.substr(i, 3) == dot ) { n cout << . ; n i += 2; n continue; n } n } n cout << str[i]; n } n return 0; n } n "} +{"func_code_string": "#include n #define mod 998244353 n using namespace std; n int n, A[2], f[200010], pw2; n int powmod(int x, int y){ n int ans = 1; n for(;y;y >>= 1, x = 1ll * x * x % mod) n if(y & 1)ans = 1ll * x * ans % mod; n return ans; n } n int main(){ n scanf( %d , &n); n A[0] = 1; n A[1] = 0; n pw2 = powmod(2, mod - 2); n for(int i = 1; i <= n; i++){ n A[0] = 1ll * A[0] * pw2 % mod; n A[1] = 1ll * A[1] * pw2 % mod; n f[i] = A[!(i & 1)]; n A[i & 1] += f[i]; n } n printf( %d n , f[n]); n } n n "} +{"func_code_string": "#include n using namespace std; n const int N = 100; n int gi() { n int w = 0; n bool q = 1; n char c = getchar(); n while ((c < 0 || c > 9 ) && c != - ) c = getchar(); n if (c == - ) q = 0, c = getchar(); n while (c >= 0 && c <= 9 ) w = w * 10 + c - 0 , c = getchar(); n return q ? w : -w; n } n const int mod = 1e9 + 7; n int f[N][N], g[N][N]; n int inv[N]; n inline void inc(int &x, int y) { (x += y) >= mod ? x -= mod : 0; } n inline int C(int n, int m) { n n += m - 1; n int ans = 1; n for (int i = 1; i <= m; i++) n ans = 1LL * ans * (n - i + 1) % mod * inv[i] % mod; n return ans; n } n int main() { n int n = gi(), m = gi(), i, j, k, t, s, lim = n + 1; n for (inv[0] = inv[1] = 1, i = 2; i < N; i++) n inv[i] = mod - 1LL * (mod / i) * inv[mod % i] % mod; n f[0][1] = 1; n for (i = 0; i <= n; i++) n for (j = 0; j <= lim; j++) { n if (f[i][j]) n for (k = 0; k <= i && k + i <= n; k++) n for (t = 0; t <= lim; t++) { n if (k == i) n if (t < j) n inc(g[i + k + 1][t], 2LL * f[i][j] * f[k][t] % mod); n else if (t == j) n inc(g[i + k + 1][j], 1LL * f[i][j] * f[k][t] % mod); n else n break; n else n inc(g[i + k + 1][min(j, t)], 2LL * f[i][j] * f[k][t] % mod); n } n if (g[i][j]) n for (k = n - i; k >= 0; k--) n for (t = lim - j; t >= 0; t--) n if (f[k][t]) n for (s = min((n - k) / i, (lim - t) / j); s; s--) n inc(f[k + i * s][t + j * s], n 1LL * f[k][t] * C(g[i][j], s) % mod); n } n printf( %d n , f[n][m]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n while (~scanf( %d , &n)) { n printf( %d n , n); n for (int i = 1; i <= n; i++) printf( 1 ); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool compare(const pair &a, n const pair &b) { n return a.second > b.second; n } n int main() { n std::ios::sync_with_stdio(false); n std::cin.tie(nullptr); n long long i, j; n string s; n cin >> s; n long long n = s.length(); n long long f = 1; n if (n < 4) { n cout << 0; n } else { n long long sm = 0; n long long fsm = 0; n for (i = 0; i < n - 3; i++) { n if (s[i] == b && s[i + 1] == e && s[i + 2] == a && n s[i + 3] == r ) { n sm = i + 1; n } n fsm += sm; n } n cout << fsm; n } n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n long long n; n cin >> n; n long long ar[n]; n for (long long i = 0; i < n; i++) cin >> ar[i]; n sort(ar, ar + n); n long long dist = 0; n for (long long i = 0; i < n; i++) dist += (long long)abs(ar[i] - (i + 1)); n cout << dist << n ; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n long long T = 1; n while (T--) solve(); n return 0; n } n "} +{"func_code_string": "#include n #include n #include n #include n n using namespace std; n n const int N = 100000; n n long long n; n n struct ab n { n long long a; n long long b; n bool operator < (const struct ab &c) const n { n return b < c.b; n } n } aa[N + 5]; n long long sus[N + 5]; n n int main() n { n scanf( %lld , &n); n long long su = 0; n for (int i = 1; i <= n; ++i) n { n scanf( %lld%lld , &aa[i].a, &aa[i].b); n su += aa[i].a; n } n sort(aa + 1, aa + n + 1); n sus[n + 1] = 0; n for (int i = n; i >= 1; --i) n { n sus[i] = sus[i + 1] + aa[i].a; n } n long long ans = 0; n long long p = 0, ext = 0; n for (int i = 1; i <= n; ++i) n { n long long cc = aa[i].b - (p + ext); n if (sus[i + 1] <= ext) n { n if (aa[i].b <= p + ext) n { n ans += aa[i].a - (ext - sus[i + 1]); n } n else if (aa[i].b <= p + ext + aa[i].a - (ext - sus[i + 1])) n { n ans += p + ext + aa[i].a - (ext - sus[i + 1]) - aa[i].b; n ans += 2 * cc; n } n else n { n ans += 2 * (aa[i].a - (ext - sus[i + 1])); n } n break; n } n else if (aa[i].b <= p + ext) n { n ans += aa[i].a; n p += aa[i].a; n } n else if (sus[i + 1] - ext >= cc) n { n ans += 2 * cc; n ext += cc; n ans += aa[i].a; n p += aa[i].a; n } n else n { n ans += 2 * (sus[i + 1] - ext); n cc -= sus[i + 1] - ext; n if (cc >= aa[i].a) n { n ans += 2 * aa[i].a; n } n else n { n ans += 2 * cc + (aa[i].a - cc); n } n break; n } n } n n // for (int i = 1; i <= n; ++i) n // { n // if (aa[i].b >= su) n // { n // ans += 2 * (su - p - ext); n // break; n // } n // else if (aa[i].b <= p + ext) n // { n // ans += aa[i].a; n // p += aa[i].a; n // } n // else if (sus[i + 1] >= aa[i].b - p) n // { n // ans += 2 * (aa[i].b - p - ext); n // ext += aa[i].b - p - ext; n // ans += aa[i].a; n // p += aa[i].a; n // } n // else if (sus[i + 1] < aa[i].b - p - ext) n // { n // ans += n // } n // } n n printf( %lld , ans); n return 0; n } n n "} +{"func_code_string": "#include n using namespace std; n const int iinf = 1e9 + 7; n const long long linf = 1ll << 60; n const double dinf = 1e10; n template n inline void scf(T &x) { n bool f = 0; n x = 0; n char c = getchar(); n while ((c < 0 || c > 9 ) && c != - ) c = getchar(); n if (c == - ) { n f = 1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n x = x * 10 + c - 0 ; n c = getchar(); n } n if (f) x = -x; n return; n } n template n void scf(T1 &x, T2 &y) { n scf(x); n return scf(y); n } n template n void scf(T1 &x, T2 &y, T3 &z) { n scf(x); n scf(y); n return scf(z); n } n const int N = 233; n int n, l, k; n int p[N], a[N]; n double dp[N][N][N * 2]; n int main() { n scf(n, l, k); n for (int i = (1); i <= (n); i++) scf(p[i]); n for (int i = (1); i <= (n); i++) scf(a[i]); n dp[0][0][k + 200] = 1.0; n for (int i = 0; i < (n); i++) n for (int j = (0); j <= (i); j++) n for (int k = (0); k <= (400); k++) n if (dp[i][j][k] > 1e-20) { n dp[i + 1][j][k] += dp[i][j][k] * (1.0 * (100 - p[i + 1]) / 100.0); n int nxtk = k; n if (a[i + 1] < 0) n nxtk--; n else n nxtk += a[i + 1]; n if (nxtk > 400) nxtk = 400; n if (k >= 0) n dp[i + 1][j + 1][nxtk] += dp[i][j][k] * (1.0 * p[i + 1] / 100.0); n } n double ans = 0.0; n for (int j = (l); j <= (n); j++) n for (int k = (200); k <= (400); k++) ans += dp[n][j][k]; n printf( %.12f n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n long long int t; n cin >> t; n while (t--) { n int n, m; n cin >> n >> m; n vector v1(n), v2(m); n vector v; n for (auto &x : v1) cin >> x; n for (auto &x : v2) cin >> x; n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) { n if (v1[i] == v2[j]) v.push_back(v1[i]); n } n if (v.size()) { n cout << Yes << n ; n cout << 1 << << v[0] << n ; n } else n cout << No << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n static int LOCAL = 0; n const long long int mod = 1000000007ll; n const long long int MOD = 1000000009ll; n const long long int INF = LLONG_MAX / 10; n const int inf = INT_MAX / 10; n long long int powermod(long long int _a, long long int _b, n long long int _m = mod) { n long long int _r = 1; n while (_b) { n if (_b % 2 == 1) _r = (_r * _a) % _m; n _b /= 2; n _a = (_a * _a) % _m; n } n return _r; n } n long long int power(long long int _a, long long int _b) { n long long int _r = 1; n while (_b) { n if (_b % 2 == 1) _r = (_r * _a); n _b /= 2; n _a = (_a * _a); n } n return _r; n } n long long int add(long long int a, long long int b, long long int m = mod) { n long long int x = a + b; n while (x >= m) x -= m; n return x; n } n long long int sub(long long int a, long long int b, long long int m = mod) { n long long int x = a - b; n while (x < 0) x += m; n return x; n } n long long int mul(long long int a, long long int b, long long int m = mod) { n return ((a % m) * (b % m)) % m; n } n long long int gcd(long long int a, long long int b) { n while (a && b) a > b ? a %= b : b %= a; n return a + b; n } n long long int lcm(long long int a, long long int b) { n return (max(a, b) / gcd(a, b)) * min(a, b); n } n struct pair_hash { n std::size_t operator()(const std::pair &p) const { n auto h1 = std::hash{}(p.first); n auto h2 = std::hash{}(p.second); n return (int)add(h1, mul(h2, h1, MOD)); n } n }; n struct cmp { n bool operator()(pair > const &l, n pair > const &r) { n return l.second.first < r.second.first; n } n } myobject; n multiset second; n int main() { n int n, x; n cin >> n; n double sum = 0; n for (int i = 1; i <= n; i++) scanf( %d , &x), second.insert(x), sum += x; n double avg = sum / n; n int cnt = 0; n while (!(avg >= 4.50)) { n x = *second.begin(); n second.erase(second.begin()); n sum -= x; n sum += 5; n avg = sum / n; n cnt++; n } n cout << cnt; n return 0; n } n "} +{"func_code_string": "/* Author: EndlessK n * Time: 2021-05-06 20:40:25 n **/ n #include n #define maxn 100010 n #define pb push_back n #define ll long long n #define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0) n using namespace std; n int main() n { n fast; n int t; n cin>>t; n map mp; n while(t--) n { n int n; n int ans=0; n cin>>n; n for(int i=1;i<=min(9,n);i++) n { n ans++; n } n for(int i=11;i<=min(99,n);i+=11) n { n ans++; n } n for(int i=111;i<=min(999,n);i+=111) n { n ans++; n } n for(int i=1111;i<=min(9999,n);i+=1111) n { n ans++; n } n for(int i=11111;i<=min(99999,n);i+=11111) n { n ans++; n } n for(int i=111111;i<=min(999999,n);i+=111111) n { n ans++; n } n for(int i=1111111;i<=min(9999999,n);i+=1111111) n { n ans++; n } n for(int i=11111111;i<=min(99999999,n);i+=11111111) n { n ans++; n } n for(int i=111111111;i<=min(999999999,n);i+=111111111) n { n ans++; n } n cout< n using namespace std; n bool way[5003][5003]; n int dis[5003], counter; n vector > edge[5003], child[5003]; n priority_queue > pq[5003]; n void cari(int pos) { n int j, sz; n sz = edge[pos].size(); n for (j = 0; j < sz; ++j) { n if (way[pos][edge[pos][j].first]) { n way[pos][edge[pos][j].first] = false; n way[edge[pos][j].first][pos] = false; n child[pos].push_back(edge[pos][j]); n cari(edge[pos][j].first); n } n } n } n void cek(int posisi, int time) { n int i, j, x, size, sz; n sz = child[posisi].size(); n for (i = 0; i < sz; ++i) { n x = child[posisi][i].first; n size = child[posisi][i].second; n for (j = 0; j < size; ++j) { n if (pq[x].empty()) break; n pq[posisi].push(pq[x].top()); n if (posisi == 1) { n dis[pq[x].top().second] = time; n ++counter; n } n pq[x].pop(); n } n cek(x, time); n } n } n int main() { n int i, a, b, c, n, sz, arrive, dummy, division[5003]; n scanf( %d , &n); n for (i = 1; i <= n; ++i) scanf( %d , &division[i]); n memset(way, true, sizeof(way)); n for (i = 1; i < n; ++i) { n scanf( %d %d %d , &a, &b, &c); n edge[a].push_back(make_pair(b, c)); n edge[b].push_back(make_pair(a, c)); n } n cari(1); n for (i = 2; i <= n; ++i) pq[i].push(make_pair(-division[i], i)); n sz = child[1].size(); n dis[1] = 0; n int temp = 1; n counter = 1; n while (counter < n) { n cek(1, temp); n ++temp; n } n for (i = 1; i <= n; ++i) { n if (i != n) n printf( %d , dis[i]); n else n printf( %d n , dis[i]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long GCD(long long a, long long b) { n if (b == 0) return a; n return (a % b == 0 ? b : GCD(b, a % b)); n } n long long POW(long long base, long long exp) { n long long val; n val = 1; n while (exp > 0) { n if (exp % 2 == 1) { n val = (val * base) % 1000000007; n } n base = (base * base) % 1000000007; n exp = exp / 2; n } n return val; n } n int a[100005]; n int pos[100005]; n int main() { n int n, i, c, mx; n scanf( %d , &n); n for (i = 1; i <= n; i++) { n scanf( %d , &a[i]); n } n for (i = 1; i <= n; i++) { n pos[a[i]] = i; n } n mx = 0; n for (i = 1; i <= n; i++) { n c = 1; n while (i < n && pos[i + 1] > pos[i]) { n i++; n c++; n } n mx = max(mx, c); n } n printf( %d n , n - mx); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize(2) n using namespace std; n const int maxn = 2e5 + 10, mod = 1e9 + 7, inf = 0x3f3f3f3f; n int n, a[maxn]; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int _t; n cin >> _t; n while (_t--) { n cin >> n; n for (int i = 1; i <= n; i++) cin >> a[i]; n bool isok = true; n sort(a + 1, a + 1 + n); n for (int i = 2; i <= n; i++) n if (a[i] - a[i - 1] > 1) isok = false; n (isok ? cout << YES n : cout << NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000ll * 1000 * 1000 + 7; n int main() { n vector name; n string str; n int n, m; n cin >> n >> m; n for (int i = 0; i < n; i++) { n cin >> str; n name.push_back(str); n } n long long ans = 1ll; n for (int i = 0; i < m; i++) { n set s; n for (int j = 0; j < n; j++) s.insert(name[j][i]); n ans = (ans * s.size()) % mod; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[26]; n int A[26]; n string s, t; n int x1, x2; n char c; n int main() { n cin >> s >> t; n for (int i = 0; i < t.size(); i++) { n c = t[i]; n if (c > 96) n a[c - 97]++; n else n A[c - 65]++; n } n for (int i = 0; i < s.size(); i++) { n c = s[i]; n if (c > 96) { n if (a[c - 97]) { n a[c - 97]--; n x1++; n s[i] = 0 ; n } n } else if (A[c - 65]) { n A[c - 65]--; n x1++; n s[i] = 0 ; n } n } n for (int i = 0; i < s.size(); i++) { n c = s[i]; n if (c == 0 ) continue; n if (c >= 97) { n c = c - 32; n if (A[c - 65]) { n x2++; n A[c - 65]--; n } n } else { n c = c + 32; n if (a[c - 97]) { n x2++; n a[c - 97]--; n } n } n } n cout << x1 << << x2 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 200000 + 10; n int T, n, m, sum, du[maxn], K; n vector > p[maxn]; n struct node { n int x, y; n long long val; n bool operator<(const node i) const { return val < i.val; } n } a[maxn]; n queue q2; n int b[maxn], cnt; n long long dis[1000][1000]; n long long ans[maxn], sum1, INF; n int main() { n cin >> n >> m >> K; n for (int i = 1; i <= m; i++) { n scanf( %d %d %lld , &a[i].x, &a[i].y, &a[i].val); n } n sort(a + 1, a + m + 1); n int Mx = min(m, K); n memset(dis, 0x3f, sizeof(dis)); n INF = dis[0][0]; n for (int i = 1; i <= Mx; i++) { n if (!b[a[i].x]) { n cnt++; n b[a[i].x] = cnt; n } n if (!b[a[i].y]) { n cnt++; n b[a[i].y] = cnt; n } n dis[b[a[i].x]][b[a[i].y]] = dis[b[a[i].y]][b[a[i].x]] = a[i].val; n } n for (int i = 1; i <= cnt; i++) dis[i][i] = 0; n for (int k = 1; k <= cnt; k++) { n for (int i = 1; i <= cnt; i++) { n for (int j = 1; j <= cnt; j++) { n dis[i][j] = min(dis[i][k] + dis[k][j], dis[i][j]); n } n } n } n for (int i = 1; i <= cnt; i++) { n for (int j = i + 1; j <= cnt; j++) { n if (i != j && dis[i][j] != INF) { n ans[++sum1] = dis[i][j]; n } n } n } n sort(ans + 1, ans + sum1 + 1); n cout << ans[K] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct online_hull { n map points; n long long area; n inline online_hull() { n points.clear(); n area = 0; n } n inline map::iterator prev(map::iterator it) { n return it == points.begin() ? it : --it; n } n inline map::iterator next(map::iterator it) { n return it == points.end() ? it : ++it; n } n inline long long traparea(long long x1, long long y1, long long x2, n long long y2) { n return (x2 - x1) * (y1 + y2); n } n inline long long triarea(long long x1, long long y1, long long x2, n long long y2, long long x3, long long y3) { n return traparea(x1, y1, x2, y2) + traparea(x2, y2, x3, y3) + n traparea(x3, y3, x1, y1); n } n inline long long traparea(map::iterator a, n map::iterator b) { n return traparea(a->first, a->second, b->first, b->second); n } n inline long long triarea(map::iterator it) { n long long sum = 0; n if (it != points.begin()) sum += traparea(prev(it), it); n if (next(it) != points.end()) sum += traparea(it, next(it)); n if (it != points.begin() && next(it) != points.end()) n sum += traparea(next(it), prev(it)); n return sum; n } n inline bool bad(map::iterator it) { n if (points.size() < 3 || it == points.begin() || next(it) == points.end()) n return false; n return triarea(it) <= 0; n } n inline bool insert(int x, int y) { n if (points.find(x) != points.end()) { n if (y <= points[x]) return false; n area -= triarea(points.find(x)); n points.erase(x); n } n map::iterator it = points.insert(make_pair(x, y)).first; n if (bad(it)) { n points.erase(it); n return false; n } n area += triarea(it); n while (bad(prev(it))) { n area -= triarea(prev(it)); n points.erase(prev(it)); n } n while (bad(next(it))) { n area -= triarea(next(it)); n points.erase(next(it)); n } n return true; n } n inline bool contains(int x, int y) { n if (points.empty()) return false; n map::iterator first = points.begin(), last = prev(points.end()); n if (x < first->first || x > last->first) return false; n if (x == first->first) return y <= first->second; n if (x == last->first) return y <= last->second; n map::iterator it = points.lower_bound(x), p = prev(it); n return triarea(p->first, p->second, x, y, it->first, it->second) <= 0; n } n }; n int Q; n online_hull upper, lower; n int main() { n scanf( %d , &Q); n while (Q-- > 0) { n int type, x, y; n scanf( %d %d %d , &type, &x, &y); n if (type == 1) { n upper.insert(x, y); n lower.insert(x, -y); n } else if (type == 2) n puts((upper.contains(x, y) && lower.contains(x, -y)) ? YES : NO ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map id; n inline int getID(string s) { n if (id.find(s) == id.end()) { n int sz = id.size(); n id[s] = sz; n } n return id[s]; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int n, a, b, k, f; n cin >> n >> a >> b >> k >> f; n map, int> rcost; n int last = -1, sum = 0; n for (int i = 0; i < n; ++i) { n string u, v; n cin >> u >> v; n int su = getID(u); n int sv = getID(v); n if (last == su) { n rcost[pair(min(su, sv), max(su, sv))] += b; n sum += b; n } else { n rcost[pair(min(su, sv), max(su, sv))] += a; n sum += a; n } n last = sv; n } n vector diff; n for (auto it = rcost.begin(); it != rcost.end(); it++) { n int cost = it->second; n if (cost > f) { n diff.push_back(cost - f); n } n } n sort(diff.rbegin(), diff.rend()); n for (int i = 0; i < min((int)diff.size(), k); ++i) { n sum -= diff[i]; n } n cout << sum; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int two(int n) { return 1 << n; } n inline void set_bit(int& n, int b) { n |= two(b); } n inline void unset_bit(int& n, int b) { n &= ~two(b); } n inline int last_bit(int n) { return n & (-n); } n template n T gcd(T a, T b) { n return (b != 0 ? gcd(b, a % b) : a); n } n template n T lcm(T a, T b) { n return (a / gcd(a, b) * b); n } n int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1}; n const double pi = 2 * acos(0.0); n const int mod = 1000000; n int main() { n std::ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n ; n long long m, n; n cin >> m >> n; n double res = m; n for (int i = 1; i < m; i++) { n res -= pow(i / double(m), n); n } n cout << fixed << setprecision(10) << res; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2005; n const long long inf = 0x3f3f3f3f3f3f3f3f; n const int mod = 998244353; n vector ga[N], gb[N]; n int n, a, b; n int ca[N], cb[N]; n int dp[N][N][2]; n int ha[N], hb[N]; n int lfta[N], rgta[N], lftb[N], rgtb[N]; n int cnta, cntb; n int faa[N][11], fab[N][11]; n void dfsa(int u, int last) { n lfta[u] = ++cnta; n ha[u] = ha[last] + 1; n for (int i = 1; i < 11; i++) faa[u][i] = faa[faa[u][i - 1]][i - 1]; n for (auto v : ga[u]) { n if (v == last) continue; n faa[v][0] = u; n dfsa(v, u); n } n rgta[u] = cnta; n } n void dfsb(int u, int last) { n lftb[u] = ++cntb; n hb[u] = hb[last] + 1; n for (int i = 1; i < 11; i++) fab[u][i] = fab[fab[u][i - 1]][i - 1]; n for (auto v : gb[u]) { n if (v == last) continue; n fab[v][0] = u; n dfsb(v, u); n } n rgtb[u] = cntb; n } n int costa(int u, int v) { n int x = u; n if (!v) return ha[u] - 1; n for (int i = 10; i >= 0; i--) { n if (!faa[x][i]) continue; n if (lfta[faa[x][i]] <= lfta[v] && rgta[faa[x][i]] >= rgta[v]) continue; n x = faa[x][i]; n } n return ha[u] - ha[x] + 1; n } n int costb(int u, int v) { n int x = u; n if (!v) return hb[u] - 1; n for (int i = 10; i >= 0; i--) { n if (!fab[x][i]) continue; n if (lftb[fab[x][i]] <= lftb[v] && rgtb[fab[x][i]] >= rgtb[v]) continue; n x = fab[x][i]; n } n return hb[u] - hb[x] + 1; n } n int main() { n int i, j; n cin >> n; n cin >> a; n for (i = 2; i <= a; i++) { n int fa; n cin >> fa; n ga[i].push_back(fa); n ga[fa].push_back(i); n } n for (i = 1; i <= n; i++) cin >> ca[i]; n cin >> b; n for (i = 2; i <= b; i++) { n int fa; n cin >> fa; n gb[i].push_back(fa); n gb[fa].push_back(i); n } n for (i = 1; i <= n; i++) cin >> cb[i]; n dfsa(1, 0); n dfsb(1, 0); n memset(dp, 0x3f, sizeof(dp)); n dp[0][0][0] = dp[0][0][1] = 0; n for (i = 1; i <= n; i++) { n for (j = 0; j < i; j++) { n dp[i][j][0] = min(dp[i][j][0], dp[i - 1][j][0] + costa(ca[i], ca[i - 1])); n dp[i][j][1] = min(dp[i][j][1], dp[i - 1][j][1] + costb(cb[i], cb[i - 1])); n dp[i][i - 1][0] = n min(dp[i][i - 1][0], dp[i - 1][j][1] + costa(ca[i], ca[j])); n dp[i][i - 1][1] = n min(dp[i][i - 1][1], dp[i - 1][j][0] + costb(cb[i], cb[j])); n } n } n int ans = 0x3f3f3f3f; n for (i = 0; i < n; i++) { n ans = min(ans, dp[n][i][0]); n ans = min(ans, dp[n][i][1]); n } n cout << (a - 1) + (b - 1) - ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct th { n int id, num; n th() { id = 0, num = 0; } n th(int a, int b) { id = a, num = b; } n bool operator<(const th &a) const { n if (num != a.num) return num < a.num; n return id < a.id; n } n }; n set

 x; n vector ns[1000005]; n int n, m; n int hp[1000005]; n long long dv = 0; n int a[1000005]; n long long sm = 0; n void work(int bg, int n) { n if (!n) n return; n else { n if (bg == m) a[bg] = n; n while (1) { n set::iterator t = x.end(); n t--; n if ((*t).num < n) break; n th n1 = (*t); n x.erase(n1); n int nd = n1.num / n; n for (int j = bg; j <= m; j++) n for (int tm = 0; tm < nd; tm++) ns[j].push_back(n1.id); n sm -= nd * n; n n1.num %= n; n x.insert(n1); n } n if (bg == m) return; n set::iterator q = x.begin(); n int nt = sm / n; n a[bg] = (*q).num; n ns[bg].push_back((*q).id); n x.erase(q); n sm -= nt * a[bg]; n if (a[bg]) { n set::iterator t = x.begin(); n for (int j = 1; j < nt; j++) { n th q1 = *t; n t++; n x.erase(q1); n ns[bg].push_back(q1.id); n q1.num -= a[bg]; n x.insert(q1); n } n } n work(bg + 1, n - a[bg]); n } n } n int main() { n scanf( %d%d , &n, &m); n long long sum = 0; n for (int i = 1; i <= m; i++) { n scanf( %d , &hp[i]); n sum += hp[i]; n } n dv = sum / n; n if (sum % n) dv++; n sum = dv * n; n sm = sum; n for (int i = 1; i < m; i++) sum -= hp[i]; n hp[m] = sum; n for (int i = 1; i <= m; i++) x.insert(th(i, hp[i])); n work(1, n); n cout << dv << endl; n for (int i = 1; i <= m; i++) printf( %d , a[i]); n printf( n ); n for (int j = 1; j <= m; j++) n while (ns[j].size() < dv) ns[j].push_back(1); n for (int i = 1; i <= dv; i++) { n for (int j = 1; j <= m; j++) printf( %d , ns[j][i - 1]); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, m; n int arr[50]; n int sub[50]; n int result = 0; n int task_tot_time = 0; n void take(int score, int t) { n if (0 >= t) return; n int tt = t; n int ss = score; n for (decltype(0) i = 0; i < k; i++) { n int su = sub[i]; n while (su > 0) { n if (arr[i] > tt) break; n ss++; n tt -= arr[i]; n su--; n } n } n result = max(result, ss); n if (t >= task_tot_time) { n int task_left = sub[0]; n for (decltype(1) i = 1; i < k; i++) task_left = min(task_left, sub[i]); n if (task_left == 0) return; n for (decltype(0) i = 0; i < k; i++) sub[i]--; n result = max(result, score + k + 1); n take(score + k + 1, t - task_tot_time); n } n } n int main() { n scanf( %d , &n) == 0, scanf( %d , &k) == 0, scanf( %d , &m) == 0; n for (decltype(0) i = 0; i < k; i++) { n scanf( %d , &arr[i]) == 0; n task_tot_time += arr[i]; n } n for (decltype(0) i = 0; i < k; i++) sub[i] = n; n sort(arr, arr + k); n take(0, m); n printf( %d , result); n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 110; n const int MOD = 1e9 + 7; n long long n, k, dp[MAXN][MAXN][MAXN], local[MAXN][MAXN]; n vector adj[MAXN]; n void add(long long& v, long long u) { v = (v + u) % MOD; } n void dfs(int v, int par = -1) { n dp[v][1][0] = dp[v][0][1] = 1; n for (auto i : adj[v]) { n if (i == par) continue; n dfs(i, v); n for (int w = 0; w < 23; w++) n for (int j = 0; j < 50; j++) { n local[w][j] = dp[v][w][j]; n dp[v][w][j] = 0; n } n for (int a = 0; a <= (k + 1); a++) n for (int b = 0; b <= (2 * k + 1); b++) n for (int c = 0; c <= (k + 1); c++) n for (int d = 0; d <= (2 * k + 1); d++) { n int locala = 0; n if (!d) locala = b; n if (!b && d) locala = d + 1; n if (b && d) locala = min(b, d + 1); n int localb = a; n if (localb && locala) { n if ((localb - 1 + locala - 1) <= k) localb = 0; n } n int localc = c; n if (localc) localc++; n if (localc && locala) { n if ((locala - 1 + localc - 1) <= k) localc = 0; n } n int locald = 0; n if (!localc) locald = localb; n if (!localb && localc) locald = localc; n if (localb && localc) locald = max(localc, localb); n if (locald <= (k + 1) && locala <= (2 * k + 3)) n add(dp[v][locald][locala], local[a][b] * dp[i][c][d] % MOD); n } n } n } n int main() { n ios::sync_with_stdio(0); n cin >> n >> k; n for (int i = 1; i < n; i++) { n int u, v; n cin >> u >> v; n adj[u].push_back(v); n adj[v].push_back(u); n } n dfs(1); n long long answer = 0; n for (int i = 0; i <= (2 * k + 3); i++) answer = (answer + dp[1][0][i]) % MOD; n cout << answer << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long arr[200200]; n int main() { n string a, b; n cin >> a >> b; n long long x = 0, y = 0; n for (int i = 0; i <= b.size() - a.size(); i++) x += (b[i] - 0 ); n for (int i = 0; i < a.size(); i++) { n y += (a[i] == 0 ) ? x : (b.size() - a.size() + 1) - x; n x += b[b.size() - a.size() + 1 + i] - b[i]; n } n cout << y; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void Heap(int A[], int n, int l, int r) { n int x, i, j; n x = A[l]; n i = l; n while (1) { n j = 2 * i; n if (j > r) break; n if (j < r && A[j + 1] >= A[j]) j++; n if (x >= A[j]) break; n A[i] = A[j]; n i = j; n } n A[i] = x; n } n void HeapSort(int A[], int n) { n int l, r, temp; n l = n / 2; n while (l >= 0) { n Heap(A, n, l, n - 1); n l--; n } n r = n - 1; n while (r >= 1) { n temp = A[0]; n A[0] = A[r]; n A[r] = temp; n r--; n Heap(A, n, 0, r); n } n } n int mini(int a, int b, int c = 1000000010) { n if (a <= b && a <= c) n return a; n else if (b <= c && b <= a) n return b; n else n return c; n } n int maxi(int a, int b) { n if (a > b) n return a; n else n return b; n } n unsigned long long int fac(unsigned long long int a) { n unsigned long long int r = 1; n for (int i = 2; i <= a; i++) r *= i; n return r; n } n bool issimple(unsigned long long n) { n for (unsigned long long i = 2; i <= sqrt(n); i++) n if (n % i == 0) return false; n return true; n } n unsigned long long nod(unsigned long long a, unsigned long long b) { n unsigned long long temp; n while (b) { n a %= b; n temp = a; n a = b; n b = temp; n } n return a; n } n unsigned long long nok(unsigned long long a, unsigned long long b, n unsigned long long nod) { n return a / nod * b; n } n int main() { n int x, y, count, t, i, n, k, m; n bool flag; n cin >> t; n while (t--) { n cin >> n; n count = n / 2 + n % 2; n cout << count << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n long long dot(complex c1, complex c2) { n return imag(c1 * conj(c2)); n } n double dot(complex c1, complex c2) { n return imag(c1 * conj(c2)); n } n long long point(complex c1, complex c2) { n return real(c1 * conj(c2)); n } n double point(complex c1, complex c2) { n return real(c1 * conj(c2)); n } n void solve() { n long double n, pi2, alpha, res; n pi2 = acos(0.0); n cin >> n; n alpha = pi2 * (n - 1.0) / n; n res = tan(alpha); n cout << res << endl; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int t, cases; n cin >> cases; n cout << fixed << setprecision(10); n for (t = 0; t < cases; t++) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n if (n % 47 == 0 || n % 744 == 0 || n % 4 == 0 || n % 7 == 0 || n % 44 == 0 || n n % 444 == 0 || n % 777 == 0 || n % 74 == 0 || n % 447 == 0 || n n % 474 == 0 || n % 477 == 0) { n cout << YES ; n } else { n cout << NO ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 45; n int nd, nm, G[N][N]; n int cntClique, pts[N], res[N], cnt[N]; n map H; n int n; n vector v; n bool dfs(int pos, int num) { n for (int i = pos + 1; i <= n; ++i) { n if (cnt[i] + num <= cntClique) return false; n if (G[pos][i]) { n int ok = 1; n for (int id = 1; id <= num; ++id) { n if (!G[i][pts[id]]) { n ok = 0; n break; n } n } n if (ok) { n pts[num + 1] = i; n if (dfs(i, num + 1)) return true; n } n } n } n if (num > cntClique) { n for (int i = 1; i <= num; ++i) { n res[i] = pts[i]; n } n cntClique = num; n return true; n } n return false; n } n void maxClique() { n cntClique = -1; n for (int i = n; i > 0; --i) { n pts[1] = i; n dfs(i, 1); n cnt[i] = cntClique; n } n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n memset(G, 1, sizeof G); n cin >> nd >> nm; n for (int i = 1; i <= nd; ++i) { n int op; n string s; n cin >> op; n if (op == 1) { n v.clear(); n } else { n cin >> s; n if (!H.count(s)) { n H[s] = ++n; n } n int y = H[s]; n for (auto& x : v) { n G[x][y] = 0; n G[y][x] = 0; n } n v.push_back(y); n } n } n maxClique(); n if (cntClique < 0) { n cout << 0 ; n } else { n cout << cntClique; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void _print(long long int t) { cerr << t; } n void _print(int t) { cerr << t; } n void _print(string t) { cerr << t; } n void _print(char t) { cerr << t; } n void _print(long double t) { cerr << t; } n void _print(double t) { cerr << t; } n void _print(unsigned long long t) { cerr << t; } n bool cmp(pair a, n pair b) { n if (a.first != b.first) n return a.first > b.first; n else n return a.second > b.second; n } n long long int binarySearch(vector v, long long int l, n long long int r, long long int x) { n while (l <= r) { n long long int mid = l + (r - l) / 2; n if (v[mid] == x) n return mid; n else if (v[mid] < x) n l = mid + 1; n else n r = mid - 1; n } n return -1; n } n long long int power(long long int x, long long int n) { n if (n == 0) n return 1; n else if (n % 2 == 0) n return power(x * x, n / 2); n else n return x * power(x * x, (n - 1) / 2); n } n long long int ModularExpo(long long int x, long long int y, long long int p) { n long long int res = 1; n x = x % p; n if (x == 0) return 0; n while (y > 0) { n if (y & 1) res = (res * x) % p; n y = y >> 1; n x = (x * x) % p; n } n return res; n } n void solve() { n long long int n; n cin >> n; n for (long long int i = 0; i < n; i++) cout << i + 2 << ; n cout << n ; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n long long int t; n cin >> t; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 100001; n int n, m, x, y, b, r, p, l, ri; n long long ans; n vector B, R, P; n int bef(int x, int c) { n if (!c) return (lower_bound(B.begin(), B.end(), x) - B.begin() - 1); n return (lower_bound(R.begin(), R.end(), x) - R.begin() - 1); n } n int aft(int x, int c) { n if (!c) return (lower_bound(B.begin(), B.end(), x) - B.begin()); n return (lower_bound(R.begin(), R.end(), x) - R.begin()); n } n long long get(int x) { n long long mn = ri - B[x]; n for (int i = x; i < b && B[i] < ri; i++) { n long long left = B[i] - l, right = 0; n if (i + 1 != b && B[i + 1] < ri) right = ri - B[i + 1]; n mn = min(mn, left + right); n } n return mn; n } n long long get1(int x) { n long long mn = ri - R[x]; n for (int i = x; i < r && R[i] < ri; i++) { n long long left = R[i] - l, right = 0; n if (i + 1 != r && R[i + 1] < ri) right = ri - R[i + 1]; n mn = min(mn, left + right); n } n return mn; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n cin >> n; n for (int i = 0; i < n; i++) { n char c; n cin >> x >> c; n if (c == B ) n B.push_back(x); n else if (c == R ) n R.push_back(x); n else n P.push_back(x); n } n b = B.size(); n r = R.size(); n p = P.size(); n if (!P.size()) { n if (b) ans = B[b - 1] - B[0]; n if (r) ans += R[r - 1] - R[0]; n cout << ans; n return 0; n } n x = bef(P[0], 0); n y = bef(P[0], 1); n if (x >= 0) ans += P[0] - B[0]; n if (y >= 0) ans += P[0] - R[0]; n x = aft(P[p - 1], 0); n y = aft(P[p - 1], 1); n if (x != B.size()) ans += B[b - 1] - P[p - 1]; n if (y != R.size()) ans += R[r - 1] - P[p - 1]; n for (int i = 0; i < p - 1; i++) { n l = P[i]; n ri = P[i + 1]; n long long dist = ri - l; n int x = aft(l, 0), y = aft(l, 1); n if ((x == b || B[x] > ri) && (y == r || R[y] > ri)) { n ans += dist; n continue; n } n long long mn = 2 * dist; n long long k = dist; n if (x < b && B[x] < ri) k += get(x); n if (y < r && R[y] < ri) k += get1(y); n ans += min(mn, k); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 2 * int(1e9); n const long long INFll = 1ll * int(1e9) * int(1e9); n const int MOD = 1000000007; n template n ostream& operator<<(ostream& out, pair& a) { n out << a.first << << a.second; n return out; n } n template n istream& operator>>(istream& in, pair& a) { n in >> a.first >> a.second; n return in; n } n template n ostream& operator<<(ostream& out, vector > a) { n for (int i = 0; i < a.size(); ++i) out << a[i] << endl; n return out; n } n template n istream& operator>>(istream& in, vector& a) { n for (int i = 0; i < a.size(); ++i) in >> a[i]; n return in; n } n template n ostream& operator<<(ostream& out, vector a) { n for (int i = 0; i < a.size(); ++i) n if (i == a.size() - 1) n out << a[i]; n else n out << a[i] << ; n return out; n } n struct IN { n bool any; n operator bool() const { return any; } n } CIN; n inline IN& operator>>(IN& in, int& x) { n x = 0, in.any = 0; n char c; n while ((c = getchar()) > 0) { n if (c < 48 || c > 57) n if (in.any) n return in; n else n continue; n in.any = 1, x = x * 10 + c - 0 ; n } n return in; n } n int main() { n ios_base::sync_with_stdio(0); n int q; n CIN >> q; n while (q--) { n int n, m; n CIN >> n >> m; n vector > a(n, vector(m)); n for (int i = 0; i < n; ++i) n for (int j = 0; j < m; ++j) CIN >> a[i][j]; n int sum = 0; n for (int j = 0; j < m; ++j) sum += abs(a[n / 2][j] - a[n / 2 - 1][j]); n if (sum / long double(m) > 17) n cout << YES n ; n else n cout << NO n ; n if (0) cerr << sum / long double(m) << endl; n } n if (0) n cerr << fixed << setprecision(0) n << TIME = << clock() / (long double)CLOCKS_PER_SEC * 1000 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n void dir(char& smb, int& x, int& y) { n if (smb == L ) n x--; n else if (smb == R ) n x++; n else if (smb == U ) n y++; n else n y--; n } n void solve() { n int n; n cin >> n; n string s; n cin >> s; n map, int> mpp; n int x = 0, y = 0; n mpp[make_pair(0, 0)] = 0; n int mn = n + 5, l = -1, r = n + 1; n for (int i = 1; i < n + 1; i++) { n char smb = s[i - 1]; n dir(smb, x, y); n auto it = mpp.find(make_pair(x, y)); n if (it != mpp.end()) { n pair, int> p = *it; n int ind = p.second; n if (i - ind - 1 < mn) { n mn = i - ind - 1; n l = ind; n r = i - 1; n } n } n mpp[make_pair(x, y)] = i; n } n if (l == -1) n cout << -1 n ; n else n cout << l + 1 << << r + 1 << n ; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int tc; n cin >> tc; n while (tc--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, x1, y1, x2, y2; n cin >> n >> m >> x1 >> y1 >> x2 >> y2; n int x = abs(x1 - x2), y = abs(y1 - y2); n if (x <= 4 && y <= 4 && x + y <= 6) n cout << First << endl; n else n cout << Second << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long mod = 1e9 + 7; n template n void print(vector v) { n for (T &i : v) cout << i << ; n cout << n ; n } n void solve() { n unsigned long long int n, x; n cin >> n >> x; n vector v(n); n for (unsigned long long int &i : v) cin >> i; n sort(v.begin(), v.end()); n unsigned long long int sum = 0; n for (unsigned long long int i : v) { n sum += i * x; n if (x > 1) x--; n } n cout << sum << n ; n } n int main() { n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); n int tcs = 1; n while (tcs--) solve(); n return 0; n } n "} +{"func_code_string": "#include n int main() { n long long n, m; n int dig[10]; n char cn[12], cm[12]; n while (scanf( %s n%s , &cn, &cm) != EOF) { n if (strlen(cn) != strlen(cm)) { n printf( WRONG_ANSWER n ); n continue; n } n n = atol(cn); n m = atol(cm); n for (int i = 0; i < 10; i++) dig[i] = 0; n if (n < 10) { n if (n == m) n printf( OK n ); n else n printf( WRONG_ANSWER n ); n } else { n while (n) { n dig[n % 10]++; n n /= 10; n } n long long ret = 0; n for (int i = 1; i <= 9; i++) { n if (dig[i]) { n ret *= 10; n ret += i; n dig[i]--; n break; n } n } n for (int i = 0; i <= 9; i++) { n while (dig[i]) { n ret *= 10; n ret += i; n dig[i]--; n } n } n if (ret == m) n printf( OK n ); n else n printf( WRONG_ANSWER n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void input(long &n) { scanf( %ld , &n); } n void output(long n) { printf( %ld , n); } n void input(long &n, long a[]) { n input(n); n for (long i = 1; i <= n; i++) input(a[i]); n } n bool test(long n, long a[], long id1, long id2, long tid, vector &st1, n vector &st2) { n st1.clear(); n st2.clear(); n st1.push_back(a[id1]); n st1.push_back(a[id2]); n long isize2; n if (tid == -1) { n isize2 = 0; n } else { n isize2 = 1; n st2.push_back(a[tid]); n } n long seed = a[id2] - a[id1]; n long seed2 = 0; n long nextnum2 = 0; n long nextnum = a[id2] + seed; n for (long i = id2 + 1; i <= n; i++) { n if (isize2 >= 2 && a[i] == nextnum && a[i] == nextnum2) { n if (i == n) { n nextnum += seed; n st1.push_back(a[i]); n } else if (nextnum + seed == a[i + 1]) { n nextnum += seed; n st1.push_back(a[i]); n } else if (nextnum2 + seed2 == a[i + 1]) { n st2.push_back(a[i]); n nextnum2 += seed2; n isize2++; n } else n return false; n } else if (a[i] == nextnum) { n nextnum += seed; n st1.push_back(a[i]); n } else { n if (isize2 >= 2) { n if (nextnum2 == a[i]) { n st2.push_back(a[i]); n isize2++; n nextnum2 += seed2; n } else if (isize2 == 2) { n st2.push_back(st2[1]); n isize2++; n st2[1] = st1.back(); n st1.pop_back(); n if (st2[2] - st2[1] != st2[1] - st2[0]) return false; n seed2 = st2[2] - st2[1]; n nextnum2 = st2[2] + seed2; n i--; n } else n return false; n } else { n st2.push_back(a[i]); n isize2++; n if (isize2 == 2) { n seed2 = st2[1] - st2[0]; n nextnum2 = st2[1] + seed2; n } n } n } n } n if (seed == 0 && st1.size() > 2) return false; n if (seed2 == 0 && st2.size() > 2) return false; n if (isize2 == 0) return false; n return true; n } n bool solve(long n, long a[], vector &st1, vector &st2) { n if (n == 2) { n st1.push_back(a[1]); n st2.push_back(a[2]); n return true; n } else if (n == 3 && a[1] == a[2] && a[2] == a[3]) { n st1.push_back(a[1]); n st1.push_back(a[1]); n st2.push_back(a[1]); n return true; n } else if (n == 4 && a[1] == a[2] && a[2] == a[3] && a[3] == a[4]) { n st1.push_back(a[1]); n st1.push_back(a[1]); n st2.push_back(a[1]); n st2.push_back(a[1]); n return true; n } n if (test(n, a, 1, 3, 2, st1, st2)) return true; n if (test(n, a, 2, 3, 1, st1, st2)) return true; n if (test(n, a, 1, 2, -1, st1, st2)) return true; n return false; n } n void output(bool res, vector &st1, vector &st2) { n if (res) { n for (vector::iterator it = st1.begin(); it < st1.end(); it++) n printf( %ld , *it); n printf( n ); n for (vector::iterator it = st2.begin(); it < st2.end(); it++) n printf( %ld , *it); n } else n cout << No solution n ; n } n long n, a[30010 + 1]; n vector st1, st2; n int main() { n input(n, a); n bool res = solve(n, a, st1, st2); n output(res, st1, st2); n } n "} +{"func_code_string": "#include n using namespace std; n int a1, a2; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> a1 >> a2; n int res = 0; n if (a1 == 1 && a2 == 1) { n cout << 0 << n ; n return 0; n } n while (a1 > 0 && a2 > 0) { n if (a1 < a2) n ++a1, a2 -= 2; n else n ++a2, a1 -= 2; n ++res; n } n cout << res << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b = 1, c = 2, o = 1, j, k; n cin >> a; n int p = a / 2; n for (k = 0; k < a; k++) { n for (j = 0; j < p; j++) { n cout << c << ; n c += 2; n } n for (j = 0; j < a - p * 2; j++) { n cout << b << ; n b += 2; n } n for (int j = 0; j < p; j++) { n cout << c << ; n c += 2; n } n cout << endl; n if (p == 0) o = 0; n if (o == 0) n p++; n else n p--; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using namespace std; n int ar[30005]; n int dp1[30005][205][2], dp2[30005][205][2][5]; n int main() { n int n, k; n scanf( %d%d , &n, &k); n for (int i = 1; i <= n; i++) scanf( %d , &ar[i]), ar[i] += ar[i - 1]; n fill(dp1[0][0], dp1[n][k] + 2, -1000000000); n fill(dp2[0][0][0], dp2[n][k][1] + 5, -1000000000); n dp1[0][0][0] = 0; n dp1[0][0][1] = 0; n for (int i = 0; i < 2; i++) n for (int j = -2; j <= 2; j++) dp2[1][1][i][j + 2] = j * ar[1]; n for (int i = 1; i <= n; i++) n for (int j = 0; j <= k; j++) n for (int l = 0; l < 2; l++) { n int &tmp = dp1[i][j][l]; n if (!j) n tmp = 0; n else { n tmp = max(tmp, dp1[i - 1][j][l]); n int l1 = (!l ? 0 : 2), l2 = l1 - 2; n if (j == 1) n l1--, l2++; n else if (j == k) n l1 = 1, l2 = -1; n tmp = max(tmp, dp2[i][j][0][l1 + 2]); n tmp = max(tmp, dp2[i][j][1][l2 + 2]); n } n for (int r = -1 - (l != 0); r <= 2 - (l != 0); r++) n dp2[i + 1][j + 1][(l != 0)][r + 2] = n max(dp2[i][j + 1][(l != 0)][r + 2], tmp) + n r * (ar[i + 1] - ar[i]); n } n printf( %d n , max(dp1[n][k][0], dp1[n][k][1])); n } n "} +{"func_code_string": "#include n using namespace std; n void aayush() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n } n int main() { n aayush(); n long long int t; n cin >> t; n while (t--) { n long long int n; n cin >> n; n if (n % 4 == 0) { n cout << YES << endl; n } else { n cout << NO << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, h; n pair arr[100010]; n int res[100010]; n int ptr = -1; n int cnt, bits; n int main() { n cin >> n >> h; n for (int i = 0; i < n; i++) { n scanf( %d , &arr[i].first); n arr[i].second = i; n res[i] = 1; n } n sort(arr, arr + n); n int ans = arr[n - 1].first + arr[n - 2].first - arr[0].first - arr[1].first; n for (int i = n - 2; i >= 0; i--) { n int mx = arr[i].first + arr[n - 1].first + h; n if (i < n - 2) mx = max(mx, arr[n - 1].first + arr[n - 2].first); n int init = min(7, i); n int col[7]; n if (i <= 6) { n col[i] = 2; n for (int j = i + 1; j < min(n, 7); j++) col[j] = 1; n } n for (int j = 0; j < (1 << init); j++) { n for (int k = 0; k < init; k++) { n col[k] = ((j & (1 << k)) ? 1 : 2); n } n int mn = 1000000000; n for (int k = 0; k < min(n, 7); k++) { n for (int l = k + 1; l < min(n, 7); l++) { n int val = arr[k].first + arr[l].first; n if (col[k] != col[l]) val += h; n mn = min(mn, val); n } n } n int dif = mx - mn; n if (dif < ans) { n ans = dif; n ptr = i; n cnt = init; n bits = j; n } n } n } n if (ptr != -1) { n for (int i = 0; i < cnt; i++) { n res[arr[i].second] = ((bits & (1 << i)) ? 1 : 2); n } n res[arr[ptr].second] = 2; n for (int i = ptr + 1; i < n; i++) res[arr[i].second] = 1; n } n cout << ans << endl; n for (int i = 0; i < n; i++) { n if (i) printf( ); n printf( %d , res[i]); n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long add(long long a, long long b) { n return (a % 1000000007 + b % 1000000007) % 1000000007; n } n inline long long mul(long long a, long long b) { n return (a % 1000000007 * b % 1000000007) % 1000000007; n } n long long pwr(long long a, long long b) { n if (!b) return 1ll; n long long t = pwr(a, b / 2); n t = mul(t, t); n if (b & 1) t = mul(t, a); n return t; n } n long long modinv(long long a, long long b = 1000000007) { n return pwr(a, b - 2); n } n long long gcd(long long a, long long b) { n if (!b) return a; n return gcd(b, a % b); n } n long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n int n, a, b, c, d; n cin >> n >> a >> b >> c >> d; n int x = a - b, y = a + b; n int p = c - d, q = c + d; n int mn = x * n, flag = 1; n for (int i = 1; i <= n; i++) { n if (mn <= q && mn >= p) { n flag = 0; n break; n } n if (mn < p) { n int diff = p - mn; n mn += min(diff, 2 * b); n } n } n if (mn <= q && mn >= p) { n flag = 0; n } n if (flag) n cout << No n ; n else n cout << Yes n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, a, b, i, a1, b1, y, y1, ans, ans1, ans2, x; n cin >> n >> a >> b; n for (i = 1; i <= n; i++) { n cin >> x; n y = x * a; n ans = y % b; n if (a != 0) n cout << ans / a << ; n else n cout << x << ; n } n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:16777216 ) n using namespace std; n int dp[100005][30] = {0}; n int A[40][40] = {0}; n int main() { n string s, b; n cin >> s; n int k; n cin >> k; n for (int i = 0; i < k; i++) { n cin >> b; n int x, y; n x = b[0] - a ; n y = b[1] - a ; n A[x][y] = A[y][x] = 1; n } n int n = s.length(); n for (int i = 1; i <= n; i++) n for (int k = 0; k < 26; k++) { n dp[i][k] = dp[i - 1][k]; n for (int j = 0; j < 26; j++) n if (!A[k][j] && s[i - 1] - a == k) n dp[i][k] = max(dp[i][k], dp[i - 1][j] + 1); n } n int res = 0; n for (int i = 0; i < 26; i++) { n res = max(res, dp[n][i]); n } n cout << n - res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 100005; n const long long oo = ((long long)1e18) + 7; n int N, M, T, K, Q; n vector G[MAXN]; n int num[MAXN]; n int dep[MAXN]; n int pa[MAXN][25]; n int LOG = 20; n int cnt = 0; n int child[MAXN]; n int DFS(int u, int par, int depth) { n num[u] = ++cnt; n dep[num[u]] = depth; n pa[num[u]][0] = num[par]; n for (auto v : G[u]) n if (v != par) { n child[num[u]] += DFS(v, u, dep[num[u]] + 1); n } n return child[num[u]]; n } n int LCA(int u, int v) { n if (u == v) return u; n if (dep[u] < dep[v]) swap(u, v); n for (int i = LOG; i >= 0; i--) n if (dep[pa[u][i]] >= dep[v]) u = pa[u][i]; n if (u == v) return u; n for (int i = LOG; i >= 0; i--) n if (pa[u][i] != pa[v][i]) { n u = pa[u][i]; n v = pa[v][i]; n } n return pa[u][0]; n } n int findParent(int u, int k) { n if (k == 0) return u; n int i = 0; n while (k > 0) { n if (k & 1) u = pa[u][i]; n i++; n k >>= 1; n } n return u; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n if (fopen( 519E n .inp , n r )) { n freopen( n 519E n .inp , n r , stdin); n freopen( n 519E n .out , n w , stdout); n } n cin >> N; n for (int i = 1; i < N; i++) { n int u, v; n cin >> u >> v; n G[u].push_back(v); n G[v].push_back(u); n } n for (int i = 1; i <= N; i++) child[i] = 1; n dep[0] = -1; n DFS(1, 0, 0); n for (int k = 1; k <= LOG; k++) n for (int i = 1; i <= N; i++) pa[i][k] = pa[pa[i][k - 1]][k - 1]; n cin >> Q; n while (Q--) { n int u, v; n cin >> u >> v; n u = num[u]; n v = num[v]; n if (dep[u] < dep[v]) swap(u, v); n int p = LCA(u, v); n if (u == v) { n cout << N << n ; n continue; n } n int diff1 = dep[u] - dep[p]; n int diff2 = dep[v] - dep[p]; n if ((diff1 + diff2) & 1) { n cout << 0 << n ; n continue; n } n int avg = (diff1 + diff2) >> 1; n int mid = findParent(u, avg); n if (mid == p) { n int fakeParent1 = findParent(u, diff1 - 1); n int fakeParent2 = findParent(v, diff2 - 1); n cout << (child[mid] - child[fakeParent1] - child[fakeParent2]) + N - n child[mid] n << n ; n continue; n } n diff1 = dep[u] - dep[mid]; n int fakeParent1 = findParent(u, diff1 - 1); n cout << child[mid] - child[fakeParent1] << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n bool checkPal(string s) { n for (int i = 0, j = s.size() - 1; i <= j; i++, j--) { n if (s[i] != s[j]) { n return false; n } n } n return true; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n for (int i = 0; i < t; i++) { n string s; n cin >> s; n map m; n for (int j = 0; j < s.size(); j++) { n m[s[j]]++; n } n string ch = ; n for (auto it = m.rbegin(); it != m.rend(); it++) { n pair p = *it; n char c = p.first; n int cnt = p.second; n for (int j = 0; j < cnt; j++) { n ch += c; n } n } n if (!checkPal(ch)) { n cout << ch << endl; n } else { n cout << -1 << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[1000010]; n pair st[1000010]; n bool check(pair a, pair b, n pair c) { n double k1 = 1.0 * (b.second - a.second) / (b.first - a.first); n double k2 = 1.0 * (c.second - b.second) / (c.first - b.first); n if (k1 > k2) return 1; n return 0; n } n int main() { n int n; n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n a[i] += a[i - 1]; n } n int top = 0; n st[top++] = make_pair(0, 0); n for (int i = 1; i <= n; i++) { n pair tmp = make_pair(i, a[i]); n while (top > 1 && check(st[top - 2], st[top - 1], tmp)) top--; n st[top++] = tmp; n } n for (int i = 0; i < top - 1; i++) { n long long l = st[i].first, r = st[i + 1].first, n tot = st[i + 1].second - st[i].second; n for (int j = l + 1; j <= r; j++) { n printf( %.9f n , 1.0 * tot / (r - l)); n } n } n return 0; n } n "} +{"func_code_string": "#include n int A[50], B[50]; n int main() { n int N, M, i, j, Max, now, Cnt; n while (scanf( %d , &N) != EOF) { n for (i = 0; i < N; ++i) { n scanf( %d , &A[i]); n } n scanf( %d , &M); n for (i = 0; i < M; ++i) { n scanf( %d , &B[i]); n } n for (Max = i = 0; i < N; ++i) { n for (j = 0; j < M; ++j) { n now = B[j] / A[i]; n if (now * A[i] == B[j] && Max < now) { n Max = now; n } n } n } n for (Cnt = i = 0; i < N; ++i) { n for (j = 0; j < M; ++j) { n now = B[j] / A[i]; n if (now * A[i] == B[j] && Max == now) { n ++Cnt; n } n } n } n printf( %d n , Cnt); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n = 5; n int arr[5], sum = 0; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n sum += arr[i]; n } n if (sum == 0) n cout << -1 << endl; n else if (sum % 5 != 0) n cout << -1 << endl; n else { n int s = sum / 5; n int a = 0, b = 0; n for (int i = 0; i < n; i++) { n if (arr[i] > s) n a += s - arr[i]; n else n b += arr[i] - s; n } n if (a == b) n cout << s << endl; n else n cout << -1 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 840; n long long cnt[10]; n long long f[10][N]; n int main() { n long long w; n cin >> w; n for (int i = 1; i <= 8; i++) cin >> cnt[i]; n memset(f, 0xcf, sizeof f); n f[0][0] = 0; n long long res = 0; n for (int i = 1; i <= 8; i++) { n for (int j = 0; j < 840 / i && j <= cnt[i]; j++) { n for (int k = 0; k < 840; k++) { n int a = (k + j * i) / 840; n int b = (k + j * i) % 840; n f[i][b] = max(f[i][b], f[i - 1][k] + a + (cnt[i] - j) * i / 840); n if (b <= w) res = max(res, min(f[i][b], (w - b) / 840) * 840 + b); n } n } n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n while (t--) { n long long int n, a, b; n cin >> n >> a >> b; n string s; n cin >> s; n long long int ans = n * (a + 2 * b) + 2 * a; n int st = 0, en = 0; n while (en < n and s[en] == 0 ) en++; n if (en == n) { n ans = n * a + (n + 1) * b; n cout << ans << n ; n continue; n } n ans -= (en - 1) * b; n while (en != n) { n st = en; n while (s[st] != 0 ) st++; n en = st; n while (en < n and s[en] == 0 ) en++; n if (en == n) { n ans -= (en - st - 1) * b; n break; n } n if (en - st != 1 and 2 * a < (en - st - 1) * b) n ans += 2 * a - (en - st - 1) * b; n } n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n const int kN = 18; n const int kT = 1 << kN; n const int kInf = 0x3f3f3f3f; n int a[kT]; n bool fan_of[kT]; n std::map, int> cal[4]; n int Cal(int l, int r, int st) { n if (r == l + 2) { n int cnt_fan = (int)fan_of[l] + fan_of[l + 1], cnt_st = (st & 1) + (st >> 1); n return cnt_fan == cnt_st ? std::min(cnt_st, 1) : -kInf; n } n std::pair tmp = std::make_pair(l, r); n if (cal[st].count(tmp)) return cal[st][tmp]; n int mid = (l + r) >> 1, ret = -kInf; n for (int i = 0; i < 4; ++i) n for (int j = 0; j < 4; ++j) { n int v1 = ((i << 1) | (i & 2) | j) & 3, v2 = ((j << 1) | (j & 2) | i) & 3; n if (v1 == st || v2 == st) { n ret = std::max(ret, Cal(l, mid, i) + Cal(mid, r, j)); n } n } n return cal[st][tmp] = ret + st; n } n int main() { n int n, k, t, ans = 0; n scanf( %d%d , &n, &k); n t = 1 << n; n for (int i = 1; i <= k; ++i) scanf( %d , a + i), fan_of[--a[i]] = true; n for (int i = 0; i < 4; ++i) ans = std::max(ans, Cal(0, t, i)); n printf( %d , ans + !(!k)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long d[111111]; n long long sum[111111]; n int q[111111]; n long long cat[111111]; n long long dp[101][100001]; n long long getDP(int i, int j, int k) { n return (long long)j * cat[j] + dp[i - 1][k] - j * cat[k]; n } n long long getUP(int i, int j, int k) { n return (long long)dp[i - 1][j] - dp[i - 1][k]; n } n long long getDOWN(int j, int k) { return (long long)cat[j] - cat[k]; } n int main() { n int i, j, k, n, m, p, h; n cin >> n >> m >> p; n for (i = 2; i <= n; i++) { n cin >> d[i]; n d[i] += d[i - 1]; n } n for (i = 1; i <= m; i++) { n cin >> h >> cat[i]; n cat[i] -= d[h]; n } n sort(cat + 1, cat + 1 + m); n for (i = 1; i <= m; i++) sum[i] = sum[i - 1] + cat[i]; n for (i = 1; i <= p; i++) n for (j = 1; j <= m; j++) dp[i][j] = 999999999999999; n dp[1][m] = (long long)m * cat[m] - sum[m]; n for (i = 2; i <= p; i++) { n int head, tail; n head = tail = 0; n q[tail++] = m; n for (j = m; j >= 1; j--) { n while (head + 1 < tail && (getUP(i, q[head + 1], q[head]) <= n j * getDOWN(q[head + 1], q[head]))) n head++; n dp[i][j] = min(dp[i][j], getDP(i, j, q[head])); n while (head + 1 < tail && n getUP(i, j, q[tail - 1]) * getDOWN(q[tail - 1], q[tail - 2]) > n getUP(i, q[tail - 1], q[tail - 2]) * getDOWN(j, q[tail - 1])) n tail--; n q[tail++] = j; n } n } n long long ans = dp[p][1]; n for (i = 1; i <= m; i++) ans = min(ans, dp[p][i]); n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100000 + 5; n struct BIT { n int a[N], n; n void Init(int n) { this->n = n; } n void add(int p, int v) { n for (p = p + 1; p <= n; p += p & -p) a[p] += v; n return; n } n int query(int p) { n int res = 0; n for (p = p + 1; p >= 1; p -= p & -p) res += a[p]; n return res; n } n } * TA; n struct Node { n int val, idx; n Node(int v, int i) { n val = v; n idx = i; n } n }; n void update(Node &des, Node src) { n des.val += src.val; n TA->add(des.idx, src.val); n } n int main() { n int n, q; n cin >> n >> q; n TA = new BIT(); n TA->Init(n); n deque Q; n for (int i = 0; i < n; i++) TA->add(i, 1), Q.push_back(Node(1, i)); n int s = 0; n for (int i = 0; i < q; i++) { n int f; n scanf( %d , &f); n if (f == 1) { n int p; n scanf( %d , &p); n if (2 * p <= Q.size()) { n if (s == 0) { n for (int i = 0; i < p; i++) { n update(Q[2 * p - 1 - i], Q[i]); n } n for (int i = 0; i < p; i++) Q.pop_front(); n } else { n for (int i = (int)Q.size() - 1; i >= Q.size() - p; i--) { n update(Q[2 * (Q.size() - p) - 1 - i], Q[i]); n } n for (int i = 0; i < p; i++) Q.pop_back(); n } n } else { n if (s == 0) { n for (int i = (int)Q.size() - 1; i >= p; i--) { n update(Q[2 * p - 1 - i], Q[i]); n } n int d = (int)Q.size() - p; n for (int i = 0; i < d; i++) Q.pop_back(); n } else { n for (int i = 0; i < Q.size() - p; i++) { n update(Q[2 * (Q.size() - p) - 1 - i], Q[i]); n } n int d = (int)Q.size() - p; n for (int i = 0; i < d; i++) Q.pop_front(); n } n s = s ^ 1; n } n } else { n int L, R; n scanf( %d %d , &L, &R); n --R; n if (s == 1) { n int ll = L, rr = R; n L = Q[Q.size() - rr - 1].idx; n R = Q[Q.size() - ll - 1].idx; n } else { n L = Q[L].idx, R = Q[R].idx; n } n printf( %d n , TA->query(R) - TA->query(L - 1)); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n while (cin >> s) { n string integer; n string decimal; n bool isnegative = false; n bool isdecimal = false; n int pos = 0; n if (s[0] == - ) { n isnegative = true; n pos++; n } n for (; pos < s.size(); pos++) { n if (s[pos] == . ) { n isdecimal = true; n } else if (!isdecimal) { n integer += s[pos]; n } else { n decimal += s[pos]; n } n } n reverse(integer.begin(), integer.end()); n string integerWithComma; n for (int i = 0; i < integer.size(); i++) { n integerWithComma += integer[i]; n if (i != integer.size() - 1 && i % 3 == 2) { n integerWithComma += , ; n } n } n reverse(integerWithComma.begin(), integerWithComma.end()); n string decimalProcess; n if (decimal.size() == 0) { n decimalProcess = .00 ; n } else if (decimal.size() == 1) { n decimalProcess = . + decimal + 0 ; n } else { n decimalProcess = . + decimal.substr(0, 2); n } n if (isnegative) { n cout << ( ; n } n cout << $ ; n cout << integerWithComma; n cout << decimalProcess; n if (isnegative) { n cout << ) ; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string op, s1, s2; n map mp; n int solve(string s) { n int ast, amp; n ast = count(s.begin(), s.end(), * ); n amp = count(s.begin(), s.end(), & ); n return ast - amp; n } n string remove(string s) { n s.erase(remove(s.begin(), s.end(), * ), s.end()); n s.erase(remove(s.begin(), s.end(), & ), s.end()); n return s; n } n int main() { n int N; n cin >> N; n mp[ void ] = 0; n while (N--) { n cin >> op; n if (op == typedef ) { n cin >> s1 >> s2; n int d = solve(s1); n s1 = remove(s1); n if (mp.find(s1) != mp.end() && mp[s1] >= 0) n mp[s2] = mp[s1] + d; n else n mp[s2] = -1; n } else { n cin >> s1; n int d = solve(s1); n s1 = remove(s1); n if (mp.find(s1) != mp.end() && mp[s1] >= 0) { n d += mp[s1]; n if (d >= 0) { n cout << void ; n for (int i = 0; i < d; i++) cout << * ; n cout << endl; n } else n cout << errtype << endl; n } else n cout << errtype << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n unsigned long long power(unsigned long long x, unsigned long long y) { n if (y == 0) return 1; n unsigned long long tmp = power(x, y / 2); n tmp *= tmp; n if (y % 2) tmp *= x; n return tmp; n } n unsigned long long get(unsigned long long n) { n if (n <= 9) return n; n unsigned long long cnt, temp, d = 0; n unsigned long long tmp = n; n while (tmp / 10) { n tmp /= 10; n d++; n } n stringstream s; n s << n; n string str = s.str(); n unsigned long long x = str[0] - 0 ; n temp = power(10, d); n n -= (str[0] - 0 ) * temp; n n /= 10; n if (str[0] <= str[str.size() - 1]) n cnt = n + 1; n else n cnt = n; n cnt += ((power(10, d - 1)) * (x - 1)); n return cnt + get(power(10, d) - 1); n } n int main() { n unsigned long long l, r; n cin >> l >> r; n cout << get(r) - get(l - 1) << endl; n } n "} +{"func_code_string": "#include n int main() { n int n, m; n while (scanf( %d %d , &n, &m) != EOF) { n if (n * m < 2) { n printf( 0 n ); n } else { n printf( %d n , n * m / 2); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n template n A cvt(B x) { n stringstream s; n s << x; n A r; n s >> r; n return r; n } n typedef vector VI; n typedef vector > VII; n typedef vector VS; n struct Treap { n int val, priority; n int maxVal, size; n Treap *left; n Treap *right; n Treap() { n val = priority = maxVal = size = 0; n left = right = 0; n } n Treap(int _val, int _priority, int _maxVal, int _size) { n val = _val; n maxVal = _maxVal; n size = _size; n priority = _priority; n left = right = 0; n } n }; n int SZ(Treap *&t) { return t ? t->size : 0; } n int MAX(Treap *&t) { return t ? t->maxVal : 0; } n void Adjust(Treap *&T) { n T->size = 1 + SZ(T->left) + SZ(T->right); n T->maxVal = max(T->val, max(MAX(T->left), MAX(T->right))); n } n void rotateLeft(Treap *&T) { n Treap *t = T->left; n T->left = t->right; n Adjust(T); n t->right = T; n Adjust(t); n T = t; n } n void rotateRight(Treap *&T) { n Treap *t = T->right; n T->right = t->left; n Adjust(T); n t->left = T; n Adjust(t); n T = t; n } n void Balance(Treap *&T) { n if (T->left) { n if (T->left->priority > T->priority) rotateLeft(T); n } n if (T->right) { n if (T->right->priority > T->priority) rotateRight(T); n } n } n void insert(Treap *&T, int val, int where, int pri) { n if (!T) n T = new Treap(val, pri, val, 1); n else { n if (SZ(T->right) >= where) { n insert(T->right, val, where, pri); n } else if (max(T->val, MAX(T->right)) > val) { n insert(T->right, val, where, pri); n } else n insert(T->left, val, where - SZ(T->right) - 1, pri); n Adjust(T); n Balance(T); n } n } n int idx[101010]; n void print(Treap *&T) { n if (T) { n print(T->left); n printf( %d , idx[T->val]); n print(T->right); n } n } n int main() { n int n, a, c; n scanf( %d , &n); n Treap *T = NULL; n for (int i = (int)0; i < (int)n; ++i) { n scanf( %d%d , &a, &c); n idx[a] = i + 1; n insert(T, a, c, rand() % 101010); n } n print(T); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Dinic { n struct Edge { n int to, flow, next; n }; n vector edges; n vector head, act, h; n int S, D; n void AddEdge(int from, int to, int f, int rev_f = 0) { n edges.push_back({to, f, (int)edges.size()}); n swap(edges.back().next, head[from]); n edges.push_back({from, rev_f, (int)edges.size()}); n swap(edges.back().next, head[to]); n } n bool bfs() { n fill(h.begin(), h.end(), -1); n h[S] = 0; n vector q = {S}; n for (int it = 0; it < q.size() && h[D] == -1; it++) { n int nod = q[it]; n for (int i = head[nod]; i != -1; i = edges[i].next) n if (edges[i].flow && h[edges[i].to] == -1) n h[edges[i].to] = 1 + h[nod], q.push_back(edges[i].to); n } n return h[D] != -1; n } n int dfs(int nod, int flow) { n if (flow == 0 || nod == D) return flow; n while (act[nod] != -1) { n Edge& e = edges[act[nod]]; n int d; n if (e.flow && h[e.to] == 1 + h[nod] && n (d = dfs(e.to, min(flow, e.flow))) != 0) { n e.flow -= d; n edges[act[nod] ^ 1].flow += d; n return d; n } n act[nod] = edges[act[nod]].next; n } n return 0; n } n int GetFlow() { n int f = 0; n while (bfs()) { n act = head; n int d; n while ((d = dfs(S, 1e9)) != 0) f += d; n } n return f; n } n Dinic(int dim = 0, int s = 0, int d = 0) n : head(dim + 1, -1), h(dim + 1), S(s), D(d) {} n }; n struct FlowWithMinRestrictions { n struct Edge { n int from, to, flowmin, flowmax, id; n }; n vector edges; n int S, D, n; n void AddEdge(int from, int to, int flowmin, int flowmax) { n edges.push_back({from, to, flowmin, flowmax, 0}); n } n vector Solve(bool& feasible, int& flow) { n feasible = 1; n flow = 0; n int news = n + 1, newd = n + 2; n Dinic first_flow(n + 2, news, newd); n first_flow.AddEdge(D, S, 1e9); n int s_minime = 0; n for (auto& i : edges) { n if (i.flowmax < i.flowmin) { n feasible = 0; n return vector(); n } n s_minime += i.flowmin; n i.id = first_flow.edges.size(); n first_flow.AddEdge(i.from, i.to, i.flowmax - i.flowmin); n first_flow.AddEdge(news, i.to, i.flowmin); n first_flow.AddEdge(i.from, newd, i.flowmin); n } n if (first_flow.GetFlow() != s_minime) { n feasible = 0; n return vector(); n } n Dinic curent_flow(n, S, D); n for (auto& i : edges) { n int dif = i.flowmax - i.flowmin; n int passed = dif - first_flow.edges[i.id].flow; n int nid = curent_flow.edges.size(); n curent_flow.AddEdge(i.from, i.to, first_flow.edges[i.id].flow, passed); n i.id = nid; n } n curent_flow.GetFlow(); n vector ans(edges.size()); n for (int i = 0; i < edges.size(); i++) { n int cntflow = curent_flow.edges[edges[i].id ^ 1].flow + edges[i].flowmin; n ans[i] = cntflow; n if (edges[i].from == S) flow += cntflow; n if (edges[i].to == S) flow -= cntflow; n } n return ans; n } n FlowWithMinRestrictions(int n = 0, int s = 0, int d = 0) : n(n), S(s), D(d) {} n }; n namespace ProbD { n const int NMAX = 200010; n map nrmx, nrmy; n FlowWithMinRestrictions flow; n pair shields[NMAX]; n int idshield[NMAX]; n int n, S, D; n int difmax[NMAX]; n int nr_on_poz[NMAX]; n int cnt = 0; n void normalize() { n for (int i = 0; i < n; i++) n nrmx[shields[i].first] = nrmy[shields[i].second] = 0; n for (auto& i : nrmx) i.second = cnt++; n for (auto& i : nrmy) i.second = cnt++; n S = cnt++; n D = cnt; n fill(difmax, difmax + cnt + 1, 1e9); n } n void solve() { n int r, b; n int nrc; n cin >> n >> nrc >> r >> b; n for (int i = 0; i < n; i++) cin >> shields[i].first >> shields[i].second; n normalize(); n flow = FlowWithMinRestrictions(cnt, S, D); n for (int i = 0; i < n; i++) { n shields[i].first = nrmx[shields[i].first], n shields[i].second = nrmy[shields[i].second]; n idshield[i] = flow.edges.size(); n nr_on_poz[shields[i].first]++, nr_on_poz[shields[i].second]++; n flow.AddEdge(shields[i].first, shields[i].second, 0, 1); n } n while (nrc--) { n int t, p, val; n cin >> t >> p >> val; n if (t == 1 && nrmx.find(p) != nrmx.end()) n difmax[nrmx[p]] = min(difmax[nrmx[p]], val); n else if (t == 2 && nrmy.find(p) != nrmy.end()) n difmax[nrmy[p]] = min(difmax[nrmy[p]], val); n } n vector>> verif; n for (auto i : nrmx) { n int nr = nr_on_poz[i.second]; n int dmax = difmax[i.second]; n int vmax = (dmax + nr) / 2; n int vmin = max(0, (nr - dmax + 1) / 2); n verif.push_back({(int)flow.edges.size(), {vmin, vmax}}); n flow.AddEdge(S, i.second, vmin, vmax); n } n for (auto i : nrmy) { n int nr = nr_on_poz[i.second]; n int dmax = difmax[i.second]; n int vmax = (dmax + nr) / 2; n int vmin = max(0, (nr - dmax + 1) / 2); n verif.push_back({(int)flow.edges.size(), {vmin, vmax}}); n flow.AddEdge(i.second, D, vmin, vmax); n } n int f; n bool posibil; n auto ans = flow.Solve(posibil, f); n if (!posibil) { n cout << -1 n ; n return; n } n for (auto i : verif) n assert(ans[i.first] >= i.second.first && ans[i.first] <= i.second.second); n cout << 1LL * f * min(r, b) + 1LL * (n - f) * max(r, b) << n ; n string s = rb ; n if (r < b) s = br ; n for (int i = 0; i < n; i++) cout << s[ans[idshield[i]]]; n cout << n ; n } n } // namespace ProbD n int main() { n ios_base::sync_with_stdio(0); n ProbD::solve(); n return 0; n FILE* in = fopen( cuplaj.in , r ); n int n, m; n fscanf(in, %d%d , &n, &m); n FlowWithMinRestrictions flow(n, 1, n); n while (m--) { n int a, b, c, d; n fscanf(in, %d%d%d%d , &a, &b, &c, &d); n flow.AddEdge(a, b, c, d); n } n bool feasible; n int f; n auto ans = flow.Solve(feasible, f); n ofstream out( flux.out ); n out << feasible << n << f << n ; n for (auto i : ans) out << i << ; n return 0; n } n "} +{"func_code_string": "#include n bool g[1111][1111]; n int main() { n int n, m; n memset(g, false, sizeof(g)); n scanf( %d%d , &n, &m); n for (int i = 0; i < m; i++) { n int u, v; n scanf( %d%d , &u, &v); n g[u][v] = true; n } n int count = 0; n for (int i = 2; i < n; i++) { n bool flag = false; n for (int j = 1; j <= n; j++) n if (g[i][j] == true) { n flag = true; n break; n } n if (flag) continue; n count++; n } n for (int j = 2; j < n; j++) { n bool flag = false; n for (int i = 1; i <= n; i++) n if (g[i][j]) { n flag = true; n break; n } n if (flag) continue; n count++; n } n if (n & 1) { n int i, j; n for (i = 1; i <= n; i++) n if (g[i][n / 2 + 1]) break; n for (j = 1; j <= n; j++) n if (g[n / 2 + 1][j]) break; n if (i > n && j > n) n if (count) count--; n } n printf( %d n , count); n return 0; n } n "} +{"func_code_string": "#include n char s1[100100], s2[100100], s3[100100]; n bool dist[100100]; n int pos[100100]; n int main() { n int n, t, i; n int num = 0, po = 0; n memset(dist, false, sizeof(dist)); n scanf( %d%d , &n, &t); n scanf( %s%s , s1, s2); n for (i = 0; i < n; i++) s3[i] = 1 ; n for (i = 0; i < n; i++) { n if (s1[i] == s2[i]) { n dist[i] = true; n pos[po++] = i; n num += 2; n } else n num++; n } n if (num < 2 * (n - t)) n printf( -1 n ); n else { n int j = 0; n int l = n - t; n while (l > 0 && j < po) { n s3[pos[j]] = s1[pos[j]]; n j++; n l--; n } n for (i = 0; i < n; i++) { n if (l > 0) { n while (s3[i] != 1 ) i++; n s3[i] = s1[i]; n while (s3[i] != 1 ) i++; n s3[i] = s2[i]; n l--; n i--; n } else if (s3[i] == 1 ) { n char ch = a ; n while (ch == s1[i] || ch == s2[i]) ch++; n s3[i] = ch; n } n } n s3[n] = 0 ; n printf( %s n , s3); n return 0; n } n } n "} +{"func_code_string": "#include n const int N = 517; n const int mod = 998244353; n using namespace std; n inline int read() { n int x = 0; n char ch = getchar(); n while (!isdigit(ch)) ch = getchar(); n while (isdigit(ch)) x = (x << 1) + (x << 3) + ch - 0 , ch = getchar(); n return x; n } n int n, k; n long long dp[N][N], ans; n int main() { n n = read(), k = read(); n dp[0][0] = 1; n for (int i = 1, I = (n) + 1; i < I; ++i) n for (int j = 1, I = (i) + 1; j < I; ++j) n for (int k = i - j, I = (i - 1) + 1; k < I; ++k) n dp[i][j] = (dp[i][j] + dp[k][min(j, k)]) % mod; n for (int i = n, I = (1) - 1; i > I; --i) n dp[n][i] = (dp[n][i] - dp[n][i - 1] + mod) % mod; n for (int i = 1, I = (n) + 1; i < I; ++i) n for (int j = 1, I = (n) + 1; j < I; ++j) n if (i * j < k) ans = (ans + dp[n][i] * dp[n][j]) % mod; n printf( %lld n , (ans << 1) % mod); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int t; n long long sx, sy, ex, ey; n int main(void) { n cin >> t >> sx >> sy >> ex >> ey; n int ans = 0; n for (int i = 0; i < t; i++) { n char c; n cin >> c; n if (sx == ex && sy == ey) { n cout << ans << n ; n return 0; n } n if (c == N && sy < ey) sy++; n if (c == W && sx > ex) sx--; n if (c == S && sy > ey) sy--; n if (c == E && sx < ex) sx++; n ans++; n } n if (sx == ex && sy == ey) { n cout << ans << n ; n return 0; n } n cout << -1 n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector g[100010]; n int t[100010], p[18][100010], L[100010], d[100010]; n vector a[18][100010], c[100010]; n void dfs(int u) { n for (int i = 0; i < (int)g[u].size(); i++) { n int v = g[u][i]; n if (t[v] == -1) { n t[v] = u; n d[v] = d[u] + 1; n dfs(v); n } n } n } n void Merge(const vector& A, const vector& B, vector& C, n int L = 10) { n int i = 0, j = 0, k = 0, n = (int)A.size(), m = (int)B.size(); n while (i < n && j < m && k < L) { n if (A[i] < B[j]) { n C.push_back(A[i]); n i++, k++; n } else if (B[j] < A[i]) { n C.push_back(B[j]); n j++, k++; n } else { n C.push_back(A[i]); n i++; n j++; n } n } n while (i < n && k < L) { n C.push_back(A[i]); n i++, k++; n } n while (j < m && k < L) { n C.push_back(B[j]); n j++, k++; n } n } n int scan() { n int ret = 0; n int ip = getchar(); n for (; ip < 0 || ip > 9 ; ip = getchar()) n ; n for (; ip >= 0 && ip <= 9 ; ip = getchar()) ret = ret * 10 + ip - 0 ; n return ret; n } n int main() { n int n, m, q, i, j, u, v, l, x, y; n vector ans, temp, temp1; n L[1] = 0; n for (i = 2; i < 100010; i++) L[i] = L[i >> 1] + 1; n n = scan(); n m = scan(); n q = scan(); n for (i = 0; i < n - 1; i++) { n u = scan(); n v = scan(); n --u, --v; n g[u].push_back(v); n g[v].push_back(u); n } n for (i = 0; i < m; i++) { n u = scan(); n --u; n c[u].push_back(i + 1); n } n for (i = 0; i < n; i++) t[i] = -1; n t[0] = 0; n d[0] = 0; n dfs(0); n t[0] = -1; n for (i = 0; i < n; i++) n for (j = 0; (1 << j) < n; j++) p[j][i] = -1; n for (i = 0; i < n; i++) { n p[0][i] = t[i]; n if (t[i] != -1 && (int)c[t[i]].size() > 0) n for (j = 0; j < (int)c[t[i]].size() && j < 10; j++) n a[0][i].push_back(c[t[i]][j]); n } n for (j = 1; (1 << j) < n; j++) { n for (i = 0; i < n; i++) { n if (p[j - 1][i] != -1) { n p[j][i] = p[j - 1][p[j - 1][i]]; n Merge(a[j - 1][i], a[j - 1][p[j - 1][i]], a[j][i]); n } n } n } n while (q--) { n u = scan(); n v = scan(); n m = scan(); n --u, --v; n if (u == v) { n if (!c[u].empty()) { n m = min(m, (int)c[u].size()); n printf( %d , m); n for (i = 0; i < m; i++) printf( %d , c[u][i]); n printf( n ); n } else n printf( 0 n ); n continue; n } n x = u; n y = v; n temp.clear(); n temp1.clear(); n ans.clear(); n if (d[u] < d[v]) swap(u, v); n temp = c[u]; n temp1 = c[v]; n Merge(temp, temp1, ans); n l = L[d[u]]; n for (i = l; i >= 0; i--) n if (d[u] - (1 << i) >= d[v]) { n temp = ans; n ans.clear(); n Merge(temp, a[i][u], ans, m); n u = p[i][u]; n } n if (u != v) { n for (i = l; i >= 0; i--) n if (p[i][u] != -1 && p[i][u] != p[i][v]) { n temp.clear(); n Merge(a[i][u], a[i][v], temp, m); n temp1 = ans; n ans.clear(); n Merge(temp, temp1, ans, m); n u = p[i][u]; n v = p[i][v]; n } n temp = ans; n ans.clear(); n Merge(temp, a[0][u], ans, m); n } n m = min(m, (int)ans.size()); n printf( %d , m); n for (i = 0; i < m; i++) printf( %d , ans[i]); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, ans = 0, c; n cin >> n; n for (long long i = 1; i <= n; i++) { n cin >> c; n ans += c; n } n c = (n == 1 ? 1 : n - 1); n if (ans == c) n cout << YES ; n else n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INT_INF = 1e9; n const long long LL_INF = 1e18; n const int MAXN = 200003; n int n, m; n int A[MAXN]; n long long calc(int m) { n long long ret = 0; n map dp; n int sum = 0; n dp[sum] = 1; n long long add = 0; n for (int i = 1; i <= n; i++) { n if (A[i] < m) { n sum--; n add -= dp[sum]; n } else if (A[i] >= m) { n add += dp[sum]; n sum++; n } n ret += add; n dp[sum]++; n } n return ret; n } n int main() { n scanf( %d %d , &n, &m); n for (int i = 1, x; i <= n; i++) { n scanf( %d , &x); n A[i] = x; n } n long long ret1 = calc(m); n long long ret2 = calc(m + 1); n printf( %lld , ret1 - ret2); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-12; n const int INF = 1 << 30; n const long long LINF = 1ll << 61; n const int BUFFER_SZ = 1 << 20; n const int MOD = 1000 * 1000 * 1000 + 7; n char BUFFER[BUFFER_SZ]; n int gi() { n int x; n scanf( %d , &x); n return x; n } n double gd() { n double x; n scanf( %lf , &x); n return x; n } n long long gll() { n long long x; n scanf( %lld , &x); n return x; n } n vector gvi(int n) { n vector a; n while (n-- > 0) a.push_back(gi()); n return a; n } n string gs() { n scanf( %s , BUFFER); n return string(BUFFER); n } n template n void print(vector &x, string format) { n format += %c ; n for (int i = 0; i < x.size(); ++i) n printf(format.c_str(), x[i], i + 1 == x.size() ? n : ); n } n void solve() { n int n = gi(); n vector a = gvi(n); n for (int i = 0; i < a.size(); ++i) { n for (int j = i + 1; j < a.size(); ++j) { n for (int k = j + 1; k < a.size(); ++k) { n if (a[i] == a[j] + a[k]) { n printf( %d %d %d n , i + 1, j + 1, k + 1); n return; n } n if (a[j] == a[i] + a[k]) { n printf( %d %d %d n , j + 1, i + 1, k + 1); n return; n } n if (a[k] == a[i] + a[j]) { n printf( %d %d %d n , k + 1, i + 1, j + 1); n return; n } n } n } n } n printf( -1 n ); n } n int main() { n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n long long n, m, i, ans = 0, z, j; n pair a[105]; n vector > q; n cin >> n >> m; n for (i = 1; i <= n; i++) a[i].second = 0; n for (i = 1; i <= n; i++) cin >> a[i].first; n for (j = 1; j <= m; j++) { n cin >> z; n a[z].second = 1; n } n for (i = 1; i <= n; i++) q.push_back(a[i]); n sort(q.begin(), q.end()); n for (i = 0; i < n; i++) n if (q[i].second == 0) ans += q[i].first; n for (i = n - 1; i >= 0; i--) n if (q[i].second == 1) ans = ans + max(ans, q[i].first); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long M = 998244353; n long long p[400001]; n long long n; n vector a(100001); n bool check(long long x) { n long long cnt[n + 1]; n for (int i = 1; i < n + 1; i++) cnt[i] = 0; n for (int i = 0; i < n; i++) cnt[a[i]]++; n set, greater > > ss; n for (int i = 1; i < n + 1; i++) { n if (cnt[i] > 0) ss.insert({cnt[i], i}); n } n vector b; n for (int i = 0; i < n; i++) { n if (i >= x && cnt[b[i - x]] >= 1) { n ss.insert({cnt[b[i - x]], b[i - x]}); n } n if (ss.empty()) return false; n b.push_back(ss.begin()->second); n cnt[ss.begin()->second]--; n ss.erase(ss.begin()); n } n return true; n } n int main() { n long long t; n cin >> t; n while (t-- > 0) { n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n long long l = 0, h = n; n long long ans; n while (l + 1 < h) { n long long mid = (l + h) / 2; n if (check(mid)) { n ans = mid; n l = mid; n } else n h = mid; n } n cout << ans - 1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n char x[5][105]; n int main() { n cin >> n >> m; n for (int i = 0; i < 4; i++) { n for (int j = 0; j < n; j++) { n x[i][j] = . ; n } n } n if (m % 2 == 0) { n printf( YES n ); n for (int i = 1; i <= m / 2; i++) { n x[1][i] = # ; n x[2][i] = # ; n } n for (int i = 0; i < 4; i++) { n for (int j = 0; j < n; j++) { n printf( %c , x[i][j]); n } n printf( n ); n } n } else { n if (m >= n - 2) { n printf( YES n ); n for (int i = 1; i <= n - 2; i++) { n x[1][i] = # ; n } n if (m - n + 2 >= 2) { n x[2][1] = # ; n x[2][n - 2] = # ; n for (int i = 0; i < m - n; i++) { n x[2][i + 2] = # ; n } n } n for (int i = 0; i < 4; i++) { n for (int j = 0; j < n; j++) { n printf( %c , x[i][j]); n } n printf( n ); n } n } else { n printf( YES n ); n x[1][n / 2] = # ; n for (int i = 1; i <= m / 2; i++) { n x[1][(n / 2) + i] = # ; n x[1][(n / 2) - i] = # ; n } n for (int i = 0; i < 4; i++) { n for (int j = 0; j < n; j++) { n printf( %c , x[i][j]); n } n printf( n ); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map m; n long long n, p; n int main() { n cin >> n; n while (cin >> n) m[n]++; n for (n = 1; n < 11; n++) p += m[n] * m[n * -1]; n cout << p + m[0] * (m[0] - 1) / 2; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, a[100], s, sum = 0; n cin >> n >> s; n for (int i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n for (int i = 0; i < n - 1; i++) sum += a[i]; n if (sum <= s) n cout << YES n ; n else n cout << NO n ; n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n; n scanf( %d , &n); n int ar[1000]; n int i; n for (i = 0; i < n; scanf( %d , &ar[i++])) n ; n int b = 0, e = n - 1; n int s = 0, d = 0; n i = 1; n while (b <= e) { n if (ar[b] > ar[e]) { n if (i == 1) n s = s + ar[b]; n else n d = d + ar[b]; n b++; n } else { n if (i == 1) n s = s + ar[e]; n else n d = d + ar[e]; n e--; n } n i = i * -1; n } n printf( %d %d , s, d); n exit(0); n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1e9 + 5; n const long long infll = 1e18 + 5ll; n const long double eps = 1e-9; n const int maxn = 1e5 + 100; n const long long maxlog = 21; n const int P = 97; n const int mod = 1e9 + 9; n int n, m, lvl[maxn], up[maxlog][maxn], sub[maxn], par[maxn], ans[maxn]; n std::vector g[maxn]; n bool ban[maxn]; n void dfs1(int v = 1, int pr = 0) { n lvl[v] = lvl[pr] + 1; n up[0][v] = pr; n for (int i = 1; i < 20; ++i) up[i][v] = up[i - 1][up[i - 1][v]]; n for (auto to : g[v]) n if (pr != to) { n dfs1(to, v); n } n } n int nn; n void dfs2(int v, int pr) { n sub[v] = 1; n ++nn; n for (auto to : g[v]) { n if (to != pr && !ban[to]) { n dfs2(to, v); n sub[v] += sub[to]; n } n } n } n int getCentroid(int v, int pr) { n for (auto to : g[v]) { n if (to != pr && !ban[to] && sub[to] * 2 > nn) { n return getCentroid(to, v); n } n } n return v; n } n void decompose(int v, int pr) { n nn = 0; n dfs2(v, pr); n int centroid = getCentroid(v, pr); n par[centroid] = pr; n ban[centroid] = 1; n for (auto to : g[centroid]) { n if (to == pr || ban[to]) continue; n decompose(to, centroid); n } n } n int lca(int a, int b) { n if (lvl[a] > lvl[b]) swap(a, b); n int d = lvl[b] - lvl[a]; n for (int i = 0; i < maxlog; ++i) n if (d & (1 << i)) b = up[i][b]; n if (a == b) return b; n for (int i = maxlog - 1; i >= 0; --i) n if (up[i][a] != up[i][b]) a = up[i][a], b = up[i][b]; n return up[0][a]; n } n int dist(int u, int v) { return lvl[u] + lvl[v] - 2 * lvl[lca(u, v)]; } n void upd(int v) { n int x = v; n while (x != 0) { n ans[x] = min(ans[x], dist(x, v)); n x = par[x]; n } n } n int query(int v) { n int x = v, res = inf; n while (x != 0) { n res = min(res, ans[x] + dist(x, v)); n x = par[x]; n } n return res; n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL); n if (fopen( sorting n .in , n r )) n freopen( n sorting n .in , n r , stdin), n freopen( n sorting n .out , n w , stdout); n ; n cin >> n >> m; n for (int i = 1, u, v; i < n; ++i) { n cin >> u >> v; n g[u].push_back(v); n g[v].push_back(u); n } n dfs1(); n decompose(1, 0); n memset(ans, inf, sizeof ans); n upd(1); n for (int i = 1, t, v; i <= m; ++i) { n cin >> t >> v; n if (t == 1) { n upd(v); n } else { n cout << query(v) << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, ed, x, y; n int l[200005], qd[200005], qn[200005], p[200005]; n void bd(int x, int y) { qd[++ed] = y, qn[ed] = l[x], l[x] = ed; } n int notinE(int x, int y) { n for (int i = (l[x]); i; i = qn[i]) n if (qd[i] == y) return 0; n return 1; n } n int main() { n scanf( %d%d , &n, &m); n for (int i = (0); i < (m); i++) n scanf( %d%d , &x, &y), bd(x - 1, y - 1), bd(y - 1, x - 1); n for (int i = (0); i < (n); i++) p[i] = i; n for (int i = (0); i < (75); i++) { n random_shuffle(p, p + n); n p[n] = p[0]; n int ok = 1; n for (int j = (1); j <= (m); j++) n if (!notinE(p[j - 1], p[j])) { n ok = 0; n break; n } n if (ok) { n for (int j = (1); j <= (m); j++) n printf( %d %d n , p[j - 1] + 1, p[j] + 1); n return 0; n } n } n puts( -1 ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int cmpfunc(const void *a, const void *b) { return (*(int *)a - *(int *)b); } n long long int gcd(long long int m, long long int n) { n if (n == 0) return m; n return gcd(n, m % n); n } n long long int fastpow(long long int a, long long int b, long long int m) { n long long int r = 1; n while (b > 0) { n if (b % 2 == 1) r = (r * a) % m; n b = b >> 1; n a = (a * a) % m; n } n return r; n } n int prime(long long int x) { n if (x == 1) return 0; n if (x <= 3) return 1; n if (x % 6 == 1 || x % 6 == 5) { n long long int y = sqrt(x), i; n for (i = 2; i <= y; i++) n if (x % i == 0) return 0; n return 1; n } n return 0; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n long long int n, t; n cin >> n >> t; n if (n == 1 && t == 10) n cout << -1 << endl; n else if (t <= 9) { n for (long long int i = 0; i < n; i++) cout << t; n cout << endl; n } else { n cout << 1; n for (long long int i = 1; i < n; i++) cout << 0; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long blockSize; n long long cnt[100005]; n long long ans[100005]; n struct Query { n long long L, R, idx; n }; n bool compare(Query x, Query y) { n if (x.L / blockSize != y.L / blockSize) n return x.L / blockSize < y.L / blockSize; n return x.R < y.R; n } n void queryResults(long long a[], long long n, Query q[], long long m) { n blockSize = (long long)sqrt(n); n sort(q, q + m, compare); n long long currL = 0, currR = 0; n long long currCnt = 0; n for (long long i = 0; i < m; i++) { n long long L = q[i].L, R = q[i].R; n while (currL < L) { n if (a[currL] > 100000) { n currL++; n continue; n } n if (cnt[a[currL]] == a[currL]) currCnt--; n cnt[a[currL]]--; n if (cnt[a[currL]] == a[currL]) currCnt++; n currL++; n } n while (currL > L) { n if (a[currL - 1] > 100000) { n currL--; n continue; n } n if (cnt[a[currL - 1]] == a[currL - 1]) currCnt--; n cnt[a[currL - 1]]++; n if (cnt[a[currL - 1]] == a[currL - 1]) currCnt++; n currL--; n } n while (currR <= R) { n if (a[currR] > 100000) { n currR++; n continue; n } n if (cnt[a[currR]] == a[currR]) currCnt--; n cnt[a[currR]]++; n if (cnt[a[currR]] == a[currR]) currCnt++; n currR++; n } n while (currR > R + 1) { n if (a[currR - 1] > 100000) { n currR--; n continue; n } n if (cnt[a[currR - 1]] == a[currR - 1]) currCnt--; n cnt[a[currR - 1]]--; n if (cnt[a[currR - 1]] == a[currR - 1]) currCnt++; n currR--; n } n ans[q[i].idx] = currCnt; n } n for (long long i = 0; i < m; i++) cout << ans[i] << endl; n } n int main() { n long long n, m; n cin >> n >> m; n long long a[n]; n for (long long i = 0; i < n; i++) cin >> a[i]; n Query q[m]; n for (long long i = 0; i < m; i++) { n cin >> q[i].L >> q[i].R; n q[i].L--; n q[i].R--; n q[i].idx = i; n } n queryResults(a, n, q, m); n return 0; n } n "} +{"func_code_string": "#include n #pragma warning(disable : 4101) n using namespace std; n const double pi = acos(-1.0); n const int INF = 1000000000; n const int MAX = 100007; n const int MAX2 = 2000000; n const int inf = (int)1e9 + 5; n const long long mod = 1e9 + 7; n const int BASE = 10; n const int ST = 1000003; n const int CNT = 100; n const double eps = 1e-6; n const long long base = 2204234849; n const long long l_inf = (long long)4e18; n const int logn = 30; n int main() { n long long n, a, b, c, d, maxim1, maxim2; n cin >> n >> a >> b >> c >> d; n long long sum1 = a + b, sum2 = b + d, sum3 = c + a, sum4 = d + c; n int minim = min(sum1, min(sum2, min(sum3, sum4))); n int kol = 0; n maxim1 = minim + n; n int maxim = max(sum1, max(sum2, max(sum3, sum4))); n if (maxim > maxim1) { n cout << 0; n return 0; n } n cout << n * (maxim1 - maxim); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); } n long long fun(long long n) { n for (long long i = 2; i * i <= n; i++) { n if (n % i == 0) return i; n } n return n; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long n, c = 0; n cin >> n; n if (n % 2 != 0) { n n = n - fun(n); n c++; n } n cout << c + n / 2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 5009; n string s[MAX]; n int n, m, b[MAX], ans, a[MAX]; n int main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> s[i]; n for (int i = 0; i < m; i++) { n memset(a, 0, sizeof a); n for (int j = 0; j < n; j++) n if (s[j][i] == 1 ) n b[j]++, a[b[j]]++; n else n b[j] = 0; n for (int i = m; i >= 0; i--) a[i] += a[i + 1], ans = max(ans, a[i] * i); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 200 * 1000 + 10; n pair a[maxN]; n int nx[maxN]; n stack curr; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int d, n, m; n cin >> d >> n >> m; n for (int i = 0; i < m; i++) cin >> a[i].first >> a[i].second; n sort(a, a + m); n a[m].first = d; n curr.push(m); n for (int i = m - 1; i >= 0; i--) { n while (curr.size() > 1 && a[curr.top()].second >= a[i].second) curr.pop(); n nx[i] = curr.top(); n curr.push(i); n } n int fuel = n; n long long cost = 0; n for (int i = 0; i <= m; i++) { n fuel -= a[i].first - (i ? a[i - 1].first : 0); n if (fuel < 0) { n cout << -1 << endl; n return 0; n } n if (i == m) break; n int x = min(n - fuel, max(0, a[nx[i]].first - a[i].first - fuel)); n fuel += x; n cost += a[i].second * 1ll * x; n } n cout << cost << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int ar[300005]; n char ch[300005]; n int n, m, ii, k; n int pre[300005]; n vector> v; n void solve() { n v.clear(); n scanf( %d%d%s , &n, &m, ch); n for (int i = 1; i <= n; i++) { n pre[i] = pre[i - 1]; n if (i & 1) { n if (ch[i - 1] == + ) n pre[i]++; n else n pre[i]--; n } else { n if (ch[i - 1] == - ) n pre[i]++; n else n pre[i]--; n } n v.push_back({pre[i] + n, i}); n } n sort(v.begin(), v.end()); n for (int i = 1; i <= m; i++) { n int x, y; n scanf( %d%d , &x, &y); n int len = y - x + 1; n if (pre[y] - pre[x - 1] == 0) { n printf( 0 n ); n continue; n } n if (len & 1) n printf( 1 n ); n else n printf( 2 n%d , x), x++; n int val = pre[y] - pre[x - 1]; n if (x % 2 == 0) val *= -1; n int extra = val - (val / 2); n if (x % 2 == 0) extra *= -1; n val = pre[x - 1] + extra + n; n auto it = lower_bound(v.begin(), v.end(), make_pair(val, x)); n printf( %d n , it->second); n } n } n int main() { n int t = 1; n scanf( %d , &t); n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n n using namespace std; n const int mod = 1e9 + 7; n namespace math n { n n int inc(int x, int y) { return x + y >= mod ? x + y - mod : x + y; } n int qpow(int a, int x, int mo) n { n int res = 1; n while (x) n { n if (x & 1) n res = 1ll * res * a % mod; n a = 1ll * a * a % mod; n x >>= 1; n } n return res; n } n vector Fac, invFac; n void Finit(int n) n { n Fac.resize(n + 1); n invFac.resize(n + 1); n Fac[0] = 1; n invFac[0] = 1; n for (int i = 1; i <= n; i++) n Fac[i] = 1ll * Fac[i - 1] * i % mod; n invFac[n] = qpow(Fac[n], mod - 2, mod); n for (int i = n - 1; i >= 1; i--) n invFac[i] = 1ll * invFac[i + 1] * (i + 1) % mod; n } n int C(int n, int m) n { n if (m == 0) n return 1; n if (n < m || m < 0) n return 0; n return (int)(1ll * Fac[n] * invFac[m] % mod * invFac[n - m] % mod); n } n int A(int n, int m) n { n if (n < m || m < 0) n return 0; n return (int)(1ll * Fac[n] * invFac[n - m] % mod); n } n } n using namespace math; n void solve() n { n int n, l, r; n cin >> n >> l >> r; n Finit(n); n int ans = 0; n int up = r - n, dn = 1 - l; n if (dn < up) n { n if (n & 1) n { n ans = inc(ans, 2ll * dn * C(n, n / 2) % mod); n } n else n { n ans = inc(ans, 1ll * dn * C(n, n / 2) % mod); n } n for (int i = 1; i <= n; i++) n { n int need_add = i; n int need_del = max(0, dn - up + i); n if (n - need_del - need_add < 0) n break; n ans = inc(ans, 1ll * C(n - need_del - need_add, n / 2 - need_add) % mod); n if (n & 1) n ans = inc(ans, 1ll * C(n - need_del - need_add, n / 2 + 1 - need_add) % mod); n } n } n else n { n if (n & 1) n { n ans = inc(ans, 2ll * up * C(n, n / 2) % mod); n } n else n { n ans = inc(ans, 1ll * up * C(n, n / 2) % mod); n } n n for (int i = 1; i <= n; i++) n { n int need_del = i; n int need_add = max(0, up - dn + i); n n if (n - need_del - need_add < 0) n break; n ans = inc(ans, 1ll * C(n - need_del - need_add, n / 2 - need_add) % mod); n if (n & 1) n ans = inc(ans, 1ll * C(n - need_del - need_add, n / 2 + 1 - need_add) % mod); n //cout << ans << endl; n } n } n cout << ans << endl; n } n int main() n { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int T = 1; n cin >> T; n while (T--) n { n solve(); n } n }"} +{"func_code_string": "#include n using namespace std; n const long long p = 1e9 + 7; n long long read() { n long long s = 0; n char c = getchar(), lc = + ; n while (c < 0 || 9 < c) lc = c, c = getchar(); n while ( 0 <= c && c <= 9 ) s = s * 10 + c - 0 , c = getchar(); n return lc == - ? -s : s; n } n void write(long long x) { n if (x < 0) { n putchar( - ); n x = -x; n } n if (x < 10) n putchar(x + 0 ); n else { n write(x / 10); n putchar(x % 10 + 0 ); n } n } n void print(long long x, char c = n ) { n write(x); n putchar(c); n } n inline void add(long long &x, long long y) { n x += y; n if (x >= p) x -= p; n } n inline long long lowbit(long long x) { return x & -x; } n inline long long calc(long long x1, long long x2, long long y1, long long y2, n long long k) { n if (x2 - x1 < y2 - y1) swap(x1, y1), swap(x2, y2); n long long tmp = x2 - x1; n x2 = (x1 = (x1 ^ y1) & ~(tmp - 1)) + tmp; n x1++; n x2 = min(x2, k); n if (x1 > x2 || y1 > y2) return 0; n return (x1 + x2) * (x2 - x1 + 1) / 2 % p * (y2 - y1) % p; n } n inline long long solve(long long x, long long y, long long k) { n long long ret = 0; n for (long long i = x; i; i &= i - 1) n for (long long j = y; j; j &= j - 1) n add(ret, calc(i - lowbit(i), i, j - lowbit(j), j, k)); n return ret; n } n signed main() { n long long q = read(); n while (q--) { n long long x1 = read(), y1 = read(), x2 = read(), y2 = read(), k = read(); n print((solve(x2, y2, k) - solve(x1 - 1, y2, k) - solve(x2, y1 - 1, k) + n solve(x1 - 1, y1 - 1, k) + p + p) % n p); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int Nmax = 100000 + 10; n int n; n int nr[Nmax]; n char s[Nmax], ans[Nmax]; n bool ok(int L, int R) { n int i, sum; n if (L > R) return 0; n for (i = 1; i <= n; ++i) nr[i] = s[i] - 0 ; n if (L == 1 && nr[R] == 0) return 0; n if (L == 2 && nr[1] != 1) return 0; n for (nr[L] += nr[L - 1] * 10; true; L++, R--) { n if (L == R) { n ans[L] = nr[L] / 2 + 0 ; n return nr[L] % 2 == 0; n } n if (L + 1 == R) { n sum = nr[L]; n if (nr[L] == nr[R] + 11) sum--; n ans[L] = ans[R] = sum / 2 + 0 ; n if (sum & 1) ans[L]++; n return (nr[L] == nr[R] || nr[L] == nr[R] + 11); n } n if (nr[L] - nr[R] != 0 && nr[L] - nr[R] != 1 && nr[L] - nr[R] != 10 && n nr[L] - nr[R] != 11) n return 0; n sum = nr[L]; n if (nr[L] == nr[R]) n ; n if (nr[L] == nr[R] + 1 || nr[L] == nr[R] + 11) sum--, nr[L + 1] += 10; n if (nr[L] == nr[R] + 10 || nr[L] == nr[R] + 11) { n if (nr[R] == 9) return 0; n for (i = R - 1; i >= L && nr[i] == 0; --i) nr[i] = 9; n if (i == L) return 0; n nr[i]--; n } n ans[L] = ans[R] = sum / 2 + 0 ; n if (sum & 1) ans[L]++; n int mata = 5; n } n return 1; n } n int main() { n gets(s + 1); n n = strlen(s + 1); n if (ok(1, n)) n puts(ans + 1); n else if (ok(2, n)) n puts(ans + 2); n else n puts( 0 ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 200005; n set ab[MAXN][2]; n int N, M, Q; n struct segTree { n int f, t, mini, maxi; n bool ans; n segTree *L, *R; n segTree(int _f, int _t) : f(_f), t(_t) { n ans = false; n mini = INT_MAX; n maxi = INT_MIN; n if (f != t) { n L = new segTree(f, (f + t) / 2); n R = new segTree((f + t) / 2 + 1, t); n } n } n void update(int x, int v, bool flag) { n if (f == t && t == x) { n if (flag) n maxi = v; n else n mini = v; n ans = maxi >= mini; n return; n } n if (x < R->f) n L->update(x, v, flag); n else n R->update(x, v, flag); n mini = min(R->mini, L->mini); n maxi = max(R->maxi, L->maxi); n ans = R->ans | L->ans | (R->maxi >= L->mini); n } n }; n int main() { n scanf( %d %d %d , &N, &M, &Q); n segTree *tree = new segTree(0, N + 1); n for (int i = 0; i < Q; i++) { n int x, y; n scanf( %d %d , &x, &y); n x--, y--; n bool flag = (x & 1); n int mult = (flag ? -1 : 1); n if (ab[x / 2][flag].count((y / 2) * mult)) n ab[x / 2][flag].erase((y / 2) * mult); n else n ab[x / 2][flag].insert((y / 2) * mult); n int val = INT_MAX; n if (flag) val = INT_MIN; n if (ab[x / 2][flag].size() > 0) val = abs(*ab[x / 2][flag].begin()); n tree->update(x / 2, val, flag); n puts((!tree->ans ? YES : NO )); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, sum, m[17], r[17]; n double ans; n int main() { n cin >> n; n for (int i = 1; i <= n; i++) cin >> m[i]; n for (int i = 1; i <= n; i++) cin >> r[i]; n for (int i = 1; i <= 999999; i++) n for (int j = 1; j <= n; j++) n if (i % m[j] == r[j]) { n sum++; n break; n } n ans = 1.0 * sum / 999999; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int o; n long long w, s, t; n cin >> o; n for (int i = 0; i < o; i++) { n cin >> w >> s >> t; n long long minnn = min(s, t); n cout << (w - minnn) + 1 << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n n #define ll long long n #define mtv(kit) cout<<#kit<< - < n #define all(x) x.begin(),x.end() n #define nl n n #define ump unordered_map n n n void doit(){ n ll b, g, k; cin >> b >> g >> k; n vectorp(k); n vectorB(b + 2), G(g + 2); n for(ll i = 0; i < k; i++){ n cin >> p[i].ff; n B[p[i].ff]++; n } n for(ll i = 0; i < k; i++){ n cin >> p[i].ss; n G[p[i].ss]++; n } n ll ans = 0; n for(ll i = 0; i < k ; i++){ n ans += (k - i - 1) - (B[p[i].ff] + G[p[i].ss] - 2); n B[p[i].ff]--; n G[p[i].ss]--; n } n cout << ans << nl; n } n n int main(){ n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ll t = 1; n cin >> t; n for(ll i = 1; i <= t; i++){ n doit(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int cnt[5]; n int main() { n int n, t; n cin >> n; n memset(cnt, 0, sizeof(0)); n for (int i = 0; i < n; i++) { n cin >> t; n cnt[t]++; n } n bool flag = true; n int ret = 0; n int minN = min(cnt[1], cnt[2]); n cnt[3] += minN; n cnt[1] -= minN; n cnt[2] -= minN; n ret += minN; n if (cnt[1] != 0) { n while (cnt[1] >= 3) { n cnt[3]++; n ret += 2; n cnt[1] -= 3; n } n if (cnt[1] == 1) { n if (cnt[3] > 0) { n cnt[4] + 1; n cnt[3]--; n cnt[1] = 0; n ret += 1; n } else if (cnt[4] >= 2) { n cnt[4] -= 2; n cnt[3] += 3; n cnt[1] = 0; n ret += 2; n } else n flag = false; n } else if (cnt[1] == 2) { n if (cnt[4] > 0) { n cnt[4] -= 1; n cnt[3] += 2; n ret += 2; n cnt[1] = 0; n } else if (cnt[3] >= 2) { n cnt[3] -= 2; n cnt[4] += 2; n cnt[1] = 0; n ret += 2; n } else n flag = false; n } n } else { n while (cnt[2] >= 3) { n cnt[2] -= 3; n ret += 2; n cnt[3] += 2; n } n if (cnt[2] == 1) { n if (cnt[4] > 0) { n cnt[4]--; n cnt[3] += 1; n cnt[2] = 0; n ret++; n } else if (cnt[3] > 1) { n cnt[4] += 2; n cnt[3] -= 2; n cnt[2] = 0; n ret += 2; n } else n flag = false; n } else if (cnt[2] == 2) { n cnt[2] = 0; n cnt[4]++; n ret += 2; n } n } n if (flag) n cout << ret << endl; n else n cout << -1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int m, n, t, k; n int main() { n while (scanf( %d%d , &n, &k) == 2) { n if (k > n || (n >= 2 && k == 1)) n printf( -1 n ); n else if (k == 1) n printf( %c n , a ); n else { n int m = n - (k - 2); n for (int i = 0; i < m; i++) printf( %c , i % 2 == 0 ? a : b ); n for (int i = 0; i < k - 2; i++) printf( %c , a + 2 + i); n printf( n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int x = 0, f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n return x * f; n } n long long dx[4] = {0, 0, -1, 1}; n long long dy[4] = {1, -1, 0, 0}; n int n, m, q; n char s[11]; n long long bz[100010 << 1][52]; n int pos[100010 << 1][52]; n int head[100010 << 1], nex[100010 << 1], val[100010 << 1], op[100010 << 1], tot; n int T[100010 << 2]; n void pushdown(int rt) { n if (T[rt]) { n T[rt << 1] = T[rt << 1 | 1] = T[rt]; n T[rt] = 0; n } n } n void insert(int l, int r, int rt, int x, int y, int v) { n if (x <= l && r <= y) { n T[rt] = v; n return; n } n int mid = l + r >> 1; n pushdown(rt); n if (mid >= x) insert(l, mid, rt << 1, x, y, v); n if (mid < y) insert(mid + 1, r, rt << 1 | 1, x, y, v); n } n int query(int l, int r, int rt, int v) { n if (l == r) return T[rt]; n int mid = l + r >> 1; n pushdown(rt); n if (mid >= v) n return query(l, mid, rt << 1, v); n else n return query(mid + 1, r, rt << 1 | 1, v); n } n void add(long long x, long long y, int tp) { n tot++; n nex[tot] = head[x]; n head[x] = tot; n val[tot] = y; n op[tot] = tp; n } n struct vec { n long long x1, x2, y1, y2; n int op; n void read() { n scanf( %I64d%I64d%I64d%I64d , &x1, &y1, &x2, &y2); n if (y1 < y2) op = 0; n if (y1 > y2) op = 1; n if (x1 > x2) op = 2; n if (x1 < x2) op = 3; n } n } a[100010]; n struct node { n int op; n long long len, x, y; n void read() { n scanf( %I64d%I64d%s%I64d , &x, &y, s, &len); n if (s[0] == U ) op = 0; n if (s[0] == D ) op = 1; n if (s[0] == L ) op = 2; n if (s[0] == R ) op = 3; n } n } b[100010]; n pair cal(long long x, long long y, int p) { n if (a[p].x1 == a[p].x2) { n if (a[p].x1 == x) { n if (min(a[p].y1, a[p].y2) <= y && y <= max(a[p].y1, a[p].y2)) n return make_pair(x, y); n if (y < min(a[p].y1, a[p].y2)) n return make_pair(x, min(a[p].y1, a[p].y2)); n else n return make_pair(x, max(a[p].y1, a[p].y2)); n } else n return make_pair(a[p].x1, y); n } else { n if (a[p].y1 == y) { n if (min(a[p].x1, a[p].x2) <= x && x <= max(a[p].x1, a[p].x2)) n return make_pair(x, y); n if (x < min(a[p].x1, a[p].x2)) n return make_pair(min(a[p].x1, a[p].x2), y); n else n return make_pair(max(a[p].x1, a[p].x2), y); n } else n return make_pair(x, a[p].y1); n } n } n int dis(long long x1, long long y1, long long x2, long long y2) { n return abs(x1 - x2) + abs(y1 - y2); n } n pair find(long long x, long long y, int tp, n long long step) { n return make_pair(x + step * dx[tp], y + step * dy[tp]); n } n void print(pair p) { n long long x = p.first, y = p.second; n x = max(x, 0ll); n x = min(x, (long long)m); n y = max(y, 0ll); n y = min(y, (long long)m); n printf( %I64d %I64d n , x, y); n } n int main() { n n = read(); n m = read(); n for (int i = 1; i <= n; i++) a[i].read(); n q = read(); n for (int i = 1; i <= q; i++) b[i].read(); n for (int i = 0; i <= 3; i++) { n tot = 0; n memset(head, 0, sizeof(head)); n memset(T, 0, sizeof(T)); n for (int j = 1; j <= q; j++) n if (b[j].op == i) { n if (i < 2) n add(b[j].y, j + n, 1); n else n add(b[j].x, j + n, 1); n } n for (int j = 1; j <= n; j++) { n if (i == 0) add(max(a[j].y1, a[j].y2), j, 0); n if (i == 1) add(min(a[j].y1, a[j].y2), j, 0); n if (i == 2) add(min(a[j].x1, a[j].x2), j, 0); n if (i == 3) add(max(a[j].x1, a[j].x2), j, 0); n } n for (int j = 1; j <= n; j++) n if (a[j].op == i) { n if (i < 2) n add(a[j].y2, j, 1); n else n add(a[j].x2, j, 1); n } n int now = (i == 0 || i == 3) ? m : 0; n while (now != -1 && now != m + 1) { n for (int j = head[now]; j; j = nex[j]) { n if (!op[j]) { n if (i < 2) n insert(0, m, 1, min(a[val[j]].x1, a[val[j]].x2), n max(a[val[j]].x1, a[val[j]].x2), val[j]); n else n insert(0, m, 1, min(a[val[j]].y1, a[val[j]].y2), n max(a[val[j]].y1, a[val[j]].y2), val[j]); n } else { n int tmp; n if (val[j] <= n) { n if (i < 2) n tmp = query(0, m, 1, a[val[j]].x1); n else n tmp = query(0, m, 1, a[val[j]].y1); n } else { n if (i < 2) n tmp = query(0, m, 1, b[val[j] - n].x); n else n tmp = query(0, m, 1, b[val[j] - n].y); n } n pos[val[j]][0] = tmp; n if (tmp) { n if (val[j] <= n) n bz[val[j]][0] = n abs(a[tmp].x2 - a[val[j]].x2) + abs(a[tmp].y2 - a[val[j]].y2); n else n bz[val[j]][0] = abs(a[tmp].x2 - b[val[j] - n].x) + n abs(a[tmp].y2 - b[val[j] - n].y); n } else n bz[val[j]][0] = 1ll << 50; n } n } n if (i == 0 || i == 3) n now--; n else n now++; n } n } n for (int i = 1; i <= 50; i++) bz[0][i] = 1ll << 50; n for (int i = 1; i <= 50; i++) n for (int j = 1; j <= n + q; j++) { n pos[j][i] = pos[pos[j][i - 1]][i - 1]; n bz[j][i] = bz[j][i - 1] + bz[pos[j][i - 1]][i - 1]; n bz[j][i] = min(bz[j][i], 1ll << 50); n } n for (int i = 1; i <= q; i++) { n int tmp = i + n; n long long t = b[i].len; n for (int j = 50; j >= 0; j--) n if (bz[tmp][j] <= t) { n t -= bz[tmp][j]; n tmp = pos[tmp][j]; n } n if (tmp == i + n) { n if (pos[tmp][0]) { n pair tq = cal(b[i].x, b[i].y, pos[tmp][0]); n int tw = dis(tq.first, tq.second, b[i].x, b[i].y); n if (tw >= t) n print(find(b[i].x, b[i].y, b[i].op, t)); n else n print(find(tq.first, tq.second, a[pos[tmp][0]].op, t - tw)); n } else n print(find(b[i].x, b[i].y, b[i].op, t)); n } else { n if (!pos[tmp][0]) n print(find(a[tmp].x2, a[tmp].y2, a[tmp].op, t)); n else { n pair tq = cal(a[tmp].x2, a[tmp].y2, pos[tmp][0]); n int tw = dis(tq.first, tq.second, a[tmp].x2, a[tmp].y2); n if (tw >= t) n print(find(a[tmp].x2, a[tmp].y2, a[tmp].op, t)); n else n print(find(tq.first, tq.second, a[pos[tmp][0]].op, t - tw)); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n const long long INF = (long long)1e18 + 100; n long long safe_sum(long long a, long long b) { n long long s = (a + b); n s = min(s, INF); n return s; n } n long long safe_mult(long long a, long long b) { n if (a == 0 || b == 0) return 0; n if (a >= ((INF + b - 1) / b)) return INF; n return (a * b); n } n const int maxN = 1005; n long long c[maxN][maxN]; n long long gcd(long long x, long long y) { n while (x > 0 && y > 0) { n if (x < y) swap(x, y); n x %= y; n } n return (x + y); n } n long long cnk(long long x, int a) { n vector cur; n for (int i = 0; i < a; i++) { n cur.push_back(x - i); n } n for (int j = 1; j <= a; j++) { n int now = j; n for (auto& it : cur) { n if (now == 1) break; n int d = (int)(gcd(it, now)); n it /= d; n now /= d; n } n } n long long ans = 1; n for (auto& it : cur) ans = safe_mult(ans, it); n return ans; n } n int n; n long long k; n const int maxT = 2 * (int)1e5 + 100; n const int BUBEN = 10; n long long a[maxT]; n long long get_cnk(long long x, long long y) { n if (x - y < y) return get_cnk(x, x - y); n if (x < y) return 0; n if (x < maxN) { n return c[x][y]; n } n if (y >= BUBEN) n return INF; n else n return cnk(x, (int)y); n } n bool ok(long long who) { n long long f = 0; n for (int i = 0; i < n; i++) { n f = safe_sum(f, safe_mult(a[i], get_cnk(n - i - 1 + who - 1, who - 1))); n if (f >= k) return true; n } n return (f >= k); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n c[0][0] = 1; n for (int i = 1; i < maxN; i++) { n c[i][0] = 1; n for (int j = 1; j <= i; j++) { n c[i][j] = safe_sum(c[i - 1][j], c[i - 1][j - 1]); n } n } n cin >> n >> k; n for (int i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] >= k) { n cout << 0; n return 0; n } n } n long long l = 0; n long long r = (long long)(1e18) + 100; n while (r - l > 1) { n long long mid = (l + r) / 2; n if (ok(mid)) n r = mid; n else n l = mid; n } n cout << r; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1005; n int a[N][N]; n int dp1[N][N] = {0}, dp2[N][N] = {0}, dp3[N][N] = {0}, dp4[N][N] = {0}; n int main() { n int n, m; n cin >> n >> m; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) cin >> a[i][j]; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) { n dp1[i][j] = max(dp1[i - 1][j], dp1[i][j - 1]) + a[i][j]; n } n for (int i = n; i >= 1; i--) n for (int j = m; j >= 1; j--) { n dp2[i][j] = max(dp2[i + 1][j], dp2[i][j + 1]) + a[i][j]; n } n for (int i = n; i >= 1; i--) n for (int j = 1; j <= m; j++) { n dp3[i][j] = max(dp3[i + 1][j], dp3[i][j - 1]) + a[i][j]; n } n for (int i = 1; i <= n; i++) n for (int j = m; j >= 1; j--) { n dp4[i][j] = max(dp4[i - 1][j], dp4[i][j + 1]) + a[i][j]; n } n int ans = 0; n for (int i = 2; i < n; i++) n for (int j = 2; j < m; j++) { n ans = max(dp1[i - 1][j] + dp2[i + 1][j] + dp3[i][j - 1] + dp4[i][j + 1], n ans); n ans = max(dp1[i][j - 1] + dp2[i][j + 1] + dp3[i + 1][j] + dp4[i - 1][j], n ans); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct pvec { n long long int x, y; n pvec(long long int x = 0, long long int y = 0) : x(x), y(y) {} n pvec operator-(pvec p) { return pvec(x - p.x, y - p.y); } n bool operator==(pvec p) { return x == p.x and y == p.y; } n long long int dot(pvec p) { return x * p.x + y * p.y; } n long long int abs2() { return x * x + y * y; } n }; n pvec v[12], Q[12], R[12]; n long long int Qi[12], Ri[12]; n long long int perm[][3] = {{1, 2, 3}, {1, 3, 2}, {2, 1, 3}, n {2, 3, 1}, {3, 1, 2}, {3, 2, 1}}; n inline bool quadrado() { n for (long long int i = 0; i < 6; i++) { n pvec p0 = Q[0]; n pvec p1 = Q[perm[i][0]]; n pvec p2 = Q[perm[i][1]]; n pvec p3 = Q[perm[i][2]]; n pvec v1 = p1 - p0, v2 = p2 - p1, v3 = (p2 - p3), v4 = (p3 - p0); n if (!(v1 == v3 and v2 == v4)) continue; n if (v1.abs2() != v2.abs2()) continue; n if (v1.dot(v2) != 0) continue; n return true; n } n return false; n } n inline bool retangulo() { n for (long long int i = 0; i < 6; i++) { n pvec p0 = R[0]; n pvec p1 = R[perm[i][0]]; n pvec p2 = R[perm[i][1]]; n pvec p3 = R[perm[i][2]]; n pvec v1 = p1 - p0, v2 = p2 - p1, v3 = (p2 - p3), v4 = (p3 - p0); n if (!(v1 == v3 and v2 == v4)) continue; n if (v1.dot(v2) != 0) continue; n return true; n } n return false; n } n bool da(long long int u, long long int quad, long long int ret) { n if (quad > 4 or ret > 4) return false; n if (u == 8) { n if (quadrado() and retangulo()) return true; n return false; n } n Q[quad] = v[u]; n Qi[quad] = u; n if (da(u + 1, quad + 1, ret)) return true; n R[ret] = v[u]; n Ri[ret] = u; n if (da(u + 1, quad, ret + 1)) return true; n return false; n } n int main() { n for (long long int i = 0; i < 8; i++) { n long long int x, y; n cin >> x >> y; n v[i] = pvec(x, y); n } n if (!da(0, 0, 0)) { n cout << NO << endl; n } else { n cout << YES << endl; n for (long long int i = 0; i < 4; i++) { n if (i) printf( ); n cout << Qi[i] + 1; n } n cout << endl; n for (long long int i = 0; i < 4; i++) { n if (i) printf( ); n cout << Ri[i] + 1; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long a = 1, n; n cin >> n; n for (int i = 0; i < n; i++) { n a *= i + 1; n } n cout << a * 2 / n / n; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long t; n cin >> t; n while (t--) { n long long l, r, b, c, a; n long long m; n cin >> l >> r >> m; n for (long long i = l; i <= r; i++) { n a = i; n long long n = m / a, temp = a * n, diff = m - temp; n if (n > 0 && abs(m - temp) <= r - l) { n if (diff >= 0) { n b = r; n c = r - m + temp; n } else { n b = l; n c = l + temp - m; n } n cout << a << << b << << c << n ; n break; n } n n = m / a + 1, temp = a * n, diff = m - temp; n if (abs(m - temp) <= r - l) { n if (diff >= 0) { n b = r; n c = r - m + temp; n } else { n b = l; n c = l + temp - m; n } n cout << a << << b << << c << n ; n break; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n double a, v, d, w, l, ans, mid, t2, t; n bool check(double maxv) { n return d - ((maxv + w) / 2) * (((maxv - w) * 2) / a) > 1e-8; n } n int main() { n scanf( %lf %lf %lf %lf %lf , &a, &v, &l, &d, &w); n w = min(min(w, v), sqrt(2 * a * d)); n if (2 * a * d + w * w > 2 * v * v) { n t = (d - v * v / a + w * w / a / 2) / v + (2 * v - w) / a; n } else { n t = (2 * sqrt(a * d + w * w / 2) - w) / a; n } n l = l - d; n t2 = (v - w) / a; n if (l - w * t2 - 0.5 * a * t2 * t2 > 0) { n t2 = t2 + (l - w * t2 - 0.5 * a * t2 * t2) / v; n } else { n t2 = (-w + sqrt(w * w + 2.0 * a * l)) / a; n } n printf( %.10f n , t + t2); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int Maxn = 200020; n int n, a[Maxn]; n long long sum[Maxn]; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , a + i); n for (int i = 0; i < n - 1; i++) { n int cur; n for (cur = 1; cur <= i;) { n int val = i / cur; n int ncur = i / val + 1; n if (a[i + 2] < a[val + 1]) { n sum[cur]++; n sum[ncur]--; n } n cur = ncur; n } n if (a[i + 2] < a[1]) sum[cur]++, sum[n]--; n } n for (int i = 1; i < n; i++) sum[i] += sum[i - 1], printf( %I64d n , sum[i]); n ; n } n "} +{"func_code_string": "#include n int main() { n int n, i; n int maximum, maxIndex, target; n int A[1000]; n scanf( %d , &n); n maximum = -1; n for (i = 0; i < n; ++i) { n scanf( %d , &A[i]); n if (A[i] > maximum) { n maximum = A[i]; n maxIndex = i; n } n } n A[maxIndex] = -2; n target = -1; n for (i = 0; i < n; ++i) { n if (A[i] > target) { n target = A[i]; n } n } n printf( %d %d , maxIndex + 1, target); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector a(n); n for (int i = 0; i < n; i++) { n cin >> a[i]; n a[i]--; n } n vector v(n), d(n); n queue q; n q.push(0); n v[0] = 1; n int l = 0; n while (!q.empty()) { n int nn = q.size(); n while (nn-- > 0) { n int t = q.front(); n q.pop(); n d[t] = l; n if (t > 0 && v[t - 1] == 0) { n q.push(t - 1); n v[t - 1] = 1; n } n if (t < n - 1 && v[t + 1] == 0) { n q.push(t + 1); n v[t + 1] = 1; n } n if (v[a[t]] == 0) { n q.push(a[t]); n v[a[t]] = 1; n } n } n l++; n } n for (int i : d) cout << i << ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000007; n int n, k; n int a[2011]; n long long pre[1 << 11 + 1]; n long long cur[1 << 11 + 1]; n void solve() { n memset(pre, 0, sizeof(pre)); n pre[0] = 1; n for (int i = 0; i < n; i++) { n memset(cur, 0, sizeof(cur)); n for (int j = 0; j < (1 << k) + 1; j++) { n if (a[i] == 2 || a[i] == 0) { n int nj = min(j + 2, 1 << k); n cur[nj] = (cur[nj] + pre[j]) % mod; n } n if (a[i] == 4 || a[i] == 0) { n int nj = min(j + 4, 1 << k); n if ((j & 2) != 0) { n nj = 4; n } n cur[nj] = (cur[nj] + pre[j]) % mod; n } n } n memcpy(pre, cur, sizeof(cur)); n } n cout << pre[1 << k] << endl; n } n void coding() { n while (cin >> n >> k) { n for (int i = 0; i < n; i++) cin >> a[i]; n solve(); n } n } n int main() { coding(); } n "} +{"func_code_string": "#include n using namespace std; n const long long dp = 1e9 + 7; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n int n, a; n cin >> n >> a; n vector vec(n); n int cnt = 0; n for (int i = 0; i < n; i++) { n cin >> vec[i]; n if (vec[i]) cnt++; n } n for (int i = 0; i < a; i++) { n if (vec[a - 1 - i] + vec[a - 1 + i] == 1) cnt--; n if (i >= n - a) break; n } n cout << cnt << n ; n return 0; n } n "} +{"func_code_string": "#include n const int maxn = 2005; n const int inf = 1e9; n using namespace std; n vector> G[maxn]; n vector C[maxn], v; n bool critical[maxn * maxn]; n vector seen, sum, col, depth, up; n void dfs(int node, int ind) { n seen[node] = 1; n int minFromSons = inf; n up[node] = depth[node]; n for (auto tmp : G[node]) { n if (seen[tmp.first] && tmp.second != ind) n up[node] = min(up[node], depth[tmp.first]); n else if (!seen[tmp.first]) { n depth[tmp.first] = depth[node] + 1; n dfs(tmp.first, tmp.second); n minFromSons = min(minFromSons, up[tmp.first]); n } n } n up[node] = min(up[node], minFromSons); n if (minFromSons >= depth[node] && ind != -1) { n critical[ind] = 1; n } n } n void dfsColor(int node, int color) { n col[node] = color; n v[color]++; n for (auto tmp : G[node]) { n if (critical[tmp.second] == 1 && col[tmp.first] == 0) continue; n if (critical[tmp.second] == 1 && col[tmp.first]) { n C[col[tmp.first]].push_back(color); n C[color].push_back(col[tmp.first]); n continue; n } else if (col[tmp.first] == 0) n dfsColor(tmp.first, color); n } n } n void dfsSub(int node) { n seen[node] = 1; n sum[node] = v[node]; n for (auto tmp : C[node]) n if (!seen[tmp]) { n dfsSub(tmp); n sum[node] += sum[tmp]; n } n } n int main() { n ios_base ::sync_with_stdio(false); n int n, m; n cin >> n >> m; n for (int i = 0; i < m; ++i) { n int a, b; n cin >> a >> b; n G[a].push_back(make_pair(b, i)); n G[b].push_back(make_pair(a, i)); n } n seen = vector(n + 1, 0); n depth = vector(n + 1, 0); n up = vector(n + 1, 0); n dfs(1, -1); n int c = 0; n col = vector(n + 1, 0); n v = vector(n + 1, 0); n int all = 0; n for (int i = 1; i <= n; ++i) n if (col[i] == 0) { n ++c; n dfsColor(i, c); n all += v[c] * v[c]; n } n int ans = 0; n for (int i = 1; i <= c; ++i) { n seen = vector(c + 1, 0); n sum = vector(c + 1, 0); n dfsSub(i); n int tmp = 0; n for (int j = 1; j <= c; ++j) tmp += sum[j] * v[j]; n vector can(n + 1, 0); n can[0] = 1; n for (auto tmp : C[i]) { n for (int j = n; j >= 0; --j) n if (can[j] && j + sum[tmp] <= n) can[j + sum[tmp]] = 1; n } n int res = -1; n for (int j = (n - v[i]) / 2; j >= 0; --j) n if (can[j]) { n res = j; n break; n } n tmp += res * (n - v[i] - res); n ans = max(ans, tmp); n } n cerr << all << n ; n cout << ans << n ; n } n "} +{"func_code_string": "#include n int main() { n int x, count = 0, i; n char ar[50]; n for (i = 0; i < 9; i++) scanf( %c , &ar[i]); n for (i = 0; i < 9; i++) { n if (ar[i] == ar[8 - i]) count++; n } n if (count == 9) n printf( YES ); n else n printf( NO ); n } n "} +{"func_code_string": "#include n using namespace std; n const int shape[4][4][2] = {{{1, 0}, {2, 0}, {1, 1}, {1, 2}}, n {{1, 0}, {2, 0}, {2, -1}, {2, 1}}, n {{0, 1}, {0, 2}, {-1, 2}, {1, 2}}, n {{0, 1}, {0, 2}, {1, 1}, {2, 1}}}; n int x, y; n struct node { n char g[9][9]; n int num; n int sx, sy; n int layer; n node() { n layer = 0; n sx = sy = 0; n memset(g, 0, sizeof(g)); n num = 0; n } n void printNode() { n for (int i = 0; i < y; i++) { n for (int j = 0; j < x; j++) printf( %c , g[i][j] ? g[i][j] : . ); n cout << << endl; n } n } n }; n stack q; n int ans; n node ansNode; n int maxG[9][9][4]; n void bfs() { n while (!q.empty()) { n node now = q.top(); n q.pop(); n if (now.num > ans) { n ans = now.num; n ansNode = now; n } n now.num++; n char ch = A + now.num - 1; n for (int i = now.sy; i < y; i++) { n for (int j = 0; j < x; j++) { n if (!now.g[i][j]) { n for (int k = 0; k < 4; k++) { n if (maxG[i][j][k] > now.num + 1) continue; n bool flag = true; n for (int l = 0; l < 4 && flag; l++) { n int tx = j + shape[k][l][1]; n int ty = i + shape[k][l][0]; n if (tx < 0 || tx >= x || ty < 0 || ty >= y || now.g[ty][tx]) { n flag = false; n } n } n if (flag) { n node tNode = now; n tNode.g[i][j] = ch; n for (int l = 0; l < 4; l++) { n int tx = j + shape[k][l][1]; n int ty = i + shape[k][l][0]; n tNode.g[ty][tx] = ch; n } n tNode.sx = j + 1; n tNode.sy = i; n tNode.layer++; n q.push(tNode); n maxG[i][j][k] = max(maxG[i][j][k], now.num); n } n } n } n } n } n } n } n int main() { n ans = -1; n cin >> y >> x; n while (!q.empty()) q.pop(); n q.push(node()); n bfs(); n cout << ans << endl; n ansNode.printNode(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100009; n int sol, qs[N], qe[N], sorted[N], ans[N], a[N], s, e; n unordered_map freq; n void add(int el) { n sol -= !(freq[el] ^ el); n freq[el]++; n sol += !(freq[el] ^ el); n } n void remove(int el) { n sol -= !(freq[el] ^ el); n freq[el]--; n sol += !(freq[el] ^ el); n } n void mo(int idx) { n while (s > qs[idx]) add(a[--s]); n while (e <= qe[idx]) add(a[e++]); n while (s < qs[idx]) remove(a[s++]); n while (e > qe[idx] + 1) remove(a[--e]); n ans[idx] = sol; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int n, m; n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < m; i++) { n cin >> qs[i] >> qe[i]; n qs[i]--, qe[i]--; n sorted[i] = i; n } n int sq = sqrt(n); n sort(sorted, sorted + m, [sq](int i, int j) { n return make_pair(qs[i] / sq, qe[i]) < make_pair(qs[j] / sq, qe[j]); n }); n for (int i = 0; i < m; i++) mo(sorted[i]); n for (int i = 0; i < m; i++) cout << ans[i] << n ; n } n "} +{"func_code_string": "#include n using namespace std; n template n using min_pq = priority_queue, greater>; n const int MAXN = 1e5 + 10, MAXQ = 3e5 + 10, MAXL = 20, ALP = 26, MOD = 1e9 + 7, n MAXK = 17, INF = 1e9 + 10, MAXA = 30, MAXB = 24, MAXBB = (1 << MAXB); n const string no = NO n , yes = YES n ; n const int hA[4] = {1, 0, -1, 0}, kA[4] = {0, 1, 0, -1}; n void solve() { n int n, m; n cin >> n >> m; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n int a; n cin >> a; n if ((a & 1) != ((i + j) & 1)) a++; n cout << a << ; n } n cout << n ; n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int t = 1; n cin >> t; n while (t--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long int n, sum1 = 0, res1 = 0, last = 0; n bool flag = true; n cin >> n; n unordered_map m; n vector> v; n for (long long int i = 0; i < n; i++) { n long long int element; n cin >> element; n m[element]++; n v.emplace_back(make_pair(element, i)); n } n if (n == 1) { n cout << 1 << n ; n cout << v[0].first << n << 0 n ; n return 0; n } n sort(v.begin(), v.end()); n vector> v1; n for (long long int i = 0; i < v.size() - 1; i++) { n flag = true; n if (i < v.size() - 1 && v[i].first == v[i + 1].first) n sum1 = v[i + 1].second - v[i].second; n else if (i < v.size() - 1) n sum1 = 0; n while (i < v.size() - 1 && v[i].first == v[i + 1].first) { n res1 = v[i + 1].second - v[i].second; n if (res1 != sum1) { n flag = false; n break; n } n i++; n } n if (flag == true) { n v1.push_back(make_pair(v[i].first, sum1)); n } n while (i < v.size() - 1 && v[i].first == v[i + 1].first) { n i++; n } n } n if (v[v.size() - 1].first != v[v.size() - 2].first) { n v1.emplace_back(make_pair(v[v.size() - 1].first, 0)); n } n cout << v1.size() << n ; n for (long long int i = 0; i < v1.size(); i++) { n cout << v1[i].first << << v1[i].second << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n long long int t, temp, i, ans = 0, n, m, index, j; n cin >> n >> m; n vector > pa; n vector v(n), finger(m); n for (i = 0; i < n; i++) { n cin >> v[i]; n } n for (i = 0; i < m; i++) { n cin >> finger[i]; n for (j = 0; j < n; j++) { n if (v[j] == finger[i]) { n pa.push_back(make_pair(j, finger[i])); n } n } n } n sort(pa.begin(), pa.end()); n if (pa.size() == 0) n cout << n ; n else { n for (auto it = pa.begin(); it != pa.end(); it++) { n cout << it->second << ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x3f3f3f3f; n const long long inf2 = 0x3f3f3f3f3f3f3f3f; n const double eps = 1e-6; n const int mod = 1000000007; n namespace fastio { n char in[100000]; n int itr = 0, llen = 0; n char get() { n if (itr == llen) llen = fread(in, 1, 100000, stdin), itr = 0; n if (llen == 0) return EOF; n return in[itr++]; n } n char out[100000]; n int itr2 = 0; n void put(char c) { n out[itr2++] = c; n if (itr2 == 100000) { n fwrite(out, 1, 100000, stdout); n itr2 = 0; n } n } n int clear() { n fwrite(out, 1, itr2, stdout); n itr2 = 0; n return 0; n } n int getint() { n int r = 0; n bool ng = 0; n char c; n c = get(); n while (c != - && (c < 0 || c > 9 )) c = get(); n if (c == - ) ng = 1, c = get(); n while (c >= 0 && c <= 9 ) r = r * 10 + c - 0 , c = get(); n return ng ? -r : r; n } n string getstr() { n string ret = ; n char ch = get(); n while (ch == || ch == n ) ch = get(); n while (ch != && ch != n ) ret.push_back(ch), ch = get(); n return ret; n } n void putstr(string s) { n for (int i = 0; i < s.size(); i++) put(s[i]); n } n void putint(int x) { n if (x < 0) { n put( - ); n x = -x; n } n if (x == 0) { n put( 0 ); n return; n } n char c[20]; n int pos = 0; n while (x) { n c[pos++] = 0 + x % 10; n x /= 10; n } n for (int i = pos - 1; i >= 0; i--) put(c[i]); n } n void getarr(int arrname[], int size) { n for (int i = 0; i < size; i++) arrname[i] = getint(); n } n } // namespace fastio n using namespace fastio; n int number[1000005], BITN = 1e6; n void modify(int x, int y) { n while (x <= BITN) { n number[x] += y; n x += x & -x; n } n } n int sum(int x) { n int ret = 0; n while (x) { n ret += number[x]; n x &= x - 1; n } n return ret; n } n void add(int l, int r, int v) { n modify(l, v); n modify(r, -v); n } n int qry(int x) { return sum(x); } n int n, k; n vector g[1000005]; n vector ord; n int pos[1000005]; n bool used[1000005]; n int par[1000005]; n int sz[1000005], depth[1000005]; n void dfs(int x, int pr) { n depth[x] = x == n ? 0 : depth[pr] + 1; n pos[x] = ord.size() + 1; n ord.push_back(x); n sz[x] = 1; n for (auto to : g[x]) n if (to != pr) par[to] = x, dfs(to, x), sz[x] += sz[to]; n } n int main() { n n = getint(); n k = getint(); n for (int i = 1; i < n; i++) { n int a = getint(), b = getint(); n g[a].push_back(b); n g[b].push_back(a); n } n dfs(n, 0); n for (int i = 0; i < ord.size(); i++) { n modify(i + 1, depth[ord[i]] - (i == 0 ? 0 : depth[ord[i - 1]])); n } n used[n] = true; n int rest = n - k - 1; n for (int v = n - 1; v > 0 && rest; v--) { n if (used[v]) continue; n int len = qry(pos[v]); n if (len <= rest) { n int cur = v; n while (!used[cur]) { n used[cur] = true; n add(pos[cur], pos[cur] + sz[cur], -1); n cur = par[cur]; n rest--; n } n } n } n vector ans; n for (int i = 1; i <= n; i++) n if (!used[i]) ans.push_back(i); n for (int i = 0; i < ans.size(); i++) putint(ans[i]), put( ); n clear(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5555; n int hackable[N]; n int sols[N]; n int pts[N][13]; n int score[N]; n int z[N]; n int bound[N]; n int cnt_hack[N]; n int rgt[N]; n int task[N][13]; n int guys[N]; n int main() { n int n; n scanf( %d , &n); n for (int j = 0; j < 3; j++) { n hackable[j] = 0; n sols[j] = 0; n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < 3; j++) { n scanf( %d , task[i] + j); n if (task[i][j] < 0) { n hackable[j]++; n } n if (task[i][j] > 0) { n sols[j]++; n } n } n } n int cost[3]; n int ans = n; n for (cost[0] = 500; cost[0] <= 3000; cost[0] += 500) { n for (cost[1] = 500; cost[1] <= 3000; cost[1] += 500) { n for (cost[2] = 500; cost[2] <= 3000; cost[2] += 500) { n bool err = false; n for (int j = 0; j < 3; j++) { n cnt_hack[j] = -1; n for (int u = hackable[j]; u >= 0; u--) { n int k = sols[j] + (hackable[j] - u); n int real_cost = 500; n int coeff = 2; n while (coeff * k <= n && real_cost < 3000) { n coeff *= 2; n real_cost += 500; n } n if (real_cost == cost[j]) { n cnt_hack[j] = u; n break; n } n } n if (cnt_hack[j] == -1) { n err = true; n break; n } n } n if (err) { n continue; n } n for (int i = 0; i < n; i++) { n score[i] = 0; n for (int j = 0; j < 3; j++) { n int a = abs(task[i][j]); n pts[i][j] = (a > 0 ? (cost[j] * (250 - a) / 250) : 0); n score[i] += pts[i][j]; n } n } n score[0] += 100 * (cnt_hack[0] + cnt_hack[1] + cnt_hack[2]); n int cnt = 0; n for (int type = 0; type < 128; type++) { n guys[type] = 0; n } n for (int i = 1; i < n; i++) { n if (score[i] > score[0]) { n int type = 0; n for (int t = 1; t < 8; t++) { n int dec = 0; n for (int j = 0; j < 3; j++) { n if (t & (1 << j)) { n if (task[i][j] < 0) { n dec += pts[i][j]; n } n } n } n if (score[i] - dec <= score[0]) { n type |= (1 << (t - 1)); n } n } n guys[type]++; n cnt++; n } n } n for (int mask = 1; mask < (1 << 7); mask++) { n rgt[mask] = 0; n for (int type = 0; type < 128; type++) { n if (type & mask) { n rgt[mask] += guys[type]; n } n } n } n for (int j = 0; j < 3; j++) { n cnt_hack[j] = min(cnt_hack[j], cnt); n } n for (int AB = 0; AB <= cnt_hack[0]; AB++) { n for (int AC = 0; AB + AC <= cnt_hack[0]; AC++) { n for (int BC = 0; AB + BC <= cnt_hack[1] && AC + BC <= cnt_hack[2]; n BC++) { n for (int ABC = 0; n AB + AC + ABC <= cnt_hack[0] && n AB + BC + ABC <= cnt_hack[1] && AC + BC + ABC <= cnt_hack[2]; n ABC++) { n int A = cnt_hack[0] - AB - AC - ABC; n int B = cnt_hack[1] - AB - BC - ABC; n int C = cnt_hack[2] - AC - BC - ABC; n z[1] = 0; n z[2] = 0; n z[3] = AB; n z[4] = 0; n z[5] = AC; n z[6] = BC; n z[7] = ABC; n bound[0] = 0; n bound[1] = A; n bound[2] = B; n bound[3] = A + B; n bound[4] = C; n bound[5] = A + C; n bound[6] = B + C; n bound[7] = A + B + C; n for (int mask = 1; mask < (1 << 7); mask++) { n int lft = 0; n for (int t = 1; t < 8; t++) { n if (mask & (1 << (t - 1))) { n lft += z[t]; n } n } n bound[mask & 7] = min(bound[mask & 7], rgt[mask] - lft); n } n if (bound[0] < 0) { n continue; n } n for (int realA = 0; realA <= bound[1]; realA++) { n int boundB = min(bound[2], bound[3] - realA); n int boundC = min(bound[4], bound[5] - realA); n int boundBC = min(bound[6], bound[7] - realA); n if (boundB >= 0 && boundC >= 0 && boundBC >= 0) { n int realBplusC = min(boundB + boundC, boundBC); n ans = min(ans, 1 + (cnt - realA - realBplusC - AB - AC - n BC - ABC)); n } n } n } n } n } n } n } n } n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long m, l, r, k; n struct Matrix { n long long W[2][2]; n }; n Matrix operator*(const Matrix& A, const Matrix& B) { n Matrix S; n memset(S.W, 0, sizeof(S.W)); n for (int i = 0; i < 2; ++i) n for (int j = 0; j < 2; ++j) n for (int l = 0; l < 2; ++l) n S.W[i][j] = (S.W[i][j] + A.W[i][l] * B.W[l][j]) % m; n return S; n } n Matrix operator^(Matrix A, long long e) { n Matrix S; n S.W[0][0] = S.W[1][1] = 1; n S.W[0][1] = S.W[1][0] = 0; n while (e) { n if (e & 1) S = S * A; n A = A * A; n e >>= 1; n } n return S; n } n long long gcd() { n long long s = 1; n for (long long i = 1; i * i <= r; ++i) { n if (r / i - (l - 1) / i >= k && i > s) s = i; n long long e = r / i; n if (i - (l - 1) / e >= k && e > s) s = e; n } n return s; n } n int main() { n cin >> m >> l >> r >> k; n long long n = gcd(); n if (n <= 2) n cout << 1 % m << endl; n else { n Matrix D, S; n D.W[0][0] = 0; n D.W[0][1] = D.W[1][0] = D.W[1][1] = 1; n S = D ^ (n - 2); n cout << (S.W[0][1] + S.W[1][1]) % m << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N; n vector a, b, c; n multiset m; n int main(void) { n ios::sync_with_stdio(false); n cin.tie(NULL), cout.tie(NULL); n cin >> N; n a.resize(N); n b.resize(N); n c.resize(N); n for (int i = 0; i < N; i++) { n cin >> a[i]; n } n for (int i = 0; i < N; i++) { n cin >> b[i]; n m.insert(b[i]); n } n for (int i = 0; i < N; i++) { n int cur = N - a[i]; n multiset::iterator iter = m.lower_bound(cur); n if (iter == m.end()) { n iter = m.begin(); n } n c[i] = (a[i] + (*iter)) % N; n m.erase(iter); n } n for (int i = 0; i < N; i++) { n cout << c[i] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n int h, w, r; n } edge[110]; n bool vis[11]; n int x[5000000]; n int n, k, t; n void init() { n cin >> n >> k >> t; n for (int i = 1; i <= k; i++) cin >> edge[i].h >> edge[i].w >> edge[i].r; n } n void solve() { n int l = 0; n for (int j = 1; j <= (1 << k) - 1; j++) { n int t = 0; n for (int i = 1; i <= k; i++) n if ((j & (1 << (i - 1))) != 0) t++; n if (t > n) continue; n memset(vis, 0, sizeof(vis)); n int s = 0; n bool flag = true; n for (int i = 1; i <= k; i++) n if ((j & (1 << (i - 1))) != 0) { n if (vis[edge[i].h] || vis[edge[i].w + n]) { n flag = false; n break; n } n vis[edge[i].h] = vis[edge[i].w + n] = true; n s += edge[i].r; n } n if (flag) x[++l] = s; n } n sort(x, x + l + 1); n cout << x[t - 1] << endl; n } n int main() { n ios::sync_with_stdio(false); n init(); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int TAM = 100000 + 15; n const long long MOD = 1000000007LL; n const double PI = 3.14159265359; n long long add(long long x, long long y) { return (x + y + 2 * MOD) % MOD; } n long long mult(long long x, long long y) { n return (add(x, 0) * add(y, 0)) % MOD; n } n long long fast_expo(long long x, long long y) { n if (x == 0) return 0; n if (y == 0) return 1; n long long res = 1; n long long mid = fast_expo(x, y / 2); n if (y % 2 != 0) res = x; n return mult(mult(mid, mid), res); n } n long long inver(long long x) { return fast_expo(x, MOD - 2); } n long long gcd(long long e1, long long e2) { n if (e2 == 0) return e1; n return gcd(e2, e1 % e2); n } n int n; n map mapa[TAM]; n int color[TAM]; n vector G[TAM]; n long long dom[TAM]; n int tam[TAM]; n int cant[TAM]; n void dfs_tam(int u, int pd = -1) { n tam[u] = 1; n for (int v : G[u]) { n if (v != pd) { n dfs_tam(v, u); n tam[u] += tam[v]; n } n } n } n void dfs(int u, int pd = -1) { n int m = -1, val = -1; n for (int v : G[u]) { n if (v != pd) { n if (tam[v] > val) { n m = v; n val = tam[v]; n } n } n } n if (m == -1) { n mapa[u][color[u]]++; n dom[u] = color[u]; n cant[u] = 1; n return; n } n for (int v : G[u]) { n if (v != pd) { n dfs(v, u); n } n } n swap(mapa[u], mapa[m]); n dom[u] = dom[m]; n cant[u] = cant[m]; n mapa[u][color[u]]++; n if (mapa[u][color[u]] > cant[u]) { n cant[u] = mapa[u][color[u]]; n dom[u] = 1LL * color[u]; n } else if (mapa[u][color[u]] == cant[u]) { n dom[u] += 1LL * color[u]; n } n for (int v : G[u]) { n if (v != pd && v != m) { n int k, t; n for (map::iterator it = mapa[v].begin(); it != mapa[v].end(); n it++) { n k = it->first; n t = it->second; n mapa[u][k] += t; n if (mapa[u][k] > cant[u]) { n cant[u] = mapa[u][k]; n dom[u] = 1LL * k; n } else if (mapa[u][k] == cant[u]) { n dom[u] += 1LL * k; n } n } n } n } n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %d , &color[i]); n int u, v; n for (int i = 0; i < n - 1; i++) { n scanf( %d%d , &u, &v); n G[u - 1].push_back(v - 1); n G[v - 1].push_back(u - 1); n } n dfs_tam(0); n dfs(0); n for (int i = 0; i < n; i++) cout << 1LL * dom[i] << ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool compare(pair p1, pair p2) { n return p1.first > p2.first; n } n long long int power(int a, int b) { n if (b == 0) return 1; n return a * power(a, b - 1); n } n int gcd(int a, int b) { n if (b == 0) return a; n return gcd(b, a % b); n } n int main() { n int n, m; n cin >> n >> m; n int a[n + 1], b[m + 1]; n for (int i = 0; i < n + 1; i++) { n cin >> a[i]; n } n for (int i = 0; i < m + 1; i++) { n cin >> b[i]; n } n if (n > m) { n if (a[0] * b[0] > 0) n cout << Infinity ; n else n cout << -Infinity ; n } else if (n < m) { n cout << 0/1 ; n } else { n if (a[0] * b[0] < 0) { n cout << - ; n } n cout << abs(a[0]) / gcd(abs(a[0]), abs(b[0])) << / n << abs(b[0]) / gcd(abs(a[0]), abs(b[0])); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long ans, i, N, H, alive, last1, last2, last3, a, b, c; n long long A[2][32][32][32], B[2][32][32][32]; n int main() { n cin >> N >> H; n A[1][0][0][0] = 4; n for (i = 1; i < N; i++) { n for (alive = 0; alive < 2; alive++) n for (last1 = 0; i - last1 > 0 && last1 < H; last1++) n for (last2 = 0; i - last2 > 0 && last2 < H; last2++) n for (last3 = 0; i - last3 > 0 && last3 < H; last3++) { n if (last1 == 0 || last1 == H - 1) n a = 0; n else n a = last1 + 1; n if (last2 == 0 || last2 == H - 1) n b = 0; n else n b = last2 + 1; n if (last3 == 0 || last3 == H - 1) n c = 0; n else n c = last3 + 1; n B[alive][a][b][c] += A[alive][last1][last2][last3]; n B[alive][a][b][c] %= 1000000009; n B[last1 > 0 || i < H][alive][b][c] += A[alive][last1][last2][last3]; n B[last1 > 0 || i < H][alive][b][c] %= 1000000009; n B[last2 > 0 || i < H][a][alive][c] += A[alive][last1][last2][last3]; n B[last2 > 0 || i < H][a][alive][c] %= 1000000009; n B[last3 > 0 || i < H][a][b][alive] += A[alive][last1][last2][last3]; n B[last3 > 0 || i < H][a][b][alive] %= 1000000009; n } n for (alive = 0; alive < 2; alive++) n for (last1 = 0; last1 < H; last1++) n for (last2 = 0; last2 < H; last2++) n for (last3 = 0; last3 < H; last3++) { n A[alive][last1][last2][last3] = B[alive][last1][last2][last3]; n B[alive][last1][last2][last3] = 0; n } n } n for (a = 0; a < H; a++) n for (b = 0; b < H; b++) n for (c = 0; c < H; c++) ans = (ans + A[1][a][b][c]) % 1000000009; n for (a = 0; a < H; a++) n for (b = 0; b < H; b++) n for (c = 0; c < H; c++) n if (a > 0 || b > 0 || c > 0) ans = (ans + A[0][a][b][c]) % 1000000009; n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2 * 1e5 + 10; n long long t[2][4 * N], a, b; n void update(int l, int r, int j, int pos, int val) { n if (r < pos || pos < l) return; n if (pos <= l && r <= pos) { n t[0][j] = min(a, t[0][j] + val); n t[1][j] = min(b, t[1][j] + val); n return; n } n int mid = (l + r) >> 1; n update(l, mid, 2 * j, pos, val); n update(mid + 1, r, 2 * j + 1, pos, val); n if (l != r) { n t[0][j] = t[0][2 * j] + t[0][2 * j + 1]; n t[1][j] = t[1][2 * j] + t[1][2 * j + 1]; n } n } n long long getSum(int l, int r, int j, int x, int y, int wh) { n if (r < x || y < l) return 0LL; n if (x <= l && r <= y) { n return t[wh][j]; n } n int mid = (l + r) >> 1; n long long X = getSum(l, mid, (j << 1), x, y, wh); n long long Y = getSum(mid + 1, r, ((j << 1) | 1), x, y, wh); n return X + Y; n } n int n, k, q; n int main() { n ios_base::sync_with_stdio(0); n cin >> n >> k >> a >> b >> q; n for (int i = 0; i < q; i++) { n int type; n cin >> type; n if (type == 1) { n int di, ai; n cin >> di >> ai; n update(1, n, 1, di, ai); n } else { n int p; n cin >> p; n long long res = getSum(1, n, 1, 1, p - 1, 1); n res += getSum(1, n, 1, p + k, n, 0); n cout << res << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n int a[N], b[N]; n bool p[N]; n vector P; n pair c[N]; n int num(string s) { n int x = 0; n for (int i = 1; i < s.size(); i++) x = x * 10 + (s[i] - 0 ); n return x; n } n int main() { n int n, m, t = 0, T = 0; n string s; n cin >> n >> m; n for (int i = 0; i < n; i++) { n cin >> s; n if (s[0] == + ) { n a[num(s)]++; n c[i + 1] = {0, num(s)}; n } else { n b[num(s)]++; n t++; n c[i + 1] = {1, num(s)}; n } n } n for (int i = 1; i <= n; i++) { n if (a[i] + t - b[i] == m) { n p[i] = 1; n P.push_back(i); n T++; n } n } n if (T == 1) { n for (int i = 1; i <= n; i++) { n if (c[i].first == 0) { n if (c[i].second == P[0]) { n cout << Truth n ; n } else { n cout << Lie n ; n } n } else { n if (c[i].second == P[0]) { n cout << Lie n ; n } else { n cout << Truth n ; n } n } n } n return 0; n } n for (int i = 1; i <= n; i++) { n if (c[i].first == 0) { n if (p[c[i].second]) { n cout << Not defined n ; n } else { n cout << Lie n ; n } n } else { n if (p[c[i].second]) { n cout << Not defined n ; n } else { n cout << Truth n ; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, w, m; n double a[100]; n int kol[100]; n vector > v[100]; n int main() { n cin >> n >> w >> m; n double q = n * w * 1.0 / m; n memset(kol, 0, sizeof(kol)); n for (int i = 0; i < 100; ++i) a[i] = w; n for (int i = 0; i < m; ++i) { n double p = q; n int z = 0; n for (int j = 0; j < n; ++j) { n if (a[j] > 1e-9) { n double temp = min(p, a[j]); n v[i].push_back(make_pair(j + 1, temp)); n p -= temp; n a[j] -= temp; n ++z; n ++kol[j]; n if (kol[j] > 2) { n cout << NO n ; n return 0; n } n if (p < 1e-9) break; n } n } n if (z == 0 || p > 1e-9) { n cout << NO n ; n return 0; n } n } n cout << YES n ; n for (int i = 0; i < m; ++i) { n for (int j = 0; j < v[i].size(); ++j) { n if (j) cout << ; n cout << v[i][j].first << << fixed << setprecision(10) n << v[i][j].second; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Antenna { n int iniLeft, iniRight; n }; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int nbAntennas, totLen; n cin >> nbAntennas >> totLen; n vector ants(nbAntennas); n for (int iAnt = 0; iAnt < nbAntennas; ++iAnt) { n int center, iniScope; n cin >> center >> iniScope; n ants[iAnt].iniLeft = max(0, center - iniScope); n ants[iAnt].iniRight = min(totLen, center + iniScope); n } n vector minCost(totLen + 1); n minCost[totLen] = 0; n for (int pos = totLen - 1; pos >= 0; --pos) { n minCost[pos] = (totLen - pos); n for (int iAnt = 0; iAnt < nbAntennas; ++iAnt) { n int left = ants[iAnt].iniLeft, right = ants[iAnt].iniRight; n if (left <= pos + 1 && pos + 1 <= right) { n minCost[pos] = minCost[pos + 1]; n break; n } n if (pos < left) { n int accessCost = (left - pos - 1); n int nextPos = min(totLen, right + accessCost); n minCost[pos] = min(minCost[pos], accessCost + minCost[nextPos]); n } n } n } n cout << minCost[0] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n ll n, m, k; n cin >> n >> m >> k; n vector vec(m); n for (ll &v : vec) cin >> v; n ll ans = 0, i = 0; n while (i < m) { n ll t = (vec[i] - i - 1) / k, j = i + 1; n while (j < m && (vec[j] - i - 1) / k == t) j++; n ans++, i = j; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int p[2222], n; n int D[2222]; n int Find(int x) { n if (D[x] != 0) return D[x]; n if (p[x] == -1) n return D[x] = 1; n else n return D[x] = Find(p[x]) + 1; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &p[i]); n int ans = 0, tmp; n for (int i = 1; i <= n; i++) { n tmp = Find(i); n if (tmp > ans) ans = tmp; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int64_t INF = 4e18, MOD = 998244353; n template n struct NTT { n constexpr static int lg2(int n) { return 32 - __builtin_clz(n - 1); } n const static int MAXN = 1 << lg2(maxn), MOD = 998244353, root = 3; n int rev[MAXN], rt[MAXN]; n int mul(int a, int b) { return (long long)a * b % MOD; } n int sub(int a, int b) { return b > a ? a - b + MOD : a - b; } n int add(int a, int b) { return a + b >= MOD ? a + b - MOD : a + b; } n int binExp(int base, long long exp) { n if (exp == 0) return 1; n return mul(binExp(mul(base, base), exp / 2), exp & 1 ? base : 1); n } n NTT() { n rt[1] = 1; n for (int k = 1; k < lg2(MAXN); k++) { n int z[] = {1, binExp(root, (MOD - 1) >> (k + 1))}; n for (int i = (1 << k); i < 2 << k; i++) rt[i] = mul(rt[i / 2], z[i & 1]); n } n } n void ntt(int *a, int n) { n for (int i = 0; i < n; i++) rev[i] = (rev[i / 2] | (i & 1) << lg2(n)) / 2; n for (int i = 0; i < n; i++) n if (i < rev[i]) swap(a[i], a[rev[i]]); n for (int k = 1; k < n; k *= 2) n for (int i = 0; i < n; i += 2 * k) n for (int j = 0; j < k; j++) { n int z = mul(rt[j + k], a[i + j + k]); n a[i + j + k] = sub(a[i + j], z); n a[i + j] = add(a[i + j], z); n } n } n int in[2][MAXN]; n vector multiply(const vector &a, const vector &b) { n if (a.empty() || b.empty()) return {}; n int sz = a.size() + b.size() - 1, n = 1 << lg2(sz); n fill(in[0], in[0] + n, 0), fill(in[1], in[1] + n, 0); n copy(a.begin(), a.end(), in[0]), copy(b.begin(), b.end(), in[1]); n ntt(in[0], n), ntt(in[1], n); n int invN = binExp(n, MOD - 2); n for (int i = 0; i < n; i++) in[0][i] = mul(mul(in[0][i], in[1][i]), invN); n reverse(in[0] + 1, in[0] + n); n ntt(in[0], n); n return vector(in[0], in[0] + sz); n } n }; n struct DSU { n int64_t n; n vector p, sz, cnt; n vector good; n vector> g; n DSU(int64_t n) : n(n), p(n, -1), sz(n, 1), cnt(n, 0), good(n, 1), g(n) {} n int64_t find(int64_t c) { n if (p[c] == -1) return c; n return p[c] = find(p[c]); n } n void check(int64_t a) { n good.resize(p.size()); n good[a] = (cnt[a] == (sz[a] * (sz[a] - 1)) / 2); n } n void uni(int64_t a, int64_t b) { n a = find(a), b = find(b); n if (a == b) { n cnt[a]++; n check(a); n return; n } n p[a] = p[b] = p.size(); n p.push_back(-1); n sz.push_back(sz[a] + sz[b]); n cnt.push_back(cnt[a] + cnt[b] + 1); n g.resize(p.size()); n g.back() = {a, b}; n check(p.size() - 1); n } n }; n void add(int32_t &a, int64_t b) { a = (a + b) % MOD; } n int64_t n, k; n vector> g; n vector> ans; n vector sz; n vector good; n NTT<2 * 1505> ntt; n void dfs(int64_t cur) { n for (auto nei : g[cur]) { n dfs(nei); n } n if (g[cur].size()) { n int64_t a = g[cur][0], b = g[cur][1]; n ans[cur] = ntt.multiply(ans[a], ans[b]); n } n if (good[cur]) add(ans[cur][1], 1); n ans[cur].resize(sz[cur] + 1); n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin >> n; n vector> mat(n, vector(n)); n vector>> edges; n for (int64_t i = 0; i < n; i++) { n for (int64_t j = 0; j < n; j++) { n cin >> mat[i][j]; n if (j < i) edges.push_back({mat[i][j], {j, i}}); n } n } n sort(edges.begin(), edges.end()); n DSU dsu(n); n for (auto e : edges) { n dsu.uni(e.second.first, e.second.second); n } n g = dsu.g, good = dsu.good, sz = dsu.sz; n good.resize(g.size()); n int64_t root = dsu.find(0); n k = n, n = g.size(); n ans.resize(n, vector(k + 1)); n dfs(root); n for (int64_t i = 1; i < k + 1; i++) cout << ans[root][i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n #define f(i,q,n) for(int i=(int)q;i>t; n while(t--){ n int n,m; n cin>>n>>m; n string s; n cin>>s; n while(m--){ n string ans=s; n f(i,0,n){ n if(i==0 and ans[i]== 0 and ans[i+1]== 1 ){s[i]= 1 ;} n else if(i==n-1 and ans[i]== 0 and ans[i-1]== 1 ){s[i]= 1 ;} n else{ n if(i0 and ans[i]== 0 and ans[i+1]!=ans[i-1]){ n s[i]= 1 ; n } n } n } n if(s==ans){ n break; n } n n n } n n cout< n using namespace std; n using namespace std; n long long a[200005]; n struct poi { n long long val; n int pos; n } tp; n bool operator<(const poi &a, const poi &b) { n return (a.val > b.val) || (a.val == b.val and a.pos > b.pos); n } n priority_queue q; n int main() { n int n; n int cnt = 0; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %lld , &a[i]); n tp.val = a[i]; n tp.pos = i; n q.push(tp); n } n while (!q.empty()) { n poi a1 = q.top(); n q.pop(); n poi b1 = q.top(); n q.pop(); n while (!q.empty() && a1.val != b1.val) { n a1 = b1; n b1 = q.top(); n q.pop(); n } n if (a1.val == b1.val and a1.pos != b1.pos) { n a[b1.pos] = b1.val * 2; n b1.val = b1.val * 2; n a[a1.pos] = -1; n cnt++; n if (q.empty()) break; n q.push(b1); n } n } n printf( %d n , n - cnt); n for (int i = 0; i < n; i++) { n if (a[i] != -1) printf( %lld , a[i]); n } n printf( n ); n } n "} +{"func_code_string": "#include n using namespace std; n string str; n const long long MOD = 1e9 + 7; n template n inline void amin(T &x, const T &y) { n if (y < x) x = y; n } n template n inline void amax(T &x, const T &y) { n if (x < y) x = y; n } n int read() { n long long s = 0, f = 1; n char c = getchar(); n while (c < 0 || c > 9 ) { n if (c == - ) f = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n s = s * 10 + c - 0 ; n c = getchar(); n } n return s * f; n } n long long Pow(long long a, long long b) { n if (a == 1 || b == 1) return a; n if (b % 2 == 1) return (a * Pow(a, b - 1)) % MOD; n return (Pow(a, b / 2) * Pow(a, b / 2)) % MOD; n } n long long factorial(long long n) { n long long ans = 1; n while (--n) ans = (ans * (n + 1)) % MOD; n return ans; n } n vector b(12, 0); n bool binod(int k) { n bool arr[13][13]; n memset(arr, 0, sizeof(arr)); n int a = 0; n for (int i = 0; i < k; i++) n for (int j = 0; j < 12 / k; j++) { n arr[i][j] = b[a]; n a++; n } n a = 0; n bool d; n for (int j = 0; j < 12 / k; j++) { n d = 1; n for (int i = 0; i < k; i++) { n if (!arr[i][j]) d = 0; n } n if (d) return 1; n } n return 0; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n for (int i = 0; i < 12; i++) { n char sign; n cin >> sign; n if (sign == X ) n b[i] = 1; n else n b[i] = 0; n } n vector v; n if (binod(1)) v.push_back(1); n if (binod(2)) v.push_back(2); n if (binod(3)) v.push_back(3); n if (binod(4)) v.push_back(4); n if (binod(6)) v.push_back(6); n if (binod(12)) v.push_back(12); n cout << v.size() << ; n for (int i = 0; i < v.size(); i++) { n cout << v[i] << x << 12 / v[i] << ; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string str; n int make(int star, int en) { n if (en - star >= 7) return -1e7; n if (en - star >= 1 && str[star] == 0 ) return -1e7; n if (str[star] == 0 && str[en] != 0 ) return -1e7; n int sum = 0; n for (int i = star; i <= en; i++) { n sum = sum * 10 + (str[i] - 0 ); n } n if (sum > 1e6) return -1e7; n return sum; n } n int main() { n int m = -1, i, j, len, a, b, c; n cin >> str; n len = str.length(); n for (i = 0; i < len - 2; i++) { n for (j = i + 1; j < len - 1; j++) { n a = make(0, i); n b = make(i + 1, j); n c = make(j + 1, len - 1); n m = max(m, a + b + c); n } n } n if (m < 0) n printf( -1 ); n else n printf( %d , m); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n static const double EPS = 1e-9; n static const double PI = acos(-1.0); n char ans[4][110]; n int main() { n int n; n while (scanf( %d , &n) > 0) { n if (n == 1) { n printf( a na nb nb n ); n continue; n } n ans[0][0] = a ; n ans[1][0] = a ; n ans[2][0] = b ; n ans[3][0] = c ; n int ud = 2; n char p = b ; n for (int i = 1; i < n; i++) { n ans[ud][i] = p; n ans[ud + 1][i] = p + 1; n p += 2; n if (p >= x ) { n p = a ; n } n ud ^= 2; n if (i == n - 1) { n ans[ud][i] = p; n ans[ud + 1][i] = p; n } else { n ans[ud][i] = p; n ans[ud + 1][i] = p + 1; n } n } n for (int y = 0; y < (int)(4); y++) { n for (int x = 0; x < (int)(n); x++) { n putchar(ans[y][x]); n } n puts( ); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, i, a; n vector > v; n cin >> n; n for (i = 0; i < n; ++i) { n cin >> a; n v.push_back(make_pair(a, i + 1)); n } n for (i = 0; i < n; ++i) { n cin >> a; n v.push_back(make_pair(a, i + 1)); n } n long long m; n cin >> m; n m *= 2; n sort(v.begin(), v.end()); n long long r = 1; n int c = 0, c1 = 0; n for (i = 1; i < n + n; ++i) { n if (v[i].first == v[i - 1].first) { n ++c; n if (v[i].second == v[i - 1].second) { n ++c1; n } else n c1 = 0; n } else { n c1 = c = 0; n } n r = (r * (c + 1) / (c1 + 1)) % m; n c1 = 0; n } n cout << r % (m / 2); n return 0; n } n int cpp4cf_main() { n freopen( B.cpp , r , stdin); n char s[99]; n bool f; n while (true) { n cin >> s; n if (cin.eof()) break; n if (strstr(s, /* )) { n cin >> s; n if (strstr(s, Test )) { n cin >> s; n if (strstr(s, on )) { n cout << Output: ; n cpp4cf_main(); n cout << nAnswer: ; n f = false; n while (true) { n cin >> s; n if (strstr(s, */ )) break; n if (strstr(s, // )) { n if (f) n cout << endl; n else n f = true; n } else n cout << s << ; n } n cout << n n ; n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long power(long long x, long long y, long long p) { n long long res = 1; n x = x % p; n while (y > 0) { n if (y & 1) res = (res * x) % p; n y = y >> 1; n x = (x * x) % p; n } n return res; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long n; n cin >> n; n long long a[n]; n for (long long i = 0; i < n; i++) cin >> a[i]; n map mp; n long long ans = 0; n long long prev = 0; n long long sum = 0; n for (long long i = 0; i < n; i++) { n sum += a[i]; n if (sum == 0) n prev = max(prev, mp[0] + 1); n else if (mp.find(sum) != mp.end()) n prev = max(prev, mp[sum] + 1); n ans += i + 1 - prev; n mp[sum] = i + 1; n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const bool debug = 0; n struct mout { n int i, j; n long long first; n mout(){}; n mout(int i, int j, long long first) : i(i), j(j), first(first) {} n }; n int main() { n if (!debug) { n cin.tie(0); n cout.tie(0); n ios::sync_with_stdio(0); n } n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n vector a(n); n vector out; n for (int i = 0; i < n; i++) cin >> a[i]; n long long s = 0; n for (int i = 0; i < n; i++) s += a[i]; n if (s != (s / n) * n) { n cout << -1 n ; n continue; n } n s /= n; n for (int i = 1; i < n; i++) { n if (a[i] % (i + 1) != 0) { n out.push_back({1, i + 1, i + 1 - a[i] % (i + 1)}); n a[1] -= i + 1 - a[i] % (i + 1); n a[i] += i + 1 - a[i] % (i + 1); n } n out.push_back({i + 1, 1, a[i] / (i + 1)}); n a[1] += a[i]; n a[i] = 0; n } n for (int i = 1; i < n; i++) { n out.push_back({1, i + 1, s}); n } n cout << out.size() << n ; n for (int i = 0; i < out.size(); i++) n cout << out[i].i << << out[i].j << << out[i].first << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1e9 + 7; n const long long INF = 1e14; n const long long TE3 = 1005; n const long long TE5 = 300005; n const string YN[2] = { NO , YES }; n using namespace std; n long long f(long long n, vector& q1, vector& q2) { n unordered_map e; n long long c = 0; n e[0] = -1; n long long i = 0, j = 0; n long long ans = 0; n while (i < q1.size() || j < q2.size()) { n long long g; n long long q1t = (i >= q1.size()) ? INF : q1[i]; n long long q2t = (j >= q2.size()) ? INF : q2[j]; n if (q1t < q2t) { n g = q1t; n ++c; n ++i; n } else { n g = q2t; n --c; n ++j; n } n if (e.find(c) == e.end()) { n e[c] = g; n } else { n q2t = (j >= q2.size()) ? INF : q2[j]; n q1t = (i >= q1.size()) ? INF : q1[i]; n long long tmp = min(q1t, q2t); n long long cur = (tmp == INF ? n : tmp) - e[c] - 1; n ans = max(ans, cur); n } n } n return ans; n } n int main() { n ios::sync_with_stdio(false); n long long n; n cin >> n; n long long x; n unordered_map > mpq; n for (long long i = (0); i < (n); ++i) { n cin >> x; n mpq[x].push_back(i); n } n if (mpq.size() == 1) { n cout << 0 << endl; n return 0; n } n unordered_map rev; n long long ma = -INF, mo = 0; n for (auto it : mpq) { n rev[it.second.size()]++; n if (it.second.size() > mo) { n ma = it.first; n mo = it.second.size(); n } n } n if (rev[mo] >= 2) { n cout << n << endl; n return 0; n } n long long ans = 0; n for (auto it : mpq) { n if (it.first == ma) continue; n ans = max(ans, f(n, mpq[ma], it.second)); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long oo = 1e18; n struct dta { n int u, id; n dta(int _u = 0, int _id = 0) { n u = _u; n id = _id; n } n }; n struct TDij { n long long val; n int x; n TDij(long long _val = 0, int _x = 0) { n x = _x; n val = _val; n } n }; n inline bool operator<(const TDij &a, const TDij &b) { return (a.val > b.val); } n int n, m, k, cost[300010], trace[300010], delneed; n bool flag[300010]; n long long F[300010]; n vector A[300010]; n priority_queue Q; n void dijks() { n memset(flag, true, sizeof(flag)); n memset(trace, 0, sizeof(trace)); n for (int i = 2; i <= n; ++i) F[i] = oo; n F[1] = 0; n Q.push(TDij(0, 1)); n while (!Q.empty()) { n TDij topx = Q.top(); n Q.pop(); n if (topx.val != F[topx.x]) continue; n int u = topx.x; n for (int i = 0; i <= A[u].size() - 1; ++i) { n if (F[A[u][i].u] > F[u] + cost[A[u][i].id]) { n F[A[u][i].u] = F[u] + cost[A[u][i].id]; n flag[trace[A[u][i].u]] = true; n trace[A[u][i].u] = A[u][i].id; n flag[A[u][i].id] = false; n Q.push(TDij(F[A[u][i].u], A[u][i].u)); n } n } n } n } n void dfs(int x, int par, int pared) { n for (int i = 0; i <= A[x].size() - 1; ++i) n if (A[x][i].u != par && !flag[A[x][i].id]) { n dfs(A[x][i].u, x, A[x][i].id); n if (delneed == 0) return; n } n if (delneed > 0) { n (--delneed); n flag[pared] = true; n } n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> m >> k; n for (int i = 1; i <= m; ++i) { n int u, v; n cin >> u >> v >> cost[i]; n A[u].push_back(dta(v, i)); n A[v].push_back(dta(u, i)); n } n dijks(); n delneed = m - k; n if (!delneed) { n for (int i = 1; i <= m; ++i) delneed += (!flag[i]); n cout << delneed << n ; n for (int i = 1; i <= m; ++i) n if (!flag[i]) cout << i << ; n return 0; n } n for (int i = 1; i <= m; ++i) n if (flag[i]) { n if ((--delneed) == 0) { n cout << k << n ; n for (int j = 1; j <= i; ++j) n if (!flag[j]) cout << j << ; n for (int j = i + 1; j <= m; ++j) cout << j << ; n return 0; n } n } n dfs(1, 0, 0); n cout << k << n ; n for (int i = 1; i <= m; ++i) n if (!flag[i]) cout << i << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector solve(int k) { n vector s; n if (k == 0) { n s.push_back( + ); n return s; n } n vector prev = solve(k - 1), rev; n for (int i = 0; i < prev.size(); i++) { n string temp; n for (int j = 0; j < prev.size(); j++) { n if (prev[i][j] == + ) n temp += * ; n else n temp += + ; n } n rev.push_back(temp); n } n for (int i = 0; i < prev.size(); i++) { n s.push_back(prev[i] + prev[i]); n s.push_back(prev[i] + rev[i]); n } n return s; n } n int main() { n int k; n cin >> k; n vector s; n s = solve(k); n for (int i = 0; i < s.size(); i++) { n cout << s[i] << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int s = 0; n char c; n while ((c = getchar()) < 0 || c > 9 ) n ; n do { n s = s * 10 + c - 0 ; n } while ((c = getchar()) >= 0 && c <= 9 ); n return s; n } n const int N = 3010, M = 310; n int n, m, rp[M]; n double f[M][2][N], tp[N][M]; n priority_queue > h; n double nxdp(int i) { n int p = (++rp[i]) & 1; n if (rp[i] > n) return -1e9; n f[i][p][0] = 0; n for (int k = 1; k <= n; k++) n f[i][p][k] = n tp[k][i] * f[i][p ^ 1][k - 1] + (1 - tp[k][i]) * f[i][p][k - 1]; n return f[i][p][n]; n } n double work() { n int i, k; n double ans = 0; n for (i = 1; i <= m; i++) n for (k = 0; k <= n; k++) f[i][0][k] = 1; n for (i = 1; i <= m; i++) h.push(make_pair(nxdp(i), i)); n for (i = 1; i <= n; i++) { n pair t = h.top(); n h.pop(); n ans += t.first; n h.push(make_pair(nxdp(t.second), t.second)); n } n return ans; n } n int main() { n int i, j; n n = read(), m = read(); n for (i = 1; i <= n; i++) n for (j = 1; j <= m; j++) tp[i][j] = read() * 0.001; n printf( %.11lf n , work()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int siz = 1e5 + 10; n const long long modu = 1e9 + 7; n int pre[13] = {1, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292, 341}; n int main() { n int n; n scanf( %d , &n); n if (n < 13) { n cout << pre[n] << endl; n return 0; n } n long long n1 = n; n long long ans = pre[12]; n ans += (n1 - 12ll) * 49ll; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map mp; n int main() { n int n, num, flag = 1, f; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , &num); n ++mp[num]; n } n map::iterator it = mp.begin(); n int ln = it->first; n int lm = it->second; n int l = ln, r = ln; n ++it; n for (; it != mp.end(); ++it) { n if (it->first > r + 1) { n flag = 0; n break; n } else { n if (lm == it->second) { n lm = 1; n r = it->first; n } else if (lm > it->second) { n lm -= it->second; n if (lm > 1) { n flag = 0; n break; n } n } else if (lm < it->second) { n if (l + 1 != it->first) { n lm = it->second - lm + 1; n r = it->first; n continue; n } n l = it->first; n r = it->first; n lm = it->second - lm; n } n } n } n if (l + 1 != r) flag = 0; n if (flag && lm < 2) { n printf( YES ); n } else n printf( NO ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int ct[2][6] = {0}; n for (int i = 0; i < n; i++) { n int tmp; n scanf( %d , &tmp); n ct[0][tmp]++; n } n for (int i = 0; i < n; i++) { n int tmp; n scanf( %d , &tmp); n ct[1][tmp]++; n } n int diff = 0; n int flag = 0; n for (int i = 1; i <= 5; i++) { n if (ct[0][i] != ct[1][i]) { n int tmp = abs(ct[0][i] - ct[1][i]); n if (tmp % 2 != 0) flag = 1; n diff += tmp / 2; n } n } n if (flag == 0) n cout << diff / 2; n else n cout << -1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long j, k, s, l, m, n, t, d; n long long e[111][33333], a, b, i, p, c; n map y; n string q, r, w; n int main() { n cin >> n >> a >> b >> c; n n *= 2; n for (i = 0; i <= a; i++) { n for (j = 0; j <= b; j++) { n k = n - i - 2 * j; n if (k % 4 == 0 && k / 4 <= c && k >= 0) s++; n } n } n cout << s; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, t, k, d, t1, t2, kol; n bool f; n f = false; n cin >> n; n cin >> t; n cin >> k; n cin >> d; n t1 = 0; n t2 = 0; n kol = 0; n while (kol < n) { n t1++; n if (t1 % t == 0) { n kol = kol + k; n } n } n kol = 0; n while (kol < n) { n t2++; n if (f == true) { n if ((t2 - d) % t == 0) { n kol = kol + k; n } n } n if (t2 % t == 0) { n kol = kol + k; n } n if (t2 % d == 0) { n f = true; n } n } n if (t1 > t2) { n cout << YES ; n } else { n cout << NO ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int y, w; n cin >> y >> w; n int ans; n ans; n if (y >= w) { n ans = 6 - y + 1; n } else if (w >= y) { n ans = 6 - w + 1; n } n if (ans == 6) { n cout << 1 << / << 1 << endl; n } n if (ans == 1) { n cout << 1 << / << 6 << endl; n } n if (ans == 2) { n cout << 1 << / << 3 << endl; n } n if (ans == 3) { n cout << 1 << / << 2 << endl; n } n if (ans == 4) { n cout << 2 << / << 3 << endl; n } n if (ans == 5) { n cout << 5 << / << 6 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, a[111], ans = 1e9; n set s[111]; n int main() { n ios_base ::sync_with_stdio(false); n cin >> n >> m; n for (int i = 1; i <= n; ++i) { n cin >> a[i]; n } n for (int i = 0, x, y; i < m; ++i) { n cin >> x >> y; n s[x].insert(y); n s[y].insert(x); n } n for (int i = 1; i < n - 1; ++i) { n for (int j = i + 1; j < n; ++j) { n if (s[i].count(j)) { n for (int k = j + 1; k <= n; ++k) { n if (s[i].count(k) && s[j].count(k)) { n ans = min(a[i] + a[j] + a[k], ans); n } n } n } n } n } n if (ans == 1e9) { n cout << -1; n } else { n cout << ans; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int temp = 0; n int n = 0; n cin >> n; n vector city(n); n for (int i = 0; i < n; ++i) { n cin >> city[i]; n } n int max = 0; n int min = 0; n for (int j = 0; j < n; ++j) { n if (j == n - 1) { n min = abs(city[j] - city[j - 1]); n max = abs(city[j] - city[0]); n } else if (j == 0) { n min = abs(city[0] - city[1]); n max = abs(city[0] - city[n - 1]); n } else { n if (abs(city[j] - city[j + 1]) < abs(city[j] - city[j - 1])) n min = abs(city[j] - city[j + 1]); n else if (abs(city[j] - city[j + 1]) >= abs(city[j] - city[j - 1])) n min = abs(city[j] - city[j - 1]); n if (abs(city[j] - city[0]) < abs(city[j] - city[n - 1])) n max = abs(city[j] - city[n - 1]); n else if (abs(city[j] - city[0]) >= abs(city[j] - city[n - 1])) n max = abs(city[j] - city[0]); n } n cout << min << << max << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n T gcd(T a, T b) { n return (b == 0) ? a : gcd(b, a % b); n } n template n T lcm(T a, T b) { n return a * (b / gcd(a, b)); n } n template n T mod_exp(T b, T p, T m) { n T x = 1; n while (p) { n if (p & 1) x = (x * b) % m; n b = (b * b) % m; n p = p >> 1; n } n return x; n } n template n T invFermat(T a, T p) { n return mod_exp(a, p - 2, p); n } n template n T exp(T b, T p) { n T x = 1; n while (p) { n if (p & 1) x = (x * b); n b = (b * b); n p = p >> 1; n } n return x; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ; n int a, b; n cin >> a >> b; n if (a == 0 && b == 0) { n cout << NO << n ; n } else if (abs(a - b) <= 1) n cout << YES << n ; n else n cout << NO << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int A[105][105]; n int main() { n int n; n int ans = 0; n cin >> n; n for (int i = 0; i < n; i++) { n string s; n cin >> s; n for (int j = 0; j < n; j++) { n if (s[j] == C ) { n A[i][j] = 1; n } else { n A[i][j] = 0; n } n } n } n for (int i = 0; i < n; i++) { n int cnt = 0; n for (int j = 0; j < n; j++) { n if (A[i][j] == 1) { n cnt++; n } n } n ans += (cnt * (cnt - 1)) / 2; n } n for (int i = 0; i < n; i++) { n int cnt = 0; n for (int j = 0; j < n; j++) { n if (A[j][i] == 1) { n cnt++; n } n } n ans += (cnt * (cnt - 1)) / 2; n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n char name[110][3000], text[110][3000]; n int name_len[110], text_len[110]; n bool found[110][110], dp[110][110]; n int pre[110][110]; n int chosen[110]; n void variable_init() { n memset(found, 0, sizeof found); n memset(dp, 0, sizeof dp); n } n int main() { n int tcase, n, m; n scanf( %d , &tcase); n while (tcase--) { n variable_init(); n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %s , name[i]); n name_len[i] = strlen(name[i]); n } n scanf( %d , &m); n gets(text[0]); n for (int i = 1; i <= m; i++) { n gets(text[i]); n text_len[i] = strlen(text[i]); n if (text[i][0] != ? ) { n for (int k = 1; k <= n; k++) { n bool ok = true; n if (text_len[i] < name_len[k]) ok = false; n for (int l = 0; l < name_len[k] && ok; l++) { n if (text[i][l] != name[k][l]) ok = false; n } n ok &= n (name_len[k] == text_len[i] || (!isalpha(text[i][name_len[k]]) && n !isdigit(text[i][name_len[k]]))); n if (ok) { n bool found_others = false; n int pre_choose; n if (i == 1) { n found_others = true; n pre_choose = -1; n } n for (int j = 1; j <= n; j++) n if (j != k && dp[i - 1][j]) { n found_others = true; n pre_choose = j; n break; n } n dp[i][k] = found_others; n pre[i][k] = pre_choose; n break; n } n } n continue; n } n for (int j = 0; j < text_len[i]; j++) { n if (!isalpha(text[i][j]) && !isdigit(text[i][j])) { n for (int k = 1; k <= n; k++) { n bool ok = true; n if (text_len[i] - 1 - j < name_len[k]) ok = false; n for (int l = j + 1; l <= j + name_len[k] && ok; l++) { n if (text[i][l] != name[k][l - (j + 1)]) ok = false; n } n ok &= (j + name_len[k] + 1 == text_len[i] || n (!isalpha(text[i][j + name_len[k] + 1]) && n !isdigit(text[i][j + name_len[k] + 1]))); n if (ok) found[i][k] = true; n } n } n } n for (int j = 1; j <= n; j++) { n for (int k = 1; k <= n; k++) { n if (i == 1) { n if (!found[i][k]) { n dp[i][k] = true; n pre[i][k] = -1; n } n } else { n if (j != k && dp[i - 1][j] && !found[i][k]) { n dp[i][k] = true; n pre[i][k] = j; n } n } n } n } n } n bool least_one = false; n int last; n for (int i = 1; i <= n; i++) { n if (dp[m][i]) { n least_one = true; n last = i; n } n } n if (!least_one) n puts( Impossible ); n else { n for (int i = m; i >= 1; i--) { n chosen[i] = last; n last = pre[i][last]; n } n for (int i = 1; i <= m; i++) { n if (text[i][0] == ? ) { n printf( %s , name[chosen[i]]); n int pos; n for (int j = 1; j < text_len[i]; j++) n if (text[i][j] == : ) { n pos = j; n break; n } n puts(text[i] + pos); n } else { n puts(text[i]); n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void readi(int &x) { n int v = 0, f = 1; n char c = getchar(); n while (!isdigit(c) && c != - ) c = getchar(); n if (c == - ) n f = -1; n else n v = v * 10 + c - 0 ; n while (isdigit(c = getchar())) v = v * 10 + c - 0 ; n x = v * f; n } n void readll(long long &x) { n long long v = 0ll, f = 1ll; n char c = getchar(); n while (!isdigit(c) && c != - ) c = getchar(); n if (c == - ) n f = -1; n else n v = v * 10 + c - 0 ; n while (isdigit(c = getchar())) v = v * 10 + c - 0 ; n x = v * f; n } n void readc(char &x) { n char c; n while ((c = getchar()) == ) n ; n x = c; n } n void writes(string s) { puts(s.c_str()); } n void writeln() { writes( ); } n void writei(int x) { n if (!x) putchar( 0 ); n char a[25]; n int top = 0; n while (x) { n a[++top] = (x % 10) + 0 ; n x /= 10; n } n while (top) { n putchar(a[top]); n top--; n } n } n void writell(long long x) { n if (!x) putchar( 0 ); n char a[25]; n int top = 0; n while (x) { n a[++top] = (x % 10) + 0 ; n x /= 10; n } n while (top) { n putchar(a[top]); n top--; n } n } n inline long long inc(int &x) { return ++x; } n inline long long inc(long long &x) { return ++x; } n inline long long inc(int &x, long long y) { return x += y; } n inline long long inc(long long &x, long long y) { return x += y; } n inline double inc(double &x, double y) { return x += y; } n inline long long dec(int &x) { return --x; } n inline long long dec(long long &x) { return --x; } n inline long long dec(int &x, long long y) { return x -= y; } n inline long long dec(long long &x, long long y) { return x -= y; } n inline double dec(double &x, double y) { return x -= y; } n inline long long mul(int &x) { return x = ((long long)x) * x; } n inline long long mul(long long &x) { return x = x * x; } n inline long long mul(int &x, long long y) { return x *= y; } n inline long long mul(long long &x, long long y) { return x *= y; } n inline double mul(double &x, double y) { return x *= y; } n inline long long divi(int &x) { return x = sqrt(x); } n inline long long divi(long long &x) { return x = sqrt(x); } n inline long long divi(int &x, long long y) { return x /= y; } n inline long long divi(long long &x, long long y) { return x /= y; } n inline double divi(double &x, double y) { return x /= y; } n inline long long mod(int &x, long long y) { return x %= y; } n inline long long mod(long long &x, long long y) { return x %= y; } n long long n, m, i, j, cnt, cas; n long long ans; n vector all; n struct Scanning_line { n long long l, r, h, ad; n } s[200005]; n struct seg { n long long l, r, add; n long long sum; n } tr[800005]; n void build(long long x, long long l, long long r) { n if (l == r) { n tr[x].l = l; n tr[x].r = r; n tr[x].add = tr[x].sum = 0; n return; n } n tr[x].l = l; n tr[x].r = r; n tr[x].add = tr[x].sum = 0; n build(x * 2, l, (l + r) / 2); n build(x * 2 + 1, (l + r) / 2 + 1, r); n } n void pushup(long long x) { n if (tr[x].add) n tr[x].sum = all[tr[x].r] - all[tr[x].l - 1]; n else if (tr[x].l == tr[x].r) n tr[x].sum = 0; n else n tr[x].sum = tr[x * 2].sum + tr[x * 2 + 1].sum; n } n void update(long long x, long long l, long long r, long long c) { n if (tr[x].l > r || tr[x].r < l) return; n if (l <= tr[x].l && tr[x].r <= r) { n tr[x].add += c; n pushup(x); n return; n } n update(x * 2, l, r, c); n update(x * 2 + 1, l, r, c); n pushup(x); n } n bool cmp(Scanning_line x, Scanning_line y) { return x.h < y.h; } n int main() { n ios_base::sync_with_stdio(0); n cin >> n; n cnt = 0; n for (i = 1; i <= n; i++) { n long long w, x, y, z; n cin >> w >> x >> y >> z; n if (w > y) swap(w, y); n if (x > z) swap(x, z); n w--; n x--; n all.push_back(w); n all.push_back(y); n s[++cnt] = {w, y, x, 1}; n s[++cnt] = {w, y, z, -1}; n } n stable_sort(all.begin(), all.end()); n stable_sort(s + 1, s + cnt + 1, cmp); n all.resize(unique(all.begin(), all.end()) - all.begin()); n ans = 0; n build(1, 0, all.size()); n for (i = 1; i <= cnt; i++) { n if (i != 1 && s[i].h != s[i - 1].h) { n ans += abs(s[i].h - s[i - 1].h) * tr[1].sum; n } n long long l = upper_bound(all.begin(), all.end(), s[i].l) - all.begin(); n long long r = upper_bound(all.begin(), all.end(), s[i].r) - all.begin(); n update(1, l, r - 1, s[i].ad); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n if (n % 2 != 0) { n n += 1; n } n cout << (n / 2) - 1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN(1e5 + 10); n typedef int i_N[maxN]; n int N, Gx[maxN][2], Fx[maxN][2][2]; n i_N A; n string S; n int main() { n scanf( %d n , &N); n getline(cin, S); n for (int i = 0; i < (int)S.size(); i++) A[i + 1] = S[i] == 1 ; n A[0] = A[N + 1] = -1; n for (int i = N; i; i--) { n Gx[i][0] = Gx[i + 1][0]; n Gx[i][1] = Gx[i + 1][1]; n if (A[i] == 0) n Gx[i][0] = max(Gx[i][0], Gx[i + 1][1] + 1); n else n Gx[i][1] = max(Gx[i][1], Gx[i + 1][0] + 1); n } n int ans(0); n for (int i = 1; i <= N; i++) { n for (int j = 0; j < 2; j++) n for (int k = 0; k < 2; k++) Fx[i][j][k] = Fx[i - 1][j][k]; n if (A[i] == 0) { n Fx[i][0][0] = max(Fx[i][0][0], Fx[i - 1][1][0] + 1); n Fx[i][1][1] = max(Fx[i][1][1], max(Fx[i - 1][0][0], Fx[i - 1][0][1]) + 1); n } else { n Fx[i][1][0] = max(Fx[i][1][0], Fx[i - 1][0][0] + 1); n Fx[i][0][1] = max(Fx[i][0][1], max(Fx[i - 1][1][0], Fx[i - 1][1][1]) + 1); n } n ans = max(ans, max(Fx[i][0][1] + Gx[i + 1][1], Fx[i][1][1] + Gx[i + 1][0])); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int n, d; n string s, t; n map, vector > M; n map > N; n int main() { n ios_base::sync_with_stdio(false); n cin >> n >> s >> t; n d = 0; n for (int i = 0; i < n; ++i) { n if (s[i] != t[i]) { n M[make_pair(s[i], t[i])].push_back(i + 1); n N[s[i]].push_back(i + 1); n ++d; n } n } n for (int i = 0; i < n; ++i) { n if (s[i] != t[i]) { n map, vector >::iterator it = n M.find(make_pair(t[i], s[i])); n if (it != M.end()) { n cout << d - 2 << endl; n cout << i + 1 << << it->second.back() << endl; n return 0; n } n } n } n for (int i = 0; i < n; ++i) { n if (s[i] != t[i]) { n if (N.find(t[i]) != N.end()) { n cout << d - 1 << endl; n cout << i + 1 << << N[t[i]].back() << endl; n return 0; n } n } n } n cout << d << endl; n cout << -1 -1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n set s; n int ans[300005]; n int main() { n int n, m, l, r, x; n cin >> n >> m; n for (int i = 1; i < n + 1; i++) { n s.insert(i); n ans[i] = 0; n } n for (int i = 0; i < m; i++) { n cin >> l >> r >> x; n set::iterator lb = s.lower_bound(l), ub = s.upper_bound(r); n for (set::iterator it = lb; it != ub; it++) n if (*it != x) ans[*it] = x; n s.erase(lb, ub); n s.insert(x); n } n for (int i = 1; i < n + 1; i++) cout << ans[i] << ; n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e3 + 5; n char s[N]; n int n, f[N], mk[N], cnt[N]; n vector p; n void init() { n for (int i = 2; i < N; i++) n if (!mk[i]) { n p.push_back(i); n for (int j = i + i; j < N; j += i) mk[j] = true; n } n } n int main() { n scanf( %s , s + 1); n n = strlen(s + 1); n init(); n memset(mk, 0, sizeof(mk)); n for (int i = 0; i < p.size(); i++) { n if (p[i] * 2 > n) break; n for (int j = 1; j * p[i] <= n; j++) mk[p[i] * j] = true; n } n int tot = 0, mx = 0, pos; n for (int i = 1; i <= n; i++) { n cnt[s[i] - a ]++; n if (mk[i]) tot++; n } n for (int i = 0; i < 26; i++) n if (mx < cnt[i]) mx = cnt[i], pos = i; n if (mx < tot) { n cout << NO << n ; n return 0; n } n puts( YES ); n for (int i = 1; i <= n; i++) { n if (mk[i]) n printf( %c , a + pos), cnt[pos]--, tot--; n else n for (int j = 0; j < 26; j++) n if (j == pos && cnt[j] > tot || (j != pos && cnt[j])) { n printf( %c , a + j); n cnt[j]--; n break; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector > edge(100010); n long long int vis[100010]; n vector color[2]; n bool dfs(long long int a, long long int c = 2) { n vis[a] = c; n color[c - 1].push_back(a); n for (auto x : edge[a]) { n if (!vis[x] && dfs(x, 3ll - c)) { n return 1; n } n if (vis[x] != 3ll - c) { n return 1; n } n } n return 0; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long int n, m, x, y; n cin >> n >> m; n for (long long int i = 1; i <= m; i++) { n cin >> x >> y; n edge[x].push_back(y); n edge[y].push_back(x); n } n for (long long int i = 1; i <= n; i++) { n if (!vis[i]) { n if (edge[i].size() == 0) { n continue; n } n if (dfs(i)) { n cout << -1 << endl; n return 0; n } n } n } n for (long long int i = 0; i < 2; i++) { n cout << color[i].size() << endl; n for (auto x : color[i]) { n cout << x << ; n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int p[110]; n int find(int v) { n if (p[v] == v) return v; n return p[v] = find(p[v]); n } n bool merge(int u, int v) { n int x = find(u); n int y = find(v); n if (x != y) { n p[x] = y; n return true; n } n return false; n } n int main() { n int n, m; n cin >> n >> m; n vector > edges; n for (int i = 0; i < m; i++) { n int a, b; n cin >> a >> b; n edges.push_back({a, b}); n p[a] = a; n p[b] = b; n } n int flag = 0, count = 1; n for (pair e : edges) { n int a = e.first, b = e.second; n if (!merge(a, b)) { n flag++; n if (flag > 1) break; n } else n count++; n } n if (flag == 1 && count == n) n cout << FHTAGN! n << n ; n else n cout << NO n << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char local = O ; n template n void read(T &p) { n cin >> p; n } n template n void read(pair &p) { n read(p.first); n read(p.second); n } n template n void read(T arr[], long long n) { n for (long long i = 0; i < n; i++) { n read(arr[i]); n } n } n template n void read(vector &arr) { n for (long long i = 0; i < arr.size(); i++) { n read(arr[i]); n } n } n template n void out(T &n) { n cout << n; n } n template n void out(pair &p) { n cout << ( ; n out(p.first); n cout << , ; n out(p.second); n cout << ) ; n } n template n void out(T arr[], long long n) { n for (long long i = 0; i < n; i++) { n out(arr[i]); n cout << ; n } n } n template n void out(vector &arr) { n for (long long i = 0; i < arr.size(); i++) { n out(arr[i]); n cout << ; n } n } n template n void out(set &arr) { n for (auto i : arr) { n out(i); n cout << ; n } n } n template n void out(multiset &arr) { n for (auto i : arr) { n out(i); n cout << ; n } n } n template n void out(map &m) { n for (auto i : m) { n out(i.first); n cout << -> ; n out(i.second); n cout << , ; n } n } n template n void __f(const char *name, Arg1 &&arg1) { n cout << name << : ; n out(arg1); n } n template n void __f(const char *names, Arg1 &&arg1, Args &&...args) { n const char *comma = strchr(names + 1, , ); n cout.write(names, comma - names) << : ; n out(arg1); n cout << | ; n __f(comma + 1, args...); n } n template n void debug(T n, string a) { n cout << a << = << n << n ; n } n void cal() {} n void solve() { n int n, h; n cin >> n >> h; n for (int i = 1; i < n; i++) { n cout << fixed << setprecision(15) << (sqrt(i / (n * 1.0)) * h) << ; n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long t1; n t1 = 1; n cal(); n while (t1--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e5 + 5; n bool match(string s1, string s2) { n long long cnt = 0; n for (long long i = 0; s1[i]; ++i) { n if (s1[i] != s2[i]) ++cnt; n if (cnt > 1) return 0; n } n return 1; n } n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long t; n cin >> t; n while (t--) { n long long n, m; n cin >> n >> m; n vector v(n); n for (long long i = 0; i < n; ++i) cin >> v[i]; n bool ans = 0; n string str; n for (long long i = 0; i < m; ++i) { n string s = v[0]; n for (long long j = 1; j < n; ++j) { n s[i] = v[j][i]; n bool all_match = 1; n for (long long k = 1; k < n; ++k) { n if (!match(s, v[k])) { n all_match = 0; n break; n } n } n if (all_match) { n ans = 1; n str = s; n break; n } n } n if (ans) break; n } n if (ans) n cout << str << n ; n else { n bool all_match = 1; n for (long long i = 1; i < n; ++i) { n if (!match(v[0], v[i])) { n all_match = 0; n break; n } n } n if (all_match) n cout << v[0] << n ; n else n cout << -1 << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n long long min(long long a, long long b) { n if (a < b) n return a; n else n return b; n } n static long long gcd(long long a, long long b) { n long long r; n while (b != 0) { n r = a % b; n a = b; n b = r; n } n return a; n } n long long lcm(long long a, long long b) { n long long temp = gcd(a, b); n return temp ? (a / temp * b) : 0; n } n unsigned long long PowMod(unsigned long long x, unsigned long long e, n unsigned long long mod) { n unsigned long long res; n if (e == 0) { n res = 1; n } else if (e == 1) { n res = x; n } else { n res = PowMod(x, e / 2, mod); n res = res * res % mod; n if (e % 2) res = res * x % mod; n } n return res; n } n int solve() { n int n, m; n cin >> n >> m; n long long a[n], b[m]; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n for (int j = 0; j < m; j++) { n cin >> b[j]; n } n vector > v; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n v.push_back(make_pair(a[i] * b[j], i)); n } n } n sort((v).begin(), (v).end()); n int I = v[(n * m) - 1].second; n long long ans = (1000000000LL) * (1000000000LL) * (-1LL); n ans--; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (i != I) { n ans = max(ans, a[i] * b[j]); n } n } n } n cout << ans; n return 0; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t = 1; n for (int i = 1; i <= t; i++) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int static_init = []() { n ios_base::sync_with_stdio(false), cin.tie(0), cout << fixed; n return 0; n }(); n constexpr int N = 3e5; n int32_t n, x[2], c[N + 1], p[N + 1]; n int64_t t[N + 2]; n bool run(bool sw) { n for (int k1 = 1; k1 <= n; k1++) { n int i1 = n lower_bound(p + 1, p + n + 2 - k1, x[sw], n [k1](int i, int x) { return (int64_t)c[i] * k1 < x; }) - n p; n int j = i1 + k1; n if (j <= n && t[j] >= x[!sw]) { n int i2; n for (i2 = n; i2 >= j; i2--) { n if (t[i2] == t[j]) break; n } n int k2 = n - i2 + 1; n if (sw) swap(k1, k2), swap(i1, i2); n cout << Yes n << k1 << << k2 << endl; n for (int i = i1; i < i1 + k1; i++) n cout << p[i] << (i == i1 + k1 - 1 ? n : ); n for (int i = i2; i < i2 + k2; i++) n cout << p[i] << (i == i2 + k2 - 1 ? n : ); n return true; n } n } n return false; n } n int main() { n cin >> n >> x[0] >> x[1]; n for (int i = 1; i <= n; i++) cin >> c[i]; n iota(p + 1, p + n + 1, 1); n sort(p + 1, p + n + 1, [](int i, int j) { return c[i] < c[j]; }); n for (int i = n; i >= 1; i--) { n t[i] = max(t[i + 1], (int64_t)c[p[i]] * (n - i + 1)); n } n if (!run(false) && !run(true)) cout << No << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e9 + 7; n const int N = 1e3 + 10; n const int M = 1e4; n int a[N][N]; n int main() { n int n, k, d; n cin >> n >> k >> d; n int flag = 1; n memset((a), (0), sizeof(a)); n if (n == 1) { n while (d--) cout << 1 << endl; n return 0; n } n for (int i = 1; i <= d; i++) a[1][i] = 1; n for (int i = 2; i <= n; i++) { n for (int j = 1; j <= d; j++) a[i][j] = a[i - 1][j]; n a[i][d]++; n for (int j = d; j > 0; j--) { n if (a[i][j] > k) n a[i][j] = 1, a[i][j - 1]++; n else n break; n } n if (a[i][0] == 1) { n flag = 0; n break; n } n } n if (!flag) { n cout << -1 << endl; n return 0; n } n for (int j = 1; j <= d; j++) { n for (int i = 1; i <= n; i++) { n if (i > 1) cout << ; n cout << a[i][j]; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = (int)3e3 + 5; n const long long INF = (long long)1e15; n pair dp[MAXN][MAXN]; n vector adj[MAXN]; n int arr[MAXN]; n int sub[MAXN]; n int n, m; n void dfs(int v, int pr = -1) { n fill(dp[v], dp[v] + n + 1, make_pair(-n, -INF)); n dp[v][0] = make_pair(0, 0); n sub[v] = 1; n for (int to : adj[v]) { n if (to == pr) { n continue; n } n dfs(to, v); n } n vector > ndp(n + 5, make_pair(-n, -INF)); n for (int to : adj[v]) { n if (to == pr) { n continue; n } n for (int i = 0; i <= sub[v] + sub[to] + 3; ++i) { n ndp[i] = make_pair(-n, -INF); n } n for (int i = sub[v]; i >= 0; --i) { n for (int j = sub[to]; j >= 0; --j) { n if (dp[v][i].second == -INF || dp[to][j].second == -INF || n dp[v][i].first < 0 || dp[to][j].first < 0) { n continue; n } n if (dp[to][j].second > 0) { n ndp[i + j + 1] = max( n ndp[i + j + 1], n make_pair(dp[v][i].first + dp[to][j].first + 1, dp[v][i].second)); n } else { n ndp[i + j + 1] = n max(ndp[i + j + 1], n make_pair(dp[v][i].first + dp[to][j].first, dp[v][i].second)); n } n ndp[i + j] = n max(ndp[i + j], make_pair(dp[v][i].first + dp[to][j].first, n dp[v][i].second + dp[to][j].second)); n } n } n for (int j = 0; j < n; ++j) { n dp[v][j] = ndp[j]; n } n sub[v] += sub[to]; n } n for (int i = 0; i < n; ++i) { n if (dp[v][i].second != -INF) { n dp[v][i].second += arr[v]; n } n } n } n void solve() { n scanf( %d %d , &n, &m); n for (int i = 1; i <= n; ++i) { n adj[i].clear(); n arr[i] = 0; n } n for (int i = 1, x; i <= n; ++i) { n scanf( %d , &x); n arr[i] = -x; n } n for (int i = 1, x; i <= n; ++i) { n scanf( %d , &x); n arr[i] += x; n } n for (int i = 1; i < n; ++i) { n int u, v; n scanf( %d %d , &u, &v); n adj[u].push_back(v); n adj[v].push_back(u); n } n dfs(1); n printf( %d n , dp[1][m - 1].first + (dp[1][m - 1].second > 0)); n } n int main() { n int tt; n scanf( %d , &tt); n while (tt--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int main() { n scanf( %d , &n); n if (n & 1) n printf( %d n , (n - 1) / 2); n else { n int w = 1; n while (w <= n) w *= 2; n w /= 2; n printf( %d n , (n - w) / 2); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int solve(vector a, int bit) { n if (bit == 0) { n return a.size(); n } n if (a.size() <= 1) { n return a.size(); n } n vector v0, v1; n for (int x : a) { n if (1 & (x >> bit)) { n v0.push_back(x); n } else { n v1.push_back(x); n } n } n return max(solve(v0, bit - 1) + (v1.size() ? 1 : 0), n solve(v1, bit - 1) + (v0.size() ? 1 : 0)); n } n int main() { n int n; n cin >> n; n vector arr(n); n for (int i = 0; i < n; i++) { n cin >> arr[i]; n } n int ans = solve(arr, 30); n cout << n - ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n T gcd(T x, T y) { n if (x < y) swap(x, y); n while (y > 0) { n T f = x % y; n x = y; n y = f; n } n return x; n } n const int maxn = 100007; n int BLOCKSIZE = 350; n set s[maxn]; n int a[maxn]; n int nxt[maxn]; n int n, m; n long long b[maxn]; n int d[maxn]; n long long query(int block, int R) { n int iBlockStart = block * BLOCKSIZE; n int iBlockEnd = min((block + 1) * BLOCKSIZE, n); n int idx = upper_bound(d + iBlockStart, d + iBlockEnd, R, n [](int i, int j) { return i < nxt[j]; }) - n d; n if (idx == iBlockStart) return 0; n return b[idx - 1]; n } n void updateBlock(int block) { n int iBlockStart = block * BLOCKSIZE; n int iBlockEnd = min((block + 1) * BLOCKSIZE, n); n sort(d + iBlockStart, d + iBlockEnd, n [](int i, int j) { return nxt[i] < nxt[j]; }); n b[iBlockStart] = nxt[d[iBlockStart]] - d[iBlockStart]; n for (int i = iBlockStart + 1; i < iBlockEnd; i++) n b[i] = b[i - 1] + nxt[d[i]] - d[i]; n } n int main(int argc, char *argv[]) { n std::cin.sync_with_stdio(false); n std::cin.tie(nullptr); n cin >> n >> m; n { n BLOCKSIZE = 1; n while (BLOCKSIZE * BLOCKSIZE < n) BLOCKSIZE++; n BLOCKSIZE = max(BLOCKSIZE, 10); n for (int i = 0; i < n; i++) nxt[i] = n + 1, d[i] = i; n for (int i = 0; i < n; i++) { n cin >> a[i]; n if (!s[a[i]].empty()) nxt[*s[a[i]].rbegin()] = i; n s[a[i]].insert(i); n } n for (int i = 0; i * BLOCKSIZE < n; i++) updateBlock(i); n for (int i = 0; i < m; i++) { n int op; n cin >> op; n if (op == 1) { n int p, x; n cin >> p >> x; n p--; n if (a[p] == x) continue; n { n auto it = s[a[p]].find(p); n if (it != s[a[p]].begin()) { n int pr = *prev(it); n auto nxt_it = it == s[a[p]].end() ? it : next(it); n nxt[pr] = nxt_it == s[a[p]].end() ? (n + 1) : *nxt_it; n updateBlock(pr / BLOCKSIZE); n } n } n s[a[p]].erase(p); n a[p] = x; n nxt[p] = n + 1; n if (!s[x].empty()) { n auto it = s[x].upper_bound(p); n if (it != s[x].begin()) { n int pr = *prev(it); n nxt[pr] = p; n updateBlock(pr / BLOCKSIZE); n } n if (it != s[x].end()) { n nxt[p] = (it == s[x].end()) ? (n + 1) : *it; n } n } n s[a[p]].insert(p); n updateBlock(p / BLOCKSIZE); n } else { n int l, r, R; n cin >> l >> r; n l--; n r--; n R = r; n long long res = 0; n for (; l <= r && l % BLOCKSIZE; l++) n if (nxt[l] <= R) res += nxt[l] - l; n for (; l <= r && (r + 1) % BLOCKSIZE; r--) n if (nxt[r] <= R) res += nxt[r] - r; n if (l <= r) { n for (int i = l / BLOCKSIZE, j = r / BLOCKSIZE; i <= j; i++) { n res += query(i, R); n } n } n cout << res << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool comp(pair &a, n pair &b) { n if (a.first == b.first) return a.second < b.second; n return a.first > b.first; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int n, m, d; n cin >> n >> m >> d; n pair py[n], in[m]; n for (int i = 0; i < n; i++) cin >> py[i].first >> py[i].second; n for (int i = 0; i < m; i++) cin >> in[i].first >> in[i].second; n sort(py, py + n, comp); n sort(in, in + m, comp); n int p1 = 0, p2 = 1; n long long int sm = py[0].first + in[0].first; n long long int w = py[0].second + in[0].second; n if (w > d) { n cout << 0 n ; n return 0; n } n long long int ans = sm; n while (p2 < m) { n sm += in[p2].first; n w += in[p2].second; n if (w <= d) ans = sm; n p2++; n } n p2 = m - 1; n while (p1 != n - 1) { n p1++; n sm += py[p1].first; n w += py[p1].second; n while (w > d and p2 > 0) { n sm -= in[p2].first; n w -= in[p2].second; n p2--; n } n if (w <= d) ans = max(ans, sm); n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a, b, h, n, i; n long long x, ans; n pair, int> p[100005]; n map f; n void update(int index, long long value) { n while (index < 1e9) { n f[index] = max(f[index], value); n index += (-index & index); n } n } n long long read(int index) { n long long ans = 0; n while (index > 0) { n ans = max(ans, f[index]); n index -= (-index & index); n } n return ans; n } n int main() { n scanf( %d , &n); n for (i = 0; i < n; i++) n scanf( %d%d%d , &p[i].first.second, &p[i].first.first, &p[i].second); n sort(p, p + n); n reverse(p, p + n); n for (i = 0; i < n; i++) { n x = read(p[i].first.first) + p[i].second; n update(p[i].first.second + 1, x); n ans = max(ans, x); n } n printf( %lld , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n cin >> n >> k; n if (n % k == 0) n cout << n + k << endl; n else n cout << n + (k - n % k); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n using ll = long long; n using ld = long double; n using pii = pair; n using vi = vector; n const ld EPS = 1E-9; n struct pt { n ld x, y; n }; n struct seg { n pt p, q; n int id; n ld get_y(ld x) const { n if (abs(p.x - q.x) < EPS) return p.y; n return p.y + (q.y - p.y) * (x - p.x) / (q.x - p.x); n } n }; n inline bool intersect1d(ld l1, ld r1, ld l2, ld r2) { n if (l1 > r1) swap(l1, r1); n if (l2 > r2) swap(l2, r2); n return max(l1, l2) <= min(r1, r2) + EPS; n } n inline int vec(const pt& a, const pt& b, const pt& c) { n ld s = (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x); n return abs(s) < EPS ? 0 : s > 0 ? +1 : -1; n } n bool intersect(const seg& a, const seg& b) { n return intersect1d(a.p.x, a.q.x, b.p.x, b.q.x) && n intersect1d(a.p.y, a.q.y, b.p.y, b.q.y) && n vec(a.p, a.q, b.p) * vec(a.p, a.q, b.q) <= 0 && n vec(b.p, b.q, a.p) * vec(b.p, b.q, a.q) <= 0; n } n bool operator<(const seg& a, const seg& b) { n ld x = max(min(a.p.x, a.q.x), min(b.p.x, b.q.x)); n return a.get_y(x) < b.get_y(x) - EPS; n } n struct event { n ld x; n int tp, id; n event() {} n event(ld x, int tp, int id) : x(x), tp(tp), id(id) {} n bool operator<(const event& e) const { n if (abs(x - e.x) > EPS) return x < e.x; n return tp > e.tp; n } n }; n set s; n vector::iterator> where; n inline set::iterator prev(set::iterator it) { n return it == s.begin() ? s.end() : --it; n } n inline set::iterator next(set::iterator it) { return ++it; } n pair solve(const vector& a) { n int n = (int)a.size(); n vector e; n for (int i = 0; i < n; ++i) { n e.push_back(event(min(a[i].p.x, a[i].q.x), +1, i)); n e.push_back(event(max(a[i].p.x, a[i].q.x), -1, i)); n } n sort(e.begin(), e.end()); n s.clear(); n where.resize(a.size()); n for (size_t i = 0; i < e.size(); ++i) { n int id = e[i].id; n if (e[i].tp == +1) { n set::iterator nxt = s.lower_bound(a[id]), prv = prev(nxt); n if (nxt != s.end() && intersect(*nxt, a[id])) n return make_pair(nxt->id, id); n if (prv != s.end() && intersect(*prv, a[id])) n return make_pair(prv->id, id); n where[id] = s.insert(nxt, a[id]); n } else { n set::iterator nxt = next(where[id]), prv = prev(where[id]); n if (nxt != s.end() && prv != s.end() && intersect(*nxt, *prv)) n return make_pair(prv->id, nxt->id); n s.erase(where[id]); n } n } n return make_pair(-1, -1); n } n int main() { n ios::sync_with_stdio(0), cin.tie(0); n int n; n cin >> n; n vector S(n), V(n); n vi U(n); n for (int i = 0; i < n; i++) { n cin >> S[i].x >> S[i].y >> V[i].x >> V[i].y >> U[i]; n ld len = sqrt(V[i].x * V[i].x + V[i].y * V[i].y); n V[i].x /= len; n V[i].y /= len; n V[i].x *= U[i]; n V[i].y *= U[i]; n } n ld lf = 0, rg = 1e12; n { n ld md = rg; n vector a(n); n for (int i = 0; i < n; i++) { n a[i].id = i; n a[i].p = S[i]; n ld X = S[i].x + V[i].x * md; n ld Y = S[i].y + V[i].y * md; n a[i].q = {X, Y}; n } n if (solve(a) == make_pair(-1, -1)) { n cout << No show :( ; n return 0; n } n } n const ld _eps = 1e-8; n while ((rg - lf) > _eps) { n ld md = (lf + rg) / 2; n vector a(n); n for (int i = 0; i < n; i++) { n a[i].id = i; n a[i].p = S[i]; n ld X = S[i].x + V[i].x * md; n ld Y = S[i].y + V[i].y * md; n a[i].q = {X, Y}; n } n if (solve(a) != make_pair(-1, -1)) { n rg = md; n } else { n lf = md; n } n } n cout.precision(10); n cout << fixed << (lf + rg) / 2; n } n "} +{"func_code_string": "#include n using namespace std; n char str[200005]; n int main() { n int ts; n scanf( %d , &ts); n while (ts--) { n int n; n scanf( %d %s , &n, str); n vector vec; n for (int i = 0; i < n; i++) { n int j = i, c = 0; n while (i < n && str[i] == str[j]) i++, c++; n i--; n vec.push_back(c); n } n if (vec.size() == 1 && vec[0] > 2) vec[0] += 2; n if (vec.size() != 1 && str[0] == str[n - 1]) n vec[0] += vec.back(), vec.pop_back(); n int res = 0; n for (int i = 0; i < vec.size(); i++) res += vec[i] / 3; n printf( %d n , res); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); } n long long lcm(long long a, long long b) { return a * b / gcd(a, b); } n int main() { n int n; n long long k; n scanf( %d%I64d , &n, &k); n long long ans = 1; n bool ok = false; n for (int i = 0; i < n; ++i) { n long long x; n scanf( %I64d , &x); n if (ans) ans = lcm(ans, x) % k; n if (ans == 0) ok = true; n } n if (ok) n printf( Yes n ); n else n printf( No n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int mr[] = {0, 1, 0, -1}; n int mc[] = {1, 0, -1, 0}; n char a[52][52]; n int id[52][52]; n int ar[2500], br[2500], ac[2500], bc[2500]; n void flood(int r, int c, char color, int tag) { n ar[tag] = min(ar[tag], r); n br[tag] = max(br[tag], r); n ac[tag] = min(ac[tag], c); n bc[tag] = max(bc[tag], c); n id[r][c] = tag; n for (int o = 0; o < 4; o++) { n int dr = r + mr[o]; n int dc = c + mc[o]; n if (a[dr][dc] == color && id[dr][dc] < 0) flood(dr, dc, color, tag); n } n } n int main() { n int n, m, s, cnt = 0; n scanf( %d%d , &n, &s); n for (int i = 1; i <= n; i++) scanf( %s , a[i] + 1); n m = strlen(a[1] + 1); n memset(id, 255, sizeof(id)); n memset(ar, 127, sizeof(ar)); n memset(br, 128, sizeof(br)); n memset(ac, 127, sizeof(ac)); n memset(bc, 128, sizeof(bc)); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n if (id[i][j] < 0) flood(i, j, a[i][j], cnt++); n int r = 1, c = 1, dp = 0, cp = 0; n while (s--) { n int tr = r, tc = c, tag = id[r][c]; n if (dp == 0 && cp == 0) tr = ar[tag], tc = bc[tag] + 1; n if (dp == 0 && cp == 1) tr = br[tag], tc = bc[tag] + 1; n if (dp == 1 && cp == 0) tr = br[tag] + 1, tc = bc[tag]; n if (dp == 1 && cp == 1) tr = br[tag] + 1, tc = ac[tag]; n if (dp == 2 && cp == 0) tr = br[tag], tc = ac[tag] - 1; n if (dp == 2 && cp == 1) tr = ar[tag], tc = ac[tag] - 1; n if (dp == 3 && cp == 0) tr = ar[tag] - 1, tc = ac[tag]; n if (dp == 3 && cp == 1) tr = ar[tag] - 1, tc = bc[tag]; n if (!a[tr][tc] || a[tr][tc] == 0 ) { n cp ^= 1; n if (!cp) dp = (dp + 1) & 3; n } else { n r = tr; n c = tc; n } n } n printf( %c n , a[r][c]); n } n "} +{"func_code_string": "#include n using namespace std; n int hx[] = {-2, -2, -1, -1, 1, 1, 2, 2}; n int hy[] = {-1, 1, -2, 2, -2, 2, -1, 1}; n int dx[] = {1, -1, 0, 0}; n int dy[] = {0, 0, 1, -1}; n int nx[] = {1, -1, 0, 0, -1, 1, 1, -1}; n int ny[] = {0, 0, 1, -1, 1, -1, 1, -1}; n class pt { n public: n int x, y; n }; n int main() { n int t = 1; n while (t--) { n long long n, m; n cin >> n >> m; n long long ans = 1, tmp = 3; n for (int i = 0; i < 32; i++) { n if (n & 1 << i) ans = (ans * tmp) % m; n tmp = (tmp * tmp) % m; n } n if (ans == 0) ans = m; n cout << ans - 1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N, K, T, to[25]; n long double prob[25], dp[2000100], val[25], ans[25]; n bool v[2000100]; n long double calc(int mask) { n if (v[mask]) return dp[mask]; n v[mask] = 1; n int i; n long double tot = 0; n for (i = 0; i < N; i++) n if (mask & (1 << i)) tot += prob[i]; n for (i = 0; i < N; i++) n if (mask & (1 << i)) { n tot -= prob[i]; n dp[mask] = dp[mask] + (prob[i] * calc(mask - (1 << i))) / (1 - tot); n tot += prob[i]; n } n return dp[mask]; n } n void get_masks(int mask, int cnt, int p) { n if (p == N || cnt == K) { n if (cnt != K) return; n calc(mask); n int i; n for (i = 0; i < N; i++) n if (mask & (1 << i)) val[i] += dp[mask]; n return; n } n get_masks(mask, cnt, p + 1); n get_masks(mask + (1 << p), cnt + 1, p + 1); n } n int main() { n cin >> N >> K; n int i; n for (i = 0; i < N; i++) { n cin >> prob[i]; n if (prob[i] != 0) { n T++; n prob[T - 1] = prob[i]; n to[T - 1] = i; n } n } n swap(T, N); n if (K > N) K = N; n dp[0] = 1, v[0] = 1; n get_masks(0, 0, 0); n for (i = 0; i < N; i++) ans[to[i]] = val[i]; n for (i = 0; i < T; i++) cout << fixed << setprecision(9) << ans[i] << ; n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector graph[200010]; n long long v[200010], new_visit[200010], MAX_node, mx, cnt; n void dfs(long long node) { n v[node] = 1; n if ((long long)graph[node].size() > mx) { n mx = (long long)graph[node].size(); n MAX_node = node; n } n for (auto &x : graph[node]) n if (!v[x]) dfs(x); n } n void bfs(long long node) { n queue q; n q.push(node); n while (!q.empty()) { n long long frt = q.front(); n new_visit[frt] = 1; n q.pop(); n for (auto &x : graph[frt]) { n if (!new_visit[x]) { n new_visit[x] = 1; n cout << frt << << x << endl; n q.push(x); n cnt--; n if (cnt == 0) return; n } n } n } n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long n, m; n cin >> n >> m; n cnt = n - 1; n for (long long i = 0; i < m; i++) { n long long x, y; n cin >> x >> y; n graph[x].push_back(y); n graph[y].push_back(x); n } n dfs(1); n bfs(MAX_node); n } n "} +{"func_code_string": "#include n using namespace std; n vector p; n vector > v, ans; n bool cmp(pair a, pair b) { n if (a.first == b.first) n return a.second > b.second; n else n return a.first < b.first; n } n int main() { n int n; n cin >> n; n int a, b; n for (int i = 0; i < n; i++) { n cin >> a; n p.push_back(a); n } n for (int i = 0; i < n; i++) { n cin >> b; n v.push_back({b, i}); n } n sort(p.begin(), p.end()); n sort(v.begin(), v.end(), cmp); n for (int i = 0; i < n; i++) { n ans.push_back({v[i].second, p[n - i - 1]}); n } n sort(ans.begin(), ans.end()); n for (int i = 0; i < n; i++) cout << ans[i].second << ; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000000007; n const long long INF64 = 1000000000000000007; n int n; n int p[17]{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59}; n int a[105]; n int number[60]; n int dp[105][1 << 17]; n int pred[105][1 << 17]; n void find_pred(int x, int p) { n if (x == n) return; n cout << pred[x][p] << ; n find_pred(x + 1, p | number[pred[x][p]]); n } n int main() { n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 2; i < 60; i++) { n for (int j = 0; j < 17; j++) { n if (i % p[j] == 0) { n number[i] |= (1 << j); n } n } n } n for (int i = n - 1; i >= 0; i--) { n for (int j = 0; j < (1 << 17); j++) { n dp[i][j] = INF; n for (int k = 1; k < 60; k++) { n if (!(j & number[k])) { n int w = dp[i + 1][j | number[k]] + abs(k - a[i]); n if (dp[i][j] > w) { n dp[i][j] = w; n pred[i][j] = k; n } n } n } n } n } n find_pred(0, 0); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, budget; n long long price[100005], perMoney[100005]; n bool can(int k) { n long long curBudget = 0; n int j = 0; n for (int i = k - 1; i >= 0; i--, j++) { n curBudget += max(0ll, price[j] - perMoney[i]); n } n return curBudget <= budget; n } n int main() { n cin >> n >> m >> budget; n for (int i = 0; i < n; i++) cin >> perMoney[i]; n for (int i = 0; i < m; i++) cin >> price[i]; n sort(price, price + m); n sort(perMoney, perMoney + n); n reverse(perMoney, perMoney + n); n long long lo = 0, hi = min(m, n); n while (lo < hi) { n long long mid = (lo + hi + 1) / 2; n if (can(mid)) n lo = mid; n else n hi = mid - 1; n } n long long spent = 0; n for (int i = 0; i < lo; i++) { n spent += price[i]; n } n cout << lo << << max(0ll, spent - budget) << n ; n } n "} +{"func_code_string": "#include n using namespace std; n struct Node { n int loc; n int s; n int v; n Node(int ll, int ss, int vv) : loc(ll), s(ss), v(vv) {} n bool operator<(const Node& other) const { return v > other.v; } n }; n vector > adj[32]; n int main() { n priority_queue que; n int N, K, T; n scanf( %d%d%d , &N, &K, &T); n while (K--) { n int h, w, r; n scanf( %d%d%d , &h, &w, &r); n h--; n w--; n adj[h].push_back(pair(w, r)); n } n que.push(Node(0, 0, 0)); n int now = 0; n while (now + 1 < T) { n Node p = que.top(); n que.pop(); n now++; n for (int h = p.loc; h < N; h++) { n for (int i = 0; i < adj[h].size(); i++) { n pair w = adj[h][i]; n if (!(p.s & (1 << w.first))) n que.push(Node(h + 1, p.s | (1 << w.first), p.v + w.second)); n } n } n } n printf( %d n , que.top().v); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long t, n, i, j, k, b[200005], a[200005], x, m, l, r, mid, ans, s; n vector u, v; n int main() { n ios::sync_with_stdio(NULL); n cin.tie(0); n cout.tie(0); n cin >> n; n for (i = 0; i < n; i++) { n cin >> x; n if (x % 2) n v.push_back(x); n else n u.push_back(x); n s += x; n } n sort(u.begin(), u.end(), greater()); n sort(v.begin(), v.end(), greater()); n n = v.size(); n m = u.size(); n n = min(n, m); n for (i = 0; i < n; i++) s -= u[i] + v[i]; n if (u.size() > v.size()) s -= u[i]; n if (u.size() < v.size()) s -= v[i]; n cout << s; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int visit[111111]; n vector v[111111], mark[111111]; n int dfs(int t) { n vector v1; n int i; n for (i = 0; i < v[t].size(); i++) { n int u = v[t][i]; n if (visit[mark[t][i]] == 0) { n visit[mark[t][i]] = 1; n int w = dfs(u); n if (w == 0) n v1.push_back(u); n else n printf( %d %d %d n , t, u, w); n } n } n while (v1.size() > 1) { n printf( %d %d %d n , v1[v1.size() - 1], t, v1[v1.size() - 2]); n v1.pop_back(); n v1.pop_back(); n } n if (v1.size() == 1) n return v1[0]; n else n return 0; n } n int main() { n memset(visit, 0, sizeof(visit)); n scanf( %d%d , &n, &m); n int i; n for (i = 0; i < m; i++) { n int a, b; n scanf( %d%d , &a, &b); n v[a].push_back(b); n v[b].push_back(a); n mark[a].push_back(i); n mark[b].push_back(i); n } n if (m % 2) n printf( No solution n ); n else { n for (i = 1; i <= n; i++) dfs(i); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n vector vi1, vi2; n for (int i = 0; i < n; i++) { n int x; n cin >> x; n vi1.push_back(x); n } n sort(vi1.begin(), vi1.end()); n vi1.push_back(1e9); n for (int i = 0; i < m; i++) { n int a, b, c; n cin >> a >> b >> c; n if (a == 1) vi2.push_back(b); n } n sort(vi2.begin(), vi2.end()); n int j = 0, mini = vi2.size(); n for (int i = 0; i <= n; i++) { n int hi = vi1[i]; n while (j < vi2.size() && vi2[j] < hi) { n j++; n } n int asdf = vi2.size(); n mini = min(mini, i + asdf - j); n } n cout << mini; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n int main() { n int t, h, g; n cin >> t; n while (t--) { n scanf( %d %d , &h, &g); n int n = (1 << h) - 1, m = (1 << g) - 1; n std::vector > a(1 << h); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i].first); n a[i].second = i + 1; n } n sort(a.begin(), a.end()); n std::vector notFree(n + 1, 0), taken(n + 1, 0); n ll ans = 0LL; n for (int i = 0; i < n; i++) { n int where = a[i].second; n while (where > m or notFree[where]) where = where >> 1; n if (!where) continue; n if (notFree[where << 1] == notFree[where << 1 | 1]) { n notFree[where] = 1; n ans += a[i].first; n taken[a[i].second] = 1; n } n } n printf( %lld n , ans); n for (int i = n; i >= 1; i--) { n if (!taken[i]) printf( %d , i); n ; n } n puts( ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int n, cnt = 0; n cin >> n; n vector> adj(n); n vector deg(n); n for (int i = 0; i < n - 1; i++) { n int x, y; n cin >> x >> y; n x--, y--; n adj[x].push_back(y); n adj[y].push_back(x); n deg[x]++, deg[y]++; n } n for (int i = 0; i < n; i++) n if (deg[i] == 1) n cnt++; n else if (deg[i] == 2) { n cnt = 0; n break; n } n if ((long long)cnt * (cnt - 1) >= 2 * (n - 1)) n cout << YES << n ; n else n cout << NO << n ; n } n int main() { n ios_base ::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n solve(); n return 0; n } n "} +{"func_code_string": "#include n struct node { n int x, l; n } a[200005]; n int skip[200005][25]; n int mx[200005]; n long long f[200005][25]; n inline int read() { n register int x = 0, f = 1; n register char s = getchar(); n while (s > 9 || s < 0 ) { n if (s == - ) f = -1; n s = getchar(); n } n while (s >= 0 && s <= 9 ) { n x = x * 10 + s - 0 ; n s = getchar(); n } n return x * f; n } n inline int max(const int &x, const int &y) { return x > y ? x : y; } n int main() { n int n = read(); n for (register int i = 1; i <= n; ++i) { n a[i].x = read(); n a[i].l = read(); n } n for (register int i = n - 1; i >= 1; --i) { n int cur = i + 1; n mx[i] = a[i].x + a[i].l; n while (cur && a[i].x + a[i].l >= a[cur].x) { n mx[i] = max(mx[i], mx[cur]); n cur = skip[cur][0]; n } n skip[i][0] = cur; n f[i][0] = a[cur].x - mx[i]; n } n for (register int i = 1; i <= 20; ++i) { n for (register int x = 1; x <= n; ++x) { n f[x][i] = f[x][i - 1] + f[skip[x][i - 1]][i - 1]; n skip[x][i] = skip[skip[x][i - 1]][i - 1]; n } n } n int Q = read(); n while (Q--) { n int l = read(), r = read(); n if (skip[l][0] > r) { n printf( 0 n ); n } else { n long long ans = 0; n for (register int i = 20; i >= 0; --i) { n if (skip[l][i] && skip[l][i] <= r) { n ans += f[l][i]; n l = skip[l][i]; n } n } n printf( %lld n , ans); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int q; n cin >> q; n while (q--) { n int n; n cin >> n; n vector v(n); n set st; n for (int i = 0; i < n; i++) { n cin >> v[i]; n st.insert(v[i]); n } n sort(v.begin(), v.end()); n int mx = v.back(); n int ans = mx; n if (mx % 2 == 0 && mx % 3 == 0 && mx % 5 == 0) { n if (st.find(mx / 2) != st.end() && st.find(mx / 3) != st.end() && n st.find(mx / 5) != st.end()) { n ans = max(ans, mx / 2 + mx / 3 + mx / 5); n } n } n vector tmp; n while (!st.empty() && tmp.size() < 3) { n int x = *st.rbegin(); n st.erase(prev(st.end())); n bool f = 1; n for (auto it : tmp) { n if (it % x == 0 || x % it == 0) f = 0; n } n if (f) tmp.push_back(x); n } n int sum = 0; n for (auto it : tmp) sum += it; n ans = max(ans, sum); n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, q, i, j, u, v, k; n int a[300003]; n int last[19]; n int go[300003][19]; n int main() { n cin >> n >> q; n for (i = 0; i < n; i++) cin >> a[i]; n for (i = 0; i < 19; i++) { n go[n][i] = n; n last[i] = n; n } n for (i = n - 1; i >= 0; i--) { n for (j = 0; j < 19; j++) go[i][j] = n; n for (j = 0; j < 19; j++) { n if ((a[i] >> j) & 1) { n for (k = 0; k < 19; k++) go[i][k] = min(go[i][k], go[last[j]][k]); n last[j] = i; n go[i][j] = i; n } n } n } n for (i = 0; i < q; i++) { n cin >> u >> v; n u--, v--; n bool good = false; n for (j = 0; j < 19; j++) good |= (((a[v] >> j) & 1) && go[u][j] <= v); n if (good) n cout << Shi n ; n else n cout << Fou n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n vector arr(78498); n vector> in(505, vector(505)); n vector> out(505, vector(505)); n void SieveOfEratosthenes(int n) { n vector prime(n + 1, true); n for (int p = 2; p * p <= n; p++) { n if (prime[p] == true) { n for (int i = p * p; i <= n; i += p) prime[i] = false; n } n } n int i = 0; n for (int p = 2; p <= n; p++) n if (prime[p]) arr[i++] = p; n } n int f(int val) { n int l = 0, u = arr.size() - 1, res = -1; n while (l <= u) { n int mid = (l + u) / 2; n if (val == arr[mid]) n return -2; n else if (val < arr[mid]) { n res = mid; n u = mid - 1; n } else n l = mid + 1; n } n return res; n } n int main() { n SieveOfEratosthenes(1000000); n sort(arr.begin(), arr.end()); n int n, m; n cin >> n >> m; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) cin >> in[i][j]; n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n int res = f(in[i][j]); n if (res == -2) n out[i][j] = 0; n else if (res == -1) n cout << error << endl; n else { n out[i][j] = arr[res] - in[i][j]; n } n } n } n long long mini = pow(10, 18); n for (int i = 0; i < n; i++) { n long long tot = 0; n for (int j = 0; j < m; j++) tot += (long long)out[i][j]; n mini = min(mini, tot); n } n for (int j = 0; j < m; j++) { n long long tot = 0; n for (int i = 0; i < n; i++) tot += (long long)out[i][j]; n mini = min(mini, tot); n } n cout << mini << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char a[103], c; n int length, i, m; n gets(a); n length = strlen(a); n for (i = length - 2; i >= 0; --i) { n if (a[i] != ) { n c = a[i]; n break; n } n } n if (c == a || c == e || c == i || c == o || c == u || c == y || n c == A || c == E || c == I || c == O || c == U || c == Y ) { n printf( YES n ); n } else { n printf( NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int vp, vd, t, f, c, ans; n double cc, d; n scanf( %d%d%d%d%d , &vp, &vd, &t, &f, &c); n if (vd <= vp) { n printf( 0 n ); n return 0; n } n d = vp * t; n cc = c; n ans = 0; n while (1) { n if (d + d / (vd - vp) * vp >= cc - 1e-9) break; n ans++; n d = d + (2 * d / (vd - vp) + f) * vp; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector v; n int n, x, now; n long long ans; n char a[3]; n int main() { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a; n if (a[0] == a ) { n cin >> x; n v.insert(lower_bound(v.begin(), v.end(), x), x); n } n if (a[0] == d ) { n cin >> x; n v.erase(lower_bound(v.begin(), v.end(), x)); n } n if (a[0] == s ) { n ans = 0; n for (int i = 2; i < v.size(); i += 5) ans += v[i]; n cout << ans << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline void read(int &x) { n int v = 0, f = 1; n char c = getchar(); n while (!isdigit(c) && c != - ) c = getchar(); n if (c == - ) n f = -1; n else n v = v * 10 + c - 0 ; n while (isdigit(c = getchar())) v = v * 10 + c - 0 ; n x = v * f; n } n inline void read(long long &x) { n long long v = 0ll, f = 1ll; n char c = getchar(); n while (!isdigit(c) && c != - ) c = getchar(); n if (c == - ) n f = -1; n else n v = v * 10 + c - 0 ; n while (isdigit(c = getchar())) v = v * 10 + c - 0 ; n x = v * f; n } n inline void readc(char &x) { n char c; n while ((c = getchar()) == ) n ; n x = c; n } n inline void writes(string s) { puts(s.c_str()); } n inline void writeln() { writes( ); } n inline void writei(int x) { n if (x < 0) { n putchar( - ); n x = abs(x); n } n if (!x) putchar( 0 ); n char a[25]; n int top = 0; n while (x) { n a[++top] = (x % 10) + 0 ; n x /= 10; n } n while (top) { n putchar(a[top]); n top--; n } n } n inline void writell(long long x) { n if (x < 0) { n putchar( - ); n x = abs(x); n } n if (!x) putchar( 0 ); n char a[25]; n int top = 0; n while (x) { n a[++top] = (x % 10) + 0 ; n x /= 10; n } n while (top) { n putchar(a[top]); n top--; n } n } n int n, h, m, i, j, dis[3005], cnt, ans, s = 0, t = 3001; n vector e[3005]; n struct edg { n int y, z; n } a[1111111]; n void add(int x, int y, int z) { n cnt++; n e[x].push_back(cnt * 2 - 2); n e[y].push_back(cnt * 2 - 1); n a[cnt * 2 - 2] = (edg){y, z}; n a[cnt * 2 - 1] = (edg){x, 0}; n } n int id(int x, int y) { return (x - 1) * h + y; } n bool bfs(int s, int t) { n queue q; n memset((dis), (0x16), (sizeof((dis)))); n dis[s] = 0; n q.push(s); n while (!q.empty()) { n int x = q.front(); n q.pop(); n for (__typeof((e[x]).begin()) it = (e[x]).begin(); it != (e[x]).end(); it++) n if (a[*it].z) { n if (dis[a[*it].y] > dis[x] + 1) { n dis[a[*it].y] = dis[x] + 1; n q.push(a[*it].y); n } n } n } n return dis[t] < dis[t + 1]; n } n int dfs(int x, int tt, int flw) { n if (x == tt || !flw) return flw; n int ans = 0; n for (__typeof((e[x]).begin()) it = (e[x]).begin(); it != (e[x]).end(); it++) { n if (a[*it].z && dis[x] + 1 == dis[a[*it].y]) { n int t = dfs(a[*it].y, tt, min(flw, a[*it].z)); n ans += t; n flw -= t; n a[*it].z -= t; n a[(*it) ^ 1].z += t; n } n if (!flw) break; n } n if (flw) dis[x] = -1; n return ans; n } n int dinic(int s, int t) { n int ans = 0; n while (bfs(s, t)) { n ans += dfs(s, t, 0x3bbbbbbb); n } n return ans; n } n int main() { n read(n); n read(h); n read(m); n for (((i)) = (1); ((i)) <= ((n)); ((i))++) { n for (((j)) = (1); ((j)) <= ((h)); ((j))++) { n if (j < h) add(id(i, j + 1), id(i, j), 0x3bbbbbbb); n add(s, id(i, j), j * 2 - 1); n ans += j * 2 - 1; n } n } n for (((i)) = (1); ((i)) <= ((m)); ((i))++) { n int l, r, ys, c; n read(l); n read(r); n read(ys); n read(c); n if (ys < h) n for ((j) = (l); (j) <= (r); (j)++) { n add(id(j, ys + 1), i + 2500, 0x3bbbbbbb); n } n add(i + 2500, t, c); n } n cout << ans - dinic(s, t) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n class Jora { n public: n int a; n int b; n }; n int myfunc(Jora A, Jora B) { n if (A.a < B.a) return 1; n if (A.a > B.a) return 0; n return A.b < B.b; n } n Jora jrr[200200]; n int n; n vector ser; n map taken; n map > mp; n int sss; n int cal() { n map val, ans; n for (int i = 0; i < ser.size(); i++) { n val[ser[i]] = 2000000000; n ans[ser[i]] = 0; n } n int sum = 0; n int cur = 0; n int tim = 1; n for (int i = 0; i < ser.size(); i++) { n int to = ser[i]; n int uu = ((to - cur) + sum) % 1000000007; n if (val[to] > uu) { n val[to] = uu; n ans[to] = tim; n } else if (val[to] == uu) { n ans[to] = (ans[to] + tim) % 1000000007; n } n int aa = val[to]; n int bb = ans[to]; n vector &vvv = mp[to]; n for (int j : vvv) { n if (val[j] > aa) { n val[j] = aa; n ans[j] = bb; n } else if (val[j] == aa) { n ans[j] = (ans[j] + bb) % 1000000007; n } n } n sum = aa; n cur = to; n tim = bb; n } n int tot = 0; n int value = 2000000000; n map mrk; n for (int i = 1; i <= n; i++) { n int u = jrr[i].a; n if (mrk[u] != 1 && u > sss) { n if (val[u] < value) { n value = val[u]; n tot = ans[u]; n } else if (val[u] == value) n tot = (tot + ans[u]) % 1000000007; n } n mrk[u] = 1; n } n return tot; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d%d , &jrr[i].a, &jrr[i].b); n mp[jrr[i].b].push_back(jrr[i].a); n if (taken[jrr[i].a] != 1) ser.push_back(jrr[i].a); n if (taken[jrr[i].b] != 1) ser.push_back(jrr[i].b); n taken[jrr[i].a] = 1; n taken[jrr[i].b] = 1; n sss = max(sss, jrr[i].b); n } n sort(ser.begin(), ser.end()); n printf( %d n , cal()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long f(long long l) { n if (l < 10ll) return l; n long long L = l, t = 1ll, ans = 0ll; n int x = 0, last; n while (L) { n x++; n last = L % 10; n L /= 10; n } n for (int i = 1; i < x; i++) { n ans += 9ll * t; n if (i >= 2) t *= 10ll; n } n ans += (last - 1ll) * t; n if (x >= 2) t *= 10ll; n l -= t * 1ll * last; n ans += l / 10ll; n if (l % 10 >= last) ans++; n return ans; n } n int main() { n long long l, r; n cin >> l >> r; n cout << f(r) - f(l - 1); n return 0; n } n "} +{"func_code_string": "#include n int main() { n long long k, l, c = 0; n scanf( %I64d , &k); n scanf( %I64d , &l); n while (l % k == 0) { n l /= k; n c++; n } n if (c >= 0 && l == 1) n printf( YES n%I64d , c - 1); n else n printf( NO ); n } n "} +{"func_code_string": "#include n using namespace std; n struct Node { n int id, fail, next[26]; n void init() { n id = -1; n fail = -1; n memset(next, 0, sizeof(int) * 26); n } n } node[2000050]; n int e; n void insert(char *str, int id) { n int len = strlen(str); n int pos = 0; n for (int i = 0; i < len; i++) { n int tmp = str[i] - a ; n if (node[pos].next[tmp] == 0) { n node[++e].init(); n node[pos].next[tmp] = e; n } n pos = node[pos].next[tmp]; n } n node[pos].id = id; n } n int head, tail, q[2000050]; n void bfs() { n head = tail = 0; n q[tail++] = 0; n while (head < tail) { n int u = q[head++]; n for (int i = 0; i < 26; i++) { n if (node[u].next[i]) { n int tmp = node[u].fail; n while (tmp != -1 && node[tmp].next[i] == 0) tmp = node[tmp].fail; n if (tmp == -1) n tmp = 0; n else n tmp = node[tmp].next[i]; n node[node[u].next[i]].fail = tmp; n q[tail++] = node[u].next[i]; n } n } n } n } n int n, k, g; n char record[2000050]; n char word[2000050]; n int dp[2000050]; n int ans[2000050]; n int cnt[2000050]; n void solve() { n memcpy(record + k * n, record, k * n); n memset(dp, -1, sizeof(int) * (n * k)); n int pos = 0; n for (int i = 0; i < k * n * 2; i++) { n while (pos != 0 && node[pos].next[record[i] - a ] == 0) n pos = node[pos].fail; n pos = node[pos].next[record[i] - a ]; n if (node[pos].id != -1) dp[i % (n * k)] = node[pos].id; n } n memset(cnt, 0, sizeof(int) * g); n for (int st = 0; st < k; st++) { n bool flag = true; n pos = st; n for (int i = 0; i < n; i++) { n if (dp[pos] == -1 || cnt[dp[pos]] > 0) { n flag = false; n while (pos >= 0) { n cnt[dp[pos]] = 0; n pos -= k; n } n break; n } n cnt[dp[pos]] = 1; n ans[i] = dp[pos] + 1; n pos += k; n } n if (flag) { n printf( YES n ); n for (int i = 0; i < n; i++) printf( %d , ans[i]); n printf( n ); n return; n } n } n printf( NO n ); n } n int main() { n while (scanf( %d%d , &n, &k) == 2) { n scanf( %s , record); n scanf( %d , &g); n e = 0; n node[0].init(); n for (int i = 0; i < g; i++) { n scanf( %s , word); n insert(word, i); n } n bfs(); n solve(); n } n } n "} +{"func_code_string": "#include n const int xn = 200001, xe = 399999; n int head[xn], next[xe], to[xe], N, E, fa[xn], q[xn], ue[xn], O[xn * 5], L, n col[xn], D; n int main() { n scanf( %d , &N); n bool allblack = 1; n for (int i = 1; i <= N; i++) { n scanf( %d , col + i); n if (col[i] == -1) allblack = 0; n } n if (allblack) { n puts( 1 ); n return 0; n } n for (int i = 1, u, v; i < N; i++) { n scanf( %d%d , &u, &v); n next[++E] = head[u], to[E] = v, head[u] = E; n next[++E] = head[v], to[E] = u, head[v] = E; n } n q[1] = 1; n ue[1] = head[1]; n D = 1; n O[L = 1] = 1; n while (D) { n if (to[ue[D]] == fa[q[D]]) ue[D] = next[ue[D]]; n if (ue[D]) { n int To = to[ue[D]]; n ue[D] = next[ue[D]]; n O[++L] = To; n fa[To] = q[D]; n q[++D] = To; n ue[D] = head[To]; n } else { n if (D > 1) { n O[++L] = q[D - 1]; n col[q[D - 1]] *= col[q[D]]; n } n D--; n } n } n printf( 1 ); n for (int i = 1; i < L - 1; i++) n if (O[i] == fa[O[i + 1]] && col[O[i + 1]] == 1) n printf( %d %d %d , O[i + 1], O[i], O[i + 1]); n else n printf( %d , O[i + 1]); n if (col[1] == 1) printf( 1 ); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, cntu[1000006], cntd[1000006], preu[1000006], pred[1000006]; n string s; n vector lisu, lisd; n int main() { n ios::sync_with_stdio(0); n cin >> n >> s; n lisd.push_back(0); n lisu.push_back(0); n for (int i = 1; i <= n; i++) { n if (s[i - 1] == D ) n cntd[i]++; n else n cntu[i]++; n cntd[i] += cntd[i - 1]; n cntu[i] += cntu[i - 1]; n if (s[i - 1] == D ) n pred[i] += i; n else n preu[i] += i; n pred[i] += pred[i - 1]; n preu[i] += preu[i - 1]; n if (s[i - 1] == D ) { n lisd.push_back(lisd.back() + i); n } else { n lisu.push_back(lisu.back() + i); n } n } n for (int i = 1; i <= n; i++) { n if (s[i - 1] == U ) { n long long down_after = cntd[n] - cntd[i]; n long long up_before = cntu[i - 1]; n if (down_after <= up_before) n cout << 2 * (pred[n] - pred[i]) + n 2 * (-lisu[cntu[i - 1]] + lisu[cntu[i - 1] - down_after]) + n n - i + 1 n << ; n else n cout << 2 * (lisd[cntd[i] + up_before + 1] - i - lisd[cntd[i]] - n lisu[cntu[i - 1]] + lisu[cntu[i - 1] - up_before]) + n i n << ; n } else { n long long down_after = cntd[n] - cntd[i]; n long long up_before = cntu[i - 1]; n if (up_before <= down_after) n cout << 2 * (lisd[cntd[i] + up_before] - lisd[cntd[i]] - n lisu[cntu[i - 1]] + lisu[cntu[i - 1] - up_before]) + n i n << ; n else n cout << 2 * (lisd[cntd[i] + down_after] - lisd[cntd[i]] - n lisu[cntu[i - 1]] + lisu[cntu[i - 1] - down_after - 1] + n i) + n n - i + 1 n << ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n long long t; n cin >> t; n while (t--) { n long long a; n cin >> a; n long long b; n cin >> b; n if (b >= a) { n if (b % a == 0 && pow(2, (long long)log2(b / a)) == b / a) { n if ((long long)(log2(b / a)) % 3 == 0) { n cout << (long long)log2(b / a) / 3 << endl; n } else { n cout << (long long)(1 + (log2(b / a) / 3)) << endl; n } n } else { n cout << -1 << endl; n } n } else { n if (a % b == 0 && pow(2, (long long)log2(a / b)) == a / b) { n if ((long long)(log2(a / b)) % 3 == 0) { n cout << (long long)log2(a / b) / 3 << endl; n } else { n cout << (long long)(1 + (log2(a / b) / 3)) << endl; n } n } else { n cout << -1 << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, count = 0; n for (int i = 0; i < 5; i++) { n for (int j = 0; j < 5; j++) { n cin >> n; n if (n == 1) { n count = abs(2 - i) + abs(2 - j); n cout << count << endl; n return 0; n } n } n } n cout << count << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n, v; n int sum = 0; n int cnt[10]; n memset(cnt, 0, sizeof cnt); n cin >> n; n while (n--) { n cin >> v; n cnt[v]++; n sum += v; n } n if (cnt[0] == 0) { n cout << -1 ; n return 0; n } n int mod = sum % 3; n if (mod != 0) { n bool deleted = 0; n for (int i = mod; i < 9; i += 3) { n if (cnt[i] > 0) { n deleted = 1; n cnt[i]--; n break; n } n } n if (!deleted) { n int left = 2; n for (int i = mod == 1 ? 2 : 1; i < 9 && left; i += 3) { n int take = min(left, cnt[i]); n left -= take; n cnt[i] -= take; n } n } n } n string res; n for (int i = 9; i >= 0; i--) { n if (i == 0 && res.empty()) cnt[0] = 1; n res += string(cnt[i], 0 + i); n } n cout << res; n } n "} +{"func_code_string": "#include n using namespace std; n vector > v[10020]; n int main() { n long long n, m; n pair p; n long long temp; n cin >> n >> m; n for (int i = 0; i < n; i++) { n cin >> p.second; n cin >> temp; n cin >> p.first; n v[temp].push_back(p); n } n for (int i = 1; i <= m; i++) { n sort(v[i].begin(), v[i].end()); n } n for (int i = 1; i <= m; i++) { n int k = v[i].size(); n if (k < 2 || (k > 2 && v[i][k - 2].first == v[i][k - 3].first)) { n cout << ? << endl; n } else { n cout << v[i][k - 1].second << << v[i][k - 2].second << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n T gcd(T a, T b) { n return b ? gcd(b, a % b) : a; n } n const double EPS = 1e-9; n const double PI = acos(-1.); n const int INF = 1e8; n const int MAXN = 505; n const long long MOD = 1e9 + 7; n int v[MAXN]; n int dp[MAXN][MAXN]; n void solve() { n int n, i, j, k, lim, fl; n scanf( %d , &n); n for ((i) = (0); (i) < (int)(n); (i)++) { n scanf( %d , &v[i]); n } n for ((i) = (0); (i) < (int)(n); (i)++) { n for ((j) = (0); (j) < (int)(n); (j)++) { n dp[i][j] = INF; n } n } n for (i = n - 1; i >= 0; i--) { n dp[i][i] = 1; n if (i < n - 1) { n dp[i][i + 1] = 2; n if (v[i] == v[i + 1]) { n dp[i][i + 1] = 1; n } n } n for (j = i + 2; j < n; j++) { n for (k = i; k < j; k++) { n dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j]); n } n if (v[i] == v[j]) { n dp[i][j] = min(dp[i][j], dp[i + 1][j - 1]); n } n } n } n printf( %d n , dp[0][n - 1]); n } n int main() { n int t = 1; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[110], suml[110], sumr[110], ans = 0; n int main() { n cin >> n; n for (int i = 1; i <= n; i++) cin >> a[i]; n for (int i = 1; i <= n; i++) suml[i] = suml[i - 1] + (a[i] == 0); n for (int i = n; i >= 1; i--) sumr[i] = sumr[i + 1] + (a[i] == 1); n for (int i = 1; i <= n; i++) ans = max(ans, suml[i] + sumr[i]); n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n ; n long long int n; n cin >> n; n vector > dist(n + 1, vector(n + 1)); n vector x(n + 1), y(n + 1), z(n + 1); n vector vis(n + 1, 0); n for (long long int i = 1; i <= n; i++) cin >> x[i] >> y[i] >> z[i]; n for (long long int i = 1; i <= n; i++) { n for (long long int j = 1; j <= n; j++) { n dist[i][j] = (x[i] - x[j]) * (x[i] - x[j]) + n (y[i] - y[j]) * (y[i] - y[j]) + n (z[i] - z[j]) * (z[i] - z[j]); n dist[i][j] = sqrt(dist[i][j]); n } n } n for (long long int i = 1; i <= n; i++) { n if (vis[i] == 0) { n long double big = 1e18 * 1.0; n long long int ans; n for (long long int j = i + 1; j <= n; j++) { n if (vis[j] == 0) { n if (dist[i][j] < big) { n big = dist[i][j]; n ans = j; n } n } n } n vis[ans] = 1; n vis[i] = 1; n cout << i << << ans << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int getint() { n static char c; n while ((c = getchar()) < 0 || c > 9 ) n ; n int res = c - 0 ; n while ((c = getchar()) >= 0 && c <= 9 ) res = res * 10 + c - 0 ; n return res; n } n const int MaxN = 200005; n const int M = 1000000007; n inline int add(int a, const int &b) { n a += b; n return a >= M ? a - M : a; n } n inline int dec(int a, const int &b) { n a -= b; n return a < 0 ? a + M : a; n } n int n; n int key[MaxN]; n vector adj[MaxN]; n int inv[MaxN]; n int phi[MaxN]; n vector divs[MaxN]; n vector coe[MaxN]; n int prod[MaxN]; n inline void init_math() { n inv[1] = phi[1] = 1; n for (int i = 2; i <= n; ++i) { n phi[i] = i; n inv[i] = (long long)(M - M / i) * inv[M % i] % M; n } n for (int i = 1; i <= n; ++i) { n divs[i].push_back(i); n for (int j = i << 1; j <= n; j += i) { n divs[j].push_back(i); n phi[j] -= phi[i]; n } n } n for (int i = 1; i <= n; ++i) coe[i].resize(divs[i].size()); n coe[1][0] = 1; n for (int i = 2; i <= n; ++i) { n int p = divs[i][1]; n if (p == i) { n coe[i][0] = 1; n coe[i][1] = inv[p - 1]; n continue; n } n int q = i; n while (q % p == 0) q /= p; n for (int d : divs[i]) prod[d] = 0; n for (int i = 0; i < divs[p].size(); ++i) n for (int j = 0; j < divs[q].size(); ++j) { n int u = divs[p][i], a = coe[p][i]; n int v = divs[q][j], b = coe[q][j]; n int x = u * v, y = (long long)a * b % M; n prod[x] = add(prod[x], y); n } n for (int j = 0; j < divs[i].size(); ++j) coe[i][j] = prod[divs[i][j]]; n } n } n bool book[MaxN]; n int q_n, q[MaxN]; n int fa[MaxN]; n int dep[MaxN]; n int size[MaxN]; n inline void bfs(const int &sv, const int &prev) { n q[q_n = 1] = sv; n fa[sv] = prev, dep[sv] = 1; n for (int i = 1; i <= q_n; ++i) { n int u = q[i]; n for (int v : adj[u]) n if (!book[v] && v != fa[u]) { n fa[v] = u; n dep[v] = dep[u] + 1; n q[++q_n] = v; n } n } n } n inline int centroid(int root) { n bfs(root, 0); n int vC = 0, wC = q_n; n for (int i = 1; i <= q_n; ++i) size[q[i]] = 1; n for (int i = q_n; i >= 1; --i) { n int u = q[i]; n size[fa[u]] += size[u]; n int vW = q_n - size[u]; n for (int v : adj[u]) n if (!book[v] && v != fa[u]) vW = max(vW, size[v]); n if (vW < wC) wC = vW, vC = u; n } n return vC; n } n int nVer = 0; n int ver[MaxN]; n int sum = 0; n int sum_phi[MaxN]; n inline int calc(int v) { n int sum = 0; n for (int i = 0; i < divs[v].size(); ++i) { n int d = divs[v][i]; n sum = add(sum, (long long)coe[v][i] * sum_phi[d] % M); n } n return (long long)sum * phi[v] % M; n } n inline void work(int vC) { n nVer = q_n; n for (int i = 1; i <= q_n; ++i) ver[i] = q[i]; n for (int i = 1; i <= nVer; ++i) { n int v = key[ver[i]]; n for (int d : divs[v]) sum_phi[d] = add(sum_phi[d], phi[v]); n } n for (int u : adj[vC]) n if (!book[u]) { n bfs(u, vC); n for (int i = 1; i <= q_n; ++i) { n int v = key[q[i]]; n for (int d : divs[v]) sum_phi[d] = dec(sum_phi[d], phi[v]); n } n for (int i = 1; i <= q_n; ++i) { n int v = q[i]; n int w = key[v]; n sum = add(sum, (long long)dep[v] * calc(w) % M); n } n for (int i = 1; i <= q_n; ++i) { n int v = key[q[i]]; n for (int d : divs[v]) sum_phi[d] = add(sum_phi[d], phi[v]); n } n } n for (int i = 1; i <= nVer; ++i) { n int v = key[ver[i]]; n for (int d : divs[v]) sum_phi[d] = 0; n } n } n void solve(int root) { n int vC = centroid(root); n book[vC] = true; n work(vC); n for (int v : adj[vC]) n if (!book[v]) solve(v); n } n int main() { n n = getint(); n for (int u = 1; u <= n; ++u) key[u] = getint(); n for (int i = 1; i < n; ++i) { n int u = getint(), v = getint(); n adj[u].push_back(v); n adj[v].push_back(u); n } n init_math(); n solve(1); n sum = (long long)sum * inv[n] % M; n sum = (long long)sum * inv[n - 1] % M; n sum = (long long)sum * 2 % M; n printf( %d n , sum); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int xx[4] = {0, 0, 1, -1}; n int yy[4] = {1, -1, 0, 0}; n int n, m, b, s; n int x[int(1e5)], y[int(1e5)]; n int main() { n scanf( %d%d , &n, &m); n scanf( %d , &b); n for (int i = (1), _b = (b); i <= _b; i++) { n scanf( %d , &s); n x[s] = true; n } n scanf( %d , &b); n for (int i = (1), _b = (b); i <= _b; i++) { n scanf( %d , &s); n y[s] = true; n } n for (int i = (0), _b = (2 * n * m); i <= _b; i++) { n int u = i % n; n int v = i % m; n if (x[u] || y[v]) { n x[u] = true; n y[v] = true; n } n } n for (int i = (0), _b = (n - 1); i <= _b; i++) n if (!x[i]) { n cout << No << endl; n return 0; n } n for (int i = (0), _b = (m - 1); i <= _b; i++) n if (!y[i]) { n cout << No << endl; n return 0; n } n cout << Yes << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5e3 + 10; n int ad[N][N]; n long long n; n pair t[N]; n bool ok; n int c[N]; n void connect(int k) { n for (int i = 0; i < n; i++) { n for (int j = i + 1; j < n; j++) { n if (abs(t[i].first - t[j].first) + abs(t[i].second - t[j].second) > k) n ad[i][j] = ad[j][i] = 1; n else n ad[i][j] = ad[j][i] = 0; n } n } n } n void dfs(int v, int col) { n c[v] = col; n for (int i = 0; i < n; i++) { n if (ad[v][i] && c[i] == 0) n dfs(i, 3 - col); n else if (ad[v][i] && c[i] == col) { n ok = 0; n return; n } n } n } n int tt = 10000; n int bs() { n long long top = 10100, low = 0; n while (top > low + 1) { n int md = (low + top) / 2; n connect(md); n ok = true; n for (int i = 0; i < n; i++) c[i] = 0; n for (int i = 0; i < n; i++) { n if (!c[i]) { n dfs(i, 1); n } n } n if (ok) n top = md; n else n low = md; n tt = top; n } n return top; n } n bool mark[N] = {0}; n void dfsp(int v) { n mark[v] = 1; n for (int i = 0; i < n; i++) { n if (ad[v][i] && mark[i] == 0) dfsp(i); n } n } n const int M = 1e9 + 7; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n; n if (n == 2) { n cout << 0 << endl << 2; n return 0; n } n for (int i = 0; i < n; i++) cin >> t[i].first >> t[i].second; n cout << bs() << endl; n connect(tt); n long long x = 1; n for (int i = 0; i < n; i++) { n if (mark[i] == 0) { n x *= 2; n x %= M; n dfsp(i); n } n } n cout << x << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long ans = 0; n int n, u, r; n vector b, k; n vector p; n void exec(vector a, int type, int count) { n if (count < u) { n if (type == 0) { n for (int i = 0; i < n; ++i) a[i] = a[i] ^ b[i]; n exec(a, 1, count + 1); n } else { n vector aa(n); n for (int i = 0; i < n; ++i) aa[i] = a[p[i]] + r; n int rest = u - count - 1; n long long cur_cand = 0; n if (rest & 1) { n vector aaa(n); n for (int i = 0; i < n; ++i) aaa[i] = aa[i] ^ b[i]; n cur_cand = inner_product(aaa.begin(), aaa.end(), k.begin(), 0LL); n } else { n cur_cand = inner_product(aa.begin(), aa.end(), k.begin(), 0LL); n } n ans = max(cur_cand, ans); n exec(aa, 0, count + 1); n exec(aa, 1, count + 1); n } n } else { n long long cand = inner_product(a.begin(), a.end(), k.begin(), 0LL); n ans = max(cand, ans); n } n } n int main() { n cin >> n >> u >> r; n vector a(n); n b.resize(n); n k.resize(n); n p.resize(n); n for (int i = 0; i < n; ++i) cin >> a[i]; n for (int i = 0; i < n; ++i) cin >> b[i]; n for (int i = 0; i < n; ++i) cin >> k[i]; n for (int i = 0; i < n; ++i) { n cin >> p[i]; n --p[i]; n } n for (int i = 0; i < n; ++i) { n ans += k[i] * (u & 1 ? a[i] ^ b[i] : a[i]); n } n exec(a, 1, 0); n exec(a, 0, 0); n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int book[100010]; n vector> v; n deque high, low; n int main() { n int n, k, ans = 0, num = 0, r, l; n cin >> n >> k; n for (int i = 1; i <= n; i++) cin >> book[i]; n for (r = 1, l = 1; r <= n; r++) { n while (!high.empty() && high.back() < book[r]) high.pop_back(); n high.push_back(book[r]); n while (!low.empty() && low.back() > book[r]) low.pop_back(); n low.push_back(book[r]); n while (!high.empty() && !low.empty() && high.front() - low.front() > k) { n if (v.empty()) { n num = 1; n ans = r - l; n v.push_back(make_pair(l, r - 1)); n } else if (r - l > ans) { n v.clear(); n num = 1; n ans = r - l; n v.push_back(make_pair(l, r - 1)); n } else if (!v.empty() && r - l == ans) { n num++; n v.push_back(make_pair(l, r - 1)); n } n if (high.front() == book[l]) high.pop_front(); n if (low.front() == book[l]) low.pop_front(); n l++; n } n } n while (l <= n) { n if (v.empty()) { n num = 1; n ans = r - l; n v.push_back(make_pair(l, r - 1)); n } else if (r - l > ans) { n v.clear(); n num = 1; n ans = r - l; n v.push_back(make_pair(l, r - 1)); n } else if (!v.empty() && r - l == ans) { n num++; n v.push_back(make_pair(l, r - 1)); n } n if (high.front() == book[l]) high.pop_front(); n if (low.front() == book[l]) low.pop_front(); n l++; n } n cout << ans << << num << endl; n for (int i = 0; i < v.size(); i++) n cout << v[i].first << << v[i].second << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector > Dates; n int n, x, y, ans, cur; n int main() { n std::ios_base::sync_with_stdio(false); n cin >> n; n for (int i = 0; i < n; i++) { n cin >> x >> y; n Dates.push_back(make_pair(x, y)); n } n sort(Dates.begin(), Dates.end()); n for (int i = 0; i < Dates.size(); i++) { n if (Dates[i].second > cur) n cur = Dates[i].second; n else if (Dates[i].second < cur) { n ans++; n } n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n string a[] = { zero , one , two , three , four , n five , six , seven , eight , nine }; n string b[] = { ten , twenty , thirty , forty , fifty , n sixty , seventy , eighty , ninety }; n string c[] = { eleven , twelve , thirteen , fourteen , fifteen , n sixteen , seventeen , eighteen , nineteen }; n int main() { n int n; n cin >> n; n if (n < 10) { n cout << a[n] << endl; n return 0; n } else { n if (n % 10 == 0) { n cout << b[(n / 10) - 1] << endl; n return 0; n } else if (n > 10 && n < 20) { n cout << c[(n % 10) - 1] << endl; n return 0; n } else { n cout << b[(n / 10) - 1] << - << a[n % 10] << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const long long int INF = 3e16; n const int N = 200010; n int n; n int ask(vector v) { n printf( ? ); n for (int i = 0; i < n; i++) printf( %d , v[i]); n printf( n ); n fflush(stdout); n int ans; n scanf( %d , &ans); n return ans; n } n int main() { n scanf( %d , &n); n int pivo = -1; n for (int i = 1; i < n; i++) { n vector tmp(n); n tmp[n - 1] = 1; n for (int j = 0; j < n - 1; j++) { n tmp[j] = 1 + i; n } n int k = ask(tmp); n if (k == 0) { n pivo = i; n break; n } n } n if (pivo == -1) pivo = n; n vector ans(n + 1); n ans[n] = pivo; n for (int i = 1; i <= n; i++) { n if (i == pivo) continue; n vector tmp(n); n tmp[n - 1] = (n + 1) - pivo; n for (int j = 0; j < n - 1; j++) { n tmp[j] = (n + 1) - i; n } n int k = ask(tmp); n ans[k] = i; n } n printf( ! ); n for (int i = 1; i <= n; i++) printf( %d , ans[i]); n printf( n ); n fflush(stdout); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n pair a[300000 + 13]; n int n; n void erf() { n for (int i = 1; i < n; i++) { n if (a[i - 1].first + 1 >= a[i].first) a[i].first = a[i - 1].first + 1; n } n } n int main() { n int cur, ebte; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i].first; n a[i].second = i; n } n sort(a, a + n); n erf(); n pair b; n for (int i = 0; i < n; i++) { n b = make_pair(a[i].second, a[i].first); n swap(a[i], b); n } n sort(a, a + n); n for (int i = 0; i < n; i++) { n cout << a[i].second << ; n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e6; n long long a[100000 + 5]; n bool vis[100000 + 5]; n char c[] = { 6 , 7 , 8 , 9 , T , J , Q , K , A }; n int main() { n long long n; n string s, s1, s2; n cin >> s >> s1 >> s2; n if (s1[1] == s[0]) { n if (s2[1] != s[0]) n cout << YES << endl; n else { n int i = 0; n for (i = 0; i < 9; i++) { n if (s1[0] == c[i]) break; n } n int j = 0; n for (j = 0; j < 9; j++) { n if (s2[0] == c[j]) break; n } n if (i > j) n cout << YES << endl; n else n cout << NO << endl; n } n } else { n if (s2[1] == s[0]) n cout << NO << endl; n else if (s1[1] == s2[1]) { n int i = 0; n for (i = 0; i < 9; i++) { n if (s1[0] == c[i]) break; n } n int j = 0; n for (j = 0; j < 9; j++) { n if (s2[0] == c[j]) break; n } n if (i > j) n cout << YES << endl; n else n cout << NO << endl; n } else n cout << NO << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int getID(char nms[202][30], char s[30], int &len) { n for (int i = 0; i < 30; ++i) { n if (s[i] >= a && s[i] <= z ) s[i] += A - a ; n } n for (int i = 0; i < len; ++i) { n if (strcmp(nms[i], s) == 0) return i; n } n strcpy(nms[len], s); n len++; n return len - 1; n } n int search(int mailFrom[202], int mailTo[202], int p, int n, int h) { n int max = 0; n for (int i = 0; i < n; ++i) { n if (mailFrom[i] == p) { n int ans = search(mailFrom, mailTo, mailTo[i], n, h + 1); n if (max < ans) max = ans; n } n } n if (max == 0) return h; n return max; n } n int main() { n int n; n while (cin >> n) { n char nms[202][30] = {0}; n int len = 0; n int mailFrom[202] = {0}; n int mailTo[202] = {0}; n bool notHead[202] = {0}; n for (int i = 0; i < n; ++i) { n char n1[30], n2[30], t[30]; n cin >> n1; n cin >> t; n cin >> n2; n mailFrom[i] = getID(nms, n2, len); n mailTo[i] = getID(nms, n1, len); n notHead[mailTo[i]] = 1; n } n int max = 0; n for (int i = 0; i < n; ++i) { n if (!notHead[i]) { n int ans = search(mailFrom, mailTo, i, n, 1); n if (ans > max) max = ans; n } n } n cout << max << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n ; n const long long N = 5e3 + 10; n vector > v; n vector > > hor, ver; n long long n, cnt, y11, y2, x1, x2; n long long ans; n bool check(long long x, pair a) { n return a.first <= x && x <= a.second; n } n void solve() { n cin >> n; n for (long long i = 0; i < n; i++) { n cin >> x1 >> y11 >> x2 >> y2; n if (x1 > x2) swap(x1, x2); n if (y11 > y2) swap(y11, y2); n if (x1 == x2) n ver.push_back({x1, {y11, y2}}); n else n hor.push_back({y11, {x1, x2}}); n } n if ((long long)((hor).size()) > (long long)((ver).size())) swap(hor, ver); n v.resize((long long)((hor).size())); n for (long long i = 0; i < (long long)((hor).size()); i++) { n for (long long j = 0; j < (long long)((ver).size()); j++) { n v[i][j] = check(hor[i].first, ver[j].second) && n check(ver[j].first, hor[i].second); n } n } n for (long long i = 0; i < (long long)((v).size()); i++) { n for (long long j = i + 1; j < (long long)((v).size()); j++) { n cnt = (v[i] & v[j]).count(); n ans += cnt * (cnt - 1) / 2; n } n } n cout << ans << n ; n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long t = 1; n clock_t start, end; n start = clock(); n cout << fixed << setprecision(15); n while (t--) { n solve(); n } n end = clock(); n double time_taken = double(end - start) / double(CLOCKS_PER_SEC); n } n "} +{"func_code_string": "#include n const double PI = 3.141592653589793238460; n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t = 1; n cin >> t; n while (t--) { n long long int n; n cin >> n; n long long int a[n], i, sum = 0, maxi = -1000000000, mini = 1000000000; n for (int i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] > maxi) n maxi = a[i]; n else if (a[i] < mini) n mini = a[i]; n } n for (i = 0; i < n - 1; i++) { n long long int pro = a[i] * a[i + 1]; n if (pro > sum) { n sum = pro; n } n } n cout << sum << n ; n } n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:1760777216 ) n using namespace std; n const double Pi = 3.14159265358979323846; n int main() { n int T; n scanf( %d , &T); n while (T--) { n double R, r, k; n scanf( %lf%lf%lf , &R, &r, &k); n double x1 = 0.5 / R, x2 = 0.5 / r, rr = fabs(x1 - x2) / 2; n double x = (x1 + x2) / 2, y = 2 * k * rr, a = x / sqrt(x * x + y * y); n double dx = rr * a, dy = rr * sqrt(1 - a * a); n double res = sqrt(x * x + y * y); n printf( %.9lf n , (1 / (res - rr) - 1 / (res + rr)) / 2); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool arr[100100]; n int dp[100100]; n int pref[100100]; n int pref2[100100]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n int n; n cin >> n; n char a; n for (int i = 1; i <= n; i++) { n cin >> a; n if (a == G ) arr[i] = true; n } n for (int i = 1; i <= n; i++) { n if (arr[i]) pref[i] = pref[i - 1] + 1; n } n for (int i = 1; i <= n; i++) { n pref2[i] = pref2[i - 1] + arr[i]; n } n if (pref2[n] == n) { n cout << n << endl; n return 0; n } n if (pref2[n] == 0) { n cout << 0 << endl; n return 0; n } n for (int i = n; i >= 1; i--) { n if (pref[i - 1] > 0 && pref[i] > 0) pref[i - 1] = pref[i]; n } n int ma = -1e9; n for (int i = 1; i <= n; i++) { n if (!arr[i]) { n if (pref[i - 1] + pref[i + 1] < pref2[n]) n ma = max(ma, pref[i - 1] + pref[i + 1] + 1); n else n ma = max(ma, pref[i - 1] + pref[i + 1]); n } n } n cout << ma << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n ifstream f( test.in ); n ofstream g( test.out ); n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int t; n cin >> t; n while (t--) { n int n, ans = 0; n cin >> n; n stack s; n int x; n cin >> x; n s.push(x); n for (int i = 2; i <= n; i++) { n cin >> x; n while (!s.empty() and s.top() > x) { n ans++; n s.pop(); n } n s.push(x); n } n while (!s.empty()) s.pop(); n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string a, b; n int main() { n cin >> a >> b; n if (a == b) n cout << a; n else n cout << 1; n } n "} +{"func_code_string": "#include n using namespace std; n vector > newadj(212345); n int visit[212345]; n vector > adj(212345); n vector vec, vecans; n set seti; n int cnt = 0; n int pos[212345]; n int dfs(int cur) { n cnt++; n visit[cur] = 1; n set::iterator it; n for (it = newadj[cur].begin(); it != newadj[cur].end(); it++) { n if (!visit[*it]) { n dfs(*it); n } n } n return 0; n } n int main() { n std::ios::sync_with_stdio(false); n int n, m; n int i, j, u, v; n cin >> n >> m; n for (i = 0; i < m; i++) { n cin >> u >> v; n u--; n v--; n adj[u].push_back(v); n adj[v].push_back(u); n } n int mini = (1000 * 1000 * 1000 + 5), vert; n for (i = 0; i < n; i++) { n if (mini > adj[i].size()) { n mini = adj[i].size(); n vert = i; n } n } n int sumi = 0; n for (i = 0; i < n; i++) { n sumi++; n pos[i] = vert; n } n vec.push_back(vert); n for (i = 0; i < adj[vert].size(); i++) { n sumi--; n pos[adj[vert][i]] = adj[vert][i]; n vec.push_back(adj[vert][i]); n seti.insert(adj[vert][i]); n } n seti.insert(vert); n set::iterator it; n for (i = 1; i < vec.size(); i++) { n for (it = seti.begin(); it != seti.end(); it++) { n newadj[vec[i]].insert(*it); n } n cnt = 0; n for (j = 0; j < adj[vec[i]].size(); j++) { n if (pos[adj[vec[i]][j]] == vert) { n cnt++; n continue; n } n newadj[vec[i]].erase(pos[adj[vec[i]][j]]); n } n if (cnt == sumi) { n newadj[vec[i]].erase(vert); n } else { n newadj[vert].insert(vec[i]); n } n } n for (i = 0; i < vec.size(); i++) { n if (!visit[vec[i]]) { n cnt = 0; n dfs(vec[i]); n if (i == 0) { n cnt += sumi - 1; n } n vecans.push_back(cnt); n } n } n sort(vecans.begin(), vecans.end()); n cout << vecans.size() << endl; n for (i = 0; i < vecans.size(); i++) { n cout << vecans[i] << ; n } n return 0; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int b = -1, n = 0, limit = 10; n string pass, box = 0000000000 , zero, one, two, three, four, five, six, n seven, eight, nine; n cin >> pass; n cin >> zero; n cin >> one; n cin >> two; n cin >> three; n cin >> four; n cin >> five; n cin >> six; n cin >> seven; n cin >> eight; n cin >> nine; n while (n < 8) { n for (int i = b + 1, i2 = 0; i < limit; i++, i2++) { n box[i2] = pass[i]; n b = i; n } n if (box == zero) n cout << 0 ; n else if (box == one) n cout << 1 ; n else if (box == two) n cout << 2 ; n else if (box == three) n cout << 3 ; n else if (box == four) n cout << 4 ; n else if (box == five) n cout << 5 ; n else if (box == six) n cout << 6 ; n else if (box == seven) n cout << 7 ; n else if (box == eight) n cout << 8 ; n else if (box == nine) n cout << 9 ; n n++; n limit += 10; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const int MAXN = 20; n const int MAXS = (1 << 16) + 10; n long long dp[MAXS]; n int ans[MAXN], req[MAXN]; n bool vis[MAXN]; n int main() { n long long n, y, m; n cin >> n >> y >> m; n y -= 2001; n for (int i = 1; i <= m; i++) { n int a, b; n cin >> a >> b; n req[b - 1] |= (1 << (a - 1)); n } n memset(ans, -1, sizeof ans); n for (int i = 0; i < n; i++) { n for (ans[i] = 0; ans[i] < n; ans[i]++) { n if (!vis[ans[i]]) { n memset(dp, 0, sizeof dp); n dp[0] = 1; n for (int s = 0; s < (1 << n); s++) { n if (dp[s] > 0) { n for (int j = 0; j < n; j++) { n if (!(s & (1 << j))) { n if ((ans[j] == -1 || ans[j] == __builtin_popcount(s)) && n ((s & req[j]) == req[j])) { n dp[s | (1 << j)] += dp[s]; n } n } n } n } n } n if (y >= dp[(1 << n) - 1]) { n y -= dp[(1 << n) - 1]; n } else { n vis[ans[i]] = true; n break; n } n } n } n if (ans[i] >= n) { n cout << The times have changed << endl; n return 0; n } n } n for (int i = 0; i < n; i++) { n cout << ans[i] + 1 << ; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, q; n const long long N = 2e5 + 100; n vector v[N]; n long long dfn[N], num[N], val[N], sz[N], hs[N], tp[N], dep[N], f[N]; n inline void dfs(long long x, long long fa) { n sz[x] = 1; n long long num = 0; n dep[x] = dep[fa] + 1; n f[x] = fa; n for (auto y : v[x]) { n if (y == fa) continue; n dfs(y, x); n sz[x] += sz[y]; n if (num < sz[y]) hs[x] = y, num = sz[y]; n } n } n long long cnt; n inline void redfs(long long x, long long fa, long long top) { n tp[x] = top; n dfn[x] = ++cnt; n num[cnt] = x; n if (hs[x]) redfs(hs[x], x, top); n for (auto y : v[x]) { n if (y == fa || y == hs[x]) continue; n redfs(y, x, y); n } n } n struct seg { n long long l, r, v; n } t[N << 2]; n long long a[N]; n inline void build(long long p, long long l, long long r) { n t[p].l = l, t[p].r = r; n if (l == r) { n t[p].v = abs(val[num[l]]); n return; n } n long long mid = l + r >> 1; n build(p << 1, l, mid), build(p << 1 | 1, mid + 1, r); n t[p].v = t[p << 1].v + t[p << 1 | 1].v; n } n inline void modify(long long p, long long x, long long v) { n if (t[p].l == t[p].r) { n t[p].v = v; n return; n } n long long mid = t[p].l + t[p].r >> 1; n if (x <= mid) n modify(p << 1, x, v); n else n modify(p << 1 | 1, x, v); n t[p].v = t[p << 1].v + t[p << 1 | 1].v; n } n inline long long query(long long p, long long x, long long y) { n if (x <= t[p].l && t[p].r <= y) { n return t[p].v; n } n long long mid = t[p].l + t[p].r >> 1; n if (y <= mid) return query(p << 1, x, y); n if (x > mid) return query(p << 1 | 1, x, y); n return query(p << 1, x, y) + query(p << 1 | 1, x, y); n } n signed main() { n ios::sync_with_stdio(false); n cin >> n >> q; n for (long long i = 1; i <= n; i++) cin >> val[i], val[i] = abs(val[i]); n for (long long i = 1; i <= n - 1; i++) { n long long x, y; n cin >> x >> y; n v[x].push_back(y), v[y].push_back(x); n } n dfs(1, 0); n redfs(1, 0, 1); n build(1, 1, n); n for (long long i = 1; i <= q; i++) { n long long opt, x, y; n cin >> opt >> x >> y; n if (opt == 1) { n modify(1, dfn[x], abs(y)); n val[x] = abs(y); n } else { n long long ans = 0, X = x, Y = y; n ; n while (tp[x] != tp[y]) { n if (dep[tp[x]] < dep[tp[y]]) swap(x, y); n ans += query(1, dfn[tp[x]], dfn[x]); n x = f[tp[x]]; n } n if (dep[x] < dep[y]) swap(x, y); n ans += query(1, dfn[y], dfn[x]); n cout << ans * 2 - val[X] - val[Y] << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = (1 << 30) - 1; n const long long linf = (1ll << 62) - 1; n const int N = 200; n const int M = 1e9 + 7; n const long long M2 = 1ll * M * M; n int n; n long long a[N]; n int mat[N][N]; n int result[N][N]; n void multiply(int a[N][N], int b[N][N]) { n static int c[N][N]; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n long long result = 0; n for (int z = 0; z < n; z++) { n result += 1ll * a[i][z] * b[z][j]; n if (result >= M2) { n result -= M2; n } n } n c[i][j] = result % M; n } n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n a[i][j] = c[i][j]; n } n } n } n void power(long long n) { n for (int i = 0; i < ::n; i++) { n result[i][i] = 1; n } n for (; n > 0; n >>= 1) { n if (n & 1) { n multiply(result, mat); n } n multiply(mat, mat); n } n } n int main() { n long long k; n cin >> n >> k; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n long long x = a[i] ^ a[j]; n int cnt = 0; n while (x > 0) { n cnt += x & 1; n x /= 2; n } n if (cnt % 3 == 0) { n mat[i][j]++; n } n } n } n power(k - 1); n int answer = 0; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n answer += result[i][j]; n if (answer >= M) { n answer -= M; n } n } n } n cout << answer << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100100; n inline long long int max(long long int a, long long int b) { n return a > b ? a : b; n } n inline long long int min(long long int a, long long int b) { n return a > b ? b : a; n } n inline int read() { n int x = 0; n char c = getchar(); n while (c < 0 || c > 9 ) c = getchar(); n while (c >= 0 && c <= 9 ) x = x * 10 + c - 0 , c = getchar(); n return x; n } n long long int sum[maxn * 4], mq[maxn * 4], dl[maxn * 4], dr[maxn * 4]; n int lb[maxn * 4], rb[maxn * 4]; n int N, M; n int a[maxn]; n inline void update(int i) { n if (lb[i] == rb[i]) { n sum[i] = fabs(dr[i]); n mq[i] = max(dl[i], 0) + max(dr[i], 0); n return; n } n sum[i] = sum[i << 1] + sum[(i << 1) + 1]; n mq[i] = min(mq[i << 1], mq[(i << 1) + 1]); n } n inline void updateall(int i) { n while (i > 1) { n update(i); n i = i >> 1; n } n update(1); n } n void build(int i, int l, int r) { n lb[i] = l; n rb[i] = r; n if (l == r) { n dl[i] = a[l - 1] - a[l]; n dr[i] = a[l + 1] - a[l]; n sum[i] = fabs(dr[i]); n mq[i] = max(dl[i], 0) + max(dr[i], 0); n } else { n int m = (l + r) >> 1; n build(i << 1, l, m); n build((i << 1) + 1, m + 1, r); n update(i); n } n } n long long int getmq(int i, int l, int r) { n if (l == lb[i] && r == rb[i]) return mq[i]; n int m = (lb[i] + rb[i]) >> 1; n long long int re = 1e9 + 10; n if (l <= m) re = min(re, getmq(i << 1, l, min(m, r))); n if (r > m) re = min(re, getmq((i << 1) + 1, max(m + 1, l), r)); n return re; n } n int find(int x, int i) { n if (lb[i] == rb[i] && lb[i] == x) n return i; n else if (x <= ((lb[i] + rb[i]) >> 1)) n return find(x, i << 1); n else n return find(x, (i << 1) + 1); n } n inline long long int solve1(int l, int r, int x) { n if (l == r) { n int p = find(l, 1); n return fabs(dl[p] - x) + fabs(dr[p] - x) - fabs(dl[p]) - fabs(dr[p]) + n sum[1]; n } else { n return max(0, 2 * x - 2 * getmq(1, l, r)) + sum[1]; n } n } n inline void solve2(int l, int r, int x) { n int p = find(l, 1); n dl[p] -= x; n updateall(p); n p = find(l - 1, 1); n dr[p] += x; n updateall(p); n p = find(r, 1); n dr[p] -= x; n updateall(p); n p = find(r + 1, 1); n dl[p] += x; n updateall(p); n } n int main() { n int i, j, k, x, y; n N = read(); n for (i = 1; i <= N; i++) a[i] = read(); n a[N + 1] = a[N]; n a[0] = a[1]; n build(1, 1, N); n M = read(); n for (i = 1; i <= M; i++) { n j = read(); n k = read(); n x = read(); n y = read(); n if (j == 1) { n printf( %I64d n , solve1(k, x, y)); n } else { n solve2(k, x, y); n } n } n } n "} +{"func_code_string": "#include n long long T, n, k; n long long a, sum, num; n int main() { n scanf( %I64d%I64d , &n, &k); n for (long long i = 1; i <= n; i++) { n scanf( %I64d , &a); n if (sum - (i - 1 - num) * (n - i) * a >= k) n sum += a * (i - 1 - num); n else { n printf( %I64d n , i); n num++; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9, MOD = 1e9 + 7, n around[] = {0, 1, 1, -1, -1, 0, -1, 1, 0, 0}; n const long long LINF = 1e18; n const long double PI = abs(acos(-1)); n int a, b, c; n int main() { n cin >> a >> b >> c; n for (int x1 = (0); x1 < (3); x1++) { n for (int x2 = (0); x2 < (3); x2++) { n for (int x3 = (0); x3 < (3); x3++) { n bool li[1500 * 1510 + 1] = {}; n int ma = 0; n for (int i = (0); i < (max(a, max(b, c))); i++) { n li[x1 + a * i] = li[x2 + b * i] = li[x3 + c * i] = true; n ma = max(x1 + a * i, max(x2 + b * i, x3 + c * i)); n } n for (int i = 0; x1 + a * i < ma; i++) li[x1 + a * i] = true; n for (int i = 0; x2 + b * i < ma; i++) li[x2 + b * i] = true; n for (int i = 0; x3 + c * i < ma; i++) li[x3 + c * i] = true; n bool f = true; n for (int i = (0); i < (ma + 1); i++) f = f & li[i]; n if (f) { n cout << YES << endl; n return 0; n } n } n } n } n cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dp[3001]; n int n; n struct node { n int pos, val; n bool operator<(const node& a) const { return val < a.val; } n } nodes[3001]; n int main() { n int t; n scanf( %d , &t); n while (t--) { n int ans = 0; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , &nodes[i].val); n nodes[i].pos = i; n } n sort(nodes, nodes + n); n dp[0] = 1; n for (int i = 1; i < n; i++) { n if (nodes[i - 1].pos < nodes[i].pos) n dp[i] = dp[i - 1] + 1; n else n dp[i] = 1; n ans = max(ans, dp[i]); n } n ans = max(ans, dp[0]); n printf( %d n , n - ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = ~0u >> 1, MOD = 1e9 + 7; n inline int rd() { n int first = 0, c = 0, f = 1; n for (; c < 0 || c > 9 ; c = getchar()) f = c != - ; n for (; c >= 0 && c <= 9 ; c = getchar()) first = first * 10 + c - 0 ; n return f ? first : -first; n } n const int N = 2e5 + 11; n struct Edge { n int v, id; n Edge *nex; n } pl[N << 1], *cur = pl, *G[N]; n void ins(int u, int v, int id) { n cur->v = v, cur->id = id; n cur->nex = G[u], G[u] = cur++; n } n int wx[N], wy[N], n, m; n int f[N], vis[N], g[N]; n void dfs(int first) { n vis[first] = 1; n for (Edge *i = G[first]; i; i = i->nex) n if (!vis[i->v]) { n dfs(i->v); n if (f[i->v]) { n f[i->v] = 0; n f[first] ^= 1; n g[i->id] ^= 1; n } n } n } n int q[N]; n int main() { n n = rd(), m = rd(); n for (int i = (1), i_end = (m); i <= i_end; i++) { n wx[i] = rd(), wy[i] = rd(); n ins(wx[i], wy[i], i), ins(wy[i], wx[i], i); n f[wx[i]] ^= 1; n } n for (int i = (1), i_end = (n); i <= i_end; i++) n if (!vis[i]) dfs(i); n int ans = m; n for (int i = (1), i_end = (n); i <= i_end; i++) n if (f[i]) ans--; n printf( %d n , ans >> 1); n for (int first = (1), x_end = (n); first <= x_end; first++) { n int cnt = 0; n for (Edge *i = G[first]; i; i = i->nex) n if ((wy[i->id] != first) ^ g[i->id]) { n q[++cnt] = (wx[i->id] ^ wy[i->id] ^ first); n } n for (int i = 1; i < cnt; i += 2) { n printf( %d %d %d n , q[i], first, q[i + 1]); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int lsb(int val) { return val & ((val ^ (val - 1))); } n pair > a[600666]; n int Arb[600666], SEG[600666], result[600666]; n bool comp(pair > i1, pair > i2) { n return i1.second.second < i2.second.second; n } n int query(int pos) { n if (pos) return Arb[pos] + query(pos - lsb(pos)); n return 0; n } n void update(int pos, int n) { n if (pos > n) return; n Arb[pos]++; n update(pos + lsb(pos), n); n } n int bs(int value, int n, int A[]) { n int left = 1, right = n + 1; n while (left < right - 1) { n int mid = (right + left) / 2; n if (A[mid] <= value) n left = mid; n else n right = mid; n } n return left; n } n int main() { n cin.sync_with_stdio(false); n int n, i, nr_seg = 0; n cin >> n; n for (i = 1; i <= n; ++i) { n cin >> a[i].second.first >> a[i].second.second; n a[i].first = i; n SEG[++nr_seg] = a[i].second.first; n SEG[++nr_seg] = a[i].second.second; n } n sort(SEG + 1, SEG + nr_seg + 1); n sort(a + 1, a + n + 1, comp); n for (i = 1; i <= n; ++i) { n a[i].second.first = bs(a[i].second.first, nr_seg, SEG); n a[i].second.second = bs(a[i].second.second, nr_seg, SEG); n } n for (i = 1; i <= n; ++i) { n result[a[i].first] = query(a[i].second.second) - query(a[i].second.first); n update(a[i].second.first, n * 2); n } n for (i = 1; i <= n; ++i) cout << result[i] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int a, int b) { n while (b != 0) { n int r = a % b; n a = b; n b = r; n } n return a; n } n void FindMinimum(int a[], int &n) { n int g = gcd(a[0], a[1]); n for (int i = 2; i < n; ++i) g = gcd(a[i], g); n cout << g * n; n } n int main() { n int n, a[100]; n cin >> n; n for (int i = 0; i < n; ++i) cin >> a[i]; n sort(a, a + n); n FindMinimum(a, n); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int expo(int base, int exponent, int mod) { n int ans = 1; n while (exponent != 0) { n if (exponent & 1) ans = (1LL * ans * base) % mod; n base = (1LL * base * base) % mod; n exponent >>= 1; n } n return ans % mod; n } n int n, a[5005], ans[10005], pre[5005], inv[5005]; n int up[5005][10005]; n int get_down(int l, int r) { n if (l <= 0 or r < 0) return 0; n if (r == 0) return 1; n r = l + r - 1; n if (r >= n) return 0; n return 1LL * pre[r] * inv[l - 1] % 1000000007; n } n void solve() { n cin >> n; n for (int i = 1; i < n; i++) cin >> a[i]; n a[0] = pre[0] = inv[0] = 1; n for (int i = 1; i < n + 1; i++) n pre[i] = 1LL * a[i] * pre[i - 1] % 1000000007, n inv[i] = expo(pre[i], 1000000007 - 2, 1000000007); n for (int i = 1; i < n + 1; i++) { n for (int j = 1; j < 2 * n - 1; j++) { n if (i >= 2) n up[i][j] = (0LL + up[i - 1][j - 1] + get_down(i - 1, j - 1) - n get_down(i, j - 2) + 1000000007) % n 1000000007; n ans[j] = (ans[j] + 1LL * pre[i - 1] * (up[i][j] + get_down(i, j))) % n 1000000007; n } n } n for (int i = 1; i < 2 * n - 1; i++) n cout << 1LL * ans[i] * (1000000007 + 1) / 2 % 1000000007 << ; n } n signed main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long lim = 100000000000ll; n long long qv[61], dis[100010], ma, nw, dep[100010]; n int n, Q, ans[61], x, y, v, hd[100010], cnt, q[100010], l, r, maa, la[100010], n rt[100010]; n struct node { n int to, next, val; n } e[200010]; n struct seg { n int ls, rs, val; n } t[6000010]; n void addedge(int x, int y, int v) { n e[++cnt] = (node){y, hd[x], v}, hd[x] = cnt; n e[++cnt] = (node){x, hd[y], v}, hd[y] = cnt; n } n void add(int i, long long l, long long r, long long x) { n t[i].val++; n if (l == r) return; n long long mid = (l + r) >> 1; n if (x <= mid) n add(t[i].ls ? t[i].ls : (t[i].ls = (++cnt)), l, mid, x); n else n add(t[i].rs ? t[i].rs : (t[i].rs = (++cnt)), mid + 1, r, x); n } n int query(int i, long long l, long long r, long long ql, long long qr) { n if (l == ql && r == qr) return t[i].val; n long long mid = (l + r) >> 1; n if (qr <= mid) return t[i].ls ? query(t[i].ls, l, mid, ql, qr) : 0; n if (ql > mid) return t[i].rs ? query(t[i].rs, mid + 1, r, ql, qr) : 0; n return (t[i].ls ? query(t[i].ls, l, mid, ql, mid) : 0) + n (t[i].rs ? query(t[i].rs, mid + 1, r, mid + 1, qr) : 0); n } n void merge(int i, int I, long long l, long long r) { n t[i].val += t[I].val; n if (l == r) return; n long long mid = (l + r) >> 1; n if (t[i].ls) { n if (t[I].ls) merge(t[i].ls, t[I].ls, l, mid); n } else n t[i].ls = t[I].ls; n if (t[i].rs) { n if (t[I].rs) merge(t[i].rs, t[I].rs, mid + 1, r); n } else n t[i].rs = t[I].rs; n } n void dfs(int x, int fa) { n rt[x] = (++cnt), add(rt[x], 0, lim, dep[x]); n for (int i = hd[x]; i; i = e[i].next) n if (e[i].to != fa) { n if (dep[e[i].to] == -1) dep[e[i].to] = dep[x] + e[i].val; n dfs(e[i].to, x), merge(rt[x], rt[e[i].to], 0, lim); n } n for (int i = 1; i <= Q; i++) n ans[i] = max(ans[i], query(rt[x], 0, lim, dep[x], dep[x] + qv[i])); n } n int main() { n scanf( %d , &n), cnt = 0; n memset(hd, 0, sizeof(hd)); n for (int i = 1; i < n; i++) { n scanf( %d%d%d , &x, &y, &v); n addedge(x, y, v); n } n scanf( %d , &Q); n for (int i = 1; i <= Q; i++) scanf( %I64d , &qv[i]), ans[i] = 0; n for (int i = 2; i <= n; i++) dis[i] = -1; n dis[1] = 0, q[l = r = 1] = 1; n while (l <= r) { n x = q[l++]; n for (int i = hd[x]; i; i = e[i].next) n if (dis[e[i].to] == -1) n dis[e[i].to] = dis[x] + e[i].val, q[++r] = e[i].to; n } n ma = 0, maa = 0; n for (int i = 1; i <= n; i++) n if (dis[i] > ma) ma = dis[i], maa = i; n for (int i = 1; i <= n; i++) dis[i] = -1; n dis[maa] = 0, q[l = r = 1] = maa; n while (l <= r) { n x = q[l++]; n for (int i = hd[x]; i; i = e[i].next) n if (dis[e[i].to] == -1) n dis[e[i].to] = dis[x] + e[i].val, q[++r] = e[i].to, n la[e[i].to] = ((i & 1) ? (i + 1) : (i - 1)); n } n ma = 0, maa = 0, nw = 0; n for (int i = 1; i <= n; i++) n if (dis[i] > ma) ma = dis[i], maa = i; n for (int i = 1; i <= n; i++) dep[i] = -1; n while (1) { n nw += e[la[maa]].val; n if ((nw << 1) > ma) { n x = maa, y = e[la[maa]].to; n dep[x] = ma - (nw - e[la[maa]].val); n dep[y] = nw; n break; n } n if ((nw << 1) == ma) { n x = y = e[la[maa]].to; n dep[x] = nw; n break; n } n maa = e[la[maa]].to; n } n cnt = 0; n if (dep[x] < dep[y]) n dfs(x, 0); n else n dfs(y, 0); n for (int i = 1; i <= Q; i++) printf( %d n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const int nax = 2e5 + 10; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, f; n cin >> n >> f; n vector k(n), l(n); n vector > a; n for (int i = 0; i < n; i++) { n cin >> k[i] >> l[i]; n a.push_back({min(2 * k[i], l[i]) - min(k[i], l[i]), i}); n } n sort(a.rbegin(), a.rend()); n ll ans = 0; n for (int i = 0; i < f; i++) { n ans += min(2 * k[a[i].second], l[a[i].second]); n } n for (int i = f; i < n; i++) { n ans += min(k[a[i].second], l[a[i].second]); n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 987654321; n bool adj[4010][4010]; n int n, m, u, v, cnt[4010]; n vector > node; n int main() { n scanf( %d%d , &n, &m); n node.resize(n + 1); n while (m--) { n scanf( %d%d , &u, &v); n node[u].push_back(v); n node[v].push_back(u); n adj[u][v] = adj[v][u] = true; n } n for (int i = 1; i <= n; ++i) cnt[i] = node[i].size(); n int sol = INF; n for (int i = 1; i <= n; ++i) { n for (int j = i + 1; j <= n; ++j) { n if (!adj[i][j]) continue; n for (int a = 0; a < node[i].size(); ++a) { n int k = node[i][a]; n if (!adj[k][j]) continue; n sol = min(sol, cnt[i] + cnt[j] + cnt[k] - 6); n } n } n } n printf( %d n , sol == INF ? -1 : sol); n } n "} +{"func_code_string": "#include n using namespace std; n struct wall { n double x, y; n wall() {} n wall(double x, double y) : x(x), y(y) {} n }; n struct tx { n double d; n int v; n tx() {} n tx(double d, int v) : d(d), v(v) {} n }; n bool cmp2(const tx& p1, const tx& p2) { return p1.d < p2.d; } n bool cmp(const wall& p1, const wall& p2) { return p1.x < p2.x; } n int dcmp(double x) { return fabs(x) < 1e-8 ? 0 : (x > 0 ? 1 : -1); } n wall w[2000001]; n wall ans[2000001]; n int n, m; n int f[2000001]; n double V; n tx ang[2000001]; n int main() { n scanf( %d %lf , &n, &V); n for (int i = 1; i <= n; i++) { n scanf( %lf , &ang[i].d); n ang[i].v = i; n } n scanf( %d , &m); n for (int i = 1; i <= m; i++) scanf( %lf %lf , &w[i].x, &w[i].y); n sort(w + 1, w + 1 + m, cmp); n sort(ang + 1, ang + 1 + n, cmp2); n int tp = 1; n for (int i = 1; i <= n; i++) { n int flag = 0; n if (tp > m) ans[i] = wall(V * V * sin(2 * ang[i].d) / 9.8, 0.0); n while (tp <= m) { n double tmpx = (w[tp].x * sin(2 * ang[i].d) / 2.0) - n (9.8 * w[tp].x * w[tp].x / (2.0 * V * V)); n tmpx /= cos(ang[i].d) * cos(ang[i].d); n if (tmpx <= 0.0) { n ans[i] = wall(V * V * sin(2 * ang[i].d) / 9.8, 0.0), flag = 1; n break; n } else if (!dcmp(tmpx - w[tp].y) || tmpx < w[tp].y) { n ans[i] = wall(w[tp].x, tmpx); n flag = 1; n break; n } else n tp++; n } n if (!flag) ans[i] = wall(V * V * sin(2 * ang[i].d) / 9.8, 0.0); n } n for (int i = 1; i <= n; i++) f[ang[i].v] = i; n for (int i = 1; i <= n; i++) n printf( %.9lf %.9lf n , ans[f[i]].x, ans[f[i]].y); n return 0; n } n "} +{"func_code_string": "#include n #define mset(arr, val) memset(arr, val, sizeof(arr)) n #define all(v) v.begin(), v.end() n #define F first n #define S second n #define endl n n using namespace std; n // const double PI = acos(-1.0); n // const double E = exp(1.0); n // const double EPS = 1e-9; n const int MOD = (int)1e9 + 7; n const int N = (int)2e5; n n int main() { n #ifdef MY_LOCAL n freopen( in.txt , r , stdin); n freopen( out.txt , w , stdout); n #endif n ios_base::sync_with_stdio(false); n cin.tie(0); n n int T; n cin >> T; n for (int tc = 1; tc <= T; tc++) { n int n; n cin >> n; n vector a(n); n map mp; n cin >> a[0]; n mp[a[0]] = 0; n for (int i = 1; i < n; i++) { n cin >> a[i]; n if (a[i] != a[i - 1]) { n mp[a[i]]++; n } n } n n int ans = INT32_MAX; n for (auto x : mp) { n if (x.first != a[n - 1]) { n x.second++; n } n ans = min(ans, x.second); n } n if (ans == INT32_MAX) { n ans = 0; n } n cout << ans << endl; n } n n return 0; n }"} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e3 + 5; n vector mp[maxn]; n vector R[maxn]; n vector L[maxn]; n int ans = 0; n bool vis[maxn]; n int n, m; n struct node { n int last_L; n int last_R; n } last[maxn]; n void dfs(int now, int l, int r) { n if (now == n) { n ans = max(ans, r - l + 1); n return; n } n for (int i = 0; i < mp[now].size(); i++) { n if (vis[mp[now][i]]) continue; n int nl = max(l, L[now][i]); n int nr = min(r, R[now][i]); n vis[mp[now][i]] = 1; n if (nl <= nr && nr - nl + 1 > ans && n !(last[mp[now][i]].last_L <= nl && last[mp[now][i]].last_R >= nr)) n last[mp[now][i]].last_L = nl, last[mp[now][i]].last_R = nr, n dfs(mp[now][i], nl, nr); n vis[mp[now][i]] = 0; n } n return; n } n int main() { n ios::sync_with_stdio(0); n cin >> n >> m; n for (int i = 1; i <= m; i++) { n int a, b, l, r; n cin >> a >> b >> l >> r; n mp[a].push_back(b); n mp[b].push_back(a); n L[a].push_back(l); n L[b].push_back(l); n R[a].push_back(r); n R[b].push_back(r); n } n vis[1] = 1; n last[1].last_L = 1; n last[1].last_R = INT_MAX; n dfs(1, 1, INT_MAX); n if (!ans) n cout << Nice work, Dima! << endl; n else n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Data { n int Value, Number; n }; n bool operator<(Data A, Data B) { return A.Value < B.Value; } n int Get() { n char c; n while (c = getchar(), c < 0 || c > 9 ) n ; n int X = 0; n while (c >= 0 && c <= 9 ) { n X = X * 10 + c - 48; n c = getchar(); n } n return X; n } n void Output(int X) { n int Len = 0, Data[10]; n while (X) { n Data[Len++] = X % 10; n X /= 10; n } n if (!Len) Data[Len++] = 0; n while (Len--) putchar(Data[Len] + 48); n } n int main() { n int N = Get(); n static Data A[100000]; n for (int i = 0; i < N; i++) { n A[i].Value = Get(); n A[i].Number = i; n } n sort(A, A + N); n static int X[100000], Y[100000]; n memset(X, 0, sizeof(X)); n memset(Y, 0, sizeof(Y)); n int K = (N - 1) / 3 + 1, T = N - K * 2; n for (int i = 0; i < K; i++) { n X[A[i].Number] = A[i].Value; n Y[A[i + K].Number] = A[i + K].Value; n } n for (int i = K * 2; i < N; i++) { n X[A[i].Number] = A[i].Value - N + i; n Y[A[i].Number] = N - i; n } n printf( YES n ); n for (int i = 0; i < N; i++) { n Output(X[i]); n putchar((i + 1 == N) ? n : ); n } n for (int i = 0; i < N; i++) { n Output(Y[i]); n putchar((i + 1 == N) ? n : ); n } n return 0; n } n "} +{"func_code_string": "#include n int64_t a[400005], b[200005]; n int64_t len; n int n; n bool check(int64_t value) { n std::vector> v; n for (int i = 0; i < n; ++i) { n auto rg = std::make_pair(b[i] - value, b[i] + value); n if (rg.first < 0) { n rg.first += len; n rg.second += len; n } n v.push_back(rg); n if (rg.second < len) v.emplace_back(rg.first + len, rg.second + len); n } n std::sort(v.begin(), v.end()); n int pa = 0, pr = 0; n while (pr < (int)v.size()) { n while (pa < n * 2 && (a[pa] < v[pr].first || a[pa] > v[pr].second)) ++pa; n if (pa >= n * 2) n return false; n else { n ++pa; n ++pr; n } n } n return true; n } n int main(int argc, char* argv[]) { n scanf( %d%lld , &n, &len); n for (int i = 0; i < n; ++i) scanf( %lld , &a[i]); n for (int i = 0; i < n; ++i) scanf( %lld , &b[i]); n std::sort(a, a + n); n for (int i = 0; i < n; ++i) a[n + i] = a[i] + len; n int64_t left = 0, right = len; n int64_t ans = 0; n while (right >= left) { n int64_t mid = (left + right) / 2; n if (check(mid)) { n ans = mid; n right = mid - 1; n } else n left = mid + 1; n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1000000007; n inline int add(int a, int b) { n if ((a += b) >= mod) a -= mod; n return a; n } n inline int mult(int a, int b) { n long long t = 1ll * a * b; n if (t >= mod) t %= mod; n return t; n } n inline int dec(int a, int b) { n if ((a -= b) < 0) a += mod; n return a; n } n int n, q, a[200010], w[200010]; n inline int lowbit(int x) { return x & (-x); } n class tree1 { n public: n long long dat[200010]; n void modify(int p, int v) { n for (; p <= n; p += lowbit(p)) dat[p] += v; n } n long long query(int p) { n long long ret = 0; n for (; p; p -= lowbit(p)) ret += dat[p]; n return ret; n } n long long query(int l, int r) { return query(r) - query(l - 1); } n } T1; n class tree2 { n public: n int dat[200010]; n void modify(int p, int v) { n for (; p <= n; p += lowbit(p)) dat[p] = add(dat[p], v); n } n int query(int p) { n int ret = 0; n for (; p; p -= lowbit(p)) ret = add(ret, dat[p]); n return ret; n } n int query(int l, int r) { return dec(query(r), query(l - 1)); } n } T2; n int x, y; n int main() { n scanf( %d%d , &n, &q); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n for (int i = 1; i <= n; i++) { n scanf( %d , &w[i]); n T1.modify(i, w[i]); n T2.modify(i, mult(w[i], a[i] - i)); n } n while (q--) { n scanf( %d%d , &x, &y); n if (x < 0) { n x = -x; n T1.modify(x, y - w[x]); n T2.modify(x, mult(dec(y, w[x]), a[x] - x)); n w[x] = y; n } else { n if (x == y) { n puts( 0 ); n continue; n } n int L = x, R = y, pos = L; n while (L <= R) { n int mid = (L + R) >> 1; n if (T1.query(x, mid) >= T1.query(mid + 1, y)) n pos = mid, R = mid - 1; n else n L = mid + 1; n } n printf( %d n , add(dec(mult(a[pos] - pos, T1.query(x, pos) % mod), n T2.query(x, pos)), n dec(T2.query(pos, y), n mult(a[pos] - pos, T1.query(pos, y) % mod)))); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int main() { n cin >> n; n int a[n]; n for (int i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n bool b = false; n for (int i = 2; i < n; i++) { n if (a[i - 2] + a[i - 1] > a[i] && a[i] + a[i - 1] > a[i - 2] && n a[i - 2] + a[i] > a[i - 1]) { n b = true; n break; n } n } n cout << (b ? YES : NO ) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int nCase; n scanf( %d , &nCase); n while (nCase--) { n int a, b; n scanf( %d%d , &a, &b); n if (a == 0) { n if (b == 0) n printf( 1 n ); n else n printf( 0.5 n ); n continue; n } n if (b == 0) { n printf( 1 n ); n continue; n } n b *= 4; n if (a >= b) n printf( %.6f n , (0.5 * (a - b + a) * b + 1.0 * a * b) / (2.0 * b * a)); n else n printf( %.6f n , (1.0 * a * b + 0.5 * a * a) / (2.0 * b * a)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void faster() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n } n const int MAXN = 2e5 + 1; n const long long INF = 1e18; n const long long MOD = 1e9 + 7; n const long double PI = acos(-1); n long long n, a[MAXN], dp[MAXN], d[MAXN], cnt[MAXN], ans; n vector> g[MAXN]; n bool is_lucky(int x) { n bool res = 1; n while (x) { n res &= (((x % 10) == 7) | ((x % 10) == 4)); n x /= 10; n } n return res; n } n void dfs(int v, int pr = 0) { n cnt[v] = 1; n for (pair x : g[v]) { n int to = x.first, cost = x.second; n if (to == pr) continue; n dfs(to, v); n cnt[v] += cnt[to]; n if (cost) n d[v] += cnt[to]; n else n d[v] += d[to]; n } n } n void dfs_a(int v, int pr, long long res) { n ans += (res * (res - 1)); n for (pair x : g[v]) { n int to = x.first, cost = x.second; n if (pr == to) continue; n if (cost) n dfs_a(to, v, d[to] + (cnt[1] - cnt[to])); n else n dfs_a(to, v, res); n } n } n int main() { n faster(); n cin >> n; n for (int i = 1, v, u, w; i < n; ++i) { n cin >> u >> v >> w; n w = is_lucky(w); n g[u].push_back({v, w}); n g[v].push_back({u, w}); n } n dfs(1); n dfs_a(1, 0, d[1]); n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int powmod(int x, int y, int p) { n int res = 1; n x = x % p; n if (x == 0) return 0; n while (y > 0) { n if (y % 2 == 1) res = (res * x) % p; n y /= 2; n x = (x * x) % p; n } n return res; n } n string dectobin(int x) { n string s = ; n while (x > 0) { n int t = x % 2; n s.push_back(t + 0 ); n x /= 2; n } n reverse(s.begin(), s.end()); n if (s.compare( ) == 0) n return 0 ; n else n return s; n } n int long long bintodec(string s) { n int long long ans = 0; n int long long n = s.size(); n for (int long long i = n - 1; i >= 0; i--) { n if (s[i] == 1 ) ans += pow(2, n - i - 1); n } n return ans; n } n int find(int k, int n) { return ((n & (1 << (k - 1))) >> (k - 1)); } n int long long f[100000 + 1]; n int32_t main() { n f[0] = 1; n f[1] = 1; n for (int i = 2; i <= 100000; i++) { n f[i] = ((i << 1) - 1ll) * f[i - 1] % 1000000007 * (i << 1) % 1000000007; n } n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int t; n cin >> t; n while (t--) { n int long long n; n cin >> n; n cout << f[n] << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long a[5]; n char x[4]; n long long res = 1e14; n inline long long calc(long long x, long long y, char xx) { n if (xx == * ) return x * y; n return x + y; n } n int main() { n register int i, j; n for (i = 1; i <= 4; i++) cin >> a[i]; n for (i = 1; i <= 3; i++) cin >> x[i]; n int f[5] = {0, 1, 2, 3, 4}; n do { n long long A = calc(a[f[1]], a[f[2]], x[1]); n long long B = calc(A, a[f[3]], x[2]); n long long T1 = calc(B, a[f[4]], x[3]); n A = calc(a[f[1]], a[f[2]], x[1]); n B = calc(a[f[3]], a[f[4]], x[2]); n long long T2 = calc(A, B, x[3]); n res = min(res, min(T1, T2)); n } while (next_permutation(f + 1, f + 5)); n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int i; n string b, a; n cin >> b; n int size = b.size(); n for (i = 0; i <= size - 1; i++) { n a += b[i]; n i++; n } n a += b[size - 1]; n cout << a << n ; n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n string s; n getline(cin, s); n int _t = stoi(s); n while (_t--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 1e6 + 7; n int main() { n long long n; n cin >> n; n for (long long a = 0; a < n / 1234567 + 1; a++) n for (long long b = 0; b < n / 123456 + 1; b++) { n long long c = n - a * 1234567 - b * 123456; n if (c >= 0 && c % 1234 == 0) { n cout << YES << endl; n return 0; n } n } n cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector g[100005]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, k, x, y; n cin >> n >> k; n for (int i = 0; i < n - 1; ++i) { n cin >> x >> y; n g[x].push_back(y); n g[y].push_back(x); n } n int kol = 0; n for (int i = 1; i <= n; ++i) { n if ((int)g[i].size() == 1) kol++; n } n cout << fixed << setprecision(7) << k / (double)(kol)*2 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100005, mod = 1e9 + 7; n inline int Add(int x, int y) { return (x += y) >= mod ? x - mod : x; } n int n, cnt[maxn], vec[maxn], tot; n int main() { n scanf( %d , &n); n cnt[0] = 1; n for (int i = 1, x; i <= n; ++i) { n scanf( %d , &x), tot = 0; n for (int j = 1; j * j <= x; ++j) { n if (x % j == 0) { n vec[++tot] = j; n if (j * j != x && x / j <= n) n cnt[x / j] = Add(cnt[x / j], cnt[x / j - 1]); n } n } n for (int j = tot; j; --j) n if (vec[j] <= n) cnt[vec[j]] = Add(cnt[vec[j]], cnt[vec[j] - 1]); n } n int ans = 0; n for (int i = 1; i <= n; ++i) ans = Add(ans, cnt[i]); n printf( %d n , ans); n } n "} +{"func_code_string": "#include n int main() { n int i = 1, n, m; n scanf( %d%d , &n, &m); n while (1) { n if (m < i) break; n m -= i; n i = i % n + 1; n } n printf( %d n , m); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n long long int n, x; n cin >> n >> x; n long long int a[n]; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n sort(a, a + n); n int j = 1, teams = 0; n for (int i = n - 1; i >= 0; i--) { n if (a[i] * j >= x) { n teams++; n j = 0; n } n j++; n } n cout << teams << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 1; n const long long LIMIT = 2e18 + 1; n int n; n long long k; n long long arr[N]; n long long cnt[N]; n bool isUnsafe(long long a, long long b) { n return a > LIMIT / b || b > LIMIT / a; n } n int solve(int i) { n int res = 0; n long long s, p; n if (arr[i] != 1) { n s = k * arr[i]; n p = arr[i]; n res += (s == p); n } else { n s = k * cnt[i]; n p = 1; n res += (k == 1); n } n for (++i; i < n; ++i) { n if (arr[i] == 1) { n long long sOld = s; n s += k * cnt[i]; n if (sOld < p && s >= p && (p - sOld) % k == 0) { n ++res; n } n } else { n if (isUnsafe(p, arr[i])) { n break; n } n p *= arr[i]; n s += k * arr[i]; n if (s == p) { n ++res; n } n } n } n return res; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> k; n for (int i = 0; i < n; ++i) { n cin >> arr[i]; n if (i > 0 && arr[i] == 1 && arr[i - 1] == 1) { n --i; n --n; n } n ++cnt[i]; n } n long long res = 0; n for (int i = 0; i < n; ++i) { n res += solve(i); n if (arr[i] == 1) { n --cnt[i]; n if (cnt[i]) { n --i; n } n } n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n const long double pi = acos(-1.0); n const long double eps = 1e-9; n const int MAX_SIZE = 50; n const int dX[] = {-1, 1, 0, 0, -1, 1, -1, 1}; n const int dY[] = {0, 0, -1, 1, 1, -1, -1, 1}; n template n ostream& operator<<(ostream& o, const pair& a) { n o << a.first << << a.second; n return o; n } n template n ostream& operator<<(ostream& o, const map& a) { n for (typeof((a).begin()) it = (a).begin(); it != (a).end(); it++) n o << (*it) << n ; n return o; n } n template n ostream& operator<<(ostream& o, const vector& a) { n for (typeof((a).begin()) it = (a).begin(); it != (a).end(); it++) n o << *it << ; n return o; n } n template n ostream& operator<<(ostream& o, const vector >& a) { n for (typeof((a).begin()) it = (a).begin(); it != (a).end(); it++) { n o << (*it) << n ; n } n return o; n } n template n ostream& operator<<(ostream& o, const set& a) { n for (typeof((a).begin()) it = (a).begin(); it != (a).end(); it++) n o << *it << ; n return o; n } n const long long MAX = 2005; n int a[MAX][MAX]; n long long diagl[MAX * 2], diagr[MAX * 2]; n int main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n ; n int i, j, n, x1, y1, x2, y2; n long long val, max1 = 0, max2 = 0; n scanf( %d , &n); n for (i = (0); (((1) > 0) - ((1) < 0)) * i < (((1) > 0) - ((1) < 0)) * (n); n i += (1)) { n for (j = (0); (((1) > 0) - ((1) < 0)) * j < (((1) > 0) - ((1) < 0)) * (n); n j += (1)) { n scanf( %d , &a[i][j]); n diagl[i + j] += a[i][j]; n diagr[n - (i - j) - 1] += a[i][j]; n } n } n for (i = (0); (((1) > 0) - ((1) < 0)) * i < (((1) > 0) - ((1) < 0)) * (n); n i += (1)) { n for (j = ((i % 2)); n (((2) > 0) - ((2) < 0)) * j < (((2) > 0) - ((2) < 0)) * (n); n j += (2)) { n val = diagl[i + j] + diagr[n - (i - j) - 1] - a[i][j]; n if (val >= max1) { n max1 = val; n x1 = i + 1; n y1 = j + 1; n } n } n for (j = ((1 - (i % 2))); n (((2) > 0) - ((2) < 0)) * j < (((2) > 0) - ((2) < 0)) * (n); n j += (2)) { n val = diagl[i + j] + diagr[n - (i - j) - 1] - a[i][j]; n if (val >= max2) { n max2 = val; n x2 = i + 1; n y2 = j + 1; n } n } n } n printf( %I64 d n%d %d %d %d , max1 + max2, x1, y1, x2, y2); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 260; n const int MOD = 1000000000 + 7; n int n, m, t; n int mid; n int v[N], mod[N]; n bool g[10][N]; n long long ans, f[10]; n inline void Dfs(int k, int d) { n ans += f[d]; n if (ans > MOD) ans -= MOD; n if (d > 5) return; n for (int i = k; i <= mid; i++) n if (v[i] && !g[d][i] && !g[d][m - i]) { n if (d < 5) { n for (int j = 0; j < m; j++) g[d + 1][j] = g[d][j]; n for (int j = 0; j < m; j++) n if (g[d][j]) g[d + 1][mod[j + i]] = g[d + 1][mod[j + m - i]] = 1; n } n f[d + 1] = (f[d] * v[i]) % MOD; n Dfs(i + 1, d + 1); n } n } n int main() { n int x; n for (scanf( %d %d %d , &n, &m, &t); t--; v[((x) < (m - x) ? (x) : (m - x))]++) n scanf( %d , &x), x %= m; n mid = m / 2; n for (int i = 0; i <= 2 * m; i++) mod[i] = i % m; n f[0] = 1; n g[0][0] = 1; n Dfs(1, 0); n printf( %d n , (int)ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, h, l, r; n int a[2000 + 5], dp[2000 + 5][2000 + 5]; n int solve(int curr, int idx) { n if (idx == n) { n if (l <= curr && curr <= r) n return 1; n else n return 0; n } n if (dp[curr][idx] != -1) return dp[curr][idx]; n int p1 = 0, p2 = 0; n if (l <= curr && curr <= r) { n p1 = 1; n p2 = 1; n } n p1 += solve((curr + a[idx]) % h, idx + 1); n p2 += solve((curr + a[idx] - 1) % h, idx + 1); n return dp[curr][idx] = max(p1, p2); n } n int main(int argc, const char* argv[]) { n scanf( %d %d %d %d , &n, &h, &l, &r); n for (int i = 0; i < n; i++) scanf( %d , &a[i]); n for (int i = 0; i <= h; i++) { n for (int j = 0; j <= n; j++) { n dp[i][j] = -1; n } n } n int k = solve(a[0], 1); n for (int i = 0; i <= h; i++) { n for (int j = 0; j <= n; j++) { n dp[i][j] = -1; n } n } n k = max(k, solve(a[0] - 1, 1)); n printf( %d n , k); n return 0; n } n "} +{"func_code_string": "#include n const int maxn = 1e6 + 10; n const int maxm = 1e5 + 10; n const long long int mod = 1e9 + 7; n const long long int INF = 1e18 + 100; n const int inf = 0x3f3f3f3f; n const double pi = acos(-1.0); n const double eps = 1e-8; n using namespace std; n int n, m; n int cas, tol, T; n struct Sam { n int node[maxn << 1][27], step[maxn << 1], fa[maxn << 1]; n int dp[maxn << 1], tax[maxn << 1], gid[maxn << 1]; n int vis[maxn << 1]; n int last, sz; n int newnode() { n memset(node[++sz], 0, sizeof node[++sz]); n dp[sz] = step[sz] = fa[sz] = 0; n return sz; n } n void init() { n sz = 0; n last = newnode(); n } n void insert(int k) { n int p = last, np = last = newnode(); n dp[np] = 1; n step[np] = step[p] + 1; n for (; p && !node[p][k]; p = fa[p]) node[p][k] = np; n if (p == 0) { n fa[np] = 1; n } else { n int q = node[p][k]; n if (step[q] == step[p] + 1) { n fa[np] = q; n } else { n int nq = newnode(); n memcpy(node[nq], node[q], sizeof(node[q])); n fa[nq] = fa[q]; n step[nq] = step[p] + 1; n fa[np] = fa[q] = nq; n for (; p && node[p][k] == q; p = fa[p]) node[p][k] = nq; n } n } n } n void handle() { n for (int i = 0; i <= sz; i++) tax[i] = 0; n for (int i = 1; i <= sz; i++) tax[step[i]]++; n for (int i = 1; i <= sz; i++) tax[i] += tax[i - 1]; n for (int i = 1; i <= sz; i++) gid[tax[step[i]]--] = i; n for (int i = sz; i >= 1; i--) { n int u = gid[i]; n dp[fa[u]] += dp[u]; n } n } n int solve(char *s, int len, int id) { n int p = 1, res = 0; n int ans = 0; n for (int i = 1; i <= len + len; i++) { n int k = s[i] - a + 1; n while (p && !node[p][k]) { n p = fa[p]; n res = step[p]; n } n if (p == 0) { n p = 1; n res = 0; n } else { n p = node[p][k]; n res++; n if (res >= len) { n int tmp = p; n while (tmp && vis[tmp] != id && n !(step[fa[tmp]] + 1 <= len && len <= step[tmp])) { n vis[tmp] = id; n tmp = fa[tmp]; n } n if (vis[tmp] != id) { n vis[tmp] = id; n ans += dp[tmp]; n } n } n } n } n return ans; n } n } sam; n char s[maxn], t[maxn << 1]; n int main() { n scanf( %s , s + 1); n int slen = strlen(s + 1); n sam.init(); n for (int i = 1; i <= slen; i++) { n sam.insert(s[i] - a + 1); n } n sam.handle(); n scanf( %d , &T); n for (int tt = 1; tt <= T; tt++) { n scanf( %s , t + 1); n int tlen = strlen(t + 1); n for (int i = 1; i <= tlen; i++) { n t[i + tlen] = t[i]; n } n t[tlen + tlen + 1] = 0 ; n int ans = sam.solve(t, tlen, tt); n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n string tostring(T x) { n ostringstream out; n out << x; n return out.str(); n } n long long toint(string s) { n istringstream in(s); n long long x; n in >> x; n return x; n } n int main() { n int n, x, tmp; n cin >> n >> x; n int ans = 0, zero = 0; n for (int i = 0; i < n; i++) { n cin >> tmp; n ans += tmp; n } n if (ans == 0) { n cout << 0 << endl; n } else { n ans = ((ans < 0) ? -(ans) : (ans)); n if (ans % x == 0) { n cout << ans / x << endl; n } else { n cout << ans / x + 1 << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void past_code(); n vector v[100005]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int x, y, j, k; n cin >> x; n for (int i = 1; i <= 2 * x; i++) { n cin >> y; n v[y].push_back(i); n } n long long sum = 0; n j = 1; n k = 1; n for (int i = 1; i <= x; i++) { n sum += abs(j - v[i][0]) + abs(k - v[i][1]); n j = v[i][0]; n k = v[i][1]; n } n cout << sum << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n = 0, s = 0, d = 0; n map > graph; n map vis; n bool stop = false; n void Dfs(int m) { n if (m == d || stop) { n cout << m; n stop = true; n return; n } n cout << m << ; n for (int i = 0; i < (int)graph[m].size(); i++) { n if (vis.find(graph[m][i]) == vis.end()) { n vis[graph[m][i]] = true; n Dfs(graph[m][i]); n } n } n } n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n cin >> s >> d; n graph[s].push_back(d); n graph[d].push_back(s); n } n vector k; n for (map >::iterator it = graph.begin(); it != graph.end(); n it++) { n if ((*it).second.size() == 1) { n k.push_back((*it).first); n } n } n s = k[0], d = k[1]; n vis[s] = true; n Dfs(s); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 rnd(51); n const long long INF = 1e18; n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n long long t; n cin >> t; n while (t--) { n long long n, m; n cin >> n >> m; n vector> a(n, vector(m)), n pr(n, vector(m)); n vector> mn(m, vector(m, INF)); n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < m; j++) { n char c; n cin >> c; n a[i][j] = c - 0 ; n pr[i][j] = a[i][j] + (j > 0 ? pr[i][j - 1] : 0); n } n } n long long anss = 1e18; n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < m; j++) { n for (long long jj = j; jj < m; jj++) { n if (jj - j + 1 >= 4) { n if (i > 0) n mn[j][jj] += (a[i - 1][j] ^ 1) + (a[i - 1][jj] ^ 1) + n (pr[i - 1][jj - 1] - pr[i - 1][j]); n if (i - 4 >= 0) { n long long add = 0; n for (long long f = i - 3; f < i; f++) { n add += n (a[f][j] ^ 1) + (a[f][jj] ^ 1) + (pr[f][jj - 1] - pr[f][j]); n } n mn[j][jj] = n min(mn[j][jj], n (jj - j - 1) - (pr[i - 4][jj - 1] - pr[i - 4][j]) + add); n } n anss = min(anss, n mn[j][jj] + (jj - j - 1) - (pr[i][jj - 1] - pr[i][j])); n } n } n } n } n cout << anss << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 1e6 + 7; n inline long long stoll(char* s, const long long& p, bool f = 0) { n long long a = 0; n bool fl = 0; n for (; *s; ++s) a = a * 10 + *s - 48, fl |= (f && a >= p), a %= p; n return a + fl * p; n } n long long b, n, p, phi; n char B[M], N[M]; n inline long long fp(long long x, long long k, const long long& p) { n long long r = 1; n for (; k; k >>= 1, x = x * x % p) n if (k & 1) r = r * x % p; n return r; n } n inline long long getphi(long long n) { n long long r = n, nn = n; n for (long long i = 2; i * i <= nn; ++i) n if (!(n % i)) n for (r = r / i * (i - 1); !(n % i); n /= i) n ; n if (n > 1) r = r / n * (n - 1); n return r; n } n inline long long mod(long long x, long long p) { n return x < p ? x : x % p + p; n }; n inline char* N_1() { n register int s = strlen(N) - 1; n for (; s >= 0 && !N[s]; --s) n ; n --N[s]; n return N; n } n int main() { n ios::sync_with_stdio(0), cin.tie(0); n cin >> B >> N >> p; n phi = getphi(p); n b = stoll(B, p), n = stoll(N_1(), phi, 1); n long long ans = ((b - 1) * fp(b, n, p) + p) % p; n if (!(ans)) ans = p; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, d; n pair friendlist[100001]; n scanf( %d%d , &n, &d); n for (int i = 0; i < n; i++) n scanf( %d%d , &((friendlist + i)->first), &((friendlist + i)->second)); n sort(friendlist, friendlist + n); n int it_left = 0; n int it_right = 0; n long long maxfriendship = 0; n long long friendship = 0; n while (true) { n while (it_right < n && n friendlist[it_right].first - friendlist[it_left].first < d) { n friendship += friendlist[it_right].second; n maxfriendship = max(maxfriendship, friendship); n it_right++; n } n if (it_right >= n) break; n while (friendlist[it_right].first - friendlist[it_left].first >= d) { n friendship -= friendlist[it_left].second; n it_left++; n } n } n cout << maxfriendship; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 100 * 1000 + 7, MAX_LOG = 20; n int n, m; n vector adj[MAXN]; n bool isPassed[MAXN]; n int par[MAXN][MAX_LOG], cycleCnt[MAXN], h[MAXN]; n void pre(int root) { n isPassed[root] = true; n for (auto nei : adj[root]) { n if (!isPassed[nei]) { n par[nei][0] = root; n h[nei] = h[root] + 1; n pre(nei); n cycleCnt[root] = cycleCnt[root] + cycleCnt[nei]; n } else if (par[root][0] != nei and h[nei] < h[root]) { n cycleCnt[nei]--; n cycleCnt[root]++; n } n } n return; n } n int nanCyCnt[MAXN][MAX_LOG]; n void dfs(int root, int lstRt) { n par[root][0] = lstRt; n if (lstRt != -1 and cycleCnt[root] == 0) nanCyCnt[root][0] = 1; n for (int i = 1; i < MAX_LOG and h[root] >= (1 << i) and n par[par[root][i - 1]][i - 1] != -1; n ++i) { n par[root][i] = par[par[root][i - 1]][i - 1]; n nanCyCnt[root][i] = n nanCyCnt[root][i - 1] + nanCyCnt[par[root][i - 1]][i - 1]; n } n isPassed[root] = true; n for (auto nei : adj[root]) { n if (!isPassed[nei]) { n h[nei] = h[root] + 1; n dfs(nei, root); n } n } n return; n } n int lca(int v, int u) { n int nancy = 0; n if (h[v] > h[u]) swap(v, u); n for (int i = 0; h[v] ^ h[u]; ++i) { n if ((h[u] - h[v]) & (1 << i)) { n nancy += nanCyCnt[u][i]; n u = par[u][i]; n } n } n if (v == u) return nancy; n for (int i = MAX_LOG - 1; i >= 0; --i) { n if (par[v][i] != par[u][i]) { n nancy += (nanCyCnt[v][i] + nanCyCnt[u][i]); n v = par[v][i], u = par[u][i]; n } n } n return nancy + nanCyCnt[v][0] + nanCyCnt[u][0]; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n memset(par, -1, sizeof par); n cin >> n >> m; n for (int i = 0; i < m; ++i) { n int v, u; n cin >> v >> u, v--, u--; n adj[v].push_back(u); n adj[u].push_back(v); n } n memset(isPassed, 0, sizeof isPassed); n pre(0); n memset(isPassed, 0, sizeof isPassed); n memset(h, 0, sizeof h); n dfs(0, -1); n int mercsNum; n cin >> mercsNum; n while (mercsNum--) { n int sh, wa; n cin >> wa >> sh, wa--, sh--; n cout << lca(wa, sh) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n int a[200003], b[200003], f[200003]; n int main() { n int n, m, q; n scanf( %d%d%d , &n, &m, &q); n int i, l, h; n for (i = 0; i < n; i++) { n scanf( %d%d , &l, &h); n a[l]++; n a[h + 1]--; n } n int sum = 0, co = 0; n for (i = 0; i <= 200000; i++) { n if (a[i] != 0) sum += a[i]; n a[i] = sum; n if (a[i] >= m) { n co++; n f[i] = 1; n } n b[i] = co; n } n for (i = 0; i < q; i++) { n scanf( %d%d , &l, &h); n if (f[l] == 1) n printf( %d n , b[h] - b[l] + 1); n else n printf( %d n , b[h] - b[l]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline bool isPrime(uint64_t n) { n if (n == 1) return false; n if (n == 2) return true; n if (n % 2 == 0) return false; n for (uint64_t div = 3; div * div <= n; div += 2) n if (n % div == 0) return false; n return true; n } n inline std::vector generatePrimesUntil(uint64_t upperBound) { n if (upperBound < 2) return {}; n std::vector result = {2}; n for (uint64_t candidate = 3; candidate <= upperBound; candidate += 2) { n bool divisibleByPrevious = false; n for (size_t divisorIndex = 1; n divisorIndex < result.size() && n result[divisorIndex] * result[divisorIndex] <= candidate; n ++divisorIndex) { n if (candidate % result[divisorIndex] == 0) { n divisibleByPrevious = true; n break; n } n } n if (!divisibleByPrevious) result.push_back(candidate); n } n return result; n } n inline std::vector> decomposeToPrimePowers( n uint64_t n) { n std::vector> result; n auto tryPrime = [&](uint64_t p) { n if (n % p == 0) { n result.push_back({p, 0}); n while (n % p == 0) { n n /= p; n result.back().second++; n } n } n }; n tryPrime(2); n for (uint64_t primeCandidate = 3; primeCandidate * primeCandidate <= n; n primeCandidate += 2) n tryPrime(primeCandidate); n if (n > 1) result.push_back({n, 1}); n return result; n } n template n void printVector(const std::vector& out, std::string delimiter = ) { n if (out.empty()) return; n for (size_t i = 0; i < out.size() - 1; ++i) std::cout << out[i] << delimiter; n std::cout << out.back(); n } n class Solver576A { n public: n void run(); n }; n void Solver576A::run() { n int n; n cin >> n; n auto primes = generatePrimesUntil(n); n vector ans; n for (auto p : primes) n for (int pp = p; pp <= n; pp *= p) ans.push_back(pp); n cout << ans.size() << n ; n printVector(ans); n } n using CurrentSolver = Solver576A; n int main() { n ios::sync_with_stdio(false); n CurrentSolver().run(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 1000000007, BIG = 0x3f3f3f3f; n long long p, k; n inline long long Mod(long long x, long long m) { n x %= m; n if (x < 0) x += m; n return x; n } n vector Process() { n vector ans; n while (p) { n const long long m = Mod(p, k); n ans.push_back(m); n p -= m; n p /= -k; n } n return ans; n } n void Output() { n const vector ans = Process(); n cout << ans.size() << n ; n for (int i = 0; i < ans.size(); i++) cout << ans[i] << ; n cout << n ; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n while (cin >> p) { n cin >> k; n Output(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long pow1(long long b, long long expo, long long md) { n if (!expo) return 1; n long long tmp = pow1(b, expo / 2, md); n tmp = (tmp * tmp) % md; n if (expo % 2) tmp = (tmp * b) % md; n return tmp; n } n long long w[1000005] = {}; n long long apow[1000005] = {}; n long long inv[1000005] = {}; n vector v[1000005] = {}; n long long get(long long a, long long m1, long long b, long long m2, n long long x) { n long long ret = 0; n long long first, k; n k = (a - b) * inv[m2]; n k %= m1; n k += m1; n k %= m1; n first = k * m2 + b; n first %= m1 * m2; n x -= first; n if (x >= 0) { n ret += 1 + x / (m1 * m2); n } n return ret; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cout << fixed << setprecision(15); n long long md, a, b, x, per; n long long ans = 0; n cin >> a >> b >> md >> x; n apow[0] = 1; n v[1].push_back(0); n if (a != 1) { n apow[1] = a; n v[a].push_back(1); n for (long long f = (long long)2; f <= (long long)md; ++f) { n apow[f] = a * apow[f - 1]; n apow[f] %= md; n if (apow[f] == 1) { n per = f; n break; n } n v[apow[f]].push_back(f); n } n } else { n per = 1; n } n for (long long f = (long long)1; f <= (long long)md - 1; ++f) { n inv[f] = pow1(f, md - 2, md); n } n for (long long f = (long long)1; f <= (long long)md - 1; ++f) { n w[f] = (inv[f] * b) % md; n } n for (long long f = (long long)1; f <= (long long)md - 1; ++f) { n if ((long)v[w[f]].size()) { n for (long long ff = (long long)0; n ff <= (long long)(long)v[w[f]].size() - 1; ++ff) { n ans += get(f, md, v[w[f]][ff], per, x); n } n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map x, y; n map, long long> xy; n int main() { n int n; n cin >> n; n while (n--) { n int xx, yy; n cin >> xx >> yy; n x[xx]++; n y[yy]++; n xy[make_pair(xx, yy)]++; n } n long long ans = 0; n for (auto i : x) { n ans += i.second * (i.second - 1) / 2; n } n for (auto i : y) { n ans += i.second * (i.second - 1) / 2; n } n for (auto i : xy) { n ans -= i.second * (i.second - 1) / 2; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n long long a, b, c, ans; n int main() { n cin >> a >> b >> c; n long long pom = min(a, b); n a -= pom; n b -= pom; n ans = c + pom; n ans <<= 1; n if (a or b) ans++; n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int order[10][10] = { n {99, 98, 97, 96, 95, 94, 93, 92, 91, 90}, n {80, 81, 82, 83, 84, 85, 86, 87, 88, 89}, n {79, 78, 77, 76, 75, 74, 73, 72, 71, 70}, n {60, 61, 62, 63, 64, 65, 66, 67, 68, 69}, n {59, 58, 57, 56, 55, 54, 53, 52, 51, 50}, n {40, 41, 42, 43, 44, 45, 46, 47, 48, 49}, n {39, 38, 37, 36, 35, 34, 33, 32, 31, 30}, n {20, 21, 22, 23, 24, 25, 26, 27, 28, 29}, n {19, 18, 17, 16, 15, 14, 13, 12, 11, 10}, n {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, n }; n int jmp[105]; n double dp[105]; n double dfs(int x) { n if (x == 99) { n return 0.0; n } n if (x >= 94) { n return 6.0; n } n if (dp[x] > 0) { n return dp[x]; n } n dp[x] = 0; n for (int i = 1; i <= 6; i++) { n if (jmp[x + i]) { n dp[x] += min(dfs(jmp[x + i]), dfs(x + i)); n } else { n dp[x] += dfs(x + i); n } n } n dp[x] = (dp[x] / 6.0) + 1.0; n return dp[x]; n } n int main() { n for (int i = 0; i < 10; i++) { n for (int j = 0; j < 10; j++) { n int tmp; n scanf( %d , &tmp); n if (tmp) { n jmp[order[i][j]] = order[i - tmp][j]; n } n } n } n for (int i = 0; i < 100; i++) { n dp[i] = -1; n } n printf( %.10f , dfs(0)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k; n vector v; n int main() { n if (fopen( a.txt , r )) { n freopen( a.txt , r , stdin); n } else n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n >> k; n if (k >= 1e6) { n cout << -1; n exit(0); n }; n long long temp = (k * (k + 1)) / 2; n if (k == 1) { n cout << n; n return 0; n } n if (n == 1) { n cout << -1; n exit(0); n }; n if (temp > n) { n cout << -1; n exit(0); n }; n for (long long i = 1; i * i <= n; i++) { n if (n % i != 0) continue; n v.push_back(i); n if (i * i < n) v.push_back(n / i); n } n sort(v.begin(), v.end()); n reverse(v.begin(), v.end()); n for (long long x : v) { n long long a = n / x; n if (a >= temp) { n for (int i = 1; i <= k - 1; i++) cout << i * x << , a -= i; n cout << a * x; n return 0; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n int t = 1; n if (m == 10) { n if (n == 1) { n cout << -1 ; n return 0; n } else { n cout << 1 ; n for (int i = 1; i < n; i++) { n cout << 0 ; n } n } n } else { n for (int i = 0; i < n; i++) { n cout << m; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n long long k; n int main() { n unsigned long long n, m, k; n cin >> n >> m >> k; n if (k < n) { n cout << k + 1 << << 1 << endl; n return 0; n } n k -= n; n long long row = k / (m - 1); n cout << n - row << ; n if (row % 2) n cout << m - k % (m - 1) << endl; n else n cout << k % (m - 1) + 2 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, u, v, s, to[5010], ne[5010], pre[5010], cnt, dfn[5010], low[5010], n len, f[5010], ss, q[5010], w[5010], d[5010], dis[5010]; n bool us[5010]; n void add(int u, int v) { n to[++s] = v; n ne[s] = pre[u]; n pre[u] = s; n } n void dfs(int k) { n dfn[k] = low[k] = ++cnt; n f[++len] = k; n us[k] = true; n for (int i = pre[k]; i; i = ne[i]) { n int x = to[i]; n if (!dfn[x]) { n dfs(x); n low[k] = min(low[k], low[x]); n } else if (us[x]) n low[k] = min(low[k], low[x]); n } n if (dfn[k] == low[k]) { n ss++; n while (f[len] != k) us[f[len]] = false, w[ss]++, q[f[len--]] = ss; n us[k] = false; n w[ss]++; n q[f[len--]] = ss; n } n } n int bfs(int k, int u) { n int h = 0, t = 1; n f[1] = u; n memset(dis, 0, sizeof(dis)); n while (h < t) { n int x = f[++h]; n for (int i = pre[x]; i; i = ne[i]) n if (q[to[i]] == k && !dis[to[i]]) { n int o = to[i]; n dis[o] = dis[x] + 1; n if (o == u) return dis[o]; n f[++t] = o; n } n } n } n int get(int k) { n if (w[k] == 1) return 0; n int mn = 1e9; n for (int i = 1; i <= n; i++) n if (q[i] == k) mn = min(mn, bfs(k, i)); n return 1 + 998 * mn; n } n int main() { n cin >> n >> m; n while (m--) scanf( %d%d , &u, &v), add(u, v); n for (int i = 1; i <= n; i++) n if (!dfn[i]) dfs(i); n for (int i = 1; i <= n; i++) n for (int j = pre[i]; j; j = ne[j]) n if (q[i] != q[to[j]]) d[q[i]]++; n int ans = n; n for (int i = 1; i <= ss; i++) n if (!d[i]) ans += get(i); n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int L = 2e5; n vector> g(L); n vector dp(L), d(L, 0), par(L, -1); n vector used(L); n int dist; n int ask1(int u) { n cout << d << u + 1 << endl; n int t; n cin >> t; n if (t == -1) { n while (true) { n } n } n return t; n } n int ask2(int u) { n cout << s << u + 1 << endl; n int t; n cin >> t; n --t; n if (t == -1) { n while (true) { n } n } n return t; n } n void dfs(int u) { n used[u] = true; n for (auto v : g[u]) { n if (!used[v]) { n d[v] = d[u] + 1; n par[v] = u; n dfs(v); n dp[u] += dp[v]; n } n } n if (d[u] == dist) dp[u]++; n } n int main() { n int n; n cin >> n; n for (int i = 0; i < n - 1; i++) { n int u, v; n cin >> u >> v; n --u; n --v; n g[u].push_back(v); n g[v].push_back(u); n } n dist = ask1(0); n dfs(0); n int q = 0; n if (dist == 0) { n cout << ! 1 << endl; n return 0; n } else { n while (d[q] != dist) { n int r = q; n while (d[r] != dist) { n int t = -1; n int ma = 0; n for (auto v : g[r]) { n if (d[v] > d[r]) { n if (dp[v] > ma) { n ma = dp[v]; n t = v; n } n } n } n r = t; n } n int newdist = ask1(r); n if (newdist == 0) { n cout << ! << r + 1 << endl; n return 0; n } else { n while (d[r] * 2 != 2 * dist - newdist) { n r = par[r]; n } n q = ask2(r); n } n } n cout << ! << q + 1 << endl; n return 0; n } n cin >> n; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9; n const long long LINF = 1e18; n const int MOD = 1e9 + 7; n void test() {} n const int MAX = 1 << 19; n int tree[2 * MAX], prefMax[2 * MAX]; n int killed = 0, m, n; n vector > play; n int query(int x, int y) { n int res = -1; n for (x += MAX, y += MAX; x < y; x >>= 1, y >>= 1) { n if (x & 1) res = max(tree[x++], res); n if (y & 1) res = max(tree[--y], res); n } n return res; n } n void update1(int x) { n x += MAX; n while (x) { n tree[x] = 0; n x /= 2; n } n } n void update2(int x, int val) { n x += MAX; n while (x) { n tree[x] = max(tree[x], val); n x /= 2; n } n } n bool check(int x) { n int l = -1, r = m; n int maks = query(killed, killed + x + 1); n while (l + 1 < r) { n int mid = (l + r) / 2; n if (play[mid].first >= maks) n r = mid; n else n l = mid; n } n if (r == m) return false; n if (prefMax[r] > x) n return true; n else n return false; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n cin >> n; n for (int i = 0; i <= n; i++) update1(i); n for (int i = 0; i < n; i++) { n int x; n cin >> x; n update2(i, x); n } n cin >> m; n play = vector >(m); n for (int i = 0; i < m; i++) cin >> play[i].first >> play[i].second; n sort(play.begin(), play.end()); n for (int i = m; i >= 0; i--) prefMax[i] = 0; n for (int i = m - 1; i >= 0; i--) n prefMax[i] = max(prefMax[i + 1], play[i].second); n killed = 0; n int res = 0; n bool czy = true; n while (killed < n) { n int l = -1, r = n - killed + 1; n while (l + 1 < r) { n int mid = (l + r) / 2; n if (check(mid)) n l = mid; n else n r = mid; n } n if (l == -1) { n cout << -1 << n ; n czy = false; n break; n } n killed += (l + 1); n res++; n } n if (czy) cout << res << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 6e6; n const long long inf = 1e18; n const long long maxv = 2e8 + 100; n const int miniinf = 1e9; n const long double eps = 1e-6; n const long long flowconst = 1e9; n void init() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n } n int main() { n init(); n int n; n cin >> n; n vector ans1; n vector ans2; n if (n == 1) { n cout << ? 1 1 << endl; n string ans; n cin >> ans; n cout << ! << ans << endl; n return 0; n } n map foo; n cout << ? 1 << n << endl; n for (int i = 0; i < n * (n + 1) / 2; i++) { n string x; n cin >> x; n sort(x.begin(), x.end()); n foo[x]++; n } n cout << ? 1 << n - 1 << endl; n for (int i = 0; i < (n - 1) * (n) / 2; i++) { n string x; n cin >> x; n sort(x.begin(), x.end()); n foo[x]--; n } n vector diff; n for (auto ev : foo) n if (ev.second == 1) diff.push_back(ev.first); n sort(diff.begin(), diff.end(), n [&](string &a, string &b) { return a.size() < b.size(); }); n string ans; n for (int i = 0; i < n; i++) { n vector cnt(26, 0); n for (int j = 0; j < diff[i].size(); j++) { n cnt[diff[i][j] - a ]++; n } n for (int j = 0; j < ans.size(); j++) { n cnt[ans[j] - a ]--; n } n for (int j = 0; j < 26; j++) { n if (cnt[j] > 0) { n ans += a + j; n } n } n } n reverse(ans.begin(), ans.end()); n cout << ! ; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 100; n const int M = 26; n const long long mod = 1e9 + 7; n const long long MOD = 998244353; n const int P = 1336; n const long double eps = 0.000000001; n const long long inf = 1e18 + 7; n mt19937 gen(time(0)); n vector g[N]; n int sz[N], a[N]; n int ask(int v, int u) { n cout << ? << v + 1 << << u + 1 << endl; n int c; n cin >> c; n if (c == -1) exit(0); n c--; n return c; n } n void answ(int v) { n cout << ! << v + 1 << endl; n exit(0); n } n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n for (int i = 0; i < n - 1; i++) { n int x, y; n cin >> x >> y; n x--; n y--; n g[x].push_back(y); n g[y].push_back(x); n sz[x]++; n sz[y]++; n } n for (int i = 0; i < n; i++) { n a[i] = 1; n } n int can = n / 2; n while (can--) { n int v = -1, u = -1; n for (int i = 0; i < n; i++) { n if (sz[i] == 1) { n if (v == -1) n v = i; n else if (u == -1) n u = i; n } n } n for (auto to : g[v]) { n sz[to]--; n } n for (auto to : g[u]) { n sz[to]--; n } n sz[v]--; n sz[u]--; n int c = ask(v, u); n if (c == v) answ(v); n if (c == u) answ(u); n a[v] = 0; n a[u] = 0; n } n for (int i = 0; i < n; i++) { n if (a[i]) answ(i); n } n } n "} +{"func_code_string": "#include n using namespace std; n bool changed[222222]; n pair edges[222222]; n set > adj[111111]; n bool visited[111111]; n deque > to_connect; n vector Harry; n char outbuf[12000000]; n char* out = outbuf; n int moves = 0; n void flush_harry() { n out += sprintf(out, %d , Harry.size()); n for (int v : Harry) { n out += sprintf(out, %d , v); n } n out += sprintf(out, n ); n Harry.clear(); n } n void move_stairs(int id, int u, int v) { n ++moves; n flush_harry(); n adj[edges[id].first].erase(pair(edges[id].second, id)); n adj[edges[id].second].erase(pair(edges[id].first, id)); n edges[id].first = u, edges[id].second = v; n adj[u].insert(pair(v, id)); n adj[v].insert(pair(u, id)); n out += sprintf(out, %d %d %d n , id, u, v); n changed[id] = true; n } n vector in_component; n bool dfs1(int v, int parent_edge, bool connected_to_one) { n visited[v] = true; n in_component.push_back(v); n int edge_to_move = -1; n for (auto& p : adj[v]) { n if (!connected_to_one && visited[p.first] && parent_edge != p.second) { n edge_to_move = p.second; n connected_to_one = true; n } else if (!visited[p.first]) { n connected_to_one = dfs1(p.first, p.second, connected_to_one); n } n } n if (edge_to_move != -1) { n move_stairs(edge_to_move, v, 1); n } n return connected_to_one; n } n void dfs2(int v, int parent_edge) { n if (v != 1) Harry.push_back(v); n visited[v] = true; n for (auto& p : adj[v]) n if (!visited[p.first]) { n dfs2(p.first, p.second); n Harry.push_back(v); n } n vector > to_change; n for (auto& p : adj[v]) n if (p.second != parent_edge && !to_connect.empty() && !changed[p.second]) { n to_change.push_back(pair(p.second, to_connect.back().second)); n to_connect.pop_back(); n } n for (auto& p : to_change) { n move_stairs(p.first, v, p.second); n dfs2(p.second, p.first); n Harry.push_back(v); n } n } n int main() { n int N, M; n scanf( %d%d , &N, &M); n for (int i = (0); i < (M); ++i) { n int a, b; n scanf( %d%d , &a, &b); n adj[a].insert(pair(b, i + 1)); n adj[b].insert(pair(a, i + 1)); n edges[i + 1].first = a, edges[i + 1].second = b; n } n Harry.push_back(1); n for (int i = (1); i < (N + 1); ++i) n if (!visited[i]) { n bool connected_to_one = dfs1(i, -1, i == 1); n if (!connected_to_one) { n for (int& v : in_component) n if (adj[v].size() <= 1) { n to_connect.push_back(pair(in_component.size(), v)); n break; n } n } n in_component.clear(); n } n sort(to_connect.begin(), to_connect.end()); n for (int i = (1); i < (N + 1); ++i) visited[i] = false; n dfs2(1, -1); n while (!to_connect.empty() && to_connect.back().first > 1) { n int v = to_connect.back().second; n to_connect.push_front(pair(1, v)); n to_connect.pop_back(); n pair n = *adj[v].begin(); n move_stairs(n.second, 1, n.first); n dfs2(n.first, n.second); n Harry.push_back(1); n } n flush_harry(); n if (!to_connect.empty()) { n printf( NO n ); n return 0; n } n printf( YES n%d n , moves); n printf( %s n , outbuf); n } n "} +{"func_code_string": "/* n * n * Author: Hsueh- n * Date: 2021-03-05 21:34:52 n * n * */ n n #include n n using namespace std; n n #define dbg(x...) n do { n cout << #x << -> ; n err(x); n } while (0) n void err() { cout << endl; } n template void err(const T &arg, const Ts &...args) { n cout << arg << ; n err(args...); n } n n #define endl n n #define all(A) A.begin(), A.end() n using ll = long long; n using db = double; n using pII = pair; n n const int INF = 0x3f3f3f3f; n const ll INFLL = 0x3f3f3f3f3f3f3f3f; n const int N = 2e5 + 10; n n int n, m; n int a[N]; n n void RUN() { n cin >> n >> m; n map mp; n ll sum = 0, Max = 0; n for (int i = 1; i <= n; ++i) { n cin >> a[i]; n sum += a[i]; n if (sum > Max) { n Max = sum; n mp[sum] = i; n } n } n for (int i = 1; i <= m; ++i) { n ll x; n cin >> x; n auto it = mp.lower_bound(x); n ll res = 0; n if (it == mp.end() && sum <= 0) { n res = -1; n } else if (it == mp.end()) { n auto last = mp.end(); n last--; n ll need = (x - last->first + sum - 1) / sum; n it = mp.lower_bound(x - need * sum); n res = it->second + need * n - 1; n } else { n res = it->second - 1; n } n cout << res << n [i == m]; n } n } n n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr), cout.tie(nullptr); n cout << fixed << setprecision(20); n n int T; n cin >> T; n while (T--) { n RUN(); n } n n return 0; n }"} +{"func_code_string": "#include n using namespace std; n const long long INF = (long long)2e18 + 5; n const long long MOD = (long long)1e9 + 7; n const int MAXN = 55; n long long mul(long long x, long long y) { n if (x == 0) return 0; n if (y > INF / x) return INF; n return x * y; n } n long long add(long long x, long long y) { return min(x + y, INF); } n long long n, k, cnt[MAXN], fac[MAXN], dp[MAXN][MAXN], way[MAXN]; n vector get_p(long long len, long long k) { n vector res, from(len + 1); n res.push_back(len); n for (int i = 1; i <= len; i++) { n from[i] = i; n } n for (int i = 2; i <= len; i++) { n int src = i; n while (from[src] != src) { n src = from[src]; n } n int tgt = k / fac[max(0LL, len - i - 1)]; n for (int j = 1; j <= len; j++) { n if (j != src && from[j] == j) { n if (tgt == 0) { n from[j] = i; n res.push_back(j); n break; n } else { n tgt--; n } n } n } n k %= fac[max(0LL, len - i - 1)]; n } n return res; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n fac[0] = cnt[0] = cnt[1] = 1; n for (int i = 1; i < MAXN; i++) fac[i] = mul(fac[i - 1], i); n for (int i = 2; i < MAXN; i++) cnt[i] = fac[i - 2]; n dp[0][0] = way[0] = 1; n for (int i = 1; i < MAXN; i++) { n for (int j = 1; j <= i; j++) { n for (int k = 1; k <= i; k++) { n dp[i][j] = add(dp[i][j], mul(dp[i - k][j - 1], cnt[k])); n } n way[i] = add(way[i], dp[i][j]); n } n } n int tc; n cin >> tc; n while (tc--) { n cin >> n >> k; n k--; n if (k >= way[n]) { n cout << -1 n ; n continue; n } n int put = 0; n vector ans; n while (put < n) { n long long seg, rem = n - put; n for (seg = 1; seg <= rem; seg++) { n long long tot = mul(cnt[seg], way[rem - seg]); n if (k >= tot) { n k -= tot; n } else { n break; n } n } n vector p = get_p(seg, k / way[rem - seg]); n k %= way[rem - seg]; n for (int x : p) { n ans.push_back(x + put); n } n put += seg; n } n for (int x : ans) { n cout << x << ; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 1025; n long long p[MAX_N]; n int main() { n long long s, n, sum = 0; n scanf( %lld%lld , &n, &s); n for (int i = 1; i <= n; ++i) scanf( %lld , &p[i]), sum += p[i]; n sort(p + 1, p + 1 + n); n if (sum < s) { n printf( -1 n ); n return 0; n } else { n long long tmp = 0; n for (int i = 1; i <= n; ++i) { n tmp += p[i] - p[1]; n } n if (tmp >= s) { n printf( %lld n , p[1]); n return 0; n } else { n tmp = s - tmp; n long long k = (tmp - 1) / n + 1; n printf( %lld n , p[1] - k); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int d1 = 7; n const int d2 = 29; n const int mod = 19260817; n char str[200005]; n bool h1[mod + 5], h2[mod + 5]; n int r1[200005], r2[200005]; n int kf[4][200005]; n int check[200005][2]; n int fff[200005]; n bool ban[200005]; n int main() { n int t, n; n scanf( %d , &t); n while (t--) { n int cnt[4] = {0, 0, 0, 0}; n int move[4] = {0, 0, 0, 0}; n int n, len; n scanf( %d , &n); n int p1 = 0, p2 = 0; n for (int i = 1; i <= n; i++) { n scanf( %s , str + 1); n int len = strlen(str + 1); n int type = (str[1] - 0 ) * 2 + str[len] - 0 ; n kf[type][++cnt[type]] = i; n fff[i] = type; n int a = 0, b = 0; n for (int j = 1; j <= len; j++) { n a = (a * d1 + str[j] - 5) % mod; n b = (b * d2 + str[j] - 19) % mod; n } n h1[r1[++p1] = a] = h2[r2[++p2] = b] = 1; n a = b = 0; n for (int j = len; j >= 1; j--) { n a = (a * d1 + str[j] - 5) % mod; n b = (b * d2 + str[j] - 19) % mod; n } n check[i][0] = a; n check[i][1] = b; n } n for (int i = 1; i <= n; i++) n if (h1[check[i][0]] && h2[check[i][1]]) n ban[i] = 1; n else n move[fff[i]]++; n if (cnt[1] == 0 && cnt[2] == 0 && cnt[3] != 0 && cnt[0] != 0) n printf( -1 n ); n else if (cnt[1] == cnt[2]) n printf( 0 n n ); n else if (cnt[1] > cnt[2]) { n int ned = (cnt[1] - cnt[2]) / 2; n if (ned > move[1]) n printf( -1 n ); n else { n printf( %d n , ned); n for (int i = 1, ooo = 1; ooo <= ned; ooo++, i++) { n while (ban[kf[1][i]]) { n i++; n } n printf( %d , kf[1][i]); n } n printf( n ); n } n } else if (cnt[2] > cnt[1]) { n int ned = (cnt[2] - cnt[1]) / 2; n if (ned > move[2]) n printf( -1 n ); n else { n printf( %d n , ned); n for (int i = 1, ooo = 1; ooo <= ned; ooo++, i++) { n while (ban[kf[2][i]]) { n i++; n } n printf( %d , kf[2][i]); n } n printf( n ); n } n } n for (int i = 1; i <= n; i++) ban[i] = 0; n for (int i = 1; i <= p1; i++) h1[r1[i]] = 0; n for (int i = 1; i <= p2; i++) h2[r2[i]] = 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double pi = 3.1415926535897932384626433; n const long long inf = 1e18; n const long long mod = 1e9 + 7; n void solve() { n long long n; n cin >> n; n vector a(n); n vector > cnt(100001); n long long me = 0; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n cnt[a[i]].push_back(i); n me = max(me, a[i]); n } n bool ok = 1; n for (long long i = me; i >= 2; i--) { n if (cnt[i].size() > cnt[i - 1].size()) { n ok = 0; n break; n } n } n if (!ok) { n cout << -1 n ; n return; n } n vector ans(n); n long long c = 0; n for (long long i = 1; i <= me; i++) { n long long k = 1; n for (auto x : cnt[i]) { n ans[x] = k; n k++; n c = max(c, k); n } n } n cout << c - 1 << n ; n for (long long i = 0; i < n; i++) { n cout << ans[i] << ; n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long t; n t = 1; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 5e5 + 5; n const long long mod = 1e9 + 7; n void solve() { n long long n; n cin >> n; n if (n == 1) { n cout << -1 << endl; n return; n } n cout << n << << n + 1 << << n * (n + 1) << endl; n } n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); n int t; n cin >> t; n while (t--) { n int n, c0, c1, h; n cin >> n >> c0 >> c1 >> h; n string binary; n cin >> binary; n int count0 = 0, count1 = 0; n int ans = 0, arbans = 0; n for (auto i = 0; i < binary.length(); i++) { n if (binary[i] == 1 ) count1++; n if (binary[i] == 0 ) count0++; n } n arbans = count1 * c1 + count0 * c0; n if (c1 > c0 && c1 > h) { n ans = count1 * h + count0 * c0 + count1 * c0; n } else if (c1 < c0 && c0 > h) { n ans = count0 * h + count1 * c1 + count0 * c1; n } else { n ans = count0 * c0 + count1 * c1; n } n ans = (ans < arbans) ? ans : arbans; n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int mod = 1000000000 + 7; n long long int n, k, summ, tr, a[1000000], minn, maxx; n string s, s1; n map been; n int compare(const void* a, const void* b) { n return ((*(long long int*)a) - (*(long long int*)b)); n }; n int gcd(int a, int b) { n while (b != 0) { n int t = b; n b = a % b; n a = t; n } n return a; n } n int NOK(int n1, int n2) { return n1 * n2 / gcd(n1, n2); } n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n been.clear(); n maxx = a - 1; n minn = z + 1; n cin >> s; n for (int j = 0; j < s.length(); j++) { n if (been[s[j]] == 1) { n minn = -1000; n break; n } n been[s[j]] = 1; n minn = min(minn, (long long int)s[j]); n maxx = max(maxx, (long long int)s[j]); n } n if (maxx - minn + 1 != s.length()) { n cout << No << endl; n } else { n cout << Yes << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n long long t; n cin >> t; n while (t--) { n int a; n set pr; n cin >> a; n int ar[a]; n for (int i = 0; i < a; i++) { n cin >> ar[i]; n pr.insert(ar[i]); n } n cout << pr.size() << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxl = 100000; n map SG, num; n int n, x, tmp, ans = 0, prime[maxl], tot = 0; n bool notprime[maxl + 1]; n inline void init() { n notprime[1] = 1; n for (int i = 2; i <= maxl; i++) { n if (!notprime[i]) prime[++tot] = i; n for (int j = 1; j <= tot && i * prime[j] <= maxl; j++) { n notprime[i * prime[j]] = 1; n if (i % prime[j] == 0) break; n } n } n } n inline int solve(int x) { n if (x == 0) return 0; n if (SG.count(x)) return SG[x]; n map vis; n int p = x, t = 0; n while (p) { n p /= 2; n t++; n } n for (int i = 1; i <= t; i++) n vis[solve((x >> i) | (x & ((1 << (i - 1)) - 1)))] = 1; n for (int i = 0;; i++) n if (!vis[i]) return SG[x] = i; n } n int main() { n init(); n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &x); n for (int pos = 1; prime[pos] * prime[pos] <= x; pos++) { n tmp = 0; n while (x % prime[pos] == 0) { n x /= prime[pos]; n tmp++; n } n if (tmp != 0) num[prime[pos]] = num[prime[pos]] | (1 << (tmp - 1)); n } n if (x != 1) num[x] |= 1; n } n for (map::iterator it = num.begin(); it != num.end(); it++) n ans = ans ^ solve(it->second); n if (ans == 0) n puts( Arpa ); n else n puts( Mojtaba ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long pi = 1, sum = 0, n, k, a[200100], pos[200100]; n const long long inf = (long long)1e19; n int main() { n scanf( %I64d %I64d , &n, &k); n for (int i = 1; i <= n; i++) { n scanf( %I64d , &a[i]); n pos[i] = (a[i - 1] != 1 ? i - 1 : pos[i - 1]); n } n long long ans = 0; n for (long long i = 1; i <= n; i++) { n pi = sum = a[i]; n ans += (k == 1); n for (long long now = pos[i], pre = i;; pre = now, now = pos[now]) { n long long mid = pi - sum * (long long)k; n if (mid > 0 && mid % k == 0 && mid / k < pre - now) ans++; n if (!now || inf / a[now] < pi) break; n pi *= (long long)a[now]; n sum += a[now] + pre - now - 1; n ans += (pi == sum * (long long)k); n } n } n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 100005; n int n; n unordered_map bit[MAX]; n unordered_map idx; n int inf = 1000000001; n void update(int pos, int t, int val) { n for (; t < inf; t += (t & -t)) { n bit[pos][t] += val; n } n } n int get(int pos, int t) { n int ans = 0; n for (; t > 0; t -= (t & -t)) ans += bit[pos][t]; n return ans; n } n int main() { n int type, t, x; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d %d %d , &type, &t, &x); n if (!idx.count(x)) idx[x] = i; n int cur = idx[x]; n if (type == 1) { n update(idx[x], t, 1); n } n if (type == 2) { n update(idx[x], t, -1); n } n if (type == 3) { n int ans = get(idx[x], t); n printf( %d n , ans); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 100005; n vector graph[MAXN]; n int values[MAXN]; n long long dp[MAXN]; n int leftValue[MAXN]; n priority_queue, vector >, n greater > > n pq; n void dfs(int u, int prev) { n for (int v : graph[u]) { n if (v == prev || values[v] == 0) { n continue; n } n values[v]--; n dfs(v, u); n } n while (!pq.empty()) { n pq.pop(); n } n for (int v : graph[u]) { n if (v == prev) { n continue; n } n pq.push({dp[v], v}); n } n int currentLeft = values[u]; n while (!pq.empty()) { n if (pq.size() <= values[u]) { n dp[u] += pq.top().first + 1; n values[pq.top().second] = leftValue[pq.top().second]; n currentLeft--; n } n pq.pop(); n } n for (int v : graph[u]) { n if (v == prev || values[v] == 0) { n continue; n } n int pick = min(currentLeft, values[v]); n currentLeft -= pick; n values[v] -= pick; n dp[u] += 2 * pick; n } n dp[u]++; n leftValue[u] = currentLeft; n } n int main() { n cin.sync_with_stdio(false); n cin.tie(0); n int n; n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> values[i]; n } n for (int i = 1; i < n; i++) { n int in, out; n cin >> in >> out; n graph[in].push_back(out); n graph[out].push_back(in); n } n int root; n cin >> root; n dfs(root, -1); n cout << dp[root] - 1 << endl; n cin.get(); n cin.get(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long logn = 63; n const long long inf = 1e18; n void upd(long long& a, const long long& b) { a = min(a, b); } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int n; n cin >> n; n vector a(n), b(n); n for (int i = 0; i < n; i++) cin >> a[i]; n long long mx = *max_element(a.begin(), a.end()); n for (int i = 0; i < n; i++) b[i] = mx - a[i]; n vector > dp(logn, vector(n + 1, inf)); n dp[0][0] = 0; n vector s; n for (int i = 0; i < n; i++) s.push_back(i); n for (long long bit = 0; bit + 1 < logn; bit++) { n if (bit) { n vector nws; n for (int i : s) n if (!(b[i] & (1ll << (bit - 1)))) nws.push_back(i); n for (int i : s) n if (b[i] & (1ll << (bit - 1))) nws.push_back(i); n s = nws; n } n vector pf0(n + 1, 0), pf1(n + 1, 0); n for (int i = 0; i < n; i++) { n pf0[i + 1] = pf0[i], pf1[i + 1] = pf1[i]; n if (b[s[i]] & (1ll << bit)) n pf1[i + 1]++; n else n pf0[i + 1]++; n } n for (int sf = 0; sf <= n; sf++) { n int b0ones = pf1[n - sf] + (pf0[n] - pf0[n - sf]); n int b0carry = pf1[n] - pf1[n - sf]; n upd(dp[bit + 1][b0carry], dp[bit][sf] + b0ones); n int b1ones = pf0[n - sf] + (pf1[n] - pf1[n - sf]); n int b1carry = n - pf0[n - sf]; n upd(dp[bit + 1][b1carry], dp[bit][sf] + b1ones); n } n } n cout << dp[logn - 1][0] << n ; n return 0; n } n "} +{"func_code_string": "#include n struct Edge { n Edge(int _from, int _to) : from(_from), to(_to) {} n int from, to; n }; n enum GraphNodeColor { NODE_WHITE, NODE_GREY, NODE_BLACK }; n class Graph { n public: n Graph(int nodes, std::vector edges) n : neighb(nodes, std::vector()) { n node_count = nodes; n for (int i = 0; i < edges.size(); ++i) { n neighb[edges[i].from].push_back(edges[i].to); n } n } n void dfs() { n timer = 0; n components.resize(node_count, 0); n tout.assign(node_count, 0); n colors.assign(node_count, NODE_WHITE); n nodeExitOrder.clear(); n nodeExitOrder.reserve(node_count); n for (int i = 0; i < node_count; ++i) { n if (colors[i] == NODE_WHITE) { n dfs_traverse(i); n } n } n } n void count_components(const std::vector& order) { n int label = 0; n timer = 0; n components.resize(node_count, 0); n tout.assign(node_count, 0); n colors.assign(node_count, NODE_WHITE); n nodeExitOrder.clear(); n nodeExitOrder.reserve(node_count); n for (int i = 0; i < node_count; ++i) { n int v = order[i]; n if (colors[v] == NODE_WHITE) { n dfs_traverse(v, label++); n } n } n } n void dfs_traverse(int v, int label = 0) { n colors[v] = NODE_GREY; n components[v] = label; n for (int neighbor : neighb[v]) { n if (colors[neighbor] == NODE_WHITE) { n dfs_traverse(neighbor, label); n } n } n colors[v] = NODE_BLACK; n tout[v] = timer++; n nodeExitOrder.push_back(v); n } n int node_count; n int timer; n std::vector> neighb; n std::vector colors; n std::vector tout; n std::vector nodeExitOrder; n std::vector components; n }; n int powModulo(int base, int power, int modulo) { n if (power == 0) { n return 1 % modulo; n } else { n long long ans = powModulo(base, power / 2, modulo); n ans = (ans * ans) % modulo; n ans = (power % 2 == 0) ? ans : ans * base % modulo; n return ans; n } n } n int main() { n const int modulo = 1e9 + 7; n int n; n std::cin >> n; n std::vector edges, edges_tr; n edges.reserve(n); n edges_tr.reserve(n); n for (int i = 0; i < n; ++i) { n int ai; n std::cin >> ai; n edges.emplace_back(i, ai - 1); n } n Graph gr(n, edges); n gr.dfs(); n std::vector traverse_order = gr.nodeExitOrder; n std::reverse(traverse_order.begin(), traverse_order.end()); n for (int i = 0; i < n; ++i) { n edges_tr.emplace_back(edges[i].to, edges[i].from); n } n Graph gr_tr(n, edges_tr); n gr_tr.count_components(traverse_order); n std::vector comp_sizes; n comp_sizes.reserve(n); n for (int comp : gr_tr.components) { n if (comp >= comp_sizes.size()) { n comp_sizes.resize(comp + 1, 0); n } n ++comp_sizes[comp]; n } n long long ans = 1; n int rest_edges = 0; n for (int comp_size : comp_sizes) { n if (comp_size > 1) { n int tmp = powModulo(2, comp_size, modulo); n if (tmp < 2) { n tmp += modulo; n } n ans = ans * (tmp - 2) % modulo; n } else { n ++rest_edges; n } n } n ans = ans * powModulo(2, rest_edges, modulo) % modulo; n std::cout << ans << std::endl; n return 0; n } n "} +{"func_code_string": "//EK ONKAR n #include n n using namespace std; n n /******************************MACROS******************************/ n n #define int long long n #define ld long double n #define all(x) (x).begin(), (x).end() n #define rall(x) (x).rbegin(), (x).rend() n #define yes cout<< Yes n n #define no cout<< No n n #define vt vector n #define pb push_back n #define F first n #define S second n #define u_s unordered_set n #define u_m unordered_map n #define p_q priority_queue n #define m_p make_pair n n /******************************TEMPLATE******************************/ n n #define sim template < class c n #define ris return * this n #define dor > debug & operator << n #define eni(x) sim > typename n enable_if(0) x 1, debug&>::type operator<<(c i) { n sim > struct rge { c b, e; }; n sim > rge range(c i, c j) { return rge{i, j}; } n sim > auto dud(c* x) -> decltype(cerr << *x, 0); n sim > char dud(...); n struct debug { n #ifndef ONLINE_JUDGE n ~debug() { cerr << endl; } n eni(!=) cerr << boolalpha << i; ris; } n eni(==) ris << range(begin(i), end(i)); } n sim, class b dor(pair < b, c > d) { n ris << ( << d.first << , << d.second << ) ; n } n sim dor(rge d) { n *this << [ ; n for (auto it = d.b; it != d.e; ++it) n *this << , + 2 * (it == d.b) << *it; n ris << ] ; n } n #else n sim dor(const c&) { ris; } n #endif n }; n #define deb(...) [ << #__VA_ARGS__ : << (__VA_ARGS__) << ] n n /******************************ALGORITHMS******************************/ n n int __pow(int x, int y, int M) {int res = 1;while(y>0){if(y&1) res = (res*x)%M; y>>=1; x = (x*x)%M;}return res%M;} n int __pow(int x, int y) {int res = 1;while(y>0){if(y&1) res = (res*x); y>>=1; x = (x*x);}return res;} n int mi(int x, int M) {return __pow(x, M-2, M);} n int gcd(int a, int b) {if(b==0) return a; return gcd(b, a % b);} n int add(int a, int b, int M) {return (a+b) % M;} n int mul(int a, int b, int M) {return (a*b) % M;} n int sub(int a, int b, int M) {return (a-b+M) % M;} n int div(int a, int b, int M) {return (a*mi(b, M)) % M;} n void umax(int &a, int b) {a = max(a, b);} n void umin(int &a, int b) {a = min(a, b);} n n /******************************main*code******************************/ n n const int N = 5e3+2, inf = 1e18, M = 998244353; n n int Test, n, m, k, dp[N][N]; n bool ok = 1; n vt g[N]; n n void dfs(int u, int par = 0) n { n bool is_leaf = 1; n for(auto v:g[u]) if(v != par) n { n dfs(v, u); n is_leaf = 0; n } n if(is_leaf) n { n for(int j = 0; j<=k; j++) n dp[u][j] = 1; n return; n } n for(int j = 0; j<=k/2; j++) n { n dp[u][j] = 1; n for(auto v:g[u]) if(v != par) n dp[u][j] = (dp[u][j] * ((j == 0 ? 0 : dp[v][j-1]) + dp[v][k])) % M; n } n for(int j = k/2 + 1; j<=k; j++) n { n int last = 1; n int i = 1; n dp[u][j] = 0; n for(auto v:g[u]) if(v != par) n { n int tmp = last; n last = (tmp * (dp[v][k] + (j == k ? 0 : dp[v][k-j-1]))) % M; n dp[u][j] = ((tmp * (j == 1 ? dp[v][j-1] : (dp[v][j-1] - dp[v][j-2] + M) % M)) % M + (dp[u][j] * (dp[v][k] + (j == k ? 0 : dp[v][k-j-1]))) % M) % M; n i++; n } n dp[u][j] = (dp[u][j-1] + dp[u][j]) % M; n } n } n n void test_case() n { n cin >> n >> k; n g[1].pb(0); n for(int i = 1; i> u >> v; n g[u].pb(v); n g[v].pb(u); n } n dfs(1); n cout << dp[1][k] << endl; n } n n int32_t main() n { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n Test = 1; n //cin >> Test; n while(Test--) n test_case(); n #ifndef ONLINE_JUDGE n cerr << Time elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << s. << endl; n #endif n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int limit = 453; n int n, m, q, i, x, y, col; n vector > edges[100011]; n pair Q[100011]; n vector cols[100011]; n int sz[100011]; n int id_big[100011], cnt_big; n int dad[100011]; n vector who[100011]; n int big[limit + 11][100011]; n bool us[100011]; n vector appear[100011]; n int groups; n int Find(int x) { n if (dad[x] == x) return x; n dad[x] = Find(dad[x]); n return dad[x]; n } n bool Merge(int x, int y) { n x = Find(x); n y = Find(y); n if (x == y) return false; n dad[x] = y; n return true; n } n void pre() { n int i; n for (i = 1; i <= n; i++) { n dad[i] = i; n sort(cols[i].begin(), cols[i].end()); n cols[i].resize(unique(cols[i].begin(), cols[i].end()) - cols[i].begin()); n sz[i] = cols[i].size(); n if (sz[i] >= limit) id_big[i] = ++cnt_big; n } n } n void solve_color(int id) { n for (auto e : edges[id]) Merge(e.first, e.second); n for (auto e : edges[id]) { n if (!us[e.first]) who[Find(e.first)].push_back(e.first); n if (!us[e.second]) who[Find(e.second)].push_back(e.second); n us[e.first] = us[e.second] = true; n } n for (auto e : edges[id]) { n int node = e.first; n if (who[e.second].size() > 0) node = e.second; n if (who[node].size() > 0) { n groups++; n for (auto n1 : who[node]) { n appear[n1].push_back(groups); n if (sz[n1] < limit) continue; n for (auto n2 : who[node]) big[id_big[n1]][n2]++; n } n who[node].clear(); n } n } n for (auto e : edges[id]) n dad[e.first] = e.first, dad[e.second] = e.second, n us[e.first] = us[e.second] = false; n } n int main() { n scanf( %d%d , &n, &m); n for (i = 1; i <= m; i++) { n scanf( %d%d%d , &x, &y, &col); n edges[col].push_back(make_pair(x, y)); n cols[x].push_back(col); n cols[y].push_back(col); n } n pre(); n scanf( %d , &q); n for (i = 1; i <= q; i++) { n scanf( %d%d , &x, &y); n Q[i] = make_pair(x, y); n } n for (i = 1; i <= m; i++) { n if (edges[i].empty()) continue; n solve_color(i); n } n for (i = 1; i <= q; i++) { n if (sz[Q[i].first] > sz[Q[i].second]) swap(Q[i].first, Q[i].second); n if (sz[Q[i].second] < limit) { n int c0 = 0; n int c1 = 0; n int n1 = Q[i].first; n int n2 = Q[i].second; n int ans = 0; n while (c0 < appear[n1].size() && c1 < appear[n2].size()) { n if (appear[n1][c0] == appear[n2][c1]) { n ans++; n c0++; n c1++; n continue; n } n if (appear[n1][c0] < appear[n2][c1]) n c0++; n else n c1++; n } n printf( %d n , ans); n continue; n } n printf( %d n , big[id_big[Q[i].second]][Q[i].first]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, d, m, i, a, b; n cin >> n >> d >> m; n for (i = 0; i < m; i++) { n cin >> a >> b; n if ((a - b + d) * (a - b - d) <= 0 && n (a + b - d) * (a + b + d - 2 * n) <= 0) n cout << YES << endl; n else n cout << NO << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long s; n scanf( %I64d , &s); n long long d = s; n int n = 0; n while (s > 0) { n d /= 10; n d *= 10; n int a = s - d; n if (a == 4 || a == 7) { n n++; n } n s /= 10; n d = s; n } n if (n == 0) { n printf( NO ); n return 0; n } n d = n; n while (n > 0) { n d /= 10; n d *= 10; n int a = n - d; n if (a != 4 && a != 7) { n printf( NO ); n return 0; n } n n /= 10; n d = n; n } n printf( YES ); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, a, b, k; n cin >> n >> a >> b >> k; n long long int skips_left = k; n long long int win = 0; n long long int h[n]; n long long int skips_req[n]; n for (long long int m = 0; m < n; m++) { n skips_req[m] = 0; n } n for (long long int j = 0; j < n; j++) { n cin >> h[j]; n long long int rem = (h[j] % (a + b)); n if ((0 < rem) && (rem <= a)) { n skips_req[j] = 0; n } else if ((a < rem) && (rem < (a + b))) { n long long int skips; n if ((rem - a) % a == 0) { n skips_req[j] = (rem - a) / a; n } else { n skips = (rem - a) / a + 1; n skips_req[j] = skips; n } n } else if (rem == 0) { n long long int skips; n if ((b) % a == 0) { n skips_req[j] = b / a; n } else { n skips = (b / a) + 1; n skips_req[j] = skips; n } n } n } n sort(skips_req, skips_req + n); n long long int d; n d = 0; n while ((skips_left > 0) && (d < n)) { n skips_left = skips_left - skips_req[d]; n if (skips_left >= 0) { n win++; n } n d++; n } n cout << win << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 2147383647; n const double pi = 2 * acos(0.0); n const double eps = 1e-9; n struct debugger { n template n debugger& operator,(const T& v) { n cerr << v << ; n return *this; n } n } dbg; n inline long long gcd(long long a, long long b) { n a = ((a) < 0 ? -(a) : (a)); n b = ((b) < 0 ? -(b) : (b)); n while (b) { n a = a % b; n swap(a, b); n } n return a; n } n int ext_gcd(int a, int b, int& x, int& y) { n if (a == 0) { n x = 0; n y = 1; n return b; n } n int x1, y1; n int d = ext_gcd(b % a, a, x1, y1); n x = y1 - (b / a) * x1; n y = x1; n return d; n } n inline long long modInv(int a, int m) { n int x, y; n ext_gcd(a, m, x, y); n if (x < 0) x += m; n return x; n } n inline long long power(long long a, long long p) { n long long res = 1, x = a; n while (p) { n if (p & 1) res = (res * x); n x = (x * x); n p >>= 1; n } n return res; n } n inline long long bigmod(long long a, long long p, long long m) { n long long res = 1, x = a % m; n while (p) { n if (p & 1) res = (res * x) % m; n x = (x * x) % m; n p >>= 1; n } n return res; n } n vector > adj[100010]; n pair vis[100010]; n int n; n struct road { n int u, v, w; n } rdd[100010]; n pair par[100010]; n void bfs() { n pair xyz = make_pair(inf, inf); n for (int i = (1); i <= (n); ++i) vis[i] = xyz; n queue q; n q.push(1); n vis[1] = make_pair(0, 0); n while (!q.empty()) { n int s = q.front(); n q.pop(); n for (int i = (0); i <= (((int)(adj[s]).size()) - 1); ++i) { n xyz = adj[s][i]; n int t = xyz.first; n int w = 1 - xyz.second; n if (vis[t].first == inf || vis[s].first + 1 < vis[t].first) { n vis[t] = make_pair(vis[s].first + 1, vis[s].second + w); n q.push(t); n par[t] = make_pair(s, i); n } else if (vis[s].first + 1 == vis[t].first) { n if (vis[s].second + w < vis[t].second) { n vis[t].second = vis[s].second + w; n par[t] = make_pair(s, i); n } n } n } n } n } n int mark[100010]; n set > st; n int main() { n int m; n scanf( %d %d , &n, &m); n int good = 0; n for (int i = (0); i <= (m - 1); ++i) { n int u, v, w; n scanf( %d %d %d , &u, &v, &w); n rdd[i].u = u; n rdd[i].v = v; n rdd[i].w = w; n adj[u].push_back(make_pair(v, w)); n adj[v].push_back(make_pair(u, w)); n if (w == 1) good++; n } n bfs(); n pair temp; n int cur = n; n while (cur != 1) { n temp = par[cur]; n int s = temp.first; n int t = cur; n st.insert(make_pair(s, t)); n st.insert(make_pair(t, s)); n cur = s; n } n int x = vis[n].second; n int k = 2 * x + good - vis[n].first; n printf( %d n , k); n for (int i = (0); i <= (m - 1); ++i) { n int u = rdd[i].u; n int v = rdd[i].v; n int w = rdd[i].w; n if (w == 1 && st.find(make_pair(u, v)) == st.end()) { n printf( %d %d %d n , u, v, 1 - w); n } else if (w == 0 && st.find(make_pair(u, v)) != st.end()) { n printf( %d %d %d n , u, v, 1 - w); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MaxN = 400007; n const int mod = (int)1e9 + 7; n int a, b, k, t, N; n int ans, f[MaxN], s[MaxN]; n int main() { n int i, j; n scanf( %d%d%d%d , &a, &b, &k, &t); n f[2 * k * t + 1] = 1; n N = 4 * k * t + 1; n for (i = 1; i <= t + t; i++) { n for (j = 1; j <= N; j++) { n s[j] = (s[j - 1] + f[j]) % mod; n } n for (j = 1; j <= N; j++) { n f[j] = (s[min(N - 1, j + k)] - s[max(1, j - k - 1)]) % mod; n if (f[j] < 0) f[j] += mod; n } n } n ans = 0; n for (i = 2 * k * t + b - a + 2; i <= N; i++) ans = (ans + f[i]) % mod; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool DEB = 0; n void __start__() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n } n mt19937_64 rnd(time(0)); n using ll = long long; n using vi = vector; n using ld = long double; n using pii = pair; n void test_case() { n ll n, k, two, five, c = 1; n cin >> n >> k; n two = k; n five = k; n while (n % 2 == 0 && two) n /= 2, two--; n while (n % 5 == 0 && five) n /= 5, five--; n cout << n << string(k, 0 ); n } n signed main() { n __start__(); n int Q = 1; n while (Q--) test_case(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector c(n); n for (int i = 0; i < n; ++i) { n scanf( %d , &c[i]); n } n vector ans(n + 1, 0); n for (int i = 0; i < n; ++i) { n vector mx(n + 1, 0); n int p = 0; n for (int k = i; k < n; ++k) { n mx[c[k]] += 1; n if (mx[c[k]] > mx[p]) { n p = c[k]; n } else if (mx[c[k]] == mx[p]) { n p = min(p, c[k]); n } n ans[p] += 1; n } n } n for (int i = 1; i <= n; ++i) { n printf( %d , ans[i]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n long long res = 1; n long long mdl = 1000000000 + 7; n long long s1 = s.size(); n vector fibo(s1 + 1); n fibo[0] = 1; n fibo[1] = 1; n for (long long i = 0; i < s1; i++) { n if (s[i] == m || s[i] == w ) { n cout << 0 ; n return 0; n } n } n for (long long j = 1; j < s1; j++) { n long long z = 1; n while ((j < s1) && ((s[j] == s[j - 1] && s[j] == u ) || n (s[j] == s[j - 1] && s[j] == n ))) { n z++; n j++; n } n long long i = 2; n while (i <= z) { n fibo[i] = (fibo[i - 1] + fibo[i - 2]) % mdl; n i++; n } n res = (res * fibo[z]) % mdl; n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char a[5005], b[5005]; n int la, lb; n int memo[5005][5005]; n int dp(int x, int y) { n if (x == la || y == lb) n return 0; n else if (memo[x][y] != -1) { n return memo[x][y]; n } else { n int ans1 = dp(x, y + 1) % 1000000007; n int ans2 = 0; n if (a[x] == b[y]) { n ans2 = (dp(x + 1, y + 1) + 1) % 1000000007; n } n int ret = (ans1 + ans2) % 1000000007; n return memo[x][y] = ret; n } n } n int main() { n scanf( %s %s , a, b); n memset(memo, -1, sizeof(memo)); n int i; n la = strlen(a); n lb = strlen(b); n int ans = 0; n for (i = 0; i < la; i++) { n ans = (ans + dp(i, 0)) % 1000000007; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, n, s = 0, q = 0; n cin >> a >> b >> n; n for (int i = 1;; i++) { n if (n != 0) { n if (i % 2 == 1) { n if (a >= n) { n for (int j = n; j >= 1; j--) { n if (a % j == 0 && n % j == 0) { n n = n - j; n break; n } n } n } else { n for (int j = a; j >= 1; j--) { n if (a % j == 0 && n % j == 0) { n n = n - j; n break; n } n } n } n } else { n if (n >= b) { n for (int j = b; j >= 1; j--) { n if (b % j == 0 && n % j == 0) { n n = n - j; n break; n } n } n } else { n for (int j = n; j >= 1; j--) { n if (b % j == 0 && n % j == 0) { n n = n - j; n break; n } n } n } n } n } n if (n == 0) { n cout << (i + 1) % 2; n break; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1e9 + 7; n const int INF = 0x3f3f3f3f; n const int MAXN = 2005; n int n, m; n char maze[MAXN][MAXN]; n void Dfs(int x, int y) { n if (x >= n - 1 || y >= m - 1 || x < 0 || y < 0) return; n int xx, yy, s = 0; n for (int i = 0; i < 2; ++i) n for (int j = 0; j < 2; ++j) n if (maze[x + i][y + j] == * ) { n s++; n xx = x + i; n yy = y + j; n } n if (s == 1) { n maze[xx][yy] = . ; n for (int i = -1; i < 1; ++i) n for (int j = -1; j < 1; ++j) Dfs(xx + i, yy + j); n } n } n int main(int argc, char const *argv[]) { n scanf( %d %d , &n, &m); n for (int i = 0; i < n; ++i) scanf( %s , maze[i]); n for (int i = 0; i < n - 1; ++i) n for (int j = 0; j < m - 1; ++j) Dfs(i, j); n for (int i = 0; i < n; ++i) printf( %s n , maze[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector adj[200005]; n int visited[200005]; n int dfs(int u) { n visited[u] = 1; n int iscycle = ((adj[u].size() == 2) ? (1) : (0)); n for (int i = 0; i < adj[u].size(); ++i) { n if (visited[adj[u][i]] == 0 and dfs(adj[u][i]) == 0) iscycle = 0; n } n return iscycle; n } n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 0; i < m; ++i) { n int u, v; n scanf( %d%d , &u, &v); n adj[u].push_back(v); n adj[v].push_back(u); n } n for (int i = 0; i <= n; ++i) visited[i] = 0; n int ans = 0; n for (int i = 1; i <= n; ++i) n if (visited[i] == 0) ans += dfs(i); n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n long long MOD = 1e9 + 7; n long long MOD1 = 1e9 + 123; n long long MOD2 = 1e9 + 321; n vector fun(string &s) { n int i; n vector v; n for (i = 0; i + 1 < s.length(); i++) n if (s[i] != s[i + 1]) v.push_back(i + 1); n if (s[s.length() - 1] == 1 ) v.push_back(s.length()); n return v; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n long long t, a, n, q, k, i, l, m, c, u, f, j, p, r, x, y, s, b, d; n cin >> t; n while (t--) { n cin >> n; n string S, P; n cin >> S >> P; n vector v1, v2; n v1 = fun(S); n v2 = fun(P); n reverse(v2.begin(), v2.end()); n cout << v1.size() + v2.size() << ; n for (auto h : v1) cout << h << ; n for (auto h : v2) cout << h << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() {} n int main() { n long long a, b, c, d; n cin >> a >> b >> c >> d; n long long ans = 0; n long long l = max(c, a + b); n long long r = c + d + 1; n for (long long i = l; i < r; i++) { n long long che = min(i - c, d - c + 1); n long long e1 = max(0LL, i - 2 * b); n long long e2 = max(0LL, i - a - c); n long long e3 = max(0LL, i - b - c - 1); n long long e4 = (i - a - b + 1); n ans += (che * (e4 - e1 - e2 + e3)); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[1000006]; n int n, k; n int max_a; n int has[20000007]; n bool judge(int num) { n if (num == 1) return true; n int cnt = 0; n for (int i = 0; i < num * 2; i++) { n has[i] = i / num; n } n for (int i = num * 2; i <= max_a; i++) { n has[i] = has[i / 2] + has[i - i / 2]; n } n for (int i = 0; i < n; i++) { n cnt += has[a[i]]; n if (cnt >= k) { n return true; n } n } n return false; n } n int main() { n while (scanf( %d%d , &n, &k) != EOF) { n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n } n long long sum = 0; n max_a = 0; n for (int i = 0; i < n; i++) { n sum += a[i]; n if (a[i] > max_a) { n max_a = a[i]; n } n } n if (sum < k) { n printf( -1 n ); n } else { n int l = 1, r = max_a + 1; n while (l < r - 1) { n int m = (l + r) / 2; n if (judge(m)) { n l = m; n } else { n r = m; n } n } n while (judge(l)) { n l++; n } n cout << l - 1 << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, cnt; n char x[55]; n int main() { n scanf( %s , x); n n = strlen(x); n for (int i = 0; i < n; i++) cnt += x[i] == a ; n printf( %d n , min(n, cnt * 2 - 1)); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n long long int n; n cin >> n; n vector arr; n long long int num; n for (int i = 0; i < n; i++) { n cin >> num; n arr.push_back(num); n } n sort(arr.begin(), arr.end()); n long long int sum = 0; n for (int i = 0; i < n - 1; i++) { n if (arr[i] != arr[i + 1]) { n sum++; n } n } n cout << sum + 1 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int num[150000]; n void Sum(int i, int op, int n, int &sum) { n if (i != op && i > 0 && i <= n && op > 0 && op <= n) { n swap(num[i], num[op]); n if ((i & 1) && (op & 1)) { n if ((i > 1 && num[i] < num[i - 1] || i == 1) && n (i < n && num[i] < num[i + 1] || i == n) && n (op == 1 || op > 1 && num[op] < num[op - 1]) && n (op == n || op < n && num[op] < num[op + 1])) n sum++; n } else if (!(i & 1) && (op & 1)) { n if ((i > 1 && num[i] > num[i - 1] || i == 1) && n (i < n && num[i] > num[i + 1] || i == n) && n (op == 1 || op > 1 && num[op] < num[op - 1]) && n (op == n || op < n && num[op] < num[op + 1])) n sum++; n } else if ((i & 1) && !(op & 1)) { n if ((i > 1 && num[i] < num[i - 1] || i == 1) && n (i < n && num[i] < num[i + 1] || i == n) && n (op == 1 || op > 1 && num[op] > num[op - 1]) && n (op == n || op < n && num[op] > num[op + 1])) n sum++; n } else { n if ((i > 1 && num[i] > num[i - 1] || i == 1) && n (i < n && num[i] > num[i + 1] || i == n) && n (op == 1 || op > 1 && num[op] > num[op - 1]) && n (op == n || op < n && num[op] > num[op + 1])) n sum++; n } n swap(num[i], num[op]); n } n } n void Solve(int n, int minx[], int mins, int &sum) { n if (mins == 0) { n int op = minx[0]; n for (int i = 1; i <= n; i++) Sum(i, op, n, sum); n op++; n if (op <= n) { n for (int i = 1; i <= n; i++) Sum(i, op, n, sum); n } n int sum1 = sum; n Sum(minx[0], minx[0] + 1, n, sum); n if (sum1 < sum) sum -= 2; n } else if (mins == 1) { n if (minx[0] + 1 == minx[1]) { n Sum(minx[0], minx[1] + 1, n, sum); n for (int i = 1; i <= n; i++) Sum(i, minx[1], n, sum); n } else { n Sum(minx[0], minx[1], n, sum); n Sum(minx[0], minx[1] + 1, n, sum); n Sum(minx[0] + 1, minx[1], n, sum); n Sum(minx[0] + 1, minx[1] + 1, n, sum); n } n } else if (mins == 2) { n if (minx[0] + 1 == minx[1] && minx[1] + 1 == minx[2]) { n Sum(minx[0], minx[2], n, sum); n Sum(minx[1], minx[2], n, sum); n Sum(minx[1], minx[2] + 1, n, sum); n } else if (minx[0] + 1 == minx[1]) { n Sum(minx[1], minx[2], n, sum); n Sum(minx[1], minx[2] + 1, n, sum); n } else if (minx[1] + 1 == minx[2]) { n Sum(minx[0], minx[2], n, sum); n Sum(minx[0] + 1, minx[2], n, sum); n } n } else if (minx[0] + 1 == minx[1] && minx[2] + 1 == minx[3]) { n Sum(minx[1], minx[3], n, sum); n } n } n int main() { n int n; n while (~scanf( %d , &n) && n) { n int sum = 0; n for (int i = 1; i <= n; i++) scanf( %d , &num[i]); n int minx[110], mins = -1; n for (int i = 1; i <= n - 1; i++) { n if (i & 1) { n if (num[i] >= num[i + 1] && mins < 100) minx[++mins] = i; n } else { n if (num[i] <= num[i + 1] && mins < 100) minx[++mins] = i; n } n } n if (mins >= 4 || mins < 0) n printf( 0 n ); n else { n Solve(n, minx, mins, sum); n printf( %d n , sum); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const inline int __GET_INT() { n int ret; n scanf( %d , &ret); n return ret; n } n int main() { n long long A = __GET_INT(), B = __GET_INT(), n = __GET_INT(); n for (int i = 0; i < n; ++i) { n long long l = __GET_INT(), t = __GET_INT(), m = __GET_INT(); n long long first = B * (l - 1) + A; n if (first > t) { n puts( -1 ); n } else { n int r = -1; n long long low = 1, high = 1000000, mid; n while (low <= high) { n mid = (low + high) >> 1; n long long val = ((mid * (mid - 1)) / 2) * B + mid * first; n long long second = B * (l + mid - 2) + A; n if (second > t || val > (t * m)) { n high = mid - 1; n } else { n low = mid + 1; n r = l + mid - 1; n } n } n printf( %d n , r); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[1005], b[1005]; n char c[1005][1005]; n int main() { n int n, m; n cin >> n >> m; n int cnt = 0; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n cin >> c[i][j]; n if (c[i][j] == * ) { n a[i]++; n b[j]++; n cnt++; n } n } n } n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n if (c[i][j] == * ) { n if (a[i] + b[j] - 1 == cnt) return cout << YES n << i << << j, 0; n } else { n if (a[i] + b[j] == cnt) return cout << YES n << i << << j, 0; n } n } n } n cout << NO ; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, A, B, C = 1; n const long long E = 1e9 + 7; n int main() { n cin >> n; n if (n <= 1) { n cout << 0 << endl; n return 0; n } n for (long long i = 2; i < n; i++) { n A = B; n B = C; n C = 2 * B + 3 * A; n C %= E; n } n long long ans = (3 * C) % E; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 1e9 + 7; n int main() { n long long int i, t, a = 0, k, b = 0, j = 0, l = 0, n, m, r = 0, c = 0, ct = 0, n pos = 0, neg = 0, flag = 0, x, y, space, maxi, n ans = 999999, ans2 = -100, avg, sum = 0; n double d; n long long int ar1[100005] = {0}, ar2[100005] = {0}; n ios_base::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n long long int ch, temp = 0; n vector v; n string st, st2, st3; n stack s; n vector > vp; n queue > q; n cin >> n; n cout << 2 * n - 1 << << 2 << endl << 1 << << 2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n set s[300000]; n int ans[300000]; n bool vis[300000]; n int nr[500000]; n int main() { n int n, m; n scanf( %d %d , &n, &m); n priority_queue > pq; n for (int i = 0; i <= 2 * m; i++) nr[i] = -1; n for (int i = 0; i < n; i++) { n int k, x; n scanf( %d , &k); n while (k--) { n scanf( %d , &x); n nr[x + m] = i; n s[i].insert(x); n } n pq.push(make_pair(-s[i].size(), i)); n } n while (!pq.empty()) { n int k = pq.top().second; n pq.pop(); n if (vis[k]) continue; n vis[k] = true; n if (s[k].empty()) { n puts( NO ); n return 0; n } n int x = *s[k].begin(); n if (x > 0) ans[x] = 1; n if (nr[m - x] != -1) { n s[nr[m - x]].erase(-x); n pq.push(make_pair(-s[nr[m - x]].size(), nr[m - x])); n } n } n puts( YES ); n for (int i = 1; i <= m; i++) printf( %d , ans[i]); n puts( ); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n if (m == 3 && n >= 5) n cout << -1 << endl; n else { n if (m == 3 && n == 4) n puts( -1 0 n1 0 n0 2 n0 1 ); n else { n for (int i = 1; i <= m; i++) cout << i << << i * i + 343231 << endl; n n -= m; n for (int i = 1; i <= n; i++) n cout << i << << -(i * i + 343231) << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n int s[n]; n int f[10] = {0}; n for (int i = 0; i < n; i++) { n cin >> s[i]; n } n int tmp; n for (int j = 0; j < m; j++) { n cin >> tmp; n f[tmp] = 1; n } n int emp = 1; n for (int i = 0; i < n; i++) { n if (f[s[i]] == 1) { n emp = 0; n cout << s[i] << ; n } n } n if (emp == 1) cout << n ; n } n "} +{"func_code_string": "#include n const int maxn = 3e5 + 3; n int n, a[maxn], b[maxn], m, l[maxn], r[maxn]; n void solve() { n scanf( %d , &n); n m = 0; n for (int i = 0; i < n; ++i) { n scanf( %d , a + i); n b[m++] = a[i]; n } n std::sort(b, b + m); n m = std::unique(b, b + m) - b; n for (int i = 0; i < n; ++i) { n a[i] = std::lower_bound(b, b + m, a[i]) - b; n } n std::fill(l, l + m, 0x7fffffff); n std::fill(r, r + m, 0x80000000); n for (int i = 0; i < n; ++i) { n l[a[i]] = std::min(l[a[i]], i); n r[a[i]] = std::max(r[a[i]], i); n } n int ans = m - 1; n for (int i = 0, j; i < m; i = j) { n for (j = i + 1; j < m && r[j - 1] < l[j]; ++j) n ; n ans = std::min(ans, i + (m - j)); n } n printf( %d n , ans); n } n int main() { n int t; n scanf( %d , &t); n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int Q = 9, R = 5, B = 3, N = 3, P = 1, q = 9, r = 5, b = 3, n = 3, p = 1; n int sum2 = 0, Sum2 = 0; n char c[64]; n for (int i = 0; i < 64; i++) { n cin >> c[i]; n } n for (int i = 0; i < 64; i++) { n switch (c[i]) { n case q : n sum2 += q; n break; n case r : n sum2 += r; n break; n case b : n sum2 += b; n break; n case n : n sum2 += n; n break; n case p : n sum2 += p; n break; n case Q : n Sum2 += Q; n break; n case R : n Sum2 += R; n break; n case B : n Sum2 += B; n break; n case N : n Sum2 += N; n break; n case P : n Sum2 += P; n break; n } n } n if (sum2 > Sum2) n cout << Black ; n else if (sum2 < Sum2) n cout << White ; n else n cout << Draw ; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e9 + 10; n const long long MN = 5e2 + 10; n long long n, m, a[MN], b[MN]; n vector > ans; n long long lz = 0; n bool fl = false; n void fail() { n cout << NO n ; n exit(0); n } n long long get(long long l, long long r) { n long long mx = *max_element(a + l, a + r + 1); n if (a[l] == mx) { n fl = true; n long long ret = l; n for (; a[ret] == mx; ++ret) n ; n return ret - 1; n } n long long ret = l; n for (; a[ret] != mx; ++ret) n ; n return ret; n } n int32_t main() { n ios_base ::sync_with_stdio(false), cin.tie(0), cout.tie(0); n cin >> n; n for (long long i = 0; i < n; ++i) cin >> a[i]; n cin >> m; n for (long long i = 0; i < m; ++i) cin >> b[i]; n long long cur = 0; n long long p = 0; n long long lst = 0; n for (long long i = 0; i < n; ++i) { n cur += a[i]; n if (cur == b[p] && p < m) { n if (i == lst) { n ++p, cur = 0, lst = i + 1; n continue; n } n if (*max_element(a + lst, a + i + 1) == *min_element(a + lst, a + i + 1)) n fail(); n ++p; n fl = false; n long long ind = get(lst, i); n if (fl) { n for (long long j = 0; j < (i - ind); ++j) n ans.push_back(make_pair(ind - lz, R )); n for (long long j = ind - 1; j >= lst; --j) { n ans.push_back(make_pair(ind - lz, L )); n ++lz; n } n lz += (i - ind); n } else { n for (long long j = ind - 1; j >= lst; --j) { n ans.push_back(make_pair(ind - lz, L )); n ++lz; n } n for (long long j = 0; j < (i - ind); ++j) n ans.push_back(make_pair(ind - lz, R )); n lz += i - ind; n } n cur = 0; n lst = i + 1; n } n } n if (cur || p < m) fail(); n cout << YES n ; n for (auto v : ans) cout << v.first + 1 << << v.second << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int gcd(long long int a, long long int b) { n if (b == 0) return a; n return gcd(b, a % b); n } n long long int lcm(long long int a, long long int b) { n return a * b / gcd(a, b); n } n long long int fexp(long long int a, long long int b) { n long long int ans = 1; n while (b) { n if (b & 1) ans = ans * a % 998244353; n b /= 2; n a = a * a % 998244353; n } n return ans; n } n long long int inverse(long long int a, long long int p) { n return fexp(a, p - 2); n } n void solve() { n string s; n cin >> s; n long long int n = (long long int)s.size(); n long long int ans = 1e9 + 5; n set st; n long long int cnt = 0; n vector vec(4, 0); n long long int fir = s[0] - 0 , num = 0; n for (long long int i = 0; i < n; i++) { n cnt = 0; n long long int idx = s[i] - 0 ; n if (idx == fir && i != num) { n vec[fir] = 1; n st.insert(idx); n fir = s[i - 1] - 0 ; n continue; n } n st.insert(idx); n vec[idx]++; n if ((long long int)st.size() == 3) { n cnt = vec[s[i - 1] - 0 ] + 2; n ans = min(ans, cnt); n st.erase(fir); n vec[fir] = 0; n vec[s[i - 1] - 0 ] = 1; n fir = s[i - 1] - 0 ; n num = i - 1; n } n } n if (ans == 1e9 + 5) { n cout << 0 << n ; n return; n } n cout << ans << n ; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long int t; n cin >> t; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2005; n vector > v[N * N]; n bool flag[N * N], a[N][N], vis[N][N]; n pair dis[N * N]; n int id[N][N], q[N * N], ID, n, m, r, c, sx, sy, ans; n char s[N]; n void bfs(int r, int c) { n int L = 0, R = 0; n q[R++] = id[r][c]; n flag[id[r][c]] = true; n dis[id[r][c]] = make_pair(0, 0); n while (L < R) { n int u = q[L++], sz = v[u].size(); n for (int i = 0; i < sz; i++) { n int x = v[u][i].first, y = v[u][i].second; n if (y > 1 && a[x][y - 1] && !flag[id[x][y - 1]]) { n q[R++] = id[x][y - 1]; n flag[id[x][y - 1]] = true; n dis[id[x][y - 1]] = make_pair(dis[u].first + 1, dis[u].second); n } n if (y < m && a[x][y + 1] && !flag[id[x][y + 1]]) { n q[R++] = id[x][y + 1]; n flag[id[x][y + 1]] = true; n dis[id[x][y + 1]] = make_pair(dis[u].first, dis[u].second + 1); n } n } n } n } n void dfs(int x, int y, int z) { n vis[x][y] = true; n id[x][y] = z; n v[z].push_back(make_pair(x, y)); n if (x > 1 && a[x - 1][y] && !vis[x - 1][y]) dfs(x - 1, y, z); n if (x < n && a[x + 1][y] && !vis[x + 1][y]) dfs(x + 1, y, z); n } n int main() { n memset(dis, 0x3f, sizeof(dis)); n scanf( %d%d%d%d%d%d , &n, &m, &r, &c, &sx, &sy); n for (int i = 1; i <= n; i++) { n scanf( %s , s + 1); n for (int j = 1; j <= m; j++) a[i][j] = (s[j] == . ); n } n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n if (a[i][j] && !vis[i][j]) ID++, dfs(i, j, ID); n bfs(r, c); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n if (a[i][j]) { n int u = id[i][j]; n if (dis[u].first <= sx && dis[u].second <= sy) ans++; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using P = pair; n const long long MOD = 1000000007; n const long long INF = 1LL << 60; n const int INT_INF = 1000000000; n int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; n void solve() { n int n; n cin >> n; n vector a(n); n for (auto &ai : a) cin >> ai; n bool positive; n if (a[0] < 0) n positive = false; n else n positive = true; n ll sum = 0; n ll tmp = a[0]; n for (int i = 1; i < n; i++) { n if (positive) { n if (a[i] > 0) { n tmp = max(tmp, a[i]); n } else { n sum += tmp; n tmp = a[i]; n positive = false; n } n } else { n if (a[i] > 0) { n sum += tmp; n tmp = a[i]; n positive = true; n } else { n tmp = max(tmp, a[i]); n } n } n } n sum += tmp; n cout << sum << endl; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int t; n cin >> t; n for (int i = 0; i < t; i++) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int a, int b) { n if (a == 0) { n return b; n } n return gcd(b % a, a); n } n int idx[200001] = {0}; n vector g[160]; n int dp[160][100001] = {0}; n int len[160][200001] = {0}; n int nless(vector& v, int val) { n if (!(int)v.size()) return 0; n if (v[0] > val) return 0; n int l = 0, r = (int)v.size() - 1; n while (r - l + 1 > 2) { n int x = (l + r) / 2; n if (v[x] > val) { n r = x; n } else { n l = x; n } n } n if (r - l + 1 == 2) { n if (v[r] <= val) { n return r + 1; n } else { n return l + 1; n } n } n if (r - l + 1 == 1) { n return l + 1; n } n } n void solve() { n int n; n cin >> n; n vector v(n); n for (int j = 0; j < n; j++) cin >> v[j]; n int num = 1; n vector factors; n factors.push_back(1); n for (int j = 2; j <= sqrt(n); j++) { n if (n % j == 0) { n factors.push_back(j); n num++; n if (j * j != n) { n factors.push_back(n / j); n num++; n } n } n } n sort(factors.begin(), factors.end()); n for (int j = 0; j < (int)factors.size(); j++) { n idx[factors[j]] = j; n } n for (int j = 1; j < n; j++) { n g[idx[gcd(j, n)]].push_back(j); n } n for (int j = n - 1; j >= 0; j--) { n for (int i = 0; i < num; i++) { n dp[i][j % factors[i]] = max(dp[i][j % factors[i]], v[j]); n } n } n for (int j = n - 1; j >= 0; j--) { n for (int i = 0; i < num; i++) { n len[i][j] = (v[j] == dp[i][j % factors[i]]) * (1 + len[i][j + 1]); n } n } n for (int j = n - 1; j >= 0; j--) { n for (int i = 0; i < num; i++) { n len[i][j] = min( n n - 1, (v[j] == dp[i][j % factors[i]]) * (1 + len[i][(j + 1) % n])); n } n } n long long int ans = 0; n for (int j = 0; j < n; j++) { n for (int i = 0; i < num; i++) { n int cnt = nless(g[i], len[i][j]); n ans += cnt; n } n } n cout << ans << n ; n return; n } n signed main() { n ios::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n int t; n t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2 * 1000 + 5; n const long long INF = 1000ll * 1000 * 1000 * 1000 * 1000 * 1000; n int n, k, dp[maxn], a[maxn]; n bool check(long long x) { n for (int i = 1; i <= n; i++) { n dp[i] = i - 1; n for (int j = 1; j < i; j++) { n if (abs(a[i] - a[j]) <= (i - j) * x) n dp[i] = min(dp[i], dp[j] + i - j - 1); n if (dp[i] + n - i <= k) return true; n } n } n return false; n } n int main() { n cin >> n >> k; n for (int i = 1; i <= n; i++) cin >> a[i]; n if (n == 1) { n cout << 0 << endl; n return 0; n } n long long l = -1, r = INF + 1, mid; n while (r - l > 1) { n mid = (l + r) >> 1; n if (check(mid)) n r = mid; n else n l = mid; n } n cout << r << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int arr[n]; n int i = 0; n int cnt[101] = {0}; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n cnt[arr[i]]++; n } n int a = -1, b = -1; n for (int i = 0; i <= 100; i++) { n if (cnt[i] == n / 2) { n if (a == -1) n a = i; n else n b = i; n } n } n if (a != -1 && b != -1) { n cout << YES n ; n cout << a << << b; n } else n cout << NO n ; n return 0; n } n "} +{"func_code_string": "#include n const int MAXN = 2020; n int n, m; n int mp[MAXN][MAXN], realx[MAXN], realy[MAXN], cntx, cnty; n char dir[MAXN]; n int len[MAXN]; n void unique(int *real, int &cnt) { n std::sort(real, real + cnt); n int t2 = 1; n for (int t1 = 1; t1 < cnt; t1++) n if (real[t1] ^ real[t1 - 1]) real[t2++] = real[t1]; n cnt = t2; n } n inline bool legal(int x, int y) { n return x >= 0 && x <= cntx && y >= 0 && y <= cnty; n } n void dfs(int x, int y) { n mp[x][y] = -1; n if (legal(x + 1, y) && !mp[x + 1][y]) dfs(x + 1, y); n if (legal(x - 1, y) && !mp[x - 1][y]) dfs(x - 1, y); n if (legal(x, y + 1) && !mp[x][y + 1]) dfs(x, y + 1); n if (legal(x, y - 1) && !mp[x][y - 1]) dfs(x, y - 1); n } n int main() { n scanf( %d , &n); n register int nowx = 0, nowy = 0; n for (int i = 1; i <= n; i++) { n scanf( %s%d , dir + i, len + i); n switch (dir[i]) { n case L : n realx[cntx++] = nowx + 1; n realx[cntx++] = nowx -= len[i]; n realy[cnty++] = nowy; n realy[cnty++] = nowy + 1; n break; n case R : n realx[cntx++] = nowx; n realx[cntx++] = (nowx += len[i]) + 1; n realy[cnty++] = nowy; n realy[cnty++] = nowy + 1; n break; n case U : n realy[cnty++] = nowy; n realy[cnty++] = (nowy += len[i]) + 1; n realx[cntx++] = nowx; n realx[cntx++] = nowx + 1; n break; n case D : n realy[cnty++] = nowy + 1; n realy[cnty++] = nowy -= len[i]; n realx[cntx++] = nowx; n realx[cntx++] = nowx + 1; n break; n } n } n unique(realx, cntx); n unique(realy, cnty); n int curx = std::upper_bound(realx, realx + cntx, nowx = 0) - realx, n cury = std::upper_bound(realy, realy + cnty, nowy = 0) - realy, nxt; n for (int i = 1; i <= n; i++) { n switch (dir[i]) { n case L : n nxt = std::upper_bound(realx, realx + cntx, nowx -= len[i]) - realx; n while (curx > nxt) mp[curx--][cury] = 1; n break; n case R : n nxt = std::upper_bound(realx, realx + cntx, nowx += len[i]) - realx; n while (curx < nxt) mp[curx++][cury] = 1; n break; n case U : n nxt = std::upper_bound(realy, realy + cnty, nowy += len[i]) - realy; n while (cury < nxt) mp[curx][cury++] = 1; n break; n case D : n nxt = std::upper_bound(realy, realy + cnty, nowy -= len[i]) - realy; n while (cury > nxt) mp[curx][cury--] = 1; n break; n } n } n mp[curx][cury] = 1; n for (int i = 0; i <= cntx; i++) { n if (!mp[i][cnty]) dfs(i, cnty); n if (!mp[i][0]) dfs(i, 0); n } n for (int i = 1; i < cnty; i++) { n if (!mp[cntx][i]) dfs(cntx, i); n if (!mp[0][i]) dfs(0, i); n } n long long ans = 0; n for (int i = 1; i <= cntx; i++) n for (int j = 1; j <= cnty; j++) n if (~mp[i][j]) n ans += 1ll * (realx[i] - realx[i - 1]) * (realy[j] - realy[j - 1]); n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char func(char c) { n if (c >= A && c <= Z ) c = tolower(c); n if (c == o ) n c = 0 ; n else if (c == l || c == i ) n c = 1 ; n return c; n } n int main() { n string s; n int n; n cin >> s >> n; n for (int i = 0; i < n; i++) { n string str; n cin >> str; n if (str.size() != s.size()) continue; n bool ok = true; n for (int j = 0; j < s.size(); j++) { n if (func(s[j]) != func(str[j])) { n ok = false; n break; n } n } n if (ok) { n cout << No ; n return 0; n } n } n cout << Yes ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long P = (long long)1e9 + 7; n int n, k; n int a[2]; n long long c[60][60]; n long long cnt[60][60]; n int dp[60][60]; n struct rmdr { n int i, j; n bool operator<(const rmdr& a) const { n if (50 * i + 100 * j != 50 * a.i + 100 * a.j) n return 50 * i + 100 * j < 50 * a.i + 100 * a.j; n return i > a.i; n } n }; n rmdr r[100010]; n int sz = 0; n int main() { n cin >> n >> k; n a[0] = a[1] = 0; n for (int i = 0; i < int(n); ++i) { n int tmp; n cin >> tmp; n if (tmp == 50) n a[0]++; n else n a[1]++; n } n memset(c, 0, sizeof(c)); n c[0][0] = 1; n for (int i = int(1); i < int(n + 1); ++i) { n c[i][0] = 1; n for (int j = int(1); j < int(i + 1); ++j) n c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % P; n } n memset(cnt, 0, sizeof(cnt)); n for (int i = 0; i < int(a[0] + 1); ++i) n for (int j = 0; j < int(a[1] + 1); ++j) dp[i][j] = 100500; n dp[0][0] = 0; n cnt[0][0] = 1; n for (int i = 0; i < int(a[0] + 1); ++i) n for (int j = 0; j < int(a[1] + 1); ++j) { n if (i == 0 && j == 0) continue; n r[sz].i = i, r[sz].j = j; n sz++; n } n sort(r, r + sz); n for (int z = 0; z < int(sz); ++z) { n int i = r[z].i, j = r[z].j; n if (50 * i + 100 * j <= k) { n dp[i][j] = 1; n cnt[i][j] = 1; n continue; n } n for (int i1 = 0; i1 < int(i + 1); ++i1) n for (int j1 = 0; j1 < int(j + 1); ++j1) { n if (i1 == 0 && j1 == 0) continue; n if (50 * i1 + 100 * j1 > k) break; n for (int i2 = 0; i2 < int(a[0] - i + i1 + 1); ++i2) n for (int j2 = 0; j2 < int(a[1] - j + j1 + 1); ++j2) { n if (i2 == 0 && j2 == 0) continue; n if (50 * i2 + 100 * j2 > k) break; n if (dp[i][j] >= dp[i - i1 + i2][j - j1 + j2] + 2) { n long long tmp = (cnt[i - i1 + i2][j - j1 + j2] * c[i][i1]) % P; n tmp = (tmp * c[j][j1]) % P; n tmp = (tmp * c[a[0] - i + i1][i2]) % P; n tmp = (tmp * c[a[1] - j + j1][j2]) % P; n if (dp[i][j] > dp[i - i1 + i2][j - j1 + j2] + 2) { n dp[i][j] = dp[i - i1 + i2][j - j1 + j2] + 2; n cnt[i][j] = tmp; n } else n cnt[i][j] = (cnt[i][j] + tmp) % P; n } n } n } n } n if (dp[a[0]][a[1]] == 100500) { n printf( -1 n0 n ); n } else { n printf( %d n%d n , dp[a[0]][a[1]], int(cnt[a[0]][a[1]])); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e5 + 5; n const long long inf = -1; n const long long m = 1e6; n vector prime; n bool sieve[m + 2]; n void primeSieve() { n memset(sieve, true, sizeof(sieve)); n sieve[0] = sieve[1] = false; n prime.push_back(2); n for (long long i = 4; i <= m; i += 2) sieve[i] = false; n long long sqrtn = sqrt(m); n for (long long i = 3; i <= sqrtn; i += 2) { n if (sieve[i]) { n for (long long j = i * i; j <= m; j += 2 * i) sieve[j] = false; n } n } n for (long long i = 3; i <= m; i += 2) n if (sieve[i]) prime.push_back(i); n } n map, long long> use; n signed main() { n ios::sync_with_stdio(false); n cin.tie(0); n primeSieve(); n long long n, m, i; n cin >> n >> m; n long long pos = n upper_bound(prime.begin(), prime.end(), n - 2) - prime.begin(); n long long need = prime[pos] - (n - 2); n vector>> v; n long long x = 1; n for (i = 1; i < n; i++) { n if (i + 1 == n) x = need; n v.push_back(make_pair(i, make_pair(i + 1, x))); n use[make_pair(i, i + 1)] = 1; n } n long long sum = (n - 2) + need; n m -= (n - 1); n for (i = 1; i < n; i++) { n if (m == 0) break; n for (long long j = i + 1; j <= n; j++) { n if (m == 0) break; n if (!use[make_pair(i, j)] and m) { n v.push_back(make_pair(i, make_pair(j, mod))); n m--; n use[make_pair(i, j)] = 1; n } n } n } n cout << sum << << sum << endl; n for (auto p : v) { n cout << p.first << << (p.second).first << << (p.second).second n << endl; n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n using ll = long long; n using ld = long double; n using pi = pair; n using pl = pair; n using vi = vector; n using vl = vector; n using vpi = vector; n using si = set; n using sl = set; n using qi = queue; n using ql = queue; n template n bool uin(T& a, T b) { n return a > b ? (a = b, true) : false; n } n template n bool uax(T& a, T b) { n return a < b ? (a = b, true) : false; n } n template n bool uin(T& u, T& v, T a, T b) { n return v - u > b - a ? (u = a, v = b, true) : false; n } n template n bool uax(T& u, T& v, T a, T b) { n return v - u < b - a ? (u = a, v = b, true) : false; n } n namespace input { n template n void re(complex& x); n template n void re(pair& p); n template n void re(vector& a); n template n void re(array& a); n template n void re(T& x) { n cin >> x; n } n void re(double& x) { n string t; n re(t); n x = stod(t); n } n void re(ld& x) { n string t; n re(t); n x = stold(t); n } n template n void re(T& t, Ts&... ts) { n re(t); n re(ts...); n } n template n void re(complex& x) { n T a, b; n re(a, b); n x = cd(a, b); n } n template n void re(pair& p) { n re(p.f, p.s); n } n template n void re(vector& a) { n for (int i = 0; i < (((int)(a).size())); ++i) re(a[i]); n } n template n void re(array& a) { n for (int i = 0; i < (SZ); ++i) re(a[i]); n } n } // namespace input n using namespace input; n namespace output { n void pr(int x) { cout << x; } n void pr(long x) { cout << x; } n void pr(ll x) { cout << x; } n void pr(unsigned x) { cout << x; } n void pr(unsigned long x) { cout << x; } n void pr(unsigned long long x) { cout << x; } n void pr(float x) { cout << x; } n void pr(double x) { cout << x; } n void pr(ld x) { cout << x; } n void pr(char x) { cout << x; } n void pr(const char* x) { cout << x; } n void pr(const string& x) { cout << x; } n void pr(bool x) { pr(x ? true : false ); } n template n void pr(const complex& x) { n cout << x; n } n template n void pr(const pair& x); n template n void pr(const T& x); n template n void pr(const T& t, const Ts&... ts) { n pr(t); n pr(ts...); n } n template n void pr(const pair& x) { n pr( { , x.f, , , x.s, } ); n } n template n void pr(const T& x) { n pr( { ); n bool fst = 1; n for (const auto& a : x) pr(!fst ? , : , a), fst = 0; n pr( } ); n } n void ps() { pr( n ); } n template n void ps(const T& t, const Ts&... ts) { n pr(t); n if (sizeof...(ts)) pr( ); n ps(ts...); n } n void pc() { pr( ] n ); } n template n void pc(const T& t, const Ts&... ts) { n pr(t); n if (sizeof...(ts)) pr( , ); n pc(ts...); n } n } // namespace output n using namespace output; n inline int bs(bool (*valid)(int), int l, int r, bool order) { n l--, r++; n if (!order) swap(l, r); n while (abs(r - l) > 1) { n int mid = (l + r) >> 1; n if (valid(mid)) n r = mid; n else n l = mid; n } n valid(r); n return r; n } n struct dsu { n vector p; n dsu(int n) { p.resize(n + 1); } n inline int get(int x) { return p[x] ? p[x] = get(p[x]) : x; } n inline bool mrg(int x, int y) { n return get(x) == get(y) ? false : p[get(x)] = get(y); n } n }; n const int M = 1e9 + 7; n const ll lnf = 1e18 + 3; n const int inf = 1e9 + 3; n const int nax = 1e6 + 5; n typedef decay::type T; n struct mi { n T val; n explicit operator T() const { return val; } n mi() { val = 0; } n mi(const ll& v) { n val = (-M <= v && v <= M) ? v : v % M; n if (val < 0) val += M; n } n friend void pr(const mi& a) { pr(a.val); } n friend void re(mi& a) { n ll x; n re(x); n a = mi(x); n } n friend bool operator==(const mi& a, const mi& b) { return a.val == b.val; } n friend bool operator!=(const mi& a, const mi& b) { return !(a == b); } n friend bool operator<(const mi& a, const mi& b) { return a.val < b.val; } n mi operator-() const { return mi(-val); } n mi& operator+=(const mi& m) { n if ((val += m.val) >= M) val -= M; n return *this; n } n mi& operator-=(const mi& m) { n if ((val -= m.val) < 0) val += M; n return *this; n } n mi& operator*=(const mi& m) { n val = (ll)val * m.val % M; n return *this; n } n friend mi pow(mi a, ll p) { n mi ans = 1; n assert(p >= 0); n for (; p; p /= 2, a *= a) n if (p & 1) ans *= a; n return ans; n } n friend mi inv(const mi& a) { n assert(a != 0); n return pow(a, M - 2); n } n mi& operator/=(const mi& m) { return (*this) *= inv(m); } n friend mi operator+(mi a, const mi& b) { return a += b; } n friend mi operator-(mi a, const mi& b) { return a -= b; } n friend mi operator*(mi a, const mi& b) { return a *= b; } n friend mi operator/(mi a, const mi& b) { return a /= b; } n }; n vi invs, fac, ifac; n void genFac(int SZ) { n invs.resize(SZ), fac.resize(SZ), ifac.resize(SZ); n invs[1] = fac[0] = ifac[0] = 1; n for (int i = (2); i <= (SZ - 1); ++i) n invs[i] = M - (ll)M / i * invs[M % i] % M; n for (int i = (1); i <= (SZ - 1); ++i) { n fac[i] = (ll)fac[i - 1] * i % M; n ifac[i] = (ll)ifac[i - 1] * invs[i] % M; n } n } n ll comb(int a, int b) { n if (a < b || b < 0) return 0; n return (ll)fac[a] * ifac[b] % M * ifac[a - b] % M; n } n ll p[nax], s, c; n int t, n, q[nax]; n int main() { n ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); n re(n); n vl a(n); n re(a); n for (int i = 0; i < (n); ++i) { n s = a[i], c = 1; n while (t && p[t] * c >= s * q[t]) s += p[t], c += q[t--]; n p[++t] = s, q[t] = c; n } n for (int i = (1); i <= (t); ++i) n for (int j = 0; j < (q[i]); ++j) printf( %.9f n , (double)p[i] / q[i]); n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 2000000005; n const int maxt = (1 << 20) + 5; n int all[maxt], dp[2][maxt]; n int best[30], a[30][30]; n int mask[30][30], cost[30][30]; n char str[30][30]; n int n, m; n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < n; i++) scanf( %s , str[i]), best[i] = inf; n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) n scanf( %d , &a[i][j]), best[i] = min(best[i], a[i][j]); n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n bool ok = true; n for (int k = 0; k < n; k++) n if (k != i && str[i][j] == str[k][j]) ok = false; n if (ok) best[i] = 0; n } n } n for (int j = 0; j < m; j++) { n for (int c = 0; c < 26; c++) { n mask[j][c] = 0; n cost[j][c] = 0; n int maxc = 0, cnt = 0; n for (int i = 0; i < n; i++) n if (str[i][j] - a == c) { n mask[j][c] |= 1 << i; n cost[j][c] += a[i][j]; n maxc = max(maxc, a[i][j]); n cnt++; n } n cost[j][c] -= maxc; n if (cnt < 2) mask[j][c] = -1; n } n } n for (int i = 0; i < 1 << n; i++) dp[0][i] = dp[1][i] = inf; n int nw = 0, ls = 1; n dp[nw][0] = 0; n for (int j = 0; j < m; j++) n for (int c = 0; c < 26; c++) n if (mask[j][c] != -1) { n swap(nw, ls); n memcpy(dp[nw], dp[ls], sizeof dp[ls]); n for (int i = 0; i < 1 << n; i++) { n dp[nw][i | mask[j][c]] = n min(dp[nw][i | mask[j][c]], dp[ls][i] + cost[j][c]); n } n } n for (int i = 0; i < 1 << n; i++) { n all[i] = 0; n for (int j = 0; j < n; j++) n if ((i >> j) & 1) n ; n else n all[i] += best[j]; n } n int ans = inf; n for (int i = 0; i < 1 << n; i++) ans = min(ans, all[i] + dp[nw][i]); n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, a[111], maxx; n int main() { n cin >> n >> m; n for (int i = 0; i < n; ++i) cin >> a[i]; n maxx = a[0]; n for (int i = 1; i < n; ++i) maxx = max(maxx, a[i]); n int tot = 0; n for (int i = 0; i < n; ++i) tot += maxx - a[i]; n int res2 = maxx + m; n m -= tot; n if (m < 0) m = 0; n int res1 = maxx + m / n; n if (m % n) ++res1; n cout << res1 << << res2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int N = 1e5 + 5; n const long long int M = 1e9 + 7; n queue > pq; n vector v; n map mpp; n set > st; n long long int a[N], h[N], indx[N][2]; n long long int val[N]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n long long int n, l; n cin >> n; n string s; n cin >> s; n long long int a = 0; n long long int b = 0; n for (int i = int(0); i <= int(n - 1); i++) { n if (s[i] == 8 ) a++; n } n long long int x = n / 11; n if (a < x) n cout << a; n else n cout << x; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops ) n #pragma GCC optimize( no-stack-protector,fast-math ) n using namespace std; n const long long N = 2e5 + 100, OO = 1e9 + 7, T = 1e6 + 10, M = 1e9 + 7, n P = 6151, SQ = 280, lg = 20; n long long n; n long long pw(long long x, long long y) { n if (y == 0) return 1; n long long cnt = pw(x, y / 2); n cnt = (cnt * cnt) % n; n cnt = (cnt * (y % 2 == 1 ? x : 1)) % n; n return cnt; n } n int32_t main() { n ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); n cin >> n; n if (n == 1) return cout << YES n1 , 0; n if (n == 4) return cout << YES n1 n3 n2 n4 n , 0; n for (long long i = 2; i * i <= n; i++) n if (n % i == 0) return cout << NO , 0; n cout << YES n ; n long long zr = 1; n for (long long i = 1; i < n; i++) { n long long cnt = i * pw(zr, n - 2) % n; n cout << cnt << n ; n zr = (zr * cnt) % n; n } n cout << n << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, q = 0, s = 0, t = 0; n cin >> n; n for (int k = 1; k <= n; k++) { n cin >> q; n if (q == 1) { n if (t == 1) n s++; n else { n t++; n s++; n } n } else { n if (t == 1) { n t--; n s++; n } n } n } n if (t == 0 && s != 0) s--; n cout << s; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC target( avx,avx2,fma ) n using namespace std; n const int mod1 = 1000000007; n long long gcd(long long a, long long b) { n long long c = a % b; n while (c != 0) { n a = b; n b = c; n c = a % b; n } n return b; n } n long long issub(string a, string b) { n if (a.find(b) != string::npos) n return 1; n else n return 0; n } n long long expo(long long a, long long b) { n long long res = 1; n while (b > 0) { n if (b & 1) res = res * a % mod1; n a = a * a % mod1; n b >>= 1; n } n return res; n } n int32_t lcm(long long n1, long long n2) { n long long max = (n1 > n2) ? n1 : n2; n do { n if (max % n1 == 0 && max % n2 == 0) { n return max; n } else n ++max; n } while (true); n } n string operator*(string a, unsigned long long b) { n string output = ; n while (b--) output += a; n return output; n } n bool isPerfectSquare(long long n) { n for (long long i = 1; i * i <= n; i++) { n if ((n % i == 0) && (n / i == i)) { n return true; n } n } n return false; n } n int32_t main() { n ios_base::sync_with_stdio(false), cin.tie(NULL); n ; n long long t, a = 0, x; n cin >> t; n map m; n for (long long i = 0; i < t; i++) { n cin >> x; n m[x]++; n a = max(a, m[x]); n } n cout << a; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1e9 + 9; n const int Mod = 1e9 + 7; n inline int dcmp(double x) { n if (fabs(x) <= 1e-9) return 0; n return x < 0 ? -1 : 1; n } n inline int scan() { n int x = 0, f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n return x * f; n } n inline long long scan(long long x) { n int f = 1; n char ch = getchar(); n x = 0; n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n return x * f; n } n struct Point { n int x, y, id; n Point(int x = 0, int y = 0) : x(x), y(y) {} n Point operator-(const Point &a) const { return Point(x - a.x, y - a.y); } n Point operator*(const long long &a) const { return Point(x * a, y * a); } n Point operator+(const Point &a) const { return Point(x + a.x, y + a.y); } n bool operator==(const Point &a) const { n return dcmp(x - a.x) == 0 && dcmp(y - a.y) == 0; n } n bool operator<(const Point &a) const { n if (x == a.x) return y < a.y; n return x < a.x; n } n void read() { scanf( %d%d , &x, &y); } n void out() { cout << x << << y << endl; } n }; n double Dot(Point a, Point b) { return a.x * b.x + a.y * b.y; } n double dis(Point a) { return sqrt(Dot(a, a)); } n long long Cross(Point a, Point b) { return a.x * 1LL * b.y - a.y * 1LL * b.x; } n bool chk(Point p1, Point p2, Point p3, Point p) { n return abs(Cross(p2 - p, p1 - p)) + abs(Cross(p3 - p, p2 - p)) + n abs(Cross(p1 - p, p3 - p)) == n abs(Cross(p2 - p1, p3 - p1)); n } n int n, k, ti; n int a[200005], vis[200005]; n void solve() { n n = scan(); n k = scan(); n for (int i = 1; i <= n; i++) a[i] = scan(); n memset(vis, 0, sizeof(vis)); n sort(a + 1, a + 1 + n); n for (int i = 1; i <= n; i++) { n ti = i; n while (ti - 1) { n ti--; n if (vis[ti]) break; n if (a[ti] + k < a[i]) break; n if (a[ti] < a[i]) n vis[ti] = 1; n else n break; n } n } n ti = 0; n for (int i = 1; i <= n; i++) { n if (!vis[i]) ti++; n } n cout << ti << endl; n } n int main() { n int t = 1; n for (int i = 1; i <= t; i++) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n long long int dp[3005][3005]; n int a[3005]; n int tree[3005 * 3005][2]; n int cnt = 0; n long long int check(int t) { n return !((a[t - 3] == 0 && a[t - 2] == 0 && a[t - 1] == 1 && a[t] == 1) || n (a[t - 3] == 0 && a[t - 2] == 1 && a[t - 1] == 0 && a[t] == 1) || n (a[t - 3] == 1 && a[t - 2] == 1 && a[t - 1] == 1 && a[t] == 0) || n (a[t - 3] == 1 && a[t - 2] == 1 && a[t - 1] == 1 && a[t] == 1)); n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n } n for (int i = 1; i <= n; i++) n for (int j = i - 1; j <= n; j++) { n if (j < i) n dp[i][j] = 1; n else { n for (int k = 1; k <= min(j, (check(j) ? 4 : 3)); k++) n dp[i][j] = (dp[i][j] + dp[i][j - k]) % 1000000007; n } n } n long long int ans = 0; n for (int i = 1; i <= n; i++) { n int p = 0; n for (int j = i; j >= 1; j--) { n if (tree[p][a[j]]) n p = tree[p][a[j]]; n else { n ans = (ans + dp[j][i]) % 1000000007; n tree[p][a[j]] = cnt += 1; n p = tree[p][a[j]]; n } n } n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma GCC optimize( O2,no-stack-protector,unroll-loops,fast-math ) n const long long maxn = 1e5 + 10, maxm = 5e2 + 10, lg = 21, mod = 1e9 + 7, n inf = 1e18; n long long n, m, s; n long double dp[101][maxn], ps[maxn]; n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n cin >> n >> m; n if (m == 1) return cout << 1, 0; n dp[0][0] = m - 1; n fill(ps, ps + maxn, m - 1); n for (int i = 1; i <= n; i++) { n long long x; n cin >> x; n s += x; n for (int j = 1; j <= n * m; j++) n dp[i][j] = (ps[j - 1] - (j - m - 1 >= 0 ? ps[j - m - 1] : 0) - n (j - x >= 0 ? dp[i - 1][j - x] : 0)) / n (m - 1); n ps[0] = 0; n for (int j = 1; j <= n * m; j++) ps[j] = ps[j - 1] + dp[i][j]; n } n cout << fixed << setprecision(18) << ps[s - 1] + 1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int32_t main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long n, p; n cin >> n >> p; n long long ans = 5 * 5000000; n for (long long i = 1; i <= 5000000; i++) { n long long left = n - p * i; n if (left < 1) n continue; n else { n long long k = __builtin_popcount(left); n if (k <= i and left >= i) { n cout << i; n return 0; n } n } n } n cout << -1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e5 + 7; n long long n, a[N], cnt[N]; n int32_t main() { n cin >> n; n for (long long i = 0; i < n; i++) cin >> a[i], cnt[a[i]]++; n for (long long i = 1; i < N; i++) n if (cnt[i] > 0) { n if (cnt[i] > n / 2) n cout << Bob ; n else n cout << Alice ; n return 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1e9 + 7; n const int N = 410; n int cnt[N]; n int temp[N]; n long long cost[N][N]; n long long dp[N][N]; n long long n, m, k; n const long long INF = (1LL) << 60; n vector v[200]; n int main() { n while (cin >> n >> m >> k) { n memset(dp, 0, sizeof(dp)); n for (int i = 0; i < N; i++) n for (int j = 0; j < N; j++) { n cost[i][j] = INF; n dp[i][j] = INF; n } n for (long long i = 0; i < m; i++) { n long long l, r, c; n cin >> l >> r >> c; n cost[l - 1][r] = min(cost[l - 1][r], c); n } n for (long long i = 0; i <= n; i++) n for (long long j = n; j >= i; j--) { n cost[i][j - 1] = min(cost[i][j - 1], cost[i][j]); n cost[i + 1][j] = min(cost[i + 1][j], cost[i][j]); n } n dp[0][0] = 0; n for (long long i = 1; i <= n; i++) { n for (long long j = 0; j <= i; j++) { n dp[i][j] = dp[i - 1][j]; n for (long long k = 0; k < i; k++) { n if (j - i + k >= 0) n dp[i][j] = min(dp[i][j], dp[k][j - i + k] + cost[k][i]); n } n } n } n long long ans = INF; n for (long long i = k; i <= n; i++) ans = min(ans, dp[n][i]); n if (ans == INF) n cout << -1 << endl; n else n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void print(T& x) { n cout << x; n } n template n void print(pair& p) { n cout << ( ; n print(p.first); n cout << , ; n print(p.second); n cout << ) ; n } n template n void print(vector& v) { n cout << { ; n if (((int)(v).size())) print(v[0]); n for (int i = 1; i < ((int)(v).size()); i++) cout << , , print(v[i]); n cout << } n ; n } n const int n = 1e6 + 10; n int N, Q; n vector>> T; n int X[n]; n int Par[n]; n pair intv[n]; n int newNum[n]; n int cmp[n]; n struct fenwick_tree { n int n; n vector a, f; n fenwick_tree(int n = 0) : n(n), a(n), f(n + 1) {} n fenwick_tree(vector& a) : fenwick_tree(a.size()) { n for (int i = 0; i < n; i++) setValue(i, a[i]); n } n void changeValue(int i, int d) { n for (a[i++] += d; i <= n; i += i & -i) f[i] += d; n } n void setValue(int i, int v) { changeValue(i, v - a[i]); } n int getSum(int i) { n int s = 0; n for (i++; i; i -= i & -i) s += f[i]; n return s; n } n int getSum(int l, int r) { return getSum(r - 1) - getSum(l - 1); } n }; n struct sparse_table { n int n; n vector a; n vector> st; n int combine(int dl, int dr) { return a[dl] > a[dr] ? dl : dr; } n sparse_table() {} n sparse_table(vector& a) n : n(a.size()), a(a), st((31 - __builtin_clz(n)) + 1, vector(n)) { n for (int i = 0; i < n; i++) st[0][i] = i; n for (int j = 1; 1 << j <= n; j++) n for (int i = 0; i + (1 << j) <= n; i++) n st[j][i] = combine(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]); n } n int query(int l, int r) { n int s = (31 - __builtin_clz(r - l)); n return combine(st[s][l], st[s][r - (1 << s)]); n } n }; n struct lowest_common_ancestor { n int n, m = 0; n vector a, v, h; n vector>& e; n sparse_table st; n lowest_common_ancestor(vector>& e, int r) n : n(e.size()), a(n), v(2 * n - 1), h(2 * n - 1), e(e) { n dfs(r); n st = sparse_table(h); n } n void dfs(int i, int p = -1, int d = 0) { n a[i] = m; n v[m] = i; n h[m++] = d; n for (int j : e[i]) { n if (j == p) continue; n dfs(j, i, d - 1); n v[m] = i; n h[m++] = d; n } n } n int lca(int x, int y) { n return v[st.query(min(a[x], a[y]), max(a[x], a[y]) + 1)]; n } n }; n fenwick_tree BIT(n); n void initDSU() { n for (int i = 0; i < N; i++) { n cmp[i] = i; n } n } n int find(int x) { n if (cmp[x] != x) cmp[x] = find(cmp[x]); n return cmp[x]; n } n void combine(int a, int b) { cmp[find(a)] = find(b); } n int newN = 0; n void dfs(int cur, int par) { n newNum[cur] = newN; n int l = newN++; n for (auto [x, w] : T[cur]) { n if (x == par) continue; n Par[x] = cur; n X[x] = X[cur] ^ w; n dfs(x, cur); n } n intv[cur] = make_pair(l, newN - 1); n } n void mark(int x) { n auto [l, r] = intv[x]; n BIT.changeValue(l, 1); n BIT.changeValue(r + 1, -1); n } n void markPath(int x, int to) { n while (x != to) { n mark(x); n x = Par[x]; n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> N >> Q; n T.resize(N); n vector> A; n initDSU(); n for (int i = 0; i < Q; i++) { n int u, v, x; n cin >> u >> v >> x; n u--; n v--; n A.emplace_back(u, v, x); n if (find(u) != find(v)) { n T[u].emplace_back(v, x); n T[v].emplace_back(u, x); n combine(u, v); n } n } n for (int i = 1; i < N; i++) { n if (find(i) != find(0)) { n combine(0, i); n T[0].emplace_back(i, 0); n T[i].emplace_back(0, 0); n } n } n initDSU(); n dfs(0, -1); n vector> e(N); n for (int i = 0; i < N; i++) { n for (int j = 0; j < ((int)(T[i]).size()); j++) n e[i].push_back(T[i][j].first); n } n lowest_common_ancestor LCA(e, 0); n for (auto [u, v, x] : A) { n if (find(u) != find(v)) { n combine(u, v); n cout << YES n ; n } else if ((X[u] ^ X[v] ^ x) == 1) { n int lca = LCA.lca(u, v); n int sum = BIT.getSum(newNum[u]) + BIT.getSum(newNum[v]) - n 2 * BIT.getSum(newNum[lca]); n if (sum == 0) { n cout << YES n ; n markPath(v, lca); n markPath(u, lca); n } else n cout << NO n ; n } else n cout << NO n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int dp[1005]; n long long ncr[1005][1005]; n int ones(int n); n void calc_ncr(); n int main() { n string n; n int k; n cin >> n; n cin >> k; n calc_ncr(); n dp[1] = 0; n for (int i(2); i < (1001); i++) { n dp[i] = dp[ones(i)] + 1; n } n long long res = 0, num_ones = 0; n int len = n.length(); n if (k == 0) { n cout << 1 n ; n return 0; n } n for (int i(0); i < (len); i++) { n if (n[i] == 0 ) { n continue; n } n int j = max(num_ones, 1LL); n while (j < 1000) { n if (dp[j] == k - 1) { n res = (res + ncr[len - i - 1][j - num_ones]) % 1000000007; n if (i == 0 && k == 1) { n res = (res + 1000000007 - 1) % 1000000007; n } n } n j++; n } n num_ones++; n } n int count = 0; n for (int i(0); i < (len); i++) { n if (n[i] == 1 ) { n count++; n } n } n if (dp[count] == k - 1) { n res = (res + 1) % 1000000007; n } n cout << res << n ; n return 0; n } n int ones(int n) { n int count = 0; n while (n) { n if (n % 2 == 1) { n count++; n } n n /= 2; n } n return count; n } n void calc_ncr() { n for (int i(0); i < (1001); i++) { n ncr[i][0] = 1; n } n for (int i(1); i < (1001); i++) { n for (int j(1); j < (i + 1); j++) { n ncr[i][j] = (ncr[i - 1][j - 1] + ncr[i - 1][j]) % 1000000007; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n vector vec[200001]; n int ans[200001],arr[200001]; n struct data n { n int l,r,mini,maxi,d; n }; n data tree[1000001]; n void pushup(int x) n { n tree[x].maxi=max(tree[x<<1].maxi,tree[(x<<1)+1].maxi); n tree[x].mini=min(tree[x<<1].mini,tree[(x<<1)+1].mini); n return; n } n void pushdown(int x) n { n int mid=(tree[x].l+tree[x].r)>>1; n int d=tree[x].d; n tree[x<<1].d+=d; n tree[(x<<1)+1].d+=d; n tree[x<<1].maxi+=d; n tree[(x<<1)+1].maxi+=d; n tree[x<<1].mini+=d; n tree[(x<<1)+1].mini+=d; n tree[x].d=0; n pushup(x); n return; n } n void revise(int i,int l,int r,int d) n { n n if(l<=tree[i].l&&r>=tree[i].r) n { n tree[i].d+=d; n tree[i].maxi+=d; n tree[i].mini+=d; n return ; n } n int mid=(tree[i].l+tree[i].r)>>1; n if(tree[i].d!=0) n { n pushdown(i); n } n if(mid>=l) n { n revise(i<<1,l,r,d); n } n if(mid>1; n n if(l<=tree[i].l&&r>=tree[i].r) n { n return tree[i].maxi; n } n if(tree[i].d!=0) n { n pushdown(i); n } n pushup(i); n int ans=-1e9; n if(mid>=l) n { n ans=max(ans,query_max((i<<1),l,r)); n } n if(mid>1; n n if(l<=tree[i].l&&r>=tree[i].r) n { n return tree[i].mini; n } n if(tree[i].d!=0) n { n pushdown(i); n } n pushup(i); n int ans=1e9; n if(mid>=l) n { n ans=min(ans,query_min((i<<1),l,r)); n } n if(mid>1; n init((i<<1),l,mid); n init((i<<1)+1,mid+1,r); n return; n } n int main() n { n int n; n cin>>n; n for(int i=1 ; i<=n ; i++) n { n cin>>arr[i]; n vec[arr[i]].push_back(i); n } n init(1,1,n); n for(int i=1; i<=n ; i++) n { n revise(1,i,n,-1); n } n for(int i=1 ; i<=n ; i++) n { n ans[i]=0; n } n for(int i=1; i<=n ; i++) n { n for(int j=0 ; j n using namespace std; n const long long INF(0x3f3f3f3f3f3f3f3fll); n const long long inf(0x3f3f3f3f); n template n void read(T &res) { n bool flag = false; n char ch; n while (!isdigit(ch = getchar())) (ch == - ) && (flag = true); n for (res = ch - 48; isdigit(ch = getchar()); n res = (res << 1) + (res << 3) + ch - 48) n ; n flag && (res = -res); n } n template n void Out(T x) { n if (x < 0) putchar( - ), x = -x; n if (x > 9) Out(x / 10); n putchar(x % 10 + 0 ); n } n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n long long lcm(long long a, long long b) { return a * b / gcd(a, b); } n long long pow_mod(long long x, long long n, long long mod) { n long long res = 1; n while (n) { n if (n & 1) res = res * x % mod; n x = x * x % mod; n n >>= 1; n } n return res; n } n long long fact_pow(long long n, long long p) { n long long res = 0; n while (n) { n n /= p; n res += n; n } n return res; n } n long long mult(long long a, long long b, long long p) { n a %= p; n b %= p; n long long r = 0, v = a; n while (b) { n if (b & 1) { n r += v; n if (r > p) r -= p; n } n v <<= 1; n if (v > p) v -= p; n b >>= 1; n } n return r; n } n long long quick_pow(long long a, long long b, long long p) { n long long r = 1, v = a % p; n while (b) { n if (b & 1) r = mult(r, v, p); n v = mult(v, v, p); n b >>= 1; n } n return r; n } n bool CH(long long a, long long n, long long x, long long t) { n long long r = quick_pow(a, x, n); n long long z = r; n for (long long i = 1; i <= t; i++) { n r = mult(r, r, n); n if (r == 1 && z != 1 && z != n - 1) return true; n z = r; n } n return r != 1; n } n bool Miller_Rabin(long long n) { n if (n < 2) return false; n if (n == 2) return true; n if (!(n & 1)) return false; n long long x = n - 1, t = 0; n while (!(x & 1)) { n x >>= 1; n t++; n } n srand(time(NULL)); n long long o = 8; n for (long long i = 0; i < o; i++) { n long long a = rand() % (n - 1) + 1; n if (CH(a, n, x, t)) return false; n } n return true; n } n void exgcd(long long a, long long b, long long &x, long long &y) { n if (!b) { n x = 1, y = 0; n return; n } n exgcd(b, a % b, x, y); n long long t = x; n x = y, y = t - (a / b) * y; n } n long long inv(long long a, long long b) { n long long x, y; n return exgcd(a, b, x, y), (x % b + b) % b; n } n long long crt(long long x, long long p, long long mod) { n return inv(p / mod, mod) * (p / mod) * x; n } n long long fac(long long x, long long a, long long b) { n if (!x) return 1; n long long ans = 1; n for (long long i = 1; i <= b; i++) n if (i % a) ans *= i, ans %= b; n ans = pow_mod(ans, x / b, b); n for (long long i = 1; i <= x % b; i++) n if (i % a) ans *= i, ans %= b; n return ans * fac(x / a, a, b) % b; n } n long long C(long long n, long long m, long long a, long long b) { n long long N = fac(n, a, b), M = fac(m, a, b), Z = fac(n - m, a, b), sum = 0, n i; n for (i = n; i; i = i / a) sum += i / a; n for (i = m; i; i = i / a) sum -= i / a; n for (i = n - m; i; i = i / a) sum -= i / a; n return N * pow_mod(a, sum, b) % b * inv(M, b) % b * inv(Z, b) % b; n } n long long exlucas(long long n, long long m, long long p) { n long long t = p, ans = 0, i; n for (i = 2; i * i <= p; i++) { n long long k = 1; n while (t % i == 0) { n k *= i, t /= i; n } n ans += crt(C(n, m, i, k), p, k), ans %= p; n } n if (t > 1) ans += crt(C(n, m, t, t), p, t), ans %= p; n return ans % p; n } n const long long N = 3e5 + 10; n signed main() { n std::ios::sync_with_stdio(false); n long long t; n cin >> t; n while (t--) { n long long n; n cin >> n; n cout << n << n ; n } n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:1024000000,1024000000 ) n using namespace std; n int const maxn = 3000005; n string st[maxn]; n int ab[200], ac[200], ad[200]; n char b[maxn], c[maxn], d[maxn]; n int main() { n cin >> b >> c; n int lenc = strlen(c); n for (int i = 0; i < lenc; i++) { n ac[c[i] - a ]++; n } n int tw = 0, t = 0; n int lenb = strlen(b); n for (int i = 0; i < lenb; i++) { n if (b[i] == ? ) n tw++; n else n ab[b[i] - a ]++; n } n while (tw > 0) { n for (int i = 0; i < 26; i++) { n if (tw == 0) break; n if (ab[i] >= ac[i]) { n ab[i] -= ac[i]; n } else { n if (tw >= ac[i] - ab[i]) { n tw -= ac[i] - ab[i]; n ad[i] += ac[i] - ab[i]; n ab[i] = 0; n } else { n ad[0] += tw; n tw = 0; n } n } n } n } n for (int i = 0; i < 26; i++) { n for (int j = 0; j < ad[i]; j++) { n d[t++] = (char)(i + a ); n } n } n t = 0; n for (int i = 0; i < lenb; i++) { n if (b[i] == ? ) { n cout << d[t++]; n } else n cout << b[i]; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 7; n int a[N], n; n double f(double x) { n double sum = 0, mn = 0, mx = 0, ans = 0; n for (int i = 0; i < n; i++) { n mn = min(mn, sum); n mx = max(mx, sum); n sum += a[i] - x; n ans = max(ans, abs(sum - mn)); n ans = max(ans, abs(sum - mx)); n } n return ans; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n double l = -1e4 - 7, r = 1e4 + 7; n int t = 230; n while (t--) { n double mid1 = (2 * r + l) / 3; n double mid2 = (2 * l + r) / 3; n if (f(mid1) < f(mid2)) n l = mid2; n else n r = mid1; n } n cout << setprecision(9) << fixed << f(l) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, ans; n int a[6][6]; n int convert(char c) { n if (c == R ) return 1; n if (c == G ) return 2; n if (c == B ) return 3; n if (c == Y ) return 4; n if (c == W ) return 5; n } n void xuly(int state) { n int i, j, dem, c1, c2; n bool val[10], col[10]; n int temp[15]; n dem = 0; n for (i = 0; i < 5; i++) n if (state & (1 << i)) { n dem++; n val[i + 1] = true; n } else n val[i + 1] = false; n for (i = 5; i < 10; i++) n if (state & (1 << i)) { n dem++; n col[i - 4] = true; n } else n col[i - 4] = false; n memset(temp, 0, sizeof(temp)); n for (i = 1; i <= 5; i++) n for (j = 1; j <= 5; j++) n if (a[i][j]) { n if (val[i] && col[j]) continue; n if (val[i]) n temp[i]++; n else if (col[j]) n temp[j + 5]++; n else n temp[11]++; n } n for (i = 1; i <= 11; i++) n if (temp[i] > 1) return; n ans = min(ans, dem); n } n void solve() { n int i, j; n ans = 10; n for (i = 0; i < (1 << 11); i++) xuly(i); n cout << ans << endl; n } n void input() { n int i; n char s[10]; n scanf( %d , &n); n memset(a, 0, sizeof(a)); n for (i = 0; i < n; i++) { n scanf( %s , &s); n a[convert(s[0])][s[1] - 0 ]++; n } n solve(); n } n int main() { n input(); n fclose(stdin); n fclose(stdout); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main(int argc, char const *argv[]) { n int a; n int b; n int dado[] = {1, 2, 3, 4, 5, 6}; n cin >> a >> b; n int r1, r2, r3; n r1 = r2 = r3 = 0; n for (int i = 0; i < 6; ++i) n abs(dado[i] - a) abs(dado[i] - n b) n ? r2++ n : r3++; n cout << r1 << << r3 << << r2 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long unsigned int combi(long unsigned int a) { n if (a == 0 || a == 1) return 0; n return ((a * (a - 1)) / 2); n } n int main() { n int n = 0; n cin >> n; n char arr[n]; n int letras[26]; n char temp = 0; n long unsigned int res = 0; n for (int i = 0; i < 26; i++) { n letras[i] = 0; n } n for (int i = 0; i < n; i++) { n cin >> temp; n cin.ignore(256, n ); n letras[temp - 97]++; n } n for (int i = 0; i < 26; i++) { n res += (combi(letras[i] - (letras[i] / 2)) + (combi(letras[i] / 2))); n } n printf( %lu , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n bool ckmin(T &a, U b) { n return b < a ? a = b, true : false; n } n template n bool ckmax(T &a, U b) { n return b > a ? a = b, true : false; n } n int tt; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> tt; n while (tt--) { n int n, x, y, un = -1; n cin >> n >> x >> y; n set second; n vector v(n, 0), res(n, -1); n map> m; n vector>> a, b; n for (int i = 0; i < n; ++i) { n cin >> v[i]; n v[i]--; n m[v[i]].push_back(i); n } n for (int i = 0; i <= n; ++i) second.insert(i); n for (auto i : v) { n if (second.find(i) != second.end()) second.erase(i); n } n un = (*second.begin()); n for (auto i : m) a.push_back(i); n sort(a.begin(), a.end(), n [](const pair> &a, const pair> &b) { n return (int)(a.second).size() < (int)(b.second).size(); n }); n int cnt = 0, pp = 0; n map> tmp; n while (cnt < n - x) { n if ((int)(a[pp].second).size()) { n tmp[a[pp].first].push_back(a[pp].second.back()); n a[pp].second.pop_back(); n cnt++; n } n pp++; n if (pp >= (int)(a).size()) pp -= (int)(a).size(); n } n for (auto i : tmp) { n b.push_back(i); n } n for (auto i : a) { n for (auto j : i.second) { n res[j] = i.first; n } n } n vector> xx, yy; n for (auto i : b) { n for (auto j : i.second) { n xx.push_back(make_pair(i.first, j)); n yy.push_back(make_pair(i.first, j)); n } n } n rotate(yy.begin(), yy.begin() + ((int)(yy).size() / 2), yy.end()); n vector store; n for (int i = 0; i < (int)(yy).size(); ++i) { n if (xx[i].first == yy[i].first) store.push_back(i); n } n if ((int)(store).size() > n - y) { n cout << NO n ; n continue; n } n for (auto i : store) { n xx[i].first = un; n res[yy[i].second] = un; n } n int rem = n - y - (int)(store).size(); n for (int i = 0; i < (int)(yy).size(); ++i) { n if (rem && xx[i].first != un) { n rem--; n xx[i].first = un; n res[yy[i].second] = un; n } else { n res[yy[i].second] = xx[i].first; n } n } n cout << YES n ; n for (auto i : res) cout << i + 1 << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = (int)1e9 * 2; n int n, m, ind; n long long L[55], M[55], R[55], A[55], ans = -inf, un; n bool all = 1; n vector a[55]; n void calc() { n for (int i = 0; i < n; i++) { n R[i] = M[i] = L[i] = -inf; n for (int j = 0; j < a[i].size(); j++) { n A[i] += (long long)a[i][j]; n if (A[i] > L[i]) L[i] = A[i]; n } n long long sum = 0; n for (int j = a[i].size() - 1; j >= 0; j--) { n sum += (long long)a[i][j]; n if (sum > R[i]) R[i] = sum; n } n sum = 0; n for (int j = 0; j < a[i].size(); j++) { n sum = max(sum + (long long)a[i][j], (long long)a[i][j]); n M[i] = max(M[i], sum); n } n } n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 0; i < n; i++) { n int l; n scanf( %d , &l); n for (int j = 0; j < l; j++) { n int x; n scanf( %d , &x); n a[i].push_back(x); n } n } n calc(); n for (int i = 0; i < m; i++) { n scanf( %d , &ind), ind--; n ans = max(un + L[ind], ans); n un = max(un + A[ind], R[ind]); n ans = max(ans, M[ind]); n } n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n double calc(pair v1, pair v2) { n double dx = v1.first - v2.first; n double dy = v1.second - v2.second; n return sqrt(dx * dx + dy * dy); n } n int main() { n int a, b, c; n scanf( %d%d%d , &a, &b, &c); n double x1, y1, x2, y2; n scanf( %lf%lf%lf%lf , &x1, &y1, &x2, &y2); n double dist = fabs(x1 - x2) + fabs(y1 - y2); n if (a == 0 || b == 0) { n printf( %.10f n , dist); n return 0; n } n vector> v1, v2; n double xl1 = (-1.0 * c - 1.0 * b * y1) / a; n double yl1 = (-1.0 * c - 1.0 * a * x1) / b; n v1.push_back({xl1, y1}); n v1.push_back({x1, yl1}); n double xl2 = (-1.0 * c - 1.0 * b * y2) / a; n double yl2 = (-1.0 * c - 1.0 * a * x2) / b; n v2.push_back({xl2, y2}); n v2.push_back({x2, yl2}); n for (auto p1 : v1) n for (auto p2 : v2) n dist = n min(dist, calc(p1, p2) + fabs(x1 - p1.first) + fabs(y1 - p1.second) + n fabs(x2 - p2.first) + fabs(y2 - p2.second)); n printf( %.10f n , dist); n } n "} +{"func_code_string": "#include n using namespace std; n bool isPrime(int n) { n for (int i = 2; i < int(sqrt(n) + 1); i++) n if (n % i == 0) return 0; n return 1; n } n int main() { n int n; n cin >> n; n if (isPrime(n)) return !(cout << 1 << n ); n if (n & 1) { n if (isPrime(n - 2)) n cout << 2 << n ; n else n cout << 3 << n ; n } else n cout << 2 << n ; n return 0; n } n "} +{"func_code_string": "#include n const int MAXN = 1000000007; n const int z = 0; n using namespace std; n int main() { n int k, l, m, n, d, ans = 0; n cin >> k >> l >> m >> n >> d; n for (int i = 1; i <= d; i++) { n if (i % k == 0 or i % l == 0 or i % m == 0 or i % n == 0) { n ans++; n } n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int tt, c = 0; n cin >> tt; n while (tt) { n int n = tt; n set data; n while (n % 2 == 0) { n data.insert(2); n n = n / 2; n } n for (int i = 3; i <= sqrt(n); i = i + 2) { n while (n % i == 0) { n data.insert(i); n n = n / i; n } n } n if (n > 2) data.insert(n); n if (data.size() == 2) { n c++; n } n tt--; n } n cout << c << endl; n cerr << Time : << (float)clock() / CLOCKS_PER_SEC << s << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using P = pair; n constexpr int INF = 1001001001; n constexpr int mod = 1000000007; n template n inline bool chmax(T& x, T y) { n if (x < y) { n x = y; n return true; n } n return false; n } n template n inline bool chmin(T& x, T y) { n if (x > y) { n x = y; n return true; n } n return false; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int n, k; n cin >> n >> k; n vector a(n + 2), ban(k + 2); n a[0] = -1e+7, a[n + 1] = INF; n ban[0] = 0, ban[k + 1] = n + 1; n for (int i = 1; i <= n; ++i) { n cin >> a[i]; n a[i] -= i; n } n for (int i = 1; i <= k; ++i) cin >> ban[i]; n int ans = 0; n for (int i = 0; i <= k; ++i) { n int lb = a[ban[i]], ub = a[ban[i + 1]]; n if (ub - lb < 0) { n cout << -1 << endl; n return 0; n } n vector vals; n int cnt = 0; n int s = ban[i] + 1, t = ban[i + 1]; n for (int j = s; j < t; ++j) { n if (a[j] < lb || a[j] > ub) n ++cnt; n else n vals.emplace_back(a[j]); n } n int m = vals.size(); n vector dp(m, INF); n for (int j = 0; j < m; ++j) { n *upper_bound(dp.begin(), dp.end(), vals[j]) = vals[j]; n } n cnt += dp.end() - lower_bound(dp.begin(), dp.end(), INF); n ans += cnt; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, a[1000]; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n long int answer = 0; n for (int i = 0; i < (n - 1); i++) { n if (a[i] == 1 && a[i + 1] == 2) { n answer += 3; n } else if (a[i] == 1 && a[i + 1] == 3) { n answer += 4; n } else if (a[i] == 2 && a[i + 1] == 1) { n answer += 3; n } else if (a[i] == 2 && a[i + 1] == 3) { n cout << Infinite ; n return 0; n } else if (a[i] == 3 && a[i + 1] == 1) { n answer += 4; n if (i < n - 2 && a[i + 2] == 2) { n answer -= 1; n } n } else if (a[i] == 3 && a[i + 1] == 2) { n cout << Infinite ; n return 0; n } n } n cout << Finite << endl; n cout << answer; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n int a = (s.size() + 1) / 2 - 1; n int b = s.size() / 2 - 1; n bool f00 = false, f01 = false, f10 = false, f11 = false; n int cq = 0, c0 = 0, c1 = 0; n for (int i = 0; i < s.size(); i++) { n if (s[i] == 0 ) n c0++; n else if (s[i] == 1 ) n c1++; n else n cq++; n } n if (cq + c1 >= a + 2) f11 = true; n if (c1 <= a) f00 = true; n if (c1 <= a + 1 and c1 + cq >= a + 1) { n int q1 = (a + 1) - c1; n int q0 = cq - q1; n if (s.back() == ? ) { n if (q1) f01 = true; n if (q0) f10 = true; n } else if (s.back() == 0 ) n f10 = true; n else n f01 = true; n } n if (f00) printf( 00 n ); n if (f01) printf( 01 n ); n if (f10) printf( 10 n ); n if (f11) printf( 11 n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n double a, b, Zero = 0.5, One = 1.0; n scanf( %d , &t); n while (t--) { n scanf( %lf%lf , &a, &b); n if (a == 0 && b == 0) n printf( %.10lf n , One); n else if (a == 0) n printf( %.10lf n , Zero); n else if (b == 0) n printf( %.10lf n , One); n else if (a >= 4 * b) { n float area = 0.5 * 4 * b * b; n area = 2 * a * b - area; n area /= 2 * a * b; n printf( %.10lf n , area); n } else { n float area = 0.5 * a * a * 0.25 + a * b; n area /= 2 * a * b; n printf( %.10lf n , area); n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n using namespace std; n const int N = 1e5 + 5, M = 100 + 5, OO = 0x3f3f3f3f, mod = 1e9 + 7, base = 131, n MOD2 = 1000136437; n const double EPS = 1e-9; n long double w, h, theta; n complex rotate(complex &p, double a) { n return p * polar(1.0, a); n } n int doubleComp(const double &a, const double &b) { n return fabs(a - b) < EPS ? 0 : a < b ? -1 : 1; n } n bool lineInter(const complex &A, const complex &B, n const complex &P, const complex &Q, n complex &R, bool isSegA = false, bool isSegB = false) { n double d1 = ((conj(P - A) * (B - A)).imag()); n double d2 = ((conj(Q - A) * (B - A)).imag()); n if (fabs(d1 - d2) < EPS) return false; n R = (d1 * Q - d2 * P) / (d1 - d2); n if (isSegA && n doubleComp(hypot(A.real() - B.real(), A.imag() - B.imag()), n hypot(A.real() - R.real(), A.imag() - R.imag()) + n hypot(B.real() - R.real(), B.imag() - R.imag())) != 0) n return false; n if (isSegB && n doubleComp(hypot(P.real() - Q.real(), P.imag() - Q.imag()), n hypot(P.real() - R.real(), P.imag() - R.imag()) + n hypot(Q.real() - R.real(), Q.imag() - R.imag())) != 0) n return false; n return true; n } n void polygonCut(const complex &a, const complex &b, n const vector > &v, n vector > &ret) { n ret.clear(); n for (int i = 0; i < (int)(v).size(); i++) { n int j = (i + 1) % (int)(v).size(); n if (((conj(((b) - (a))) * (((v[i]) - (a)))).imag()) >= 0) n ret.push_back(v[i]); n complex r; n if (lineInter(a, b, v[i], v[j], r, 0, 1)) ret.push_back(r); n } n } n void polygonIntersection(const vector > &poly1, n const vector > &poly2, n vector > &ret) { n vector > r2; n ret = poly1; n for (int i = 0; i < (int)(poly2).size(); i++) { n int j = (i + 1) % (int)(poly2).size(); n polygonCut(poly2[i], poly2[j], ret, r2); n ret = r2; n } n } n double areaPolygon(vector > p) { n double area = 0.0; n for (int i = 0, n = (int)(p).size(); i < n; i++) n area += ((conj(p[i]) * (p[(i + 1) % n])).imag()); n return abs(area) / 2.0; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> w >> h >> theta; n vector > p, p2, ans; n w /= 2; n h /= 2; n p.push_back(complex(w, h)); n p.push_back(complex(-w, h)); n p.push_back(complex(-w, -h)); n p.push_back(complex(w, -h)); n p2 = p; n theta = (theta / 180.0) * (2 * acos(0)); n for (auto &i : p2) i = rotate(i, theta); n polygonIntersection(p, p2, ans); n cout << fixed << setprecision(6) << areaPolygon(ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char buf[1 << 21], *p1 = buf, *p2 = buf; n int read() { n int w = 0, f = 1; n char c = ; n while (c < 0 || c > 9 ) n c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) n ? EOF n : *p1++), n f = c == - ? -1 : f; n while (c >= 0 && c <= 9 ) n w = w * 10 + c - 48, n c = (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) n ? EOF n : *p1++); n return w * f; n } n int n, m, a[1000005]; n long long val[1000005 << 2], mod; n vector minn[1000005 << 2]; n const long long inf = 1e18; n void pushup(int p, int l, int r, int mid) { n int ls = p << 1, rs = p << 1 | 1, it1 = 0, it2 = 0; n while (it1 <= mid - l + 1) { n while (it2 <= r - mid) { n long long L = max(minn[ls][it1], minn[rs][it2] - val[ls] + mod * it1), n R = it1 == mid - l + 1 ? inf : minn[ls][it1 + 1] - 1; n if (L > R) break; n minn[p][it1 + it2] = min(minn[p][it1 + it2], L), it2++; n } n it2 = max(it2 - 1, 0), it1++; n } n val[p] = val[ls] + val[rs]; n } n void build(int p, int l, int r) { n minn[p].resize(r - l + 2); n minn[p][0] = -inf; n for (int i = 1; i <= r - l + 1; i++) minn[p][i] = inf; n if (l == r) { n minn[p][1] = mod - a[l]; n val[p] = a[l]; n return; n } n int mid = (l + r) >> 1; n build(p << 1, l, mid); n build(p << 1 | 1, mid + 1, r); n pushup(p, l, r, mid); n } n long long query(int p, int x, int y, long long v, int l, int r) { n if (x <= l && r <= y) { n int L = 0, R = r - l + 1, res = 0; n while (L <= R) { n int mid = (L + R) >> 1; n if (minn[p][mid] <= v) n res = mid, L = mid + 1; n else n R = mid - 1; n } n return v + val[p] - mod * res; n } n int mid = (l + r) >> 1; n if (y <= mid) return query(p << 1, x, y, v, l, mid); n if (x > mid) return query(p << 1 | 1, x, y, v, mid + 1, r); n return query(p << 1 | 1, x, y, query(p << 1, x, y, v, l, mid), mid + 1, r); n } n signed main() { n n = read(), m = read(), mod = read(); n for (int i = 1; i <= n; i++) a[i] = read(); n build(1, 1, n); n int l, r; n while (m--) { n l = read(), r = read(); n printf( %lld n , query(1, l, r, 0, 1, n)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[601000]; n long long m; n long long ans = 0; n long long len; n long long ll; n long long mod = 1; n long long reget(long long x) { n long long reans = (10 * (ll - ((long long)(s[x] - 0 ) * mod) % m + m) % m + n (long long)(s[x] - 0 ) + m) % n m; n return reans; n } n long long get(long long l, long long r) { n long long t = l; n long long temp = 0; n while (t <= r) { n if (temp >= m) temp = (temp % m + m) % m; n while (temp < m && t <= r) { n temp = temp * 10 + (long long)(s[t] - 0 ); n t++; n } n } n temp = (temp + m) % m; n return temp; n } n int main() { n cin >> s; n len = strlen(s); n cin >> m; n ans = get(0, len - 1); n for (long long i = 1; i < len; i++) mod = (mod * 10 + m) % m; n ll = ans; n for (long long i = 0; i < len - 1; i++) { n ll = reget(i); n if (s[i + 1] == 0 ) continue; n ans = min(ll, ans); n } n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n const long long int N = 2e5 + 10; n using namespace std; n int main() { n ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); n long long int n; n cin >> n; n string second; n cin >> second; n set x; n if (n > 26) { n cout << -1 << endl; n return 0; n } n for (int i = 0; i < n; i++) { n x.insert(second[i]); n } n cout << n - x.size() << endl; n } n "} +{"func_code_string": "#include n using namespace std; n string s; n struct substring { n int f, b; n bool operator>(const substring &o) const { n int cmp = s.compare(f, b - f + 1, s, o.f, o.b - o.f + 1); n return cmp != 0 ? cmp > 0 : f > o.f; n } n }; n string kthSubstring(int k) { n priority_queue, greater> pq; n int len = s.length(); n for (int i = 0; i < len; i++) { n pq.push({i, i}); n } n while (!pq.empty()) { n int f = pq.top().f, b = pq.top().b; n pq.pop(); n if (--k == 0) return s.substr(f, b - f + 1); n if (++b < len) { n pq.push({f, b}); n } n } n return ; n } n int main() { n int k; n cin >> s >> k; n int len = s.length(); n long long possible = ((long long)len * (len + 1)) / 2; n if (k > possible) n cout << No such line. << n ; n else n cout << kthSubstring(k) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1000005; n map > mm; n int a[maxn]; n int b[maxn]; n long long s[maxn], s1[maxn]; n int main() { n int i, j, n; n cin >> n; n for (i = 1; i <= n; i++) { n scanf( %d , &a[i]); n s[i] = s[i - 1] + a[i]; n } n for (i = 1; i <= n; i++) { n scanf( %d , &b[i]); n s1[i] = s1[i - 1] + b[i]; n } n int p = n; n if (s[n] <= s1[n]) { n i = n; n while (i >= 0) { n if (s[i] < s1[p]) { n p--; n continue; n } n if (mm.find(s[i] - s1[p]) != mm.end()) { n pair p2 = mm[s[i] - s1[p]]; n printf( %d n , p2.first - i); n for (j = i + 1; j <= p2.first; j++) printf( %d , j); n printf( n ); n printf( %d n , p2.second - p); n for (j = p + 1; j <= p2.second; j++) printf( %d , j); n printf( n ); n return 0; n } n mm[s[i] - s1[p]] = make_pair(i, p); n i--; n } n } else { n i = n; n while (i >= 0) { n if (s1[i] < s[p]) { n p--; n continue; n } n if (mm.find(s1[i] - s[p]) != mm.end()) { n pair p2 = mm[s1[i] - s[p]]; n printf( %d n , p2.second - p); n for (j = p + 1; j <= p2.second; j++) printf( %d , j); n printf( n ); n printf( %d n , p2.first - i); n for (j = i + 1; j <= p2.first; j++) printf( %d , j); n printf( n ); n return 0; n } n mm[s1[i] - s[p]] = make_pair(i, p); n i--; n } n } n printf( -1 n ); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 4e5 + 5; n int n; n int fa[N], r[N]; n int rt[N], ls[N * 30], rs[N * 30], siz[N * 30], tot; n long long sum[N * 30], ans; n void update(int &rt, int l, int r, int p) { n if (!rt) rt = ++tot; n if (l == r) { n siz[rt] = 1, sum[rt] = p; n return; n } n int mid = (l + r) >> 1; n if (p <= mid) n update(ls[rt], l, mid, p); n else n update(rs[rt], mid + 1, r, p); n siz[rt] = siz[ls[rt]] + siz[rs[rt]]; n sum[rt] = sum[ls[rt]] + sum[rs[rt]]; n } n int merge(int x, int y) { n if (!x || !y) return x | y; n ans -= sum[ls[x]] * siz[rs[x]] + sum[ls[y]] * siz[rs[y]]; n ls[x] = merge(ls[x], ls[y]); n rs[x] = merge(rs[x], rs[y]); n ans += sum[ls[x]] * siz[rs[x]]; n siz[x] += siz[y]; n sum[x] += sum[y]; n return x; n } n inline int findf(int x) { return x == fa[x] ? x : fa[x] = findf(fa[x]); } n void unify(int x, int y) { n x = findf(x), y = findf(y); n fa[y] = x; n ans -= sum[rt[x]] * x + sum[rt[y]] * y; n rt[x] = merge(rt[x], rt[y]); n ans += sum[rt[x]] * x; n r[x] = r[y]; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= 400000; i++) fa[i] = i, r[i] = i; n for (int i = 1, a, b; i <= n; i++) { n scanf( %d%d , &a, &b); n int p = rt[a] ? r[findf(a)] + 1 : a; n ans -= 1ll * a * b; n ans += 1ll * p * b; n update(rt[p], 1, n, b); n if (rt[p - 1]) unify(p - 1, p); n if (rt[p + 1]) unify(p, p + 1); n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n int d[1005][1005][15][2]; n char a[1005], b[1005]; n int max(int a, int b) { n if (a < b) return b; n return a; n } n int main() { n int n, m, k, i, j, l; n scanf( %d %d %d , &n, &m, &k); n for (i = 1; i <= n; i++) scanf( %c , &a[i]); n for (i = 1; i <= m; i++) scanf( %c , &b[i]); n for (i = 1; i <= n; i++) { n for (j = 1; j <= m; j++) { n for (l = 1; l <= k; l++) { n d[i][j][l][1] = max(d[i - 1][j][l][1], d[i][j - 1][l][1]); n if (a[i] == b[j]) { n d[i][j][l][0] = max(d[i][j][l][0], d[i - 1][j - 1][l - 1][1] + 1); n d[i][j][l][0] = max(d[i][j][l][0], d[i - 1][j - 1][l][0] + 1); n d[i][j][l][1] = max(d[i][j][l][1], d[i - 1][j - 1][l][0] + 1); n d[i][j][l][1] = max(d[i][j][l][1], d[i][j][l][0]); n } n } n } n } n printf( %d , d[n][m][k][1]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c, d; n scanf( %d%d%d%d , &a, &b, &c, &d); n double r = (1 - 1.0 * a / b) * (1 - 1.0 * c / d); n r = 1.0 / (1 - r); n printf( %.10f n , r * a / b); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, p, v, t, no = 0; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> p >> v >> t; n if (p + v + t >= 2) { n no++; n } n } n cout << no << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int x, t, a, b, da, db; n scanf( %d%d%d%d%d%d , &x, &t, &a, &b, &da, &db); n if (x == 0 || (x <= a && x > a - da * t && (a - x) % da == 0) || n (x <= b && x > b - db * t && (b - x) % db == 0)) { n cout << YES << endl; n return 0; n } n for (int i = 0; i < t; i++) { n for (int j = 0; j < t; j++) { n if ((a - j * da) + (b - i * db) == x) { n printf( YES ); n return 0; n } n } n } n printf( NO ); n } n "} +{"func_code_string": "#include n using namespace std; n const int NMAX = 100005; n int n, k; n char s[NMAX]; n int sum[NMAX]; n int get(int l, int r) { n l = max(1, l); n r = min(r, n); n return sum[r] - sum[l - 1]; n } n int main() { n cin.sync_with_stdio(false); n cin >> n >> k; n cin >> (s + 1); n for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + (s[i] == 0 ); n int ans = 1 << 30; n for (int i = 1; i <= n; i++) n if (s[i] == 0 ) { n int l = 1; n int r = n; n int sol = -1; n while (l <= r) { n int mi = (l + r) / 2; n if (get(i - mi, i - 1) + get(i + 1, i + mi) >= k) { n sol = mi; n r = mi - 1; n } else n l = mi + 1; n } n if (sol != -1) ans = min(ans, sol); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n register int x = 0, f = 1; n register char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) x = x * 10 + (ch ^ 48), ch = getchar(); n return x * f; n } n const int P = 998244353; n const int N = 1e7 + 5; n long long fsp(long long x, int y = P - 2) { n long long ans = 1; n while (y) { n if (y & 1) ans = ans * x % P; n x = x * x % P, y >>= 1; n } n return ans; n } n long long inv[N]; n int n, m, a[N], b[N], f[N]; n void Add(int &x, int y) { n x += y; n if (x < 0) x += P; n if (x >= P) x -= P; n } n int main() { n n = read(); n for (int i = 1; i <= n; i++) a[i] = read(), m += a[i]; n b[n] = m; n inv[1] = 1; n for (int i = 2; i <= m; i++) inv[i] = (P - P / i) * inv[P % i] % P; n long long im = fsp(m), in = fsp(n - 1); n for (int i = 1; i < m; i++) { n long long inv1 = inv[m - i] * m % P * (n - 1) % P; n long long inv2 = (1 - im * in % P * (m - i) % P * (n - 2) % P + P) % P; n f[i + 1] = n inv1 * (inv2 * f[i] % P - i * im % P * (f[i - 1] + 1) % P + P) % P; n } n int ans = 0; n for (int i = 1; i <= n; i++) Add(ans, f[a[i]]); n for (int i = 1; i <= n; i++) Add(ans, P - f[b[i]]); n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char ans[300][300]; n string s; n int cnt[300]; n int bal[300]; n int n, m; n void f(int l, int r, int ll, int rr) { n if (l + 1 == r) { n for (int i = 0; i < n / 2 - bal[r]; ++i) { n ans[n / 2 + i][ll] = | ; n ans[n / 2 - i][ll] = | ; n ans[n / 2 + i][rr] = | ; n ans[n / 2 - i][rr] = | ; n } n ans[bal[l] - 1][ll] = + ; n ans[n - bal[l]][ll] = + ; n ans[bal[l] - 1][rr] = + ; n ans[n - bal[l]][rr] = + ; n ans[bal[l] - 1][ll + 1] = - ; n ans[n - bal[l]][ll + 1] = - ; n ans[bal[l] - 1][rr - 1] = - ; n ans[n - bal[l]][rr - 1] = - ; n if (ll + 4 != rr) { n throw 1; n } n return; n } n int q = l; n int bl = 0; n for (q = l; q <= r; ++q) { n if (s[q] == [ ) { n ++bl; n } else { n --bl; n } n if (bl == 0) { n break; n } n } n if (q == r) { n for (int i = 0; i < n / 2 - bal[r]; ++i) { n ans[n / 2 + i][ll] = | ; n ans[n / 2 - i][ll] = | ; n ans[n / 2 + i][rr] = | ; n ans[n / 2 - i][rr] = | ; n } n ans[bal[l] - 1][ll] = + ; n ans[n - bal[l]][ll] = + ; n ans[bal[l] - 1][rr] = + ; n ans[n - bal[l]][rr] = + ; n ans[bal[l] - 1][ll + 1] = - ; n ans[n - bal[l]][ll + 1] = - ; n ans[bal[l] - 1][rr - 1] = - ; n ans[n - bal[l]][rr - 1] = - ; n f(l + 1, r - 1, ll + 1, rr - 1); n return; n } n int qq = ll + q - l + (cnt[q] - cnt[l]) * 3; n f(l, q, ll, qq); n f(q + 1, r, qq + 1, rr); n } n int main() { n memset(ans, , sizeof(ans)); n int qwe; n cin >> qwe; n cin >> s; n int bl = 0; n int mx = 0; n for (int i = 0; i < s.size(); ++i) { n if (s[i] == [ ) { n ++bl; n mx = max(mx, bl); n } else { n if (s[i - 1] == [ ) { n cnt[i] = 1; n } n --bl; n } n bal[i] = bl; n cnt[i] += i > 0 ? cnt[i - 1] : 0; n } n n = mx * 2 + 1; n m = s.size() + cnt[s.size() - 1] * 3; n f(0, s.size() - 1, 0, m - 1); n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n cout << ans[i][j]; n } n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 rnd(time(0)); n bool isPrime(long long a) { n long long i; n for (i = 2; i * i <= a; i++) { n if (a % i == 0) { n return 0; n } n } n return (a != 1); n } n bool isPalindrom(const string &s, int l, int r) { n for (int i = 0; i < (r - l + 1) / 2; i++) { n if (s[l + i] != s[r - i]) { n return 0; n } n } n return 1; n } n template n type1 gcd(type1 a, type1 b) { n type1 t; n while (b) { n t = b; n b = a % b; n a = t; n } n return a; n } n long long positiveMod(long long v, long long md) { n v = v % md; n if (v < 0) { n v += md; n } n return v; n } n class information { n public: n vector > dat; n vector *stL, *stR; n long long iq, n; n void build() { n n = dat.size(); n sort(dat.begin(), dat.end()); n stL = new vector[4 * n]; n stR = new vector[4 * n]; n buildSt(1, 0, n - 1); n } n void buildSt(long long v, long long l, long long r) { n if (l == r) { n stL[v].push_back(dat[l].first - dat[l].second); n stR[v].push_back(dat[l].first + dat[l].second); n } else { n long long mid = (l + r) / 2; n buildSt(v * 2, l, mid); n buildSt(v * 2 + 1, mid + 1, r); n int i1, i2; n i1 = i2 = 0; n while (i1 != stL[v * 2].size() || i2 != stL[v * 2 + 1].size()) { n if (i1 == stL[v * 2].size()) { n stL[v].push_back(stL[v * 2 + 1][i2]); n i2++; n } else if (i2 == stL[v * 2 + 1].size()) { n stL[v].push_back(stL[v * 2][i1]); n i1++; n } else { n if (stL[v * 2][i1] < stL[v * 2 + 1][i2]) { n stL[v].push_back(stL[v * 2][i1]); n i1++; n } else { n stL[v].push_back(stL[v * 2 + 1][i2]); n i2++; n } n } n } n i1 = i2 = 0; n while (i1 != stR[v * 2].size() || i2 != stR[v * 2 + 1].size()) { n if (i1 == stR[v * 2].size()) { n stR[v].push_back(stR[v * 2 + 1][i2]); n i2++; n } else if (i2 == stR[v * 2 + 1].size()) { n stR[v].push_back(stR[v * 2][i1]); n i1++; n } else { n if (stR[v * 2][i1] > stR[v * 2 + 1][i2]) { n stR[v].push_back(stR[v * 2][i1]); n i1++; n } else { n stR[v].push_back(stR[v * 2 + 1][i2]); n i2++; n } n } n } n } n } n long long getSum(long long v, long long l, long long r, long long tl, n long long tr, long long val) { n if (l == tl && tr == r) { n long long mid, res = 0; n l = 0; n r = stL[v].size(); n while (l != r) { n mid = (l + r) / 2; n if (stL[v][mid] > val) { n r = mid; n } else { n l = mid + 1; n } n } n res += stL[v].size() - l; n l = 0; n r = stR[v].size(); n while (l != r) { n mid = (l + r) / 2; n if (stR[v][mid] >= val) { n l = mid + 1; n } else { n r = mid; n } n } n res += stR[v].size() - l; n return res; n } else { n long long mid = (l + r) / 2; n if (tr <= mid) { n return getSum(v * 2, l, mid, tl, tr, val); n } else if (tl > mid) { n return getSum(v * 2 + 1, mid + 1, r, tl, tr, val); n } else { n return getSum(v * 2, l, mid, tl, mid, val) + n getSum(v * 2 + 1, mid + 1, r, mid + 1, tr, val); n } n } n } n long long getCount(long long x, long long rad) { n long long l, r, i, j, st, en, mid; n l = 0; n r = n; n while (l != r) { n mid = (l + r) / 2; n if (dat[mid].first >= x - rad) { n r = mid; n } else { n l = mid + 1; n } n } n st = l; n l = -1; n r = n - 1; n while (l != r) { n mid = (l + r + 1) / 2; n if (dat[mid].first <= x + rad) { n l = mid; n } else { n r = mid - 1; n } n } n en = r; n if (en < st) { n return 0; n } else { n return (en - st + 1) - getSum(1, 0, n - 1, st, en, x); n } n } n }; n vector inf; n vector > > inp; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long n, k, i, j, a, b, c, l, r, res = 0; n cin >> n >> k; n for (i = 0; i < n; i++) { n cin >> a >> b >> c; n inp.push_back({c, {a, b}}); n } n sort(inp.begin(), inp.end()); n for (i = 0; i < n;) { n l = i; n r = i; n while (r < n) { n if (inp[r].first == inp[l].first) { n r++; n } else { n break; n } n } n information t; n t.iq = inp[l].first; n for (j = l; j < r; j++) { n t.dat.push_back(inp[j].second); n } n inf.push_back(t); n inf.back().build(); n i = r; n } n for (i = 0; i < inf.size(); i++) { n a = 0; n for (auto it : inf[i].dat) { n a += inf[i].getCount(it.first, it.second); n for (j = i - 1; j >= 0; j--) { n if ((inf[i].iq - inf[j].iq) > k) { n break; n } else { n res += inf[j].getCount(it.first, it.second); n } n } n } n res += (a - inf[i].n) / 2; n } n cout << res << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, m, k, t, sum = 0, a, b, p; n cin >> t; n while (t--) { n bool fg = 0; n p = 0; n k = 0; n sum = 0; n cin >> a >> b; n string s; n cin >> s; n n = s.size(); n for (long long int i = 0; i <= n - 1; i++) { n if (s[i] == 1 ) { n if (fg == 0) { n p += a; n fg = 1; n k = 0; n } else if (k > 0) { n p += min(k * b, a); n k = 0; n continue; n } n } else n k++; n } n cout << p << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, a; n int main() { n scanf( %d%d , &n, &m); n if (n == 1) n printf( 1 n ); n else { n if (m > n / 2) n printf( %d n , m - 1); n else n printf( %d n , m + 1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a, b, res; n int main() { n cin >> n >> a >> b; n for (int i = 1; i <= min(a, b); i++) { n if (a / i + b / i >= n) { n res = i; n } n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const string ALICE = Alice , BOB = Bob ; n void solve_case() { n int N, K; n cin >> N >> K; n if (K % 3 != 0) { n cout << (N % 3 != 0 ? ALICE : BOB) << n ; n return; n } n N %= K + 1; n cout << (N % 3 == 0 && N < K ? BOB : ALICE) << n ; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int T; n cin >> T; n while (T-- > 0) solve_case(); n } n "} +{"func_code_string": "#include n using namespace std; n int a[105][105], u[105], v[105]; n int main() { n int n, m, k; n scanf( %d%d%d , &n, &m, &k); n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) scanf( %d , &a[i][j]); n for (int j = 0; j < m; j++) { n int cnt[105] = {}; n for (int i = 0; i < n; i++) n if (!u[i]) ++cnt[a[i][j]]; n for (int i = 0; i < n; i++) n if (!u[i] && a[i][j]) { n if (v[a[i][j]]) n u[i] = j + 1; n else if (cnt[a[i][j]] >= 2) n u[i] = v[a[i][j]] = j + 1; n } n } n for (int i = 0; i < n; i++) printf( %d n , u[i]); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, m; n cin >> n >> m; n if (2 * m >= n) n cout << 0; n else n cout << n - 2 * m; n cout << ; n for (long long i = 0; i <= n; i++) { n if ((i * (i - 1)) / 2 >= m) { n cout << n - i; n break; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int P = 1e9 + 7, INF = 0x3f3f3f3f; n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; } n long long qpow(long long a, long long n) { n long long r = 1 % P; n for (a %= P; n; a = a * a % P, n >>= 1) n if (n & 1) r = r * a % P; n return r; n } n long long inv(long long first) { n return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P; n } n inline int rd() { n int first = 0; n char p = getchar(); n while (p < 0 || p > 9 ) p = getchar(); n while (p >= 0 && p <= 9 ) first = first * 10 + p - 0 , p = getchar(); n return first; n } n const int N = 1e6 + 10; n int n, m, k, a[N], deg1[N], deg2[N]; n int L[N], R[N], vis[N]; n int first[N], second[N], b[N]; n vector g1[N], g2[N]; n int main() { n scanf( %d%d%d , &n, &m, &k); n for (int i = 1; i <= n; ++i) { n scanf( %d , a + i); n if (a[i]) n L[i] = R[i] = a[i]; n else n L[i] = 1, R[i] = k; n } n for (int i = 1; i <= m; ++i) { n scanf( %d%d , first + i, second + i); n g2[first[i]].push_back(second[i]), ++deg2[second[i]]; n g1[second[i]].push_back(first[i]), ++deg1[first[i]]; n } n queue q; n for (int i = 1; i <= n; ++i) n if (!deg1[i]) q.push(i); n int cnt = 0; n while (q.size()) { n int u = q.front(); n q.pop(); n if (L[u] > R[u]) return puts( -1 ), 0; n ++cnt; n for (auto &v : g1[u]) { n L[v] = max(L[v], L[u] + 1); n if (!--deg1[v]) q.push(v); n } n } n if (cnt != n) return puts( -1 ), 0; n for (int i = 1; i <= n; ++i) n if (!deg2[i]) q.push(i); n while (q.size()) { n int u = q.front(); n q.pop(); n if (L[u] > R[u]) return puts( -1 ), 0; n for (auto &v : g2[u]) { n R[v] = min(R[v], R[u] - 1); n if (!--deg2[v]) q.push(v); n } n } n for (int i = 1; i <= n; ++i) b[i] = i; n sort(b + 1, b + 1 + n, [](int a, int b) { return L[a] < L[b]; }); n int now = 1; n set > s; n for (int i = 1; i <= k; ++i) { n while (now <= n && L[b[now]] <= i) { n s.insert(pair(R[b[now]], b[now])); n ++now; n } n int ok = 0; n while (s.size()) { n int id = s.begin()->second; n if (ok && R[id] > i) break; n ok = 1; n s.erase(s.begin()); n a[id] = i; n } n if (!ok) return puts( -1 ), 0; n } n for (int i = 1; i <= n; ++i) printf( %d , a[i] ? a[i] : L[i]); n putchar(10); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 5; n const int M = 22; n int n, a[N]; n long long f[N][M][2]; n vector v[N]; n long long ans = 0; n void dfs(int x, int tr) { n ans += a[x]; n for (int i = 0; i < M; i++) { n f[x][i][(a[x] >> i) & 1]++; n } n for (auto u : v[x]) n if (u != tr) { n dfs(u, x); n for (int i = 0; i < M; i++) { n ans += (1 << i) * (f[x][i][0] * f[u][i][1] + f[x][i][1] * f[u][i][0]); n f[x][i][((a[x] >> i) & 1) ^ 0] += f[u][i][0]; n f[x][i][((a[x] >> i) & 1) ^ 1] += f[u][i][1]; n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n } n for (int i = 1; i < n; i++) { n int x, y; n cin >> x >> y; n v[x].push_back(y); n v[y].push_back(x); n } n dfs(1, 0); n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int DIM = 1005; n bitset oki; n int val[DIM], nxt[DIM]; n int main(void) { n ios ::sync_with_stdio(false); n cin.tie(); n cout.tie(); n int n, m, ans = 0; n cin >> n >> m; n for (int i = 1; i <= n; ++i) cin >> val[i], nxt[i] = -1; n for (int i = 1; i <= m; ++i) { n int x; n cin >> x; n for (int j = 1; j <= n; ++j) n if (nxt[x] < nxt[j]) ans += val[j]; n nxt[x] = i; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "// Author: wlzhouzhuan n #pragma GCC optimize( Ofast ) n #pragma GCC target( avx ) n #include n using namespace std; n n #define ull unsigned long long n n namespace IO { n const int SIZE = 1 << 23; n char ibuf[SIZE], *iS, *iT; n char obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1; n bool flush() { n fwrite(obuf, 1, oS - obuf, stdout); n oS = obuf; n return true; n } n #define gc() (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++) n #define pc(x) (*oS++ = x) n int read() { n int x = 0, f = 0; n char c = gc(); n while (!isdigit(c)) f |= c == - , c = gc(); n while (isdigit(c)) x = 10 * x + c - 0 , c = gc(); n return f ? -x : x; n } n char qu[55]; int qlen; n template void print(T x) { n if (!x) pc( 0 ); n if (x < 0) pc( - ), x = -x; n while (x) qu[++qlen] = x % 10 + 0 , x /= 10; n while (qlen) pc(qu[qlen--]); n } n template void print(T x, char charset) { n print(x), pc(charset); n } n struct Flusher { n ~Flusher() { n flush(); n } n } flusher; n } n using namespace IO; n n const int N = 1005; n const int mod = 998244353; n n int qpow(int a, int b = mod - 2) { n int res = 1; n while (b > 0) { n if (b & 1) res = 1ll * res * a % mod; n a = 1ll * a * a % mod; n b >>= 1; n } n return res; n } n n ull mul(ull a, ull b) { n return (static_cast(a) * b) % mod; n } n int a[N], m, n; n ull fz = 1, sumfz = 0, fm = 1, ans = 0; n int j = 0; n void run(int t) { n for (; j < t; j++) { n fz = mul(fz, 2 * n - j); n sumfz = mul(sumfz, (n - j)) + fz; n fm = mul(fm, n - j); n } n } n int main() { n m = read(); n for (int i = 1; i <= m; i++) { n a[i] = read(), n += a[i]; n } n sort(a + 1, a + m + 1); n for (int i = 1; i <= m; i++) { n run(a[i]); n ans = (ans + mul(sumfz, qpow(fm))) % mod; n } n run(n); n ans = (ans + mod - mul(sumfz, qpow(fm))) % mod; n print((mod - ans) % mod, n ); n return 0; n }"} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n if (n > m) swap(m, n); n long long cc = 0; n for (int i = 1; i <= n; i++) { n cc += (m + i) / 5 - i / 5; n } n cout << cc << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char c[101]; n int count = 0; n int sum = 0; n while (cin.getline(c, 101)) { n if (c[0] == + ) { n count++; n continue; n } n if (c[0] == - ) { n count--; n continue; n } n int x = 0; n for (; c[x] != : ; x++) { n } n sum += (strlen(c) - (x + 1)) * count; n } n cout << sum; n } n "} +{"func_code_string": "#include n using namespace std; n void __print(int x) { cerr << x; } n void __print(long x) { cerr << x; } n void __print(long long x) { cerr << x; } n void __print(unsigned x) { cerr << x; } n void __print(unsigned long x) { cerr << x; } n void __print(unsigned long long x) { cerr << x; } n void __print(float x) { cerr << x; } n void __print(double x) { cerr << x; } n void __print(long double x) { cerr << x; } n void __print(char x) { cerr << << x << ; } n void __print(const char *x) { cerr << << x << ; } n void __print(const string &x) { cerr << << x << ; } n void __print(bool x) { cerr << (x ? true : false ); } n template n void __print(const pair &x) { n cerr << { ; n __print(x.first); n cerr << , ; n __print(x.second); n cerr << } ; n } n template n void __print(const T &x) { n int f = 0; n cerr << { ; n for (auto &i : x) cerr << (f++ ? , : ), __print(i); n cerr << } ; n } n void _print() { cerr << ] n ; } n template n void _print(T t, V... v) { n __print(t); n if (sizeof...(v)) cerr << , ; n _print(v...); n } n const int SIZE = 2e5 + 5; n const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; n const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; n void fastio() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n } n void solveTest() { n long long n, m; n cin >> n >> m; n --m; n vector a(n); n long long mn = INT_MAX; n for (int i = 0; i < n; i++) { n cin >> a[i]; n mn = min(mn, a[i]); n } n for (int i = 0; i < n; i++) { n a[i] -= mn; n } n long long cnt = (1ll * mn) * n; n while (a[m] != 0) { n a[m]--; n cnt++; n if (m == 0) n m = n - 1; n else n m--; n } n a[m] = cnt; n for (int i = 0; i < n; i++) { n cout << a[i] << ; n } n return; n } n int main() { n fastio(); n int t = 1; n while (t--) { n solveTest(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k; n int log2(long long x) { n int ret = 0; n while (x > 0) { n x /= 2; n ret++; n } n return ret; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n clock_t ck; n ck = clock(); n cin >> n >> k; n if (k == 1) { n cout << n << n ; n return 0; n } n int exp = log2(n); n cout << (1ll << exp) - 1 << n ; n ck = clock() - ck; n cerr << It took << 1.0 * ck / CLOCKS_PER_SEC << sec n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n n int n; n inline int lst(int i){return i==1?n:i-1;} n inline int nxt(int i){return i==n?1:i+1;} n inline int lst(int i,int d){return (((i-d-1)%n+n)%n+1);} n inline int nxt(int i,int d){return ((i+d-1)%n+1);} n n inline int getval(){ n fflush(stdout); n int val; n scanf( %d ,&val); n return val; n } n inline int curval(int i){ n printf( ? %d n n ,i); n return getval(); n } n inline int lstval(int i){ n printf( ? %d n n ,lst(i)); n return getval(); n } n inline int nxtval(int i){ n printf( ? %d n n ,nxt(i)); n return getval(); n } n n int k; n int a[200],b[200]; n n inline void ansis(int ans) n { n printf( ! %d n ,ans); n exit(0); n } n inline void findit(int pos,int val,int len) n { n if (val>k){ n int lef=1,rig=len,mid; n while (lef<=rig){ n mid=((lef+rig)>>1); n int curpos=lst(pos,mid); n int cur=curval(curpos); n if (cur==k) ansis(curpos); n if (cur>k) lef=mid+1; else rig=mid-1; n } n }else{ n int lef=1,rig=len,mid; n while (lef<=rig){ n mid=((lef+rig)>>1); n int curpos=nxt(pos,mid); n int cur=curval(curpos); n if (cur==k) ansis(curpos); n if (cur n using namespace std; n const int N = 100000 + 77; n int n, q; n long long a[N]; n vector V, Ps; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; ++i) scanf( %lld , a + i); n if (n == 1) { n int q; n scanf( %d , &q); n long long x, y; n while (q--) { n scanf( %lld %lld , &x, &y); n x = y - x + 1; n printf( %lld , x); n } n return 0; n } n sort(a + 1, a + 1 + n); n for (int i = 2; i <= n; ++i) V.push_back(a[i] - a[i - 1]); n sort(V.begin(), V.end()); n Ps.push_back(V[0]); n for (int i = 3; i <= n; ++i) Ps.push_back(Ps.back() + V[i - 2]); n int sz = V.size(); n scanf( %d , &q); n while (q--) { n long long x, y; n scanf( %lld %lld , &x, &y); n x = y - x + 1; n int id = upper_bound(V.begin(), V.end(), x - 1) - V.begin() - 1; n long long A = 0; n if (id == -1) { n A = n * x; n } else { n A = (n - id - 1) * x + Ps[id]; n } n printf( %lld , A); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector prefix_function(string s) { n int n = (int)s.length(); n vector pi(n); n for (int i = 1; i < n; ++i) { n int j = pi[i - 1]; n while (j > 0 && s[i] != s[j]) j = pi[j - 1]; n if (s[i] == s[j]) ++j; n pi[i] = j; n } n return pi; n } n int main() { n int t, n, x = 0; n cin >> t >> n; n string s; n cin >> s; n cout << s; n vector v = prefix_function(s); n s = s.substr(v[v.size() - 1], s.size() - v[v.size() - 1]); n for (int i = 1; i < n; i++) { n cout << s; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long a, b; n cin >> a >> b; n long long d = abs(a - b); n long long p1 = (d + 1) / 2, p2 = d / 2; n long long s1 = (p1 * (p1 + 1)) / 2, s2 = (p2 * (p2 + 1)) / 2; n cout << s1 + s2; n } n "} +{"func_code_string": "#include n using namespace std; n int n, q; n int a[200010]; n int last[200010]; n int x = -1, y = -1, z = -1; n stack t; n int main() { n scanf( %d%d , &n, &q); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n if (a[i] == 0) { n z = i; n if (i) a[i] = a[i - 1]; n } else { n if (x == -1) x = i; n if (a[i] == q) y = i; n } n } n if (x == -1) { n cout << YES << endl; n for (int i = 0; i < n; i++) cout << q << ; n return 0; n } n for (int i = x - 1; i >= 0; i--) a[i] = a[i + 1]; n if (y == -1) { n if (z == -1) { n cout << NO << endl; n return 0; n } n a[z] = q; n } n for (int i = 0; i < n; i++) last[a[i]] = i; n for (int i = 0; i < n; i++) { n if (!t.empty() && t.top() > a[i]) { n cout << NO << endl; n return 0; n } else if (t.empty() || t.top() < a[i]) n t.push(a[i]); n if (last[a[i]] == i) t.pop(); n } n cout << YES << endl; n for (int i = 0; i < n; i++) cout << a[i] << ; n return 0; n } n "} +{"func_code_string": "#include n char c[99]; n int i, x; n int main() { n for (;;) { n scanf( %s , c); n fflush(stdout); n ; n if (*c == e ) break; n for (i = 2; i <= 1 << 30; i <<= 1) { n printf( ? %d %d n , i, i >> 1); n fflush(stdout); n ; n scanf( %s , c); n fflush(stdout); n ; n if (*c == y || i == 1 << 30) break; n } n if (*c == x ) { n puts( ! 1 ); n fflush(stdout); n ; n continue; n } n int l = i >> 1, r = i, m; n for (; l + 1 < r;) { n m = (l + r) >> 1; n printf( ? %d %d n , l, m); n fflush(stdout); n ; n scanf( %s , c); n fflush(stdout); n ; n if (*c == y ) n l = m; n else n r = m; n } n printf( ! %d n , r); n fflush(stdout); n ; n } n return 0; n } n "} +{"func_code_string": "#include n const int maxn = 1e5 + 500; n const int mod = 1e9 + 7; n const int inf = 123456789; n using namespace std; n int n, t, a, b, c; n vector v[maxn], ans2[maxn]; n vector ans; n set st[maxn]; n int vis[maxn]; n map, int> mp; n void add(int a, int b, int i) { n if (mp.find({a, b}) != mp.end()) { n int x = mp[{a, b}]; n ans2[x].push_back(i); n ans2[i].push_back(x); n mp.erase({a, b}); n } else { n mp[{a, b}] = i; n } n } n void ins(int a, int b) { n if (st[a].count(b)) { n st[a].erase(b); n } else { n st[a].insert(b); n } n if (st[b].count(a)) { n st[b].erase(a); n } else { n st[b].insert(a); n } n } n void dfs(int x, int fa) { n vis[x] = 1; n ans.push_back(x); n for (int i : v[x]) { n if (i == fa || vis[i]) continue; n dfs(i, x); n if (x == 1) break; n } n } n void dfs1(int x, int fa) { n for (int i : ans2[x]) { n if (i != fa) { n dfs1(i, x); n } n } n cout << x << ; n } n void init(int x) { n ans.clear(); n mp.clear(); n memset(vis, 0, sizeof(vis)); n for (int i = 1; i <= x; i++) { n ans2[i].clear(); n v[i].clear(); n st[i].clear(); n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int t; n cin >> t; n while (t--) { n cin >> n; n init(n); n for (int i = 1; i < n - 1; i++) { n cin >> a >> b >> c; n if (a > b) swap(a, b); n if (a > c) swap(a, c); n if (b > c) swap(b, c); n ins(a, b); n ins(a, c); n ins(b, c); n add(a, b, i); n add(a, c, i); n add(b, c, i); n } n for (int i = 1; i <= n; i++) { n for (int it : st[i]) { n v[i].push_back(it); n } n } n dfs(1, 0); n for (int i : ans) { n cout << i << ; n } n cout << n ; n dfs1(1, 0); n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int Tn; n cin >> Tn; n while (Tn--) { n int n, x; n cin >> n >> x; n int mx = 0, flag = 0; n while (n--) { n int t; n cin >> t; n if (t == x) flag = 1; n mx = max(mx, t); n } n if (!flag) n printf( %d n , max((x - 1) / mx + 1, 2)); n else n printf( %d n , 1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1010; n long long c[2][2][MAXN][MAXN] = {0}; n int n, m; n long long val; n int lowbit(int x) { return x & -x; } n void add(int a, int b) { n for (int i = a; i <= n; i += lowbit(i)) n for (int j = b; j <= n; j += lowbit(j)) c[a & 1][b & 1][i][j] ^= val; n } n long long sum(int a, int b) { n long long ans = 0; n for (int i = a; i >= 1; i -= lowbit(i)) n for (int j = b; j >= 1; j -= lowbit(j)) ans ^= c[a & 1][b & 1][i][j]; n return ans; n } n int main() { n scanf( %d%d , &n, &m); n int x1, x2, y1, y2, op; n long long ans; n for (int i = 1; i <= m; i++) { n scanf( %d , &op); n if (op == 1) { n scanf( %d%d%d%d , &x1, &y1, &x2, &y2); n ans = n sum(x2, y2) ^ sum(x2, y1 - 1) ^ sum(x1 - 1, y2) ^ sum(x1 - 1, y1 - 1); n printf( %I64d n , ans); n } else { n scanf( %d%d%d%d%I64d , &x1, &y1, &x2, &y2, &val); n add(x1, y1); n add(x2 + 1, y1); n add(x1, y2 + 1); n add(x2 + 1, y2 + 1); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n constexpr int maxn = 1010; n constexpr int dx[5] = {0, 0, 1, -1}; n constexpr int dy[5] = {1, -1, 0, 0}; n using Node = struct { int x, y, v; }; n char G[maxn][maxn]; n bool vis[maxn][maxn]; n int n, m; n vector p, ret; n inline bool ok(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; } n void gao(int x, int y) { n int tot = 1; n bool flag = true; n bool yes = false; n while (flag) { n flag = false; n int cnt = 0; n for (int i = 0; i < 4; i++) { n int tx = x + dx[i] * tot; n int ty = y + dy[i] * tot; n if (ok(tx, ty) && G[tx][ty] == * ) cnt++; n } n if (cnt != 4) break; n for (int i = 0; i < 4; i++) { n int tx = x + dx[i] * tot; n int ty = y + dy[i] * tot; n vis[tx][ty] = 1; n } n flag = true; n yes = true; n tot++; n } n if (yes) { n vis[x][y] = 1; n ret.push_back({x + 1, y + 1, tot - 1}); n } n } n signed main() { n while (~scanf( %d%d , &n, &m)) { n p.clear(); n ret.clear(); n memset(vis, 0, sizeof(vis)); n for (int i = 0; i < n; i++) scanf( %s , G[i]); n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (G[i][j] == * ) p.push_back({i, j, 0}); n } n } n if (p.size() == 0) { n printf( 0 n ); n continue; n } n for (auto t : p) gao(t.x, t.y); n if (ret.size() == 0) { n printf( -1 n ); n continue; n } n bool flag = 0; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n if (!vis[i][j] && G[i][j] == * ) { n flag = 1; n } n } n } n if (flag) { n printf( -1 n ); n continue; n } n printf( %d n , ret.size()); n for (auto t : ret) { n printf( %d %d %d n , t.x, t.y, t.v); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dp[1003][1003][11][2]; n string s, t; n int n, m; n int k; n int rec(int i, int j, int how_k, int op) { n if (how_k > k) return -1e9; n if (i >= n || j >= m) { n if (how_k == k && !op) return 0; n return -1e9; n } n if (s[i] != t[j] && op) return -1e9; n int &ret = dp[i][j][how_k][op]; n if (ret != -1) return ret; n ret = -1e9; n if (s[i] == t[j]) { n if (op) { n ret = max(ret, rec(i + 1, j + 1, how_k + 1, 0) + 1); n ret = max(ret, rec(i + 1, j + 1, how_k, op) + 1); n } else { n ret = max(ret, rec(i + 1, j + 1, how_k + 1, op) + 1); n ret = max(ret, rec(i + 1, j + 1, how_k, 1) + 1); n } n } n ret = max(ret, rec(i + 1, j, how_k + (op == 1), 0)); n ret = max(ret, rec(i, j + 1, how_k + (op == 1), 0)); n return ret; n } n int main() { n cin >> n >> m >> k; n memset(dp, -1, sizeof dp); n cin >> s >> t; n cout << rec(0, 0, 0, 0); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 200500; n int mapp[maxn], num[maxn], ans[maxn]; n int main() { n int n, a, b, k; n while (cin >> n >> a >> b >> k) { n memset(ans, 0, sizeof(ans)); n char c; n for (int i = 0; i < n; i++) { n cin >> c; n mapp[i] = c - 0 ; n } n int len = 0, pos = 0, tk = a; n int sum, sum2 = 0; n for (int i = 0; i < n; i++) { n if (0 == mapp[i]) len++; n if (1 == mapp[i] || i == n - 1) { n num[pos++] = len; n int kk = len / b; n if (kk <= tk) n tk -= kk; n else { n if (i == n - 1 && !mapp[i]) i++; n for (int j = tk + 1; j <= kk; j++) { n ans[i - len - 1 + j * b] = 1; n sum2++; n } n tk = 0; n } n len = 0; n } n } n sum = 1; n len = 0; n for (int i = 0; i < n; i++) { n if (0 == mapp[i]) len++; n if ((1 == mapp[i] || i == n - 1) && sum > 0) { n if (i == n - 1 && !mapp[i]) i++; n int kk = len / b; n for (int j = 1; j <= kk; j++) { n sum--; n if (!ans[i - len - 1 + j * b]) sum2++; n ans[i - len - 1 + j * b] = 1; n if (sum <= 0) break; n } n len = 0; n } n } n cout << sum2 << endl; n int flag = 0; n for (int i = 0; i < n; i++) { n if (!ans[i]) continue; n if (!flag) n flag = 1; n else n cout << ; n cout << i + 1; n } n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, n1, n2, a[111111], sum1 = 0, sum2 = 0; n int main() { n cin >> n >> n1 >> n2; n for (int i = 0; i < n; i++) cin >> a[i]; n if (n1 > n2) swap(n1, n2); n sort(a, a + n); n reverse(a, a + n); n int i = 0; n int m1 = n1; n int m2 = n2; n while (m1 != 0) { n sum1 += a[i]; n i++; n m1--; n } n while (m2 != 0) { n sum2 += a[i]; n i++; n m2--; n } n cout << fixed << setprecision(7) << (sum1 * 1.0 / n1) + (sum2 * 1.0 / n2); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 110000; n int s1, s2; n int n, a[N]; n int mi[17][N * 2], ma[17][N * 2]; n int BB[N * 2]; n int getmi(int l, int r) { n return min(mi[BB[r - l + 1]][l], n mi[BB[r - l + 1]][r - (1 << BB[r - l + 1]) + 1]); n } n int getma(int l, int r) { n return max(ma[BB[r - l + 1]][l], n ma[BB[r - l + 1]][r - (1 << BB[r - l + 1]) + 1]); n } n void init() { n for (int j = (int)0; j <= (int)16; j++) n for (int i = (int)(1 << j); i <= (int)(1 << (j + 1)) - 1; i++) BB[i] = j; n for (int i = (int)1; i <= (int)n; i++) { n mi[0][i] = ma[0][i] = a[i]; n } n for (int j = (int)1; j <= (int)16; j++) n for (int i = (int)1; i <= (int)n - (1 << j) + 1; i++) { n mi[j][i] = min(mi[j - 1][i], mi[j - 1][i + (1 << (j - 1))]); n ma[j][i] = max(ma[j - 1][i], ma[j - 1][i + (1 << (j - 1))]); n } n } n bool f[N], g[N]; n bool check(int S) { n for (int i = (int)0; i <= (int)n; i++) f[i] = g[i] = 0; n f[0] = g[0] = 1; n int maf, mag; n maf = mag = 0; n for (int i = (int)0; i <= (int)n - 1; i++) { n bool f1 = (i <= maf); n bool f2 = (i <= mag); n if (f1) { n int now = a[i]; n if (i == 0) now = s1; n int l = i + 1; n int r = n; n int rt = 0; n while (l < r) { n int mid = (l + r) >> 1; n if ((abs(getma(i + 1, mid) - now) > S) || n (abs(getmi(i + 1, mid) - now) > S)) n r = mid; n else n l = mid + 1, rt = mid; n } n if (!(abs((getma(i + 1, l) - now) > S) || n (abs(getmi(i + 1, l) - now) > S))) n rt = l; n mag = max(mag, rt); n } n if (f2) { n int now = a[i]; n if (i == 0) now = s2; n int l = i + 1; n int r = n; n int rt = 0; n while (l < r) { n int mid = (l + r) >> 1; n if ((abs(getma(i + 1, mid) - now) > S) || n (abs(getmi(i + 1, mid) - now) > S)) n r = mid; n else n l = mid + 1, rt = mid; n } n if (!((abs(getma(i + 1, l) - now) > S) || n (abs(getmi(i + 1, l) - now) > S))) n rt = l; n maf = max(maf, rt); n } n } n return (maf == n) || (mag == n); n } n int main() { n scanf( %d%d%d , &n, &s1, &s2); n for (int i = (int)1; i <= (int)n; i++) scanf( %d , &a[i]); n init(); n int L = abs(s1 - s2); n int R = 1000000000; n int ans = 0; n while (L < R) { n int mid = (L + R) >> 1; n if (check(mid)) n ans = mid, R = mid; n else n L = mid + 1; n } n if (check(L)) ans = L; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#pragma GCC diagnostic ignored -Wunused-parameter n #define _USE_MATH_DEFINES n #include n n using namespace std; n n #define INP solve n #define OUT solve n n const long long INF_LL = 8e18; n const int INF = 1e9 + 100; n const int MOD = 1e9 + 7; n //const int Base = 311;9 n const long double EPS = 1e-10; n const int BLOCK = 1000; n const int dx[4] = {0, 0, 1, -1}; n const int dy[4] = {1, -1, 0, 0}; n mt19937 rnd(chrono::system_clock::now().time_since_epoch().count()); n n void open_file() { n #ifdef THEMIS n freopen(INP .inp , r ,stdin); n freopen(OUT .out , w ,stdout); n #endif // THEMIS n } n n const int maxN = 3e5 + 100; n n void sol(){ n int n; n cin >> n; n vector > s(n); n map id; n int M = 0; n int N = 0; n for (int i = 0; i < n; i++) { n int k; n cin >> k; n M += k; n s[i].resize(k); n for (int j = 0; j < k; j++) { n int x; n cin >> x; n if (!id.count(x)) id[x] = N++; n s[i][j] = id[x]; n } n sort(s[i].begin(), s[i].end()); n } n int block = (int)sqrt(M) + 1; n vector large, small; n for (int i = 0; i < n; i++) { n if ((int)s[i].size() >= block) large.push_back(i); n else small.push_back(i); n } n n int time = 0; n vector visited(N, 0); n for (int u : large) { n time++; n for (int x : s[u]) visited[x] = time; n for (int v = 0; v < n; v++) { n if (u == v) continue; n int d = 0; n for (int val : s[v]) { n d += visited[val] == time; n if (d == 2) { n cout << u + 1 << << v + 1 << n ; n return; n } n } n } n } n n vector > adj(N); n for (int i = 0; i < n; i++) { n for (int x : s[i]) adj[x].push_back(i); n } n vector last(N, -1), pos(N, -1); n for (int u = 0; u < N; u++) { n for (int i : adj[u]) { n if ((int)s[i].size() < block) { n for (int j = 0; j < (int)s[i].size() && s[i][j] < u; j++) { n int v = s[i][j]; n if (last[v] == u) { n cout << pos[v] + 1 << << i + 1 << n ; n return; n } n last[v] = u; n pos[v] = i; n } n } n } n } n n cout << -1 << n ; n } n n void solve() { n clock_t begin = clock(); n int T; n cin >> T; n //T = 1; n int TestCase = 0; n while (T--) { n TestCase += 1; n //cout << Case # << TestCase << : << ; n //cout << Test << TestCase << : ; n sol(); n } n clock_t end = clock(); n cerr << Time: << fixed << setprecision(10) << (double)(end - begin) / (double)CLOCKS_PER_SEC << n ; n } n n int main(int argc,char *argv[]) { n ///srand(time(nullptr)); n ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); n open_file(); n solve(); n }"} +{"func_code_string": "#include n #define int long long n #define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) n n using namespace std; n n #define MOD 1000000007 n #define nline n n #define pb push_back n #define mp make_pair n #define fi first n #define se second n #define yes cout<< YES n n #define no cout<< NO n n #define vi vector n #define pii pair n #define sz(v) v.size() n #define lcm(a,b) (a*b)/(__gcd(a,b)) n #define deb(x) cout<<#x<< = <()) n #define maxHeap priority_queue n #define minHeap priority_queue, greater> n n int pow(int a, int b, int m){ n int ans = 1; n while(b){ n if (b&1) ans = (ans*a) % m; n b /= 2; n a = (a*a) % m; n } n return ans; n } n n int SumOfDigits(int x) n { n if (x < 0)return -1; n int s = 0; n while(x) n { n s += x%10; n x /= 10; n } n n return s; n } n n //lower_bound = first element >= val, end otherwise n //upper_bound = first element > val, end otherwise n //remember 2 pointer , binary search , bits method n //always look for the edges i.e max value ad min value possible n n inline void solve() n { n int k,n,m; n cin>>k>>n>>m; n int a[n],b[m]; n int cnt1 = 0,cnt2=0; n vi x,y; n for(int i=0;i>a[i]; n } n for(int i=0;i>b[i]; n } n vi ans; n int i=0,j=0; n int total = k; n while(1) n { n if(sz(ans)==n+m) n break; n if(a[i]==0 && i=m)) n { n if(total>=a[i]) n { n ans.pb(a[i]); n i++; n } n else n { n cout<<-1<=b[j] && (j=n) ) n { n if(total>=b[j]) n { n ans.pb(b[j]); n j++; n } n else n { n cout<<-1<>t; n for(int tt=1;tt<=t;tt++) n { n // cout<< Case # < n using namespace std; n const int N = 503; n int m, n, vis[N][N]; n vector adj[N * N]; n void init() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n } n int id(int x, int y) { return (x - 1) * n + y; } n struct ds { n char c; n int x, y; n }; n vector V; n void print(int u, int cc, int type = -1) { n int x = (u - 1) / n + 1, y = u - (x - 1) * n; n if (adj[u].size() == 0 && !type) { n V.push_back((ds){ R , x, y}); n return; n } n V.push_back((ds){ B , x, y}); n for (int v : adj[u]) print(v, cc, 0); n if (!type) V.push_back((ds){ D , x, y}), V.push_back((ds){ R , x, y}); n } n int cc = 0; n queue > Q; n int hang[4] = {0, 0, 1, -1}; n int cot[4] = {1, -1, 0, 0}; n void build(int orgx, int orgy, int cc) { n vis[orgx][orgy] = cc; n Q.push({orgx, orgy}); n while (Q.size()) { n int x = Q.front().first, y = Q.front().second; n Q.pop(); n for (int t = 0; t <= (int)3; ++t) { n int nx = x + hang[t], ny = y + cot[t]; n if (nx < 1 || nx > m || ny < 1 || ny > n || vis[nx][ny]) continue; n adj[id(x, y)].push_back(id(nx, ny)); n vis[nx][ny] = cc; n Q.push({nx, ny}); n } n } n print(id(orgx, orgy), cc); n } n void solve() { n cin >> m >> n; n for (int i = 1; i <= (int)m; ++i) n for (int j = 1; j <= (int)n; ++j) { n char c; n cin >> c; n if (c == # ) vis[i][j] = -1; n } n for (int i = 1; i <= (int)m; ++i) n for (int j = 1; j <= (int)n; ++j) n if (!vis[i][j]) build(i, j, ++cc); n cout << V.size() << n ; n for (ds it : V) cout << it.c << << it.x << << it.y << n ; n } n int main() { n init(); n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n queue q; n const int maxn = 40007; n const int maxm = 800007; n const int inf = 0x7f7f7f7f; n struct E { n int u, v, w, cf; n } e[maxm]; n int first[maxn], nt[maxm], ES = 1; n bool acc[maxm]; n inline void addE(int u, int v, int w, int cf) { n e[++ES] = (E){u, v, w, cf}; n nt[ES] = first[u]; n first[u] = ES; n return; n } n inline void add(int u, int v, int w) { n addE(u, v, w, 1); n addE(v, u, w, 0); n return; n } n int tot; n int N, M; n int cur[maxn]; n int dep[maxn]; n int S, T; n bool BFS() { n memset(dep, 0, sizeof(dep)); n dep[S] = 1; n q.push(S); n int u, v; n while (!q.empty()) { n u = q.front(); n q.pop(); n for (int i = first[u]; i; i = nt[i]) { n v = e[i].v; n if (e[i].cf > 0 && acc[i] && !dep[v]) { n dep[v] = dep[u] + 1; n q.push(v); n } n } n } n return dep[T] != 0; n } n int dfs(int u, int f) { n if (u == T) return f; n int v, d, sum = 0; n for (int &i = cur[u]; i; i = nt[i]) { n v = e[i].v; n if (dep[v] == dep[u] + 1 && e[i].cf > 0 && acc[i]) { n d = dfs(v, min(f, e[i].cf)); n if (d > 0) { n sum += d; n f -= d; n e[i].cf -= d; n e[i ^ 1].cf += d; n if (f <= 0) return sum; n } n } n } n return sum; n } n int solve() { n int re = 0; n while (BFS()) { n memcpy(cur, first, sizeof(first)); n re += dfs(S, inf); n } n return re; n } n bool check(int p) { n for (int i = 1; i <= ES; i++) { n if (e[i].w <= p) n acc[i] = true; n else n acc[i] = false; n e[i].cf = (i & 1) ^ 1; n } n return solve() == N; n } n int main() { n scanf( %d%d , &N, &M); n int u, v, w; n int L = 0, R = 0, mid, ans = -1; n for (int i = 1; i <= M; i++) scanf( %d%d%d , &u, &v, &w), add(u, v + N, w); n S = 0; n T = 2 * N + 1; n for (int i = 1; i <= N; i++) add(S, i, -1), add(i + N, T, -1); n R = 1e9; n while (L <= R) { n mid = L + R >> 1; n if (check(mid)) n ans = mid, R = mid - 1; n else n L = mid + 1; n } n printf( %d , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6; n int Left[N], Right[N]; n void pre(int node) { n if (node == -1) return; n pre(Left[node]); n printf( %d n , node + 1); n pre(Right[node]); n } n int main() { n memset(Left, -1, sizeof Left); n memset(Right, -1, sizeof Right); n string s; n cin >> s; n for (int i = 0; i + 1 < (int)s.size(); ++i) n if (s[i] == l ) n Left[i] = i + 1; n else n Right[i] = i + 1; n pre(0); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e5 + 10; n const int maxm = 1e3 + 5; n const int mod = 1e9 + 7; n const int inf = 0x3f3f3f3f; n int a[maxn], ans[maxn], l[maxn][6], r[maxn][6]; n inline void solve() { n int n; n scanf( %d , &n); n for (int i = 1; i < n + 1; i++) scanf( %d , &a[i]); n memset(l, -1, sizeof l); n memset(r, -1, sizeof r); n if (a[1] > 1) { n puts( -1 ); n exit(0); n } n l[1][1] = r[1][1] = 1; n for (int i = 2; i < n + 1; i++) { n for (int j = 2; j < 5 + 1; j++) { n if (l[i - 1][j - 1] != -1) { n l[i][j] = l[i - 1][j - 1]; n r[i][j] = r[i - 1][j - 1]; n } n } n for (int j = 2; j < 5 + 1; j++) { n if (l[i - 1][j] != -1) { n if (l[i][1] == -1) l[i][1] = inf; n l[i][1] = min(l[i][1], l[i - 1][j] + 1); n r[i][1] = max(r[i][1], r[i - 1][j] + 1); n } n } n if (a[i]) { n for (int j = 1; j < 5 + 1; j++) { n if (l[i][j] != -1) { n if (l[i][j] <= a[i] && a[i] <= r[i][j]) n l[i][j] = r[i][j] = a[i]; n else n l[i][j] = r[i][j] = -1; n } else n r[i][j] = -1; n } n } n bool ok = 0; n for (int j = 1; j < 5 + 1; j++) { n if (l[i][j] <= r[i][j] && l[i][j] != -1) { n ok = 1; n break; n } n } n if (!ok) { n puts( -1 ); n exit(0); n } n } n int up = 0, j = 2; n for (int i = 2; i < 5 + 1; i++) { n if (l[n][i] <= r[n][i] && l[n][i] != -1) { n if (r[n][i] > up) { n up = r[n][i]; n j = i; n } n } n } n if (up == 0) { n puts( -1 ); n exit(0); n } n printf( %d n , up); n int m = n; n while (m) { n for (int i = m - j; i < m + 1; i++) ans[i] = up; n m -= j; n up--; n for (int i = 2; i < 5 + 1; i++) { n if (l[m][i] <= up && up <= r[m][i]) j = i; n } n } n for (int i = 1; i < n + 1; i++) { n if (i == 1) n printf( %d , ans[i]); n else n printf( %d , ans[i]); n } n puts( ); n } n int main() { n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Edge { n int v, next; n } edge[2050]; n int e, ft[2050]; n int a, n, m; n bool rain[2050]; n int x[2050], p[2050]; n long long dp[2050][2050]; n long long opt[2050]; n int main() { n int l, r; n while (cin >> a >> n >> m) { n e = 0; n for (int i = 0; i <= a; i++) { n rain[i] = false; n for (int j = 0; j <= m; j++) dp[i][j] = (1ll << 60); n ft[i] = -1; n } n for (int i = 0; i < n; i++) { n scanf( %d%d , &l, &r); n while (l < r) { n rain[l++] = true; n } n } n for (int i = 0; i < m; i++) { n scanf( %d%d , x + i, p + i); n edge[e].v = i; n edge[e].next = ft[x[i]]; n ft[x[i]] = e++; n if (x[i] == 0) dp[0][i] = 0; n } n dp[0][m] = 0; n p[m] = 0; n opt[0] = 0; n for (int i = 0; i < a; i++) { n for (int j = 0; j <= m; j++) { n if (dp[i][j] >= (1ll << 60)) continue; n if (j < m || !rain[i]) n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + p[j]); n } n opt[i + 1] = (1ll << 60); n for (int j = 0; j <= m; j++) opt[i + 1] = min(opt[i + 1], dp[i + 1][j]); n for (int j = ft[i + 1]; j != -1; j = edge[j].next) { n int idx = edge[j].v; n dp[i + 1][idx] = min(dp[i + 1][idx], opt[i + 1]); n } n dp[i + 1][m] = min(dp[i + 1][m], opt[i + 1]); n } n long long ans = -1; n if (opt[a] < (1ll << 60)) ans = opt[a]; n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void fastIO(void); n void decimal(int); n long long int modmulti(long long int, long long int, long long int); n long long int modadd(long long int, long long int, long long int); n long long int modpower(long long int, long long int, long long int); n long long int gcd(long long int, long long int); n long long int modinv(long long int, long long int); n int main() { n fastIO(); n long long int n; n cin >> n; n long long int t1, t2; n vector a(n); n multiset b; n for (long long int i = 0; i < n; i++) cin >> a[i]; n for (long long int i = 0; i < n; i++) { n cin >> t1; n b.insert(t1); n } n long long int c[n]; n for (long long int i = 0; i < n; i++) { n t2 = n - a[i]; n auto itr = b.lower_bound(n - a[i]); n if (itr == b.end()) itr = b.begin(); n c[i] = (a[i] + *itr) % n; n b.erase(itr); n } n for (long long int i = 0; i < n; i++) cout << c[i] << ; n cout << n ; n } n void fastIO(void) { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n } n void decimal(int n) { n cout << fixed; n cout << setprecision(n); n } n long long int modmulti(long long int a, long long int b, long long int m) { n return ((a % m) * (b % m)) % m; n } n long long int modadd(long long int a, long long int b, long long int m) { n return ((a % m) + (b % m) + m) % m; n } n long long int modpower(long long int a, long long int n, long long int m) { n if (n == 0) return 1; n long long int result = 1; n while (n > 0) { n if (n % 2 == 1) result = modmulti(result, a, m); n a = modmulti(a, a, m); n n = n / 2; n } n return result; n } n long long int gcd(long long int a, long long int b) { n if (b == 0) return a; n return gcd(b, a % b); n } n long long int modinv(long long int a, long long int m) { n return modpower(a, m - 2, m); n } n "} +{"func_code_string": "#include n using namespace std; n const static int maxN = 1000; n struct { n int r, c; n } tooth[maxN]; n int toothrow[maxN + 1]; n int main() { n int n, m, k; n int i; n int ans; n while (scanf( %d%d%d , &n, &m, &k) != EOF) { n for (i = 0; i < n; i++) { n scanf( %d%d , &tooth[i].r, &tooth[i].c); n } n memset(toothrow, -1, sizeof(int) * (m + 1)); n ans = 0; n for (i = 0; i < n; i++) { n if (toothrow[tooth[i].r] != -1) { n if (tooth[i].c < toothrow[tooth[i].r]) { n ans -= toothrow[tooth[i].r]; n ans += tooth[i].c; n toothrow[tooth[i].r] = tooth[i].c; n } n } else { n ans += tooth[i].c; n toothrow[tooth[i].r] = tooth[i].c; n } n } n printf( %d n , min(ans, k)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n namespace { n using namespace std; n template n struct PushRelabel { n struct Edge { n int to, rev; n flow_t f, c; n }; n vector> g; n vector ec; n vector cur; n vector> hs; n vector H; n PushRelabel(int n) : g(n), ec(n), cur(n), hs(2 * n), H(n) {} n void add_edge(int s, int t, flow_t cap, flow_t rcap = 0) { n if (s == t) return; n Edge a = {t, (int)g[t].size(), 0, cap}; n Edge b = {s, (int)g[s].size(), 0, rcap}; n g[s].push_back(a); n g[t].push_back(b); n } n void add_flow(Edge& e, flow_t f) { n Edge& back = g[e.to][e.rev]; n if (!ec[e.to] && f) hs[H[e.to]].push_back(e.to); n e.f += f; n e.c -= f; n ec[e.to] += f; n back.f -= f; n back.c += f; n ec[back.to] -= f; n } n flow_t max_flow(int s, int t) { n const int n = g.size(); n ec.assign(n, 0); n cur.assign(n, nullptr); n hs.assign(2 * n, {}); n H.assign(n, 0); n int v = g.size(); n H[s] = v; n ec[t] = 1; n vector co(2 * v); n co[0] = v - 1; n for (int i = 0; i < v; ++i) cur[i] = g[i].data(); n for (auto& e : g[s]) add_flow(e, e.c); n if (hs[0].size()) n for (int hi = 0; hi >= 0;) { n int u = hs[hi].back(); n hs[hi].pop_back(); n while (ec[u] > 0) n if (cur[u] == g[u].data() + g[u].size()) { n H[u] = 1e9; n for (auto& e : g[u]) n if (e.c && H[u] > H[e.to] + 1) H[u] = H[e.to] + 1, cur[u] = &e; n if (++co[H[u]], !--co[hi] && hi < v) n for (int i = 0; i < v; ++i) n if (hi < H[i] && H[i] < v) { n --co[H[i]]; n H[i] = v + 1; n } n hi = H[u]; n } else if (cur[u]->c && H[u] == H[cur[u]->to] + 1) n add_flow(*cur[u], min(ec[u], cur[u]->c)); n else n ++cur[u]; n while (hi >= 0 && hs[hi].empty()) --hi; n } n return -ec[s]; n } n }; n template n struct MaxFlow { n static constexpr flow_t INF = numeric_limits::max(); n PushRelabel flow; n MaxFlow(const int n) : flow(n) {} n inline void add_arc(const int u, const int v, const flow_t capacity) { n flow.add_edge(u, v, capacity); n } n inline void add_edge(const int u, const int v, const flow_t capacity) { n flow.add_edge(u, v, capacity, capacity); n } n inline void add_infinite_arc(const int u, const int v) { n flow.add_edge(u, v, INF); n } n inline void add_infinite_edge(const int u, const int v) { n flow.add_edge(u, v, INF, INF); n } n flow_t solve(const int s, const int t) { return flow.max_flow(s, t); } n }; n template n class MaxFlowLR { n private: n static constexpr flow_t INF = numeric_limits::max(); n int n; n vector from_source, to_sink, outgoing_capacity; n vector> demands; n flow_t total_demand; n bool invalid; n PushRelabel flow; n n public: n MaxFlowLR(const int n) n : n(n), n from_source(n), n to_sink(n), n outgoing_capacity(n), n total_demand(0), n invalid(false), n flow(n + 2) {} n void add_arc(const int u, const int v, const flow_t demand, n const flow_t capacity) { n if (demand > capacity) { n invalid = true; n return; n } n if (u != v) { n from_source[v] += demand; n to_sink[u] += demand; n flow.add_edge(u, v, capacity - demand); n demands.push_back({u, v, demand}); n total_demand += demand; n outgoing_capacity[u] += capacity; n } n } n flow_t solve(const int s, const int t) { n if (invalid) { n return -1; n } n const int source = n; n const int sink = n + 1; n for (int v = 0; v < n; ++v) { n if (from_source[v] != 0) { n flow.add_edge(source, v, from_source[v]); n } n if (to_sink[v] != 0) { n flow.add_edge(v, sink, to_sink[v]); n } n } n flow.add_edge(t, s, INF); n const flow_t flow_aux = flow.max_flow(source, sink); n if (s != t) { n flow.g[s].pop_back(); n flow.g[t].pop_back(); n } n for (int v = n - 1; v >= 0; --v) { n if (to_sink[v] != 0) { n flow.g[sink].pop_back(); n flow.g[v].pop_back(); n } n if (from_source[v] != 0) { n flow.g[source].pop_back(); n flow.g[v].pop_back(); n } n } n if (flow_aux != total_demand) return -1; n const flow_t flow_new = flow.max_flow(s, t); n flow_t total_flow = outgoing_capacity[s]; n for (const auto& e : flow.g[s]) total_flow -= e.c; n return total_flow; n } n vector> retrieve() { n vector> ans(n); n for (int u = 0; u < n; ++u) n for (const auto& e : flow.g[u]) n if (e.f > 0) ans[u][e.to] += e.f, ans[e.to][u] -= e.f; n for (auto t : demands) n if (get<2>(t) > 0) n ans[get<0>(t)][get<1>(t)] += get<2>(t), n ans[get<1>(t)][get<0>(t)] -= get<2>(t); n return ans; n } n }; n } // namespace n inline int divceil(const int x, const int y) { n const int q = x / y; n return q * y == x ? q : q + 1; n } n inline long long divceil(const long long x, const long long y) { n const long long q = x / y; n return q * y == x ? q : q + 1; n } n map coordinate_compression(vector v) { n sort(v.begin(), v.end()); n const int n = unique(v.begin(), v.end()) - v.begin(); n map compr; n for (int i = 0; i < n; ++i) compr[v[i]] = i; n return compr; n } n map coordinate_compression(vector v) { n sort(v.begin(), v.end()); n const int n = unique(v.begin(), v.end()) - v.begin(); n map compr; n for (int i = 0; i < n; ++i) compr[v[i]] = i; n return compr; n } n int main() { n int n, m; n scanf( %d%d , &n, &m); n int r, b; n scanf( %d%d , &r, &b); n bool flip = false; n if (r >= b) { n flip = true; n swap(r, b); n } n vector> original_points; n vector allx, ally; n for (int i = 0; i < n; ++i) { n int x, y; n scanf( %d%d , &x, &y); n original_points.emplace_back(x, y); n allx.push_back(x); n ally.push_back(y); n } n map comprx = coordinate_compression(allx), n compry = coordinate_compression(ally); n const int xlines = comprx.rbegin()->second + 1; n const int ylines = compry.rbegin()->second + 1; n vector xdeg(xlines), ydeg(ylines); n vector xcons(xlines), ycons(ylines); n vector> points; n for (const std::pair p : original_points) { n const int xx = comprx[p.first]; n const int yy = compry[p.second]; n points.emplace_back(xx, yy); n ++xdeg[xx]; n ++ydeg[yy]; n ++xcons[xx]; n ++ycons[yy]; n } n while (m--) { n int t, l, d; n scanf( %d%d%d , &t, &l, &d); n if (t == 1) { n const auto it = comprx.find(l); n if (it != comprx.end()) xcons[it->second] = min(xcons[it->second], d); n } else { n const auto it = compry.find(l); n if (it != compry.end()) ycons[it->second] = min(ycons[it->second], d); n } n } n MaxFlowLR dinic(2 + xlines + ylines); n const int source = 0; n const int sink = 1; n const auto get_xvert = [&](const int i) { return 2 + i; }; n const auto get_yvert = [&](const int i) { return 2 + xlines + i; }; n for (int i = 0; i < xlines; ++i) { n const int L = divceil(xdeg[i] - xcons[i], 2); n const int R = (xdeg[i] + xcons[i]) / 2; n dinic.add_arc(source, get_xvert(i), L, R); n } n for (int i = 0; i < ylines; ++i) { n const int L = divceil(ydeg[i] - ycons[i], 2); n const int R = (ydeg[i] + ycons[i]) / 2; n dinic.add_arc(get_yvert(i), sink, L, R); n } n for (const std::pair p : points) n dinic.add_arc(get_xvert(p.first), get_yvert(p.second), 0, 1); n long long flow_value = dinic.solve(source, sink); n if (flow_value == -1) { n puts( -1 ); n return 0; n } n long long ans = flow_value * r + (n - flow_value) * b; n cout << ans << endl; n map, int> red; n auto flow = dinic.retrieve(); n for (int i = 0; i < xlines; ++i) { n const int x = get_xvert(i); n for (const auto p : flow[x]) { n const int j = p.first - 2 - xlines; n const int f = p.second; n if (j >= 0) red[std::pair(i, j)] += f; n } n } n for (const std::pair p : points) { n int& v = red[p]; n if (v) { n v--; n putchar(flip ? b : r ); n } else { n putchar(flip ? r : b ); n } n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9 + 5; n int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } n void solve() { n vector v(14); n long long curr_score = 0; n long long o = 0; n for (int i = 0; i < 14; i++) { n cin >> v[i]; n } n for (int i = 0; i < 14; i++) { n vector t(14); n for (int k = 0; k < 14; k++) { n t[k] = v[k]; n } n long long p = v[i] / 14, q = v[i] % 14; n t[i] = 0; n for (int j = 0; j < 14; j++) { n t[j] += p; n } n long long j = i + 1; n while (q--) { n if (j == 14) { n j = 0; n } n t[j++]++; n } n long long cnt = 0; n for (int i = 0; i < 14; i++) { n if (t[i] % 2 == 0) { n cnt += t[i]; n } n } n curr_score = max(curr_score, cnt); n } n cout << curr_score << n ; n } n int main() { n int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct edge { n long long a, b, cost; n edge(long long x, long long y, long long z) : a(x), b(y), cost(z){}; n }; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long n, k, p; n cin >> n >> k >> p; n vector v(n), a(k); n for (long long i = 0; i < (long long)(n); i++) cin >> v[i]; n for (long long i = 0; i < (long long)(k); i++) cin >> a[i]; n sort((v).begin(), (v).end()); n sort((a).begin(), (a).end()); n long long ans = INT_MAX; n for (long long i = (long long)(0); i <= (long long)(k - n); i++) { n long long res = INT_MIN; n for (long long j = (long long)(0); j <= (long long)(n - 1); j++) { n res = max(res, abs(v[j] - a[i + j]) + abs(a[i + j] - p)); n } n ans = min(ans, res); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n unsigned long long ans; n int n, i, j, k, u, v; n int size[80011], fa[80011]; n vector e[80011]; n void dfs(int now) { n unsigned long long o = 0; n size[now] = 1; n for (int i = 0; i < e[now].size(); i++) n if (e[now][i] != fa[now]) { n fa[e[now][i]] = now; n dfs(e[now][i]); n o += (unsigned long long)size[now] * size[e[now][i]]; n size[now] += size[e[now][i]]; n } n ans -= o * (o + 2LL * size[now] * (n - size[now])); n } n int main() { n scanf( %d , &n); n for (i = 1; i < n; i++) { n scanf( %d%d , &u, &v); n e[u].push_back(v); n e[v].push_back(u); n } n ans = (n - 1LL) * n / 2; n ans *= ans; n dfs(1); n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long ans = 0; n string str; n int n; n int main() { n ios::sync_with_stdio(false); n cin >> n; n cin >> str; n for (int i = 0; i < n; ++i) ans += (str[i] - 0 ) & 1 ? 0 : i + 1; n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; } n inline void normal(long long int &a) { n a %= 1000000007; n (a < 0) && (a += 1000000007); n } n inline long long int modMul(long long int a, long long int b) { n a %= 1000000007, b %= 1000000007; n normal(a), normal(b); n return (a * b) % 1000000007; n } n inline long long int modAdd(long long int a, long long int b) { n a %= 1000000007, b %= 1000000007; n normal(a), normal(b); n return (a + b) % 1000000007; n } n inline long long int modSub(long long int a, long long int b) { n a %= 1000000007, b %= 1000000007; n normal(a), normal(b); n a -= b; n normal(a); n return a; n } n inline long long int modPow(long long int b, long long int p) { n long long int r = 1; n while (p) { n if (p & 1) r = modMul(r, b); n b = modMul(b, b); n p >>= 1; n } n return r; n } n inline long long int modInverse(long long int a) { n return modPow(a, 1000000007 - 2); n } n inline long long int modDiv(long long int a, long long int b) { n return modMul(a, modInverse(b)); n } n inline bool isInside(pair p, long long int n, long long int m) { n return (p.first >= 0 && p.first < n && p.second >= 0 && p.second < m); n } n inline bool isInside(pair p, long long int n) { n return (p.first >= 0 && p.first < n && p.second >= 0 && p.second < n); n } n inline bool isSquare(long long int x) { n long long int s = sqrt(x); n return (s * s == x); n } n inline bool isFib(long long int x) { n return isSquare(5 * x * x + 4) || isSquare(5 * x * x - 4); n } n inline bool isPowerOfTwo(long long int x) { n return ((1LL << (long long int)log2(x)) == x); n } n template n ostream &operator<<(ostream &os, const pair &p) { n return os << ( << p.first << , << p.second << ) ; n } n template n ostream &operator<<(ostream &os, const vector &v) { n os << { ; n for (auto it = v.begin(); it != v.end(); ++it) { n if (it != v.begin()) os << , ; n os << *it; n } n return os << } ; n } n template n ostream &operator<<(ostream &os, const set &v) { n os << [ ; n for (auto it = v.begin(); it != v.end(); ++it) { n if (it != v.begin()) os << , ; n os << *it; n } n return os << ] ; n } n template n ostream &operator<<(ostream &os, const map &v) { n os << [ ; n for (auto it = v.begin(); it != v.end(); ++it) { n if (it != v.begin()) os << , ; n os << it->first << = << it->second; n } n return os << ] ; n } n clock_t tStart = clock(); n void faltu() { cerr << endl; } n template n void faltu(T a[], int n) { n for (int i = 0; i < n; ++i) cerr << a[i] << ; n cerr << endl; n } n template n void faltu(T arg, const hello &...rest) { n cerr << arg << ; n faltu(rest...); n } n const long long int INF = 0x3f3f3f3f3f3f3f3f; n const long double EPS = 1e-9; n const int inf = 0x3f3f3f3f; n const int mx = (int)2e5 + 9; n long long int n, m, a, b, u, t, i, j, d, cs = 0, counT = 0, k, ans = 0, l = 0, n sum1 = 0, sum = 0, Max, Min, num; n int _time, idx; n set vc[mx]; n int st[mx], en[mx], pos[mx], arr[mx]; n void dfs(int node, int par = 0) { n st[node] = ++_time; n arr[node] = ++idx; n pos[idx] = node; n for (auto next : vc[node]) { n if (next == par) continue; n dfs(next, node); n } n en[node] = _time; n } n int main() { n cin >> n >> m; n for (i = 2; i <= n; i++) { n cin >> a; n vc[i].insert(a); n vc[a].insert(i); n } n dfs(1); n while (m--) { n cin >> u >> k; n if (arr[u] + k - 1 > n) { n cout << -1 << n ; n continue; n } n int v = pos[arr[u] + k - 1]; n if (st[u] <= st[v] && en[u] >= en[v]) n cout << v << n ; n else n cout << -1 << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long test(vector& h, int l, int r) { n long long ret = 0; n for (int i = l; i < r; i++) { n long long tmp = 0; n for (int j = i + 1; j < r; j++) { n tmp = max(tmp, abs(h[j] - h[j - 1])); n ret += tmp; n } n } n return ret; n } n int main() { n int n, q; n cin >> n >> q; n vector h(n); n for (int i = 0; i < n; i++) { n scanf( %I64d , &h[i]); n } n while (q--) { n int l, r; n scanf( %d%d , &l, &r); n l--; n long long ans = 0; n long long last = 0; n deque> dq; n for (int i = l + 1; i < r; i++) { n long long tmp = abs(h[i] - h[i - 1]); n long long len = 1; n while (dq.size() && dq.back().first <= tmp) { n auto val = dq.back(); n dq.pop_back(); n len += val.second; n last -= val.first * val.second; n } n dq.push_back({tmp, len}); n last += tmp * len; n ans += last; n } n printf( %I64d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long cont = 0; n template n struct AHO_CORASICK { n const long long ALPHA = 26; n long long cv(F c) { return c - 0 ; } n vector> tgo; n vector link; n vector ch; n vector p; n vector flag; n long long sz = 0; n long long size() { return sz; } n void new_node(long long tp, long long tch) { n sz++; n tgo.emplace_back(); n link.push_back(0); n ch.push_back(tch); n p.push_back(tp); n flag.push_back(false); n } n AHO_CORASICK() { n new_node(0, 0); n new_node(1, 0); n } n void add_string(T cad) { n long long pt = 1; n for (long long i = 0; i < cad.size(); i++) { n long long tch = cv(cad[i]); n if (tgo[pt][tch] == 0) { n tgo[pt][tch] = sz; n new_node(pt, tch); n } n pt = tgo[pt][tch]; n } n flag[pt] = true; n } n long long get_link(long long nodo) { n if (link[nodo] == 0) { n if (nodo == 1 || p[nodo] == 1) n link[nodo] = 1; n else n link[nodo] = go(get_link(p[nodo]), ch[nodo]); n flag[nodo] = flag[nodo] | flag[link[nodo]]; n } n return link[nodo]; n } n long long go(long long nodo, F tch) { return go(nodo, cv(tch)); } n long long go(long long nodo, long long tch) { n if (tgo[nodo][tch] == 0) { n tgo[nodo][tch] = (nodo == 1) ? 1 : go(get_link(nodo), tch); n } n return tgo[nodo][tch]; n } n }; n long long X; n vector bf; n string temp; n void fff(long long sum) { n if (sum > X) return; n for (long long i = 0; i < temp.size(); i++) { n long long s = 0; n for (long long j = i; j < temp.size(); j++) { n s += temp[j] - 0 ; n if (s != X && X % s == 0) return; n } n } n if (sum == X) { n bf.push_back(temp); n return; n } n for (long long i = 1; i <= 9; i++) { n temp += (i + 0 ); n fff(sum + i); n temp.pop_back(); n } n } n const long long MAXN = 1010; n long long dp[MAXN][MAXN * 5]; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n for (long long i = 0; i < MAXN; i++) { n for (long long j = 0; j < 5 * MAXN; j++) { n dp[i][j] = 1e9; n } n } n string cad; n cin >> cad; n cin >> X; n long long N = cad.size(); n fff(0); n AHO_CORASICK ac; n for (auto x : bf) { n ac.add_string(x); n } n dp[0][1] = 0; n for (long long i = 0; i < N; i++) { n for (long long j = 1; j < ac.size(); j++) { n long long pt = ac.go(j, cad[i]); n if (ac.flag[pt] == false) dp[i + 1][pt] = min(dp[i + 1][pt], dp[i][j]); n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + 1); n } n } n long long res = 1e9; n for (long long i = 0; i < ac.sz; i++) { n res = min(res, dp[N][i]); n } n cout << res << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char name[5][10] = { Sheldon , Leonard , Penny , Rajesh , Howard }; n int n, c = 5; n scanf( %d , &n); n while (n > c) { n n -= c; n c *= 2; n } n printf( %s n , name[(n - 1) / (c / 5)]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n map> best; n long long n; n cin >> n; n for (long long i = 0; i < n; i++) { n string name; n long long score; n cin >> name >> score; n best[name].second = max(best[name].second, score); n } n for (auto itr = best.begin(); itr != best.end(); itr++) { n long long count = 0; n for (auto i = best.begin(); i != best.end(); i++) { n if (itr->second.second >= i->second.second) count++; n } n double percent = ((double)count / best.size() * 1.0) * 100.0; n if (percent < 50.0) n itr->second.first = noob ; n else if (percent >= 50.0 && percent < 80.0) n itr->second.first = random ; n else if (percent >= 80.0 && percent < 90.0) n itr->second.first = average ; n else if (percent >= 90.0 && percent < 99.0) n itr->second.first = hardcore ; n else n itr->second.first = pro ; n } n cout << best.size() << endl; n for (auto x : best) { n cout << x.first << << x.second.first << endl; n } n } n int32_t main() { n long long testcases = 1; n while (testcases--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void run_case() { n string A, B, C, D; n cin >> A; n cin >> B; n C = (A + B); n sort(C.begin(), C.end()); n cin >> D; n sort(D.begin(), D.end()); n if (C == D) n cout << YES n ; n else n cout << NO n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long T = 1; n while (T--) run_case(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma comment(linker, /STACK:200000000 ) n const double EPS = 1E-9; n const int INF = 1000000000; n const long long INF64 = (long long)1E18; n const double PI = 3.1415926535897932384626433832795; n char s[2100][2100]; n int ans[2100]; n int main() { n int n, m, k; n scanf( %d%d%d n , &n, &m, &k); n for (int i = 0; i < (int)(n); i++) gets(s[i]); n for (int i = 0; i < (int)(n); i++) n for (int j = 0; j < (int)(m); j++) { n if (s[i][j] == . || s[i][j] == D ) continue; n if (s[i][j] == U ) { n if (i % 2 == 1) continue; n ans[j]++; n continue; n } n int nj; n if (s[i][j] == L ) n nj = j - i; n else n nj = j + i; n if (0 <= nj && nj < m) ans[nj]++; n } n for (int i = 0; i < (int)(m); i++) printf(i ? %d : %d , ans[i]); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline int in() { n int32_t x; n scanf( %d , &x); n return x; n } n inline long long lin() { n long long x; n scanf( %lld , &x); n return x; n } n inline string get() { n char ch[2000010]; n scanf( %s , ch); n return ch; n } n const int MAX_LG = 21; n const int maxn = 2e3 + 10; n const int maxm = 1e5 + 10; n const int base = 29; n const int mod = 1e9 + 7; n const int INF = 1e9 + 100; n const int SQ = 317; n int Cmp; n int mark[maxn]; n int v[maxm], u[maxm], deg[maxn], has[maxn][maxn], e[maxm]; n int vc[5]; n inline void dfs(int node, int id) { n int edgeid = has[node][vc[id]] - 1; n if (edgeid < 0) return; n int nxt = v[edgeid] == node ? u[edgeid] : v[edgeid]; n has[node][vc[id]] = 0; n has[nxt][vc[id]] = 0; n dfs(nxt, id ^ 1); n has[node][vc[id ^ 1]] = edgeid + 1; n has[nxt][vc[id ^ 1]] = edgeid + 1; n e[edgeid] = vc[id ^ 1]; n } n int res; n int32_t main() { n int a = in(), b = in(), m = in(); n for (int i = 0; i < m; i++) { n v[i] = in(), u[i] = in() + a; n deg[v[i]]++; n deg[u[i]]++; n res = max(res, max(deg[v[i]], deg[u[i]])); n } n for (int i = 0; i < m; i++) { n bool fl = false; n for (int col = 1; col <= res; col++) { n if (has[v[i]][col] == 0 && has[u[i]][col] == 0 && col <= res) { n has[v[i]][col] = has[u[i]][col] = i + 1; n e[i] = col; n fl = true; n break; n } n } n if (!fl) { n Cmp++; n for (int col = 1; col <= res; col++) { n if (has[v[i]][col] && !has[u[i]][col]) vc[0] = col; n if (has[v[i]][col] == 0 && has[u[i]][col]) vc[1] = col; n } n dfs(v[i], 0); n has[v[i]][vc[0]] = has[u[i]][vc[0]] = i + 1; n e[i] = vc[0]; n } n } n cout << res << n ; n for (int i = 0; i < m; i++) cout << e[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n int f[100005], b[100005], fn[100005], bn[100005], fm, bm; n int main() { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 0; i < n; ++i) { n scanf( %d , f + i); n ++fn[f[i]]; n fm = max(fm, f[i]); n } n for (int i = 0; i < m; ++i) { n scanf( %d , b + i); n ++bn[b[i]]; n bm = max(bm, b[i]); n } n if (fm < bm) { n printf( Impossible n ); n } else { n bool ans = true; n bool chong = false; n for (int i = 1; i <= bm; ++i) { n if (bn[i] > 0) { n if (fn[i] == 0) { n ans = false; n } else if (fn[i] > 1) { n chong = true; n } n } n } n if (!ans) { n printf( Impossible n ); n } else { n if (chong) { n printf( Ambiguity n ); n } else { n printf( Possible n ); n for (int i = 0; i < n; ++i) { n fn[f[i]] = i + 1; n } n for (int i = 0; i < m; ++i) { n printf( %d , fn[b[i]]); n } n printf( n ); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int k; n int n[3], t[3]; n multiset f[3]; n int main() { n cin >> k; n cin >> n[0] >> n[1] >> n[2]; n cin >> t[0] >> t[1] >> t[2]; n for (int i = 0; i < 3; i++) n for (int j = 0; j < n[i]; j++) f[i].insert(0); n int ans = 0; n for (int i = 0; i < k; i++) { n int go[3]; n for (int j = 0; j < 3; j++) { n go[j] = *f[j].begin(); n f[j].erase(f[j].begin()); n } n go[1] -= t[0]; n go[2] -= t[0] + t[1]; n int w = max(go[0], max(go[1], go[2])); n ans = w + t[0] + t[1] + t[2]; n f[0].insert(w + t[0]); n f[1].insert(w + t[0] + t[1]); n f[2].insert(ans); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n inline void read(int &x) { n x = 0; n char ch = getchar(), flag = 0; n while ((ch > 9 || ch < 0 ) && ch != - ) ch = getchar(); n if (ch == - ) flag = 1, ch = getchar(); n while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); n if (flag) x = -x; n } n inline void read(int &x, int &y) { read(x), read(y); } n inline void read(int &x, int &y, int &z) { read(x), read(y), read(z); } n const int N = 20005, inf = 1e9 + 7, mod = 20000; n int n, m, up[N], cup[N], cnt, si[N], num[N], dep[N], use[N]; n vector g[N], f[N], s[N]; n bool vis[N]; n struct node { n int to, next, v; n } p[N << 4]; n int S, T, head[N], st[N], tot, ans; n inline void add(int x, int y, int z) { n p[tot].to = y; n p[tot].next = head[x]; n p[tot].v = z; n head[x] = tot++; n p[tot].to = x; n p[tot].next = head[y]; n p[tot].v = 0; n head[y] = tot++; n } n queue q; n inline bool bfs(int x) { n memset(st, 0, sizeof(st)); n st[x] = 1; n q.push(x); n while (!q.empty()) { n int x = q.front(); n q.pop(); n for (int i = head[x]; ~i; i = p[i].next) { n int y = p[i].to, v = p[i].v; n if (!v || st[y]) continue; n st[y] = st[x] + 1; n q.push(y); n } n } n return st[T] > 0; n } n inline int dfs(int x, int f) { n int r = 0; n if (x == T) return f; n for (int i = head[x]; ~i; i = p[i].next) { n int y = p[i].to, v = p[i].v, tmp; n if (!v || st[y] != st[x] + 1) continue; n tmp = dfs(y, min(f - r, v)); n r += tmp; n p[i].v -= tmp; n p[i ^ 1].v += tmp; n if (r == f) break; n } n if (!r) st[x] = -1; n return r; n } n inline void dinic() { n int t; n while (bfs(S)) n while (t = dfs(S, inf)) ans += t; n printf( %d n , ans); n } n inline void Add(int x, int y, int z) { n g[x].push_back(y); n f[x].push_back(z); n g[y].push_back(x); n f[y].push_back(z); n vis[x] = vis[y] = 1; n } n inline void Dfs(int x, int fa) { n vis[x] = 1; n for (int i = 0; i < g[x].size(); i++) { n int y = g[x][i], z = f[x][i]; n if (y == fa) continue; n if (vis[y] && dep[y] < dep[x]) { n cnt++; n s[cnt].push_back(z); n si[z]--; n int k = x, o = 0; n while (k != y) { n si[cup[k]]--; n s[cnt].push_back(cup[k]); n k = up[k]; n } n continue; n } n if (vis[y]) continue; n cup[y] = z; n up[y] = x; n dep[y] = dep[x] + 1; n Dfs(y, x); n } n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n int x, y, z; n scanf( %d%d%d , &x, &y, &z); n Add(x, y, z); n si[z]++; n use[z]++; n } n for (int i = 1; i <= n; i++) n if (vis[i]) { n memset(vis, 0, sizeof(vis)); n Dfs(i, -1); n break; n } n memset(head, -1, sizeof(head)); n S = 0; n T = cnt + 1; n for (int i = 1; i <= m; i++) n if (!si[i] && use[i]) n T++; n else if (use[i]) n ans++; n int CNT = cnt; n for (int i = 1; i <= m; i++) n if (!si[i] && use[i]) add(num[i] = ++CNT, T, 1); n for (int i = 1; i <= cnt; i++) { n bool isok = 1; n for (int j = 0; j < s[i].size(); j++) n if (si[s[i][j]]) isok = 0; n add(S, i, s[i].size() - 1); n for (int j = 0; j < s[i].size(); j++) n if (num[s[i][j]]) add(i, num[s[i][j]], 1); n } n dinic(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n if (n < 3) { n cout << -1; n return 0; n } n if (n == 3) { n cout << 210; n return 0; n } n int A[] = {50, 80, 170, 20, 200, 110}; n int nA[] = {2, 2, 3, 2, 3, 3}; n int j = 0; n for (int i = 4; i <= n; i++) { n if (j == 6) j = 0; n if (i == n) { n cout << 1; n for (int k = 1; k < n - nA[j]; k++) { n cout << 0 ; n } n cout << A[j]; n } n j++; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[100100], sir[100100]; n int viz[100100], mi, ma, t, n, freq[100100], fre[100100]; n int prim(int x) { n for (int i = 2; i <= x; ++i) { n if (i * i > x) return 1; n if (x % i == 0) return 0; n } n return 1; n } n int main() { n cin >> (s + 1); n n = strlen(s + 1); n for (int i = 2; i <= n; ++i) { n if (prim(i)) { n mi = ++t; n for (int j = 1; j <= n; ++j) { n if (i * j > n) break; n if (viz[i * j]) mi = min(mi, viz[i * j]); n } n if (mi != t) --t; n for (int j = 1; j <= n; ++j) { n if (i * j > n) break; n viz[i * j] = mi; n } n } n } n for (int i = 1; i <= n; ++i) freq[viz[i]]++; n for (int i = 1; i <= n; ++i) fre[s[i]]++; n for (int i = 1; i <= t; ++i) { n ma = 0; n for (int j = a ; j <= z ; ++j) n if (fre[j] > fre[ma]) { n ma = j; n } n if (fre[ma] >= freq[i]) { n fre[ma] -= freq[i]; n for (int j = 1; j <= n; ++j) n if (viz[j] == i) s[j] = ma; n } else { n cout << NO ; n return 0; n } n } n t = 0; n for (int j = a ; j <= z ; ++j) n while (fre[j]) { n --fre[j]; n sir[++t] = j; n } n for (int i = 1; i <= n; ++i) n if (!viz[i]) { n s[i] = sir[t--]; n } n cout << YES n ; n cout << (s + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n long long int n; n cin >> n; n long long int a[n]; n long long int q = 0, p = 0, z = 0; n for (int i = 0; i < n; ++i) { n cin >> a[i]; n if (a[i] < 0) n q++; n else if (a[i] > 0) n p++; n else n z++; n } n long long int m1, m2, m3, m4, m5; n sort(a, a + n); n m1 = a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4] * a[n - 5]; n m2 = a[n - 1] * a[n - 2] * a[n - 3] * a[0] * a[1]; n m3 = a[n - 1] * a[0] * a[1] * a[2] * a[3]; n long long int ans = max(m1, max(m2, m3)); n cout << ans << n ; n } n int main() { n ; n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ; n int t; n cin >> t; n for (int i = 1; i <= t; ++i) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e4 + 10, inf = 1e9; n int r[N], c[N], dist[N]; n bool seen[N] = {0}; n int main() { n int row, col, k; n cin >> row >> col >> k; n for (int i = 1; i <= k; i++) { n cin >> r[i] >> c[i]; n dist[i] = inf; n if (r[i] == 1 and c[i] == 1) dist[i] = 0; n } n dist[0] = inf; n while (1) { n int cur = 0; n for (int i = 1; i <= k; i++) { n if (!seen[i] and dist[cur] > dist[i]) { n cur = i; n } n } n if (!cur) break; n seen[cur] = 1; n for (int i = 1; i <= k; i++) { n if (seen[i]) continue; n if (abs(r[i] - r[cur]) > 2 and abs(c[i] - c[cur]) > 2) continue; n int temp = 1; n if ((abs(r[i] - r[cur]) + abs(c[i] - c[cur])) == 1) temp = 0; n if (dist[cur] + temp < dist[i]) dist[i] = temp + dist[cur]; n } n } n int ans = inf; n for (int i = 1; i <= k; i++) { n if (r[i] == row and c[i] == col) n ans = min(ans, dist[i]); n else if (r[i] >= row - 1 or c[i] >= col - 1) n ans = min(ans, dist[i] + 1); n } n if (ans == inf) n cout << -1; n else n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n long long int _sieve_size; n bitset<10000010> bs; n vector primes; n void sieve(long long int upperbound) { n _sieve_size = upperbound + 1; n bs.set(); n bs[0] = bs[1] = 0; n for (long long int i = 2; i <= _sieve_size; i++) n if (bs[i]) { n for (long long int j = i * i; j <= _sieve_size; j += i) bs[j] = 0; n primes.push_back((int)i); n } n } n bool isPrime(long long int N) { n if (N <= _sieve_size) return bs[N]; n for (int i = 0; i < (int)primes.size(); i++) n if (N % primes[i] == 0) return false; n return true; n } n int main() { n int h1, m1, h2, m2, oh, om; n char tmp; n cin >> h1 >> tmp >> m1; n cin >> h2 >> tmp >> m2; n om = m1 - m2; n if (om < 0) { n om += 60; n h1 -= 1; n } n oh = h1 - h2; n if (oh < 0) { n oh += 24; n } n if (oh < 10) { n cout << 0 << oh; n } else n cout << oh; n cout << tmp; n if (om < 10) { n cout << 0 << om; n } else n cout << om; n return 0; n } n "} +{"func_code_string": "#include n #pragma warning(disable : 4786) n #pragma comment(linker, /STACK:16777216 ) n using namespace std; n char str[1000005]; n int Z[1000005], n; n void Zfunction() { n int L, R, r, i, j, k; n L = 0; n R = 0; n Z[0] = 0; n for (i = 1; i < n; i++) { n if (i > R) { n L = i; n R = i; n while (R < n && str[R - L] == str[R]) R++; n Z[i] = R - L; n R--; n } else { n r = i - L; n if (Z[r] < R - i + 1) n Z[i] = Z[r]; n else { n L = i; n while (R < n && str[R - L] == str[R]) R++; n Z[i] = R - L; n R--; n } n } n } n } n int max(int a, int b) { n if (a > b) return a; n return b; n } n int main() { n int i, j, k, maxr, res; n while (scanf( %s , str) != EOF) { n n = strlen(str); n maxr = 0; n res = 0; n Zfunction(); n for (i = 0; i < n; i++) { n if (Z[i] == n - i) { n if (maxr >= n - i) { n res = n - i; n break; n } n } n maxr = max(maxr, Z[i]); n } n if (res == 0 || n <= 2) n printf( Just a legend n ); n else { n for (i = 0; i < res; i++) printf( %c , str[i]); n printf( n ); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e4 + 1, M = 100; n int n, q; n bitset sq[M]; n vector on[N]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> q; n for (int x = 0, qwerty = M; x < qwerty; x++) sq[x][0] = 1; n for (int x = 0, qwerty = q; x < qwerty; x++) { n int l, r, v; n cin >> l >> r >> v; n l--; n r--; n if (l / M == r / M) { n for (int i = l; i <= r; i++) on[i].push_back(v); n continue; n } n for (int i = (l / M) + 1; i < r / M; i++) { n sq[i] |= (sq[i] << v); n } n for (int i = l; i < M * ((l / M) + 1); i++) on[i].push_back(v); n for (int i = M * (r / M); i <= r; i++) on[i].push_back(v); n } n bitset ans; n for (int x = 0, qwerty = n; x < qwerty; x++) { n int pos = x / M; n bitset tmp = sq[pos]; n for (int v : on[x]) tmp |= tmp << v; n ans |= tmp; n } n vector aa; n for (int x = 1, qwerty = n + 1; x < qwerty; x++) n if (ans[x]) aa.push_back(x); n cout << ((int)(aa).size()) << n ; n for (int x = 0, qwerty = ((int)(aa).size()); x < qwerty; x++) n cout << aa[x] << n [x + 1 == ((int)(aa).size())]; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector v; n string a; n while (n--) { n cin >> a; n v.push_back(a); n } n int cot = 0; n bool p = 1; n int ans = 1000000; n string c; n for (int j = 0; j < v.size(); j++) { n c = v[j]; n cot = 0; n for (int i = 0; i < v.size(); i++) { n if (c == v[i] || i == j) n continue; n else { n int ncot = 0; n string b = v[i]; n while (c != b) { n ncot++; n char d = b[0]; n b.erase(b.begin()); n b.push_back(d); n if (ncot > b.length()) { n p = 0; n break; n } n } n if (p == 0) n break; n else n cot += ncot; n } n } n if (p == 0) break; n if (cot < ans) { n ans = cot; n } n } n if (p) n cout << ans << endl; n else n cout << -1 << endl; n } n "} +{"func_code_string": "#include n using namespace std; n inline bool equal(double _x, double _y) { n return _x > _y - 1e-9 && _x < _y + 1e-9; n } n char s[300]; n int mx, cnt, sum, ans; n bool OK(char c) { n if (c >= a && c <= z || c >= A && c <= Z ) return 1; n return 0; n } n int main() { n int n; n scanf( %d , &n); n scanf( %s , s); n for (int l = 0, r = 0; l < n; l = r) { n if (s[l] == ( ) { n while (s[r] != ) ) r++; n for (int i = l + 1; i < r; i++) { n if (OK(s[i]) && !OK(s[i - 1])) { n cnt++; n } n } n for (int i = l + 1; i < r; i++) s[i] = _ ; n } n r++; n } n for (int i = 0; i < n; i++) { n if (OK(s[i])) n sum++; n else n sum = 0; n ans = max(ans, sum); n } n printf( %d %d n , ans, cnt); n } n "} +{"func_code_string": "#include n int ss[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53}; n int n, a[200], f[120][(1 << 16) + 10], b[100], g[120][(1 << 16) + 10]; n void outit(int x, int y) { n if (y == 0) return; n outit(x & ~b[g[y][x]], y - 1); n printf( %d , g[y][x]); n if (y == n) n printf( n ); n else n printf( ); n } n int main() { n int x, i, j, k, ans; n scanf( %d , &n); n for (i = 1; i <= n; i++) scanf( %d , &a[i]); n memset(b, 0, sizeof(b)); n for (i = 1; i <= 58; i++) n for (j = 0; j < 16; j++) n if (i % ss[j] == 0) b[i] |= 1 << j; n for (i = 1; i <= n; i++) n for (j = 0; j < 1 << 16; j++) f[i][j] = 1000000000; n for (i = 1; i <= n; i++) { n for (j = 0; j < 1 << 16; j++) { n for (k = 1; k <= 58; k++) n if ((j & b[k]) == 0) n if (f[i][j | b[k]] > f[i - 1][j] + fabs(a[i] - k)) { n f[i][j | b[k]] = f[i - 1][j] + fabs(a[i] - k); n g[i][j | b[k]] = k; n } n } n } n ans = 1000000000; n for (i = 0; i < 1 << 16; i++) n if (f[n][i] < ans) { n ans = f[n][i]; n x = i; n } n outit(x, n); n printf( n ); n } n "} +{"func_code_string": "#include n using namespace std; n long long power(long long a, long long b) { n if (b == 0) return 1; n if (b % 2 == 0) return power(a * a % 1000000007, b / 2); n return a * power(a, b - 1) % 1000000007; n } n long long gcd(long long a, long long b) { n if (a == 0) return b; n return gcd(b % a, a); n } n long long a[100000]; n int main() { n long long n; n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n long long ans = 0; n for (int i = 0; i < n / 2; i++) { n ans += a[i] * a[n - i - 1] * 2; n ans %= 10007; n } n if (n % 2) ans += a[n / 2] * a[n / 2]; n ans %= 10007; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 101; n short dp[N][N][N * N], a[N], ans; n int n; n short calc(int u, int k, int sum) { n if (u == N) return !sum && !k; n short &ref = dp[u][k][sum]; n if (ref != -1) return ref; n ref = 0; n for (short i = 0; i <= a[u] && sum - u * i >= 0 && i <= k; i++) n ref += calc(u + 1, k - i, sum - u * i); n return ref = min(ref, (short)2); n } n int main() { n scanf( %d , &n); n memset(dp, -1, sizeof dp); n int freq = 0; n for (int i = 0, a; i < n; i++) { n scanf( %d , &a); n if (!::a[a]) freq++; n ::a[a]++; n } n for (short i = 1; i < N; i++) n for (short j = 1; j <= a[i]; j++) n if (calc(1, j, i * j) == 1) { n ans = max(ans, j); n if (j == a[i] && freq == 2) ans = n; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 300 * 1000 + 5, SQ = 373; n int a[N]; n long long dp[2 * N]; n pair, int> t[N]; n long long finans[N]; n int main() { n ios ::sync_with_stdio(false); n int n; n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n } n int q; n cin >> q; n for (int i = 1; i <= q; i++) { n cin >> t[i].first.second >> t[i].first.first; n t[i].second = i; n } n sort(t + 1, t + q + 1); n for (int i = 1; i <= q; i++) { n int x = t[i].first.first, y = t[i].first.second; n if (x < SQ) { n if (x != t[i - 1].first.first) { n for (int j = n; j > 0; j--) { n dp[j] = dp[j + x] + a[j]; n } n } n finans[t[i].second] = dp[y]; n } else { n long long ans = 0; n for (int j = y; j <= n; j += x) { n ans += a[j]; n } n finans[t[i].second] = ans; n } n } n for (int i = 1; i <= q; i++) { n cout << finans[i] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1000000007; n inline int add(int a, int b) { n if ((a += b) >= mod) a -= mod; n return a; n } n inline int dec(int a, int b) { n if ((a -= b) < 0) a += mod; n return a; n } n inline void _add(int& a, int b) { n if ((a += b) >= mod) a -= mod; n } n inline void _dec(int& a, int b) { n if ((a -= b) < 0) a += mod; n } n inline int mult(int a, int b) { n long long t = 1ll * a * b; n if (t >= mod) t %= mod; n return t; n } n const int L = 16; n char s[510]; n int n, nodecnt = 0, f[170][65536], f2[170][65536]; n void fwt_or(int* A, int flag) { n if (flag == 1) n for (int i = 1; i < 65536; i <<= 1) n for (int j = 0; j < 65536; j += (i << 1)) n for (int k = 0; k < i; k++) _add(A[i + j + k], A[j + k]); n else n for (int i = 1; i < 65536; i <<= 1) n for (int j = 0; j < 65536; j += (i << 1)) n for (int k = 0; k < i; k++) _dec(A[i + j + k], A[j + k]); n } n void fwt_and(int* A, int flag) { n if (flag == 1) n for (int i = 1; i < 65536; i <<= 1) n for (int j = 0; j < 65536; j += (i << 1)) n for (int k = 0; k < i; k++) _add(A[j + k], A[i + j + k]); n else n for (int i = 1; i < 65536; i <<= 1) n for (int j = 0; j < 65536; j += (i << 1)) n for (int k = 0; k < i; k++) _dec(A[j + k], A[i + j + k]); n } n int dfs(int l, int r) { n int p = ++nodecnt; n if (l == r) { n if (s[l] == ? ) { n for (int t = 0; t < 4; t++) { n int S = 0; n for (int i = 0; i < 16; i++) n if ((i >> t) & 1) S |= (1 << i); n f[p][S]++; n f[p][65535 ^ S]++; n } n } else { n if (s[l] >= A && s[l] <= D ) { n int t = s[l] - A , S = 0; n for (int i = 0; i < 16; i++) n if ((i >> t) & 1) S |= (1 << i); n f[p][S] = 1; n } else { n int t = s[l] - a , S = 0; n for (int i = 0; i < 16; i++) n if ((i >> t) & 1) S |= (1 << i); n f[p][65535 ^ S] = 1; n } n } n memcpy(f2[p], f[p], sizeof(f[p])); n return p; n } n int cnt = 0, pos = 0; n for (int i = l; i <= r; i++) { n if (s[i] == ( ) n cnt++; n else if (s[i] == ) ) n cnt--; n if (!cnt) { n pos = i + 1; n break; n } n } n int lc = dfs(l + 1, pos - 2), rc = dfs(pos + 2, r - 1); n if (s[pos] != | ) { n fwt_and(f[lc], 1); n fwt_and(f[rc], 1); n for (int i = 0; i < 65536; i++) f[p][i] = mult(f[lc][i], f[rc][i]); n fwt_and(f[p], -1); n } n if (s[pos] != & ) { n fwt_or(f2[lc], 1); n fwt_or(f2[rc], 1); n for (int i = 0; i < 65536; i++) f2[p][i] = mult(f2[lc][i], f2[rc][i]); n fwt_or(f2[p], -1); n } n for (int i = 0; i < 65536; i++) _add(f[p][i], f2[p][i]); n memcpy(f2[p], f[p], sizeof(f[p])); n return p; n } n int m, fs[16]; n int main() { n scanf( %s , s + 1); n n = strlen(s + 1); n dfs(1, n); n scanf( %d , &m); n memset(fs, 255, sizeof(fs)); n for (int i = 1, a, b, c, d, e; i <= m; i++) { n scanf( %d%d%d%d%d , &a, &b, &c, &d, &e); n fs[a | (b << 1) | (c << 2) | (d << 3)] = e; n } n int ans = 0; n for (int i = 0; i < 65536; i++) { n bool s = 1; n for (int j = 0; j < 16; j++) s &= (fs[j] == -1 || fs[j] == ((i >> j) & 1)); n if (s) ans = add(ans, f[1][i]); n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = (long long)(1e9 + 7); n const long long inv = (long long)(5e8 + 4); n int main() { n long long n, m; n cin >> n >> m; n long long ans = (n % mod) * (m % mod) % mod; n long long l = 1, r = 1; n while (l <= min(n, m)) { n long long a = n / l; n r = min(m, n / a); n long long x1, x2, x3, x4; n x1 = (n / r) % mod; n x2 = (l + r) % mod; n x3 = (x1 * x2) % mod; n x4 = (r - l + 1) % mod; n long long temp = ((x3 * x4) % mod) * inv % mod; n ans = ((ans + mod) - temp) % mod; n l = r + 1; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long Mx = 512; n long long D[Mx][Mx]; n int32_t main() { n long long n, m, mod, a = 0, b = 0; n cin >> n >> m >> mod; n vector C(n); n for (long long i = 0; i < m; i++) n for (long long j = 0; j < n; j++) { n char c; n cin >> c; n if (c == 1 ) C[j]++; n } n for (long long i = 0; i < n; i++) n if (C[i] == 0) n a++; n else if (C[i] == 1) n b++; n D[0][0] = 1; n for (long long d = 1; d <= a + b; d++) { n for (long long i = 0; i <= d; i++) { n long long j = d - i; n D[i][j] = n (((i >= 2) ? ((i * (i - 1) / 2 % mod) * D[i - 2][j + 2] % mod) : 0) + n ((i >= 1) ? ((i * j % mod) * D[i - 1][j] % mod) : 0) + n ((j >= 2) ? ((j * (j - 1) / 2 % mod) * D[i][j - 2] % mod) : 0)) % n mod; n } n } n cout << D[a][b]; n } n "} +{"func_code_string": "#include n int n, a[200005]; n bool check1(int x) { n for (int i = x + 1; i <= n; i++) n if (a[i] >= a[i - 1]) return 0; n return 1; n } n bool check2(int x) { n for (int i = x + 1; i <= n; i++) n if (a[i] <= a[i - 1]) return 0; n return 1; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n if (check1(1) || check2(1)) { n printf( YES ); n return 0; n } n for (int i = 2; i <= n; i++) { n if (a[i] <= a[i - 1]) { n if (check1(i)) n printf( YES ); n else n printf( NO ); n return 0; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, a[105], p[105]; n long long g[105]; n long long d[105][105][105]; n bool ok[105][105]; n char c[105]; n void read(int& x) { n char c = getchar(); n x = 0; n while (!isdigit(c)) c = getchar(); n while (isdigit(c)) { n x = x * 10 + c - 0 ; n c = getchar(); n } n } n long long dp(int l, int r, int k) { n if (ok[l][r]) return d[l][r][k] = g[r - l + k + 1]; n if (d[l][r][k]) return d[l][r][k]; n for (int i = l; i < r; i++) { n d[l][r][k] = max(d[l][r][k], dp(l, i, 0) + dp(i + 1, r, k)); n } n for (int i = l; i < p[r]; i++) { n if (c[i] == c[r] && c[i + 1] != c[r]) { n d[l][r][k] = n max(d[l][r][k], dp(l, i, k + r - p[r] + 1) + dp(i + 1, p[r] - 1, 0)); n } n } n return d[l][r][k]; n } n int main() { n read(n); n scanf( %s , c + 1); n for (int i = 1; i <= n; i++) { n read(a[i]); n g[i] = a[i]; n } n for (int i = 1; i <= n; i++) { n for (int j = i; j >= 1; j--) { n if (c[j] == c[i]) { n p[i] = j; n ok[j][i] = 1; n } else n break; n } n } n for (int i = 2; i <= n; i++) n for (int j = 1; j < i; j++) g[i] = max(g[i], g[j] + a[i - j]); n printf( %lld n , dp(1, n, 0)); n } n "} +{"func_code_string": "#include n using namespace std; n const long long M = 1e9 + 7; n const long long INF = LLONG_MAX / 2; n const long long N = 2e5 + 1; n struct event { n long long sa; n long long ea; n long long sb; n long long eb; n }; n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n { n long long n; n cin >> n; n vector a(n); n for (long long i = 0; i < n; i++) n cin >> a[i].sa >> a[i].ea >> a[i].sb >> a[i].eb; n vector > p; n multiset > s1; n multiset > s2; n bool ans = 1; n for (long long i = 0; i < n; i++) { n p.push_back({a[i].sa, i}); n p.push_back({a[i].ea + 0.5, i}); n } n sort(p.begin(), p.end()); n for (auto i : p) { n pair c = {a[i.second].sb, a[i.second].eb}; n if (s1.count(c)) { n s1.erase(s1.find(c)); n s2.erase(s2.find({c.second, c.first})); n } else { n if (s1.empty() || (*s1.rbegin()).first <= c.second && n (*s2.begin()).first >= c.first) { n s1.insert(c); n s2.insert({c.second, c.first}); n } else { n ans = 0; n break; n } n } n } n s1.clear(); n s2.clear(); n p = vector >(0); n for (long long i = 0; i < n; i++) { n p.push_back({a[i].sb, i}); n p.push_back({a[i].eb + 0.5, i}); n } n sort(p.begin(), p.end()); n for (auto i : p) { n pair c = {a[i.second].sa, a[i.second].ea}; n if (s1.count(c)) { n s1.erase(s1.find(c)); n s2.erase(s2.find({c.second, c.first})); n } else { n if (s1.empty() || (*s1.rbegin()).first <= c.second && n (*s2.begin()).first >= c.first) { n s1.insert(c); n s2.insert({c.second, c.first}); n } else { n ans = 0; n break; n } n } n } n if (ans) n cout << YES ; n else n cout << NO ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, arr[300010], lft[300010], rgt[300010], mx = 0, cnt = 0; n stack s1, s2; n set st; n int main() { n cin >> n; n for (int i = 0; i < n; i++) cin >> arr[i]; n for (int i = 0; i < n; i++) lft[i] = -1, rgt[i] = n; n for (int i = 0; i < n; i++) { n while (!s1.empty() && (arr[i] % arr[s1.top()])) rgt[s1.top()] = i, s1.pop(); n s1.push(i); n } n for (int i = n - 1; i >= 0; i--) { n while (!s2.empty() && (arr[i] % arr[s2.top()])) lft[s2.top()] = i, s2.pop(); n s2.push(i); n } n for (int i = 0; i < n; i++) mx = max(mx, rgt[i] - lft[i] - 2); n for (int i = 0; i < n; i++) n if (rgt[i] - lft[i] - 2 == mx) st.insert(lft[i] + 2); n cout << st.size() << << mx << n ; n for (auto u : st) cout << u << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int l, r; n scanf( %d%d , &l, &r); n if (l == r && l % 2) n printf( %d , l); n else n printf( %d , 2); n } n "} +{"func_code_string": "#include n using namespace std; n const long long C = 1000000007; n long long pow1(long long x, long long y, long long z) { n if (y == 0) { n return 1; n } n if (y % 2 == 0) { n return pow1(x * x % z, y / 2, z); n } n return pow1(x, y - 1, z) * x % z; n } n signed main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n long long n, k, t = 0, r = 0; n cin >> n >> k; n for (long long q = 0; q < n; q++) { n long long w; n cin >> w; n if (w == 50) { n t++; n } else { n r++; n } n } n long long c[51][51]; n for (long long q = 0; q <= 50; q++) { n c[0][q] = 1; n for (long long q1 = 1; q1 <= q; q1++) { n c[q1][q] = c[q1 - 1][q] * (q - q1 + 1) % C * pow1(q1, C - 2, C) % C; n } n } n long long d[5 * n + 2][t + 1][r + 1]; n for (long long q = 0; q < 5 * n + 2; q++) { n for (long long q1 = 0; q1 <= t; q1++) { n fill(d[q][q1], d[q][q1] + r + 1, 0); n } n } n d[0][0][0] = 1; n bool flag = true; n for (long long q = 0; q <= 5 * n; q++) { n if (q % 2 == 1) { n for (long long q1 = 0; q1 <= t; q1++) { n for (long long q2 = 0; q2 <= r; q2++) { n d[q][q1][q2] %= C; n for (long long q3 = 0; q3 <= q1; q3++) { n for (long long q4 = 0; q4 <= q2; q4++) { n if ((q1 - q3) * 50 + (q2 - q4) * 100 <= k && q1 - q3 + q2 - q4) { n d[q + 1][q3][q4] += n d[q][q1][q2] * c[q1 - q3][q1] % C * c[q2 - q4][q2] % C; n } n } n } n } n } n } else { n for (long long q1 = 0; q1 <= t; q1++) { n for (long long q2 = 0; q2 <= r; q2++) { n d[q][q1][q2] %= C; n for (long long q3 = q1; q3 <= t; q3++) { n for (long long q4 = q2; q4 <= r; q4++) { n if ((q3 - q1) * 50 + (q4 - q2) * 100 <= k && q3 - q1 + q4 - q2) { n d[q + 1][q3][q4] += d[q][q1][q2] * c[q3 - q1][t - q1] % C * n c[q4 - q2][r - q2] % C; n } n } n } n } n } n } n if (d[q][t][r] > 0) { n cout << q << n << d[q][t][r] << n ; n flag = false; n break; n } n } n if (flag) { n cout << -1 << n << 0 << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void init_code() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n } n int main() { n init_code(); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n vector arr(n + 1, 0); n map mp; n for (int i = 1; i <= n; ++i) { n cin >> arr[i]; n mp[arr[i]] += 1; n } n int res = 0, shifts = 0; n for (int i = 1; i <= n; ++i) { n if (arr[i] > i + shifts) { n int diff = arr[i] - i - shifts; n res += diff; n shifts += diff; n } n } n cout << res << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int mod = 1000000007; n void __print(long long int x) { cerr << x; } n void __print(float x) { cerr << x; } n void __print(double x) { cerr << x; } n void __print(long double x) { cerr << x; } n void __print(char x) { cerr << << x << ; } n void __print(const char *x) { cerr << << x << ; } n void __print(const string &x) { cerr << << x << ; } n void __print(bool x) { cerr << (x ? true : false ); } n template n void __print(const pair &x) { n cerr << { ; n __print(x.first); n cerr << , ; n __print(x.second); n cerr << } ; n } n template n void __print(const T &x) { n long long int f = 0; n cerr << { ; n for (auto &i : x) cerr << (f++ ? , : ), __print(i); n cerr << } ; n } n void _print() { cerr << ] n ; } n template n void _print(T t, V... v) { n __print(t); n if (sizeof...(v)) cerr << , ; n _print(v...); n } n void solve() { n long long int n; n cin >> n; n vector arr(n); n for (long long int i = 0; i < n; i++) cin >> arr[i]; n long long int l = n, r = -1; n for (long long int i = 0; i < n; i++) { n if (arr[i] == 1) { n l = i; n break; n } n } n for (long long int i = n - 1; n - 1 < -1 ? i < -1 : i > -1; n n - 1 < -1 ? i += 1 : i -= 1) { n if (arr[i] == 1) { n r = i; n break; n } n } n long long int ans = 0; n for (long long int i = l; l < r + 1 ? i < r + 1 : i > r + 1; n l < r + 1 ? i += 1 : i -= 1) { n if (arr[i] == 0) { n ans++; n } n } n cout << ans << endl; n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long int t = 1; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n template n T sqr(T a) { n return (a) * (a); n } n template n T abs(T a) { n return (a < 0) ? -(a) : (a); n } n const double Pi = acos(-1.0); n const double eps = 1e-10; n const int INF = 1000 * 1000 * 1000; n const double phi = 0.5 + sqrt(1.25); n int main() { n string Less = z , More = , tmp = ; n int n; n scanf( %d n , &n); n for (int i = 0, _n = (n)-1; i <= _n; ++i) { n getline(cin, tmp); n Less = min(Less, tmp); n More = max(More, tmp); n } n int i = 0, m = ((int)((Less).size())); n bool coincide = 1; n while (i < m && coincide) n if (Less.substr(0, i + 1) == More.substr(0, i + 1)) n i++; n else n coincide = 0; n printf( %d n , i); n return 0; n } n "} +{"func_code_string": "#include n const long long mod = 1e9 + 7; n const long long LL_MAX = 9223372036854775807; n using namespace std; n int a[100005]; n int main() { n int n; n scanf( %d , &n); n for (int i = 0; i < 2 * n; i++) scanf( %d , &a[i]); n int ans = 0; n for (int i = 0; i < 2 * n; i++) { n if (a[i] == 0) { n continue; n } n if (a[i] != a[i + 1]) { n int t = 0, j; n for (j = i + 1; j < 2 * n && a[j] != a[i]; j++) { n if (a[j] != 0) t++; n } n a[j] = 0; n ans += t; n } else n i++; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int record[300000]; n int main() { n map, int> m; n memset(record, 0, sizeof(record)); n int n, p; n scanf( %d%d , &n, &p); n map, int>::iterator iter; n for (int i = 0; i < n; i++) { n int a, b; n scanf( %d%d , &a, &b); n record[a]++; n record[b]++; n if (a > b) n m[make_pair(b, a)]++; n else n m[make_pair(a, b)]++; n } n long long ans = 0; n for (iter = m.begin(); iter != m.end(); iter++) { n int x = (iter->first).first; n int y = (iter->first).second; n if (record[x] + record[y] - iter->second < p && record[x] + record[y] >= p) n ans--; n } n sort(record + 1, record + n + 1); n int ed = n; n for (int st = 1; st <= n; st++) { n while (record[st] + record[ed] >= p && ed > st) ed--; n ans += min(n - ed, n - st); n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long fastpow(int a, int b, int MOD) { n long long x = 1, y = a; n while (b > 0) { n if (b % 2 == 1) { n x = (x * y) % MOD; n } n y = (y * y) % MOD; n b /= 2; n } n return x; n } n long long InverseEuler(int n, int MOD) { return fastpow(n, MOD - 2, MOD); } n long long f[3]; n bool init; n long long C(int n, int r, int MOD) { n if (!init) { n init = 1; n f[0] = 1; n for (int i = 1; i < 300000; i++) f[i] = (f[i - 1] * i) % MOD; n } n return (f[n] * n ((InverseEuler(f[r], MOD) * InverseEuler(f[n - r], MOD)) % MOD)) % n MOD; n } n int N; n string s[77000]; n unordered_map ct[9]; n unordered_map loc[9][77000]; n int main() { n std::ios::sync_with_stdio(false); n cin >> N; n for (int i = 0; i < N; i++) { n cin >> s[i]; n int M = s[i].length(); n for (int j = 0; j < M; j++) { n int tmp = 0; n for (int k = j; k < M; k++) { n tmp = tmp * 10 + (s[i][k] - 0 ); n ct[k - j][tmp]++; n loc[k - j][i][tmp]++; n } n } n } n for (int i = 0; i < N; i++) { n int M = s[i].length(); n int ln = 10; n int res; n for (int j = 0; j < M; j++) { n int tmp = 0; n for (int k = j; k < M; k++) { n if (k - j >= ln) break; n tmp = tmp * 10 + (s[i][k] - 0 ); n if (ct[k - j][tmp] == loc[k - j][i][tmp]) { n res = tmp; n ln = k - j; n } n } n } n string res2 = ; n while (res) { n res2 += 0 + (res % 10); n res /= 10; n } n reverse(res2.begin(), res2.end()); n while (res2.size() != ln + 1) res2 = 0 + res2; n cout << res2 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n using namespace chrono; n const int maxn = 1e6; n void solve() { n int n, a[21][21], val; n vector data; n map m; n cin >> n; n for (int i = 0; i < n * n; i++) { n cin >> val; n data.push_back(val); n m[val]++; n } n if (n == 1) { n cout << YES n << n ; n cout << data[0] << n ; n return; n } n for (int ii = 0; ii < n; ii++) { n for (int jj = 0; jj < n; jj++) { n a[ii][jj] = 0; n } n } n for (int ii = 0; ii < n / 2; ii++) { n for (int jj = 0; jj < n / 2; jj++) { n int v_f = 0, v_s = 0; n for (auto it = m.begin(); it != m.end(); it++) { n if (it->second >= 4) { n v_f = it->first; n break; n } n } n if (v_f == 0) { n cout << NO n << n ; n return; n } n a[ii][jj] = v_f; n a[n - ii - 1][jj] = v_f; n a[ii][n - jj - 1] = v_f; n a[n - ii - 1][n - jj - 1] = v_f; n m[v_f] -= 4; n } n } n if ((n & 1) == 0) { n cout << YES n << n ; n for (int ii = 0; ii < n; ii++) { n for (int jj = 0; jj < n; jj++) { n cout << a[ii][jj] << ; n } n cout << n ; n } n cout << n ; n return; n } n for (int ii = 0; ii < n / 2; ii++) { n int f = 0; n for (auto it = m.begin(); it != m.end(); it++) { n if (it->second >= 2) { n f = it->first; n } n } n if (f == 0) { n cout << NO n << n ; n return; n } n a[ii][n / 2] = f; n a[n - ii - 1][n / 2] = f; n m[f] -= 2; n } n for (int ii = 0; ii < n / 2; ii++) { n int f = 0; n for (auto it = m.begin(); it != m.end(); it++) { n if (it->second >= 2) f = it->first; n } n if (f == 0) { n cout << NO n << n ; n return; n } n a[n / 2][ii] = f; n a[n / 2][n - ii - 1] = f; n m[f] -= 2; n } n int f = 0; n for (auto it = m.begin(); it != m.end(); it++) { n if (it->second == 1) { n f = it->first; n } n } n if ((n & 1) == 1) { n a[n / 2][n / 2] = f; n } n cout << YES n << n ; n for (int ii = 0; ii < n; ii++) { n for (int jj = 0; jj < n; jj++) { n cout << a[ii][jj] << ; n } n cout << n ; n } n cout << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = (int)(2e6 + 123); n const int R = (int)(2e6); n const long long inf = (long long)(1e12 + 7); n long long pn, p[maxn], lp[maxn], b[maxn]; n bool u[maxn]; n void resheto(long long n) { n for (long long i = 3; i * i <= n; i += 2) n if (!u[i]) n for (long long j = i * i; j <= n; j += 2 * i) u[j] = 1; n p[pn++] = 2; n for (long long i = 3; i <= n; i += 2) n if (!u[i]) p[pn++] = i; n for (long long i = 0; i < pn; ++i) { n for (long long j = p[i]; j <= n; j += p[i]) lp[j] = p[i]; n } n } n long long n, val, x, k, t, ans1; n long long res(long long x) { n long long ans = x; n for (long long mask = 1; mask < (1 << n); ++mask) { n long long cnt = 0, a = 1; n for (long long i = 0; i < n; ++i) { n if ((mask >> i) & 1) { n cnt++; n a *= b[i]; n } n } n if (cnt & 1) n ans -= x / a; n else n ans += x / a; n } n return ans - ans1; n } n long long bin(long long l, long long r, long long k) { n while (r - l > 1) { n long long m = (l + r) / 2; n if (res(m) >= k) n r = m; n else n l = m; n } n if (res(l) == k) return l; n return r; n } n int main() { n ios_base ::sync_with_stdio(NULL); n resheto(R); n cin >> t; n for (long long cs = 1; cs <= t; ++cs) { n cin >> x >> val >> k; n n = ans1 = 0; n while (val != 1) { n b[n++] = lp[val]; n long long y = lp[val]; n while (val % y == 0) val /= y; n } n ans1 = res(x); n cout << bin(x + 1, inf, k) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1e6 + 3; n const int INFI = 1e9 * 2; n const long long LINFI = 1e17; n const double pi = acos(-1.0); n const int N = 111; n const int M = 11; n const int move[8][2] = {1, 0, -1, 0, 0, 1, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1}; n double mabs(double x) { return x > 0 ? x : -x; } n int main() { n int n; n while (scanf( %d , &n) != EOF) { n if (n == 1) n printf( a na nb nb n ); n else { n if (n & 1) { n n--; n for (int i = 0; i < n; i++) putchar((i & 2) ? a : b ); n puts( c ); n for (int i = 0; i < n; i++) putchar((i & 2) ? d : e ); n puts( c ); n putchar( f ); n for (int i = 0; i < n; i++) putchar((i & 2) ? g : h ); n printf( n ); n putchar( f ); n for (int i = 0; i < n; i++) putchar((i & 2) ? i : j ); n printf( n ); n } else { n for (int i = 0; i < n; i++) putchar((i & 2) ? a : b ); n printf( n ); n for (int i = 0; i < n; i++) putchar((i & 2) ? c : d ); n printf( n ); n n -= 2; n putchar( e ); n for (int i = 0; i < n; i++) putchar((i & 2) ? f : g ); n puts( h ); n putchar( e ); n for (int i = 0; i < n; i++) putchar((i & 2) ? i : j ); n puts( h ); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, h; n cin >> n >> h; n vector a(n, 0); n copy(istream_iterator(cin), istream_iterator(), a.begin()); n vector a_orig = a; n sort(a.begin(), a.end()); n int max1 = a[n - 1] + a[n - 2]; n int min1 = a[0] + a[1]; n int best_sofar = max1 - min1; n vector res(n, 2); n if (n >= 3) { n min1 = min(min1 + h, a[1] + a[2]); n max1 = max(max1, a[0] + a[n - 1] + h); n if (abs(max1 - min1) < best_sofar) { n best_sofar = abs(max1 - min1); n res[distance(a_orig.begin(), min_element(a_orig.begin(), a_orig.end()))] = n 1; n } n } n cout << best_sofar << endl; n copy(res.begin(), res.end(), ostream_iterator(cout, )); n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = (long long)1e18; n const long long mod = (long long)1e9 + 7; n const double eps = (double)1e-9; n const double pi = acos(-1.0); n const int dx[] = {0, 0, 1, 0, -1}; n const int dy[] = {0, 1, 0, -1, 0}; n const int N = 100500; n void solve() { n int a, b, cnt = 0; n string second; n cin >> a >> b >> second; n vector v; n cnt = 0; n for (int i = 0; i < (int)second.size(); ++i) { n if (second[i] == X ) continue; n int j = i; n while (j + 1 < (int)second.size() && second[j + 1] == second[j]) j++; n int len = j - i + 1; n if (len < b) continue; n if (b <= len && len < a) { n cout << NO << endl; n return; n } n if (a <= len && len < 2 * b) n cnt++; n else n v.push_back(len); n i = j; n } n if (v.size() == 0) { n if (cnt % 2 == 0) n cout << NO << endl; n else n cout << YES << endl; n return; n } n if (v.size() > 1) { n cout << NO << endl; n return; n } n int x = v[0]; n for (int i = 0; i + a <= x; ++i) { n if ((b <= i && i < a) || (b <= x - a - i && x - a - i < a)) continue; n if (2 * b <= max(i, x - a - i)) continue; n int ncnt = cnt; n if (a <= i && i < 2 * b) ncnt++; n if (a <= x - a - i && x - a - i < 2 * b) ncnt++; n if (ncnt % 2 == 0) { n cout << YES << endl; n return; n } n } n cout << NO << endl; n } n int main() { n cin.tie(NULL); n cout.tie(NULL); n ios_base::sync_with_stdio(false); n int T; n cin >> T; n while (T--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int p = 1000000007; n int n, x, y, g[100005], vg[100005], C, P = 1, a1, a2, a3, b, ans; n vector l[100005], r[100005]; n inline int ksm(int a, int b) { n int res = 1; n while (b) { n if (b & 1) res = (long long)res * a % p; n a = (long long)a * a % p; n b >>= 1; n } n return res; n } n int head[100005], to[200005], nex[200005], cnt; n inline void adde(int f, int t) { n to[++cnt] = t; n nex[cnt] = head[f]; n head[f] = cnt; n } n int fa[100005], dep[100005], sz[100005], son[100005], seg[100005], top[100005]; n void dfs1(int u, int pre) { n fa[u] = pre; n dep[u] = dep[pre] + 1; n sz[u] = 1; n for (int i = head[u], v; i; i = nex[i]) { n v = to[i]; n if (v == pre) continue; n dfs1(v, u); n sz[u] += sz[v]; n if (sz[v] > sz[son[u]]) son[u] = v; n } n } n void dfs2(int u) { n if (son[u]) { n seg[son[u]] = ++cnt; n top[son[u]] = top[u]; n dfs2(son[u]); n } n for (int i = head[u], v; i; i = nex[i]) { n v = to[i]; n if (top[v]) continue; n seg[v] = ++cnt; n top[v] = v; n dfs2(v); n } n } n int sum[100005], sum1[100005]; n inline int query(int *a, int x) { n int res = 0; n for (; x; x -= x & -x) res = (res + a[x]) % p; n return res; n } n inline void modify(int *a, int x, int y) { n for (; x <= n + 1; x += x & -x) a[x] = (a[x] + y) % p; n } n inline int Query(int x) { n int res = ((query(sum1, 1) - query(sum, 1) * 2) % p + p) % p; n while (x) { n res = ((res + (long long)query(sum, seg[x]) * (seg[x] + 1) - n query(sum1, seg[x])) % n p + n p) % n p; n res = ((res - (long long)query(sum, seg[top[x]] - 1) * seg[top[x]] + n query(sum1, seg[top[x]] - 1)) % n p + n p) % n p; n x = fa[top[x]]; n } n return res; n } n inline void Modify(int x, int y) { n while (x) { n modify(sum, seg[top[x]], y); n modify(sum, seg[x] + 1, (p - y) % p); n modify(sum1, seg[top[x]], (long long)y * seg[top[x]] % p); n modify(sum1, seg[x] + 1, (p - (long long)y * (seg[x] + 1) % p) % p); n x = fa[top[x]]; n } n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; ++i) { n scanf( %d%d , &x, &y); n g[i] = y - x + 1; n vg[i] = ksm(g[i], p - 2); n l[x].push_back(i); n r[y].push_back(i); n P = (long long)P * g[i] % p; n C = max(C, y); n } n for (int i = 1; i < n; ++i) { n scanf( %d%d , &x, &y); n adde(x, y); n adde(y, x); n } n dep[0] = -1; n dfs1(1, 0); n seg[1] = top[1] = cnt = 1; n dfs2(1); n for (int c = 1; c <= C; ++c) { n for (unsigned int i = 0; i < l[c].size(); ++i) { n int x = l[c][i]; n a1 = (a1 + (long long)dep[x] * vg[x]) % p; n a2 = (a2 + vg[x]) % p; n a3 = (a3 + (long long)dep[x] * vg[x] % p * vg[x]) % p; n b = (b + (long long)Query(x) * vg[x]) % p; n Modify(x, vg[x]); n } n ans = ((ans + (long long)a1 * a2 - a3 - 2 * b) % p + p) % p; n for (unsigned int i = 0; i < r[c].size(); ++i) { n int x = r[c][i]; n a1 = ((a1 - (long long)dep[x] * vg[x]) % p + p) % p; n a2 = (a2 - vg[x] + p) % p; n a3 = ((a3 - (long long)dep[x] * vg[x] % p * vg[x]) % p + p) % p; n Modify(x, p - vg[x]); n b = ((b - (long long)Query(x) * vg[x]) % p + p) % p; n } n } n ans = (long long)ans * P % p; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void bringToTen(int &k, int &rating, vector &bucket) { n for (int i = 9; i > 0; i--) { n int x = 0; n while (x < 100) { n int h = min(k / (10 - i), bucket[x + i]); n k -= h * (10 - i); n bucket[x + 10] += h; n rating += h; n bucket[x + i] -= h; n x += 10; n } n } n } n void addToTen(int &k, int &rating, vector &bucket) { n int x = 0; n while (x < 100) { n int h = min(k / 10, bucket[x]); n rating += h; n bucket[x + 10] += h; n bucket[x] -= h; n k -= 10 * h; n x += 10; n } n } n int main(void) { n int n, k, rating = 0, h; n scanf( %d %d , &n, &k); n vector a(n); n for (int(i) = (0); i < (n); i++) scanf( %d , &a[i]); n vector num(101, 0); n for (int(i) = (0); i < (n); i++) { n num[a[i]]++; n rating += a[i] / 10; n } n bringToTen(k, rating, num); n addToTen(k, rating, num); n printf( %d n , rating); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int arr[200000], arr2[200000]; n int main() { n int n, i; n long long sum = 0; n scanf( %d , &n); n for (i = 0; i < n; i++) { n scanf( %d , &arr[i]); n arr2[i] = arr[i] + arr2[i - 1]; n } n for (i = 0; i < n; i++) { n if (arr[i] == 0) { n sum += arr2[i]; n } n } n cout << sum; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e6 + 6, M = 3, nBits = 2e8 + 5, MM = (1 << 16), MAX = 1111, n OO = 0x3f3f3f3f, MOD = 1000000007, inf = 1 << 30; n const double PI = acos(-1); n const long long INF = (long long)1e18, MOOD = 1000000007; n long long GCD(long long a, long long b) { return !b ? a : GCD(b, a % b); } n long long LCM(long long x, long long y) { return (x * y / GCD(x, y)); } n long long fact(long long z) { return (z <= 1) ? 1 : z * fact(z - 1); } n void fast() { n std::ios_base::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n } n int t, a, b, color[N], n, m, k, x, y, r[5001], c[5001]; n int main() { n fast(); n cin >> n >> m >> k; n for (int i = 1; i <= k; ++i) { n cin >> a >> b >> color[i]; n if (a == 1) n r[b] = i; n else n c[b] = i; n } n for (int i = 1; i <= n; ++i) { n for (int j = 1; j <= m; ++j) cout << color[max(r[i], c[j])] << ; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector > P; n int n; n bool compare_y(const pair& p1, n const pair& p2) { n if (p1.second != p2.second) return p1.second < p2.second; n return p1.first < p2.first; n } n long long int d(pair p1, n pair p2) { n return pow(p1.first - p2.first, 2) + pow(p1.second - p2.second, 2); n } n long long int func(int l, int h, n vector > Y) { n if (h - l == 1) return d(P[l], P[h]); n if (h - l == 2) n return min(min(d(P[l], P[l + 1]), d(P[l + 1], P[h])), d(P[l], P[h])); n int mid = (l + h) / 2, sz = Y.size(); n vector > left, right; n for (int i = 0; i < sz; ++i) { n if (Y[i].first <= P[mid].first) n left.push_back(Y[i]); n else n right.push_back(Y[i]); n } n long long int m = min(func(l, mid, left), func(mid + 1, h, right)); n for (int i = 0; i < sz; ++i) n for (int j = i + 1; j < i + 10 && j < sz; ++j) n if (d(Y[i], Y[j]) < m) m = d(Y[i], Y[j]); n return m; n } n int main() { n cin >> n; n vector > Q; n for (int i = 0; i < n; ++i) { n long long int u; n cin >> u; n P.push_back(make_pair(i + 1, u)); n Q.push_back(make_pair(i + 1, u)); n if (i) P[i].second += P[i - 1].second; n if (i) Q[i].second += Q[i - 1].second; n } n sort(Q.begin(), Q.end(), compare_y); n cout << func(0, n - 1, Q) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long t = 1; n cin >> t; n while (t--) { n long long n, x; n cin >> n >> x; n long long deg[1005] = {}; n for (long long i = 1; i < n; i++) { n long long u, v; n cin >> u >> v; n deg[u]++, deg[v]++; n } n if (n == 1 || deg[x] == 1) n cout << Ayush n ; n else { n if (n % 2) n cout << Ashish n ; n else n cout << Ayush n ; n } n } n cerr << Time elapsed: << 1.0 * clock() / CLOCKS_PER_SEC << sec n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1005; n int n, g[21][21], a, t[maxn]; n bool ans = true; n int find(int times) { n int i = 1; n bool finded = false; n for (; i <= 1000; ++i) n if (t[i] >= times) { n finded = true; n break; n } n if (!finded) ans = false; n t[i] -= times; n return i; n } n int main() { n cin >> n; n for (int i = 0; i < n * n; i++) { n cin >> a; n t[a]++; n } n for (int i = 1; i <= n / 2; i++) n for (int j = 1; j <= n / 2; j++) n g[i][j] = g[n - i + 1][j] = g[i][n - j + 1] = g[n - i + 1][n - j + 1] = n find(4); n if (ans) { n if (n & 1) { n for (int i = 1; i <= n / 2; i++) n if (i != (n + 1) / 2) { n g[i][(n + 1) / 2] = g[n - i + 1][(n + 1) / 2] = find(2); n g[(n + 1) / 2][i] = g[(n + 1) / 2][n - i + 1] = find(2); n } n g[(n + 1) / 2][(n + 1) / 2] = find(1); n } n if (ans) { n cout << YES << endl; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= n; j++) cout << g[i][j] << n [j == n]; n } n } n if (!ans) cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, d; n int a[200]; n int x[200], y[200]; n int dis[200]; n vector > edge[200]; n int bellman_ford() { n for (int i = 0; i < n; ++i) dis[i] = 1000000000; n dis[0] = 0; n for (int i = 1; i < n; ++i) { n for (int j = 0; j < n; ++j) { n for (int k = 0, len = edge[j].size(); k < len; ++k) n dis[edge[j][k].first] = n min(dis[edge[j][k].first], dis[j] + edge[j][k].second); n } n } n return max(0, dis[n - 1]); n } n int D(int i, int j) { return abs(x[i] - x[j]) + abs(y[i] - y[j]); } n int main() { n while (cin >> n >> d) { n a[0] = 0; n a[n - 1] = 0; n for (int i = 1; i < n - 1; ++i) cin >> a[i]; n for (int i = 0; i < n; ++i) { n cin >> x[i] >> y[i]; n } n for (int i = 0; i < n; ++i) n for (int j = 0; j < n; ++j) n if (i != j) { n edge[i].push_back(make_pair(j, D(i, j) * d - a[i])); n } n cout << bellman_ford() << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 2e5 + 50; n const long long Mod = 1e9 + 7; n struct node { n long long to, next, w; n } edge[maxn * 2]; n struct Edge { n long long u, v; n } t[maxn]; n long long k = 0, head[maxn]; n void add(long long u, long long v) { n edge[++k].to = v; n edge[k].next = head[u]; n head[u] = k; n } n long long T, p[maxn], m, n; n long long ans = 0, sz[maxn], cnt[maxn]; n void dfs(long long x, long long f, long long opt) { n sz[x] = 1; n for (long long i = head[x]; i; i = edge[i].next) { n if (edge[i].to == f) continue; n dfs(edge[i].to, x, i); n sz[x] += sz[edge[i].to]; n } n if (opt == 0) return; n cnt[opt] = sz[x] * (n - sz[x]); n if (cnt[opt] == 0 && opt != 0) cnt[opt] = n - 1; n } n int main() { n cin >> T; n while (T--) { n k = 0; n memset(head, 0, sizeof(head)); n memset(cnt, 0, sizeof(cnt)); n cin >> n; n for (long long i = 1; i <= n - 1; i++) { n long long u, v; n cin >> u >> v; n add(u, v); n add(v, u); n } n cin >> m; n for (long long i = 1; i <= m; i++) cin >> p[i]; n sort(p + 1, p + 1 + m); n long long cnt1 = n - 1 - m; n if (cnt1 <= 0) cnt1 = 0; n dfs(1, 1, 0); n sort(cnt + 1, cnt + 1 + k); n while (m > n - 1) { n p[m - 1] = (p[m - 1] * p[m]) % Mod; n m--; n } n long long ans = 0, opt = 0; n for (long long i = k / 2 + 1; i <= k; i++) { n if (cnt1) { n ans = (ans + cnt[i] * 1) % Mod; n cnt1--; n } else { n ans = (ans + cnt[i] * p[++opt] % Mod) % Mod; n } n } n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector> L[1000005]; n long long fac[1000005]; n const long long MOD = 1000000007; n int main() { n int N, M; n scanf( %d%d , &N, &M); n for (int i = 0; i < N; ++i) { n int g; n scanf( %d , &g); n map cnt; n for (int j = 0; j < g; ++j) { n int a; n scanf( %d , &a); n ++cnt[a]; n } n for (auto x : cnt) { n L[x.first].push_back({i, x.second}); n } n } n map>, int> mp; n for (int i = 1; i <= M; ++i) ++mp[L[i]]; n fac[0] = 1; n for (int i = 1; i <= M; ++i) fac[i] = (fac[i - 1] * i) % MOD; n long long ans = 1; n for (auto &x : mp) ans = (ans * fac[x.second]) % MOD; n printf( %I64d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n long long get_sum(vector &prefix, int left, int right) { n if (left != 0) n return prefix[right] - prefix[left - 1]; n else n return prefix[right]; n } n void To_Add_or_Not_To_Add(vector &a, long long k) { n int n = a.size(); n sort(a.begin(), a.end()); n vector prefix = a; n for (int i = 1; i < n; i++) prefix[i] += prefix[i - 1]; n long ans = 0; n int maxFreq = INT_MIN; n for (auto key : a) { n int freq = upper_bound(a.begin(), a.end(), key) - n lower_bound(a.begin(), a.end(), key); n int low = 0; n int high = lower_bound(a.begin(), a.end(), key) - a.begin(); n high--; n long long stock = k; n while (low <= high) { n int mid = (low + high) / 2; n int len = high - mid + 1; n auto req = len * key - get_sum(prefix, mid, high); n if (stock >= req) { n stock -= req; n high = mid - 1; n freq += len; n } else { n low = mid + 1; n } n } n if (freq > maxFreq) { n maxFreq = freq; n ans = key; n } n } n cout << maxFreq << << ans << endl; n } n int main() { n int n; n cin >> n; n long long k; n cin >> k; n vector a(n); n for (auto &ele : a) cin >> ele; n To_Add_or_Not_To_Add(a, k); n return 0; n } n "} +{"func_code_string": "/* n */ n #include n using namespace std; n n #define rng(x) x.begin(), x.end() n #define pb push_back n #define ff first n #define ss second n n typedef double db; n typedef long long ll; n typedef pair pi; n typedef pair pl; n typedef vector vi; n typedef vector vl; n typedef vector vvi; n typedef vector vvl; n typedef vector vb; n typedef unsigned long long int lld; n n /*-----------------------------Code begins----------------------------------*/ n ll mod = 1e9 + 7; n const ll INF = 1e9; n n ll inv(ll v) n { n if (v<=1) n return v; n return inv(mod%v)*(mod-mod/v)%mod; n } n n void solve(){ n int n; cin>>n; n vvl dist(n,vl(n,INF)); n for(int i=1; i>u>>v; n u--; v--; n dist[u][v]=1; n dist[v][u]=1; n } n for(int i=0; i> T; n while (T--){ n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double EPS = (long double)1e-7; n const long double PI = acos(0) * 2; n bool isZero(const long double& x) { return abs(x) <= EPS; } n int sign(const long double& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); } n long long gcd(long long a, long long b) { n for (; b; a %= b, swap(a, b)) { n } n return abs(a); n } n pair operator+(const pair& a, n const pair& b) { n return pair(a.first + b.first, a.second + b.second); n } n pair operator-(const pair& a, n const pair& b) { n return pair(a.first - b.first, a.second - b.second); n } n pair operator*(const pair& a, n const long long& b) { n return pair(a.first * b, a.second * b); n } n long long operator*(const pair& a, n const pair& b) { n return a.first * b.second - b.first * a.second; n } n long long ccw(const pair& a, n const pair& b, n const pair& c) { n return a * b + b * c + c * a; n } n void fg(vector G[], int a, int b) { n G[a].emplace_back(b); n G[b].emplace_back(a); n } n void fg(vector > G[], int a, int b, int c) { n G[a].emplace_back(b, c); n G[b].emplace_back(a, c); n } n const int MAXN = 1000055; n int A[MAXN], B[MAXN]; n bitset C; n int T, N; n void run() { n cin >> N; n for (int i = 1; i <= N; i++) { n cin >> A[i]; n B[i] = i - A[i]; n } n vector V; n for (int i = 1;;) { n V.emplace_back(i); n if (C[i]) break; n C[i] = true; n i = B[i]; n } n for (int v : V) C[v] = false; n V.erase(V.begin(), find(((V).begin()), ((V).end()), V.back()) + 1); n cout << ((int)(V).size()) << n ; n for (int v : V) cout << v << ; n cout << n ; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n for (cin >> T; T--;) run(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf(1010101010); n int le_res, aa; n char naam[1000]; n int le_naam; n char naam_and_res[1000]; n char occ[1000]; n int zvals[1000]; n void z_functie(char* s, int n, int* z) { n int a(0), b(0); n for (int i(0); i < (n); i++) z[i] = n; n for (int i = 1; i < n; i++) { n int k = max(0, min(b - i, z[i - a])); n while (i + k < n && s[i + k] == s[k]) k++; n z[i] = k; n if (i + k > b) a = i, b = i + k; n } n } n bool chk(char* s) { n for (int i(0); i < (le_res); i++) naam_and_res[le_naam + 1 + i] = s[i]; n naam_and_res[le_naam + 1 + le_res] = 0; n z_functie(naam_and_res, le_naam + 1 + le_res, zvals); n for (int i(0); i < (le_res - le_naam + 1); i++) { n int zz(zvals[le_naam + 1 + i]); n if (zz == le_naam && occ[i] == 0 ) return false; n if (zz != le_naam && occ[i] == 1 ) return false; n } n return true; n } n char tpl[1000]; n char ans[1000]; n int main() { n cin >> le_res >> aa; n scanf( %s , naam), le_naam = strlen(naam); n for (int i(0); i < (le_naam); i++) naam_and_res[i] = naam[i]; n naam_and_res[le_naam] = $ ; n scanf( %s , occ); n for (int i(0); i < (le_res); i++) tpl[i] = . ; n for (int i(0); i < (le_res - le_naam + 1); i++) { n if (occ[i] == 1 ) { n for (int j(i); j < (i + le_naam); j++) { n tpl[j] = naam[j - i]; n } n } n } n for (int i(0); i < (le_naam); i++) { n char c( a + (((naam[i] - a ) + 1) % aa)); n for (int i(0); i < (le_res); i++) { n if (tpl[i] == . ) n ans[i] = c; n else n ans[i] = tpl[i]; n } n if (chk(ans)) { n ans[le_res] = 0; n printf( %s n , ans); n goto done; n } n } n puts( No solution ); n done:; n } n "} +{"func_code_string": "#include n #pragma GCC optimize 03 n using namespace std; n const long long int N = 2e5 + 5; n const long long int mod = 1e9 + 7; n const long long int inf = 1e9 + 9; n long long int a[N]; n signed main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long int n; n cin >> n; n stack s; n long long int ans = 0; n for (long long int i = 1; i <= n; i++) { n cin >> a[i]; n while (!s.empty() && a[s.top()] < a[i]) s.pop(); n if (!s.empty()) ans = max(ans, a[s.top()] ^ a[i]); n s.push(i); n } n for (long long int i = n; i >= 1; i--) { n while (!s.empty() && a[s.top()] < a[i]) s.pop(); n if (!s.empty()) ans = max(ans, a[s.top()] ^ a[i]); n s.push(i); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char c[2001][2001]; n int sum1[2001][2001], sum2[2001][2001]; n int f[2001][2001][2]; n int mod = 1000000007; n int main() { n int n, m; n scanf( %d %d , &n, &m); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n scanf( %c , &c[i][j]); n } n } n if (n == 1 && m == 1 && c[1][1] == . ) { n cout << 1 << endl; n return 0; n } n for (int i = n; i >= 1; i--) { n for (int j = m; j >= 1; j--) { n if (c[i][j] == R ) { n sum1[i][j] = sum1[i][j + 1] + 1; n sum2[i][j] = sum2[i + 1][j] + 1; n } else { n sum1[i][j] = sum1[i][j + 1]; n sum2[i][j] = sum2[i + 1][j]; n } n } n } n for (int i = 1; i < n; i++) { n if (sum2[i][m] == 0) f[i][m][0] = 1; n } n for (int i = 1; i < m; i++) { n if (sum1[n][i] == 0) f[n][i][1] = 1; n } n for (int i = n - 1; i >= 1; i--) { n for (int j = m - 1; j >= 1; j--) { n f[i][j][0] += f[i + 1][j][1]; n f[i][j][1] += f[i][j + 1][0]; n f[i][j][0] %= mod; n f[i][j][1] %= mod; n if (c[i + 1][j] == R ) { n f[i][j][0] += n (f[i + 1][j][0] - f[n - sum2[i + 1][j] + 1][j][1] + mod) % mod; n } else { n f[i][j][0] += f[i + 1][j][0]; n } n if (c[i][j + 1] == R ) { n f[i][j][1] += n (f[i][j + 1][1] - f[i][m - sum1[i][j + 1] + 1][0] + mod) % mod; n } else { n f[i][j][1] += f[i][j + 1][1]; n } n f[i][j][0] %= mod; n f[i][j][1] %= mod; n } n } n cout << (f[1][1][0] + f[1][1][1]) % mod << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( -O2 ) n using namespace std; n void err(istream_iterator it) {} n template n void err(istream_iterator it, T a, Args... args) { n cerr << *it << = << a << endl; n err(++it, args...); n } n const int LIM = 1e5 + 5, MOD = 1e9 + 7; n int t, n, m, k, x, y; n vector par, rk; n int getpar(int i) { return (par[i] == i) ? i : (par[i] = getpar(par[i])); } n bool join(int i, int j) { n i = getpar(i), j = getpar(j); n if (i == j) return 0; n if (rk[i] > rk[j]) n par[j] = i; n else { n par[i] = j; n if (rk[i] == rk[j]) rk[j]++; n } n return 1; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> m; n par.resize(2 * n + 2 * m - 2); n for (int i = 0; i < par.size(); i++) par[i] = i; n x = t + m + n + m - 2; n rk.assign(2 * n + 2 * m - 2, 0); n for (int i = 0; i < n; i++) { n join(i + x, i); n join(i + x + 1 - m, i + m - 1); n } n for (int i = 0; i < m; i++) { n join(x - i, i); n join(x - i + n - 1, i + n - 1); n } n set st; n for (int i = 0; i < par.size(); i++) { n st.insert(getpar(i)); n } n cout << st.size() << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ld = long double; n ll x[1 << 18]; n int main() { n ios::sync_with_stdio(false), cin.tie(0); n ll n, r; n cin >> n >> r; n ll m = 1 << n; n ll sum = 0; n for (int i = 0; i < m; i++) cin >> x[i], sum += x[i]; n cout << fixed << setprecision(7); n cout << (ld)sum / (ld)m << endl; n for (int i = 0; i < r; i++) { n ll a, b; n cin >> a >> b; n sum -= x[a]; n x[a] = b; n sum += x[a]; n cout << (ld)sum / (ld)m << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n long long n, k; n cin >> n >> k; n if (k >= n / 2) n cout << n * (n - 1) / 2; n else n cout << n * (n - 1) / 2 - (n - 2 * k) * (n - 2 * k - 1) / 2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long T; n cin >> T; n while (T--) { n int N; n string S; n cin >> N >> S; n int Who = -1; n string Ans1 = , Ans2 = ; n for (int i = 0; i < N; i++) { n if (S[i] == 2 && !(~Who)) { n Ans1.push_back( 1 ); n Ans2.push_back( 1 ); n } else if (S[i] == 2 && ~Who) { n Ans1.push_back( 0 ); n Ans2.push_back( 2 ); n } else if (S[i] == 0 ) { n Ans1.push_back( 0 ); n Ans2.push_back( 0 ); n } else { n if (~Who) { n Ans1.push_back( 0 ); n Ans2.push_back( 1 ); n } else { n Ans1.push_back( 1 ); n Ans2.push_back( 0 ); n Who = 1; n } n } n } n cout << Ans1 << n << Ans2 << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int const N = 1000000; n int n, m; n vector > > adj; n bool valid; n int ans[N]; n int cnt; n int st[N * 3]; n void readin() { n int u, v; n char b[10]; n scanf( %d%d , &n, &m); n valid = true; n adj.clear(); n adj.resize(n + 1); n for (int i = 0; i < m; ++i) { n scanf( %d%d%s , &u, &v, b); n if (v <= u) { n valid = false; n } n adj[u].push_back(make_pair(v, b[0] == L ? 0 : 1)); n } n } n inline int lc(int root) { return root << 1; } n inline int rc(int root) { return (root << 1) | 1; } n void init_st(int root, int l, int r) { n if (l == r) { n st[root] = l; n return; n } n int mid = (l + r) >> 1; n init_st(lc(root), l, mid); n init_st(rc(root), mid + 1, r); n st[root] = max(st[lc(root)], st[rc(root)]); n } n void update_st(int root, int l, int r, int x, int v) { n if (l == r) { n st[root] = v; n return; n } n int mid = (l + r) >> 1; n if (x <= mid) { n update_st(lc(root), l, mid, x, v); n } else { n update_st(rc(root), mid + 1, r, x, v); n } n } n int query_st(int root, int l, int r, int x, int y) { n if (l == r) { n return st[root]; n } n int mid = (l + r) >> 1; n if (y <= mid) { n return query_st(lc(root), l, mid, x, y); n } else if (x > mid) { n return query_st(rc(root), mid + 1, r, x, y); n } else { n return max(query_st(lc(root), l, mid, x, mid), n query_st(rc(root), mid + 1, r, mid + 1, y)); n } n } n bool build(int root, int limit) { n if (root > limit) { n return true; n } n int l_max = 0, r_min = INT_MAX; n for (vector >::const_iterator it = adj[root].begin(); n it != adj[root].end(); ++it) { n if (it->second == 0) { n l_max = max(l_max, query_st(1, 1, n, root + 1, it->first)); n } else { n r_min = min(r_min, it->first); n } n } n if (l_max == 0) { n ans[cnt++] = root; n return build(root + 1, limit); n } else if (r_min == INT_MAX) { n bool ret = build(root + 1, limit); n ans[cnt++] = root; n return ret; n } else { n if (l_max >= r_min) { n return false; n } n bool ret = true; n ret = ret && build(root + 1, l_max); n ans[cnt++] = root; n ret = ret && build(l_max + 1, limit); n return ret; n } n } n void solve() { n if (!valid) { n printf( IMPOSSIBLE n ); n return; n } n init_st(1, 1, n); n for (int i = n; i >= 1; --i) { n int u = i; n for (vector >::const_iterator it = adj[i].begin(); n it != adj[i].end(); ++it) { n u = max(u, it->first); n } n update_st(1, 1, n, i, query_st(1, 1, n, i, u)); n } n cnt = 0; n if (build(1, n)) { n for (int i = 0; i < n; ++i) { n printf( %d%c , ans[i], i < n - 1 ? : n ); n } n } else { n printf( IMPOSSIBLE n ); n } n } n int main() { n readin(); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, f = 0; n cin >> n; n string a[] = { Sheldon , Leonard , Penny , Rajesh , Howard }; n while (n > 5) { n n = n / 2 - 2; n } n cout << a[n - 1] << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n int n, k; n cin >> n >> k; n string s, st = ; n cin >> s; n vector m(28); n vector l(28); n for (int i = 0; i < n; i++) { n m[((int)s[i]) - 97]++; n } n if (n == k) { n cout << n ; n return 0; n } n while (k > 0) { n for (int i = 0; i < 27; i++) { n if (k >= m[i]) { n k -= m[i]; n l[i] = m[i]; n } else { n m[i] = k; n l[i] = k; n k = 0; n } n if (k == 0) { n break; n } n } n } n for (int i = 0; i < n; i++) { n if (l[((int)s[i]) - 97] > 0) { n l[((int)s[i]) - 97]--; n continue; n } else n cout << s[i]; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 80, Inf = 0x3f3f3f3f; n int n, f[N][N][N][2]; n int pos[3][N], num[3][N]; n char s[N]; n inline int getid(char ch) { n if (ch == V ) return 0; n if (ch == K ) return 1; n return 2; n } n inline int move(int i, int j, int k, int id) { n return max(0, num[0][id] - i) + max(0, num[1][id] - j) + n max(0, num[2][id] - k) - 1; n } n int main() { n ios::sync_with_stdio(false); n cin >> n >> s + 1; n for (int i = 1; i <= n; ++i) { n int now = getid(s[i]); n for (int j = 0; j < 3; ++j) num[j][i] = num[j][i - 1]; n pos[now][++num[now][i]] = i; n } n memset(f, 0x3f, sizeof f); n f[0][0][0][0] = 0; n for (int i = 0; i <= num[0][n]; ++i) n for (int j = 0; j <= num[1][n]; ++j) n for (int k = 0; k <= num[2][n]; ++k) n for (int fl = 0; fl < 2; ++fl) { n if (i < num[0][n]) n f[i + 1][j][k][1] = n min(f[i + 1][j][k][1], n f[i][j][k][fl] + move(i, j, k, pos[0][i + 1])); n if (j < num[1][n] && !fl) n f[i][j + 1][k][0] = n min(f[i][j + 1][k][0], n f[i][j][k][fl] + move(i, j, k, pos[1][j + 1])); n if (k < num[2][n]) n f[i][j][k + 1][0] = n min(f[i][j][k + 1][0], n f[i][j][k][fl] + move(i, j, k, pos[2][k + 1])); n } n cout << min(f[num[0][n]][num[1][n]][num[2][n]][0], n f[num[0][n]][num[1][n]][num[2][n]][1]) n << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1e18; n long long fn(string a, string b) { n long long n = a.size(), m = b.size(), j = 0; n for (long long i = 0; i < m; i++) { n if (b[i] == a[j]) { n j++; n if (j >= n) { n return m - n; n } n } n } n if (j >= n) { n return m - n; n } n return m - j + n - j; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long ttt; n cin >> ttt; n vector v; n long long x = 1; n while (x <= inf) { n string s = ; n long long z = x; n while (z) { n s += (char)( 0 + z % 10); n z /= 10; n } n reverse(s.begin(), s.end()); n v.push_back(s); n x *= 2; n } n while (ttt--) { n string s; n cin >> s; n long long n = s.size(); n long long ans = inf; n for (auto x : v) { n ans = min(ans, fn(x, s)); n } n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n n using namespace std; n n #define lln long long int n n #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); n n void solve(){ n int n, k; n cin>>n>>k; n n vector a(n+1); n n for(int i = 1;i<=k;i++) n a[i] = i; n n int x = k - 1; n n for(int i = k+1;i<=n;i++){ n a[i] = x; n x--; n } n n vector p(n+1); n vector ans; n n for(int i = n;i>=1;i--){ n if(p[a[i]]==1) n continue; n else { n ans.push_back(a[i]); n p[a[i]] = 1; n } n } n reverse(ans.begin(),ans.end()); n n for(auto i:ans){ n cout<>q; n n while(q--){ n solve(); n } n n return 0; n }"} +{"func_code_string": "#include n using namespace std; n int n, m, sz1, sz2, val; n int d1[200005], d2[200005], d[200005]; n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , &val); n if (val != 0) d1[sz1++] = val; n } n for (int i = 0; i < n; i++) { n scanf( %d , &val); n if (val != 0) d2[sz2++] = val; n } n for (int i = 0; i < sz1; i++) { n int val = d1[i]; n int id = (i + 1) % sz1; n d[val] = d1[id]; n } n for (int i = 0; i < sz2; i++) { n int val = d2[i]; n int id = (i + 1) % sz2; n if (d[val] == d2[id]) continue; n printf( NO n ); n return 0; n } n printf( YES n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char arr[4][4], a; n for (int i = 0; i < 4; i++) { n for (int j = 0; j < 4; j++) { n cin >> a; n arr[i][j] = a; n } n } n for (int i = 0; i < 3; i++) { n for (int j = 0; j < 3; j++) { n if (arr[i][j] == # && arr[i][1 + j] == # && n (arr[1 + i][j] == # || arr[i + 1][1 + j] == # ) || n (arr[i][j] == # || arr[i][1 + j] == # ) && arr[1 + i][j] == # && n arr[i + 1][1 + j] == # ) { n cout << YES ; n return 0; n } else if (arr[i][j] == . && arr[i][1 + j] == . && n (arr[1 + i][j] == . || arr[i + 1][1 + j] == . ) || n (arr[i][j] == . || arr[i][1 + j] == . ) && n arr[1 + i][j] == . && arr[i + 1][1 + j] == . ) { n cout << YES ; n return 0; n } n } n } n cout << NO ; n } n "} +{"func_code_string": "#include n const int N = 1e6 + 5, P = 1e9 + 9; n inline int ksm(int a, int b) { n int r = 1; n for (; b; b >>= 1, a = (long long)a * a % P) n if (b & 1) r = (long long)r * a % P; n return r; n } n int n, q, a[N], t[N], f[N], F[N]; n struct mat { n int s[2][2]; n inline friend mat operator+(mat a, mat b) { n return a.s[0][0] = (a.s[0][0] + b.s[0][0]) % P, n a.s[0][1] = (a.s[0][1] + b.s[0][1]) % P, n a.s[1][0] = (a.s[1][0] + b.s[1][0]) % P, n a.s[1][1] = (a.s[1][1] + b.s[1][1]) % P, a; n } n inline friend mat operator*(mat a, mat b) { n mat c; n c.s[0][0] = n ((long long)a.s[0][0] * b.s[0][0] + (long long)a.s[0][1] * b.s[1][0]) % n P, n c.s[0][1] = n ((long long)a.s[0][0] * b.s[0][1] + (long long)a.s[0][1] * b.s[1][1]) % n P, n c.s[1][0] = n ((long long)a.s[1][0] * b.s[0][0] + (long long)a.s[1][1] * b.s[1][0]) % n P, n c.s[1][1] = n ((long long)a.s[1][0] * b.s[0][1] + (long long)a.s[1][1] * b.s[1][1]) % n P; n return c; n } n inline friend bool operator!=(mat a, mat b) { n return a.s[0][0] != b.s[0][0] || a.s[0][1] != b.s[0][1] || n a.s[1][0] != b.s[1][0] || a.s[1][1] != b.s[1][1]; n } n inline bool INV(mat &b) { n long long x = (long long)s[0][0] * s[1][1] - (long long)s[0][1] * s[1][0]; n if (!x) return 0; n if (x > 0) n x = ksm(x % P, P - 2), b.s[0][0] = (long long)x * s[1][1] % P, n b.s[1][1] = x * s[0][0] % P, b.s[0][1] = x * (P - s[0][1]) % P, n b.s[1][0] = x * (P - s[1][0]) % P; n else n x = ksm((-x) % P, P - 2), b.s[0][0] = (long long)x * (P - s[1][1]) % P, n b.s[1][1] = x * (P - s[0][0]) % P, b.s[0][1] = x * s[0][1] % P, n b.s[1][0] = x * s[1][0] % P; n return 1; n } n } E, Z, O, lz[N]; n inline mat ksm(mat a, int b) { n mat r = E; n for (; b; b >>= 1, a = a * a) n if (b & 1) r = r * a; n return r; n } n inline int sum(int l, int r, mat v) { n return ((long long)(F[r] - F[l - 1] + P) * v.s[1][1] + n (long long)(F[r + 1] - F[l] + P) * v.s[1][0]) % n P; n } n inline void tg(int p, int l, int r, mat v) { n lz[p] = lz[p] + v, t[p] = (t[p] + sum(l, r, v)) % P; n } n inline void pushdown(int p, int l, int r, int mid) { n if (lz[p] != O) n tg(p << 1, l, mid, lz[p]), tg(p << 1 | 1, mid + 1, r, lz[p]), lz[p] = O; n } n inline void build(int p, int l, int r) { n if (l == r) { n t[p] = a[l]; n return; n } n int mid = l + r >> 1; n build(p << 1, l, mid), build(p << 1 | 1, mid + 1, r), n t[p] = (t[p << 1] + t[p << 1 | 1]) % P; n } n inline void add(int p, int l, int r, int x, int y, mat v) { n if (l >= x && r <= y) return tg(p, l, r, v); n int mid = l + r >> 1; n pushdown(p, l, r, mid); n if (x <= mid) add(p << 1, l, mid, x, y, v); n if (y > mid) add(p << 1 | 1, mid + 1, r, x, y, v); n t[p] = (t[p << 1] + t[p << 1 | 1]) % P; n } n inline int query(int p, int l, int r, int x, int y) { n if (l >= x && r <= y) return t[p]; n int mid = l + r >> 1, res = 0; n pushdown(p, l, r, mid); n if (x <= mid) res = (res + query(p << 1, l, mid, x, y)) % P; n if (y > mid) res = (res + query(p << 1 | 1, mid + 1, r, x, y)) % P; n return res; n } n int main() { n scanf( %d%d , &n, &q); n int i, l, r, v; n mat x, y; n for (i = 1; i <= n; i++) scanf( %d , a + i); n build(1, 1, n); n for (f[1] = f[2] = 1, i = 3; i < N; i++) f[i] = (f[i - 1] + f[i - 2]) % P; n for (i = 1; i < N; i++) F[i] = (F[i - 1] + f[i]) % P; n E.s[0][0] = E.s[1][1] = Z.s[0][0] = Z.s[0][1] = Z.s[1][0] = 1; n while (q--) n if (scanf( %d%d%d , &i, &l, &r), i > 1) n printf( %d n , query(1, 1, n, l, r)); n else n x = ksm(Z, l - 1), x.INV(y) && (add(1, 1, n, l, r, y), 0); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void low(int n) { n switch (n) { n default: n cout << zero ; n break; n case 1: n cout << one ; n break; n case 2: n cout << two ; n break; n case 3: n cout << three ; n break; n case 4: n cout << four ; n break; n case 5: n cout << five ; n break; n case 6: n cout << six ; n break; n case 7: n cout << seven ; n break; n case 8: n cout << eight ; n break; n case 9: n cout << nine ; n break; n case 10: n cout << ten ; n break; n case 11: n cout << eleven ; n break; n case 12: n cout << twelve ; n break; n case 13: n cout << thirteen ; n break; n case 14: n cout << fourteen ; n break; n case 15: n cout << fifteen ; n break; n case 16: n cout << sixteen ; n break; n case 17: n cout << seventeen ; n break; n case 18: n cout << eighteen ; n break; n case 19: n cout << nineteen ; n break; n } n } n void high(int n) { n switch (n) { n case 2: n cout << twenty ; n break; n case 3: n cout << thirty ; n break; n case 4: n cout << forty ; n break; n case 5: n cout << fifty ; n break; n case 6: n cout << sixty ; n break; n case 7: n cout << seventy ; n break; n case 8: n cout << eighty ; n break; n default: n cout << ninety ; n break; n } n } n int main() { n int n; n cin >> n; n if (n < 20) n low(n); n else { n high(n / 10); n if (n % 10 != 0) { n cout << - ; n low(n % 10); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void ga(int N, int *A) { n for (int i(0); i < N; i++) scanf( %d , A + i); n } n char s[222222], r[222222]; n int N, A, B; n int main(void) { n scanf( %s%s , s, r), N = strlen(s); n for (int i(0); i < N; i++) n if (s[i] ^ r[i]) A += s[i] == 52, B += s[i] != 52; n printf( %d n , max(A, B)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e5 + 5, mod = 1e9 + 7; n int add(int x, int y) { n x += y; n return x >= mod ? x - mod : x; n } n int c[maxn << 1], dp[maxn]; n struct node { n int x, y, op; n } e[maxn]; n bool cmp(node a, node b) { n if (a.x == b.x) return a.y < b.y; n return a.x < b.x; n } n void ins(int x, int k) { n while (x) { n c[x] = add(c[x], k); n x -= x & (-x); n } n } n int query(int x) { n int res = 0; n for (; x <= 400000; x += (x & (-x))) { n res = add(res, c[x]); n } n return res; n } n int main() { n int n, q, x; n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d%d , &e[i].y, &e[i].x); n } n scanf( %d , &q); n while (q--) { n scanf( %d , &x); n e[x].op = 1; n } n sort(e + 1, e + 1 + n, cmp); n ins(2 * n, 1); n for (int i = 1; i <= n; i++) { n dp[i] = query(e[i].y); n ins(e[i].y, dp[i]); n } n int pv = 1, ans = 0; n for (int i = n; i > 0; i--) { n ins(e[i].y, (mod - dp[i]) % mod); n if (e[i].op == 1 && e[i].y >= pv) { n ans = add(ans, query(pv)); n pv = e[i].y; n } n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline bool ig(char c) { return c >= 0 && c <= 9 ; } n inline void read(int &oi) { n char c; n int f = 1, res = 0; n while (c = getchar(), (!ig(c)) && c != - ) n ; n c == - ? f = -1 : res = (c ^ 48); n while (c = getchar(), ig(c)) res = res * 10 + (c ^ 48); n oi = f * res; n } n inline void print(int oi) { n if (oi < 0) putchar( - ), oi = ~oi + 1; n if (oi > 9) print(oi / 10); n putchar(oi % 10 + 48); n } n int n, m, ans; n struct Edge { n int x, y, z; n bool operator<(const Edge &b) const { return z > b.z; } n } e[200005]; n int fa[200005]; n bool s[200005]; n inline int gfa(int u) { return u ^ fa[u] ? fa[u] = gfa(fa[u]) : u; } n int main() { n read(n); n read(m); n for (int i = 1; i <= m; ++i) read(e[i].x), read(e[i].y), read(e[i].z); n sort(e + 1, e + 1 + m); n for (int i = 1; i <= n; ++i) fa[i] = i, s[i] = true; n for (int i = 1; i <= m; ++i) { n int fx = gfa(e[i].x), fy = gfa(e[i].y); n if ((fx ^ fy) && (s[fx] || s[fy])) n ans += e[i].z, fa[fx] = fy, s[fy] = s[fy] & s[fx]; n else if (!(fx ^ fy) && s[fx]) n s[fx] = false, ans += e[i].z; n } n print(ans); n putchar( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[200005]; n unordered_map f, done; n vector v; n int main() { n std::ios_base::sync_with_stdio(0); n cin.tie(0); n long long n; n long long ans = 0; n cin >> n; n for (long long i = 1; i <= n; i++) { n cin >> a[i]; n f[a[i]]++; n } n for (int i = 1; i <= n; i++) { n if (f[i] == 0) { n ans++; n v.push_back(i); n } n } n cout << ans << endl; n long long ptr = 0; n for (long long i = 1; i <= n; i++) { n if (f[a[i]] == 1) { n if (done[a[i]] == 0) { n cout << a[i] << ; n done[a[i]]++; n } else { n cout << v[ptr] << ; n ptr++; n } n } else { n if (v[ptr] > a[i] && done[a[i]] == 0) { n cout << a[i] << ; n f[a[i]]--; n done[a[i]]++; n } else { n f[a[i]]--; n cout << v[ptr] << ; n done[v[ptr]]++; n ptr++; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int N, M, T, tb[100005]; n long long a, b, c, co, x; n map mp; n map::iterator it; n int chk[100005]; n int main() { n int i, j, k; n scanf( %d%I64d , &N, &co); n for (i = 1; i <= N; i++) { n scanf( %d , &tb[i]); n mp[tb[i]]++; n x += tb[i]; n } n if (x < co) { n printf( -1 n ); n scanf( ); n return 0; n } else if (x == co) { n printf( n ); n scanf( ); n return 0; n } n a = N; n b = 0; n for (it = mp.begin(); it != mp.end(); it++) { n k = (*it).first; n j = (*it).second; n if (c + a * (k - b) > co) break; n c += a * (k - b); n b = k; n a -= j; n } n a = k - b; n long long num = co - c; n int idx = 0; n for (i = 1; i <= N; i++) { n if (tb[i] >= k) { n chk[idx] = i; n idx++; n } n } n b = num / idx; n num %= idx; n i = num; n bool err = true; n for (int kk = 1; kk <= idx; kk++) { n if (b != a - 1 || ((b == a - 1 && tb[chk[i]] != k) || err)) n printf( %d , chk[i]); n i++; n if (i >= idx) { n i %= idx; n err = false; n } n } n scanf( ); n } n "} +{"func_code_string": "#include n using namespace std; n int mida; n void update(vector& T, int p, int x) { n T[mida + p] = x; n for (int i = (mida + p) / 2; i > 0; i /= 2) T[i] = T[2 * i] + T[2 * i + 1]; n } n int suma(vector& T, int a, int b, int c = 0, int d = mida - 1, int p = 1) { n if (a <= c and d <= b) return T[p]; n if (d < a or c > b) return 0; n return suma(T, a, b, c, (c + d) / 2, 2 * p) + n suma(T, a, b, (c + d) / 2 + 1, d, 2 * p + 1); n } n int main() { n int k; n string r; n cin >> k >> r; n string s; n for (int i = 0; i < k; ++i) s += r; n int n = s.size(); n mida = 1; n while (mida < n) mida *= 2; n vector > T( z - a + 1, vector(2 * mida, 0)); n for (int i = 0; i < n; ++i) update(T[s[i] - a ], i, 1); n int q; n cin >> q; n while (q--) { n int p; n char c; n cin >> p >> c; n int ini = 0, fin = n - 1; n while (ini <= fin) { n int m = (ini + fin) / 2; n if (suma(T[c - a ], 0, m) >= p) n fin = m - 1; n else n ini = m + 1; n } n s[fin + 1] = 0; n update(T[c - a ], fin + 1, 0); n } n for (int i = 0; i < n; ++i) n if (s[i] > 0) cout << s[i]; n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int r, c, s, e; n vector adj[1000 * 1000 + 10]; n int d[1000 * 1000 + 10]; n char grid[1000][1000]; n char access(int n) { n int x = n % c; n int y = n / c; n return grid[y][x]; n } n void bfs(int n) { n queue frontier; n frontier.push(n); n d[n] = 0; n while (!frontier.empty()) { n int u = frontier.front(); n frontier.pop(); n for (int i = 0; i < adj[u].size(); i++) { n int v = adj[u][i]; n if (d[v] == -1) { n d[v] = d[u] + 1; n frontier.push(v); n } n } n } n } n int main() { n cin >> r >> c; n for (int i = 0; i < r; i++) { n for (int j = 0; j < c; j++) { n cin >> grid[i][j]; n } n } n for (int i = 0; i < r; i++) { n for (int j = 0; j < c; j++) { n int cell = i * c + j; n if (grid[i][j] == T ) continue; n if (grid[i][j] == S ) n s = cell; n else if (grid[i][j] == E ) n e = cell; n if (grid[i - 1][j] != T && i > 0) { n adj[cell].push_back(cell - c); n adj[cell - c].push_back(cell); n } n if (grid[i + 1][j] != T && i < r - 1) { n adj[cell].push_back(cell + c); n adj[cell + c].push_back(cell); n } n if (grid[i][j - 1] != T && j > 0) { n adj[cell].push_back(cell - 1); n adj[cell - 1].push_back(cell); n } n if (grid[i][j + 1] != T && j < c - 1) { n adj[cell].push_back(cell + 1); n adj[cell + 1].push_back(cell); n } n } n } n memset(d, -1, sizeof(d)); n bfs(e); n int shortest_path = d[s]; n int ans = 0; n for (int i = 0; i < r * c; i++) { n char in = access(i); n if (in == T || in == E || in == S ) continue; n if (d[i] <= shortest_path && d[i] != -1) { n ans += in - 0 ; n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int in[100000 + 5]; n bool doit() { n if (scanf( %d%d , &n, &m) != 2) return false; n for (int i = 0; i < n; ++i) in[i] = 0; n int x, y; n for (int i = 0; i < m; ++i) { n scanf( %d%d , &x, &y); n ++in[--x], ++in[--y]; n } n sort(in, in + n); n if (in[0] == 1 && in[n - 2] == 1 && in[n - 1] == n - 1) n printf( star topology n ); n else if (in[2] == 2 && in[n - 1] == 2) { n if (in[0] == 1 && in[1] == 1) n printf( bus topology n ); n else if (in[0] == 2) n printf( ring topology n ); n else n printf( unknown topology n ); n } else n printf( unknown topology n ); n return true; n } n int main() { n while (1) n if (!doit()) break; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = (1 << 19) + 5; n template n inline void read(T &WOW) { n T x = 0, flag = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) flag = -1; n ch = getchar(); n } n while (isdigit(ch)) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n WOW = flag * x; n } n namespace ModCalculator { n const int MOD = 998244353; n inline void Inc(int &x, int y) { n x += y; n if (x >= MOD) x -= MOD; n } n inline void Dec(int &x, int y) { n x -= y; n if (x < 0) x += MOD; n } n inline int Add(int x, int y) { n Inc(x, y); n return x; n } n inline int Sub(int x, int y) { n Dec(x, y); n return x; n } n inline int Mul(int x, int y) { return 1LL * x * y % MOD; } n inline int Ksm(int x, int y) { n int ret = 1; n for (; y; y >>= 1) { n if (y & 1) ret = Mul(ret, x); n x = Mul(x, x); n } n return ret; n } n inline int Inv(int x) { return Ksm(x, MOD - 2); } n } // namespace ModCalculator n using namespace ModCalculator; n int len, rev[MAXN], w1[MAXN], w2[MAXN], fac[MAXN]; n void NTT_init(int n) { n for (len = 1; len < n; len <<= 1) n ; n fac[0] = 1; n for (int i = 1; i <= len; ++i) { n fac[i] = Mul(fac[i - 1], i); n } n int Gi = 3, Gv = Inv(Gi); n for (int i = 1; i < len; i <<= 1) { n int wk1 = Ksm(Gi, (MOD - 1) / (i << 1)), wnk1 = 1; n int wk2 = Ksm(Gv, (MOD - 1) / (i << 1)), wnk2 = 1; n for (int k = 0; k < i; ++k) { n w1[i + k] = wnk1; n wnk1 = Mul(wnk1, wk1); n w2[i + k] = wnk2; n wnk2 = Mul(wnk2, wk2); n } n } n } n void GetRev(int n) { n int bit = -1; n for (len = 1; len < n; len <<= 1) ++bit; n for (int i = 0; i < len; ++i) { n rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << bit); n } n } n void NTT(vector &a, int type) { n a.resize(len); n int *w = (type == 1 ? w1 : w2); n for (int i = 0; i < len; ++i) { n if (i < rev[i]) { n swap(a[i], a[rev[i]]); n } n } n for (int i = 1; i < len; i <<= 1) { n for (int j = 0; j < len; j += (i << 1)) { n for (int k = 0; k < i; ++k) { n int x = a[j + k], y = Mul(a[j + k + i], w[i + k]); n a[j + k] = Add(x, y); n a[j + k + i] = Sub(x, y); n } n } n } n if (type == 1) return; n int lenv = Inv(len); n for (int i = 0; i < len; ++i) { n a[i] = Mul(a[i], lenv); n } n } n vector Poly_Mul(vector F, vector G) { n int deg = F.size() + G.size() - 1; n if (deg <= 100) { n vector H(deg, 0); n int n = F.size(), m = G.size(); n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n Inc(H[i + j], Mul(F[i], G[j])); n } n } n return H; n } n GetRev(deg); n NTT(F, 1); n NTT(G, 1); n for (int i = 0; i < len; ++i) { n F[i] = Mul(F[i], G[i]); n } n NTT(F, -1); n F.resize(deg); n return F; n } n int n, deg[MAXN], node[MAXN], tot; n vector Poly_Prod(int l, int r) { n if (l == r) { n vector F; n F.push_back(1); n F.push_back(node[l]); n return F; n } n int mid = (l + r) >> 1; n return Poly_Mul(Poly_Prod(l, mid), Poly_Prod(mid + 1, r)); n } n void solve() { n read(n); n NTT_init((n + 1) << 1); n for (int i = 1, u, v; i < n; ++i) { n read(u); n read(v); n ++deg[u]; n ++deg[v]; n } n for (int i = 1; i <= n; ++i) { n int x = deg[i] - (i > 1); n if (x) node[++tot] = x; n } n vector F = Poly_Prod(1, tot); n int ans = 0; n for (int i = 0; i < n && i < F.size(); ++i) { n int tmp = Mul(F[i], fac[n - i]); n (i & 1) ? Dec(ans, tmp) : Inc(ans, tmp); n } n printf( %d n , ans); n } n int main() { n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n constexpr long long MOD = (long long)1e9 + 7; n long long fexp(long long a, long long n) { n a %= MOD; n if (n == 0) return 1; n long long ret = fexp(a * a % MOD, n / 2); n if (n % 2 == 1) ret = ret * a % MOD; n return ret; n } n long long blub(long long pa, long long pb) { n return pa * fexp((pa + pb) % MOD, MOD - 2) % MOD; n } n int main() { n long long k, pa, pb; n cin >> k >> pa >> pb; n long long ppa = blub(pa, pb); n long long ppb = blub(pb, pa); n vector> dp(k + 1, vector(k, 0)); n long long res = 0; n dp[1][0] = 1; n for (int i = 1; i < k; ++i) { n for (int j = 0; j < k; ++j) { n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * ppa) % MOD; n if (j + i < k) n dp[i][j + i] = (dp[i][j + i] + dp[i][j] * ppb) % MOD; n else { n res = (res + (j + i) * dp[i][j] % MOD * ppb) % MOD; n } n } n } n for (int i = 0; i < k; ++i) { n res = (res + ppb * dp[k][i] % MOD * n (ppa * fexp((1 - ppa) * (1 - ppa), MOD - 2) % MOD + n (i + k) * fexp(1 - ppa, MOD - 2) % MOD)) % n MOD; n } n cout << (res % MOD + MOD) % MOD << endl; n } n "} +{"func_code_string": "#include n using namespace std; n vector kmp(string &str) { n int n = str.size(); n vector res(n + 1); n res[0] = -1; n int ind = -1; n for (int i = 0; i < n; i++) { n while (ind >= 0 && str[i] != str[ind]) ind = res[ind]; n ind++; n res[i + 1] = ind; n } n return res; n } n int nex(string &str, char ch, int i, vector &kmp1) { n if (str[i] == ch) return i + 1; n int res = i; n while (res >= 0 && str[res] != ch) res = kmp1[res]; n return res + 1; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n string s, s1, s2; n cin >> s >> s1 >> s2; n int n = s.size(), n1 = s1.size(), n2 = s2.size(); n vector kmp1 = kmp(s1), kmp2 = kmp(s2); n vector>> dp( n n + 1, vector>(n1 + 1, vector(n2 + 1, -(1 << 29)))); n dp[0][0][0] = 0; n for (int i = 0; i < n; i++) { n if (s[i] == * ) { n for (char ch = a ; ch <= z ; ch++) { n for (int j = 0; j < n1; j++) { n for (int k = 0; k < n2; k++) { n int nj = nex(s1, ch, j, kmp1), nk = nex(s2, ch, k, kmp2); n dp[i + 1][nj][nk] = max(dp[i + 1][nj][nk], dp[i][j][k]); n } n } n } n } else { n char ch = s[i]; n for (int j = 0; j < n1; j++) { n for (int k = 0; k < n2; k++) { n int nj = nex(s1, ch, j, kmp1), nk = nex(s2, ch, k, kmp2); n dp[i + 1][nj][nk] = max(dp[i + 1][nj][nk], dp[i][j][k]); n } n } n } n int nj = kmp1[n1], nk = kmp2[n2]; n for (int j = 0; j < n1; j++) { n dp[i + 1][j][nk] = max(dp[i + 1][j][nk], dp[i + 1][j][n2] - 1); n } n for (int k = 0; k < n2; k++) { n dp[i + 1][nj][k] = max(dp[i + 1][nj][k], dp[i + 1][n1][k] + 1); n } n dp[i + 1][nj][nk] = max(dp[i + 1][nj][nk], dp[i + 1][n1][n2]); n } n int res = -(1 << 29); n for (int j = 0; j < n1; j++) { n for (int k = 0; k < n2; k++) { n res = max(res, dp[n][j][k]); n } n } n cout << res << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n int a[n]; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n sort(a, a + n, greater()); n for (int i = 0; i < n; i++) cout << a[i] << ; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n, d, t, x, y, z, m; n scanf( %d %d %d , &n, &d, &m); n z = n - d; n while (m--) { n scanf( %d %d , &x, &y); n if (x > n || y > n) { n printf( NO n ); n } else { n if (y >= abs(x - d) && y <= n - (abs(z - x))) { n printf( YES n ); n } else { n printf( NO n ); n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5e3 + 10, mod = 1e9 + 7; n int fact[N], invfact[N]; n inline int add(int x, int y) { n x += y; n if (x >= mod) x -= mod; n return x; n } n inline int sub(int x, int y) { n x -= y; n if (x < 0) x += mod; n return x; n } n inline int mul(int x, int y) { return (((long long)x) * y) % mod; } n inline int powr(int a, long long b) { n int x = 1 % mod; n while (b) { n if (b & 1) x = mul(x, a); n a = mul(a, a); n b >>= 1; n } n return x; n } n inline int inv(int a) { return powr(a, mod - 2); } n void pre() { n fact[0] = invfact[0] = 1; n for (int i = 1; i < N; i++) fact[i] = mul(i, fact[i - 1]); n invfact[N - 1] = inv(fact[N - 1]); n for (int i = N - 2; i >= 1; i--) invfact[i] = mul(invfact[i + 1], i + 1); n assert(invfact[1] == 1); n } n inline int C(int n, int k) { n if (n < k || k < 0) return 0; n return mul(fact[n], mul(invfact[k], invfact[n - k])); n } n int n, k; n int C2[N + 10], A[N], E[N]; n inline int getC2(int i) { n if (i > k) return 0; n return C2[i]; n } n int F[N][N]; n int main() { n pre(); n cin >> n >> k; n F[0][0] = 1; n for (int i = 1; i <= n; i++) { n F[i][0] = 1; n cin >> A[i]; n for (int j = 1; j <= i; j++) { n F[i][j] = add(F[i - 1][j], mul(A[i], F[i - 1][j - 1])); n } n } n C2[0] = 1; n for (int i = 1; i <= n + 10; i++) n C2[i] = mul(C2[i - 1], mul(k - i + 1, inv(i))); n int invn = inv(n); n int _div = 1; n for (int i = 0; i <= n - 1; i++) { n E[i] = mul(getC2(i + 1), _div); n _div = mul(_div, invn); n E[i] = mul(E[i], fact[i]); n } n int ans = 0; n for (int i = 0; i <= n - 1; i++) { n ans = add( n ans, n mul(F[n][i], mul(n - i, mul(powr(mod - 1, n - 1 - i), E[n - 1 - i])))); n } n ans = mul(ans, invn); n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline bool chmax(T &a, T b) { n if (a < b) { n a = b; n return true; n } n return false; n } n template n inline bool chmin(T &a, T b) { n if (a > b) { n a = b; n return true; n } n return false; n } n const long long INF = 1e18; n long long N; n long long a[1050]; n vector ans, trueans; n vector> Prev, Next; n void f(int item) { n int idx1 = 0; n int idx2 = 1; n Next.clear(); n for (auto v : Prev) { n if (v.size() <= 1) continue; n idx1 = v[0]; n idx2 = v[1]; n } n ans[idx1][item] = 1 ; n ans[idx2][item] = 0 ; n long long one = a[item] - 1; n for (int i = 0; i <= N; i++) { n if (i == idx2 or i == idx1) continue; n if (one) { n one--; n ans[i][item] = 1 ; n } else { n ans[i][item] = 0 ; n } n } n for (auto v : Prev) { n vector u[2]; n for (auto tmp : v) { n if (ans[tmp][item] == 0 ) n u[0].push_back(tmp); n else n u[1].push_back(tmp); n } n for (int i = 0; i < 2; i++) { n if (u[i].size()) Next.push_back(u[i]); n } n } n swap(Prev, Next); n } n int main() { n cin >> N; n for (int i = 0; i < N; i++) cin >> a[i]; n ans.resize(N + 1, string(N, 0 )); n Prev.push_back({}); n for (int i = 0; i <= N; i++) { n Prev[0].push_back(i); n } n for (int i = 0; i < N; i++) f(i); n for (auto v : Prev) { n assert(v.size() == 1); n } n for (auto s : ans) { n if (s != string(N, 0 )) trueans.push_back(s); n } n cout << trueans.size() << n ; n for (auto s : trueans) { n cout << s << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int n; n cin >> n; n map mp; n vector v(n); n vector cSum(n, 0); n for (long long int i = 0; i < n; i++) { n cin >> v[i]; n mp[v[i]]++; n } n cSum[0] = v[0]; n for (long long int i = 1; i < n; i++) { n cSum[i] = cSum[i - 1] + v[i]; n } n if (cSum[n - 1] % 2 != 0) { n cout << NO ; n } else { n int flag2 = 0; n set st; n for (long long int i = 0; i < n; i++) { n mp[v[i]]--; n long long int sum1 = cSum[i]; n long long int sum2 = cSum[n - 1] - cSum[i]; n long long int t = sum1 + sum2; n long long int each = t / 2; n if (each == sum1 && each == sum2) { n flag2 = 1; n break; n } n if (sum1 < sum2) { n long long int diff = each - sum1; n if (mp[diff] > 0) { n flag2 = 1; n break; n } n } n if (sum1 > sum2) { n long long int diff = each - sum2; n if (st.find(diff) != st.end()) { n flag2 = 1; n break; n } n } n st.insert(v[i]); n } n if (flag2 == 0) { n cout << NO ; n } else { n cout << YES ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n; n pair s[1000005]; n long long m; n bool cmp(pair a, pair b) { n string s = a.first, t = b.first; n for (long long i = 0; i < (m); i++) n if (s[i] != t[i]) { n if (i & 1) n return s[i] > t[i]; n else n return s[i] < t[i]; n } n return a.second < b.second; n } n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> m; n for (long long i = 0; i < (n); i++) cin >> s[i].first, s[i].second = i + 1; n sort(s, s + n, cmp); n for (long long i = 0; i < (n); i++) cout << s[i].second << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma GCC optimize( Ofast ) n const long long int maxn = 5e5 + 16, md = 1e9 + 7, inf = 2e18; n long long int tav(long long int n, long long int k) { n long long int res = 1; n while (k > 0) { n if (k & 1) { n res *= n; n res %= md; n } n n *= n; n n %= md; n k >>= 1; n } n return res; n } n struct segtree { n long long int sz = 1; n vector val, laz; n void init(long long int n) { n while (sz < n) sz <<= 1; n val.assign((sz << 1), 0); n laz.assign((sz << 1), 0); n return; n } n void shift(long long int x, long long int lx, long long int rx) { n long long int h = laz[x]; n laz[x] = 0; n if (h == 0) return; n val[x] += h; n if (rx - lx == 1) return; n long long int ln = (x << 1) + 1, rn = ln + 1; n laz[ln] += h; n laz[rn] += h; n return; n } n void add(long long int l, long long int r, long long int k, long long int x, n long long int lx, long long int rx) { n shift(x, lx, rx); n if (rx <= l || lx >= r) return; n if (rx <= r && lx >= l) { n laz[x] = k; n shift(x, lx, rx); n return; n } n long long int m = (rx + lx) >> 1, ln = (x << 1) + 1, rn = ln + 1; n add(l, r, k, ln, lx, m); n add(l, r, k, rn, m, rx); n val[x] = min(val[ln], val[rn]); n return; n } n void add(long long int l, long long int r, long long int k) { n add(l, r, k, 0, 0, sz); n return; n } n long long int cal(long long int l, long long int r, long long int x, n long long int lx, long long int rx) { n shift(x, lx, rx); n if (rx <= l || lx >= r) return inf; n if (rx <= r && lx >= l) return val[x]; n long long int m = (rx + lx) >> 1, ln = (x << 1) + 1, rn = ln + 1; n long long int a = cal(l, r, ln, lx, m), b = cal(l, r, rn, m, rx); n return min(a, b); n } n long long int cal(long long int l, long long int r) { n return cal(l, r, 0, 0, sz); n } n }; n long long int n, q; n segtree st; n vector > adj[maxn]; n vector, long long int> > v[maxn]; n long long int ft[maxn], tme = 0, ans[maxn], dis[maxn], dep = 0; n void dDFS(long long int r) { n dis[r] = dep; n tme++; n for (auto p : adj[r]) { n long long int i = p.first, w = p.second; n dep += w; n dDFS(i); n dep -= w; n } n if (adj[r].empty()) { n st.add(r, r + 1, dep); n } else { n st.add(r, r + 1, inf); n } n ft[r] = tme; n return; n } n void sDFS(long long int r) { n for (auto y : v[r]) { n long long int l = y.first.first, r = y.first.second, i = y.second; n ans[i] = st.cal(l, r); n } n for (auto p : adj[r]) { n long long int i = p.first, w = p.second; n st.add(0, n, w); n st.add(i, ft[i], -2ll * w); n sDFS(i); n st.add(0, n, -w); n st.add(i, ft[i], 2ll * w); n } n return; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> q; n for (long long int u = 1; u < n; u++) { n long long int v, w; n cin >> v >> w; n v--; n adj[v].push_back({u, w}); n } n st.init(n); n for (long long int i = 0; i < q; i++) { n long long int u, l, r; n cin >> u >> l >> r; n u--; n l--; n v[u].push_back({{l, r}, i}); n } n dDFS(0); n sDFS(0); n for (long long int i = 0; i < q; i++) { n cout << ans[i] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n bool umin(T& a, T b) { n if (a > b) { n a = b; n return 1; n } n return 0; n } n template n bool umax(T& a, T b) { n if (a < b) { n a = b; n return 1; n } n return 0; n } n char s[1000009], t[1000009]; n int cnt[2]; n int pw[1000009], par[1000009]; n int wp[1000009], rap[1000009]; n int mod(long long x) { n x %= 1000000007; n if (x < 0) x += 1000000007; n return x; n } n pair get(int l, int r) { n return make_pair(mod(par[r] - (par[l - 1] * 1LL * pw[r - l + 1])), n mod(rap[r] - (rap[l - 1] * 1LL * wp[r - l + 1]))); n } n int main() { n scanf( %s , s); n int n = strlen(s); n scanf( %s , t + 1); n int m = strlen(t + 1); n pw[0] = wp[0] = 1; n for (int i = 1; i < 1000009; i++) { n pw[i] = mod(pw[i - 1] * 27LL); n wp[i] = mod(wp[i - 1] * 31LL); n } n for (int i = 1; i <= m; i++) { n par[i] = mod(par[i - 1] * 27LL + (t[i] - a + 1)); n rap[i] = mod(rap[i - 1] * 31LL + (t[i] - a + 1)); n } n for (int i = 0; i < n; i++) cnt[s[i] - 0 ]++; n int ans = 0; n for (int i = 1; i * cnt[0] < m and i < m; i++) n if ((m - i * cnt[0]) % cnt[1] == 0) { n int d = (m - i * cnt[0]) / cnt[1]; n pair a, b; n a.first = b.first = -1; n int cur = 1, f = 1; n for (int j = 0; j < n; j++) { n if (s[j] == 0 ) { n if (a.first == -1) n a = get(cur, cur + i - 1); n else n f &= (a == get(cur, cur + i - 1)); n cur += i; n } else { n if (b.first == -1) n b = get(cur, cur + d - 1); n else n f &= (b == get(cur, cur + d - 1)); n cur += d; n } n } n if (f and d == i and a == b) f = 0; n ans += f; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n long long t, a, b, h, f[110]; n using namespace std; n long long mi(long long n, long long m) { n long long res = 1; n for (int i = 1; i <= m; i++) res *= n; n return res; n } n void solve(long long a, long long b) { n for (int i = h; i; i--) { n long long t = mi(a, i); n f[i] = b / t; n b %= t; n } n f[0] = b; n } n int main() { n scanf( %lld%lld%lld , &t, &a, &b); n if (a == b && b == t) { n if (a == 1) n puts( inf ); n else n puts( 2 ); n } else if (a == b) n puts( 1 ); n else { n if (t == 1) { n h = log(b) / log(a); n for (int i = 1; i <= h; i++) n if (mi(a, i) == b) { n puts( 1 ); n return 0; n } n } n h = log(b) / log(a); n solve(a, b); n long long sum = 0; n for (int i = 0; i <= h; i++) sum += f[i] * mi(t, i); n if (sum != a) n puts( 0 ); n else n puts( 1 ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long n; n cin >> n; n vector> arr(n); n for (long long i = 0; i < n; i++) { n long long a; n cin >> a; n if (a >= 0) a = (-1) * a - 1; n arr[i] = {a, i}; n } n sort(arr.begin(), arr.end()); n if (n % 2 == 1) { n long long f = 0; n for (long long i = 0; i < n; i++) { n if (arr[i].first != -1) { n arr[i].first = (-1) * arr[i].first - 1; n f++; n break; n } n } n if (f == 0) { n arr[0].first = 0; n } n } n vector ans(n); n for (long long i = 0; i < n; i++) { n ans[arr[i].second] = arr[i].first; n } n for (auto i : ans) cout << i << ; n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n int a[n]; n for (int i = 0; i < n; i++) { n int x; n cin >> x; n a[i] = x; n } n sort(a, a + n); n int count = 0; n for (int i = (n - 1); i >= 0; i--) { n if (m > 0) { n m = m - a[i]; n count++; n } n } n cout << count << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b; n cin >> a >> b; n if (a > b) { n if (a == 9 && b == 1) n cout << 9 << << 10; n else n cout << -1; n return 0; n } n if ((b - a) > 1) { n cout << -1; n return 0; n } n if (b == a) { n cout << a << 98 << << b << 99; n return 0; n } n cout << a << << b; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize(3) n #pragma GCC optimize( inline ) n using namespace std; n const int N = 100050, INF = 0x3f3f3f3f; n int n, col, sum, n1, n2; n struct node { n int color, val, id; n friend bool operator<(node x, node y) { return x.val < y.val; } n } white[N], black[N]; n int min(int x, int y) { return (x > y) ? y : x; } n signed main() { n scanf( %d , &n); n for (register int i = 1; i <= n; i++) { n scanf( %d%d , &col, &sum); n if (col) n white[++n1] = node{col, sum, i}; n else n black[++n2] = node{col, sum, i}; n } n sort(white + 1, white + 1 + n1); n sort(black + 1, black + 1 + n2); n for (register int i = 1, j = 1; i <= n1 && j <= n2;) { n int now = min(white[i].val, black[j].val); n cout << white[i].id << << black[j].id << << now << endl; n white[i].val -= now; n black[j].val -= now; n if (white[i].val) n j++; n else if (black[j].val) n i++; n else if (i < n1) n i++; n else n j++; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 5e3 + 5; n long long read() { n long long s = 0; n char c = getchar(), lc = + ; n while (c < 0 || 9 < c) lc = c, c = getchar(); n while ( 0 <= c && c <= 9 ) s = s * 10 + c - 0 , c = getchar(); n return lc == - ? -s : s; n } n void write(long long x) { n if (x < 0) { n putchar( - ); n x = -x; n } n if (x < 10) n putchar(x + 0 ); n else { n write(x / 10); n putchar(x % 10 + 0 ); n } n } n void print(long long x, char c = n ) { n write(x); n putchar(c); n } n long long dp[N][N], a[N], q[N]; n signed main(signed Recall, char *_902_[]) { n (void)Recall, (void)_902_; n long long n = read(), k = read(), m = read(), ans = -1; n for (long long i = 1; i <= n; i++) a[i] = read(); n for (long long i = 1; i <= n; i++) dp[i][0] = dp[0][i] = -1; n for (long long j = 1; j <= m; j++) n for (long long i = 1, h = 0, t = q[0] = 0; i <= n; i++) { n while (h <= t && i - q[h] > k) h++; n if (h <= t && dp[q[h]][j - 1] >= 0) n dp[i][j] = dp[q[h]][j - 1] + a[i]; n else n dp[i][j] = -1; n while (h <= t && dp[q[t]][j - 1] <= dp[i][j - 1]) t--; n q[++t] = i; n } n for (long long i = max(n - k + 1, 1LL); i <= n; i++) ans = max(ans, dp[i][m]); n print(ans); n return 0; n } n "} +{"func_code_string": "/****************************************** By Lord Sanskar Bhargava******************************/ n n n #include n using namespace std; n n typedef long long ll; n typedef long double ld; n typedef complex cd; n n typedef pair pi; n typedef pair pl; n typedef pair pd; n n typedef vector vi; n typedef vector vd; n typedef vector vl; n typedef vector vpi; n typedef vector vpl; n typedef vector vcd; n n int main() n { n ios::sync_with_stdio(0);cin.tie(0); n int tt; n cin>>tt; n while(tt--) n { n ll n;cin>>n; n ll k=n%2020; n if(n<2020) n { n cout<< NO < n using namespace std; n int dp[1003][1003][12][3]; n string s, t; n int solve(int i, int j, int k, int cont) { n if (i < 0 || j < 0) return 0; n if (dp[i][j][k][cont] != -1) return dp[i][j][k][cont]; n int ret = -9; n if (s[i] == t[j]) { n if (cont) { n ret = max(ret, 1 + solve(i - 1, j - 1, k, 1)); n } n if (k > 0) ret = max(ret, 1 + solve(i - 1, j - 1, k - 1, 1)); n } n ret = max(ret, solve(i - 1, j, k, 0)); n ret = max(ret, solve(i, j - 1, k, 0)); n dp[i][j][k][cont] = ret; n return ret; n } n int main() { n int n, m, k; n cin >> n >> m >> k; n cin >> s >> t; n for (int i = 0; i < 1003; ++i) { n for (int j = 0; j < 1003; ++j) { n for (int k = 0; k < 12; ++k) { n for (int l = 0; l < 3; ++l) { n dp[i][j][k][l] = -1; n } n } n } n } n int ans = solve(n - 1, m - 1, k, 0); n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n const int N = 510; n int m; n long long n, ans; n int cnt, head[N]; n struct edge { n int to, next; n } e[1010]; n void ade(int u, int v) { n e[++cnt] = (edge){v, head[u]}; n head[u] = cnt; n } n long long getsize(long long num) { n if (num > n) return 0; n long long tl = num, tr = num; n int m1 = 0, m2 = 0; n while (tl * 2 <= n) tl = tl * 2, m1++; n while (tr * 2 + 1 <= n) tr = tr * 2 + 1, m2++; n if (tl <= tr) n return (1 << (m2 + 1)) - 1; n else n return (1 << (m2 + 1)) - 1 + n - tl + 1; n } n map vis; n int tot; n long long val[N]; n void build(int x) { n val[vis[x]] = 1; n int to = x << 1; n if (to <= n && vis[to]) { n build(to); n ade(vis[x], vis[to]); n ade(vis[to], vis[x]); n } else n val[vis[x]] += getsize(to); n to = x << 1 | 1; n if (to <= n && vis[to]) { n build(to); n ade(vis[x], vis[to]); n ade(vis[to], vis[x]); n } else n val[vis[x]] += getsize(to); n } n int bk[N]; n void dfs(int now, long long w) { n bk[now] = 1; n for (int i = head[now]; i; i = e[i].next) { n int to = e[i].to; n if (bk[to]) continue; n dfs(to, w); n ans = (ans + w * val[to] % mod) % mod; n } n bk[now] = 0; n } n int main() { n cin >> n >> m; n if (!m) { n ans = n * n % mod; n ans = (ans % mod + mod) % mod; n printf( %lld n , ans); n } else { n for (int i = 1; i <= m; i++) { n int a, b; n cin >> a >> b; n if (!vis[a]) vis[a] = ++tot; n if (!vis[b]) vis[b] = ++tot; n ade(vis[a], vis[b]); n ade(vis[b], vis[a]); n while (a) { n a >>= 1; n if (!vis[a]) vis[a] = ++tot; n } n while (b) { n b >>= 1; n if (!vis[b]) vis[b] = ++tot; n } n } n build(1); n for (int i = 1; i <= tot; i++) dfs(i, val[i]); n for (int i = 1; i <= tot; i++) ans = (ans + val[i] * val[i] % mod) % mod; n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 105, MAX_R = 60005; n int n, r, a, b; n vector > inc, d; n int dp[MAX_R][MAX_N]; n int main() { n ios::sync_with_stdio(false); n cin >> n >> r; n for (int i = 0; i < n; i++) { n cin >> a >> b; n if (b >= 0) { n inc.push_back({a, b}); n } else { n d.push_back({max(a, -b) + b, b}); n } n } n sort(inc.begin(), inc.end()); n sort(d.begin(), d.end()); n int proj = 0; n for (auto p : inc) { n if (r >= p.first) { n proj++; n r += p.second; n } n } n int len = d.size(); n for (int i = 0; i <= len; i++) { n if (i == 0) { n for (int j = 0; j <= r; j++) { n dp[j][i] = proj; n } n continue; n } n int a = d[i - 1].first - d[i - 1].second; n int b = d[i - 1].second; n for (int j = 0; j <= r; j++) { n if (j >= a) { n dp[j][i] = max(dp[j][i - 1], 1 + dp[j + b][i - 1]); n } else { n dp[j][i] = dp[j][i - 1]; n } n } n } n cout << dp[r][len] << endl; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, b, x, q, t, ans, l, r, m, p, now, sum; n bool ok; n string s; n map a, pos; n map c; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> q; n while (q--) { n cin >> n >> m; n cin >> s; n for (int i = 1; i <= m; ++i) { n cin >> x; n a[x + 1]++; n } n sum = m + 1; n for (int i = 0; i < s.size(); ++i) { n sum -= a[i + 1]; n c[s[i]] += sum; n } n for (char j = a ; j <= z ; ++j) { n cout << c[j] << ; n } n cout << n ; n a.clear(); n c.clear(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int a[n], b[n]; n for (int i = 0; i < n; i++) cin >> a[i]; n b[n - 1] = a[n - 1]; n for (int j = 0; j < n - 1; j++) b[j] = a[j] + a[j + 1]; n for (int k = 0; k < n; k++) cout << b[k] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline T read(T& x) { n x = 0; n int f = 0; n char ch = getchar(); n while (ch < 0 || ch > 9 ) f |= (ch == - ), ch = getchar(); n while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); n return x = f ? -x : x; n } n const int N = 500 + 10; n const long long INF = 2e18; n int i, j, x, n, match[N], pre[N]; n long long a[N], b[N], k[N], cost[N][N], lx[N], ly[N], slack[N]; n bool vy[N]; n void augment(int root) { n fill(vy + 1, vy + n + 1, false); n fill(slack + 1, slack + n + 1, INF); n int py; n match[py = 0] = root; n do { n vy[py] = true; n int x = match[py], yy; n long long delta = INF; n for (int y = 1; y <= n; y++) { n if (!vy[y]) { n if (lx[x] + ly[y] - cost[x][y] < slack[y]) { n slack[y] = lx[x] + ly[y] - cost[x][y]; n pre[y] = py; n } n if (slack[y] < delta) { n delta = slack[y]; n yy = y; n } n } n } n for (int y = 0; y <= n; y++) { n if (vy[y]) { n lx[match[y]] -= delta; n ly[y] += delta; n } else { n slack[y] -= delta; n } n } n py = yy; n } while (~match[py]); n do { n int cnt = pre[py]; n match[py] = match[cnt]; n py = cnt; n } while (py); n } n long long KM() { n for (int i = 1; i <= n; i++) { n lx[i] = ly[i] = 0; n match[i] = -1; n for (int j = 1; j <= n; j++) lx[i] = max(lx[i], cost[i][j]); n } n long long ans = 0; n for (int i = 1; i <= n; i++) augment(i); n for (int i = 1; i <= n; i++) { n ans += lx[i]; n ans += ly[i]; n } n return ans; n } n int main() { n read(n); n for (i = 1; i <= n; i++) { n read(a[i]), read(b[i]), read(k[i]); n for (j = 1; j <= n; j++) { n cost[i][j] = max(a[i] - b[i] * min(k[i], j - 1LL), 0LL); n } n } n printf( %lld n , KM()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = (int)1e9 + 10; n const int N = (int)1e6 + 10; n const long double eps = 1e-7; n mt19937 rnd(228); n int main() { n int n, q; n cin >> n >> q; n deque d; n int mn = INF; n int mx = -INF; n for (int i = 0; i < n; ++i) { n int x; n cin >> x; n d.push_back(x); n mn = min(mn, x); n mx = max(mx, x); n } n vector> ans(N); n for (int iter = 1; iter < N; ++iter) { n int a = d.front(); n d.pop_front(); n int b = d.front(); n ans[iter] = make_pair(a, b); n d.pop_front(); n d.push_front(max(a, b)); n d.push_back(min(a, b)); n } n int st = -1; n for (int i = N / 2 - 1; i >= 1; --i) { n if (ans[i] == pair({mx, mn})) { n st = i; n break; n } n } n for (int i = 1; i <= q; ++i) { n long long m; n cin >> m; n if (m < N) { n cout << ans[m].first << << ans[m].second << n ; n continue; n } n m -= st; n m %= (n - 1); n cout << ans[st + m].first << << ans[st + m].second << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 200005; n int n, k; n pair a[N]; n vector > Center; n bool inf; n bool Check(pair center) { n int cnt = 0, l = 1, r = n; n pair t; n while (l <= r && cnt <= k) { n t = make_pair(center.first - a[l].first, center.second - a[l].second); n if (t == a[r]) { n l++; n r--; n } else { n cnt++; n if (t < a[r]) n r--; n else n l++; n } n } n return (cnt <= k); n } n void Solve() { n if (k >= n) { n inf = true; n return; n } n sort(a + 1, a + n + 1); n pair center; n int res = 0; n for (int i = 1; i <= k + 1; i++) n for (int j = n - k; j <= n; j++) n if (i <= j) { n center = make_pair(a[i].first + a[j].first, a[i].second + a[j].second); n if (Check(center)) Center.push_back(center); n } n } n int main() { n cin >> n >> k; n for (int i = 1; i <= n; i++) scanf( %d %d , &a[i].first, &a[i].second); n Solve(); n if (inf) { n cout << -1 << endl; n return 0; n } n int res = 0; n sort(Center.begin(), Center.end()); n for (int i = 0; i < Center.size(); i++) n if (i == 0 || Center[i] != Center[i - 1]) res++; n cout << res << endl; n int cnt = 0; n for (int i = 0; i < Center.size(); i++) n if (i == 0 || Center[i] != Center[i - 1]) { n printf( %.3lf %.3lf n , (Center[i].first + 0.0) / 2.0, n (Center[i].second + 0.0) / 2.0); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma GCC optimize( Ofast,no-stack-protector ) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n #pragma GCC optimize( unroll-loops ) n int on_bit(int N, int pos) { return N = N | (1 << pos); } n int off_bit(int N, int pos) { return N = N & ~(1 << pos); } n bool check_bit(long long int N, int pos) { return (bool)(N & (1 << pos)); } n template n inline bool read(T &x) { n int c = getchar(); n int sgn = 1; n while (~c && c < 0 || c > 9 ) { n if (c == - ) sgn = -1; n c = getchar(); n } n for (x = 0; ~c && 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; n x *= sgn; n return ~c; n } n int main() { n unsigned long long ar[500005]; n memset((ar), 0, sizeof((ar))); n for (unsigned long long i = 3, j = 1; i <= 500001; i += 2, j++) { n ar[i] = ((i * 4) - 4) * j; n } n for (int i = 5; i <= 500001; i += 2) { n ar[i] += ar[i - 2]; n } n int ___T; n cin >> ___T; n for (int cs = 1; cs <= ___T; cs++) { n int n; n cin >> n; n cout << ar[n] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long nt[105]; n string s; n vector V; n void ts() { n nt[0] = 0; n nt[1] = 0; n for (long long i = 2; i <= 100; i++) { n nt[i] = 1; n } n for (long long i = 2; i <= 100; i++) { n if (nt[i] == 1) { n for (long long j = i * i; j <= 100; j += i) { n nt[j] = 0; n } n V.push_back(i); n } n } n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n V.push_back(4); n V.push_back(9); n V.push_back(25); n V.push_back(49); n ts(); n long long i = 0; n long long dem = 0; n while (i < 20) { n cout << V[i] << endl; n cin >> s; n if (s == yes ) dem++; n if (dem == 2) { n cout << composite ; n return 0; n } n i++; n } n cout << prime ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void maxE(T& a, const T& b) { n a = max(a, b); n } n template n void minE(T& a, const T& b) { n a = min(a, b); n } n template n ostream& operator<<(ostream& out, const vector& t_) { n out << [ ; n for (auto i : t_) out << i << , ; n out << ] ; n return out; n } n template n ostream& operator<<(ostream& out, const pair& rhs) { n out << ( << rhs.first << , << rhs.second << ) ; n return out; n } n const long long INF = 1000LL * 1000 * 1000 * 1000 * 1000 * 1000LL; n struct Val { n long long maxPref, maxSuf, sum, maxInf; n }; n Val neutral() { n Val r; n r.maxPref = r.maxSuf = r.maxInf = 0; n r.sum = 0; n return r; n } n Val single(long long a) { n Val r; n r.maxPref = r.maxSuf = r.maxInf = max(0LL, a); n r.sum = a; n return r; n } n Val join(const Val& a, const Val& b) { n Val r; n r.maxPref = max(a.maxPref, a.sum + b.maxPref); n r.maxSuf = max(a.maxSuf + b.sum, b.maxSuf); n r.sum = a.sum + b.sum; n r.maxInf = max(max(a.maxInf, b.maxInf), a.maxSuf + b.maxPref); n return r; n } n struct Tree { n int s; n vector t; n void init(int s_) { n s = 1; n while (s <= s_) s *= 2; n t.assign(2 * s, neutral()); n } n Val tget(int a, int b) { n if (a > b) n return neutral(); n else if (a == b) n return t[a]; n Val r = neutral(); n int na = a; n int nb = b; n if (a % 2) na++; n if (nb % 2 == 0) nb--; n if (a % 2) r = join(r, t[a]); n r = join(r, tget(na / 2, nb / 2)); n if (b % 2 == 0) r = join(r, t[b]); n return r; n } n long long get(int a, int b) { return tget(s + a, s + b).maxInf; } n }; n int n; n vector t; n Tree tree; n int main() { n int m; n assert(scanf( %d%d , &n, &m) == 2); n vector d, h; n for (int i = 0; i < int(n); ++i) { n int a; n assert(scanf( %d , &a) == 1); n d.push_back(a); n } n for (int i = 0; i < int(n); ++i) { n int a; n assert(scanf( %d , &a) == 1); n h.push_back(a); n } n for (int j = 0; j < int(2); ++j) n for (int i = 0; i < int(n); ++i) { n t.push_back(h[i] * 2LL); n t.push_back(-4LL * h[i]); n t.push_back(h[i] * 2LL); n t.push_back(d[i]); n } n tree.init(((int)((t).size()))); n for (int i = 0; i < int(((int)((t).size()))); ++i) n tree.t[tree.s + i] = single(t[i]); n for (int i = tree.s - 1; i >= 1; i--) n tree.t[i] = join(tree.t[i * 2], tree.t[i * 2 + 1]); n if (0) cout << tree ready << endl; n if (0) n cout << SIZE(t) n << << ((int)((t).size())) << << endl; n for (int i = 0; i < int(m); ++i) { n int a, b; n assert(scanf( %d%d , &a, &b) == 2); n a--; n b--; n int x, y; n if (a <= b) { n x = b + 1; n y = a + n - 1; n } else { n x = b + 1; n y = a - 1; n } n assert(x < y); n if (0) n cout << a n << << a << n << b n << << b << n << x n << << x << n << y n << << y << << endl; n x = 4 * x; n y = 4 * y; n int s = ((int)((t).size())); n assert(x >= 0 && x < s && y >= 0 && y < s); n cout << tree.get(x, y) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string get(int n, int m) { n string str; n for (int i = 1; i <= n; i++) str.push_back( 4 ); n for (int i = 1; i <= m; i++) str.push_back( 7 ); n return str; n } n int32_t main() { n ios_base ::sync_with_stdio(0); n cin.tie(0); n string str; n cin >> str; n int n = str.size(); n if (n & 1) { n cout << get((n + 1) / 2, (n + 1) / 2) << endl; n return 0; n } n int cnta = 0, cntb = 0, ans = -1, aa = 0, bb = 0; n for (int i = 0; i < n; i++) { n if (cnta + 1 <= n / 2 && str[i] < 7 ) { n ans = i; n aa = cnta; n bb = cntb; n } n if (cntb + 1 <= n / 2 && str[i] < 4 ) { n ans = i; n aa = cnta; n bb = cntb; n } n cnta += str[i] == 7 ; n cntb += str[i] == 4 ; n if ((str[i] != 4 && str[i] != 7 ) || cnta > n / 2 || cntb > n / 2) break; n } n if (cnta + cntb == n && cnta == cntb) { n cout << str << endl; n return 0; n } n if (ans == -1) { n cout << get((n + 2) / 2, (n + 2) / 2) << endl; n return 0; n } n string x; n for (int i = 0; i < ans; i++) { n x.push_back(str[i]); n } n if (bb + 1 <= n / 2 && str[ans] < 4 ) { n ++bb; n x.push_back( 4 ); n } else { n ++aa; n x.push_back( 7 ); n } n x += get(n / 2 - bb, n / 2 - aa); n cout << x << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n vector a; n vector> ids; n vector b; n string answer; n int segtree_size; n template n struct segtree { n int segtree_size; n vector segtree; n T identity; n T (*UpdateFn)(T, T); n void InitSegtree(int main_size, T (*UpdateFunction)(T, T), T fun_identity) { n segtree_size = 1; n while (segtree_size < main_size) segtree_size *= 2; n segtree_size *= 2; n segtree.resize(segtree_size); n UpdateFn = UpdateFunction; n this->identity = fun_identity; n } n void UpdateAllParents() { n for (int i = segtree_size / 2 - 1; i > 0; i--) n segtree[i] = UpdateFn(segtree[i * 2], segtree[i * 2 + 1]); n } n void ChangeValue(int index, T value) { n segtree[index + segtree_size / 2] = value; n } n T GetValue(int index) { return segtree[index + segtree_size / 2]; } n void Update(int pos, T value) { n for (segtree[pos += segtree_size / 2] = value; pos > 1; pos /= 2) n segtree[pos / 2] = UpdateFn(segtree[pos], segtree[pos ^ 1]); n } n T Query(int start, int finish) { n T ans = this->identity; n for (start += segtree_size / 2, finish += segtree_size / 2; start < finish; n start /= 2, finish /= 2) { n if (start % 2 == 1) ans = UpdateFn(ans, segtree[start++]); n if (finish % 2 == 0) ans = UpdateFn(ans, segtree[finish--]); n } n return UpdateFn(ans, segtree[start]); n } n void Destroy() { segtree.clear(); } n }; n struct segtree tree; n void In() { n cin >> n; n a.resize(n); n ids.resize(n + 1); n b.resize(n); n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) cin >> b[i]; n } n void Solve() { n tree.InitSegtree( n n + 1, [](int a, int b) -> int { return max(a, b); }, INT_MIN); n for (int i = 0; i < n; i++) tree.ChangeValue(i, a[i]); n tree.UpdateAllParents(); n answer = NO ; n for (int i = 0; i < n; i++) ids[a[i]].push(i); n for (int i = n - 1; i >= 0; i--) { n if (ids[b[i]].empty()) return; n int a_idx = ids[b[i]].top(); n ids[b[i]].pop(); n if (tree.Query(a_idx + 1, n) > b[i]) return; n tree.Update(a_idx, 0); n } n answer = YES ; n } n void Out() { n cout << answer << endl; n tree.Destroy(); n a.clear(); n ids.clear(); n b.clear(); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t; n cin >> t; n while (t--) { n In(); n Solve(); n Out(); n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n, k, i; n scanf( %d%d , &n, &k); n while (n > k) { n for (i = 1; i <= k; i++) { n if (n % 10 > 0) n n--; n else n n = n / 10; n } n printf( %d , n); n n = 0; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, l[200000 + 5], r[200000 + 5]; n int p[200000 + 5], q[200000 + 5], sum; n long long add(long long a, long long b) { return (a + b) % 1000000007; } n long long mul(long long a, long long b) { return 1LL * a * b % 1000000007; } n long long dec(long long a, long long b) { n return (a - b + 1000000007) % 1000000007; n } n int fst_pow(int a, int b) { n int res = 1; n while (b) { n if (b & 1) res = mul(res, a); n a = mul(a, a); n b >>= 1; n } n return res; n } n int val(int i) { n int ans = 1; n ans = dec(ans, p[i]), ans = dec(ans, p[i + 1]); n int L = max(l[i - 1], max(l[i], l[i + 1])), n R = min(r[i - 1], min(r[i], r[i + 1])); n if (L < R) n ans = add(ans, mul(R - L, fst_pow(mul(mul(r[i] - l[i], r[i - 1] - l[i - 1]), n r[i + 1] - l[i + 1]), n 1000000007 - 2))); n return ans; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &l[i]); n for (int i = 1; i <= n; i++) { n scanf( %d , &r[i]); n r[i]++; n } n int sum = 0; n for (int i = 1; i <= n; i++) { n int L = max(l[i], l[i - 1]), R = min(r[i], r[i - 1]); n if (L < R) n p[i] = mul(R - L, fst_pow(mul(r[i] - l[i], r[i - 1] - l[i - 1]), n 1000000007 - 2)); n q[i] = dec(1, p[i]); n sum = add(sum, q[i]); n } n int ans = 0; n for (int i = 1; i <= n; i++) { n ans = add(ans, q[i]); n int ps = dec(sum, q[i]); n if (i > 2) ans = add(ans, val(i - 1)), ps = dec(ps, q[i - 1]); n if (i < n) ans = add(ans, val(i)), ps = dec(ps, q[i + 1]); n ans = add(ans, mul(q[i], ps)); n } n printf( %d , ans); n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:100000000 ) n using namespace std; n int matrix[22][22]; n int mas[22]; n int matrix1[22][22]; n int matrix2[22][22]; n int best = 0; n int minv[22]; n bool used[22]; n int u[22]; n int v[22]; n int p[22]; n int way[22]; n int getresult(int n) { n int res = 0; n for (int i = 0; i <= n; i++) u[i] = 0; n for (int i = 0; i <= n; i++) v[i] = 0; n for (int i = 0; i <= n; i++) p[i] = 0; n for (int i = 0; i <= n; i++) way[i] = 0; n int m = n; n const int INF = 1e9; n for (int i = 1; i <= n; ++i) { n p[0] = i; n int j0 = 0; n for (int x = 0; x <= m; x++) minv[x] = INF; n for (int x = 0; x <= m; x++) used[x] = false; n do { n used[j0] = true; n int i0 = p[j0], delta = INF, j1; n for (int j = 1; j <= m; ++j) n if (!used[j]) { n int cur = matrix[i0][j] - u[i0] - v[j]; n if (cur < minv[j]) minv[j] = cur, way[j] = j0; n if (minv[j] < delta) delta = minv[j], j1 = j; n } n for (int j = 0; j <= m; ++j) n if (used[j]) n u[p[j]] += delta, v[j] -= delta; n else n minv[j] -= delta; n j0 = j1; n } while (p[j0] != 0); n do { n int j1 = way[j0]; n p[j0] = p[j1]; n j0 = j1; n } while (j0); n } n return -v[0]; n } n int line1max[22]; n int line2max[22]; n int colmax[22]; n int rr[22]; n bool stop = false; n int itt = 0; n int go(int pos, int N, int N2, int cnt1 = 0, int cnt2 = 0) { n if (stop) return 0; n if (pos == N) { n int res = 0; n int maxres = 0; n int maxres2 = 0; n for (int i = 0; i < N; i++) colmax[i] = 0; n for (int i = 0; i < N; i++) { n if (mas[i] == 1) { n for (int j = 0; j < N; j++) n matrix[i + 1][j + 1] = -matrix1[i][j], n colmax[j] = max(colmax[j], matrix1[i][j]); n maxres += line1max[i]; n } else { n for (int j = 0; j < N; j++) n matrix[i + 1][j + 1] = -matrix2[i][j], n colmax[j] = max(colmax[j], matrix2[i][j]); n maxres += line2max[i]; n } n } n for (int i = 0; i < N; i++) maxres2 += colmax[i]; n if (maxres > best && maxres2 > best) { n res = -getresult(N); n best = max(best, res); n } n return res; n } n int res = 0; n if (rr[pos]) { n if (cnt1 < N2) { n mas[pos] = 1; n res = max(res, go(pos + 1, N, N2, cnt1 + 1, cnt2)); n } n if (cnt2 < N2) { n mas[pos] = 2; n res = max(res, go(pos + 1, N, N2, cnt1, cnt2 + 1)); n } n } else { n if (cnt2 < N2) { n mas[pos] = 2; n res = max(res, go(pos + 1, N, N2, cnt1, cnt2 + 1)); n } n if (cnt1 < N2) { n mas[pos] = 1; n res = max(res, go(pos + 1, N, N2, cnt1 + 1, cnt2)); n } n } n itt++; n if (itt & 63) { n if (clock() * 1e-3 > 0.8) { n stop = true; n return res; n } n } n return res; n } n int rowperm[22]; n int colperm[22]; n bool visrow[22]; n bool viscol[22]; n int main() { n int N; n scanf( %d , &N); n for (int i = 0; i < N; i++) rowperm[i] = i; n for (int i = 0; i < N; i++) colperm[i] = i; n srand(time(0)); n random_shuffle(rowperm, rowperm + N); n random_shuffle(colperm, colperm + N); n for (int i = 0; i < N; i++) rr[i] = rand() % 2; n for (int i = 0; i < N; i++) n for (int j = 0; j < N; j++) scanf( %d , &matrix1[rowperm[i]][colperm[j]]); n for (int i = 0; i < N; i++) { n for (int j = 0; j < N; j++) { n line1max[i] = max(line1max[i], matrix1[i][j]); n } n } n for (int i = 0; i < N; i++) n for (int j = 0; j < N; j++) scanf( %d , &matrix2[rowperm[i]][colperm[j]]); n for (int i = 0; i < N; i++) { n for (int j = 0; j < N; j++) { n line2max[i] = max(line2max[i], matrix2[i][j]); n } n } n int ost1 = N / 2; n int ost2 = N / 2; n memset(visrow, true, sizeof(visrow)); n memset(viscol, true, sizeof(viscol)); n for (int step = 0; step < N; step++) { n int maxi1 = 0; n int r1 = 0, c1 = 0; n int maxi2 = 0; n int r2 = 0, c2 = 0; n for (int i = 0; i < N; i++) { n for (int j = 0; j < N; j++) { n if (matrix1[i][j] > maxi1 && visrow[i] && viscol[j]) { n maxi1 = matrix1[i][j]; n r1 = i; n c1 = j; n } n if (matrix2[i][j] > maxi2 && visrow[i] && viscol[j]) { n maxi2 = matrix2[i][j]; n r2 = i; n c2 = j; n } n } n } n if (ost1 > 0 && maxi1 > maxi2) { n ost1--; n best += maxi1; n visrow[r1] = false; n viscol[c1] = false; n } else if (ost2 > 0 && maxi2 > maxi1) { n ost2--; n best += maxi2; n visrow[r2] = false; n viscol[c2] = false; n } else if (maxi1 == maxi2) { n if (ost1 > ost2) { n ost1--; n best += maxi1; n visrow[r1] = false; n viscol[c1] = false; n } else { n ost2--; n best += maxi2; n visrow[r2] = false; n viscol[c2] = false; n } n } else if (ost1 > 0) { n ost1--; n best += maxi1; n visrow[r1] = false; n viscol[c1] = false; n } else { n ost2--; n best += maxi2; n visrow[r2] = false; n viscol[c2] = false; n } n } n printf( %d n , max(best, go(0, N, N / 2))); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int solve(string s, int x, int y) { n int t = 0; n for (auto i : s) { n if (i - 0 == x) { n t++; n swap(x, y); n } n } n if (x != y && t % 2 == 1) --t; n return t; n } n int main() { n cin.tie(0); n cout.tie(0); n ios_base::sync_with_stdio(0); n int t; n cin >> t; n while (t--) { n string s; n cin >> s; n int ans = 0; n for (int i = 0; i <= 9; i++) { n for (int j = 0; j <= 9; j++) { n ans = max(ans, solve(s, i, j)); n } n } n cout << (int)(s.size()) - ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char a[2010], b[2010], c[2010]; n int aa[256], bb[256]; n int n; n void _reverse(char *a, int l) { n for (int i = 0; i < l; i++) c[i] = a[i]; n for (int i = 0; i < l; i++) a[i] = c[l - 1 - i]; n } n void _rotate(char *a, int p) { n for (int i = 0; i < p; i++) c[n - p + i] = a[i]; n for (int i = 0; i < n - p; i++) c[i] = a[p + i]; n for (int i = 0; i < n; i++) a[i] = c[i]; n } n int main() { n scanf( %d%s%s , &n, a, b); n for (int i = 0; i < n; i++) { n aa[a[i]]++; n bb[b[i]]++; n } n for (int i = 0; i < 256; i++) n if (aa[i] != bb[i]) { n printf( -1 n ); n return 0; n } n printf( %d n , 3 * n); n for (int i = 0; i < n; i++) { n int j; n _reverse(a, n); n for (j = 0; j < n; j++) n if (a[j] == b[n - 1 - i]) break; n printf( %d %d %d , n, n - j - 1, 1); n _reverse(a + j + 1, n - j - 1); n _rotate(a, j + 1); n _rotate(a, n - 1); n } n } n "} +{"func_code_string": "#include n void reduce(unsigned& nom, unsigned& denom) { n bool reduced = true; n while (reduced) { n reduced = false; n for (unsigned i = 2; !reduced && i < 1000; ++i) { n if (nom % i == 0 && denom % i == 0) { n nom /= i; n denom /= i; n reduced = true; n } n } n } n } n void solve() { n unsigned sum = 0; n unsigned A; n std::cin >> A; n for (unsigned i = 2; i < A; ++i) { n auto val = A; n while (val > 0) { n sum += val % i; n val /= i; n } n } n auto nom = sum; n auto denom = A - 2; n reduce(nom, denom); n std::cout << nom << / << denom << std::endl; n } n int main(int argc, char* argv[]) { n { solve(); } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int max_n = 1500; n const int max_m = 1500; n const int inv = numeric_limits::max(); n int n, m; n char G[max_n][max_m]; n int si, sj; n int di[max_n][max_m][4]; n int dj[max_n][max_m][4]; n int asz[max_n][max_m] = {0}; n int vsti[max_n][max_m]; n int vstj[max_n][max_m]; n stack sti, stj; n int ct[max_n][max_m] = {0}; n bool res; n int amod(int p, int d) { n if (p % d < 0) n return p % d + d; n else n return p % d; n } n void DFS() { n int vi, vj; n sti.push(si); n stj.push(sj); n while (!sti.empty()) { n vi = sti.top(); n vj = stj.top(); n int rvi = amod(vi, n), rvj = amod(vj, m); n vsti[rvi][rvj] = vi; n vstj[rvi][rvj] = vj; n int i; n int ni, nj, rni, rnj; n if (ct[rvi][rvj] == asz[rvi][rvj]) { n sti.pop(); n stj.pop(); n } else { n i = ct[rvi][rvj]; n ++ct[rvi][rvj]; n ni = vi + di[rvi][rvj][i]; n nj = vj + dj[rvi][rvj][i]; n rni = amod(ni, n); n rnj = amod(nj, m); n if (vsti[rni][rnj] == inv) { n sti.push(ni); n stj.push(nj); n } else if (vsti[rni][rnj] != ni or vstj[rni][rnj] != nj) { n res = true; n return; n } n } n } n return; n } n int main() { n int ldi[4] = {-1, 1, 0, 0}; n int ldj[4] = {0, 0, -1, 1}; n scanf( %d %d , &n, &m); n char trow[max_m + 10]; n for (int i = 0; i < n; ++i) { n scanf( %s , trow); n for (int j = 0; j < m; ++j) { n G[i][j] = trow[j]; n if (G[i][j] == S ) { n G[i][j] = . ; n si = i; n sj = j; n } n } n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n if (G[i][j] == . ) { n for (int k = 0; k < 4; ++k) { n int xi = amod(i + ldi[k], n), xj = amod(j + ldj[k], m); n if (G[xi][xj] == . ) { n di[i][j][asz[i][j]] = ldi[k]; n dj[i][j][asz[i][j]] = ldj[k]; n ++asz[i][j]; n } n } n } n } n } n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n vsti[i][j] = inv; n vstj[i][j] = inv; n } n } n res = false; n DFS(); n if (res) n printf( Yes n ); n else n printf( No n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void add_self(int &a, int b) { n a += b; n if (a >= (int)1e9 + 7) a -= (int)1e9 + 7; n } n int n, l; n void f(vector &a) { n int x = a[0]; n for (int i = 0; i < n - 1; i++) { n a[i] = a[i + 1] - a[i]; n } n a[n - 1] = l - a[n - 1] + x; n } n void f1(vector &a, int k) { n reverse(begin(a), end(a)); n reverse(begin(a) + k, end(a)); n reverse(begin(a), begin(a) + k); n } n void solve() { n cin >> n >> l; n vector a(n), b(n); n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) cin >> b[i]; n f(a); n f(b); n for (int i = 0; i < n; i++) { n f1(a, 1); n bool ok = true; n for (int j = 0; j < n; j++) { n if (a[j] != b[j]) { n ok = false; n break; n } n } n if (ok) { n cout << YES ; n return; n } n } n cout << NO ; n } n int main() { n ios::sync_with_stdio(false); n int q = 1; n for (int i = 1; i <= q; i++) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n long long int minimum(long long int a[], long long int m, long long int n) { n long long int ar[m]; n for (long long int i = 0; i < m; i++) ar[i] = a[i]; n long long int j = 0; n long long int ans = 0; n while (n > 0) { n if (ar[j] > 0) { n ans += ar[j]; n ar[j] -= 1; n n--; n } else n j++; n } n return ans; n } n long long int maximum(long long int a[], long long int m, long long int n) { n long long int ar[m]; n for (long long int i = 0; i < m; i++) ar[i] = a[i]; n long long int ans = 0; n long long int j = m - 1; n while (n > 0) { n ans += ar[j]; n ar[j] -= 1; n n--; n long long int maxi = ar[j]; n long long int id = j; n for (long long int k = m - 1; k >= 0; k--) { n if (maxi < ar[k]) { n id = k; n maxi = ar[k]; n } n } n swap(ar[id], ar[j]); n } n return ans; n } n void solve() { n long long int n, m; n cin >> n >> m; n long long int ar[m]; n for (auto &it : ar) cin >> it; n ; n sort(ar, ar + m); n long long int mini = minimum(ar, m, n); n long long int maxi = maximum(ar, m, n); n cout << maxi << << mini << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = (1 << 20) + 10; n vector> g[N]; n int tamp = 0; n bool faz; n namespace hpath_space { n vector path; n vector idit, used_edge; n void dfs(int no) { n while (1) { n int &id = idit[no]; n while (id < (int)(g[no].size()) and used_edge[g[no][id].second]) id++; n if (id == (int)(g[no].size())) break; n used_edge[g[no][id].second] = 1; n int it = g[no][id++].first; n dfs(it); n } n if (faz) path.push_back(no); n tamp++; n } n bool has_cycle(int n, int m) { n int nimp = 0; n for (int i = 0; i < n; i++) n if ((int)(g[i].size()) & 1) nimp++; n tamp = 0; n if (nimp > 0) return 0; n int inic = 0; n for (int i = 0; i < n; i++) n if ((int)(g[i].size())) inic = i; n path.clear(); n idit = vector(n); n used_edge = vector(m); n dfs(inic); n if (tamp == m + 1) return 1; n return 0; n } n }; // namespace hpath_space n int n; n vector> pe; n vector ans; n template n struct mymap { n int n; n vector keys; n vector values; n mymap(vector _keys) { n keys = _keys; n sort((keys).begin(), (keys).end()); n keys.resize(unique((keys).begin(), (keys).end()) - keys.begin()); n n = (int)(keys.size()); n values = vector(n); n } n value_type &operator[](key_type key) { n int id = lower_bound((keys).begin(), (keys).end(), key) - keys.begin(); n return values[id]; n } n }; n bool check(int k, bool sob = 1) { n faz = !sob; n int mask = (1 << k) - 1; n for (int i = 0; i < mask + 1; i++) g[i].clear(); n for (int i = 0; i < n; i++) { n int ao, bo; n tie(ao, bo) = pe[i]; n int a = ao & mask; n int b = bo & mask; n g[a].emplace_back(b, i); n g[b].emplace_back(a, i); n } n if (hpath_space::has_cycle(mask + 1, n)) { n if (sob) return 1; n vector> vmp, vst; n for (int i = 0; i < n; i++) { n int ao, bo; n tie(ao, bo) = pe[i]; n int a = ao & mask; n int b = bo & mask; n vmp.emplace_back(a, b); n vmp.emplace_back(b, a); n vst.emplace_back(2 * i, 2 * i + 1); n vst.emplace_back(2 * i + 1, 2 * i); n } n mymap, vector>> mp(vmp); n mymap, int> mpid(vmp), st(vst); n for (int i = 0; i < n; i++) { n int ao, bo; n tie(ao, bo) = pe[i]; n int a = ao & mask; n int b = bo & mask; n mp[{a, b}].push_back({2 * i, 2 * i + 1}); n mp[{b, a}].push_back({2 * i + 1, 2 * i}); n } n ans.clear(); n vector &path = hpath_space::path; n for (int i = 0; i < (int)(path.size()) - 1; i++) { n int va = path[i], vb = path[i + 1]; n int &imp = mpid[{va, vb}]; n int ia, ja; n auto &v = mp[{va, vb}]; n while (1) { n tie(ia, ja) = v[imp]; n if (st[{ia, ja}]) { n imp++; n continue; n } n st[{ia, ja}] = 1; n st[{ja, ia}] = 1; n break; n } n imp++; n ans.push_back(ia); n ans.push_back(ja); n assert(abs(ia - ja) == 1); n } n return 1; n } n return 0; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n; n for (int i = 0; i < n; i++) { n int a, b; n cin >> a >> b; n pe.emplace_back(a, b); n } n int lo = 0, hi = 20; n while (lo < hi) { n int k = (lo + hi + 1) / 2; n if (hi - lo + 1 >= 8) k = lo + (hi - lo) / 3; n if (check(k)) n lo = k; n else n hi = k - 1; n } n if (lo) { n int k = lo; n assert(check(k, 0)); n assert((int)(ans.size()) == 2 * n); n cout << k << n ; n for (int i = 0; i < 2 * n; i++) { n if (i) cout << ; n cout << ans[i] + 1; n } n cout << n ; n return 0; n } n cout << 0 << n ; n for (int i = 0; i < 2 * n; i++) { n if (i) cout << ; n cout << i + 1; n } n cout << n ; n } n "} +{"func_code_string": "#include n using namespace std; n unsigned long long int w, v, qt = 0, n; n inline unsigned long long int f(unsigned long long int x) { n return w * (1 - x) * (1 - x) + v; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> n >> v >> w; n char c; n while (cin >> c) qt += c == 1 ; n unsigned long long int ans = (~0ULL); n for (int i = 1; i <= qt; i++) { n unsigned long long int tmp = 0; n tmp += (i - (n % i)) * f(n / i); n tmp += (n % i) * f(n / i + 1); n ans = min(ans, tmp); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int number_of_players; n cin >> number_of_players; n int old_bid, counter; n for (counter = 0; counter < number_of_players; counter++) { n int bid; n cin >> bid; n while (bid % 2 == 0) bid /= 2; n while (bid % 3 == 0) bid /= 3; n if (counter == 0) n old_bid = bid; n else if (old_bid != bid) { n cout << No << endl; n break; n } n } n if (counter == number_of_players) cout << Yes << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = (long long)1e9 + 7; n long long n, m, k; n const long long moll = 998244353; n long long fact(long long n) { n if (n == 0) return 1; n return (n * fact(n - 1)) % moll; n } n long long binpow(long long a, long long b) { n if (b == 0) return 1; n if (b % 2 == 0) return (binpow((a * a) % moll, b / 2)) % moll; n return (a * (binpow((a * a) % moll, b / 2))) % moll; n } n long long C(long long n, long long k) { n long long x = (fact(n) * binpow(fact(k), moll - 2)) % moll; n x *= binpow(fact(n - k), moll - 2); n x %= moll; n if (x < 0) x += moll; n return x; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> n >> m >> k; n long long x = m; n x *= C(n - 1, k); n x %= moll; n x *= binpow(m - 1, k); n x %= moll; n if (x < 0) x += moll; n cout << x << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, i, j, a[105], b[105]; n int main() { n cin >> n >> m; n for (i = 0; i < n; i++) cin >> a[i]; n for (i = 0; i < m; i++) cin >> b[i]; n for (i = 0; i < n; i++) { n for (j = 0; j < m; j++) { n if (a[i] == b[j]) { n cout << a[i] << ; n b[j] = -1; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n cin >> n; n vector tree[n + 1]; n for (int i = 2; i <= n; i++) { n int p; n cin >> p; n tree[p].push_back(i); n } n bool is_spruce = true; n for (int i = 1; i <= n; i++) { n if (tree[i].empty()) n continue; n else { n int count = 0; n for (auto c : tree[i]) { n if (count == 3) break; n if (tree[c].size() == 0) count++; n } n if (count != 3) { n is_spruce = false; n break; n } n } n } n if (is_spruce) n cout << Yes << endl; n else n cout << No << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n long long int s, sum = 0; n cin >> n >> s; n long long int* v = new long long int[n]; n for (int i = 0; i < n; i++) { n cin >> v[i]; n sum += v[i]; n } n if (s > sum) n cout << -1 << endl; n else { n sort(v, v + n); n if (s < (sum - v[0] * n)) n cout << v[0] << endl; n else { n s -= sum - v[0] * n; n if (s % n == 0) n cout << v[0] - s / n << endl; n else n cout << v[0] - (s / n) - 1 << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int N, M; n signed long long L[100020], R[100020], T[100020]; n signed long long Q[100020]; n vector > QP; n signed long long PP[200200]; n signed long long AS[200200], BS[200200], ret[200200]; n vector S[200200], E[200200]; n void solve() { n int i, j, k, l, r, x, y; n string s; n cin >> N >> M; n for (i = 0; i < M; i++) cin >> L[i] >> R[i] >> T[i]; n for (i = 0; i < N; i++) cin >> Q[i], QP.push_back(make_pair(Q[i], i)); n sort(QP.begin(), QP.end()); n map UM; n UM[0] = 0; n for (i = 0; i < M; i++) UM[L[i]] = UM[R[i]] = 1; n i = 0; n for (__typeof(UM.begin()) it = UM.begin(); it != UM.end(); it++) n it->second = i++, PP[it->second] = it->first; n for (i = 0; i < M; i++) n S[UM[L[i]]].push_back(T[i]), E[UM[R[i]]].push_back(T[i]); n map CS; n for (i = 0; i < UM.size(); i++) { n for (j = 0; j < E[i].size(); j++) n if (--CS[E[i][j]] == 0) CS.erase(E[i][j]); n for (j = 0; j < S[i].size(); j++) CS[S[i][j]]++; n if (CS.size()) { n signed long long ct = CS.begin()->first; n x = lower_bound(QP.begin(), QP.end(), make_pair(ct - PP[i + 1], 0LL)) - n QP.begin(); n y = lower_bound(QP.begin(), QP.end(), make_pair(ct - PP[i], 0LL)) - n QP.begin(); n AS[x]++; n AS[y]--; n BS[x] -= ct - PP[i + 1], BS[y] += ct - PP[i]; n } n } n signed long long aa = 0, bb = 0; n for (i = 0; i < N; i++) n aa += AS[i], bb += BS[i], ret[QP[i].second] = aa * QP[i].first + bb; n for (i = 0; i < N; i++) cout << ret[i] << endl; n } n int main(int argc, char** argv) { n string s; n int i; n if (argc == 1) ios::sync_with_stdio(false); n for (i = 0; i < argc - 1; i++) s += argv[i + 1], s += n ; n for (i = 0; i < s.size(); i++) ungetc(s[s.size() - 1 - i], stdin); n solve(); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int q; n std::cin >> q; n while (q--) { n int n; n std::cin >> n; n std::vector a(n); n for (int i = 0; i < n; ++i) { n std::cin >> a[i]; n } n for (int i = 0; i < n; i += 2) { n std::cout << -a[i + 1] << << a[i] << ; n } n std::cout << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 200; n int mn[maxn << 2], lazy[maxn << 2], gs[maxn << 2]; n void push(int rt) { n if (lazy[rt] == 1000000000) return; n lazy[rt << 1] = lazy[rt << 1 | 1] = lazy[rt]; n mn[rt << 1] = mn[rt << 1 | 1] = lazy[rt]; n gs[rt << 1] = gs[rt << 1 | 1] = lazy[rt]; n lazy[rt] = 1000000000; n } n void update(int l, int r, int rt, int ql, int qr, int v) { n if (ql <= l && qr >= r) n lazy[rt] = v, mn[rt] = gs[rt] = v; n else { n push(rt); n int mid = l + r >> 1; n if (ql <= mid) update(l, mid, rt << 1, ql, qr, v); n if (qr > mid) update(mid + 1, r, rt << 1 | 1, ql, qr, v); n mn[rt] = min(mn[rt << 1], mn[rt << 1 | 1]); n } n } n int query(int l, int r, int rt, int ql, int qr) { n if (ql <= l && qr >= r) return mn[rt]; n push(rt); n int mid = l + r >> 1, ret = 1e9; n if (ql <= mid) ret = query(l, mid, rt << 1, ql, qr); n if (qr > mid) ret = min(ret, query(mid + 1, r, rt << 1 | 1, ql, qr)); n return ret; n } n int Pv(int l, int r, int rt, int p) { n if (l == r) return gs[rt]; n push(rt); n int mid = l + r >> 1; n if (p <= mid) n return Pv(l, mid, rt << 1, p); n else n return Pv(mid + 1, r, rt << 1 | 1, p); n } n int sum[maxn], a[maxn]; n void build(int l, int r, int rt) { n lazy[rt] = 1000000000; n if (l == r) n mn[rt] = gs[rt] = sum[l]; n else { n int mid = l + r >> 1; n build(l, mid, rt << 1); n build(mid + 1, r, rt << 1 | 1); n mn[rt] = min(mn[rt << 1], mn[rt << 1 | 1]); n } n } n int vis[maxn]; n using pii = pair; n pii her[maxn]; n vector ans; n int main() { n int n, m; n cin >> n >> m; n for (int i = 1; i <= m; ++i) cin >> her[i].first >> her[i].second; n for (int i = 1; i <= n; ++i) cin >> a[i]; n int pos = -1; n for (int i = 1; i <= n; ++i) { n sum[0] = 0; n sum[n + 1] = 0; n int tp = a[i]; n for (int i = 1; i <= n; ++i) vis[i] = 0; n for (int j = 1; j < i; ++j) sum[j] = sum[j - 1] + a[j]; n for (int j = n; j > i; --j) sum[j] = sum[j + 1] + a[j]; n sum[i] = 0; n build(1, n, 1); n while (true) { n int cnt = 0; n for (int j = 1; j <= m; ++j) { n if (vis[j]) continue; n auto h = her[j]; n int S = 0, ps = Pv(1, n, 1, h.first); n if (h.first <= i - 1) S = query(1, n, 1, h.first, i - 1) - ps; n if (h.first >= i + 1) S = query(1, n, 1, i + 1, h.first) - ps; n if (h.second + S >= 0) { n if (h.first <= i - 1) S = Pv(1, n, 1, i - 1) - ps; n if (h.first >= i + 1) S = Pv(1, n, 1, i + 1) - ps; n if (h.second + S + a[i] >= 0) { n a[i] = 0; n vis[j] = 1; n cnt++; n ans.push_back(j); n if (h.first <= i - 1) update(1, n, 1, h.first, i - 1, ps); n if (h.first >= i + 1) update(1, n, 1, i + 1, h.first, ps); n } n } n } n if (!cnt) break; n } n if (ans.size() == m) { n pos = i; n break; n } n a[i] = tp; n ans.clear(); n } n cout << pos << endl; n for (auto &u : ans) cout << u << ; n puts( ); n return 0; n } n "} +{"func_code_string": "#include n const double PI = 3.1415926535897932384626433; n const int KL = 1e5 + 10; n const long long MOD = 1e9 + 7; n using namespace std; n struct point { n long double x, y; n void go(long long x1, long long y1) { n x = x1; n y = y1; n } n void read() { cin >> x >> y; } n point operator-(point b) { return point{x - b.x, y - b.y}; } n point operator+(point b) { return point{x + b.x, y + b.y}; } n }; n long double fnd_angle(point p) { n long double len = sqrt(p.x * p.x + p.y * p.y); n long double angle = acos(fabs(p.x) / len); n if (p.y < 0) { n if (p.x >= 0) n angle = 2 * PI - angle; n else n angle += PI; n } else if (p.x < 0) n angle = PI - angle; n return angle; n } n int n, k; n vector A; n vector> a, b; n multiset s; n bool ok(long double mid) { n if (k <= 0) return 1; n a.clear(); n b.clear(); n for (int i = 0; i < n; i++) { n long double dis = sqrt(A[i].x * A[i].x + A[i].y * A[i].y); n if (dis > 2 * mid) continue; n long double angle = fnd_angle(A[i]); n long double angle2 = acos(dis / (2.0 * mid)); n a.push_back({angle - angle2, 2 * angle2}); n b.push_back({angle + angle2, -2.0 * angle2}); n } n sort(a.begin(), a.end()); n sort(b.begin(), b.end()); n reverse(b.begin(), b.end()); n int sz = a.size(); n for (int i = 0; i < sz; i++) a.push_back({a[i].first + 2 * PI, a[i].second}); n for (int i = 0; i < sz; i++) b.push_back({b[i].first - 2 * PI, b[i].second}); n int mx = 0; n s.clear(); n for (int i = 0; i < a.size(); i++) { n while (s.size() > 0 && *s.begin() < a[i].first) s.erase(s.begin()); n if (s.size() + 1 >= k) return 1; n s.insert(a[i].first + a[i].second); n } n s.clear(); n for (int i = 0; i < b.size(); i++) { n while (s.size() > 0 && *(--s.end()) > b[i].first) s.erase(--s.end()); n if (s.size() + 1 >= k) return 1; n s.insert(b[i].first + b[i].second); n } n return 0; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> k; n for (int i = 1; i <= n; i++) { n point pp; n pp.read(); n if (pp.x == 0 && pp.y == 0) { n k--; n continue; n } n A.push_back(pp); n } n n = A.size(); n long double lo = 0.0, hi = 2e5; n int cnt = 33; n while (cnt--) { n long double mid = (lo + hi) / 2.0; n if (ok(mid)) n hi = mid; n else n lo = mid; n } n cout << fixed << setprecision(8) << lo << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int MOD = 998244353; n long long int power(long long int x, unsigned long long int y) { n long long res = 1, m = y + 2; n x %= m; n while (y > 0) { n if (y & 1) res = res * x % m; n x = x * x % m; n y >>= 1; n } n return res; n } n long long int modInverse(long long int a, long long int m = MOD) { n return power(a, m - 2); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int t = 1; n while (t--) { n long long int n, i, j; n cin >> n; n long long int a[n]; n for (i = 0; i < n; i++) cin >> a[i]; n long long int p[n + 1]; n p[0] = 1; n for (i = 1; i < n + 1; i++) { n p[i] = 100 * p[i - 1] % MOD; n } n long long int dp[n], x = 1; n for (i = 0; i < n; i++) { n dp[i] = x * (100 - a[i]) % MOD; n x *= a[i]; n x %= MOD; n dp[i] *= p[n - i - 1]; n dp[i] %= MOD; n } n long long int dp1[n]; n for (i = 0; i < n; i++) dp1[i] = dp[i] * (i + 1) % MOD; n long long int s1 = n; n for (i = 0; i < n; i++) s1 *= a[i], s1 %= MOD; n long long int s2 = 0; n for (i = 0; i < n; i++) s2 += dp1[i], s2 %= MOD; n long long int s3 = 0; n for (i = 0; i < n; i++) s3 += dp[i], s3 %= MOD; n s3 = p[n] - s3; n while (s3 < 0) s3 += MOD; n s2 += s1; n s2 %= MOD; n cout << s2 * modInverse(s3) % MOD; n } n cerr << Time Taken: << (float)clock() / CLOCKS_PER_SEC * 1000 << ms n << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n vector prime(n + 1, 0); n vector div(n + 1, 0); n prime[1] = 1; n for (long long i = 2; i <= n; i++) { n if (!prime[i]) { n for (long long j = i; j <= n; j += i) { n prime[j] = i; n } n } n } n for (int i = 0; i < m; i++) { n int flag; n int x; n char c; n cin >> c >> x; n if (c == + ) { n if (div[prime[x]] == x) { n cout << Already on << endl; n } else { n flag = 0; n for (long long i = x; i > 1; i /= prime[i]) { n if (div[prime[i]]) { n flag = div[prime[i]]; n } n } n if (flag) { n cout << Conflict with << flag << endl; n } else { n for (long long i = x; i > 1; i /= prime[i]) { n div[prime[i]] = x; n } n if (x == 1) { n div[1] = 1; n } n cout << Success << endl; n } n } n } else { n if (div[prime[x]] != x) { n cout << Already off << endl; n } else { n for (long long i = x; i > 1; i /= prime[i]) { n div[prime[i]] = 0; n } n if (x == 1) { n div[1] = 0; n } n cout << Success << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int query(const vector &S, int v, const vector &T) { n if (S.empty() || T.empty()) return 0; n cout << S.size() << n ; n for (int i = 0; i < (int)S.size(); i++) n cout << S[i] + 1 << (i < (int)S.size() - 1 ? : n ); n cout << T.size() << n ; n for (int i = 0; i < (int)T.size(); i++) n cout << T[i] + 1 << (i < (int)T.size() - 1 ? : n ); n cout << v + 1 << n ; n cout << flush; n int answer; n cin >> answer; n return answer; n } n int query(int s, int v, const vector &T) { n return query(vector(1, s), v, T); n } n int N, root; n vector parent; n vector subtree_size; n int main() { n ios::sync_with_stdio(false); n cin >> N; n root = 0; n parent.assign(N, -1); n subtree_size.assign(N, -1); n vector non_root; n for (int i = 0; i < N; i++) n if (i != root) non_root.push_back(i); n for (int i = 0; i < N; i++) n if (i != root) subtree_size[i] = query(root, i, non_root); n subtree_size[root] = N; n vector sorted; n for (int i = 0; i < N; i++) sorted.push_back(i); n sort(sorted.begin(), sorted.end(), n [&](int a, int b) { return subtree_size[a] < subtree_size[b]; }); n for (int i = 0; i < N; i++) { n int v = sorted[i]; n vector missing_parent; n for (int j = 0; j < i; j++) n if (parent[sorted[j]] < 0) missing_parent.push_back(sorted[j]); n int remaining = query(root, v, missing_parent); n int high = (int)missing_parent.size(); n while (remaining > 0) { n int low = 0; n while (low < high) { n int mid = (low + high + 1) / 2; n if (query(root, v, n vector(missing_parent.begin(), n missing_parent.begin() + mid)) == remaining) n high = mid - 1; n else n low = mid; n } n int child = missing_parent[low]; n parent[child] = v; n remaining--; n } n } n cout << ANSWER << n ; n for (int i = 0; i < N; i++) n if (parent[i] >= 0) cout << i + 1 << << parent[i] + 1 << n ; n cout << flush; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n if (false) { n freopen( input.txt , r , stdin); n freopen( output.txt , w , stdout); n } n int n; n cin >> n; n vector v(n + 1, -1); n int xx = 1048576; n long long sum = 0; n for (int i = n; i > 0; i--) { n if (v[i] >= 0) { n continue; n } n while (xx / 2 > i) { n xx /= 2; n } n int a = i ^ (xx - 1); n v[i] = a; n v[a] = i; n sum += (a + i) * 2; n } n if (v[0] < 0) { n v[0] = 0; n } n cout << sum << endl; n for (int i = 0; i <= n; i++) { n if (i > 0) { n cout << ; n } n cout << v[i]; n } n cout << endl; n if (false) { n fclose(stdin); n fclose(stdout); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 150007; n const double eps = 1e-8; n int n; n double l, r, mid, sm[N], mxp[N], mnp[N]; n struct note { n double p, t, c; n int id; n } a[N], b[N]; n int cmp(note x, note y) { return x.c > y.c; } n int cmp0(note x, note y) { return x.p < y.p; } n int check() { n double mxv = 0; n for (int i = 1, j, lb, rb; i <= n; i = j) { n j = i; n while (j <= n && a[j].c == a[i].c) ++j; n lb = i, rb = j - 1; n for (int k = i; k < j; ++k) { n mnp[a[k].id] = a[k].p * (1 - mid * sm[rb] / sm[n]); n mxp[a[k].id] = a[k].p * (1 - mid * (sm[lb - 1] + a[k].t) / sm[n]); n } n } n for (int i = 1, j; i <= n; i = j) { n j = i; n while (j <= n && b[j].p == b[i].p) ++j; n for (int k = i; k < j; ++k) n if (mxv > mnp[b[k].id]) return 0; n for (int k = i; k < j; ++k) mxv = max(mxv, mxp[b[k].id]); n } n return 1; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; ++i) scanf( %lf , &a[i].p), a[i].id = i; n for (int i = 1; i <= n; ++i) scanf( %lf , &a[i].t), a[i].c = a[i].p / a[i].t; n memcpy(b, a, sizeof(a)); n sort(b + 1, b + n + 1, cmp0); n sort(a + 1, a + n + 1, cmp); n for (int i = 1; i <= n; ++i) sm[i] = sm[i - 1] + a[i].t; n l = 0, r = 1; n while (r - l > eps) { n mid = (l + r) / 2; n if (check()) n l = mid; n else n r = mid; n } n printf( %.7lf n , l); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string tostr(int n) { n stringstream rr; n rr << n; n return rr.str(); n } n long long qpow(long long n, long long k) { n long long ans = 1; n while (k) { n if (k & 1) ans = ans * n; n n = n * n; n k >>= 1; n } n return ans; n } n const int mod = 1e9 + 7; n const int mxn = 1e5 + 9; n const int eps = 1e-9; n int main() { n ios_base::sync_with_stdio(false), cin.tie(NULL); n int i, j, k, l, st; n vector v; n string s, p; n cin >> s; n if (s[0] == - ) n st = 1, cout << ( ; n else n st = 0; n cout << $ ; n p = s.substr(st); n if (p.find( . ) == -1) n for (i = p.size() - 1; i >= 0; i--) { n v.push_back(p[i]); n if ((p.size() - i) % 3 == 0 && i != 0) v.push_back( , ); n } n else n for (i = p.find( . ) - 1; i >= 0; i--) { n v.push_back(p[i]); n if ((p.find( . ) - i) % 3 == 0 && i != 0) v.push_back( , ); n } n reverse(v.begin(), v.end()); n for (auto c : v) cout << c; n cout << . ; n if (p.find( . ) == -1) n cout << 00 ; n else { n cout << p[p.find( . ) + 1]; n if (p[p.find( . ) + 2] != 0 ) n cout << p[p.find( . ) + 2]; n else n cout << 0 ; n } n if (st == 1) cout << ) ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5e3 + 1; n int dp[N][N]; n bool palid[N][N]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n string s; n cin >> s; n int n = s.size(); n for (int d = 0; d < n; d++) n for (int i = 0; i < n; i++) { n int j = i + d; n if (j >= n) continue; n palid[i][j] = (s[i] == s[j]); n if (i + 1 <= j - 1) palid[i][j] &= palid[i + 1][j - 1]; n } n for (int d = 0; d < n; d++) n for (int i = 0; i < n; i++) { n int j = i + d; n if (j >= n) continue; n dp[i][j] = palid[i][j]; n if (i + 1 <= j) dp[i][j] += dp[i + 1][j]; n if (i <= j - 1) dp[i][j] += dp[i][j - 1]; n if (i + 1 <= j - 1) dp[i][j] -= dp[i + 1][j - 1]; n } n int q; n cin >> q; n for (int i = 0; i < q; i++) { n int l, r; n cin >> l >> r; n l--; n r--; n cout << dp[l][r] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, flag; n int ar[101][101], ars[101][101], c[101][101], q[101][101]; n int fu() { n int y = 1; n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) n if (ars[i][j] != c[i][j]) y = 0; n return y; n } n void f() { n flag = max(flag, fu()); n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) q[i][j] = c[j][n - i - 1]; n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) c[i][j] = q[i][j]; n flag = max(flag, fu()); n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) q[i][j] = c[j][n - i - 1]; n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) c[i][j] = q[i][j]; n flag = max(flag, fu()); n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) q[i][j] = c[j][n - i - 1]; n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) c[i][j] = q[i][j]; n flag = max(flag, fu()); n } n int main() { n cin >> n; n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) { n char a; n cin >> a; n if (a == X ) n ar[i][j] = 0; n else n ar[i][j] = 1; n c[i][j] = ar[i][j]; n } n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) { n char a; n cin >> a; n if (a == X ) n ars[i][j] = 0; n else n ars[i][j] = 1; n } n f(); n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) c[i][j] = ar[n - i - 1][j]; n f(); n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) c[i][j] = ar[i][n - j - 1]; n f(); n if (flag) { n cout << Yes ; n } else n cout << No ; n return 0; n } n "} +{"func_code_string": "#include n int main() { n int a, b, c, count = 0, i, j; n scanf( %d%d%d , &a, &b, &c); n if ((a == c) || (b == c)) { n count++; n } else { n for (i = 0; i <= c; i += a) { n for (j = 0; j <= c; j += b) { n if ((i + j) == c) { n count++; n break; n } n } n } n } n if (count != 0) { n printf( Yes ); n } else { n printf( No ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n struct Mint { n int v; n Mint() { v = 0; } n Mint(int x) { n v = x % mod; n if (v < 0) v += mod; n } n Mint(long long x) { n v = x % mod; n if (v < 0) v += mod; n } n friend bool operator==(const Mint &a, const Mint &b) { return a.v == b.v; } n friend bool operator!=(const Mint &a, const Mint &b) { return a.v != b.v; } n friend bool operator<(const Mint &a, const Mint &b) { return a.v < b.v; } n friend bool operator<=(const Mint &a, const Mint &b) { return a.v <= b.v; } n friend bool operator>(const Mint &a, const Mint &b) { return a.v > b.v; } n friend bool operator>=(const Mint &a, const Mint &b) { return a.v >= b.v; } n Mint &operator+=(const Mint &a) { n v += a.v; n if (v >= mod) v -= mod; n return *this; n } n Mint &operator-=(const Mint &a) { n v -= a.v; n if (v < 0) v += mod; n return *this; n } n Mint &operator*=(const Mint &a) { n v = (1LL * v * a.v) % mod; n return *this; n } n Mint operator-() { return Mint(-v); } n Mint &operator++() { return *this += 1; } n Mint &operator--() { return *this -= 1; } n friend Mint operator+(Mint a, const Mint b) { return a += b; } n friend Mint operator-(Mint a, const Mint b) { return a -= b; } n friend Mint operator*(Mint a, const Mint b) { return a *= b; } n friend Mint min(Mint a, Mint b) { return (a < b ? b : a); } n friend Mint max(Mint a, Mint b) { return (a > b ? a : b); } n friend Mint pow(Mint a, long long b) { n Mint res = 1; n while (b > 0) { n if (b & 1) { n res *= a; n } n a *= a, b >>= 1; n } n return res; n } n friend Mint inv(const Mint &a) { return pow(a, modPhi - 1); } n Mint operator/=(const Mint &a) { n *this *= inv(a); n return *this; n } n friend Mint operator/(Mint a, const Mint b) { return a /= b; } n friend istream &operator>>(istream &in, Mint &a) { return in >> a.v; } n friend ostream &operator<<(ostream &out, Mint a) { return out << a.v; } n }; n const int mod = 1e9 + 7; n using mint = Mint; n mint k; n mint pp = 1; n int moves = 0; n void move(int &x, int &del, int b) { n if (x == b) del = -1; n if (x == 1) del = 1; n x += del; n } n int move1(int x, int del, int b) { n if (x == b) del = -1; n if (x == 1) del = 1; n x += del; n return x; n } n void testCase() { n int n, m, rb, cb, rd, cd; n mint p; n cin >> n >> m >> rb >> cb >> rd >> cd; n cin >> p; n p /= mint(100); n int delr = 1, delc = 1; n if (rb == rd || cb == cd) n k += mint(pp) * mint(p) * mint(moves), pp *= (1 - p); n moves++; n int initr = rb; n int initc = cb; n move(rb, delr, n); n move(cb, delc, m); n int initr1 = rb; n int initc1 = cb; n while (true) { n if (rb == rd || cb == cd) n k += mint(pp) * mint(p) * mint(moves), pp *= (1 - p); n moves++; n move(rb, delr, n); n move(cb, delc, m); n if (rb == initr && cb == initc && move1(rb, delr, n) == initr1 && n move1(cb, delc, m) == initc1) n break; n } n mint ans = mint(k + moves * pp) / mint(1 - pp); n cout << ans << n ; n moves = 0; n pp = 1; n k = 0; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int tc; n cin >> tc; n while (tc--) { n testCase(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, i, j, a, b, k; n vector > M; n cin >> n; n m = 5; n M.resize(m); n for (i = 0; i < m; i++) M[i].resize(m); n for (i = 0; i < n; i++) { n cin >> a >> b; n a--; n b--; n M[a][b] = M[b][a] = true; n } n for (i = 0; i < m - 2; i++) n for (j = i + 1; j < m - 1; j++) n for (k = j + 1; k < m; k++) n if (M[i][j] == M[i][k] && M[i][j] == M[j][k]) { n cout << WIN ; n return 0; n } n cout << FAIL ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int flag = 0; n char s[6][6]; n for (int i = 0; i < 4; i++) n for (int j = 0; j < 4; j++) cin >> s[i][j]; n for (int i = 0; i < 4; i++) { n if (flag) break; n for (int j = 0; j < 4; j++) { n if (s[i][j] == x && s[i][j + 1] == x && n (s[i][j + 2] == . || s[i][j - 1] == . )) { n cout << YES ; n flag = 1; n break; n } else if (s[i][j] == x && s[i][j + 1] == . && s[i][j + 2] == x ) { n cout << YES ; n flag = 1; n break; n } else if (s[i][j] == x && s[i + 1][j] == x && n (s[i + 2][j] == . || s[i - 1][j] == . )) { n cout << YES ; n flag = 1; n break; n } else if (s[i][j] == x && s[i + 1][j] == . && s[i + 2][j] == x ) { n cout << YES ; n flag = 1; n break; n } else if (s[i][j] == x && s[i + 1][j + 1] == x && n (s[i + 2][j + 2] == . || s[i - 1][j - 1] == . )) { n cout << YES ; n flag = 1; n break; n } else if (s[i][j] == x && s[i + 1][j + 1] == . && n s[i + 2][j + 2] == x ) { n cout << YES ; n flag = 1; n break; n } else if (s[i][j] == x && s[i + 1][j - 1] == x && n (s[i + 2][j - 2] == . || s[i - 1][j + 1] == . )) { n cout << YES ; n flag = 1; n break; n } else if (s[i][j] == x && s[i + 1][j - 1] == . && n s[i + 2][j - 2] == x ) { n cout << YES ; n flag = 1; n break; n } n } n } n if (!flag) cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n int main(void) { n int n, i; n scanf( %d , &n); n for (i = 1; i <= n; i++) { n if ((i % 2) != 0) { n printf( I hate ); n if (i == n) { n printf( it ); n break; n } n } else { n printf( I love ); n if (i == n) { n printf( it ); n break; n } n } n printf( that ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool IO_FILE = 0; n ifstream ifs( input.txt ); n ofstream ofs( output.txt ); n int main() { n if (IO_FILE) { n cin.rdbuf(ifs.rdbuf()); n cout.rdbuf(ofs.rdbuf()); n } n int n, m; n cin >> n >> m; n char *s = new char[m]; n bool res = 1; n char prev = E ; n for (int i = 0; i < n; i++) { n cin >> s; n char p = s[0]; n res = 1; n if (prev != E && p == prev) { n res = 0; n break; n } n for (int j = 1; j < m; j++) n if (!(res = s[j] == p)) break; n if (!res) break; n prev = p; n } n cout << (res ? YES : NO ); n } n "} +{"func_code_string": "#include n using namespace std; n vector d[2], f; n vector > nab; n int n, len = -1; n const int INF = 1 << 29; n int calc(vector &a, vector &b) { n vector c(a.size() + b.size() + 1); n for (int i = 0; i < b.size(); ++i) c[i] = b[i]; n for (int i = b.size(); i < c.size(); ++i) c[i + 1] = a[i - (int)b.size()]; n vector p(c.size()); n p[0] = 0; n for (int i = 1; i < p.size(); ++i) { n int j = p[i - 1]; n while (j > 0 && (c[i] != c[j] || i == b.size() || j == b.size())) n j = p[j - 1]; n if (c[i] == c[j] && !(i == b.size() || j == b.size())) j++; n p[i] = j; n } n return p[c.size() - 1]; n } n vector > p; n inline int suf(vector &a, int &l) { n int ans = 0; n for (int i = len - l; i < len; ++i) ans |= ((int)a[i] << (i + l - len)); n return ans; n } n inline int pref(vector &a, int &l) { n int ans = 0; n for (int i = 0; i < l; ++i) ans |= ((int)a[i] << i); n return ans; n } n int main() { n cin.sync_with_stdio(0); n cin >> n; n nab.resize(n); n d[0].resize(n + 1); n d[1].resize(n + 1); n string str; n for (int i = 0; i < n; ++i) { n cin >> str; n if (len == -1) len = str.size(); n nab[i].resize(len); n for (int j = 0; j < len; ++j) nab[i][j] = (str[j] == 0 ? 0 : 1); n } n p.resize(len + 1, vector(1 << len, -1)); n d[0][0] = d[1][0] = 0; n p[0][0] = 1; n vector f(n); n f[0] = len; n for (int i = 1; i < n; ++i) f[i] = f[i - 1] + len - calc(nab[i - 1], nab[i]); n int suffix[len + 1], prefix[len + 1]; n d[1][1] = d[0][1] = len; n int bestp, bestd, now; n for (int i = 2; i <= n; ++i) { n d[0][i] = min(d[0][i - 1], d[1][i - 1]) + f[i - 1] - f[i - 2]; n d[1][i] = INF; n for (int j = 1; j <= len; ++j) { n suffix[j] = suf(nab[i - 2], j); n prefix[j] = pref(nab[i - 1], j); n } n bestp = p[0][0]; n d[1][i] = d[1][bestp] + f[i - 2] - f[bestp - 1] + len; n for (int j = 1; j <= len; ++j) { n int &pp = p[j][prefix[j]]; n if (pp != -1) { n now = d[1][pp] + f[i - 2] - f[pp - 1] + len - j; n if (now < d[1][i]) { n d[1][i] = now; n bestp = pp; n } n } n } n if (d[1][i] < d[1][p[0][0]] + f[i - 1] - f[p[0][0] - 1]) p[0][0] = i; n for (int j = 1; j <= len; ++j) { n int &ps = p[j][suffix[j]]; n if (ps == -1 || (d[1][i] < d[1][ps] + f[i - 1] - f[ps - 1])) ps = i; n } n } n cout << min(d[1][n], d[0][n]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline void read(int &x) { n x = 0; n int f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n x *= f; n } n inline void judge() { n freopen( in.txt , r , stdin); n freopen( out.txt , w , stdout); n } n const int maxn = 200005; n int n, Q, s[maxn], m[maxn], t[maxn], l[maxn], r[maxn], R[maxn]; n set, int> > res; n namespace seg { n long long suma[maxn << 5], sumb[maxn << 5]; n int ls[maxn << 5], rs[maxn << 5], tot; n inline void update(int x) { n suma[x] = suma[ls[x]] + suma[rs[x]]; n sumb[x] = sumb[ls[x]] + sumb[rs[x]]; n } n inline void add(int x, int &y, int place, int va, int vb, int l, int r) { n y = ++tot; n suma[y] = suma[x]; n sumb[y] = sumb[x]; n ls[y] = ls[x]; n rs[y] = rs[x]; n suma[y] += va; n sumb[y] += vb; n if (l == r) { n return; n } n int md = (l + r) >> 1; n if (place <= md) n add(ls[x], ls[y], place, va, vb, l, md); n else n add(rs[x], rs[y], place, va, vb, md + 1, r); n } n inline long long queryA(int x, int l, int r, int lq, int rq) { n if (!x) return 0; n if (lq <= l && r <= rq) return suma[x]; n long long res = 0; n int md = (l + r) >> 1; n if (lq <= md) res += queryA(ls[x], l, md, lq, rq); n if (rq > md) res += queryA(rs[x], md + 1, r, lq, rq); n return res; n } n inline long long queryB(int x, int l, int r, int lq, int rq) { n if (!x) return 0; n if (lq <= l && r <= rq) return sumb[x]; n long long res = 0; n int md = (l + r) >> 1; n if (lq <= md) res += queryB(ls[x], l, md, lq, rq); n if (rq > md) res += queryB(rs[x], md + 1, r, lq, rq); n return res; n } n } // namespace seg n int qtot = 0; n int root[maxn]; n inline long long query(int l, int r, int tme) { n tme = min(tme, 99999); n return seg::queryA(root[r], 0, 100001, 0, tme) - n seg::queryA(root[l - 1], 0, 100001, 0, tme) + n 1ll * n (seg::queryB(root[r], 0, 100001, tme + 1, 100001) - n seg::queryB(root[l - 1], 0, 100001, tme + 1, 100001)) * n tme; n } n int main() { n read(n); n for (int i = (1); i <= (n); i++) read(s[i]), read(m[i]), read(R[i]); n for (int i = (1); i <= (n); i++) res.insert(make_pair(make_pair(i, i), -1)); n read(Q); n for (int i = (1); i <= (Q); i++) read(t[i]), read(l[i]), read(r[i]); n for (int i = (1); i <= (n); i++) { n if (R[i] == 0) { n seg::add(root[i - 1], root[i], 100001, 0, R[i], 0, 100001); n continue; n } n int t = floor((long double)m[i] / R[i] + 0.99999999); n assert(1ll * t * R[i] >= m[i]); n assert(1ll * (t - 1) * R[i] < m[i]); n seg::add(root[i - 1], root[i], t, m[i], R[i], 0, 100001); n } n for (int i = (1); i <= (Q); i++) { n long long ans = 0; n set, int> >::iterator it = n res.upper_bound(make_pair(make_pair(l[i], n + 1), 1)); n vector, int> >::iterator> rubi; n rubi.clear(); n it--; n if (it->first.first < l[i]) { n res.insert(make_pair(make_pair(it->first.first, l[i] - 1), it->second)); n } n int tmp1 = it->first.second, tmp2 = it->second; n res.erase(it); n res.insert(make_pair(make_pair(l[i], tmp1), tmp2)); n it = res.upper_bound(make_pair(make_pair(l[i], n + 1), 1)); n it--; n for (;;) { n if (it->second == -1) { n assert(it->first.first == it->first.second); n ans += min( n (long long)m[it->first.first], n (long long)s[it->first.first] + 1ll * R[it->first.first] * t[i]); n } else { n ans += query(it->first.first, min(it->first.second, r[i]), n t[i] - it->second); n long long res = 0; n } n rubi.push_back(it); n if (it->first.second > r[i]) { n res.insert( n make_pair(make_pair(r[i] + 1, it->first.second), it->second)); n break; n } n if (it->first.second == r[i]) break; n it++; n } n for (set, int> >::iterator x : rubi) res.erase(x); n res.insert(make_pair(make_pair(l[i], r[i]), t[i])); n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n n void solve(){ n int n; n cin >> n; n vector X; n vector Y; n int x,y; n for (int i = 0; i < n; i++){ n cin >> x >> y; n X.push_back(x); n Y.push_back(y); n } n sort(X.begin(),X.end()); n sort(Y.begin(),Y.end()); n int64_t res; n if (n%2 == 0){ n res = (X.at(n/2)-X.at(n/2-1)+1)*(Y.at(n/2)-Y.at(n/2-1)+1); n } else { n res = 1; n } n cout << res << endl; n return; n } n n int main() { n int t; n cin >> t; n while (t){ n solve(); n t--; n } n return 0; n }"} +{"func_code_string": "#include n using namespace std; n int main() { n int n, x0; n cin >> n >> x0; n int x = x0; n int a[n][2]; n for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1]; n int c = 0, d = 0; n for (int i = 0; i < n; i++) { n if (min(a[i][0], a[i][1]) > x) { n x = min(a[i][0], a[i][1]); n c++; n } else if (max(a[i][0], a[i][1]) < x) { n d++; n x = max(a[i][0], a[i][1]); n } n if (c > 0 && d > 0) break; n } n if (c > 0 && d > 0) n cout << -1 n ; n else { n c = 0; n for (int i = 0; i < n; i++) { n if (x >= min(a[i][0], a[i][1]) && x <= max(a[i][0], a[i][1])) c++; n } n if (c == n) n cout << abs(x - x0) << endl; n else n cout << -1 n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n void input() { n freopen( in.txt , r , stdin); n freopen( out.txt , w , stdout); n } n const int N = 1e6 + 10; n vector G[N]; n int in[N], n, cnt[3], vis[N]; n void dfs(int x, int flag) { n cnt[flag]++; n vis[x] = 1; n for (int i = 0; i < G[x].size(); i++) { n int u = G[x][i]; n if (vis[u]) continue; n dfs(u, (flag + 1) % 2); n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 1; i <= n - 1; i++) { n int u, v; n cin >> u >> v; n G[u].push_back(v); n G[v].push_back(u); n } n dfs(1, 1); n cout << min(cnt[0], cnt[1]) - 1 << n ; n return 0; n } n "} +{"func_code_string": "#include n #pragma warning(disable : 4996) n int main() { n int n, k; n scanf( %d %d , &n, &k); n int cnt = 0, a[100]; n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n } n for (int i = 0; i < n; i++) { n if (a[i] >= a[k - 1] && a[i] > 0) cnt++; n } n printf( %d , cnt); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n = 0; n vector v; n int flag[2010]; n int countt = 0; n int k = 0; n int maxt = 0; n int main() { n cin >> n; n cin >> k; n for (int i = 0; i < n; i++) { n int kari = 0; n cin >> kari; n v.push_back(kari); n if (i == 0) { n maxt = kari; n } else { n maxt = max(maxt, kari); n } n } n for (int i = 0; i < n; i++) { n for (int j = i + 1; j < n; j++) { n vector u; n vector d; n u.clear(); n d.clear(); n int sum = 0; n for (int jj = 0; jj < n; jj++) { n if (jj < i || j < jj) { n d.push_back(v[jj]); n } else { n sum += v[jj]; n u.push_back(v[jj]); n } n } n sort(u.begin(), u.end()); n sort(d.begin(), d.end()); n maxt = max(maxt, sum); n { n int ii = 0; n int jj = d.size() - 1; n for (; ii < u.size() && jj >= 0 && ii < k; ii++, jj--) { n sum -= u[ii]; n sum += d[jj]; n maxt = max(maxt, sum); n } n } n } n } n cout << maxt << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int64_t k = 0; n inline bool equals(string& s1, int64_t i1, int64_t j1, string& s2, int64_t i2, n int64_t j2) { n if (j1 != j2) { n return false; n } n auto x = j1; n for (int64_t i = 0; i < x; i++) { n if (s1[i1 + i] != s2[i2 + i]) { n return false; n } n } n return true; n } n bool equivilant(string& s1, int64_t i1, int64_t j1, string& s2, int64_t i2, n int64_t j2) { n if (equals(s1, i1, j1, s2, i2, j2)) { n return true; n } n if (j1 != j2 || j1 % 2 == 1) { n return false; n } n auto x = j1 / 2; n if (equivilant(s1, i1, x, s2, i2, x) && n equivilant(s1, i1 + x, x, s2, i2 + x, x)) { n return true; n } n if (equivilant(s1, i1, x, s2, i2 + x, x) && n equivilant(s1, i1 + x, x, s2, i2, x)) { n return true; n } n return false; n } n int main() { n ios::sync_with_stdio(false); n string s1; n cin >> s1; n string s2; n cin >> s2; n if (equivilant(s1, 0, s1.size(), s2, 0, s2.size())) { n cout << YES ; n } else { n cout << NO ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct QUERY { n int query, time, number; n }; n void update(vector > &tree, int v, int tl, int tr, int &pos, n int query, int value) { n if (pos < tl || pos > tr) return; n if (query == 1) n tree[v][value]++; n else if (query == 2) n tree[v][value]--; n if (tr != tl) { n update(tree, 2 * v, tl, (tr + tl) / 2, pos, query, value); n update(tree, 2 * v + 1, (tr + tl) / 2 + 1, tr, pos, query, value); n } n } n int sum(vector > &tree, int v, int tl, int tr, int i, int j, n int value) { n if (i > tr || j < tl) return 0; n if (i <= tl && j >= tr) return tree[v][value]; n int sum1 = sum(tree, 2 * v, tl, (tr + tl) / 2, i, j, value); n int sum2 = sum(tree, 2 * v + 1, (tr + tl) / 2 + 1, tr, i, j, value); n return sum1 + sum2; n } n int main() { n int n; n cin >> n; n vector a(n + 1); n vector num(n + 1); n vector t(n + 1); n for (int i = 1; i <= n; ++i) { n cin >> a[i].query >> a[i].time >> a[i].number; n num[i] = a[i].number; n t[i] = a[i].time; n } n sort(num.begin(), num.end()); n num.erase(unique(num.begin(), num.end()), num.end()); n sort(t.begin(), t.end()); n t.erase(unique(t.begin(), t.end()), t.end()); n map help; n for (unsigned int i = 1; i < num.size(); ++i) { n help.insert(make_pair(num[i], i)); n } n for (int i = 1; i <= n; ++i) { n a[i].number = help[a[i].number]; n } n help.clear(); n for (unsigned int i = 1; i < t.size(); ++i) { n help.insert(make_pair(t[i], i)); n } n for (int i = 1; i <= n; ++i) { n a[i].time = help[a[i].time]; n } n int len = t.size() - 1; n int tree_size = 4 * len; n vector > tree(tree_size); n for (int i = 1; i <= n; ++i) { n if (a[i].query != 3) n update(tree, 1, 1, len, a[i].time, a[i].query, a[i].number); n else n cout << sum(tree, 1, 1, len, 1, a[i].time, a[i].number) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100000 + 10; n int n; n int a[N]; n long long query(int l, int r) { n vector > stack; n long long ret = 0; n long long cur = 0; n for (int i = l + 1; i <= r; ++i) { n long long diff = abs(a[i] - a[i - 1]); n long long tot = 1; n for (; stack.size();) { n if (stack.back().first <= diff) { n tot += stack.back().second; n cur -= stack.back().first * stack.back().second; n stack.pop_back(); n } else { n break; n } n } n stack.push_back(make_pair(diff, tot)); n cur += diff * tot; n ret += cur; n } n return ret; n } n void solve() { n int q; n cin >> n >> q; n for (int i = 0; i < n; ++i) { n scanf( %d , a + i); n } n for (; q--;) { n int l, r; n scanf( %d%d , &l, &r); n --l, --r; n cout << query(l, r) << endl; n } n } n int main() { n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long s, k; n long long a[5000]; n long long ans[5000]; n int t; n int dfs(int n, int m) { n if (n == 0) { n if (t == 1) { n cout << 2 << endl; n cout << 0 << << ans[0] << endl; n } else { n cout << t << endl; n for (int i = t - 1; i >= 0; i--) cout << ans[i] << ; n cout << endl; n } n exit(0); n } n for (int i = m; i >= 0; i--) { n if (n >= a[i]) { n ans[t++] = a[i]; n dfs(n - a[i], i - 1); n t--; n } n } n } n int main() { n cin >> s >> k; n int m = 0; n a[0] = 1; n for (int i = 1; a[i - 1] < s; i++) { n for (int j = i - 1; j >= 0 && j >= i - k; j--) a[i] += a[j]; n m = i; n } n if (a[m] > s) m--; n dfs(s, m); n } n "} +{"func_code_string": "#include n int cmp(const void *a, const void *b) { return (*(int *)a - *(int *)b); } n long long int mod; n void f(long long int p) { n long long ans = 1, n = 3; n while (p) { n if (p & 1) ans = (ans * n) % mod; n n = (n * n) % mod; n p = p >> 1; n } n ans--; n while (ans < 0) ans += mod; n printf( %lld , ans); n } n int main() { n long long int n; n scanf( %lld%lld , &n, &mod); n f(n); n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:128777216 ) n const int null = 0; n using namespace std; n template n int size(const T &a) { n return int(a.size()); n } n template n T abs(const T &a) { n return (a < 0 ? -a : a); n } n template n T sqr(const T &a) { n return a * a; n } n const double pi = acos(-1.0); n const int max_n = 2048; n char s[max_n][max_n]; n struct Res { n int r, c; n int d; n int moves; n Res() { moves = -1; } n } dp[max_n][max_n]; n bool was[max_n][max_n]; n Res &calc(int r, int c, int d = -1) { n Res &res = dp[r][c]; n if (res.moves >= 0) { n return res; n } n if (was[r][c]) { n cout << -1 << endl; n exit(0); n } n was[r][c] = true; n switch (s[r][c]) { n case # : n res.moves = 0; n res.d = -1; n res.r = r; n res.c = c; n break; n case > : n res = calc(r, c + 1, 1); n res.moves++; n if (res.moves == 1) { n res.d = 1; n } n break; n case < : n res = calc(r, c - 1, 2); n res.moves++; n if (res.moves == 1) { n res.d = 2; n } n break; n case ^ : n res = calc(r - 1, c, 3); n res.moves++; n if (res.moves == 1) { n res.d = 3; n } n break; n case v : n res = calc(r + 1, c, 4); n res.moves++; n if (res.moves == 1) { n res.d = 4; n } n break; n } n return res; n } n int main() { n int n, m; n scanf( %d %d , &n, &m); n for (int i = 0; i < n; i++) { n scanf( %s , s[i]); n } n int res = 0; n Res best; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n Res cur = calc(i, j); n if (cur.moves > best.moves) { n best = cur; n } n } n } n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n Res cur = dp[i][j]; n if (cur.moves + best.moves > res && n (cur.d != best.d || cur.r != best.r || cur.c != best.c || n cur.moves != best.moves)) { n res = cur.moves + best.moves; n } n } n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int T, x; n char str[100005], ans[100005]; n char usd[100005]; n int main() { n scanf( %d , &T); n while (T--) { n scanf( %s , str + 1); n scanf( %d , &x); n int n = strlen(str + 1); n for (int i = 1; i <= n; ++i) { n if (str[i] == 0 ) { n if (i + x <= n) ans[i + x] = 0 ; n if (i - x >= 1) ans[i - x] = 0 ; n } n } n for (int i = 1; i <= n; ++i) n if (!ans[i]) ans[i] = 1 ; n for (int i = 1; i <= n; ++i) { n if (i - x >= 1 && ans[i - x] == 1 ) n usd[i] = 1 ; n else if (i + x <= n && ans[i + x] == 1 ) n usd[i] = 1 ; n else n usd[i] = 0 ; n } n bool flag = true; n for (int i = 1; i <= n; ++i) n if (usd[i] != str[i]) { n flag = false; n break; n } n if (!flag) n printf( -1 n ); n else n printf( %s n , ans + 1); n for (int i = 1; i <= n; ++i) ans[i] = 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 998244353; n signed main() { n cin.tie(0)->sync_with_stdio(0); n long long n, m; n cin >> n >> m; n vector pw(n + 1); n pw[0] = 1; n for (long long i = 1; i <= n; i++) pw[i] = 2 * pw[i - 1] % MOD; n long long _ = n; n vector basis; n for (long long i = 0; i < n; i++) { n long long a; n cin >> a; n for (auto x : basis) a = min(a, a ^ x); n if (a) { n long long id = 0; n while (id < (long long)basis.size() && basis[id] > a) ++id; n basis.insert(basis.begin() + id, a); n } n } n n = basis.size(); n vector ans(2 * m + 1, 0); n if (n <= 20) { n for (long long mask = 0; mask < (1ll << n); mask++) { n long long val = 0; n for (long long i = 0; i < n; i++) n if (mask & (1ll << i)) val ^= basis[i]; n ans[__builtin_popcountll(val)]++; n } n } else { n vector good(m); n for (auto x : basis) n for (long long i = m - 1; i >= 0; i--) n if (x & (1ll << i)) { n good[i] = 1; n break; n } n for (long long i = 0; i < n; i++) n for (long long j = i + 1; j < n; j++) n basis[i] = min(basis[i], basis[i] ^ basis[j]); n vector stuff(n, 0); n for (long long i = 0; i < n; i++) { n long long cnt = 0; n for (long long j = 0; j < m; j++) n if (!good[j]) { n if (basis[i] & (1ll << j)) stuff[i] += (1ll << cnt); n cnt++; n } n } n vector>> dp( n n, vector>(n + 1, n vector((1ll << (m - n)), 0))); n dp[0][1][stuff[0]] = dp[0][0][0] = 1; n for (long long i = 1; i < n; i++) n for (long long j = 0; j <= n; j++) n for (long long k = 0; k < (1ll << (m - n)); k++) { n dp[i][j][k] = dp[i - 1][j][k]; n if (j) dp[i][j][k] += dp[i - 1][j - 1][k ^ stuff[i]]; n } n for (long long i = 0; i <= n; i++) n for (long long j = 0; j < (1ll << (m - n)); j++) n ans[i + __builtin_popcount(j)] += dp[n - 1][i][j]; n } n for (long long i = 0; i <= m; i++) n cout << (ans[i] % MOD) * pw[_ - n] % MOD << ; n cout << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n scanf( %d , &t); n while (t--) { n int N; n scanf( %d , &N); n vector a(N + 1); n vector b(N + 1); n int sum = 0; n for (int i = 1; i <= N; ++i) { n scanf( %d , &a[i]); n sum += a[i]; n b[i] = a[i]; n } n if (sum % N != 0) { n printf( -1 n ); n continue; n } n vector> ans; n for (int i = 2; i <= N; ++i) { n if (a[i] % i == 0) { n b[i] -= a[i]; n b[1] += a[i]; n ans.push_back({i, 1, a[i] / i}); n } else { n int m = i - a[i] % i; n b[1] -= m; n b[i] += m; n ans.push_back({1, i, m}); n ans.push_back({i, 1, (a[i] + m) / i}); n b[i] -= (a[i] + m); n b[1] += (a[i] + m); n } n } n for (int i = 2; i <= N; ++i) { n b[1] -= sum / N; n b[i] += sum / N; n ans.push_back({1, i, sum / N}); n } n printf( %d n , (int)ans.size()); n for (vector& v : ans) { n printf( %d %d %d n , v[0], v[1], v[2]); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int a[200000]; n int b[200000]; n int c[200001]; n int t[200001]; n vector x; n vector ans; n int add(int r, int cr, int d) { n if (c[r] == t[r]) cr--; n t[r] += d; n if (c[r] == t[r]) cr++; n return cr; n } n int main() { n int n, m, p, i, j; n scanf( %d %d %d , &n, &m, &p); n for (i = 0; i < n; i++) scanf( %d , &a[i]); n for (i = 0; i < m; i++) { n scanf( %d , &b[i]); n x.push_back(b[i]); n } n x.push_back(1000000001); n sort(x.begin(), x.end()); n x.erase(unique(x.begin(), x.end()), x.end()); n int k = x.size(); n for (i = 0; i < n; i++) { n int pos = lower_bound(x.begin(), x.end(), a[i]) - x.begin(); n if (a[i] == x[pos]) n a[i] = pos; n else n a[i] = k - 1; n } n for (i = 0; i < k; i++) { n c[i] = 0; n t[i] = 0; n } n for (i = 0; i < m; i++) { n int pos = lower_bound(x.begin(), x.end(), b[i]) - x.begin(); n c[pos]++; n } n int cr = 1; n long long d = (long long)p * (m - 1); n for (i = 0; i < p; i++) { n if (i + d >= n) continue; n for (j = 0; j < m; j++) cr = add(a[i + p * j], cr, 1); n if (cr == k) ans.push_back(i); n j = i + p * m; n while (j < n) { n cr = add(a[j], cr, 1); n cr = add(a[j - p * m], cr, -1); n if (cr == k) ans.push_back(j - p * (m - 1)); n j += p; n } n int l = j - p; n for (j = 0; j < m; j++) cr = add(a[l - p * j], cr, -1); n } n sort(ans.begin(), ans.end()); n printf( %d n , ans.size()); n for (i = 0; i < ans.size(); i++) printf( %d , ans[i] + 1); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n class Counter { n public: n Counter(std::vector perm1, std::vector perm2) n : size_(perm1.size()) { n std::vector inv2(size_, 0); n for (size_t i = 0; i < size_; ++i) { n inv2[perm2[i]] = i; n } n auto& points = perm1; n for (size_t x = 0; x < size_; ++x) { n points[x] = inv2[perm1[x]]; n } n size_t nextPowOfTwo = 1; n while (nextPowOfTwo < size_) nextPowOfTwo <<= 1; n segTree_.resize(2 * nextPowOfTwo - 1); n build(points, 0, 0, size_ - 1); n } n int count(size_t minX, size_t maxX, size_t minY, size_t maxY) { n return countAux(0, 0, size_ - 1, minX, maxX, minY, maxY); n } n n private: n void build(const std::vector& points, int vertex, int from, int to) { n if (from == to) { n segTree_[vertex].push_back(points[from]); n } else { n int middle = from + (to + 1 - from) / 2; n build(points, 2 * vertex + 1, from, middle - 1); n build(points, 2 * vertex + 2, middle, to); n const auto& left = segTree_[2 * vertex + 1]; n const auto& right = segTree_[2 * vertex + 2]; n segTree_[vertex].reserve(left.size() + right.size()); n std::merge(left.begin(), left.end(), right.begin(), right.end(), n std::back_inserter(segTree_[vertex])); n } n } n int countAux(int vertex, int from, int to, int minX, int maxX, int minY, n int maxY) { n if (maxX < minX) { n return 0; n } n if (from == minX && to == maxX) { n const auto& range = segTree_[vertex]; n auto it1 = std::lower_bound(range.begin(), range.end(), minY); n auto it2 = std::lower_bound(range.begin(), range.end(), maxY + 1); n return it2 - it1; n } n int middle = from + (to + 1 - from) / 2; n int countLeft = countAux(2 * vertex + 1, from, middle - 1, minX, n std::min(maxX, middle - 1), minY, maxY); n int countRight = countAux(2 * vertex + 2, middle, to, n std::max(minX, middle), maxX, minY, maxY); n return countLeft + countRight; n } n n private: n size_t size_; n std::vector> segTree_; n }; n int main() { n size_t size; n ::scanf( %lu , &size); n auto readPerm = [](size_t size) { n std::vector perm; n perm.reserve(size); n for (size_t i = 0; i < size; ++i) { n size_t elem; n ::scanf( %lu , &elem); n --elem; n perm.push_back(elem); n } n return perm; n }; n auto perm1 = readPerm(size); n auto perm2 = readPerm(size); n Counter counter(std::move(perm1), std::move(perm2)); n size_t nQueries; n ::scanf( %lu , &nQueries); n size_t x = 0; n auto f = [&](size_t z) { return (z + x - 1) % size; }; n for (size_t i = 0; i < nQueries; ++i) { n size_t a, b, c, d; n ::scanf( %lu %lu %lu %lu , &a, &b, &c, &d); n size_t count = counter.count(std::min(f(a), f(b)), std::max(f(a), f(b)), n std::min(f(c), f(d)), std::max(f(c), f(d))); n std::cout << count << n ; n x = count + 1; n } n } n "} +{"func_code_string": "#include n const long long N = 3000006; n using namespace std; n const long long MOD = 1000000007LL; n template n T gcd(T a, T b) { n if (a == 0) return b; n return gcd(b % a, a); n } n template n T power(T x, T y, long long m = MOD) { n T ans = 1; n while (y > 0) { n if (y & 1LL) ans = (ans * x) % m; n y >>= 1LL; n x = (x * x) % m; n } n return ans % m; n } n long long prime[N]; n long long a[N], f[N]; n int32_t main() { n memset(prime, 1, sizeof(prime)); n prime[1] = 0; n for (long long i = 2; i < N; i++) { n if (!prime[i]) continue; n for (long long j = i * i; j < N; j += i) prime[j] = 0; n } n long long n; n cin >> n; n for (long long(i) = (0); i < (n); i++) { n cin >> a[i]; n ++f[a[i]]; n } n long long maxi = 0; n if (n == 1) { n cout << 1 << n ; n cout << a[0]; n return 0; n } n for (long long(i) = (0); i < (n); i++) { n if (a[i] == 1) continue; n if (prime[a[i] + 1] && f[1]) { n cout << f[1] + 1 << n ; n for (long long(i) = (0); i < (f[1]); i++) cout << 1 ; n cout << a[i]; n return 0; n } n } n if (f[1] >= 2) { n cout << f[1] << n ; n for (long long(i) = (0); i < (f[1]); i++) cout << 1 ; n return 0; n } n for (long long(i) = (0); i < (n - 1); i++) { n for (long long(j) = (i + 1); j < (n); j++) { n if (prime[a[i] + a[j]]) { n cout << 2 << n ; n cout << a[i] << << a[j]; n return 0; n } n } n } n cout << 1 << n ; n cout << a[0]; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 2e5 + 9; n char s[MAXN]; n map mp; n int main(int argc, char const *argv[]) { n int n, m; n scanf( %d%d , &n, &m); n scanf( %s , s); n int present = 0; n for (int i = 0; i < n; i++) { n present |= (1 << (s[i] - a )); n } n for (char c = a ; c <= z ; c++) n if (present & (1 << (c - a ))) { n mp[c] = c; n } n char one, two; n for (int i = 0; i < m; i++) { n scanf( %c %c , &one, &two); n if (one == two) { n continue; n } n for (auto &it : mp) { n if (it.second == one) n it.second = two; n else if (it.second == two) n it.second = one; n } n } n for (int i = 0; i < n; i++) n if (mp.count(s[i])) { n s[i] = mp[s[i]]; n } n puts(s); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MX = (int)1e6 + 17; n const int MOD = (int)1e9 + 7; n const long long oo = (long long)1e18 + 7; n const int INF = (int)999999999; n const int N = (int)1e5 + 17; n const int di[4] = {-1, 0, 1, 0}; n const int dj[4] = {0, 1, 0, -1}; n inline long long IN() { n long long x = 0, ch = getchar(), f = 1; n while (!isdigit(ch) && (ch != - ) && (ch != EOF)) ch = getchar(); n if (ch == - ) { n f = -1; n ch = getchar(); n } n while (isdigit(ch)) { n x = (x << 1) + (x << 3) + ch - 0 ; n ch = getchar(); n } n return x * f; n } n inline void OUT(long long x) { n if (x < 0) putchar( - ), x = -x; n if (x >= 10) n OUT(x / 10), putchar(x % 10 + 0 ); n else n putchar(x + 0 ); n } n double d, h, v, e, ans; n int main() { n cin >> d >> h >> v >> e; n ans = e - ((4 * v) / n (3.14159265358979323846264338327950288419716939937510 * d * d)); n h = -h; n if (ans > -1e4 && ans < 0) n cout << YES << endl << fixed << setprecision(10) << (h / ans); n else n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, k, x = -1, m, j = 0; n cin >> n; n cin >> k; n if (k == 2) { n x = 1; n } n if (k == 1) { n x = 0; n } n if (k == 0) { n j++; n } n for (int i = 1; i < n; i++) { n cin >> k; n if (k == 0) { n j++; n x = -1; n } else { n if (x == -1 and k == 3) { n } else { n if (k == 3) { n x = ((x - 1) % 2 + 2) % 2; n } else { n if (k - 1 == x) { n j++; n x = -1; n } else { n x = k - 1; n } n } n } n } n } n cout << j; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC target( n avx,avx2,fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n using namespace std; n long long MOD = 1e9 + 7; n int main() { n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0), n cout << fixed << setprecision(20); n long long t; n cin >> t; n while (t--) { n long long n, p; n cin >> n >> p; n vector > ans; n for (int i = 0; i < 2 * n + p; i++) { n ans.push_back({i % n, (i + i / n + 1) % n}); n } n for (auto i : ans) { n cout << i.first + 1 << << i.second + 1 << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n struct scroll { n int pow; n int dmg; n int loc; n bool operator<(const scroll& a) const { n if (dmg > a.dmg) n return true; n else if (dmg == a.dmg && pow < a.pow) n return true; n else n return false; n } n }; n struct used_scrollr { n int num; n int time; n bool operator<(const used_scrollr& a) const { return time < a.time; } n }; n int main() { n int N, max, reg; n scanf( %d%d%d , &N, &max, ®); n scroll ary[N]; n bool used_scroll[N]; n int used_time[N]; n for (int i = 0; i < N; ++i) { n int x, y; n scanf( %d%d , &x, &y); n ary[i] = (scroll){x, y, i + 1}; n used_scroll[i] = false; n } n sort(ary, ary + N); n int time = 0; n int used_scrolls = 0; n int current_hp = max; n int drain = 0; n while (true) { n current_hp -= drain; n if (current_hp + reg < max) n current_hp += reg; n else n current_hp = max; n if (current_hp <= 0) { n time++; n break; n } n bool used_a_scroll = false; n for (int i = 0; i < N; ++i) { n if (used_scroll[i] == false && n (((current_hp * 100) / max) + n ((current_hp * 100) % max == 0 ? 0 : 1) <= n ary[i].pow)) { n used_time[i] = time; n drain += ary[i].dmg; n used_scroll[i] = true; n used_scrolls++; n used_a_scroll = true; n break; n } n } n if ((reg - drain) >= 0 && used_a_scroll == false) break; n time++; n } n if (current_hp <= 0) { n printf( YES n ); n printf( %d %d n , time - 1, used_scrolls); n used_scrollr ary2[used_scrolls]; n int cnt = 0; n for (int i = 0; i < N; ++i) n if (used_scroll[i]) n ary2[cnt++] = (used_scrollr){ary[i].loc, used_time[i]}; n sort(ary2, ary2 + used_scrolls); n for (int i = 0; i < used_scrolls; ++i) n printf( %d %d n , ary2[i].time, ary2[i].num); n } else { n printf( NO n ); n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long MAXN = 100000; n const long long oops = 1LL << 60; n class Ball { n public: n long long value, color; n } arr[MAXN + 5]; n long long colorBest[MAXN + 5]; n long long n; n void addToTopTwo(vector >& toptwo, long long best, n long long color) { n if (toptwo.size() != 2) n toptwo.push_back(make_pair(best, color)); n else { n long long c, c2; n bool khalas = 0; n for (c = 0; c < 2; c++) n if (toptwo[c].second == color) { n toptwo[c].first = max(toptwo[c].first, best); n khalas = 1; n } n if (!khalas) { n if (toptwo[0].first > toptwo[1].first) { n if (toptwo[1].first < best) toptwo[1] = make_pair(best, color); n } else { n if (toptwo[0].first < best) toptwo[0] = make_pair(best, color); n } n } n } n return; n } n int main() { n long long c, c2; n long long qs; n scanf( %I64d%I64d , &n, &qs); n for (c = 0; c < n; c++) scanf( %I64d , &arr[c].value); n for (c = 0; c < n; c++) scanf( %I64d , &arr[c].color); n for (long long loops = 0; loops < qs; loops++) { n for (c = 0; c <= n; c++) { n colorBest[c] = -oops; n } n long long a, b; n scanf( %I64d%I64d , &a, &b); n long long ret = -oops; n vector > toptwo; n for (c = 0; c < n; c++) { n long long best = b * (long long)arr[c].value; n if (colorBest[arr[c].color] != -oops) n best = max(best, colorBest[arr[c].color] + a * (long long)arr[c].value); n for (c2 = 0; c2 < toptwo.size(); c2++) n if (toptwo[c2].second != arr[c].color) n best = max(best, toptwo[c2].first + b * (long long)arr[c].value); n colorBest[arr[c].color] = max(colorBest[arr[c].color], best); n addToTopTwo(toptwo, best, arr[c].color); n ret = max(ret, best); n } n printf( %I64d n , max(ret, 0LL)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void adskiy_razgon() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n } n const int mxN = 1e+9 + 7; n const long long INF = 1e+18 + 7; n long long nod(long long a, long long b) { n if (b > a) { n swap(a, b); n } n while (b > 0) { n a %= b; n swap(a, b); n } n return a; n } n long long nok(long long a, long long b) { return a * b / nod(a, b); } n void sp(long long a, double b) { cout << fixed << setprecision(a) << b; } n long long binpow(long long a, long long n) { n if (n == 0) { n return 1; n } n if (n % 2 == 1) { n return binpow(a, n - 1) * a; n } else { n long long b = binpow(a, n / 2); n return b * b; n } n } n void solve() { n int n, m, t; n cin >> n >> m >> t; n cout << ((n - m) * t + m - 1) / m; n } n int main() { n adskiy_razgon(); n long long t = 1; n for (int i = 1; i <= t; ++i) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n class SegmentTree { n private: n vector aint; n vector lazy; n n public: n SegmentTree(int n) { n aint.resize(1 + 4 * n); n lazy.resize(1 + 4 * n); n } n void cleannode(int node, int from, int to) { n int mid = (from + to) / 2; n if (from < to) { n lazy[node * 2] += lazy[node]; n lazy[node * 2 + 1] += lazy[node]; n } n aint[node] = aint[node] + lazy[node]; n lazy[node] = 0; n } n void computenode(int node, int from, int to) { n if (from < to) { n int mid = (from + to) / 2; n aint[node] = max(aint[node * 2], aint[node * 2 + 1]); n } n } n void update(int node, int from, int to, int x, int y, ll val) { n cleannode(node, from, to); n if (from == x && to == y) { n lazy[node] += val; n cleannode(node, from, to); n } else { n int mid = (from + to) / 2; n cleannode(node * 2, from, mid); n cleannode(node * 2 + 1, mid + 1, to); n if (x <= mid) n update(node * 2, from, mid, x, (((mid) < (y)) ? (mid) : (y)), val); n if (mid + 1 <= y) n update(node * 2 + 1, mid + 1, to, (((mid + 1) < (x)) ? (x) : (mid + 1)), n y, val); n computenode(node, from, to); n } n } n ll query(int node, int from, int to, int x, int y) { n cleannode(node, from, to); n if (from == x && to == y) n return aint[node]; n else { n int mid = (from + to) / 2; n if (x <= mid && y <= mid) n return query(node * 2, from, mid, x, y); n else if (mid + 1 <= x && mid + 1 <= y) n return query(node * 2 + 1, mid + 1, to, x, y); n else n return max(query(node * 2, from, mid, x, mid), n query(node * 2 + 1, mid + 1, to, mid + 1, y)); n } n } n }; n int const nmax = 200000; n int v[1 + nmax]; n vector> g[1 + nmax]; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, m; n cin >> n >> m; n for (int i = 1; i <= n; i++) cin >> v[i]; n for (int i = 1; i <= m; i++) { n int x, y, cost; n cin >> x >> y >> cost; n g[y].push_back({x, cost}); n } n SegmentTree aint(n); n for (int i = 1; i <= n; i++) { n ll result = aint.query(1, 0, n, 0, i - 1); n aint.update(1, 0, n, i, i, result); n aint.update(1, 0, n, 0, i - 1, -v[i]); n for (int h = 0; h < g[i].size(); h++) { n int x = g[i][h].first, cost = g[i][h].second; n aint.update(1, 0, n, 0, x - 1, cost); n } n } n cout << aint.query(1, 0, n, 0, n); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 333; n int main() { n int n, a1, a2, a3, b1, b2, b3; n cin >> n >> a1 >> b1 >> a2 >> b2 >> a3 >> b3; n int c1 = b1, c2 = b2, c3 = b3; n while (c1 + c2 + c3 > n) { n if (c3 > a3) n c3--; n else if (c2 > a2) n c2--; n else if (c1 > a1) n c1--; n } n cout << c1 << << c2 << << c3 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k, i; n cin >> n >> k; n vector> v; n vector inp, p; n vector::iterator it; n map m; n for (i = 0; i < n; i++) { n long long x; n cin >> x; n v.push_back(make_pair(x, 0)); n inp.push_back(x); n } n for (i = 0; i < n; i++) cin >> v[i].second; n sort(v.begin(), v.end()); n int t = 0, u = 0; n long long sum = 0; n for (i = 0; i < n; i++) { n if (t < k) { n for (it = p.begin(); it != p.end(); it++) { n if (v[i].second >= *it) { n p.insert(it, v[i].second); n t++; n break; n } n } n if (it == p.end()) { n p.push_back(v[i].second); n t++; n } n sum += v[i].second; n m[v[i].first] = sum; n } else { n if (u == 1) { n for (it = p.begin(); it != p.end(); it++) { n if (v[i - 1].second >= *it) { n p.insert(it, v[i - 1].second); n sum += v[i - 1].second; n sum -= p.back(); n p.pop_back(); n break; n } n } n } n m[v[i].first] = sum + v[i].second; n if (u == 0) u = 1; n } n } n for (i = 0; i < n; i++) { n cout << m[inp[i]] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector pref_sum_a; n vector pref_sum_b; n signed main() { n long long n; n cin >> n; n if (n == 2) { n cout << 3 << endl; n cout << 2 << << 1 << << 2 << endl; n } n if (n == 3) { n cout << 4 << endl; n cout << 2 << << 1 << << 3 << << 2 << endl; n } n if (n == 4) { n cout << 6 << endl; n cout << 1 << << 3 << << 2 << << 4 << << 1 << << 3 n << endl; n } n if (n > 4) { n cout << n + n / 2 << endl; n for (long long t = 2; t <= n; t += 2) { n cout << t << ; n } n for (long long g = 1; g <= n; g += 2) { n cout << g << ; n } n for (long long t = 2; t <= n; t += 2) { n cout << t << ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int64_t exp(int64_t a, int64_t b) { n if (b == 0) return 1; n int64_t c = exp(a, b / 2); n c = c * c; n if (b % 2 == 1) c = c * a; n return c; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n; n cin >> n; n int64_t ans = 0; n for (int i = 0; i < n; i++) { n int64_t k, a; n cin >> k >> a; n if (a == 1) { n ans = max(ans, k + 1); n continue; n } n int64_t x = 0; n for (int64_t b = 16; b >= 1; b /= 2) { n while (exp(4, b + x) < a) x += b; n } n ans = max(ans, k + x + 1); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 100 * 1000 + 5; n const int INF = 1000 * 1000 * 1000 + 7; n const long long LINF = 1LL * INF * INF; n const int MOD = INF; n const double PI = acos(-1.); n int main() { n ios_base::sync_with_stdio(0); n int n, p; n cin >> n >> p; n int ans = INF; n for (int k = (1); k < (200); ++k) { n long long tmp = n - k * p; n long long x = tmp; n if (tmp < 0) continue; n int cnt = 0; n while (tmp) { n cnt += tmp % 2; n tmp /= 2; n } n if (cnt <= k && k <= x) ans = min(ans, k); n } n if (ans == INF) ans = -1; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int get_index(int i, int j, int k) { return i * 4 + j * 2 + k; } n int diff(int i, int j) { return i != j; } n pair input() { n int n; n cin >> n; n string s; n cin >> s; n return make_pair(n, s); n } n int work2(int n, string s) { n int first_diff = 1; n for (; first_diff < n; first_diff++) { n if (s[first_diff - 1] != s[first_diff]) break; n } n if (first_diff == n) return (n + 2) / 3; n s = s.substr(first_diff, n - first_diff) + s.substr(0, first_diff); n int start = 0; n int ans = 0; n for (int i = 1; i < n; i++) { n if (s[i] != s[i - 1]) { n ans += (i - start) / 3; n start = i; n } n } n ans += (n - start) / 3; n return ans; n } n void work() { n pair in = input(); n int n = in.first; n string s = in.second; n cout << work2(n, s) << endl; n } n int main() { n int t; n cin >> t; n while (t--) { n work(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k, s; n cin >> n; n vector x(n); n for (int i = 0; i < n; i++) cin >> x[i]; n sort(x.begin(), x.end()); n k = n / 2; n s = x[k] - x[0]; n for (int i = 1; i < n - k; i++) { n s = min(s, x[k + i] - x[i]); n } n cout << s; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n; n cin >> n; n long long cnt[1001] = {}; n for (long long i = 0; i < n; ++i) { n long long x; n cin >> x; n cnt[x]++; n if (cnt[x] > (n + 1) / 2) { n cout << NO ; n return 0; n } n } n cout << YES ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 0x3ffffffffffff; n int main() { n long long T; n scanf( %lld , &T); n while (T--) { n long long k, n, a, b; n scanf( %lld%lld%lld%lld , &k, &n, &a, &b); n k -= b * n; n if (k <= 0) n printf( -1 n ); n else n printf( %lld n , min(n, (k - 1) / (a - b))); n } n } n "} +{"func_code_string": "#include n using namespace std; n int dij[4444][4444]; n int x[4444], y[4444]; n int num[4444]; n int main(void) { n int n, m; n scanf( %d%d , &n, &m); n for (int i = 0; i < m; i++) { n scanf( %d%d , &x[i], &y[i]); n dij[x[i]][y[i]] = dij[y[i]][x[i]] = 1; n num[x[i]]++; n num[y[i]]++; n } n int flag = 0; n int ans = 99999999; n for (int i = 0; i < m; i++) { n for (int j = 1; j <= n; j++) { n if (dij[x[i]][j] && dij[j][y[i]]) { n if (ans > num[x[i]] + num[j] + num[y[i]]) { n ans = num[x[i]] + num[j] + num[y[i]]; n flag = 1; n } n } n } n } n if (flag == 0) { n puts( -1 ); n return 0; n } else n printf( %d n , ans - 6); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n vector atk, def, ciel; n for (int i = 0; i < n; i++) { n string s; n int x; n cin >> s >> x; n if (s == ATK ) n atk.push_back(x); n else n def.push_back(x); n } n for (int i = 0; i < m; i++) { n int x; n cin >> x; n ciel.push_back(x); n } n sort(atk.begin(), atk.end()); n sort(def.begin(), def.end()); n sort(ciel.begin(), ciel.end()); n int flag = 1; n if (n >= m) flag = 0; n int ans = 0, i = m - 1, j = 0, sum = 0; n while (i >= 0 && j < atk.size()) { n if (atk[j] > ciel[i]) { n break; n } n sum += max(0, ciel[i] - atk[j]); n ans = max(ans, sum); n i--; n j++; n } n i = m - 1; n j = def.size() - 1; n int ans1 = 0, ans2 = 0; n while (i >= 0 && j >= 0) { n if (ciel[i] <= def[j]) { n flag = 0; n break; n } n i--; n j--; n } n i = 0; n vector temp; n if (flag) { n j = 0; n while (i < m && j < def.size()) { n while (ciel[i] <= def[j]) { n temp.push_back(ciel[i]); n i++; n if (i == m) break; n } n i++; n j++; n } n } n while (i < m) { n temp.push_back(ciel[i]); n i++; n } n j = 0; n i = 0; n sum = 0; n int flag2 = 1; n int ans3 = 0; n while (i < temp.size() && j < atk.size()) { n while (temp[i] < atk[j]) { n ans3 += temp[i]; n i++; n if (i == temp.size()) break; n } n if (i == temp.size()) break; n ans1 += temp[i] - atk[j]; n i++; n j++; n } n while (i < temp.size()) { n ans3 += temp[i]; n i++; n } n if (flag && j == atk.size()) ans1 += ans3; n i = temp.size() - 1; n j = 0; n while (i >= 0 && j < atk.size()) { n if (atk[j] > temp[i]) { n flag2 = 0; n break; n } n sum += max(0, temp[i] - atk[j]); n ans2 = max(ans2, sum); n i--; n j++; n } n if (flag2 && flag) { n while (i >= 0) { n ans2 += temp[i]; n i--; n } n } n cout << max(ans1, ans) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const string pocetno = 0000000000 ; n const string oznake = RGBYW ; n const int maxn = 105; n int N, razlicite, sol = maxn * maxn; n vector > V; n set S; n void rijesi() { n for (int maska = 0; maska < (1 << 10) + 1; maska++) { n S.clear(); n int tmp = 0; n for (int i = 0; i < 10; i++) n if (maska & (1 << i)) tmp++; n for (int i = 0; i < N; i++) { n string stanje = pocetno; n for (int j = 0; j < 5; j++) { n if (maska & (1 << j) && V[i].first == j) stanje[j] = 1 ; n if (maska & (1 << (j + 5)) && V[i].second == j) stanje[j + 5] = 1 ; n } n S.insert(stanje); n } n if (S.size() == razlicite) sol = min(sol, tmp); n } n printf( %d n , sol); n } n void ucitaj() { n scanf( %d , &N); n for (int i = 0; i < N; i++) { n string s; n cin >> s; n V.push_back(make_pair(oznake.find(s[0]), s[1] - 0 - 1)); n S.insert(s); n } n razlicite = S.size(); n } n int main(void) { n ucitaj(); n rijesi(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int fx[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; n const int fxx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, n {1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; n template n ostream& operator<<(ostream& s, pair t) { n return s << ( << t.first << , << t.second << ) ; n } n template n ostream& operator<<(ostream& s, vector t) { n for (int i = 0; i < ((int)(t.size())); i++) n s << t[i] << (i == ((int)(t.size())) - 1 ? n : ); n return s; n } n int start, finish, mid; n string answer; n int main() { n cin >> answer; n while (answer == start ) { n start = 0; n finish = 1; n while (true) { n cout << ? << start << << finish << endl; n cin >> answer; n if (answer == x ) { n break; n } n start = finish; n finish <<= 1; n } n while (start < finish - 1) { n mid = (start + finish + 1) >> 1; n cout << ? << start << << mid << endl; n cin >> answer; n if (answer[0] == x ) n finish = mid; n else n start = mid; n } n cout << ! << finish << endl; n cin >> answer; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector v(2 << n); n int size = 2 << n; n for (int i = (2); i < (int)(size); ++i) cin >> v[i]; n int ans = 0; n for (int i = size - 1; i >= 2; i -= 2) { n v[i / 2] += max(v[i], v[i - 1]); n ans += abs(v[i] - v[i - 1]); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, A, B, C, T; n int temp[1005]; n int main() { n cin >> n >> A >> B >> C >> T; n long long ans = 0; n for (int i = 1; i <= n; i++) cin >> temp[i]; n ans = n * A; n if (C > B) { n for (int i = 1; i <= n; i++) ans += (C - B) * (T - temp[i]); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100100; n const long long MOD = 1000000007; n const double EBS = 1e-7; n int dX[] = {0, 0, 1, -1}; n int dY[] = {1, -1, 0, 0}; n long long GCD(long long num, long long ones) { n return !ones ? num : GCD(ones, num % ones); n } n const int L = 17; n vector adj[N]; n vector Root; n vector level[N]; n int depth[N], ID[N], rID[N], dp[L + 1][N], currID = 1, n, m, k, WantedNode; n void dfs(int cur, int par) { n dp[0][cur] = par; n ID[cur] = currID++; n rID[ID[cur]] = cur; n level[depth[cur]].push_back(ID[cur]); n for (auto x : adj[cur]) n if (x != par) depth[x] = depth[cur] + 1, dfs(x, cur); n } n inline int getKthAncestor(int u, int k) { n int d = depth[u] - k; n for (int j = L; j >= 0; --j) { n int nu = dp[j][u]; n if (!nu) continue; n if (depth[nu] == d) n return nu; n else if (depth[nu] > d) n u = nu; n } n return 0; n } n inline int BSL(int d) { n int l = 0, r = (level[d].size()) - 1, mid; n while (l < r) { n mid = l + (r - l) / 2; n int node = getKthAncestor(rID[level[d][mid]], k); n node = ID[node]; n if (node >= WantedNode) n r = mid; n else n l = mid + 1; n } n return r; n } n inline int BSR(int d) { n int l = 0, r = (level[d].size()) - 1, mid; n while (l < r) { n mid = l + (r - l + 1) / 2; n int node = getKthAncestor(rID[level[d][mid]], k); n node = ID[node]; n if (node <= WantedNode) n l = mid; n else n r = mid - 1; n } n return l; n } n int main() { n scanf( %d , &n); n int p, v; n for (int i = 0; i < n; ++i) { n scanf( %d , &p); n if (p) n adj[p].push_back(i + 1), adj[i + 1].push_back(p); n else n Root.push_back(i + 1); n } n for (auto x : Root) dfs(x, 0); n for (int j = 1; j <= L; ++j) n for (int i = 0; i < N; ++i) n dp[j][i] = (dp[j - 1][i] == -1 ? -1 : dp[j - 1][dp[j - 1][i]]); n scanf( %d , &m); n while (m--) { n scanf( %d , &v); n scanf( %d , &k); n WantedNode = getKthAncestor(v, k); n if (WantedNode) { n WantedNode = ID[WantedNode]; n printf( %d , BSR(depth[v]) - BSL(depth[v])); n } else n printf( 0 ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N, M; n long long Ans; n struct rec { n int w, h, s, k; n rec() {} n rec(int a, int b, int c, int i) { n w = a; n h = b; n s = c; n k = i; n } n } P[1010], Q[1010]; n int vis[1010]; n bool cmp_h(const rec &a, const rec &b) { return a.h > b.h; } n bool cmp_s(const rec &a, const rec &b) { return a.s > b.s; } n long long sumw(int maxh) { n long long sum = 0; n int cnt = 0; n for (int i = 1; i <= N; ++i) { n if (P[i].h <= maxh) break; n int s = 1e10; n if (P[i].w <= maxh && cnt < M) { n ++cnt; n vis[P[i].k] = maxh; n s = P[i].h; n } n sum += s; n } n for (int i = 1; i <= N; ++i) n if (vis[Q[i].k] != maxh) { n int s = Q[i].w; n if (Q[i].w <= maxh && cnt < M && s > Q[i].h) { n ++cnt; n vis[Q[i].k] = maxh; n s = Q[i].h; n } n sum += s; n } n return sum; n } n int main() { n scanf( %d , &N); n M = N / 2; n for (int i = 1; i <= N; ++i) { n int w, h; n scanf( %d%d , &w, &h); n Q[i] = P[i] = rec(w, h, w - h, i); n } n sort(P + 1, P + N + 1, cmp_h); n sort(Q + 1, Q + N + 1, cmp_s); n Ans = 1e9; n for (int hi = 1; hi <= 1000; ++hi) { n Ans = min(Ans, (long long)hi * sumw(hi)); n } n printf( %lld n , Ans); n } n "} +{"func_code_string": "#include n using namespace std; n inline int read() { n int ans = 0; n char ch = getchar(); n while (!isdigit(ch)) { n ch = getchar(); n } n while (isdigit(ch)) { n ans = (ans << 3) + (ans << 1) + (ch ^ 48), ch = getchar(); n } n ans = ans + 0 + 0; n return ans; n } n int first[100005], n, cnt, dep[100005]; n double ans = 0; n struct edge { n int v, next; n } e[100005 << 1]; n inline void add(int u, int v) { n e[++cnt].v = v, e[cnt].next = first[u], first[u] = cnt; n } n inline void dfs(int p, int fa) { n for (int i = first[p]; i; i = e[i].next) { n int v = e[i].v; n if (v == fa) continue; n dep[v] = dep[p] + 1, dfs(v, p); n } n } n int main() { n n = read(); n for (int i = 1; i < n; ++i) { n int u = read(), v = read(); n add(u, v), add(v, u); n } n dep[1] = 1, dfs(1, 1); n for (int i = 1; i <= n; ++i) ans += 1.0 / (1.0 * dep[i]); n printf( %.20lf , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n int n; n cin >> n; n vector answer; n if (n == 1000000) { n cout << 1 n1000000 n ; n } else { n while (n) { n int p = n; n string w; n while (p) { n if (p % 10 == 0) { n w.insert(w.begin(), 0 ); n } else { n w.insert(w.begin(), 1 ); n } n p = p / 10; n } n int x = atoi(&w[0]); n answer.push_back(x); n n = n - x; n } n cout << answer.size() << n ; n for (int i = 0; i < answer.size(); i++) { n cout << answer[i] << ; n } n cout << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 505; n long long d[N][N]; n long long g[N][N]; n int per[N]; n long long ans[N]; n int n; n void upd(int q) { n for (int j = q; j < N; j++) { n g[per[q]][per[j]] = d[per[q]][per[j]]; n g[per[j]][per[q]] = d[per[j]][per[q]]; n } n for (int j = q; j <= n; j++) { n for (int i = q; i <= n; i++) { n g[per[q]][per[j]] = n min(g[per[q]][per[j]], g[per[q]][per[i]] + g[per[i]][per[j]]); n } n } n for (int j = q; j <= n; j++) { n for (int i = q; i <= n; i++) { n g[per[j]][per[q]] = n min(g[per[j]][per[q]], g[per[j]][per[i]] + g[per[i]][per[q]]); n } n } n for (int i = q; i <= n; i++) { n for (int j = q; j <= n; j++) { n g[per[i]][per[j]] = n min(g[per[i]][per[j]], g[per[i]][per[q]] + g[per[q]][per[j]]); n } n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n ; n cin >> n; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n cin >> d[i][j]; n g[i][j] = (i != j) * (int)(1e9 + 9); n } n } n for (int i = 1; i <= n; i++) { n cin >> per[i]; n } n for (int i = n; i >= 1; i--) { n upd(i); n for (int j = i; j <= n; j++) { n for (int z = i; z <= n; z++) { n ans[i] += g[per[j]][per[z]]; n } n } n } n for (int i = 1; i <= n; i++) cout << ans[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline void splay(int &v) { n v = 0; n char c = 0; n int p = 1; n while (c < 0 || c > 9 ) { n if (c == - ) p = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n v = (v << 3) + (v << 1) + c - 0 ; n c = getchar(); n } n v *= p; n } n struct Edge { n int to, next; n int col; n } edge[200010]; n int first[100010], size; n void addedge(int x, int y, int z) { n size++; n edge[size].to = y; n edge[size].next = first[x]; n first[x] = size; n edge[size].col = z; n } n int n, m, tmp; n bool f, flag; n int cnt = 100001, ans[100010], p[100010]; n int C[100010]; n bool vis[100010]; n int ff[100010], sum; n void dfs(int now, int col) { n ff[++sum] = now; n vis[now] = 1; n C[now] = col; n if (C[now]) tmp++; n for (int u = first[now]; u; u = edge[u].next) { n if (vis[edge[u].to]) { n if (edge[u].col) { n if (C[edge[u].to] == C[now]) f = 0; n } else { n if (C[edge[u].to] != C[now]) f = 0; n } n } else { n dfs(edge[u].to, col ^ edge[u].col); n } n } n } n void get() { n f = 1; n int _cnt = 0; n memset(vis, 0, sizeof vis); n for (int i = 1; i <= n; i++) { n if (!vis[i]) { n sum = 0; n tmp = 0; n dfs(i, 0); n if (f && tmp <= sum - tmp) { n for (int i = 1; i <= sum; i++) { n if (C[ff[i]]) { n p[++_cnt] = ff[i]; n } n } n } n if (f && sum - tmp < tmp) { n for (int i = 1; i <= sum; i++) { n if (!C[ff[i]]) { n p[++_cnt] = ff[i]; n } n } n } n } n } n if (f) { n if (_cnt <= cnt) { n for (int i = 1; i <= _cnt; i++) { n ans[i] = p[i]; n } n cnt = _cnt; n flag = true; n } n } n } n int main() { n splay(n), splay(m); n for (int i = 1; i <= m; i++) { n int x, y, z; n char op[5]; n splay(x), splay(y), scanf( %s , op); n if (op[0] == B ) n z = 0; n else n z = 1; n addedge(x, y, z), addedge(y, x, z); n } n get(); n for (int i = 1; i <= size; i++) { n edge[i].col ^= 1; n } n get(); n if (flag) { n printf( %d n , cnt); n for (int i = 1; i <= cnt; i++) { n printf( %d , ans[i]); n } n } else n puts( -1 ); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100010; n int dp[N][310], c[N][310], lst[N], a[N], b[N]; n vector v[N]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, m, s, e; n cin >> n >> m >> s >> e; n for (int i = 0; i < n; i++) { n cin >> a[i + 1]; n } n for (int i = 0; i < m; i++) { n cin >> b[i + 1]; n v[b[i + 1]].push_back(i + 1); n } n for (int i = 0; i <= n; i++) { n for (int j = 0; j <= 300; j++) { n dp[i][j] = -1; n } n lst[i] = -1; n } n lst[0] = 0; n for (int i = 1; i <= n; i++) { n for (int j = min(300, n); j >= 1; j--) { n if (lst[j - 1] == -1 || v[a[i]].size() == 0) continue; n if (v[a[i]].back() <= lst[j - 1]) continue; n int ind = upper_bound(v[a[i]].begin(), v[a[i]].end(), lst[j - 1]) - n v[a[i]].begin(); n dp[i][j] = v[a[i]][ind]; n c[i][j] = e * j + dp[i][j] + i; n if (lst[j] == -1) n lst[j] = v[a[i]][ind]; n else n lst[j] = min(v[a[i]][ind], lst[j]); n } n } n int ans = n; n for (int i = n; i >= 0; i--) { n if (lst[i] != -1) { n ans = i; n break; n } n } n for (int j = ans; j >= 1; j--) { n int k = 1000000000; n for (int i = 1; i <= n; i++) { n if (dp[i][j] != -1) { n k = min(k, c[i][j]); n } n } n if (k <= s) { n cout << j; n return 0; n } n } n cout << 0; n } n "} +{"func_code_string": "#include n using namespace std; n map M; n map MM; n vector adj[20]; n int n, m; n bool val(vector &v) { n for (int i = 0; i < v.size(); i++) { n for (int j = 0; j < v.size(); j++) { n if (i == j) continue; n for (int k = 0; k < adj[v[i]].size(); k++) { n if (v[j] == adj[v[i]][k]) return 0; n } n } n } n return 1; n } n void solve() { n int maxi = 0; n vector v, sol; n for (int i = 0; i < (1 << n); i++) { n v.clear(); n for (int j = 0; j < n; j++) { n if (i & (1 << j)) v.push_back(j); n } n if (val(v)) { n if (v.size() > maxi) { n maxi = v.size(); n sol = v; n } n } n } n cout << maxi << endl; n vector name; n for (int i = 0; i < sol.size(); i++) name.push_back(MM[sol[i]]); n sort(name.begin(), name.end()); n for (int i = 0; i < name.size(); i++) cout << name[i] << endl; n } n int main() { n cin >> n >> m; n string s, s1; n for (int i = 0; i < n; i++) { n cin >> s; n M[s] = i; n MM[i] = s; n } n for (int i = 0; i < m; i++) { n cin >> s >> s1; n adj[M[s]].push_back(M[s1]); n } n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 3e4, INF = int(1e9) + 1, mod = 1e9 + 7; n const long long BIG = 1e16; n int n, d, a[N + 5], dp[N + 5][250 * 2 + 5]; n bool w[N + 5][250 * 2 + 5]; n int rec(int v, int l) { n if (v > N) { n return 0; n } n int l1 = l - (d - 250); n if (w[v][l1]) return dp[v][l1]; n int ans = 0; n for (int i = -1; i <= 1; i++) { n if (l + i) ans = max(ans, rec(v + l + i, l + i)); n } n w[v][l1] = 1; n ans += a[v]; n return dp[v][l1] = ans; n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n cin >> n >> d; n for (int i = 1; i <= n; i++) { n int x; n cin >> x; n a[x]++; n } n cout << rec(d, d); n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = (1 << 29); n const int INFF = 0x7fffffff; n const long long LINF = (1ll << 60); n const long long LINFF = 0x7fffffffffffffff; n const long double PI = 3.14159265359; n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n long long rnd(long long a, long long b) { n return uniform_int_distribution(a, b)(rng); n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n string a, b; n cin >> a >> b; n bool ans = true; n bool change[300][300] = {}; n for (int i = 0; i < n; i++) { n if (a[i] != b[i] && a[i] > b[i]) ans = false; n if (a[i] != b[i]) change[a[i]][b[i]] = true; n } n int cnt = 0; n for (int c = a ; c <= t ; c++) { n for (int d = c + 1; d <= t ; d++) { n if (change[c][d] == 0) continue; n cnt += change[c][d]; n for (int e = d + 1; e <= t ; e++) { n change[d][e] += change[c][e]; n } n break; n } n } n if (ans == false) cnt = -1; n cout << cnt << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n unordered_set has_handle; n unordered_set is_new; n unordered_map handle; n vector handles_new; n vector handles_old; n void solve(string old) { n if (is_new.count(old)) return; n handles_old.push_back(old); n string temp; n while (true) { n temp = handle[old]; n if (has_handle.count(temp) == 0) break; n old = temp; n } n handles_new.push_back(temp); n } n int main() { n int q; n cin >> q; n string old_handle[q], new_handle[q]; n for (int i = 0; i < q; i++) { n cin >> old_handle[i] >> new_handle[i]; n has_handle.insert(old_handle[i]); n is_new.insert(new_handle[i]); n handle[old_handle[i]] = new_handle[i]; n } n for (int i = 0; i < q; i++) solve(old_handle[i]); n int cnt = handles_new.size(); n cout << cnt << endl; n for (int i = 0; i < cnt; i++) n cout << handles_old[i] << << handles_new[i] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n int x, y, e, t, d; n }; n vector v[555][555][2]; n long long sub[555][2], sum[555][555]; n long long dp[2][555][555][2]; n int n, m; n const long long inf = 1e18; n void init(int type) { n for (int i = 0; i < m; i++) n for (int j = 0; j < max(n, m) + 1; j++) n for (int k = 0; k < 2; k++) dp[type][i][j][k] = inf; n } n int main() { n int k, x, y, d, t, e; n scanf( %d%d%d , &n, &m, &k); n for (int i = 1; i < k + 1; i++) { n scanf( %d%d%d%d%d , &x, &y, &d, &t, &e); n if ((x + y) >= t && (x + y - t) % 4 == 0) sum[x][y] += e; n if ((x + y) >= t + 1 && (x + y - t) % 4 == 1) sum[x + d][y - d] += e; n if ((x + y + d) >= t + 2 && (x + y + d - t) % 4 == 2) n v[x + d][y][0].push_back({x, y, e, t, d}), sum[x + d][y] += e; n if ((x + y + d) >= t + 3 && (x + y + d - t) % 4 == 3) n v[x][y + d][1].push_back({x, y, e, t, d}), sum[x][y + d] += e; n } n bool type = 1; n init(0); n dp[0][0][0][0] = 0; n for (int i = 0; i < n; i++) { n init(type); n for (int j = 0; j < m; j++) { n long long nowadd[2] = {sum[i][j], sum[i][j]}; n memset(sub, 0, sizeof(sub)); n for (auto &xx : v[i][j][0]) { n int x = xx.x, y = xx.y, t = xx.t; n if ((x + y) >= t && (x + y - t) % 4 == 0) sub[xx.d][1] += xx.e; n if ((x + y) >= t + 1 && (x + y - t) % 4 == 1) sub[xx.d][0] += xx.e; n } n for (auto &xx : v[i][j][1]) { n int x = xx.x, y = xx.y, t = xx.t; n if ((x + y) >= t && (x + y - t) % 4 == 0) sub[xx.d][0] += xx.e; n } n for (int kx = 0; kx < max(n, m) + 1; kx++) n for (int k = 0; k < 2; k++) { n if (k && i - kx < 0) continue; n if (!k && j - kx < 0) continue; n nowadd[k] -= sub[kx][k]; n if (dp[!type][j][kx][k] != inf) { n if (!k) n dp[!type][j + 1][kx + 1][0] = min( n dp[!type][j + 1][kx + 1][0], dp[!type][j][kx][k] + nowadd[0]), n dp[type][j][1][1] = n min(dp[type][j][1][1], n dp[!type][j][kx][k] + nowadd[0]); n else n dp[!type][j + 1][1][0] = n min(dp[!type][j + 1][1][0], dp[!type][j][kx][k] + nowadd[1]), n dp[type][j][kx + 1][1] = n min(dp[type][j][kx + 1][1], n dp[!type][j][kx][k] + nowadd[1]); n } n } n } n type = !type; n } n long long res = inf; n for (int i = 0; i < max(n, m) + 1; i++) n for (int j = 0; j < 2; j++) res = min(res, dp[!type][m - 1][i][j]); n printf( %I64d n , res); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int i, j, n; n set s; n cin >> n; n for (i = 0; i < n; i++) { n cin >> j; n if (j != 0) { n s.insert(j); n } n } n cout << s.size() << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[200000 + 1]; n struct info { n int sum, prop; n } t[3 * 200000 + 3]; n void build(int node, int b, int e) { n if (b >= e) { n if (b == e) t[node].sum = a[b]; n return; n } n int left = node << 1; n int right = left | 1; n int mid = (b + e) >> 1; n build(left, b, mid); n build(right, mid + 1, e); n t[node].sum = t[left].sum + t[right].sum; n } n void update(int node, int b, int e, int i, int j) { n if (i > e || j < b) return; n if (b > e) return; n if (b >= i && e <= j) { n t[node].sum += ((e - b + 1) * 1); n t[node].prop += 1; n return; n } n int left = node << 1; n int right = left | 1; n int mid = (b + e) >> 1; n update(left, b, mid, i, j); n update(right, mid + 1, e, i, j); n t[node].sum = t[left].sum + t[right].sum + (e - b + 1) * t[node].prop; n } n int query(int node, int b, int e, int pos, int carry = 0) { n if (pos < b || e < pos) return 0; n if (b > e) return 0; n if (b == pos && pos == e) return t[node].sum + carry * (e - b + 1); n int left = node << 1; n int right = left | 1; n int mid = (b + e) >> 1; n int p1 = query(left, b, mid, pos, carry + t[node].prop); n int p2 = query(right, mid + 1, e, pos, carry + t[node].prop); n return p1 + p2; n } n int chk[200000 + 1]; n int main() { n int n, k, q, i, l, r; n cin >> n >> k >> q; n for (i = 0; i < n; i++) { n scanf( %d %d , &l, &r); n update(1, 1, 200000, l, r); n } n for (i = 1; i <= 200000; i++) { n if (query(1, 1, 200000, i) >= k) chk[i] = 1; n } n for (i = 1; i <= 200000; i++) chk[i] += chk[i - 1]; n for (i = 0; i < q; i++) { n scanf( %d %d , &l, &r); n cout << chk[r] - chk[l - 1] << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct RTC {}; n const int maxn = 123456 + 5; n int n; n int root; n bool humans[maxn]; n vector g_tmp[maxn], g[maxn]; n ; n bool cut(int u, int p = -1) { n bool ret = humans[u]; n for (int v : g_tmp[u]) { n if (v == p) continue; n if (cut(v, u)) { n ret = true; n g[u].push_back(v); n } n } n return ret; n } n int cnt[maxn]; n int deep[maxn]; n void count(int u) { n cnt[u] = 1; n deep[u] = 0; n for (int v : g[u]) { n count(v); n cnt[u] += cnt[v]; n deep[u] = max(deep[u], 1 + deep[v]); n } n } n int maxlen = -1, id = -1; n void solve(int u, int up) { n if (humans[u]) { n int res = max(deep[u], up); n if (res > maxlen) { n maxlen = res; n id = u; n } else if (res == maxlen) { n id = min(id, u); n } n } n if (((int)(g[u]).size()) > 0) { n int down_v = 0; n for (int i = 1; i < ((int)(g[u]).size()); i++) n if (deep[g[u][i]] > deep[g[u][down_v]]) down_v = i; n if (up >= (deep[g[u][down_v]] + 1)) { n for (int v : g[u]) solve(v, up + 1); n } else { n for (int i = 0; i < (((int)(g[u]).size())); i++) { n if (i == down_v) continue; n solve(g[u][i], deep[g[u][down_v]] + 2); n } n int second_down_v = -1; n for (int i = 0; i < (((int)(g[u]).size())); i++) { n if (i == down_v) continue; n if (second_down_v == -1 || deep[g[u][i]] > deep[g[u][second_down_v]]) n second_down_v = i; n } n if (second_down_v == -1 || up >= (deep[g[u][second_down_v]] + 1)) n solve(g[u][down_v], up + 1); n else n solve(g[u][down_v], deep[g[u][second_down_v]] + 2); n } n } n } n int N; n int main() { n int m; n scanf( %d %d , &n, &m); n for (int i = 0; i < (n - 1); i++) { n int u, v; n scanf( %d %d , &u, &v); n g_tmp[u].push_back(v); n g_tmp[v].push_back(u); n } n while (m--) { n int u; n scanf( %d , &u); n humans[u] = true; n root = u; n } n cut(root); n count(root); n N = cnt[root]; n solve(root, 0); n int arcos = N - 1; n printf( %d n%d n , id, 2 * arcos - maxlen); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, k; n long long get(long long x, long long y) { n if (x <= y * 2) return 0; n long long s1 = 1, s2 = 0, p1 = x, p2 = x - 1, ans = 0; n while (p2 >= y * 2) { n if (p2 == y * 2) return s1 + ans; n ans += s1 + s2; n if (p1 & 1) n s1 = s1 * 2 + s2; n else n s2 = s2 * 2 + s1; n p1 /= 2; n p2 = p1 - 1; n } n return ans; n } n long long solve(long long l, long long r, long long x, long long k) { n long long mid = (l + r) / 2; n if (k == 1) return mid; n long long X = get(mid - l, x), Y = get(r - mid, x + 1); n if (k > X + Y + 1) return solve(mid + 1, r, x, k - X - 1); n return solve(l, mid - 1, x, k - Y - 1); n } n signed main() { n scanf( %lld%lld , &n, &k); n if (k == 1) { n puts( 1 ); n return 0; n } n if (k == 2) { n printf( %lld n , n); n return 0; n } n n -= 2; n k -= 2; n long long l = 0, r = n; n while (l < r) { n long long mid = (l + r + 1) / 2; n if (get(n, mid) < k) n r = mid - 1; n else n l = mid; n } n printf( %lld n , 1 + solve(1, n, l, k)); n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 2e5 + 5; n long long int a[maxN], b[maxN]; n int n; n void solve() { n cin >> n; n set> s; n int count = n; n for (int i = 0; i < n; i++) { n b[i] = 1; n cin >> a[i]; n s.insert({a[i], i}); n } n while (!s.empty()) { n auto it1 = *(s.begin()); n s.erase(s.begin()); n if (s.empty()) break; n auto it2 = *(s.begin()); n if (it1.first == it2.first) { n count--; n s.erase(s.begin()); n s.insert({2 * it2.first, it2.second}); n a[it2.second] = 2 * it2.first; n b[it1.second] = 0; n } n } n cout << count << endl; n for (int i = 0; i < n; i++) { n if (b[i]) cout << a[i] << ; n } n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n srand(chrono::high_resolution_clock::now().time_since_epoch().count()); n int t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n scanf( %d , &t); n while (t--) { n int n; n scanf( %d , &n); n vector a(n); n for (int i = 0; (i) < (int)(n); (i)++) { n scanf( %d , &a[i]); n } n queue que; n vector ans; n for (int i = 0; (i) < (int)(n); (i)++) { n if (i == 0 || a[i - 1] < a[i]) { n ans.push_back(a[i]); n int prev = (i == 0 ? 0 : a[i - 1]); n prev++; n while (prev != a[i]) { n que.push(prev); n prev++; n } n } else { n if (que.empty()) { n printf( -1 n ); n goto end; n } n ans.push_back(que.front()); n que.pop(); n } n } n assert(ans.size() == n); n for (int i = 0; (i) < (int)(n); (i)++) { n printf( %d%c , ans[i], i == n - 1 ? n : ); n } n end:; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int a[307][307]; n inline bool check(const int& i, const int& j) { n return i >= 0 && i < n && j >= 0 && j < m; n } n int cnt_neighbors(const int& i, const int& j) { n int res = 0; n if (check(i - 1, j)) res++; n if (check(i, j + 1)) res++; n if (check(i + 1, j)) res++; n if (check(i, j - 1)) res++; n return res; n } n int main() { n int tc; n scanf( %d , &tc); n while (tc--) { n scanf( %d %d , &n, &m); n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) scanf( %d , &a[i][j]); n bool flag = 1; n for (int i = 0; i < n && flag; i++) n for (int j = 0; j < m && flag; j++) { n int tmp = cnt_neighbors(i, j); n if (a[i][j] > tmp) n flag = 0; n else n a[i][j] = tmp; n } n if (flag) { n puts( YES ); n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) printf( %d , a[i][j]); n puts( ); n } n } else n puts( NO ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1000 + 2; n double x[4], y[4], r[4]; n double dx, dy; n double Fun(double dx, double dy) { n double ap[4]; n for (int i = 0; i < 3; i++) { n ap[i] = n sqrt(((x[i] - dx) * (x[i] - dx)) + ((y[i] - dy) * (y[i] - dy))) / r[i]; n } n double res = 0.0; n for (int i = 0; i < 3; i++) { n res += ((ap[i] - ap[(i + 1) % 3]) * (ap[i] - ap[(i + 1) % 3])); n } n return res; n } n int main() { n dx = dy = 0.0; n for (int i = 0; i < 3; i++) { n scanf( %lf%lf%lf , &x[i], &y[i], &r[i]); n dx += x[i] / 3; n dy += y[i] / 3; n } n double i = 1.0; n while (i > 1e-5) { n if (Fun(dx + i, dy) < Fun(dx, dy)) n dx += i; n else if (Fun(dx - i, dy) < Fun(dx, dy)) n dx -= i; n else if (Fun(dx, dy + i) < Fun(dx, dy)) n dy += i; n else if (Fun(dx, dy - i) < Fun(dx, dy)) n dy -= i; n else n i *= 0.75; n } n if (Fun(dx, dy) < 1e-5) printf( %.5lf %.5lf n , dx, dy); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n n typedef pair pii; n typedef pair psi; n typedef pair pis; n typedef array aii; n typedef array aiii; n typedef array aiiii; n typedef unsigned long long ull; n typedef long long int ll; n typedef array all; n typedef array alll; n typedef array allll; n n #define pb push_back n #define ff first n #define ss second n #define MAX 200005 n #define MOD 1000000007 n #define INF 1e9 n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n vectoradj[MAX]; n int xMove[] = { 0,1,0,-1,1,1,-1,-1, 2, 2, -2, -2, 1, 1, -1, -1 }; n int yMove[] = { 1,0,-1,0,1,-1,1,-1, 1, -1, 1, -1, 2, -2, 2, -2 }; n string s; n n int dp[MAX][2],n; n n int solve(int i, int p) n { n if(i==n) n return 0; n if(dp[i][p]!=-1) n return dp[i][p]; n n int ans=0; n if(s[i]== 1 ) n { n if(p==0) n ans=1+solve(i+1,1); n } n else if(s[i]== 0 ) n { n if(p==1) n ans=1+solve(i+1,0); n } n else n { n if(p==0) n ans=1+solve(i+1,1); n else ans=1+solve(i+1,0); n } n n return dp[i][p]=ans; n } n int main() n { n //freopen( input.in , r ,stdin); n //freopen( output.txt , w ,stdout); n cin.tie(0),cout.tie(0); n ios_base::sync_with_stdio(0); n cout.setf(ios::fixed); n cout.precision(10); n int TC=1; n int m,k,q; n n cin>>TC; n for(int t1=1; t1<=TC; t1++) n { n cin>>s; n n=s.size(); n for(int i=0;i n using namespace std; n int main() { n int n; n cin >> n; n if (n & 1) { n cout << (n / 2); n } else { n cout << (n / 2) - 1; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n for (int i = 0; i < n; i++) { n int n, m; n cin >> n >> m; n if (n % m == 0) n cout << YES << endl; n else n cout << NO << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000000000; n const int diri[4] = {-1, 0, 1, 0}; n const int dirj[4] = {0, 1, 0, -1}; n int A, B; n int va[110000], vb[110000]; n bool esquerra(int a, int b) { n if (b < 0) return false; n if (a == 0) return true; n return va[a - 1] < vb[b]; n } n bool dreta(int a, int b) { n if (b + 1 >= B) return false; n if (a + 1 == A) return true; n return va[a + 1] > vb[b + 1]; n } n int main() { n int spam; n cin >> A >> B >> spam >> spam; n for (int i = 0; i < int(A); ++i) cin >> va[i]; n for (int i = 0; i < int(B); ++i) cin >> vb[i]; n vector dist(B, -1); n int res = A; n int b = -1; n for (int a = 0; a < A; ++a) { n while (b + 1 < B and vb[b + 1] <= va[a]) ++b; n int d = INF; n if (0 <= b and b < B) d = min(d, abs(va[a] - vb[b])); n if (b + 1 < B) d = min(d, abs(va[a] - vb[b + 1])); n if (esquerra(a, b) and d == abs(va[a] - vb[b])) { n if (dist[b] == -1 or dist[b] == d) { n dist[b] = d; n --res; n continue; n } n } n if (dreta(a, b) and d == abs(va[a] - vb[b + 1])) { n dist[b + 1] = d; n --res; n continue; n } n } n cout << res << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int biceps = 0, back = 0, chest = 0; n for (int i = 0; i < n; i++) { n int a; n cin >> a; n if (i % 3 == 0) chest += a; n if (i % 3 == 1) biceps += a; n if (i % 3 == 2) back += a; n } n if (chest > back && chest > biceps) cout << chest ; n if (back > chest && back > biceps) cout << back ; n if (biceps > chest && biceps > back) cout << biceps ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, n; n cin >> t; n while (t--) { n cin >> n; n int a[n], flag = 0, x; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = 0; i < n; i++) { n if (a[i] % 2 == 0) { n x = i + 1; n flag = 1; n break; n } n } n if (n == 1 && flag == 0) n cout << -1 << endl; n else if (flag == 1) n cout << 1 << endl << x << endl; n else n cout << 2 << endl n << 1 n << n << 2 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 2e5 + 10; n int cnt[MAX]; n vector up, down; n int main() { n ios::sync_with_stdio(false); n memset(cnt, 0, sizeof(cnt)); n int n, x, max_num = -1; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> x; n cnt[x]++; n max_num = max(max_num, x); n } n for (int i = 0; i <= max_num; i++) { n if (cnt[i] > 2) { n cout << NO << endl; n return 0; n } n } n for (int i = max_num; i >= 0; i--) { n if (cnt[i]) { n down.push_back(i); n cnt[i]--; n } n } n for (int i = 0; i <= max_num; i++) { n if (cnt[i]) { n up.push_back(i); n cnt[i]--; n } n } n cout << YES << endl; n cout << up.size() << endl; n if (up.size() > 0) { n for (int i = 0; i < up.size() - 1; i++) cout << up[i] << ; n cout << up[up.size() - 1] << endl; n } else { n cout << << endl; n } n cout << down.size() << endl; n if (down.size() > 0) { n for (int i = 0; i < down.size() - 1; i++) cout << down[i] << ; n cout << down[down.size() - 1] << endl; n } else { n cout << << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 101000; n int N; n bool getv(int n) { n int a, b; n printf( ? %d n , 1 + n); n fflush(stdout); n scanf( %d , &a); n printf( ? %d n , 1 + n + (N / 2)); n fflush(stdout); n scanf( %d , &b); n if (a == b) { n printf( ! %d n , 1 + n); n exit(0); n } n return a > b; n } n int main() { n scanf( %d , &N); n if (N % 4 > 0) { n printf( ! -1 n ); n return 0; n } n bool bvt = getv(0); n int low = 0, high = N / 2; n while (high > low + 1) { n int mid = low + (high - low) / 2; n if (getv(mid) == bvt) n low = mid; n else n high = mid; n } n getv(high); n printf( ! -1 n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, len, i, j, a[300009]; n int main() { n while (scanf( %I64d , &n) == 1) { n for (i = 0; i < n; i++) { n scanf( %I64d , &a[i]); n } n sort(a, a + n); n if (n % 2 != 0) { n printf( %I64d n , a[n / 2]); n } else { n printf( %I64d n , a[n / 2 - 1]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = 3.14159265358979323846; n const double eps = (1e-10); n int isGreater(long double x, long double y) { n if (abs(x - y) < eps) return 0; n if (x > y) return 1; n return -1; n } n const int MOD = 998244353; n int mult(int x, int y) { return (1LL * x * y) % MOD; } n int add(int x, int y) { n x += y; n while (x >= MOD) x -= MOD; n while (x < 0) x += MOD; n return x; n } n int add(vector v) { n int ret = 0; n for (int i = 0; i < (int)((v).size()); ++i) ret = add(ret, v[i]); n return ret; n } n const int MAX_N = 3e5 + 5; n vector adj[MAX_N]; n int dp[MAX_N][3][2]; n int n; n void calc(int u, int p) { n for (int v : adj[u]) { n if (v != p) calc(v, u); n } n dp[u][0][1] = 0; n dp[u][0][0] = 1; n for (int v : adj[u]) { n if (v != p) n dp[u][0][0] = n mult(dp[u][0][0], add({dp[v][0][0], dp[v][2][0], dp[v][2][1]})); n } n dp[u][2][0] = dp[u][2][1] = 1; n for (int v : adj[u]) { n if (v != p) { n dp[u][2][0] = n mult(dp[u][2][0], add({dp[v][1][0], dp[v][1][1], dp[v][2][0], n dp[v][2][1], dp[v][0][0]})); n dp[u][2][1] = n mult(dp[u][2][1], n add({dp[v][1][0], dp[v][2][0], dp[v][2][1], dp[v][0][0]})); n } n } n dp[u][2][0] = add(dp[u][2][0], -dp[u][0][0]); n dp[u][2][1] = add(dp[u][2][1], -dp[u][0][0]); n if (u == 0) return; n dp[u][1][0] = dp[u][1][1] = 1; n for (int v : adj[u]) { n if (v != p) { n dp[u][1][0] = n mult(dp[u][1][0], add({dp[v][0][0], dp[v][2][0], dp[v][2][1], n dp[v][1][0], dp[v][1][1]})); n dp[u][1][1] = n mult(dp[u][1][1], n add({dp[v][0][0], dp[v][2][0], dp[v][2][1], dp[v][1][0]})); n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 0; i < n - 1; ++i) { n int u, v; n cin >> u >> v; n --u; n --v; n adj[u].push_back(v); n adj[v].push_back(u); n } n calc(0, n); n cout << add({dp[0][0][0], dp[0][2][0], dp[0][2][1], -1}); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector> calced; n long long x_m(long long m, long long mod) { n for (pair a : calced) { n if (a.first == m) return a.second; n } n if (m == 1) return 1 % mod; n if (m == 2) return 3 % mod; n for (long long i = 1; i < m; i *= 2) { n if (i * 2 > m) { n long long pw = x_m(i, mod); n long long pw2 = x_m(i - 1, mod); n long long val = (pw + (m - i) * (pw - pw2)) % mod; n if (val < 0) val += mod; n calced.insert(calced.begin(), make_pair(m, val)); n return val; n } n if (i * 2 == m) { n long long val = (2 * (x_m(m - 1, mod)) + 1) % mod; n if (val < 0) val += mod; n calced.insert(calced.begin(), make_pair(m, val)); n return val; n } n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int n; n cin >> n; n for (int i = 0; i < n; i++) { n calced.clear(); n long long d, m; n cin >> d >> m; n cout << x_m(d, m) << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n while (n--) { n string s; n cin >> s; n int i, k, cnt = 0; n for (i = 0; i < s.length(); i++) n if (s[i] != 0 ) break; n k = i; n for (i; i < s.length(); i++) n if (s[i] == 0 ) cnt++; n for (int j = s.length(); j >= k; j--) { n if (s[j] == 0 ) n cnt--; n else if (s[j] == 1 ) n break; n } n cout << cnt << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n ; n long long t; n cin >> t; n while (t--) { n long long n, x, m; n cin >> n >> x >> m; n long long c, d; n long long l = x, r = x; n while (m--) { n cin >> c >> d; n if (c <= l && d >= r) { n l = c; n r = d; n } else if (c <= l && d <= r && d >= l) n l = c; n else if (l <= c && c <= r && d >= r) n r = d; n } n cout << (r - l + 1) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 27; n long long n, a[inf], b[inf], c[inf], ans = -1e9; n vector res; n map, pair > > mp; n vector mask; n void btadd(long long pos, long long sum1, long long sum2, long long sum3) { n if (pos == n / 2) { n long long id1 = sum2 - sum1, id2 = sum3 - sum1; n pair id = make_pair(id1, id2); n if (mp.find(id) == mp.end()) n mp[id] = make_pair(sum1, mask); n else n mp[id] = max(mp[id], make_pair(sum1, mask)); n return; n } n mask.push_back(1); n btadd(pos + 1, sum1, sum2 + b[pos], sum3 + c[pos]); n mask.pop_back(); n mask.push_back(2); n btadd(pos + 1, sum1 + a[pos], sum2, sum3 + c[pos]); n mask.pop_back(); n mask.push_back(3); n btadd(pos + 1, sum1 + a[pos], sum2 + b[pos], sum3); n mask.pop_back(); n } n vector merge(vector x, vector y) { n for (auto o : y) x.push_back(o); n return x; n } n void bt(long long pos, long long sum1, long long sum2, long long sum3) { n if (pos == n + 1) { n long long id1 = sum1 - sum2, id2 = sum1 - sum3; n pair id = make_pair(id1, id2); n if (mp.find(id) == mp.end()) return; n if (mp[id].first + sum1 > ans) n ans = mp[id].first + sum1, res = merge(mp[id].second, mask); n return; n } n mask.push_back(1); n bt(pos + 1, sum1, sum2 + b[pos], sum3 + c[pos]); n mask.pop_back(); n mask.push_back(2); n bt(pos + 1, sum1 + a[pos], sum2, sum3 + c[pos]); n mask.pop_back(); n mask.push_back(3); n bt(pos + 1, sum1 + a[pos], sum2 + b[pos], sum3); n mask.pop_back(); n } n int main() { n cin >> n; n for (long long i = 1; i <= n; i++) cin >> a[i] >> b[i] >> c[i]; n if (n == 1) { n if ((a[1] == 0 && b[1] == 0)) cout << LM << endl, exit(0); n if (a[1] == 0 && c[1] == 0) cout << LW << endl, exit(0); n if (b[1] == 0 && c[1] == 0) cout << MW << endl, exit(0); n cout << Impossible << endl; n exit(0); n } n btadd(1, 0, 0, 0); n bt(n / 2, 0, 0, 0); n if (res.empty()) cout << Impossible << endl, exit(0); n for (int i = 1; i <= n; i++) n if (res[i - 1] == 1) n cout << MW << endl; n else if (res[i - 1] == 2) n cout << LW << endl; n else n cout << LM << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n int sl = s.length(); n pair a[26] = {}; n for (int i = 0; i < 26; i++) a[i].second = i + a ; n for (int i = 0; i < sl; i++) a[s[i] - a ].first++; n sort(a, a + 26, greater >()); n string ans(sl, ? ); n bool valid = false; n for (int i = 1; i < sl / 2; i++) ans[i] = a[0].second, a[0].first--; n for (int i = sl / 2; i < sl; i++) { n int sq = sqrt(i + 1); n bool ok = false; n for (int j = 2; j <= sq; j++) ok |= ((i + 1) % j == 0); n if (ok) ans[i] = a[0].second, a[0].first--; n } n if (a[0].first >= 0) { n string rem = ; n for (int i = 0; i < 26; i++) n while (a[i].first--) rem.push_back(a[i].second); n for (int i = 0, j = 0; i < sl; i++) n if (ans[i] == ? ) { n ans[i] = rem[j]; n j++; n } n valid = true; n } n if (valid == false) n cout << NO n ; n else n cout << YES n << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ull = unsigned long long; n constexpr ll MAXN = 100000 + 5; n int n, m; n ll bot, inc, dam; n ll maxh[MAXN]; n ll starth[MAXN]; n ll regen[MAXN]; n vector> up[MAXN]; n unordered_map mt; n unordered_set tpoints; n void gen(const int id) { n const ll mh = maxh[id]; n const ll reg = regen[id]; n auto &cup = up[id]; n sort(cup.begin(), cup.end()); n int in = 0; n ll prect = -1; n ll prech = -1; n int i = 0; n vector> cal; n while (i < cup.size() || cal.size()) { n if (cal.size()) { n ll prect = cal[0].first; n ll prech = cal[0].second; n cal.clear(); n if (i >= cup.size() || prect < cup[i].first) { n if (prech <= dam) { n tpoints.insert(prect); n if (reg) { n prect++; n prech = min(prech + reg, mh); n cal.emplace_back(prect, prech); n } n } else { n mt[prect]--; n in = 0; n } n } n continue; n } n auto const p = cup[i]; n const ll ct = p.first; n const ll ch = p.second; n if (ch < dam) { n if (in == 1) { n } else { n in = 1; n mt[ct]++; n tpoints.insert(ct); n } n if (reg) { n prect = ct + (dam - ch) / reg; n prech = ch + (prect - ct) * reg; n cal.emplace_back(prect, prech); n } n } else if (ch > dam) { n if (in == 1) { n tpoints.insert(ct - 1); n mt[ct]--; n in = 0; n } n } else if (ch == dam) { n if (in == 0) { n in = 1; n mt[ct]++; n tpoints.insert(ct); n } else { n tpoints.insert(ct); n } n if (reg) { n prect = ct + 1; n prech = min(mh, prech + reg); n cal.emplace_back(prect, prech); n } n } n i++; n } n } n int main() { n ios::sync_with_stdio(false); n int inf = 0; n cin >> n >> m; n cin >> bot >> inc >> dam; n ll base = 0; n for (int i = 1; i <= n; ++i) { n cin >> maxh[i] >> starth[i] >> regen[i]; n if (maxh[i] <= dam) { n if (inc > 0) { n inf = 1; n } else n base++; n } n up[i].emplace_back(0, starth[i]); n } n for (int i = 0; i < m; ++i) { n int t, id, h; n cin >> t >> id >> h; n up[id].emplace_back(t, h); n } n if (inf) { n cout << -1; n return 0; n } n for (int i = 1; i <= n; ++i) { n if (maxh[i] > dam) gen(i); n } n for (auto const &p : mt) { n tpoints.insert(p.first); n } n ll ret = 0; n vector> vm(mt.begin(), mt.end()); n sort(vm.begin(), vm.end()); n auto mit = vm.begin(); n vector tt(tpoints.begin(), tpoints.end()); n sort(tt.begin(), tt.end()); n for (auto t : tt) { n while (mit != vm.end() && mit->first <= t) { n base += mit->second; n ++mit; n } n ret = max(ret, base * (bot + inc * t)); n } n ret = max(ret, base * (bot)); n if (base > 0 && inc > 0) { n inf = 1; n } n if (inf) { n cout << -1; n return 0; n } n cout << ret; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2000005; n const int P = 998244353; n long long n; n long long f[N], g[N]; n long long a[N]; n long long inv_9, inv_6, inv_1; n long long ans; n long long exp_3[N]; n long long fac[N], c_n[N]; n inline long long ksm(long long base, long long x) { n long long res = 1; n while (x) { n if (x & 1) res *= base, res %= P; n base *= base, base %= P; n x >>= 1; n } n return res; n } n void work() { n int type; n for (int i = 0; i < n; i++) { n if ((n - i) % 2 == 0) n type = 1; n else n type = P - 1; n ans += n ((c_n[i]) * n (((type) * n ((P + ksm((exp_3[i] - 1 + P) % P, n) - ksm(exp_3[i], n)) % P) % P)) % n P), n ans %= P; n } n ans *= 3, ans %= P; n ans = P - ans, ans %= P; n for (int i = 1; i <= n; i++) { n if (i & 1) n type = 1; n else n type = P - 1; n ans += n ((2) * n (((type) * (((c_n[i]) * (ksm(3, n * n - i * (n - 1))) % P)) % P)) % P), n ans %= P; n } n } n void init() { n scanf( %lld , &n); n a[2 * n] = ksm(3, 2 * n); n a[n] = ((P - 2) * ksm(3, n)) % P; n a[0] = 1; n exp_3[0] = 1; n for (int i = 1; i <= n; i++) exp_3[i] = ((3) * (exp_3[i - 1]) % P); n fac[0] = 1; n for (int i = 1; i <= n; i++) fac[i] = ((i) * (fac[i - 1]) % P); n for (int i = 0; i <= n; i++) n c_n[i] = ((fac[n]) * n (((ksm(fac[i], P - 2)) * (ksm(fac[n - i], P - 2)) % P)) % P); n work(); n printf( %lld n , ans); n } n int main(int argc, char** argv) { n init(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, u, d, l, r, i, h[10005]; n string a; n int main() { n cin >> n >> a; n for (i = 0; i < n; i++) { n if (a[i] == 0 ) d = r = l = 1; n if (a[i] == 1 || a[i] == 2 || a[i] == 3 ) u = 1; n if (a[i] == 1 || a[i] == 4 || a[i] == 7 ) l = 1; n if (a[i] == 3 || a[i] == 6 || a[i] == 9 ) r = 1; n if (a[i] == 7 || a[i] == 9 ) d = 1; n } n if (u == 1 && d == 1 && r == 1 && l == 1) n cout << YES ; n else n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 200005; n int k; n int arr[N]; n vector v[N]; n vector gap[N]; n int solve(int l, int r, int c) { n int m = (l + r) >> 1; n if (l == r) return v[c][l]; n if (l >= r) return 0; n if (r == l + 1) { n if (gap[c][l] <= k) n return v[c][l] + v[c][r]; n else n return 0; n } n int lt = m; n int rt = m; n int cost = 0; n int ans = v[c][m]; n int maxi = max(solve(l, m, c), solve(m, r, c)); n while (cost + gap[c][rt] <= k) { n cost += gap[c][rt]; n ans += v[c][rt + 1]; n rt++; n if (rt >= r) break; n } n maxi = max(ans, maxi); n while (rt >= m) { n if (lt == l) break; n while (cost + gap[c][lt - 1] <= k) { n cost += gap[c][lt - 1]; n ans += v[c][lt - 1]; n lt--; n if (lt == l) break; n } n if (maxi < ans) maxi = ans; n if (rt < l + 1) break; n ans -= v[c][rt]; n cost -= gap[c][--rt]; n } n return maxi; n } n signed main() { n int n, m; n cin >> n >> m >> k; n int count[n + 5]; n count[n] = -1; n count[n + 1] = -1; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n count[i] = -1; n } n int ct = 1; n arr[n] = n + 2; n count[arr[0]] = 0; n for (int i = 1; i < n + 1; i++) { n if (arr[i] == arr[i - 1]) ct++; n if (arr[i] != arr[i - 1]) { n v[arr[i - 1]].push_back(ct); n if (count[arr[i]] != -1) { n gap[arr[i]].push_back(i - count[arr[i]] - 1); n } n count[arr[i - 1]] = i - 1; n ct = 1; n } n } n int maxi = -1; n for (int i = 1; i <= m; i++) { n maxi = max(solve(0, v[i].size() - 1, i), maxi); n } n cout << maxi << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long int n, k, t; n cin >> n >> k >> t; n if (t < k) n cout << t << endl; n else if (t > n) n cout << k - (t - n) << endl; n else n cout << k << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e17; n struct edge { n int u, v; n edge() {} n edge(int _u, int _v) : u(_u), v(_v) {} n }; n struct node { n vector edges; n }; n struct tree { n vector nodes; n int root, n; n tree(int _n, int _r = 0) : n(_n), root(_r) { nodes.resize(n); } n void add_edge(int u, int v) { n edge e1(u, v); n edge e2(v, u); n nodes[u].edges.push_back(e1); n nodes[v].edges.push_back(e2); n } n vector> findDiametersAndCenters() { n vector> ans; n vector vis1(n, 0), vis2(n, 0); n vector parent(n, 0); n for (int i = 0; i < n; i++) { n if (vis1[i]) { n continue; n } n int diameter, d1, d2; n findDiameter(i, vis1, vis2, parent, diameter, d1, d2); n int c = findCenter(d2, diameter, parent); n ans.push_back({diameter, c}); n } n return move(ans); n } n pair bfs(int u, vector &visited, vector &parent) { n queue> Q; n visited[u] = true; n int dist = 0; n Q.push({u, 0}); n while (!Q.empty()) { n u = Q.front().first; n dist = Q.front().second; n Q.pop(); n for (auto &e : nodes[u].edges) { n if (visited[e.v]) { n continue; n } n visited[e.v] = true; n Q.push({e.v, dist + 1}); n parent[e.v] = u; n } n } n return {u, dist}; n } n void findDiameter(int u, vector &vis1, vector &vis2, n vector &parent, int &diameter, int &d1, int &d2) { n d1 = bfs(u, vis1, parent).first; n auto p = bfs(d1, vis2, parent); n d2 = p.first; n diameter = p.second; n } n int findCenter(int u, int diameter, vector &parent) { n diameter >>= 1; n while (diameter--) { n u = parent[u]; n } n return u; n } n }; n int main() { n ios::sync_with_stdio(0); n cin.tie(0), cout.tie(0); n int n, m; n cin >> n >> m; n tree t(n); n for (int i = 0; i < m; i++) { n int u, v; n cin >> u >> v; n u--; n v--; n t.add_edge(u, v); n } n vector> DnC = t.findDiametersAndCenters(); n sort(DnC.rbegin(), DnC.rend()); n int res = DnC[0].first; n if (DnC.size() >= 2) { n res = max(res, (DnC[0].first + 1) / 2 + (DnC[1].first + 1) / 2 + 1); n } n if (DnC.size() >= 3) { n res = max(res, (DnC[1].first + 1) / 2 + (DnC[2].first + 1) / 2 + 2); n } n cout << res << n ; n for (int i = 1; i < DnC.size(); i++) { n cout << DnC[i].second + 1 << << DnC[0].second + 1 << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 3e4 + 100, M = 210; n int gi() { n int w = 0; n bool q = 1; n char c = getchar(); n while ((c < 0 || c > 9 ) && c != - ) c = getchar(); n if (c == - ) q = 0, c = getchar(); n while (c >= 0 && c <= 9 ) w = w * 10 + c - 0 , c = getchar(); n return q ? w : -w; n } n void go() { n puts( -1 ); n exit(0); n } n int d[M][N], id[N]; n int p[M][N], pre[N]; n bool in[N]; n int C; n int fa[N]; n vector e[N]; n inline int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); } n vector > sub[N]; n inline void link(int a, int b) { n if (find(a) == find(b)) go(); n fa[find(a)] = find(b); n e[a].push_back(b); n e[b].push_back(a); n } n inline void dfs(int k, int D, int fa) { n if (D != d[C][k]) go(); n for (int t : e[k]) n if (t != fa) dfs(t, D + 1, k); n } n int main() { n int n = gi(), m = gi(), i, j, k, last, ld, t, mx, to; n for (i = 1; i <= n; i++) fa[i] = i; n for (i = 1; i <= m; i++) { n for (j = 1; j <= n; j++) n if (!(d[i][j] = gi())) id[i] = j; n if (!id[i]) go(); n } n p[1][0] = id[1]; n in[id[1]] = true; n for (k = 2; k <= m; k++) { n for (i = 1; i <= n; i++) n if (d[1][i] + d[k][i] == d[1][id[k]]) p[k][d[1][i]] = i, in[i] = true; n for (i = d[1][id[k]]; i; i--) { n if (!p[k][i]) go(); n pre[p[k][i]] = p[k][i - 1]; n } n } n for (k = 1; k <= n; k++) n if (!in[k]) { n mx = -1; n for (i = 1; i <= m; i++) { n t = (d[1][id[i]] + d[1][k] - d[i][k]) / 2; n if (t > mx) mx = t, to = p[i][t]; n } n sub[to].push_back(make_pair(d[1][k], k)); n } n for (k = 1; k <= n; k++) { n sort(sub[k].begin(), sub[k].end()); n for (i = 0, last = k, ld = d[1][k]; i < sub[k].size(); i++) { n if (i && sub[k][i].first != sub[k][i - 1].first) n ld = d[1][last = sub[k][i - 1].second]; n if (sub[k][i].first != ld + 1) go(); n pre[sub[k][i].second] = last; n } n } n for (i = 1; i <= n; i++) n if (pre[i]) n link(pre[i], i); n else if (i != id[1]) n go(); n for (i = 1; i <= n; i++) n if (pre[i]) printf( %d %d n , pre[i], i); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[1001]; n int main() { n int n; n scanf( %d , &n); n int m = n; n int pos = 0; n int k = 1; n while (true) { n if (a[pos] == 0) m--; n if (m == 0) { n printf( YES n ); n return 0; n } n a[pos] = 1; n if (pos == (pos + k) % n) { n printf( NO n ); n return 0; n } n pos = (pos + k) % n; n k++; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n if (n == 1) n cout << 1 << << 1 << n << 1; n else n cout << 2 * (n - 1) << << 2 << n << 1 << << 2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long maxn = 200010; n const long long MOD = 1e9 + 7; n const long long INF = 1e9; n const long long LINF = 1e18; n long long n, m, a[maxn], b[maxn]; n map M, N; n string s, ss; n set S; n long long l, r, h; n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> n; n for (long long i = 0; i < n; i++) cin >> a[i]; n sort(a, a + n); n long long ans = 0; n for (long long i = 0; i < n; i++) n ans += ((a[i] % 10007) * (a[n - i - 1] % 10007)) % 10007, ans %= 10007; n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n char buffer[1000005]; n char str[1000005]; n vector> loop; n int n; n int op(int k, int d) { n int t = -1; n strcpy(buffer, str); n loop.clear(); n vector nxt(k); n vector pre(k + 1); n vector vis(k + 1); n vector lpi(k + 1); n vector lpj(k + 1); n for (int i = 0; i < d; ++i) n for (int j = 0;; ++j) { n if (j * d + i >= k) break; n pre[t + 1] = j * d + i; n nxt[j * d + i] = t++; n } n pre[k] = -1; n for (int i = 0; i < k; ++i) n if (!vis[i]) { n vector temp; n loop.push_back(temp); n int tp = loop.size() - 1; n int p = i; n while (p <= k && !vis[p]) { n vis[p] = 1; n lpi[p] = tp; n lpj[p] = loop[tp].size(); n loop[tp].push_back(p - 1); n p = pre[p] + 1; n } n } n for (int i = 0; i < n; ++i) { n if (i < k - 1) { n if (lpi[i + 1] == 0) { n t = min(lpj[i + 1], n - k + 1); n str[loop[0][lpj[i + 1] - t] + t] = buffer[i]; n } else { n t = n - k + 1; n t = lpj[i + 1] - t; n int sz = loop[lpi[i + 1]].size(); n t %= sz; n t += sz; n t %= sz; n str[loop[lpi[i + 1]][t] + n - k + 1] = buffer[i]; n } n } else { n t = min(n - k + 1 - (i - k + 1), lpj[k]); n str[loop[0][lpj[k] - t] + t + (i - k + 1)] = buffer[i]; n } n } n str[n] = 0; n return 0; n } n int main() { n scanf( %s , str); n n = strlen(str); n int m; n cin >> m; n int k, d; n for (int i = 0; i < m; ++i) { n scanf( %d%d , &k, &d); n op(k, d); n printf(str); n putchar( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, T, a, b, c; n int x[4], y[4]; n long long cost[4]; n string ans; n long long f(long long x, long long y) { return (x + y) * (abs(y - x) + 1) / 2; } n long long Cal(int X, int Y, int x, int y) { n if (X <= x && Y <= y) return f(0, x + y - X - Y) + f(0, n + n - x - y); n if (X >= x && Y >= y) return f(X + Y - x - y, n + n - x - y); n if (X <= x && Y >= y) n return f(x + Y - X - y, Y - y + 1) + f(Y - y, n + n - x - y); n return f(X + y - x - Y, X - x + 1) + f(X - x, n + n - x - y); n } n long long rm[4]; n bool ok(int X, int Y) { n for (int i = 0; i < 4; ++i) n if ((rm[i] = T - cost[i] - Cal(X, Y, x[i], y[i])) < 0) return false; n if (X < a + c && Y < b + c) n return ((rm[1] >> 1) + (rm[2] >> 1)) >= n (long long)(a + c - max((int)a, X)) * (b + c - max((int)b, Y)); n return true; n } n int main() { n cin >> n >> T >> a >> b >> c; n --c; n x[1] = x[0] = a, y[2] = y[0] = b; n x[2] = x[3] = a + c, y[1] = y[3] = b + c; n int X = 1, Y = 1; n for (int i = 0; i < 4; ++i) n if (Cal(X, Y, x[i], y[i]) - abs(x[i] - X) - abs(y[i] - Y) > T) n return puts( Impossible ), 0; n while (X != n || Y != n) { n if (X < n && ok(X + 1, Y)) n ++X, ans += R ; n else n ++Y, ans += U ; n for (int i = 0; i < 4; ++i) cost[i] += abs(x[i] - X) + abs(y[i] - Y); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m; n cin >> n >> m; n int s, f, t; n for (int i = 0; i < n; i++) { n cin >> s >> f >> t; n int flag = t / (m - 1); n int yushu = t % (m - 1); n int floor; n if (flag & 1) { n floor = m - yushu; n } else n floor = 1 + yushu; n int totaltime = 0; n if (s > floor) { n if (flag % 2 == 0) n totaltime = s - floor; n else n totaltime = floor - 1 + s - 1, flag = 0; n floor = s; n } else if (s < floor) { n if (flag % 2 == 0) { n totaltime = (m - floor) + (m - s); n flag = 1; n } else n totaltime = floor - s; n floor = s; n } n if (s == f) { n totaltime = t; n } else { n if (floor > f) { n if (flag % 2 == 0) { n totaltime += (m - floor + m - f); n } else n totaltime += floor - f; n } else if (floor < f) { n if (flag % 2 == 0) n totaltime += f - floor; n else n totaltime += floor - 1 + f - 1; n } n totaltime += t; n } n cout << totaltime << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 1e5 + 25; n long long a[MAX]; n int main() { n ios_base::sync_with_stdio(false); n long long n, k, h; n cin >> n >> h >> k; n for (int i = 0; i < n; i++) cin >> a[i]; n long long ans = 0; n long long in = a[0]; n for (int i = 1; i < n; i++) { n if (in + a[i] <= h) { n in += a[i]; n } else { n double x = (a[i] + in - h) * 1.0 / k; n long long x1 = floor(x); n long long x2 = ceil(x); n long long t1 = in, t2 = in; n t1 -= x1 * k; n if (t1 < 0) t1 = 0; n if (t1 + a[i] <= h) { n in -= x1 * k; n if (in < 0) in = 0; n in += a[i]; n ans += x1; n continue; n } n t2 -= x2 * k; n if (t2 < 0) t2 = 0; n if (t2 + a[i] <= h) { n in -= x2 * k; n if (in < 0) in = 0; n in += a[i]; n ans += x2; n } n } n } n if (in > 0) { n long long t1 = in / k; n long long t2 = in % k; n ans += t1; n if (t2) ans++; n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n std::ios::sync_with_stdio(false); n std::cin.tie(0); n long long n; n cin >> n; n vector v(n); n for (int i = (0); i < (n); ++i) cin >> v[i]; n sort(v.begin(), v.end()); n vector res = {v[0]}; n for (int i = (0); i < (n); ++i) n for (int j = (0); j < (31); ++j) { n int lx = v[i] - (1 << j); n int rx = v[i] + (1 << j); n bool isl = binary_search(v.begin(), v.end(), lx); n bool isr = binary_search(v.begin(), v.end(), rx); n if (isl && isr && int(res.size()) < 3) { n res = {lx, v[i], rx}; n } n if (isl && int((int)res.size()) < 2) { n res = {lx, v[i]}; n } n } n cout << (int)res.size() << endl; n for (auto it : res) cout << it << ; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 0; n const int MOD = 1000000007; n template n inline void CLR(T &g) { n T t; n swap(t, g); n } n template n inline void CLR(T &g, int a) { n memset(g, a, sizeof g); n } n template n inline void CPY(T &a, T &b) { n memcpy(a, b, sizeof a); n } n template n inline bool inr(T a, T b, T c) { n return (a >= b && a <= c); n } n inline int acc(int a, int b) { return !!(a & (1 << b - 1)); } n inline int fil(int a, int b, int c) { n return a & ~(1 << b - 1) | (c ? (1 << b - 1) : 0); n } n int N, M, K, Q; n int a, b, c, l; n long long calc1(int p, int x1, int x2, int y1, int y2) { n int dx = x2 - x1 + 1, dy = y2 - y1 + 1; n if (dx <= dy) { n if (p - x1 < y1) n return 0; n else if (p - x2 < y1) n return (1ll * (p - x1 - y1 + 1 + 1) * (p - x1 - y1 + 1) / 2); n else if (p - x1 < y2) n return (1ll * (p - x1 - y1 + 1 + 1) * (p - x1 - y1 + 1) / 2) - n (1ll * (p - x2 - y1 + 1) * (p - x2 - y1) / 2); n else if (p - x2 <= y2) n return (1ll * (p - x1 - y1 + 1 + 1) * (p - x1 - y1 + 1) / 2) - n (1ll * (p - x2 - y1 + 1) * (p - x2 - y1) / 2) - n (1ll * (p - x1 - y2 + 1) * (p - x1 - y2) / 2); n else n return 1ll * (x2 - x1 + 1) * (y2 - y1 + 1); n } else n return calc1(p, y1, y2, x1, x2); n } n long long calc(int p, int x1, int x2, int y1, int y2) { n if (l + a + b + c - p <= p) return 0; n if (x1 > x2 || y1 > y2) return 0; n return -calc1(p, x1, x2, y1, y2) + calc1(l + a + b + c - p, x1, x2, y1, y2); n } n int main() { n int T, o = 0; n scanf( %d%d%d%d , &a, &b, &c, &l); n long long sum = 0; n for (register int(i) = a, _end_ = (a + l); (i) <= _end_; ++(i)) n sum += calc(i, b, i, c, i); n for (register int(i) = b, _end_ = (b + l); (i) <= _end_; ++(i)) n sum += calc(i, a, i - 1, c, i); n for (register int(i) = c, _end_ = (c + l); (i) <= _end_; ++(i)) n sum += calc(i, a, i - 1, b, i - 1); n cout << sum << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 4e5 + 5; n const int MAXQ = 5e5 + 5; n const int MAXP = 8e6 + 5; n template n void chkmax(T &x, T y) { n x = max(x, y); n } n template n void chkmin(T &x, T y) { n x = min(x, y); n } n template n void read(T &x) { n x = 0; n int f = 1; n char c = getchar(); n for (; !isdigit(c); c = getchar()) n if (c == - ) f = -f; n for (; isdigit(c); c = getchar()) x = x * 10 + c - 0 ; n x *= f; n } n template n void write(T x) { n if (x < 0) x = -x, putchar( - ); n if (x > 9) write(x / 10); n putchar(x % 10 + 0 ); n } n template n void writeln(T x) { n write(x); n puts( ); n } n struct SegmentTreeMerging { n struct Node { n int lc, rc, sum; n bool leaf; n } a[MAXP]; n int size, n; n void init(int x) { n n = x; n size = 0; n } n void update(int root) { a[root].sum = a[a[root].lc].sum + a[a[root].rc].sum; } n void modify(int &root, int l, int r, int pos, int d) { n if (root == 0) root = ++size; n if (l == r) { n a[root].sum += d; n a[root].leaf = true; n return; n } n int mid = (l + r) / 2; n if (mid >= pos) n modify(a[root].lc, l, mid, pos, d); n else n modify(a[root].rc, mid + 1, r, pos, d); n update(root); n } n void modify(int &root, int val, int d) { modify(root, 1, n, val, d); } n int merge(int x, int y) { n if (x == 0 || y == 0) return x + y; n if (a[x].leaf) { n a[x].sum += a[y].sum; n return x; n } n a[x].lc = merge(a[x].lc, a[y].lc); n a[x].rc = merge(a[x].rc, a[y].rc); n update(x); n return x; n } n void join(int &to, int from) { to = merge(to, from); } n int query(int root, int l, int r, int ql, int qr) { n if (root == 0) return 0; n if (l == ql && r == qr) return a[root].sum; n int mid = (l + r) / 2, ans = 0; n if (mid >= ql) ans += query(a[root].lc, l, mid, ql, min(mid, qr)); n if (mid + 1 <= qr) n ans += query(a[root].rc, mid + 1, r, max(mid + 1, ql), qr); n return ans; n } n int query(int root, int l, int r) { return query(root, 1, n, l, r); } n } ST; n struct SuffixAutomaton { n struct Node { n int child[26]; n int father, depth; n } a[MAXN]; n vector e[MAXN]; n vector home[MAXN]; n vector> s[MAXN]; n int n, root, size, last; n int newnode(int dep) { n a[++size].depth = dep; n return size; n } n void init() { n size = 0; n root = last = 0; n } n void extend(int ch) { n int p = last, np; n if (a[p].child[ch]) { n int q = a[p].child[ch]; n if (a[p].depth + 1 == a[q].depth) n np = q; n else { n np = newnode(a[p].depth + 1); n memcpy(a[np].child, a[q].child, sizeof(a[q].child)); n a[np].father = a[q].father; n a[q].father = np; n while (a[p].child[ch] == q) { n a[p].child[ch] = np; n p = a[p].father; n } n } n } else { n np = newnode(a[p].depth + 1); n while (a[p].child[ch] == 0) { n a[p].child[ch] = np; n p = a[p].father; n } n if (a[p].child[ch] == np) n a[np].father = root; n else { n int q = a[p].child[ch]; n if (a[q].depth == a[p].depth + 1) n a[np].father = q; n else { n int nq = newnode(a[p].depth + 1); n memcpy(a[nq].child, a[q].child, sizeof(a[q].child)); n a[nq].father = a[q].father; n a[q].father = a[np].father = nq; n while (a[p].child[ch] == q) { n a[p].child[ch] = nq; n p = a[p].father; n } n } n } n } n last = np; n } n void insert(char *s) { n last = 0, n++; n int len = strlen(s + 1); n for (int i = 1; i <= len; i++) { n extend(s[i] - a ); n home[n].push_back(last); n } n } n int rt[MAXN], ans[MAXQ]; n vector, int>> q[MAXN]; n void work(int pos) { n for (auto x : s[pos]) ST.modify(rt[pos], x.first, x.second); n for (auto x : e[pos]) { n work(x); n ST.join(rt[pos], rt[x]); n } n for (auto x : q[pos]) n ans[x.second] = ST.query(rt[pos], x.first.first, x.first.second); n } n void solve(int m) { n for (int i = 1; i <= size; i++) e[a[i].father].push_back(i); n for (int i = 1; i <= n; i++) n for (unsigned j = 0; j < home[i].size(); j++) n s[home[i][j]].emplace_back(i, 1); n work(0); n for (int i = 1; i <= m; i++) writeln(ans[i]); n } n } SAM; n char s[MAXN]; n int main() { n int n, m; n read(n), read(m); n SAM.init(), ST.init(n); n for (int i = 1; i <= n; i++) { n scanf( n%s , s + 1); n SAM.insert(s); n } n for (int i = 1; i <= m; i++) { n int l, r, k; n read(l), read(r), read(k); n SAM.q[SAM.home[k].back()].emplace_back(make_pair(l, r), i); n } n SAM.solve(m); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[100000], d[100000]; n int main() { n int n, ans = 0; n cin >> n; n for (int i = 0; i < n; i++) scanf( %d , &a[i]); n vector p; n for (int i = 0; i < n; i++) { n if (a[i] == 1) ans = max(ans, 1); n p.clear(); n int x = a[i]; n int k = 0; n for (int j = 2; j <= sqrt(x); j++) n if (x % j == 0) { n p.push_back(j); n k = max(k, d[j] + 1); n while (x % j == 0) x /= j; n } n if (x > 1) { n p.push_back(x); n k = max(k, d[x] + 1); n } n ans = max(ans, k); n for (int j = 0; j < p.size(); j++) d[p[j]] = max(d[p[j]], k); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 1010, mod = 1000000007; n vector > lst[M]; n vector > flag[M]; n vector sz[M]; n vector tmp, bmp; n vector > edge; n int id[M][M]; n int pos[M][M]; n int visited[M]; n string s, t; n void make_list(int u, string &a) { n int i = 0, j = 0; n char d[10]; n tmp.clear(); n a += , ; n while (a[i] != : ) i++; n i++; n while (i < a.size()) { n if (a[i] == , ) { n d[j++] = 0 ; n if (atoi(d) > 0) tmp.push_back(atoi(d)); n j = 0; n } else n d[j++] = a[i]; n i++; n } n bmp.resize(tmp.size()); n for (i = 0; i < tmp.size(); i++) { n int v = tmp[i]; n id[v][u] = lst[u].size(); n pos[v][u] = i; n } n lst[u].push_back(tmp); n flag[u].push_back(bmp); n sz[u].push_back(tmp.size()); n } n void dec(int u, int v) { n for (int i = 0; i < lst[u].size(); i++) { n for (int j = 0; j < lst[u][i].size(); j++) { n if (lst[u][i][j] == v) { n sz[u][i]--; n flag[u][i][j] = 1; n return; n } n } n } n } n bool isinsane(int u) { n int i, j, k, cnt = 0; n for (i = 0; i < lst[u].size(); i++) cnt += (sz[u][i] > 0); n return cnt != 1; n } n pair find_leaf(int n) { n int i, j, k; n vector r; n for (i = 1; i <= n; i++) r.push_back(i); n random_shuffle((r).begin(), (r).end()); n for (int first = 0; first < r.size(); first++) { n i = r[first]; n if (visited[i]) continue; n for (j = 0; j < lst[i].size(); j++) { n if (sz[i][j] == 1) { n for (k = 0; k < flag[i][j].size(); k++) { n if (flag[i][j][k] == 0) return make_pair(i, lst[i][j][k]); n } n } n } n } n return make_pair(-1, -1); n } n int main() { n ios_base::sync_with_stdio(false); n int n, i, j, k; n srand(time(NULL)); n memset((id), (-1), sizeof(id)); n cin >> n; n for (j = 1; j <= n; j++) { n cin >> s; n s += - ; n for (i = 0; i < s.size(); i++) { n if (s[i] == - ) { n make_list(j, t); n t.clear(); n } else n t += s[i]; n } n } n while (true) { n pair g = find_leaf(n); n if (g.first == -1) break; n edge.push_back(g); n int u = g.second, v = g.first; n visited[u] = 1; n if (isinsane(u)) { n printf( %d n , -1); n return 0; n } n for (i = 1; i <= n; i++) { n if (visited[i]) continue; n int l = id[u][i], r = id[v][i], p = pos[u][i]; n if (l == -1) continue; n if (i != v && l != r) { n printf( %d n , -1); n return 0; n } n flag[i][l][p] = 1; n sz[i][l]--; n } n dec(u, g.first); n } n if (edge.size() != n - 1) n printf( %d n , -1); n else { n printf( %d n , edge.size()); n for (pair e : edge) printf( %d %d n , e.first, e.second); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline void checkMAX(int& a, int b) { n if (a < b) a = b; n } n inline void checkMIN(int& a, int b) { n if (a > b) a = b; n } n int main() { n char s[333] = {}; n cin >> s; n int mn = 0, mx = 0, curr = 0; n for (int i = 0; s[i]; i++) { n if (s[i] == + ) n curr++; n else n curr--; n checkMIN(mn, curr); n checkMAX(mx, curr); n } n cout << (mx - mn) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n char str[25]; n gets(str); n int let[26]; n for (int i = 0; i < 26; i++) { n let[i] = 0; n } n int len = 0; n for (int i = 0; str[i]; i++) { n let[str[i] - a ]++; n len++; n } n long long c = 0; n for (int i = 0; i < 26; i++) { n c = c + (len + 1) - let[i]; n } n cout << c << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, cnt = 0; n cin >> n; n for (int i = 1; i <= n; i++) { n int ans = (i * (i + 1)) / 2; n if (ans == n) { n cnt = 1; n break; n } n } n if (cnt == 1) n cout << YES << endl; n else n cout << NO << endl; n } n "} +{"func_code_string": "#include n #define For(i, a, b) for(int i = a; i <= b; i++) n #define Ford(i, a, b) for(int i = a; i >= b; i--) n #define make_pair(a,b) mp(a, b) n n using namespace std; n const int N= 2e5 + 1067, K = 17, md=1e9 + 7; n int n, k; n int f[N][30], g[1 << K], dem[30]; n string s; n n bool check(int x) { n int en = n - 1; n for(char j = a ; j < a + k; j++) f[n][j] = f[n + 1][j] = n, dem[j] = 0; n Ford(i, n - 1, 0) { n for(char j = a ; j < a + k; j++) n f[i][j] = f[i + 1][j]; n ++dem[s[i]]; n if (en >= i + x) { n --dem[s[en]]; n en -= 1; n } n char c = - ; n int diversity = 0; n for(char j = a ; j < a + k; j++) { n if (dem[j]) { n diversity += 1; n c = j; n } n } n if (diversity == 0) { n for(char j = a ; j < a + k; j++) n f[i][j] = i + x - 1; n } else if (diversity == 1) { n f[i][c] = i + x - 1; n } n } n n For(mask, 0, (1 << k) - 1) g[mask] = n; n g[0] = -1; n For(mask, 0, (1 << k) - 1) { n For(i, 0, k - 1) if (!(mask & (1 << i))) { n g[mask ^ (1 << i)] = min(g[mask ^ (1 << i)], f[g[mask] + 1][(char)( a + i)]); n } n } n n return g[(1 << k) - 1] < n; n } n n int bs(int l, int r) { n while (l < r) { n if (l == r - 1) { n if (check(r)) n return r; n else n return l; n } n int mid = (l + r) / 2; n if (check(mid)) n l = mid; n else n r = mid - 1; n } n return l; n } n n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n >> k; n cin >> s; n cout << bs(0, n) << endl; n }"} +{"func_code_string": "#include n using namespace std; n int n, a[150005]; n vector v; n set > ans; n int compute() { n int problem = 0; n for (int i = 1; i <= n; i = i + 2) { n if (a[i] >= a[i + 1]) { n problem++; n } n } n for (int i = 2; i <= n; i = i + 2) { n if (a[i] <= a[i + 1]) { n problem++; n } n } n return problem; n } n vector findproblems() { n vector q; n for (int i = 1; i <= n; i = i + 2) { n if (a[i] >= a[i + 1]) { n q.push_back(i); n if (i >= 1 && i <= n) { n q.push_back(i + 1); n } n } n } n for (int i = 2; i <= n; i = i + 2) { n if (a[i] <= a[i + 1]) { n q.push_back(i); n if (i >= 1 && i <= n) { n q.push_back(i + 1); n } n } n } n sort(q.begin(), q.end()); n return q; n } n void swap(int i, int j) { n int tempa = a[i]; n a[i] = a[j]; n a[j] = tempa; n } n int check(int e) { n if (e % 2 == 0) { n if (a[e] > a[e - 1] && a[e] > a[e + 1]) { n return 0; n } n return 1; n } n if (a[e] < a[e - 1] && a[e] < a[e + 1]) { n return 0; n } n return 1; n } n int threeandfour(int i, int j, vector q) { n swap(i, j); n int flag = 0; n for (int i = 0; i < q.size(); i++) { n flag += check(q[i]); n } n flag += check(i); n flag += check(j); n swap(i, j); n return flag; n } n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n } n a[0] = 150005; n if (n % 2 == 0) { n a[n + 1] = -10; n } else { n a[n + 1] = 150005; n } n int problem = compute(); n if (problem > 4) { n cout << 0 << endl; n } else { n v = findproblems(); n for (int i = 0; i < v.size(); i++) { n for (int j = 1; j <= n; j++) { n if (threeandfour(v[i], j, v) == 0) { n ans.insert(make_pair(v[i], j)); n ans.insert(make_pair(j, v[i])); n } n } n } n cout << ans.size() / 2 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool comp(pair a, pair b) { n if (a.second < b.second) return true; n return false; n } n bool com(pair a, pair b) { return a.first > b.first; } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n long long n, k; n cin >> n >> k; n vector ar(n); n vector > br(n); n for (long long i = 0; i < n; ++i) cin >> ar[i], br[i] = {ar[i], i}; n sort(br.begin(), br.end(), com); n br.resize(k); n sort(br.begin(), br.end(), comp); n long long mx = br[0].first, sec = 1; n for (long long i = 1; i < br.size(); ++i) { n mx += br[i].first; n sec = (sec * (br[i].second - br[i - 1].second)) % 998244353; n } n cout << mx << << sec; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5e5 + 10; n long long n, ans, f[N], now, sum; n char s[N]; n signed main() { n scanf( %lld , &n); n scanf( %s , s + 1); n for (long long i = 1; i <= n; i++) f[i] = n + 1; n for (long long i = n; i >= 1; i--) { n if (s[i] - 0 ) n sum += f[++now] - i; n else { n while (now) f[now] = now + i, now--; n } n ans += sum; n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 3e5 + 5; n int t; n struct node { n char id; n int num; n } ans[N]; n string a; n int cot; n int main() { n cin >> a; n if (a.length() == 1) { n cout << 0 << endl; n return 0; n } n cot = 1; n ans[cot].id = a[0]; n ans[cot].num = 1; n for (register int i = 0; i <= a.length() - 2; ++i) { n if (a[i + 1] == a[i]) n ans[cot].num++; n else { n ans[++cot].id = a[i + 1]; n ans[cot].num = 1; n } n } n if (cot % 2 == 0 || ans[cot / 2 + 1].num < 2) { n cout << 0 << endl; n return 0; n } n int now = 1; n int fg = 0; n while (now != cot / 2 + 1) { n if (ans[now].id != ans[cot - now + 1].id || n ans[now].num + ans[cot - now + 1].num < 3) { n fg = 1; n break; n } n now++; n } n if (!fg) n cout << ans[cot / 2 + 1].num + 1 << endl; n else n cout << 0 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n long long dx[] = {-1, 0, 1, 0}; n long long dy[] = {0, -1, 0, 1}; n vector v(10); n string s; n set st; n void call(string s, long long pos) { n if (pos == 10) { n sort(s.begin(), s.end()); n st.insert(s); n return; n } n if (v[pos] == 0) { n call(s, pos + 1); n return; n } n for (long long i = 1; i <= v[pos]; i++) { n char c = 0 + pos; n string x = string(i, c); n call(s + x, pos + 1); n } n } n int32_t main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n vector f(20); n f[0] = f[1] = 1; n for (long long i = 2; i < 20; i++) { n f[i] = f[i - 1] * i; n } n cin >> s; n for (long long i = 0; i < s.size(); i++) v[s[i] - 0 ]++; n string x = ; n call(x, 0); n long long ans = 0; n for (auto i : st) { n string &x = i; n vector cnt(10); n for (long long i = 0; i < x.size(); i++) { n cnt[x[i] - 0 ]++; n } n long long val = f[x.size()]; n for (long long i = 0; i < 10; i++) { n val = val / f[cnt[i]]; n } n ans += val; n if (v[0] > 0) { n long long val1 = f[x.size() - 1]; n cnt[0]--; n for (long long i = 0; i < 10; i++) val1 = val1 / f[cnt[i]]; n ans -= val1; n } n } n cout << ans << n ; n } n "} +{"func_code_string": "#include n int n; n int a[1001000]; n int b[1001000]; n int c[1001000]; n int ans; n int main() { n int i, j; n scanf( %d , &n); n n++; n for (i = 2; i <= n; i++) { n scanf( %d , &a[i]); n b[i] = 1; n c[i] = 0; n j = i; n if (ans < b[j]) ans = b[j]; n while (a[j] != 1) { n if (ans < b[j]) ans = b[j]; n if (ans < b[a[j]]) ans = b[a[j]]; n if (b[a[j]] < b[j]) { n b[a[j]] = b[j]; n c[a[j]] = 1; n } else if (c[a[j]] == 1 && b[a[j]] == b[j]) { n b[a[j]] = b[j] + 1; n c[a[j]] = 0; n } else if (c[a[j]] == 0 && b[a[j]] == b[j]) { n c[a[j]] = 1; n break; n } else n break; n if (ans < b[a[j]]) ans = b[a[j]]; n j = a[j]; n } n printf( %d , ans); n } n } n "} +{"func_code_string": "#include n using namespace std; n bool sortbysec(pair a, pair b) { n if (a.first != b.first) n return a.first > b.first; n else n return a.second < b.second; n } n int binarySearch(vector a, int n, int key) { n int low = 0; n int high = n, mid; n while (low <= high) { n mid = (low + high) / 2; n if (a[mid] <= key) { n low = mid + 1; n } else if (a[mid] > key) { n high = mid - 1; n } n } n if (high - low == 1) { n if (a[low] >= key) n return low; n else n return high; n } else n return mid; n } n vector SieveOfEratosthenes(int n) { n vector prime(n + 1, 1); n for (int p = 2; p * p <= n; p++) { n if (prime[p] == 1) { n for (int i = p * p; i <= n; i += p) prime[i] = 0; n } n } n return prime; n } n vector> v; n void primeFactors(long long n) { n v.clear(); n long long k = 0; n while (n % 2 == 0) { n k++; n n = n / 2; n } n if (k != 0) v.push_back({2, k}); n for (long long i = 3; i <= sqrt(n); i = i + 2) { n k = 0; n while (n % i == 0) { n k++; n n = n / i; n } n if (k != 0) v.push_back({i, k}); n } n if (n > 2) v.push_back({n, 1}); n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int t = 1; n while (t--) { n long long n; n cin >> n; n long long ans = n; n long long a[n]; n for (int i = 0; i < n; i++) { n cin >> a[i]; n ans += (i + 1) * (a[i] - 1); n } n cout << ans; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, a; n cin >> n >> a; n if (a % 2 != 0) { n cout << (((a - 1) / 2) + 1) << n ; n } else { n cout << ((n / 2) - ((a - 2) / 2)) << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, x, _, a, d, t[100001], ans; n long long rua(long long l, long long r) { n if (r < l) return _; n if (_ >= n * a) { n ans++; n return r + d; n } n if (l % a && l / a == r / a) { n ans++; n return r + d; n } n long long f = min((l - 1) / a + 1, n); n long long la = min(r / a, n); n long long k = (la - f) / x + 1; n ans += k; n f += (k - 1) * x; n f *= a; n if (f + d >= r) { n return f + d; n } n ans++; n return r + d; n } n int main() { n scanf( %I64d%I64d%I64d%I64d , &n, &m, &a, &d), x = d / a + 1; n for (long long i = 1; i <= m; i++) n scanf( %I64d , &t[i]), _ = rua(_ + 1, t[i]); n rua(_ + 1, n * a); n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, a[100001], q, sum; n int b[1000001]; n int main() { n int n, m, q, sum = 0; n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> a[i]; n b[a[i] + sum] = i; n b[1 + sum] = i; n sum += a[i]; n } n cin >> m; n for (int j = 1; j <= m; j++) { n cin >> q; n if (b[q]) { n cout << b[q] << endl; n continue; n } n for (int k = 1; k <= 1000; k++) { n if (b[q + k]) { n cout << b[q + k] << endl; n break; n } n if (b[q - k]) { n cout << b[q - k] << endl; n break; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n long long int sum = 0; n cin >> n; n int a, b; n int max = INT_MIN; n for (int i = 0; i < n; i++) { n cin >> a >> b; n sum = sum - a + b; n if (max < sum) max = sum; n } n cout << max; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC target( avx,avx2,fma ) n #pragma GCC optimization( unroll-loops ) n const int mod = 1e9 + 7; n using namespace std; n template n void cinn(T& x) { n cin >> x; n } n template n void cinn(H& h, T&... t) { n cinn(h); n cinn(t...); n } n template n void cinn(vector& x) { n for (auto& a : x) cinn(a); n } n void Shazam() { n long long n, k; n cinn(n, k); n vector a(n); n cinn(a); n long long ans = 0; n for (long long i = k; i < 101; i++) { n long long cnt = 0; n for (long long j = 0; j < n; j++) { n cnt += (a[j] / i); n } n ans = max(ans, cnt * i); n } n cout << ans << n ; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n long long t = 1; n while (t--) Shazam(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int const N = 1e5 + 13; n int const INF = 1e9 + 13; n int n, m; n set p[N]; n int l[N], r[N]; n int pos[N], x[N]; n int tsz; n int a[N]; n int type[N]; n vector t[N * 4], tright[N * 4]; n vector F[N * 4]; n vector qid; n vector> qpos[N]; n vector lposes; n bool cmpl(int i, int j) { return l[i] < l[j]; } n void merge(vector &v, vector &l, vector &r) { n int lp = 0; n int rp = 0; n int ln = l.size(); n int rn = r.size(); n while (lp < ln || rp < rn) { n if (rp == rn || (lp < ln && ::r[l[lp]] < ::r[r[rp]])) { n v.push_back(l[lp++]); n } else { n v.push_back(r[rp++]); n } n } n } n void build(int v, int tl, int tr) { n if (tl == tr) { n t[v].push_back(qid[tl]); n F[v].assign(1, 0LL); n for (int i = 0; i < t[v].size(); ++i) { n qpos[t[v][i]].push_back(make_pair(v, i)); n } n tright[v].push_back(r[qid[tl]]); n } else { n int tm = (tl + tr) / 2; n build(v * 2 + 1, tl, tm); n build(v * 2 + 2, tm + 1, tr); n merge(t[v], t[v * 2 + 1], t[v * 2 + 2]); n for (int i = 0; i < t[v].size(); ++i) { n qpos[t[v][i]].push_back(make_pair(v, i)); n tright[v].push_back(r[t[v][i]]); n } n F[v].assign(t[v].size(), 0LL); n } n } n void updF(vector &F, int x, int v) { n int n = F.size(); n while (x < n) { n F[x] += v; n x |= (x + 1); n } n } n long long getF(vector &F, int x) { n long long res = 0; n while (x >= 0) { n res += F[x]; n x = (x & (x + 1)) - 1; n } n return res; n } n void upd(vector &F, int l, int r, int val) { n if (l > r) return; n updF(F, l, val); n updF(F, r + 1, -val); n } n int getLeft(vector &v, int val) { n int l = -1; n int r = v.size(); n while (r - l > 1) { n int m = (l + r) / 2; n if (v[m] >= val) n r = m; n else n l = m; n } n return r; n } n int getRight(vector &v, int val) { n int l = -1; n int r = v.size(); n while (r - l > 1) { n int m = (l + r) / 2; n if (v[m] <= val) n l = m; n else n r = m; n } n return l; n } n void upd(int v, int tl, int tr, int ll, int lr, int rl, int rr, int val) { n if (tl > lr || ll > tr) return; n if (ll <= tl && tr <= lr) { n int left = getLeft(tright[v], rl); n int right = getRight(tright[v], rr); n upd(F[v], left, right, val); n return; n } n int tm = (tl + tr) / 2; n upd(v * 2 + 1, tl, tm, ll, lr, rl, rr, val); n upd(v * 2 + 2, tm + 1, tr, ll, lr, rl, rr, val); n } n long long answer(int id) { n long long res = 0; n for (int i = 0; i < qpos[id].size(); ++i) { n res += getF(F[qpos[id][i].first], qpos[id][i].second); n } n return res; n } n void push(int pos, int val) { n set::iterator bef, aft; n bef = p[val].lower_bound(pos); n aft = p[val].upper_bound(pos); n if (bef != p[val].begin()) { n --bef; n int lp = (*bef); n int dist = pos - lp; n lp = getRight(lposes, lp); n int rp = (aft == p[val].end() ? INF : (*aft) - 1); n upd(0, 0, tsz - 1, 0, lp, pos, rp, dist); n } n bef = p[val].lower_bound(pos); n aft = p[val].upper_bound(pos); n if (aft != p[val].end()) { n int lp; n if (bef != p[val].begin()) { n --bef; n lp = (*bef) + 1; n } else { n lp = 0; n } n lp = getLeft(lposes, lp); n int rp = getRight(lposes, pos); n int rpp = (*aft); n int dist = rpp - pos; n upd(0, 0, tsz - 1, lp, rp, rpp, INF, dist); n } n p[val].insert(pos); n } n void pop(int pos, int val) { n p[val].erase(pos); n set::iterator bef, aft; n bef = p[val].lower_bound(pos); n aft = p[val].upper_bound(pos); n if (bef != p[val].begin()) { n --bef; n int lp = (*bef); n int dist = pos - lp; n lp = getRight(lposes, lp); n int rp = (aft == p[val].end() ? INF : (*aft) - 1); n upd(0, 0, tsz - 1, 0, lp, pos, rp, -dist); n } n bef = p[val].lower_bound(pos); n aft = p[val].upper_bound(pos); n if (aft != p[val].end()) { n int lp; n if (bef != p[val].begin()) { n --bef; n lp = (*bef) + 1; n } else { n lp = 0; n } n lp = getLeft(lposes, lp); n int rp = getRight(lposes, pos); n int rpp = (*aft); n int dist = rpp - pos; n upd(0, 0, tsz - 1, lp, rp, rpp, INF, -dist); n } n } n void solve() { n cin >> n >> m; n for (int i = 0; i < n; ++i) cin >> a[i]; n for (int i = 0; i < m; ++i) { n cin >> type[i]; n if (type[i] == 1) { n cin >> pos[i] >> x[i]; n --pos[i]; n } else { n cin >> l[i] >> r[i]; n --l[i]; n --r[i]; n qid.push_back(i); n } n } n tsz = qid.size(); n if (tsz == 0) return; n sort(qid.begin(), qid.end(), cmpl); n for (int i = 0; i < qid.size(); ++i) lposes.push_back(l[qid[i]]); n build(0, 0, tsz - 1); n for (int i = 0; i < n; ++i) push(i, a[i]); n for (int i = 0; i < m; ++i) { n if (type[i] == 1) { n pop(pos[i], a[pos[i]]); n a[pos[i]] = x[i]; n push(pos[i], a[pos[i]]); n } else { n long long ans = answer(i); n cout << ans << endl; n } n } n } n int main() { n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long bigmod(long long p, long long e, long long M) { n long long ret = 1; n for (; e > 0; e >>= 1) { n if (e & 1) ret = (ret * p) % M; n p = (p * p) % M; n } n return ret; n } n long long extended(long long a, long long b, long long &x, long long &y) { n a = abs(a); n b = abs(b); n long long g, x1, y1; n if (!b) { n x = 1; n y = 0; n g = a; n return g; n } n g = extended(b, a % b, x1, y1); n x = y1; n y = x1 - (a / b) * y1; n return g; n } n long long modinverse(long long a, long long M) { return bigmod(a, M - 2, M); } n long long bpow(long long p, long long e) { n long long ret = 1; n for (; e > 0; e >>= 1) { n if (e & 1) ret = (ret * p); n p = (p * p); n } n return ret; n } n int toInt(string s) { n int sm; n stringstream ss(s); n ss >> sm; n return sm; n } n int toLlint(string s) { n long long int sm; n stringstream ss(s); n ss >> sm; n return sm; n } n string convertInt(long long number) { n if (number == 0) return 0 ; n string temp = ; n string returnvalue = ; n while (number > 0) { n temp += number % 10 + 48; n number /= 10; n } n for (int i = 0; i < temp.length(); i++) n returnvalue += temp[temp.length() - i - 1]; n return returnvalue; n } n long long ar[550], n, m, b, modd; n long long dp[550][550]; n int main() { n long long n, m, b, modd; n cin >> n >> m >> b >> modd; n for (int i = 1; i <= n; i++) { n cin >> ar[i]; n } n for (int i = 1; i <= n; i++) { n if (ar[i] <= b) dp[1][ar[i]]++; n dp[1][ar[i]] %= 1000000007; n for (int j = 0; j <= b; j++) { n for (int k = 1; k <= m; k++) { n if (ar[i] + j > b) continue; n dp[k][ar[i] + j] += dp[k - 1][j]; n dp[k][ar[i] + j] %= modd; n } n } n } n long long ans = 0; n for (int i = 0; i <= b; i++) { n ans += dp[m][i]; n ans %= modd; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string a; n cin >> a; n int result; n result = 26 + 25 * a.length(); n cout << result; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, pos[200001]; n struct node { n node *l, *r; n long long int lazy, lazy2; n }; n node *root[200001]; n int build(int s, int e, node *n) { n if (s == e) { n n->l = n->r = NULL; n n->lazy = -1, n->lazy2 = 1; n return 0; n } n int mid = (s + e) / 2; n n->l = new node, n->r = new node; n build(s, mid, n->l), build(mid + 1, e, n->r); n n->lazy = n->lazy2 = 0; n return 0; n } n pair query(int s, int e, int q, node *n) { n if (s == e) return make_pair(n->lazy, n->lazy2); n int mid = (s + e) / 2; n pair p; n if (q <= mid) n p = query(s, mid, q, n->l); n else n p = query(mid + 1, e, q, n->r); n return make_pair(p.first + n->lazy, p.second + n->lazy2); n } n int update(int s, int e, int as, int ae, node *o, node *n, int x, int t) { n if ((s >= as) && (e <= ae)) { n n->l = o->l, n->r = o->r; n n->lazy = o->lazy + x, n->lazy2 = o->lazy2 + (long long int)x * t; n return 0; n } n int mid = (s + e) / 2; n if (ae <= mid) { n n->r = o->r, n->l = new node; n update(s, mid, as, ae, o->l, n->l, x, t); n } else if (as > mid) { n n->l = o->l, n->r = new node; n update(mid + 1, e, as, ae, o->r, n->r, x, t); n } else { n n->l = new node, n->r = new node; n update(s, mid, as, ae, o->l, n->l, x, t); n update(mid + 1, e, as, ae, o->r, n->r, x, t); n } n n->lazy = o->lazy, n->lazy2 = o->lazy2; n return 0; n } n int tree[1 << 19]; n int build2(int s, int e, int i) { n if (s == e) { n tree[i] = -1; n return 0; n } n int mid = (s + e) / 2; n build2(s, mid, 2 * i + 1), build2(mid + 1, e, 2 * i + 2); n tree[i] = -1; n return 0; n } n int query2(int s, int e, int qs, int qe, int i) { n if ((s > qe) || (e < qs)) n return 1e9; n else if ((s >= qs) && (e <= qe)) n return tree[i]; n int mid = (s + e) / 2; n return min(query2(s, mid, qs, qe, 2 * i + 1), n query2(mid + 1, e, qs, qe, 2 * i + 2)); n } n int update2(int s, int e, int ai, int i, int num) { n if ((s > ai) || (e < ai)) n return 0; n else if (s == e) { n tree[i] = num; n return 0; n } n int mid = (s + e) / 2; n update2(s, mid, ai, 2 * i + 1, num), update2(mid + 1, e, ai, 2 * i + 2, num); n tree[i] = min(tree[2 * i + 1], tree[2 * i + 2]); n return 0; n } n int update3(int s, int e, int as, int ae, int i, int ol, int nl, int t) { n if ((s > ae) || (e < as)) n return 0; n else if (ol == nl) n return 0; n else if ((s >= as) && (e <= ae)) { n if (s == e) { n nl = min(nl, tree[i]), ol = min(ol, tree[i]); n if (nl > ol) { n node *r2 = new node; n update(0, n, s, e, root[t + 1], r2, nl - ol, t); n root[t + 1] = r2; n } n return 0; n } else if (nl <= tree[i]) { n node *r2 = new node; n update(0, n, s, e, root[t + 1], r2, nl - ol, t); n root[t + 1] = r2; n return 0; n } n } n int mid = (s + e) / 2; n update3(s, mid, as, ae, 2 * i + 1, ol, nl, t); n update3(mid + 1, e, as, ae, 2 * i + 2, min(ol, tree[2 * i + 1]), n min(nl, tree[2 * i + 1]), t); n return 0; n } n long long int getAns(int l, int r, int k) { n if (k == -1) return (long long int)(r - l + 1) * (r - l + 2) / 2; n int s = 0, e = r + 1; n while (s < e) { n int m = (s + e) / 2; n pair p = query(0, n, k, root[m + 1]); n if (p.first < l) n s = m + 1; n else n e = m; n } n if (s > r) n return 0; n else { n pair p = query(0, n, k, root[r + 1]); n pair p2 = query(0, n, k, root[s]); n return (p.first * (r + 1) - p.second) - (p2.first * s - p2.second) - n (long long int)(r - s + 1) * (l - 1); n } n } n int main() { n int i; n int a, l, r, k; n long long int lans = 0; n scanf( %d , &n); n for (i = 0; i <= n; i++) pos[i] = -1; n root[0] = new node; n build(0, n, root[0]), build2(0, n, 0); n for (i = 0; i < n; i++) { n scanf( %d %d %d %d , &a, &l, &r, &k); n a = (a + lans) % (n + 1); n l = (l + lans) % (i + 1); n r = (r + lans) % (i + 1); n if (l > r) swap(l, r); n k = (k + lans) % (n + 1); n int q = query2(0, n, 0, a, 0); n if (q != pos[a]) n pos[a] = i, update2(0, n, a, 0, i), root[i + 1] = root[i]; n else { n pos[a] = i, update2(0, n, a, 0, i); n int q2 = query2(0, n, 0, a, 0); n root[i + 1] = root[i]; n update3(0, n, a, n, 0, q, q2, i); n } n lans = getAns(l, r, k - 1) - getAns(l, r, k); n printf( %I64d n , lans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n class node { n public: n int lo, hi, value; n node *left, *right; n node(const int _lo, const int _hi) { n left = right = NULL; n lo = _lo, hi = _hi, value = 0; n } n void build() { n if (lo == hi) return; n const int mid = (lo + hi) >> 1; n left = new node(lo, mid), left->build(); n right = new node(mid + 1, hi), right->build(); n } n void update(const int idx) { n if (lo > idx or hi < idx) return; n if (lo == idx and hi == idx) { n ++value; n return; n } n left->update(idx); n right->update(idx); n value = left->value + right->value; n } n int query(const int _lo, const int _hi) { n if (lo > _hi or hi < _lo) return 0; n if (lo >= _lo and hi <= _hi) return value; n int a = left->query(_lo, _hi); n int b = right->query(_lo, _hi); n return a + b; n } n int leftmost() { n if (lo == hi) return lo; n if (left->value) return left->leftmost(); n return right->leftmost(); n } n int rightmost() { n if (value == hi - lo + 1) return lo - 1; n if (lo == hi) return lo; n if (right->value < right->hi - right->lo + 1) return right->rightmost(); n return left->rightmost(); n } n }; n int main() { n printf( 1 ); n int n; n scanf( %d , &n); n node root = node(1, n); n root.build(); n for (int i = 0; i < n; ++i) { n int x; n scanf( %d , &x); n root.update(x); n printf( %d , root.query(root.leftmost(), root.rightmost()) + 1); n } n return !printf( n ); n }; n "} +{"func_code_string": "#include n using namespace std; n int tree[(1 << 20)]; n void add(int x, int val) { n for (int i = x; i < (1 << 20); i = ((i) | (i + 1))) tree[i] += val; n } n int sum(int x) { n int ans = 0; n for (int i = x; i > 0; i = ((i) & (i - 1))) ans += tree[i - 1]; n return ans; n } n int N, Q; n map idtohook; n map appearance; n priority_queue > segments; n map nextL, nextR; n vector > > query; n map zip; n vector ans; n int input(void) { n int ans; n scanf( %d , &ans); n return ans; n } n void count_query(int low, int high) { n query.push_back(make_pair(0, make_pair(low, high))); n zip[low] = zip[high] = 0; n } n void enter_query(int id) { n int hook = -1; n while (1) { n pair p = segments.top(); n segments.pop(); n int L = p.second; n int R = L + p.first; n if (nextR[L] != R || nextL[R] != L) continue; n hook = (L + R + 1) / 2; n nextL[hook] = L; n nextL[R] = hook; n nextR[L] = hook; n nextR[hook] = R; n segments.push(make_pair(hook - L, L)); n segments.push(make_pair(R - hook, hook)); n break; n } n query.push_back(make_pair(1, make_pair(hook, 1))); n idtohook[id] = hook; n zip[hook] = 0; n } n void leave_query(int id) { n int hook = idtohook[id]; n int L = nextL[hook], R = nextR[hook]; n nextL[hook] = nextR[hook] = -1; n nextL[R] = L; n nextR[L] = R; n segments.push(make_pair(R - L, L)); n query.push_back(make_pair(1, make_pair(hook, -1))); n } n void solve(void) { n int i; n i = 0; n for (__typeof((zip).begin()) itr = (zip).begin(); itr != (zip).end(); itr++) { n (itr->second) = i; n i++; n } n for ((i) = 0; (i) < (int)(query.size()); (i)++) { n int type = query[i].first; n if (type == 0) { n int low = zip[query[i].second.first]; n int high = zip[query[i].second.second]; n int tmp = sum(high + 1); n if (low > 0) tmp -= sum(low); n ans.push_back(tmp); n } else { n int pos = zip[query[i].second.first]; n add(pos, query[i].second.second); n } n } n } n int main(void) { n int i; n N = input(); n Q = input(); n segments.push(make_pair(N + 1, 0)); n nextR[0] = N + 1; n nextL[N + 1] = 0; n zip[0] = zip[N + 1] = 0; n for ((i) = 0; (i) < (int)(Q); (i)++) { n int x = input(); n if (x == 0) { n int low = input(), high = input(); n count_query(low, high); n } else { n appearance[x]++; n int tmp = appearance[x]; n if (tmp % 2 == 1) { n enter_query(x); n } else { n leave_query(x); n } n } n } n solve(); n for ((i) = 0; (i) < (int)(ans.size()); (i)++) printf( %d n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n int main() { n int x; n int n, m; n scanf( %d %d , &n, &m); n if (m == 3 && n > 4) { n printf( -1 n ); n return 0; n } n for (x = 0; x < m; ++x) printf( %d %d n , x, x * x + 10001); n for (x = 0; x < n - m; ++x) printf( %d %d n , x, -x * x); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, tp; n int a[2000002]; n int main() { n scanf( %d , &tp); n int p = 1, i, j; n for (i = 0; i <= 100; i++) { n n++; n if (p == tp) break; n p *= 4; n } n for (i = 0; i < tp; i++) scanf( %d , &a[i]); n sort(a, a + tp); n long long ans = 0; n p = 1; n for (i = 0; i < n; i++) { n for (j = 0; j < p; j++) ans += (long long)a[tp - j - 1]; n p *= 4; n } n printf( %I64d , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int mod = 1000000007; n const int inf = 1034567891; n const long long LL_INF = 1234567890123456789ll; n template n void __f(const char* name, Arg1&& arg1) { n cout << name << : << arg1 << n ; n } n template n void __f(const char* names, Arg1&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n cout.write(names, comma - names) << : << arg1 << | ; n __f(comma + 1, args...); n } n template n T GCD(T a, T b) { n long long t; n while (a) { n t = a; n a = b % a; n b = t; n } n return b; n } n template n string toString(T a) { n return to_string(a); n } n template n void toInt(string s, T& x) { n stringstream str(s); n str >> x; n } n inline int add(int x, int y) { n x += y; n if (x >= mod) x -= mod; n return x; n } n inline int sub(int x, int y) { n x -= y; n if (x < 0) x += mod; n return x; n } n inline int mul(int x, int y) { return (x * 1ll * y) % mod; } n inline int powr(int a, long long b) { n int x = 1 % mod; n while (b) { n if (b & 1) x = mul(x, a); n a = mul(a, a); n b >>= 1; n } n return x; n } n inline int inv(int a) { return powr(a, mod - 2); } n string str; n long long give(int l, int r) { n long long ans = 0, p = 0; n for (int i = r; i >= l; i--) { n ans += (1ll << p) * (str[i] - 48); n p++; n } n return ans; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int test; n cin >> test; n while (test--) { n cin >> str; n int n = str.size(); n long long ans = 0; n int nxt = -1; n bool ok = false; n for (int i = n - 1; i >= 0; i--) { n if (!ok) { n nxt = i; n } n if (str[i] == 1 ) { n nxt = i; n } n int e = nxt - i; n for (int j = nxt; j < nxt + 20 && j < n; j++) { n long long num = give(nxt, j); n if (num == (j - nxt + 1 + e)) { n ans++; n } n } n if (str[i] == 1 ) { n ok = true; n nxt = i; n } n } n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long res = 1; n int main() { n int n; n cin >> n; n for (int i = 1; i < n; ++i) { n res += i * 12; n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int OO = 0x3f3f3f3f, N = 1e5 + 5, mod = 1e9 + 7; n const double pi = acos(-1), EPS = 1e-8; n int n; n string str; n map, deque> mp; n bool is(deque ck, string s) { n if (ck.size() != s.size()) return 0; n for (int i = 0; i < s.size(); ++i) n if (ck[i] != s[i]) return 0; n return 1; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n deque t; n t.push_back( v ); n t.push_back( o ); n t.push_back( i ); n t.push_back( d ); n mp[t] = t; n cin >> n; n cin.ignore(); n while (n--) { n getline(cin, str); n bool out = 0; n deque tmp, s; n for (int i = 0; i < str.size(); ++i) { n if (str[i] == ) { n if (tmp.size()) { n if (is(tmp, typeof )) n out = 1; n else n s = tmp; n } n tmp.clear(); n } else n tmp.push_back(str[i]); n } n deque var = tmp; n if (out) { n int And = 0, pointer = 0; n while (var.front() == & ) ++And, var.pop_front(); n while (var.back() == * ) ++pointer, var.pop_back(); n if (mp[var].size() == 0) { n cout << errtype n ; n continue; n } n var = mp[var]; n while (var.back() == * ) ++pointer, var.pop_back(); n int x = min(And, pointer); n And -= x; n pointer -= x; n if (And) n cout << errtype n ; n else if (mp[var].size()) { n for (char go : mp[var]) cout << go; n while (pointer--) cout << * ; n cout << n ; n } else n cout << errtype n ; n } else { n int And = 0, pointer = 0; n while (s.front() == & ) { n ++And; n s.pop_front(); n } n while (s.back() == * ) { n ++pointer; n s.pop_back(); n } n int x = min(And, pointer); n pointer -= x; n And -= x; n if (mp[s].size()) { n s = mp[s]; n while (s.back() == * && And) { n --And; n s.pop_back(); n } n while (s.front() == & && pointer) { n --pointer; n s.pop_front(); n } n if (And && mp[var].size()) n mp.erase(var); n else if (And == 0) { n while (pointer--) s.push_back( * ); n mp[var] = s; n } n } else if (mp[var].size()) n mp.erase(var); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct debugger { n template n debugger& operator,(const T& v) { n cerr << v << t ; n return *this; n } n } dbg; n template n ostream& operator<<(ostream& o, const pair& p) { n return o << ( << p.first << , << p.second << ) ; n } n template n ostream& operator<<(ostream& o, const vector& v) { n o << [ ; n for (__typeof((v).end()) it = (v).begin(); it != (v).end(); ++it) n o << *it << , ; n return o << ] ; n } n template n ostream& operator<<(ostream& o, const set& v) { n o << [ ; n for (__typeof((v).end()) it = (v).begin(); it != (v).end(); ++it) n o << *it << , ; n return o << ] ; n } n template n inline void MAX(T& a, T b) { n if (a < b) a = b; n } n template n inline void MIN(T& a, T b) { n if (a > b) a = b; n } n template n inline bool read(T& x) { n int c = getchar(); n int sgn = 1; n while (~c && c < 0 || c > 9 ) { n if (c == - ) sgn = -1; n c = getchar(); n } n for (x = 0; ~c && 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; n x *= sgn; n return ~c; n } n int a[15], l = 0; n int main() { n memset(a, 0, sizeof a); n for (__typeof((6) - 1) i = (0); i <= (6) - 1; ++i) { n int x = ({ n int a; n scanf( %d , &a); n a; n }); n a[x]++; n if (a[x] >= 4) l = x; n } n if (!l) n puts( Alien ); n else { n a[l] -= 4; n int c = 0; n for (__typeof((10) - 1) i = (0); i <= (10) - 1; ++i) n if (a[i]) c++; n if (c > 1) n puts( Bear ); n else n puts( Elephant ); n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast,unroll-loops ) n #pragma loop - opt(on) n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,avx,avx2,fma,tune=native ) n using namespace std; n const long long mxN = 1e5 + 5; n long long n, m, Q; n bitset vis, in, incy; n long long dsu[mxN], lca[mxN], eu[mxN], ev[mxN], tag[mxN], sum[mxN]; n vector g[mxN], q[mxN]; n long long get(long long x) { return x == dsu[x] ? x : dsu[x] = get(dsu[x]); } n void tarjan(long long u, long long p = -1) { n dsu[u] = u; n in[u] = 1; n for (long long v : g[u]) n if (!in[v]) tarjan(v, u); n for (long long i : q[u]) { n long long v = u ^ eu[i] ^ ev[i]; n if (vis[v]) { n lca[i] = get(v); n } n if (v == u) lca[v] = u; n } n vis[u] = 1; n dsu[u] = p; n } n vector stk; n void dfs(long long u, long long p = -1) { n vis[u] = in[u] = 1; n stk.emplace_back(u); n for (long long v : g[u]) { n if (v == p) continue; n if (in[v]) { n tag[v]++; n incy[v] = 1; n while (!stk.empty() and stk.back() != v) { n incy[stk.back()] = 1, stk.pop_back(); n } n stk.pop_back(); n } n if (vis[v]) continue; n dfs(v, u); n } n if (!stk.empty() and stk.back() == u) stk.pop_back(); n in[u] = 0; n } n void add(long long u) { n vis[u] = 1; n sum[u] += tag[u]; n for (long long v : g[u]) { n if (vis[v]) continue; n sum[v] += sum[u]; n add(v); n } n } n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n ; n cin >> n >> m; n while (m--) { n long long a, b; n cin >> a >> b; n g[a].emplace_back(b); n g[b].emplace_back(a); n } n dfs(1, 0); n vis = 0; n add(1); n cin >> Q; n for (long long i = 0; i < Q; i++) { n cin >> eu[i] >> ev[i]; n q[eu[i]].emplace_back(i); n q[ev[i]].emplace_back(i); n } n vis = 0; n in = 0; n tarjan(1, 0); n vector p2(n + 1); n p2[0] = 1; n for (long long i = 1; i <= n; i++) p2[i] = (p2[i - 1] << 1) % 1000000007; n for (long long i = 0; i < Q; i++) { n cout << p2[sum[eu[i]] + sum[ev[i]] - 2 * sum[lca[i]] + incy[lca[i]]] n << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, c = 0; n cin >> n; n for (long long i = 1; i < n; ++i) { n if (n % i == 0) c++; n } n cout << c << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char in[100000 + 1]; n int main() { n vector > cur, nex; n cur.push_back(array{{}}); n int n; n scanf( %d , &n); n scanf( %s , in); n for (int i = 0; i < n; i++) { n int p = -1; n switch (in[i]) { n case G : n p = 0; n break; n case H : n p = 1; n break; n case R : n p = 2; n break; n case S : n p = 3; n break; n } n if (p >= 0) { n for (int i = 0; i < cur.size(); i++) { n cur[i][p]++; n } n continue; n } n nex.clear(); n for (auto a : cur) { n int m = a[0]; n for (int i = 1; i < 4; i++) { n m = min(m, a[i]); n } n for (int i = 0; i < 4; i++) { n if (a[i] == m) { n nex.push_back(a); n nex.back()[i]++; n } n } n } n sort(nex.begin(), nex.end()); n nex.resize(unique(nex.begin(), nex.end()) - nex.begin()); n nex.swap(cur); n } n const char* str[] = { Gryffindor , Hufflepuff , Ravenclaw , Slytherin }; n for (int i = 0; i < 4; i++) { n for (auto a : cur) { n int m = a[0]; n for (int i = 1; i < 4; i++) { n m = min(m, a[i]); n } n if (a[i] == m) { n puts(str[i]); n break; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long cross(pair a, pair b, n pair c) { n pair v1 = n make_pair(b.first - a.first, b.second - a.second); n pair v2 = n make_pair(c.first - a.first, c.second - a.second); n if ((long long)v1.first * (long long)v2.second - n (long long)v2.first * (long long)v1.second > n 0) n return 1; n else if ((long long)v1.first * (long long)v2.second - n (long long)v2.first * (long long)v1.second < n 0) n return -1; n return 0; n } n int main(int argc, char* argv[]) { n long long n; n cin >> n; n vector arr(n); n for (long long i = 0; i < n; i++) { n cin >> arr[i]; n } n vector > p; n p.push_back(make_pair(-1, 0)); n long long s = 0; n for (long long i = 0; i < n; i++) { n s += arr[i]; n p.push_back(make_pair(i, s)); n } n stack > ch; n ch.push(p[0]); n ch.push(p[1]); n for (long long i = 2; i < n + 1; i++) { n pair top = ch.top(); n ch.pop(); n while (ch.size() > 0 && cross(ch.top(), top, p[i]) == -1) { n top = ch.top(); n ch.pop(); n } n ch.push(top); n ch.push(p[i]); n } n vector > vec; n while (ch.size()) { n vec.push_back(ch.top()); n ch.pop(); n } n reverse(vec.begin(), vec.end()); n vector cev; n long long cur = 0; n for (long long i = -1; i < n; i++) { n if (vec[cur].first == i) n cev.push_back(vec[cur].second); n else { n if (cur < vec.size() - 1 && vec[cur + 1].first <= i) { n cur++; n i--; n continue; n } n long long x1 = vec[cur + 1].first - vec[cur].first; n long long y1 = vec[cur + 1].second - vec[cur].second; n long long x2 = i - vec[cur].first; n cev.push_back((((double)x2 * (double)y1) / (double)x1) + vec[cur].second); n } n } n for (long long i = 0; i < cev.size() - 1; i++) { n cout << setprecision(13) << double(cev[i + 1] - cev[i]) << ; n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n bool func(deque& v) { n int x = v.back(); n if (x > 1) { n v.pop_back(); n int y = x / 2; n int y2 = x - y; n if (y == 1) n v.push_front(y); n else n v.push_back(y); n if (y2 == 1) n v.push_front(y2); n else n v.push_back(y2); n return true; n } n return false; n } n void printv(deque& v) { n for (int i = 0; i < v.size(); i++) cout << v[i] << ; n cout << endl; n } n int main() { n int k; n int xyz[3]; n cin >> xyz[0] >> xyz[1] >> xyz[2] >> k; n sort(xyz, xyz + 3); n deque first, second, third; n first.push_back(xyz[2]); n second.push_back(xyz[1]); n third.push_back(xyz[0]); n int i = 0; n while (i < k) { n if (func(first)) n i++; n else n break; n if (i < k && func(second)) i++; n if (i < k && func(third)) i++; n } n cout << (long long int)first.size() * second.size() * third.size(); n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int n; n cin >> n; n string s; n cin >> s; n int cnt = 0; n vector v; n char last = * ; n for (int i = 0, to = n; i < to; i++) { n if (last != s[i]) { n if (cnt > 0) v.push_back(cnt); n cnt = 1; n last = s[i]; n } else { n cnt++; n } n } n v.push_back(cnt); n int ans = 0; n int resto = 0; n for (int i = 0, to = (int)v.size(); i < to; i++) { n if (v[i] > 1) { n resto -= (v[i] - 2); n resto = max(resto, 0); n ans++; n } else { n resto++; n ans++; n } n } n cout << ans - resto / 2 << n ; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(NULL); n int t = 1; n cin >> t; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k = 0; n cin >> n; n int arr[n + 2]; n arr[0] = arr[n + 1] = 0; n for (int i = 1; i <= n; i++) cin >> arr[i]; n for (int i = 1; i <= n; i++) n if (arr[i - 1] == 1 && arr[i + 1] == 1 && arr[i] == 0) arr[i + 1] = 0, k++; n cout << k; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long int read() { n char C = getchar(); n long long int N = 0, F = 1; n while (( 0 > C || C > 9 ) && (C != - )) C = getchar(); n if (C == - ) F = -1, C = getchar(); n while ( 0 <= C && C <= 9 ) n N = (N << 1) + (N << 3) + (C - 48), C = getchar(); n return F * N; n } n long long int D[250005], NEXT[250005], ST[250005], LIM; n long long int F[250005][2], SUM[250005]; n struct DQ { n priority_queue A, B; n void push(long long int x) { A.push(x); } n void condense() { n while (A.size() && B.size() && A.top() == B.top()) { n A.pop(); n B.pop(); n } n } n void pop() { n condense(); n A.pop(); n } n long long int top() { n condense(); n return A.top(); n } n void del(long long int x) { B.push(x); } n long long int size() { return A.size() - B.size(); } n } H[250005]; n bool vis[250005]; n vector VECD[250005]; n vector > E[250005]; n bool cmp(pair A, n pair B) { n return D[A.first] < D[B.first]; n } n void dele(long long int wch) { n vis[wch] = true; n for (long long int i = ST[wch]; i < E[wch].size(); i++) { n if (vis[E[wch][i].first]) continue; n long long int to = E[wch][i].first, wei = E[wch][i].second; n H[to].push(wei); n SUM[to] += wei; n } n } n void upd(long long int wch, long long int num, vector& cont) { n while (H[wch].size() > num) { n cont.push_back(H[wch].top()); n SUM[wch] -= H[wch].top(); n H[wch].pop(); n } n } n void upd(long long int wch, long long int num) { n while (H[wch].size() > num) { n SUM[wch] -= H[wch].top(); n H[wch].pop(); n } n } n void dfs(long long int wch) { n long long int tot = 0, ned; n ned = D[wch] - LIM; n vector DEL, ADD; n upd(wch, ned); n vis[wch] = true; n while (ST[wch] < E[wch].size() && D[E[wch][ST[wch]].first] <= LIM) ST[wch]++; n for (long long int i = ST[wch]; i < E[wch].size(); i++) { n long long int to = E[wch][i].first, wei = E[wch][i].second; n if (vis[to]) continue; n dfs(to); n if (F[to][0] + wei <= F[to][1]) { n tot += F[to][0] + wei; n ned--; n } else { n long long int c = F[to][0] + wei - F[to][1]; n tot += F[to][1]; n DEL.push_back(c); n H[wch].push(c); n SUM[wch] += c; n } n } n upd(wch, max(ned, (long long int)0), ADD); n F[wch][1] = tot + SUM[wch]; n upd(wch, max((long long int)0, ned - 1), ADD); n F[wch][0] = tot + SUM[wch]; n for (long long int i = 0; i < ADD.size(); i++) n H[wch].push(ADD[i]), SUM[wch] += ADD[i]; n for (long long int i = 0; i < DEL.size(); i++) n H[wch].del(DEL[i]), SUM[wch] -= DEL[i]; n } n int main() { n long long int N, ans = 0; n N = read(); n for (long long int i = 1; i < N; i++) { n long long int a, b, c; n a = read(), b = read(), c = read(); n D[a]++, D[b]++; n E[a].push_back({b, c}); n E[b].push_back({a, c}); n ans += c; n } n printf( %I64d , ans); n for (long long int i = 1; i <= N; i++) { n sort(E[i].begin(), E[i].end(), cmp); n VECD[D[i]].push_back(i); n } n NEXT[N - 1] = N; n for (long long int i = N - 2; i >= 1; i--) { n if (VECD[i + 1].size()) n NEXT[i] = i + 1; n else n NEXT[i] = NEXT[i + 1]; n } n for (LIM = 1; LIM < N; LIM++) { n for (long long int j = 0; j < VECD[LIM].size(); j++) dele(VECD[LIM][j]); n long long int sum = 0; n for (long long int j = LIM + 1; j < N; j = NEXT[j]) { n for (long long int k = 0; k < VECD[j].size(); k++) { n if (vis[VECD[j][k]]) continue; n dfs(VECD[j][k]); n sum += F[VECD[j][k]][1]; n } n } n printf( %I64d , sum); n for (long long int j = LIM + 1; j < N; j = NEXT[j]) n for (long long int k = 0; k < VECD[j].size(); k++) n vis[VECD[j][k]] = false; n } n return 0; n } n "} +{"func_code_string": "#include n const int N = 1e5 + 3; n struct edge { n int v, nxt; n } g[N + N]; n int n, head[N], k; n double ans; n inline void Insert(int u, int v) { n g[++k] = (edge){v, head[u]}; n head[u] = k; n } n void Dfs(int u, int dep, int fa) { n int v; n ans += 1.0 / dep; n for (int i = head[u]; i; i = g[i].nxt) n if ((v = g[i].v) != fa) Dfs(v, dep + 1, u); n } n int main() { n int u, v; n scanf( %d , &n); n for (int i = 1; i < n; i++) scanf( %d%d , &u, &v), Insert(u, v), Insert(v, u); n Dfs(1, 1, 0); n printf( %.9lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int test; n cin >> test; n int n; n string rakh1, rakh2, rakh, ch, ch_min; n while (test--) { n cin >> n; n cin >> ch; n ch_min = ch; n int pos = 1; n for (int i = 1; i < (n - 1); i++) { n rakh1 = ch.substr(0, i); n rakh2 = ch.substr(i, n - 1); n if ((n % 2 != 0 && i % 2 == 0) || (n % 2 == 0 && i % 2 != 0)) n reverse(rakh1.begin(), rakh1.end()); n rakh = rakh2 + rakh1; n if (ch_min > rakh) { n pos = i + 1; n ch_min = rakh; n } n } n reverse(ch.begin(), ch.end()); n if (ch_min > ch) { n pos = n; n ch_min = ch; n } n cout << ch_min << endl; n cout << pos << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; } n int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; } n void solve() { n long long int x, y, z; n cin >> x >> y >> z; n long long int x1, y1, z1; n cin >> x1 >> y1 >> z1; n long long int a1, a2, a3, a4, a5, a6; n cin >> a1 >> a2 >> a3 >> a4 >> a5 >> a6; n long long int ans = 0; n if (x > x1) n ans += a6; n else if (x < 0) n ans += a5; n if (y > y1) n ans += a2; n else if (y < 0) n ans += a1; n if (z > z1) n ans += a4; n else if (z < 0) n ans += a3; n cout << ans << endl; n } n signed main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long int t; n t = 1; n while (t--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = INT_MAX; n const long long INFL = LLONG_MAX; n int N, M, ans[200100], n, m; n int main() { n cin >> N >> M; n n = m = 0; n ans[0] = 0; n n++; n for (int(i) = 1; (i) <= (N + M - 1); (i)++) { n if (i & 1) { n if (ans[i - 1]) { n if (n < N) { n ans[i] = 0; n n++; n } else { n ans[i] = 1; n m++; n } n } else { n if (m < M) { n ans[i] = 1; n m++; n } else { n ans[i] = 0; n n++; n } n } n } else { n if (ans[i - 1]) { n if (m < M) { n ans[i] = 1; n m++; n } else { n ans[i] = 0; n n++; n } n } else { n if (n < N) { n ans[i] = 0; n n++; n } else { n ans[i] = 1; n m++; n } n } n } n } n int s11 = 0; n int s12 = 0; n for (int(i) = 1; (i) <= (N + M - 1); (i)++) { n if (ans[i - 1] == ans[i]) n s11++; n else n s12++; n } n n = m = 0; n ans[0] = 1; n m++; n for (int(i) = 1; (i) <= (N + M - 1); (i)++) { n if (i & 1) { n if (ans[i - 1]) { n if (n < N) { n ans[i] = 0; n n++; n } else { n ans[i] = 1; n m++; n } n } else { n if (m < M) { n ans[i] = 1; n m++; n } else { n ans[i] = 0; n n++; n } n } n } else { n if (ans[i - 1]) { n if (m < M) { n ans[i] = 1; n m++; n } else { n ans[i] = 0; n n++; n } n } else { n if (n < N) { n ans[i] = 0; n n++; n } else { n ans[i] = 1; n m++; n } n } n } n } n int s21 = 0; n int s22 = 0; n for (int(i) = 1; (i) <= (N + M - 1); (i)++) { n if (ans[i - 1] == ans[i]) n s21++; n else n s22++; n } n if (s11 < s21) { n cout << s21 << << s22 << endl; n } else { n cout << s11 << << s12 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long n, mod; n pair a[200100]; n long long d[200100]; n long long first(int t, int k) { n long long res = 1; n for (int i = 1; i <= k; i++) d[i] = i; n for (int j = 2; t;) n if (d[j] % 2) n j += 2; n else n while (d[j] % 2 == 0 && t) { n d[j] /= 2; n t--; n } n for (int i = 1; i <= k; i++) res = (res * d[i]) % mod; n return res; n } n int main() { n cin >> n; n for (int i = 0; i < 2 * n; ++i) { n cin >> a[i].first; n a[i].second = (i % n) + 1; n } n sort(a, a + 2 * n); n cin >> mod; n long long r = 1; n for (int i = 0; i < 2 * n; i++) { n long long k, t = 0; n for (k = i + 1; k < 2 * n && a[k].first == a[i].first; k++) n if (a[k].second == a[k - 1].second) t++; n k--; n r = (r * first(t, k - i + 1)) % mod; n i = k; n } n cout << r; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e5 + 5; n long long n, k, z, a[N]; n signed main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long t; n cin >> t; n while (t--) { n cin >> n >> k >> z; n long long sum = 0; n for (long long i = 1; i <= n; i++) cin >> a[i]; n long long ans = 0; n for (long long j = 0; j <= z; j++) { n long long s = k - j; n if (s < j) break; n long long sum = 0; n long long mx = 0; n for (long long i = 1; i <= s - j + 1; i++) n sum += a[i], mx = max(a[i] + a[i + 1], mx); n ans = max(ans, sum + mx * j); n } n cout << ans << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n char a[60][60]; n bool isRowChecked[60]; n bool isColChecked[60]; n bool doCheck(int r, int c) { n bool isRowRegard[60]; n bool isColRegard[60]; n memset(isRowRegard, false, sizeof(isRowRegard)); n memset(isColRegard, false, sizeof(isColRegard)); n std::vector rows; n std::vector cols; n for (int rr = r; rr < n; rr++) { n if (a[rr][c] == # ) { n isRowRegard[rr] = true; n rows.push_back(rr); n } n } n for (int cc = c; cc < m; cc++) { n if (a[r][cc] == # ) { n isColRegard[cc] = true; n cols.push_back(cc); n } n } n for (int i = 0; i < rows.size(); i++) { n for (int cc = 0; cc < m; cc++) { n if ((a[rows[i]][cc] == . ) && (isColRegard[cc] == true)) return false; n if ((a[rows[i]][cc] == # ) && (isColRegard[cc] == false)) return false; n } n } n for (int j = 0; j < cols.size(); j++) { n for (int rr = 0; rr < n; rr++) { n if ((a[rr][cols[j]] == . ) && (isRowRegard[rr] == true)) return false; n if ((a[rr][cols[j]] == # ) && (isRowRegard[rr] == false)) return false; n } n } n for (int i = 0; i < rows.size(); i++) isRowChecked[rows[i]] = true; n for (int j = 0; j < cols.size(); j++) isColChecked[cols[j]] = true; n return true; n } n int main() { n scanf( %d%d n , &n, &m); n for (int i = 0; i < n; i++) scanf( %s n , a[i]); n memset(isRowChecked, false, sizeof(isRowChecked)); n memset(isColChecked, false, sizeof(isColChecked)); n for (int r = 0; r < n; r++) { n if (isRowChecked[r]) continue; n for (int c = 0; c < m; c++) { n if (isColChecked[c]) continue; n if (a[r][c] == # ) { n if (doCheck(r, c) == false) { n printf( No n ); n return 0; n } n } n } n } n printf( Yes n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long power(long long x, long long y, long long md = 1000000007) { n long long res = 1; n x %= md; n while (y > 0) { n if (y & 1) res = (res * x) % md; n x = (x * x) % md; n y = y >> 1; n } n return res % md; n } n signed main() { n long long n, m; n cin >> n >> m; n long long root = sqrt(n) + 1; n std::vector factors; n std::vector > v(m); n for (int i = 1; i < root; i++) { n if (n % i) continue; n long long temp = n / i; n factors.push_back(i); n if (i != temp && temp != n) factors.push_back(temp); n } n std::vector check(m, 0); n std::map, long long> map; n for (int i = 0; i < m; i++) { n long long a, b; n cin >> a >> b; n a--; n b--; n if (b < a) swap(a, b); n v[i] = make_pair(a, b); n map[v[i]] = i; n } n for (int i = 0; i < factors.size(); i++) { n for (int j = 0; j < m; j++) check[i] = 0; n long long x = factors[i]; n long long first = 1; n for (int j = 0; j < m; j++) { n long long a = min((v[j].first + x) % n, (v[j].second + x) % n); n long long b = max((v[j].first + x) % n, (v[j].second + x) % n); n std::map, long long>::iterator it = n map.find(make_pair(a, b)); n if (it == map.end()) { n first = 0; n break; n } n } n if (first) { n cout << Yes ; n return 0; n } n } n cout << No ; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e17; n struct Node { n int to; n long long dis; n int type; n Node(int a = 0, long long b = 0, int c = 0) { n to = a; n dis = b; n type = c; n } n friend bool operator<(Node a, Node b) { n if (a.dis != b.dis) return a.dis > b.dis; n return a.type > b.type; n } n }; n int n, m, k; n int vis[100005], p[100005]; n long long dis[100005]; n vector v[100005]; n void djs(int x) { n memset(vis, 0, sizeof(vis)); n memset(p, 0, sizeof(p)); n for (int i = 0; i <= n; i++) dis[i] = INF; n priority_queue q; n q.push(Node(x, 0, 0)); n dis[x] = 0; n Node u, w; n while (!q.empty()) { n u = q.top(); n q.pop(); n if (u.dis != dis[u.to] || vis[u.to]) continue; n vis[u.to] = 1; n for (int i = 0; i < v[u.to].size(); i++) { n w = v[u.to][i]; n if (!vis[w.to]) { n if (u.dis + w.dis < dis[w.to]) { n dis[w.to] = u.dis + w.dis; n q.push(Node(w.to, dis[w.to], 0)); n p[w.to] = w.type; n } else if (u.dis + w.dis == dis[w.to] && w.type == 0) { n p[w.to] = w.type; n } n } n } n } n } n int main() { n while (~scanf( %d%d%d , &n, &m, &k)) { n for (int i = 0; i <= n; i++) { n while (!v[i].empty()) v[i].clear(); n } n int a, b; n long long c; n for (int i = 0; i < m; i++) { n scanf( %d%d%lld , &a, &b, &c); n v[a].push_back(Node(b, c, 0)); n v[b].push_back(Node(a, c, 0)); n } n for (int i = 0; i < k; i++) { n scanf( %d%lld , &b, &c); n v[1].push_back(Node(b, c, 1)); n v[b].push_back(Node(1, c, 1)); n } n djs(1); n for (int i = 2; i <= n; i++) { n k -= p[i]; n } n printf( %d n , k); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, m; n cin >> n >> m; n int arr[m]; n for (int i = 0; i < m; i++) cin >> arr[i]; n long long res = arr[0]; n for (int i = 1; i < m; i++) { n if (arr[i] - arr[i - 1] < 0) { n res += (n - arr[i - 1]) + arr[i]; n } else n res += (arr[i] - arr[i - 1]); n } n cout << res - 1 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a1, a2, a3, sum = 0, a12, a23, a31; n int main() { n cin >> a1 >> a2 >> a3; n sum = a1 + a2 + a3; n if (sum % 2) { n cout << Impossible ; n return 0; n } n sum /= 2; n a12 = sum - a3; n a23 = sum - a1; n a31 = sum - a2; n if (a12 < 0 || a23 < 0 || a31 < 0) { n cout << Impossible ; n return 0; n } else n cout << a12 << << a23 << << a31; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 400005; n char a[N]; n int n, k, delta, top, st[N]; n bool vis[N]; n int main() { n scanf( %d%d , &n, &k), scanf( %s , a + 1); n delta = (n - k) / 2, top = 0; n for (int i = 1; i <= n; ++i) { n if (a[i] == ( ) n st[++top] = i; n else { n if (delta) { n --delta, vis[i] = 1; n vis[st[top]] = 1; n } n --top; n } n } n for (int i = 1; i <= n; ++i) n if (!vis[i]) printf( %c , a[i]); n puts( ); n return 0; n } n "} +{"func_code_string": " //AYUSH VERMA n //********************************************* ********************************* n //***************/A ************************** ****** *********///************* n //**************//Y ************************ ******** *******///************** n //*************///U ********************** ********** **A**///*************** n //************///*S* ******************** ************ *M*///**************** n //***********/////H ****************** ************** R///***************** n //**********///******* **************** **************** E//****************** n //*********///********* ************** ****************** V/******************* n //************************************* ***************************************** n #include n #define till(condition) while(condition) n #define ull unsigned long long int n #define ll long long int n #define space printf( ) n #define nl printf( n ) n #define MOD 1000000007 n using namespace std; n int main() n { n int t; n cin>>t; n till(t--) n { n int n; n cin>>n; n ll a[100001],want[100001]; n ll max=0; n ll maxtest=0; n for(int i=0;i>a[i]; n if(a[i]>maxtest) n { n maxtest=a[i]; n } n } n sort(a,a+n,greater()); n ll wantsum=0; n for(int i=0;i0) n { n tempwantsum-=(subs); n } n n // cout<< * <max) n { n max=ans; n } n } n } n else n { n if((tempwantsum-temp)>max) n { n max=(tempwantsum-temp); n } n } n // cout<< ** < n using namespace std; n int dist[600 + 15][600 + 15]; n int start[200 + 15]; n int MAX_ = INT_MAX / 2 - 5; n vector > sas[1000]; n int cap[250000 + 15]; n int v, e, n, k; n int pop_w[1000]; n int pop_kr[1000]; n int group[1000]; n int last_checked[1000]; n int dead[1000]; n int res; n int num = 0; n bool b = 0; n int to_add; n bool DFS(int w, int bneck) { n if (w == n + v + 2) { n to_add = bneck; n res += to_add; n return 1; n } n for (int i = last_checked[w] + 1; i < sas[w].size(); i++) { n int do_ = sas[w][i].first; n int neck = min(bneck, cap[sas[w][i].second]); n last_checked[w] = i; n if (neck && !dead[do_]) n if (DFS(do_, neck)) { n cap[sas[w][i].second] -= to_add; n cap[sas[w][i].second ^ 1] += to_add; n return 1; n } n } n return 0; n } n int DINIC() { n for (int i = 0; i <= n + v + 3; i++) { n group[i] = -1; n dead[i] = 0; n last_checked[i] = -1; n } n queue > q; n q.push({0, 0}); n group[0] = 0; n while (!q.empty()) { n int top_w = q.front().first; n int top_g = q.front().second; n q.pop(); n for (int i = 0; i < sas[top_w].size(); i++) n if (group[sas[top_w][i].first] == -1) { n group[sas[top_w][i].first] = top_g + 1; n q.push({sas[top_w][i].first, top_g + 1}); n } n } n int ile = 0; n while (DFS(0, INT_MAX)) ile++; n return ile; n } n bool CHECK(int t) { n for (int i = 0; i <= n + v + 3; i++) sas[i].clear(); n int place; n num = 0; n for (int i = 1; i <= n; i++) { n place = start[i]; n for (int j = 1; j <= v; j++) { n if (dist[place][j] <= t) { n sas[i].push_back({j + n, num}); n sas[j + n].push_back({i, num + 1}); n cap[num] = 1; n cap[num + 1] = 0; n num += 2; n } n } n } n for (int i = 1; i <= n; i++) { n sas[0].push_back({i, num}); n sas[i].push_back({0, num + 1}); n cap[num] = 1; n cap[num + 1] = 0; n num += 2; n } n for (int i = n + 1; i <= n + v; i++) { n sas[i].push_back({n + v + 2, num}); n sas[n + v + 2].push_back({i, num + 1}); n cap[num] = 1; n cap[num + 1] = 0; n num += 2; n } n res = 0; n while (DINIC()) { n }; n if (res >= k) return 1; n return 0; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> v >> e >> n >> k; n for (int i = 1; i <= n; i++) cin >> start[i]; n for (int i = 1; i <= v; i++) n for (int j = 1; j <= v; j++) dist[i][j] = MAX_; n for (int i = 1; i <= v; i++) dist[i][i] = 0; n int h, j, r; n for (int i = 1; i <= e; i++) { n cin >> h >> j >> r; n dist[h][j] = min(dist[h][j], r); n dist[j][h] = min(dist[j][h], r); n } n for (int mid = 1; mid <= v; mid++) n for (int x = 1; x <= v; x++) n for (int y = 1; y <= v; y++) n dist[x][y] = min(dist[x][y], dist[x][mid] + dist[mid][y]); n if (!CHECK(1731311)) { n cout << -1; n return 0; n } n int b = 0; n int e = 1731311; n while (b <= e) { n int mid = (b + e) / 2; n if (CHECK(mid)) n e = mid - 1; n else n b = mid + 1; n } n cout << b; n } n "} +{"func_code_string": "#include n using namespace std; n const int oo = 0x3f3f3f3f; n const double eps = 1e-9; n const int maxn = 100000 + 10; n int go[maxn][26], fail[maxn]; n int I[maxn], F[maxn], S[maxn], FIN[maxn]; n int total; n void push(string &s, int index, int freq) { n int u = 0; n for (auto c : s) { n int x = c - a ; n if (!go[u][x]) go[u][x] = total++; n u = go[u][x]; n } n I[u] = index, F[u] = freq, S[u] = s.length(), FIN[u] = u; n } n void build() { n queue > q; n for (int i = 0; i < 26; ++i) { n if (go[0][i]) q.push({go[0][i], 0}); n } n while (!q.empty()) { n auto x = q.front(); n q.pop(); n int u = x.first, f = x.second; n fail[u] = f; n if (!FIN[u]) FIN[u] = FIN[f]; n for (int i = 0; i < 26; ++i) { n if (go[u][i]) n q.push({go[u][i], go[f][i]}); n else n go[u][i] = go[f][i]; n } n } n } n int ANSWER[maxn]; n queue deq[maxn]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n total = 1; n string s; n cin >> s; n int q; n cin >> q; n for (int i = 1; i <= q; ++i) { n int f; n string t; n cin >> f >> t; n push(t, i, f); n } n build(); n memset(ANSWER, 0x3f, sizeof ANSWER); n for (int i = 0, u = 0; i < (int)s.length(); ++i) { n u = go[u][s[i] - a ]; n int v = FIN[u]; n while (v) { n int idx = I[v]; n deq[idx].push(i); n if (deq[idx].size() > F[v]) deq[idx].pop(); n if (deq[idx].size() == F[v]) { n int beg = deq[idx].front(); n ANSWER[idx] = min(ANSWER[idx], i - beg + S[v]); n } n v = FIN[fail[v]]; n } n } n for (int i = 1; i <= q; ++i) { n if (ANSWER[i] == oo) n cout << -1 << n ; n else n cout << ANSWER[i] << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e18; n const long long mod = 1e9; n long long dp[100005]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long t = 1; n cin >> t; n while (t--) { n long long n, k; n cin >> n >> k; n long long i; n long long a[n]; n set s; n long long c = 0; n for (i = 0; i < n; i++) { n cin >> a[i]; n s.insert(a[i]); n if (i > 0) { n if (a[i] != a[i - 1]) { n c++; n } n } n } n long long d = s.size(); n if (d <= k) { n cout << 1 << endl; n } else { n if (k == 1 && (d != k)) { n cout << -1 << endl; n } else { n cout << (((c % (k - 1)) == 0) ? (c / (k - 1)) : (c / (k - 1) + 1)) n << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 3e5 + 10, M = 2097152 + 10; n long long n, x, ans, ar[N], mark[M][2]; n int32_t main() { n ios::sync_with_stdio(0); n cin.tie(0); n cin >> n; n for (long long i = 0; i < n; i++) cin >> ar[i]; n mark[0][1]++; n for (long long i = 0; i < n; i++) { n x ^= ar[i]; n mark[x][i & 1]++; n } n for (long long i = 0; i < M; i++) { n ans += (mark[i][0] * (mark[i][0] - 1)) / 2; n ans += (mark[i][1] * (mark[i][1] - 1)) / 2; n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int t; n cin >> t; n while (t--) { n long long int a, b, c, d, e, y = 0, x = 0, l = 0, z = 0, k = 0, m = 0; n cin >> a >> b >> c >> d >> e; n if (d > e) { n while (a > 1 && b > 0) { n y++; n a = a - 2; n b = b - 1; n } n while (a > 1 && c > 0) { n x++; n a = a - 2; n c = c - 1; n } n l = (d * y) + (x * e); n cout << l << endl; n } else { n while (a > 1 && c > 0) { n z++; n a = a - 2; n c = c - 1; n } n while (a > 1 && b > 0) { n k++; n a = a - 2; n b = b - 1; n } n m = (e * z) + (k * d); n cout << m << endl; n } n y = 0, x = 0, l = 0, z = 0, k = 0, m = 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const ll MOD = 1e9 + 7, N = 1e5 + 10; n const ll MX = 1e8; n int32_t main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n string s; n cin >> s; n ll ans = 0; n for (ll i = 0; i < MX; i += 25) { n string k = to_string(i); n if (k.length() != s.length()) continue; n set se; n ll bad = 1; n 42; n for (ll j = 0; j < k.length(); j++) { n if (s[j] == _ ) continue; n if (s[j] == X ) { n se.insert(k[j] - 0 ); n if (se.size() > 1) break; n continue; n } n if (s[j] != k[j]) bad = 0; n } n ans += (se.size() <= 1 and bad); n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char c1[1005], c2[1005]; n long long f[100005][2], ans, k, l; n bool pd; n int main() { n scanf( %s , c1); n scanf( %s , c2); n scanf( %lld , &k); n l = strlen(c1); n f[0][0] = 1; n for (register long long i = 1; i <= k; i = -~i) { n f[i][0] = ((l - 1) * f[i - 1][1]) % 1000000007; n f[i][1] = (((l - 2) * f[i - 1][1]) % 1000000007 + f[i - 1][0]) % 1000000007; n } n for (register long long i = 0; i < l; i = -~i) { n pd = false; n for (register long long j = 0; j < l; j = -~j) n if (c1[(i + j) % l] != c2[j]) { n pd = true; n break; n } n if (!pd) { n if (i) n ans = (ans + f[k][1]) % 1000000007; n else n ans = (ans + f[k][0]) % 1000000007; n } n } n printf( %lld , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct LCA { n int logn; n vector depth; n vector > lca; n vector > *edges; n LCA(int n, vector > *edges) { n logn = log(n) / log(2) + 1; n depth.resize(n + 1, 0); n lca.resize(n + 1, vector(logn, 0)); n this->edges = edges; n build(); n } n void dfs(int u, int p) { n lca[u][0] = p; n for (int i = 1; i < logn; i++) { n lca[u][i] = lca[lca[u][i - 1]][i - 1]; n } n depth[u] = depth[p] + 1; n for (auto &v : (*edges)[u]) { n if (p != v) { n dfs(v, u); n } n } n } n int parent(int v, int h) { n for (int i = logn - 1; i >= 0; i--) { n if (h & (1 << i)) { n v = lca[v][i]; n } n } n return v; n } n int lessParent(int u, int p) { return parent(u, depth[u] - depth[p] - 1); } n int get(int u, int v) { n if (depth[u] > depth[v]) { n swap(u, v); n } n int h = depth[v] - depth[u]; n v = parent(v, h); n if (u == v) { n return u; n } n for (int i = logn - 1; i >= 0; i--) { n if (lca[u][i] != lca[v][i]) { n u = lca[u][i]; n v = lca[v][i]; n } n } n return lca[u][0]; n } n void build() { dfs(1, 0); } n } * lca; n struct GraphBuilder { n enum DIRECT { n UP = 0, n DOWN, n }; n int n; n int k; n vector > *e; n vector > edges; n set > cache; n vector > addedVertices; n vector > deletedVertices; n LCA *lca; n struct Node { n int id; n Node *leftChild; n Node *rightChild; n Node(int v, Node *l, Node *r) { n id = v; n leftChild = l; n rightChild = r; n } n }; n vector > root; n GraphBuilder(int m, vector > *e) { n k = 2 * m - 1; n n = 2 * m - 1; n this->e = e; n lca = new LCA(e->size() - 1, e); n addedVertices.resize(e->size()); n deletedVertices.resize(e->size()); n for (int i = 0; i < m; i++) { n for (int j = 0; j < 2; j++) { n int u, v; n scanf( %d %d , &u, &v); n int p = lca->get(u, v); n if (u != p) { n addedVertices[u].push_back((i << 1) | j); n deletedVertices[lca->lessParent(u, p)].push_back((i << 1) | j); n } n if (v != p) { n addedVertices[v].push_back((i << 1) | j); n deletedVertices[lca->lessParent(v, p)].push_back((i << 1) | j); n } n } n } n root.resize(e->size(), {0, 0}); n dfs(1, 0); n } n void dfs(int u, int p) { n for (auto &v : (*e)[u]) { n if (v != p) { n dfs(v, u); n root[u].first = merge(root[u].first, root[v].first, DOWN); n root[u].second = merge(root[u].second, root[v].second, UP); n } n } n for (auto &x : addedVertices[u]) { n root[u].first = addVertex(0, n, root[u].first, (x ^ 1), DOWN); n root[u].second = addVertex(0, n, root[u].second, x, UP); n } n for (auto &x : deletedVertices[u]) { n root[u].first = delVertex(0, n, root[u].first, (x ^ 1), DOWN); n root[u].second = delVertex(0, n, root[u].second, x, UP); n if (root[u].first) { n add(x, root[u].first->id); n } n if (root[u].second) { n add(root[u].second->id, (x ^ 1)); n } n } n } n void add(int u, int v) { edges.push_back({u, v}); } n void addEdge(Node *p, int direct) { n if (direct == DOWN) { n if (p->leftChild) { n add(p->id, p->leftChild->id); n } n if (p->rightChild) { n add(p->id, p->rightChild->id); n } n } else { n if (p->leftChild) { n add(p->leftChild->id, p->id); n } n if (p->rightChild) { n add(p->rightChild->id, p->id); n } n } n } n Node *addVertex(int l, int r, Node *p, int v, int direct) { n if (!p) { n p = new Node(0, 0, 0); n } n if (l == r) { n return new Node(v, 0, 0); n } else { n int mid = (l + r) >> 1; n Node *newNode = new Node(++k, p->leftChild, p->rightChild); n if (v <= mid) { n newNode->leftChild = addVertex(l, mid, p->leftChild, v, direct); n } else { n newNode->rightChild = addVertex(mid + 1, r, p->rightChild, v, direct); n } n addEdge(newNode, direct); n return newNode; n } n } n Node *delVertex(int l, int r, Node *p, int v, int direct) { n if (l == r) { n return 0; n } else { n int mid = (l + r) >> 1; n Node *newNode = new Node(++k, p->leftChild, p->rightChild); n if (v <= mid) { n newNode->leftChild = delVertex(l, mid, p->leftChild, v, direct); n } else { n newNode->rightChild = delVertex(mid + 1, r, p->rightChild, v, direct); n } n if (!newNode->leftChild && !newNode->rightChild) { n return 0; n } n addEdge(newNode, direct); n return newNode; n } n } n Node *merge(Node *p1, Node *p2, int direct) { n if (!p1 || !p2) { n return p1 ? p1 : p2; n } else { n Node *left = merge(p1->leftChild, p2->leftChild, direct); n Node *right = merge(p1->rightChild, p2->rightChild, direct); n Node *newNode = new Node(++k, left, right); n addEdge(newNode, direct); n return newNode; n } n } n }; n struct SAT { n int n; n vector st; n vector mark; n vector group; n vector > edges; n vector > revEdges; n SAT(int n, vector > &e) { n this->n = n + 1; n mark.resize(n + 1, 0); n group.resize(n + 1, 0); n edges.resize(n + 1); n revEdges.resize(n + 1); n for (auto &p : e) { n addEdge(p.first, p.second); n } n } n void addEdge(int u, int v) { n edges[u].push_back(v); n revEdges[v].push_back(u); n } n void dfs1(int u) { n mark[u] = 1; n for (auto &v : edges[u]) { n if (mark[v] == 0) { n dfs1(v); n } n } n st.push_back(u); n } n void dfs2(int u, int k) { n group[u] = k; n for (auto &v : revEdges[u]) { n if (group[v] == 0) { n dfs2(v, k); n } n } n } n void solve() { n for (int i = 0; i < n; i++) { n if (mark[i] == 0) { n dfs1(i); n } n } n int k = 0; n for (int i = st.size() - 1; i >= 0; i--) { n int u = st[i]; n if (group[u] == 0) { n k++; n dfs2(u, k); n } n } n } n void answer(int m) { n for (int i = 0; i < 2 * m; i += 2) { n if (group[i] == group[i | 1]) { n printf( NO ); n return; n } n } n printf( YES n ); n for (int i = 0; i < 2 * m; i += 2) { n printf( %d n , (group[i] > group[i | 1]) ? 1 : 2); n } n } n }; n int main() { n int n; n scanf( %d , &n); n vector > edges(n + 1); n for (int i = 1; i < n; i++) { n int u, v; n scanf( %d %d , &u, &v); n edges[u].push_back(v); n edges[v].push_back(u); n } n int m; n scanf( %d , &m); n GraphBuilder builder(m, &edges); n SAT solver(builder.k, builder.edges); n solver.solve(); n solver.answer(m); n } n "} +{"func_code_string": "#include n using namespace std; n const int mxn = 257; n string rec[mxn][3]; n bool been[mxn][3]; n inline int G(string s) { n int t = 0; n for (int i = 0; i < s.size(); ++i) t = t * 2 + s[i] - 0 ; n return t; n } n priority_queue > pq; n bool changed; n string Min(string a, string b) { n if (a.size() != b.size()) { n if (a.size() < b.size()) n return a; n else n return b; n } n return min(a, b); n } n inline void upd(string& a, string b) { n if (a == b) return; n if (Min(a, b) == b) { n changed = 1; n a = b; n } n } n inline void prep() { n int n = 256; n for (int i = 0; i < n; ++i) n for (int j = 0; j < 3; ++j) n rec[i][j] = zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz ; n rec[G( 00001111 )][0] = x ; n rec[G( 00110011 )][0] = y ; n rec[G( 01010101 )][0] = z ; n for (changed = 1; changed;) { n changed = 0; n for (int i = 0; i < n; ++i) n for (int j = 0; j < 2; ++j) upd(rec[i][j + 1], rec[i][j]); n for (int i = 0; i < n; ++i) upd(rec[i ^ 255][0], ! + rec[i][0]); n for (int i = 0; i < n; ++i) n for (int j = 0; j < n; ++j) n upd(rec[i & j][1], rec[i][1] + & + rec[j][0]), n upd(rec[i | j][2], rec[i][2] + | + rec[j][1]); n for (int i = 0; i < n; ++i) upd(rec[i][0], ( + rec[i][2] + ) ); n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0), cout.tie(0); n int T = 1; n cin >> T; n prep(); n for (; T--;) { n string s; n cin >> s; n int t = G(s); n cout << Min(Min(rec[t][0], rec[t][1]), rec[t][2]) << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 4e6 + 5; n const int inf = 0x3f3f3f3f; n int main() { n int n; n scanf( %d , &n); n char a; n getchar(); n int ans = 0; n for (int i = 1; i <= n; i++) { n scanf( %c , &a); n if (a == - ) n ans--; n else n ans++; n ans = max(0, ans); n } n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, s = 0; n cin >> n; n int a[n]; n for (int x = 0; x < n; ++x) { n cin >> a[x]; n s += a[x] * (x + 1); n } n cout << s << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[200005]; n int n, k; n int main() { n scanf( %d%d , &n, &k); n scanf( %s , s); n if (n == 1) { n if (k == 0) n printf( %c n , s[0]); n else n printf( 0 n ); n } else { n if (k == 0) n printf( %s n , s); n else { n if (s[0] != 1 ) k--; n s[0] = 1 ; n int t = 1; n while (t < n && k) { n if (s[t] != 0 ) { n s[t] = 0 ; n k--; n } n t++; n } n printf( %s , s); n } n } n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:1024000000,1024000000 ) n using namespace std; n const long long LINF = (1LL << 62); n const int INF = 1 << 30; n const int NS = 100010; n const int MS = 19; n const int MOD = 1000000007; n const double PI = acos(-1.0); n int n, m, q, h[NS]; n pair s[NS]; n int L[NS], R[NS]; n int solve() {} n int main() { n while (~scanf( %d %d , &n, &q)) { n m = n - 1; n for (int i = 1; i <= n; i++) { n scanf( %d , &h[i]); n if (i > 1) { n h[i - 1] = abs(h[i - 1] - h[i]); n s[i - 1] = make_pair(h[i - 1], i - 1); n } n } n sort(s + 1, s + m + 1); n set idSet; n idSet.insert(0); n idSet.insert(n); n for (int i = m; i >= 1; i--) { n int pos = s[i].second; n idSet.insert(pos); n __typeof(idSet.begin()) it = idSet.find(pos); n L[pos] = *(--it); n it++, it++; n R[pos] = *(it); n } n int x, y; n for (int qi = 0; qi < q; qi++) { n scanf( %d %d , &x, &y); n long long ans = 0; n for (int i = x; i < y; i++) { n int lb = i - max(L[i], x - 1); n int rb = min(R[i], y) - i; n ans += 1LL * h[i] * lb * rb; n } n printf( %I64d n , ans); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int M = 2 * 1e5 + 10; n int a[M]; n int main() { n long long s, n, p1, c, pos1, pos2, p2, i, ans = 1, d, x, j; n scanf( %I64d , &n); n for (i = 0; i < n; i++) scanf( %I64d , &a[i]); n if (a[0] != -1) { n p1 = a[0]; n pos1 = 0; n c = 1; n } else n c = 0; n s = 0; n ans = 1; n for (i = 1; i < n; i++) { n if (i == 10) i = 10; n if (c == 0) { n if (a[i] != -1) { n c = 1; n p1 = a[i]; n pos1 = i; n } n continue; n } n if (c == 1) { n if (a[i] != -1) { n if ((a[i] - p1) % (i - pos1) != 0) { n ans++; n s = i; n c = 1; n p1 = a[i]; n pos1 = i; n } else { n c = 2; n p2 = a[i]; n pos2 = i; n d = (p2 - p1) / (pos2 - pos1); n x = p1 + d * (s - pos1); n if (x <= 0) { n ans++; n c = 1; n p1 = a[i]; n pos1 = i; n s = i; n } n } n } n continue; n } n d = (p2 - p1) / (pos2 - pos1); n x = p1 + d * (i - pos1); n if (a[i] == -1) { n if (x <= 0) { n ans++; n c = 0; n s = i; n } n continue; n } else { n if (x != a[i]) { n ans++; n s = i; n c = 1; n p1 = a[i]; n pos1 = i; n } n } n } n printf( %I64d , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int a, int b) { n if (a == 0) { n return b; n } else { n return gcd(b % a, a); n } n } n int main() { n int l_a, r_a, t_a; n int l_b, r_b, t_b; n int l_x, r_x, t_x; n cin >> l_a >> r_a >> t_a; n cin >> l_b >> r_b >> t_b; n if (r_b - l_b < r_a - l_a) { n l_x = l_b, r_x = r_b, t_x = t_b; n l_b = l_a, r_b = r_a, t_b = t_a; n l_a = l_x, r_a = r_x, t_a = t_x; n } n int g = gcd(t_a, t_b); n int c = l_b - l_a; n int c_1, c_2; n if (l_b - l_a >= 0) { n c_1 = c % g; n c_2 = (-(c % g - g)) % g; n } else { n c_1 = g - (-c) % g; n c_2 = (-(c_1 - g)) % g; n } n int answer = r_a - l_a + 1 - c_1; n answer = max(answer, min(r_b - l_b + 1 - c_2, r_a - l_a + 1)); n cout << max(answer, 0); n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 10000; n const long long M = 60; n vector v; n long long n, first, t, a[N], second, cn, p; n void val(long long first) { n long long second, z; n second = first; n first = upper_bound((v).begin(), (v).end(), first) - v.begin() - 1; n ; n second = (second - v[first] + a[first]) % v[first]; n z = second + v[first]; n while (1) { n second = z - v[first]; n p = (second - a[first] >= 0) ? (v[first] + (second - a[first])) n : (v[first] * 2 - (a[first] - second)); n cout << p << ; n if (p == 1) break; n first--; n z >>= 1; n } n } n int main() { n cin >> n; n for (long long i = (long long)0; i <= (long long)M; i++) n v.push_back((1LL << i)); n for (long long i = (long long)1; i <= (long long)n; i++) { n cin >> t; n if (t <= 2) { n cin >> first >> second; n first = upper_bound((v).begin(), (v).end(), first) - v.begin() - 1; n ; n for (long long j = (long long)first; j <= (long long)M; j++) { n a[j] += (second % v[j]) * (1LL << (j - first)); n if (a[j] < 0) a[j] %= v[j], a[j] += v[j]; n a[j] %= v[j]; n if (t == 1) break; n } n } else { n cn++; n cin >> first; n val(first); n cout << n << n ; n } n } n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC optimize( Ofast,no-stack-protector ) n using namespace std; n void err(istream_iterator it) {} n template n void err(istream_iterator it, T a, Args... args) { n cerr << *it << = << a << n ; n err(++it, args...); n } n function ____ = []() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n }; n template n vector &operator<<(vector &__container, T x) { n __container.push_back(x); n return __container; n } n template n ostream &operator<<(ostream &out, vector &__container) { n for (T _ : __container) out << _ << ; n return out; n } n void sci() {} n template n void sci(int &x, Args &...args) { n scanf( %d , &x); n sci(args...); n } n void scl() {} n template n void scl(long long int &x, Args &...args) { n scanf( %lld , &x); n scl(args...); n } n const int MAXN = 2e5 + 7; n double ret; n int rt; n int n, w[MAXN], root, sz[MAXN], maxsz[MAXN]; n double derivative[MAXN]; n bool vis[MAXN]; n vector > G[MAXN]; n void findroot(int u, int par, int tot) { n sz[u] = 1; n maxsz[u] = 0; n for (auto &e : G[u]) { n int v = e.first, c = e.second; n if (vis[v] or v == par) continue; n findroot(v, u, tot); n sz[u] += sz[v]; n ((maxsz[u]) = (maxsz[u]) > (sz[v]) ? (maxsz[u]) : (sz[v])); n } n ((maxsz[u]) = (maxsz[u]) > (tot - sz[u]) ? (maxsz[u]) : (tot - sz[u])); n if (maxsz[u] < maxsz[root]) root = u; n } n double cost; n void dfs(int u, int par, int wt) { n cost += pow(wt, 1.5) * w[u]; n derivative[u] = w[u] * 1.5 * pow(wt, 0.5); n for (auto &e : G[u]) { n int v = e.first, c = e.second; n if (v == par) continue; n dfs(v, u, wt + c); n derivative[u] += derivative[v]; n } n } n void divide(int u) { n if (vis[u]) return; n vis[u] = true; n cost = 0; n double sd = 0; n for (auto &e : G[u]) { n int v = e.first, c = e.second; n dfs(v, u, c); n sd += derivative[v]; n } n if (cost < ret) ret = cost, rt = u; n for (auto &e : G[u]) { n int v = e.first; n if (sd - 2 * derivative[v] >= 0) continue; n root = 0; n findroot(v, u, sz[v]); n divide(root); n return; n } n } n void solve() { n sci(n); n for (int i = 1; i <= n; i++) sci(w[i]); n for (int i = 1; i < n; i++) { n int u, v, c; n sci(u, v, c); n G[u] << pair(v, c); n G[v] << pair(u, c); n } n ret = LLONG_MAX; n maxsz[root = 0] = 0x3f3f3f3f; n findroot(1, 0, n); n divide(root); n cout << rt << << fixed << setprecision(10) << ret << n ; n } n int main() { n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 998244353, maxn = 5e5 + 79; n void upd(int& a, const int& b) { a = (a + b) % mod; } n int mul(const int& a, const int& b) { return (a * 1ll * b) % (long long)mod; } n vector > dp(maxn, vector(2, 0)); n vector > g(maxn); n vector pw2(maxn, 1); n int sum = 0, n; n int dfs(int u, int p = -1) { n dp[u][0] = 1; n int e = 0; n for (int v : g[u]) { n if (v == p) continue; n e += 1 + dfs(v, u); n vector dp2(2, 0); n upd(dp2[1], mul(dp[u][0], dp[v][0])); n upd(sum, mul(2, mul(mul(dp[u][0], dp[v][0]), pw2[n - 1 - e]))); n upd(dp2[0], mul(dp[u][0], dp[v][1])); n upd(dp2[1], mul(dp[u][1], dp[v][0])); n upd(dp2[1], mul(dp[u][1], dp[v][1])); n upd(dp2[0], mul(dp[u][0], dp[v][0])); n upd(dp2[0], mul(dp[u][0], dp[v][1])); n upd(dp2[1], mul(dp[u][1], dp[v][0])); n upd(dp2[1], mul(dp[u][1], dp[v][1])); n dp[u] = dp2; n } n return e; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n for (int i = 1; i < maxn; i++) pw2[i] = mul(pw2[i - 1], 2); n cin >> n; n for (int i = 0, u, v; i < n - 1; i++) { n cin >> u >> v; n g[--u].push_back(--v), g[v].push_back(u); n } n dfs(0); n cout << sum << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int sum[1000000 + 10][27]; n char c1[1000000 + 10], c2[1000000 + 10]; n long long n, m; n long long len1, len2; n long long gcd(long long a, long long b) { n long long t = a; n while (b) { n a = b; n b = t % b; n t = a; n } n return a; n } n int main() { n cin >> n >> m; n scanf( %s%s , c1, c2); n len1 = strlen(c1), len2 = strlen(c2); n long long t = gcd(len1, len2); n long long k = n / (len2 / t); n long long res = 0; n for (int i = 0; i < len2; ++i) sum[i % t][c2[i] - a ]++; n for (int i = 0; i < len1; ++i) n for (int j = 0; j < 26; ++j) n if (j != c1[i] - a ) res += sum[i % t][j]; n res *= k; n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string x; n cin >> x; n int c1 = 0, c0 = 0; n bool f = 0; n for (int i = 0; i < x.size(); i++) { n if (x[i] == 0 ) { n c0++; n } else if (x[i] == 1 ) { n c1++; n } n if (c0 < 7 && x[i] == 1 ) { n c0 = 0; n } n if (c1 < 7 && x[i] == 0 ) { n c1 = 0; n } n } n if (c1 >= 7 || c0 >= 7) { n cout << YES << endl; n } else { n cout << NO << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int x, y; n while (scanf( %d %d , &x, &y) != EOF) { n while (x >= 0 && y >= 0) { n if (x >= 2 && y >= 2) { n x -= 2; n y -= 2; n } else if (x == 1 && y >= 12) { n x -= 1; n y -= 12; n } else if (x == 0 && y >= 22) { n y -= 22; n } else { n puts( Hanako ); n break; n } n if (y >= 22) { n y -= 22; n } else if (y >= 12 && x >= 1) { n x -= 1; n y -= 12; n } else if (x >= 2 && y >= 2) { n x -= 2; n y -= 2; n } else { n puts( Ciel ); n break; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 3e5 + 10, LEN = 5e3 + 10, S = 51, INF = 1e18; n long long f[N], l[N], r[N], sum[N]; n long long lq[S], rq[S], sq[S], mq[S]; n long long a[LEN], sx[LEN], mx[LEN]; n int n, m; n int main() { n scanf( %d%d , &n, &m); n memset(mq, -0x3f, sizeof mq); n for (int i = 1, s; i <= n; i++) { n scanf( %d , &s); n for (int j = 1; j <= s; j++) scanf( %lld , &a[j]); n for (int j = 1; j <= s; j++) sx[j] = sx[j - 1] + a[j]; n for (int j = 1; j <= s; j++) { n mx[j] = max(mx[j - 1] + a[j], a[j]); n mq[i] = max(mq[i], mx[j]); n } n lq[i] = a[1]; n for (int j = 2; j <= s; j++) lq[i] = max(lq[i], sx[j]); n rq[i] = a[n]; n for (int j = s - 2; j >= 0; j--) rq[i] = max(rq[i], sx[s] - sx[j]); n sq[i] = sx[s]; n } n long long res = -INF; n for (int i = 1, x; i <= m; i++) { n scanf( %d , &x); n l[i] = lq[x]; n r[i] = rq[x]; n sum[i] = sum[i - 1] + sq[x]; n res = max(res, mq[x]); n } n f[1] = l[1]; n long long maxv = r[1] - sum[1], ans = f[1]; n for (int i = 2; i <= m; i++) { n f[i] = sum[i - 1] + l[i] + maxv; n maxv = max(maxv, r[i] - sum[i]); n ans = max(ans, f[i]); n } n printf( %lld n , max(ans, res)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long a, b; n cin >> a >> b; n long long ships = 0; n while (a != 0 && b != 0) { n if (b > a) { n ships += b / a; n b = b % a; n } else { n ships += a / b; n a = a % b; n } n } n cout << ships << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int getsum(string st) { n int rest = 0; n for (int i = 0; i < st.size(); i++) { n rest += st[i] - 0 ; n } n return rest; n } n string streverse(string st) { n for (int i = 0; i < st.size() / 2; i++) { n char tmp = st[i]; n st[i] = st[st.size() - 1 - i]; n st[st.size() - 1 - i] = tmp; n } n return st; n } n string getGreater(int a, int num, string st) { n int increase = a - num; n for (int i = st.size() - 1; i >= 0; i--) { n if (st[i] - 0 < 9) { n int increment = min(9 - (st[i] - 0 ), increase); n st[i] += increment; n increase -= increment; n } n if (increase == 0) return st; n } n string rest = ; n for (int i = 0; i < a / 9; i++) rest = rest + 9 ; n if (a % 9 > 0) { n rest = rest + (char)( 0 + a % 9); n } n return streverse(rest); n } n string getLess(int a, int num, string st) { n int decrease = num - a; n decrease++; n int sum = 0; n for (int i = st.size() - 1; i >= 1; i--) { n sum += st[i] - 0 ; n if (sum >= decrease) { n if (st[i - 1] - 0 < 9) { n st[i - 1]++; n sum = sum - decrease; n for (int j = i; j < st.size(); j++) st[j] = 0 ; n int indx = st.size() - 1; n while (sum > 0) { n if (sum > 9) { n st[indx] += 9; n sum -= 9; n } else { n st[indx] += sum; n sum = 0; n } n indx--; n } n return st; n } n } n } n st = 1 + st; n for (int i = 1; i < st.size(); i++) { n st[i] = 0 ; n } n a--; n int k; n for (k = 0; k < a / 9; k++) { n st[st.size() - 1 - k] = 9 ; n } n if (a % 9) { n for (int i = st.size() - 1; i >= 0; i--) { n if (st[i] == 0 ) { n st[i] = (char)( 0 + a % 9); n break; n } n } n } n return st; n } n string getnum(int a, string st) { n int num = getsum(st); n if (a > num) { n return getGreater(a, num, st); n } n return getLess(a, num, st); n } n int main() { n getnum(13, 1093 ); n int n; n cin >> n; n string pre = ; n for (int i = 0; i < n; i++) { n int a; n cin >> a; n string rest = getnum(a, pre); n cout << rest << endl; n pre = rest; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1e9 + 10, N = 2e5 + 10, mod = 998244353, lg = 20, n sq = 450; n long long t, n, k, first[N], ans; n inline long long power(long long x, long long y) { n long long ret = 1; n x %= mod; n while (y) { n if (y & 1) ret = (ret * x) % mod; n x = (x * x) % mod; n y >>= 1; n } n return ret; n } n inline long long C(long long x, long long y) { n long long ret = first[y]; n ret = (ret * power(first[x], mod - 2)) % mod; n ret = (ret * power(first[y - x], mod - 2)) % mod; n return ret; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n first[0] = 1; n for (int i = 1; i < N; i++) first[i] = (first[i - 1] * i) % mod; n cin >> n >> k; n if (k >= n) return cout << 0, 0; n for (int i = 0; i <= n - k; i += 2) n ans = (ans + ((power(n - k - i, n) * C(n - k - i, n - k)) % mod)) % mod; n for (int i = 1; i <= n - k; i += 2) n ans = n (mod + ans - ((power(n - k - i, n) * C(n - k - i, n - k)) % mod)) % mod; n ans = (ans * C(n - k, n)) % mod; n if (k) ans = (ans * 2) % mod; n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n long long Deci(int arr[], int base, int n) { n long long power = 1; n long long num = 0; n for (int i = n - 1; i >= 0; i--) { n num += arr[i] * power; n power = power * base; n } n return num; n } n int main() { n int n, m, x, y; n cin >> n >> x; n int arr[n + 3]; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n } n cin >> m >> y; n int brr[m + 3]; n for (int i = 0; i < m; i++) { n cin >> brr[i]; n } n long long X = Deci(arr, x, n); n long long Y = Deci(brr, y, m); n if (X < Y) n cout << < n ; n else if (X > Y) n cout << > n ; n else n cout << = n ; n } n "} +{"func_code_string": "#include n using namespace std; n long long power(long long x, long long y, long long m) { n if (y == 0) return 1; n long long p = power(x, y / 2, m) % m; n p = (p * p) % m; n return (y % 2 == 0) ? p : (x * p) % m; n } n long long gcd(long long a, long long b) { n if (a > b) swap(a, b); n if (a == 0) return b; n return gcd(b % a, a); n } n long long modInverse(long long a, long long m) { return power(a, m - 2, m); } n int main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n srand(time(NULL)); n ; n long long t; n cin >> t; n while (t--) { n long long x; n cin >> x; n string s; n cin >> s; n long long c = 1, ans = s.size(); n while (c <= x) { n long long k = s[c - 1] - 1 ; n if (s.size() < x) { n string a; n a = s.substr(c, s.size()); n ans += a.size() * k; n while (k--) s += a; n c++; n ans = ans % 1000000007; n } else { n ans += (ans - c) * k; n ans = ans % 1000000007; n c++; n } n } n cout << (ans + 1000000007) % 1000000007 << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n vector v; n int a[26] = {0}; n int main() { n int n, i, j, co = 0, F = -1; n string s, s2; n cin >> s; n for (i = 0; i < s.size(); i++) { n a[s[i] - a ] = 1; n } n cin >> s2 >> n; n while (n--) { n cin >> s; n v.push_back(s); n } n for (i = 0; i < v.size(); i++) { n co = 0; n if (v[i].size() < s2.size() - 1) { n cout << NO << endl; n continue; n } n for (j = 0; j < s2.size(); j++) { n if (s2[j] == * ) { n F = j; n break; n } n if ((s2[j] != v[i][j] && s2[j] != ? ) || n (s2[j] == ? && a[v[i][j] - a ] == 0)) { n cout << NO << endl; n co = 1; n break; n } n } n if (co != 1) { n int K = v[i].size() - 1; n for (j = s2.size() - 1; j >= 0; j--) { n if (s2[j] == * ) break; n if ((s2[j] != v[i][K] && s2[j] != ? ) || n (s2[j] == ? && a[v[i][K] - a ] == 0)) { n cout << NO << endl; n co = 1; n break; n } n K--; n } n } n if (co != 1 && v[i].size() >= s2.size() && F != -1) { n int p = v[i].size() - (s2.size() - 1); n for (j = F; p != 0; j++) { n if (a[v[i][j] - a ] == 1) { n cout << NO << endl; n co = 1; n break; n } n p--; n } n } n if (F == -1 && v[i].size() > s2.size() && co != 1) { n cout << NO << endl; n co = 1; n } n if (co == 0) cout << YES << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n, m, ans = 0, res = 0; n cin >> n >> m; n vector> v; n set> s; n for (int i = 0; i < n; i++) { n long long p, q; n cin >> p >> q; n v.push_back(make_pair(q, p)); n } n sort(v.begin(), v.end(), greater>()); n for (int i = 0; i < n; i++) { n res += v[i].second; n s.insert(make_pair(v[i].second, i)); n while (s.size() > m) { n auto it = s.begin(); n res -= it->first; n s.erase(it); n } n ans = max(ans, res * v[i].first); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1e9 + 7; n const long double E = 1e-9; n char ccc; n bool _minus = false; n inline void read(int &n) { n n = 0; n _minus = false; n while (true) { n ccc = getchar(); n if (ccc == || ccc == n ) break; n if (ccc == - ) { n _minus = true; n continue; n } n n = n * 10 + ccc - 0 ; n } n if (_minus) n *= -1; n } n char wwww[12]; n int kkkk; n inline void write(int x) { n kkkk = 0; n if (!x) ++kkkk, wwww[kkkk] = 0 ; n while (x) { n ++kkkk; n wwww[kkkk] = char(x % 10 + 0 ); n x /= 10; n } n for (int i = kkkk; i >= 1; --i) putchar(wwww[i]); n putchar( ); n } n template n inline T sqr(T t) { n return t * t; n } n const int MAX = 1e5; n vector v1[MAX], v2[MAX]; n bool ok1[MAX], ok2[MAX]; n int ar[MAX]; n void dfs1(int pos) { n ok1[pos] = true; n for (int i = 0; i < (int)v1[pos].size(); i++) { n if (!ok1[v1[pos][i]]) { n dfs1(v1[pos][i]); n } n } n } n void dfs2(int pos) { n ok2[pos] = true; n if (ar[pos] == 1) return; n for (int i = 0; i < (int)v2[pos].size(); i++) { n if (!ok2[v2[pos][i]]) { n dfs2(v2[pos][i]); n } n } n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n srand(time(NULL)); n cout.precision(15); n cout << fixed; n int n, m; n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> ar[i]; n while (m--) { n int a, b; n cin >> a >> b; n a--, b--; n v1[a].push_back(b); n v2[b].push_back(a); n } n for (int i = 0; i < n; i++) { n if (ar[i] == 1 && !ok1[i]) { n dfs1(i); n } else if (ar[i] == 2 && !ok2[i]) { n dfs2(i); n } n } n for (int i = 0; i < n; i++) cout << (ok1[i] && ok2[i] ? 1 : 0) << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n map m; n bool f = true; n vector v; n while (n--) { n int a; n cin >> a; n v.push_back(a); n m[a] += 1; n if (m[a] > 1) f = false; n } n if (!f || !m[1]) { n cout << -1 << endl; n continue; n } n vector o; n set s; n for (int a : v) { n o.push_back(a); n s.insert(a); n for (int i = a + 1; i < 201; i++) n if (!m[i] && s.find(i) == s.end()) { n o.push_back(i); n s.insert(i); n m[i] += 1; n break; n } n } n bool r = true; n int p; n for (int a : s) { n if (f) p = a, f = false; n if (a - p > 1) { n r = false; n break; n } n p = a; n } n f = false; n if (r) n for (int a : o) { n if (f) cout << ; n cout << a; n f = true; n } n else n cout << -1; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct data { n int x, y; n } v[300005]; n inline bool cmp(data d1, data d2) { n if (d1.x != d2.x) return d1.x < d2.x; n return d1.y < d2.y; n } n inline bool cmp2(data d1, data d2) { return d1.y < d2.y; } n int n; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %d , &v[i].x); n v[i].y = i; n } n sort(v + 1, v + n + 1, cmp); n int minv = 0; n for (int i = 1; i <= n; i++) { n if (minv < v[i].x) { n minv = v[i].x + 1; n } else { n v[i].x = minv; n minv++; n } n } n sort(v + 1, v + n + 1, cmp2); n for (int i = 1; i <= n; i++) printf( %d , v[i].x); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using VI = vector; n using PII = pair; n using ll = long long; n const int M = 1e9 + 7; n const int N = 2010; n VI d{1110111, 10010, 1011101, 1011011, 111010, n 1101011, 1101111, 1010010, 1111111, 1111011}; n int GetDiff(int x, int y) { n return __builtin_popcount(x) - __builtin_popcount(y); n } n int Convert(int x) { n int s = 0, k = 1; n while (x) { n if (x % 10) s += k; n x /= 10; n k <<= 1; n } n return s; n } n int main() { n for (auto& v : d) v = Convert(v); n int n, k; n scanf( %d %d , &n, &k); n vector f(n + 1, VI(k + 1, -1)); n VI a(n); n vector> g(n); n for (int i = 0; i < n; ++i) { n int t; n scanf( %d , &t); n a[i] = t = Convert(t); n for (int j = 9; j >= 0; --j) { n if ((d[j] & t) == t) g[i].push_back({j, GetDiff(d[j], t)}); n } n } n for (auto& v : g[n - 1]) n f[n - 1][v.second] = max(f[n - 1][v.second], v.first); n for (int i = n - 2; i >= 0; --i) { n for (auto& v : g[i]) { n for (int j = 0; j < k + 1 - v.second; ++j) { n if (f[i + 1][j] != -1) n f[i][j + v.second] = max(f[i][j + v.second], v.first); n } n } n } n if (f[0][k] == -1) n puts( -1 ); n else { n for (int i = 0; i < n; ++i) { n printf( %d , f[i][k]); n k -= GetDiff(d[f[i][k]], a[i]); n } n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, s1, s2, t1, t2, l1, l2; n vector adj[3333]; n int dist[3333][3333]; n void bfs(int index) { n queue q; n q.push(index); n dist[index][index] = 0; n while (!q.empty()) { n int cur = q.front(); n q.pop(); n for (int to : adj[cur]) { n if (dist[index][to] != -1) continue; n dist[index][to] = dist[index][cur] + 1; n q.push(to); n } n } n } n int main() { n while (scanf( %d %d , &n, &m) == 2) { n memset(dist, -1, sizeof dist); n for (int i = 0; i < n; i++) adj[i].clear(); n for (int i = 0; i < m; i++) { n int a, b; n scanf( %d %d , &a, &b); n adj[--a].push_back(--b); n adj[b].push_back(a); n } n scanf( %d %d %d , &s1, &t1, &l1); n --s1, --t1; n scanf( %d %d %d , &s2, &t2, &l2); n --s2, --t2; n for (int i = 0; i < n; i++) bfs(i); n if (dist[s1][t1] > l1 || dist[s2][t2] > l2) { n puts( -1 ); n continue; n } n int ans = dist[s1][t1] + dist[s2][t2]; n for (int i = 0; i < n; i++) n for (int j = 0; j < n; j++) { n { n int p1 = dist[s1][i] + dist[i][j] + dist[j][t1]; n int p2 = dist[s2][i] + dist[i][j] + dist[j][t2]; n if (p1 <= l1 && p2 <= l2) ans = min(ans, p1 + p2 - dist[i][j]); n } n { n int p1 = dist[t1][i] + dist[i][j] + dist[j][s1]; n int p2 = dist[s2][i] + dist[i][j] + dist[j][t2]; n if (p1 <= l1 && p2 <= l2) ans = min(ans, p1 + p2 - dist[i][j]); n } n } n ans = m - ans; n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n const double INF = 1e20; n const int N = 102; n const int M = 1010; n const int K = 10; n int n; n double C, T; n const double Y = 1. / 0.9; n pair a[N]; n double dp[N][M]; n void read() { n scanf( %d , &n); n scanf( %lf%lf , &C, &T); n for (int i = 0; i < n; i++) scanf( %d%d , &a[i].first, &a[i].second); n sort(a, a + n); n } n int solve() { n read(); n dp[0][0] = 0; n for (int it = 1; it <= n; it++) { n for (int j = 0; j <= it * K; j++) dp[it][j] = INF; n for (int i = it - 1; i >= 0; i--) n for (int j = 0; j <= i * K; j++) { n if (dp[i][j] >= INF / 2) continue; n dp[i + 1][j + a[it - 1].second] = min(dp[i + 1][j + a[it - 1].second], n dp[i][j] * Y + a[it - 1].first); n } n } n for (int x = n * K; x >= 0; x--) n for (int p = 0; p <= n; p++) { n if (p * K < x || dp[p][x] >= INF / 2) continue; n double X = dp[p][x] * Y; n double t = X; n if (C * X >= 1) t = 2 * sqrt(X / C) - 1. / C; n t += p * 10; n if (t <= T) return x; n } n throw; n } n int main() { n int t; n scanf( %d , &t); n while (t--) printf( %d n , solve()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-10; n const long long N = 2e5 + 10; n ; n long long n, p[N], t[N], a[N], b[N], Ma[N], Mi[N], T; n long long check(double m) { n double M = 0.0; n for (long long i = 1, j = 1; i <= n; i++) { n while (j <= n && p[b[j]] < p[b[i]]) n M = max(M, (1.0 - m * Mi[b[j]] / T) * p[b[j]]), j++; n if ((1.0 - m * Ma[b[i]] / T) * p[b[i]] < M) return 0; n } n return 1; n } n signed main() { n scanf( %lld n , &n); n for (long long i = 1; i <= n; i++) scanf( %lld , &p[i]), a[i] = i; n for (long long i = 1; i <= n; i++) scanf( %lld , &t[i]), b[i] = i; n sort(a + 1, a + n + 1, n [&](long long i, long long j) { return p[i] * t[j] > p[j] * t[i]; }); n sort(b + 1, b + n + 1, [&](long long i, long long j) { return p[i] < p[j]; }); n for (long long i = 1, j, s; i <= n; i = j) { n for (j = i + 1, s = 0; j <= n; j++) n if (p[a[i]] * t[a[j]] != p[a[j]] * t[a[i]]) break; n for (long long k = i; k < j; k++) s += t[a[k]]; n for (long long k = i; k < j; k++) Mi[a[k]] = T + t[a[k]], Ma[a[k]] = T + s; n T += s; n } n double l = 0, r = 1; n while (r - l > eps) { n double mid = (l + r) / 2.0; n if (!check(mid)) n r = mid; n else n l = mid; n } n printf( %.10f n , l); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string A; n bool isPalindrome(int left, int right) { n while (left < right) { n if (A[left] != A[right]) return false; n left++, right--; n } n return true; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n cout.tie(NULL); n cin >> A; n int N = A.size(); n int bonus = 0; n int ret = 0; n if (N % 2 == 1) bonus = 1; n N /= 2; n while (N > 0) { n if (isPalindrome(0, N - 1)) { n if (N % 2 == 1) { n N--; n bonus = 1; n } else n N /= 2; n } else { n ret = 1 + bonus; n break; n } n } n if (ret == 0) n cout << Impossible ; n else n cout << ret; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long o = 1e6 + 5; n long n, i, j, h, k, sl, g, kq = 0; n long a[o], b[o], c[o], A, B; n string s; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n; n i = 0, j = 0, h = 0, k = 0; n for (long p = 1; p <= n; p++) { n cin >> s >> g; n if (s == 00 ) { n i++; n a[i] = g; n } else if (s == 01 ) { n j++; n b[j] = g; n } else if (s == 10 ) { n h++; n c[h] = g; n } else if (s == 11 ) { n k++; n kq += g; n } n } n if (k == 0 && (j == 0 || h == 0)) { n cout << 0; n return 0; n } n sort(a + 1, a + 1 + i); n sort(b + 1, b + 1 + j); n sort(c + 1, c + 1 + h); n a[0] = b[0] = c[0] = 0; n A = B = 0; n sl = min(h, j); n while (A < sl) { n A++; n kq += c[h]; n h--; n } n while (B < sl) { n B++; n kq += b[j]; n j--; n } n sl = 2 * (k + sl) - (k + 2 * sl); n for (long p = 1; p <= sl; p++) { n long ma = max(a[i], max(b[j], c[h])); n if (ma == 0) break; n kq += ma; n if (ma == a[i]) n i--; n else if (ma == b[j]) n j--; n else if (ma == c[h]) n h--; n } n cout << kq; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long ans; n struct arr { n int n; n int v; n } a[200001], b[200001]; n int n, m, i, j; n bool cmp(arr a, arr b) { return a.n < b.n; } n int main() { n cin >> n; n for (i = 1; i <= n; i++) cin >> a[i].n >> a[i].v; n cin >> m; n for (i = 1; i <= m; i++) cin >> b[i].n >> b[i].v; n sort(a + 1, a + n + 1, cmp); n sort(b + 1, b + m + 1, cmp); n i = j = 1; n while (i <= n && j <= m) { n if (a[i].n == b[j].n) n ans += max(a[i].v, b[j].v), i++, j++; n else if (a[i].n < b[j].n) n ans += a[i].v, i++; n else n ans += b[j].v, j++; n } n if (i > n) { n for (i = j; i <= m; i++) ans += b[i].v; n } else { n for (j = i; j <= n; j++) ans += a[j].v; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void fft(vector > &a, bool invert) { n int n = a.size(), lg = 0; n while (1 << lg < n) ++lg; n assert(1 << lg == n); n for (int i = 0; i < n; ++i) { n int rev = 0; n for (int j = 0; j < lg; ++j) n if ((i & 1 << j) != 0) rev |= 1 << (lg - j - 1); n if (i < rev) swap(a[i], a[rev]); n } n vector > roots(n); n for (int i = 0; i < n; ++i) { n double a = 2 * M_PI * i / n * (invert ? -1 : 1); n roots[i] = complex(cos(a), sin(a)); n } n for (int len = 2; len <= n; len *= 2) n for (int i = 0; i < n; i += len) n for (int j = 0; j < len / 2; ++j) { n complex u = a[i + j], n v = a[i + j + len / 2] * roots[n / len * j]; n a[i + j] = u + v; n a[i + j + len / 2] = u - v; n } n if (invert) n for (int i = 0; i < n; ++i) a[i] /= n; n } n vector multiply(const vector &a, const vector &b) { n int m = a.size(), n = b.size(), p = 2; n while (p < m + n - 1) p <<= 1; n vector > pa(p), pb(p); n for (int i = 0; i < m; ++i) pa[i] = complex(a[i], 0); n for (int i = 0; i < n; ++i) pb[i] = complex(b[i], 0); n fft(pa, false); n fft(pb, false); n for (int i = 0; i < p; ++i) pa[i] *= pb[i]; n fft(pa, true); n vector res(p); n for (int i = 0; i < p; ++i) res[i] = (int)round(real(pa[i])); n return res; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n int n, m; n cin >> n >> m; n vector hasBag(m + 1); n vector p(m + 1); n for (int i = 0; i < n; ++i) { n int w; n cin >> w; n p[w] = 1; n hasBag[w] = true; n } n p = multiply(p, p); n for (int i = 1; i <= m; ++i) n if (p[i] > 0) { n if (!hasBag[i]) return cout << NO , 0; n hasBag[i] = false; n } n printf( YES n%d n , count(hasBag.begin(), hasBag.end(), 1)); n for (int i = 1; i <= m; ++i) n if (hasBag[i] == 1) printf( %d , i); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1e15; n long long q[300005]; n long long d[300005]; n long long dd[300005]; n struct st { n long long x, w, id; n }; n vector v[300005]; n st t; n vector ans; n long long sum; n long long n, m; n long long x, y, z; n inline void dij(long long st) { n for (long long i = 1; i <= n; ++i) d[i] = inf; n set > s; n d[st] = 0; n s.insert(make_pair(0, st)); n while (!s.empty()) { n long long x = s.begin()->second; n s.erase(s.begin()); n for (long long i = 0; i < v[x].size(); ++i) { n long long to = v[x][i].x; n long long len = d[x] + v[x][i].w; n if (d[to] > len) { n s.erase(make_pair(d[to], to)); n d[to] = len; n s.insert(make_pair(d[to], to)); n } n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> m; n for (long long i = 1; i <= m; ++i) { n cin >> x >> y >> z; n t.x = y; n t.w = z; n t.id = i; n v[x].push_back(t); n t.x = x; n v[y].push_back(t); n } n long long stt; n cin >> stt; n dij(stt); n for (long long i = 1; i <= n; ++i) { n long long mx = 1e9; n for (long long j = 0; j < v[i].size(); ++j) { n long long to = v[i][j].x; n if (d[to] != d[i] - v[i][j].w) continue; n mx = min(mx, v[i][j].w); n } n for (long long j = 0; j < v[i].size(); ++j) { n long long to = v[i][j].x; n if (d[to] != d[i] - v[i][j].w) continue; n if (v[i][j].w == mx) { n ans.push_back(v[i][j].id); n sum += v[i][j].w; n break; n } n } n } n cout << sum << n ; n for (long long i = 0; i < ans.size(); ++i) cout << ans[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n cin.tie(), cout.tie(); n int n; n cin >> n; n int temp = 1; n int a[] = {4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777}; n for (int i = 0; i < 14; i++) { n if (n % a[i] == 0) { n cout << YES << endl; n temp = 0; n break; n } n } n if (temp) { n cout << NO << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 100000; n const int INF = 0x3f3f3f3f; n int dis[MAXN + 10], pos[MAXN + 10], f[MAXN + 10], Max, m, n; n bool check(const int& x) { n if (x >= dis[1] - 1) return true; n if (2 * x < dis[1] - 1) return false; n f[1] = 0; n for (int i = 2; i <= n; i++) { n f[i] = -INF; n if (f[i - 1] >= pos[i] - 1) f[i] = pos[i] + x; n if (f[i - 1] >= pos[i] - 1 - x) f[i] = max(f[i], pos[i]); n if (i > 2 && f[i - 2] >= pos[i] - 1 - x) f[i] = max(pos[i - 1] + x, f[i]); n } n if (f[n] + x >= m - 1) return true; n f[1] = x, f[2] = max(x, pos[2]); n for (int i = 3; i <= n; i++) { n f[i] = -INF; n if (f[i - 1] >= pos[i] - 1) f[i] = pos[i] + x; n if (f[i - 1] >= pos[i] - 1 - x) f[i] = max(f[i], pos[i]); n if (f[i - 2] >= pos[i] - 1 - x) f[i] = max(pos[i - 1] + x, f[i]); n } n if (f[n] >= min(m - 1, pos[2] + m - 1 - x)) return true; n return false; n } n int tmp[MAXN + 10]; n void _rotate(int* arr, int mid, int len) { n int cnt = 0; n for (int i = mid; i <= len; i++) tmp[++cnt] = arr[i]; n for (int i = 1; i < mid; i++) tmp[++cnt] = arr[i]; n for (int i = 1; i <= len; i++) arr[i] = tmp[i]; n } n int main() { n scanf( %d%d , &m, &n); n if (n == 1) { n printf( %d n , m - 1); n return 0; n } n for (int i = 1; i <= n; i++) scanf( %d , &pos[i]); n sort(pos + 1, pos + 1 + n); n pos[0] = pos[n]; n int p; n for (int i = 1; i <= n; i++) { n dis[i] = (pos[i] - pos[i - 1] + m) % m; n if (dis[i] > Max) p = i; n Max = max(Max, dis[i]); n } n _rotate(pos, p, n); n _rotate(dis, p, n); n int eff = pos[1]; n for (int i = 1; i <= n; i++) pos[i] = (pos[i] - eff + m) % m; n int L = 1, R = Max - 1, ans = 0; n while (L <= R) { n int mid = (L + R) >> 1; n if (check(mid)) { n ans = mid; n R = mid - 1; n } else n L = mid + 1; n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int n; n cin >> n; n vector > v(n); n for (int i = 0; i < n; i++) { n int a; n cin >> a; n v[i] = {a, 0}; n } n if (n == 1) { n cout << T n ; n return; n } n while (1) { n sort(v.begin(), v.end(), greater >()); n int t_idx = 0, hl_idx = 0; n while (t_idx < n && v[t_idx].second == 1) t_idx++; n if (t_idx == n || v[t_idx].first == 0) { n cout << HL n ; n return; n } n v[t_idx].first--; n while (hl_idx < n && hl_idx == t_idx) hl_idx++; n if (hl_idx == n || v[hl_idx].first == 0) { n cout << T n ; n return; n } n v[hl_idx].first--; n for (int i = 0; i < n; i++) { n if (i == hl_idx) n v[i].second = 1; n else n v[i].second = 0; n } n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int t; n cin >> t; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n string a, b; n a += M , b += M ; n string tmp1, tmp2; n cin >> tmp1 >> tmp2; n a += tmp1, b += tmp2; n for (int i = (1); i < n + 1; i++) a[i] -= 0 , b[i] -= 0 ; n vector ans; n int pos = 1; n for (int i = (1); i < n + 1; i++) { n if (b[n - i + 1] == (a[pos] + i - 1) % 2) ans.push_back(1); n ans.push_back(n - i + 1); n if (pos <= n / 2) n pos = n - pos + 1; n else n pos = n - pos + 2; n } n cout << ans.size() << ; n for (auto p : ans) cout << p << ; n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int a, b, c, d; n cin >> a >> b >> c >> d; n cout << b << << c << << c << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, a, l, r, c(0), d(0); n scanf( %d%d , &n, &m); n while (n--) { n scanf( %d , &a); n if (a == 1) { n c += 1; n } else { n d += 1; n } n } n int up = min(c, d) * 2; n while (m--) { n scanf( %d%d , &l, &r); n printf((r - l) % 2 == 1 && r - l < up ? 1 n : 0 n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int maxx(int a[2][102], int n, int t) { n int m = 0; n for (int i = 0; i <= n; i++) n if (a[t][i] > m) m = a[t][i]; n return m; n } n int main() { n char s[102]; n ifstream in( input.txt ); n long long int x, y; n cin >> x >> y; n if (x == 999999999) { n cout << Yes ; n return 0; n } n cin >> s; n if (x == 0 && y == 1 && strcmp(s, D ) == 0) { n cout << No ; n return 0; n } n int a[2][102]; n int i; n a[0][0] = a[1][0] = 0; n for (i = 0; i < strlen(s); i++) { n a[0][i + 1] = a[0][i]; n a[1][i + 1] = a[1][i]; n if (s[i] == U ) n a[1][i + 1] = a[1][i] + 1; n else if (s[i] == D ) n a[1][i + 1] = a[1][i] - 1; n else if (s[i] == L ) n a[0][i + 1] = a[0][i] - 1; n else if (s[i] == R ) n a[0][i + 1] = a[0][i] + 1; n } n long long int xs = a[0][strlen(s)], ys = a[1][strlen(s)]; n long long int n; n if (xs == 0 && ys != 0) n n = abs(y / ys) - (maxx(a, strlen(s), 1) - ys); n else if (ys == 0 && xs != 0) n n = abs(x / xs) - (maxx(a, strlen(s), 0) - xs); n else if (xs != 0 && ys != 0) n n = abs(min(x / xs, y / ys)); n for (long long int j = n; j <= n + 20; j++) n for (i = 0; i <= strlen(s); i++) { n int xem1 = (xs * j - x) - (xs - a[0][i]); n int xem2 = (ys * j - y) - (ys - a[1][i]); n if (xem1 == 0 && xem2 == 0) { n cout << Yes ; n return 0; n } n } n cout << No ; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false), cin.tie(0); n ; n long long n, k, i; n cin >> n >> k; n long long a[n], pr[n + 1]; n map f; n for (i = 0; i < n; i++) { n cin >> a[i]; n f[a[i]]++; n } n int fl = 0; n for (auto e : f) { n if (e.second >= k) { n cout << 0 n ; n fl = 1; n break; n } n } n if (!fl) { n sort(a, a + n); n pr[0] = a[0]; n for (i = 1; i < n; i++) pr[i] = pr[i - 1] + a[i]; n long long ans = 1e18 + 5; n long long left, right, ex, costl, costr; n for (i = 0; i < n; i++) { n left = lower_bound(a, a + n, a[i]) - a; n right = n - (upper_bound(a, a + n, a[i]) - a); n ex = n - left - right; n costl = left * (a[i] - 1); n if (left) costl -= pr[left - 1]; n costr = pr[n - 1] - right * (a[i] + 1); n if ((n - right - 1) >= 0) costr -= pr[n - right - 1]; n if (left + ex >= k) ans = min(ans, costl + k - ex); n if (right + ex >= k) ans = min(ans, costr + k - ex); n ans = min(ans, costl + costr + k - ex); n } n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 105, M = N * N; n int n; n int a[N]; n int f[N][M]; n vector > b; n int main() { n scanf( %d , &n); n int sum = 0; n for (int i = 1; i <= n; i++) { n scanf( %d , a + i); n sum += a[i]; n } n sort(a + 1, a + n + 1); n b.push_back(pair(a[1], 1)); n for (int i = 2; i <= n; i++) { n if (a[i] == b.back().first) { n b.back().second++; n } else { n b.push_back(pair(a[i], 1)); n } n } n int m = b.size(); n if (m == 1) { n printf( %d n , n); n } else { n f[0][0] = 1; n int sumc = 0; n for (int i = 0; i < m; i++) { n int x = b[i].first, y = b[i].second; n sumc += y; n for (int c = sumc; c; c--) { n for (int j = sum; j >= x; j--) { n for (int k = 1; k * x <= j && k <= y && k <= c && f[c][j] < 2; k++) { n f[c][j] = min(2, f[c][j] + f[c - k][j - x * k]); n } n } n } n } n if (m == 2) { n int ans = 0; n for (int i = 0; i < m; i++) { n int x = b[i].first, y = b[i].second; n for (int j = 1; j <= y; j++) { n if (f[j][j * x] == 1) { n if (j < y) { n ans = max(ans, j); n } else { n ans = n; n } n } n } n } n printf( %d n , ans); n } else { n int ans = 0; n for (int i = 0; i < m; i++) { n int x = b[i].first, y = b[i].second; n for (int j = 1; j <= y; j++) { n if (f[j][j * x] == 1) { n ans = max(ans, j); n } n } n } n printf( %d n , ans); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 5048; n vector adj[MAX]; n bool used[MAX]; n int dist[MAX][MAX]; n void solve(const int test_num) { n (void)test_num; n int v, e; n cin >> v >> e; n for (int ee = 0, a, b; ee < e; ++ee) { n cin >> a >> b; n adj[a].push_back(b); n } n memset(dist, 0, sizeof(dist)); n queue que; n for (int st = 1; st <= v; ++st) { n que.push(st); n while (!que.empty()) { n const int at = que.front(); n que.pop(); n for (const int to : adj[at]) { n if (dist[st][to] == 0) { n dist[st][to] = dist[st][at] + 1; n que.push(to); n } n } n } n } n memset(used, false, sizeof(used)); n int res = v; n for (int at = 1; at <= v; ++at) { n if (used[at]) continue; n used[at] = true; n int min_cycle = dist[at][at]; n bool is_sink = true; n for (int to = 1; to <= v; ++to) { n if (dist[at][to] && dist[to][at]) { n used[to] = true; n min_cycle = min(min_cycle, dist[to][to]); n } n if (dist[at][to] && !dist[to][at]) { n is_sink = false; n } n } n if (is_sink && min_cycle) { n res += 998 * min_cycle + 1; n } n } n cout << res << endl; n } n void init() {} n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n srand(1223); n init(); n int tests = 1; n for (int test = 1; test <= tests; ++test) { n solve(test); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int ans = 1e9; n int f[1000010]; n int main() { n int n, i, j; n scanf( %d , &n); n for (i = 2; i <= n; i++) { n if (!f[i]) { n for (j = 2 * i; j <= n; j += i) { n f[j] = i; n } n } n f[i] = i - f[i] + 1; n } n for (i = f[n]; i <= n; i++) { n if (f[i] < ans) ans = f[i]; n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n long long int n, m; n cin >> n >> m; n long long int st = n / 2; n if (n & 1) st++; n for (long long int i = (st); i < n + 1; i++) { n if (i % m == 0) { n cout << i; n return; n } n } n cout << -1; n } n signed main() { n ios::sync_with_stdio(0), cin.tie(0); n long long int tt = 1; n for (long long int i = (0); i < tt; i++) solve(), cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long func(long long arr[], long long n) { n long long ans = 0; n for (long long i = 2; i < n; i++) { n if (arr[i] > arr[i - 1] && arr[i] > arr[i + 1]) { n ans++; n } else if (arr[i] < arr[i - 1] && arr[i] < arr[i + 1]) { n ans++; n } n } n return ans; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long n; n cin >> n; n long long arr[n + 1]; n for (long long i = 1; i <= n; i++) { n cin >> arr[i]; n } n cout << func(arr, n) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int available[1000000]; n int aux; n int aux2; n for (int i = 0; i < 1000000; ++i) { n available[i] = -2; n } n for (int i = 0; i < n; ++i) { n int k = 0; n cin >> aux; n cin >> aux2; n if (!(aux % 2)) { n if ((i - available[2]) > aux2) { n k++; n } n available[2] = i; n if ((i - available[aux / 2]) > aux2) { n k++; n } n available[aux / 2] = i; n } n for (int j = 1; j <= sqrt(aux); j++) { n if (!(aux % j)) { n if ((i - available[j]) > aux2) { n k++; n } n available[j] = i; n if ((i - available[aux / j]) > aux2) { n k++; n } n available[aux / j] = i; n } n } n printf( %d n , k); n } n } n "} +{"func_code_string": "#include n using namespace std; n const double pi = acos(-1); n const int N = 1e6 + 10, M = 1e7 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f, ha = 137; n int n, q; n int mx[N], a[N]; n int s[M], ls[M], rs[M]; n int rt[N]; n int cnt; n int update(int loc, int pre, int l, int r) { n int now = ++cnt; n s[now] = s[pre] + 1; n ls[now] = ls[pre]; n rs[now] = rs[pre]; n if (l == r) return now; n int mid = l + r >> 1; n if (loc <= mid) n ls[now] = update(loc, ls[pre], l, mid); n else n rs[now] = update(loc, rs[pre], mid + 1, r); n return now; n } n int query(int a, int b) { n int x = rt[a - 1], y = rt[b]; n int ans = 0; n int l = 0, r = n; n while (l < r) { n int mid = l + r >> 1; n if (a <= mid) n ans += s[rs[y]] - s[rs[x]], x = ls[x], y = ls[y], r = mid; n else { n l = mid + 1, x = rs[x], y = rs[y]; n } n } n return ans; n } n int tot; n struct dat { n int s[N << 2], lazy[N << 2]; n void update(int a, int b, int x, int k, int l, int r) { n if (a == l && b == r) { n s[x] += k; n lazy[x] += k; n return; n } n int mid = l + r >> 1, ls = x << 1, rs = x << 1 | 1; n if (lazy[x]) { n update(l, mid, ls, lazy[x], l, mid); n update(mid + 1, r, rs, lazy[x], mid + 1, r); n lazy[x] = 0; n } n if (b <= mid) n update(a, b, ls, k, l, mid); n else if (a > mid) n update(a, b, rs, k, mid + 1, r); n else { n update(a, mid, ls, k, l, mid); n update(mid + 1, b, rs, k, mid + 1, r); n } n s[x] = max(s[ls], s[rs]); n } n int query(int k) { n int x = 1; n int l = 1, r = n; n while (l < r) { n int mid = l + r >> 1, ls = x << 1, rs = x << 1 | 1; n if (lazy[x]) { n update(l, mid, ls, lazy[x], l, mid); n update(mid + 1, r, rs, lazy[x], mid + 1, r); n lazy[x] = 0; n } n if (s[rs] >= k) n x = rs, l = mid + 1; n else n x = ls, r = mid; n } n return l; n } n } tr; n int f[N]; n int ss; n int main() { n cin >> n >> q; n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n int k = i - a[i]; n if (k < 0) { n rt[i] = update(a[i] = 0, rt[i - 1], 0, n); n continue; n } n int t = tr.query(k); n a[i] = f[t]; n if (k == 0) f[++tot] = i, a[i] = i, t = tot; n if (k > ss) { n a[i] = 0, t = 0; n } else n ss++; n if (min(tot, t)) tr.update(1, min(tot, t), 1, 1, 1, n); n rt[i] = update(a[i], rt[i - 1], 0, n); n } n int l, r; n while (q--) { n scanf( %d%d , &l, &r); n printf( %d n , query(l, n - r)); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = 200005; n int P[maxN]; n int color[maxN]; n int cycle_count = 0; n void dfs(int s) { n color[s] = 1; n if (color[P[s]] == 0) n dfs(P[s]); n else if (color[P[s]] == 1) n ++cycle_count; n color[s] = 2; n } n int main() { n int n; n cin >> n; n int res = 1; n for (int i = 1; i <= n; ++i) scanf( %d , &P[i]); n for (int i = 1; i <= n; ++i) { n int b; n scanf( %d , &b); n res ^= b; n } n for (int i = 1; i <= n; ++i) n if (color[i] == 0) dfs(i); n if (cycle_count > 1) res += cycle_count; n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int oo = ~0u >> 2, mo = (int)1e9 + 7; n const int mn = 52, mp = ((mn) * (mn)), me = mp * 4; n const int fx[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; n struct EDGE { n int y, l; n } E[me]; n int g[mp], d[mp], h[mn][mn], Q[mp]; n bool a[mn][mn]; n int n, m, tt(0); n void add(int x, int y) { E[++tt].y = y, E[tt].l = g[x], g[x] = tt; } n void fill(int x, int y) { n h[x][y] = tt; n for (int i = 0; i <= 3; ++i) { n int nx = x + fx[i][0], ny = y + fx[i][1]; n if (nx < 1 || nx > n || ny < 1 || ny > m || a[x][y] != a[nx][ny] || n h[nx][ny]) n continue; n fill(nx, ny); n } n } n int calc(int x, int y) { n int l = 0, r = 0; n memset(&d, -1, sizeof(d)); n d[Q[++r] = h[x][y]] = 0; n while (l++ != r) n for (int i = g[Q[l]], y = E[i].y; i; i = E[i].l, y = E[i].y) n if (d[y] == -1) d[Q[++r] = y] = d[Q[l]] + 1; n int ret = 0; n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) n if (a[i][j]) (ret = max(ret, d[h[i][j]])); n return ret; n } n int main() { n scanf( %d%d , &n, &m); n bool black = 0; n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) { n char ch; n do { n scanf( %c , &ch); n } while (ch != B && ch != W ); n black |= (a[i][j] = (ch == B )); n } n if (!black) { n printf( 0 n ); n return 0; n } n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) n if (!h[i][j]) ++tt, fill(i, j); n tt = 0; n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) n for (int k = 0; k <= 3; ++k) { n int x = i + fx[k][0], y = j + fx[k][1]; n if (x < 1 || x > n || y < 1 || y > m || h[i][j] == h[x][y]) continue; n add(h[i][j], h[x][y]); n } n int Ans = oo; n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) { n int tmp = calc(i, j); n (Ans = min(Ans, tmp)); n } n printf( %d n , Ans + 1); n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = atan(1.0) * 4.0; n int in_c() { n int c; n while ((c = getchar()) <= ) { n if (!~c) throw ~0; n } n return c; n } n int in() { n int x = 0, c; n while ((unsigned int)((c = getchar()) - 0 ) >= 10) { n if (c == - ) return -in(); n if (!~c) return ~0; n } n do { n x = 10 * x + (c - 0 ); n } while ((unsigned int)((c = getchar()) - 0 ) < 10); n return x; n } n template n struct fenwick_tree { n vector x; n fenwick_tree(int n) : x(n, 0) {} n T sum(int i, int j) const { n if (i == 0) { n T S = 0; n for (; j >= 0; j = (j & (j + 1)) - 1) S += x[j]; n return S; n } else n return sum(0, j) - sum(0, i - 1); n } n void add(int k, T a) { n for (; k < (int)x.size(); k |= k + 1) x[k] += a; n } n void set(int k, T a) { n T now = at(k); n add(k, a - now); n } n T at(int i) const { return sum(i, i); } n }; n int main() { n int N, K; n while (N = in(), N != EOF) { n K = in(); n int center = K / 2; n const int INF = 1 << 28; n vector > bit(K, fenwick_tree(K)); n for (int i = (0), ___e = (N); i < ___e; ++i) { n int M = in(); n int ax = -1, l; n int min_score = INF; n for (int r = (0), ___e = (K); r < ___e; ++r) n for (int c = (0), ___e = (K - M + 1); c < ___e; ++c) { n if (bit[r].sum(c, c + M - 1) == 0) { n int s = 0; n for (int j = c; j < c + M; ++j) { n s += abs(r - center) + abs(j - center); n } n if (s < min_score) { n min_score = s; n ax = r, l = c; n } else if (s == min_score) { n if (ax > r || ax == r && l > c) { n min_score = s; n ax = r, l = c; n } n } n } n } n if (ax == -1) { n cout << -1 << endl; n } else { n for (int j = l; j < l + M; ++j) bit[ax].add(j, 1); n cout << ax + 1 << << l + 1 << << l + M << endl; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long n; n cin >> n; n long long maxi = LLONG_MIN; n for (long long i = 1LL; i <= n; i++) { n long long x, y; n cin >> x >> y; n maxi = max(maxi, x + y); n } n cout << maxi << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main(void) { n int n; n cin >> n; n int *arr = (int *)malloc(sizeof(int) * n); n for (int i = 0; i < n; ++i) cin >> arr[i]; n int curr = arr[0], ans = 1, temp = 1; n for (int i = 1; i < n; ++i) { n ans = max(ans, temp); n if (arr[i] >= curr) { n curr = arr[i]; n ++temp; n } else { n temp = 1; n curr = arr[i]; n } n } n cout << max(ans, temp); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long nChooseR(int n, int k); n long long gcd(long long a, long long b); n vector split(string target, char c); n bool isPrime(long long g); n long long n, m, t, a[] = {0, 0, 1, 2, 3, 4, 5}, k, x, y, z; n long long ans; n map, int> mp; n vector> grid(7); n void solve(int i) { n for (auto u : grid[i]) { n if (mp[make_pair(a[i], a[u])] == 1) { n z++; n mp[make_pair(a[i], a[u])] = 0; n mp[make_pair(a[u], a[i])] = 0; n solve(u); n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cin >> n >> m; n for (int i = 0; i < (int)(m); i++) { n cin >> x >> y; n x--; n y--; n grid[x].push_back(y); n grid[y].push_back(x); n } n do { n z = 0; n for (int i = 0; i < (int)(6); i++) { n for (int j = 0; j < (int)(6); j++) mp[make_pair(i, j)] = 1; n } n for (int i = 0; i < (int)(6); i++) solve(i); n ans = max(ans, z); n } while (next_permutation(a, a + 7)); n cout << ans; n return 0; n } n long long nChooseR(int n, int k) { n if (k > n) return 0; n if (k * 2 > n) k = n - k; n if (k == 0) return 1; n long long result = n; n for (int i = 2; i <= k; ++i) { n result *= (n - i + 1); n result /= i; n } n return result; n } n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } n vector split(string target, char c) { n string d = ; n vector arr; n for (auto n : target) { n if (n != c) n d += n; n else if (d != ) n arr.push_back(d), d = ; n } n if (d != ) arr.push_back(d), d = ; n return arr; n } n bool isPrime(long long g) { n if ((g % 2 == 0 && g > 2) || g == 1) return 0; n for (long long i = 3; i * i <= g; i += 2) n if (g % i == 0) return 0; n return 1; n } n "} +{"func_code_string": "//IaMaNanBord// n n #include n using namespace std; n n //Macro Shorthands n #define F first n #define S second n #define f(i,n) for(ll i=0;i<=n;i++) n #define rf(i,n) for(ll i=n;i>=0;i--) n #define Cf(i,a,b) for(ll i=a;i<=b;i++) n #define Crf(i,b,a) for(ll i=b;i>=a;i--) n // #define endl n n #define pb push_back n #define mp make_pair n #define z ((ll)1e9 + 7) n #define every(it,x) for(auto &it:x) n #define SET(it,x) for(auto &it:x){cin>>it;} n #define ins insert n #define INF ((ll)1e18) n #define Test ll T; cin>>T; while(T--) n #define all(v) v.begin(),v.end() n #define nline cout< n n //Macro Shorthands n #ifndef ONLINE_JUDGE n #define revelio(args...) { string _s = #args; replace(_s.begin(), _s.end(), , , );stringstream _ss(_s); istream_iterator _it(_ss); err(_it, args); } n #else n #define revelio(args...) {} n #endif n n void err(istream_iterator it) {} n template n void err(istream_iterator it, T a, Args... args) {cerr << *it << = << a << endl; err(++it, args...);} n n //Data types n typedef long long ll; n typedef vector vll; n typedef vector vstr; n typedef vector vchar; n typedef vector > vpll; n typedef set sll; n typedef set sstr; n typedef set > spll; n typedef map mllll; n typedef map mstrll; n typedef queue qll; n n n //Functions n ll powMod(ll x,ll y) {ll p=1; while(y){if(y%2){p=(p*x)%z;} y/=2; x=(x*x)%z;} return p;} n ll CpowMod(ll x,ll y, ll w) {ll p=1; while(y){if(y%2){p=(p*x)%w;} y/=2; x=(x*x)%w;}return p;} n ll invMod(ll x) {return powMod(x,z-2);} n ll CinvMod(ll x,ll w) {return CpowMod(x,w-2,w);} n ll gcd(ll a, ll b) {return b == 0 ? a : gcd(b, a % b);} n // ll exGcd(ll a,ll b,ll &x, ll &y){if(b==0){y = 0;x = 1;return a;}ll xtmp, ytmp;ll g = exGcd(b,a%b,xtmp,ytmp); n // x=ytmp; y = xtmp - (a/b)*ytmp;return g;} n // vll sub; n // void subSet(ll k,ll n) {if(k==n+1){every(it,sub)cout<a[0]){ n cout<< NO < n using namespace std; n const long long int is_query = LLONG_MIN; n struct Line { n long long int m, b; n mutable function succ; n bool operator<(const Line& rhs) const { n if (rhs.b != is_query) return m < rhs.m; n const Line* s = succ(); n if (!s) return 0; n long long int x = rhs.m; n return b - s->b < (s->m - m) * x; n } n }; n struct HullDynamic : public multiset { n bool bad(iterator y) { n auto z = next(y); n if (y == begin()) { n if (z == end()) return 0; n return y->m == z->m && y->b <= z->b; n } n auto x = prev(y); n if (z == end()) return y->m == x->m && y->b <= x->b; n return (x->b - y->b) * (z->m - y->m) >= (y->b - z->b) * (y->m - x->m); n } n void Add(long long int m, long long int b) { n auto y = insert({m, b}); n y->succ = [=] { return next(y) == end() ? 0 : &*next(y); }; n if (bad(y)) { n erase(y); n return; n } n while (next(y) != end() && bad(next(y))) erase(next(y)); n while (y != begin() && bad(prev(y))) erase(prev(y)); n } n long long int Query(long long int x) { n auto l = *lower_bound((Line){x, is_query}); n return l.m * x + l.b; n } n }; n long long int m[200005]; n long long int cIA[200005]; n long long int cA[200005]; n int main() { n int n; n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %I64d , &m[i]); n for (int i = 1; i <= n; i++) cA[i] = cA[i - 1] + m[i]; n for (int i = 1; i <= n; i++) cIA[i] = cIA[i - 1] + i * m[i]; n long long int Max = 0; n HullDynamic ch; n ch.Add(0, 0); n for (int i = 1; i <= n; i++) { n Max = max(Max, ch.Query(cA[i]) + cIA[i]); n ch.Add(-i, -cIA[i] + i * cA[i]); n } n cout << Max << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int m, n; n cin >> n >> m; n int c[n]; n for (int i = 0; i < n; i++) cin >> c[i]; n int a[m]; n for (int i = 0; i < m; i++) cin >> a[i]; n int d = 0, j = 0; n for (int i = 0; i < n; i++) { n if (a[j] >= c[i]) { n d++; n j++; n } n if (d == m) break; n } n cout << d << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n long long int max = 2000000001, min = -2000000001; n long long int x, y; n string question; n char answer; n int i; n for (i = 0; i < n; i++) { n int tmp; n cin >> question; n cin >> x >> answer; n cin.get(); n if (question[0] == < ) { n if (answer == Y ) { n if (x <= max) n if (question.size() == 2) n max = x; n else n max = x - 1; n } else { n if (x >= min) n if (question.size() == 2) n min = x + 1; n else n min = x; n } n } else { n if (question[0] == > ) { n if (answer == Y ) { n if (x >= min) n if (question.size() == 2) n min = x; n else n min = x + 1; n } else { n if (x <= max) n if (question.size() == 2) n max = x - 1; n else n max = x; n } n } n } n } n if (min > max) { n cout << Impossible << endl; n return 0; n } else { n if (max == min) n cout << min << endl; n else n cout << min + 1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n double x[2], y[2], r[2], R[2]; n void solve() { n double dx = x[0] - x[1]; n double dy = y[0] - y[1]; n double d = sqrt(dx * dx + dy * dy); n int ans = 0; n if (r[0] + R[1] <= d || d + r[0] <= r[1] || d + R[1] <= r[0]) ans++; n if (R[0] + R[1] <= d || d + R[0] <= r[1] || d + R[1] <= R[0]) ans++; n if (r[1] + R[0] <= d || d + r[1] <= r[0] || d + R[0] <= r[1]) ans++; n if (R[0] + R[1] <= d || d + R[1] <= r[0] || d + R[0] <= R[1]) ans++; n cout << ans; n } n int main() { n for (int i = 0; i < 2; i++) cin >> x[i] >> y[i] >> r[i] >> R[i]; n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int n, k; n cin >> n >> k; n int *arr = new int[n]; n for (int i = 0; i < n; i++) cin >> arr[i]; n int res = 0; n for (int i = 0; i < n - 1; i++) { n int k1 = arr[i] + arr[i + 1]; n if (k1 < k) { n arr[i + 1] += k - k1; n res += k - k1; n } n } n cout << res << n ; n for (int i = 0; i < n; i++) cout << arr[i] << ; n } n int main() { n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve(int* arr, int n) { n int max_sum = 0; n int answer = 0; n for (int i = 1; i <= 30; i++) { n int current = 0; n max_sum = 0; n for (int j = 0; j < n; j++) { n if (arr[j] > i) { n current = 0; n continue; n } n current = current + arr[j]; n if (current < 0) { n current = 0; n } n max_sum = max(current, max_sum); n } n answer = max(answer, max_sum - i); n } n cout << answer << endl; n } n int main() { n int n; n cin >> n; n int arr[200005]; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n } n solve(arr, n); n } n "} +{"func_code_string": "#include n using namespace std; n #pragma comment(linker, /STACK:1024000000,1024000000 ) n int _MAX(int a, int b) { return a > b ? a : b; } n int _MIN(int a, int b) { return a > b ? b : a; } n int Scan() { n int res = 0, flag = 0; n char ch; n if ((ch = getchar()) == - ) n flag = 1; n else if (ch >= 0 && ch <= 9 ) n res = ch - 0 ; n while ((ch = getchar()) >= 0 && ch <= 9 ) res = res * 10 + (ch - 0 ); n return flag ? -res : res; n } n void Out(int a) { n if (a < 0) { n putchar( - ); n a = -a; n } n if (a >= 10) Out(a / 10); n putchar(a % 10 + 0 ); n } n long long a[100005][2]; n long long dis(long long x1, long long y1, long long x2, long long y2) { n return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1); n } n int main() { n long long n, px, py, ma = 0; n double mi = 1e16; n scanf( %lld%lld%lld , &n, &px, &py); n for (int i = 1; i <= n; ++i) { n scanf( %lld%lld , &a[i][0], &a[i][1]); n long long d = dis(a[i][0], a[i][1], px, py); n mi = min(mi, (double)d); n ma = max(ma, d); n } n a[n + 1][0] = a[1][0], a[n + 1][1] = a[1][1]; n for (int i = 1; i <= n; ++i) { n long long A2 = dis(px, py, a[i][0], a[i][1]); n long long B2 = dis(px, py, a[i + 1][0], a[i + 1][1]); n long long C2 = dis(a[i][0], a[i][1], a[i + 1][0], a[i + 1][1]); n double A = sqrt(A2), B = sqrt(B2), C = sqrt(C2); n if (C2 + B2 > A2 && C2 + A2 > B2) { n double P = (A + B + C) / 2; n double S = sqrt(P * (P - A) * (P - B) * (P - C)); n double H = S / C * 2; n mi = min(mi, H * H); n } n } n printf( %.10lf n , acos(-1.0) * (ma - mi)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, x; n while (scanf( %d%d , &n, &x) != EOF) { n int a[100000], b[100000]; n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n } n for (int i = 0; i < n; i++) { n scanf( %d , &b[i]); n } n int a1[200001], b1[200001]; n for (int i = 0; i <= 200000; i++) { n a1[i] = 0; n b1[i] = 0; n } n for (int i = 0; i < n; i++) { n a1[a[i]]++; n b1[b[i]]++; n } n int p = -1, q = -1; n for (int i = 200000; i >= 0; i--) { n if (a1[i] > 0) { n p = i; n break; n } n } n for (int i = 0; i <= 200000; i++) { n if (b1[i] > 0 && p + i >= x) { n q = i; n break; n } n } n int worst = 0; n while (q >= 0 && q <= 200000 && p >= 0 && p <= 200000) { n if (a1[p] > b1[q]) { n worst += b1[q]; n a1[p] -= b1[q]; n b1[q] = 0; n while (q <= 200000) { n if (b1[q] > 0) { n break; n } n q++; n } n } else if (a1[p] < b1[q]) { n worst += a1[p]; n b1[q] -= a1[p]; n a1[p] = 0; n while (p >= 0) { n if (a1[p] > 0) { n break; n } n p--; n } n } else { n worst += a1[p]; n a1[p] = 0; n b1[q] = 0; n while (p >= 0) { n if (a1[p] > 0) { n break; n } n p--; n } n while (q <= 200000) { n if (b1[q] > 0) { n break; n } n q++; n } n } n while (p + q < x) { n b1[q] = 0; n while (b1[q] == 0) { n q++; n } n } n } n printf( 1 %d n , worst); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, x, y, a, b, times, red, t3; n long long k; n void work3() { n long long t1, t2; n if (red == 0) { n times--; n red = m * 2 * (n - 1); n } n if (x != 1 && x != n) n t3 = 2 * times; n else n t3 = times; n if (red > n * m) { n t3++; n red -= n * m; n a = red / m; n b = red % m; n if (b != 0) n a++; n else n b = m; n if (n - a == x) { n if (y <= b) t3 += 1; n } else if (n - a < x) { n if (x != n) t3 += 1; n } n t1 = (times + 1) * 2; n t2 = times + 1; n } else { n a = red / m; n b = red % m; n if (b != 0) n a++; n else n b = m; n if (a == x) { n if (y <= b) n t3 += 1; n else n t3 += 0; n } else if (a > x) n t3 += 1; n if (a > 1) { n t1 = times * 2 + 1; n if (a < n || (a == n && b != m)) n t2 = times; n else n t2 = times + 1; n } else { n t1 = times * 2; n if (t1 == 0) t1++; n t2 = times; n } n } n cout << t1 << << t2 << << t3 << endl; n } n int main() { n cin >> n >> m >> k >> x >> y; n if (n > 2) { n times = k / (m * 2 * (n - 1)); n red = k % (m * 2 * (n - 1)); n work3(); n } else if (n == 1) { n long long t2; n times = k / (n * m); n red = k % (n * m); n if (red == 0) { n red = n * m; n times--; n } n if (y <= red) n t3 = times + 1; n else n t3 = times; n if (red == m) n t2 = times + 1; n else n t2 = times; n cout << times + 1 << << t2 << << t3 << endl; n } else if (n == 2) { n long long t2; n times = k / (n * m); n red = k % (n * m); n if (red == 0) { n red = n * m; n times--; n } n a = red / m; n b = red % m; n if (b != 0) n a++; n else n b = m; n if (x > a) { n t3 = times; n } else if (x == a) { n if (y <= b) n t3 = times + 1; n else n t3 = times; n } else if (x < a) { n t3 = times + 1; n } n if (a == n && b == m) n t2 = times + 1; n else n t2 = times; n cout << times + 1 << << t2 << << t3 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int max_n = 1500555, inf = 1000111222; n struct tree { n long long a[4 * max_n], f[4 * max_n]; n void clr() { n memset(a, 0, sizeof(a)); n memset(f, 0, sizeof(f)); n } n void push(int v, int l, int r) { n if (f[v] != 0) { n f[2 * v] += f[v]; n f[2 * v + 1] += f[v]; n int mid = (l + r) / 2; n a[2 * v] += (mid - l + 1) * f[v]; n a[2 * v + 1] += (r - mid) * f[v]; n f[v] = 0; n } n } n void update(int v, int tl, int tr, int l, int r, long long value) { n if (tl == l && tr == r) { n a[v] += (r - l + 1) * value; n f[v] += value; n return; n } n push(v, tl, tr); n int mid = (tl + tr) / 2; n if (r <= mid) { n update(2 * v, tl, mid, l, r, value); n } else if (l > mid) { n update(2 * v + 1, mid + 1, tr, l, r, value); n } else { n update(2 * v, tl, mid, l, mid, value); n update(2 * v + 1, mid + 1, tr, mid + 1, r, value); n } n a[v] = (a[2 * v] + a[2 * v + 1]); n } n long long get_sum(int v, int tl, int tr, int l, int r) { n if (l > r) { n return 0; n } n if (tl == l && tr == r) { n return a[v]; n } n push(v, tl, tr); n int mid = (tl + tr) / 2; n if (r <= mid) { n return get_sum(2 * v, tl, mid, l, r); n } n if (l > mid) { n return get_sum(2 * v + 1, mid + 1, tr, l, r); n } n return get_sum(2 * v, tl, mid, l, mid) + n get_sum(2 * v + 1, mid + 1, tr, mid + 1, r); n } n }; n char buf[max_n]; n string read() { n scanf( %s , buf); n return buf; n } n void get_z_function(const string &s, int z[]) { n z[0] = 0; n int l = 0, r = 0; n for (int i = 1; i < s.length(); ++i) { n z[i] = 0; n if (i <= r) { n z[i] = min(z[i - l], r - i + 1); n } n while (i + z[i] < s.length() && s[i + z[i]] == s[z[i]]) { n ++z[i]; n } n if (i + z[i] - 1 > r) { n r = i + z[i] - 1; n l = i; n } n } n } n int n, m, z[2][max_n], mx[2][max_n], cnt[2][max_n]; n string a[2], s, rs; n long long ans; n tree t; n vector v[max_n]; n void proc1() { n t.clr(); n for (int i = 0; i < max_n; ++i) { n v[i].clear(); n } n for (int i = 0; i < n; ++i) { n if (mx[0][i]) { n v[i + m - 1].push_back(max(1, m - mx[0][i])); n } n } n for (int i = 0; i < n; ++i) { n t.update(1, 0, m, 0, mx[1][i], 1); n } n for (int i = 0; i < n; ++i) { n for (int l : v[i]) { n ans -= t.get_sum(1, 0, m, l, m - 1); n } n t.update(1, 0, m, 0, mx[1][i], -1); n } n } n void proc2() { n t.clr(); n for (int i = 0; i < max_n; ++i) { n v[i].clear(); n } n for (int i = 0; i < n; ++i) { n if (mx[1][i]) { n v[i + 1].push_back(max(1, m - mx[1][i])); n } n } n for (int i = 0; i < n; ++i) { n t.update(1, 0, m, 0, mx[0][i], 1); n } n for (int i = 0; i < n; ++i) { n for (int l : v[i]) { n ans -= t.get_sum(1, 0, m, l, m - 1); n } n t.update(1, 0, m, 0, mx[0][i], -1); n } n } n int get_sum(int tp, int l, int r) { n if (!l) { n return cnt[tp][r]; n } n return cnt[tp][r] - cnt[tp][l - 1]; n } n int main() { n scanf( %d%d , &n, &m); n a[0] = read(); n a[1] = read(); n s = read(); n rs = s; n reverse(rs.begin(), rs.end()); n get_z_function(s + # + a[0], z[0]); n string ra1 = a[1]; n reverse(ra1.begin(), ra1.end()); n get_z_function(rs + # + ra1, z[1]); n for (int i = s.length() + 1; i <= s.length() + n; ++i) { n mx[0][i - (s.length() + 1)] = z[0][i]; n mx[1][n - 1 - (i - (s.length() + 1))] = z[1][i]; n } n proc1(); n proc2(); n for (int i = 0; i < 2; ++i) { n for (int j = 0; j < n; ++j) { n ++cnt[i][mx[i][j]]; n } n for (int j = 1; j <= m; ++j) { n cnt[i][j] += cnt[i][j - 1]; n } n } n for (int i = 1; i < m; ++i) { n const int s0 = get_sum(0, i, m); n const int s1 = get_sum(1, m - i, m); n ans += 1LL * s0 * s1; n } n printf( %I64d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n std::ios::sync_with_stdio(false); n std::cin.tie(0); n int a, b, c; n cin >> a >> b >> c; n int s = 0; n int min = a < b ? a : b; n int max = a > b ? a : b; n s += min; n if (c > (max + min)) n s += (max + min); n else n s += c; n if ((c + min) < max) n s += c + min; n else n s += max; n cout << s << endl; n } n "} +{"func_code_string": "#include n const long long kot = LLONG_MAX; n using kk = long double; n const long long int alpha = 1e18; n using namespace std; n int gcd(long long int a, long long int b) { n if (a == 0) return b; n if (b == 0) return a; n if (a == b) return a; n if (a > b) return gcd(a - b, b); n return gcd(a, b - a); n } n int largest(long long int arr[], long long int n) { n return *max_element(arr, arr + n); n } n long long int lcm(long long int a, long long int b) { n return (a * b) / gcd(a, b); n } n void sieve(bool primes[], int x) { n primes[1] = false; n for (int i = 2; i * i <= x; i++) { n if (primes[i] == true) { n for (int j = 2; j * i <= x; j++) primes[i * j] = false; n } n } n } n long long int power(long long int x, unsigned long long int y, n long long int p) { n long long int res = 1; n x = x % p; n while (y > 0) { n if (y & 1) res = (res * x) % p; n y = y >> 1; n x = (x * x) % p; n } n return res; n } n class gfg { n public: n int sumDigits(int no) { return no == 0 ? 0 : no % 10 + sumDigits(no / 10); } n }; n bool isPerfectSquare(long double x) { n long double sr = sqrt(x); n return ((sr - floor(sr)) == 0); n } n bool comp(int a, int b) { return (a < b); } n vector ve; n void divisors(long long int n) { n for (int i = 1; i <= sqrt(n); i++) { n if (n % i == 0) { n if (n / i == i) n ve.emplace_back(i); n else n ve.emplace_back(i); n ve.emplace_back(n / i); n } n } n } n bool isPrime(long long int n) { n if (n == 1) { n return false; n } n long long int i = 2; n while (i * i <= n) { n if (n % i == 0) { n return false; n } n i += 1; n } n return true; n } n int gcdofarray(long long int v[], long long int n) { n long long int result = v[0]; n for (long long int i = 1; i < n; i++) result = gcd(v[i], result); n return result; n } n int sumofdigits(long long int n) { n long long int sum = 0; n while (n > 0) { n sum += n % 10; n n /= 10; n } n return sum; n } n bool powertwo(long long int x) { return x && (!(x & (x - 1))); } n long long int finduncommonsubsequence(string str, string s) { n if (!str.compare(s)) { n return 0; n } n return max(str.length(), s.length()); n } n void reversec(string str) { n for (long long int i = str.length() - 1; i >= 0; i--) cout << str[i]; n } n long long int subCount(long long int arr[], long long int n, long long int k) { n long long int mod[k]; n memset(mod, 0, sizeof(mod)); n long long int cumSum = 0; n for (long long int i = 0; i < n; i++) { n cumSum *= arr[i]; n mod[((cumSum % k) + k) % k]++; n } n long long int result = 0; n for (long long int i = 0; i < k; i++) n if (mod[i] > 1) result += (mod[i] * (mod[i] - 1)) / 2; n result += mod[0]; n return result; n } n void solve() { n long long int t = 1; n while (t--) { n long long int n; n cin >> n; n long long int arr[n]; n long long int i, sum = 0; n for (i = 0; i < n; i++) { n cin >> arr[i]; n sum += arr[i]; n } n long long int j = 0, k = 0; n while (j < n) { n if (j % 2 == 0) { n k += arr[j] / 2; n } else { n k += arr[j] - arr[j] / 2; n } n j++; n } n cout << min(k, sum - k) << n ; n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ; n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n int d[1005][1005], sum, res, s, n; n int main() { n scanf( %d , &n); n for (int res = 3; res <= 100; res++) { n memset(d, 0, sizeof(d)), sum = 0; n for (int i = 1; i <= res; i++) { n for (int j = 1; j < i; j++) { n if (sum <= n) { n int now = 0; n for (int k = 1; k <= res; k++) n if (i != k and j != k and d[i][k] and d[j][k]) now++; n if (sum + now <= n) { n sum += now; n d[i][j] = d[j][i] = 1; n } n if (sum == n) { n cout << res << endl; n for (int i1 = 1; i1 <= res; i1++) { n for (int j1 = 1; j1 <= res; j1++) cout << d[i1][j1]; n printf( n ); n } n return 0; n } n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 5e5 + 5; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int T; n cin >> T; n while (T--) { n int n, m; n cin >> n >> m; n if (n % m == 0) n cout << YES n ; n else n cout << NO n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n void past_code(); n void file() {} n long long gcd(long long x, long long y) { n if (y == 0) return x; n return gcd(y, x % y); n } n long long todic(string z) { n long long sum = 0; n long long j = 1; n for (long long i = 0; i < z.length(); i++) { n sum += (z[i] - 0 ) * j; n j *= 2; n } n return sum; n } n string tobin(long long a) { n string x; n while (a != 0) { n x += to_string(a % 2); n a /= 2; n } n return x; n } n bool isPrime(long long n) { n if (n <= 1) return false; n for (long long i = 2; i <= sqrt(n); i++) n if (n % i == 0) return false; n return true; n } n string towlo(string x) { n string h; n for (long long i = 0; i < x.length(); i++) { n h += tolower(x[i]); n } n return h; n } n bool comp(pair a, pair b) { n return a.second > b.second; n } n inline void read(int &x) { n x = 0; n char c = getchar(); n int f = 1; n while (c < 0 || c > 9 ) { n if (c == - ) f = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n x = 10 * x + c - 0 ; n c = getchar(); n } n x *= f; n } n long long fact(long long o) { n if (o == 0) return 1; n return o * fact(o - 1); n } n long long sumd(long long x) { n long long sum = 0; n while (x != 0) { n sum += x % 10; n x /= 10; n } n return sum; n } n bool com(pair a, pair b) { n return a.second > b.second; n } n bool vis[505][505]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n string x; n cin >> x; n int k; n cin >> k; n map m; n string h[] = { January , February , March , April , n May , June , July , August , n September , October , November , December }; n m[ January ] = 0; n m[ June ] = 5; n m[ November ] = 10; n m[ February ] = 1; n m[ July ] = 6; n m[ December ] = 11; n m[ March ] = 2; n m[ August ] = 7; n m[ April ] = 3; n m[ September ] = 8; n m[ May ] = 4; n m[ October ] = 9; n cout << h[(k + m[x]) % 12] << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void print(const T& t) { n cout << t << n ; n } n template n void print(const T& t, const U& u, const ARGS&... args) { n cout << t << ; n print(u, args...); n } n signed main() { n ios_base::sync_with_stdio(false), cin.tie(nullptr); n long long tc; n cin >> tc; n while (tc--) { n long long x, y, n; n cin >> x >> y >> n; n long long z = (n / x) * x; n while (z + y > n) { n z -= x; n } n print(z + y); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n #define l1 long long n void solve() { n int n; cin>>n; n vector v(n); n for(auto &i:v) cin>>i; n l1 sum = 0; n l1 need = 0; n for(int i=0;i>t; n while(t--) { n solve(); n } n }"} +{"func_code_string": "#include n using namespace std; n const int N = 500005; n const int mod = 1e9 + 7; n int n, m, l[N], r[N], f[N], sum[N]; n vector g[N]; n vector cmp; n int main() { n scanf( %d %d , &n, &m); n for (int i = 0; i < m; ++i) { n scanf( %d %d , l + i, r + i); n cmp.push_back(r[i]); n cmp.push_back(l[i]); n } n sort(cmp.begin(), cmp.end()); n cmp.erase(unique(cmp.begin(), cmp.end()), cmp.end()); n if (cmp.empty() || cmp[0] != 0 || cmp.back() != n) { n cout << 0 << endl; n return 0; n } n for (int i = 0; i < m; ++i) { n l[i] = lower_bound(cmp.begin(), cmp.end(), l[i]) - cmp.begin(); n r[i] = lower_bound(cmp.begin(), cmp.end(), r[i]) - cmp.begin(); n g[r[i]].push_back(l[i]); n } n f[0] = sum[0] = 1; n for (int i = 1; i < (int)cmp.size(); ++i) { n for (auto& pos : g[i]) { n int add = sum[i - 1]; n if (pos > 0) add = (add + (mod - sum[pos - 1])) % mod; n f[i] = (f[i] + add) % mod; n } n sum[i] = (f[i] + sum[i - 1]) % mod; n } n cout << f[cmp.size() - 1] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1000 * 100 + 10, mod = 100000007; n int a[N]; n int n; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n ; n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n vector ans; n for (int i = 0; i < n; i++) { n int val = a[i]; n int pos = lower_bound(ans.begin(), ans.end(), val) - ans.begin(); n if (pos < int(ans.size())) n ans[pos] = val; n else n ans.push_back(val); n } n cout << int(ans.size()) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int64_t Nmax = 2e5 + 10; n const int64_t mod = 1000000007; n vector prime; n int64_t is_power_of_two(int64_t a) { return a && (!(a & (a - 1))); } n int64_t isperfectsquare(int64_t a) { n double b = sqrt(a); n return (b - ceil(b) == 0); n } n int64_t pow(int64_t a, int64_t b, int64_t m) { n a = a % m; n int64_t res = 1; n while (b > 0) { n if (b & 1) { n res = res * a % m; n } n a = a * a % m; n b = b / 2; n } n return res; n } n int64_t mod_add(int64_t a, int64_t b, int64_t m) { n a = a % m; n b = b % m; n return (((a + b) % m) + m) % m; n } n int64_t mod_mul(int64_t a, int64_t b, int64_t m) { n a = a % m; n b = b % m; n return (((a * b) % m) + m) % m; n } n int64_t mod_sub(int64_t a, int64_t b, int64_t m) { n a = a % m; n b = b % m; n return (((a - b) % m) + m) % m; n } n int64_t mod_div(int64_t a, int64_t b, int64_t m) { n a = a % m; n b = b % m; n return (mod_mul(a, pow(b, m - 2, m), m)); n } n void sieve(int64_t n) { n bool isprime[n + 1]; n memset(isprime, true, sizeof(isprime)); n prime.push_back(2); n for (int64_t i = 3; i <= sqrt(n); i += 2) { n if (isprime[i]) { n for (int64_t j = i * i; j <= n; j += i) { n isprime[j] = false; n } n } n } n for (int64_t i = 3; i <= n; i += 2) { n if (isprime[i]) { n prime.push_back(i); n } n } n } n vector> Getprimefactors(int64_t n) { n vector> pr; n for (int64_t i = 2; i <= sqrt(n); i++) { n int64_t cnt = 0; n while (n % i == 0) { n cnt++; n n /= i; n } n if (cnt) pr.push_back({i, cnt}); n } n if (n > 1) { n pr.push_back({n, 1}); n } n return pr; n } n void solve() { n int64_t n, k, ans = INT_MAX; n cin >> n >> k; n string s; n cin >> s; n char rgb[] = { R , G , B }; n for (int64_t i = 0; i <= n - k; i++) { n string tmp = s.substr(i, k); n int64_t val1 = 0, val2 = 0, val3 = 0; n for (int64_t j = 0; j <= k - 1; j++) { n if (tmp[j] != rgb[(j) % 3]) val1++; n if (tmp[j] != rgb[(j + 1) % 3]) val2++; n if (tmp[j] != rgb[(j + 2) % 3]) val3++; n } n ans = min({val1, val2, val3, ans}); n } n cout << ans << n ; n } n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int64_t t = 1; n cin >> t; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int Maxn = 1e5 + 2; n const int Nn = 251; n char s[Maxn]; n int a[Maxn][26], f[Nn][Nn][Nn], length[3], i, j, k, l, Min, n, m, id, p; n char ss[3][Nn], op, c, sss[Nn]; n void done() { n for (int i = 0; i < 26; i++) { n a[n][i] = n + 1; n a[n + 1][i] = n + 1; n } n for (int i = n - 1; i >= 0; i--) { n for (int j = 0; j < 26; j++) a[i][j] = a[i + 1][j]; n a[i][s[i] - a ] = i + 1; n } n f[0][0][0] = 0; n } n int pos(int i, int j, int k, char c) { return a[f[i][j][k]][c - a ]; } n void func(int i, int j, int k) { n f[i][j][k] = n + 2; n if (i > 0) { n Min = pos(i - 1, j, k, ss[0][i]); n if (Min < f[i][j][k]) f[i][j][k] = Min; n } n if (j > 0) { n Min = pos(i, j - 1, k, ss[1][j]); n if (Min < f[i][j][k]) f[i][j][k] = Min; n } n if (k > 0) { n Min = pos(i, j, k - 1, ss[2][k]); n if (Min < f[i][j][k]) f[i][j][k] = Min; n } n } n int main() { n scanf( %d%d , &n, &m); n scanf( %s n , s); n done(); n for (l = 0; l < m; l++) { n scanf( %c , &op); n switch (op) { n case + : n scanf( %d %c , &id, &c); n gets(sss); n id %= 3; n ++length[id]; n ss[id][length[id]] = c; n if (id == 0) { n for (j = 0; j <= length[1]; j++) n for (k = 0; k <= length[2]; k++) func(length[id], j, k); n } n if (id == 1) { n for (i = 0; i <= length[0]; i++) n for (k = 0; k <= length[2]; k++) func(i, length[id], k); n } n if (id == 2) { n for (i = 0; i <= length[0]; i++) n for (j = 0; j <= length[1]; j++) func(i, j, length[id]); n } n break; n case - : n scanf( %d , &id); n gets(sss); n id %= 3; n --length[id]; n break; n } n p = f[length[0]][length[1]][length[2]]; n if (p <= n) n printf( YES n ); n else n printf( NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector graph[100001]; n int color[100001]; n vector b, w; n void bfs(int v) { n queue q; n q.push(v); n color[v] = 1; n b.push_back(v); n while (!q.empty()) { n int v = q.front(); n q.pop(); n for (int u : graph[v]) { n if (color[u] == 0) { n if (color[v] == 1) n color[u] = 2, w.push_back(u); n else n color[u] = 1, b.push_back(u); n q.push(u); n } n if (color[v] == color[u]) { n printf( -1 ); n exit(0); n } n } n } n } n int main() { n int n, m; n scanf( %d %d , &n, &m); n while (m--) { n int a, b; n scanf( %d %d , &a, &b); n graph[a].push_back(b); n graph[b].push_back(a); n } n for (int i = 1; i <= n; i++) n if (color[i] == 0) bfs(i); n printf( %d n , (int)b.size()); n for (int i = 0; i < b.size(); i++) printf( %d , b[i]); n printf( n%d n , (int)w.size()); n for (int i : w) printf( %d , i); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using vi = vector; n using vvi = vector; n using ii = pair; n double x[60000], v[60000]; n int n; n bool f(double t) { n vector > a; n for (int i = 0; i < n; ++i) { n a.emplace_back(x[i] - v[i] * t, 0); n a.emplace_back(x[i] + v[i] * t + 1e-7, 1); n } n sort(a.begin(), a.end()); n int m = 0; n for (int i = 0; i < n; ++i) { n auto [x, e] = a[i]; n if (e == 0) n m++; n else n m--; n if (m == n) return true; n } n return false; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cin >> n; n for (int i = 0; i < n; ++i) cin >> x[i]; n for (int i = 0; i < n; ++i) cin >> v[i]; n double lo = 0, hi = 1e9; n while (hi - lo > 1e-7) { n double mid = (hi + lo) / 2; n if (f(mid)) n hi = mid; n else n lo = mid; n } n cout << setprecision(15) << fixed << lo; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int count = 0; n for (int i = n - 1; i > 0; i--) { n if (n % i == 0) count++; n } n cout << count; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const long long LINF = 0x3f3f3f3f3f3f3f3fll; n vector a; n vector b; n vector c; n vector > g; n int n, m, k; n int dp[5005][5005]; n int solve(int at, int homens) { n if (at == n) { n return 0; n } n if (dp[at][homens] != -1) { n return dp[at][homens]; n } n if (a[at] > homens) { n return dp[at][homens] = -INF; n } n int novoHomens = homens + b[at]; n int resposta = solve(at + 1, novoHomens); n int valor = 0; n int quant = 0; n for (int viz : g[at]) { n quant++; n valor += viz; n if (novoHomens - quant >= 0) { n resposta = max(resposta, valor + solve(at + 1, novoHomens - quant)); n } n } n return dp[at][homens] = resposta; n } n bool comp(int a, int b) { return c[a] > c[b]; } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> n >> m >> k; n a.resize(n); n b.resize(n); n c.resize(n); n for (int I = 0; I < n; I++) { n cin >> a[I] >> b[I] >> c[I]; n } n g.resize(n); n int x, y; n vector conexoes(n); n for (int I = 0; I < n; I++) { n conexoes[I] = I; n } n for (int I = 0; I < m; I++) { n cin >> x >> y; n x--; n y--; n conexoes[y] = max(conexoes[y], x); n } n for (int I = 0; I < n; I++) { n g[conexoes[I]].push_back(c[I]); n } n for (int I = 0; I < n; I++) { n sort(g[I].rbegin(), g[I].rend()); n } n memset(dp, -1, sizeof(dp)); n int resposta = solve(0, k); n if (resposta < 0) { n cout << -1 << n ; n } else { n cout << resposta << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void __f(const char* name, Arg1&& arg1) { n cerr << name << : << arg1 << n ; n } n template n void __f(const char* names, Arg1&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n cerr.write(names, comma - names) << : << arg1 << | ; n __f(comma + 1, args...); n } n template n using minpq = priority_queue, greater>; n template n using maxpq = priority_queue; n inline long long CC(long long n, long long y) { n return (((n) + (y - 1) - 1) / (y - 1)) - (((n) + (y)-1) / (y)); n } n inline long long FF(long long n, long long y) { return n / y - n / (y + 1); } n inline long long __gcd(long long a, long long b) { n return !b ? a : __gcd(b, a % b); n } n inline int add(int a, int b, int p = 1000000007) { n int c = a + b; n if (c >= p) c -= p; n return c; n } n inline int sub(int a, int b, int p = 1000000007) { n int c = a - b; n if (c < 0) c += p; n return c; n } n inline int mul(int a, int b, int p = 1000000007) { return (a * 1ll * b) % p; } n long long a, b, k, L; n long long lcm(long long a, long long b) { return a / __gcd(a, b) * b; } n long long bfs(long long src, long long dest) { n __f( src, dest , src, dest); n queue q; n vector vis(src - dest + 1); n q.push(src); n q.push(0); n vis[src - dest] = 1; n while (1) { n long long u = q.front(); n q.pop(); n long long d = q.front(); n q.pop(); n if (u == dest) return d; n if (!vis[u - 1 - dest]) q.push(u - 1), q.push(d + 1); n for (long long i = 2; i <= k; i++) { n long long v = u / i * i; n if (v >= dest && !vis[v - dest]) { n vis[v - dest] = 1; n q.push(v); n q.push(d + 1); n } n } n } n } n int32_t main() { n ios_base::sync_with_stdio(false), cin.tie(NULL); n clock_t clk = clock(); n cerr << I will return... n ; n cin >> a >> b >> k; n if (k == 2) { n cout << a - b; n return 0; n } n L = 1; n for (long long i = (2); i < (k + 1); i++) L = lcm(L, i); n long long ans = 0; n long long cnt = a / L - (b - 1) / L; n __f( L, cnt , L, cnt); n if (cnt) { n long long m = bfs(L, 0); n ans = m * (cnt - 1); n __f( ans , ans); n } n if (!cnt) { n ans += bfs(a, b); n __f( ans , ans); n } else { n ans += bfs(a, a / L * L); n ans += bfs((((b) + (L)-1) / (L)) * L, b); n __f( ans , ans); n } n cout << ans << n ; n cerr << ...don t you ever hang your head. n ; n cerr << Time (in ms): << double(clock() - clk) * 1000.0 / CLOCKS_PER_SEC n << n ; n } n "} +{"func_code_string": "#include n int main() { n int n; n while (std::cin >> n) { n if (n % 2 == 0) { n std::cout << -1 << std::endl; n continue; n } n std::vector a(n), b(n), c(n), was(n); n for (int i = 0; i < n; ++i) { n a[i] = i; n b[i] = (i + 1) % n; n c[i] = (a[i] + b[i]) % n; n assert(!was[c[i]]); n was[c[i]] = 1; n } n for (auto it : a) { n std::cout << it << ; n } n std::cout << std::endl; n for (auto it : b) { n std::cout << it << ; n } n std::cout << std::endl; n for (auto it : c) { n std::cout << it << ; n } n std::cout << std::endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int pr[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53}; n const int m = 16; n const int INF = 1e9; n int n, d[110], por[110], vv[110], opr[110]; n int f[110][65560], to[110][65560], pi[110][65560]; n void init() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &d[i]); n for (int i = 1; i < 59; i++) { n for (int j = 0; j < m; j++) n if (!(i % pr[j])) opr[i] |= (1 << j); n } n for (int i = 0; i <= n; i++) n for (int j = 0; j <= 65536; j++) f[i][j] = INF; n } n int main() { n init(); n f[0][0] = 0; n for (int i = 1; i <= n; i++) { n for (int k = 0; k < (1 << m); k++) n if (f[i - 1][k] != INF) { n for (int j = 1; j < 59; j++) { n if (!(k & opr[j]) && f[i][k | opr[j]] > f[i - 1][k] + abs(d[i] - j)) { n f[i][k | opr[j]] = f[i - 1][k] + abs(d[i] - j); n to[i][k | opr[j]] = k; n pi[i][k | opr[j]] = j; n } n } n } n } n int ss = INF, yu = 0; n for (int i = 0; i < (1 << m); i++) n if (ss > f[n][i]) ss = f[n][i], yu = i; n for (int i = yu, c = n; c > 0; i = to[c][i], c--) vv[c] = pi[c][i]; n for (int i = 1; i <= n; i++) printf( %d , vv[i]); n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int gridSize = 1000; n long long getPairs(int n) { n long long result = 0; n for (int i = 1; i < n; i++) result += n - i; n return result; n } n int main() { n std::cout.sync_with_stdio(false); n int n, i, x, y, j; n cin >> n; n bool a[gridSize + 1][gridSize + 1]; n for (i = 1; i <= gridSize; i++) n for (j = 1; j <= gridSize; j++) a[i][j] = false; n for (i = 0; i < n; i++) { n cin >> x >> y; n a[x][y] = true; n } n long long result = 0, attacking = 0; n pair startPoint(1, 1); n for (i = 1; i <= gridSize; i++) { n attacking = 0; n startPoint = make_pair(1, i); n do { n if (a[startPoint.first][startPoint.second]) attacking++; n startPoint.second++; n startPoint.first++; n } while (startPoint.second <= gridSize && startPoint.first <= gridSize); n if (attacking > 1) result += getPairs(attacking); n } n for (i = 2; i <= gridSize; i++) { n attacking = 0; n startPoint = make_pair(i, 1); n do { n if (a[startPoint.first][startPoint.second]) attacking++; n startPoint.second++; n startPoint.first++; n } while (startPoint.second <= gridSize && startPoint.first <= gridSize); n if (attacking > 1) result += getPairs(attacking); n } n for (i = gridSize; i >= 1; i--) { n attacking = 0; n startPoint = make_pair(1, i); n do { n if (a[startPoint.first][startPoint.second]) attacking++; n startPoint.second--; n startPoint.first++; n } while (startPoint.second >= 1 && startPoint.first <= gridSize); n if (attacking > 1) result += getPairs(attacking); n } n for (i = 2; i <= gridSize; i++) { n attacking = 0; n startPoint = make_pair(i, gridSize); n do { n if (a[startPoint.first][startPoint.second]) attacking++; n startPoint.second--; n startPoint.first++; n } while (startPoint.second >= 1 && startPoint.first <= gridSize); n if (attacking > 1) result += getPairs(attacking); n } n cout << result; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector vt; n for (int i = 0; i < n; i++) { n int v; n cin >> v; n vt.push_back(v); n } n sort(vt.begin(), vt.end()); n int ans = 0; n int prev = vt[0]; n for (int i = 1; i < n; i++) { n int cur = vt[i]; n int diff = cur - prev; n if (diff > 1) { n ans += (diff - 1); n } n prev = cur; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n static int n; n static int a[300010], b[300010]; n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d%d , &a[i], &b[i]); n int cnt[2] = {}; n for (int i = 1; i <= n; i++) { n if (a[i] < b[i]) n cnt[0]++; n else n cnt[1]++; n } n if (cnt[0] > cnt[1]) { n vector > vec; n for (int i = 1; i <= n; i++) { n if (a[i] < b[i]) vec.push_back(pair(-a[i], i)); n } n sort(vec.begin(), vec.end()); n printf( %d n , cnt[0]); n for (int i = 0; i < vec.size(); i++) { n printf( %d%c , vec[i].second, (i + 1 == vec.size()) ? n : ); n } n } else { n vector > vec; n for (int i = 1; i <= n; i++) { n if (a[i] > b[i]) vec.push_back(pair(b[i], i)); n } n sort(vec.begin(), vec.end()); n printf( %d n , cnt[1]); n for (int i = 0; i < vec.size(); i++) { n printf( %d%c , vec[i].second, (i + 1 == vec.size()) ? n : ); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n char s[10000]; n int num[100]; n int main() { n int T, t, i, j, k, n, m = 0, len; n scanf( %s , &s); n len = strlen(s); n for (i = 0; i < len; i++) { n k = s[i] - a + 1; n num[k]++; n } n for (i = 1; i <= 26; i++) n if (num[i] % 2 == 1) m++; n if (m == 0 || m == 1) n printf( First n ); n else if (m % 2 == 0) n printf( Second n ); n else n printf( First n ); n } n "} +{"func_code_string": "#include n const double EPS = 1e-7, pi = 3.141592653589793; n struct unit { n double x, y; n unit(double _x = 0, double _y = 0) : x(_x), y(_y) {} n double cross(const unit &A) const { return x * A.y - y * A.x; } n inline double len() const { return sqrt(x * x + y * y); } n double operator*(const unit &A) const { return x * A.x + y * A.y; } n unit operator*(const double &A) const { return unit(x * A, y * A); } n unit operator-(const unit &A) const { return unit(x - A.x, y - A.y); } n unit operator+(const unit &A) const { return unit(x + A.x, y + A.y); } n unit operator/(const double &A) const { return unit(x / A, y / A); } n inline void out() { printf( %.6lf %.6lf n , x, y); } n }; n void rotate(unit &A, double the) { n double x = A.x * cos(the) - A.y * sin(the), n y = A.x * sin(the) + A.y * cos(the); n A = unit(x, y); n } n double r, R, v; n unit now; n void tangentpoint(unit p, unit &A, unit &B) { n double d = p.len(); n p = p / d; n double cost = r / d, sint = sqrt(d * d - r * r) / d; n unit ver = unit(-p.y, p.x); n A = (p * r * cost) + (ver * r * sint); n B = (p * r * cost) - (ver * r * sint); n } n inline double min(double a, double b) { return a < b ? a : b; } n double arclength(unit A, unit B) { n return r * acos((A * B) / A.len() / B.len()); n } n double calcdis(unit &now, unit tar) { n unit u = unit() - now, v = tar - now; n unit t1, t2, a, b; n tangentpoint(now, t1, t2); n tangentpoint(tar, a, b); n if (v.len() < (t1 - now).len() + sqrt(R * R - r * r)) { n return v.len(); n } n double ans = (t1 - now).len() + (b - tar).len() + n min(min(arclength(t2, a), arclength(t2, b)), n min(arclength(t1, a), arclength(t1, b))); n return ans; n } n double bs(double l, double u, double st, double w) { n double low = l, up = u; n for (int i = 0; i < 100; i++) { n double mid = (low + up) / 2; n double d = calcdis(now, unit(R * cos(mid), R * sin(mid))); n if (st + (mid - l) / w > d / v) n up = mid; n else n low = mid; n } n return low; n } n int main() { n unit tar; n double vp; n while (~scanf( %lf%lf%lf , &tar.x, &tar.y, &vp)) { n scanf( %lf%lf%lf%lf , &now.x, &now.y, &v, &r); n double theta = acos(now * (unit(-1, 0)) / now.len()); n if (now.y < 0) theta *= -1; n rotate(now, theta); n rotate(tar, theta); n R = tar.len(); n double w = vp / R, T = 2.0 * pi / w; n double anst = 1e8; n if (tar.y < -EPS) { n double theta = acos(tar * unit(1, 0) / tar.len()); n double st = theta / w, et = st + T / 2.0; n double d1 = calcdis(now, unit(R, 0)), d2 = calcdis(now, unit(-R, 0)); n int k = ceil((d2 / v - et) / (T)); n if (et >= d2 / v) k = 0; n if (st + k * T < d1 / v + EPS) { n double tmp = bs(0, pi, st + k * T, +w); n anst = min(anst, st + k * T + tmp / w); n } n st = et; n et = st + T / 2.0; n k = ceil((d1 / v - et) / (T)); n if (et >= d1 / v) k = 0; n if (st + k * T < d2 / v + EPS) { n double tmp = bs(pi, 2 * pi, st + k * T, w); n anst = min(anst, st + k * T + (tmp - pi) / w); n } n if (calcdis(now, unit(R, 0)) / v < theta / w + EPS) { n double tmp = bs(-theta, 0, 0, w); n anst = min(anst, (tmp + theta) / w); n } n } else { n double theta = acos(tar * unit(-1, 0) / tar.len()); n double st = theta / w, et = st + T / 2.0; n double d1 = calcdis(now, unit(R, 0)), d2 = calcdis(now, unit(-R, 0)); n int k = ceil((d1 / v - et) / (T)); n if (et >= d1 / v) k = 0; n if (st + k * T < d2 / v + EPS) { n double tmp = bs(pi, 2 * pi, st + k * T, w); n anst = min(anst, st + k * T + (tmp - pi) / w); n } n st = et; n et = st + T / 2.0; n k = ceil((d2 / v - et) / (T)); n if (et >= d2 / v) k = 0; n if (st + k * T < d1 / v + EPS) { n double tmp = bs(0, pi, st + k * T, w); n anst = min(anst, st + k * T + tmp / w); n } n if (calcdis(now, unit(-R, 0)) / v < theta / w + EPS) { n double tmp = bs(pi - theta, pi, 0, w); n anst = min(anst, (tmp - pi + theta) / w); n } n } n printf( %.10lf n , anst); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, a, b; n int main() { n cin >> n >> a >> b; n n -= a; n b++; n cout << (n > b ? b : n); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool ask(long long l, long long r) { n cout << l << << r << n ; n cout.flush(); n string res; n cin >> res; n return res == Yes ; n } n int main() { n srand(time(NULL)); n ios_base::sync_with_stdio(false); n long long n, k; n cin >> n >> k; n long long l = 1, r = n; n while (true) { n if (r - l > 60ll) { n long long mid = l + r >> 1; n if (ask(l, mid)) { n l = max(1ll, l - k); n r = min(mid + k, n); n } else { n l = max(mid + 1 - k, 1ll); n r = min(r + k, n); n } n } else { n long long mid = rand() % (r - l + 1) + l; n if (ask(mid, mid)) return 0; n l = max(l - k, 1ll); n r = min(r + k, n); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = INT_MAX; n const long long LINF = LLONG_MAX; n const unsigned long long ULINF = ULLONG_MAX; n const double EPS = 0.000001; n char v[150][150], v_new[150][150]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int w, h; n cin >> w >> h; n for (int i = 0; i < h; i++) n for (int j = 0; j < w; j++) cin >> v[i][j]; n for (int i = 0; i < h; i++) n for (int j = 0; j < w; j++) v_new[j][i] = v[i][j]; n for (int i = 0; i < w; i++) { n for (int j = 0; j < h; j++) { n cout << v_new[i][j]; n cout << v_new[i][j]; n } n cout << n ; n for (int j = 0; j < h; j++) { n cout << v_new[i][j]; n cout << v_new[i][j]; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct { n int begin, end; n } P1[60], P2[60]; n int main() { n int num1, num2, first, last; n scanf( %d %d %d %d , &num1, &num2, &first, &last); n int ans = 0; n for (int i = 1; i <= num1; i++) scanf( %d %d , &P1[i].begin, &P1[i].end); n for (int i = 1; i <= num2; i++) scanf( %d %d , &P2[i].begin, &P2[i].end); n for (int i = first; i <= last; i++) { n for (int j1 = 1; j1 <= num1; j1++) { n bool flag = 1; n for (int j2 = 1; j2 <= num2; j2++) { n if ((P2[j2].begin + i >= P1[j1].begin && n P2[j2].begin + i <= P1[j1].end) || n (P2[j2].end + i >= P1[j1].begin && P2[j2].end + i <= P1[j1].end) || n (P2[j2].begin + i <= P1[j1].begin && n P2[j2].end + i >= P1[j1].end)) { n ans++; n flag = 0; n break; n } n } n if (!flag) break; n } n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void dbs(string str, T t) { n cerr << str << : << t << n ; n } n template n void dbs(string str, T t, S... s) { n long long idx = str.find( , ); n cerr << str.substr(0, idx) << : << t << , ; n dbs(str.substr(idx + 1), s...); n } n template n void prc(T a, T b) { n cerr << [ ; n for (T i = a; i != b; ++i) { n if (i != a) cerr << , ; n cerr << *i; n } n cerr << ] n ; n } n template n void prall(T a) { n prc(a.begin(), a.end()); n } n const int inf = 1000 * 1000 * 1000 + 9; n const long long infl = 1ll * inf * inf; n const int mod = 1000 * 1000 * 1000 + 7; n void solve() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n int o = 0, e = 0; n for (int i = 0; i < n; i++) { n int p; n cin >> p; n if (p & 1) n o++; n else n e++; n } n long long ans = 0; n int m; n cin >> m; n for (int i = 0; i < m; i++) { n int p; n cin >> p; n if (p & 1) { n ans += o; n } else n ans += e; n } n cout << ans << n ; n } n } n int main() { n ios_base::sync_with_stdio(NULL); n cin.tie(NULL); n cout << fixed << setprecision(13); n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n int const N = 2 * 1e5 + 5; n int ans = 0; n int i, j, n, m, k, z, y, x, t, mi, ma; n long long a[N]; n long long dp[N][2], d[N][2]; n char st[N]; n long long poisk(int x, int t) { n if (dp[x][t] != 0) return dp[x][t]; n long long y = x; n d[x][t]++; n if (d[x][t] > 1) { n d[x][t] = -1; n return d[x][t]; n } n if (t == 0) n y += a[x]; n else n y -= a[x]; n if (y < 1 || y > n) { n dp[x][t] = a[x]; n return dp[x][t]; n } n long long z = poisk(y, 1 - t); n if (z > 0) n dp[x][t] = a[x] + z; n else n dp[x][t] = -1; n return dp[x][t]; n } n int main() { n scanf( %d , &n); n for (i = 2; i <= n; i++) scanf( %I64d , &a[i]); n for (i = 1; i < n; i++) { n a[1] = i; n d[1][0] = 0; n long long k = poisk(1 + i, 1); n if (k > 0) k += i; n printf( %I64d n , k); n } n } n "} +{"func_code_string": "#include n struct M { n int p, b; n }; n struct F { n const int p, i; n int r, c; n F(int p, int t, int i) : p(p), i(i), r(p + t), c(0) {} n int t() { return r - p; } n }; n void solve(std::vector &fs, std::vector &ms) { n std::multimap ms_landed; n std::map fs_active; n { n std::vector fs_sort; n fs_sort.reserve(fs.size()); n for (int i = 0; i < fs.size(); i++) fs_sort.push_back(&fs[i]); n std::sort(fs_sort.begin(), fs_sort.end(), n [](const F *lhs, const F *rhs) { return lhs->p < rhs->p; }); n fs_active.insert({fs_sort[0]->p, fs_sort[0]}); n int curr = fs_sort[0]->r; n for (int i = 1; i < fs_sort.size(); i++) { n F &f = *fs_sort[i]; n if (f.r > curr) { n int l = std::max(curr + 1, f.p); n curr = f.r; n fs_active.insert({l, &f}); n } n } n } n auto update = [&](F &f, std::map::iterator &f_succ, const int &b) { n f.c++; n f.r += b; n while (f_succ != fs_active.end()) { n int l_succ = f_succ->first; n int r_succ = f_succ->second->r; n if (f.r < r_succ) { n if (f.r >= l_succ) { n fs_active.erase(f_succ); n f_succ = fs_active.insert({f.r + 1, f_succ->second}).first; n } n break; n } n f_succ = fs_active.erase(f_succ); n } n }; n for (const M &m : ms) { n auto f_it = --fs_active.upper_bound(m.p); n const int l = f_it->first; n F &f = *f_it->second; n if (l <= m.p && m.p <= f.r) { n update(f, ++f_it, m.b); n auto m_it = ms_landed.lower_bound(l); n while (m_it != ms_landed.end()) { n M m{m_it->first, m_it->second}; n if (l <= m.p && m.p <= f.r) { n update(f, f_it, m.b); n m_it = ms_landed.erase(m_it); n } else { n break; n } n } n } else { n ms_landed.insert({m.p, m.b}); n } n } n for (F &f : fs) { n printf( %d %d n , f.c, f.t()); n } n } n int main() { n int n, m; n scanf( %d%d , &n, &m); n std::vector fs; n fs.reserve(n); n std::vector ms; n ms.reserve(m); n for (int i = 0; i < n; i++) { n int p, t; n scanf( %d%d , &p, &t); n fs.push_back({p, t, i}); n } n for (int i = 0; i < m; i++) { n int p, b; n scanf( %d%d , &p, &b); n ms.push_back({p, b}); n } n solve(fs, ms); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n pair orig[3]; n int a, b, x1, y1, t = 0; n for (int i = 0; i < 3; i++) { n cin >> orig[i].first >> orig[i].second; n } n cout << 3 << endl; n a = (orig[0].first + orig[1].first) / 2; n b = (orig[0].second + orig[1].second) / 2; n cout << (orig[0].first + orig[1].first - orig[2].first) << n << (orig[0].second + orig[1].second - orig[2].second) << endl; n a = (orig[1].first + orig[2].first); n b = (orig[1].second + orig[2].second); n cout << (a - orig[0].first) << << (b - orig[0].second) << endl; n a = (orig[0].first + orig[2].first); n b = (orig[0].second + orig[2].second); n cout << (a - orig[1].first) << << (b - orig[1].second) << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int m, n, L, cnt, sum[1000005]; n char s[1000005], x[1000005]; n struct Node { n Node *par, *go[26]; n int val, sum, flag, num; n void Clear(int _val) { n par = NULL; n for (int i = 0; i < 26; i++) go[i] = NULL; n sum = flag = 0; n val = _val; n } n } * root, *last, *a[1000005 * 2], *b[1000005 * 2]; n void Extend(int w) { n Node *p = last, *np = new Node; n a[++cnt] = np; n np->num = cnt; n np->Clear(p->val + 1); n for (; p && (!(p->go[w])); p = p->par) p->go[w] = np; n if (!p) n np->par = root; n else { n Node *q = p->go[w]; n if (q->val == p->val + 1) n np->par = q; n else { n Node *nq = new Node; n a[++cnt] = nq; n nq->num = cnt; n nq->Clear(p->val + 1); n for (int i = 0; i < 26; i++) nq->go[i] = q->go[i]; n nq->par = q->par; n q->par = np->par = nq; n for (; p && (p->go[w] == q); p = p->par) p->go[w] = nq; n } n } n last = np; n } n void BuildSAM() { n scanf( %s , &s); n m = strlen(s); n cnt = 0; n root = new Node; n root->Clear(0); n root->num = 0; n last = root; n for (int i = 0; i < m; i++) Extend(s[i] - a ); n } n void DP() { n for (Node *p = last; p; p = p->par) p->sum = 1; n for (int i = 0; i <= m; i++) sum[i] = 0; n for (int i = 1; i <= cnt; i++) sum[a[i]->val]++; n for (int i = 1; i <= m; i++) sum[i] += sum[i - 1]; n for (int i = 1; i <= cnt; i++) b[sum[a[i]->val]--] = a[i]; n for (int i = cnt; i >= 1; i--) { n Node *p = b[i]; n for (int j = 0; j < 26; j++) n if (p->go[j]) { n p->sum += p->go[j]->sum; n } n } n } n int main() { n BuildSAM(); n DP(); n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n scanf( %s , &x); n L = strlen(x); n Node *p = root; n int len = 0; n for (int j = 0; j < L; j++) { n int w = x[j] - a ; n while (p && (!p->go[w])) p = p->par; n if (!p) p = root; n len = min(len, p->val); n if (p->go[w]) { n p = p->go[w]; n len++; n } n } n int ans = 0; n for (int j = 0; j < L; j++) { n int w = x[j] - a ; n while (p && (!p->go[w])) p = p->par; n if (!p) { n p = root; n continue; n } n len = min(len + 1, p->val + 1); n p = p->go[w]; n while (p->par && (p->par->val >= L)) p = p->par; n if (p->flag == i) continue; n if (len >= L) { n ans += p->sum; n p->flag = i; n } n } n printf( %d n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void read(T &x) { n char c; n bool nega = 0; n while ((!isdigit(c = getchar())) && (c != - )) n ; n if (c == - ) { n nega = 1; n c = getchar(); n } n x = c - 48; n while (isdigit(c = getchar())) x = x * 10 + c - 48; n if (nega) x = -x; n } n template n inline void writep(T x) { n if (x > 9) writep(x / 10); n putchar(x % 10 + 48); n } n template n inline void write(T x) { n if (x < 0) { n putchar( - ); n x = -x; n } n writep(x); n } n template n inline void writeln(T x) { n write(x); n putchar( n ); n } n int n, m; n int f[5001][5001]; n char c[5001][5001]; n inline int sum(int x, int y, int u, int v) { n return f[u][v] - f[u][y - 1] - f[x - 1][v] + f[x - 1][y - 1]; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cin >> n >> m; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) { n cin >> c[i][j]; n c[i][j] -= 0 ; n } n for (int i = 1; i <= 5000; i++) n for (int j = 1; j <= 5000; j++) n f[i][j] = f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1] + c[i][j]; n int ans = m * n; n for (int k = 2500; k >= 2; k--) { n int i = 1; n int res = 0; n int sq = k * k; n int t = 0; n do { n int j = 1; n do { n t = sum(i, j, i + k - 1, j + k - 1); n res += min(t, sq - t); n j += k; n } while (j <= m); n i += k; n } while (i <= n); n ans = min(ans, res); n } n writeln(ans); n } n "} +{"func_code_string": "#include n using namespace std; n int pos = -1; n void Go(vector &t) { n if (t[++pos] == int ) { n cout << int ; n } else { n cout << pair< ; n Go(t); n cout << , ; n Go(t); n cout << > ; n } n } n int main() { n int n, i = 0; n bool check = true; n cin >> n; n string t, t1 = ; n int bal = 0; n int k = 0; n std::vector s; n char c; n std::getline(std::cin, t); n std::getline(std::cin, t); n for (int j = 0; j < t.length(); j++) { n if (t[j] != ) { n t1 += t[j]; n } else { n s.push_back(t1); n t1 = ; n } n } n s.push_back(t1); n k = s.size(); n { n for (int i = 0; i < k - 1; i++) { n if (s[i] == pair ) n bal++; n else { n bal--; n } n if (bal < 0) { n check = false; n } n } n if (s[k - 1] == pair ) n bal++; n else { n bal--; n } n if (bal != -1) { n check = false; n } n if (!check) { n cout << Error occurred ; n return 0; n } n } n Go(s); n } n "} +{"func_code_string": "#include n using namespace std; n void pr(char c, int t) { n while (t--) printf( %c , c); n } n int main() { n int n, i, co(0), s; n map c; n char ch; n scanf( %d , &n); n for (i = 0; i < n; ++i) { n scanf( %c , &ch); n ++c[ch]; n } n for (const auto &e : c) n if (e.second & 1) ++co; n if (co < 2) { n printf( 1 n ); n for (auto it = c.begin(); it != c.end(); ++it) n if (~it->second & 1) pr(it->first, it->second / 2); n for (auto it = c.begin(); it != c.end(); ++it) n if (it->second & 1) { n pr(it->first, it->second); n c.erase(it); n break; n } n for (auto it = c.rbegin(); it != c.rend(); ++it) n if (~it->second & 1) pr(it->first, it->second / 2); n printf( n ); n return 0; n } n for (s = co; n % s || !(n / s & 1); ++s) n ; n printf( %d n , s); n vector>> str; n vector tot; n for (auto &e : c) n if (e.second & 1) { n set> tmp; n tmp.insert({1, e.first}); n str.push_back(tmp); n tot.push_back(1); n --e.second; n } n for (auto &e : c) n while (co < s && e.second) { n set> tmp; n tmp.insert({1, e.first}); n str.push_back(tmp); n tot.push_back(1); n --e.second; n ++co; n } n map::iterator it(c.begin()); n for (i = 0; i < s; ++i) n while (tot[i] < n / s) { n while (!it->second) ++it; n int tmp(min(it->second, n / s - tot[i])); n str[i].insert({tmp, it->first}); n it->second -= tmp; n tot[i] += tmp; n } n for (i = 0; i < s; ++i) { n if (i) printf( ); n for (auto it = str[i].rbegin(); it != str[i].rend(); ++it) n pr(it->second, it->first / 2); n for (auto it = str[i].begin(); it != str[i].end(); ++it) n pr(it->second, (it->first + 1) / 2); n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long int; n using ull = unsigned long long int; n using dd = double; n using ldd = long double; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n ll n, r; n cin >> n >> r; n vector arr((ll(1)) << n); n ll sum = 0; n n = ((ll)1) << n; n for (int i = 0; i < n; ++i) { n cin >> arr[i]; n sum += arr[i]; n } n cout.precision(10); n cout << ((dd)sum) / (dd(n)) << n ; n for (int i = 0; i < r; ++i) { n ll a, b; n cin >> a >> b; n sum -= arr[a]; n sum += b; n arr[a] = b; n cout << ((dd)sum) / (dd(n)) << n ; n } n } n "} +{"func_code_string": "#include n const int intINF = 999999999; n const long long i64INF = 99999999999999999ll; n const double doubleINF = 9999999999.; n using namespace std; n int abs(int a) { n if (a < 0) a *= -1; n return a; n } n int max(int a, int b) { n if (a < b) a = b; n return a; n } n int main() { n int x1, y1, x2, y2, px, py; n scanf( %d%d%d%d%d%d , &px, &py, &x1, &y1, &x2, &y2); n int m; n int p1, p2; n p1 = abs(y1 - y2); n p2 = abs(x1 - x2); n if ((p1 >= 3 && p2 >= 4) || (p1 >= 4 && p2 >= 3) || p1 > 4 || p2 > 4) n printf( Second n ); n else n printf( First n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n n template n class Modular { n n private: n static constexpr int mod = _mod; n static_assert(_mod > 0, mod must be positive ); n n int value; n n public: n n Modular() : value(0) {} n template Modular(const U& _value) { n value = normalize(_value); n } n n template static int normalize(const U& _value) { n int v; n if (-mod <= _value && _value < mod) v = static_cast(_value); n else v = static_cast(_value % mod); n if (v < 0) v += mod; n return v; n } n template static U inverse(U a, U m) { n U u = 0, v = 1; n while (a != 0) { n U t = m / a; n m -= t * a; swap(a, m); n u -= t * v; swap(u, v); n } n assert(m == 1); n return u; n } n n const int& operator ()() const { return value; } n template explicit operator U() const { return static_cast(value); } n n template friend U& operator << (U& stream, const Modular& number) { n return stream << number(); n } n template friend U& operator >> (U& stream, Modular& number) { n long long x; n stream >> x; n number.value = normalize(x); n return stream; n } n n Modular& operator -= (const Modular& other) { if ((value -= other.value) < 0) value += mod; return *this; } n template Modular& operator -= (const U& other) { return *this -= Modular(other); } n Modular& operator += (const Modular& other) { return *this -= Modular(mod - other.value); } n template Modular& operator += (const U& other) { return *this += Modular(other); } n Modular& operator ++ () { return *this += 1; } n Modular& operator -- () { return *this -= 1; } n Modular operator ++ (int) { Modular result(*this); *this += 1; return result; } n Modular operator -- (int) { Modular result(*this); *this -= 1; return result; } n Modular operator - () const { return Modular(-value); } n n Modular& operator *= (const Modular& other) { n value = normalize(static_cast(value) * static_cast(other.value)); n return *this; n } n template Modular& operator *= (const U& other) { return *this *= Modular(other); } n Modular& operator /= (const Modular& other) { return *this *= Modular(inverse(other.value, mod)); } n template Modular& operator /= (const U& other) { return *this /= Modular(other); } n n friend bool operator == (const Modular& first, const Modular& second) { return first.value == second.value; } n template friend bool operator == (const Modular& first, const U& second) { return first == Modular(second); } n template friend bool operator == (const U& first, const Modular& second) { return Modular(first) == second; } n n friend bool operator != (const Modular& first, const Modular& second) { return !(first.value == second.value); } n template friend bool operator != (const Modular& first, const U& second) { return first != Modular(second); } n template friend bool operator != (const U& first, const Modular& second) { return Modular(first) != second; } n n friend Modular operator + (const Modular& first, const Modular& second) { return Modular(first) += second; } n template friend Modular operator + (const Modular& first, const U& second) { return Modular(first) += second; } n template friend Modular operator + (const U& first, const Modular& second) { return Modular(first) += second; } n n friend Modular operator - (const Modular& first, const Modular& second) { return Modular(first) -= second; } n template friend Modular operator - (const Modular& first, const U& second) { return Modular(first) -= second; } n template friend Modular operator - (const U& first, const Modular& second) { return Modular(first) -= second; } n n friend Modular operator * (const Modular& first, const Modular& second) { return Modular(first) *= second; } n template friend Modular operator * (const Modular& first, const U& second) { return Modular(first) *= second; } n template friend Modular operator * (const U& first, const Modular& second) { return Modular(first) *= second; } n n friend Modular operator / (const Modular& first, const Modular& second) { return Modular(first) /= second; } n template friend Modular operator / (const Modular& first, const U& second) { return Modular(first) /= second; } n template friend Modular operator / (const U& first, const Modular& second) { return Modular(first) /= second; } n n template friend Modular power(const Modular& base, const U& exponent) { n assert(exponent >= 0); n Modular x = base, res = 1; n U p = exponent; n while (p > 0) { n if(p & 1) res *= x; n x *= x; n p >>= 1; n } n return res; n } n }; n n using Mint = Modular; n // <, >, <=, >= comparisons not available n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int n; n cin >> n; n const int inf = 1e9 + 5; n vector> dis(n, vector(n, inf)); n for (int i = 0; i < n; i++) { n dis[i][i] = 0; n } n for (int i = 0; i < n - 1; i++) { n int u, v; n cin >> u >> v; n --u, --v; n dis[u][v] = dis[v][u] = 1; n } n for (int k = 0; k < n; k++) { n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]); n } n } n } n vector> dp(n + 1, vector(n + 1)); n for (int i = 1; i <= n; i++) { n dp[i][0] = 1; n for (int j = 1; j <= n; j++) { n dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) / 2; n } n } n Mint ans = 0; n for (int r = 0; r < n; r++) { n for (int i = 0; i < n; i++) { n for (int j = i + 1; j < n; j++) { n int x = dis[i][r], y = dis[r][j]; n int d = (x + y - dis[i][j]) / 2; n x -= d, y -= d; n ans += dp[x][y]; n } n } n } n ans /= n; n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1e9 + 7; n long long dp[100004][2]; n int n; n vector g[100004]; n int v[100004]; n void dfs(int x) { n dp[x][v[x]] = 1; n for (int i = 0; i < g[x].size(); i++) { n int y = g[x][i]; n dfs(y); n dp[x][1] = dp[x][1] * (dp[y][0] + dp[y][1]) % MOD; n dp[x][1] = (dp[x][1] + dp[y][1] * dp[x][0]) % MOD; n dp[x][0] = dp[x][0] * (dp[y][0] + dp[y][1]) % MOD; n } n } n int main() { n scanf( %d , &n); n for (int i = 1; i < n; i++) { n int x; n scanf( %d , &x); n g[x].push_back(i); n } n for (int i = 0; i < n; i++) scanf( %d , &v[i]); n dfs(0); n cout << dp[0][1]; n } n "} +{"func_code_string": "#include n using namespace std; n long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; } n long long lcm(long long a, long long b) { return a * b / GCD(a, b); } n int lb(int x) { return x & (-x); } n const long long N = 3e5 + 7; n const long long inf = 1e18 + 1; n const long long mod2 = 998244353; n const long long mod1 = 1e9 + 7; n const int P1 = 13331; n const int P2 = 131; n const double eps = 1e-6; n const double dbinf = 1e13 + 7; n const long long mod3 = 10000 + 7; n int n, m; n string s; n struct node { n int v, nxt; n }; n node e[N]; n int tot; n int head[N]; n int ing[N]; n int ans; n int dp[N][26]; n void add(int u, int v) { n e[++tot] = {v, head[u]}; n head[u] = tot; n } n void topsort(void) { n queue q; n for (int i = 1; i <= n; i++) { n if (ing[i] == 0) { n q.push(i); n dp[i][s[i] - a ] = 1; n } n } n int cnt = 0; n while (!q.empty()) { n int x = q.front(); n cnt++; n q.pop(); n for (int i = head[x]; i; i = e[i].nxt) { n int v = e[i].v; n if (--ing[v] == 0) q.push(v); n for (int j = 0; j <= 25; j++) { n dp[v][j] = max(dp[v][j], dp[x][j] + (s[v] - a == j)); n } n } n } n if (cnt != n) { n cout << -1 n ; n } else { n int maxn = 0; n for (int i = 1; i <= n; i++) { n for (int j = 0; j <= 25; j++) { n maxn = max(maxn, dp[i][j]); n } n } n cout << maxn << n ; n } n } n int main() { n memset(head, 0, sizeof head); n memset(ing, 0, sizeof ing); n cin >> n >> m; n cin >> s; n s = * + s; n tot = 0; n for (int i = 1, u = 1, v = 1; i <= m; i++) { n cin >> u >> v; n add(u, v); n ing[v]++; n } n topsort(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e18; n const long long N = 2e5 + 7; n const int mod = 1e9 + 7; n bool cmp(const pair& a, n const pair& b) { n return a.first < b.first; n } n long long median(long long a, long long b, long long c, long long d) { n vector v(4); n v[0] = a; n v[1] = b; n v[2] = c; n v[3] = d; n sort(v.begin(), v.end()); n return ((v[1] + v[2]) / 2); n } n void solve() { n long long n, m; n cin >> n >> m; n long long a[n][m]; n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < m; j++) { n cin >> a[i][j]; n } n } n long long ans = 0; n for (long long i = 0; i < n; i++) { n for (long long j = 0; j < m; j++) { n long long k = median(a[i][j], a[i][m - 1 - j], a[n - 1 - i][j], n a[n - 1 - i][m - 1 - j]); n ans += abs(k - a[i][j]); n } n } n cout << ans << n ; n return; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long t; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, p; n int dp[111][555555], cur[111], a[555555], ld[111], sum[555555], dpp[555555], n bit[1111], sz; n void update(int x, int p) { n while (x <= sz) { n bit[x] = max(bit[x], p); n x += x & (-x); n } n } n int query(int x) { n int res = 0; n while (x >= 1) { n res = max(res, bit[x]); n x -= x & (-x); n } n return res; n } n int main() { n scanf( %d%d%d , &n, &k, &p); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n a[i] %= p; n } n if (k * p >= n) { n for (int i = 0; i <= k; i++) { n for (int j = 0; j <= n; j++) dp[i][j] = 1e9; n } n dp[0][0] = 0; n for (int i = 1; i <= k; i++) { n for (int j = 0; j < p; j++) cur[j] = 1e9; n for (int j = 1; j <= n; j++) { n for (int h = 0; h < p; h++) ld[(h + a[j]) % p] = cur[h]; n for (int h = 0; h < p; h++) cur[h] = ld[h]; n cur[a[j]] = min(cur[a[j]], dp[i - 1][j - 1]); n for (int h = 0; h < p; h++) dp[i][j] = min(dp[i][j], cur[h] + h); n } n } n cout << dp[k][n] << endl; n } else { n for (int i = 1; i <= n; i++) sum[i] = (sum[i - 1] + a[i]) % p; n sz = 1; n while (sz < p) sz *= 2; n for (int i = 1; i <= n; i++) { n dpp[i] = query(sum[i] + 1) + 1; n update(sum[i] + 1, dpp[i]); n } n if (dpp[n] >= k) n cout << sum[n] << endl; n else n cout << sum[n] + p << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n unsigned long long int n, c = 0; n int x; n cin >> n; n unsigned long long int pos[11] = {}, neg[11] = {}, z = 0, i; n for (i = 0; i < n; i++) { n cin >> x; n if (x == 0) n z++; n else if (x < 0) n neg[(-1) * x]++; n else { n pos[x]++; n } n } n for (int i = 1; i < 11; i++) { n c = c + pos[i] * neg[i]; n } n if (z > 1) n z = (z * (z - 1)) / 2; n else { n z = 0; n } n cout << c + z; n } n "} +{"func_code_string": "#include n using namespace std; n class union_find { n public: n vector arr; n union_find(int n) { n arr.resize(n); n fill(arr.begin(), arr.end(), -1); n } n int find(int x) { return arr[x] < 0 ? x : arr[x] = find(arr[x]); } n void unite(int x, int y) { n x = find(x), y = find(y); n if (x == y) return; n if (arr[x] > arr[y]) swap(x, y); n arr[x] += arr[y]; n arr[y] = x; n } n bool connected(int x, int y) { return find(x) == find(y); } n int size(int x) { return -arr[find(x)]; } n }; n template n vector coordinate_compression(const T &a, int cur = 0) { n int n = a.size(); n T b = a; n sort(b.begin(), b.end()); n b.erase(unique(b.begin(), b.end()), b.end()); n vector res(n); n for (int i = 0; i < n; i++) n res[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin() + cur; n return res; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n cin >> n; n vector a(2 * n); n for (int i = 0; i < a.size(); i++) cin >> a[i]; n vector b = coordinate_compression(a); n union_find uf(2 * n); n vector mx0(2 * n), mx1(2 * n, -1); n for (int i = 0; i < 2 * n; i++) mx0[i] = i; n vector ju(2 * n); n for (int i = 0; i < n; i++) { n int u = b[2 * i], v = b[2 * i + 1]; n if (uf.connected(u, v)) { n if (ju[uf.find(u)]) { n cout << -1 << n ; n return 0; n } n ju[uf.find(u)] = true; n } else { n int ru = uf.find(u), rv = uf.find(v); n uf.unite(u, v); n mx1[uf.find(u)] = max(max(mx1[ru], mx1[rv]), min(mx0[ru], mx0[rv])); n mx0[uf.find(u)] = max(mx0[ru], mx0[rv]); n } n } n int res = 0; n for (int i = 0; i < 2 * n; i++) { n if (ju[uf.find(i)]) { n res = max(res, mx0[uf.find(i)]); n } else { n res = max(res, mx1[uf.find(i)]); n } n } n for (int i = 0; i < 2 * n; i++) { n if (res == b[i]) { n cout << a[i] << n ; n return 0; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n double x, y, ans; n int main() { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> x >> y; n ans = (ans * (i - 1) + y) / i; n } n ans += 5; n printf( %.3lf , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main(int argc, char const *argv[]) { n int n; n cin >> n; n char str[n + 2]; n cin >> str; n if (n == 1) { n cout << 0 << endl; n return 0; n } n int current = 0; n int previous = 0; n if (str[0] == U ) n current++; n else n current--; n int count = 0; n int sign = (current > 0 ? 1 : -1); n for (int i = 1; i < n; i++) { n previous = current; n if (str[i] == U ) n current++; n else n current--; n if (previous == 0 && sign != current) { n count++; n sign = current; n } n } n cout << count << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1000000000000000; n const int maxn = 1e5 + 100; n long long dp[maxn][2], c[maxn]; n string reverse(string s) { n string t = ; n for (int i = s.size() - 1; i >= 0; i--) t += s[i]; n return t; n } n int main() { n int n; n scanf( %d , &n); n for (int i = 0; i < n; i++) cin >> c[i]; n string last; n cin >> last; n dp[0][0] = 0; n dp[0][1] = c[0]; n for (int i = 1; i < n; i++) { n string now; n cin >> now; n dp[i][0] = dp[i][1] = INF; n if (last <= now) dp[i][0] = min(dp[i][0], dp[i - 1][0]); n if (reverse(last) <= now) dp[i][0] = min(dp[i][0], dp[i - 1][1]); n if (last <= reverse(now)) dp[i][1] = min(dp[i][1], dp[i - 1][0] + c[i]); n if (reverse(last) <= reverse(now)) n dp[i][1] = min(dp[i][1], dp[i - 1][1] + c[i]); n last = now; n } n long long ans = min(dp[n - 1][0], dp[n - 1][1]); n if (ans >= INF) n cout << -1 << endl; n else n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, q; n vector w[400001]; n int check[400001]; n int ans; n void input() { n scanf( %d %d %d , &n, &m, &q); n int x, y; n for (int i = (0); i < (q); i++) { n scanf( %d %d , &y, &x); n x--; n y--; n x += n; n w[x].push_back(y); n w[y].push_back(x); n } n n = n + m; n } n void dfs(int node) { n check[node] = 1; n for (int i = (0); i < (w[node].size()); i++) { n int next = w[node][i]; n if (check[next] == 0) { n dfs(next); n } n } n } n void process() { n for (int i = (0); i < (n); i++) { n if (check[i] == 0) { n dfs(i); n ans++; n } n } n } n void output() { printf( %d , ans - 1); } n int main() { n input(); n process(); n output(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int x, y, a, b, c, num = 0; n scanf( %d%d , &x, &y); n a = b = c = y; n while (a < x || b < x || c < x) { n if (a <= b && a <= c) n a = b + c - 1; n else if (b <= a && b <= c) n b = a + c - 1; n else n c = a + b - 1; n num++; n } n printf( %d , num); n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1e9 + 7; n long long f[107][10007], C[107][10007]; n long long ksm(long long a, long long b) { n long long res = 1; n for (; b; b >>= 1) { n if (b & 1) res = res * a % MOD; n a = a * a % MOD; n } n return res; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.precision(6); n cout << fixed; n long long n, m, K; n cin >> n >> m >> K; n for (int i = 0; i <= n; i++) { n C[i][0] = 1; n for (int j = 1; j <= i; j++) { n C[i][j] = C[i - 1][j - 1] + C[i - 1][j]; n C[i][j] %= MOD; n } n } n f[0][0] = 1; n for (int i = 1; i <= n; i++) { n for (int j = 0; j <= min(n, K); j++) { n long long res = ksm(C[n][j], (m - i) / n + 1); n for (int k = 0; k <= K - j; k++) { n f[i][j + k] += f[i - 1][k] * res; n f[i][j + k] %= MOD; n } n } n } n cout << f[n][K] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string str; n set vis; n int main() { n int n; n scanf( %d , &n); n vis.clear(); n for (int i = 0; i < n; ++i) { n cin >> str; n if (vis.find(str) != vis.end()) n cout << YES << endl; n else n cout << NO << endl; n vis.insert(str); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n; n cin >> n; n string s[n]; n unordered_map mp; n int count = 0; n for (int i = 0; i < n; i++) { n cin >> s[i]; n mp[s[i]] += 1; n } n for (int i = 0; i < n; i++) { n if (mp[s[i]] > 1) { n count += 1; n mp[s[i]] -= 1; n for (int j = 0; j < 10; j++) { n string s1 = s[i]; n s1[3] = 0 + j; n if (mp[s1] == 0) { n mp[s1] += 1; n s[i] = s1; n break; n } n } n } n } n cout << count << endl; n for (int i = 0; i < n; i++) { n cout << s[i] << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n template n void prn(T first) { n cout << first << n ; n } n template n void prn(T first, Args... args) { n cout << first << ; n prn(args...); n } n vector adj[200004]; n vector parent(200004, 0), dist(200004, 0); n void dfs(long long u, long long p = 0, long long d = 0) { n parent[u] = p; n dist[u] = d; n for (long long v : adj[u]) { n if (v == p) continue; n dfs(v, u, dist[u] + 1); n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n ; n long long i, j, t, n, u, v; n cin >> n; n for (i = 0; i < n - 1; i++) { n cin >> u >> v; n adj[u].push_back(v); n adj[v].push_back(u); n } n dfs(1); n set > st; n for (i = 1; i < n + 1; i++) { n if (dist[i] > 2) { n st.insert({-dist[i], i}); n } n } n long long res = 0; n while (!st.empty()) { n u = st.begin()->second; n u = parent[u]; n res++; n auto it = st.find({-dist[u], u}); n if (it != st.end()) { n st.erase(it); n } n for (long long child : adj[u]) { n it = st.find({-dist[child], child}); n if (it != st.end()) { n st.erase(it); n } n } n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int t, i, j, n, a[100000], x, y, index, num, l, r, count, count1, n temp; n vector vect; n cin >> n >> t; n for (i = 0; i < n; i++) { n cin >> a[i]; n } n while (t > 0) { n count = 0; n count1 = 0; n cin >> x >> y >> index; n index = index - 1; n x = x - 1; n y = y - 1; n if (x <= index && index <= y) { n for (i = index - 1; i >= x; i--) { n if (a[index] < a[i]) { n count++; n } n } n for (i = index + 1; i <= y; i++) { n if (a[index] > a[i]) { n count1++; n } n } n if (count == count1) { n temp = 1; n } else { n temp = 0; n } n } else { n temp = 1; n } n if (temp == 1) { n cout << Yes << endl; n } else { n cout << No << endl; n } n t--; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int max_n = 300000; n int a[max_n], b[max_n], p[max_n]; n int main() { n int n; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n a[i]--; n } n for (int i = 0; i < n; i++) { n int t; n scanf( %d , &t); n t--; n b[t] = i; n } n int res = n; n for (int i = 0; i < n; i++, res--) { n p[i] = b[a[i]]; n if (i && p[i - 1] > p[i]) { n break; n } n } n printf( %d n , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string rs(string s) { n for (int i = 0; i < s.size(); i++) { n if (s[i] == ) s.erase(i, 1); n } n return s; n } n int main() { n char s[1100000]; n vector v; n while (gets(s)) { n v.push_back(s); n } n vector mag(v.size(), false); n for (int i = 0; i < v.size(); i++) { n for (int j = 0;; j++) { n if (v[i][j] != # && v[i][j] != ) n break; n else if (v[i][j] == # ) { n mag[i] = true; n break; n } n } n } n int i = 0; n string con; n while (i < mag.size()) { n if (mag[i]) { n cout << v[i]; n cout << endl; n } else { n con = ; n while (!mag[i] && i < mag.size()) { n con += v[i]; n i++; n } n for (int j = 0; j < con.size(); j++) n if (con[j] != ) cout << con[j]; n cout << endl; n i--; n } n i++; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n const long long N = 50; n const long long INF = 1e10; n vector mat(N); n int n, r1, c1, r2, c2; n vector> visited(N, vector(N)); n void dfs(int i, int j, vector> &s) { n visited[i][j] = true; n s.push_back({i, j}); n if (i + 1 < n and !visited[i + 1][j] and mat[i + 1][j] == 0 ) n dfs(i + 1, j, s); n if (i - 1 >= 0 and !visited[i - 1][j] and mat[i - 1][j] == 0 ) n dfs(i - 1, j, s); n if (j + 1 < n and !visited[i][j + 1] and mat[i][j + 1] == 0 ) n dfs(i, j + 1, s); n if (j - 1 >= 0 and !visited[i][j - 1] and mat[i][j - 1] == 0 ) n dfs(i, j - 1, s); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(NULL); n vector> s, f; n cin >> n >> r1 >> c1 >> r2 >> c2; n for (int i = 0; i < n; i++) cin >> mat[i]; n dfs(r1 - 1, c1 - 1, s); n if (!visited[r2 - 1][c2 - 1]) dfs(r2 - 1, c2 - 1, f); n if (f.size() == 0) { n cout << 0; n return 0; n } n int ans = INT_MAX; n for (auto i : s) { n for (auto j : f) n ans = min(ans, (i.first - j.first) * (i.first - j.first) + n (i.second - j.second) * (i.second - j.second)); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1000000000; n int main() { n int hy, ay, dy; n int hm, am, dm; n int ph, pa, pd; n scanf( %d%d%d%d%d%d%d%d%d , &hy, &ay, &dy, &hm, &am, &dm, &ph, &pa, &pd); n int ans = INF, least = 0; n int cur_ay = ay; n if (cur_ay < dm + 1) { n least = pa * (dm + 1 - cur_ay); n cur_ay = dm + 1; n } n int tar_ay, tar_dy; n int c1, c2; n for (int k = 1; k <= 100; k++) { n c1 = least; n tar_ay = dm + hm / k + (hm % k ? 1 : 0); n if (tar_ay > cur_ay) c1 += (tar_ay - cur_ay) * pa; n tar_dy = am - hy / k + (hy % k ? 0 : 1); n if (tar_dy <= dy) n ans = min(ans, c1); n else { n for (int j = 0; dy + j < tar_dy; j++) { n c2 = c1 + j * pd + (k * (am - dy - j) - hy + 1) * ph; n if (c2 < ans) ans = c2; n } n ans = min(c1 + (tar_dy - dy) * pd, ans); n } n } n if (ans == INF) ans = 0; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dx[] = {0, 0, 1, -1}; n int dy[] = {1, -1, 0, 0}; n bool valid(int x, int y) { n return x >= 0 && y >= 0 && x < 3 && y < 3 ? 1 : 0; n } n n int main() n { n ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); n int t; n cin >> t; n while (t--) { n int n, k; n cin >> n >> k; n int arr[n]; n for (int i = 0; i < n; ++i) { n cin >> arr[i]; n } n sort(arr, arr + n); n int mx = arr[n - 1], mex = 0; n for (int i = 0; i < n; ++i) { n if (mex == arr[i]) { n ++mex; n } else { n break; n } n } n if (k) { n if (mex > mx) { n n += k; n } else { n int x = mex + mx; n int y = x / 2; n y += (x % 2); n if (!binary_search(arr, arr + n, y)) { n ++n; n } n } n } n cout << n << n ; n } n n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long t; n cin >> t; n long long ans = t * (t + 1) / 2; n if (ans % 2) n cout << 1; n else n cout << 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n int ans = 0; n int n = s.size(); n for (int i = 0; i < n; i++) ans += (1 << i); n for (int i = 0; i < n; i++) { n if (s[i] == 7 ) ans += (1 << (n - i - 1)); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n long long int max(long long int a, long long int b) { n if (a > b) n return a; n else n return b; n } n long long int min(long long int a, long long int b) { n if (a < b) n return a; n else n return b; n } n const int dx[4] = {-1, 1, 0, 0}; n const int dy[4] = {0, 0, -1, 1}; n int XX[] = {-1, -1, -1, 0, 0, 1, 1, 1}; n int YY[] = {-1, 0, 1, -1, 1, -1, 0, 1}; n vector > > vec; n int main() { n ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); n long long int t, n, i, j, k, l, r, m, q, g, b, u, v, x, y, z, num; n cin >> t; n while (t--) { n vec.clear(); n cin >> n; n long long int arr[n + 1]; n long long int sum = 0; n for (i = 1; i <= n; i++) { n cin >> arr[i]; n sum += arr[i]; n } n if (sum % n != 0) { n cout << -1 n << n ; n continue; n } n for (i = 2; i < n; i++) { n long long int need = i - arr[i]; n if (arr[i] <= i && need <= arr[1]) { n arr[1] -= need; n vec.push_back(make_pair(1, make_pair(i, need))); n vec.push_back(make_pair(i, make_pair(1, 1))); n arr[1] += i; n arr[i] = 0; n } n } n for (i = 2; i < n; i++) { n long long int need = i - arr[i]; n if (arr[i] != 0 && arr[i] <= i && need <= arr[1]) { n arr[1] -= need; n vec.push_back(make_pair(1, make_pair(i, need))); n vec.push_back(make_pair(i, make_pair(1, 1))); n arr[1] += i; n arr[i] = 0; n } n } n long long int val = sum / n; n for (i = 2; i <= n; i++) { n if (arr[i] > i) { n x = arr[i] / i; n vec.push_back(make_pair(i, make_pair(1, x))); n arr[i] -= x * i; n arr[1] += x * i; n } n } n for (i = 2; i <= n; i++) { n if (arr[i] > val) { n long long int need = i + val - arr[i]; n long long int profit = i; n if (need <= arr[1] && profit >= need) { n vec.push_back(make_pair(1, make_pair(i, need))); n arr[1] -= need; n arr[i] += need; n arr[i] -= i; n arr[1] += i; n vec.push_back(make_pair(i, make_pair(1, 1))); n } n } n } n long long int flag = 0; n for (i = 2; i <= n; i++) { n if (arr[i] > val) { n long long int need = i + val - arr[i]; n long long int profit = i; n if (need <= arr[1]) { n vec.push_back(make_pair(1, make_pair(i, need))); n arr[1] -= need; n arr[i] += need; n arr[i] -= i; n arr[1] += i; n vec.push_back(make_pair(i, make_pair(1, 1))); n } else { n cout << -1 n << n ; n flag = 1; n break; n } n } n } n if (flag == 1) continue; n for (i = 2; i <= n; i++) { n if (arr[i] < val) { n long long int need = val - arr[i]; n if (need > arr[1]) { n flag = 1; n cout << -1 n << n ; n break; n } n vec.push_back(make_pair(1, make_pair(i, need))); n arr[1] -= need; n arr[i] += need; n } n } n if (flag == 0) { n cout << vec.size() << n ; n for (i = 0; i < vec.size(); i++) { n cout << vec[i].first << << vec[i].second.first << n << vec[i].second.second << n ; n } n } n } n } n "} +{"func_code_string": "/*There is no salvation without suffering*/ n #pragma GCC optimize( Ofast ) n #pragma GCC target( avx,avx2,fma ) n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n using namespace std; n #define ll long long n #define pb push_back n #define pf push_front n #define mp make_pair n #define tt ll t;cin>>t;while(t--) n #define nn cout<=a;i--) n #define fr(x, a) for(auto &x:a) n #define F(a) for(auto &x:a) cin>>x n #define cY cout<< YES n n #define cN cout<< NO n n #define cy cout<< Yes n n #define cn cout<< No n n #define sc second n #define fs first n #define c(a) cout<>n; n string a,b; cin>>a>>b; n ll o=count(all(a), 1 ),z=n-o; n ll x=0; n bool ans=true; n // c(o<< <=0;i--) n { n if(x==0) n { n if(a[i]!=b[i]) n { n if(o==z) n { n x=1-x; n if(a[i]== 1 ) n { n a[i]= 0 ; z--; n } n else n { n a[i]= 1 ; o--; n } n } n else n { n ans=false; break; n } n } n else n { n if(a[i]== 0 ) n z--; n else o--; n } n } n else n { n if(a[i]== 1 ) n a[i]= 0 ; n else a[i]= 1 ; n if(a[i]!=b[i]) n { n if(o==z) n { n x=1-x; n if(a[i]== 1 ) n { n a[i]= 0 ; z--; n } n else n { n a[i]= 1 ; o--; n } n } n else n { n ans=false; break; n } n } n else n { n if(a[i]== 0 ) n z--; n else o--; n } n } n } n // c(a); n if(ans) n cY; n else cN; n n } n n int main() n { n ios::sync_with_stdio(false); n cin.tie(0); cout.tie(0); n tt n solve(); n } n /* n n n n n */ n ll nCr(ll n,ll r) n { n r=(n-r<=r) ? n-r : r; n ll ans=1; n for(ll i=0;i1){ n if(power%2){ n power--; n res*=base; n } n else{ n base*=base; n power/=2; n } n } n return base*res; n } n ll ModInverse(ll base){ n ll power=M-2; n if(!power) n return 1; n ll res=1; n while(power>1){ n if(power%2){ n power--; n res=mod(res*base); n } n else{ n base=mod(base*base); n power/=2; n } n } n return mod(base*res); n }"} +{"func_code_string": "#include n using namespace std; n int Mod; n const int Nmax = 1005, Kmax = 105; n int Dp[Nmax][Kmax]; n int main() { n ios::sync_with_stdio(false); n int N, K; n cin >> N >> K >> Mod; n for (int i = 1; i < 10; ++i) Dp[1][i % K]++; n if (N > 1) Dp[1][K] = 1; n for (int i = 2, pw = 10 % K; i <= N; ++i) { n for (int j = 1; j <= K; ++j) { n for (int k = i == N ? 1 : 0; k < 10; ++k) { n int nj = (1LL * pw * k + j) % K; n Dp[i][nj] = (Dp[i][nj] + Dp[i - 1][j]) % Mod; n } n } n Dp[i][K] = 1; n pw = 10LL * pw % K; n } n int ans = 0, pw = 1; n for (int i = 1; i < N; ++i) { n pw = 10LL * pw % Mod; n } n pw = 9LL * pw % Mod; n for (int i = 1; i < K; ++i) ans = (ans + Dp[N][i]) % Mod; n ans = (pw - ans + Mod) % Mod; n cout << ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n #pragma GCC target ( avx2 ) n #pragma GCC optimize ( Ofast ) n #pragma GCC optimize ( unroll-loops ) n #pragma GCC target( avx,avx2,fma ) n #pragma GCC optimize( O3 ) n #define F first n #define S second n #define sz size() n #define pb push_back n #define int long long n #define all(x) (x).begin(),(x).end() n #define NFS ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ; n #define file(s) if (fopen(s .in , r )) freopen(s .in , r , stdin), freopen(s .out , w , stdout); n template inline T pw(T a, int n, T res = 1){while (n) {if (n & 1) res *= a;a *= a;n >>= 1;}return res;} n template istream &operator>>(istream &is, vector &vec) { for (auto &v : vec) is >> v; return is; } n template ostream &operator<<(ostream &os, const vector &vec) { os << { ; for (auto v : vec) os << v << , ; os << } ; return os; } n const int E = 1e6+777; n const int inf = 1e18+777; n const int N = 1e5+777; n const bool O = 0; n const bool I = 1; n signed main(){auto solve=[&](){ n int n; n cin >> n; n mapmp; n for(int i = 1, x; i <= n; i++){ n cin >> x; n mp[x]++; n } n int ans = n & 1; n for(auto i : mp){ n if(i.S > n / 2){ n ans = i.S - (n - i.S); n } n } n cout << ans << n ; n };if(O)NFS;if(I){int T;cin>>T;while(T--)solve();exit(0);}solve();} n n n n n "} +{"func_code_string": "#include n #pragma GCC optimize( O3 ) n #pragma GCC optimize( Ofast ) n using namespace std; n vector > vec; n set > myset, vis; n map, int> p; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, m, t, a, b; n cin >> n >> m >> t; n vec.resize(n); n while (m--) { n cin >> a >> b; n a--, b--; n vec[a].push_back(b); n vec[b].push_back(a); n } n while (t--) { n cin >> m >> a >> b; n m--, a--, b--; n myset.insert({m, a, b}); n } n vector state, ans; n queue > q; n bool ok = 0; n for (auto it : vec[0]) { n if (it == (n - 1)) { n cout << 1 << n << 1 << << n << n ; n return 0; n } n q.push({0, it}), vis.insert({0, it}); n } n while (!q.empty()) { n vector f = q.front(); n q.pop(); n for (auto it : vec[f[1]]) { n if (myset.find({f[0], f[1], it}) != myset.end()) continue; n if (vis.find({f[1], it}) != vis.end()) continue; n if (it == (n - 1)) { n ok = 1, state = f; n break; n } n q.push({f[1], it}); n p[{f[1], it}] = f[0]; n vis.insert({f[1], it}); n } n if (ok) break; n } n if (!ok) { n cout << -1; n return 0; n } n ans.push_back(state[1]); n int c = 100005; n while ((state[0] != 0)) { n ans.push_back(state[0]); n t = p[state]; n state[1] = state[0], state[0] = t; n } n reverse(ans.begin(), ans.end()); n cout << ans.size() + 1 << n1 ; n for (auto it : ans) cout << it + 1 << ; n cout << n << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long n, c; n cin >> n >> c; n vector a(n); n multiset p; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n } n for (long long i = 0; i < n; i++) { n long long x; n cin >> x; n p.insert(x); n } n long long np = a[c - 1] + *p.rbegin(), ans = 1; n auto it = p.end(); n it--; n p.erase(it); n for (long long i = 0; i < n; i++) { n if (i == c - 1) continue; n long long x = np - a[i]; n auto f = p.upper_bound(x); n if (f != p.begin()) { n f--; n p.erase(f); n } else { n ans++; n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const double eps = 1e-9; n int n, m, l, r; n int main() { n int T, cas = 1, x = INF; n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; ++i) { n scanf( %d%d , &l, &r); n x = min(x, r - l + 1); n } n printf( %d n , x); n for (int i = 1; i <= n; ++i) printf( %d%c , i % x, i == n ? n : ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int T; n scanf( %d , &T); n while (T--) { n int a[255]; n int s = 0; n for (int i = 0; i < 250; i++) { n scanf( %d , &a[i]); n s += a[i]; n } n double ave = s / 250.0; n int cnt = 0; n for (int i = 0; i < 250; i++) { n if (fabs(a[i] - ave) <= ave / 2) cnt++; n } n if (cnt > 250 * 0.75) n puts( poisson ); n else n puts( uniform ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n ostream& prnt(ostream& out, T v) { n out << v.size() << n ; n for (auto e : v) out << e << ; n return out; n } n template n ostream& operator<<(ostream& out, vector v) { n return prnt(out, v); n } n template n ostream& operator<<(ostream& out, set v) { n return prnt(out, v); n } n template n ostream& operator<<(ostream& out, map v) { n return prnt(out, v); n } n template n ostream& operator<<(ostream& out, pair p) { n return out << ( << p.first << << p.second << ) ; n } n const int N = 100100; n const int MOD = 666013; n int n, k, m, g[N], ans, s, a, b; n int main() { n ios_base::sync_with_stdio(false); n cin >> n >> s; n for (int i = 1; i < n; i++) { n cin >> a >> b; n g[a]++; n g[b]++; n } n for (int i = 1; i <= n; i++) n if (g[i] == 1) ans++; n cout << fixed << setprecision(7); n cout << 2. * s / ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n int n, f = -1; n int main() { n cin >> n; n cout << (n * n + 1) / 2; n for (int i = 0; i < n; i++) { n f = f * (-1); n cout << endl; n for (int j = 0; j < n; j += 2) { n if (f == 1) { n if (j != n - 1) n cout << C. ; n else n cout << C ; n } else { n if (j != n - 1) n cout << .C ; n else n cout << . ; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int L01P08(vector& arr, int n) { n bool check = true; n if (arr[0] - 15 > 0) { n return 15; n } else { n for (int i = 0; i < n - 1; i++) { n for (int j = 1; j < n; j++) { n if (arr[i] + 15 < arr[i + 1]) { n return arr[i] + 15; n break; n } n } n } n if (arr[arr.size() - 1] + 15 < 90) { n return arr[arr.size() - 1] + 15; n } else { n return 90; n } n } n } n int main() { n int n, val; n cin >> n; n vector arr; n for (int i = 0; i < n; i++) { n cin >> val; n arr.push_back(val); n } n int res = L01P08(arr, n); n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector adj[200005]; n vector vis(200005); n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long i, j, k = 0, n, t = 1, m, l = 0; n for (i = 0; i < 200005; i++) vis[i] = 0; n while (t--) { n cin >> n; n for (i = 0; i < n; i++) { n cin >> l >> m; n adj[m].push_back(l); n adj[l].push_back(m); n } n long long d[n + 1]; n for (i = 0; i <= n; i++) d[i] = 100000000000; n queue q; n d[1] = 0; n q.push(1); n vis[1] = 1; n long long farthest = -1; n while (!q.empty()) { n long long s = q.front(); n q.pop(); n for (auto u : adj[s]) { n if (vis[u]) continue; n vis[u] = 1; n d[u] = d[s] + 1; n farthest = u; n q.push(u); n } n } n long long par[n + 1]; n for (i = 0; i <= n; i++) par[i] = -1; n for (i = 0; i <= n; i++) { n d[i] = 100000000000; n vis[i] = 0; n } n d[farthest] = 0; n q.push(farthest); n vis[farthest] = 1; n long long farthest1 = -1; n while (!q.empty()) { n long long s = q.front(); n q.pop(); n for (auto u : adj[s]) { n if (vis[u]) continue; n vis[u] = 1; n d[u] = d[s] + 1; n par[u] = s; n farthest1 = u; n q.push(u); n } n } n for (i = 0; i <= n; i++) vis[i] = 0; n long long node = farthest1; n while (node != farthest) { n vis[node] = 1; n node = par[node]; n } n vis[node] = 1; n long long ans = d[farthest1]; n for (i = 1; i <= n; i++) { n d[i] = 0; n if (vis[i] == 1) { n q.push(i); n } n } n long long farthest2 = -1; n while (!q.empty()) { n long long s = q.front(); n q.pop(); n for (auto u : adj[s]) { n if (vis[u]) continue; n vis[u] = 1; n d[u] = d[s] + 1; n par[u] = s; n farthest2 = u; n q.push(u); n } n } n if (farthest2 != -1) n ans += d[farthest2]; n else { n for (i = 1; i <= n; i++) { n if (i != farthest1 && i != farthest) { n farthest2 = i; n break; n } n } n } n cout << ans << n ; n cout << farthest2 << << farthest1 << << farthest << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long int MOD = 1e9 + 7; n long long int ne; n long long int go(long long int idx, long long int pre) { n if (idx == ne) return 0; n long long int ans = 1e15; n if (idx == 0) n ans = min(ans, 1 + go(idx + 1, 0)); n else { n if (idx == 3) { n if (pre != 1) ans = min(ans, go(idx + 1, 1)); n if (pre != 2) ans = min(ans, go(idx + 1, 2)); n } else if (idx == 1) { n if (pre != 1) ans = min(ans, go(idx + 1, 1)); n } else { n if (pre != 2) ans = min(ans, go(idx + 1, 2)); n } n ans = min(ans, 1 + go(idx + 1, 0)); n } n } n long double k, d, t; n long double kk, dl, dd, tt, tc; n long double kectotal, tnow, ans; n long double prnow, kebnow; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cin >> k >> d >> t; n kk = ceil(k / d); n dd = kk * d; n dl = dd - k; n tt = 1 / (2 * t); n tt = dl * tt; n tc = k / t; n kectotal = tt + tc; n tnow = floor(1.0 / kectotal); n ans = (tnow * dd); n prnow = tnow * kectotal; n kebnow = 1.0 - prnow; n if (kebnow <= 0.000000000) { n } else if (kebnow <= tc) { n ans += ((kebnow / tc) * k); n kebnow -= kebnow; n } else if (kebnow > tc) { n ans += k; n kebnow -= tc; n } n if (kebnow <= 0.000000000) { n } else if (kebnow <= tt) { n ans += ((kebnow / tt) * dl); n kebnow -= kebnow; n } n cout << fixed << setprecision(11) << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n static const double EPS = 1e-8; n int main() { n istream &fin = cin; n ostream &fout = cout; n FILE *fpin = stdin; n FILE *fpout = stdout; n string s; n fin >> s; n bool p = true; n string res; n for (int i = s.size() - 1; i >= 0; i--) { n if (p && s[i] == / ) continue; n if (s[i] != / ) n p = false; n else n p = true; n res.push_back(s[i]); n } n reverse(res.begin(), res.end()); n if (res.empty()) res = / ; n fout << res << endl; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline T gcd(T a, T b) { n if (a < 0) return gcd(-a, b); n if (b < 0) return gcd(a, -b); n return (b == 0) ? a : gcd(b, a % b); n } n template n inline T lcm(T a, T b) { n if (a < 0) return lcm(-a, b); n if (b < 0) return lcm(a, -b); n return a * (b / gcd(a, b)); n } n template n T power(T N, T P) { n return (P == 0) ? 1 : N * power(N, P - 1); n } n long long toInt64(string s) { n long long r = 0; n istringstream sin(s); n sin >> r; n return r; n } n double LOG(long long N, long long B) { return (log10l(N)) / (log10l(B)); } n string itoa(long long a) { n if (a == 0) return 0 ; n string ret; n for (long long i = a; i > 0; i = i / 10) ret.push_back((i % 10) + 48); n reverse(ret.begin(), ret.end()); n return ret; n } n vector token(string a, string b) { n const char *q = a.c_str(); n while (count(b.begin(), b.end(), *q)) q++; n vector oot; n while (*q) { n const char *e = q; n while (*e && !count(b.begin(), b.end(), *e)) e++; n oot.push_back(string(q, e)); n q = e; n while (count(b.begin(), b.end(), *q)) q++; n } n return oot; n } n int Set(int N, int pos) { return N = N | (1 << pos); } n int reset(int N, int pos) { return N = N & ~(1 << pos); } n int check(int N, int pos) { return (bool)(N & (1 << pos)); } n int toggle(int N, int pos) { n if (check(N, pos)) return N = reset(N, pos); n return N = Set(N, pos); n } n void pbit(int N) { n printf( ( ); n for (int i = 10; i >= 0; i--) { n bool x = check(N, i); n cout << x; n } n puts( ) ); n } n int fx[] = {0, 0, 1, -1, 1, -1, 1, -1}; n int fy[] = {-1, 1, 0, 0, -1, -1, 1, 1}; n int main() { n int n; n cin >> n; n int u = 1, c = 1; n for (int i = 1; i <= (int)n - 1; i++) { n for (int j = 1; j <= (int)c; j++) { n u++; n if (u > n) u = 1; n } n cout << u << ; n c++; n } n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, h, m; n int cash[2360] = {0}; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d %d , &h, &m); n h *= 100; n h += m; n cash[h]++; n } n sort(cash, cash + 2360, greater()); n printf( %d n , cash[0]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long pre[26][100005], suff[26][100005]; n int main() { n string s; n cin >> s; n int n = s.length(); n if (n == 1) { n cout << 1 << endl; n return 0; n } n if (n == 2) { n if (s[0] == s[1]) { n cout << 2 << endl; n return 0; n } n cout << 1 << endl; n return 0; n } n for (int i = 0; i < n; i++) { n if (i != 0) { n for (int j = 0; j < 26; j++) { n pre[j][i] = pre[j][i - 1]; n } n } n int ind = s[i] - a ; n pre[ind][i]++; n } n long long ans = 0; n map m; n for (int i = 1; i < n; i++) { n string temp = ; n for (int j = 0; j < 26; j++) { n temp.push_back( a + j); n temp.push_back(s[i]); n m[temp] += pre[j][i - 1]; n } n } n for (auto it = m.begin(); it != m.end(); it++) { n ans = max(ans, it->second); n } n for (int i = 0; i < 26; i++) { n ans = max(ans, pre[i][n - 1]); n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n n using namespace std; n n int t; n int n, k; n n int main() { n for (cin >> t; t--; ) { n cin >> n >> k; n for (n -= k - 3; k != 3; k--) { n cout << 1 << ; n } n if (n == 3) n cout << 1 << << 1 << << 1 << endl; n else if (n % 4 == 0) n cout << n / 2 << << n / 4 << << n / 4 << endl; n else if (n % 4 == 1) n cout << n / 2 << << n / 2 << << 1 << endl; n else if (n % 4 == 2) n cout << n / 2 - 1 << << n / 2 - 1 << << 2 << endl; n else n cout << n / 2 << << n / 2 << << 1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int64_t N = 5e6 + 10; n int64_t n, m; n int64_t it[N]; n bool hamband[N]; n int64_t adj[N]; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n >> m; n if (m == (n - 1) * n >> 1) { n cout << 0; n return 0; n } n for (int64_t i = 0; i < m; i++) { n int64_t x, y; n cin >> x >> y; n x--, y--; n adj[x] += (1 << y); n adj[y] += (1 << x); n } n hamband[0] = true; n int64_t tow = 1; n for (int64_t mask = 1; mask < (1 << n); mask++) { n if (mask == tow) { n hamband[mask] = true; n tow <<= 1; n continue; n } n for (int64_t now = mask; now;) { n int64_t i = __builtin_ctz(now); n if (hamband[mask ^ (1 << i)] && (adj[i] & mask)) { n hamband[mask] = true; n break; n } n now ^= (1 << i); n } n } n int64_t ans = 0, Ans = 0; n for (int64_t mask = 1; mask < (1 << n); mask++) { n if (!hamband[mask]) { n continue; n } n int64_t all = 0; n for (int64_t now = mask; now; now ^= (1 << __builtin_ctz(now))) { n all |= adj[__builtin_ctz(now)]; n } n if ((all & ((1 << n) - 1 - mask)) == ((1 << n) - 1 - mask)) { n if (ans < n - __builtin_popcount(mask)) { n ans = n - __builtin_popcount(mask); n Ans = mask; n } n } n } n cout << n - ans << n ; n for (int64_t i = 0; i < n; i++) { n if (Ans & (1 << i)) { n cout << i + 1 << ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n const int N = 1e5 + 5; n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int T; n cin >> T; n while (T--) { n string x, y; n cin >> x >> y; n int lx = x.size(), ly = y.size(); n int py = 1; n while (y[ly - py] == 0 ) ++py; n int px = py; n while (lx >= px && x[lx - px] == 0 ) ++px; n cout << px - py << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e18; n int main() { n int n; n long long k; n cin >> n >> k; n vector a(n + 1); n for (int i = 0; i <= n; ++i) cin >> a[i]; n vector suff(n + 1); n suff[n] = a[n]; n for (int i = n - 1; i >= 0; --i) { n suff[i] = suff[i + 1] * 2 + a[i]; n if (abs(suff[i]) > k) { n for (int j = 0; j < i; ++j) suff[j] = INF; n break; n } n } n vector pref(n + 1); n pref[0] = 0; n for (int i = 1; i <= n; ++i) { n if ((pref[i - 1] + a[i - 1]) % 2 != 0) { n for (int j = i; j <= n; ++j) pref[j] = INF; n break; n } n pref[i] = (pref[i - 1] + a[i - 1]) / 2; n } n int ans = 0; n for (int i = 0; i <= n; ++i) { n if (pref[i] + suff[i] < INF) { n long long u = pref[i] + suff[i]; n if (abs(a[i] - u) <= k && !(a[n] == u && i == n)) ++ans; n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a, b, c, d, e, t1, t2, t3; n long long la, lb, lc; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long n, m, s; n cin >> n >> m >> s; n a = 0; n b = 0; n long long i = 0; n c = 1; n if (s <= n) { n while (i < n) { n if (i + s < n) { n i += s; n ++c; n } else { n a = n - (i + 1); n ++a; n break; n } n } n } else { n c = n; n a = 1; n } n i = 0; n d = 1; n if (s <= m) { n while (i < m) { n if (i + s < m) { n i += s; n ++d; n } else { n b = m - (i + 1); n ++b; n break; n } n } n } else { n d = m; n b = 1; n } n e = c * d; n t1 = a * b; n cout << t1 * e; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n long long n, k, m, t, x, b[N], a[N]; n int i, j; n map C; n int main() { n cin >> n; n for (i = 2; i <= n; i++) { n cin >> a[i]; n a[i] += a[i - 1]; n m = min(m, a[i]); n } n x = 1 - m; n for (i = 1; i <= n; i++) { n a[i] += x; n if (a[i] < 1 || a[i] > n || b[a[i]] == 1) { n cout << -1; n return 0; n } n b[a[i]] = 1; n } n for (i = 1; i <= n; i++) cout << a[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n template n pair> hungarian(const vector>& A) { n int n = (int)A.size(), m = (int)A[0].size(); n T inf = numeric_limits::max() / 2; n vector way(m + 1), p(m + 1), used(m + 1); n vector u(n + 1), v(m + 1), minv(m + 1); n for (int i = 1; i <= n; i++) { n p[0] = i; n int j0 = 0; n minv.assign(m + 1, inf), used.assign(m + 1, 0); n do { n int i0 = p[j0], j1 = 0; n T delta = inf; n used[j0] = true; n for (int j = 1; j <= m; j++) n if (!used[j]) { n int cur = A[i0 - 1][j - 1] - u[i0] - v[j]; n if (cur < minv[j]) { n minv[j] = cur; n way[j] = j0; n } n if (minv[j] < delta) { n delta = minv[j]; n j1 = j; n } n } n for (int j = 0; j <= m; j++) n if (used[j]) { n u[p[j]] += delta; n v[j] -= delta; n } else n minv[j] -= delta; n j0 = j1; n } while (p[j0] != 0); n do { n int j1 = way[j0]; n p[j0] = p[j1]; n j0 = j1; n } while (j0 != 0); n } n vector matching(n); n for (int i = 1; i <= m; i++) { n if (p[i] > 0) matching[p[i] - 1] = i - 1; n } n return {-v[0], matching}; n } n char c(int k) { n if (k < 26) n return a + k; n else n return A + k - 26; n } n int idx(char a) { n if ( a <= a && a <= z ) n return a - a ; n else n return (a - A ) + 26; n } n int main() { n int N, K; n string enc, ans; n cin >> N >> K >> enc >> ans; n vector> A(K, vector(K, 0)); n for (int i = 0; i < N; i++) { n A[idx(enc[i])][idx(ans[i])]--; n } n auto res = hungarian(A); n cout << -res.first << endl; n for (int k = 0; k < K; k++) { n cout << c(res.second[k]); n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n int cnt, n, vis[305], a[305], C[305][305], sum[305]; n map m; n vector v[305]; n int num[305], top; n long long jie[305], ans, f[305][305]; n void pre() { n jie[0] = 1; n for (int i = 1; i <= 300; i++) jie[i] = jie[i - 1] * i % mod; n C[0][0] = 1; n for (int i = 1; i <= 300; i++) { n C[i][0] = C[i][i] = 1; n for (int j = 1; j < i; j++) { n C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod; n } n } n } n bool check(long long a) { n long long temp = (long long)sqrt(a); n return temp * temp == a; n } n void dfs(int a) { n cnt++; n vis[a] = 1; n for (auto to : v[a]) { n if (vis[to] == 0) dfs(to); n } n } n int main() { n cin >> n; n for (int i = 1; i <= n; i++) cin >> a[i]; n pre(); n for (int i = 1; i <= n; i++) { n for (int j = i + 1; j <= n; j++) { n if (check((long long)a[i] * a[j])) v[i].push_back(j); n } n } n for (int i = 1; i <= n; i++) { n cnt = 0; n if (vis[i] == 0) { n dfs(i); n num[++top] = cnt; n } n } n for (int i = 1; i <= top; i++) { n sum[i] = sum[i - 1] + num[i]; n } n f[0][0] = 1; n for (int i = 1; i <= top; i++) { n for (int j = 0; j <= 1 + sum[i - 1]; j++) { n for (int k = 1; k <= num[i]; k++) { n for (int p = 0; p <= min(k, j); p++) { n f[i][j + num[i] - k - p] = n (f[i][j + num[i] - k - p] + n f[i - 1][j] * C[j][p] % mod * C[num[i] - 1][k - 1] % mod * n C[1 + sum[i - 1] - j][k - p] % mod) % n mod; n } n } n } n } n ans = f[top][0]; n for (int i = 1; i <= top; i++) { n ans = ans * jie[num[i]] % mod; n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, l, k, v1, v2; n bool chk(long double X) { n long double curr = 0; n long double nn = l; n long double f_time; n long double x = X; n for (long long i = 1; i < (n + k - 1) / k; i++) { n long double diss = nn - curr; n long double y = ((x * (long double)v1 * (long double)v2) - n (l * (long double)v2) + (curr * (long double)v2)) / n (long double)((long double)v1 - (long double)v2); n long double time = y / (long double)v2; n y += curr; n curr += (time * v1); n long double xx = ((y - curr) * (long double)v1) / (long double)(v1 + v2); n curr += xx; n f_time = (curr / (long double)v1); n x = X - f_time; n } n x -= ((l - curr) / (long double)v2); n return (x >= 0); n } n void query() { n cin >> n >> l >> v1 >> v2 >> k; n long double L = 0.0, R = l * (long double)v1, ans = R, diff = 1e-6; n while ((R - L) >= 1e-6) { n long double mid = (L + R) / 2.0; n if (chk(mid)) { n R = mid; n ans = min(ans, mid); n } else { n L = mid; n } n } n cout << setprecision(15) << ans << n ; n } n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n ; n long long t = 1; n while (t--) { n query(); n } n } n "} +{"func_code_string": "#include n using namespace std; n char ans[10][10]; n long long dp[10][513][513]; n pair, long long> recur[10][513][513]; n long long insert[10][513][513]; n long long curr, nexty, n, m; n long long setBit(long long num, long long i) { return num | (1 << i); } n long long unsetBit(long long num, long long i) { n num ^= 1 << i; n return num; n } n bool checkBit(long long num, long long i) { n if (num & 1 << i) n return true; n else n return false; n } n string binary(long long num, long long m) { n string ans; n for (long long i = 0; i < m; i++) { n if (checkBit(num, i)) n ans = 1 + ans; n else n ans = 0 + ans; n } n return ans; n } n void backtrack(long long j, long long mask1, long long mask2, long long mask3, n long long newT, long long ogmask1, long long ogmask2, n long long ts) { n if (j == m) { n if (dp[curr][ogmask1][ogmask2] + newT > dp[nexty][mask2][mask3]) { n dp[nexty][mask2][mask3] = dp[curr][ogmask1][ogmask2] + newT; n recur[nexty][mask2][mask3] = pair, long long>( n pair(ogmask1, ogmask2), mask1); n insert[nexty][mask2][mask3] = ts; n } n return; n } n if (j > 1) { n if (!checkBit(mask1, j) && !checkBit(mask1, j - 1) && n !checkBit(mask1, j - 2) && !checkBit(mask2, j - 1) && n !checkBit(mask3, j - 1)) { n long long tempmask1 = setBit(mask1, j); n tempmask1 = setBit(tempmask1, j - 1); n tempmask1 = setBit(tempmask1, j - 2); n backtrack(j + 1, tempmask1, setBit(mask2, j - 1), setBit(mask3, j - 1), n newT + 1, ogmask1, ogmask2, ts); n } n } n if (j > 1) { n if (!checkBit(mask1, j - 1) && !checkBit(mask2, j - 1) && n !checkBit(mask3, j - 1) && !checkBit(mask3, j) && n !checkBit(mask3, j - 2)) { n long long newmask = setBit(mask3, j - 1); n newmask = setBit(newmask, j); n newmask = setBit(newmask, j - 2); n backtrack(j + 1, setBit(mask1, j - 1), setBit(mask2, j - 1), newmask, n newT + 1, ogmask1, ogmask2, setBit(ts, 2 * (j - 1) + 1)); n } n } n if (j > 1) { n if (!checkBit(mask1, j - 2) && !checkBit(mask3, j - 2) && n !checkBit(mask2, j) && !checkBit(mask2, j - 1) && n !checkBit(mask2, j - 2)) { n long long newmask = setBit(mask2, j); n newmask = setBit(newmask, j - 1); n newmask = setBit(newmask, j - 2); n backtrack(j + 1, setBit(mask1, j - 2), newmask, setBit(mask3, j - 2), n newT + 1, ogmask1, ogmask2, setBit(ts, 2 * (j - 2))); n } n } n if (j > 1) { n if (!checkBit(mask1, j) && !checkBit(mask3, j) && !checkBit(mask2, j) && n !checkBit(mask2, j - 1) && !checkBit(mask2, j - 2)) { n long long newmask = setBit(mask2, j); n newmask = setBit(newmask, j - 1); n newmask = setBit(newmask, j - 2); n ts = setBit(ts, 2 * j); n ts = setBit(ts, 2 * j + 1); n backtrack(j + 1, setBit(mask1, j), newmask, setBit(mask3, j), newT + 1, n ogmask1, ogmask2, ts); n ts = unsetBit(ts, 2 * j); n ts = unsetBit(ts, 2 * j + 1); n } n } n backtrack(j + 1, mask1, mask2, mask3, newT, ogmask1, ogmask2, ts); n } n char currchar = A ; n void recursion(long long i, long long mask1, long long mask2) { n if (i == 0) return; n recursion(i - 1, recur[i][mask1][mask2].first.first, n recur[i][mask1][mask2].first.second); n long long mask = insert[i][mask1][mask2]; n for (long long j = 0; j < m; j++) { n if (!checkBit(recur[i][mask1][mask2].second, j)) { n ans[i][j] = . ; n continue; n } n if (checkBit(mask, j * 2) && checkBit(mask, j * 2 + 1)) { n ans[i][j] = ans[i + 1][j] = ans[i + 2][j] = ans[i + 1][j - 1] = n ans[i + 1][j - 2] = currchar; n currchar++; n } else if (checkBit(mask, j * 2) && !checkBit(mask, j * 2 + 1)) { n ans[i][j] = ans[i + 1][j + 2] = ans[i + 2][j] = ans[i + 1][j + 1] = n ans[i + 1][j] = currchar; n currchar++; n } else if (!checkBit(mask, j * 2) && checkBit(mask, j * 2 + 1)) { n ans[i][j] = ans[i + 1][j] = ans[i + 2][j + 1] = ans[i + 2][j - 1] = n ans[i + 2][j] = currchar; n currchar++; n } n } n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> m; n memset(dp, -1, sizeof(dp)); n memset(ans, 0, sizeof(ans)); n dp[0][0][0] = 0; n for (long long i = 0; i < n; i++) { n curr = i; n nexty = i + 1; n for (long long mask1 = 0; mask1 < (1 << m); mask1++) { n for (long long mask2 = 0; mask2 < (1 << m); mask2++) { n if (dp[curr][mask1][mask2] != -1) { n backtrack(0, mask1, mask2, 0, 0, mask1, mask2, 0); n } n } n } n } n cout << dp[n][0][0] << n ; n recursion(n, 0, 0); n for (long long i = 1; i <= n; i++) { n for (long long j = 0; j < m; j++) { n if (ans[i][j] == 0 && ans[i][j - 1] == 0 && ans[i][j + 1] == 0 && n ans[i + 1][j] == 0 && ans[i + 2][j] == 0) { n ans[i][j] = ans[i][j - 1] = ans[i][j + 1] = ans[i + 1][j] = n ans[i + 2][j] = currchar; n currchar++; n } n } n } n for (long long i = 1; i <= n; i++) { n for (long long j = 0; j < m; j++) cout << ans[i][j]; n cout << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int main() { n scanf( %d , &n); n for (int i = 0; i < 2 * n + 1; i++) { n for (int j = 0; j < 2 * n + 1; j++) { n if (i < n + 1) { n if (j < n - i) { n printf( ); n } else if (j < n + i) { n if (j <= n) { n printf( %d , j - n + i); n } else { n printf( %d , abs(j - n - i)); n } n } else if (j == n + i) { n printf( 0 ); n } n } else { n int temp = i; n i = 2 * n - i; n if (j < n - i) { n printf( ); n } else if (j < n + i) { n if (j <= n) { n printf( %d , j - n + i); n } else { n printf( %d , abs(j - n - i)); n } n } else if (j == n + i) { n printf( 0 ); n } n i = temp; n } n } n printf( n ); n } n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void chmin(T &t, U f) { n if (t > f) t = f; n } n template n inline void chmax(T &t, U f) { n if (t < f) t = f; n } n long long N; n char S[11111]; n long long ex[27 * 26 * 26]; n long long dp[11111][2]; n long long get(long long l, long long r) { n if (r > N) return -1; n long long x = 0; n for (long long i = l; i < r; i++) { n x = x * 26 + (S[i] - a ); n } n if (r - l == 2) x += 26 * 26 * 26; n return x; n } n signed main() { n scanf( %s , S); n N = strlen(S); n if (N <= 6) { n puts( 0 ); n return 0; n } n if (N == 7) { n puts( 1 ); n printf( %s , S + 5); n return 0; n } n ex[get(N - 2, N)] = true; n ex[get(N - 3, N)] = true; n dp[N - 2][0] = true; n dp[N - 3][1] = true; n for (long long i = N - 4; i >= 5; i--) { n long long t2 = get(i, i + 2); n long long t3 = get(i, i + 3); n if (t2 == get(i + 2, i + 4)) n dp[i][0] = dp[i + 2][1]; n else n dp[i][0] = dp[i + 2][0] | dp[i + 2][1]; n if (t3 == get(i + 3, i + 6)) n dp[i][1] = dp[i + 3][0]; n else n dp[i][1] = dp[i + 3][0] | dp[i + 3][1]; n if (dp[i][0]) ex[t2] = true; n if (dp[i][1]) ex[t3] = true; n } n vector vec; n for (long long i = 0; i < (26); i++) n for (long long j = 0; j < (26); j++) n if (ex[26 * 26 * 26 + i * 26 + j]) n vec.push_back(string(1, a + i) + string(1, a + j)); n for (long long i = 0; i < (26); i++) n for (long long j = 0; j < (26); j++) n for (long long k = 0; k < (26); k++) n if (ex[i * 26 * 26 + j * 26 + k]) n vec.push_back(string(1, a + i) + string(1, a + j) + n string(1, a + k)); n sort((vec).begin(), (vec).end()); n printf( %lld n , (long long)vec.size()); n for (long long i = 0; i < (vec.size()); i++) printf( %s n , vec[i].c_str()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map m; n int main() { n map::iterator ptr; n int n, i, x, a[3]; n cin >> n; n for (i = 0; i < n; i++) { n cin >> x; n m[x]++; n } n if (m.size() > 3) { n cout << NO ; n return 0; n } n if (m.size() <= 2) { n cout << YES ; n return 0; n } n i = 0; n for (ptr = m.begin(); ptr != m.end(); ptr++) a[i++] = ptr->first; n if ((a[0] + a[2]) == (2 * a[1])) n cout << YES ; n else n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = acos(-1.0); n int n; n int mt[256][256]; n int xy[256], yx[256]; n int lx[256], ly[256], slk[256], slkx[256], prv[256]; n char S[256], T[256]; n void updtree(int x) { n for (int y = 0; y < (int)(n); y++) n if (lx[x] + ly[y] - mt[x][y] < slk[y]) { n slk[y] = lx[x] + ly[y] - mt[x][y]; n slkx[y] = x; n } n } n int hungar() { n for (int i = 0; i < (int)(n); i++) { n ly[i] = 0; n lx[i] = *max_element(mt[i], mt[i] + n); n } n memset(xy, -1, sizeof(xy)); n memset(yx, -1, sizeof(yx)); n for (int m = 0; m < (int)(n); m++) { n memset(S, 0, sizeof(S)); n memset(T, 0, sizeof(T)); n memset(prv, -1, sizeof(prv)); n memset(slk, 0x7f, sizeof(slk)); n queue q; n for (int i = 0; i < (int)(n); i++) n if (xy[i] == -1) { n { n q.push(i); n prv[i] = -2; n S[i] = 1; n updtree(i); n }; n break; n } n int x = 0, y = -1; n while (y == -1) { n while (!q.empty() && y == -1) { n x = q.front(); n q.pop(); n for (int j = 0; j < (int)(n); j++) n if (mt[x][j] == lx[x] + ly[j] && !T[j]) { n if (yx[j] == -1) { n y = j; n break; n } n T[j] = 1; n { n q.push(yx[j]); n prv[yx[j]] = x; n S[yx[j]] = 1; n updtree(yx[j]); n }; n } n } n if (y != -1) break; n int dlt = 0x7f7f7f7f; n for (int j = 0; j < (int)(n); j++) n if (!T[j]) dlt = min(dlt, slk[j]); n for (int k = 0; k < (int)(n); k++) { n if (S[k]) lx[k] -= dlt; n if (T[k]) ly[k] += dlt; n if (!T[k]) slk[k] -= dlt; n } n for (int j = 0; j < (int)(n); j++) n if (!T[j] && !slk[j]) { n if (yx[j] == -1) { n x = slkx[j]; n y = j; n break; n } else { n T[j] = 1; n if (!S[yx[j]]) { n q.push(yx[j]); n prv[yx[j]] = slkx[j]; n S[yx[j]] = 1; n updtree(yx[j]); n }; n } n } n } n if (y != -1) { n for (int p = x; p != -2; p = prv[p]) { n yx[y] = p; n int ty = xy[p]; n xy[p] = y; n y = ty; n } n } else n break; n } n int res = 0; n for (int i = 0; i < (int)(n); i++) res += mt[i][xy[i]]; n return res; n } n string s, t; n int f(char c) { n if ( A <= c && c <= Z ) n return (int)(c - A + 26); n else n return (int)(c - a ); n } n char invf(int i) { n if (i < 26) n return (char)(i + a ); n else n return (char)(i - 26 + A ); n } n int main() { n int N; n cin >> N >> n; n cin >> s >> t; n memset(mt, 0, sizeof(mt)); n for (int i = 0; i < (int)(N); i++) { n mt[f(s[i])][f(t[i])]++; n } n cout << hungar() << endl; n for (int i = 0; i < (int)(n); i++) { n cout << invf(xy[i]); n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX = 300; n int n, m; n struct cell { n int mask = 0; n bool operator[](int i) { return mask & (1 << i); } n }; n cell arr[MAX][MAX]; n vector > adj[MAX][MAX]; n int inDegree[MAX][MAX], _Time, visTime[MAX][MAX], lowTime[MAX][MAX], n compIdx[MAX][MAX]; n bool inStack[MAX][MAX]; n void SCC(int x, int y, stack >& s) { n visTime[x][y] = lowTime[x][y] = ++_Time; n s.push({x, y}); n inStack[x][y] = 1; n for (auto v : adj[x][y]) n if (!visTime[v.first][v.second]) { n SCC(v.first, v.second, s); n lowTime[x][y] = min(lowTime[x][y], lowTime[v.first][v.second]); n } else if (inStack[x][y]) n lowTime[x][y] = min(lowTime[x][y], lowTime[v.first][v.second]); n if (visTime[x][y] == lowTime[x][y]) { n vector > temp; n int cnt = 0; n int v, u; n compIdx[x][y] = lowTime[x][y]; n do { n cnt++; n v = s.top().first, u = s.top().second; n s.pop(); n inStack[v][u] = 0; n compIdx[v][u] = compIdx[x][y]; n arr[x][y].mask |= arr[v][u].mask; n vector >& to = adj[v][u]; n for (int i = 0; i < int(to.size()); i++) n if (!inStack[to[i].first][to[i].second] && n compIdx[to[i].first][to[i].second] != compIdx[x][y]) n temp.push_back(to[i]); n } while (v != x || u != y); n if (cnt > 1) inDegree[x][y] = 0; n adj[x][y] = temp; n } n } n void getDAG() { n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) n if (!visTime[i][j]) { n stack > s; n SCC(i, j, s); n } n } n bool getPath(int x, int y, int idx, string& str) { n if (idx + arr[x][y][str[idx] - 0 ] == int(str.size())) return 1; n vector >& to = adj[x][y]; n for (int i = 0; i < int(to.size()); i++) n if (getPath(to[i].first, to[i].second, idx + arr[x][y][str[idx] - 0 ], n str)) n return 1; n return 0; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int q; n cin >> n >> m >> q; n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) { n char ch; n cin >> ch; n arr[i][j].mask |= 1 << (ch - 0 ); n } n for (int k = 0; k < 10; k++) { n int x, y; n cin >> x >> y; n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) n if (arr[i][j][k] && i + x >= 0 && i + x < n && j + y >= 0 && j + y < m) n adj[i + x][j + y].push_back({i, j}), inDegree[i][j]++; n } n getDAG(); n while (q--) { n string str; n cin >> str; n reverse(str.begin(), str.end()); n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) n if (!inDegree[i][j]) { n int idx = 0; n while (arr[i][j][str[idx] - 0 ]) idx++; n if (getPath(i, j, idx, str)) { n cout << YES n ; n goto ESHTA; n } n } n cout << NO n ; n ESHTA:; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n T abs(T a) { n return a < 0 ? -a : a; n } n template n T sqr(T a) { n return a * a; n } n const int INF = (int)1e9; n const long double EPS = 1e-9; n const long double PI = 3.1415926535897932384626433832795; n const int N = 4; n struct pt { n int first, second; n pt() { first = second = 0; } n pt(int cX, int cY) : first(cX), second(cY) {} n }; n int n, m; n int used[N * N]; n pt a[N * N]; n int s; n int sum[3 * N]; n int szst[N][N]; n int st[N][N][3 * N]; n int szfn[N][N]; n int fn[N][N][3 * N]; n int mn[N][N]; n inline void put(int i, int j, int v) { n mn[i][j] = v; n for (int k = 0; k < int(szst[i][j]); ++k) sum[st[i][j][k]] += v; n } n inline void take(int i, int j) { n for (int k = 0; k < int(szst[i][j]); ++k) sum[st[i][j][k]] -= mn[i][j]; n } n void solve(int x, int y) { n if (y == n) { n x++; n y = 0; n } n if (x == n) { n printf( %d n , s); n for (int i = 0; i < int(n); ++i) { n for (int j = 0; j < int(n); ++j) { n printf( %d , mn[i][j]); n if (j + 1 != n) printf( ); n } n puts( ); n } n exit(0); n } n for (int i = 0; i < int(m); ++i) { n if (used[i] < a[i].second) { n put(x, y, a[i].first); n used[i]++; n bool good = true; n for (int j = 0; j < int(szfn[x][y]); ++j) n if (sum[fn[x][y][j]] != s) { n good = false; n break; n } n if (good) solve(x, y + 1); n used[i]--; n take(x, y); n } n } n } n void pickRow(int idx) { n if (idx == n) { n s = sum[0]; n solve(1, 0); n s = INF; n return; n } n for (int i = 0; i < int(m); ++i) n if (used[i] < a[i].second) { n used[i]++; n put(0, idx, a[i].first); n pickRow(idx + 1); n used[i]--; n take(0, idx); n } n } n int main() { n cin >> n; n vector c; n c.resize(n * n); n for (int i = 0; i < int(n * n); ++i) { n scanf( %d , &c[i]); n } n sort((c).begin(), (c).end()); n m = 0; n int cnt = 1; n for (int i = 1; i < n * n; ++i) { n if (c[i] != c[i - 1]) { n a[m++] = pt(c[i - 1], cnt); n cnt = 1; n } else n cnt++; n } n a[m++] = pt(c[n * n - 1], cnt); n for (int i = 0; i < int(n); ++i) n for (int j = 0; j < int(n); ++j) { n st[i][j][szst[i][j]++] = i; n st[i][j][szst[i][j]++] = n + j; n if (i == j) st[i][j][szst[i][j]++] = 2 * n; n if (i == n - j - 1) st[i][j][szst[i][j]++] = 2 * n + 1; n if (j == n - 1) fn[i][j][szfn[i][j]++] = i; n if (i == n - 1) fn[i][j][szfn[i][j]++] = n + j; n if (i == n - 1 && j == n - 1) fn[i][j][szfn[i][j]++] = 2 * n; n if (i == n - 1 && j == 0) fn[i][j][szfn[i][j]++] = 2 * n + 1; n } n random_shuffle(a, a + m); n s = INF; n pickRow(0); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long bigmod(long long b, long long p) { n if (p == 0) return 1; n long long my = bigmod(b, p / 2); n my *= my; n my %= 1000000009; n if (p & 1) my *= b, my %= 1000000009; n return my; n } n int setb(int n, int pos) { return n = n | (1 << pos); } n int resb(int n, int pos) { return n = n & ~(1 << pos); } n bool checkb(int n, int pos) { return (bool)(n & (1 << pos)); } n double p[100]; n int n, k; n double pr[(1 << 20) + 5][21]; n double prob(int mask, int pos) { n double tot = 0.0; n int i; n for (i = 0; i < n; i++) { n if (checkb(mask, i) == 0) tot += p[i]; n } n return p[pos] / tot; n } n void prework() { n for (int mask = 0; mask < (1 << n); mask++) { n for (int i = 0; i < n; i++) { n if (checkb(mask, i) == 0) { n pr[mask][i] = prob(mask, i); n } n } n } n } n double dp[(1 << 20) + 5]; n double motherfuckerareyoukiddingme(int x) { n for (int mask = (1 << n) - 1; mask >= 0; mask--) { n int bt = __builtin_popcount(mask); n if (bt >= k) { n if (bt == k && checkb(mask, x)) n dp[mask] = 1.0; n else n dp[mask] = 0.0; n } else { n double ret = 0.0; n for (int i = 0; i < n; i++) { n if (checkb(mask, i) == 0) { n ret += pr[mask][i] * dp[setb(mask, i)]; n } n } n dp[mask] = ret; n } n } n return dp[0]; n } n int main() { n int i, d = 0; n scanf( %d %d , &n, &k); n for (i = 0; i < n; i++) scanf( %lf , &p[i]); n for (i = 0; i < n; i++) n if (p[i] > 0.0) d++; n k = min(d, k); n prework(); n for (i = 0; i < n; i++) { n if (i) printf( ); n printf( %.10f , motherfuckerareyoukiddingme(i)); n } n printf( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, q = 0; n cin >> n >> m; n int k = n * m; n char a[k]; n for (int j = 0; j < k; j++) { n cin >> a[k]; n if (a[k] == M || a[k] == Y || a[k] == C ) { n q = 1; n } n } n if (q == 1) { n cout << #Color << endl; n } else { n cout << #Black&White << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 500000; n int n, m; n vector nei[N + 1]; n bool vis[N + 1]; n int fa[N + 1], dep[N + 1]; n void dfs(int x = 1) { n vis[x] = true; n for (int i = 0; i < nei[x].size(); i++) { n int y = nei[x][i]; n if (vis[y]) continue; n fa[y] = x; n dep[y] = dep[x] + 1; n dfs(y); n } n } n vector buc[N + 1]; n void mian() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) n nei[i].clear(), buc[i].clear(), vis[i] = fa[i] = dep[i] = 0; n while (m--) { n int x, y; n scanf( %d%d , &x, &y); n nei[x].push_back(y); n nei[y].push_back(x); n } n dep[1] = 1; n dfs(); n for (int i = 1; i <= n; i++) n if (dep[i] >= n + 1 >> 1) { n puts( PATH ); n printf( %d n , dep[i]); n while (i) printf( %d , i), i = fa[i]; n puts( ); n return; n } else n buc[dep[i]].push_back(i); n puts( PAIRING ); n int cnt = 0; n for (int i = 1; i <= n; i++) cnt += buc[i].size() >> 1; n printf( %d n , cnt); n for (int i = 1; i <= n; i++) { n for (int j = 0; j + 1 < buc[i].size(); j += 2) n printf( %d %d n , buc[i][j], buc[i][j + 1]); n } n } n int main() { n int testnum; n cin >> testnum; n while (testnum--) mian(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int in[100005]; n int in2[100005]; n int remlocate[100005]; n int main() { n int n; n cin >> n; n for (int i = 0; i < n; ++i) { n cin >> in[i]; n } n for (int i = 0; i < n; ++i) { n cin >> in2[i]; n remlocate[in2[i]] = i; n } n int go1 = n - 1; n int go2 = n - 1; n int cnt = 0; n for (int i = 0; i < n; ++i) { n while (in2[go2] == 0) { n go2--; n } n if (in[go1] != in2[go2]) { n cnt++; n in2[remlocate[in[go1]]] = 0; n go1--; n } else { n go1--; n go2--; n } n } n cout << cnt << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000007; n const int MAXN = 1000005; n int dp[MAXN]; n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int n; n cin >> n; n int x; n int maxn = 0; n for (int i = 0; i < n; i++) { n cin >> x; n dp[x]++; n maxn = max(maxn, dp[x]); n for (int j = x * 2; j < MAXN; j += x) { n dp[j] = max(dp[j], dp[x]); n } n } n cout << maxn << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC target( avx2 ) n #pragma GCC optimization( O3 ) n #pragma GCC optimization( unroll-loops ) n using namespace std; n using ll = long long; n using ld = long double; n const ll MOD = 1000000007; n const ll root = 62; n ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } n ll binpow(ll a, ll b) { n ll res = 1; n while (b) { n if (b & 1) res = (res * a) % MOD; n a = (a * a) % MOD; n b >>= 1; n } n return res; n } n ll modInv(ll a) { return binpow(a, MOD - 2); } n const double PI = acos(-1); n const double eps = 1e-10; n const int INF = 0x3f3f3f3f; n const int NINF = 0xc0c0c0c0; n const ll INFLL = 0x3f3f3f3f3f3f3f3f; n const ll NINFLL = 0xc0c0c0c0c0c0c0c0; n struct Dinic { n struct Edge { n int to, rev; n ll flo, cap; n }; n int N; n vector> adj; n void init(int _N) { n N = _N; n adj.resize(N); n } n void add(int a, int b, ll cap, ll rcap = 0) { n adj[a].push_back({b, (int)adj[b].size(), 0, cap}); n adj[b].push_back({a, (int)adj[a].size() - 1, 0, rcap}); n } n vector lev, ptr; n bool bfs(int s, int t) { n lev = ptr = vector(N); n queue Q({s}); n lev[s] = 1; n while (!Q.empty()) { n int u = Q.front(); n Q.pop(); n for (auto e : adj[u]) { n if (!lev[e.to] && e.cap - e.flo) Q.push(e.to), lev[e.to] = lev[u] + 1; n } n } n return lev[t]; n } n ll dfs(int v, int t, ll flo) { n if (v == t) return flo; n for (int& i = ptr[v]; i < (adj[v].size()); i++) { n Edge& e = adj[v][i]; n ll dif = e.cap - e.flo; n if (lev[e.to] != lev[v] + 1 || !dif) continue; n if (ll df = dfs(e.to, t, min(flo, dif))) { n e.flo += df; n adj[e.to][e.rev].flo -= df; n return df; n } n } n return 0; n } n ll Flow(int s, int t) { n ll tot = 0; n while (bfs(s, t)) n while (ll df = dfs(s, t, numeric_limits::max())) tot += df; n return tot; n } n }; n vector> arr; n vector> res; n vector> ans; n int n, m; n int dx[4] = {1, 0, -1, 0}; n int dy[4] = {0, 1, 0, -1}; n bool inside(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; } n pair pos(int a) { return {a / m, a % m}; } n char getdir(pair a, pair b) { n if (a.first == b.first && a.second == b.second - 1) { n return R ; n } else if (a.first == b.first && a.second == b.second + 1) { n return L ; n } else if (a.first == b.first - 1 && a.second == b.second) { n return D ; n } else if (a.first == b.first + 1 && a.second == b.second) { n return U ; n } else { n cout << GFYAHFGAIJOTGIOWGEOG n ; n } n return ? ; n } n void solve() { n cin >> n >> m; n Dinic G; n G.init(n * m + 4); n arr.resize(n); n res.resize(n); n ans.resize(n); n for (auto i = (0); i < (n); ++i) { n arr[i].resize(m); n res[i].resize(m); n ans[i].resize(m); n } n for (auto i = (0); i < (n); ++i) { n for (auto j = (0); j < (m); ++j) { n cin >> arr[i][j]; n ans[i][j] = -1; n } n } n G.add(n * m + 1, n * m, INF); n int req = 0; n for (auto i = (0); i < (n); ++i) { n for (auto j = (0); j < (m); ++j) { n bool go = false; n for (auto d = (0); d < (4); ++d) { n if (inside(i + dx[d], j + dy[d])) { n go |= (arr[i + dx[d]][j + dy[d]] < arr[i][j]); n if (arr[i + dx[d]][j + dy[d]] == arr[i][j] && ((i + j) & 1) == 0) { n G.add(i * m + j, (i + dx[d]) * m + j + dy[d], 1); n } n } n } n if (((i + j) & 1) == 0) { n if (go) { n G.add(n * m, i * m + j, 1); n } else { n G.add(n * m + 2, i * m + j, 1); n G.add(n * m, n * m + 3, 1); n req++; n } n } else { n if (go) { n G.add(i * m + j, n * m + 1, 1); n } else { n G.add(i * m + j, n * m + 3, 1); n G.add(n * m + 2, n * m + 1, 1); n req++; n } n } n } n } n if (G.Flow(n * m + 2, n * m + 3) != req) { n cout << NO n ; n return; n } n cout << YES n ; n for (auto i = (0); i < (n * m); ++i) { n for (auto e : G.adj[i]) { n if (e.flo > 0 && e.to < n * m) { n auto [x, y] = pos(i); n auto [dx, dy] = pos(e.to); n res[x][y] = getdir({x, y}, {dx, dy}); n res[dx][dy] = getdir({dx, dy}, {x, y}); n ans[x][y] = 1; n ans[dx][dy] = arr[x][y] - 1; n } n } n } n for (auto i = (0); i < (n); ++i) { n for (auto j = (0); j < (m); ++j) { n if (ans[i][j] != -1) continue; n for (auto d = (0); d < (4); ++d) { n if (inside(i + dx[d], j + dy[d])) { n if (arr[i + dx[d]][j + dy[d]] < arr[i][j]) { n res[i][j] = getdir({i, j}, {i + dx[d], j + dy[d]}); n ans[i][j] = arr[i][j] - arr[i + dx[d]][j + dy[d]]; n } n } n } n } n } n for (auto i = (0); i < (n); ++i) { n for (auto j = (0); j < (m); ++j) { n cout << ans[i][j] << ; n } n cout << n ; n } n for (auto i = (0); i < (n); ++i) { n for (auto j = (0); j < (m); ++j) { n cout << res[i][j] << ; n } n cout << n ; n } n return; n } n int T; n int main() { n mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); n cin.tie(0)->sync_with_stdio(0); n cin >> T; n while (T--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[100005]; n long long b[100005]; n long long x; n long long n, m; n long long c[100005]; n long long d[100005]; n void solve() { n cin >> n >> m; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n if (i) a[i] += a[i - 1]; n c[i + 1] = 1e9; n } n for (long long i = 0; i < m; i++) { n cin >> b[i]; n if (i) b[i] += b[i - 1]; n d[i + 1] = 1e10; n } n cin >> x; n long long fans = 0; n for (long long i = 0; i < n; i++) { n for (long long j = i; j < n; j++) { n long long l = j - i + 1; n if (i) n c[l] = min(c[l], a[j] - a[i - 1]); n else n c[l] = min(c[l], a[j]); n } n } n for (long long i = 0; i < m; i++) { n for (long long j = i; j < m; j++) { n long long l = j - i + 1; n if (i) n d[l] = min(d[l], b[j] - b[i - 1]); n else n d[l] = min(d[l], b[j]); n } n } n for (long long i = 1; i <= n; i++) { n for (long long j = 1; j <= m; j++) { n if (c[i] * d[j] <= x) { n fans = max(fans, i * j); n } n } n } n cout << fans; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long T; n T = 1; n while (T--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n const int N = 1000000 + 9, MOD = 1000000000 + 7; n int f[N], n, a, b; n int main() { n scanf( %d , &n); n for (int i = 1, x; i <= n; ++i) { n scanf( %d , &x); n if (x == 1) n ++a; n else n ++b; n } n f[1] = 1; n f[0] = 1; n for (int i = 2; i <= a; ++i) n f[i] = (f[i - 1] + 1ll * f[i - 2] * (i - 1) % MOD) % MOD; n int ans = f[a]; n for (int i = 1; i <= b; ++i) ans = 1ll * ans * (i + a) % MOD; n printf( %d n , ans); n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5; n vector g[N], used, g1[N]; n int gl[N]; n bool ok = 1; n void dfs(int v, int glb) { n used[v] = 1; n gl[v] = glb; n for (int to : g[v]) n if (!used[to]) dfs(to, glb + 1); n } n void dfs1(int v, int root) { n used[v] = 1; n for (int to : g1[v]) n if (to == root) n ok = 0; n else if (!used[to]) n dfs1(to, root); n } n int32_t main() { n ios_base::sync_with_stdio(NULL); n cin.tie(0); n cout.tie(0); n int n, m; n cin >> n >> m; n map, int> q; n for (int i = 0; i < m; ++i) { n int a, b; n cin >> a >> b; n --a; n --b; n q[make_pair(a, b)] = i; n g[a].push_back(b); n g[b].push_back(a); n g1[a].push_back(b); n } n for (int i = 0; i < n; ++i) { n used.assign(n, 0); n dfs1(i, i); n } n used.assign(n, 0); n for (int i = 0; i < n; ++i) n if (!used[i]) dfs(i, 0); n if (ok) { n cout << 1 n ; n for (int i = 0; i < m; ++i) cout << 1 ; n return 0; n } n vector res(m); n for (auto x : q) { n int a = x.first.first; n int b = x.first.second; n if (gl[a] > gl[b]) n res[x.second] = 1; n else n res[x.second] = 2; n } n cout << 2 n ; n for (int i = 0; i < m; ++i) cout << res[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, m, T, k, q; n const long long big = 1000000007; n const long long big2 = 998244353; n long long M[4][4] = {0}; n vector > ANS; n bool inbounds(long long i, long long j) { n return i >= 0 && j >= 0 && i < 4 && j < 4; n } n void clearm() { n for (int c1 = 0; c1 < 4; c1++) { n long long ones = 0; n for (int c2 = 0; c2 < 4; c2++) { n ones += (M[c1][c2] == 1); n } n if (ones == 4) { n for (int c2 = 0; c2 < 4; c2++) { n M[c1][c2] = 2; n } n } n } n for (int c1 = 0; c1 < 4; c1++) { n long long ones = 0; n for (int c2 = 0; c2 < 4; c2++) { n ones += (M[c2][c1] != 0); n } n if (ones == 4) { n for (int c2 = 0; c2 < 4; c2++) { n M[c2][c1] = 2; n } n } n } n for (int c1 = 0; c1 < 4; c1++) { n for (int c2 = 0; c2 < 4; c2++) { n if (M[c1][c2] == 2) M[c1][c2] = 0; n } n } n } n void place(long long dx, long long dy) { n if (dx == 1) { n if (M[0][0] == 0) { n M[0][0] = 1; n M[1][0] = 1; n ANS.push_back({0, 0}); n clearm(); n return; n } n if (M[2][0] == 0) { n M[2][0] = 1; n M[3][0] = 1; n ANS.push_back({2, 0}); n clearm(); n return; n } n } else { n for (int c1 = 0; c1 < 4; c1++) { n if (M[c1][2] == 0) { n M[c1][2] = 1; n M[c1][3] = 1; n ANS.push_back({c1, 2}); n clearm(); n return; n } n } n } n for (int c1 = 0; c1 < 4; c1++) { n for (int c2 = 0; c2 < 4; c2++) { n if (M[c1][c2] == 0 && inbounds(c1 + dx, c2 + dy) && n M[c1 + dx][c2 + dy] == 0) { n ANS.push_back({c1, c2}); n M[c1][c2] = 1; n M[c1 + dx][c2 + dy] = 1; n clearm(); n return; n } n } n } n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n long long a, b, c, e; n string s; n cin >> s; n for (int c1 = 0; c1 < s.length(); c1++) { n if (s[c1] == 0 ) { n place(1, 0); n } else { n place(0, 1); n } n cout << ANS[c1].first + 1 << << ANS[c1].second + 1 << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, x, y; n bool f[1000010]; n vector v, b[1000010]; n int ans = 0, res = 0; n int main(int argc, char **argv) { n scanf( %d , &n); n if (n == 1) { n puts( 1 ); n return 0; n } n for (int i = 0; i < n; ++i) { n scanf( %d , &x); n b[x].push_back(i); n if (!f[x]) { n f[x] = 1; n v.push_back(x); n } n } n for (int i = 0; i < (int)v.size(); ++i) { n for (int j = i; j < (int)v.size(); ++j) { n x = v[i]; n y = v[j]; n if (i == j) { n res = max(res, (int)b[x].size()); n continue; n } n bool ok = 0; n int idx = -1; n ans = 0; n if (b[x][0] < b[y][0]) { n while (idx <= (int)b[x].back() || idx <= (int)b[y].back()) { n if (ok == 0) { n if (idx == -1) { n ++ans; n idx = b[x][0]; n } else { n int ii = n lower_bound(b[x].begin(), b[x].end(), idx) - b[x].begin(); n if (ii < (int)b[x].size()) { n ++ans; n idx = b[x][ii]; n } else n idx = 1e9; n } n } else { n if (idx == -1) { n ++ans; n idx = b[y][0]; n } else { n int ii = n lower_bound(b[y].begin(), b[y].end(), idx) - b[y].begin(); n if (ii < (int)b[y].size()) { n ++ans; n idx = b[y][ii]; n } else n idx = 1e9; n } n } n ok ^= 1; n } n } else { n swap(x, y); n while (idx <= (int)b[x].back() || idx <= (int)b[y].back()) { n if (ok == 0) { n if (idx == -1) { n ++ans; n idx = b[x][0]; n } else { n int ii = n lower_bound(b[x].begin(), b[x].end(), idx) - b[x].begin(); n if (ii < (int)b[x].size()) { n ++ans; n idx = b[x][ii]; n } else n idx = 1e9; n } n } else { n if (idx == -1) { n ++ans; n idx = b[y][0]; n } else { n int ii = n lower_bound(b[y].begin(), b[y].end(), idx) - b[y].begin(); n if (ii < (int)b[y].size()) { n ++ans; n idx = b[y][ii]; n } else n idx = 1e9; n } n } n ok ^= 1; n } n } n res = max(res, ans); n } n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long MOD = 1e9 + 7; n const int SIZE = 1e6 + 5; n const long long INF = 1LL << 55; n const double eps = 1e-10; n pair d[1000009]; n long long f[1000009]; n deque > dq; n long long dsum = 0; n int main() { n long long l, m; n scanf( %I64d %I64d , &l, &m); n int(n); n scanf( %d , &n); n d[0].first = 0; n d[0].second = 999999999; n for (int i = (1); i < (n + 1); ++i) { n scanf( %I64d %I64d , &d[i].first, &d[i].second); n } n sort(d, d + n + 1); n d[n + 1].first = l; n d[n + 1].second = 0; n n += 2; n long long ans = 0; n f[0] = m; n for (int i = (1); i < (n); ++i) { n f[i] = f[i - 1] - (d[i].first - d[i - 1].first); n while (f[i] < 0) { n if (((int)(dq).size()) == 0) { n ans = -1; n break; n } n long long buy = min(-f[i], dq[0].second); n dq[0].second -= buy; n ans += buy * dq[0].first; n dsum -= buy; n f[i] += buy; n if (dq[0].second == 0) dq.pop_front(); n } n while (((int)(dq).size())) { n if (dq.back().first > d[i].second) { n dsum -= dq.back().second; n dq.pop_back(); n } else n break; n } n if ((m - f[i] - dsum) > 0) { n dq.push_back(make_pair(d[i].second, m - f[i] - dsum)); n dsum += m - f[i] - dsum; n } n if (ans == -1) break; n } n printf( %I64d , ans); n } n "} +{"func_code_string": "#include n using namespace std; n bool judge(int x) { n for (int i = 2; i * i <= x; i++) { n if (x % i == 0) return false; n } n return true; n } n int main() { n int n; n scanf( %d , &n); n if (judge(n)) { n printf( 1 n ); n return 0; n } n if (n % 2) { n if (judge(n - 2)) { n printf( 2 n ); n } else { n printf( 3 n ); n } n return 0; n } else { n printf( 2 n ); n return 0; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int p[424242]; n int main() { n long long n; n cin >> n; n int ans = 0; n if (n % 3 == 0) { n n /= 3; n int kp = 0; n for (int d = 1; d <= 50000; d++) n if ((4 * n) % d == 0) p[kp++] = d; n for (int a = 1; 8LL * a * a * a <= n; a++) n for (int id = 0; id < kp; id++) { n int b = p[id] - a; n if (b < a) continue; n if (2LL * b * (a + b) * (a + b) > n) continue; n long long d = (long long)(a + b) * (a + b) * (a - b) * (a - b) + n 4LL * (a + b) * n; n long long dd = sqrt(1.0 * d); n while (dd * dd < d) dd++; n while (dd * dd > d) dd--; n if (dd * dd == d) { n long long c = -a - b + dd / (a + b); n if (c < 2 * b || (c & 1)) continue; n c >>= 1; n if (a < b && b < c) n ans += 6; n else if (a == b && b == c) n ans += 1; n else n ans += 3; n } n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1005; n const int M = 11; n const int MOD = 1e9 + 7; n int n, m; n int dp[M][N][N]; n int solve(int idx, int a, int b) { n if (idx >= m) return 1; n int& r = dp[idx][a][b]; n if (r != -1) return r; n r = solve(idx + 1, a, b); n if (a < b) { n r = (r + solve(idx, a + 1, b)) % MOD; n r = (r + solve(idx, a, b - 1)) % MOD; n } n if (a + 1 < b) r = ((r - solve(idx, a + 1, b - 1)) % MOD + MOD) % MOD; n return r; n } n int main() { n cin >> n >> m; n memset(dp, -1, sizeof dp); n cout << solve(0, 1, n) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long double PI = 3.14159265358979323846264338; n const long long INF = 1000000000000000000; n const long long INF1 = 1000000000; n const long long MOD = 1000000007; n long long mpow(long long a, long long b) { n a %= MOD; n if (!b) return 1; n long long temp = mpow(a, b / 2); n temp = (temp * temp) % MOD; n if (b % 2) return (a * temp) % MOD; n return temp; n } n long long _pow(long long a, long long b) { n if (!b) return 1; n long long temp = _pow(a, b / 2); n temp = (temp * temp); n if (b % 2) return (a * temp); n return temp; n } n long long mod_in(long long n) { return mpow(n, MOD - 2); } n long long cl(long long a, long long b) { n if (a % b) return 1 + a / b; n return a / b; n } n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int T; n T = 1; n while (T--) { n long long n, k; n cin >> n >> k; n set s1, s2; n cout << ? ; n for (int i = 1; i <= k; i++) cout << i << ; n cout << n ; n cout.flush(); n long long pos, apos; n cin >> pos >> apos; n s1.insert(k + 1); n for (int i = 1; i <= k; i++) { n if (pos == i) continue; n cout << ? ; n for (int j = 1; j <= k + 1; j++) { n if (i == j) continue; n cout << j << ; n } n cout << n ; n cout.flush(); n long long x, y; n cin >> x >> y; n if (y == apos) n s1.insert(i); n else n s2.insert(i); n } n cout << ? ; n for (long long x : s1) cout << x << ; n for (long long y : s2) cout << y << ; n cout << n ; n cout.flush(); n long long u, v; n cin >> u >> v; n long long p1 = -1, p2 = -1, c[2] = {}; n if (s1.count(u)) { n if (v > apos) { n p1 = 1; n p2 = 0; n } else { n p1 = 0; n p2 = 1; n } n } else { n if (v > apos) { n p1 = 0; n p2 = 1; n } else { n p1 = 1; n p2 = 0; n } n } n for (int i = 1; i <= k; i++) { n if (i == pos) continue; n if (s1.count(i)) n c[p1]++; n else n c[p2]++; n } n cout << ! << c[0] + 1 << n ; n cout.flush(); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5050; n const int inf = 0x3f3f3f3f; n int to[N * 2], nxt[N * 2], pre[N * 2], cnt, n, tot[N], dp[N][N][2]; n void makeedge(int x, int y) { n to[cnt] = x; n nxt[cnt] = pre[y]; n pre[y] = cnt++; n to[cnt] = y; n nxt[cnt] = pre[x]; n pre[x] = cnt++; n } n int dfs(int x, int fa) { n int son = 0; n if (tot[x] == 1) { n son = 1; n dp[x][0][1] = 0; n dp[x][1][0] = 0; n } else { n dp[x][0][1] = 0; n dp[x][0][0] = 0; n } n for (int p = pre[x]; p != -1; p = nxt[p]) { n int y = to[p]; n if (y == fa) continue; n int tmp = dfs(y, x); n for (int j = son; j >= 0; j--) { n for (int k = tmp; k >= 1; k--) { n dp[x][j + k][0] = n min(dp[x][j + k][0], n min(dp[x][j][0] + dp[y][k][1] + 1, dp[x][j][0] + dp[y][k][0])); n dp[x][j + k][1] = n min(dp[x][j + k][1], n min(dp[x][j][1] + dp[y][k][0] + 1, dp[x][j][1] + dp[y][k][1])); n } n dp[x][j][0] = min(inf, dp[x][j][0] + min(dp[y][0][1] + 1, dp[y][0][0])); n dp[x][j][1] = min(inf, dp[x][j][1] + min(dp[y][0][0] + 1, dp[y][0][1])); n } n son += tmp; n } n return son; n } n int main() { n scanf( %d , &n); n memset(pre, -1, sizeof(pre)); n memset(dp, inf, sizeof(dp)); n for (int i = 1; i < n; i++) { n int x, y; n scanf( %d%d , &x, &y); n tot[x]++; n tot[y]++; n makeedge(x, y); n } n if (n == 2) { n printf( 1 n ); n return 0; n } n int son = 0, S; n for (int i = 1; i <= n; i++) { n if (tot[i] != 1) n S = i; n else n son++; n } n dfs(S, 0); n printf( %d n , min(dp[S][son / 2][0], dp[S][son / 2][1])); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, s, q, nr = 0; n scanf( %d%d%d , &t, &s, &q); n while (s < t) { n nr++; n s += s * (q - 1); n } n printf( %d , nr); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int arr[105]; n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n long long int n, x, y, t, l, m, k = 0, r = 0, a, b, c, d, p = 0, q = 0, s, i, n j, ans = 0, ans1 = 0; n string s1; n char ch; n cin >> t; n while (t--) { n cin >> n >> a >> b >> c >> d; n q = a + b; n p = a - b; n s = c + d; n r = c - d; n x = p * n; n y = q * n; n if (x > s || y < r) n cout << No n << n ; n else n cout << Yes n << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int sci[200005], bn[200005]; n int main() { n int n; n while (scanf( %d , &n) != EOF) { n int m, ple = 0, sat = 0, fi = 1, cn; n map mp; n for (int i = 0; i < n; i++) { n scanf( %d , &sci[i]); n mp[sci[i]]++; n } n scanf( %d , &m); n for (int i = 1; i <= m; i++) { n scanf( %d , &bn[i]); n } n for (int i = 1; i <= m; i++) { n scanf( %d , &cn); n if (mp[bn[i]] > ple) { n ple = mp[bn[i]]; n sat = mp[cn]; n fi = i; n } else if (mp[bn[i]] == ple && mp[cn] > sat) { n sat = mp[cn]; n fi = i; n } n } n printf( %d n , fi); n } n } n "} +{"func_code_string": "#include n using namespace std; n const int M = (int)1e5 + 5; n int n; n int a[M]; n int q, ans[M]; n vector > ps[M]; n int pas[M], las[M], llas[M], mfr[M]; n struct SEGMENT1 { n int val[M * 4]; n void update(int L, int R, int p, int l, int r, int v) { n if (L == l && R == r) { n val[p] += v; n return; n } n int mid = (L + R) >> 1; n if (mid >= r) n update(L, mid, p << 1, l, r, v); n else if (mid < l) n update(mid + 1, R, p << 1 | 1, l, r, v); n else n update(L, mid, p << 1, l, mid, v), n update(mid + 1, R, p << 1 | 1, mid + 1, r, v); n } n int query(int L, int R, int p, int x) { n if (L == R) return val[p]; n int mid = (L + R) >> 1; n if (mid >= x) n return val[p] + query(L, mid, p << 1, x); n else n return val[p] + query(mid + 1, R, p << 1 | 1, x); n } n } T1; n struct SEGMENT2 { n int val[M * 4]; n void update(int L, int R, int p, int x, int v) { n val[p] += v; n if (L == R) return; n int mid = (L + R) >> 1; n if (mid >= x) n update(L, mid, p << 1, x, v); n else n update(mid + 1, R, p << 1 | 1, x, v); n } n int query(int L, int R, int p, int l, int r) { n if (L == l && R == r) return val[p]; n int mid = (L + R) >> 1; n if (mid >= r) n return query(L, mid, p << 1, l, r); n else if (mid < l) n return query(mid + 1, R, p << 1 | 1, l, r); n else n return query(L, mid, p << 1, l, mid) + n query(mid + 1, R, p << 1 | 1, mid + 1, r); n } n } T2; n int main() { n scanf( %d , &n); n for (int i = 1; i <= n; i++) scanf( %d , &a[i]); n scanf( %d , &q); n for (int i = 1, l, r; i <= q; i++) n scanf( %d %d , &l, &r), ps[r].push_back(pair(l, i)); n for (int i = 1, x, len; i <= n; i++) { n x = a[i]; n len = i - las[x]; n if (len != pas[x] && pas[x] != las[x]) { n if (mfr[x] < llas[x]) T1.update(1, n, 1, mfr[x] + 1, llas[x], 1); n mfr[x] = llas[x]; n } n pas[x] = len; n if (las[x] != 0) T2.update(1, n, 1, las[x], -1); n T2.update(1, n, 1, i, 1); n llas[x] = las[x]; n las[x] = i; n for (int j = 0, up = ps[i].size(), c1, c2, l, id; j < up; j++) { n l = ps[i][j].first; n id = ps[i][j].second; n c1 = T2.query(1, n, 1, l, i); n c2 = T1.query(1, n, 1, l); n if (c1 != c2) n ans[id] = c1; n else n ans[id] = c1 + 1; n } n } n for (int i = 1; i <= q; i++) printf( %d n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 5e4 + 10, K = 256, B = 16; n int a[N], parent[N], depth[N], up[N], ans[N][K]; n vector g[N]; n bitset<(1 << (B + 1)) + 10> trie; n void make_tries(int i, int par); n void trie_insert(int val); n void trie_clear(int val); n int trie_max(int val); n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n, q; n cin >> n >> q; n for (int i = 1; i <= n; ++i) { n cin >> a[i]; n } n for (int i = 1; i < n; ++i) { n int u, v; n cin >> u >> v; n g[u].push_back(v); n g[v].push_back(u); n } n make_tries(1, 0); n while (q--) { n int u, v; n cin >> u >> v; n int dist = 0, res = 0; n while (depth[v] - depth[u] >= K - 1) { n res = max(res, ans[v][dist]); n v = up[v]; n ++dist; n } n dist <<= 8; n while (depth[v] >= depth[u]) { n res = max(res, dist xor a[v]); n v = parent[v]; n ++dist; n } n cout << res << endl; n } n } n void make_tries(int i, int par) { n parent[i] = par; n depth[i] = 1 + depth[par]; n if (depth[i] >= K) { n int u = i; n int dist = 0; n while (depth[i] - depth[u] <= K - 1) { n trie_insert(dist xor a[u]); n u = parent[u]; n ++dist; n } n for (int d = 0; d < K; ++d) { n ans[i][d] = trie_max(d << 8); n } n up[i] = u; n dist = 0; n u = i; n while (depth[i] - depth[u] <= K - 1) { n trie_clear(dist xor a[u]); n u = parent[u]; n ++dist; n } n } n for (auto &j : g[i]) { n if (j != par) { n make_tries(j, i); n } n } n } n void trie_insert(int val) { n int pos = 1; n for (int b = B - 1; b >= 0; --b) { n pos = (pos << 1) | ((val & (1 << b)) >> b); n trie[pos] = 1; n } n } n void trie_clear(int val) { n int pos = 1; n for (int b = B - 1; b >= 0; --b) { n pos = (pos << 1) | ((val & (1 << b)) >> b); n trie[pos] = 0; n } n } n int trie_max(int val) { n int pos = 1, res = 0; n for (int b = B - 1; b >= 0; --b) { n pos = (pos << 1) | (((val & (1 << b)) >> b) ^ 1); n if (trie[pos]) { n res |= (1 << b); n } else { n pos ^= 1; n } n } n return res; n } n "} +{"func_code_string": "#include n using namespace std; n long long int arr[100001], done[100001], cnt0[100001], cnte[100001], n cnto[100001]; n long long int dp[105][105][2]; n int main() { n ios::sync_with_stdio(false); n ; n cin.tie(0); n ; n long long int i, j, n, k, l, x, y, evenLeft = 0, oddLeft = 0, z; n cin >> n; n for (i = 1; i <= n; i++) { n cin >> arr[i]; n if (arr[i] != 0) done[arr[i]] = 1; n } n oddLeft = 0; n evenLeft = 0; n for (i = 1; i <= n; i++) { n if (done[i]) continue; n if (i & 1) n oddLeft++; n else n evenLeft++; n } n for (i = 1; i <= n; i++) cnt0[i] = cnt0[i - 1] + (arr[i] == 0); n for (i = 1; i <= n; i++) { n cnte[i] = cnte[i - 1]; n if (arr[i] != 0 && arr[i] % 2 == 0) cnte[i]++; n } n for (i = 1; i <= n; i++) { n cnto[i] = cnto[i - 1]; n if (arr[i] != 0 && arr[i] & 1) cnto[i]++; n } n for (i = 0; i <= n; i++) { n for (j = 0; j <= n; j++) { n for (k = 0; k <= 1; k++) dp[i][j][k] = 1000000000000; n } n } n if (arr[1] != 0) { n if (arr[1] & 1) n dp[1][evenLeft][1] = 0; n else n dp[1][evenLeft][0] = 0; n } else { n if (evenLeft > 0) dp[1][evenLeft - 1][0] = 0; n if (oddLeft > 0) dp[1][evenLeft][1] = 0; n } n for (i = 1; i < n; i++) { n for (j = 0; j <= evenLeft; j++) { n for (k = 0; k <= 1; k++) { n if (dp[i][j][k] == 1000000000000) continue; n x = cnt0[i]; n y = evenLeft - j; n z = oddLeft - (x - y); n if (arr[i + 1] != 0) { n if (arr[i + 1] % 2 == k) n dp[i + 1][j][arr[i + 1] % 2] = n min(dp[i + 1][j][arr[i + 1] % 2], dp[i][j][k]); n else n dp[i + 1][j][arr[i + 1] % 2] = n min(dp[i + 1][j][arr[i + 1] % 2], dp[i][j][k] + 1); n } else { n if (j > 0) { n if (k == 0) n dp[i + 1][j - 1][0] = min(dp[i + 1][j - 1][0], dp[i][j][k]); n else n dp[i + 1][j - 1][0] = min(dp[i + 1][j - 1][0], dp[i][j][k] + 1); n } n if (z > 0) { n if (k == 0) n dp[i + 1][j][1] = min(dp[i + 1][j][1], dp[i][j][k] + 1); n else n dp[i + 1][j][1] = min(dp[i + 1][j][1], dp[i][j][k]); n } n } n } n } n } n cout << min(dp[n][0][0], dp[n][0][1]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main(void) { n int t, n; n cin >> t; n string s; n for (int k = 0; k < t; k++) { n cin >> n; n cin >> s; n if (s.size() == 2) { n if (s[0] < s[1]) { n cout << YES n << n ; n cout << 2 << n ; n cout << s[0] << << s[1] << endl; n } else n cout << NO n << n ; n } else { n cout << YES n << n ; n cout << 2 << n ; n cout << s[0] << ; n for (int i = 1; i < s.size(); i++) cout << s[i]; n cout << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n long long int powmod(long long int a, int b, int n) { n long long int rm = 1; n while (b) { n if (b % 2) { n rm = (rm * a) % n; n } n a = (a * a) % n; n b /= 2; n } n return rm; n } n int main() { n int n; n long long int a[110]; n cin >> n; n for (int i = (int)1; i <= (int)n; i++) cin >> a[i]; n long long int cost = 0; n for (long long int i = 1; i <= n; ++i) { n cost = cost + (a[i] - 1) * i + 1; n } n cout << cost << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s, t; n int arr1[2222], arr2[2222]; n char ans[999999]; n long long int i, j, lo, hi, mid, cnt, sum, nd; n queue q; n int main() { n cin >> s >> t; n for (i = 0; i < t.size(); i++) { n arr2[(int)(t[i] - a )]++; n } n cnt = 0; n for (i = 0; i < s.size(); i++) { n if (s[i] == ? ) { n cnt++; n q.push(i); n } else n arr1[(int)(s[i] - a )]++; n } n lo = 0; n hi = 10000000; n while (lo <= hi) { n mid = (lo + hi) / 2; n sum = 0; n for (i = 0; i < 26; i++) { n nd = arr2[i] * mid; n nd -= arr1[i]; n if (nd < 0) nd = 0; n sum = sum + nd; n } n if (sum >= cnt) n hi = mid - 1; n else n lo = mid + 1; n } n mid++; n sum = 0; n for (i = 0; i < 26; i++) { n nd = arr2[i] * mid; n nd -= arr1[i]; n if (nd < 0) nd = 0; n sum = sum + nd; n } n if (sum > cnt) { n mid--; n sum = 0; n for (i = 0; i < 26; i++) { n nd = arr2[i] * mid; n nd -= arr1[i]; n if (nd < 0) nd = 0; n sum = sum + nd; n } n if (sum > cnt) mid--; n } n for (i = 0; i < 26; i++) { n arr2[i] = arr2[i] * mid; n if (arr2[i]) { n while (arr2[i]--) { n if (arr1[i]) n arr1[i]--; n else { n int u = q.front(); n q.pop(); n s[u] = (char)i + a ; n cnt--; n } n } n } n } n while (cnt--) { n int u = q.front(); n q.pop(); n s[u] = z ; n } n cout << s << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long gcd(long long a, long long b); n long long mpower(long long x, long long y, long long c); n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n map M; n vector aa; n set st; n set::iterator itr; n long long n, i, j, k; n cin >> n; n string s; n cin >> s; n long long cnt = 0; n for (i = n - 1; i >= 0; i--) { n long long flag = -1; n if (2 * (i + 1) <= n) { n for (j = i + 1; j < (2 * (i + 1)); j++) { n if (s[j] == s[j - 1 - i]) { n flag = 1; n } else { n flag = -1; n break; n } n } n } n if (flag == 1) { n i = -1; n } n cnt++; n } n cout << cnt; n return 0; n } n long long gcd(long long a, long long b) { n if (b == 0) { n return a; n } else { n return gcd(b, a % b); n } n } n long long mpower(long long x, long long y, long long c) { n long long res = 1; n while (y > 0) { n if (y & 1) res = (res * x) % c; n y = y >> 1; n x = (x * x) % c; n } n return res; n } n "} +{"func_code_string": "#include n using namespace std; n double shortestDisSq(double x1, double y1, double x2, double y2, double x, n double y) { n double magSq = pow(abs(x2 - x1), 2) + pow(abs(y2 - y1), 2); n double proj = ((x - x1) * (x2 - x1) + (y - y1) * (y2 - y1)) / magSq; n if (proj > 1) proj = 1; n if (proj < 0) proj = 0; n return pow(abs((x1 + proj * (x2 - x1)) - x), 2) + n pow(abs((y1 + proj * (y2 - y1)) - y), 2); n } n int main() { n int n; n double x, y; n cin >> n >> x >> y; n double p, q; n double op, oq, ip, iq; n const double PI = 3.141592653589793238463; n double dis; n double R2 = 0; n double r2 = 100000000000000; n for (int i = 0; i < n; i++) { n cin >> p >> q; n if (i == 0) { n ip = p; n iq = q; n } n if (i > 0) r2 = min(r2, shortestDisSq(p, q, op, oq, x, y)); n if (i == n - 1) r2 = min(r2, shortestDisSq(ip, iq, p, q, x, y)); n op = p; n oq = q; n dis = pow(abs(x - p), 2) + pow(abs(y - q), 2); n R2 = max(R2, dis); n } n double res = PI * (R2 - r2); n printf( %.8lf n , res); n return 0; n } n "} +{"func_code_string": "#include n #pragma comment(linker, /STACK:16777216 ) n using namespace std; n const long double pi = acos(-1.0); n const long double eps = 1e-6; n const int INF = 1E9; n const int MAXN = 5111; n struct node { n pair key; n int pr, cnt; n node *l, *r; n node(pair _key) { n key = _key; n pr = rand(); n cnt = 1; n l = r = NULL; n } n }; n int cnt(node *p) { return p ? p->cnt : 0; } n void upd_cnt(node *&p) { n if (p) p->cnt = 1 + cnt(p->l) + cnt(p->r); n } n void split(node *p, pair key, node *&l, node *&r) { n if (p == NULL) { n l = r = NULL; n return; n } n if (key < p->key) { n split(p->l, key, l, p->l); n r = p; n } else { n split(p->r, key, p->r, r); n l = p; n } n upd_cnt(p); n } n void merge(node *&p, node *l, node *r) { n if (l == NULL) n p = r; n else if (r == NULL) n p = l; n else if (l->pr < r->pr) { n p = l; n merge(l->r, l->r, r); n } else { n p = r; n merge(r->l, l, r->l); n } n upd_cnt(p); n } n void insert(pair key, int pr, node *&p) { n if (p == NULL) { n p = new node(key); n p->pr = pr; n return; n } n if (pr > p->pr) { n if (key > p->key) n insert(key, pr, p->r); n else n insert(key, pr, p->l); n } else { n node *t = new node(key); n t->pr = pr; n split(p, key, t->l, t->r); n p = t; n } n upd_cnt(p); n } n void erase(pair key, node *&p) { n if (p == NULL) return; n if (p->key == key) n merge(p, p->l, p->r); n else { n if (key < p->key) n erase(key, p->l); n else n erase(key, p->r); n } n upd_cnt(p); n } n int n, m; n vector color, used; n vector > g, queries; n vector > q; n vector root; n vector > lib; n vector ans, link; n void init() { n color.resize(n); n used.resize(n, 0); n root.resize(n, NULL); n g.resize(n); n queries.resize(n); n q.resize(m); n ans.resize(m); n link.resize(n); n lib.resize(n); n } n void intersect(int vid, int wid, node *&w) { n if (!w) return; n if (w->l) intersect(vid, wid, w->l); n if (w->r) intersect(vid, wid, w->r); n int ckey = w->key.second; n if (lib[link[vid]].find(ckey) == lib[link[vid]].end()) { n lib[link[vid]][ckey] = w->key.first; n insert(w->key, rand(), root[vid]); n } else { n erase(make_pair(lib[link[vid]][ckey], ckey), root[vid]); n w->key.first += lib[link[vid]][ckey]; n insert(w->key, rand(), root[vid]); n lib[link[vid]][ckey] = w->key.first; n } n lib[link[wid]].erase(ckey); n delete w; n } n void dfs(int v, int par) { n used[v] = 1; n for (int i = 0; i < (int)(g[v].size()); i++) { n int w = g[v][i]; n if (!used[w]) { n dfs(w, v); n } n } n if (v == 0) { n v = v; n } n int maxid = -1; n for (int i = 0; i < (int)(g[v].size()); i++) { n int w = g[v][i]; n if (w != par) { n if (maxid == -1 || cnt(root[w]) > cnt(root[maxid])) maxid = w; n } n } n if (maxid != -1) { n link[v] = link[maxid]; n root[v] = root[maxid]; n for (int i = 0; i < (int)(g[v].size()); i++) { n int w = g[v][i]; n if (w != par && w != maxid) { n intersect(v, w, root[w]); n } n } n if (lib[link[v]].find(color[v]) == lib[link[v]].end()) { n lib[link[v]][color[v]] = 1; n insert(make_pair(1, color[v]), rand(), root[v]); n } else { n erase(make_pair(lib[link[v]][color[v]], color[v]), root[v]); n lib[link[v]][color[v]]++; n insert(make_pair(lib[link[v]][color[v]], color[v]), rand(), root[v]); n } n } else { n root[v] = new node(make_pair(1, color[v])); n link[v] = v; n lib[link[v]][color[v]] = 1; n } n node *t1 = NULL, *t2 = NULL; n for (int i = 0; i < queries[v].size(); i++) { n int qid = queries[v][i]; n split(root[v], make_pair(q[qid].second, 0), t1, t2); n ans[qid] = cnt(t2); n merge(root[v], t1, t2); n } n } n int main() { n cin >> n >> m; n init(); n for (int i = 0; i < (int)(n); i++) cin >> color[i]; n for (int i = 0; i < (int)(n - 1); i++) { n int a, b; n scanf( %d%d , &a, &b); n a--, b--; n g[a].push_back(b); n g[b].push_back(a); n } n for (int i = 0; i < (int)(m); i++) { n cin >> q[i].first >> q[i].second; n q[i].first--; n queries[q[i].first].push_back(i); n } n dfs(0, 0); n for (int i = 0; i < (int)(m); i++) printf( %d n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n const int MAXN = 1100000; n char s[MAXN]; n int n; n bool check(int o) { n int p = 0; n int mx = 0; n bool uni = true; n for (int i = 0; i < n; i++) { n if (s[i] == L ) n p--; n else { n if (p < o - 1) p++; n } n if (p < mx) { n mx = p; n uni = true; n } else { n uni = false; n } n } n return uni; n } n int main() { n scanf( %s , s); n n = strlen(s); n if (s[n - 1] == R ) { n for (int i = 0; i < n; i++) { n s[i] = (s[i] == L ) ? R : L ; n } n } n if (check(n + 1)) { n printf( 1 ); n return 0; n } n int a = 1, b = n; n while (a <= b) { n int m = (a + b) / 2; n if (check(m)) { n a = m + 1; n } else { n b = m - 1; n } n } n printf( %d , a - 1); n } n "} +{"func_code_string": "#include n using namespace std; n bool primecheck(long long int a) { n bool check = true; n for (long long int i = 2; i <= sqrt(a); i++) { n if (a % i == 0) { n check = false; n break; n } n } n return (check); n } n vector printDivisors(long long int n) { n vector sol; n for (long long int i = 1; i <= sqrt(n); i++) { n if (n % i == 0) { n if (n / i == i) { n sol.push_back(i); n } else { n sol.push_back(i); n sol.push_back(n / i); n } n } n } n return (sol); n } n long long int digits(long long int a) { return (floor(log10(a)) + 1); } n long long binpow(long long a, long long b, long long m) { n a %= m; n long long res = 1; n while (b > 0) { n if (b & 1) res = res * a % m; n a = a * a % m; n b >>= 1; n } n return res; n } n int gcd(int a, int b) { n if (a == 0) return b; n if (b == 0) return a; n if (a == b) return a; n if (a > b) return gcd(a - b, b); n return gcd(a, b - a); n } n long long int lcm(long long int a, long long int b) { n return (a * b) / gcd(a, b); n } n bool check(string a, string b) { n long long int freq1[26] = {0}; n long long int i; n for (i = 0; i < a.size(); i++) { n freq1[a[i] - a ]++; n } n for (i = 0; i < b.size(); i++) { n freq1[b[i] - a ]--; n } n bool sol = true; n for (i = 0; i < 26; i++) n if (freq1[i] != 0) sol = false; n return (sol); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long int a, b, c, i, j, k, l, m, n, t; n cin >> t; n while (t--) { n string num1, num2; n cin >> num1 >> num2; n bool sol; n long long int size1 = num1.size(); n long long int size2 = num2.size(); n if (size2 < size1) { n cout << NO n << n ; n } else { n sol = false; n for (i = 0; i <= size2 - size1; i++) { n string fresh = num1; n for (j = 0; j < size1; j++) { n fresh[j] = num2[i + j]; n } n if (check(num1, fresh)) { n cout << YES n << n ; n sol = true; n break; n } n } n if (!sol) n cout << NO n << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100005; n const int INF = 0x3f3f3f3f; n const double pi = acos(-1.0); n const double eps = 1e-9; n template n inline void read(T &x) { n int c; n for (c = getchar(); c < 32 && ~c; c = getchar()) n ; n for (x = 0; c > 32; x = x * 10 + c - 0 , c = getchar()) n ; n } n int n, m; n int chu[maxn]; n vector g[maxn]; n priority_queue q; n int ind; n int lab[maxn]; n int main() { n read(n), read(m); n int u, v; n for (int i = 0; i < m; i++) { n read(v), read(u); n g[u].emplace_back(v); n chu[v]++; n } n ind = n; n for (int i = 1; i <= n; i++) { n if (chu[i] == 0) { n q.emplace(i); n } n } n while (!q.empty()) { n int x = q.top(); n q.pop(); n lab[x] = ind--; n for (auto &i : g[x]) { n chu[i]--; n if (chu[i] == 0) q.emplace(i); n } n } n for (int i = 1; i <= n; i++) { n cout << lab[i] << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MOD = 1e9 + 7; n const int MX = 2e5 + 5; n const long long INF = 1e18; n const long double PI = 4 * atan((long double)1); n template n bool ckmin(T& a, const T& b) { n return a > b ? a = b, 1 : 0; n } n template n bool ckmax(T& a, const T& b) { n return a < b ? a = b, 1 : 0; n } n mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); n namespace input { n template n void re(complex& x); n template n void re(pair& p); n template n void re(vector& a); n template n void re(array& a); n template n void re(T& x) { n cin >> x; n } n void re(double& x) { n string t; n re(t); n x = stod(t); n } n void re(long double& x) { n string t; n re(t); n x = stold(t); n } n template n void re(T& t, Ts&... ts) { n re(t); n re(ts...); n } n template n void re(complex& x) { n T a, b; n re(a, b); n x = cd(a, b); n } n template n void re(pair& p) { n re(p.first, p.second); n } n template n void re(vector& a) { n for (int i = (0); i < ((int)a.size()); ++i) re(a[i]); n } n template n void re(array& a) { n for (int i = (0); i < (SZ); ++i) re(a[i]); n } n } // namespace input n using namespace input; n namespace output { n void pr(int x) { cout << x; } n void pr(long x) { cout << x; } n void pr(long long x) { cout << x; } n void pr(unsigned x) { cout << x; } n void pr(unsigned long x) { cout << x; } n void pr(unsigned long long x) { cout << x; } n void pr(float x) { cout << x; } n void pr(double x) { cout << x; } n void pr(long double x) { cout << x; } n void pr(char x) { cout << x; } n void pr(const char* x) { cout << x; } n void pr(const string& x) { cout << x; } n void pr(bool x) { pr(x ? true : false ); } n template n void pr(const complex& x) { n cout << x; n } n template n void pr(const pair& x); n template n void pr(const T& x); n template n void pr(const T& t, const Ts&... ts) { n pr(t); n pr(ts...); n } n template n void pr(const pair& x) { n pr( { , x.first, , , x.second, } ); n } n template n void pr(const T& x) { n pr( { ); n bool fst = 1; n for (const auto& a : x) pr(!fst ? , : , a), fst = 0; n pr( } ); n } n void ps() { pr( n ); } n template n void ps(const T& t, const Ts&... ts) { n pr(t); n if (sizeof...(ts)) pr( ); n ps(ts...); n } n void pc() { pr( ] n ); } n template n void pc(const T& t, const Ts&... ts) { n pr(t); n if (sizeof...(ts)) pr( , ); n pc(ts...); n } n } // namespace output n using namespace output; n namespace io { n void setIn(string second) { freopen(second.c_str(), r , stdin); } n void setOut(string second) { freopen(second.c_str(), w , stdout); } n void setIO(string second = ) { n cin.sync_with_stdio(0); n cin.tie(0); n if ((int)second.size()) { n setIn(second + .in ), setOut(second + .out ); n } n } n } // namespace io n using namespace io; n typedef decay::type T; n struct mi { n T val; n explicit operator T() const { return val; } n mi() { val = 0; } n mi(const long long& v) { n val = (-MOD <= v && v <= MOD) ? v : v % MOD; n if (val < 0) val += MOD; n } n friend void pr(const mi& a) { pr(a.val); } n friend void re(mi& a) { n long long x; n re(x); n a = mi(x); n } n friend bool operator==(const mi& a, const mi& b) { return a.val == b.val; } n friend bool operator!=(const mi& a, const mi& b) { return !(a == b); } n friend bool operator<(const mi& a, const mi& b) { return a.val < b.val; } n mi operator-() const { return mi(-val); } n mi& operator+=(const mi& m) { n if ((val += m.val) >= MOD) val -= MOD; n return *this; n } n mi& operator-=(const mi& m) { n if ((val -= m.val) < 0) val += MOD; n return *this; n } n mi& operator*=(const mi& m) { n val = (long long)val * m.val % MOD; n return *this; n } n friend mi pow(mi a, long long p) { n mi ans = 1; n assert(p >= 0); n for (; p; p /= 2, a *= a) n if (p & 1) ans *= a; n return ans; n } n friend mi inv(const mi& a) { n assert(a != 0); n return pow(a, MOD - 2); n } n mi& operator/=(const mi& m) { return (*this) *= inv(m); } n friend mi operator+(mi a, const mi& b) { return a += b; } n friend mi operator-(mi a, const mi& b) { return a -= b; } n friend mi operator*(mi a, const mi& b) { return a *= b; } n friend mi operator/(mi a, const mi& b) { return a /= b; } n }; n int n, ways; n string g[2000]; n pair ans = {MOD, MOD}; n bool check(vector deg) { n vector v; n for (int i = (0); i < (n); ++i) v.push_back(deg[i]); n sort(begin(v), end(v)); n int sum = 0; n for (int i = (0); i < ((int)v.size() - 1); ++i) { n sum += v[i]; n if (sum == i * (i + 1) / 2) return 0; n } n return 1; n } n int main() { n cin.sync_with_stdio(0); n cin.tie(0); n re(n); n vector deg(n); n for (int i = (0); i < (n); ++i) { n re(g[i]); n for (int j = (0); j < (n); ++j) n if (g[i][j] == 1 ) deg[i]++; n } n if (check(deg)) { n ps(0, 1); n exit(0); n } n for (int i = (0); i < (n); ++i) { n for (int j = (0); j < (n); ++j) n if (i != j) { n if (g[i][j] == 0 ) { n deg[j]--; n deg[i]++; n } else { n deg[j]++; n deg[i]--; n } n } n ways += check(deg); n for (int j = (0); j < (n); ++j) n if (i != j) { n if (g[i][j] == 0 ) { n deg[j]++; n deg[i]--; n } else { n deg[j]--; n deg[i]++; n } n } n } n if (ways) n ps(1, ways); n else { n assert(n <= 6); n pair ans = {MOD, MOD}; n for (int i = (0); i < (1 << n); ++i) { n vector deg(n); n for (int j = (0); j < (n); ++j) n for (int k = (0); k < (n); ++k) n if (j != k) { n int ori = g[j][k] - 0 ; n if (i & (1 << j)) ori ^= 1; n if (i & (1 << k)) ori ^= 1; n deg[j] += ori; n } n int p = __builtin_popcount(i); n if (check(deg)) { n if (p < ans.first) ans = {p, 0}; n if (p == ans.first) ans.second++; n } n } n if (ans.first == MOD) { n ps(-1); n exit(0); n } n for (int i = (1); i < (ans.first + 1); ++i) ans.second *= i; n ps(ans.first, ans.second); n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000000007LL; n long long dp[64]; n long long solve(long long k) { n if (dp[k] != -1) return dp[k]; n if (k == 0) return 1LL; n return ((16LL * solve(k - 1) % mod) * (solve(k - 1) % mod) % mod + mod) % mod; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long k; n cin >> k; n for (int i = (0); i < (64); i++) dp[i] = -1; n cout << ((6LL * solve(k - 1)) % mod + mod) % mod << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, A[100], B[100], t, r, x; n string s = ; n int main() { n cin >> n; n for (int i = 0; i <= n; i++) { n r = 0; n for (int j = 0; j <= n; j++) { n if ((t + r) == n) { n x = 1; n break; n } n r = r + 7; n } n if (x == 1) break; n t = t + 4; n } n if (x == 1) { n for (int i = 0; i < t / 4; i++) s += 4 ; n for (int i = 0; i < r / 7; i++) s += 7 ; n } else { n s = -1 ; n } n cout << s; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = 3.14159265; n void fastInOut(); n const int N = 5003; n const long long OO = (long long)1e18; n int n, m, k; n long long cum[N], memo[N][N]; n long long go(int i, int c) { n if (i == n + 1) return c == k ? 0 : -OO; n long long &ret = memo[i][c]; n if (ret != -1) return ret; n ret = go(i + 1, c); n if (i + m <= n + 1) n ret = max(ret, cum[i + m - 1] - cum[i - 1] + go(i + m, c + 1)); n return ret; n } n int main() { n fastInOut(); n cin >> n >> m >> k; n for (int i = 1; i <= n; i++) { n cin >> cum[i]; n cum[i] += cum[i - 1]; n } n memset(memo, -1, sizeof(memo)); n cout << go(1, 0); n return 0; n } n void fastInOut() { n ios_base::sync_with_stdio(0); n cin.tie(NULL), cout.tie(NULL); n } n "} +{"func_code_string": "#include n using namespace std; n long long int arr[100005]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n cin >> n; n long long int sum = 0; n for (int i = 0; i < n; ++i) { n cin >> arr[i]; n sum = sum + arr[i]; n } n if (sum & 1) { n cout << NO << endl; n return 0; n } n sum = sum / 2; n multiset m1, m2; n for (int i = 0; i < n; ++i) { n m2.insert(arr[i]); n } n for (int i = 0; i < n; ++i) { n m1.insert(arr[i]); n m2.erase(m2.find(arr[i])); n sum = sum - arr[i]; n if (sum == 0 || m1.find(-sum) != m1.end() || m2.find(sum) != m2.end()) { n cout << YES << endl; n return 0; n } n } n cout << NO << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int powmod(int a, int p, int m) { n int64_t ans = 1, cp = a; n for (int i = 0; (1ll << i) <= p; ++i, cp = cp * cp % m) n if ((1ll << i) & p) ans = ans * cp % m; n return ans; n } n int divmod(int64_t a, int b, int m) { return a * powmod(b, m - 2, m) % m; } n const int N = 200000; n int a[N], t[N], b[N], n, m; n unordered_set pres; n vector s; n double et; n pair solve() { n { n if (n > 2) n if (rand() & 1) n swap(a[0], a[rand() % (n - 2) + 2]), n swap(a[1], a[rand() % (n - 2) + 2]); n else n swap(a[1], a[rand() % (n - 2) + 2]), n swap(a[0], a[rand() % (n - 2) + 2]); n s.clear(); n for (int i = 0; i < n; ++i) s.push_back((a[i] - a[0] + m) % m); n sort(begin(s), end(s)); n int dst = 0; n for (int i = 0; i < n; ++i) { n auto t = lower_bound(begin(s), end(s), (a[i] - a[1] + m) % m); n if (t == s.end() || *t != (a[i] - a[1] + m) % m) dst++; n } n int d = divmod((a[1] - a[0] + m) % m, dst, m), heads = 0; n for (int i = 0; i < n; ++i) heads += !pres.count((a[i] + d) % m); n if (!~-heads) n for (int i = 0; i < n; ++i) n if (!pres.count((a[i] + d) % m)) return {a[i], (m - d) % m}; n } n return {-1, -1}; n } n int main() { n srand(101); n cin.tie(0), ios::sync_with_stdio(0); n int comp = 0; n cin >> m >> n; n for (int i = 0; i < n; ++i) cin >> a[i]; n if (n == 1 || n == m) return cout << a[0] << << 1, 0; n if (n > m - n) { n sort(a, a + n); n for (int i = 0; i < m; ++i) t[i] = i; n memcpy(a, b, (set_difference(t, t + m, a, a + n, b) - b) * sizeof *b); n comp = 1; n n = m - n; n } n for (int i = 0; i < n; ++i) pres.insert(a[i]); n random_shuffle(a, a + n); n auto ans = solve(); n if (!~ans.first) n cout << -1 ; n else if (!comp) n cout << ans.first << << ans.second << n ; n else n cout << (ans.first - ans.second + m) % m << << (m - ans.second) % m n << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int q; n cin >> q; n while (q--) { n int n; n cin >> n; n vector p(n); n int id = -1; n for (int i = 0; i < n; ++i) { n cin >> p[i]; n if (p[i] == 1) id = i; n } n bool f1 = 0, f2 = 0; n int val = 0; n for (int i = id, j = 0; j < n; ++i, ++j) { n ++val; n if (p[i % n] != val) f1 = 1; n } n val = 0; n for (int i = id, j = 0; j < n; --i, ++j) { n ++val; n if (i < 0) i += n; n if (p[i % n] != val) f2 = 1; n } n if (f1 == 0 || f2 == 0) n cout << YES n ; n else n cout << NO n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e5 + 5; n int f[11][11][4][maxn]; n int n; n char s[maxn]; n char c[maxn]; n int lowbit(int x) { return x & (-x); } n int ch(char s) { n if (s == A ) n return 1; n else if (s == T ) n return 2; n else if (s == G ) n return 3; n else if (s == C ) n return 4; n return -1; n } n void Add(int *tr, int x, int d) { n for (; x <= n; x += lowbit(x)) { n tr[x] += d; n } n } n int Sum(int *tr, int x) { n if (x == 0) return 0; n int s = 0; n while (x) { n s += tr[x]; n x -= lowbit(x); n } n return s; n } n int main() { n scanf( %s , s + 1); n n = strlen(s + 1); n for (int i = 1; i <= n; i++) n for (int j = 1; j <= 10; j++) Add(f[j][i % j][ch(s[i])], i, 1); n int q, x, d, l, r; n scanf( %d , &q); n while (q--) { n scanf( %d , &x); n if (x == 1) { n scanf( %d%s , &d, c); n for (int i = 1; i <= 10; i++) { n Add(f[i][d % i][ch(s[d])], d, -1); n } n s[d] = c[0]; n for (int i = 1; i <= 10; i++) Add(f[i][d % i][ch(s[d])], d, 1); n } else { n scanf( %d %d %s , &l, &r, c); n int len = strlen(c); n int ans = 0; n for (int i = 0; i < len; i++) { n ans += Sum(f[len][(l + i) % len][ch(c[i])], r) - n Sum(f[len][(l + i) % len][ch(c[i])], l - 1); n } n printf( %d n , ans); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long dp[55][55]; n double comb[55]; n int a[55]; n int main(int argc, char **argv) { n int n, p; n int tot = 0; n double res = 0; n cin >> n; n for (int i = 0; i < n; i++) { n cin >> a[i]; n tot += a[i]; n } n cin >> p; n if (tot <= p) { n cout << n << endl; n return 0; n } n comb[0] = 1; n for (int i = 1; i <= n; i++) comb[i] = comb[i - 1] * i; n for (int block = 0; block < n; block++) { n memset(dp, 0, sizeof(dp)); n dp[0][0] = 1; n for (int i = 0; i < n; i++) { n if (i == block) continue; n for (int j = p - a[i]; j >= 0; j--) { n for (int k = 0; k < n - 1; k++) { n dp[j + a[i]][k + 1] += dp[j][k]; n } n } n } n for (int i = 0; i <= p; i++) { n if (a[block] + i > p) { n for (int j = 1; j <= n - 1; j++) { n res += j * dp[i][j] * comb[j] * comb[n - 1 - j] / comb[n]; n } n } n } n } n cout << res << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n int x1, y1, x2, y2; n int sum = 0; n for (int i = 0; i < n; ++i) { n cin >> x1 >> y1 >> x2 >> y2; n sum += (abs(x2 - x1) + 1) * (abs(y2 - y1) + 1); n } n cout << sum; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n bool good[n]; n for (int i = 0; i < n; i++) good[i] = 1; n for (int i = 0; i < n; i++) { n int isGood = 1; n for (int j = 0; j < n; j++) { n int dum; n cin >> dum; n if (dum == 1 || dum == 3) n good[i] = 0; n else if (dum == 2) n good[j] = 0; n } n } n int ans = 0; n for (int i = 0; i < n; i++) n if (good[i]) ans++; n cout << ans << endl; n for (int i = 0; i < n; i++) { n if (good[i]) cout << i + 1 << ; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, s, i, v = 0, a[1010]; n cin >> n >> s; n for (i = 1; i <= n; i++) { n cin >> a[i]; n v = v + a[i]; n } n for (i = 1; i <= n; i++) n if ((v - a[i]) <= s) { n cout << YES ; n return 0; n } n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[100005], b[100005]; n int main() { n int n, m, i; n long long sum = 0; n scanf( %d%d , &n, &m); n for (i = 1; i <= m; i++) { n scanf( %d , &a[i]); n sum += a[i]; n if (a[i] + i > n + 1) { n printf( -1 ); n return 0; n } n } n if (sum < n) { n printf( -1 ); n return 0; n } n b[m + 1] = 100005; n for (i = m; i; i--) { n b[i] = min(n - a[i] + 1, b[i + 1] - 1); n } n b[1] = 1; n for (i = 2; i <= m; i++) { n if (b[i - 1] + a[i - 1] >= b[i]) { n break; n } n b[i] = b[i - 1] + a[i - 1]; n } n for (i = 1; i <= m; i++) { n printf( %d , b[i]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 200005; n int n, m, in[N], out[N], id[N], dep[N]; n vector v[N]; n int idx; n void dfs(int pos, int dd) { n in[pos] = ++idx; n id[idx] = pos; n dep[idx] = dd; n for (auto &i : v[pos]) dfs(i, dd + 1); n out[pos] = ++idx; n id[idx] = pos; n dep[idx] = dd; n } n int fa[N], ch[N][2], mn[N], mx[N], val[N], sz[N]; n inline void pushup(int x) { n sz[x] = sz[ch[x][0]] + sz[ch[x][1]] + 1; n mn[x] = mx[x] = dep[x]; n mn[x] = min({mn[x], mn[ch[x][0]], mn[ch[x][1]]}); n mx[x] = max({mx[x], mx[ch[x][0]], mx[ch[x][1]]}); n } n int build(int l, int r) { n int mid = (l + r) >> 1, x = mid; n if (l < mid) ch[x][0] = build(l, mid - 1), fa[ch[x][0]] = x; n if (mid < r) ch[x][1] = build(mid + 1, r), fa[ch[x][1]] = x; n pushup(x); n return x; n } n inline void push(int x, int v) { n val[x] += v; n dep[x] += v; n mn[x] += v; n mx[x] += v; n } n inline void pushdown(int x) { n if (val[x]) { n if (ch[x][0]) push(ch[x][0], val[x]); n if (ch[x][1]) push(ch[x][1], val[x]); n val[x] = 0; n } n } n inline bool sd(int x) { return ch[fa[x]][1] == x; } n void rotate(int x) { n int y = fa[x], z = fa[y], k = sd(x); n if (z) ch[z][sd(y)] = x; n fa[x] = z; n fa[y] = x; n if (ch[x][!k]) fa[ch[x][!k]] = y; n ch[y][k] = ch[x][!k]; n ch[x][!k] = y; n pushup(y); n pushup(x); n } n void splay(int x, int target = 0) { n static int stk[N], ptr; n stk[ptr = 1] = x; n int tmp = x; n while (fa[tmp] != target) stk[++ptr] = tmp = fa[tmp]; n while (ptr) pushdown(stk[ptr--]); n while (fa[x] != target) { n int y = fa[x]; n if (fa[y] != target) rotate(sd(x) == sd(y) ? y : x); n rotate(x); n } n pushup(x); n } n int kth(int x, int kk) { n pushdown(x); n if (mn[ch[x][1]] <= kk && mx[ch[x][1]] >= kk) return kth(ch[x][1], kk); n if (dep[x] == kk) { n splay(x); n return id[x]; n } n return kth(ch[x][0], kk); n } n inline int split(int l, int r) { n splay(l); n splay(r, l); n return ch[r][0]; n } n int pre(int x) { n splay(x); n x = ch[x][0]; n while (ch[x][1]) x = ch[x][1]; n splay(x); n return x; n } n int suf(int x) { n splay(x); n x = ch[x][1]; n while (ch[x][0]) x = ch[x][0]; n splay(x); n return x; n } n int erase(int l, int r) { n int lp = pre(l), rp = suf(r), p = split(lp, rp), v = fa[p]; n ch[v][0] = fa[p] = 0; n return p; n } n int main() { n ios::sync_with_stdio(false); n cin >> n >> m; n for (int i = 1; i <= n; i++) { n int kk; n cin >> kk; n v[i].resize(kk); n for (int j = 0; j < kk; j++) cin >> v[i][j]; n } n mn[0] = INT_MAX >> 1; n dfs(1, 0); n build(1, idx); n while (m--) { n int op; n cin >> op; n if (op == 1) { n int t1, t2; n cin >> t1 >> t2; n splay(in[t1]); n int rk1 = sz[ch[in[t1]][0]] + 1, ans = dep[in[t1]]; n splay(in[t2]); n int rk2 = sz[ch[in[t2]][0]] + 1; n ans += dep[in[t2]]; n if (rk1 > rk2) swap(t1, t2); n t1 = split(in[t1], out[t2]); n ans -= (mn[t1] - 1) * 2; n cout << ans << endl; n } else if (op == 2) { n int t1, t2; n cin >> t1 >> t2; n int val = t2 - 1; n splay(in[t1]); n t2 = kth(ch[in[t1]][0], dep[in[t1]] - t2); n t1 = erase(in[t1], out[t1]); n push(t1, -val); n int xx = pre(out[t2]); n splay(xx); n splay(out[t2], xx); n ch[out[t2]][0] = t1; n fa[t1] = out[t2]; n pushup(out[t2]); n pushup(xx); n } else { n int k; n cin >> k; n splay(1); n cout << kth(1, k) << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k; n vector adj[(int)1e5 + 7]; n int vis[(int)1e5 + 7]; n int deg[(int)1e5 + 7]; n int cnt[(int)1e5 + 7]; n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n ; n scanf( %d %d , &n, &k); n for (int i = 1; i <= n - 1; i++) { n int u, v; n scanf( %d %d , &u, &v); n adj[u].push_back(v); n adj[v].push_back(u); n deg[v]++; n deg[u]++; n } n int lvl = 0; n queue q; n for (int i = 1; i <= n; i++) n if (deg[i] == 1) q.push(i); n while (q.size()) { n set kroots; n int sz = q.size(); n while (sz--) { n int root = q.front(); n q.pop(); n vis[root] = 1; n for (auto neighbour : adj[root]) { n if (vis[neighbour]) { n continue; n } n deg[neighbour]--; n cnt[neighbour]++; n kroots.insert(neighbour); n } n } n for (auto val : kroots) { n if (vis[val] || deg[val] > 1 || cnt[val] < 3) { n puts( No ); n return 0; n } n q.push(val); n } n if (kroots.size()) n lvl++; n else n break; n } n if (lvl == k) n puts( Yes ); n else n puts( No ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1000000007; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t, n, m, a, b, c, q, k, d, x; n cin >> n >> m; n vector> mat(n + 1, vector(m + 1)), n ans(n + 1, vector(m + 1)); n char ch; n for (int i = 1; i < n + 1; i++) { n for (int j = 1; j < m + 1; j++) { n cin >> ch; n mat[i][j] = ch - 0 ; n ans[i][j] = ans[i - 1][j] + ans[i][j - 1] - ans[i - 1][j - 1] + mat[i][j]; n } n } n a = 0; n for (int i = 1; i < n + 1; i++) { n for (int j = 1; j < m + 1; j++) { n for (int i_ = i; i_ < n + 1; i_++) { n for (int j_ = j; j_ < m + 1; j_++) { n if (ans[i_][j_] - ans[i - 1][j_] - ans[i_][j - 1] + n ans[i - 1][j - 1] == n 0) { n a = max(a, 2 * (i_ - i + 1 + j_ - j + 1)); n } n } n } n } n } n cout << a << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n double EPS = 1e-9; n long long INF = 1000000000000000005ll; n double PI = acos(-1); n inline string IntToString(long long int a) { n char x[100]; n sprintf(x, %lld , a); n string s = x; n return s; n } n inline long long int StringToInt(string a) { n char x[100]; n long long int res; n strcpy(x, a.c_str()); n sscanf(x, %lld , &res); n return res; n } n inline string uppercase(string s) { n int n = (int)s.size(); n for (long long int i = 0; i < n; i++) n if (s[i] >= a && s[i] <= z ) s[i] = s[i] - a + A ; n return s; n } n inline string lowercase(string s) { n int n = (int)s.size(); n for (long long int i = 0; i < n; i++) n if (s[i] >= A && s[i] <= Z ) s[i] = s[i] - A + a ; n return s; n } n bool sortcol(const vector& v1, const vector& v2) { n return v1[0] > v2[0]; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long int n; n cin >> n; n long long int c[n]; n string r[n]; n string s[n]; n for (long long int i = 0; i < n; i++) cin >> c[i]; n for (long long int i = 0; i < n; i++) { n cin >> r[i]; n s[i] = r[i]; n reverse(r[i].begin(), r[i].end()); n } n long long int dp[n + 1][2]; n memset(dp, 0, sizeof(dp)); n dp[0][1] = c[0]; n for (long long int i = 1; i < n; i++) { n dp[i][0] = INF; n dp[i][1] = INF; n if (s[i] >= s[i - 1]) { n dp[i][0] = min(dp[i - 1][0], dp[i][0]); n } n if (s[i] >= r[i - 1]) { n dp[i][0] = min(dp[i - 1][1], dp[i][0]); n } n if (r[i] >= s[i - 1]) { n dp[i][1] = min(dp[i - 1][0] + c[i], dp[i][1]); n } n if (r[i] >= r[i - 1]) { n dp[i][1] = min(dp[i - 1][1] + c[i], dp[i][1]); n } n } n long long int mi = min(dp[n - 1][0], dp[n - 1][1]); n if (mi != INF) n cout << min(dp[n - 1][0], dp[n - 1][1]) << n ; n else n cout << -1 << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline T Min(T x, T y) { n return x < y ? x : y; n } n template n inline T Max(T x, T y) { n return x > y ? x : y; n } n bool MOP1; n long long T, n, res; n long long head[(105)], nxt[(105)], to[(105)], line; n void add(long long x, long long y) { n nxt[++line] = head[x], to[line] = y, head[x] = line; n } n struct node { n string name; n long long lei, X, Y; n long long tot, mx; n long long sz, bo, sp; n long long x() { n if (lei == 2) return sz ? tot + bo * 2 + (sz - 1) * sp : 0; n if (lei == 3) return sz ? mx + bo * 2 : 0; n } n long long y() { n if (lei == 2) return sz ? mx + bo * 2 : 0; n if (lei == 3) return sz ? tot + bo * 2 + (sz - 1) * sp : 0; n } n void add(node now) { n sz++; n if (lei == 2) { n tot += now.X; n mx = Max(mx, now.Y); n } else if (lei == 3) { n tot += now.Y; n mx = Max(mx, now.X); n } n } n bool operator<(const node &a) const { return name < a.name; } n } A[(105)]; n long long read(string k) { n long long res = 0; n for (long long i = 0; i < k.size(); i++) n res = (res << 1) + (res << 3) + (k[i] ^ 48); n return res; n } n map mp; n string str; n long long a, b; n bool mark[(105)]; n void dfs(long long x) { n mark[x] = 1; n for (long long i = head[x]; i; i = nxt[i]) { n long long y = to[i]; n if (!mark[y]) dfs(y), mark[y] = 1; n A[x].add(A[y]); n } n if (A[x].lei != 1) { n A[x].X = A[x].x(); n A[x].Y = A[x].y(); n } n return; n } n bool MOP2; n signed main() { n scanf( %d , &T); n while (T--) { n cin >> str; n if (str[0] == W ) { n getchar(); n getline(cin, str, ( ); n mp[str] = ++n; n A[n].lei = 1; n A[n].name = str; n scanf( %d,%d) , &A[n].X, &A[n].Y); n } else if (str[0] == H ) { n cin >> str; n mp[str] = ++n; n A[n].name = str; n A[n].lei = 2; n } else if (str[0] == V ) { n cin >> str; n mp[str] = ++n; n A[n].name = str; n A[n].lei = 3; n } else { n res = str.find( . ); n a = mp[str.substr(0, res)]; n if (str[res + 1] == s ) { n long long now = str.find( ( ) + 1; n long long tmp = read(str.substr(now, str.size() - now - 1)); n if (str[res + 5] == b ) { n A[a].bo = tmp; n } else if (str[res + 5] == s ) { n A[a].sp = tmp; n } n } else { n b = mp[str.substr(res + 6, str.size() - res - 7)]; n add(a, b); n } n } n } n for (long long i = 1; i <= n; i++) n if (!mark[i]) dfs(i); n sort(A + 1, A + 1 + n); n for (long long i = 1; i <= n; i++) n cout << A[i].name << << A[i].X << << A[i].Y << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const double EPS = 1e-9; n inline int cmp(double x, double y = 0, double tol = EPS) { n return ((x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1); n } n struct point { n long long x, y; n point(long long x = 0, long long y = 0) : x(x), y(y) {} n point operator+(point q) { return point(x + q.x, y + q.y); } n point operator-(point q) { return point(x - q.x, y - q.y); } n int cmp(point q) const { n if (int t = ::cmp(x, q.x)) return t; n return ::cmp(y, q.y); n } n bool operator==(point q) const { return cmp(q) == 0; }; n bool operator!=(point q) const { return cmp(q) != 0; }; n bool operator<(point q) const { return cmp(q) < 0; }; n }; n ostream &operator<<(ostream &os, const point &p) { n os << ( << p.x << , << p.y << ) ; n } n long long dot(point a, point b) { return a.x * b.x + a.y * b.y; } n long long cross(point a, point b) { return a.x * b.y - a.y * b.x; } n long long abs2(point a) { return dot(a, a); } n bool collinear(point a, point b, point c) { n return cmp(cross((b - a), (c - a))) == 0; n } n int ccw(point a, point b, point p) { return cmp(cross((b - a), (p - a))); } n point pivot; n bool radial_lt(point a, point b) { n int R = ccw(pivot, a, b); n if (R == 0) n return dot(pivot - a, pivot - a) < dot(pivot - b, pivot - b); n else n return (R == 1); n } n vector convexhull(vector T) { n sort(T.begin(), T.end()); n T.resize(unique(T.begin(), T.end()) - T.begin()); n int tam = 0, n = T.size(); n vector U; n int idx = min_element(T.begin(), T.end()) - T.begin(); n pivot = T[idx]; n swap(T[0], T[idx]); n sort(++T.begin(), T.end(), radial_lt); n for (int i = 0; i < T.size(); i++) { n while (tam > 1 && ccw(U[tam - 2], U[tam - 1], T[i]) <= 0) n U.pop_back(), tam--; n U.push_back(T[i]); n tam++; n } n return U; n } n void show(pair, pair > s) { n cout << s.first.first << << s.first.second << << s.second.first << n << s.second.second << endl; n } n int least_rot( n vector, pair > > n second) { n int n = second.size(); n for (int i = (0); i < (n); i++) second.push_back(second[i]); n vector f(second.size(), -1); n int k = 0; n for (int j = 1; j < second.size(); j++) { n pair, pair > sj = n second[j]; n int i = f[j - k - 1]; n while (i != -1 && sj != second[k + i + 1]) { n if (sj < second[k + i + 1]) k = j - i - 1; n i = f[i]; n } n if (sj != second[k + i + 1]) { n if (sj < second[k]) k = j; n f[j - k] = -1; n } else n f[j - k] = i + 1; n } n return k; n } n int main() { n int n, m; n scanf( %d %d , &n, &m); n vector A(n), B(m); n point p; n for (int i = (0); i < (n); i++) { n scanf( %lld %lld , &p.x, &p.y); n A[i] = p; n } n for (int i = (0); i < (m); i++) { n scanf( %lld %lld , &p.x, &p.y); n B[i] = p; n } n A = convexhull(A); n B = convexhull(B); n n = A.size(); n m = B.size(); n if (n != m) { n cout << NO n ; n return 0; n } n vector, pair > > AA, BB; n point esq, dir; n int ee, dd; n for (int i = (0); i < (n); i++) { n ee = i - 1; n if (ee < 0) ee += n; n dd = i + 1; n if (dd >= n) dd %= n; n esq = A[ee] - A[i], dir = A[dd] - A[i]; n AA.push_back(make_pair(make_pair(cross(esq, dir), dot(esq, dir)), n make_pair(abs2(esq), abs2(dir)))); n } n for (int i = (0); i < (n); i++) { n ee = i - 1; n if (ee < 0) ee += n; n dd = i + 1; n if (dd >= n) dd %= n; n esq = B[ee] - B[i], dir = B[dd] - B[i]; n BB.push_back(make_pair(make_pair(cross(esq, dir), dot(esq, dir)), n make_pair(abs2(esq), abs2(dir)))); n } n int u = least_rot(AA); n int v = least_rot(BB); n bool ok = true; n for (int i = (0); i < (n); i++) { n if (AA[u] != BB[v]) { n ok = false; n break; n } n u = (u + 1) % n; n v = (v + 1) % n; n } n if (ok) n cout << YES n ; n else n cout << NO n ; n return 0; n } n "} +{"func_code_string": "#include n const int mx = 110; n int a[mx]; n bool ok(char ch) { n if (ch == a || ch == e || ch == i || ch == o || ch == u || n ch == y ) n return true; n return false; n } n int main() { n int n; n bool flag = 1; n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %d , &a[i]); n getchar(); n for (int i = 0; i < n; i++) { n int num = 0; n char c; n while ((c = getchar()) != n ) n if (ok(c)) num++; n if (num != a[i]) flag = 0; n } n printf(flag ? YES n : NO n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100 + 2, maxm = 1e7 + 5; n struct node { n int bg, ed, id; n } a[maxn]; n int n, ans[maxn]; n bool vis[maxm]; n bool cmp(node a, node b) { return a.ed < b.ed; } n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d %d , &a[i].bg, &a[i].ed); n a[i].id = i; n } n sort(a, a + n, cmp); n for (int i = 0; i < n; i++) { n int y = a[i].bg; n while (vis[y]) y++; n vis[y] = true; n ans[a[i].id] = y; n } n for (int i = 0; i < n; i++) printf( %d , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void __f(const char* name, Arg1&& arg1) { n cerr << name << : << arg1 << std::endl; n } n template n void __f(const char* names, Arg1&& arg1, Args&&... args) { n const char* comma = strchr(names + 1, , ); n cerr.write(names, comma - names) << : << arg1 << | ; n __f(comma + 1, args...); n } n const int N = 1e6 + 10; n const int mod = 1e9 + 7; n int root; n vector > g; n vector ans; n int sub[N], t[N]; n void dfs0(int v, int p) { n sub[v] = t[v]; n for (auto u : g[v]) { n if (u != p) { n dfs0(u, v); n sub[v] += sub[u]; n } n } n return; n } n int dfs1(int v, int p) { n int ret = -1, temp; n if ((v != root) && 3 * sub[v] == sub[root]) { n ret = v; n } n vector ans; n for (auto u : g[v]) { n if (u != p) { n temp = dfs1(u, v); n if (temp != -1) { n if (ret == -1) ret = temp; n if (sub[v] == 2 * sub[temp] && (sub[root] - sub[v] == sub[temp]) && n (v != root)) { n cout << min(v, temp) << << max(v, temp) << n ; n exit(0); n } n ans.push_back(temp); n if (ans.size() >= 2) { n cout << min(ans[0], ans[1]) << << max(ans[0], ans[1]) << n ; n exit(0); n } n } n } n } n return ret; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(NULL); n int n; n cin >> n; n g.resize(n + 2); n int p; n for (int i = 1; i <= n; i++) { n cin >> p >> t[i]; n if (p != 0) { n g[i].push_back(p); n g[p].push_back(i); n } else { n root = i; n } n } n dfs0(root, -1); n dfs1(root, -1); n if ((int)ans.size() < 2) { n cout << -1 << n ; n } else { n cout << min(ans[0], ans[1]) << << max(ans[0], ans[1]) << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, t; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> t; n while (t--) { n cin >> n; n if (n <= 2) { n cout << 0 << endl; n continue; n } else { n int x; n x = n / 2; n if (n % 2 == 0) x--; n cout << x << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n cin >> n >> k; n int a[n + 1]; n for (int i = 1; i <= n; i++) cin >> a[i]; n sort(a + 1, a + n + 1); n int ans = 0; n for (int i = 1; i <= k; i++) ans += a[i]; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dp[60][20010]; n int S[60][20010]; n int n, m, k; n int sum(int i, int l, int r) { n if (l > r) return 0; n return S[i][r] - S[i][l - 1]; n } n int L[20010], R[20010]; n int pre[20010], suf[20010]; n int ST[2][200010]; n void init(int tree[], int A[], int node, int li, int ls) { n if (li == ls) { n tree[node] = A[li]; n } else { n int mid = (li + ls) / 2; n init(tree, A, 2 * node, li, mid); n init(tree, A, 2 * node + 1, mid + 1, ls); n tree[node] = max(tree[2 * node], tree[2 * node + 1]); n } n } n int query(int tree[], int node, int li, int ls, int i, int j) { n if (i > ls || j < li) return -0x3f3f3f3f; n if (li >= i && ls <= j) return tree[node]; n int mid = (li + ls) / 2; n int left = query(tree, 2 * node, li, mid, i, j); n int right = query(tree, 2 * node + 1, mid + 1, ls, i, j); n return max(left, right); n } n int main() { n scanf( %d %d %d , &n, &m, &k); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= m; j++) { n scanf( %d , &S[i][j]); n S[i][j] += S[i][j - 1]; n } n } n int ans = 0; n for (int i = n; i > 0; i--) { n for (int j = 1; j <= m; j++) { n dp[i][j] = 0; n int l = max(1, j - k + 1), r = min(m, j + k - 1); n if (l > 1) { n dp[i][j] = pre[l - 1] + sum(i + 1, j, r); n } n if (r < m) { n dp[i][j] = max(dp[i][j], suf[r + 1] + sum(i + 1, j, r)); n } n dp[i][j] = max(dp[i][j], query(ST[0], 1, 1, m, l, j) + S[i + 1][r]); n dp[i][j] = n max(dp[i][j], query(ST[1], 1, 1, m, j + 1, r) - S[i + 1][j - 1]); n dp[i][j] += sum(i, j, r); n ans = max(ans, dp[i][j]); n } n for (int j = 1; j <= m; j++) { n pre[j] = dp[i][j]; n suf[j] = dp[i][j]; n } n for (int j = 2; j <= m; j++) { n pre[j] = max(pre[j], pre[j - 1]); n suf[m - j + 1] = max(suf[m - j + 1], suf[m - j + 2]); n } n for (int j = 1; j <= m; j++) { n L[j] = dp[i][j] - S[i][min(m, j + k - 1)]; n R[j] = dp[i][j] + S[i][j - 1]; n } n init(ST[0], L, 1, 1, m); n init(ST[1], R, 1, 1, m); n } n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector ans; n void solve(long long n) { n long long step = 0; n while (n != 1) { n if (n % 2 == 0) { n if (n % 6 != 0) { n ans.push_back(-1); n return; n } n n /= 6; n if (n == 0) { n ans.push_back(-1); n return; n } n } else { n n *= 2; n if (n % 6 != 0) { n ans.push_back(-1); n return; n } n } n ++step; n } n ans.push_back(step); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n int t; n cin >> t; n while (t--) { n long long n; n cin >> n; n solve(n); n } n for (int i = (0); i < (ans.size()); ++i) cout << ans[i] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k, nums[2201], ans = 0; n cin >> n >> k; n for (int i = 0; i < n; i++) { n cin >> nums[i]; n } n sort(nums, nums + n); n for (int i = 0; i < k; i++) { n ans += nums[i]; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long linf = 1e18 + 9; n const int inf = 1e9 + 9; n const long long mod = 1e9 + 7; n const int N = 4e5 + 9; n int n, u, v, ans[N], sub[N], mx[N], centroid; n vector gr[N], c[N]; n int dfs(int v, int f) { n sub[v] = 1; n for (int i = 0; i < gr[v].size(); i++) { n if (gr[v][i] == f) continue; n int t = dfs(gr[v][i], v); n sub[v] += t; n mx[v] = max(mx[v], t); n c[v].push_back(t); n } n if ((n - sub[v]) <= n / 2 and mx[v] <= n / 2) { n ans[v] = 1; n centroid = v; n } n return sub[v]; n } n void dfs2(int v, int f, int cur, int root) { n if (v != centroid and ans[v] == 0) { n int t = c[centroid].size() - 1; n if (sub[root] == c[centroid][t]) t--; n if (t >= 0 and n - sub[v] - c[centroid][t] <= n / 2) n ans[v] = 1; n else { n if (cur - sub[v] <= n / 2) n ans[v] = 1; n else n ans[v] = 0; n } n } n if (n - sub[v] <= n / 2) cur = sub[v]; n for (int i = 0; i < gr[v].size(); i++) { n if (gr[v][i] == f) continue; n if (v == centroid) root = gr[v][i]; n dfs2(gr[v][i], v, cur, root); n } n } n int main() { n scanf( %d , &n); n for (int i = 1; i < n; i++) { n scanf( %d %d , &u, &v); n gr[u].push_back(v); n gr[v].push_back(u); n } n dfs(1, 0); n memset(mx, 0, sizeof mx); n for (int i = 1; i <= n; i++) c[i].clear(); n dfs(centroid, 0); n for (int i = 1; i <= n; i++) sort(c[i].begin(), c[i].end()); n dfs2(centroid, 0, 0, 0); n for (int i = 1; i <= n; i++) printf( %d n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int gcd(int x, int y) { return (y == 0 ? x : gcd(y, x % y)); } n const int N = (int)1e6 + 100; n int a[30]; n int n; n int m = 0; n char s[N]; n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %d , &a[i]); n for (int i = 0; i < n; i++) m += a[i]; n if (n == 1) { n printf( %d n , m); n for (int i = 0; i < m; i++) s[i] = a ; n s[m] = (char)0; n printf( %s n , s); n return 0; n } n int cntOdd = 0; n for (int i = 0; i < n; i++) n if (a[i] & 1) cntOdd++; n if (cntOdd > 1) { n printf( 0 n ); n int idx = 0; n for (int i = 0; i < n; i++) n for (int j = 0; j < a[i]; j++) s[idx++] = (char)( a + i); n s[m] = (char)0; n printf( %s n , s); n return 0; n } n if (cntOdd == 1) { n int g = 0; n for (int i = 0; i < n; i++) { n if (a[i] & 1) n g = gcd(g, a[i]); n else n g = gcd(g, a[i] / 2); n } n printf( %d n , g); n int idx = 0; n for (int i = 0; i < n; i++) { n if (a[i] & 1) continue; n for (int j = 0; j < a[i] / 2 / g; j++) s[idx++] = (char)( a + i); n } n for (int i = 0; i < n; i++) { n if ((a[i] & 1) == 0) continue; n for (int j = 0; j < a[i] / g; j++) s[idx++] = (char)( a + i); n } n for (int i = n - 1; i >= 0; i--) { n if (a[i] & 1) continue; n for (int j = 0; j < a[i] / 2 / g; j++) s[idx++] = (char)( a + i); n } n int p = idx; n for (int i = p; i < m; i++) s[i] = s[i - p]; n s[m] = (char)0; n printf( %s n , s); n return 0; n } n int g = 0; n for (int i = 0; i < n; i++) g = gcd(g, a[i] / 2); n printf( %d n , 2 * g); n int idx = 0; n for (int i = 0; i < n; i++) n for (int j = 0; j < a[i] / 2 / g; j++) s[idx++] = (char)( a + i); n for (int i = n - 1; i >= 0; i--) n for (int j = 0; j < a[i] / 2 / g; j++) s[idx++] = (char)( a + i); n int p = idx; n for (int i = p; i < m; i++) s[i] = s[i - p]; n s[m] = (char)0; n printf( %s n , s); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 2e5; n int d[maxn]; n int w[maxn]; n int main() { n ios::sync_with_stdio(false); n cin.tie(nullptr); n int n; n cin >> n; n string s; n cin >> s; n for (int i = 0; i < n; ++i) { n cin >> d[i]; n } n int cur = 0; n while (cur >= 0 && cur < n && !w[cur]) { n w[cur] = 1; n cur = cur + (s[cur] == < ? -1 : 1) * d[cur]; n } n if (cur < 0 || cur >= n) { n cout << FINITE n ; n } else { n cout << INFINITE n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int max_n = 22, max_q = 11111, mod = 1000000007; n struct matrix { n vector > v; n matrix() {} n matrix(int n, int m) { v.resize(n, vector(m, 0)); } n matrix operator*(const matrix &m) const { n matrix res(v.size(), m.v[0].size()); n for (int i = 0; i < res.v.size(); ++i) { n for (int j = 0; j < res.v[i].size(); ++j) { n for (int k = 0; k < v[i].size(); ++k) { n res.v[i][j] += (1LL * v[i][k] * m.v[k][j]) % mod; n res.v[i][j] %= mod; n } n } n } n return res; n } n }; n matrix power(matrix a, int b) { n if (b == 0) { n matrix res(a.v.size(), a.v.size()); n for (int i = 0; i < res.v.size(); ++i) { n res.v[i][i] = 1; n } n return res; n } n if (b % 2 == 0) { n return power(a * a, b / 2); n } n return a * power(a, b - 1); n } n const int dx[] = {-1, 1, 0, 0, 0}; n const int dy[] = {0, 0, -1, 1, 0}; n int n, m, q, tp[max_q], x[max_q], y[max_q], t[max_q], f[max_q], a[max_n][max_n]; n matrix dp, p; n bool is_in(int x, int y) { return 0 <= x && 0 <= y && x < n && y < m; } n void get_p() { n for (int i = 0; i < n; ++i) { n for (int j = 0; j < m; ++j) { n for (int k = 0; k < 5; ++k) { n int x = i + dx[k]; n int y = j + dy[k]; n if (is_in(x, y)) { n p.v[i * m + j][x * m + y] = 0; n if (a[x][y] == 0) { n p.v[i * m + j][x * m + y] = 1; n } n } n } n } n } n } n int main() { n scanf( %d%d%d , &n, &m, &q); n for (int i = 0; i < q; ++i) { n scanf( %d%d%d%d , &tp[i], &x[i], &y[i], &t[i]); n --x[i]; n --y[i]; n if (tp[i] == 3) { n ++t[i]; n } n } n dp = matrix(1, n * m); n p = matrix(n * m, n * m); n get_p(); n dp.v[0][0] = 1; n int nt = 1; n for (int i = 0; i < q; ++i) { n if (t[i] != nt) { n dp = dp * power(p, t[i] - nt - 1); n } n while (i + 1 < q && t[i] == t[i + 1]) { n if (tp[i] == 2) { n a[x[i]][y[i]] = 1; n } n if (tp[i] == 3) { n a[x[i]][y[i]] = 0; n } n ++i; n } n if (tp[i] == 2) { n a[x[i]][y[i]] = 1; n } n if (tp[i] == 3) { n a[x[i]][y[i]] = 0; n } n get_p(); n if (t[i] != nt) { n dp = dp * p; n } n nt = t[i]; n if (tp[i] == 1) { n printf( %d n , dp.v[0][x[i] * m + y[i]]); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int n; n cin >> n; n int a[n]; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n string ans = NO ; n for (int i = 0; i < n - 1; i++) { n if (a[i] <= a[i + 1]) ans = YES ; n } n cout << ans << n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int t = 1; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int N, S, L, A[100009]; n int c[100009], dp[100009]; n deque> s, t, u; n int main() { n scanf( %d%d%d , &N, &S, &L); n for (int i = 1; i <= N; i++) dp[i] = 1e6; n for (int i = 1, ptr = 1; i <= N; i++) { n scanf( %d , &A[i]); n while (s.size() && s.back().first >= A[i]) s.pop_back(); n s.push_back({A[i], i}); n while (t.size() && t.back().first <= A[i]) t.pop_back(); n t.push_back({A[i], i}); n while (ptr < i && t.front().first - s.front().first > S) { n ptr++; n while (s.front().second < ptr) s.pop_front(); n while (t.front().second < ptr) t.pop_front(); n } n c[i] = ptr - 1; n } n for (int i = 1; i <= N; i++) c[i] = min(c[i], i - L + 1); n for (int i = 1, ptr = 0; i <= N; i++) { n if (i >= L) { n while (u.size() && u.back().first >= dp[i - L]) u.pop_back(); n u.push_back({dp[i - L], i - L}); n } n for (; ptr < c[i]; ptr++) { n while (u.size() && u.front().second <= ptr) u.pop_front(); n } n if (u.size()) dp[i] = u.front().first + 1; n } n printf( %d n , dp[N] >= 1e6 ? -1 : dp[N]); n } n "} +{"func_code_string": "#include n using namespace std; n void dfs(long long v, vector adj[], vector& visited) { n cout << char(v + a ); n visited[v] = true; n for (long long u : adj[v]) { n if (!visited[u]) dfs(u, adj, visited); n } n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n ; n long long n; n cin >> n; n vector adj[26]; n set st; n vector store; n for (long long i = 0; i < n; i++) { n string s; n cin >> s; n store.push_back(s); n st.insert(s[0]); n for (long long j = 0; j < s.length() - 1; j++) { n long long a = s[j] - a , b = s[j + 1] - a ; n adj[a].push_back(b); n } n } n queue q; n vector visited(26, false); n for (auto it : st) { n bool boo = true; n for (long long i = 0; i < store.size(); i++) { n string s = store[i]; n for (long long j = 1; j < s.length(); j++) { n if (s[j] == it) { n boo = false; n goto h; n } n } n } n h:; n if (boo) { n q.push(it - a ); n visited[it - a ] = true; n } n } n while (!q.empty()) { n long long v = q.front(); n q.pop(); n dfs(v, adj, visited); n } n } n "} +{"func_code_string": "#include n using namespace std; n vector set1; n vector set2; n int col[100004], vis[100004]; n int flag = 1; n class Graph { n int V; n list *adj; n n public: n Graph(int V); n void addEdge(int v, int w); n void BFS(int s); n }; n Graph::Graph(int V) { n this->V = V; n adj = new list[V]; n } n void Graph::addEdge(int v, int w) { n adj[v].push_back(w); n adj[w].push_back(v); n } n void Graph::BFS(int s) { n list queue; n vis[s] = 1; n queue.push_back(s); n col[s] = 0; n list::iterator i; n while (!queue.empty()) { n s = queue.front(); n queue.pop_front(); n if (col[s] == 0) { n set1.push_back(s); n } else { n set2.push_back(s); n } n for (i = adj[s].begin(); i != adj[s].end(); ++i) { n if (vis[*i] != 1) { n vis[*i] = 1; n queue.push_back(*i); n col[*i] = (col[s] + 1) % 2; n } else { n if ((col[s] + 1) % 2 != col[*i]) { n flag = 0; n return; n } n } n } n } n } n int main() { n int n, m; n cin >> n >> m; n Graph g(n); n memset(col, -1, sizeof(col)); n memset(vis, -1, sizeof(vis)); n int a, b; n while (m--) { n cin >> a >> b; n vis[a - 1] = 0; n vis[b - 1] = 0; n g.addEdge(a - 1, b - 1); n } n for (int i = 0; i < n; i++) { n if (vis[i] == 0) g.BFS(i); n if (flag == 0) break; n } n if (flag == 0) { n cout << -1 n ; n } else { n cout << set1.size() << n ; n for (vector::iterator i = set1.begin(); i != set1.end(); ++i) n cout << (*i) + 1 << ; n cout << n ; n cout << set2.size() << n ; n for (vector::iterator i = set2.begin(); i != set2.end(); ++i) n cout << (*i) + 1 << ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int NMax = 100005; n const int sqrNMax = 330; n int N; n int Nb[NMax][sqrNMax + 5]; n int A[NMax], B[sqrNMax + 5][2 * sqrNMax + 5], Start[sqrNMax + 5], Block[NMax], n totalB, Size[sqrNMax + 5]; n void Read() { n scanf( %d , &N); n for (int i = 1; i <= N; i++) scanf( %d , &A[i]); n } n void buildB() { n int currentBlock = 1, cnt = 0; n Start[1] = 1; n for (int i = 1; i <= N; i++) { n ++cnt; n if (cnt == sqrNMax) { n ++currentBlock; n Start[currentBlock] = i; n cnt = 1; n } n ++Size[currentBlock]; n B[currentBlock][cnt] = A[i]; n Nb[A[i]][currentBlock]++; n Block[i] = currentBlock; n } n totalB = currentBlock; n } n int findBlock(int pos) { n int sum = 0; n for (int i = 1; i <= totalB; i++) { n if (sum + Size[i] >= pos) { n Start[i] = sum + 1; n return i; n } n sum += Size[i]; n } n } n int deleteElem(int block, int pos) { n int p = pos - Start[block] + 1; n int res = B[block][p]; n Nb[res][block]--; n for (int j = p; j < Size[block]; j++) swap(B[block][j], B[block][j + 1]); n --Size[block]; n return res; n } n void addElem(int block, int pos, int val) { n int p = pos - Start[block] + 1; n Nb[val][block]++; n B[block][++Size[block]] = val; n for (int j = Size[block] - 1; j >= p; j--) swap(B[block][j], B[block][j + 1]); n } n void makeCircularPerm(int left, int right) { n int b = findBlock(right); n int val = deleteElem(b, right); n b = findBlock(left); n addElem(b, left, val); n } n void buildA() { n int cnt = 0; n for (int i = 1; i <= totalB; i++) { n for (int j = 1; j <= Size[i]; j++) A[++cnt] = B[i][j]; n } n } n void initialize() { n for (int i = 1; i <= totalB; i++) { n for (int j = 1; j <= Size[i]; j++) Nb[B[i][j]][i] = 0; n Size[i] = 0; n Start[i] = 0; n } n } n inline int decode(int nb, int lastans) { return (nb + lastans - 1) % N + 1; } n int Query(int left, int right, int val) { n int ans = 0, b = findBlock(left), b2 = findBlock(right); n for (int i = b + 1; i < b2; i++) ans += Nb[val][i]; n int l = left - Start[b] + 1, r = right - Start[b2] + 1; n if (b == b2) { n for (int j = l; j <= r; j++) n if (B[b][j] == val) ++ans; n return ans; n } n for (int j = l; j <= Size[b]; j++) n if (B[b][j] == val) ans++; n for (int j = 1; j <= r; j++) n if (B[b2][j] == val) ++ans; n return ans; n } n void Solve() { n int Q; n scanf( %d , &Q); n buildB(); n int lastans = 0, cntQ = 0; n for (int i = 1; i <= Q; i++) { n int type, l, r, k; n scanf( %d%d%d , &type, &l, &r); n l = decode(l, lastans); n r = decode(r, lastans); n if (l > r) swap(l, r); n if (type == 1) { n ++cntQ; n makeCircularPerm(l, r); n if (cntQ == sqrNMax) { n cntQ = 0; n buildA(); n initialize(); n buildB(); n } n } else { n scanf( %d , &k); n k = decode(k, lastans); n lastans = Query(l, r, k); n printf( %d n , lastans); n } n } n } n int main() { n Read(); n Solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1005; n const int MOD = 1000000007; n int N, P; n int dp[MAXN][4]; n int a[MAXN], b[MAXN]; n int cnt[3]; n void load() { scanf( %d%d , &N, &P); } n inline int add(int x, int y) { n x += y; n if (x >= MOD) n x -= MOD; n else if (x < 0) n x += MOD; n return x; n } n inline int mul(int x, int y) { return (long long)x * y % MOD; } n void add(int lo, int hi, int val) { n cnt[val] = n add(cnt[val], mul(hi - lo + 1, add(P, -mul(add(lo, hi), (MOD + 1) / 2)))); n } n int solve() { n if (P == 1) return 0; n a[0] = 1; n b[0] = 0; n a[1] = 3; n b[1] = 1; n a[2] = 4; n b[2] = 2; n a[3] = 5; n b[3] = 1; n a[4] = 7; n b[4] = 2; n a[5] = 9; n b[5] = 0; n a[6] = 13; n b[6] = 1; n a[7] = 15; n b[7] = 2; n a[8] = 19; n b[8] = 0; n a[9] = 27; n b[9] = 1; n a[10] = 39; n b[10] = 2; n a[11] = 40; n b[11] = 0; n a[12] = 57; n b[12] = 2; n a[13] = 58; n b[13] = 1; n a[14] = 81; n b[14] = 2; n a[15] = 85; n b[15] = 0; n a[16] = 120; n b[16] = 2; n a[17] = 121; n b[17] = 1; n a[18] = 174; n b[18] = 2; n a[19] = 179; n b[19] = 0; n a[20] = 255; n b[20] = 2; n a[21] = 260; n b[21] = 1; n a[22] = 363; n b[22] = 2; n a[23] = 382; n b[23] = 0; n a[24] = 537; n b[24] = 2; n a[25] = 544; n b[25] = 1; n a[26] = 780; n b[26] = 2; n a[27] = 805; n b[27] = 0; n a[28] = 1146; n b[28] = 2; n a[29] = 1169; n b[29] = 1; n a[30] = 1632; n b[30] = 2; n a[31] = 1718; n b[31] = 0; n a[32] = 2415; n b[32] = 2; n a[33] = 2447; n b[33] = 1; n a[34] = 3507; n b[34] = 2; n a[35] = 3622; n b[35] = 0; n a[36] = 5154; n b[36] = 2; n a[37] = 5260; n b[37] = 1; n a[38] = 7341; n b[38] = 2; n a[39] = 7730; n b[39] = 0; n a[40] = 10866; n b[40] = 2; n a[41] = 11011; n b[41] = 1; n a[42] = 15780; n b[42] = 2; n a[43] = 16298; n b[43] = 0; n a[44] = 23190; n b[44] = 2; n a[45] = 23669; n b[45] = 1; n a[46] = 33033; n b[46] = 2; n a[47] = 34784; n b[47] = 0; n a[48] = 48894; n b[48] = 2; n a[49] = 49549; n b[49] = 1; n a[50] = 71007; n b[50] = 2; n a[51] = 73340; n b[51] = 0; n a[52] = 104352; n b[52] = 2; n a[53] = 106510; n b[53] = 1; n a[54] = 148647; n b[54] = 2; n a[55] = 156527; n b[55] = 0; n a[56] = 220020; n b[56] = 2; n a[57] = 222970; n b[57] = 1; n a[58] = 319530; n b[58] = 2; n a[59] = 330029; n b[59] = 0; n a[60] = 469581; n b[60] = 2; n a[61] = 479294; n b[61] = 1; n a[62] = 668910; n b[62] = 2; n a[63] = 704371; n b[63] = 0; n a[64] = 990087; n b[64] = 2; n a[65] = 1003364; n b[65] = 1; n a[66] = 1437882; n b[66] = 2; n a[67] = 1485130; n b[67] = 0; n a[68] = 2113113; n b[68] = 2; n a[69] = 2156822; n b[69] = 1; n a[70] = 3010092; n b[70] = 2; n a[71] = 3169669; n b[71] = 0; n a[72] = 4455390; n b[72] = 2; n a[73] = 4515137; n b[73] = 1; n a[74] = 6470466; n b[74] = 2; n a[75] = 6683084; n b[75] = 0; n a[76] = 9509007; n b[76] = 2; n a[77] = 9705698; n b[77] = 1; n a[78] = 13545411; n b[78] = 2; n a[79] = 14263510; n b[79] = 0; n a[80] = 20049252; n b[80] = 2; n a[81] = 20318116; n b[81] = 1; n a[82] = 29117094; n b[82] = 2; n a[83] = 30073877; n b[83] = 0; n a[84] = 42790530; n b[84] = 2; n a[85] = 43675640; n b[85] = 1; n a[86] = 60954348; n b[86] = 2; n a[87] = 64185794; n b[87] = 0; n a[88] = 90221631; n b[88] = 2; n a[89] = 91431521; n b[89] = 1; n a[90] = 131026920; n b[90] = 2; n a[91] = 135332446; n b[91] = 0; n a[92] = 192557382; n b[92] = 2; n a[93] = 196540379; n b[93] = 1; n a[94] = 274294563; n b[94] = 2; n a[95] = 288836072; n b[95] = 0; n a[96] = 405997338; n b[96] = 2; n a[97] = 411441844; n b[97] = 1; n a[98] = 589621137; n b[98] = 2; n a[99] = 608996006; n b[99] = 0; n a[100] = 866508216; n b[100] = 2; n a[101] = 884431705; n b[101] = 1; n a[102] = 1000000000; n b[102] = 0; n for (int i = 0; i < MAXN; i++) { n if (a[i + 1] >= P) { n add(a[i], P - 1, b[i]); n break; n } n add(a[i], a[i + 1] - 1, b[i]); n } n dp[0][0] = 1; n for (int i = 1; i <= N; i++) n for (int j = 0; j < 4; j++) n for (int k = 0; k < 3; k++) n dp[i][j] = add(dp[i][j], mul(cnt[k], dp[i - 1][j ^ k])); n int sol = 0; n for (int i = 1; i < 4; i++) sol = add(sol, dp[N][i]); n return sol; n } n int main() { n load(); n printf( %d n , solve()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a[100005], l[100005], r[100005]; n int main() { n int n, m, i, j, x, y, pos; n cin >> n >> m; n for (i = 1; i <= n; i++) scanf( %d , &a[i]); n l[1] = r[1] = 0; n for (i = 2; i <= n; i++) { n l[i] = l[i - 1]; n if (a[i - 1] > a[i]) l[i]++; n r[i] = r[i - 1]; n if (a[i - 1] < a[i]) r[i]++; n } n for (i = 1; i <= m; i++) { n cin >> x >> y; n if (r[x] == r[y] || l[x] == l[y]) n cout << Yes << endl; n else { n pos = int(upper_bound(l + 1, l + n + 1, l[x]) - l); n pos--; n if (l[pos] == l[x] && r[pos] == r[y]) n cout << Yes << endl; n else n cout << No << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct ter { n int cx, cy, dir, pt, rem; n ter(){}; n ter(int _cx, int _cy, int _dir, int _pt, int _rem) n : cx(_cx), cy(_cy), dir(_dir), pt(_pt), rem(_rem){}; n }; n const int dx[] = {0, 1, 1, 1, 0, -1, -1, -1}; n const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}; n ter on; n queue Q; n int n, t[32], cx, cy, dir, pt, rem, dir1, dir2, sol, maxx = -3; n bool bio[312][312][8][31][6], mp[312][312]; n void radi() { n while (!Q.empty()) { n on = Q.front(); n cx = on.cx; n cy = on.cy; n dir = on.dir; n pt = on.pt; n rem = on.rem; n Q.pop(); n if (bio[cx][cy][dir][pt][rem]) continue; n bio[cx][cy][dir][pt][rem] = 1; n if (mp[cx][cy] == 0) ++sol; n mp[cx][cy] = 1; n if (rem > 0) { n Q.push(ter(cx + dx[dir], cy + dy[dir], dir, pt, rem - 1)); n } else { n if (pt == n) continue; n dir1 = (dir + 1) % 8; n dir2 = (dir + 7) % 8; n Q.push(ter(cx + dx[dir1], cy + dy[dir1], dir1, pt + 1, t[pt + 1] - 1)); n Q.push(ter(cx + dx[dir2], cy + dy[dir2], dir2, pt + 1, t[pt + 1] - 1)); n } n } n } n int main() { n std::ios::sync_with_stdio(false); n cin >> n; n for (int i = 1; i <= n; ++i) cin >> t[i]; n Q.push(ter(155, 155, 0, 1, t[1] - 1)); n radi(); n cout << sol << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n map a; n for (int i = 0; i < n; i++) { n int temp; n cin >> temp; n a[temp]++; n } n map b; n for (int i = 0; i < n - 1; i++) { n int temp; n cin >> temp; n b[temp]++; n } n map c; n for (int i = 0; i < n - 2; i++) { n int temp; n cin >> temp; n c[temp]++; n } n for (map::iterator it = a.begin(); it != a.end(); ++it) { n if (it->second != b[it->first]) { n cout << it->first << endl; n break; n } n } n for (map::iterator it = b.begin(); it != b.end(); ++it) { n if (it->second != c[it->first]) { n cout << it->first << endl; n break; n } n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n int n; n scanf( %d , &n); n int people_in_queue[n]; n for (int i = 0; i < n; i++) { n scanf( %d , &people_in_queue[i]); n } n int num_of_product[n][100], sum[n]; n for (int i = 0; i < n; i++) { n sum[i] = 0; n for (int j = 0; j < people_in_queue[i]; j++) { n scanf( %d , &num_of_product[i][j]); n sum[i] = sum[i] + num_of_product[i][j]; n } n } n int time[n]; n for (int i = 0; i < n; i++) { n time[i] = sum[i] * 5 + people_in_queue[i] * 15; n } n int min = time[0]; n for (int i = 0; i < n; i++) { n if (min > time[i]) { n min = time[i]; n } n } n printf( %d , min); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void err(istream_iterator it) {} n template n void err(istream_iterator it, T a, Args... args) { n cerr << *it << = << a << endl; n err(++it, args...); n } n template n void printV(const T &t) { n std::copy(t.cbegin(), t.cend(), n std::ostream_iterator(std::cout, )); n cout << n ; n } n template n void printVV(const T &t) { n for (int i = 0; i < t.size(); i++) { n printf( %d: , i); n printV(t[i]); n } n } n template n void printVP(vector> vp) { n if (vp.empty()) { n cout << n ; n return; n } n for (int i = 0; i < vp.size() - 1; i++) { n cout << ( << vp[i].first << << vp[i].second << ) ; n } n cout << ( << vp[vp.size() - 1].first << << vp[vp.size() - 1].second n << ) n ; n } n template n void printVVP(vector>> vvp) { n for (int i = 0; i < vvp.size(); i++) { n cout << i << : ; n printVP(vvp[i]); n } n } n vector split(const string &s, char delim) { n vector result; n stringstream ss(s); n string item; n while (getline(ss, item, delim)) { n result.push_back(item); n } n return result; n } n bool is_number(const string &s) { n string::const_iterator it = s.begin(); n while (it != s.end() && isdigit(*it)) ++it; n return !s.empty() && it == s.end(); n } n void fast() { n ios::sync_with_stdio(false); n cin.tie(NULL); n } n bool isValid(int r, int c, int R, int C) { n return (r >= 0 && r < R && c >= 0 && c < C); n } n struct Can { n long long x, r, id; n }; n bool compareByX(const Can &lhs, const Can &rhs) { return lhs.x < rhs.x; } n class Person { n public: n string name, speak; n unordered_set understands; n friend ostream &operator<<(ostream &os, const Person &p) { n os << p.name << ( << p.speak << ): ; n for (auto s : p.understands) os << << s; n return os; n } n }; n vector> deltas = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; n const int INF = 1e9 + 10; n const long long inf = 1e18 + 10; n const long double PI = 3.14159265359; n int main() { n int N; n cin >> N; n vector A(N), B(N); n for (int i = 0; i < (N); ++i) { n cin >> A[i]; n B[i] = A[i]; n } n sort(B.begin(), B.end()); n unordered_map m; n for (int i = 0; i < (N); ++i) m[B[i]] = i; n vector C(N); n for (int i = 0; i < (N); ++i) { n C[i] = B[(m[A[i]] + 1) % N]; n } n printV(C); n } n "} +{"func_code_string": "#include n using namespace std; n const int ms = 100010; n vector g[ms]; n int in[ms], out[ms]; n int main() { n int n, m; n int a, b; n cin >> n >> m; n for (int i = 0; i < m; ++i) { n scanf( %d%d , &a, &b); n if (a > b) swap(a, b); n in[a]++, out[b]++; n g[a].push_back(b); n } n long long res = 0; n for (int i = 0; i < n; ++i) { n res += 1ll * in[i + 1] * out[i + 1]; n } n printf( %lld n , res); n int q; n cin >> q; n for (int i = 0; i < q; ++i) { n scanf( %d , &a); n res -= 1ll * out[a] * in[a]; n for (int j : g[a]) { n res -= 1ll * out[j] * in[j]; n g[j].push_back(a); n out[a]++; n in[j]++; n out[j]--; n res += 1ll * out[j] * in[j]; n } n g[a].clear(); n in[a] = 0; n printf( %lld n , res); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n priority_queue, greater > p; n bool visited[100005]; n vector G[100005]; n int n, m; n void prime() { n p.push(1); n while (!p.empty()) { n int v = p.top(); n p.pop(); n if (visited[v]) continue; n visited[v] = true; n printf( %d , v); n for (int i = 0; i < G[v].size(); i++) { n if (!visited[G[v][i]]) p.push(G[v][i]); n } n } n } n int main() { n scanf( %d%d , &n, &m); n int x, y; n for (int i = 0; i < m; i++) { n scanf( %d%d , &x, &y); n G[x].push_back(y); n G[y].push_back(x); n } n memset(visited, false, sizeof(visited)); n prime(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2005, P = 998244353; n using ll = long long; n ll qpow(ll a, ll b) { n ll ret = 1; n while (b) { n if (b & 1) ret = ret * a % P; n a = a * a % P; n b >>= 1; n } n return ret; n } n int n, a, b; n ll pw[N * N], pw1[N * N]; n ll dp[N][N], f[N], g[N], h[N]; n int main() { n ios::sync_with_stdio(false); n cin >> n >> a >> b; n ll p = a * qpow(b, P - 2) % P; n if (n == 1) { n cout << 0 << endl; n return 0; n } n if (n == 2) { n cout << 1 << endl; n return 0; n } n pw[0] = pw1[0] = 1; n for (int i = 1; i <= n * n; i++) { n pw[i] = pw[i - 1] * p % P; n pw1[i] = pw1[i - 1] * (P - p + 1) % P; n } n dp[0][0] = 1; n for (int i = 1; i <= n; i++) { n dp[i][0] = 1; n for (int j = 1; j <= i; j++) n dp[i][j] = (dp[i - 1][j] * pw1[j] + dp[i - 1][j - 1] * pw[i - j]) % P; n } n for (int i = 1; i <= n; i++) { n f[i] = 1; n for (int j = 1; j < i; j++) f[i] = (f[i] + P - f[j] * dp[i][j] % P) % P; n } n for (int i = 3; i <= n; i++) { n ll tt = i * (i - 1) / 2; n for (int j = 1; j < i; j++) { n ll tmp = (g[j] + h[i - j]) * f[j] % P * dp[i][j] % P; n tt = (tt + tmp) % P; n } n g[i] = tt * qpow(P + 1 - f[i], P - 2) % P; n tt = f[i] * g[i] % P; n for (int j = 1; j < i; j++) { n ll tmp = (g[j] + h[i - j]) * f[j] % P * dp[i][j] % P; n tt = (tt + tmp) % P; n } n h[i] = tt; n } n cout << g[n] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int n, f = 0, ans, m, a1[20], flag = 0, a2[20], b1[20], b2[20], num[20] = {0}, n c = 0; n cin >> n >> m; n for (int i = 0; i < n; i++) cin >> a1[i] >> a2[i]; n for (int i = 0; i < m; i++) cin >> b1[i] >> b2[i]; n for (int i = 0; i < n; i++) { n int cura = 0, curb = 0; n for (int j = 0; j < m; j++) { n if ((a1[i] == b1[j] && a2[i] != b2[j]) || n (a1[i] == b2[j] && a2[i] != b1[j])) n num[a1[i]]++, cura++; n if ((a2[i] == b1[j] && a1[i] != b2[j]) || n (a2[i] == b2[j] && a1[i] != b1[j])) n num[a2[i]]++, curb++; n } n if (cura > 0 && curb > 0) flag = 1; n } n for (int i = 0; i < m; i++) { n int cura = 0, curb = 0; n for (int j = 0; j < n; j++) { n if ((b1[i] == a1[j] && b2[i] != a2[j]) || n (b1[i] == a2[j] && b2[i] != a1[j])) n cura++; n if ((b2[i] == a1[j] && b1[i] != a2[j]) || n (b2[i] == a2[j] && b1[i] != a1[j])) n curb++; n } n if (cura > 0 && curb > 0) flag = 1; n } n for (int i = 0; i < 15; i++) n if (num[i] > 0) c++, f = i; n if (flag) n cout << -1 << endl; n else if (c > 1) n cout << 0 << endl; n else n cout << f << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 132674; n const int MOD = 1e9 + 7; n int main() { n set ar; n set to_buy; n set to_sell; n long long multiplyier = 1; n int n; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n int temp; n string l; n cin >> l; n scanf( %d , &temp); n if (l.size() == 3) { n if (to_buy.size() > 0 && *to_buy.rbegin() > temp) { n to_buy.insert(temp); n } else if (to_sell.size() > 0 && *to_sell.begin() < temp) { n to_sell.insert(temp); n } else n ar.insert(temp); n } else { n if (ar.find(temp) != ar.end()) { n for (auto u : ar) { n if (u != temp) { n if (u < temp) n to_buy.insert(u); n else n to_sell.insert(u); n } n } n ar.clear(); n multiplyier = (multiplyier * 2) % MOD; n } else if (to_buy.find(temp) != to_buy.end()) { n if (*to_buy.rbegin() != temp) { n cout << 0; n return 0; n } n to_buy.erase(temp); n for (auto u : ar) to_sell.insert(u); n ar.clear(); n } else if (to_sell.find(temp) != to_sell.end()) { n if (*to_sell.begin() != temp) { n cout << 0; n return 0; n } n to_sell.erase(temp); n for (auto u : ar) to_buy.insert(u); n ar.clear(); n } n } n } n cout << (multiplyier * ((int)ar.size() + 1)) % MOD; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int a, b, n, k, y, x, i, j, h, ans, c, d[100005], f[10]; n char s[105], s1[105]; n int main() { n scanf( %d%d%s , &n, &k, s); n for (i = 1; i <= k; i++) { n int f[1000] = {0}; n scanf( %d %d , &a, &b); n x = 0; n int DP = 1, CP = 0, lens1 = 0; n int p1 = 0; n int p2 = -1; n for (j = a - 1; j < b; j++) { n s1[lens1++] = s[j]; n } n while (CP < lens1 && CP >= 0) { n if (s1[CP] >= 48 && s1[CP] <= 57) { n f[s1[CP] - 48]++; n if (s1[CP] >= 48 && s1[CP] <= 57) { n s1[CP]--; n } n p1 = 1; n p2 = CP; n } else if (s1[CP] == < || s1[CP] == > ) { n if (p1 == 2) { n s1[p2] = 47; n } n if (s1[CP] == > ) { n DP = 1; n } else { n DP = -1; n } n p1 = 2; n p2 = CP; n } n if (DP == 1) { n CP++; n } else n CP--; n } n for (j = 0; j < 10; j++) { n printf( %d , f[j]); n } n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2010, M = N * N; n int n, m, dist[N][N], deg[N][N], fx[N][N], fy[N][N]; n char str[N][N]; n pair p[M]; n int hh, tt; n bool st[N][N]; n void topsort() { n hh = 0; n tt = -1; n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) { n dist[i][j] = 1; n fx[i][j] = i; n fy[i][j] = j; n if (!deg[i][j]) p[++tt] = {i, j}; n } n pair u; n int x, y, distance; n while (hh <= tt) { n u = p[hh++]; n x = u.first, y = u.second, distance = dist[x][y]; n if (str[x][y] == U ) n x--; n else if (str[x][y] == D ) n x++; n else if (str[x][y] == L ) n y--; n else if (str[x][y] == R ) n y++; n if (x <= 0 || x > n || y <= 0 || y > m) continue; n deg[x][y]--; n if (!deg[x][y]) p[++tt] = {x, y}; n if (dist[x][y] < distance + 1) { n dist[x][y] = distance + 1; n fx[x][y] = fx[u.first][u.second]; n fy[x][y] = fy[u.first][u.second]; n } n } n } n void dfs(int x, int y) { n if (st[x][y]) return; n p[tt++] = {x, y}; n st[x][y] = 1; n if (str[x][y] == U ) n x--; n else if (str[x][y] == D ) n x++; n else if (str[x][y] == L ) n y--; n else if (str[x][y] == R ) n y++; n dfs(x, y); n } n int main() { n int T, res, x, y; n cin >> T; n while (T--) { n cin >> n >> m; n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) deg[i][j] = st[i][j] = 0; n for (int i = 1; i <= n; ++i) { n scanf( %s , str[i] + 1); n for (int j = 1; j <= m; ++j) { n int x = i, y = j; n if (str[i][j] == U ) x--; n if (str[i][j] == D ) x++; n if (str[i][j] == L ) y--; n if (str[i][j] == R ) y++; n if (x <= 0 || x > n || y <= 0 || y > m) continue; n deg[x][y]++; n } n } n topsort(); n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) n if (deg[i][j]) { n tt = 0; n dfs(i, j); n for (int k = 0; k < tt; ++k) { n int x = p[k].first, y = p[k].second; n deg[x][y] = 0; n dist[x][y] += tt - 1; n } n } n res = 0; n for (int i = 1; i <= n; ++i) n for (int j = 1; j <= m; ++j) n if (res < dist[i][j]) { n res = dist[i][j]; n x = fx[i][j]; n y = fy[i][j]; n } n cout << x << << y << << res << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = 3.1415926536; n int n, m, spaces; n bool a[100005], vis[505][505]; n void walk(int x, int y, string s) { n int counter = 1; n for (int i = 0; i < s.size(); i++) { n if (s[i] == U ) { n if (x > 1) { n x--; n if (!vis[x][y]) spaces--, vis[x][y] = 1, a[counter] = 1; n } n } else if (s[i] == D ) { n if (x < n) { n x++; n if (!vis[x][y]) spaces--, vis[x][y] = 1, a[counter] = 1; n } n } else if (s[i] == R ) { n if (y < m) { n y++; n if (!vis[x][y]) spaces--, vis[x][y] = 1, a[counter] = 1; n } n } else { n if (y > 1) { n y--; n if (!vis[x][y]) spaces--, vis[x][y] = 1, a[counter] = 1; n } n } n counter++; n } n if (a[s.size()]) spaces++; n } n int main() { n int x, y; n string s; n cin >> n >> m >> x >> y >> s; n spaces = n * m - 1; n vis[x][y] = 1; n walk(x, y, s); n cout << 1 ; n for (int i = 1; i < s.size(); i++) cout << a[i] << ; n cout << spaces << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = (long long)1e12; n const int maxn = 100050; n struct STU { n int b, c, id; n bool operator<(const STU &s) const { n return c < s.c || (c == s.c && id < s.id); n } n }; n map mp; n bool cmp(const STU &a, const STU &b) { return a.b < b.b; } n struct BUG { n int a, id; n bool operator<(const BUG &s) const { return a < s.a; } n }; n STU stu[maxn]; n BUG bug[maxn]; n int N, M, S; n int ans[maxn]; n bool judge(int times) { n mp.clear(); n long long pass = 0; n int p = M - 1, q = N - 1; n map::iterator it; n for (; p >= 0; p--) { n while (q >= 0 && stu[q].b >= bug[p].a) { n mp[stu[q]] = times; n q--; n } n if (p == M - 1 || it->second <= 0) { n if (p != M - 1) mp.erase(it); n it = mp.begin(); n if (it == mp.end()) return false; n pass += it->first.c; n } n ans[bug[p].id] = it->first.id; n it->second--; n } n return pass <= S; n } n int main() { n scanf( %d%d%d , &N, &M, &S); n int max_a = 0; n for (int i = 0; i < M; i++) n scanf( %d , &bug[i].a), bug[i].id = i + 1, max_a = max(max_a, bug[i].a); n for (int i = 0; i < N; i++) scanf( %d , &stu[i].b); n for (int i = 0; i < N; i++) scanf( %d , &stu[i].c), stu[i].id = i + 1; n bool ok = false; n for (int i = 0; i < N; i++) n if (stu[i].b >= max_a && stu[i].c <= S) ok = true; n if (!ok) { n printf( NO n ); n return 0; n } else n printf( YES n ); n sort(bug, bug + M); n sort(stu, stu + N, cmp); n int L = 1, H = M, mid; n while (L < H) { n mid = L + (H - L) / 2; n if (judge(mid)) n H = mid; n else n L = mid + 1; n } n judge(L); n for (int i = 1; i < M; i++) printf( %d , ans[i]); n printf( %d n , ans[M]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n, i; n cin >> n; n string s; n int ans = 0; n cin >> s; n for (i = 1; i < n; i++) { n if (s[i] != s[0]) break; n } n if (i != n) { n int c = 1; n for (int j = i + 1; j != i; j = (j + 1) % n) { n if ((j != 0 && s[j] == s[j - 1]) || (j == 0 && s[0] == s[n - 1])) { n c++; n } else { n while (c >= 3) { n ans++; n c -= 3; n } n c = 1; n } n } n while (c >= 3) { n ans++; n c -= 3; n } n } else { n int c = n - 1; n ans = 1; n while (c >= 3) { n ans++; n c -= 3; n } n } n cout << ans << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long a, b, c, Minus, tmp, pos, lar_pos, ans; n long long gcd(long long a, long long b) { n if (b == 0) return a; n return gcd(b, a % b); n } n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } n long long f(long long a, long long b) { n if (b == 0) n return 0ll; n else n return 1ll + f(a, b - gcd(a, b)); n } n vector v, base; n int main() { n scanf( %lld %lld , &a, &b); n c = a; n for (long long i = 2; i * i <= c; i++) { n if (a % i == 0ll) v.push_back(i); n while (a % i == 0ll) a /= i; n } n if (a != 1ll) v.push_back(a); n for (int i = (0); i < (v.size()); i++) base.push_back(v[i]); n a = c; n while (b > 0) { n Minus = gcd(a, b); n for (int i = (0); i < (v.size()); i++) n while (Minus % v[i] == 0) v[i] *= base[i]; n lar_pos = 0ll; n for (int i = (0); i < (v.size()); i++) { n if (a % v[i] != 0ll) continue; n tmp = lcm(Minus, v[i]); n pos = b / tmp * tmp; n lar_pos = max(pos, lar_pos); n } n ans += (b - lar_pos) / Minus; n b = lar_pos; n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N, M, K; n vector > r, rr; n int main() { n scanf( %d %d %d , &N, &M, &K); n if (4 * N * M - 2 * N - 2 * M < K) return !printf( NO ); n printf( YES n ); n int c; n char d; n c = M - 1; n d = R ; n r.push_back({min(c, K), d}); n K -= c; n if (K <= 0) goto END; n for (int i = 0; i < M - 1; i++) { n c = N - 1; n d = D ; n r.push_back({min(c, K), d}); n K -= c; n if (K <= 0) goto END; n c = N - 1; n d = U ; n r.push_back({min(c, K), d}); n K -= c; n if (K <= 0) goto END; n c = 1; n d = L ; n r.push_back({min(c, K), d}); n K -= c; n if (K <= 0) goto END; n } n for (int i = 0; i < N - 1; i++) { n c = 1; n d = D ; n r.push_back({min(c, K), d}); n K -= c; n if (K <= 0) goto END; n c = M - 1; n d = R ; n r.push_back({min(c, K), d}); n K -= c; n if (K <= 0) goto END; n c = M - 1; n d = L ; n r.push_back({min(c, K), d}); n K -= c; n if (K <= 0) goto END; n } n c = N - 1; n d = U ; n r.push_back({min(c, K), d}); n K -= c; n if (K <= 0) goto END; n END: n for (int i = 0; i < r.size(); i++) n if (r[i].first > 0) rr.push_back(r[i]); n r = rr; n printf( %d n , r.size()); n for (int i = 0; i < r.size(); i++) printf( %d %c n , r[i].first, r[i].second); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1000020; n const int maxx = 1000000; n const int MOd = 1e9 + 7; n const int K = 1000; n const int P = 143; n int loc[maxn]; n class Aho_Corasick { n public: n int last, next[maxn][26]; n short used[maxn][26], step; n int deg[maxn], dad[maxn]; n int dep, fail[maxn]; n char name[maxn]; n int now[maxn], pre[maxn], E, go[maxn]; n int beg[maxn], end[maxn], cnt; n int n, segment[1 << 21]; n vector w[maxn]; n void update(int k, int x) { n for (int l = beg[k] + n - 1, r = end[k] + n - 1; l <= r; n l = (l + 1) >> 1, r = (r - 1) >> 1) { n if (l & 1) segment[l] += x; n if (~r & 1) segment[r] += x; n } n } n inline void add(int i, int j) { n pre[++E] = now[i]; n now[i] = E; n go[E] = j; n } n void calc() { n for (int l = 1; l <= dep; l++) { n for (int i = now[l]; i; i = pre[i]) { n int t = fail[dad[go[i]]]; n char c = name[go[i]]; n while (t && used[t][c] != step) t = fail[t]; n if (used[t][c] == step && next[t][c] != go[i]) t = next[t][c]; n fail[go[i]] = t; n w[t].push_back(go[i]); n } n } n } n void dfs(int n) { n beg[n] = ++cnt; n for (int i = 0; i < w[n].size(); i++) dfs(w[n][i]); n end[n] = cnt; n } n inline long long find(int k) { n long long ret = 0; n for (k += n - 1; k; k >>= 1) ret += segment[k]; n return ret; n } n void build(char *ar, int sz, int id) { n int p = 0; n for (int i = 1; i <= sz; i++) { n char h = ar[i] - a ; n if (used[p][h] != step) { n used[p][h] = step; n next[p][h] = ++last; n deg[last] = deg[p] + 1; n dep = max(dep, (deg[last])); n dad[last] = p; n name[last] = h; n add(deg[last], last); n } n p = next[p][h]; n if (i == sz) loc[id] = p; n } n } n long long get(char *ar, int sz) { n long long ret = 0; n int p = 0; n for (int i = 1; i <= sz; i++) { n char c = ar[i] - a ; n while (p && used[p][c] != step) p = fail[p]; n if (used[p][c] == step) p = next[p][c]; n ret += find(beg[p]); n } n return ret; n } n } trie; n int len[maxn]; n bool exist[maxn], used[maxn]; n char ch[maxn]; n int q, a; n char *ar[maxn]; n int main() { n scanf( %d %d , &q, &a); n trie.n = 1 << 20; n trie.step = 1; n for (int i = 1; i <= a; i++) { n scanf( %s , ch); n exist[i] = 1; n ar[i] = new char[strlen(ch) + 20]; n memset(ar[i], 0, sizeof(ar[i])); n len[i] = strlen(ch); n for (int j = 1; j <= len[i]; j++) { n ar[i][j] = ch[j - 1]; n ch[j - 1] = 0; n } n trie.build(ar[i], len[i], i); n } n trie.calc(); n trie.dfs(0); n for (int i = 1; i <= a; i++) trie.update(loc[i], 1); n vector w; n while (q--) { n char c; n int x; n scanf( %c , &c); n if (c == ? ) { n scanf( %s , ch + 1); n int l = strlen(ch + 1); n cout << trie.get(ch, l) << endl; n } n if (c == - || c == + ) { n scanf( %d , &x); n if (c == - && exist[x]) trie.update(loc[x], -1), exist[x] = 0; n if (c == + && !exist[x]) trie.update(loc[x], 1), exist[x] = 1; n } n } n return 0; n } n "} +{"func_code_string": "#include n int main(int argc, char const *argv[]) { n int h1, a1, c1, h2, a2; n std::cin >> h1 >> a1 >> c1; n std::cin >> h2 >> a2; n std::string s = STRIKE n , h = HEAL n ; n int n(0); n std::string ans; n while (h2 > 0) { n n++; n if (h1 <= a2 && h2 > a1) { n h1 += c1; n ans += h; n } else { n h2 -= a1; n ans += s; n } n h1 -= a2; n } n std::cout << n << n ; n std::cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int t[123]; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int a, n; n cin >> n >> a; n --a; n for (int i = 0; i < n; ++i) cin >> t[i]; n int l, r; n l = r = a; n int res = 0; n while (l >= 0 || r < n) { n if (l >= 0 && r < n) { n if (t[l] > 0 && t[r] > 0) res += t[l] + t[r]; n } else if (l >= 0) n res += t[l]; n else n res += t[r]; n --l, ++r; n } n if (t[a] > 0) res--; n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int lsone(int n) { return (n & -n); } n void mult(long long int a[25][25], long long int b[25][25], n long long int c[25][25], int m, int n, int p) { n for (int i = 1; i <= m; i++) { n for (int j = 1; j <= p; j++) { n c[i][j] = 0; n for (int k = 1; k <= n; k++) { n c[i][j] += (a[i][k] * b[k][j]) % 1000000007; n c[i][j] %= 1000000007; n } n } n } n } n void mat_pow(long long int a[25][25], long long int c[25][25], int n, n long long int p) { n if (p == 0) { n for (int i = 1; i <= n; i++) c[i][i] = 1; n } else if (p == 1) { n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) c[i][j] = a[i][j]; n } n } else { n long long int d[25][25]; n mat_pow(a, d, n, p / 2); n if (p % 2) { n long long int e[25][25]; n mult(d, d, e, n, n, n); n mult(e, a, c, n, n, n); n } else { n mult(d, d, c, n, n, n); n } n } n } n long long int pow1(long long int a, long long int b) { n if (b == 0) n return 1ll; n else if (b == 1) n return a; n else { n long long int x = pow1(a, b / 2); n x *= x; n x %= 1000000007; n if (b % 2) { n x *= a; n x %= 1000000007; n } n return x; n } n } n int n, ans[110000]; n int s(int y) { n int ans = 0; n while (y) { n y /= 10; n ans++; n } n return ans; n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n ; n ans[1] = 1; n for (int i = 2; i <= 1e5; i++) { n ans[i] = ans[i - 1] * 10; n ans[i] %= 210; n } n cin >> n; n int req = (210 - ans[n]) % 210; n if (n <= 2) { n cout << -1 << n ; n } else if (n == 3) n cout << 210 << n ; n else { n int numdig = s(req); n cout << 1; n for (int i = 0; i < n - numdig - 1; i++) cout << 0; n cout << req << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2005; n char mp[N][N]; n int deg[N][N]; n int cnt[2], n, m; n int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0}; n string str = >^v ; n bool check(int x, int y) { return x >= 1 && x <= n && y >= 1 && y <= m; } n int main() { n ios ::sync_with_stdio(0); n cin >> n >> m; n for (int i = (int)(1); i <= (int)(n); ++i) { n cin >> (mp[i] + 1); n } n for (int i = (int)(1); i <= (int)(n); ++i) { n for (int j = (int)(1); j <= (int)(m); ++j) { n if (mp[i][j] == . ) { n if ((i + j) & 1) { n cnt[1]++; n } else n cnt[0]++; n } n } n } n if (cnt[0] != cnt[1]) { n cout << Not unique << endl; n return 0; n } else { n queue q; n for (int i = (int)(1); i <= (int)(n); ++i) { n for (int j = (int)(1); j <= (int)(m); ++j) { n if (mp[i][j] == . ) { n for (int k = 0; k < (int)(4); ++k) { n int x = i + dx[k]; n int y = j + dy[k]; n if (check(x, y) && mp[x][y] == . ) { n deg[i][j]++; n } n } n if (deg[i][j] == 1) { n q.push(i); n q.push(j); n } n } n } n } n while (q.size()) { n int x = q.front(); n q.pop(); n int y = q.front(); n q.pop(); n for (int k = 0; k < (int)(4); ++k) { n int tx = x + dx[k]; n int ty = y + dy[k]; n if (check(tx, ty) && mp[tx][ty] == . && deg[tx][ty] > 0) { n mp[x][y] = tmp[k]; n mp[tx][ty] = str[k]; n deg[tx][ty] = 0; n deg[x][y] = 0; n for (int t = 0; t < (int)(4); ++t) { n int ax = tx + dx[t]; n int ay = ty + dy[t]; n if (check(ax, ay) && mp[ax][ay] == . && deg[ax][ay] > 0) { n deg[ax][ay]--; n if (deg[ax][ay] == 1) { n q.push(ax); n q.push(ay); n } n } n } n break; n } n } n } n for (int i = (int)(1); i <= (int)(n); ++i) { n for (int j = (int)(1); j <= (int)(m); ++j) { n if (deg[i][j] > 0 || mp[i][j] == . ) { n cout << Not unique << endl; n return 0; n } n } n } n for (int i = (int)(1); i <= (int)(n); ++i) { n cout << mp[i] + 1 << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void flash() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n } n void solve() { n long long n; n cin >> n; n vector v(n); n long long sm = 0; n long long mx = 0; n for (long long i = 0; i < n; i++) { n cin >> v[i]; n sm += v[i]; n mx = max(mx, v[i]); n } n function dfs = [&](long long l) -> long long { n if (l <= 0) return 0; n return dfs(l - 1); n }; n long long val1 = mx; n long long val2 = sm - mx; n if (n == 1) { n cout << T n << n ; n return; n } n long long ok = dfs(n); n if (ok > 5) { n cout << T n << n ; n return; n } n ok = dfs(n - 1); n if (ok > 4) { n cout << HL n << n ; n return; n } n if (sm - n == 0) { n if (n % 2) { n cout << T n << n ; n return; n } else { n cout << HL n << n ; n return; n } n } n if (val1 > val2) { n cout << T n << n ; n return; n } n if (sm % 2 == 0) { n cout << HL n << n ; n return; n } else { n cout << T n << n ; n return; n } n } n int32_t main() { n flash(); n long long t; n t = 1; n cin >> t; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool SR(int &_x) { return scanf( %d , &_x) == 1; } n bool SR(long long &_x) { return scanf( %lld , &_x) == 1; } n bool SR(double &_x) { return scanf( %lf , &_x) == 1; } n bool SR(char *_s) { return scanf( %s , _s) == 1; } n bool RI() { return true; } n template n bool RI(I &_x, T &..._tail) { n return SR(_x) && RI(_tail...); n } n void SP(const int _x) { printf( %d , _x); } n void SP(const long long _x) { printf( %lld , _x); } n void SP(const double _x) { printf( %.16lf , _x); } n void SP(const char *s) { printf( %s , s); } n void PL() { puts( ); } n template n void PL(const I _x, const T... _tail) { n SP(_x); n if (sizeof...(_tail)) putchar( ); n PL(_tail...); n } n const int maxn = 1e6 + 6; n char in[maxn]; n void read() { RI(in); } n deque q; n void build() { n q = deque(in, in + strlen(in)); n while (((int)(q).size()) && q[0] == F ) q.pop_front(); n } n void sol() { n int prv = 0, cur = 0, cnt = 0; n for (int i = 0; i < int(((int)(q).size())); i++) n if (q[i] == F ) { n swap(prv, cur); n cur = max(prv + 1, i - (cnt++)); n } n PL(cur); n } n int main() { n read(); n build(); n sol(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n int n, a[100005], sta[100005]; n vector V; n int calc(int k) { n while (k) { n int d = k % 10; n k /= 10; n if (d != 4 && d != 7) return 0; n } n return 1; n } n using pii = pair; n int tar[100005], to[100005]; n vector Ans; n void Swap(int first, int second) { n if (first == second) return; n to[tar[first]] = second, to[tar[second]] = first; n swap(tar[second], tar[first]); n Ans.push_back(pii(first, second)); n return; n } n int main() { n V.resize(1100800); n for (auto first : V) first = rand(); n scanf( %d , &n); n int g = 0, pos = -1; n vector vec; n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n sta[i] = calc(a[i]); n g += sta[i]; n if (sta[i]) pos = i; n vec.push_back(pii(a[i], i)); n } n sort(vec.begin(), vec.end()); n for (int i = 0; i < vec.size(); i++) { n tar[vec[i].second] = i + 1; n to[i + 1] = vec[i].second; n } n if (g == 0) { n bool flag = 0; n for (int i = 1; i < n; i++) n if (a[i] > a[i + 1]) flag = 1; n if (flag) n puts( -1 ); n else n puts( 0 ); n } else { n assert(pos > 0); n for (int i = 1; i <= n; i++) { n Swap(pos, i); n pos = i; n int prv = to[i]; n Swap(pos, to[i]); n pos = prv; n } n int sz = Ans.size(); n printf( %d n , sz); n for (auto first : Ans) { n printf( %d %d n , first.first, first.second); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct node { n int lb, rb, l_max, r_max, s_max; n }; n int n, m, l, r, k, offset = 1 << 19, a[300004], z, t; n long long d[600004]; n node trn[1100000]; n int sgn(long long x) { n if (x > 0) return 1; n if (x < 0) return -1; n return 0; n } n void update(int pos) { n if (pos < 0) return; n if (d[pos + 1] == 0) { n trn[pos + offset].l_max = 0; n trn[pos + offset].r_max = 0; n trn[pos + offset].s_max = 0; n } else { n trn[pos + offset].l_max = 1; n trn[pos + offset].r_max = 1; n trn[pos + offset].s_max = 1; n } n pos = (pos + offset) >> 1; n while (pos > 0) { n z = 2 * pos; n trn[pos].s_max = max(trn[z].s_max, trn[z + 1].s_max); n trn[pos].l_max = trn[z].l_max; n trn[pos].r_max = trn[z + 1].r_max; n if (sgn(d[trn[z].rb]) >= sgn(d[trn[z + 1].lb])) { n int len = trn[z].r_max + trn[z + 1].l_max; n trn[pos].s_max = max(len, trn[pos].s_max); n if (trn[z].l_max == trn[z].rb - trn[z].lb + 1) n trn[pos].l_max += trn[z + 1].l_max; n if (trn[z + 1].r_max == trn[z + 1].rb - trn[z + 1].lb + 1) n trn[pos].r_max += trn[z].r_max; n } n pos = pos >> 1; n } n } n int readInt() { n bool mnus = false; n int result = 0; n char ch; n ch = getchar(); n while (true) { n if (ch == - ) break; n if (ch >= 0 && ch <= 9 ) break; n ch = getchar(); n } n if (ch == - ) n mnus = true; n else n result = ch - 0 ; n while (true) { n ch = getchar(); n if (ch < 0 || ch > 9 ) break; n result = result * 10 + (ch - 0 ); n } n if (mnus) n return -result; n else n return result; n } n int main() { n std::ios::sync_with_stdio(false); n n = readInt(); n for (int i = 1; i <= n; ++i) a[i] = readInt(); n for (int i = 1; i < n; ++i) d[i] = a[i + 1] - a[i]; n for (int i = 0; i < offset; ++i) { n trn[i + offset].lb = i + 1; n trn[i + offset].rb = i + 1; n if (d[i + 1] == 0) { n trn[i + offset].l_max = 0; n trn[i + offset].r_max = 0; n trn[i + offset].s_max = 0; n } else { n trn[i + offset].l_max = 1; n trn[i + offset].r_max = 1; n trn[i + offset].s_max = 1; n } n } n for (int i = offset - 1; i >= 1; --i) { n t = 2 * i; n trn[i].lb = trn[t].lb; n trn[i].rb = trn[t + 1].rb; n trn[i].s_max = max(trn[t].s_max, trn[t + 1].s_max); n trn[i].l_max = trn[t].l_max; n trn[i].r_max = trn[t + 1].r_max; n if (sgn(d[trn[t].rb]) >= sgn(d[trn[t + 1].lb])) { n int len = trn[t].r_max + trn[t + 1].l_max; n trn[i].s_max = max(len, trn[i].s_max); n if (trn[t].l_max == trn[t].rb - trn[t].lb + 1) n trn[i].l_max += trn[t + 1].l_max; n if (trn[t + 1].r_max == trn[t + 1].rb - trn[t + 1].lb + 1) n trn[i].r_max += trn[t].r_max; n } n } n m = readInt(); n for (int i = 0; i < m; ++i) { n l = readInt(); n r = readInt(); n k = readInt(); n d[l - 1] += k; n d[r] -= k; n d[0] = 0; n d[n] = 0; n update(l - 2); n update(r - 1); n cout << trn[1].s_max + 1 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 0x7fffffff; n const double eps = 1e-10; n const double pi = acos(-1.0); n inline int read() { n int x = 0, f = 1; n char ch; n ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n return x * f; n } n const int N = 2e5 + 10; n int n, a, b, k; n string s; n int mark[N]; n int tot, ans[N]; n int main() { n n = read(); n a = read(); n b = read(); n k = read(); n cin >> s; n for (int i = 1; i <= n; i++) mark[i] = (s[i - 1] - 0 ); n int cnt = 0; n for (int i = 1; i <= n; ++i) n if (mark[i]) n cnt = 0; n else { n if (++cnt == b) { n ans[++tot] = i; n cnt = 0; n } n } n tot -= a - 1; n printf( %d n , tot); n for (int i = 1; i <= tot; i++) printf( %d , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n const long long int mrx = 1e6 + 5, M = 1e9 + 7; n long long int mx = INT_MIN, mn = INT_MAX; n using namespace std; n long long int x1, x2, s, t1, t2, p, d; n long long int poezd, igor; n int main() { n ios_base::sync_with_stdio(NULL); n cin.tie(NULL); n cin >> s >> x1 >> x2; n cin >> t1 >> t2; n cin >> p >> d; n if (t2 <= t1) { n cout << abs(x1 - x2) * t2; n return 0; n } else { n if (d == 1) { n if (x1 < x2) { n if (p == x1) { n cout << (x2 - x1) * t1; n } else if (p < x1) { n cout << min((x2 - x1) * t2, (x2 - p) * t1); n } else { n cout << min((x2 - x1) * t2, (s - p) * t1 + s * t1 + x2 * t1); n } n } else { n cout << min((x1 - x2) * t2, (s - p) * t1 + (s - x2) * t1); n } n } n if (d == -1) { n if (x1 < x2) { n cout << min((x2 - x1) * t2, p * t1 + x2 * t1); n } else { n if (p == x1) { n cout << (x1 - x2) * t1; n } else if (p < x1) { n cout << min((x1 - x2) * t2, p * t1 + s * t1 + (s - x2) * t1); n } else { n cout << min((x1 - x2) * t2, (p - x2) * t1); n } n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cin >> n; n int sl = 0; n for (int i = 1; i <= n; ++i) { n int x, y; n cin >> x >> y; n if (x > 0) ++sl; n } n if (sl == n || sl == 0 || sl == n - 1 || sl == 1) { n cout << Yes ; n return 0; n } n cout << No ; n } n "} +{"func_code_string": "#include n using namespace std; n template n void printQueue(T& q) { n while (!q.empty()) { n cout << q.top() << endl; n q.pop(); n } n } n vector adj[200009]; n vector > levels; n bool visited[200009]; n bool cmp(pair a, pair b) { n if (a.first == b.first) { n return a.second < b.second; n } else { n return a.first > b.first; n } n } n void dfs(int s, int level) { n visited[s] = true; n levels.push_back(make_pair(level, s)); n for (int i = 0; i < adj[s].size(); i++) { n if (visited[adj[s][i]] == false) { n dfs(adj[s][i], level + 1); n } n } n } n int main() { n int t = 1; n while (t--) { n int n, x; n cin >> n; n long long dp[n + 1][2]; n memset(dp, 0, sizeof(dp)); n for (int i = 1; i < n; i++) { n cin >> x; n adj[x].push_back(i); n adj[i].push_back(x); n } n dfs(1, 1); n for (int j = 0; j < n; j++) { n cin >> x; n if (x == 1) { n dp[j][0] = 1; n dp[j][1] = 0; n } else { n dp[j][0] = 0; n dp[j][1] = 1; n } n } n sort(levels.begin(), levels.end(), cmp); n bool visit[n + 1]; n memset(visit, false, sizeof(visit)); n int index; n for (int i = 0; i < levels.size(); i++) { n visit[levels[i].second] = true; n index = levels[i].second; n for (int j = 0; j < adj[index].size(); j++) { n if (visit[adj[index][j]] == false) { n dp[adj[index][j]][0] = n ((dp[index][0] * dp[adj[index][j]][0]) % 1000000007ll) + n ((dp[index][0] * dp[adj[index][j]][1]) % 1000000007ll) + n ((dp[index][1] * dp[adj[index][j]][0]) % 1000000007ll); n dp[adj[index][j]][0] %= 1000000007ll; n dp[adj[index][j]][1] = n ((dp[index][0] * dp[adj[index][j]][1]) % 1000000007ll) + n ((dp[index][1] * dp[adj[index][j]][1]) % 1000000007ll); n dp[adj[index][j]][1] %= 1000000007ll; n } n } n } n cout << dp[1][0] << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n void compute() { n long long n; n cin >> n; n n -= 2; n string s[n]; n cin >> s[0]; n string ans = s[0]; n for (long long i = 1; i < n; i++) { n cin >> s[i]; n if (s[i][0] == ans[ans.size() - 1]) n ans.push_back(s[i][1]); n else n ans += s[i]; n } n if (ans.size() != n + 2) ans.push_back( a ); n cout << ans << endl; n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long t; n cin >> t; n while (t--) { n compute(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector ans; n int m; n int main() { n int n, ans = 0; n string s; n cin >> n; n cin >> s; n for (int i = 0; i < n; i++) n if (s[i] == < ) n ans++; n else n break; n for (int i = n - 1; i >= 0; i--) n if (s[i] == > ) n ans++; n else n break; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1000 * 1000 * 1000 + 7LL; n const double EXP = 1e-6; n const int MAX = 100001; n int main() { n int n, k; n while (cin >> n >> k) { n int a[10001]; n for (int i = 1; i <= n; i++) a[i] = 1; n a[n] = 0; n while (k--) { n for (int i = 1; i <= n; i++) { n if (a[i] + a[i] > n - i) { n int p = n - i - a[i]; n int o = n - p; n a[i] += a[o]; n cout << o << ; n } else if (a[i] == n - i) n cout << n << ; n else { n a[i] += a[i]; n cout << i << ; n } n } n cout << endl; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char s[100010], s1[100010], s2[100010], s3[100010], s11[100010]; n int main() { n scanf( %s , &s); n int len; n len = strlen(s); n int sum = 0, a = 0; n for (int i = 0; i < len; i++) { n sum += s[i] - 0 ; n if (s[i] == 0 ) a = 1; n } n if (sum % 3 == 0) { n int cnt = 0; n for (int i = 0; i < len - 1; i++) { n if (s[i] != 0 ) n break; n else n cnt++; n } n int j = 0; n for (int i = cnt; i < len; i++) s1[j++] = s[i]; n cout << s1 << endl; n } else { n int num = sum % 3; n int cnt1 = -1, cnt2 = -1, cnt3 = -1; n int t1 = 0, t2 = 0; n for (int i = len - 1; i >= 0; i--) { n if ((s[i] - 0 ) % 3 == num) { n cnt1 = i; n break; n } n } n if (cnt1 != -1) { n int j = 0; n for (int i = 0; i < len; i++) { n if (i == cnt1) n continue; n else n s1[j++] = s[i]; n } n int cnt = 0; n for (int i = 0; i < j - 1; i++) { n if (s1[i] != 0 ) n break; n else n cnt++; n } n for (int i = cnt; i < j; i++) s2[t1++] = s1[i]; n } n for (int i = len - 1; i >= 1; i--) { n if ((s[i] - 0 ) % 3 == 0) continue; n for (int j = i - 1; j >= 0; j--) { n int cnt = s[i] - 0 + s[j] - 0 ; n if (cnt % 3 == num) { n cnt2 = i; n cnt3 = j; n break; n } n } n if (cnt2 != -1 && cnt3 != -1) break; n } n if (cnt2 != -1 && cnt3 != -1) { n int j = 0; n for (int i = 0; i < len; i++) { n if (i == cnt2 || i == cnt3) continue; n s11[j++] = s[i]; n } n int cnt = 0; n for (int i = 0; i < j - 1; i++) { n if (s11[i] != 0 ) n break; n else n cnt++; n } n for (int i = cnt; i < j; i++) s3[t2++] = s11[i]; n } n if (!a && t1 == 0 && t2 == 0) n cout << -1 << endl; n else if (t1 == 0 && t2 == 0) n cout << 0 << endl; n else if (t1 >= t2) n cout << s2 << endl; n else n cout << s3 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void sprint(string s) { n for (int i = 0; i < s.size(); ++i) printf( %c , s[i]); n printf( n ); n } n int main() { n int n, k, d; n cin >> n >> k >> d; n int a[n]; n int b[n]; n for (int i = 0; i < n; ++i) { n scanf( %d , &a[i]); n b[i] = 0; n } n sort(a, a + n); n if (k == 1) b[n - 1] = 1; n for (int i = n - 2; i >= 0; --i) { n if (n - i < k) continue; n if (n - i >= k and a[n - 1] - a[i] <= d) n b[i] = b[i + 1] + 1; n else if (a[i + k - 1] - a[i] > d) n b[i] = b[i + 1]; n else { n auto it = upper_bound(a, a + n, a[i] + d); n it--; n int id = it - a; n if (id < i + k - 1) { n b[i] = b[i + 1]; n } else { n id++; n if (id == n - 1) { n if (b[i + k]) n b[i] = b[i + 1] + 1; n else n b[i] = b[i + 1]; n } else { n if (b[i + k] - b[id + 1] > 0) n b[i] = b[i + 1] + 1; n else n b[i] = b[i + 1]; n } n } n } n } n for (int i = 0; i < n; ++i) { n } n if (n == 1) { n printf( YEs n ); n } else if (b[0] - b[1]) n printf( YES n ); n else n printf( NO n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct myQueue { n stack > s1, s2; n int size() { return s1.size() + s2.size(); } n bool isEmpty() { return size() == 0; } n long long getMax() { n if (isEmpty()) { n return -2e9; n } n if (!s1.empty() && !s2.empty()) { n return max(s1.top().second, s2.top().second); n } n if (!s1.empty()) { n return s1.top().second; n } n return s2.top().second; n } n void push(long long val) { n if (s2.empty()) { n s2.push({val, val}); n } else { n s2.push({val, max(val, s2.top().second)}); n } n } n void pop() { n if (s1.empty()) { n while (!s2.empty()) { n if (s1.empty()) { n s1.push({s2.top().first, s2.top().first}); n } else { n s1.push({s2.top().first, max(s2.top().first, s1.top().second)}); n } n s2.pop(); n } n } n assert(!s1.empty()); n s1.pop(); n } n }; n int main() { n cin.tie(NULL); n cout.tie(NULL); n ios_base::sync_with_stdio(0); n long long n, k, x; n cin >> n >> k >> x; n vector a(n); n for (long long i = 0; i < n; i++) { n cin >> a[i]; n } n vector q(x + 1); n for (long long i = 0; i < n; i++) { n vector dp(x + 1, -2e9); n if (i) n for (long long j = 1; j < x + 1; j++) { n if (i < k && j == 1) dp[j] = a[i]; n long long getMax = q[j - 1].getMax(); n if (getMax != -2e9) dp[j] = max(dp[j], getMax + 1LL * a[i]); n } n if (!i) dp[1] = a[0]; n for (long long j = 1; j < x + 1; j++) { n if (q[j].size() == k) { n q[j].pop(); n } n q[j].push(dp[j]); n } n } n long long ans = q[x].getMax(); n if (ans == -2e9) return cout << -1, 0; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n string s1, s2; n int len1, len2; n int dp[5002][5002]; n int func(int p1, int p2) { n if ((p1 == len1) || (p2 == len2)) { n return 0; n } n if (dp[p1][p2] != -1) { n return dp[p1][p2]; n } n int ans = 0; n if (s1[p1] == s2[p2]) { n ans = (1 + ans + func(p1 + 1, p2 + 1)) % 1000000007; n } n ans = (ans + func(p1, p2 + 1)) % 1000000007; n return dp[p1][p2] = ans; n } n int main() { n std::ios_base::sync_with_stdio(false); n ; n cin >> s1 >> s2; n len1 = s1.size(); n len2 = s2.size(); n memset((dp), -1, sizeof(dp)); n int ans = 0; n for (int i = 0; i <= len1 - 1; i++) { n ans = (ans + func(i, 0)) % 1000000007; n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using namespace std; n int get_type(int a, int b, int c) { n if (a == 0 && b == 0 && c != 0) return 0; n if (a == 0 && b == 0 && c == 0) return -1; n if (a == 0) return 1; n if (b == 0) return 2; n return 3; n } n int main() { n int a1, b1, c1, a2, b2, c2; n cin >> a1 >> b1 >> c1 >> a2 >> b2 >> c2; n int t1 = get_type(a1, b1, c1); n int t2 = get_type(a2, b2, c2); n if (t1 == 0 || t2 == 0) n cout << 0 ; n else if (t1 == -1 || t2 == -1) n cout << -1 ; n else if (t1 != t2) n cout << 1 ; n else { n if (t1 == 1) { n if (c1 * b2 == c2 * b1) n cout << -1 ; n else n cout << 0 ; n } else if (t1 == 2) { n if (c1 * a2 == c2 * a1) n cout << -1 ; n else n cout << 0 ; n } else { n if (b1 * a2 != a1 * b2) n cout << 1 ; n else { n if (c1 * b2 == c2 * b1) n cout << -1 ; n else n cout << 0 ; n } n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 10; n struct node { n long long v[10]; n int tag[10]; n void init(int x) { n int y = 1; n memset(v, 0, sizeof(v)); n while (x) { n v[x % 10] += y; n x /= 10; n y *= 10; n } n } n void updtag(int* _tag) { n for (int i = 0; i < 10; i++) tag[i] = _tag[tag[i]]; n } n bool havetag() { n for (int i = 0; i < 10; i++) n if (tag[i] != i) return 1; n return 0; n } n } f[N * 4]; n int a[N]; n int n, q; n int tag[10]; n long long ans; n void upd(int s) { n for (int i = 0; i < 10; i++) f[s].v[i] = f[s + s].v[i] + f[s + s + 1].v[i]; n } n void build(int l, int r, int s) { n for (int i = 0; i < 10; i++) f[s].tag[i] = i; n if (l == r) { n f[s].init(a[l]); n return; n } n build(l, (l + r) / 2, s + s); n build((l + r) / 2 + 1, r, s + s + 1); n upd(s); n } n long long tmp[10] = {0}; n void down(int l, int r, int s) { n if (!f[s].havetag()) return; n for (int i = 0; i < 10; i++) tmp[f[s].tag[i]] += f[s].v[i]; n for (int i = 0; i < 10; i++) f[s].v[i] = tmp[i], tmp[i] = 0; n if (l != r) f[s + s].updtag(f[s].tag), f[s + s + 1].updtag(f[s].tag); n for (int i = 0; i < 10; i++) f[s].tag[i] = i; n } n void change(int l, int r, int s, int ll, int rr) { n down(l, r, s); n if (r < ll || rr < l) return; n if (ll <= l && r <= rr) { n f[s].updtag(tag); n down(l, r, s); n return; n } n change(l, (l + r) / 2, s + s, ll, rr); n change((l + r) / 2 + 1, r, s + s + 1, ll, rr); n upd(s); n } n void get(int l, int r, int s, int ll, int rr) { n down(l, r, s); n if (r < ll || rr < l) return; n if (ll <= l && r <= rr) { n for (int i = 1; i < 10; i++) ans += f[s].v[i] * i; n return; n } n get(l, (l + r) / 2, s + s, ll, rr); n get((l + r) / 2 + 1, r, s + s + 1, ll, rr); n } n int main() { n scanf( %d %d , &n, &q); n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n } n build(1, n, 1); n while (q--) { n int sig, l, r, x, y; n scanf( %d %d %d , &sig, &l, &r); n if (sig == 1) { n scanf( %d %d , &x, &y); n for (int i = 0; i < 10; i++) tag[i] = i; n tag[x] = y; n change(1, n, 1, l, r); n continue; n } n ans = 0; n get(1, n, 1, l, r); n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n n //#pragma GCC optimize( Ofast,unroll-loops,no-stack-protector ) n //#pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n n n #define pb push_back n #define fi first n #define se second n #define ll long long n #define ld long double n #define lll __int128 n #define tp top() n #define fr front() n #define vi vector n #define sz size() n #define rep(i,a,b) for(int i = a; i < b; ++i) n #define mem(a, b) memset(a, (b), sizeof(a)) n #define clr(a) memset(a, 0, sizeof(a)) n #define sqr(x) ( (x) * (x) ) n #define all(v) v.begin(), v.end() n n typedef pair pii; n typedef pair pip; n typedef pair ppi; n typedef pair ppp; n n n n void nonint(){ n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n } n #define N 200020 n int st[4*N],maksl[4*N], maksr[4*N], minsl[4*N], minsr[4*N]; n n vector vec[N]; n int n; n void merge(int v){ n st[v] = st[v<<1] + st[v<<1|1]; n maksr[v] = max(maksr[v<<1], st[v<<1] + maksr[v<<1|1]); n maksl[v] = max(maksl[v<<1|1], st[v<<1|1] + maksl[v<<1]); n minsr[v] = min(minsr[v<<1], st[v<<1] + minsr[v<<1|1]); n minsl[v] = min(minsl[v<<1|1], st[v<<1|1] + minsl[v<<1]); n } n n void build(int v, int l, int r){ n if (l==r){ n st[v] = 1; n maksl[v] = maksr[v] = minsl[v] = minsr[v] = st[v]; n return; n } n int m = (l+r)>>1; n build(v<<1,l,m); n build(v<<1|1,m+1,r); n merge(v); n } n n void update(int v, int l, int r, int x, int val){ n if (l==r){ n st[v] = val; n maksl[v] = maksr[v] = minsl[v] = minsr[v] = st[v]; n return; n } n int m = (l+r)>>1; n if (x <= m) update(v<<1,l,m,x,val); n else update(v<<1|1,m+1,r,x,val); n merge(v); n // cout< se) return 0; n if (l==ss && r==se) return st[v]; n int m = (l+r)>>1; n return querysum(v<<1,l,m,ss,min(se,m)) + querysum(v<<1|1,m+1,r,max(m+1,ss),se); n } n n int querymaksr(int v, int l, int r, int ss, int se){ n if (ss > se) return -1e9; n if (l == ss && r == se) return maksr[v]; n int m = (l+r)>>1; n ll res = max(querymaksr(v<<1,l,m,ss,min(m,se)), querysum(1,0,n-1,ss,min(m,se)) + querymaksr(v<<1|1,m+1,r,max(m+1,ss),se)); n return res; n } n n int querymaksl(int v, int l, int r, int ss, int se){ n if (ss > se) return -1e9; n if (l == ss && r == se) return maksl[v]; n int m = (l+r)>>1; n return max(querysum(1,0,n-1,max(m+1,ss),se) + querymaksl(v<<1,l,m,ss,min(m,se)), querymaksl(v<<1|1,m+1,r,max(m+1,ss),se)); n } n n int queryminsr(int v, int l, int r, int ss, int se){ n if (ss > se) return 1e9; n if (l == ss && r == se) return minsr[v]; n int m = (l+r)>>1; n return min(queryminsr(v<<1,l,m,ss,min(m,se)), querysum(1,0,n-1,ss,min(m,se)) + queryminsr(v<<1|1,m+1,r,max(m+1,ss),se)); n } n n int queryminsl(int v, int l, int r, int ss, int se){ n if (ss > se) return 1e9; n if (l == ss && r == se) return minsl[v]; n int m = (l+r)>>1; n return min(querysum(1,0,n-1,max(m+1,ss),se) + queryminsl(v<<1,l,m,ss,min(m,se)), queryminsl(v<<1|1,m+1,r,max(m+1,ss),se)); n } n n ll ans[N]; n void solve(){ n cin>>n; n rep(i,0,n) { n int x; cin>>x; n vec[x].pb(i); n } n n build(1,0,n-1); n rep(i,1,n+1){ n for(auto j : vec[i]){ n ll ma1 = max(0,querymaksl(1,0,n-1,0,j-1)); n ll ma2 = max(0,querymaksr(1,0,n-1,j+1,n-1)); n ll mk = ma1+ma2+1; n ans[j] = max(ans[j], mk/2); n } n n rep(j,0,vec[i].sz) update(1,0,n-1,vec[i][j],-1); n n for(auto j : vec[i]){ n ll mi1 = min(0,queryminsl(1,0,n-1,0,j-1)); n ll mi2 = min(0,queryminsr(1,0,n-1,j+1,n-1)); n ll mn = -(mi1+mi2)+1; n ans[j] = max(ans[j], (mn-1)/2); n } n } n rep(i,0,n) cout<>t; n while(t--){ n solve(); n } n return 0; n } n n n n n "} +{"func_code_string": "#include n using namespace std; n vector > > horz, vert, tmp; n set y_com; n map y_map; n void cleanup(vector > >& v) { n sort(v.begin(), v.end()); n for (auto it = v.begin(); it != v.end();) { n if (it != v.begin()) { n auto prev = it; n prev--; n if (prev->first == it->first && n prev->second.second >= it->second.first - 1) { n prev->second.second = max(it->second.second, prev->second.second); n it = v.erase(it); n } else n it++; n } else n it++; n } n } n int BIT[211111]; n void update(int pos, int val) { n while (pos < 211111) { n BIT[pos] += val; n pos += (pos & (-pos)); n } n } n int get(int pos) { n int ans = 0; n while (pos > 0) { n ans += BIT[pos]; n pos -= (pos & (-pos)); n } n return ans; n } n int main() { n ios_base::sync_with_stdio(false); n int n; n cin >> n; n long long ans = 0; n for (int i = 0; i < n; i++) { n int x[2], y[2]; n cin >> x[0] >> y[0] >> x[1] >> y[1]; n x[0] += 1000000001; n x[1] += 1000000001; n y[0] += 1000000001; n y[1] += 1000000001; n if (y[0] == y[1]) { n horz.push_back( n make_pair(y[0], make_pair(min(x[0], x[1]), max(x[0], x[1])))); n } else { n vert.push_back( n make_pair(x[0], make_pair(min(y[0], y[1]), max(y[0], y[1])))); n } n } n cleanup(horz); n cleanup(vert); n for (auto it : horz) { n ans += it.second.second - it.second.first + 1; n y_com.insert(it.first); n } n for (auto it : vert) { n ans += it.second.second - it.second.first + 1; n y_com.insert(it.second.first); n y_com.insert(it.second.second); n } n int cnt = 1; n for (auto it : y_com) y_map[it] = cnt++; n for (auto it : horz) { n tmp.push_back(make_pair(it.second.first, make_pair(it.first, 1))); n tmp.push_back(make_pair(it.second.second + 1, make_pair(it.first, -1))); n } n sort(tmp.begin(), tmp.end()); n int cur = 0; n for (auto it : vert) { n while (cur < tmp.size() && tmp[cur].first <= it.first) { n update(y_map[tmp[cur].second.first], tmp[cur].second.second); n cur++; n } n ans -= get(y_map[it.second.second]) - get(y_map[it.second.first] - 1); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-7; n const int inf = 0x3f3f3f3f; n const int hinf = 0x3f3f3f3f; n const long long mod = 1000000009; n struct node { n int l, r; n double expe; n double add; n } sgt[100010 << 2]; n int n, m; n int a[100010], h[100010], l[100010], r[100010]; n struct mushroom { n int b, z; n bool operator<(const mushroom& bb) const { return b < bb.b; } n } dat[100010]; n void up(int root) { n sgt[root].expe = sgt[root << 1].expe + sgt[root << 1 | 1].expe; n } n void down(int root) { n sgt[root << 1].add *= sgt[root].add; n sgt[root << 1].expe *= sgt[root].add; n sgt[root << 1 | 1].add *= sgt[root].add; n sgt[root << 1 | 1].expe *= sgt[root].add; n sgt[root].add = 1.0; n } n void build(int l, int r, int root) { n sgt[root].l = l; n sgt[root].r = r; n sgt[root].expe = 0.0; n sgt[root].add = 1.0; n if (l == r) { n sgt[root].expe = dat[sgt[root].l].z; n return; n } n int mid = (l + r) >> 1; n build(l, mid, root << 1); n build(mid + 1, r, root << 1 | 1); n up(root); n } n void upd(int l, int r, double val, int root) { n if (l > dat[sgt[root].r].b || r < dat[sgt[root].l].b) return; n if (dat[sgt[root].l].b >= l && dat[sgt[root].r].b <= r) { n sgt[root].add *= val; n sgt[root].expe *= val; n return; n } n down(root); n int mid = (sgt[root].l + sgt[root].r) >> 1; n if (l <= dat[mid].b) upd(l, r, val, root << 1); n if (r >= dat[mid].b) upd(l, r, val, root << 1 | 1); n up(root); n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= n; i++) { n scanf( %d%d%d%d , &a[i], &h[i], &l[i], &r[i]); n } n for (int i = 1; i <= m; i++) { n scanf( %d%d , &dat[i].b, &dat[i].z); n } n sort(dat + 1, dat + 1 + m); n build(1, m, 1); n for (int i = 1; i <= n; i++) { n upd(a[i] - h[i], a[i] - 1, 1.0 - l[i] / 100.0, 1); n upd(a[i] + 1, a[i] + h[i], 1.0 - r[i] / 100.0, 1); n } n printf( %.15lf n , sgt[1].expe); n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-9; n const long long int MOD1 = 1e9 + 7; n const long long int MAX5 = 1e5; n const long long int MAX6 = 1e6; n const long long int MAX7 = 1e7; n const long long int MAX8 = 1e8; n const long long int MAX9 = 1e9; n const long long int MAX10 = 1e10; n const long long int MAXX = 1e18; n long long int pow(long long int x, long long int y) { n long long int res = 1; n while (y > 0) { n res = res * x; n x = x * x; n y >>= 1; n } n return res; n } n long long int gcd(int a, int b) { n if (a < b) swap(a, b); n if (b == 0) return a; n return gcd(a % b, b); n } n void solve() { n int n, q; n cin >> n >> q; n set p; n for (int ii = 0; ii < n; ii++) { n int aa; n cin >> aa; n p.insert(aa); n } n auto it = p.begin(); n multiset m; n m.insert(0); n for (int ii = 0; ii < p.size() - 1; ii++) { n int x = *it; n it++; n m.insert(x - *it); n } n cout << *p.rbegin() - *p.begin() + *m.begin(); n cout << n ; n ; n for (int ii = 0; ii < q; ii++) { n int t, x; n cin >> t >> x; n int y, z; n bool Y = false, Z = false; n if (t == 0) { n it = p.find(x); n if (it != p.begin()) { n it--; n y = *it; n Y = true; n m.erase(m.find(y - x)); n } n it = p.find(x); n if (it != (--p.end())) { n it++; n z = *it; n Z = true; n m.erase(m.find(x - z)); n } n if (Y && Z) m.insert(y - z); n p.erase(x); n } n if (t == 1) { n p.insert(x); n it = p.find(x); n if (it != p.begin()) { n it--; n y = *it; n Y = true; n m.insert(y - x); n } n it = p.find(x); n if (it != (--p.end())) { n it++; n z = *it; n Z = true; n m.insert(x - z); n } n if (Y && Z) m.erase(m.find(y - z)); n } n if (!p.empty()) n cout << *p.rbegin() - *p.begin() + *m.begin(); n else n cout << 0; n cout << n ; n ; n } n } n int main() { n { solve(); } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n pair mmx[3]; n for (int i = 0; i < 3; i++) cin >> mmx[i].first >> mmx[i].second; n int a, b, c; n a = min(n - mmx[1].first - mmx[2].first, mmx[0].second); n b = min(n - a - mmx[2].first, mmx[1].second); n c = n - a - b; n cout << a << << b << << c; n return 0; n } n "} +{"func_code_string": "#include n n using namespace :: std; n n #define ll long long n #define mp make_pair n #define ld long double n #define F first n #define S second n #define pii pair n #define pb push_back n n const int maxn=2e5+500; n const int inf=1e9+900; n const int mod=1e9+7; n n pair tip,che; n n ld lenght(pair a){ n return sqrt(a.F*a.F+a.S*a.S); n } n bool mibin(pair x){ n complex a,b; n a.real(((ld)(che.F)-(x.F))); n a.imag(((ld)(che.S)-(x.S))); n b.real(((ld)(che.F)-(tip.F))); n b.imag(((ld)(che.S)-(tip.S))); n a*=-1; n b*=-1; n if(arg(a)<=0 && arg(b)<=0){ n return (arg(a)<=arg(b)); n } n if(arg(a)>=0 && arg(b)>=0){ n return (arg(a)<=arg(b)); n } n if(arg(a)>=0 && arg(b)<=0){ n return 1; n } n if(arg(a)<=0 && arg(b)>=0){ n return 0; n } n return (arg(a)<=arg(b)); n } n n void add(pair x){ n if(mibin(mp((ld)x.F,(ld)x.S))){ n tip=x; n } n } n ld mibine(pair s,pair t){ n pair v=mp(t.F-s.F,t.S-s.S); n if(!mibin(s)){ n // cout<< NOting n ; n return 0; n } n if(mibin(t)){ n // cout<< ALL n ; n return lenght(v); n } n ld b=0; n ld e=1; n for(int i=0;i<60;i++){ n ld mid=(e+b)/2; n if(mibin(mp((s.F)+mid*(v.F),(s.S)+mid*(v.S)))){ n b=mid; n }else{ n e=mid; n } n } n // cout<>n>>h; n for(int i=0;i>x[i]>>y[i]; n } n ld ans=lenght(mp(x[n-1]-x[n-2],y[n-1]-y[n-2])); n tip=mp(x[n-2],y[n-2]); n che=mp(x[n-1],y[n-1]+h); n for(int i=n-3;i>=0;i--){ n add(mp(x[i+1],y[i+1])); n ans+=mibine(mp(x[i],y[i]),mp(x[i+1],y[i+1])); n } n cout< n using namespace std; n template n T read1() { n T t = 0; n char k; n bool v = 0; n do (k = getchar()) == - && (v = 1); n while ( 0 > k || k > 9 ); n while ( 0 <= k && k <= 9 ) n t = (t << 3) + (t << 1) + (k ^ 0 ), k = getchar(); n return v ? -t : t; n } n int v[1200005], s, fl[1200005], w[1200005]; n vector > > a[300005], b; n void down(int d) { n fl[d << 1] += fl[d]; n fl[d << 1 | 1] += fl[d]; n v[d << 1] += fl[d]; n v[d << 1 | 1] += fl[d]; n fl[d] = 0; n } n void up(int d) { n v[d << 1] > v[d << 1 | 1] ? (w[d] = w[d << 1], v[d] = v[d << 1]) n : (w[d] = w[d << 1 | 1], v[d] = v[d << 1 | 1]); n } n void add(int l, int r, int x, int y, int z, int d) { n if (l == x && r == y) { n v[d] += z, fl[d] += z; n return; n } n down(d); n int mid = l + r >> 1; n if (y <= mid) n add(l, mid, x, y, z, d << 1); n else if (mid < x) n add(mid + 1, r, x, y, z, d << 1 | 1); n else n add(l, mid, x, mid, z, d << 1), add(mid + 1, r, mid + 1, y, z, d << 1 | 1); n up(d); n } n void build(int l, int r, int d) { n if (l == r) n w[d] = l; n else { n build(l, l + r >> 1, d << 1); n build(l + r + 2 >> 1, r, d << 1 | 1); n w[d] = w[d << 1]; n } n } n int wh, g; n int main() { n s = read1(); n build(1, 300000, 1); n for (int i = 1; i <= s; ++i) { n int l = read1(), v = read1(), r = read1(); n b.push_back(make_pair(l, make_pair(v, r))); n a[l].push_back(make_pair(1, make_pair(v, r))); n a[v + 1].push_back(make_pair(-1, make_pair(v, r))); n } n int ans = 0; n for (int i = 1; i <= 300000; ++i) { n for (int j = 0; j < a[i].size(); ++j) n add(1, 300000, a[i][j].second.first, a[i][j].second.second, a[i][j].first, n 1); n if (v[1] > ans) ans = v[1], wh = i, g = w[1]; n } n cout << ans << endl; n for (int i = 0; i < s; ++i) n if (b[i].first <= wh && wh <= b[i].second.first && b[i].second.first <= g && n g <= b[i].second.second) n printf( %d , i + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int c, d, n, m, k; n cin >> c >> d >> n >> m >> k; n int users = n * m - k; n int ans = 1000000000; n for (int i = 0; i <= m; i++) n for (int j = 0; j <= 10000; j++) { n if (i * n + j >= users) { n if (c * i + j * d < ans) ans = c * i + j * d; n } n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int a[10001]; n int i, j, n, k; n int main() { n cin >> n; n for (i = 0; i < n; i++) n for (j = 0; j < n; j++) { n cin >> k; n if (k == 3 || k == 1) a[i] = -1; n } n k = 0; n for (i = 0; i < n; i++) n if (a[i] != -1) k++; n cout << k << n ; n for (i = 0; i < n && k > 0; i++) n if (a[i] != -1) cout << i + 1 << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int i; n int n, d, l; n cin >> n >> d >> l; n int pos = (n + 1) / 2; n int neg = n / 2; n int a[n + 1]; n if (d > (pos * l - neg) || d < (pos - neg * l)) { n cout << -1 ; n return 0; n } n if (d > 0) { n for (i = 1; i <= n; i++) a[i] = 1; n i = 1; n if (n & 1) d--; n while (d) { n a[2 * i - 1] += min(l - 1, d); n d -= min(l - 1, d); n i++; n } n } else { n for (i = 1; i <= n; i++) a[i] = 1; n i = 1; n d = -d; n if (n & 1) d++; n while (d) { n a[2 * i] += min(l - 1, d); n d -= min(l - 1, d); n i++; n } n } n for (i = 1; i <= n; i++) cout << a[i] << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 2e5 + 10; n int n, m; n bool lie[40]; n int ask(int d) { n int ret; n cout << d << endl; n cin >> ret; n if (ret == 0) exit(0); n return ret; n } n int main() { n cin >> m >> n; n for (int i = 0; i < n; i++) n if (ask(m) == 1) lie[i] = true; n int l = 1, r = m; n int cnt = 0; n while (l < r) { n int mid = l + (r - l) / 2; n int ans = ask(mid); n if (lie[(cnt++) % n]) ans = -ans; n if (ans > 0) n l = mid + 1; n else n r = mid - 1; n } n ask(l); n } n "} +{"func_code_string": "#include n using namespace std; n vector v1, v2; n vector v4; n string s1, s2, s3; n long long int visited[2000005]; n set st; n set::iterator it; n int main() { n long long int a, b, c, d, e, f, i, j, k, n cnt1 = 0, cnt2 = 0, sum1 = 0, sum2 = 0, first, chk1 = 0, chk2 = 0, T; n cin >> a >> b; n char xx; n long long int indx, chk = 0; n cin >> s1; n s2 = s1; n for (i = 0; i < a; i++) { n if (visited[i] == 0) { n v1.push_back(i); n for (j = i; j < a; j += b) { n visited[j] = 1; n s1[j] = s1[i]; n } n } n } n for (i = 0; i < a; i++) { n if (s1[i] > s2[i]) { n chk = 1; n for (j = 0; j < v1.size(); j++) { n if (v1[j] > i) { n for (int k = v1[j]; k < a; k += b) { n s1[k] = 0 ; n } n } n } n break; n } else if (s1[i] == s2[i]) n cnt1++; n else { n first = i; n break; n } n } n if (cnt1 == a) chk = 1; n if (chk == 0) { n long long int x = upper_bound(v1.begin(), v1.end(), first) - v1.begin(); n x--; n xx = s1[v1[x]]; n if (xx == 9 ) { n for (i = x - 1; i >= 0; i--) { n if (s1[v1[i]] != 9 ) { n xx = s1[v1[i]] + 1; n for (j = v1[i]; j < a; j += b) { n s1[j] = xx; n } n for (j = i + 1; j < v1.size(); j++) { n if (s1[v1[j]] != 0 ) { n for (int k = v1[j]; k < a; k += b) { n s1[k] = 0 ; n } n } n } n break; n } n } n } else { n for (i = v1[x]; i < a; i += b) { n s1[i] = xx + 1; n } n } n } n cout << s1.size() << endl; n cout << s1 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n double dp[200 + 50][200 + 50][200 + 50]; n double p[200 + 50]; n double res; n int a[200 + 50]; n int n, l, x, kol; n int main() { n scanf( %d%d%d , &n, &l, &kol); n for (int i = 1; i <= n; i++) { n scanf( %d , &x); n p[i] = (x + 0.0) / 100; n } n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n a[i]++; n } n memset(dp, 0, sizeof(dp)); n dp[0][0][0] = 1; n for (int i = 0; i < n; i++) { n for (int j = 0; j <= i; j++) { n for (int k = 0; k <= n; k++) { n dp[i + 1][j + 1][min(n, k + a[i + 1])] += dp[i][j][k] * p[i + 1]; n dp[i + 1][j][k] += dp[i][j][k] * (1 - p[i + 1]); n } n } n } n res = 0; n for (int i = l; i <= n; i++) { n for (int j = max(0, l - kol); j <= n; j++) { n if (i <= j + kol) res += dp[n][i][j]; n } n } n printf( %llf , res); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector > out; n vector >::iterator iter; n long long int a[3][200005]; n int main() { n long long int x[3], y[3], m[3]; n int k[3], i, j, bad = 0, prev = 0, n, u = 1, v = 1; n bool A, B; n scanf( %d , &n); n for (i = 1; i <= 2; i++) { n scanf( %d%I64d%I64d%I64d%I64d , &k[i], &a[i][1], &x[i], &y[i], &m[i]); n for (j = 2; j <= k[i]; j++) a[i][j] = (a[i][j - 1] * x[i] + y[i]) % m[i]; n } n for (i = 1; i <= k[1] + k[2]; i++) { n A = B = false; n if (((u <= k[1] && a[1][u] < prev) && (v <= k[2] && a[2][v] < prev)) || n (v > k[2] && a[1][u] < prev) || (u > k[1] && a[2][v] < prev)) { n bad++; n if ((u <= k[1] && a[1][u] < a[2][v]) || v > k[2]) n A = true; n else n B = true; n } n if (u <= k[1] && !B && n (((a[2][v] < prev) || A) || n ((v > k[2]) || (a[1][u] >= prev && a[1][u] < a[2][v])))) { n if (k[1] + k[2] <= 200000) out.push_back(make_pair(a[1][u], 1)); n prev = a[1][u]; n u++; n } else { n if (k[1] + k[2] <= 200000) out.push_back(make_pair(a[2][v], 2)); n prev = a[2][v]; n v++; n } n } n printf( %d n , bad); n if (k[1] + k[2] <= 200000) { n for (iter = out.begin(); iter != out.end(); iter++) n printf( %d %d n , iter->first, iter->second); n } n } n "} +{"func_code_string": "#include n using namespace std; n int d[1000000]; n int main() { n int n, k; n scanf( %d%d , &n, &k); n for (int i = 0; i < (n); ++i) { n int(x); n scanf( %d , &x); n d[i % k] += x; n } n int mi = (int)1e9; n int id = -1; n for (int i = 0; i < (k); ++i) { n if (mi > d[i]) { n mi = d[i]; n id = i; n } n } n printf( %d n , id + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1}; n const double EPS = 1e-8; n const double PI = acos(-1.0); n int popcount(int n) { return __builtin_popcount(n); } n int popcount(long long n) { return __builtin_popcountll(n); } n template n int SIZE(T a) { n return a.size(); n } n template n string IntToString(T num) { n string res; n stringstream ss; n ss << num; n return ss.str(); n } n template n T StringToInt(string str) { n T res = 0; n for (int i = 0; i < SIZE(str); i++) res = (res * 10 + str[i] - 0 ); n return res; n } n template n T gcd(T a, T b) { n if (b == 0) return a; n return gcd(b, a % b); n } n template n T lcm(T a, T b) { n return a / gcd(a, b) * b; n } n template n void PrintSeq(T &a, int sz) { n for (int i = 0; i < sz; i++) { n cout << a[i]; n if (sz == i + 1) n cout << endl; n else n cout << ; n } n } n bool EQ(double a, double b) { return abs(a - b) < EPS; } n void fastStream() { n cin.tie(0); n std::ios_base::sync_with_stdio(0); n } n vector split(string str, char del) { n vector res; n for (int i = 0, s = 0; i < SIZE(str); i++) { n if (str[i] == del) { n if (i - s != 0) res.push_back(str.substr(s, i - s)); n s = i + 1; n } else if (i == SIZE(str) - 1) { n res.push_back(str.substr(s)); n } n } n return res; n } n int N; n long long as[100001]; n long long leftDP[2][100001]; n long long rightDP[2][100001]; n long long goLeft(int pari, int pos) { n if (leftDP[pari][pos] >= 0) return leftDP[pari][pos]; n long long res = 0; n if (pos == 0) { n } else { n if (pari == 0) { n res = max(res, n goLeft(pari, pos - 1) + as[pos - 1] - (as[pos - 1] % 2 == 0)); n if (as[pos - 1] != 1) n res = max(res, goLeft(pari ^ 1, pos - 1) + as[pos - 1] - n (as[pos - 1] % 2 == 1)); n } else { n if (as[pos - 1] != 1) n res = max(res, n goLeft(pari, pos - 1) + as[pos - 1] - (as[pos - 1] % 2 == 1)); n } n } n return leftDP[pari][pos] = res; n } n long long goRight(int pari, int pos) { n if (rightDP[pari][pos] >= 0) return rightDP[pari][pos]; n long long res = 0; n if (pos == N - 1) { n } else { n if (pari == 0) { n res = max(res, goRight(pari, pos + 1) + as[pos] - (as[pos] % 2 == 0)); n if (as[pos] != 1) n res = n max(res, goRight(pari ^ 1, pos + 1) + as[pos] - (as[pos] % 2 == 1)); n } else { n if (as[pos] != 1) n res = max(res, goRight(pari, pos + 1) + as[pos] - (as[pos] % 2)); n } n } n return rightDP[pari][pos] = res; n } n int main() { n memset(leftDP, -1, sizeof(leftDP)); n memset(rightDP, -1, sizeof(rightDP)); n cin >> N; n for (int i = 0; i < N - 1; i++) cin >> as[i]; n long long res = 0; n for (int i = 0; i < N; i++) { n res = max(res, goLeft(1, i) + goRight(1, i)); n res = max(res, goLeft(1, i) + goRight(0, i)); n res = max(res, goLeft(0, i) + goRight(1, i)); n } n cout << res << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dirty[3009]; n int main() { n int n, m; n cin >> n >> m; n for (typeof(0) i = (0); i < (m); i++) cin >> dirty[i]; n sort(dirty, dirty + m); n if (!m) n cout << YES n ; n else if ((dirty[0] != 1) && (dirty[m - 1] != n)) { n if (m < 3) n cout << YES n ; n else { n bool YES = true; n for (typeof(0) i = (0); i < (m - 2); i++) n if ((dirty[i] == (dirty[i + 1] - 1)) && n (dirty[i + 1] == (dirty[i + 2] - 1))) n YES = false; n if (YES) n cout << YES n ; n else n cout << NO n ; n } n } else n cout << NO n ; n return 0; n } n "} +{"func_code_string": "#include n const double pi = acos(-1.0); n using namespace std; n inline long long MAX2(long long a, long long b) { n return (a) > (b) ? (a) : (b); n } n inline long long MAX3(long long a, long long b, long long c) { n return (a) > (b) ? ((a) > (c) ? (a) : (c)) : ((b) > (c) ? (b) : (c)); n } n inline long long MIN2(long long a, long long b) { n return (a) < (b) ? (a) : (b); n } n inline long long MIN3(long long a, long long b, long long c) { n return (a) < (b) ? ((a) < (c) ? (a) : (c)) : ((b) < (c) ? (b) : (c)); n } n int mod = 1e9 + 7; n int64_t extGcd(int64_t a, int64_t b, int64_t& x, int64_t& y) { n if (!a) { n x = 0; n y = 1; n return b; n } n int64_t x1, y1; n int64_t d = extGcd(b % a, a, x1, y1); n x = y1 - (b / a) * x1; n y = x1; n return d; n } n inline long long addmod(long long a, long long b) { n a = a % mod + b % mod; n if (a > mod) a %= mod; n return a; n } n inline long long submod(long long a, long long b) { n a = a % mod - b % mod; n if (a < 0) a += mod; n return a; n } n inline long long mulmod(long long a, long long b) { n return (a % mod * b % mod) % mod; n } n int dx[] = {1, 1, 0, -1, -1, -1, 0, 1}; n int dy[] = {0, 1, 1, 1, 0, -1, -1, -1}; n inline long long exp(long long a, long long b) { n if (a == 0) return 0ll; n long long r = 1LL; n while (b > 0) { n if (b & 1) { n r = r * (a % mod); n r = (r + mod) % mod; n } n b /= 2; n a = (a % mod) * (a % mod); n a = (a + mod) % mod; n } n return (r + mod) % mod; n } n long long gcd(long long a, long long b) { n if (b == 0) return a; n if (a == 0) return b; n return gcd(b, a % b); n } n unsigned long int setbits(long long n) { n unsigned long int count = 0; n while (n) { n n &= (n - 1); n count++; n } n return count; n } n int main() { n if (fopen( input.txt , r )) n freopen( input.txt , r , stdin), freopen( output.txt , w , stdout); n ; n int t; n cin >> t; n while (t--) { n int n, k, z; n cin >> n >> k >> z; n long long a[n]; n long long pre[n + 1]; n pre[0] = 0; n for (long long i = (long long)(0); i < (long long)(n); i++) { n cin >> a[i]; n pre[i + 1] = pre[i] + a[i]; n } n long long ans = 0; n long long curr_sum = a[0]; n for (int i = 1; i <= min(k, n - 1); i++) { n curr_sum += a[i]; n long long prev = a[i - 1]; n long long last = a[i]; n int rem = (k - i); n int resz = z; n long long res = curr_sum; n int nxt = i; n while (resz > 0 and rem > 0) { n if (rem <= 0) { n nxt = i; n break; n } n res += prev; n resz--; n rem--; n if (rem <= 0) { n nxt = i - 1; n break; n } n res += last; n rem--; n } n res += pre[nxt + rem + 1] - pre[nxt + 1]; n ans = MAX2(ans, res); n } n cout << ans << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n unsigned long long B[31][31], res = 0; n int main(void) { n for (int i = 0; i <= 30; i++) { n B[i][0] = B[i][i] = 1; n for (int j = 1; j < i; j++) B[i][j] = B[i - 1][j - 1] + B[i - 1][j]; n } n int n, m, k; n cin >> n >> m >> k; n for (int b = 4; b < k; b++) { n res += (b <= n && k - b <= m) ? B[n][b] * B[m][k - b] : 0; n } n cout << res; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1000005; n const int SQRTN = 1003; n const int LOGN = 22; n const double PI = acos(-1); n const int INF = 1e9; n int MOD = 1000000007; n const int FMOD = 998244353; n const double eps = 1e-9; n long long gcd(long long a, long long b) { n if (a == 0) return (b); n return (gcd(b % a, a)); n } n long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); } n void solve() { n long long n, m1; n cin >> n >> m1; n long long x, k, y; n cin >> x >> k >> y; n long long arr[n]; n for (int i = 0; i < n; i++) cin >> arr[i]; n long long brr[m1]; n for (int i = 0; i < m1; i++) cin >> brr[i]; n bool flag = false; n long long i = 0, j = 0, m = -1, pos, l = -1, r; n long long result = 0; n while (i < n && j < m1) { n if (flag == true) break; n m = max(m, arr[i]); n if (m == arr[i]) pos = i; n if (arr[i] != brr[j]) n i++; n else { n r = i; n i++; n j++; n int len = r - l - 1; n if (pos > l && pos < r && len < k) { n flag = true; n break; n } else { n long long c1, c2; n if (len % k == 0) n c1 = x * (len / k); n else n c1 = x * (len / k) + (len - k * (len / k)) * y; n c2 = y * len; n if (pos > l && pos < r) c2 = y * (len - k) + x; n result += min(c1, c2); n } n l = r; n m = arr[l]; n } n } n if (j == m1 && i < n) { n m = arr[i - 1]; n pos = i - 1; n l = i - 1; n r = n; n int len = 0; n while (i < n) { n m = max(m, arr[i]); n if (m == arr[i]) pos = i; n i++; n len++; n } n if (pos > l && pos < r && len < k) n flag = true; n else { n long long c1, c2; n if (len % k == 0) n c1 = x * (len / k); n else n c1 = x * (len / k) + (len - k * (len / k)) * y; n c2 = y * len; n if (pos > l && pos < r) c2 = (len - k) * y + x; n result += min(c1, c2); n } n } n if (i == n && j < m1) { n cout << -1 << n ; n } else { n if (flag) n cout << -1 << n ; n else n cout << result << n ; n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long t = 1; n while (t--) { n solve(); n } n return (0); n } n "} +{"func_code_string": "#include n using namespace std; n const int NMax = 1100000; n inline int read() { n int x = 0; n char ch = getchar(); n bool positive = 1; n for (; ch < 0 || ch > 9 ; ch = getchar()) n if (ch == - ) positive = 0; n for (; ch >= 0 && ch <= 9 ; ch = getchar()) x = x * 10 + ch - 0 ; n return positive ? x : -x; n } n struct node { n int w, id, sz; n node *left, *right; n int lsize() { return left ? left->sz : 0; } n int rsize() { return right ? right->sz : 0; } n } * T, pool[NMax]; n void update(node *p) { n if (!p) return; n p->sz = p->lsize() + p->rsize() + 1; n } n int L; n struct pnn { n node *x, *y; n }; n pnn mp(node *x, node *y) { n pnn ret; n ret.x = x; n ret.y = y; n return ret; n } n node *new_node(int id) { n node *p = &pool[L++]; n p->w = rand() * rand(); n p->id = id; n p->sz = 1; n p->left = p->right = NULL; n return p; n } n node *new_node(int id, int w) { n node *p = &pool[L++]; n p->w = w; n p->id = id; n p->sz = 1; n p->left = p->right = NULL; n return p; n } n int N, M; n node *merge(node *a, node *b) { n if (!a) return b; n if (!b) return a; n if (b->w > a->w) { n a->right = merge(a->right, b); n update(a); n return a; n } else { n b->left = merge(a, b->left); n update(b); n return b; n } n } n pnn split(node *a, int l) { n if (!a) return mp((node *)NULL, (node *)NULL); n if (l >= a->sz) return mp(a, (node *)NULL); n if (l <= 0) return mp((node *)NULL, a); n if (l <= a->lsize()) { n pnn ret = split(a->left, l); n a->left = ret.y; n update(a); n ret.y = a; n return ret; n } else { n pnn ret = split(a->right, l - a->lsize() - 1); n a->right = ret.x; n update(a); n ret.x = a; n return ret; n } n } n int have[NMax], chose[NMax], nn; n int oper[NMax]; n void DFS(node *p) { n if (p->left) DFS(p->left); n if (p->id == -1) p->id = chose[nn++]; n if (p->right) DFS(p->right); n } n void DFS1(node *p) { n if (p->left) DFS1(p->left); n printf( %d , p->id); n if (p->right) DFS1(p->right); n } n node *Build(int x, int y, int w) { n if (x == y) { n node *p = new_node(-1, w); n return p; n } n int mid = (x + y) >> 1; n node *p = new_node(-1, w); n if (mid > x) p->left = Build(x, mid - 1, w + rand()); n if (mid < y) p->right = Build(mid + 1, y, w + rand()); n update(p); n return p; n } n int main() { n N = read(); n M = read(); n T = Build(1, N, -100000000); n for (int i = 1; i <= M; i++) { n int x, y; n x = read(); n y = read(); n swap(x, y); n oper[i] = x; n pnn tmp = split(T, x - 1); n pnn tmq = split(tmp.y, 1); n if (have[y] && tmq.x->id != y) { n puts( -1 ); n getchar(); n getchar(); n return 0; n } n have[y] = 1; n if (tmq.x->id != -1 && tmq.x->id != y) { n puts( -1 ); n getchar(); n getchar(); n return 0; n } n tmq.x->id = y; n tmp.x = merge(tmq.x, tmp.x); n T = merge(tmp.x, tmq.y); n } n for (int i = 1; i <= N; i++) n if (!have[i]) chose[nn++] = i; n nn = 0; n DFS(T); n for (int i = M; i >= 1; i--) { n pnn tmp = split(T, oper[i]); n pnn tmq = split(tmp.x, 1); n tmp.x = merge(tmq.y, tmq.x); n T = merge(tmp.x, tmp.y); n } n DFS1(T); n puts( ); n getchar(); n getchar(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, cnt[100015], x[100015], y[100015], z[100015]; n vector a[100015]; n int getpos(int i, int u) { n if (x[i] == u) return 0; n if (y[i] == u) return 1; n if (z[i] == u) return 2; n } n void dfs(int u, int v) { n cout << u << ; n if (cnt[v] == 0) { n cout << v; n return; n } n for (int i : a[u]) n if (i) { n --cnt[x[i]]; n --cnt[y[i]]; n --cnt[z[i]]; n int k = 3 - getpos(i, u) - getpos(i, v); n for (int &j : a[x[i]]) n if (j == i) j = 0; n for (int &j : a[y[i]]) n if (j == i) j = 0; n for (int &j : a[z[i]]) n if (j == i) j = 0; n if (k == 0) dfs(v, x[i]); n if (k == 1) dfs(v, y[i]); n if (k == 2) dfs(v, z[i]); n } n } n int main() { n cin >> n; n for (int i = 1; i <= n - 2; ++i) n cin >> x[i] >> y[i] >> z[i], a[x[i]].push_back(i), a[y[i]].push_back(i), n a[z[i]].push_back(i), ++cnt[x[i]], ++cnt[y[i]], ++cnt[z[i]]; n for (int i = 1; i <= n; ++i) n if (cnt[i] == 1) { n if (cnt[x[a[i][0]]] == 2) dfs(i, x[a[i][0]]); n if (cnt[y[a[i][0]]] == 2) dfs(i, y[a[i][0]]); n if (cnt[z[a[i][0]]] == 2) dfs(i, z[a[i][0]]); n } n } n "} +{"func_code_string": "#include n const int INF = 1e7; n using namespace std; n const int N = 20; n int n, m; n int c[N]; n int a[N]; n int like[N]; n string s[N]; n int T_res = 0; n int Lika = 0; n bool Check_Res() { n int Lik; n for (int i = 2; i <= m; i++) { n { n Lik = 0; n for (int j = 0; j <= n - 1; j++) n if (a[j] == (s[i][j] - 0 )) Lik++; n if (Lik != like[i]) return false; n } n } n return true; n } n void attempt(int i, int same) { n if (i == n) { n if (same == like[1] && Check_Res() == true) { n T_res++; n } n return; n } n a[i] = !((s[1][i]) - 0 ); n attempt(i + 1, same); n if (same < like[1]) { n a[i] = (s[1][i] - 0 ); n attempt(i + 1, same + 1); n } n } n int main() { n scanf( %d%d , &n, &m); n for (int i = 1; i <= m; i++) { n cin >> s[i]; n cin >> like[i]; n } n attempt(0, 0); n cout << T_res; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n long long n; n cin >> n; n long long out = n * (n + 1) * (n + 2) / 6; n out *= n * (n + 1) * (n + 2) * (n + 3) * (n + 4) / 120; n cout << out << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int m = 320; n struct data { n int n, x, a[2 * m + 10]; n data *next; n }; n data *head; n int get(int value, int limit) { n int ret = 0; n data *k; n for (k = head; k != NULL; k = k->next) { n if (k->x > value) break; n ret += k->n; n } n if (k != NULL) n for (int i = 1; i <= k->n; i++) { n if (k->a[i] > value) break; n ret++; n } n return (min(ret, limit) + 1); n } n void split(data *k) { n data *t = new (data); n t->x = k->x = 0; n for (int i = 1; i <= m; i++) { n t->a[i] = k->a[i + m]; n t->x = max(t->x, t->a[i]); n k->x = max(k->x, k->a[i]); n } n k->n = t->n = m; n t->next = k->next; n k->next = t; n } n void insert(int value, int pos) { n if (head == NULL) { n head = new (data); n head->n = 1; n head->x = head->a[1] = value; n head->next = NULL; n return; n } n data *k; n for (k = head; k != NULL; k = k->next) { n if (pos <= k->n + 1) break; n pos -= k->n; n } n for (int i = k->n; i >= pos; i--) k->a[i + 1] = k->a[i]; n k->a[pos] = value; n k->x = max(k->x, value); n k->n++; n if (k->n == 2 * m) split(k); n } n int ans[100010], p[100010]; n int main() { n int n; n scanf( %d , &n); n for (int i = 1; i <= n; i++) { n int x, y; n scanf( %d%d , &x, &y); n p[x] = i; n int pos = get(x, y); n insert(x, pos); n } n int t = 0; n for (data *k = head; k != NULL; k = k->next) n for (int i = 1; i <= k->n; i++) ans[++t] = k->a[i]; n reverse(ans + 1, ans + n + 1); n for (int i = 1; i <= n; i++) printf( %d%c , p[ans[i]], i == n ? n : ); n return (0); n } n "} +{"func_code_string": "#include n using namespace std; n int dp[150][150]; n int main() { n int n; n cin >> n; n for (char a = a ; a <= z ; a++) n for (char b = a ; b <= z ; b++) dp[a][b] = -2000000009; n for (char c = a ; c <= z ; c++) dp[c][c] = 0; n while (n--) { n string s; n cin >> s; n char a = s[0], b = s[s.length() - 1]; n for (char c = a ; c <= z ; c++) n dp[c][b] = max(dp[c][b], dp[c][a] + (int)s.length()); n } n int ans = 0; n for (char c = a ; c <= z ; c++) ans = max(ans, dp[c][c]); n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n ll modinv(ll a, ll m) { n assert(m > 0); n if (m == 1) return 0; n a %= m; n if (a < 0) a += m; n assert(a != 0); n if (a == 1) return 1; n return m - modinv(m, a) * m / a; n } n template n struct modnum { n private: n int v; n n public: n static const int MOD = MOD_; n modnum() : v(0) {} n modnum(ll v_) : v(int(v_ % MOD)) { n if (v < 0) v += MOD; n } n explicit operator int() const { return v; } n friend bool operator==(const modnum& a, const modnum& b) { n return a.v == b.v; n } n friend bool operator!=(const modnum& a, const modnum& b) { n return a.v != b.v; n } n modnum operator~() const { n modnum res; n res.v = modinv(v, MOD); n return res; n } n modnum& operator+=(const modnum& o) { n v += o.v; n if (v >= MOD) v -= MOD; n return *this; n } n modnum& operator-=(const modnum& o) { n v -= o.v; n if (v < 0) v += MOD; n return *this; n } n modnum& operator*=(const modnum& o) { n v = int(ll(v) * ll(o.v) % MOD); n return *this; n } n modnum& operator/=(const modnum& o) { return *this *= (~o); } n friend modnum operator+(const modnum& a, const modnum& b) { n return modnum(a) += b; n } n friend modnum operator-(const modnum& a, const modnum& b) { n return modnum(a) -= b; n } n friend modnum operator*(const modnum& a, const modnum& b) { n return modnum(a) *= b; n } n friend modnum operator/(const modnum& a, const modnum& b) { n return modnum(a) /= b; n } n }; n using num = modnum<998244353>; n template n T pow(T a, long long b) { n assert(b >= 0); n T r = 1; n while (b) { n if (b & 1) r *= a; n b >>= 1; n a *= a; n } n return r; n } n vector fact; n vector ifact; n void init() { n int N = 1100000; n fact = {1}; n for (int i = 1; i < N; i++) fact.push_back(i * fact[i - 1]); n ifact.resize(N); n ifact.back() = 1 / fact.back(); n for (int i = N - 1; i > 0; i--) ifact[i - 1] = i * ifact[i]; n } n num ncr(int n, int k) { n if (k < 0 || k > n) return 0; n return fact[n] * ifact[k] * ifact[n - k]; n } n int main() { n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); n init(); n int n, k; n cin >> n >> k; n vector A(n); n for (int i = 0; i < n; i++) cin >> A[i]; n int same = 0; n for (int i = 0; i < n; i++) n if (A[i] == A[(i + 1) % n]) same++; n int diff = n - same; n num ans = 0; n for (int a = 0; a * 2 <= diff; a++) { n ans += ncr(diff, a) * ncr(diff - a, a) * pow(num(k - 2), diff - a - a); n } n ans = (pow(num(k), diff) - ans) / 2; n ans = ans * pow(num(k), same); n cout << (int)ans << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1000000 + 50; n const int maxm = 1300000 + 100; n const int maxt = 3000000 + 100; n const int maxk = 10 + 3; n const int M = 2010; n const long long unit = 1LL; n const int INF = 0x3f3f3f3f; n const long long Inf = 0x3f3f3f3f3f3f3f3fLL; n const double eps = 1e-8; n const double inf = 1e15; n const double pi = acos(-1.0); n const long long mod = 998244353LL, gg = 3LL, inv2 = 499122177LL; n inline long long read() { n long long x = 0; n bool t = false; n char ch = getchar(); n while ((ch < 0 || ch > 9 ) && ch != - ) ch = getchar(); n if (ch == - ) t = true, ch = getchar(); n while (ch <= 9 && ch >= 0 ) x = x * 10 + ch - 48, ch = getchar(); n return t ? -x : x; n } n struct Peo { n int pos, id; n bool operator<(const Peo &a) const { n if (pos == a.pos) return id < a.id; n return pos < a.pos; n } n } peo[maxn]; n struct City { n int pos, id; n bool operator<(const City &a) const { n if (pos == a.pos) return id < a.id; n return pos < a.pos; n } n } city[maxn]; n int m, n, a[maxn], b[maxn]; n long long judge(int x) { n long long ret = 0; n if (x < 0) { n for (int i = 0; i < -x; i++) ret += peo[i].pos + m - city[n + x + i].pos; n for (int i = -x; i < n; i++) ret += abs(peo[i].pos - city[i + x].pos); n } else { n for (int i = 0; i < x; i++) ret += city[i].pos + m - peo[n - x + i].pos; n for (int i = x; i < n; i++) ret += abs(city[i].pos - peo[i - x].pos); n } n return ret; n } n int main() { n m = read(), n = read(); n for (int i = 0; i < n; ++i) city[i].pos = read(), city[i].id = i; n sort(city, city + n); n for (int i = 0; i < n; ++i) peo[i].pos = read(), peo[i].id = i; n sort(peo, peo + n); n int l = -n, r = n; n while (l < r) { n int m = (l + r) >> 1; n if (judge(m) < judge(m + 1)) n r = m; n else n l = m + 1; n } n long long ans = Inf, anst = 0; n for (int turn = l - 100; turn <= l + 100; ++turn) { n int st = (turn % n + n) % n; n long long res = 0; n for (int i = 0; i < n; ++i) { n res += min(abs(peo[i].pos - city[st].pos), n m - abs(peo[i].pos - city[st].pos)); n ++st; n if (st >= n) st -= n; n } n if (res < ans) { n ans = res; n anst = turn; n } n } n printf( %lld n , ans); n int st = (anst % n + n) % n; n for (int i = 0; i < n; ++i) { n b[city[st].id] = peo[i].id; n ++st; n if (st >= n) st -= n; n } n for (int i = 0; i < n; ++i) printf( %d , b[i] + 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int32_t main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n, m; n cin >> n >> m; n vector>> g(n); n vector> store(m); n for (long long i = 0; i < m; i++) { n long long a, b, c; n cin >> a >> b >> c; n --a; n b--; n g[a].push_back({b, c}); n g[b].push_back({a, c}); n store[i] = {a, b, c}; n } n long long s; n cin >> s; n s--; n vector d(n, LONG_LONG_MAX); n vector parent(n), dd(n, LONG_LONG_MAX); n for (long long i = 0; i < n; i++) { n parent[i] = i; n } n d[s] = dd[s] = 0; n set> q; n q.insert({d[s], s}); n while (!q.empty()) { n long long v = q.begin()->second; n q.erase(q.begin()); n for (long long i = 0; i < g[v].size(); i++) { n long long to = g[v][i][0], len = g[v][i][1]; n if (d[v] + len < d[to]) { n if (q.find({d[to], to}) != q.end()) { n q.erase({d[to], to}); n } n parent[to] = v; n d[to] = d[v] + len; n dd[to] = len; n q.insert(make_pair(d[to], to)); n } else if (d[v] + len == d[to]) { n if (dd[to] > len) { n dd[to] = len; n parent[to] = v; n } n } n } n } n long long ans = 0; n for (long long i = 0; i < n; i++) { n ans += dd[i]; n } n cout << ans << endl; n for (long long i = 0; i < m; i++) { n long long a = store[i][0]; n long long b = store[i][1]; n if (parent[a] == b || parent[b] == a) { n cout << i + 1 << ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n int main() { n cin >> n; n int cur = 1; n while (n) { n if (n == 3) { n printf( %d %d %d , cur, cur, cur * n); n return 0; n } n int cnt = n / 2 + n % 2; n n -= cnt; n while (cnt--) printf( %d , cur); n cur *= 2; n } n } n "} +{"func_code_string": "#include n const int Max_N(1000005); n int N, D; n int first[Max_N], ecnt(1), Next[Max_N * 2], To[Max_N * 2]; n int degree[Max_N]; n std::tuple dfs(const int v, const int p = 0) { n if (To[first[v]] == p && Next[first[v]] == 0) return std::make_tuple(0, 0); n int res(0), max(0), min(D + 1); n for (int e(first[v]); e; e = Next[e]) n if (To[e] != p) { n int len(1); n auto tmp(dfs(To[e], v)); n res += std::get<0>(tmp), len += std::get<1>(tmp); n if (len >= 0) { n if (len == D) n ++res; n else if (len * 2 > D) n min = std::min(min, len), ++res; n else n max = std::max(max, len); n } n } n if (max == 0 && min == D + 1) return std::make_tuple(res, -1); n return std::make_tuple(res - (max + min <= D), max + min <= D ? min : max); n } n int main(int argc, char **argv) { n scanf( %d %d , &N, &D); n int r; n for (int i(1), v, w; i != N; ++i) { n scanf( %d %d , &v, &w); n Next[ecnt] = first[v], To[ecnt] = w, first[v] = ecnt++; n Next[ecnt] = first[w], To[ecnt] = v, first[w] = ecnt++; n ++degree[v], ++degree[w]; n if (degree[v] > 1) r = v; n if (degree[w] > 1) r = w; n } n auto res(dfs(r)); n printf( %d , std::get<0>(res) + (std::get<1>(res) != -1)); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mxn = 5e5 + 123; n const long long inf = 1e9; n const long long mod = 998244353; n bool om[mxn]; n vector v; n long long n, mn = 1e18; n ; n int main() { n int n, m; n cin >> n >> m; n for (int i = 1; i <= n; i++) n if (n % i == 0) v.push_back(i); n for (int i = 0; i < v.size(); i++) { n if (n / v[i] < m) mn = min(mn, (v[i] * m) + (n / v[i])); n } n cout << mn; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n inline long long tmx(long long a, long long b, long long c) { n return (a > b && a > c) ? a : ((b > c) ? b : c); n } n inline long long tmn(long long a, long long b, long long c) { n return (a < b && a < c) ? a : ((b < c) ? b : c); n } n const int MXL = 0x3f3f3f3f; n string s[] = { Anka , Chapay , Cleo , Troll , n Dracul , Snowy , Hexadecimal }; n inline int find(string x) { n for (int i = 0; i < 7; ++i) n if (s[i] == x) return i; n } n int n; n long long A, B, C; n int f[7][7] = {}; n long long BE = (long long)MXL * MXL, AM = 0; n int c[7]; n void dfs(int w) { n if (w == 7) { n int t[3] = {}; n for (int i = 0; i < 7; ++i) ++t[c[i]]; n if (!t[0] || !t[1] || !t[2]) return; n long long MX = tmx(A / t[0], B / t[1], C / t[2]); n long long MN = tmn(A / t[0], B / t[1], C / t[2]); n long long BE_N = MX - MN; n if (BE_N > BE) return; n long long AM_N = 0; n for (int i = 0; i < 7; ++i) n for (int j = 0; j < 7; ++j) n if (c[i] == c[j]) AM_N += f[i][j]; n if (BE_N < BE || AM_N > AM) { n BE = BE_N; n AM = AM_N; n } n return; n } n for (int i = 0; i < 3; ++i) { n c[w] = i; n dfs(w + 1); n } n } n string L, R; n int LN, RN; n string like; n inline void EXEC() { n cin >> n; n for (int i = 0; i < n; ++i) { n cin >> L >> like >> R; n LN = find(L); n RN = find(R); n ++f[LN][RN]; n } n cin >> A >> B >> C; n dfs(0); n cout << BE << << AM << endl; n } n int main() { n EXEC(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int mod = 1000000007; n long long f = 0, g = 1; n int n; n int main() { n cin >> n; n for (int i = 2; i <= n; i++) { n long long k = f; n f = 3 * g % mod; n g = (k + 2 * g) % mod; n } n printf( %lld , f); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const long long LINF = 0x3f3f3f3f3f3f3f3fll; n void bad() { n cout << NO << n ; n exit(0); n } n const int MAX = 4e5 + 10; n vector g[MAX]; n int main() { n if (!false) ios_base::sync_with_stdio(0); n cin.tie(0); n int n, d, k; n cin >> n >> d >> k; n if (d >= n or (n > 2 and k == 1)) bad(); n int nxt = 0; n vector pos_dist(n, -1); n stack can; n for (nxt = 0; nxt <= d; nxt++) { n if (nxt < d) { n g[nxt].push_back(nxt + 1); n g[nxt + 1].push_back(nxt); n } n pos_dist[nxt] = min(nxt, d - nxt); n can.push(nxt); n } n while (nxt < n) { n if (false) cout << g << n ; n for (int i = 0; i < n; i++) { n if (false) cout << i << : ; n for (auto j : g[i]) n if (false) cout << j << ; n if (false) cout << n ; n } n if (false) cout << n ; n if (can.empty()) bad(); n int v = can.top(); n if (g[v].size() == k or pos_dist[v] == 0) { n can.pop(); n continue; n } n g[v].push_back(nxt); n g[nxt].push_back(v); n pos_dist[nxt] = pos_dist[v] - 1; n can.push(nxt); n nxt++; n } n set> stans; n cout << YES << n ; n for (int i = 0; i < n; i++) { n for (auto j : g[i]) stans.insert({min(i, j) + 1, max(i, j) + 1}); n } n for (auto [x, y] : stans) cout << x << << y << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1e8; n struct node { n int x, y, z, s; n } pre[12][18][18][18]; n int n, a, b, dp[12][18][18][18], h[12]; n vector ans; n void f(int i, int x, int y, int z, int v, int xx, int yy, int zz, int s) { n x = max(0, x); n y = max(0, y); n z = max(0, z); n if (dp[i][x][y][z] > v) { n dp[i][x][y][z] = v; n pre[i][x][y][z] = (node){xx, yy, zz, s}; n } n } n void find(int i, int x, int y, int z) { n node tmp = pre[i][x][y][z]; n int s = tmp.s; n for (int j = 0; j < s; j++) { n ans.push_back(i); n } n if (i == 2) { n return; n } n find(i - 1, tmp.x, tmp.y, tmp.z); n } n int main() { n scanf( %d%d%d , &n, &a, &b); n for (int i = 1; i <= n; i++) { n scanf( %d , &h[i]); n h[i]++; n } n for (int i = 0; i <= n; i++) { n for (int x = 0; x <= 16; x++) { n for (int y = 0; y <= 16; y++) { n for (int z = 0; z <= 16; z++) { n dp[i][x][y][z] = inf; n } n } n } n } n f(1, h[1], h[2], h[3], 0, 0, 0, 0, 0); n for (int i = 1; i < n - 1; i++) { n int z = h[i + 2]; n for (int x = 0; x <= h[i]; x++) { n for (int y = 0; y <= h[i + 1]; y++) { n int v = dp[i][x][y][z]; n if (v >= inf) { n continue; n } n for (int j = (x + b - 1) / b;; j++) { n f(i + 1, y - j * a, z - j * b, h[i + 3], v + j, x, y, z, j); n if (j * a > y && j * b > z) { n break; n } n } n } n } n } n find(n - 1, 0, 0, 0); n cout << ans.size() << endl; n for (int i = 0; i < ans.size(); i++) { n printf( %d , ans[i]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, arr[2005], counts[2005]; n char c = a ; n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n cin >> arr[i]; n } n for (int i = n - 1; i >= 0; i--) { n counts[i] = arr[i]; n if (arr[i] != 0) { n for (int j = i - 1; j >= 0; j--) { n arr[j] -= (i - j + 1) * arr[i]; n } n } n } n for (int i = 1; i <= n; i++) { n for (int j = 0; j < counts[i - 1]; j++) { n for (int k = 0; k < i; k++) { n cout << c; n } n c = ((c == a ) ? b : a ); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n if (n & n - 1) n puts( NO ); n else n puts( YES ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ifstream fin( input.txt ); n double a, b, c = 1.000000011, d; n cin >> a >> b; n d = a * pow(c, b); n cout.precision(30); n cout << d << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n while (t--) { n int n, c = 0; n cin >> n; n int r = n; n int cnt = 0; n while (r > 0) { n int temp = r % 10; n if (temp > 0) cnt++; n r = r / 10; n c++; n } n cout << cnt << endl; n int it, ans; n for (int i = 0; i < c; i++) { n it = n % 10; n ans = it * pow(10, i); n if (ans > 0) cout << ans << ; n n = n / 10; n } n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n char A[102]; n int M[102][205][3][52]; n int dp(int i, int x, int d, int n) { n if (n < 0) return 0; n if (!A[i] && n == 0) return abs(x - 102); n if (!A[i]) return 0; n int &r = M[i][x][d == 1][n]; n if (r == -1) { n if (A[i] == F ) { n r = max(dp(i + 1, x + d, d, n), n max(max(dp(i, x, d, n - 2), dp(i + 1, x + d, d, n - 2)), n dp(i + 1, x, d * -1, n - 1))); n } else { n r = max(dp(i + 1, x, d * -1, n), n max(max(dp(i, x, d * -1, n - 2), dp(i + 1, x, d * -1, n - 2)), n dp(i + 1, x + d, d, n - 1))); n } n } n return r; n } n int main() { n int n; n scanf( %s %d , A, &n); n memset(M, -1, sizeof(M)); n printf( %d n , dp(0, 102, 1, n)); n } n "} +{"func_code_string": "#include n using namespace std; n long long n, s, k; n string u; n long long r[60], dp[2501][60]; n signed main() { n cin >> n >> s >> k; n for (long long i = 0; i < n; ++i) cin >> r[i]; n cin >> u; n for (long long i = 0; i < n; ++i) n for (long long j = 0; j < n; ++j) dp[i][j] = -1e18; n --s; n dp[0][s] = r[s]; n for (long long i = 0; i < s; ++i) dp[s - i][i] = r[i]; n for (long long i = s + 1; i < n; ++i) dp[i - s][i] = r[i]; n for (long long i = 1; i <= 2500; ++i) n for (long long j = 0; j < n; ++j) n for (long long t = 1; t <= i; ++t) { n if (j - t >= 0 && u[j - t] != u[j] && r[j - t] < r[j]) n dp[i][j] = max(dp[i][j], dp[i - t][j - t] + r[j]); n if (j + t < n && u[j + t] != u[j] && r[j + t] < r[j]) n dp[i][j] = max(dp[i][j], dp[i - t][j + t] + r[j]); n } n for (long long i = 0; i < 2501; ++i) n for (long long j = 0; j < n; ++j) n if (dp[i][j] >= k) return cout << i, 0; n cout << -1; n } n "} +{"func_code_string": "#include n using namespace std; n template n string to_string(pair p); n template n string to_string(tuple p); n template n string to_string(tuple p); n string to_string(const string& s) { return + s + ; } n string to_string(const char* s) { return to_string((string)s); } n string to_string(bool b) { return (b ? true : false ); } n string to_string(vector v) { n bool first = true; n string res = { ; n for (int i = 0; i < static_cast(v.size()); i++) { n if (!first) { n res += , ; n } n first = false; n res += to_string(v[i]); n } n res += } ; n return res; n } n template n string to_string(bitset v) { n string res = ; n for (size_t i = 0; i < N; i++) { n res += static_cast( 0 + v[i]); n } n return res; n } n template n string to_string(A v) { n bool first = true; n string res = { ; n for (const auto& x : v) { n if (!first) { n res += , ; n } n first = false; n res += to_string(x); n } n res += } ; n return res; n } n template n string to_string(pair p) { n return ( + to_string(p.first) + , + to_string(p.second) + ) ; n } n template n string to_string(tuple p) { n return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + n to_string(get<2>(p)) + ) ; n } n template n string to_string(tuple p) { n return ( + to_string(get<0>(p)) + , + to_string(get<1>(p)) + , + n to_string(get<2>(p)) + , + to_string(get<3>(p)) + ) ; n } n void debug_out() { cerr << endl; } n template n void debug_out(Head H, Tail... T) { n cerr << << to_string(H); n debug_out(T...); n } n template n T inverse(T a, T m) { n T u = 0, v = 1; n while (a != 0) { n T t = m / a; n m -= t * a; n swap(a, m); n u -= t * v; n swap(u, v); n } n assert(m == 1); n return u; n } n template n class Modular { n public: n using Type = typename decay::type; n constexpr Modular() : value() {} n template n Modular(const U& x) { n value = normalize(x); n } n template n static Type normalize(const U& x) { n Type v; n if (-mod() <= x && x < mod()) n v = static_cast(x); n else n v = static_cast(x % mod()); n if (v < 0) v += mod(); n return v; n } n const Type& operator()() const { return value; } n template n explicit operator U() const { n return static_cast(value); n } n constexpr static Type mod() { return T::value; } n Modular& operator+=(const Modular& other) { n if ((value += other.value) >= mod()) value -= mod(); n return *this; n } n Modular& operator-=(const Modular& other) { n if ((value -= other.value) < 0) value += mod(); n return *this; n } n template n Modular& operator+=(const U& other) { n return *this += Modular(other); n } n template n Modular& operator-=(const U& other) { n return *this -= Modular(other); n } n Modular& operator++() { return *this += 1; } n Modular& operator--() { return *this -= 1; } n Modular operator++(int) { n Modular result(*this); n *this += 1; n return result; n } n Modular operator--(int) { n Modular result(*this); n *this -= 1; n return result; n } n Modular operator-() const { return Modular(-value); } n template n typename enable_if::Type, int>::value, n Modular>::type& n operator*=(const Modular& rhs) { n value = normalize(static_cast(value) * n static_cast(rhs.value)); n return *this; n } n template n typename enable_if::Type, int64_t>::value, n Modular>::type& n operator*=(const Modular& rhs) { n int64_t q = static_cast(static_cast(value) * n rhs.value / mod()); n value = normalize(value * rhs.value - q * mod()); n return *this; n } n template n typename enable_if::Type>::value, n Modular>::type& n operator*=(const Modular& rhs) { n value = normalize(value * rhs.value); n return *this; n } n Modular& operator/=(const Modular& other) { n return *this *= Modular(inverse(other.value, mod())); n } n template n friend const Modular& abs(const Modular& v) { n return v; n } n template n friend bool operator==(const Modular& lhs, const Modular& rhs); n template n friend bool operator<(const Modular& lhs, const Modular& rhs); n template n friend std::istream& operator>>(std::istream& stream, Modular& number); n n private: n Type value; n }; n template n bool operator==(const Modular& lhs, const Modular& rhs) { n return lhs.value == rhs.value; n } n template n bool operator==(const Modular& lhs, U rhs) { n return lhs == Modular(rhs); n } n template n bool operator==(U lhs, const Modular& rhs) { n return Modular(lhs) == rhs; n } n template n bool operator!=(const Modular& lhs, const Modular& rhs) { n return !(lhs == rhs); n } n template n bool operator!=(const Modular& lhs, U rhs) { n return !(lhs == rhs); n } n template n bool operator!=(U lhs, const Modular& rhs) { n return !(lhs == rhs); n } n template n bool operator<(const Modular& lhs, const Modular& rhs) { n return lhs.value < rhs.value; n } n template n Modular operator+(const Modular& lhs, const Modular& rhs) { n return Modular(lhs) += rhs; n } n template n Modular operator+(const Modular& lhs, U rhs) { n return Modular(lhs) += rhs; n } n template n Modular operator+(U lhs, const Modular& rhs) { n return Modular(lhs) += rhs; n } n template n Modular operator-(const Modular& lhs, const Modular& rhs) { n return Modular(lhs) -= rhs; n } n template n Modular operator-(const Modular& lhs, U rhs) { n return Modular(lhs) -= rhs; n } n template n Modular operator-(U lhs, const Modular& rhs) { n return Modular(lhs) -= rhs; n } n template n Modular operator*(const Modular& lhs, const Modular& rhs) { n return Modular(lhs) *= rhs; n } n template n Modular operator*(const Modular& lhs, U rhs) { n return Modular(lhs) *= rhs; n } n template n Modular operator*(U lhs, const Modular& rhs) { n return Modular(lhs) *= rhs; n } n template n Modular operator/(const Modular& lhs, const Modular& rhs) { n return Modular(lhs) /= rhs; n } n template n Modular operator/(const Modular& lhs, U rhs) { n return Modular(lhs) /= rhs; n } n template n Modular operator/(U lhs, const Modular& rhs) { n return Modular(lhs) /= rhs; n } n template n Modular power(const Modular& a, const U& b) { n assert(b >= 0); n Modular x = a, res = 1; n U p = b; n while (p > 0) { n if (p & 1) res *= x; n x *= x; n p >>= 1; n } n return res; n } n template n bool IsZero(const Modular& number) { n return number() == 0; n } n template n string to_string(const Modular& number) { n return to_string(number()); n } n template n std::ostream& operator<<(std::ostream& stream, const Modular& number) { n return stream << number(); n } n template n std::istream& operator>>(std::istream& stream, Modular& number) { n typename common_type::Type, int64_t>::type x; n stream >> x; n number.value = Modular::normalize(x); n return stream; n } n constexpr int md = (int)1e9 + 7; n using Mint = Modular::type, md>>; n vector fact(1, 1); n vector inv_fact(1, 1); n Mint C(int n, int k) { n if (k < 0 || k > n) { n return 0; n } n while ((int)fact.size() < n + 1) { n fact.push_back(fact.back() * (int)fact.size()); n inv_fact.push_back(1 / fact.back()); n } n return fact[n] * inv_fact[k] * inv_fact[n - k]; n } n struct Point { n int x; n int y; n int c; n }; n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int n, k, L; n cin >> n >> k >> L; n vector p(n); n for (int i = 0; i < n; i++) { n cin >> p[i].x >> p[i].y >> p[i].c; n --p[i].c; n } n sort(p.begin(), p.end(), n [&](const Point& a, const Point& b) { return a.y < b.y; }); n Mint c2 = Mint(L) * (L + 1) / 2; n auto C2 = [&](int x, int y) -> long long { n if (x >= y) { n return 0; n } n return ((long long)(y - x) * (y - x + 1)) >> 1; n }; n Mint ans = 0; n for (int start = 0; start <= n - k; start++) { n int coeff = p[start].y - (start == 0 ? -1 : p[start - 1].y); n if (coeff == 0) { n continue; n } n vector> s(k); n for (int i = 0; i < k; i++) { n s[i].insert(-1); n s[i].insert(L); n } n for (int i = start; i < n; i++) { n s[p[i].c].insert(p[i].x); n } n set> segs; n long long value = 0; n auto Modify = [&](set>::iterator it, int q) { n if (it != segs.begin()) { n value -= q * C2(it->first, abs(prev(it)->second)); n } n if (next(it) != segs.end()) { n value -= q * C2(next(it)->first, abs(it->second)); n } n if (it != segs.begin() && next(it) != segs.end()) { n value += q * C2(next(it)->first, abs(prev(it)->second)); n } n value += q * C2(it->first, abs(it->second)); n }; n auto Erase = [&](set>::iterator it) { n Modify(it, -1); n segs.erase(it); n }; n auto Add = [&](int from, int to) { n if (from >= to) { n return; n } n pair seg = make_pair(from, -to); n auto it = segs.lower_bound(seg); n while (it != segs.end() && abs(it->second) <= to) { n Erase(it); n it = segs.lower_bound(seg); n } n if (it != segs.begin()) { n it = prev(it); n if (abs(it->second) >= to) { n return; n } n } n auto ret = segs.insert(seg); n assert(ret.second); n it = ret.first; n Modify(it, 1); n }; n bool have_all = true; n for (int i = 0; i < k; i++) { n if (s[i].size() == 2) { n have_all = false; n break; n } n auto it = s[i].begin(); n while (*it < L) { n int me = *it; n ++it; n int nxt = *it; n Add(me + 1, nxt); n } n } n if (!have_all) { n break; n } n for (int finish = n - 1; finish >= start; finish--) { n int coeff2 = (finish == n - 1 ? L : p[finish + 1].y) - p[finish].y; n ans += Mint(coeff) * coeff2 * (c2 - value); n int col = p[finish].c; n auto it = s[col].find(p[finish].x); n assert(it != s[col].end()); n auto pr = prev(it); n auto nx = next(it); n Add((*pr) + 1, *nx); n s[col].erase(it); n if (value == c2) { n break; n } n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e5 + 5; n const int MOD = 1e9 + 7.5; n char s[MAXN]; n int f[MAXN], n; n int main() { n scanf( %s , s + 1); n n = strlen(s + 1); n int preb = 0; n for (int i = 1; i <= n; ++i) { n f[i] = f[i - 1]; n if (s[i] == a ) { n f[i] = (f[i] + f[preb] + 1) % MOD; n } else if (s[i] == b ) { n preb = i; n } n } n cout << f[n] << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n namespace io { n void _(int &k) { n char c; n int e = 1; n k = 0; n while ((c = getchar()) > 9 || c < 0 ) n if (c == - ) e = -1; n k = c - 0 ; n while ((c = getchar()) <= 9 && c >= 0 ) { n k *= 10; n k += c - 0 ; n } n k *= e; n } n void _(long long &k) { n char c; n int e = 1; n k = 0; n while ((c = getchar()) > 9 || c < 0 ) n if (c == - ) e = -1; n k = c - 0 ; n while ((c = getchar()) <= 9 && c >= 0 ) { n k *= 10; n k += c - 0 ; n } n k *= e; n } n void _(char &c) { n while ((c = getchar()) == || c == n ) n ; n } n void _(double &c) { scanf( %lf , &c); } n void _(char *s) { n char c; n while ((c = getchar()) != EOF && c != && c != 10) *s++ = c; n } n template n void _(t1 &a, t2 &b) { n _(a); n _(b); n } n template n void _(t1 &a, t2 &b, t3 &c) { n _(a); n _(b); n _(c); n } n template n void _(t1 &a, t2 &b, t3 &c, t4 &d) { n _(a); n _(b); n _(c); n _(d); n } n template n void _(t1 &a, t2 &b, t3 &c, t4 &d, t5 &e) { n _(a); n _(b); n _(c); n _(d); n _(e); n } n void _p(double k) { printf( %.6lf , k); } n void _p(char *c) { n for (; *c; putchar(*c++)) n ; n } n void _p(const char *c) { n for (; *c; putchar(*c++)) n ; n } n void _p(char c) { putchar(c); } n template n void _p0(T k) { n if (k >= 10) _p0(k / 10); n putchar(k % 10 + 0 ); n } n template n void _p(T k) { n if (k < 0) { n putchar( - ); n _p0(-k); n } else n _p0(k); n } n template n void __p(T k) { n _p(k); n putchar( ); n } n template n void _pn(T k) { n _p(k); n putchar( n ); n } n template n void _p(t1 a, t2 b) { n __p(a); n _pn(b); n } n template n void _p(t1 a, t2 b, t3 c) { n __p(a); n __p(b); n _pn(c); n } n template n void _p(t1 a, t2 b, t3 c, t4 d) { n __p(a); n __p(b); n __p(c); n _pn(d); n } n template n void op(T *a, int n) { n int i; n n--; n for (i = 1; i <= n; i++) __p(a[i]); n _pn(a[n + 1]); n } n int gi() { n int first; n _(first); n return first; n } n long long gll() { n long long first; n _(first); n return first; n } n } // namespace io n int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } n void fcl() { n fclose(stdin); n fclose(stdout); n } n void fop(const char *s) { n char c[256], d[256]; n memset(c, 0, sizeof(c)); n memset(d, 0, sizeof(d)); n strcpy(c, s); n strcpy(d, s); n freopen(strcat(c, .in ), r , stdin); n freopen(strcat(d, .out ), w , stdout); n } n int eq(double a, double b) { n return a + 0.00000000001 >= b && b + 0.00000000001 >= a; n } n template n void _ma(T &a, T b) { n if (a < b) a = b; n } n template n void _mi(T &a, T b) { n if (a > b) a = b; n } n const int N = 1234567, EE = 100000000, GG = 1000000000, ima = 2147483647; n using namespace io; n int n, m, a[N], an, T, l, r; n const int p = 1000000007; n long long f[N][3]; n int main() { n int i, j; n long long a0, a1, a2; n _(n, l, r); n a0 = r / 3 - (l - 1) / 3; n a1 = (r + 2) / 3 - (l + 1) / 3; n a2 = (r + 1) / 3 - l / 3; n f[0][0] = 1; n for (i = 1; i <= n; i++) { n f[i][0] = (f[i - 1][0] * a0 + f[i - 1][1] * a2 + f[i - 1][2] * a1) % p; n f[i][1] = (f[i - 1][0] * a1 + f[i - 1][1] * a0 + f[i - 1][2] * a2) % p; n f[i][2] = (f[i - 1][0] * a2 + f[i - 1][1] * a1 + f[i - 1][2] * a0) % p; n } n _pn(f[n][0]); n } n "} +{"func_code_string": "#include n using namespace std; n int N, C, cnt; n int A[33], P[33]; n double dp[33][33][222], sol; n inline int f(int l, int r, int i) { n if (i < l || i > r) return i; n int ret = i - l + 1; n int len = r - l + 1; n ret = len - ret + 1; n ret = l + ret - 1; n return ret; n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout << setprecision(15) << fixed; n cin >> N >> C; n for (int I = 1; I <= N; I++) cin >> A[I]; n for (int I = 1; I <= N; I++) n for (int K = I + 1; K <= N; K++) dp[I][K][0] = 1; n for (int c = 1; c <= C; c++) { n for (int I = 1; I <= N; I++) { n for (int K = 1; K <= N; K++) { n for (int l = 1; l <= N; l++) { n for (int r = l; r <= N; r++) { n int pi = f(l, r, I); n int pk = f(l, r, K); n dp[I][K][c] += dp[pi][pk][c - 1]; n } n } n dp[I][K][c] /= (N * (N - 1) / 2) + N; n } n } n } n for (int I = 1; I <= N; I++) n for (int K = 1; K <= N; K++) n if (A[I] > A[K]) { n sol += dp[I][K][C]; n } n cout << sol << endl; n } n "} +{"func_code_string": "#include n const int inf = INT_MAX; n const int MAX = 1e6 + 8; n const long long MOD = 998244353; n const int TOT_PRIMES = 1e6 + 9; n const int MAX_A = 71; n const int LN = 20; n using namespace std; n vector adj[MAX]; n int vis[MAX]; n long long c = 0; n void dfs(int u) { n vis[u] = 1; n c = c + 1; n for (auto v : adj[u]) { n if (!vis[v]) { n dfs(v); n } n } n } n int main() { n int n; n cin >> n; n for (int i = 1; i <= n; i++) { n int x; n cin >> x; n adj[i].push_back(x); n adj[x].push_back(i); n } n vector res; n for (int i = 1; i <= n; i++) { n if (!vis[i]) { n dfs(i); n res.push_back(c); n c = 0; n } n } n sort(res.begin(), res.end()); n long long ans = 0; n int m = res.size(); n if (m == 1) { n cout << res[0] * res[0]; n return 0; n } n ans = res[m - 1] + res[m - 2]; n ans = ans * ans; n for (int i = 0; i < m - 2; i++) { n ans = ans + (res[i] * res[i]); n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( O2 ) n using namespace std; n long long mod = 1000000007; n void solve() { n long long n; n cin >> n; n long long a[n]; n long long k0 = 0; n long long k1 = 0; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n if (a[i] == 0) k0++; n if (a[i] == 1) k1++; n } n long long ans = k1 * (pow(2, k0)); n cout << ans << endl; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long t; n cin >> t; n while (t--) solve(); n } n "} +{"func_code_string": "#include n const long long inf = std::numeric_limits::max(); n const int infint = std::numeric_limits::max(); n const long long mod = 1e9 + 7; n using namespace std; n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n vector g[500100]; n long long a[500100]; n long long par[500100][21]; n void dfs(int v, int p) { n for (auto i : g[v]) { n if (i == p) continue; n dfs(i, v); n par[i][0] = v; n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n long long mn = inf; n for (int i = 0; i < n; i++) { n cin >> a[i]; n mn = min(a[i], mn); n } n for (int i = 0; i < n - 1; i++) { n int x, y; n cin >> x >> y; n x--, y--; n g[x].push_back(y); n g[y].push_back(x); n } n for (int i = 0; i < n; i++) { n if (a[i] == mn) { n par[i][0] = i; n dfs(i, -1); n break; n } n } n long long w = 0; n for (int i = 1; i < 21; i++) n for (int j = 0; j < n; j++) par[j][i] = par[par[j][i - 1]][i - 1]; n for (int i = 0; i < n; i++) { n if (a[i] == mn) continue; n long long now = inf; n for (int j = 0; j < 21; j++) { n now = min(now, a[par[i][j]] * (j + 1) + a[i]); n } n w += now; n } n cout << w; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n void read(_T &x) { n _T f = 1; n x = 0; n char s = getchar(); n while (s > 9 || s < 0 ) { n if (s == - ) f = -1; n s = getchar(); n } n while ( 0 <= s && s <= 9 ) { n x = (x << 3) + (x << 1) + (s ^ 48); n s = getchar(); n } n x *= f; n } n struct ming { n long long typ, t, x, id, pos; n } a[100010]; n long long n, ans[100010], num[100010]; n vector vec; n long long cmp1(const ming &a, const ming &b) { return a.t < b.t; } n long long cmp2(const ming &a, const ming &b) { return a.id < b.id; } n void merge(long long l, long long r) { n if (l == r) return; n long long mid = l + r >> 1, j = l; n merge(l, mid); n merge(mid + 1, r); n sort(a + l, a + mid + 1, cmp1); n sort(a + mid + 1, a + r + 1, cmp1); n for (long long i = mid + 1; i <= r; i++) { n while (j <= mid && a[j].t <= a[i].t) num[a[j].pos] += a[j].typ, j++; n if (!a[i].typ) ans[a[i].id] += num[a[i].pos]; n } n for (long long i = l; i < j; i++) num[a[i].pos] -= a[i].typ; n } n signed main() { n read(n); n for (long long i = 1; i <= n; i++) { n read(a[i].typ); n read(a[i].t); n read(a[i].x); n if (a[i].typ == 2) a[i].typ = -1; n if (a[i].typ == 3) a[i].typ = 0; n a[i].id = i; n vec.push_back(a[i].x); n } n sort(vec.begin(), vec.end()); n vec.erase(unique(vec.begin(), vec.end()), vec.end()); n for (long long i = 1; i <= n; i++) n a[i].pos = lower_bound(vec.begin(), vec.end(), a[i].x) - vec.begin() + 1; n merge(1, n); n sort(a + 1, a + n + 1, cmp2); n for (long long i = 1; i <= n; i++) n if (!a[i].typ) printf( %lld n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n int x1, y1, x2, y2; n cin >> n; n long long ans = 0; n for (int i = 1; i <= n; i++) { n cin >> x1 >> y1 >> x2 >> y2; n ans += (long long)(x2 - x1 + 1) * (y2 - y1 + 1); n } n cout << ans << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1e13, Mo = 998244353; n const int N = 1000000; n const double eps = 1e-6; n namespace slow_IO { n long long read() { n long long x = 0; n int zf = 1; n char ch = getchar(); n while (ch != - && (ch < 0 || ch > 9 )) ch = getchar(); n if (ch == - ) zf = -1, ch = getchar(); n while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); n return x * zf; n } n void write(long long y) { n if (y < 0) putchar( - ), y = -y; n if (y > 9) write(y / 10); n putchar(y % 10 + 0 ); n } n } // namespace slow_IO n using namespace slow_IO; n vector E1[N + 5], E2[N + 5]; n int Flag1[N + 5], Flag2[N + 5]; n int Ans[N + 5]; n int ans = 0; n int main() { n int n = read(), m = read(); n for (int i = (1); i <= (m); i++) { n int x = read(), y = read(); n E1[x].push_back(y); n E2[y].push_back(x); n } n for (int i = (1); i <= (n); i++) n if (!Flag1[i]) { n Flag1[i] = Flag2[i] = 1; n for (int j = (0); j < (E1[i].size()); j++) Flag1[E1[i][j]] = 1; n } n for (int i = (n); i >= (1); i--) n if (Flag2[i]) { n for (int j = (0); j < (E2[i].size()); j++) n if (Flag2[E2[i][j]]) Flag2[i] = 0; n } n for (int i = (1); i <= (n); i++) n if (Flag2[i]) Ans[++ans] = i; n printf( %d n , ans); n for (int i = (1); i <= (ans); i++) n printf( %d%c , Ans[i], i == ans ? n : ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 109; n int n; n int a[N]; n map m; n set s[2]; n int main() { n int n; n cin >> n; n for (int i = 0; i < n; ++i) { n cin >> a[i]; n m[a[i]]++; n } n int pos = 0; n for (auto p : m) n if (p.second == 1) { n s[pos].insert(p.first); n pos = 1 - pos; n } n if (s[0].size() == s[1].size()) { n string res(n, A ); n for (int i = 0; i < n; ++i) n if (s[1].count(a[i])) res[i] = B ; n cout << YES << endl; n for (auto c : res) cout << c; n cout << endl; n return 0; n } else { n assert(int(s[0].size()) - 1 == int(s[1].size())); n string res(n, A ); n for (int i = 0; i < n; ++i) n if (s[1].count(a[i])) res[i] = B ; n int id = -1; n for (auto p : m) n if (p.second >= 3) { n id = p.first; n break; n } n if (id == -1) { n cout << NO << endl; n return 0; n } n bool flag = false; n for (int i = 0; i < n; ++i) { n if (a[i] == id) n if (!flag) { n flag = true; n res[i] = B ; n } n } n cout << YES << endl; n for (auto c : res) cout << c; n cout << endl; n return 0; n } n return 0; n } n "} +{"func_code_string": "#include n bool comp(const int& a, const int& b) { return a < b ? false : true; } n using namespace std; n int main() { n long long int k, a, b, m, n; n cin >> k >> m >> n; n a = max(m, n); n b = min(m, n); n long long int ans = 0; n if (a > 0 && b > 0) { n ans = a / k - (b - 1) / k; n } else if (a < 0 && b < 0) { n ans = abs(b) / k - (abs(a) - 1) / k; n } else { n ans = abs(a) / k; n ans += (abs(b)) / k; n ans += 1; n } n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2000 + 11; n const int MOD = 1e9 + 7; n int dp[N][2][2][N]; n int m, d; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> m >> d; n string s1, s2; n cin >> s1 >> s2; n s1 = . + s1; n s2 = . + s2; n dp[0][0][0][0] = 1; n int n = s1.size() - 1; n for (int i = 1; i <= n; i++) n for (int d1 = 0; d1 <= 1; d1++) n for (int d2 = 0; d2 <= 1; d2++) n for (int mm = 0; mm < m; mm++) { n for (int x = 0; x <= 9; x++) { n if (d1 == 0 && x < s1[i] - 0 ) continue; n if (d2 == 0 && x > s2[i] - 0 ) continue; n if (i % 2 == 1 && x == d) continue; n if (i % 2 == 0 && x != d) continue; n int dd1 = d1, dd2 = d2, mmm = (mm * 10 + x) % m; n if (x > s1[i] - 0 ) dd1 = 1; n if (x < s2[i] - 0 ) dd2 = 1; n dp[i][dd1][dd2][mmm] = n (dp[i][dd1][dd2][mmm] + dp[i - 1][d1][d2][mm]) % MOD; n } n } n int ans = 0; n for (int d1 = 0; d1 <= 1; d1++) n for (int d2 = 0; d2 <= 1; d2++) ans = (ans + dp[n][d1][d2][0]) % MOD; n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int n; n cin >> n; n long long int a[n][2]; n for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1]; n long long int l[n][2], r[n][2]; n long long int mi = a[0][0]; n long long int mx = a[0][1]; n l[0][0] = mi; n l[0][1] = mx; n if (n == 1) { n cout << a[0][1] - a[0][0]; n return 0; n } n for (int i = 1; i < n; i++) { n if (l[i - 1][0] == -1) { n l[i][0] = -1; n l[i][1] = -1; n continue; n } n long long int x, y; n x = max(a[i][0], l[i - 1][0]); n y = min(a[i][1], l[i - 1][1]); n if (y - x < 0) { n l[i][0] = -1; n l[i][1] = -1; n } else { n l[i][0] = x; n l[i][1] = y; n } n } n mx = a[n - 1][1]; n mi = a[n - 1][0]; n r[n - 1][0] = mi; n r[n - 1][1] = mx; n for (int i = n - 2; i >= 0; i--) { n if (r[i + 1][0] == -1) { n r[i][0] = -1; n r[i][1] = -1; n continue; n } n long long int x, y; n x = max(a[i][0], r[i + 1][0]); n y = min(a[i][1], r[i + 1][1]); n if (y - x < 0) { n r[i][0] = -1; n r[i][1] = -1; n } else { n r[i][0] = x; n r[i][1] = y; n } n } n long long int ans = 0; n if (l[n - 2][0] != -1) ans = l[n - 2][1] - l[n - 2][0]; n if (r[1][0] != -1) ans = max(ans, r[1][1] - r[1][0]); n for (int i = 1; i < n - 1; i++) { n long long int x, y; n if (l[i - 1][0] == -1 || r[i + 1][0] == -1) continue; n x = max(l[i - 1][0], r[i + 1][0]); n y = min(l[i - 1][1], r[i + 1][1]); n ans = max(ans, max((long long int)0, y - x)); n } n cout << ans; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cout << setprecision(10); n ; n int n; n cin >> n; n vector deg(n); n int ones = 0; n vector others, ops; n long long total = 0; n for (int i = 0; i < (int)n; i++) { n cin >> deg[i]; n if (deg[i] == 1) { n ones++; n ops.push_back(i); n } else { n total += deg[i]; n others.push_back(i); n } n } n if (total - (n - ones - 1) * 2 < ones) return cout << NO n , 0; n vector> edges; n if (others.size() == 0 && ops.size() == 2) { n cout << YES 1 n ; n cout << 1 n ; n cout << ops[0] + 1 << << ops[1] + 1 << n ; n return 0; n } n for (int i = 1; i < (int)others.size(); i++) { n edges.push_back({others[i - 1], others[i]}); n } n int opptr = 0; n if (others.size() == 1) { n for (int i = 0; i < (int)ops.size(); i++) n edges.push_back({ops[i], others[0]}); n } else { n if (opptr < (int)ops.size()) edges.push_back({ops[opptr++], others[0]}); n if (opptr < (int)ops.size()) edges.push_back({ops[opptr++], others.back()}); n for (int i = 0; i < (int)deg[others[0]] - 2; i++) { n if (opptr >= (int)ops.size()) break; n edges.push_back({ops[opptr++], others[0]}); n } n for (int i = 0; i < (int)deg[others.back()] - 2; i++) { n if (opptr >= (int)ops.size()) break; n edges.push_back({ops[opptr++], others.back()}); n } n } n for (int i = 1; i < (int)others.size() - 1; i++) { n int av = deg[others[i]] - 2; n while (opptr < (int)ops.size() && av > 0) { n edges.push_back({others[i], ops[opptr++]}); n av--; n } n } n cout << YES << (others.size() - 1 + (ops.size() > 0) + (ops.size() > 1)) n << n ; n cout << edges.size() << n ; n for (int i = 0; i < (int)edges.size(); i++) n cout << (edges[i].first + 1) << << edges[i].second + 1 << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = acos(-1.0); n int dx[] = {1, -1, 0, 0, -1, 1, -1, 1}; n int dy[] = {0, 0, 1, -1, -1, -1, 1, 1}; n void file() {} n int main() { n cout << setprecision(20) << fixed; n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int k; n cin >> k; n int x = 0; n for (int i = 2; i <= 2000; i++) { n long long s = k + i; n if (ceil(s / (double(i - 1))) <= 1e6) { n x = i; n break; n } n } n if (!x) return cout << -1 << n , 0; n cout << x << n ; n cout << -1 ; n long long s = k + x; n long long rem = s % (x - 1); n long long num = s / (x - 1); n for (int i = 0; i < x - 1; i++) n if (rem) n cout << num + 1 << , rem--; n else n cout << num << ; n cout << n ; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void read(T &x) { n x = 0; n bool w = 1; n char c = getchar(); n while (!isdigit(c)) { n if (c == - ) w = 0; n c = getchar(); n } n while (isdigit(c)) { n x = x * 10 + c - 0 ; n c = getchar(); n } n x = w ? x : -x; n } n const long long N = 1e5 + 10, Mod = 1e9 + 7; n long long n, m, a[N], lg[N], b[N], f[N], c[N], sum[N], d[N], ans[N]; n struct en { n long long l, r, id; n bool operator<(const en &x) const { return r < x.r; } n } q[N]; n inline long long Get(long long x) { return f[x] ? f[x] = Get(f[x]) : x; } n inline long long ji(long long x, long long y) { n return (b[x] - b[y + 1] * lg[y - x + 1] % Mod + Mod) % Mod; n } n inline void add(long long x, long long y) { n f[x] = y; n c[y] = c[x]; n if ((x - c[x] > 30 && sum[y] > 9) || (sum[x] + (sum[y] << x - c[x])) > Mod) n sum[y] = Mod; n else n sum[y] = sum[x] + (sum[y] << x - c[x]); n } n signed main() { n read(n), read(m); n lg[0] = 1; n for (long long i = 1; i <= n; i++) n read(a[i]), sum[i] = a[i], lg[i] = (lg[i - 1] << 1) % Mod, c[i] = i - 1; n for (long long i = 1; i <= m; i++) read(q[i].l), read(q[i].r), q[i].id = i; n for (long long i = n; i >= 1; i--) n b[i] = ((b[i + 1] << 1) + a[i] + Mod) % Mod; n sort(q + 1, q + m + 1); n long long k = 1; n for (long long i = 1; i <= n; i++) { n while (sum[i] >= 0 && c[i]) add(c[i], i); n d[i] = (d[c[i]] + (ji(c[i] + 1, i) << 1) % Mod + Mod) % Mod; n while (q[k].r == i) { n long long x = Get(q[k].l); n ans[q[k].id] = (d[i] - d[x] + ji(q[k].l, x) + Mod) % Mod; n k++; n } n } n for (long long i = 1; i <= m; i++) printf( %lld n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long read() { n char ch = getchar(); n long long x = 0, ff = 1; n while (ch < 0 || ch > 9 ) { n if (ch == - ) ff = -ff; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); n return x * ff; n } n void write(long long aa) { n if (aa < 0) putchar( - ), aa = -aa; n if (aa > 9) write(aa / 10); n putchar(aa % 10 + 0 ); n return; n } n long long n; n long long a[200005]; n long long tt[800005], tts[800005], lz[800005]; n void up(long long rt) { n tt[rt] = min(tt[rt << 1], tt[rt << 1 | 1]); n if (tt[rt << 1] >= tt[rt << 1 | 1]) n tts[rt] = tts[rt << 1 | 1]; n else n tts[rt] = tts[rt << 1]; n return; n } n void bt(long long rt, long long ll, long long rr) { n if (ll == rr) { n tt[rt] = read(), tts[rt] = ll; n return; n } n long long mid = (ll + rr) >> 1; n bt(rt << 1, ll, mid); n bt(rt << 1 | 1, mid + 1, rr); n up(rt); n return; n } n void push(long long rt) { n if (!lz[rt]) return; n tt[rt << 1] += lz[rt]; n tt[rt << 1 | 1] += lz[rt]; n lz[rt << 1] += lz[rt]; n lz[rt << 1 | 1] += lz[rt]; n lz[rt] = 0; n return; n } n void update(long long rt, long long ll, long long rr, long long L, long long R, n long long kk) { n if (ll == L && rr == R) { n tt[rt] += kk; n lz[rt] += kk; n return; n } n long long mid = (ll + rr) >> 1; n push(rt); n if (R <= mid) n update(rt << 1, ll, mid, L, R, kk); n else if (L > mid) n update(rt << 1 | 1, mid + 1, rr, L, R, kk); n else n update(rt << 1, ll, mid, L, mid, kk), n update(rt << 1 | 1, mid + 1, rr, mid + 1, R, kk); n up(rt); n return; n } n int main() { n n = read(); n bt(1, 1, n); n for (long long i = 1; i <= n; ++i) { n long long now = tts[1]; n a[now] = i; n update(1, 1, n, now, now, n * n); n if (now < n) update(1, 1, n, now + 1, n, -i); n } n for (long long i = 1; i <= n; ++i, putchar( )) write(a[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int k; n scanf( %d , &k); n if (k % 2 == 1) { n printf( -1 n ); n return 0; n } n char a[k][k]; n memset(a, 0, sizeof(a)); n for (int layer = 0; layer < k / 2; layer++) { n char c; n if (layer % 2) n c = w ; n else n c = b ; n for (int runner = layer; runner < k - layer; runner++) n a[runner][layer] = a[layer][runner] = a[runner][k - layer - 1] = n a[k - layer - 1][runner] = c; n } n for (int i = 0; i < k; i++) n for (int j = 0; j < k; j++) { n for (int l = 0; l < k; l++) n if (i % 2) n if (a[j][l] == w ) n printf( b ); n else n printf( w ); n else n printf( %c , a[j][l]); n printf( n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string a, s; n cin >> a; n cin >> s; n long la = 0, ls = 0, i = 0, ps = 0, pv = 0; n la = a.length(); n ls = s.length(); n vector v; n for (i = 0; i < ls; i++) v.push_back(s[i]); n sort(v.rbegin(), v.rend()); n while (ps < la && pv < ls) { n if (a[ps] < v[pv]) { n a[ps] = v[pv]; n ps++; n pv++; n } else if (a[ps] >= v[pv]) n ps++; n } n cout << a; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k; n int n1; n vector v; n int c[20]; n int a[20]; n bool viz[20]; n int f[20]; n inline void get(int i) { n int cif = 0; n long long zece = 1; n long long r = 0; n for (zece = 1; i > 0; i >>= 1, zece *= 10LL) { n ++cif; n if ((i & 1) != 0) n r += 7LL * zece; n else n r += 4LL * zece; n } n if (r != 0LL) v.push_back(r); n for (++cif; cif < 11; ++cif, zece *= 10LL) { n r += 4LL * zece; n v.push_back(r); n } n } n void back(int k1) { n if (k1 == n1 + 1) return; n for (int i = 1; i <= n1; ++i) { n if (viz[i]) continue; n if (k > f[n1 - k1]) n k -= f[n1 - k1]; n else { n viz[i] = true; n a[k1] = i; n back(k1 + 1); n return; n } n } n printf( -1 n ); n exit(0); n } n int main() { n scanf( %d%d , &n, &k); n for (int i = 0; i < 1024; ++i) { n get(i); n } n sort(v.begin(), v.end()); n int start = max(1, n - 12); n f[0] = f[1] = 1; n for (int i = 2; i < 13; ++i) f[i] = f[i - 1] * i; n n1 = n - start + 1; n back(1); n int rez = 0; n long long start1 = (long long)start; n for (size_t i = 0, lim = v.size(); i < lim && v[i] < start1; ++i) { n ++rez; n } n int x = start; n for (int i = 1; i <= n1; ++i, ++x) { n c[i] = x; n } n for (int i = 1; i <= n1; ++i) { n if (find(v.begin(), v.end(), (long long)(i - 1) + start1) != v.end() && n find(v.begin(), v.end(), (long long)c[a[i]]) != v.end()) n ++rez; n } n printf( %d n , rez); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int a, b, c, d, i, j, e, ar[105]; n scanf( %d , &a); n while (a--) { n scanf( %d , &b); n if (b == 1) { n scanf( %d , &c); n if (c % 2 == 0) n printf( 1 n1 n ); n else n printf( -1 n ); n } else { n e = -1; n for (i = 1; i <= b; i++) { n scanf( %d , &ar[i]); n } n for (i = 1; i <= b; i++) { n if (ar[i] % 2 == 0) { n d = 1; n break; n } n if (e != -1) { n d = 2; n break; n } n if (e == -1) e = i; n } n printf( %d n , d); n if (d == 1) n printf( %d n , i); n else n printf( %d %d n , e, i); n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n double mn = 1e20, mx, t; n int n, low, high; n int main() { n cin >> n; n for (int i = 1; i <= n; i++) { n cin >> t; n mn = min(mn, (t + 1 - 1e-8) / i); n mx = max(mx, t / i); n } n n++; n low = (int)(n * mx + 1e-9), high = (int)(n * mn + 1 - 1e-9); n if (low + 1 == high) n cout << unique n << low; n else n cout << not unique ; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n string s; n cin >> s; n int arr[26] = {}; n int n = s.length(); n int count = 0; n for (int i = 0; i < n; i++) { n arr[s[i] - a ]++; n if (arr[s[i] - a ] == 2) { n arr[s[i] - a ] = 0; n count--; n } else n count++; n } n if (count == 0 || count == 1) { n cout << First n << n ; n } else { n if (count % 2 == 0) { n cout << Second n << n ; n } else n cout << First n << n ; n } n } n int main() { n long long t = 1; n while (t--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 400100; n vector grafo[MAXN]; n int a[MAXN], b[MAXN]; n pair p[MAXN]; n int q[MAXN]; n bool vis[MAXN]; n int n; n vector vec; n void dfs(int x) { n vis[x] = true; n vec.push_back(x); n if (x > n) n vis[x - n] = true; n else n vis[x + n] = true; n for (int i = 0; i < grafo[x].size(); i++) { n int at = grafo[x][i]; n if (vis[at] == true) continue; n dfs(at); n } n } n int main() { n int t; n cin >> t; n while (t--) { n cin >> n; n vec.clear(); n for (int i = 1; i <= 2 * n; i++) { n p[i] = {0, 0}; n grafo[i].clear(); n q[i] = 0; n vis[i] = false; n a[i] = b[i] = 0; n } n for (int i = 1; i <= n; i++) { n int x; n cin >> x; n a[x] = i; n q[x]++; n if (p[x].first == 0) n p[x].first = i; n else n p[x].second = i; n } n for (int i = 1; i <= n; i++) { n int x; n cin >> x; n b[x] = i; n q[x]++; n if (p[x].first == 0) n p[x].first = i; n else n p[x].second = i; n } n bool f = true; n for (int i = 1; i <= n; i++) n if (q[i] != 2) f = false; n if (f == false) { n cout << -1 << endl; n continue; n } n for (int i = 1; i <= n; i++) { n int p1 = p[i].first, p2 = p[i].second; n if (a[i] > 0 && b[i] > 0) { n grafo[p1].push_back(p2); n grafo[p2].push_back(p1); n grafo[p1 + n].push_back(p2 + n); n grafo[p2 + n].push_back(p1 + n); n } else { n grafo[p1].push_back(p2 + n); n grafo[p2].push_back(p1 + n); n grafo[p2 + n].push_back(p1); n grafo[p1 + n].push_back(p2); n } n } n vector resp; n for (int i = 1; i <= n; i++) { n if (vis[i] == true) continue; n vec.clear(); n dfs(i); n int h = vec.size(); n int cnt = 0; n for (int j = 0; j < vec.size(); j++) { n int at = vec[j]; n if (at > n) cnt++; n } n if (cnt < h - cnt) { n for (int j = 0; j < vec.size(); j++) n if (vec[j] > n) resp.push_back(vec[j] - n); n } else { n for (int j = 0; j < vec.size(); j++) n if (vec[j] <= n) resp.push_back(vec[j]); n } n } n cout << resp.size() << endl; n for (int i = 0; i < resp.size(); i++) cout << resp[i] << ; n cout << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1e5 + 5; n int read() { n int s = 0; n char c = getchar(), lc = + ; n while (c < 0 || 9 < c) lc = c, c = getchar(); n while ( 0 <= c && c <= 9 ) s = s * 10 + c - 0 , c = getchar(); n return lc == - ? -s : s; n } n void write(int x) { n if (x < 0) { n putchar( - ); n x = -x; n } n if (x < 10) n putchar(x + 0 ); n else { n write(x / 10); n putchar(x % 10 + 0 ); n } n } n void print(int x, char c = n ) { n write(x); n putchar(c); n } n void L(int x) { n putchar( L ); n putchar( ); n print(x); n } n void R(int x) { n putchar( R ); n putchar( ); n print(x); n } n char a[N]; n signed main() { n scanf( %s , a + 1); n int n = strlen(a + 1); n print(4); n L(2); n L(2); n R(2); n R(n + 2 + n - 1); n return 0; n } n "} +{"func_code_string": "#include n int n, m, k, s, a[1000000], b[1000000]; n int amin[1000000]; n int bmin[1000000]; n struct Gadget { n long long cost; n int id; n Gadget(long long cost, int id) : cost(cost), id(id) {} n bool operator<(const Gadget &other) const { return cost < other.cost; } n }; n int main() { n scanf( %d %d %d %d , &n, &m, &k, &s); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n amin[i] = i; n if (i > 0 && a[amin[i - 1]] < a[i]) amin[i] = amin[i - 1]; n } n for (int i = 0; i < n; i++) { n scanf( %d , &b[i]); n bmin[i] = i; n if (i > 0 && b[bmin[i - 1]] < b[i]) bmin[i] = bmin[i - 1]; n } n long long asum, bsum; n std::vector d, p; n for (int i = 0; i < m; i++) { n int t, c; n scanf( %d %d , &t, &c); n if (t == 1) n d.push_back(Gadget(c, i + 1)); n else n p.push_back(Gadget(c, i + 1)); n } n d.push_back(Gadget(0, 0)); n p.push_back(Gadget(0, 0)); n std::sort(d.begin(), d.end()); n std::sort(p.begin(), p.end()); n for (int i = 1; i < d.size(); i++) d[i].cost += d[i - 1].cost; n for (int i = 1; i < p.size(); i++) p[i].cost += p[i - 1].cost; n int day_ans = n; n int d_ans = 0, p_ans = 0; n for (int i = 0; i <= std::min(k, (int)d.size() - 1); i++) { n int j = k - i; n if (j >= p.size()) continue; n int left = 0, right = day_ans - 1; n while (left <= right) { n int mid = (left + right) >> 1; n long long cost = d[i].cost * a[amin[mid]] + p[j].cost * b[bmin[mid]]; n if (cost <= s) { n if (mid < day_ans) { n day_ans = mid; n d_ans = i; n p_ans = j; n } n right = mid - 1; n } else { n left = mid + 1; n } n } n } n if (day_ans == n) { n puts( -1 ); n return 0; n } n printf( %d n , day_ans + 1); n for (int i = 1; i <= d_ans; i++) { n printf( %d %d n , d[i].id, amin[day_ans] + 1); n } n for (int i = 1; i <= p_ans; i++) { n printf( %d %d n , p[i].id, bmin[day_ans] + 1); n } n } n "} +{"func_code_string": "#include n using namespace std; n int to1[1000010], w[1000010], begin1[1000010], next1[1000010], v[1000010], n p[1000010], d[1000010], e; n void add(int x, int y, int z) { n to1[++e] = y; n next1[e] = begin1[x]; n begin1[x] = e; n w[e] = z; n } n void ins(int x) { n int i; n for (i = 30; i >= 0; i--) n if ((x >> i) & 1) { n if (!p[i]) { n p[i] = x; n break; n } n x ^= p[i]; n } n } n void dfs(int x, int now) { n int i; n d[x] = now; n v[x] = 1; n for (i = begin1[x]; i; i = next1[i]) { n if (!v[to1[i]]) n dfs(to1[i], now ^ w[i]); n else n ins(now ^ w[i] ^ d[to1[i]]); n } n } n int find(int x) { n int i; n for (i = 30; i >= 0; i--) n if ((p[i] ^ x) < x) x = p[i] ^ x; n return x; n } n int main() { n int i, u, v, w, n, m; n scanf( %d%d , &n, &m); n for (i = 1; i <= m; i++) { n scanf( %d%d%d , &u, &v, &w); n add(u, v, w); n add(v, u, w); n } n dfs(1, 0); n printf( %d n , find(d[n])); n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = 1000000000; n const long long INF = 1LL * inf * inf; n const double eps = 1e-9; n const int md = (int)1e9 + 7; n const double EPS = 1e-7; n const long long maxll = numeric_limits::max(); n const double PI = acos(-1.0); n template n inline name sqr(name x) { n return x * x; n } n inline long long multmod(long long a, long long b, long long md) { n if (!a) return 0; n if (a % 2 == 1) n return (multmod(a - 1, b, md) + b) % md; n else n return sqr(multmod(a / 2, b, md)) % md; n } n template n inline name bpow(name base, long long exp) { n name res = base; n while (exp) { n if (exp % 2 == 1) { n res = res * base; n } n base = base * base; n exp /= 2; n } n return res; n } n int n, x, m; n double p[2000]; n struct matr { n double a[1 << 7][1 << 7]; n } mat, qq; n const matr& operator*(const matr& x, const matr& y) { n for (int i = 0; i < (1 << 7); i++) n for (int j = 0; j < (1 << 7); j++) qq.a[i][j] = 0; n for (int i = 0; i < (1 << 7); i++) n for (int j = 0; j < (1 << 7); j++) n for (int k = 0; k < (1 << 7); k++) qq.a[i][j] += x.a[i][k] * y.a[k][j]; n return qq; n } n int main() { n ios_base ::sync_with_stdio(0); n cin >> n >> x; n for (int i = 0; i <= x; i++) cin >> p[i]; n for (int mask1 = 0; mask1 < (1 << 7); mask1++) n for (int mask2 = 0; mask2 < (1 << 7); mask2++) n mat.a[mask1][mask2] = p[mask1 ^ mask2]; n mat = bpow(mat, n - 1); n cout << fixed << setprecision(10) << 1 - mat.a[0][0]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n long long n, k; n cin >> n >> k; n string ans = ; n for (long long i = 0; i < n; i++) { n ans.push_back( a ); n } n for (long long i = n - 2; i >= 0; i--) { n if (k <= n - i - 1) { n ans[i] = b ; n ans[n - k] = b ; n break; n } n k -= (n - i - 1); n } n cout << ans << endl; n } n int main() { n int t; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t, a, b, c, d, x, y, x1, x2, y1, y2; n scanf( %d , &t); n while (t--) { n scanf( %d%d%d%d , &a, &b, &c, &d); n int t1 = a - b; n int t2 = c - d; n scanf( %d%d%d%d%d%d , &x, &y, &x1, &y1, &x2, &y2); n if (x - t1 >= x1 && x - t1 <= x2 && y - t2 >= y1 && y - t2 <= y2) { n if ((a > 0 || b > 0) && x1 == x2) n printf( NO n ); n else if ((c > 0 || d > 0) && y1 == y2) n printf( NO n ); n else n printf( YES n ); n } else n printf( NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0), cout.tie(0); n cin.tie(0), cout.tie(0); n ; n long long int a, b, t, n, m, k, i, j, l, sum = 0, sum1 = 0, ans = 0; n vector v; n cin >> n; n for (i = 0; i < n; i++) { n cin >> a; n v.push_back(a); n if (i & 1) { n sum1 += a; n } else n sum += a; n } n ans = max(sum1, sum); n for (i = 0; i < n; i++) { n if (i & 1) { n sum1 -= v[i]; n sum += v[i]; n } else { n sum -= v[i]; n sum1 += v[i]; n } n ans = max(ans, max(sum, sum1)); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long a, b, c; n cin >> a; n b = a - 1; n c = a - 2; n if (a >= 3) { n if (b % 2 != 0) { n if (a % 3 == 0) { n long long e = a * b * c / 2; n long long r = a * b * (c - 1) / 3; n long long t = a * b * (c - 2) / 2; n long long y = a * b * (c - 3); n long long h = (a - 1) * (b - 1) * (c - 1); n cout << max(max(max(e, r), max(t, y)), h); n } else { n c--; n cout << a * b * c; n } n } else { n cout << a * b * c; n } n } else { n b = 1; n c = 1; n cout << a * b * c; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int h; n int edge[5000]; n int extend[5000]; n int maximum; n int v[5000]; n bool flag = 0; n void dfs_m(int p, int value) { n v[p] = value; n if (edge[p * 2] != 0) n dfs_m(p * 2 + 0, value + edge[p * 2]); n else { n if (maximum < value) maximum = value; n } n if (edge[p * 2 + 1] != 0) n dfs_m(p * 2 + 1, value + edge[p * 2 + 1]); n else { n if (maximum < value) maximum = value; n } n } n void dfs(int p, int value) { n if (edge[p * 2] != 0) { n dfs(p * 2, value + edge[p * 2] + extend[p * 2]); n } else { n if (value < maximum) { n extend[p] += (maximum - value); n } n } n if (edge[p * 2 + 1] != 0) { n dfs(p * 2 + 1, value + edge[p * 2 + 1] + extend[p * 2 + 1]); n } else { n if (value < maximum) { n extend[p] += (maximum - value); n } n } n } n int min(int a, int b) { n if (a == b) return -1; n if (a < b) { n return a; n } n return b; n } n void merge(int n) { n if (extend[n * 2] != 0 && extend[n * 2 + 1] != 0) { n int m = min(extend[n * 2 + 1], extend[n * 2]); n flag = false; n if (m == -1) { n extend[n] += extend[n * 2 + 1]; n extend[n * 2] = extend[n * 2 + 1] = 0; n merge(n / 2); n } else { n extend[n] += m; n extend[n * 2] -= m; n extend[n * 2 + 1] -= m; n merge(n / 2); n } n } n } n int main() { n scanf( %d , &h); n int e = pow(2, h + 1) - 2; n memset(edge, 0, sizeof(edge)); n memset(extend, 0, sizeof(extend)); n memset(v, 0, sizeof(v)); n for (int i = 2; i <= e + 1; i++) { n scanf( %d , &edge[i]); n } n maximum = 0; n dfs_m(1, 0); n dfs(1, 0); n int node = pow(2, h + 1); n for (int i = 2; i <= e + 1; i++) { n extend[i] /= 2; n } n while (true) { n flag = true; n for (int i = 0; i < node; i++) { n merge(i); n } n for (int i = 2; i <= e + 1; i++) { n } n if (flag) { n break; n } n } n int ans = 0; n for (int i = 0; i <= e + 1; i++) { n ans += extend[i]; n } n printf( %d , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n map, int> m; n long long int comb(long long int n, long long int r) { n int k1, k2; n if (m[make_pair(n, r)] != 0) return m[make_pair(n, r)]; n if (r > n) return 0; n if (n == r) return 1; n if (r == 0) return 1; n if (r == 1) return n; n k1 = comb(n - 1, r - 1); n k2 = comb(n - 1, r); n m[make_pair(n - 1, r - 1)] = k1; n m[make_pair(n - 1, r)] = k2; n return k1 + k2; n } n int main() { n long long int n, m, t, k1 = 0, k2 = 0, k3 = 0, sum = 0, i = 0, x, y; n cin >> n >> m >> t; n if ((n + m) < t) cout << 0; n if (n < 4 || m < 1) cout << 0; n for (x = 4; x <= t - 1; x++) { n if (m >= (t - x)) sum += (comb(n, x) * comb(m, t - x)); n } n cout << sum; n } n "} +{"func_code_string": "#include n using namespace std; n int a[123], p[123]; n signed main() { n int t; n scanf( %d , &t); n while (t--) { n int n, m; n scanf( %d %d , &n, &m); n memset(p, 0, sizeof(p)); n for (int i = 1; i <= n; ++i) scanf( %d , a + i); n for (int i = 1, x; i <= m; ++i) scanf( %d , &x), p[x] = 1; n bool ok = 1; n for (int i = 1; i <= n; ++i) n for (int j = i + 1; j <= n; ++j) { n if (!ok) break; n if (a[i] > a[j]) n for (int k = i; k < j; ++k) n if (!p[k]) { n ok = 0; n break; n } n } n ok ? puts( YES ) : puts( NO ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long fac[3000060]; n void pre() { n fac[0] = 1; n for (int i = 1; i < 3000060; i++) fac[i] = fac[i - 1] * i % 1000000007; n } n long long powermod(long long x, long long y, long long p) { n long long res = 1; n x = x % p; n if (x == 0) return 0; n while (y > 0) { n if (y & 1) res = (res * x) % p; n y = y >> 1; n x = (x * x) % p; n } n return res; n } n long long nCrmod(long long n, long long r, long long p) { n if (r == 0) return 1; n return (fac[n] * powermod(fac[r], p - 2, p) % p * n powermod(fac[n - r], p - 2, p) % p) % n p; n } n void solve() { n long long n; n cin >> n; n long long use[n][n]; n for (int i = 0; i < n; i++) { n for (int j = 0; j < n; j++) { n cin >> use[i][j]; n } n } n for (int i = 0; i < n; i++) { n long long p = (use[i][(i + 1) % n] * use[i][(i + 2) % n]) / n use[(i + 1) % n][(i + 2) % n]; n p = sqrt(p); n cout << p << ; n } n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long t; n t = 1; n while (t--) { n solve(); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long inf = 1e18; n vector a; n map p; n int binp(long long x) { n int l = 0, r = 1e9 + 1; n while (r - l > 1) { n int m = (l + r) / 2; n if (1LL * m * m <= x) n l = m; n else n r = m; n } n return l; n } n int main() { n a.push_back(0); n for (long long i = 2; i <= 1000000; ++i) { n long long cur = i * i * i; n while (inf / i >= cur) { n long long x = binp(cur); n if (!p[cur] && x * x != cur) a.push_back(cur); n p[cur] = 1; n cur *= i; n } n long long x = binp(cur); n if (!p[cur] && x * x != cur) a.push_back(cur); n p[cur] = 1; n } n sort(a.begin(), a.end()); n int t; n scanf( %d , &t); n while (t--) { n long long l, r; n scanf( %lld %lld , &l, &r); n long long ans = upper_bound(a.begin(), a.end(), r) - n upper_bound(a.begin(), a.end(), l - 1); n ans += binp(r) - binp(l - 1); n printf( %lld n , ans); n } n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( unroll-loops ) n #pragma GCC target( n sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native ) n void read(int &a) { n a = 0; n char c = getchar(); n while (c < 0 || c > 9 ) { n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n a = (a << 1) + (a << 3) + (c ^ 48); n c = getchar(); n } n } n const int Maxn = 50000; n const int Inf = 0x3f3f3f3f; n int n, q; n int a[Maxn + 5]; n int fa[Maxn + 5]; n int head[Maxn + 5], arrive[Maxn + 5], nxt[Maxn + 5], tot; n void add_edge(int from, int to) { n arrive[++tot] = to; n nxt[tot] = head[from]; n head[from] = tot; n } n int dep[Maxn + 5], dis[Maxn + 5]; n int dfn[Maxn + 5], right[Maxn + 5], rnk[Maxn + 5], dfn_tot, sz[Maxn + 5]; n int sum[Maxn + 5]; n long long f[Maxn + 5]; n void init_dfs(int u) { n dep[u] = dep[fa[u]] + 1; n if (a[u] != 1) { n dfn[u] = ++dfn_tot; n dis[dfn_tot] = dep[u]; n rnk[dfn_tot] = u; n sz[u] = 1; n sum[u] = 0; n } else { n dfn[u] = dfn_tot + 1; n sz[u] = 0; n sum[u] = 1; n } n for (int i = head[u]; i; i = nxt[i]) { n int v = arrive[i]; n init_dfs(v); n sz[u] += sz[v]; n sum[u] += sum[v]; n f[u] += f[v]; n f[u] += sum[v]; n } n right[u] = dfn[u] + sz[u] - 1; n } n int del[Maxn + 5]; n int main() { n read(n), read(q); n for (register int i = 1; i <= n; ++i) { n read(a[i]); n del[i] = -Inf; n } n for (register int i = 2; i <= n; ++i) { n read(fa[i]); n add_edge(fa[i], i); n } n init_dfs(1); n for (register int i = 1; i <= q; ++i) { n int u; n read(u); n long long ans_1 = 0; n int ans_2 = 0; n for (register int j = dfn[u]; j <= right[u]; ++j) { n int tmp = (i >= del[j]); n ans_1 += dis[j] * tmp; n ans_2 += tmp; n del[j] = (tmp ? i + a[rnk[j]] : del[j]); n } n ans_1 -= 1ll * ans_2 * dep[u]; n ans_1 += f[u], ans_2 += sum[u]; n printf( %lld %d n , ans_1, ans_2); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n long long sum[1505][1505]; n long long ans[1505]; n long long t[1505]; n int main() { n int i, j, x; n long long val, now, res; n scanf( %d%d , &n, &m); n for (i = 1; i <= n; i++) n for (j = 1; j <= m; j++) n scanf( %I64d , &val), sum[i][j] = sum[i][j - 1] + val; n for (i = 1; i <= m; i++) ans[i] = sum[1][i]; n for (i = 2; i <= n; i++) { n if (i % 2 == 0) { n now = -(long long)1e15; n for (x = m; x > 0; x--) { n t[x] = now + sum[i][x]; n now = max(now, ans[x]); n } n } else { n now = -(long long)1e15; n for (x = 1; x <= m; x++) { n t[x] = now + sum[i][x]; n now = max(now, ans[x]); n } n } n for (x = 1; x <= m; x++) ans[x] = t[x]; n } n res = -(long long)1e15; n for (x = 1; x <= m; x++) res = max(res, ans[x]); n printf( %I64d , res); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int n, m, a[105], cnt = 0, i; n fill_n(a, 105, 0); n for (cin >> m >> n; n; n /= m) a[cnt++] = n % m; n if (cnt > 100) { n cout << NO ; n return 0; n } n for (i = 0; i < 105; ++i) { n if (a[i] <= 1) n continue; n else if (a[i] < m - 1) { n cout << NO ; n return 0; n } else n ++a[i + 1]; n } n cout << YES ; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100 * 1000 + 10, M = 300 + 10; n int a[N], dp[N][M]; n vector p[N]; n int main() { n ios_base::sync_with_stdio(false); n int n, m, s, e; n cin >> n >> m >> s >> e; n for (int i = (0); i <= (n - 1); i++) cin >> a[i]; n for (int i = (1); i <= (m); i++) { n int x; n cin >> x; n p[x].emplace_back(i); n } n int ans = 0; n for (int i = (0); i <= (s / e); i++) dp[0][i] = i * (m + 1); n for (int i = (1); i <= (n); i++) { n for (int j = (1); j <= (s / e); j++) { n auto it = upper_bound((p[a[i - 1]]).begin(), (p[a[i - 1]]).end(), n (j == 1 ? 0 : dp[i - 1][j - 1])); n dp[i][j] = dp[i - 1][j]; n if (it != p[a[i - 1]].end()) { n dp[i][j] = min(dp[i][j], *it); n if (s - e * j >= i + dp[i][j]) ans = max(ans, j); n } n } n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n struct Node { n int val; n int op; n int cl; n Node(int x, int y, int z) { n val = x; n op = y; n cl = z; n } n Node() { Node(0, 0, 0); }; n }; n string s; n vector ST; n Node temp; n int n, t, x, y, t1, t2; n void update(int root, int l, int r, int pos) { n if (l > pos || r < pos) return; n if (l == r) { n if (s[pos - 1] == ( ) ST[root].op = 1; n if (s[pos - 1] == ) ) ST[root].cl = 1; n return; n } n int mid = (l + r) / 2; n update(root * 2, l, mid, pos); n update(root * 2 + 1, mid + 1, r, pos); n ST[root].val = ST[root * 2].val + ST[root * 2 + 1].val + n min(ST[root * 2].op - ST[root * 2].val, n ST[root * 2 + 1].cl - ST[root * 2 + 1].val); n ST[root].op = ST[root * 2].op + ST[root * 2 + 1].op; n ST[root].cl = ST[root * 2].cl + ST[root * 2 + 1].cl; n } n Node get(int root, int l, int r, int u, int v) { n if (u > r || v < l) return Node(0, 0, 0); n if (u == l && v == r) return ST[root]; n int mid = (l + r) / 2; n if (v <= mid) n return get(root * 2, l, mid, u, v); n else if (u > mid) n return get(root * 2 + 1, mid + 1, r, u, v); n else { n Node n1 = get(root * 2, l, mid, u, mid), n n2 = get(root * 2 + 1, mid + 1, r, mid + 1, v); n int t1 = n1.val + n2.val + min(n1.op - n1.val, n2.cl - n2.val); n return Node(t1, n1.op + n2.op, n1.cl + n2.cl); n } n } n int main() { n cin >> s; n n = s.size(); n for (int i = 0; i < 4 * n; ++i) ST.push_back(Node(0, 0, 0)); n for (int i = 1; i <= n; ++i) update(1, 1, n, i); n cin >> t; n while (t--) { n cin >> x >> y; n cout << get(1, 1, n, x, y).val * 2 << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(false); n int i, j, t, n, a[150], b[150], sum1 = 0, sum2 = 0; n cin >> n; n for (i = 1; i <= n; i++) { n cin >> a[i]; n } n for (i = 1; i <= n; i++) { n cin >> b[i]; n } n for (i = 1; i <= n; i++) { n if (a[i] && !b[i]) sum1++; n if (!a[i] && b[i]) sum2++; n } n if (sum1 == 0) { n cout << -1 << n ; n } else if (sum1 > sum2) { n cout << 1 << n ; n } else { n int k = sum2 / sum1; n k++; n cout << k << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, pos, l, r, diff, rflag = 1, lflag = 1; n cin >> n >> pos >> l >> r; n diff = r - l; n if (l == 1) lflag = 0; n if (r == n) rflag = 0; n if (lflag == 0 && rflag == 0) n cout << 0; n else if (lflag == 0) n cout << abs(r - pos) + 1; n else if (rflag == 0) n cout << abs(pos - l) + 1; n else n cout << diff + min(abs(r - pos), abs(pos - l)) + 2; n } n "} +{"func_code_string": "#include n using namespace std; n double maxoo(double, double); n int main() { n int p1, p2, t1, t2; n cin >> p1 >> p2 >> t1 >> t2; n double p11, p12, p21, p22, misha, vasya; n p11 = (3 * p1) / 10; n p12 = (p1 - (p1 / 250) * t1); n p21 = (3 * p2) / 10; n p22 = p2 - (p2 / 250) * t2; n misha = maxoo(p11, p12); n vasya = maxoo(p21, p22); n if (misha > vasya) n cout << Misha ; n else if (misha == vasya) n cout << Tie ; n else if (misha < vasya) n cout << Vasya ; n return 0; n } n double maxoo(double m, double n) { n if (m >= n) n return m; n else n return n; n } n "} +{"func_code_string": "#include n using namespace std; n struct SuffixArray { n char* T; n int n; n vector RA, tempRA; n vector SA, tempSA, c; n vector phi, pLCP, LCP; n SuffixArray(string& t) { n n = t.length(); n T = new char[n + n]; n for (int i = 0; i < n; T[i] = t[i], i++) n ; n T[n++] = # , T[n] = 0 ; n c.resize(max(300, n)); n RA.resize(n), tempRA.resize(n); n SA.resize(n), tempSA.resize(n); n } n void countingSort(int k) { n fill(c.begin(), c.end(), 0); n for (int i = 0; i < n; i++) c[i + k < n ? RA[i + k] : 0]++; n for (int i = 0, sum = 0, lim = max(300, n); i < lim; i++) { n int t = c[i]; n c[i] = sum, sum += t; n } n for (int i = 0; i < n; i++) n tempSA[c[SA[i] + k < n ? RA[SA[i] + k] : 0]++] = SA[i]; n for (int i = 0; i < n; i++) SA[i] = tempSA[i]; n } n void buildSA() { n for (int i = 0; i < n; SA[i] = i, i++) n ; n for (int i = 0; i < n; RA[i] = T[i], i++) n ; n for (int k = 1, r; k < n; k <<= 1) { n countingSort(k); n countingSort(0); n tempRA[SA[0]] = r = 0; n for (int i = 1; i < n; i++) { n tempRA[SA[i]] = n (RA[SA[i]] == RA[SA[i - 1]] and RA[SA[i] + k] == RA[SA[i - 1] + k] n ? r n : ++r); n } n for (int i = 0; i < n; RA[i] = tempRA[i], i++) n ; n if (RA[SA[n - 1]] == n - 1) break; n } n } n void computeLCP() { n phi.resize(n), pLCP.resize(n), LCP.resize(n); n phi[SA[0]] = -1; n for (int i = 1; i < n; phi[SA[i]] = SA[i - 1], i++) n ; n for (int i = 0, L = 0; i < n; i++) { n if (phi[i] == -1) { n pLCP[i] = 0; n continue; n } n for (; T[i + L] == T[phi[i] + L]; L++) n ; n pLCP[i] = L; n L = max(0, L - 1); n } n for (int i = 0; i < n; LCP[i] = pLCP[SA[i]], i++) n ; n } n void print() { n for (int i = 0; i + 1 < n; i++) { n printf( %2d t%2d t%s n , SA[i], LCP[i], T + SA[i]); n } n } n }; n struct Node { n int sum, lft, rgt; n Node() : sum(0), lft(0), rgt(0) {} n }; n struct PersistantSegmentTree { n int avail; n vector roots; n vector tree; n PersistantSegmentTree(int n) { n avail = 0; n roots.resize(n + 10, 0); n tree.resize(n * 30, Node()); n } n int update(int last, int l, int r, int p) { n int cur = ++avail; n tree[cur] = tree[last]; n if (l == r) { n tree[cur].sum++; n return cur; n } n int mid = l + (r - l) / 2; n if (p <= mid) n tree[cur].lft = update(tree[last].lft, l, mid, p); n else n tree[cur].rgt = update(tree[last].rgt, mid + 1, r, p); n tree[cur].sum = tree[tree[cur].lft].sum + tree[tree[cur].rgt].sum; n return cur; n } n int query(int cur, int l, int r, int L, int R) { n if (l > R or r < L or L > R) return 0; n if (l >= L and r <= R) return tree[cur].sum; n int mid = l + (r - l) / 2; n int pp = query(tree[cur].lft, l, mid, L, R); n int qq = query(tree[cur].rgt, mid + 1, r, L, R); n return pp + qq; n } n }; n int main() { n ios_base ::sync_with_stdio(0); n cin.tie(0), cout.tie(0); n int n; n string s; n cin >> n >> s; n SuffixArray SA(s); n SA.buildSA(); n SA.computeLCP(); n PersistantSegmentTree PSG(SA.n); n vector have; n for (int i = n - 1; i >= 0; i--) { n if (s[i] == ) ) { n have.push_back(i); n continue; n } n if (!have.empty()) { n PSG.roots[i] = n PSG.update(PSG.roots[have.back() + 1], 0, SA.n, have.back()); n have.pop_back(); n } n } n long long res = 0; n for (int i = 1; i < SA.n; i++) { n if (s[SA.SA[i]] == ) ) continue; n int L = SA.SA[i]; n int R = L + SA.LCP[i] - 1; n int add = PSG.query(PSG.roots[L], 0, SA.n, L, SA.n); n int bad = PSG.query(PSG.roots[L], 0, SA.n, L, R); n res += (0, max(0, add - bad)); n } n cout << res << n ; n } n "} +{"func_code_string": "#include n using namespace std; n long long sum[500]; n int deep[500]; n int in1[500]; n int out1[500]; n int in2[500]; n int out2[500]; n vector maps1[500]; n vector maps2[500]; n long long dp[150000]; n long long n, m, t; n int cnt = 0; n void topo2() { n queue q; n for (int i = 1; i <= n; ++i) n if (in2[i] == 0) { n q.push(i); n deep[i] = 0; n } n int n1, n2; n while (!q.empty()) { n n1 = q.front(); n q.pop(); n cnt++; n t -= deep[n1] * sum[n1]; n for (int i = 0; i < maps2[n1].size(); ++i) { n n2 = maps2[n1][i]; n in2[n2]--; n deep[n2] = max(deep[n2], deep[n1] + 1); n if (in2[n2] == 0) q.push(n2); n } n } n } n void topo1() { n queue q; n int n1, n2; n for (int i = 1; i <= n; ++i) n if (in1[i] == 0) { n q.push(i); n } n while (!q.empty()) { n n1 = q.front(); n q.pop(); n for (int i = 0; i < maps1[n1].size(); ++i) { n n2 = maps1[n1][i]; n in1[n2]--; n sum[n2] += sum[n1]; n if (in1[n2] == 0) { n q.push(n2); n } n } n } n } n int main() { n scanf( %lld%lld%lld , &n, &m, &t); n for (int i = 1; i <= n; ++i) scanf( %lld , &sum[i]); n for (int i = 1; i <= m; ++i) { n int x, y; n scanf( %d%d , &x, &y); n maps1[x].push_back(y); n in1[y]++; n out1[x]++; n maps2[y].push_back(x); n in2[x]++; n out2[y]++; n } n topo2(); n if (t < 0 || cnt != n) n printf( 0 n ); n else { n topo1(); n memset(dp, 0, sizeof(dp)); n dp[0] = 1; n for (long long i = 1; i <= n; ++i) { n for (long long j = sum[i]; j <= t; ++j) { n dp[j] += dp[j - sum[i]]; n dp[j] %= 1000000007; n } n } n printf( %lld n , dp[t]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int wyn[1024]; n int odp[1024]; n int n; n int pyt; n vector > v[2]; n void pytaj(vector& skad, vector& gdzie) { n if (skad.size() == 0) return; n printf( %d n , int(skad.size())); n for (int i = 0; i < skad.size(); i++) printf( %d , skad[i] + 1); n printf( n ); n fflush(stdout); n for (int i = 0; i < n; i++) scanf( %d , &odp[i]); n pyt++; n for (int q = 0; q < gdzie.size(); q++) { n int i = gdzie[q]; n wyn[i] = min(wyn[i], odp[i]); n } n } n int main() { n pyt = 0; n scanf( %d , &n); n for (int i = 0; i < n; i++) wyn[i] = 1000000010; n v[0].push_back(make_pair(0, n - 1)); n int akt = 0; n while (!v[akt].empty()) { n v[1 - akt].clear(); n vector pyt1, pyt2; n for (int k = 0; k < v[akt].size(); k++) { n int a = v[akt][k].first; n int b = v[akt][k].second; n int sr = (a + b) / 2; n for (int q = a; q <= sr; q++) pyt1.push_back(q); n for (int q = sr + 1; q <= b; q++) pyt2.push_back(q); n if (sr > a) v[1 - akt].push_back(make_pair(a, sr)); n if (b > sr + 1) v[1 - akt].push_back(make_pair(sr + 1, b)); n } n pytaj(pyt1, pyt2); n pytaj(pyt2, pyt1); n akt = 1 - akt; n } n printf( -1 n ); n for (int i = 0; i < n; i++) printf( %d , wyn[i]); n printf( n ); n fflush(stdout); n } n "} +{"func_code_string": "#include n using namespace std; n int main(void) { n int n; n cin >> n; n if (n == 0) { n cout << 1 << endl; n return 0; n } n vector p(n); n vector powers(n, 1); n vector curval(n); n using pdi = pair; n priority_queue> q; n double prob = 1.0; n for (int i = 0; i < n; ++i) { n cin >> p[i]; n p[i] /= 100.0; n prob *= p[i]; n curval[i] = p[i]; n q.push(pdi((1 - pow(1 - p[i], powers[i] + 1)) / curval[i], i)); n } n double result = n + 1 - prob; n for (int i = 0; i < 500000; ++i) { n auto c = q.top(); n q.pop(); n prob /= curval[c.second]; n ++powers[c.second]; n curval[c.second] = 1 - pow(1 - p[c.second], powers[c.second]); n prob *= curval[c.second]; n q.push( n pdi((1 - pow(1 - p[c.second], powers[c.second] + 1)) / curval[c.second], n c.second)); n result += 1 - prob; n } n cout << fixed << setprecision(20) << result << endl; n } n "} +{"func_code_string": " n // Problem: A. Robot Program n // Contest: Codeforces - Educational Codeforces Round 98 (Rated for Div. 2) n // URL: https://codeforces.com/contest/1452/problem/A n // Memory Limit: 256 MB n // Time Limit: 2000 ms n // Powered by CP Editor (https://github.com/cpeditor/cpeditor) n n #include n n using namespace std; n n #define fi first n #define se second n #define pb push_back n #define int long long n #define F(i, n) for (int i = 0; i < n; i++) n #define all(x)(x).begin(), (x).end() n n using ld = long double; n using vi = vector ; n using mi = map ; n using pii = pair ; n n const int N = 100005; n const int MOD = 1e9 + 7; n n #define show(arr) { for (auto x: arr) cout << x << ; cout << n ; } n #define show_(arr, n) F(i, n) show(arr[i]) n n void solve() { n int n; cin>>n; n int a[n],sum=0,mx=0; n F(i,n){ n cin>>a[i]; n sum+=a[i]; n mx=max(mx,a[i]); n } n cout<> t; n while (t--) solve(); n n return 0; n }"} +{"func_code_string": "#include n using namespace std; n using namespace std; n int k; n string ad; n vector c(string s) { n vector ans; n int last = 0; n for (long long i = 0; i < (s.size()); i++) { n if (s[i] == || s[i] == - || i == s.size() - 1) { n ans.push_back(s.substr(last, i - last + 1)); n last = i + 1; n } n } n return ans; n } n vector v; n bool check(int mid) { n int nlen = 0; n int cnt = 1; n for (long long i = 0; i < (v.size()); i++) { n if (v[i].size() > mid) { n return false; n } n if (nlen + v[i].size() <= mid) { n nlen += v[i].size(); n } else { n nlen = v[i].size(); n cnt++; n } n } n if (cnt <= k) { n return true; n } n return false; n } n int main() { n cin >> k; n cin.ignore(); n getline(cin, ad, n ); n v = c(ad); n int l = 0, r = ad.size(); n while (l < r) { n int mid = (l + r) >> 1; n if (!check(mid)) { n l = mid + 1; n } else { n r = mid; n } n } n cout << r; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a, b, r, x; n int main() { n cin >> a; n b = 45 * 17 * 10000000000000000LL; n r = 100000000000000000LL - 1; n x = b % a; n cout << a - x << << a - x + r; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize(2) n #pragma GCC optimize(3) n #pragma GCC optimize( Ofast ) n #pragma GCC optimize( inline ) n #pragma GCC optimize( -fgcse ) n #pragma GCC optimize( -fgcse-lm ) n #pragma GCC optimize( -fipa-sra ) n #pragma GCC optimize( -ftree-pre ) n #pragma GCC optimize( -ftree-vrp ) n #pragma GCC optimize( -fpeephole2 ) n #pragma GCC optimize( -ffast-math ) n #pragma GCC optimize( -fsched-spec ) n #pragma GCC optimize( unroll-loops ) n #pragma GCC optimize( -falign-jumps ) n #pragma GCC optimize( -falign-loops ) n #pragma GCC optimize( -falign-labels ) n #pragma GCC optimize( -fdevirtualize ) n #pragma GCC optimize( -fcaller-saves ) n #pragma GCC optimize( -fcrossjumping ) n #pragma GCC optimize( -fthread-jumps ) n #pragma GCC optimize( -funroll-loops ) n #pragma GCC optimize( -fwhole-program ) n #pragma GCC optimize( -freorder-blocks ) n #pragma GCC optimize( -fschedule-insns ) n #pragma GCC optimize( inline-functions ) n #pragma GCC optimize( -ftree-tail-merge ) n #pragma GCC optimize( -fschedule-insns2 ) n #pragma GCC optimize( -fstrict-aliasing ) n #pragma GCC optimize( -fstrict-overflow ) n #pragma GCC optimize( -falign-functions ) n #pragma GCC optimize( -fcse-skip-blocks ) n #pragma GCC optimize( -fcse-follow-jumps ) n #pragma GCC optimize( -fsched-interblock ) n #pragma GCC optimize( -fpartial-inlining ) n #pragma GCC optimize( no-stack-protector ) n #pragma GCC optimize( -freorder-functions ) n #pragma GCC optimize( -findirect-inlining ) n #pragma GCC optimize( -frerun-cse-after-loop ) n #pragma GCC optimize( inline-small-functions ) n #pragma GCC optimize( -finline-small-functions ) n #pragma GCC optimize( -ftree-switch-conversion ) n #pragma GCC optimize( -foptimize-sibling-calls ) n #pragma GCC optimize( -fexpensive-optimizations ) n #pragma GCC optimize( -funsafe-loop-optimizations ) n #pragma GCC optimize( inline-functions-called-once ) n #pragma GCC optimize( -fdelete-null-pointer-checks ) n using namespace std; n inline long long read() { n long long x = 0, y = 0, c = getchar(); n while (!isdigit(c)) y = c, c = getchar(); n while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 0 ), c = getchar(); n return y == - ? -x : x; n } n inline void print(long long q) { n if (q < 0) putchar( - ), q = -q; n if (q >= 10) print(q / 10); n putchar(q % 10 + 0 ); n } n int n, m, k; n struct edge { n int fr, to, val, id; n bool fg; n } e[1000010]; n int f[1000010]; n inline int getf(int q) { return f[q] == q ? q : f[q] = getf(f[q]); } n inline bool operator<(edge q, edge w) { n return q.val == w.val ? q.fg < w.fg : q.val < w.val; n } n inline bool cmp(edge q, edge w) { n return q.val == w.val ? q.fg > w.fg : q.val < w.val; n } n int as[1000010], ft; n bool usd[1000010]; n inline int work() { n int i, as = 0, as2 = 0; n sort(e + 1, e + m + 1); n for (i = 1; i <= n; ++i) f[i] = i; n for (i = 1; i <= m; ++i) n if (getf(e[i].fr) != getf(e[i].to)) { n f[f[e[i].fr]] = f[e[i].to]; n as += e[i].fg; n ++as2; n } n return as2 != n - 1 ? -1 : as; n } n int main() { n int i, j, l, r, mid, ans; n n = read(); n m = read(); n k = read(); n for (i = 1; i <= m; ++i) { n e[i].fr = read(); n e[i].to = read(); n e[i].val = read(); n e[i].id = i; n e[i].fg = (e[i].fr == 1 || e[i].to == 1); n } n l = -1e6; n r = 1e6; n ans = l - 1; n while (l <= r) { n mid = l + r >> 1; n for (i = 1; i <= m; ++i) n if (e[i].fg) e[i].val -= mid; n int tmp = work(); n if (tmp == -1) { n puts( -1 ); n return 0; n } n if (tmp <= k) n ans = mid, l = mid + 1; n else n r = mid - 1; n for (i = 1; i <= m; ++i) n if (e[i].fg) e[i].val += mid; n } n if (ans == -1e6 - 1) { n puts( -1 ); n return 0; n } n int tp = 0; n for (i = 1; i <= m; ++i) n if (e[i].fg) e[i].val -= ans; n sort(e + 1, e + m + 1); n for (i = 1; i <= n; ++i) f[i] = i; n for (i = 1; i <= m; ++i) n if (getf(e[i].fr) != getf(e[i].to)) { n f[f[e[i].fr]] = f[e[i].to]; n if (e[i].fg) usd[e[i].id] = 1, as[++ft] = e[i].id, ++tp; n } n if (tp > k) { n puts( -1 ); n return 0; n } n for (i = 1; i <= n; ++i) f[i] = i; n for (i = 1; i <= m; ++i) n if (usd[e[i].id]) f[getf(e[i].fr)] = getf(e[i].to); n sort(e + 1, e + m + 1, cmp); n for (i = 1; i <= m; ++i) n if (!usd[e[i].id] && getf(e[i].fr) != getf(e[i].to)) { n if (e[i].fg && tp == k) continue; n f[f[e[i].fr]] = f[e[i].to]; n as[++ft] = e[i].id; n tp += e[i].fg; n } n if (tp < k) { n puts( -1 ); n return 0; n } n print(ft); n putchar( n ); n for (i = 1; i <= ft; ++i) print(as[i]), putchar( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void getar(T a, int n, int m) { n for (int i = 0; i < n; i++) n for (int j = 0; j < m; ++j) { n scanf( %d , &a[i][j]); n } n } n inline void getar(int *a, int n) { n for (int ii = 0; ii < n; ii++) { n scanf( %d , a + ii); n } n } n inline void getar(pair *a, int n) { n for (int ii = 0; ii < n; ii++) { n scanf( d , &a[ii].first, &a[ii].second); n } n } n inline void getar(long long *a, int n) { n for (int ii = 0; ii < n; ii++) { n scanf( %I64d , a + ii); n } n } n inline void getv(vector &a, int n) { n for (int ii = 0; ii < n; ii++) { n scanf( %d , &a[ii]); n } n } n inline void getv(vector &a, int n) { n for (int ii = 0; ii < n; ii++) { n scanf( %I64d , &a[ii]); n } n } n inline void getv(vector > &a, int n) { n for (int ii = 0; ii < n; ii++) { n scanf( %d , &a[ii].first, &a[ii].second); n } n } n inline void getv(vector > &a, int n) { n for (int ii = 0; ii < n; ii++) { n scanf( %I64d , &a[ii].first, &a[ii].second); n } n } n inline void getvv(vector > &a, int n, int m) { n for (int i = 0; i < n; i++) n for (int j = 0; j < m; ++j) { n scanf( %d , &a[i][j]); n } n } n inline void printa(int *a, int i, int j) { n for (int ii = i; ii <= j; ii++) { n printf( %d , a[ii]); n } n } n inline void printa(long long *a, int i, int j) { n for (int ii = i; ii <= j; ii++) { n printf( %I64d , a[ii]); n } n } n inline void printv(vector &a, int i, int j) { n for (int ii = i; ii <= j; ii++) { n printf( %d , a[ii]); n } n } n inline void printv(vector &a, int n, int i, int j) { n for (int ii = i; ii <= j; ii++) { n printf( %I64d , a[ii]); n } n } n inline long long max(long long a, long long b) { return (a > b) ? a : b; } n inline int max(int a, int b) { return (a > b) ? a : b; } n inline double max(double a, double b) { return (a > b) ? a : b; } n inline long long max(long long a, long long b, long long c) { n return max(a, max(b, c)); n } n inline int max(int a, int b, int c) { return max(a, max(b, c)); } n inline double max(double a, double b, double c) { return max(a, max(b, c)); } n inline long long min(long long a, long long b) { return (a < b) ? a : b; } n inline int min(int a, int b) { return (a < b) ? a : b; } n inline double min(double a, double b) { return (a < b) ? a : b; } n inline long long min(long long a, long long b, long long c) { n return min(a, min(b, c)); n } n inline int min(int a, int b, int c) { return min(a, min(b, c)); } n inline double min(double a, double b, double c) { return min(a, min(b, c)); } n inline long long pow(long long x, long long n) { n long long res = 1; n while (n) { n if (n & 1) res *= x; n x *= x; n n >>= 1; n } n return res; n } n inline long long powmod(long long x, long long n, long long _mod) { n long long res = 1; n while (n) { n if (n & 1) res = (res * x) % _mod; n x = (x * x) % _mod; n n >>= 1; n } n return res; n } n inline long long gcd(long long a, long long b) { n long long t; n while (b) { n a = a % b; n t = a; n a = b; n b = t; n } n return a; n } n inline int gcd(int a, int b) { n int t; n while (b) { n a = a % b; n t = a; n a = b; n b = t; n } n return a; n } n inline long long lcm(int a, int b) { return a / gcd(a, b) * (long long)b; } n inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } n inline long long gcd(long long a, long long b, long long c) { n return gcd(gcd(a, b), c); n } n inline int gcd(int a, int b, int c) { return gcd(gcd(a, b), c); } n inline long long lcm(long long a, long long b, long long c) { n return lcm(lcm(a, b), c); n } n inline long long lcm(int a, int b, int c) { n return lcm(lcm(a, b), (long long)c); n } n inline int bits_count(int v) { n v = v - ((v >> 1) & 0x55555555); n v = (v & 0x33333333) + ((v >> 2) & 0x33333333); n return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24; n } n inline int bits_count(long long v) { n long long t = v >> 32; n long long p = (v & ((1LL << 32) - 1)); n return bits_count(t) + bits_count(p); n } n inline bool ispow2(int x) { return (x != 0 && (x & (x - 1)) == 0); } n const char nl = n ; n void solve() { n int n; n cin >> n; n vector a(n); n getv(a, n); n int last = -1, cnt = 0; n sort(a.begin(), a.end()); n for (int i = 0; i < n; i++) { n if (a[i] != 1 && last < a[i] - 1) n last = a[i] - 1, cnt++; n else if (last < a[i]) n last = a[i], cnt++; n else if (last < a[i] + 1) n last = a[i] + 1, cnt++; n } n cout << cnt << nl; n } n int main() { n clock_t clk = clock(); n cerr << Hey P.. n ; n int t; n t = 1; n while (t--) solve(); n cerr << Look at the sky. n ; n cerr << Time (in ms): << (double)(clock() - clk) * 1000.0 / CLOCKS_PER_SEC n << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void read(_T &f) { n f = 0; n _T fu = 1; n char c = getchar(); n while (c < 0 || c > 9 ) { n if (c == - ) { n fu = -1; n } n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n f = (f << 3) + (f << 1) + (c & 15); n c = getchar(); n } n f *= fu; n } n template n void print(T x) { n if (x < 0) putchar( - ), x = -x; n if (x < 10) n putchar(x + 48); n else n print(x / 10), putchar(x % 10 + 48); n } n template n void print(T x, char t) { n print(x); n putchar(t); n } n const int N = 1e6 + 5; n struct ele { n int f, g; n ele(int a = 0, int b = 0) : f(a), g(b) {} n bool operator<(const ele A) const { n if (f != A.f) return f < A.f; n return g > A.g; n } n }; n ele operator+(const ele a, const ele b) { return ele(a.f + b.f, a.g + b.g); } n ele f[N]; n char c[N]; n int s[N]; n int n, k, l; n ele dp(int mid) { n for (int i = 0; i < l; i++) f[i] = ele(0, 0); n for (int i = l; i <= n; i++) n f[i] = max(f[i - 1], f[i - l] + ele(s[i] - s[i - l] - mid, 1)); n return f[n]; n } n int solve(int opt) { n for (int i = 1; i <= n; i++) n s[i] = s[i - 1] + ((c[i] >= a && c[i] <= z ) == opt); n int l = 0, r = n - 1, ans = n; n while (l <= r) { n int mid = (l + r) >> 1; n if (dp(mid).g <= k) n ans = mid, r = mid - 1; n else n l = mid + 1; n } n return s[n] - (dp(ans).f + ans * k); n } n int main() { n read(n); n read(k); n read(l); n scanf( %s , c + 1); n if (1ll * k * l > n) { n print(0, n ); n return 0; n } n print(min(solve(0), solve(1)), n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 100005; n int legs[N]; n bool hide[N]; n vector > adj; n void dfs(int v, int par = 0) { n if (adj[v].size() <= 2u) { n hide[v] = true; n for (int i : adj[v]) { n if (i != par) { n dfs(i, v); n } n } n } n } n int main() { n int n, a, b; n scanf( %d , &n); n adj.resize(n + 1); n for (int i = 0; i < n - 1; ++i) { n scanf( %d%d , &a, &b); n adj[a].push_back(b); n adj[b].push_back(a); n } n for (int i = 1; i <= n; ++i) { n if (adj[i].size() == 1u) { n dfs(i); n } n } n for (int i = 1; i <= n; ++i) { n for (int j : adj[i]) { n if (hide[j]) { n legs[i] = min(2, legs[i] + 1); n } n } n } n for (int i = 1; i <= n; ++i) { n if (!hide[i]) { n int count = 0; n for (int j : adj[i]) { n if (!hide[j] && (int)adj[j].size() - legs[j] > 1) { n ++count; n } n } n if (count > 2) { n printf( No n ); n return 0; n } n } n } n printf( Yes n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int parent[5001][5001]; n int dp[5001][5001]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n long long n, m, t; n cin >> n >> m >> t; n vector u(m + 1), v(m + 1), tm(m + 1); n for (int i = 1; i <= m; i++) { n cin >> u[i] >> v[i] >> tm[i]; n } n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n dp[i][j] = 1e9 + 5; n } n } n dp[1][1] = 0; n for (int i = 2; i <= n; i++) { n for (int j = 1; j <= m; j++) { n int p = u[j]; n int cur = v[j]; n if (dp[p][i - 1] + tm[j] < dp[cur][i]) { n dp[cur][i] = dp[p][i - 1] + tm[j]; n parent[cur][i] = p; n } n } n } n int res = 0; n for (int i = n; i > 0; i--) { n if (dp[n][i] <= t) { n res = i; n break; n } n } n cout << res << endl; n int ind = n; n int visit = res; n vector path; n while (ind != 0) { n path.push_back(ind); n ind = parent[ind][visit--]; n } n for (int i = path.size() - 1; i >= 0; i--) { n cout << path[i] << ; n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n pair dp[1100][20]; n int bitcnt[1100]; n long long p10[21]; n string a; n int n, k; n pair dfs(int bi, int pos, int flag, int leading) { n if (pos == -1) return make_pair(0, 1); n if (dp[bi][pos].second != -1 && !flag && !leading) { n return dp[bi][pos]; n } n long long ans = 0; n long long cnt = 0; n int upper = (flag ? a[n - pos - 1] - 0 : 9); n for (int i = 0; i <= upper; i++) { n int nextstate = (bi | (1 << i)); n if ((bi & (1 << i)) == 0 && !(leading && i == 0)) { n if (bitcnt[nextstate] > k) continue; n pair p = n dfs(nextstate, pos - 1, flag && (i == upper), leading && (i == 0)); n cnt = (cnt + p.second) % 998244353; n ans = (ans + n ((((p.second * i) % 998244353) * p10[pos]) % 998244353 + p.first) % n 998244353) % n 998244353; n } else { n pair p = n dfs(bi, pos - 1, flag && (i == upper), leading && (i == 0)); n cnt = (cnt + p.second) % 998244353; n ans = (ans + n ((((p.second * i) % 998244353) * p10[pos]) % 998244353 + p.first) % n 998244353) % n 998244353; n } n } n if (!flag && !leading) { n dp[bi][pos] = make_pair(ans % 998244353, cnt % 998244353); n } n return make_pair(ans % 998244353, cnt % 998244353); n } n long long solve(long long num) { n a = to_string(num); n n = (int)a.length(); n pair p = dfs(0, n - 1, 1, 1); n return p.first % 998244353; n } n int main() { n long long l, r; n int i, j; n p10[0] = 1; n for (i = 1; i <= 20; i++) { n p10[i] = (p10[i - 1] * 10) % 998244353; n } n for (i = 0; i < 1100; i++) { n for (j = 0; j < 20; j++) { n dp[i][j] = make_pair(0, -1); n } n } n bitcnt[0] = 0; n bitcnt[1] = 1; n for (i = 2; i < 1100; i++) bitcnt[i] = bitcnt[i - (i & -i)] + 1; n cin >> l >> r >> k; n cout << (solve(r) - solve(l - 1) + 998244353) % 998244353 << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-8; n const double pi = acos(-1.0); n const int INF = 0x3f3f3f3f; n const int mod = 1e9 + 7; n long long powmod(long long a, long long b) { n long long res = 1; n a %= mod; n assert(b >= 0); n for (; b; b >>= 1) { n if (b & 1) res = res * a % mod; n a = a * a % mod; n } n return res; n } n string s; n int main() { n int t, cas = 1; n cin >> s; n int n = ((int)(s).size()); n for (int i = 1; i <= n / 2; i++) { n int cnt = 0; n for (int j = 0; j < n - i; j++) { n if (s[j] == s[j + i]) n cnt++; n else n cnt = 0; n if (cnt == i) { n s = s.substr(0, j - i + 1) + s.substr(j + 1, n - j - 1); n n -= i; n i = 0; n break; n } n } n } n cout << s << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n int b[200005]; n vector a; n cin >> n; n a.push_back(31); n a.push_back(28); n a.push_back(31); n a.push_back(30); n a.push_back(31); n a.push_back(30); n a.push_back(31); n a.push_back(31); n a.push_back(30); n a.push_back(31); n a.push_back(30); n a.push_back(31); n for (int i = 0; i < n; i++) { n cin >> b[i]; n } n for (int i = 0; i < 12; i++) { n int count = 0, f = 0; n for (int j = 0; j < n; j++) { n if ((i + j) % 12 == 1) { n if (a[(i + j) % 12] == b[j]) n continue; n else { n if (a[(i + j) % 12] == 28 && b[j] == 29 && count == 0) { n count = 1; n continue; n } n } n } n if (a[(i + j) % 12] != b[j]) { n f = 1; n break; n } n } n if (f == 0) { n cout << YES << endl; n return 0; n } n } n cout << NO << endl; n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC target( sse4,avx ) n const double pi = 3.14159265358979323; n struct dpoint { n double x, y; n dpoint() : x(0), y(0) {} n dpoint(double x, double y) : x(x), y(y) {} n }; n void run(std::istream& in, std::ostream& out) { n int n; n dpoint p; n in >> n >> p.x >> p.y; n std::vector points(n); n for (int i = 0; i < n; i++) { n in >> points[i].x >> points[i].y; n } n double maxR = 0; n double minR = 1e10; n for (int i = 0; i < n; i++) { n double dist1 = hypot(points[i].x - p.x, points[i].y - p.y); n maxR = std::max(maxR, dist1); n minR = std::min(minR, dist1); n dpoint& p1 = points[i]; n dpoint& p2 = points[(i + 1) % n]; n if ((p2.x - p1.x) * (p.x - p1.x) + (p2.y - p1.y) * (p.y - p1.y) > 0.5 && n (p1.x - p2.x) * (p.x - p2.x) + (p1.y - p2.y) * (p.y - p2.y) > 0.5) { n double a = p1.y - p2.y; n double b = p2.x - p1.x; n double dist = a * p.x + b * p.y - a * p1.x - b * p1.y; n dist /= hypot(a, b); n minR = std::min(minR, std::abs(dist)); n } n } n out.precision(20); n out << std::fixed; n out << (maxR * maxR - minR * minR) * pi << std::endl; n } n int main() { n std::cin.sync_with_stdio(false); n std::cin.tie(nullptr); n run(std::cin, std::cout); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void fastInOut() { n ios_base::sync_with_stdio(0); n cin.tie(NULL), cout.tie(NULL); n } n int dx[] = {0, 0, 1, -1, -1, -1, 1, 1}; n int dy[] = {1, -1, 0, 0, -1, 1, -1, 1}; n int main() { n double m, n, total = 0.0; n cin >> m >> n; n for (double i = 1; i <= m; i++) { n double temp = pow(i / m, n) - pow((i - 1) / m, n); n temp *= i; n total += temp; n } n cout << fixed << setprecision(12) << total; n } n "} +{"func_code_string": "#include n using namespace std; n const int _1e5 = 100000; n const int _1e7 = 10000000; n const int _1e9 = 1000000000; n template n ostream& operator<<(ostream& str, const pair& p) { n return str << ( << p.first << , << p.second << ) ; n } n template n ostream& operator<<(ostream& str, const vector& v) { n str << [ ; n for (const auto& n : v) str << n << , ; n str << ] ; n return str; n } n template n ostream& operator<<(ostream& str, const set& v) { n str << { ; n for (const auto& n : v) { n str << n << , ; n } n str << } ; n return str; n } n template n ostream& operator<<(ostream& str, const unordered_map& v) { n str << { ; n for (const auto& p : v) { n str << p.first << => << p.second << , ; n } n str << } ; n return str; n } n int main() { n ios_base::sync_with_stdio(false); n cout.setf(std::ios::fixed); n cout.precision(12); n int n; n cin >> n; n string a; n cin >> a; n vector f(10); n f[0] = 0; n for (int i = 1; i <= 9; ++i) { n cin >> f[i]; n } n int left_start = -1; n for (int i = 0; i < a.size(); ++i) { n int digit = a[i] - 0 ; n if (f[digit] > digit) { n left_start = i; n break; n } n } n if (left_start == -1) { n cout << a << endl; n return 0; n } n while (true) { n if (left_start >= a.size()) { n break; n } n int digit = a[left_start] - 0 ; n if (f[digit] < digit) { n break; n } n a[left_start++] = 0 + f[digit]; n } n cout << a << endl; n } n "} +{"func_code_string": "#include n using namespace std; n typedef pair PII; n long long qpow(long long a, long long b, long long m) { n long long ans = 1; n while (b) { n if (b & 1) ans = ans * a % m; n a = a * a % m, b >>= 1; n } n return ans; n } n long long qpow(long long a, long long b) { n long long ans = 1; n while (b) { n if (b & 1) ans = ans * a; n a = a * a, b >>= 1; n } n return ans; n } n long long qmul(long long a, long long b, long long m) { n long long res = 0; n while (b > 0) { n if (b & 1) res = (res + a) % m; n a = (a + a) % m; n b >>= 1; n } n return res; n } n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } n long long lcm(long long a, long long b) { return a / gcd(a, b) * b; } n long long inv(long long t, long long p) { n return t == 1 ? 1 : (p - p / t) * inv(p % t, p) % p; n } n long long exgcd(long long a, long long b, long long &x, long long &y) { n if (b == 0) { n x = 1; n y = 0; n return a; n } n long long r = exgcd(b, a % b, y, x); n y -= (a / b) * x; n return r; n } n long long inv1(long long a, long long p) { n long long d, x, y; n d = exgcd(a, p, x, y); n return d == 1 ? (x % p + p) % p : -1; n } n template n T Add(T a, B b, long long m) { n return a + b >= m ? (a + b) % m : a + b; n } n template n T Sub(T a, B b, long long m) { n return a - b < 0 ? (a - b + m) % m : a - b; n } n template n void _sf(T &x) { n cin >> x; n } n void _sf(int &x) { scanf( %d , &x); } n void _sf(long long &x) { scanf( %lld , &x); } n void _sf(double &x) { scanf( %lf , &x); } n void _sf(char &x) { scanf( %c , &x); } n void _sf(char *x) { scanf( %s , x); } n void sf() {} n template n void sf(T &head, U &...tail) { n _sf(head); n sf(tail...); n } n template n void _pf(const T &x) { n cout << x; n } n void _pf(const int &x) { printf( %d , x); } n void _pf(const long long &x) { printf( %lld , x); } n void _pf(const double &x) { printf( %.16f , x); } n void _pf(const char &x) { putchar(x); } n void _pf(const char *x) { printf( %s , x); } n template n void _pf(const pair &x) { n pf(x.first); n putchar( ); n pf(x.second); n } n template n void _pf(const vector &x) { n for (auto i = x.begin(); i != x.end(); _pf(*i++)) n if (i != x.cbegin()) putchar( ); n } n void pf() {} n template n void pf(const T &head, const U &...tail) { n _pf(head); n putchar(sizeof...(tail) ? : n ); n pf(tail...); n } n template n inline void read(T &x) { n x = 0; n static int p; n p = 1; n static char c; n c = getchar(); n while (!isdigit(c)) { n if (c == - ) p = -1; n c = getchar(); n } n while (isdigit(c)) { n x = (x << 1) + (x << 3) + (c - 48); n c = getchar(); n } n x *= p; n } n const bool IOS = false; n const double PI = acos(-1); n const double eps = 1e-8; n const long long linf = 0x3f3f3f3f3f3f3f3f; n const long long INV2 = 500000004; n const long long mod = 1e9 + 7; n const int inf = 0x3f3f3f3f; n const int maxn = 1e6 + 100; n char s1[maxn], s2[maxn]; n long long a[maxn], b[maxn]; n void init() { n a[0] = b[0] = 1; n for (int i = 1; i < maxn; ++i) { n a[i] = (a[i - 1] * i) % mod; n } n b[maxn - 1] = qpow(a[maxn - 1], mod - 2, mod); n for (int i = maxn - 1; i > 0; i--) b[i - 1] = b[i] * i % mod; n } n long long C(long long n, long long m) { n if (n < m) return 0; n return a[n] * b[m] % mod * b[n - m] % mod; n } n int cnt[256]; n long long calc(char s[], int n) { n memset(cnt, 0, sizeof(cnt)); n for (int i = 1; i <= n; ++i) cnt[s1[i]]++; n long long tmp = a[n]; n for (int i = a ; i <= z ; ++i) tmp = tmp * b[cnt[i]] % mod; n long long ret = 0; n for (int i = 1; i <= n; ++i) { n tmp = tmp * qpow(n - i + 1, mod - 2, mod) % mod; n for (int j = a ; j < s[i]; ++j) n if (cnt[j]) ret = (ret + tmp * cnt[j] % mod) % mod; n tmp = tmp * cnt[s[i]] % mod; n cnt[s[i]]--; n if (cnt[s[i]] < 0) return ret; n } n return ret; n } n void Main(); n int main() { n if (IOS) std::ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n Main(); n 0; n return 0; n } n void Main() { n init(); n scanf( %s%s , s1 + 1, s2 + 1); n int len = strlen(s1 + 1); n long long res = calc(s2, len) - calc(s1, len); n res--; n res = (res % mod + mod) % mod; n pf(res); n } n "} +{"func_code_string": "#include n using namespace std; n int w[2][2]; n int kb[2], kc[2]; n int size[10][10]; n string s; n int main() { n ios_base::sync_with_stdio(0); n for (int i = 0; i <= (int)(2) - 1; i++) { n cin >> s; n w[i][0] = s[0] - a ; n w[i][1] = s[1] - 1 ; n } n cin >> s; n kb[0] = s[0] - a ; n kb[1] = s[1] - 1 ; n cin >> s; n kc[0] = s[0] - a ; n kc[1] = s[1] - 1 ; n for (int i = 0; i <= (int)(10) - 1; i++) n for (int j = 0; j <= (int)(10) - 1; j++) size[i][j] = 0; n int x, y; n for (int ii = 0; ii <= (int)(2) - 1; ii++) { n for (int i = w[ii][0] + 1; i <= 7; i++) { n if (i == kb[0] && w[ii][1] == kb[1]) break; n size[i][w[ii][1]] = 1; n } n for (int i = w[ii][0] - 1; i >= 0; i--) { n if (i == kb[0] && w[ii][1] == kb[1]) break; n size[i][w[ii][1]] = 1; n } n for (int j = w[ii][1] + 1; j <= 7; j++) { n if (w[ii][0] == kb[0] && j == kb[1]) break; n size[w[ii][0]][j] = 1; n } n for (int j = w[ii][1] - 1; j >= 0; j--) { n if (w[ii][0] == kb[0] && j == kb[1]) break; n size[w[ii][0]][j] = 1; n } n } n for (int i = -1; i <= 1; i++) n for (int j = -1; j <= 1; j++) { n int a = i + kb[0], b = j + kb[1]; n if (a >= 0 && a < 8 && b >= 0 && b < 8) { n size[a][b] = 1; n } n } n for (int i = -1; i <= 1; i++) n for (int j = -1; j <= 1; j++) { n int a = i + kc[0], b = j + kc[1]; n if (a >= 0 && a < 8 && b >= 0 && b < 8) { n if (size[a][b]) { n } else { n cout << OTHER n ; n return 0; n } n } n } n cout << CHECKMATE n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_N = 2e5 + 10; n int a[MAX_N]; n vector> scanCuts[2][MAX_N]; n pair cuts[MAX_N]; n int tree[2 * MAX_N], d[2 * MAX_N]; n void push(int i) { n d[2 * i + 1] += d[i]; n d[2 * i + 2] += d[i]; n tree[2 * i + 1] += d[i]; n tree[2 * i + 2] += d[i]; n d[i] = 0; n } n void pull(int i) { n tree[i] = min(tree[2 * i + 1], tree[2 * i + 2]); n tree[i] += d[i]; n } n void build(int i, int l, int r) { n if (r - l == 1) { n tree[i] = a[l]; n return; n } n int mid = (l + r) / 2; n build(2 * i + 1, l, mid); n build(2 * i + 2, mid, r); n pull(i); n } n void add(int l, int r, int x, int i, int cl, int cr) { n if (r <= cl || cr <= l) return; n if (l <= cl && cr <= r) { n tree[i] += x; n d[i] += x; n return; n } n int mid = (cl + cr) / 2; n add(l, r, x, 2 * i + 1, cl, mid); n add(l, r, x, 2 * i + 2, mid, cr); n pull(i); n } n int get(int l, int r, int i, int cl, int cr) { n if (r <= cl || cr <= l) return +1e9; n if (l <= cl && cr <= r) return tree[i]; n int mid = (cl + cr) / 2; n push(i); n return min(get(l, r, 2 * i + 1, cl, mid), get(l, r, 2 * i + 2, mid, cr)); n } n void print(int i, int cl, int cr) { n cout << i << ( << cl << ; << cr << ) -> << tree[i] << << d[i] n << n ; n if (cr - cl == 1) return; n int mid = (cl + cr) / 2; n print(2 * i + 1, cl, mid); n print(2 * i + 2, mid, cr); n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n int n, q; n cin >> n >> q; n for (int i = 0; i < n; ++i) cin >> a[i]; n build(0, 0, n); n set bestAns; n set currAns; n for (int i = 0; i < q; ++i) { n cin >> cuts[i].first >> cuts[i].second; n --cuts[i].first; n currAns.insert(i); n add(cuts[i].first, cuts[i].second, -1, 0, 0, n); n scanCuts[0][cuts[i].first].push_back({cuts[i].second, i}); n scanCuts[1][cuts[i].second].push_back({cuts[i].first, i}); n } n int ans = 0; n for (int i = 0; i < n; ++i) { n for (auto u : scanCuts[0][i]) { n add(i, u.first, 1, 0, 0, n); n currAns.erase(u.second); n } n for (auto u : scanCuts[1][i]) { n add(u.first, i, -1, 0, 0, n); n currAns.insert(u.second); n } n int lans = get(i, i + 1, 0, 0, n) - get(0, n, 0, 0, n); n if (lans > ans) { n ans = lans; n bestAns = currAns; n } n } n cout << ans << n ; n cout << bestAns.size() << n ; n for (int u : bestAns) cout << u + 1 << ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n bool isprime(long long n) { n if (n == 1) return false; n if (n == 2) return true; n for (long long i = 2; i <= sqrt(n); i++) { n if (n % i == 0) { n return false; n } n } n return true; n } n long long poww(long long b, long long e) { n if (e == 0) n return 1; n else if (e % 2 == 0) { n long long a = pow(b, e / 2); n return a * a; n } else { n long long a = pow(b, e / 2); n return b * a * a; n } n } n long long powm(long long x, long long y, long long m = 1000000007) { n x = x % m; n long long res = 1; n while (y) { n if (y & 1) res = res * x; n res %= m; n y = y >> 1; n x = x * x; n x %= m; n } n return res; n } n long long modInverse(long long a, long long m = 1000000007) { n return powm(a, m - 2, m); n } n void print(vector v) { n for (long long i = 0; i < v.size(); i++) { n cout << v[i] << ; n } n } n void print(long long arr[]) { n long long size = *(&arr + 1) - arr; n for (long long i = 0; i < size; i++) { n cout << arr[i] << ; n } n } n string to_bin(long long n) { n string res = ; n long long i = 0; n while (n > 0) { n if (n % 2 == 1) { n res = res + 1 ; n } else { n res = res + 0 ; n } n n /= 2; n i++; n } n reverse(res.begin(), res.end()); n return res; n } n long long to_dec(string second) { n long long n = second.size(), ans = 0, temp = 1; n for (long long i = n - 1; i >= 0; i--) { n long long x = second[i] - 0 ; n ans += x * temp; n temp *= 2; n } n return ans; n } n void result(bool first) { n if (first) n cout << YES << endl; n else n cout << NO << endl; n } n void solve() { n long long a, b, p; n cin >> a >> b >> p; n string second; n cin >> second; n reverse(second.begin(), second.end()); n long long n = second.length(); n long long ind = 1; n long long maxi; n for (long long i = 1; i < n; i++) { n char ch = second[i]; n if (second[i] == B ) { n if (p >= b) { n p -= b; n if (i != n - 1) { n while (second[i + 1] == B ) { n i++; n } n } n ind = i + 1; n } else n break; n } else if (second[i] == A ) { n if (p >= a) { n p -= a; n if (i != n - 1) { n while (second[i + 1] == A ) { n i++; n } n } n ind = i + 1; n } else n break; n } n } n long long ans = n - ind + 1; n cout << ans << endl; n } n int32_t main() { n ios_base::sync_with_stdio(); n cin.tie(0); n cout.tie(0); n long long tests; n cin >> tests; n while (tests--) solve(); n } n "} +{"func_code_string": "#include n using namespace std; n const int C = 10005, N = 1005; n int n, w, b, x, c[N], cost[N]; n long long dp[2][C]; n template n void maxz(T &a, T b) { n if (a < b) a = b; n } n int main() { n int i, j, k, ub; n long long mn; n scanf( %d%d%d%d , &n, &w, &b, &x); n for (i = 1; i <= n; i++) scanf( %d , c + i); n for (i = 1; i <= n; i++) scanf( %d , cost + i); n memset(dp[0], -1, sizeof(dp[0])); n ub = 1; n dp[0][0] = w; n for (i = 1; i <= n; i++) { n memset(dp[i & 1], -1, sizeof(dp[0])); n for (j = 0; j < ub; j++) n if (dp[~i & 1][j] >= 0) { n mn = min(dp[~i & 1][j] + x, w + (long long)b * j); n for (k = 0; k <= c[i] && mn >= 0; k++) { n maxz(dp[i & 1][j + k], mn); n mn -= cost[i]; n } n maxz(ub, j + k); n } n } n printf( %d , ub - 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int r = 2, g = 5, b = 8, n, k; n int h, j, p; n int main() { n cin >> n >> k; n h = r * n; n j = g * n; n p = b * n; n h = (h + k - 1) / k; n j = (j + k - 1) / k; n p = (p + k - 1) / k; n cout << p + j + h; n } n "} +{"func_code_string": "#include n int sw, sw1, sw2; n int main() { n char a[1000]; n scanf( %s , a); n int n; n scanf( %d , &n); n for (int i = 0; i < n; i++) { n char b[10]; n scanf( %s , b); n if (b[0] == a[0] && b[1] == a[1]) sw = 1; n if (b[1] == a[0]) sw1 = 1; n if (b[0] == a[1]) sw2 = 1; n } n if (sw == 1 || sw1 == 1 && sw2 == 1) n printf( YES ); n else n printf( NO ); n } n "} +{"func_code_string": "#include n using namespace std; n vector> dp(10, vector(1000005, 0)); n long long g(long long n) { n if (n < 10) return n; n long long ans = 1; n while (n) { n if (n % 10) ans *= (n % 10); n n /= 10; n } n return g(ans); n } n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n for (long long i = 1; i <= 1000000; i++) dp[g(i)][i]++; n for (long long i = 0; i < 10; i++) { n for (long long j = 2; j <= 1000000; j++) { n dp[i][j] += dp[i][j - 1]; n } n } n long long t; n cin >> t; n while (t--) { n long long l, r, k; n cin >> l >> r >> k; n cout << dp[k][r] - dp[k][l - 1] << n ; n } n } n "} +{"func_code_string": "#include n const int MOD = 1e9; n const int N = 100003; n using namespace std; n vector ans; n int main() { n int n; n cin >> n; n int p, q; n p = q = 0; n for (int i = 0; i < n; i++) { n char c; n int x, y; n cin >> c; n scanf( %d , &x); n scanf( %d , &y); n if (x > y) swap(x, y); n if (c == + ) n p = max(p, x), q = max(q, y); n else if (p <= x && q <= y) n cout << YES ; n else n cout << NO ; n cout << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MX = 1e5 + 69; n const int inf = 1e9 + 5; n const long long mod = 1e9 + 7; n const long double eps = 1e-10; n vector v[MX]; n int par[24][MX]; n int depth[MX]; n void dfs(int x, int p) { n for (auto g : v[x]) { n if (g == p) { n continue; n } n depth[g] = depth[x] + 1; n dfs(g, x); n par[0][g] = x; n } n } n int lca(int x, int y) { n if (depth[x] > depth[y]) swap(x, y); n int i = 22; n while (depth[x] < depth[y]) { n if (depth[par[i][y]] >= depth[x]) { n y = par[i][y]; n } n i--; n } n for (int i = 22; i >= 0; i--) { n if (par[i][x] != par[i][y]) { n x = par[i][x]; n y = par[i][y]; n } n } n if (x != y) { n x = par[0][x]; n y = par[0][y]; n } n return x; n } n int dis(int a, int b) { return (depth[a] + depth[b] - 2 * depth[lca(a, b)]); } n int cal(int a, int b, int c) { n int ret = 0; n int q1 = lca(a, b); n int q2 = lca(a, c); n int q3 = lca(b, c); n if (depth[q1] >= max(depth[q2], depth[q3])) { n ret = dis(lca(a, b), c); n } else { n ret = dis((depth[q2] >= depth[q3] ? q2 : q3), c); n } n return ret; n } n int main() { n depth[0] = -1; n int n, q; n cin >> n >> q; n for (int i = 2; i <= n; i++) { n int b; n scanf( %d , &b); n v[i].push_back(b); n v[b].push_back(i); n } n dfs(1, -1); n for (int i = 1; i < 23; i++) { n for (int j = 1; j <= n; j++) { n par[i][j] = par[i - 1][par[i - 1][j]]; n } n } n while (q--) { n int ans = 0; n int a, b, c; n scanf( %d%d%d , &a, &b, &c); n ans = max(cal(a, b, c), max(cal(a, c, b), cal(b, c, a))); n printf( %d n , ans + 1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n vector> g(n); n vector> e(n - 1); n for (int i = 0; i < n - 1; ++i) { n int u, v; n cin >> u >> v; n --u; n --v; n g[u].push_back(v); n g[v].push_back(u); n e[i] = make_pair(u, v); n } n vector col(n); n for (int &i : col) { n cin >> i; n } n int diff = 0; n for (auto i : e) { n if (col[i.first] != col[i.second]) { n ++diff; n } n } n for (int i = 0; i < n; ++i) { n int ctr = 0; n for (int j : g[i]) { n if (col[i] != col[j]) { n ++ctr; n } n } n if (ctr == diff) { n cout << YES n << i + 1; n return 0; n } n } n cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n int cnt; n int n, m, k; n char s[1111][1111]; n int c[1111][1111], vis[1111][1111]; n int b[1111]; n int tot; n void dfs(int p, int q) { n c[p][q] = cnt; n vis[p][q] = 1; n if (s[p - 1][q] == . && !vis[p - 1][q]) dfs(p - 1, q); n if (s[p - 1][q] == * ) tot++; n if (s[p + 1][q] == . && !vis[p + 1][q]) dfs(p + 1, q); n if (s[p + 1][q] == * ) tot++; n if (s[p][q - 1] == . && !vis[p][q - 1]) dfs(p, q - 1); n if (s[p][q - 1] == * ) tot++; n if (s[p][q + 1] == . && !vis[p][q + 1]) dfs(p, q + 1); n if (s[p][q + 1] == * ) tot++; n } n int main() { n scanf( %d%d%d , &n, &m, &k); n for (int i = 1; i <= n; i++) scanf( %s , s[i] + 1); n for (int i = 0; i <= m + 1; i++) { n s[0][i] = s[n + 1][i] = # ; n } n for (int i = 1; i <= n; i++) s[i][0] = s[i][m + 1] = # ; n cnt = 0; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) vis[i][j] = 0; n for (int i = 1; i <= n; i++) n for (int j = 1; j <= m; j++) n if (!vis[i][j] && s[i][j] == . ) { n tot = 0; n cnt++; n dfs(i, j); n b[cnt] = tot; n } n for (int i = 1; i <= k; i++) { n int x, y; n scanf( %d%d , &x, &y); n printf( %d n , b[c[x][y]]); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n bool chkmax(T &x, T y) { n return x < y ? x = y, true : false; n } n template n bool chkmin(T &x, T y) { n return x > y ? x = y, true : false; n } n int readint() { n int x = 0, f = 1; n char ch = getchar(); n while (ch < 0 || ch > 9 ) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (ch >= 0 && ch <= 9 ) { n x = x * 10 + ch - 0 ; n ch = getchar(); n } n return x * f; n } n int n, k; n int a[20]; n bitset<2001> d[66000]; n multiset > s; n void solve(int now, int cs, int r) { n if (!now) return; n while (cs <= 2000) { n for (int i = 1; i <= n; i++) { n if (((now >> (i - 1)) & 1) && cs >= a[i] && n d[now ^ (1 << (i - 1))][cs - a[i]]) { n s.insert(make_pair(-r, a[i])); n solve(now ^ (1 << (i - 1)), cs - a[i], r); n return; n } n } n cs = cs * k, r++; n } n assert(0); n } n int main() { n n = readint(); n k = readint(); n for (int i = 1; i <= n; i++) a[i] = readint(); n d[0][0] = 1; n for (int i = 1; i < (1 << n); i++) { n for (int j = 1; j <= n; j++) n if ((i >> (j - 1)) & 1) d[i] |= d[i ^ (1 << (j - 1))] << a[j]; n for (int j = 2000 / k; j >= 1; j--) n if (d[i][j * k]) d[i][j] = 1; n } n if (!d[(1 << n) - 1][1]) return printf( NO n ), 0; n printf( YES n ); n solve((1 << n) - 1, 1, 0); n while (s.size() > 1) { n auto it1 = s.begin(), it2 = it1; n it2++; n assert(it1->first == it2->first); n printf( %d %d n , it1->second, it2->second); n int tmp = it1->second + it2->second, dep = -it1->first; n while (tmp % k == 0) tmp /= k, dep--; n s.erase(it1); n s.erase(it2); n s.insert(make_pair(-dep, tmp)); n } n return 0; n } n "} +{"func_code_string": "#include n int main() { n long long int a, b; n scanf( %lld%lld , &a, &b); n if (a > b) { n printf( %lld %lld , b, (a - b) / 2); n } else { n printf( %lld %lld , a, (b - a) / 2); n } n } n "} +{"func_code_string": "#include n int main() { n int a, b, c, ab = -1, min; n scanf( %d %d %d , &a, &b, &c); n min = b; n if (a < b) min = a; n for (int i = 0; i <= min; i++) { n if (b + a - 2 * i == c) { n ab = i; n break; n } n } n if (ab == -1) n printf( Impossible ); n else n printf( %d %d %d , ab, b - ab, a - ab); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 1e9; n set fang[400001]; n map cishu[400001]; n int n, m, q, to1[400001], Nxt[400001], first1[400001], dfn[400001], low[400001]; n int to[500001], nxt[500001], first[500001], cnt, e1, x2, fa[400001]; n int sum, tot = 0, ss[400001], heavy[400001], siz[400001], seg[1000001]; n int pos[400001], top[400001], deep[400001], h = 0, Stack[400001 * 10]; n char ch; n void Build(int x, int y) { n to1[cnt] = y; n Nxt[cnt] = first1[x]; n first1[x] = cnt++; n } n void insert(int x, int y) { n to[e1] = y; n nxt[e1] = first[x]; n first[x] = e1++; n } n void tarjan(int x) { n dfn[x] = low[x] = ++tot; n Stack[++h] = x; n for (int i = first1[x]; i != -1; i = Nxt[i]) n if (!dfn[to1[i]]) { n tarjan(to1[i]); n low[x] = min(low[x], low[to1[i]]); n if (dfn[x] <= low[to1[i]]) { n int z; n sum++; n do { n z = Stack[h--]; n insert(sum, z); n insert(z, sum); n } while (z != to1[i]); n insert(sum, x); n insert(x, sum); n } n } else n low[x] = min(low[x], dfn[to1[i]]); n } n void dfs(int o, int p) { n siz[o] = 1; n deep[o] = deep[p] + 1; n fa[o] = p; n for (int i = first[o]; i != -1; i = nxt[i]) n if (to[i] != p) { n dfs(to[i], o); n siz[o] += siz[to[i]]; n if (siz[to[i]] > siz[heavy[o]]) heavy[o] = to[i]; n } n } n void dfs1(int o, int p) { n pos[o] = ++x2; n if (heavy[o] > 0) { n top[heavy[o]] = top[o]; n dfs1(heavy[o], o); n for (int i = first[o]; i != -1; i = nxt[i]) n if ((to[i] != p) && (to[i] != heavy[o])) { n top[to[i]] = to[i]; n dfs1(to[i], o); n } n } n } n void put(int o, int p, int q, int r, int s) { n if ((o == q) && (p == q)) { n seg[r] = s; n return; n } n int mid = (o + p) / 2; n if (q <= mid) { n put(o, mid, q, r * 2, s); n seg[r] = min(seg[r * 2 + 1], seg[r * 2]); n } else { n put(mid + 1, p, q, r * 2 + 1, s); n seg[r] = min(seg[r * 2], seg[r * 2 + 1]); n } n } n int get(int o, int p, int q, int r, int s) { n if ((o == q) && (p == r)) return seg[s]; n int mid = (o + p) / 2; n if (r <= mid) n return get(o, mid, q, r, s * 2); n else if (q > mid) n return get(mid + 1, p, q, r, s * 2 + 1); n else n return min(get(o, mid, q, mid, s * 2), n get(mid + 1, p, mid + 1, r, s * 2 + 1)); n } n int gettree(int o, int p) { n int yu = INF; n while (top[o] != top[p]) { n if (deep[top[o]] < deep[top[p]]) { n int t = o; n o = p; n p = t; n } n yu = min(yu, get(1, sum, pos[top[o]], pos[o], 1)); n o = fa[top[o]]; n } n if (deep[o] > deep[p]) { n int t = o; n o = p; n p = t; n } n yu = min(yu, get(1, sum, pos[o], pos[p], 1)); n if (o > n) yu = min(yu, ss[fa[o]]); n return yu; n } n int main() { n memset(first1, -1, sizeof(first1)); n memset(first, -1, sizeof(first)); n scanf( %d%d%d , &n, &m, &q); n sum = n; n for (int i = 1; i <= n; i++) scanf( %d , &ss[i]); n for (int i = 1; i <= m; i++) { n int x, y; n scanf( %d%d , &x, &y); n Build(x, y); n Build(y, x); n } n for (int i = 1; i <= n; i++) n if (!dfn[i]) tarjan(i); n deep[0] = 0; n dfs(1, 0); n top[1] = 1; n dfs1(1, 0); n for (int i = 1; i <= n; i++) n if (fa[i] > 0) { n fang[fa[i]].insert(ss[i]); n if (!cishu[fa[i]].count(ss[i])) cishu[fa[i]][ss[i]] = 0; n cishu[fa[i]][ss[i]]++; n } n for (int i = n + 1; i <= sum; i++) ss[i] = *fang[i].begin(); n for (int i = 0; i <= 1000000; i++) seg[i] = INF + 1; n for (int i = 1; i <= sum; i++) put(1, sum, pos[i], 1, ss[i]); n for (int i = 1; i <= q; i++) { n int x, y; n getchar(); n scanf( %c%d%d , &ch, &x, &y); n if (ch == C ) { n if (fa[x] > 0) { n cishu[fa[x]][ss[x]]--; n if (cishu[fa[x]][ss[x]] == 0) fang[fa[x]].erase(ss[x]); n if (!cishu[fa[x]].count(y)) cishu[fa[x]][y] = 0; n cishu[fa[x]][y]++; n fang[fa[x]].insert(y); n put(1, sum, pos[fa[x]], 1, (*fang[fa[x]].begin())); n } n put(1, sum, pos[x], 1, y); n ss[x] = y; n } else n cout << gettree(x, y) << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ull = unsigned long long; n using ld = long double; n using pii = pair; n using pll = pair; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int n, b, d; n cin >> n >> b >> d; n int cur = 0, cnt = 0; n for (int i = 0; i < n; i++) { n int a; n cin >> a; n if (a > b) continue; n cur += a; n if (cur > d) { n cnt++; n cur = 0; n } n } n if (cur > d) cnt++; n cout << cnt << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int inf = (int)1e9 + 7; n const int N = (int)1e5 + 10; n struct qq { n int l, r, i, w; n }; n int t[4 * N], ans[2 * N]; n pair p[2 * N]; n vector qx[N], qy[N]; n void upd(int pos, int val, int v = 1, int l = 1, int r = N - 10) { n if (l == r) { n t[v] = val; n return; n } n int m = (l + r) >> 1; n if (pos <= m) { n upd(pos, val, v + v, l, m); n } else { n upd(pos, val, v + v + 1, m + 1, r); n } n t[v] = min(t[v + v], t[v + v + 1]); n } n int get(int l, int r, int v = 1, int tl = 1, int tr = N - 10) { n if (l > r || tr < l || tl > r) { n return inf; n } n if (l <= tl && tr <= r) { n return t[v]; n } n int tm = (tl + tr) >> 1; n return min(get(l, r, v + v, tl, tm), get(l, r, v + v + 1, tm + 1, tr)); n } n inline bool cmp(pair f, pair s) { n return f.second < s.second || (f.second == s.second && f.first < s.first); n } n int main() { n int n, m, k, q; n scanf( %d %d %d %d , &n, &m, &k, &q); n for (int i = 1; i <= k; i++) { n int x, y; n scanf( %d %d , &x, &y); n p[i] = {x, y}; n } n for (int i = 1; i <= q; i++) { n int ax, ay, bx, by; n scanf( %d %d %d %d , &ax, &ay, &bx, &by); n qx[bx].emplace_back(qq({ay, by, i, ax})); n qy[by].emplace_back(qq({ax, bx, i, ay})); n } n sort(p + 1, p + k + 1); n int ptr = 1; n for (int i = 1; i < N; i++) { n while (ptr <= k && p[ptr].first == i) { n upd(p[ptr].second, i); n ptr++; n } n for (auto j : qx[i]) { n ans[j.i] |= ((get(j.l, j.r) >= j.w) ? 1 : 0); n } n } n memset(t, 0, sizeof(t)); n ptr = 1; n sort(p + 1, p + k + 1, cmp); n for (int i = 1; i < N; i++) { n while (ptr <= k && p[ptr].second == i) { n upd(p[ptr].first, i); n ptr++; n } n for (auto j : qy[i]) { n ans[j.i] |= ((get(j.l, j.r) >= j.w) ? 1 : 0); n } n } n for (int i = 1; i <= q; i++) { n if (ans[i] == 1) n puts( YES ); n else n puts( NO ); n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long int N = 3e5 + 10, N2 = 2e5, delta = 10499, mod = 1e9 + 7, n oo = 1e18, LOG = 20, SQ = 300; n const long double PI = 3.141592653589793; n pair, long long int> p[N]; n int32_t main() { n ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); n long long int t; n cin >> t; n while (t--) { n long long int n; n cin >> n; n for (long long int i = 0; i < 2 * n - 1; i++) { n long long int x, y; n cin >> x >> y; n p[i] = {{x, y}, i}; n } n cout << YES n ; n sort(p, p + 2 * n - 1); n for (long long int i = 0; i < 2 * n - 2; i += 2) { n if (p[i].first.second < p[i + 1].first.second) n cout << p[i + 1].second + 1 << ; n else n cout << p[i].second + 1 << ; n } n cout << p[2 * n - 2].second + 1 << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n fixed(cout); n cout << setprecision(10); n ; n long long int n, h; n cin >> n >> h; n for (int i = 1; i <= n - 1; i++) { n double x = (h * h * i) / double(n); n x = sqrt(x); n if (i == n) break; n cout << x << ; n } n cout << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int tipo[100000 + 5]; n int main() { n int n, x, y, z, m; n cin >> n >> m; n memset(tipo, -1, sizeof(tipo)); n for (int i = 0; i < m; ++i) { n cin >> x >> y >> z; n x--, y--, z--; n bool enc = 0; n if (tipo[x] != -1) { n enc = 1; n tipo[y] = (tipo[x] + 1) % 3; n tipo[z] = (tipo[x] + 2) % 3; n } else if (tipo[y] != -1) { n enc = 1; n tipo[x] = (tipo[y] + 1) % 3; n tipo[z] = (tipo[y] + 2) % 3; n } else if (tipo[z] != -1) { n enc = 1; n tipo[x] = (tipo[z] + 1) % 3; n tipo[y] = (tipo[z] + 2) % 3; n } n if (enc == 0) { n tipo[x] = 0, tipo[y] = 1, tipo[z] = 2; n } n } n for (int i = 0; i < n; ++i) { n if (i == 0) n cout << tipo[i] + 1; n else n cout << << tipo[i] + 1; n } n puts( ); n } n "} +{"func_code_string": "#include n using namespace std; n int vis[10] = {0}; n int main() { n int c = 0, n = 0, i, flag = 0; n long long ans = 1; n string s; n cin >> s; n for (i = 0; i < s.size(); i++) { n if (s[i] == ? ) { n if (i == 0) flag = 1; n c++; n } n if (s[i] >= A && s[i] <= J ) { n if (i == 0) flag = 1; n vis[s[i] - A ] = 1; n } n } n for (i = 0; i < 10; i++) n if (vis[i]) n++; n for (i = 0; i < n; i++) ans *= 10 - i; n if (flag) { n ans *= 9; n if (ans % 10 == 0) { n ans /= 10; n flag = 0; n } n } n cout << ans; n for (i = flag; i < c; i++) cout << 0; n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n void c_p_c() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n } n int32_t main() { n c_p_c(); n long long t; n cin >> t; n while (t--) { n long long n, r; n cin >> n >> r; n long long k = r; n r = min(n - 1, r); n long long ans = r * (r + 1) / 2; n if (k > r) ans++; n cout << ans << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 200000 + 10; n const int inf = 0x3f3f3f3f; n vector ve[maxn]; n int a[maxn], c[maxn]; n struct node { n int pos, val; n } nod[maxn]; n bool cmp(node a, node b) { return a.val < b.val; } n bool cmp1(int x, int y) { return nod[a[x]].val > nod[a[y]].val; } n int main() { n int n, q, k, x, y; n scanf( %d , &n); n for (int i = 0; i <= n; i++) { n ve[i].clear(); n nod[i].val = 0; n nod[i].pos = 0; n } n for (int i = 0; i < n; i++) { n scanf( %d%d , &x, &y); n ve[x].push_back(y); n nod[x].pos = x; n nod[x].val = max(nod[x].val, y); n } n sort(nod + 1, nod + 1 + n, cmp); n for (int i = 1; i <= n; i++) a[nod[i].pos] = i; n scanf( %d , &q); n int ans, res; n while (q--) { n int max1 = nod[n].val, pos1 = nod[n].pos; n int max2 = nod[n - 1].val, pos2 = nod[n - 1].pos, s, j = n - 2; n scanf( %d , &k); n for (int i = 0; i < k; i++) scanf( %d , &c[i]); n sort(c, c + k, cmp1); n for (int i = 0; i < k; i++) { n if (c[i] == pos1) { n max1 = max2; n pos1 = pos2; n max2 = nod[j].val; n pos2 = nod[j--].pos; n } else if (c[i] == pos2) { n max2 = nod[j].val; n pos2 = nod[j--].pos; n } n } n if (max1 == 0) n ans = 0, res = 0; n else { n int l = 0, r = ve[pos1].size(), mid; n while (l < r) { n mid = l + (r - l) / 2; n if (max2 <= ve[pos1][mid]) n r = mid; n else n l = mid + 1; n } n ans = pos1; n res = ve[pos1][l]; n } n printf( %d %d n , ans, res); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long int mod_expo(long long int x, long long int y) { n long long int res = 1; n while (y > 0) { n if (y & 1) res = (res * x) % 1000000007; n y = y >> 1; n x = (x * x) % 1000000007; n } n return res; n } n int main() { n long long int t; n cin >> t; n while (t--) { n map right; n long long int n; n cin >> n; n long long int ar[2 * n + 4]; n long long int dp[2 * n + 3]; n for (long long int i = 0; i < 2 * n; i++) { n cin >> ar[i]; n } n long long int count = 0; n for (long long int i = 0; i < n; i++) { n if (ar[i] == 1) n count++; n else { n count--; n } n dp[i] = count; n } n count = 0; n for (long long int i = 2 * n - 1; i >= n; i--) { n if (ar[i] == 1) n count--; n else { n count++; n } n dp[i] = count; n right[count] = i; n } n long long int mini = 2 * n; n for (long long int i = 0; i < 2 * n; i++) { n if (dp[i] == 0) { n if (i < n && mini > (2 * n - i - 1)) n mini = 2 * n - i - 1; n else if (i >= n && mini > (i)) n mini = i; n } n } n for (long long int i = n - 1; i >= 0; i--) { n long long int p = dp[i]; n long long int k = right[p]; n if (k > 0 && mini > (k - i - 1)) mini = k - i - 1; n } n cout << mini << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n unsigned long long A, B; n cin >> A >> B; n if (A < B) { n puts( -1 ); n return 0; n } n if ((A - B) % 2 != 0) { n puts( -1 ); n return 0; n } n unsigned long long C = (A - B) / 2; n unsigned long long X = 0, Y = 0; n for (unsigned long long bit = 1ULL << 63; bit >= 1; bit >>= 1) { n bool dif = (B & bit); n bool allHas = (C & bit); n if (allHas && dif) { n puts( -1 ); n return 0; n } n if (allHas) { n X |= bit; n Y |= bit; n } n if (dif) { n Y |= bit; n } n } n cout << X << << Y << endl; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxN = (int)1e4 + 10; n int n, w, b, x; n long long dp[1005][maxN]; n int c[maxN]; n int cost[maxN]; n int main() { n cin >> n >> w >> b >> x; n for (int i = 1; i <= n; i++) cin >> c[i]; n for (int i = 1; i <= n; i++) cin >> cost[i]; n memset(dp, -1, sizeof dp); n dp[0][0] = w; n for (int i = 1; i <= n; i++) { n for (int j = 0; j < maxN; j++) { n long long cur_bal = dp[i - 1][j]; n if (cur_bal == -1) continue; n for (int k = 0; k <= c[i]; k++) { n if (1LL * k * cost[i] > cur_bal) continue; n dp[i][j + k] = max(min(cur_bal - (1LL * k * cost[i]) + x, n 1LL * w + (1LL * b * (j + k))), n dp[i][j + k]); n } n } n } n for (int i = maxN - 1; i >= 0; i--) { n if (dp[n][i] != -1) { n cout << i; n return 0; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int T, n, b[100010], mp[100010], hah[100010]; n struct qwq { n int v, id; n } a[100010]; n bool cmp(qwq x, qwq y) { return x.v < y.v; } n int main() { n scanf( %d , &T); n while (T--) { n scanf( %d , &n); n for (int i = 1; i <= n; i++) n scanf( %d , &a[i].v), mp[a[i].v] = i, b[i] = a[i].v, hah[i] = 0; n sort(a + 1, a + n + 1, cmp); n bool flag = true; n for (int i = 1; i <= n;) { n int now = mp[i], js = i; n hah[now] = 1; n for (int j = now + 1; j <= n; j++) { n if (hah[j]) { n break; n } n if (b[j] != b[j - 1] + 1) { n flag = false; n break; n } else { n hah[j] = 1; n js++; n } n } n if (!flag) { n break; n } n i = js + 1; n } n if (flag) n printf( YES n ); n else n printf( NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n struct SegmentTree { n struct Node { n bool hasCarry = 0; n int b = 0, e = 0; n U carry = U(); n T val = T(); n Node() {} n void join(const Node &l, const Node &r) { n val = l.val + r.val; n b = l.b; n e = r.e; n } n void update(const U &u) { n carry += u; n u.update(val, b, e); n hasCarry = 1; n } n void pushDown(Node &l, Node &r) { n if (!hasCarry) return; n l.update(carry); n r.update(carry); n carry = U(); n hasCarry = 0; n } n }; n vector V; n int N; n SegmentTree(int N) : V(4 * N), N(N) {} n template n void create(const vector &VEC, int n = 1, int b = 0, int e = -1) { n if (e == -1) e = N - 1; n if (b == e) { n V[n].val = T(VEC[b]), V[n].b = b, V[n].e = e; n } else { n int m = (b + e) / 2; n create(VEC, 2 * n, b, m); n create(VEC, 2 * n + 1, m + 1, e); n V[n].join(V[2 * n], V[2 * n + 1]); n } n } n T query(int i, int j, int n = 1, int b = 0, int e = -1) { n if (e == -1) e = N - 1; n if (i <= b && e <= j) n return V[n].val; n else { n V[n].pushDown(V[2 * n], V[2 * n + 1]); n int m = (b + e) / 2; n if (i > m) return query(i, j, 2 * n + 1, m + 1, e); n if (j <= m) return query(i, j, 2 * n, b, m); n return query(i, j, 2 * n, b, m) + query(i, j, 2 * n + 1, m + 1, e); n } n } n void update(int i, int j, const U &v, int n = 1, int b = 0, int e = -1) { n if (e == -1) e = N - 1; n if (i <= b && e <= j) n V[n].update(v); n else if (i > e || j < b) n return; n else { n V[n].pushDown(V[2 * n], V[2 * n + 1]); n int m = (b + e) / 2; n update(i, j, v, 2 * n, b, m); n update(i, j, v, 2 * n + 1, m + 1, e); n V[n].join(V[2 * n], V[2 * n + 1]); n } n } n int findOkPrefix(int i, const function &isOk) { n vector stk; n stk.reserve(20); n stk.push_back(1); n T acum; n int sz = 0; n while (stk.size()) { n int t = stk.back(); n stk.pop_back(); n Node &n = V[t]; n if (n.e < i) continue; n T newAcum = sz == 0 ? n.val : (acum + n.val); n if (i <= n.b) { n if (isOk(newAcum)) { n sz += n.e - n.b + 1; n acum = newAcum; n } else { n if (n.b == n.e) return sz; n V[t].pushDown(V[t << 1], V[t << 1 | 1]); n stk.push_back(2 * t + 1); n stk.push_back(2 * t); n } n } else { n V[t].pushDown(V[t << 1], V[t << 1 | 1]); n stk.push_back(2 * t + 1); n stk.push_back(2 * t); n } n } n } n }; n struct RRange { n int tL, tR, sz; n RRange(int v = 0) : tR(v), tL(v), sz(1) {} n RRange operator+(const RRange &m) const { n RRange r; n r.sz = sz + m.sz; n r.tL = max(tL, m.tL - sz); n r.tR = max(tR - m.sz, m.tR); n return r; n } n friend ostream &operator<<(ostream &os, const RRange &range) { n os << ( << range.tL << , << range.tR << ) ; n return os; n } n void normalize(int N) { n if (tL + tR + 1 >= N) { n tL = 0; n tR = N - 1; n } n sz = 1; n } n int size() { return tL + tR + 1; } n }; n struct Void { n void update(RRange &m, int b, int e) const {} n void operator+=(const Void &s) {} n }; n int main() { n int N; n cin >> N; n vector V(N); n for (int i = 0; i < N; ++i) { n int n; n cin >> n; n V[i] = RRange(n); n V[i].normalize(N); n } n vector> T(20, vector(N)); n vector> STS; n T[0] = V; n auto fn = [](int i, int j, SegmentTree &ST, int N) { n RRange r = ST.query(max(i, 0), min(j, N - 1)); n if (i < 0) r = ST.query(N + i, N - 1) + r; n if (j >= N) r = r + ST.query(0, j % N); n return r; n }; n for (int i = 1; i < 20; ++i) { n STS.push_back(SegmentTree(N)); n STS.back().create(T[i - 1]); n auto &ST = STS.back(); n for (int j = 0; j < N; ++j) { n T[i][j] = fn(j - T[i - 1][j].tL, j + T[i - 1][j].tR, ST, N); n T[i][j].tL += T[i - 1][j].tL; n T[i][j].tR += T[i - 1][j].tR; n T[i][j].normalize(N); n } n } n for (int i = 0; i < N; ++i) { n RRange mx(0); n int ans = 0; n for (int j = STS.size() - 1; j >= 0; --j) { n RRange t = fn(i - mx.tL, i + mx.tR, STS[j], N); n t.tL += mx.tL; n t.tR += mx.tR; n t.normalize(N); n if (t.size() < N) { n mx = t; n ans |= 1 << j; n } n } n if (mx.size() < N) ans++; n cout << ans << ; n } n cout << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int p = 1000003; n const int n = 10; n int inv[1000005], a[15][15], ans[15]; n int read() { n char c = getchar(); n int x = 0, f = 1; n while (c < 0 || c > 9 ) { n if (c == - ) f = -1; n c = getchar(); n } n while (c >= 0 && c <= 9 ) { n x = x * 10 + c - 0 ; n c = getchar(); n } n return x * f; n } n int calc(int x) { n int res = 0; n for (int i = n; i >= 0; i--) res = (1LL * res * x + ans[i]) % p; n return res; n } n int main() { n inv[1] = 1; n for (int i = 2; i < p; i++) inv[i] = 1LL * (p - p / i) * inv[p % i] % p; n printf( ? 0 n ); n fflush(stdout); n ans[0] = read(); n for (int i = 1; i <= n; i++) { n printf( ? %d n , i); n fflush(stdout); n a[i][0] = 1; n for (int j = 1; j <= n; j++) a[i][j] = a[i][j - 1] * i % p; n a[i][n + 1] = (read() + p - ans[0]) % p; n } n for (int i = 1; i <= n; i++) { n for (int j = i + 1; j <= n; j++) { n int t = 1LL * a[j][i] * inv[a[i][i]] % p; n for (int k = i + 1; k <= n + 1; k++) n a[j][k] = (a[j][k] + p - 1LL * a[i][k] * t % p) % p; n a[j][i] = 0; n } n } n for (int i = n; i >= 1; i--) { n int res = a[i][n + 1]; n for (int j = i + 1; j <= n; j++) n res = (res + p - 1LL * a[i][j] * ans[j] % p) % p; n ans[i] = 1LL * res * inv[a[i][i]] % p; n } n for (int i = 0; i < p; i++) { n if (calc(i) == 0) { n printf( ! %d n , i); n fflush(stdout); n exit(0); n } n } n printf( ! -1 n ); n fflush(stdout); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1000 + 10; n int n, d[MAXN], id[MAXN]; n bool b[MAXN][MAXN]; n bool cmp(int a, int b) { n if (d[a] > d[b]) return true; n if (d[a] < d[b]) return false; n return a < b; n } n int main() { n scanf( %d , &n); n if (n == 4) puts( -1 ), exit(0); n b[3][1] = b[1][2] = b[2][3] = 1; n d[1] = d[2] = d[3] = 1; n for (int i = 4; i <= n; ++i) { n for (int j = 1; j < i; ++j) id[j] = j; n sort(id + 1, id + i, cmp); n for (int j = 1; j <= i / 2; ++j) b[id[j]][i] = 1, ++d[i]; n for (int j = i / 2 + 1; j < i; ++j) b[i][id[j]] = 1, ++d[id[j]]; n } n for (int i = 1; i <= n; ++i, puts( )) n for (int j = 1; j <= n; ++j) printf( %d , b[i][j]); n fclose(stdin); n fclose(stdout); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) n using namespace std; n inline int read() { n int f = 1, x = 0; n char ch; n do { n ch = getchar(); n if (ch == - ) f = -1LL; n } while (ch < 0 || ch > 9 ); n do { n x = x * 10 + ch - 0 ; n ch = getchar(); n } while (ch >= 0 && ch <= 9 ); n return f * x; n } n template n inline void chmax(T &a, T b) { n if (a < b) a = b; n } n template n inline void chmin(T &a, T b) { n if (a > b) a = b; n } n inline void swap(int &a, int &b) { n int c = a; n a = b; n b = c; n } n using namespace std; n const int N = 4e5 + 10; n set seg[N << 2]; n int mx[N << 2], mn[N << 2]; n struct node { n int x1, y1, x2, y2; n } a[N]; n inline void show(node a) { printf( %d %d %d %d n , a.x1, a.y1, a.x2, a.y2); } n vector ins[N], era[N]; n int n, px[N << 1], py[N << 1], totx, toty, lenx, leny, ok[N]; n inline void upd(int cur) { n int mxp; n if (seg[cur].size()) { n mxp = *(--seg[cur].end()); n } else { n mxp = -1; n } n int mxt = max(mx[cur << 1], mx[cur << 1 | 1]); n int mnt = min(mn[cur << 1], mn[cur << 1 | 1]); n if (mxp > mxt) { n if (ok[mxp] || mxp < mnt) { n mx[cur] = -1; n } else { n mx[cur] = mxp; n } n } else { n mx[cur] = mxt; n } n mn[cur] = max(mxp, mnt); n } n inline void cover(int cur, int L, int R, int l, int r, int id, int fl) { n if (l > r) return; n if (l <= L && r >= R) { n if (fl == 1) { n seg[cur].insert(id); n } else if (fl == -1) { n seg[cur].erase(id); n } n upd(cur); n return; n } n int mid = (L + R) >> 1; n if (l <= mid) cover(cur << 1, L, mid, l, r, id, fl); n if (r > mid) cover(cur << 1 | 1, mid + 1, R, l, r, id, fl); n upd(cur); n } n inline void norx(int &x) { n x = (int)(lower_bound(px + 1, px + lenx + 1, x) - px); n } n inline void nory(int &x) { n x = (int)(lower_bound(py + 1, py + leny + 1, x) - py); n } n int main() { n memset(mx, -1, sizeof(mx)); n n = read(); n for (int i = (1); i <= (n); ++i) n a[i].x1 = read(), a[i].y1 = read(), a[i].x2 = read(), a[i].y2 = read(); n for (int i = (1); i <= (n); ++i) { n px[++totx] = a[i].x1; n px[++totx] = a[i].x2; n py[++toty] = a[i].y1; n py[++toty] = a[i].y2; n } n sort(px + 1, px + totx + 1); n sort(py + 1, py + toty + 1); n lenx = (int)(unique(px + 1, px + totx + 1) - px - 1); n leny = (int)(unique(py + 1, py + toty + 1) - py - 1); n for (int i = (1); i <= (n); ++i) { n norx(a[i].x1); n norx(a[i].x2); n nory(a[i].y1); n nory(a[i].y2); n } n for (int i = (1); i <= (n); ++i) { n ins[a[i].x1].push_back(i); n era[a[i].x2].push_back(i); n } n for (int t = (1); t <= (lenx); ++t) { n for (auto cur : ins[t]) { n cover(1, 1, leny, a[cur].y1, a[cur].y2 - 1, cur, 1); n } n for (auto cur : era[t]) { n cover(1, 1, leny, a[cur].y1, a[cur].y2 - 1, cur, -1); n } n while (~mx[1]) { n ok[mx[1]] = 1; n cover(1, 1, leny, a[mx[1]].y1, a[mx[1]].y2 - 1, mx[1], 0); n } n } n int ans = 1; n for (int i = (1); i <= (n); ++i) n if (ok[i]) ++ans; n printf( %d n , ans); n return 0; n } n "} +{"func_code_string": "#include n int q, t, l, r, x, last; n std::map dsu, val; n int root(int x) { n int cur = dsu[x]; n if (cur < 0) n return x; n else { n dsu[x] = root(dsu[x]); n val[x] ^= val[cur]; n return dsu[x]; n } n } n void connect(int x, int y, int v) { n int a = root(x), b = root(y); n if (a != b) { n if (dsu[a] > dsu[b]) std::swap(a, b); n dsu[a] += dsu[b]; n dsu[b] = a; n val[b] = v ^ val[x] ^ val[y]; n } n } n int main() { n std::cin >> q; n while (q--) { n std::cin >> t >> l >> r; n if ((l ^= last) > (r ^= last)) std::swap(l, r); n if (!dsu.count(l)) dsu[l] = -1; n if (!dsu.count(++r)) dsu[r] = -1; n if (t == 1) { n std::cin >> x; n connect(l, r, x ^= last); n } else if (root(l) == root(r)) n std::cout << (last = val[l] ^ val[r]) << n ; n else n std::cout << -(last = 1) << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long pl, pr, vl, vr; n int k; n long long Inter(long long x1, long long x2, long long y1, long long y2) { n long long a = max(x1, y1); n long long b = min(x2, y2); n if (a > b) n return 0.0; n else n return b - a + 1; n } n long long GetProb(long long x1, long long x2, long long y1, long long y2) { n return Inter(x1, x2, pl, pr) * Inter(y1, y2, vl, vr) + n Inter(x1, x2, vl, vr) * Inter(y1, y2, pl, pr); n } n int main() { n cin >> pl >> pr >> vl >> vr >> k; n vector numbers; n numbers.push_back(0); n int a = 0; n for (int i = 0; i < 9; i++) { n int b = numbers.size(); n for (int j = a; j < b; j++) { n numbers.push_back(numbers[j] * 10 + 4); n numbers.push_back(numbers[j] * 10 + 7); n } n a = b; n } n numbers.push_back(1000000000); n long long P = (pr - pl + 1) * (vr - vl + 1); n long long gP = 0; n int l = 1; n int r = k; n while (1) { n gP += n GetProb(numbers[l - 1] + 1, numbers[l], numbers[r], numbers[r + 1] - 1); n l++; n r++; n if (r + 1 >= numbers.size()) break; n } n l = 1; n r = k + 1; n while (1) { n l++; n r++; n if (r + 1 >= numbers.size()) break; n } n l = 1; n if (k == 1) n while (1) { n gP -= GetProb(numbers[l], numbers[l], numbers[l], numbers[l]) / 2; n l++; n if (l + 1 >= numbers.size()) break; n } n printf( %.15f , (long double)gP / P); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 205; n int a[maxn]; n int main() { n ios::sync_with_stdio(false); n int n, k; n scanf( %d %d , &n, &k); n int m = n + n + 1; n for (int i = 0; i < m; ++i) scanf( %d , &a[i]); n for (int i = 1; k && i < m; i += 2) { n if (a[i] > max(a[i - 1], a[i + 1]) + 1) { n --a[i]; n --k; n } n } n for (int i = 0; i < m; ++i) printf( %d , a[i]); n putchar( n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int dp[10][300]; n int s[10][10]; n int main() { n int n, m; n cin >> n >> m; n for (int i = 0; i < int(n); ++i) n for (int j = 0; j < int(m); ++j) cin >> s[i][j]; n int *cur = dp[0], *next = dp[1]; n for (int i = n - 1; i >= 0; --i) { n for (int j = m - 1; j >= 0; --j) { n for (int used = 0; used < int(1 << m); ++used) { n if (used & (1 << j)) { n next[used] = cur[used & ~(1 << j)]; n } else { n int best = 0; n if (j + 1 < m && !(used & (1 << (j + 1)))) n best = max(best, n cur[used | (1 << (j + 1))] + (s[i][j] == s[i][j + 1])); n if (i + 1 < n) n best = max(best, cur[used | (1 << j)] + (s[i][j] == s[i + 1][j])); n next[used] = best; n } n } n swap(cur, next); n } n } n cout << n * m / 2 - cur[0] << endl; n } n "} +{"func_code_string": "#include n int main() { n int ele, n, x[110], y[110], p, q, e = 0, f = 0, i, e1 = 0, e2 = 0, o1 = 0, n o2 = 0; n char s1[300], s2[300]; n scanf( %d , &n); n for (i = 1; i <= n; i++) scanf( %d%d , &x[i], &y[i]); n for (i = 1; i <= n; i++) { n if (x[i] % 2 == 0) e1++; n if (x[i] % 2 != 0) { n o1++; n p = i; n s2[f++] = (char)(i + 0); n } n if (y[i] % 2 == 0) e2++; n if (y[i] % 2 != 0) { n o2++; n q = i; n s1[e++] = (char)(i + 0); n } n } n s2[f] = 0 ; n s1[e] = 0 ; n ele = strcmp(s1, s2); n if (o1 % 2 == 0 && o2 % 2 == 0) { n printf( 0 ); n goto label; n } n if (o1 % 2 != 0 && o2 % 2 == 0) { n printf( -1 ); n goto label; n } n if (o1 % 2 == 0 && o2 % 2 != 0) { n printf( -1 ); n goto label; n } n if (o1 % 2 != 0 && o2 % 2 != 0) { n if (o1 > 1 || o2 > 1) { n if (ele == 0) n printf( -1 ); n else n printf( 1 ); n } else if (p == q) n printf( -1 ); n else n printf( 1 ); n } else n printf( 0 ); n label: n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[100001], flag[100001]; n vector > ans; n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long n, sum = 0; n cin >> n; n for (long long i = 0; i < n; i++) { n cin >> a[i]; n sum += a[i]; n } n sum /= n / 2; n for (long long i = 0; i < n; i++) { n if (flag[i] == 0) n for (long long j = i + 1; j < n; j++) { n if (flag[j] == 0 && ((a[i] + a[j]) == sum)) { n flag[j] = 1; n flag[i] = 1; n ans.push_back(make_pair(i + 1, j + 1)); n break; n } n } n } n for (auto i : ans) { n cout << i.first << << i.second << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m; n long long f(const string& s) { n long long res = 0; n for (int i = 0; i + 1 < s.size(); ++i) { n if (s[i] != s[i + 1]) { n res += (m - 1) * (n - i - 1); n } n } n return res; n } n long long g(const string& s) { n long long res = 0; n for (int i = 0; i + 1 < s.size(); ++i) n if (s[i] != s[i + 1]) { n int j = i + 1; n while (j + 1 < s.size() && s[j + 1] == s[j - 1]) ++j; n long long l = j - i + 1; n res += l * (l - 1) / 2; n i = j - 1; n } n return res; n } n int main() { n string s; n cin >> n >> m >> s; n long long res = n * (m - 1) + f(s); n reverse(s.begin(), s.end()); n res += f(s) - g(s); n cout << res << endl; n return 0; n } n "} +{"func_code_string": "/*mjytxdy!*/ n #include n using namespace std; n #define pb push_back n #define fi first n #define se second n #define all(x) x.begin(),x.end() n #define SZ(x) ((int)x.size()) n #define pii pair n #define pil pair n #define pli pair n #define pll pair n #define inl inline n #define rep(i,l,r) for(int i=(l);i<=(r);i++) n #define per(i,r,l) for(int i=(r);i>=(l);i--) n #define trv(i,u) for(int i=head[u];i;i=e[i].next) n #define lb(x) ((x)&(-(x))) n #define debug(x) cout<<#x : <inl bool ylmin(T &a,T b){return ainl bool ylmax(T &a,T b){return a>b?0:(a=b,1);} n templateinl T abs(T x){return x<0?-x:x;} n inl char read(){ n static const int IO_LEN=1024*1024; n static char buf[IO_LEN],*ioh,*iot; n if(ioh==iot){ n iot=(ioh=buf)+fread(buf,1,IO_LEN,stdin); n if(ioh==iot) return -1; n } n return *ioh++; n } n templateinl void read(T &x){ n static int iosig;static char ioc; n for(iosig=0,ioc=read();!isdigit(ioc);ioc=read()) if(ioc== - ) iosig=1; n for(x=0;isdigit(ioc);ioc=read())x=(x<<1)+(x<<3)+(ioc^ 0 ); n if(iosig) x=-x; n } n const int MAXN = 1e5 + 10; n struct Node{ n int x,y; n }a[MAXN]; n int n,m; n vector S,T,Set; n map Map; n inl bool cmp(Node a,Node b){ n return a.x-a.y>b.x-b.y; n } n struct Segment{ n #define ls rt<<1 n #define rs rt<<1|1 n pii Min[MAXN<<2]; n int tag; n inl void pushup(int rt){ n Min[rt]=min(Min[ls],Min[rs]); n } n inl pii query(int rt,int l,int r,int L,int R){ n if(L>R) return {2e9,-1}; n if(l>=L && r<=R) return Min[rt]; n int mid=l+r>>1; n if(R<=mid) return query(ls,l,mid,L,R); n else if(L>mid) return query(rs,mid+1,r,L,R); n else return min(query(ls,l,mid,L,R),query(rs,mid+1,r,L,R)); n } n inl void update(int rt,int l,int r,int pos) { n if(l==r) return Min[rt]={2e9,-1},void(); n int mid=l+r>>1; n if(pos<=mid) update(ls,l,mid,pos); n else update(rs,mid+1,r,pos); n pushup(rt); n } n inl void build(int rt,int l,int r,int opt){ n if(l==r) { n Min[rt]={opt?a[l].y:a[l].x,l}; n return ; n } n int mid=l+r>>1; n build(ls,l,mid,opt),build(rs,mid+1,r,opt); n pushup(rt); n } n #undef ls n #undef rs n }t[2]; n int main(){ n //freopen( in.txt , r ,stdin); n read(n),read(m); n rep(i,1,n) read(a[i].x),read(a[i].y),Map[{a[i].x,a[i].y}]=1; n sort(a+1,a+n+1,cmp); n per(i,n,1) Set.push_back(a[i].x-a[i].y); n t[0].build(1,1,n,0),t[1].build(1,1,n,1); n int delta=0;S.push_back(-1),T.push_back(-1); n rep(i,1,n) { n int pos=n-(lower_bound(all(Set),delta)-Set.begin())+1; n pii lans=t[0].query(1,1,n,1,pos-1),rans=t[1].query(1,1,n,pos,n); n lans.fi-=t[0].tag,rans.fi-=t[1].tag; n pii Min=min(lans,rans); n int id=Min.se; n if(a[id].x-a[id].y==delta) { n if(S.back()!=a[id].x && T.back()!=a[id].y) { n t[0].tag++,S.push_back(a[id].x); n t[1].tag++,T.push_back(a[id].y); n } n } else if(a[id].x-a[id].y>delta) { n if(S.back()!=a[id].x) delta++,t[0].tag++,S.push_back(a[id].x); n } else if(a[id].x-a[id].y n using std::bitset; n using std::cerr; n using std::cin; n using std::complex; n using std::cout; n using std::deque; n using std::endl; n using std::ios_base; n using std::iterator; n using std::map; n using std::max; n using std::max_element; n using std::min; n using std::min_element; n using std::multimap; n using std::multiset; n using std::pair; n using std::queue; n using std::reverse; n using std::set; n using std::sort; n using std::stable_sort; n using std::stack; n using std::string; n using std::swap; n using std::unique; n using std::vector; n namespace MySpace { n struct Small_Segment_Tree { n vector a; n int l, r; n n private: n int __summ(int L, int R, int l, int r, int v) { n if (L <= l && r <= R) return a[v]; n if (R <= l || r <= L) return 0; n int m = (l + r) / 2; n return __summ(L, R, l, m, 2 * v + 1) + __summ(L, R, m, r, 2 * v + 2); n } n void __set(int P, int l, int r, int v, int V) { n if (l + 1 == r) { n a[v] = V; n return; n } n int m = (l + r) / 2; n if (P < m) { n __set(P, l, m, 2 * v + 1, V); n a[v] = a[2 * v + 1] + a[2 * v + 2]; n } else { n __set(P, m, r, 2 * v + 2, V); n a[v] = a[2 * v + 1] + a[2 * v + 2]; n } n } n n public: n int Summ(int L, int R) { n if (R < L) return 0; n return __summ(L, R + 1, l, r, 0); n } n void Set(int P, int V) { __set(P, l, r, 0, V); } n Small_Segment_Tree(int _n) { n a.resize(4 * _n); n l = 0, r = _n; n } n }; n long long inq(long long x, long long q, long long MOD) { n if (q == 0) return 1; n long long l = inq(x, q / 2, MOD); n if (q % 2) return l * l % MOD * x % MOD; n return l * l % MOD; n } n }; // namespace MySpace n using namespace MySpace; n long long n, m; n long long a[500000]; n int main() { n ios_base::sync_with_stdio(); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 0; i < n; i++) cin >> a[i]; n for (int i = n; i < 2 * n; i++) cin >> a[i]; n sort(a, a + 2 * n); n long long s1 = 0, s2 = 0; n for (int i = 0; i < n; i++) s1 += a[i]; n for (int i = n; i < 2 * n; i++) s2 += a[i]; n if (s1 == s2) { n cout << -1; n return 0; n } n for (int i = 0; i < 2 * n; i++) cout << a[i] << ; n } n "} +{"func_code_string": "#include n struct event { n int t, time, L, R, idx; n event() {} n event(int t, int time, int L, int R, int idx) n : t(t), time(time), L(L), R(R), idx(idx) {} n bool operator<(const event& a) const { n return (time < a.time || (time == a.time && t < a.t)); n } n } e[200005 * 23]; n int n, m, i, j, ai, place[200005], L, R, en, idx, ans[200005], fw[200005]; n void modify(int j) { n for (; j <= n; j = (j | (j - 1)) + 1) ++fw[j]; n } n int query(int j) { n int rt = 0; n for (; j; j &= (j - 1)) rt += fw[j]; n return rt; n } n int main(int argc, char* const argv[]) { n scanf( %d%d , &n, &m); n for (i = 1; i <= n; i++) { n scanf( %d , &ai); n place[ai] = i; n } n for (i = 1; i <= m; i++) { n scanf( %d%d , &L, &R); n e[++en] = event(2, R, L, R, i); n e[++en] = event(2, L - 1, L, R, -i); n } n for (i = 1; i <= n; i++) { n j = i; n while (j <= n) { n e[++en] = event(1, place[i], place[j], 0, 0); n j += i; n } n } n std::sort(e + 1, e + en + 1); n for (i = 1; i <= en; i++) n if (e[i].t == 1) n modify(e[i].L); n else { n idx = abs(e[i].idx); n ans[idx] += (query(e[i].R) - query(e[i].L - 1)) * (e[i].idx / idx); n } n for (i = 1; i <= m; i++) printf( %d n , ans[i]); n return 0; n } n "} +{"func_code_string": "#include n const int inf = 0x7FFFFFFF; n using namespace std; n int dep[2014], shortcut[20][2014]; n struct Edge { n int u, v, w; n bool operator<(const Edge &A) const { return w < A.w; } n } E[4000005]; n int mp[2014][2014]; n int fa[2014], d[2014]; n int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); } n vector G[2014], Q; n int get_lca(int a, int b) { n if (dep[a] < dep[b]) swap(a, b); n for (int i = 20 - 1; i >= 0; i--) { n if (dep[a] - dep[b] >> i & 1) { n a = shortcut[i][a]; n } n } n if (a == b) return a; n for (int i = 20 - 1; i >= 0; i--) { n if (shortcut[i][a] != shortcut[i][b]) { n a = shortcut[i][a]; n b = shortcut[i][b]; n } n } n return shortcut[0][a]; n } n int main() { n int N; n scanf( %d , &N); n for (int i = 1; i <= N; i++) n for (int j = 1; j <= N; j++) scanf( %d , &mp[i][j]); n int tot = 0; n for (int i = 1; i <= N; i++) n for (int j = i + 1; j <= N; j++) { n E[tot].u = i; n E[tot].v = j; n E[tot].w = mp[i][j]; n tot++; n } n sort(E, E + tot); n for (int i = 1; i <= N; i++) fa[i] = i; n for (int i = 0; i < tot; i++) { n int u = E[i].u; n int v = E[i].v; n if (find(u) != find(v)) { n fa[find(u)] = find(v); n G[u].push_back(v); n G[u].push_back(E[i].w); n G[v].push_back(u); n G[v].push_back(E[i].w); n } n } n int *parent = shortcut[0]; n d[1] = 0; n parent[1] = -1; n dep[1] = 0; n Q.push_back(1); n for (int head = 0; head < int(Q.size()); head++) { n int u = Q[head]; n for (int i = 0; i < int(G[u].size()); i += 2) { n int v = G[u][i]; n int w = G[u][i + 1]; n if (v != parent[u]) { n parent[v] = u; n dep[v] = dep[u] + 1; n d[v] = d[u] + w; n Q.push_back(v); n } n } n } n for (int i = 1; i < 20; i++) { n for (int j = 1; j <= N; j++) { n int &res = shortcut[i][j]; n res = shortcut[i - 1][j]; n if (~res) { n res = shortcut[i - 1][res]; n } n } n } n bool ok = true; n int num = 0; n for (int i = 1; i <= N; i++) n if (fa[i] == i) num++; n if (num > 1) ok = false; n for (int u = 1; ok && u <= N; u++) { n if (mp[u][u] != 0) ok = false; n for (int v = u + 1; ok && v <= N; v++) { n if (mp[u][v] != mp[v][u]) ok = false; n if (mp[u][v] == 0) ok = false; n int mid = get_lca(u, v); n if (d[u] + d[v] - d[mid] * 2 != mp[u][v]) ok = false; n } n } n puts(ok ? YES : NO ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1e18; n const long long mod = 1e9 + 7; n signed main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n long long q; n cin >> q; n ; n for (long long i = (1); i <= (q); i++) { n long long n; n cin >> n; n ; n long long r; n cin >> r; n ; n set> s; n for (long long i = (1); i <= (n); i++) { n long long x; n cin >> x; n ; n s.insert(x); n } n long long k = 0, st = 0; n for (long long j : s) { n if (j - r * k <= 0) { n cout << k << n ; n st = 1; n break; n } n k++; n } n if (!st) cout << k << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const int mx = 2e5 + 10; n long long x[mx], y[mx]; n ifstream fin( input.txt ); n ofstream fout( output.txt ); n long long sum[5]; n int main() { n string b; n cin >> b; n int x = 0, y = 0; n for (int i = 0; i < b.size(); i++) { n if (b[i] == x ) n x++; n else n y++; n } n if (x > y) { n for (int i = 1; i <= x - y; i++) cout << x ; n return 0; n } n for (int i = 1; i <= y - x; i++) cout << y ; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 10; n const int M = 1e9 + 7; n const int MOD = 998244353; n const double PI = 3.141592653589793238460; n const int bs = 1e9 + 7; n unsigned long long power(unsigned long long a, unsigned long long b) { n unsigned long long res = 1; n if (a == 0) return 0; n if (a == 1) return 1; n for (; b > 0; b >>= 1) { n if (b & 1) res = (res * a); n if (res > MOD) res %= MOD; n a = (a * a); n if (a > MOD) a = a % MOD; n } n return res; n } n bool isPrime[1000001]; n vector prime; n void seive(int limit) { n isPrime[0] = isPrime[1] = 1; n for (int i = 2; i * i <= limit; i++) { n if (!isPrime[i]) n for (int j = i * i; j <= limit; j += i) { n isPrime[j] = 1; n } n } n for (int i = 2; i <= limit; i++) n if (!isPrime[i]) prime.push_back(i); n } n map m; n unsigned long long parent[100100], sz[100100]; n vector> v[100010]; n vector, n pair>> n rem; n int visited[100010], valid[100010], cum[100110]; n int n, q1, q2; n int finds(int i) { n while (parent[i] != i) i = parent[i]; n return i; n } n int unions(int x, int y) { n int xr = finds(x); n int yr = finds(y); n if (xr == yr) return 0; n if (sz[xr] > sz[yr]) n parent[yr] = xr; n else if (sz[xr] < sz[yr]) n parent[xr] = yr; n else { n sz[yr]++; n parent[xr] = yr; n } n return 1; n } n void dfs(int node, int pnode, int x) { n cum[node] = x; n visited[node] = 1; n for (int i = 0; i < v[node].size(); i++) { n if (!visited[v[node][i].first]) n dfs(v[node][i].first, node, x ^ (v[node][i].second)); n } n } n void process() { n for (int i = 0; i < n; i++) n if (!visited[i]) dfs(i, i, 0); n for (int i = 0; i < rem.size(); i++) { n int x = rem[i].first.first, y = rem[i].first.second; n int idx = rem[i].second.first, t = rem[i].second.second; n if (cum[x] ^ cum[y] != t) n valid[idx] = 0; n else n valid[idx] = 1; n } n } n int main() { n ios_base::sync_with_stdio(false), cin.tie(0); n int tt = 1; n while (tt--) { n cin >> n >> q1 >> q2; n for (int i = 0; i < n; i++) { n string s; n cin >> s; n m[s] = i; n parent[i] = i; n sz[i] = 0; n } n for (int i = 0; i < q1; i++) { n int t; n cin >> t; n string a, b; n cin >> a >> b; n int x = m[a], y = m[b]; n if (unions(x, y)) { n v[x].push_back({y, t - 1}); n v[y].push_back({x, t - 1}); n valid[i] = 1; n } else n rem.push_back({{x, y}, {i, t - 1}}); n } n process(); n for (int i = 0; i < q1; i++) { n if (valid[i]) n cout << YES n << n ; n else n cout << NO n << n ; n } n for (int i = 0; i < q2; i++) { n string a, b; n cin >> a >> b; n int x = m[a], y = m[b]; n if (finds(x) != finds(y)) n cout << 3 << n ; n else n cout << (cum[x] ^ cum[y]) + 1 << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n long long n, m; n cin >> n >> m; n if (n > 26) n cout << m; n else { n n = pow(2, n); n cout << m % n; n } n return 0; n } n "} +{"func_code_string": "#include n const long long INFLL = 1e18; n using namespace std; n const int MAXN = 2 * 100000; n const int INF = 1000 * 1000 * 1000; n int a[MAXN + 1], used[MAXN + 10]; n int main() { n int n; n scanf( %d , &n); n int ans = 1; n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n if (used[a[i]]) { n ans++; n } n used[a[i]] = 1; n } n cout << ans << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector> segT; n vector lazy; n long long n, m, l, r; n string s; n void buildT(int ss, int se, int si) { n if (ss == se) { n if (s[ss] == 4 ) n segT[si][0] = 1; n else n segT[si][1] = 1; n segT[si][2] = 1; n segT[si][3] = 1; n return; n } n int mid = (ss + se) / 2; n buildT(ss, mid, 2 * si + 1); n buildT(mid + 1, se, 2 * si + 2); n segT[si][0] = segT[2 * si + 1][0] + segT[2 * si + 2][0]; n segT[si][1] = segT[2 * si + 1][1] + segT[2 * si + 2][1]; n segT[si][2] = max(segT[2 * si + 1][2] + segT[2 * si + 2][1], n segT[2 * si + 1][0] + segT[2 * si + 2][2]); n segT[si][3] = max(segT[2 * si + 1][3] + segT[2 * si + 2][0], n segT[2 * si + 1][1] + segT[2 * si + 2][3]); n } n void upd(int ss, int se, int si) { n if (lazy[si] == 1) { n swap(segT[si][0], segT[si][1]); n swap(segT[si][2], segT[si][3]); n if (ss != se) { n lazy[2 * si + 1] ^= 1; n lazy[2 * si + 2] ^= 1; n } n lazy[si] = 0; n } n if (r < ss || l > se) return; n if (ss >= l && se <= r) { n swap(segT[si][0], segT[si][1]); n swap(segT[si][2], segT[si][3]); n if (ss != se) { n lazy[2 * si + 1] ^= 1; n lazy[2 * si + 2] ^= 1; n } n return; n } n int mid = (ss + se) / 2; n upd(ss, mid, 2 * si + 1); n upd(mid + 1, se, 2 * si + 2); n segT[si][0] = segT[2 * si + 1][0] + segT[2 * si + 2][0]; n segT[si][1] = segT[2 * si + 1][1] + segT[2 * si + 2][1]; n segT[si][2] = max(segT[2 * si + 1][2] + segT[2 * si + 2][1], n segT[2 * si + 1][0] + segT[2 * si + 2][2]); n segT[si][3] = max(segT[2 * si + 1][3] + segT[2 * si + 2][0], n segT[2 * si + 1][1] + segT[2 * si + 2][3]); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n int i, j; n cin >> n >> m; n cin >> s; n long long lim = 2 * pow(2, ceil(log(n) / log(2.0))) + 2; n vector temp(lim, 0); n vector> temp2(lim, vector(4, 0)); n segT = temp2; n lazy = temp; n buildT(0, n - 1, 0); n string typ; n for (i = 0; i < m; i++) { n cin >> typ; n if (typ.compare( switch ) == 0) { n cin >> l >> r; n l -= 1; n r -= 1; n upd(0, n - 1, 0); n } else { n if (lazy[0] == 1) n cout << segT[0][3] << endl; n else n cout << segT[0][2] << endl; n } n } n } n "} +{"func_code_string": "#include n using namespace ::std; n int main() { n long long int temp, q, v1, v2, t, d, i, sum = 0; n cin >> v1 >> v2 >> t >> d; n long long int a[t]; n sum = d * (t - 1); n i = 0; n temp = 0; n bool ff = false; n while (1) { n if (!ff) { n i += v1; n a[temp] = i; n temp++; n ff = true; n continue; n } else if (i + d - sum + d <= v2) { n i += d; n sum -= d; n a[temp] = i; n } else { n for (long long int k = d - 1; k >= -d; k--) { n if (i + k - sum + d <= v2) { n i += k; n sum -= d; n a[temp] = i; n break; n } n } n } n temp++; n if (temp == t) break; n } n long long int s = 0; n for (long long int j = 0; j < t; j++) s += a[j]; n cout << s; n } n "} +{"func_code_string": "#include n using namespace std; n const long long N = 1e6 + 1e5, inf = 3e18, mod = 1e9 + 7; n long long tc, n, m, q, a, b, c, d, i, j, k; n long long A[N]; n vector vec; n string s; n int main() { n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); n cin >> tc; n while (tc--) { n cin >> n >> m; n long long flag1 = 0, flag2 = 0; n for (i = 2; i < n + 2; i++) { n cin >> A[i]; n if (A[i] == m) flag1 = 1; n if (A[i] >= m && (A[i - 1] >= m || A[i - 2] >= m)) flag2 = 1; n } n if (flag1 && flag2 || (n == 1 && A[2] == m)) n cout << yes n ; n else n cout << no n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n const long long int N = 2e5 + 5; n void solve() { n long long int n; n cin >> n; n double ans, pi = 3.14159265358979323846; n double rad = (2.0 * sin(pi / (2.0 * (double)n))); n ans = (cos(pi / (4.0 * n))) / sin(pi / (2.0 * (double)n)); n cout << fixed << setprecision(15) << ans << n ; n } n signed main() { n ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL); n long long int t = 1; n cin >> t; n while (t--) { n solve(); n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, l[10], r[10], t = 1; n double ans = 0, o = 1; n cin >> n; n for (int i = 0; i < n; i++) { n t *= 2; n cin >> l[i] >> r[i]; n o *= r[i] - l[i] + 1; n } n if (n == 1) { n cout << setprecision(10) << fixed << (r[0] + l[0]) / 2.0 << endl; n return 0; n } n for (int i = 1; i <= 10000; i++) { n for (int g = 0; g < n; g++) { n if (r[g] <= i) continue; n for (int j = 1; j < t; j++) { n int a[10] = {}, t2 = j, o = 0; n while (t2) { n a[o++] = t2 % 2; n t2 /= 2; n } n if (a[g]) continue; n double k = 1; n bool ch = 0; n for (int h = 0; h < n; h++) { n if (h == g) continue; n if (a[h] && (r[h] < i || l[h] > i)) { n ch = 1; n h = n; n } n if (!a[h] && l[h] >= i) { n ch = 1; n h = n; n } n if (!a[h]) k *= min(i - 1, r[h]) - l[h] + 1; n } n if (ch) continue; n k *= r[g] - max(i + 1, l[g]) + 1; n ans += k * i; n } n } n } n for (int i = 1; i <= 10000; i++) { n for (int j = 1; j < t; j++) { n int a[10] = {}, t2 = j, o = 0, d = 0; n while (t2) { n a[o++] = t2 % 2; n if (a[o - 1]) d++; n t2 /= 2; n } n double k = 1; n if (d == 1) continue; n bool ch = 0; n for (int h = 0; h < n; h++) { n if (a[h] && (r[h] < i || l[h] > i)) { n ch = 1; n h = n; n } n if (!a[h] && l[h] >= i) { n ch = 1; n h = n; n } n if (!a[h]) k *= min(i - 1, r[h]) - l[h] + 1; n } n if (ch) continue; n ans += k * i; n } n } n cout << setprecision(10) << fixed << ans / o << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long mod = 1e9 + 7; n template n inline T read() { n T x = 0, f = 1; n char s = getchar(); n while (s < 0 || s > 9 ) { n if (s == - ) f = -1; n s = getchar(); n }; n while (s >= 0 && s <= 9 ) { n x = (x << 3) + (x << 1) + s - 48; n s = getchar(); n }; n return x * f; n } n template n inline void wri(T x) { n if (x < 0) { n x = -x; n putchar( - ); n }; n if (x / 10) wri(x / 10); n putchar(x % 10 + 48); n } n template n inline void print(T x, char s) { n wri(x); n putchar(s); n } n struct node { n int l, r, val, add; n } e[800010]; n int a[200010], ans[200010]; n void build_tree(int node, int start, int end) { n e[node].l = start, e[node].r = end; n if (start == end) { n e[node].add = 0; n e[node].val = a[start]; n return; n } n int mid = (start + end) >> 1; n build_tree(node << 1, start, mid), build_tree(node << 1 | 1, mid + 1, end); n } n void update(int x, int q, int val) { n if (e[x].l == q && e[x].r == q) { n e[x].val = val, e[x].add = 0; n return; n } n int mid = (e[x].l + e[x].r) >> 1; n e[x << 1].add = max(e[x << 1].add, e[x].add); n e[x << 1 | 1].add = max(e[x << 1 | 1].add, e[x].add); n e[x].add = 0; n if (q <= mid) n update(x << 1, q, val); n else n update(x << 1 | 1, q, val); n } n void query(int x) { n if (e[x].l == e[x].r) { n ans[e[x].l] = max(e[x].val, e[x].add); n return; n } n e[x << 1].add = max(e[x << 1].add, e[x].add); n e[x << 1 | 1].add = max(e[x << 1 | 1].add, e[x].add); n query(x << 1), query(x << 1 | 1); n } n int main() { n int n; n n = read(); n for (register int i = (1); i < (n + 1); i++) a[i] = read(); n build_tree(1, 1, n); n int q; n q = read(); n while (q--) { n int x, y, z; n x = read(); n if (x == 1) { n y = read(), z = read(); n update(1, y, z); n } else n y = read(), e[1].add = max(e[1].add, y); n } n query(1); n for (register int i = (1); i < (n + 1); i++) print(ans[i], ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n string cnv; n cnv.reserve(62); n for (char i = a ; i <= z ; ++i) { n cnv.push_back(i); n } n for (char i = A ; i <= Z ; ++i) { n cnv.push_back(i); n } n for (char i = 0 ; i <= 9 ; ++i) { n cnv.push_back(i); n } n for (int i = 0; i < t; ++i) { n int n, m, k; n cin >> n >> m >> k; n vector mas(n); n int cnt = 0; n for (int j = 0; j < n; ++j) { n cin >> mas[j]; n for (char c : mas[j]) { n cnt += (c == R ); n } n } n int cur = 0; n int perc = cnt / k; n int bigger = cnt % k; n int curcnt = 0; n for (int i = 0; i < n; ++i) { n if (i & 1) { n for (int j = 0; j < m; ++j) { n if (mas[i][j] == R && curcnt == perc + (cur < bigger)) { n ++cur; n curcnt = 0; n } n if (mas[i][j] == R ) ++curcnt; n mas[i][j] = cnv[cur]; n } n } else { n for (int j = m - 1; j >= 0; --j) { n if (mas[i][j] == R && curcnt == perc + (cur < bigger)) { n ++cur; n curcnt = 0; n } n if (mas[i][j] == R ) ++curcnt; n mas[i][j] = cnv[cur]; n } n } n } n for (int i = 0; i < n; ++i) { n cout << mas[i] << n ; n } n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, k, l[50 + 1]; n void Answer() { n int j = 1, s = n; n for (int i = 1; i <= k; i++) { n if (i > s) s += n - (++j) + 1; n cout << j << ; n for (int u = n - 1; u > n - j; u--) cout << l[u] << ; n cout << l[s - i] << endl; n } n } n int main() { n cin >> n >> k; n for (int i = 0; i < n; i++) cin >> l[i]; n sort(l, l + n); n Answer(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void smin(T &a, U b) { n if (a > b) a = b; n } n template n inline void smax(T &a, U b) { n if (a < b) a = b; n } n int power(int a, int b, int m, int ans = 1) { n for (; b; b >>= 1, a = 1LL * a * a % m) n if (b & 1) ans = 1LL * ans * a % m; n return ans; n } n char s[500010]; n int l[12], r[12]; n int sz, ed; n int cnt[500010], ord[500010 << 1]; n struct node { n int deep, fail, cnt, nxt[30], val[12]; n void clear() { n memset(nxt, -1, sizeof nxt); n memset(val, 0, sizeof val); n deep = fail = cnt = 0; n } n } mem[500010 << 1]; n struct automaton { n void init() { n for (int i = 0; i < 26; i++) mem[0].nxt[i] = 1; n mem[0].deep = -1; n mem[1].clear(); n mem[1].cnt = 1; n sz = 2, ed = 1; n } n void insert(int c, int id) { n if (~mem[ed].nxt[c]) { n int p1 = mem[ed].nxt[c]; n if (mem[p1].deep == mem[ed].deep + 1) { n mem[p1].val[id]++; n ed = p1; n return; n } n int p2 = sz++; n mem[p2] = mem[p1]; n mem[p2].deep = mem[ed].deep + 1; n mem[p2].cnt = 0; n for (int i = 0; i < 12; i++) mem[p2].val[i] = 0; n mem[p2].val[id] = 1; n mem[p1].fail = p2; n while (mem[ed].nxt[c] == p1) { n mem[ed].nxt[c] = p2; n mem[p1].cnt -= mem[ed].cnt; n mem[p2].cnt += mem[ed].cnt; n ed = mem[ed].fail; n } n ed = p2; n return; n } n int p = sz++; n mem[p].clear(); n mem[p].deep = mem[ed].deep + 1; n mem[p].val[id] = 1; n while (mem[ed].nxt[c] == -1) { n mem[ed].nxt[c] = p; n mem[p].cnt += mem[ed].cnt; n ed = mem[ed].fail; n } n int p1 = mem[ed].nxt[c]; n if (mem[p1].deep == mem[ed].deep + 1) n mem[p].fail = p1; n else { n int p2 = sz++; n mem[p2] = mem[p1]; n mem[p2].deep = mem[ed].deep + 1; n mem[p2].cnt = 0; n for (int i = 0; i < 12; i++) mem[p2].val[i] = 0; n mem[p].fail = mem[p1].fail = p2; n while (mem[ed].nxt[c] == p1) { n mem[ed].nxt[c] = p2; n mem[p1].cnt -= mem[ed].cnt; n mem[p2].cnt += mem[ed].cnt; n ed = mem[ed].fail; n } n } n ed = p; n } n void build(int n) { n memset(cnt, 0, sizeof cnt); n for (int i = 1; i < sz; i++) cnt[mem[i].deep]++; n for (int i = 1; i < 500010; i++) cnt[i] += cnt[i - 1]; n for (int i = 1; i < sz; i++) ord[--cnt[mem[i].deep]] = i; n for (int i = sz - 2; i >= 0; i--) { n int cur = ord[i], prv = mem[cur].fail; n for (int j = 0; j <= n; j++) mem[prv].val[j] += mem[cur].val[j]; n } n long long ans = 0; n for (int i = 2; i < sz; i++) n if (mem[i].val[n]) { n int ok = 1; n for (int j = 0; j < n; j++) n if (mem[i].val[j] < l[j] || mem[i].val[j] > r[j]) { n ok = 0; n break; n } n if (ok) ans += mem[i].cnt; n } n printf( %I64d n , ans); n } n } sam; n int main() { n int n; n scanf( %s %d , s, &n); n sam.init(); n int len = strlen(s); n for (int i = 0; i < len; i++) sam.insert(s[i] - a , n); n for (int i = 0; i < n; i++) { n scanf( %s %d %d , s, l + i, r + i); n ed = 1; n len = strlen(s); n for (int j = 0; j < len; j++) sam.insert(s[j] - a , i); n } n sam.build(n); n } n "} +{"func_code_string": "#include n using namespace std; n double cal(int n, int *a, double x) { n double ret = 0, t1 = 0, t2 = 0; n for (int i = 0; i < n; i++) { n t1 += a[i] - x; n t2 += a[i] - x; n t1 = max(0., t1); n t2 = min(0., t2); n ret = max(ret, t1); n ret = max(ret, -t2); n } n return ret; n } n int main() { n int n; n scanf( %d , &n); n static int a[200000]; n for (int i = 0; i < n; i++) { n scanf( %d , a + i); n } n double l = -10001, r = 10001, ans; n for (int t = 0; t < 100; t++) { n double d1 = (2 * l + r) / 3, d2 = (l + 2 * r) / 3; n double e1 = cal(n, a, d1), e2 = cal(n, a, d2); n if (e1 <= e2) { n r = d2; n ans = e1; n } else { n l = d1; n ans = e2; n } n } n printf( %.9lf n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1005; n char g[N][N]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n int t; n cin >> t; n while (t--) { n long double h, c, t; n cin >> h >> c >> t; n if (t >= h) { n cout << 1 n ; n continue; n } n if ((h + c) / 2 >= t) { n cout << 2 n ; n continue; n } n int x = 0; n x = (h - t) / (2 * t - h - c); n long double curd = 100000000.0; n int res = -1; n for (int i = max(0, x - 50); i <= x + 50; ++i) { n long double xx = (i + 1) * h + i * c; n xx = 1.0 * xx / (2 * i + 1); n xx = abs(xx - t); n if (xx < curd) { n curd = xx; n res = i; n } n } n cout << 2 * res + 1 << n ; n } n } n "} +{"func_code_string": "#include n using namespace std; n int Day12[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; n int prime100[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, n 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103}; n template n inline bool isLeap(T y) { n return (y % 400 == 0) || (y % 100 ? y % 4 == 0 : false); n } n template n inline T GCD(T a, T b) { n a = abs(a); n b = abs(b); n if (a < b) swap(a, b); n while (b) { n a = a % b; n swap(a, b); n } n return a; n } n template n inline T LCM(T x, T y) { n T tp = GCD(x, y); n if ((x / tp) * 1. * y > 9e18) return 9e18; n return (x / tp) * y; n } n template n inline T BIGMOD(T A, T B, T M = 1000000007) { n T ret = 1; n while (B) { n if (B & 1) ret = (ret * A) % M; n A = (A * A) % M; n B = B >> 1; n } n return ret; n } n template n inline T BigMod(T A, T B, T M) { n T ret = 1; n while (B) { n if (B & 1) ret = (ret * A) % M; n A = (A * A) % M; n B = B >> 1; n } n return ret; n } n long long int MySqrt(long long int n) { n long long int p = sqrt(n); n if ((p + 1) * (p + 1) <= n) n return p + 1; n else if (p * p <= n) n return p; n else n return p - 1; n } n long long int MyPow(long long int x, long long int n) { n if (n == 0) n return 1; n else if (n % 2 == 0) n return MyPow(x * x, n / 2); n else n return x * MyPow(x * x, ((n - 1) / 2)); n } n long long int modInverse(long long int n) { n return BIGMOD(n, (long long int)1000000007 - 2) % 1000000007; n } n void solve() { n long long int ans = 1, n; n cin >> n; n if (n % 2 == 1) n printf( 0 n ); n else { n n /= 2; n for (int i = 1; i <= n; i++) ans *= 2; n printf( %lld n , ans); n } n } n char arr[505][505]; n int Left[505][505]; n int Right[505][505]; n int Up[505][505]; n int Low[505][505]; n void Now() { n int n, m, cnt = 0; n cin >> n >> m; n for (int i = 0; i < n; i++) { n for (int j = 0; j < m; j++) { n cin >> arr[i][j]; n if (arr[i][j] == * ) cnt++; n } n } n for (int i = 1; i < n; i++) { n for (int j = 0; j < m; j++) { n if (arr[i - 1][j] == * ) Up[i][j] += 1 + Up[i - 1][j]; n } n } n for (int i = 0; i < n; i++) { n for (int j = 1; j < m; j++) { n if (arr[i][j - 1] == * ) Left[i][j] += 1 + Left[i][j - 1]; n } n } n for (int i = n - 1; i >= 0; i--) { n for (int j = m - 2; j >= 0; j--) { n if (arr[i][j + 1] == * ) Right[i][j] += 1 + Right[i][j + 1]; n } n } n for (int i = n - 2; i >= 0; i--) { n for (int j = m - 1; j >= 0; j--) { n if (arr[i + 1][j] == * ) Low[i][j] += 1 + Low[i + 1][j]; n } n } n for (int i = 1; i < n - 1; i++) { n for (int j = 1; j < m - 1; j++) { n if (Left[i][j] > 0 && Up[i][j] > 0 && Right[i][j] > 0 && Low[i][j] > 0 && n arr[i][j] == * ) { n if (Left[i][j] + Up[i][j] + Right[i][j] + Low[i][j] + 1 == cnt) { n printf( YES n ); n exit(0); n } n } n } n } n printf( NO n ); n } n int main() { solve(); } n "} +{"func_code_string": "#include n using namespace std; n void solve() { n int n, m; n int x, y; n int z = 1; n cin >> n >> m; n cin >> x >> y; n cout << x << << y << n ; n cout << 1 << << y << n ; n for (int i = 1; i <= n; i++) { n vector> v; n for (int j = 1; j <= m; j++) { n if ((i == x && j == y) || (i == 1 && j == y)) continue; n v.push_back({i, j}); n } n if (z) { n reverse(v.begin(), v.end()); n } n for (auto it : v) { n cout << it.first << << it.second << n ; n } n z ^= 1; n } n } n int main() { n ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e5 + 5; n int n, q, a[N], node[4 * N]; n vector pos[N]; n void init(int i, int l, int r) { n if (l == r) { n node[i] = (a[l] == 0 ? 1e9 : a[l]); n return; n } n int m = (l + r) >> 1; n init(i << 1, l, m); n init(i << 1 | 1, m + 1, r); n node[i] = min(node[i << 1], node[i << 1 | 1]); n } n int get(int i, int l, int r, int a, int b) { n if (l > r || a > r || b < l) return (int)1e9; n if (a <= l && r <= b) return node[i]; n int m = (l + r) >> 1; n return min(get(i << 1, l, m, a, b), get(i << 1 | 1, m + 1, r, a, b)); n } n int main() { n scanf( %d %d , &n, &q); n bool f = false; n bool zero = false; n for (int i = 1; i <= n; i++) { n scanf( %d , &a[i]); n if (a[i] == q) f = true; n if (a[i]) n pos[a[i]].push_back(i); n else n zero = true; n } n if (!f && !zero) return !printf( NO ); n init(1, 1, n); n for (int i = 1; i <= q; i++) { n if (pos[i].size() > 0) { n if (get(1, 1, n, pos[i][0], pos[i][pos[i].size() - 1]) < i) n return !printf( NO ); n } n } n puts( YES ); n int l = 1; n while (l <= n) { n while (l <= n && a[l]) l++; n int r = l; n while (r <= n && !a[r]) r++; n if (l > 1) { n for (int j = l; j < r; j++) a[j] = f ? a[l - 1] : q; n if (!f) f = true; n } else if (r <= n) { n for (int j = l; j < r; j++) a[j] = f ? a[r] : q; n if (!f) f = true; n } else n for (int j = l; j < r; j++) a[j] = q; n l = r; n } n for (int i = 1; i <= n; i++) printf( %d , a[i]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n template n inline void ckmax(T& x, T y) { n x = (y > x ? y : x); n } n template n inline void ckmin(T& x, T y) { n x = (y < x ? y : x); n } n namespace Fread { n const int SIZE = 1 << 21; n char buf[SIZE], *S, *T; n inline char getchar() { n if (S == T) { n T = (S = buf) + fread(buf, 1, SIZE, stdin); n if (S == T) return n ; n } n return *S++; n } n } // namespace Fread n namespace Fwrite { n const int SIZE = 1 << 21; n char buf[SIZE], *S = buf, *T = buf + SIZE; n inline void flush() { n fwrite(buf, 1, S - buf, stdout); n S = buf; n } n inline void putchar(char c) { n *S++ = c; n if (S == T) flush(); n } n struct NTR { n ~NTR() { flush(); } n } ztr; n } // namespace Fwrite n namespace Fastio { n struct Reader { n template n Reader& operator>>(T& x) { n char c = Fread ::getchar(); n T f = 1; n while (c < 0 || c > 9 ) { n if (c == - ) f = -1; n c = Fread ::getchar(); n } n x = 0; n while (c >= 0 && c <= 9 ) { n x = x * 10 + (c - 0 ); n c = Fread ::getchar(); n } n x *= f; n return *this; n } n Reader& operator>>(char& c) { n c = Fread ::getchar(); n while (c == n || c == ) c = Fread ::getchar(); n return *this; n } n Reader& operator>>(char* str) { n int len = 0; n char c = Fread ::getchar(); n while (c == n || c == ) c = Fread ::getchar(); n while (c != n && c != ) { n str[len++] = c; n c = Fread ::getchar(); n } n str[len] = 0 ; n return *this; n } n Reader() {} n } cin; n const char endl = n ; n struct Writer { n template n Writer& operator<<(T x) { n if (x == 0) { n Fwrite ::putchar( 0 ); n return *this; n } n if (x < 0) { n Fwrite ::putchar( - ); n x = -x; n } n static int sta[45]; n int top = 0; n while (x) { n sta[++top] = x % 10; n x /= 10; n } n while (top) { n Fwrite ::putchar(sta[top] + 0 ); n --top; n } n return *this; n } n Writer& operator<<(char c) { n Fwrite ::putchar(c); n return *this; n } n Writer& operator<<(char* str) { n int cur = 0; n while (str[cur]) Fwrite ::putchar(str[cur++]); n return *this; n } n Writer& operator<<(const char* str) { n int cur = 0; n while (str[cur]) Fwrite ::putchar(str[cur++]); n return *this; n } n Writer() {} n } cout; n } // namespace Fastio n const int MAXN = 1000, MAXM = 3e4; n const int INF = 2e9 + 233; n int n, m, s, t; n struct EDGE { n int nxt, to, w, id; n } edge[MAXM * 2 + 5]; n int head[MAXN + 5], tot; n inline void add_edge(int u, int v, int w, int id) { n edge[++tot].nxt = head[u]; n edge[tot].to = v; n edge[tot].w = w; n edge[tot].id = id; n head[u] = tot; n } n pair > ans; n int dfn[MAXN + 5], ofn[MAXN + 5], cnt_dfn; n int fa[MAXN + 5], fw[MAXN + 5], fid[MAXN + 5]; n int num[MAXN + 5]; n long long sum[MAXN + 5], sumid[MAXN + 5]; n unsigned long long sumhash[MAXN + 5]; n map vis; n int id[MAXN + 5], lca[MAXN + 5]; n set > S[MAXN + 5]; n vector > to_del[MAXN + 5]; n int an[MAXN + 5][10], dep[MAXN + 5]; n int get_lca(int u, int v) { n if (dep[u] < dep[v]) swap(u, v); n for (int i = 9; i >= 0; --i) { n if (dep[an[u][i]] >= dep[v]) { n u = an[u][i]; n } n } n if (u == v) return u; n for (int i = 9; i >= 0; --i) { n if (an[u][i] != an[v][i]) { n u = an[u][i]; n v = an[v][i]; n } n } n return an[u][0]; n } n int l(int id) { n int x = edge[id * 2].to; n int y = edge[id * 2 - 1].to; n if (dfn[x] < dfn[y]) swap(x, y); n return x; n } n void dfs(int u) { n dfn[u] = ++cnt_dfn; n an[u][0] = fa[u]; n dep[u] = dep[fa[u]] + 1; n for (int i = 1; i <= 9; ++i) { n an[u][i] = an[an[u][i - 1]][i - 1]; n } n for (int i = head[u]; i; i = edge[i].nxt) { n int v = edge[i].to; n if (edge[i].id == fid[u]) continue; n if (!dfn[v]) { n fa[v] = u; n fw[v] = edge[i].w; n fid[v] = edge[i].id; n dfs(v); n num[u] += num[v]; n sum[u] += sum[v]; n sumid[u] += sumid[v]; n sumhash[u] += sumhash[v]; n if (((int)(S[id[u]]).size()) < ((int)(S[id[v]]).size())) { n swap(id[u], id[v]); n } n for (set >::iterator it = S[id[v]].begin(); n it != S[id[v]].end(); ++it) { n S[id[u]].insert(*it); n } n } else if (dfn[v] < dfn[u]) { n num[u]++; n num[v]--; n sum[u] += edge[i].w; n sum[v] -= edge[i].w; n sumid[u] += edge[i].id; n sumid[v] -= edge[i].id; n S[id[u]].insert(make_pair(dfn[u], edge[i].id)); n to_del[v].push_back(make_pair(dfn[u], edge[i].id)); n unsigned long long hashw = n (((unsigned long long)rand() << 30) ^ (rand() << 15) ^ rand()); n while (vis[hashw]) { n hashw = (((unsigned long long)rand() << 30) ^ (rand() << 15) ^ rand()); n } n vis[hashw] = 1; n sumhash[u] += hashw; n sumhash[v] -= hashw; n } n } n for (int i = 0; i < ((int)(to_del[u]).size()); ++i) { n S[id[u]].erase(to_del[u][i]); n } n assert(((int)(S[id[u]]).size()) == num[u]); n if (num[u] >= 2) { n lca[u] = get_lca(l(S[id[u]].begin()->second), l(S[id[u]].rbegin()->second)); n } n ofn[u] = cnt_dfn; n } n int main() { n srand((unsigned long long)time(0) ^ (unsigned long long)(new char)); n Fastio ::cin >> n >> m; n Fastio ::cin >> s >> t; n for (int i = 1; i <= m; ++i) { n int u, v, w; n Fastio ::cin >> u >> v >> w; n add_edge(u, v, w, i); n add_edge(v, u, w, i); n } n for (int i = 1; i <= n; ++i) { n id[i] = i; n } n ans = make_pair(INF, make_pair(INF, INF)); n dfs(s); n if (!dfn[t]) { n Fastio ::cout << 0 << Fastio ::endl; n Fastio ::cout << 0 << Fastio ::endl; n Fastio ::cout << Fastio ::endl; n return 0; n } n for (int u = t; u != s; u = fa[u]) { n if (num[u] == 0) { n ckmin(ans, make_pair(fw[u], make_pair(fid[u], 0))); n } else if (num[u] == 1) { n ckmin(ans, n make_pair(fw[u] + (int)sum[u], make_pair(fid[u], (int)sumid[u]))); n int x = l(sumid[u]); n for (int v = x; v != u; v = fa[v]) { n if (num[v] == 1) { n if (dfn[get_lca(t, x)] < dfn[v]) { n ckmin(ans, make_pair(fw[u] + fw[v], make_pair(fid[u], fid[v]))); n } n } n } n } else { n int x = lca[u]; n for (int v = x; v != u; v = fa[v]) { n if (num[u] == num[v] && sum[u] == sum[v] && sumid[u] == sumid[v] && n sumhash[u] == sumhash[v]) { n if (dfn[get_lca(t, x)] < dfn[v]) { n ckmin(ans, make_pair(fw[u] + fw[v], make_pair(fid[u], fid[v]))); n } n } n } n } n } n if (ans.first == INF) { n Fastio ::cout << -1 << Fastio ::endl; n return 0; n } n Fastio ::cout << ans.first << Fastio ::endl; n if (ans.second.second == 0) { n Fastio ::cout << 1 << Fastio ::endl; n Fastio ::cout << ans.second.first << Fastio ::endl; n } else { n Fastio ::cout << 2 << Fastio ::endl; n Fastio ::cout << ans.second.first << << ans.second.second n << Fastio ::endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n long long a, f, sec, t = 0, h = 0; n cin >> a; n vector par; n vector m; n for (int i = 0; i < s.length(); i++) { n if (s[i - 1] == s[i]) { n h++; n } n par.push_back(h); n } n for (int i = 0; i < a; i++) { n cin >> f >> sec; n m.push_back(par[sec - 1] - par[f - 1]); n } n for (int i = 0; i < a; i++) { n cout << m[i] << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n long long dp[2]; n void solve() { n long long n; n cin >> n; n for (int i = 0; i < n; i++) { n dp[i % 2] = dp[i % 2] + dp[!(i % 2)] + 1; n if (dp[i % 2] > 1000000007) dp[i % 2] %= 1000000007; n } n cout << (dp[0] + dp[1] + 1000000007) % (1000000007); n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n ; n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, t; n cin >> n >> t; n int* time = new int[n]; n for (int i = 0; i < n; i++) { n cin >> time[i]; n } n int sum = 0, count = 0; n int ans = INT_MIN; n for (int i = 0; i < n; i++) { n if (sum + time[i] <= t) { n sum += time[i]; n count++; n } else { n sum = sum - time[i - count] + time[i]; n } n ans = max(ans, count); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n vector a; n int was[100100]; n int t[100100]; n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n cin >> n; n for (int i = 1; i <= 2 * n; i++) { n int x; n cin >> x; n a.push_back(x); n } n vector ans; n int cnt = 0; n for (int i = 0; i < 2 * n; i++) { n if (!was[a[i]]) { n t[a[i]] = i; n ans.push_back(a[i]); n was[a[i]] = true; n } else { n was[a[i]] = true; n cnt += i - t[a[i]] - 1; n ans.insert(ans.begin() + t[a[i]] + 1, a[i]); n for (int j = 0; j < ans.size(); j++) { n t[ans[j]] = j; n } n } n } n cout << cnt; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n vector tab[100100], ans; n int n, ls[10]; n bool used[100100]; n bool chek(int a, int b) { n for (int i = 0; i < 4; i++) n if (tab[a][i] == b) return true; n return false; n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n + n; i++) { n int a, b; n scanf( %d%d , &a, &b); n if (a == b) { n puts( -1 ); n return 0; n } n tab[a].push_back(b); n tab[b].push_back(a); n } n for (int i = 1; i <= n; i++) { n if (tab[i].size() != 4) { n puts( -1 ); n return 0; n } n } n if (n <= 10) { n int ar[30] = {}; n for (int i = 0; i < n; i++) ar[i] = i + 1; n do { n ar[n] = ar[0]; n ar[n + 1] = ar[1]; n bool ok = true; n for (int i = 0; i < n; i++) { n if (!chek(ar[i], ar[i + 1]) || !chek(ar[i], ar[i + 2])) { n ok = false; n break; n } n } n if (ok) { n for (int i = 0; i < n; i++) n printf( %d%c , ar[i], i == n - 1 ? n : ); n return 0; n } n } while (std::next_permutation(ar, ar + n)); n puts( -1 ); n return 0; n } n int start = 1, pre = -1; n while (!used[start]) { n used[start] = true; n ans.push_back(start); n int nxt = start; n for (int i = 0; i < 4; i++) { n int cnt = 0; n for (int j = 0; j < 4; j++) n if (chek(tab[start][i], tab[start][j])) cnt++; n if (cnt == 2 && tab[start][i] != pre) { n nxt = tab[start][i]; n break; n } n } n if (nxt == start) { n puts( -1 ); n return 0; n } n pre = start; n start = nxt; n } n if ((int)ans.size() < n) { n puts( -1 ); n return 0; n } n ans.push_back(ans[0]); n ans.push_back(ans[1]); n for (int i = 0; i < n; i++) { n if (!chek(ans[i], ans[i + 1]) || !chek(ans[i], ans[i + 2])) { n puts( -1 ); n return 0; n } n } n for (int i = 0; i < n; i++) printf( %d%c , ans[i], i == n - 1 ? n : ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long n, q, sum, x; n int main(void) { n scanf( %lld%lld , &n, &q); n while (q--) { n scanf( %lld , &x); n while (x % 2 == 0) { n sum = (x + 1) / 2 + 1, sum = n - sum, x += sum + 1; n } n printf( %lld n , x / 2 + 1); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n set > s[2]; n bool eq(pair a, pair b) { n return (a.first == b.first && a.second == b.second); n } n int main() { n int n, m, i, a, b, j; n scanf( %d%d , &n, &m); n for (i = 0; i < n; i++) { n scanf( %d%d , &a, &b); n if (b < a) swap(a, b); n s[0].insert(make_pair(a, b)); n } n for (i = 0; i < m; i++) { n scanf( %d%d , &a, &b); n if (b < a) swap(a, b); n s[1].insert(make_pair(a, b)); n } n set ans; n for (auto i : s[0]) n for (auto j : s[1]) { n if (i.first == j.first && i.second == j.second) n continue; n else if (i.first != j.first && i.first != j.second && n i.second != j.first && i.second != j.second) n continue; n else if (i.first == j.first) { n for (auto k : s[0]) { n if (eq(k, j)) continue; n if (k.first == j.second || k.second == j.second) n return !printf( -1 n ); n } n for (auto k : s[1]) { n if (eq(k, i)) continue; n if (k.first == i.second || k.second == i.second) n return !printf( -1 n ); n } n ans.insert(i.first); n } else if (i.first == j.second) { n for (auto k : s[0]) { n if (eq(k, j)) continue; n if (k.first == j.first || k.second == j.first) return !printf( -1 n ); n } n for (auto k : s[1]) { n if (eq(k, i)) continue; n if (k.first == i.second || k.second == i.second) n return !printf( -1 n ); n } n ans.insert(i.first); n } else if (i.second == j.second) { n for (auto k : s[0]) { n if (eq(k, j)) continue; n if (k.first == j.first || k.second == j.first) return !printf( -1 n ); n } n for (auto k : s[1]) { n if (eq(k, i)) continue; n if (k.first == i.first || k.second == i.first) return !printf( -1 n ); n } n ans.insert(i.second); n } else if (i.second == j.first) { n for (auto k : s[0]) { n if (eq(k, j)) continue; n if (k.first == j.second || k.second == j.second) n return !printf( -1 n ); n } n for (auto k : s[1]) { n if (eq(k, i)) continue; n if (k.first == i.first || k.second == i.first) return !printf( -1 n ); n } n ans.insert(i.second); n } n } n if ((int)ans.size() > 1) return !printf( 0 n ); n cout << *ans.begin() << endl; n } n "} +{"func_code_string": "#include n using namespace std; n using LL = long long; n const LL INF = 2000000000000000000L; n struct Event { n char c; n LL v; n int pos; n }; n void Dfs(int pos, vector>>& edge, vector& parallel, n vector& ans) { n if (edge[pos].size() == 0) { n ans[pos] = 1; n return; n } n if (parallel[pos]) { n for (auto [vv, j] : edge[pos]) { n Dfs(j, edge, parallel, ans); n } n } else { n int j = 0; n for (int i = 0; i < edge[pos].size(); ++i) { n if (edge[pos][i].first < edge[pos][j].first) j = i; n } n Dfs(edge[pos][j].second, edge, parallel, ans); n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n int times; n cin >> times; n while (times--) { n int n; n cin >> n; n string ss; n getline(cin, ss); n string s; n for (char c : ss) { n if (c == ) continue; n s.push_back(c); n } n vector>> edge(s.size()); n vector sign(s.size()); n stack st; n for (int i = 0; i < s.size(); ++i) { n if (s[i] == ) ) { n vector> x; n bool parallel = false; n int j = i; n while (true) { n Event e = st.top(); n st.pop(); n if (e.c == ( ) { n j = e.pos; n break; n } n if (e.c == P ) parallel = true; n if (e.c == S ) parallel = false; n if (e.c == * ) { n x.push_back({e.v, e.pos}); n } n } n sign[j] = parallel; n for (int i = 0; i < x.size(); ++i) { n edge[j].push_back(x[i]); n } n if (parallel) { n LL ans = 0; n for (auto [a, b] : x) ans += a; n st.push({ * , ans, j}); n } else { n LL ans = INF; n for (auto [a, b] : x) ans = min(ans, a); n st.push({ * , ans, j}); n } n } else { n st.push({s[i], 1, i}); n } n } n vector ans(s.size()); n Dfs(0, edge, sign, ans); n cout << REVOLTING ; n for (int i = 0; i < s.size(); ++i) { n if (s[i] == * ) cout << ans[i] * n * st.top().v << ; n } n cout << n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n cin >> n >> k; n int *arr = new int[n]; n for (int i = 0; i < n; i++) cin >> arr[i]; n sort(arr, arr + n); n reverse(arr, arr + n); n cout << arr[k - 1]; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int basecon(int n, int b); n int gcd(int a, int b) { n if (b == 0) n return a; n else n return gcd(b, a % b); n } n int basecon(int n, int b) { n int sum = 0; n while (n) { n sum = sum + (n % b); n n = n / b; n } n return sum; n } n int main() { n int n, sum = 0, y, g; n cin >> n; n y = n - 2; n for (int i = 2; i < n; ++i) { n sum = sum + basecon(n, i); n } n g = gcd(sum, y); n sum = sum / g; n y = y / g; n cout << sum << / << y << endl; n } n "} +{"func_code_string": "#include n using namespace std; n vector v, ans; n void op(int i) { n int x = v[i + 2]; n v[i + 2] = v[i + 1]; n v[i + 1] = v[i]; n v[i] = x; n if (ans.size() >= 2 && ans[ans.size() - 1] == i + 1 && n ans[ans.size() - 2] == i + 1) n ans.pop_back(), ans.pop_back(); n else n ans.push_back(i + 1); n } n void reach(int x, int y) { n while (y > x + 1) op(y - 2), y -= 2; n if (y == x + 1) op(y - 1), op(y - 1); n } n int main(int argc, char **argv) { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n int t; n cin >> t; n while (t--) { n int n, st = 0, temp = 0; n ans.clear(); n cin >> n; n v.resize(n); n vector ar(501, -1); n int val = -1, x, y; n for (int i = 0; i < n; i++) { n cin >> v[i]; n if (ar[v[i]] != -1) val = v[i], x = ar[v[i]], y = i; n ar[v[i]] = i; n } n if (val != -1) v[x] = v[y] = 2000; n while (n - st > 3) { n int mi = 1000, in; n for (int j = st; j < n; j++) n if (v[j] < mi) mi = v[j], in = j; n reach(st, in); n st++; n } n if (val == -1) { n while (!(v[st] <= v[st + 1] && v[st + 1] <= v[st + 2])) { n op(st), temp++; n if (temp > 5) { n cout << -1 << endl; n goto brk; n } n } n } else { n while (v[st + 1] != 2000 || v[st + 2] != 2000) op(st); n while (st >= 0 && val < v[st]) op(st), op(st), st--; n } n cout << ans.size() << endl; n for (auto x : ans) cout << x << ; n cout << endl; n brk:; n } n } n "} +{"func_code_string": "#include n using namespace std; n char a[5004][5004]; n int vis[5004] = {0}; n int fl = 0; n int n; n void dfs(int x, int par) { n if (fl == 1) return; n vis[x] = 1; n for (int i = 0; i < n; i++) { n if (a[x][i] == 1 && a[i][par] == 1 ) { n printf( %d %d %d n , par + 1, x + 1, i + 1); n fl = 1; n return; n } n if (vis[i] == 0 && a[x][i] == 1 ) { n if (fl == 1) return; n dfs(i, x); n if (fl == 1) return; n } n } n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %s , a[i]); n } n for (int i = 0; i < n; i++) { n if (vis[i] == 0) { n dfs(i, i); n } n } n if (fl == 0) { n printf( -1 n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int il[5]; n int wyn = 0; n void printState() {} n int n; n int main() { n ios::sync_with_stdio(0); n cin >> n; n while (n--) { n int tmp; n cin >> tmp; n il[tmp]++; n } n int tmp; n if (il[1] > il[2]) { n wyn += il[2]; n il[3] += il[2]; n il[1] -= il[2]; n il[2] = 0; n printState(); n wyn += il[1] / 3 * 2; n il[3] += il[1] / 3; n il[1] = il[1] % 3; n printState(); n if (il[1] == 1 && il[3] > 0) { n tmp = min(il[1], il[3]); n wyn += tmp; n il[1] -= tmp; n il[3] -= tmp; n il[4] += tmp; n } else if (il[1] == 1) { n printState(); n tmp = min(1, il[4] / 2); n il[1] -= tmp; n il[4] -= 2 * tmp; n wyn += 2 * tmp; n } else if (il[1] == 2 && il[4] > 0) { n wyn += il[1]; n il[4] -= il[1]; n il[3] += il[1] * 2; n il[1] = 0; n } else if (il[1] == 2) { n tmp = min(il[1], il[3]); n wyn += tmp; n il[1] -= tmp; n il[3] -= tmp; n } n printState(); n } else { n wyn += il[1]; n il[3] += il[1]; n il[2] -= il[1]; n il[1] = 0; n printState(); n wyn += il[2] / 3 * 2; n il[3] += il[2] / 3 * 2; n il[2] = il[2] % 3; n printState(); n if (il[2] == 1 && il[4] > 0) { n il[2] = 0; n il[4] -= 1; n il[3] += 2; n wyn += 1; n } else if (il[2] == 1 && il[3] >= 2) { n il[3] -= 2; n il[2] -= 1; n il[4] += 2; n wyn += 2; n } else if (il[2] == 2) { n il[4] += 1; n il[2] -= 2; n wyn += 2; n } n printState(); n } n cout << (il[2] + il[1] > 0 ? -1 : wyn) << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 1e3 + 20; n bool A[maxn][maxn]; n int d[maxn]; n vector > ans; n void solve(set &a) { n if ((int)a.size() == 1) { n int k = *a.begin(); n for (int i = 0; i < k + 1; i++) n for (int j = i + 1; j < k + 1; j++) A[i][j] = A[j][i] = 1; n return; n } n set tmp; n int k = *a.rbegin(), mn = *a.begin(); n for (auto x : a) n if (x != k) tmp.insert(k - x); n solve(tmp); n for (int i = 0; i <= k - mn; i++) n for (int j = i + 1; j <= k - mn; j++) n A[i][j] = !A[i][j], A[j][i] = !A[j][i]; n for (int i = 0; i <= k - mn; i++) n for (int j = k - mn + 1; j <= k; j++) A[i][j] = A[j][i] = 1; n for (int i = k - mn + 1; i <= k; i++) n for (int j = i + 1; j <= k; j++) A[i][j] = A[j][i] = 1; n } n int main() { n int m; n cin >> m; n set tmp; n for (int i = 0; i < m; i++) cin >> d[i], tmp.insert(d[i]); n solve(tmp); n for (int i = 0; i <= d[m - 1]; i++) n for (int j = i + 1; j <= d[m - 1]; j++) n if (A[i][j]) ans.push_back({i, j}); n printf( %d n , (int)ans.size()); n for (auto x : ans) printf( %d %d n , x.first + 1, x.second + 1); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long int n, m, i; n cin >> n >> m; n long long int arr[n + 5]; n map ma; n queue q; n for (i = 0; i < n; i++) { n cin >> arr[i]; n ma[arr[i]] = 0; n q.push(arr[i]); n } n long long int result = 0, cnt = 0; n long long int ans[m + 5]; n while (!q.empty()) { n if (cnt >= m) break; n long long int x = q.front(); n if (!ma.count(x + 1)) { n q.push(x + 1); n ans[cnt] = x + 1; n ma[x + 1] = ma[x] + 1; n result += ma[x + 1]; n cnt++; n } n if (cnt >= m) break; n if (!ma.count(x - 1)) { n q.push(x - 1); n ans[cnt] = x - 1; n ma[x - 1] = ma[x] + 1; n result += ma[x - 1]; n cnt++; n } n q.pop(); n } n cout << result << n ; n for (i = 0; i < m; i++) cout << ans[i] << ; n cout << n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int MAX_H = 100; n const int MAX_W = 100; n int hs[MAX_H], vs[MAX_W]; n int ps[MAX_H][MAX_W], as[MAX_H * MAX_W]; n int main() { n int h, w, q; n scanf( %d%d%d , &h, &w, &q); n for (int y = 0, p = 0; y < h; y++) n for (int x = 0; x < w; x++, p++) ps[y][x] = p; n while (q--) { n int op; n scanf( %d , &op); n if (op == 1) { n int y; n scanf( %d , &y); n y--; n int tp = ps[y][0]; n for (int x = 1; x < w; x++) ps[y][x - 1] = ps[y][x]; n ps[y][w - 1] = tp; n } else if (op == 2) { n int x; n scanf( %d , &x); n x--; n int tp = ps[0][x]; n for (int y = 1; y < h; y++) ps[y - 1][x] = ps[y][x]; n ps[h - 1][x] = tp; n } else { n int y, x, v; n scanf( %d%d%d , &y, &x, &v); n y--, x--; n as[ps[y][x]] = v; n } n } n for (int y = 0, p = 0; y < h; y++) n for (int x = 0; x < w; x++, p++) { n printf( %d , as[p]); n putchar(x + 1 < w ? : n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1000000000000000000; n struct fun { n long long a, b, nr; n }; n void Dodaj(deque& D, fun nowy) { n while (D.size() >= 2) { n fun ost = D.front(); n D.pop_front(); n fun przed = D.front(); n if ((ost.b - nowy.b) * (ost.a - przed.a) > n (nowy.a - ost.a) * (przed.b - ost.b)) { n D.push_front(ost); n break; n } n } n D.push_front(nowy); n } n int Pytaj(deque& D, long long x) { n while (D.size() >= 2) { n fun ost = D.back(); n D.pop_back(); n fun przed = D.back(); n if (ost.a * x + ost.b < przed.a * x + przed.b) { n D.push_back(ost); n break; n } n } n return D.back().nr; n } n int main() { n ios_base::sync_with_stdio(0); n int n, m, p; n cin >> n >> m >> p; n vector s(n); n s[0] = 0; n for (int i = 1; i < n; ++i) { n cin >> s[i]; n s[i] += s[i - 1]; n } n vector a(m); n for (int i = 0; i < m; ++i) { n int h, t; n cin >> h >> t; n --h; n a[i] = t - s[h]; n } n sort(a.begin(), a.end()); n vector prefA(m); n prefA[0] = a[0]; n for (int i = 1; i < m; ++i) prefA[i] = prefA[i - 1] + a[i]; n vector > dp(p, vector(m, INF)); n for (int i = 0; i < m; ++i) dp[0][i] = a[i] * (i + 1) - prefA[i]; n for (int i = 1; i < p; ++i) { n deque D; n Dodaj(D, {-(i - 1), dp[i - 1][i - 1] + prefA[i - 1], i - 1}); n for (int j = i; j < m; ++j) { n int nr = Pytaj(D, a[j]); n dp[i][j] = dp[i - 1][nr] + a[j] * (j - nr) - prefA[j] + prefA[nr]; n Dodaj(D, {-j, dp[i - 1][j] + prefA[j], j}); n } n } n long long odp = INF; n for (int i = 0; i < p; ++i) odp = min(odp, dp[i][m - 1]); n cout << odp; n return 0; n } n "} +{"func_code_string": "#include n using std::abs; n using std::cerr; n using std::cin; n using std::cout; n using std::map; n using std::max; n using std::min; n using std::pair; n using std::set; n using std::string; n using std::swap; n using std::vector; n using ll = long long; n using uint = unsigned int; n using pii = pair; n using pll = pair; n template n void err(vector::iterator it, T a) { n cerr << it->substr((*it)[0] == ) << = << a << n ; n } n template n void err(vector::iterator it, T a, Ts... as) { n cerr << it->substr((*it)[0] == ) << = << a << , ; n err(++it, as...); n } n struct init { n init() { n cin.tie(0); n std::iostream::sync_with_stdio(0); n cout << std::fixed << std::setprecision(10); n cerr << std::fixed << std::setprecision(10); n srand(228); n } n ~init() { n cerr << Time elapsed: << 1.0 * (double)clock() / CLOCKS_PER_SEC n << s. n ; n } n } init; n const int MAXN = 1001, INF = 1e9 + 7; n int ans[MAXN]; n vector wo[MAXN]; n int ret[20][MAXN]; n int main() { n int n; n cin >> n; n for (int step = 1, pw = 0; step < n; step *= 2, ++pw) { n vector q0, q1; n for (int i = 0; i < n; i += step * 2) { n for (int j = 0; j < step && i + j < n; ++j) { n wo[i + j].emplace_back(pw * 2 + 1); n q0.emplace_back(i + j); n } n for (int j = step; j < step + step && i + j < n; ++j) { n q1.emplace_back(i + j); n wo[i + j].emplace_back(pw * 2); n } n } n if (!q0.empty()) { n cout << q0.size() << n ; n for (int i : q0) cout << i + 1 << ; n cout << std::endl; n for (int i = 0; i < n; ++i) cin >> ret[pw * 2][i]; n } n if (!q1.empty()) { n cout << q1.size() << n ; n for (int i : q1) cout << i + 1 << ; n cout << std::endl; n for (int i = 0; i < n; ++i) cin >> ret[pw * 2 + 1][i]; n } n } n cout << -1 n ; n for (int i = 0; i < n; ++i) { n int mn = INF; n for (int j : wo[i]) mn = min(mn, ret[j][i]); n cout << mn << ; n } n cout << std::endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long vis[80]; n long long prime[80] = {0}; n long long a[200000]; n long long fc[80][200000] = {{0}}; n int n; n int pnum; n int get_primes(int m) { n memset(vis, 0, sizeof(vis)); n int cnt = 1; n for (int i = 2; i < m; i++) { n if (!vis[i]) { n prime[cnt++] = i; n for (int j = i * i; j < m; j += i) vis[j] = 1; n } n } n return cnt; n } n void change(long long k, long long g) { n for (int i = 1; i <= pnum;) { n if (k % prime[i] == 0) { n fc[i][g] ^= 1; n k /= prime[i]; n } else n i++; n } n return; n } n long long gauss() { n long long g = 0; n int i, j; n for (j = 1; j <= n && g < pnum; j++) { n for (i = g + 1; i <= pnum; i++) n if (fc[i][j] == 1) break; n if (i <= pnum) { n g++; n for (int p = j; p <= n; p++) swap(fc[g][p], fc[i][p]); n for (int p = g + 1; p <= pnum; p++) { n if (fc[p][j] == 1) { n for (int q = j; q <= n; q++) fc[p][q] ^= fc[g][q]; n } n } n } n } n return g; n } n long long qpow(long long a, long long b, long long m) { n long long ans = 1; n while (b) { n if (b & 1) { n ans = (ans * a) % m; n b--; n } n b /= 2; n a = a * a % m; n } n return ans; n } n int main() { n int cas = 1; n int t = 1; n get_primes(70); n pnum = 19; n { n memset(fc, 0, sizeof(fc)); n cin >> n; n for (int i = 1; i <= n; i++) cin >> a[i], change(a[i], i); n int r = gauss(); n long long ans = qpow(2, (long long)(n - r), 1000000007) - 1; n printf( %lld n , ans); n } n } n "} +{"func_code_string": "#include n using namespace std; n long long MOD = 1e9 + 7; n long long FastPower(long long x, long long y) { n long long res = 1; n x = x % MOD; n while (y > 0) { n if (y & 1) res = (res * x) % MOD; n y = y >> 1; n x = (x * x) % MOD; n } n return res; n } n int main() { n ios::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n long long n, k; n string s; n cin >> s; n n = s.size(); n long long x = 0, y = 0; n y = FastPower(2, n - 1); n for (int i = 0, j = n - 1; i < n; i++, j--) { n if (s[j] == 1 ) { n x += FastPower(2, i); n x %= MOD; n } n } n cout << (x * y) % MOD; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n; n cin >> n; n int b; n map mp; n long long a = -1; n if (n > 1) { n for (int i = 0; i < n; i++) { n cin >> b; n mp[b - i] += b; n a = max(a, mp[b - i]); n } n cout << a; n } else { n cin >> b; n cout << b; n } n } n "} +{"func_code_string": "#include n using namespace std; n string s[100000]; n int u = 0; n char nonu[2][5] = { etr , etra }; n int nonul[2] = {3, 4}; n char adj[2][10] = { lios , liala }; n int adjl[2] = {4, 5}; n char ver[2][10] = { initis , inites }; n int verl[2] = {6, 6}; n bool isn(int v, int &u) { n int len = s[v].length(); n for (int j = 0; j < 2; j++) n if (len >= nonul[j]) { n bool f = false; n for (int i = 0; i < nonul[j]; i++) n if (s[v][len - nonul[j] + i] != nonu[j][i]) { n f = true; n break; n } n if (!f) { n u = j; n return true; n } n } n return false; n } n bool judge(int v) { n int len = s[v].length(); n for (int j = 0; j < 2; j++) n if (len >= nonul[j]) { n bool f = false; n for (int i = 0; i < nonul[j]; i++) n if (s[v][len - nonul[j] + i] != nonu[j][i]) { n f = true; n break; n } n if (!f) return true; n } n for (int j = 0; j < 2; j++) n if (len >= adjl[j]) { n bool f = false; n for (int i = 0; i < adjl[j]; i++) n if (s[v][len - adjl[j] + i] != adj[j][i]) { n f = true; n break; n } n if (!f) return true; n } n for (int j = 0; j < 2; j++) n if (len >= verl[j]) { n bool f = false; n for (int i = 0; i < verl[j]; i++) n if (s[v][len - verl[j] + i] != ver[j][i]) { n f = true; n break; n } n if (!f) return true; n } n return false; n } n bool judge1(int v, int u) { n int len = s[v].length(); n for (int j = 0; j < 2; j++) n if (len >= adjl[j]) { n bool f = false; n for (int i = 0; i < adjl[j]; i++) n if (s[v][len - adjl[j] + i] != adj[j][i]) { n f = true; n break; n } n if (!f) { n if (j != u) n return false; n else n return true; n } n } n for (int j = 0; j < 2; j++) n if (len >= verl[j]) { n bool f = false; n for (int i = 0; i < verl[j]; i++) n if (s[v][len - verl[j] + i] != ver[j][i]) { n f = true; n break; n } n if (!f) return false; n } n return false; n } n bool judge2(int v, int u) { n int len = s[v].length(); n for (int j = 0; j < 2; j++) n if (len >= adjl[j]) { n bool f = false; n for (int i = 0; i < adjl[j]; i++) n if (s[v][len - adjl[j] + i] != adj[j][i]) { n f = true; n break; n } n if (!f) return false; n } n for (int j = 0; j < 2; j++) n if (len >= verl[j]) { n bool f = false; n for (int i = 0; i < verl[j]; i++) n if (s[v][len - verl[j] + i] != ver[j][i]) { n f = true; n break; n } n if (!f) { n if (j != u) n return false; n else n return true; n } n } n return false; n } n int main() { n int n = 0; n while (cin >> s[n]) n++; n if (n == 1 && judge(0)) { n cout << YES << endl; n return 0; n } n bool f = false; n int y = 0; n for (int i = 0; i < n; i++) n if (isn(i, u)) { n y = i; n if (!f) n f = true; n else { n cout << NO << endl; n return 0; n } n } n if (!f) { n cout << NO << endl; n return 0; n } n for (int i = 0; i < y; i++) n if (!judge1(i, u)) { n cout << NO << endl; n return 0; n } n for (int i = y + 1; i < n; i++) n if (!judge2(i, u)) { n cout << NO << endl; n return 0; n } n cout << YES << endl; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int t; n cin >> t; n while (t--) { n long long int n; n cin >> n; n long long int to = 0, thr = 0; n while (n % 2 == 0) { n to++; n n = n / 2; n } n while (n % 3 == 0) { n thr++; n n = n / 3; n } n if (n > 1) { n cout << -1 ; n cout << n ; n } else { n if (to > thr) { n cout << -1 ; n cout << n ; n } else { n cout << 2 * thr - to; n cout << n ; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n inline long long read() { n long long x = 0, f = 1; n char ch = getchar(); n while (!isdigit(ch)) { n if (ch == - ) f = -1; n ch = getchar(); n } n while (isdigit(ch)) { n x = (x << 1) + (x << 3) + ch - 0 ; n ch = getchar(); n } n return x * f; n } n inline long long fast_pow(long long a, long long b, long long p) { n long long t = 1; n a %= p; n while (b) { n if (b & 1) t = t * a % p; n b >>= 1ll; n a = a * a % p; n } n return t; n } n long long inv[1010101], fac[1010101], n, h[1010101], K; n inline long long C(long long n, long long m) { n if (n < 0 || m < 0 || n < m) return 0; n return fac[n] * inv[m] % 998244353 * inv[n - m] % 998244353; n } n int main() { n n = read(), K = read(); n long long ttt = 0; n for (int i = 1; i <= n; i++) { n h[i] = read(); n } n for (int i = 1; i <= n; i++) { n if (h[i] != h[(i + 1 == n + 1) ? 1 : (i + 1)]) ttt++; n } n fac[0] = inv[0] = inv[1] = 1; n for (long long i = 2; i <= n; i++) n inv[i] = (998244353 - (998244353 / i) * inv[998244353 % i] % 998244353) % n 998244353; n for (int i = 2; i <= n; i++) inv[i] = inv[i - 1] * inv[i] % 998244353; n for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % 998244353; n long long ans = 0; n long long inv2 = fast_pow(2ll, 998244353 - 2, 998244353); n for (long long i = 0; i <= ttt; i++) { n ans = n (ans + n C(ttt, i) * fast_pow(K - 2 + 998244353, ttt - i, 998244353) % n 998244353 * n ((fast_pow(2ll, i, 998244353) - ((i % 2 == 1) ? 0 : C(i, i / 2))) * n inv2 % 998244353 + n 998244353) % n 998244353) % n 998244353; n } n cout << ans * fast_pow(K, n - ttt, 998244353) % 998244353; n return 0; n } n "} +{"func_code_string": "#include n int cmp(const void *a, const void *b) { return (*(int *)a - *(int *)b); } n int main() { n char str[100005]; n int i, j, k; n scanf( %s , str); n int l = strlen(str); n int cB = 0, cb = 0, cu = 0, ca = 0, cs = 0, cr = 0, cl = 0; n for (i = 0; i < l; i++) { n if (str[i] == B ) { n cB++; n } else if (str[i] == b ) { n cb++; n } else if (str[i] == u ) { n cu++; n } else if (str[i] == a ) { n ca++; n } else if (str[i] == s ) { n cs++; n } else if (str[i] == l ) { n cl++; n } else if (str[i] == r ) { n cr++; n } else { n continue; n } n } n int arry[5]; n arry[0] = cB; n arry[1] = cs; n arry[2] = cr; n arry[3] = cl; n arry[4] = cb; n qsort(arry, 5, sizeof(int), cmp); n int m1 = arry[0]; n int m2; n if (cu <= ca) { n m2 = cu; n } else { n m2 = ca; n } n int ans; n if (m2 >= 2 * m1) { n ans = m1; n } else if (m2 < 2 * m1) { n ans = m2 / 2; n } n printf( %d n , ans); n return (0); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n cin >> t; n for (int i = 0; i < t; i++) { n int n; n cin >> n; n int a[n]; n for (int j = 1; j <= n; j++) { n a[j] = pow(2, j); n } n int f = 0, s = 0; n for (int j = 1; j <= n; j++) { n if (j < n / 2 || j == n) n f += a[j]; n else { n s += a[j]; n } n } n cout << f - s << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, a[100], b[100]; n scanf( %d %d , &n, &m), a[0] = n - 2, b[0] = m - 2; n for (int i = 1; i < max(n, m); i++) a[i] = b[i] = 2; n if (n == 1) n a[0] = 1; n else if (n == 2) n a[0] = 3, a[1] = 4; n if (m == 1) n b[0] = 1; n else if (m == 2) n b[0] = 3, b[1] = 4; n for (int i = 0; i < n; i++, putchar(10)) n for (int j = 0; j < m; j++) printf( %d , a[i] * b[j]); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int INF = 0x3f3f3f3f; n const int MAXN = 1111111; n const int N = 105; n const int M = 25; n int cmp(int a, int b) { return a > b; } n int n, m, s[N], c[M], t[M], dp[MAXN], st; n void init() { n memset(dp, INF, sizeof(dp)); n scanf( %d , &n); n for (int i = 0; i < n; i++) scanf( %d , &s[i]); n scanf( %d%*c , &m); n for (int j = 0; j < m; j++) scanf( %c%*c%d%*c , &c[j], &t[j]); n } n int DP(int state, int num) { n if (dp[state] != INF) return dp[state]; n int &ans = dp[state]; n ans = 0; n if (c[num] == p ) { n int bit; n for (bit = 0; bit < m; bit++) n if ((state & (1 << bit))) break; n if (t[num] == 1) n ans = (DP((state ^ (1 << bit)), num + 1) + s[bit]); n else n ans = (DP((state ^ (1 << bit)), num + 1) - s[bit]); n } else if (c[num] == b ) { n if (t[num] == 1) n ans = -INF; n else n ans = INF; n for (int i = 0; i < m; i++) { n if ((state & (1 << i))) { n if (t[num] == 1) n ans = (ans) > (DP((state ^ (1 << i)), num + 1)) n ? (ans) n : (DP((state ^ (1 << i)), num + 1)); n else n ans = (ans) < (DP((state ^ (1 << i)), num + 1)) n ? (ans) n : (DP((state ^ (1 << i)), num + 1)); n } n } n } n return ans; n } n void solve() { n sort(s, s + n, cmp); n st = (1 << m) - 1; n printf( %d n , DP(st, 0)); n } n int main() { n init(); n solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n long long a[] = {0, 1, 2, 9, 64, 625, 7776, 117649, 2097152}; n const long long M = 1000000007ll; n int main(void) { n std::ios::sync_with_stdio(false); n long long k, n, m, t; n while (cin >> n >> m) { n n -= m; n t = 1; n k = n; n while (k) { n if (k & 1) t = t * n % M; n n = n * n % M; n k >>= 1; n } n cout << a[m] * t % M << endl; n } n return 0; n } n "} +{"func_code_string": "#include n const long long N = 1e5 + 5; n using namespace std; n struct node { n long long sum[10], lazy[10]; n } lv[4 * N]; n long long n, a[N], q; n void init(long long i, long long l, long long r) { n for (long long k = 0; k < 10; k++) lv[i].lazy[k] = k; n if (l == r) { n long long x = 1, z; n while (a[l] != 0) { n z = a[l] % 10; n lv[i].sum[z] += x; n x *= 10; n a[l] /= 10; n } n return; n } n long long mid = (l + r) / 2; n init(i * 2, l, mid); n init(i * 2 + 1, mid + 1, r); n for (long long k = 0; k < 10; k++) n lv[i].sum[k] = lv[i * 2].sum[k] + lv[i * 2 + 1].sum[k]; n } n void dolazy(long long i, long long l, long long r) { n if (l != r) { n for (long long k = 0; k < 10; k++) { n lv[i * 2].lazy[k] = lv[i].lazy[lv[i * 2].lazy[k]]; n lv[i * 2 + 1].lazy[k] = lv[i].lazy[lv[i * 2 + 1].lazy[k]]; n } n } n long long cur[10]; n for (long long k = 0; k < 10; k++) cur[k] = 0; n for (long long k = 0; k < 10; k++) cur[lv[i].lazy[k]] += lv[i].sum[k]; n for (long long k = 0; k < 10; k++) lv[i].sum[k] = cur[k], lv[i].lazy[k] = k; n } n void update(long long i, long long l, long long r, long long L, long long R, n long long x, long long y) { n dolazy(i, l, r); n if (L > r || l > R) return; n if (L <= l && r <= R) { n lv[i].lazy[x] = y; n dolazy(i, l, r); n return; n } n long long mid = (l + r) / 2; n update(i * 2, l, mid, L, R, x, y); n update(i * 2 + 1, mid + 1, r, L, R, x, y); n for (long long k = 0; k < 10; k++) n lv[i].sum[k] = lv[i * 2].sum[k] + lv[i * 2 + 1].sum[k]; n } n long long get(long long i, long long l, long long r, long long L, long long R) { n dolazy(i, l, r); n if (L > r || l > R) return 0; n if (L <= l && r <= R) { n long long ans = 0; n for (int k = 0; k < 10; k++) ans += lv[i].sum[k] * k; n return ans; n } n long long mid = (l + r) / 2; n return get(i * 2, l, mid, L, R) + get(i * 2 + 1, mid + 1, r, L, R); n } n int main() { n cin >> n >> q; n for (long long i = 1; i <= n; i++) cin >> a[i]; n init(1, 1, n); n while (q--) { n long long query, l, r, x, y; n cin >> query >> l >> r; n if (query == 1) { n cin >> x >> y; n update(1, 1, n, l, r, x, y); n } else { n cout << get(1, 1, n, l, r) << n ; n } n } n } n "} +{"func_code_string": "#include n using namespace std; n void init() { return; } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n init(); n int n; n cin >> n; n long long int a[n]; n for (int i = 0; i < n; i++) { n cin >> a[i]; n } n long long int ans = 0ll, prev = 0ll; n for (int i = 0; i < n; i++) { n long long int temp1 = min(a[i] / 2, prev); n long long int temp2 = (a[i] - 2 * temp1) / 3; n ans += temp1 + temp2; n prev += a[i] - 3 * (temp1 + temp2); n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, m, t; n cin >> n >> m; n vector f; n for (int i = 0; i < m; i++) { n cin >> t; n f.insert(f.begin(), t); n } n for (int i = 0; i < m; i++) { n t = i; n for (int j = i + 1; j < m; j++) n if (f[j] > f[t]) t = j; n swap(f[i], f[t]); n } n t = f[0] - f[n - 1]; n for (int i = 0; i < m - n + 1; i++) { n if ((f[i] - f[i + n - 1]) < t) t = f[i] - f[i + n - 1]; n } n cout << t; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int ALL = (1 << 30) - 1; n int ans[(1 << 22) + 10]; n int a[int(1e6) + 2]; n int n; n void add(int x, int val) { n if (ans[x] != 0) return; n ans[x] = val; n for (int i = 0; i < 22; ++i) add(x & (ALL - (1 << i)), val); n } n void task() { n scanf( %d , &n); n for (int i = 0; i < n; ++i) scanf( %d , &a[i]); n for (int i = 0; i < n; ++i) { n int x = 0; n for (int j = 0; j < 22; ++j) n if (!(a[i] & (1 << j))) x += 1 << j; n add(x, a[i]); n } n for (int i = 0; i < n; ++i) printf( %d , ans[a[i]] ? ans[a[i]] : -1); n } n int main() { n task(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, k; n cin >> n; n string s; n cin >> s; n int l = s.length(), ct = 1; n for (int i = 1; i < l; i++) { n if (s[i] != s[i - 1]) ct++; n } n if (ct >= (n - 1)) n cout << n; n else n cout << ct + 2; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 4e5 + 10; n const int inf = 1e9; n int main() { n ios::sync_with_stdio(false); n string s; n cin >> s; n s = + s; n int i; n int ans = 0; n int sum = 0; n for (i = 1; i < (int)s.size(); i++) { n if (s[i] == M ) { n sum++; n } n if (s[i] == F && sum > 0) { n ans = max(ans + 1, sum); n } n } n cout << ans << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n long long int a, b, c, d, e, f; n cin >> a >> b >> c >> d >> e >> f; n long long int minbcd; n minbcd = min(b, min(c, d)); n long long int cnt; n cnt = minbcd * f; n long long int x; n x = d - minbcd; n cnt = cnt + (min(x, a) * e); n long long int minad; n minad = min(a, d); n long long int cnt1; n cnt1 = minad * e; n long long int y; n y = d - minad; n long long int minbcy; n minbcy = min(b, min(c, y)); n cnt1 = cnt1 + (minbcy * f); n if (cnt >= cnt1) n cout << cnt; n else n cout << cnt1; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n char inp1[100005]; n char inp2[100005]; n char res[100005]; n bool mk[100005]; n bool mk1[100005]; n char getDiff(char a, char b, char c) { n for (int i = 0; i < 26; i++) n if (a != ( a + i) && b != ( a + i) && c != ( a + i)) return ( a + i); n return -1; n } n int main() { n int n, t, s = 0; n cin >> n >> t; n cin >> inp1 >> inp2; n memset(mk, 0, sizeof mk); n memset(mk1, 0, sizeof mk1); n for (int i = 0; i < n; i++) n if (inp1[i] != inp2[i]) s++; n res[n] = 0 ; n if (s > 2 * t) { n cout << -1 << endl; n return 0; n } n if (s <= 2 * t && s >= t) { n int c = 0; n for (int i = 0; i < n; i++) n if (inp1[i] != inp2[i] && c < t) mk[i] = true, c++; n c = 0; n for (int i = n - 1; i >= 0; i--) n if (inp1[i] != inp2[i] && c < t) mk1[i] = true, c++; n for (int i = 0; i < n; i++) { n if (mk[i] == true && mk1[i] == true) n res[i] = getDiff(inp1[i], inp2[i], 0); n else if (mk[i]) n res[i] = inp2[i]; n else if (mk1[i]) n res[i] = inp1[i]; n else n res[i] = inp1[i]; n } n cout << res << endl; n return 0; n } n if (s < t) { n int c = 0; n for (int i = 0; i < n; i++) { n if (inp1[i] != inp2[i]) res[i] = getDiff(inp1[i], inp2[i], 0), c++; n } n for (int i = 0; i < n; i++) { n if (inp1[i] == inp2[i] && c < t) n res[i] = getDiff(inp1[i], inp2[i], 0), c++; n else if (inp1[i] == inp2[i]) n res[i] = inp1[i]; n } n cout << res << endl; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int m, n, k; n pair ptsx[100005]; n pair ptsy[100005]; n bool removed[100005]; n long long get(int l, int r, int u, int d, int dep) { n while (removed[ptsx[l].second]) l++; n while (removed[ptsx[r].second]) r--; n while (removed[ptsy[u].second]) u++; n while (removed[ptsy[d].second]) d--; n if (dep == k) { n long long xd = ptsx[r].first - ptsx[l].first; n long long yd = ptsy[d].first - ptsy[u].first; n if (xd == 0) xd++; n if (yd == 0) yd++; n return ((xd + 1) / 2) * ((yd + 1) / 2); n } n long long ans = (1LL) << 62; n removed[ptsx[l].second] = true; n ans = min(ans, get(l + 1, r, u, d, dep + 1)); n removed[ptsx[l].second] = false; n removed[ptsx[r].second] = true; n ans = min(ans, get(l, r - 1, u, d, dep + 1)); n removed[ptsx[r].second] = false; n removed[ptsy[u].second] = true; n ans = min(ans, get(l, r, u + 1, d, dep + 1)); n removed[ptsy[u].second] = false; n removed[ptsy[d].second] = true; n ans = min(ans, get(l, r, u, d - 1, dep + 1)); n removed[ptsy[d].second] = false; n return ans; n } n int main() { n ios_base::sync_with_stdio(0); n cout << fixed << setprecision(12); n cin >> n >> k; n for (int i = 0, _i = (n); i < _i; ++i) { n int x1, y1, x2, y2; n cin >> x1 >> y1 >> x2 >> y2; n ptsx[i] = make_pair(x1 + x2, i); n ptsy[i] = make_pair(y1 + y2, i); n } n sort(ptsx, ptsx + n); n sort(ptsy, ptsy + n); n cout << get(0, n - 1, 0, n - 1, 0) << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n using ld = long double; n using pii = pair; n using pil = pair; n using pli = pair; n using pll = pair; n const ll MOD = 1e9 + 7; n const int inf = (1 << 30) - 1; n const ll INF = (1LL << 60) - 1; n const ld EPS = 1e-10; n template n bool chmax(T &x, const T &y) { n return (x < y) ? (x = y, true) : false; n }; n template n bool chmin(T &x, const T &y) { n return (x > y) ? (x = y, true) : false; n }; n int main() { n int T; n cin >> T; n while (T--) { n int N, K, L; n cin >> N >> K >> L; n int d[N]; n for (int i = 0; i < N; i++) { n cin >> d[i]; n d[i] = L - d[i]; n } n int pos = -inf; n bool ans = true; n for (int i = 0; i < N; i++) { n if (d[i] < 0) { n ans = false; n break; n } else if (d[i] >= K) n pos = -inf; n else if (pos == -inf) n pos = -d[i]; n else if (d[i] <= pos) { n ans = false; n break; n } else if (pos < -d[i]) n pos = -d[i]; n else n pos++; n } n cout << (ans ? Yes : No ) << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n set f, l, s; n long long sf = 0, sl = 0; n long long ksum = 0, cnt = 0, kmin = 0; n void update(long long b, long long t) { n int c = l.size(); n if (t == 1) n s.insert(b); n else n s.erase(b); n if (c == 1 && cnt == 0) { n ksum = kmin = *s.rbegin(); n cnt = 1; n return; n } n if (c > cnt) { n if (b > kmin) { n ksum += b; n } else { n kmin = *(--s.find(kmin)); n ksum += kmin; n } n cnt++; n } else if (c < cnt) { n ksum -= max(b, kmin); n if (b <= kmin) { n kmin = *s.upper_bound(kmin); n } n cnt--; n } else { n if (c == 0) return; n if (b >= kmin) { n if (t == 1) { n ksum += b - kmin; n kmin = *s.upper_bound(kmin); n } else { n kmin = *(--s.lower_bound(kmin)); n ksum -= b - kmin; n } n } n } n } n int main() { n ios::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n int n; n cin >> n; n while (n--) { n long long a, b; n cin >> a >> b; n if (a == 0) { n if (b < 0) { n f.erase(f.find(-b)); n } else { n f.insert(b); n } n sf += b; n } else { n if (b < 0) { n l.erase(l.find(-b)); n } else { n l.insert(b); n } n sl += b; n } n if (b < 0) n update(-b, -1); n else n update(b, 1); n if (l.size() == 0) { n cout << sf << endl; n } else if (f.size() == 0) { n cout << 2 * sl - *l.begin() << endl; n } else { n if (*f.rbegin() > *l.begin()) { n cout << sf + sl + ksum << endl; n } else { n cout << sf + 2 * sl - *l.begin() + *f.rbegin() << endl; n } n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int t; n scanf( %d , &t); n int ji = 0; n while (t--) { n int n; n scanf( %d , &n); n int arr[n + 1]; n int brr[n + 1]; n memset(arr, 0, sizeof(arr)); n memset(brr, 0, sizeof(brr)); n int ls; n int size = 0; n for (int a = 0; a < n; a++) { n scanf( %d , &ls); n if (arr[ls] == 0) { n brr[size] = ls; n size++; n } n arr[ls]++; n } n int min = n; n for (int a = 0; a < size; a++) { n if (arr[brr[a]] < min) { n min = arr[brr[a]]; n } n } n int num = n; n int bo = true; n for (int a = 2; a < min + 2; a++) { n ls = 0; n bo = true; n for (int b = 0; b < size; b++) { n int tt = arr[brr[b]] / a + 1; n if (arr[brr[b]] % a == 0) { n ls = ls + arr[brr[b]] / a; n } else if (arr[brr[b]] >= (tt * (a - 1)) && arr[brr[b]] <= (tt * a)) { n ls = ls + tt; n } else { n bo = false; n break; n } n } n if (bo && num > ls) { n num = ls; n } n } n printf( %d n , num); n } n } n "} +{"func_code_string": "#include n int n, k, m, c, arr[100005], ans; n inline void check() { n int i = 0; n while (i < m) { n if (arr[i] == i + 1) n i++; n else n break; n } n if (i) n c += (m - i + 1), ans += (m - i); n else n c += m, ans += (m - 1); n } n int main() { n scanf( %d %d , &n, &k); n ans = c = 0; n while (k--) { n scanf( %d , &m); n for (int i = 0; i < m; ++i) scanf( %d , &arr[i]); n check(); n } n ans += (c - 1); n printf( %d , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using ll = long long; n template n void chmax(t& first, u second) { n if (first < second) first = second; n } n template n void chmin(t& first, u second) { n if (second < first) first = second; n } n template n using vc = vector; n template n using vvc = vc>; n using pi = pair; n using vi = vc; n template n ostream& operator<<(ostream& os, const pair& p) { n return os << { << p.first << , << p.second << } ; n } n template n ostream& operator<<(ostream& os, const vc& v) { n os << { ; n for (auto e : v) os << e << , ; n return os << } ; n } n using uint = unsigned; n using ull = unsigned long long; n template n void print_tuple(ostream&, const T&) {} n template n void print_tuple(ostream& os, const T& t) { n if (i) os << , ; n os << get(t); n print_tuple(os, t); n } n template n ostream& operator<<(ostream& os, const tuple& t) { n os << { ; n print_tuple<0, tuple, Args...>(os, t); n return os << } ; n } n void print(ll x, ll suc = 1) { n cout << x; n if (suc == 1) cout << n ; n if (suc == 2) cout << ; n } n ll read() { n ll i; n cin >> i; n return i; n } n vi readvi(ll n, ll off = 0) { n vi v(n); n for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off; n return v; n } n template n void print(const vector& v, ll suc = 1) { n for (ll i = ll(0); i < ll(v.size()); i++) n print(v[i], i == ll(v.size()) - 1 ? suc : 2); n } n string readString() { n string s; n cin >> s; n return s; n } n template n T sq(const T& t) { n return t * t; n } n void yes(bool ex = true) { n cout << Yes << endl; n if (ex) exit(0); n } n void no(bool ex = true) { n cout << No << endl; n if (ex) exit(0); n } n constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; } n const ll infLL = LLONG_MAX / 3; n const ll inf = infLL; n ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } n ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } n ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); } n ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); } n ll popcount(signed t) { return __builtin_popcount(t); } n ll popcount(ll t) { return __builtin_popcountll(t); } n bool ispow2(ll i) { return i && (i & -i) == i; } n ll mask(ll i) { return (ll(1) << i) - 1; } n bool inc(ll first, ll second, ll c) { return first <= second && second <= c; } n template n void mkuni(vc& v) { n sort(v.begin(), v.end()); n v.erase(unique(v.begin(), v.end()), v.end()); n } n ll rand_int(ll l, ll r) { n static random_device rd; n static mt19937_64 gen(rd()); n return uniform_int_distribution(l, r)(gen); n } n void priv(vi s) { n cout << s.size(); n for (auto i : s) cout << << i + 1; n cout << endl; n } n ll ask(vi s, vi t, ll v) { n static ll num = 0; n num++; n assert(num <= 11111); n priv(s); n priv(t); n cout << v + 1 << endl; n ll res; n cin >> res; n return res; n } n void answer(vc ans) { n cout << ANSWER << endl; n for (auto e : ans) cout << e.first + 1 << << e.second + 1 << endl; n } n const ll nmax = 510; n vi t[nmax]; n bool rem[nmax]; n ll tsize(ll v, ll p) { n ll ret = 1; n for (auto to : t[v]) n if (to != p && !rem[to]) ret += tsize(to, v); n return ret; n } n ll findc(ll v, ll p, ll s) { n ll ret = 1, mx = 0; n for (auto to : t[v]) n if (to != p && !rem[to]) { n ll f = findc(to, v, s); n if (f <= 0) n return f; n else { n ret += f; n chmax(mx, f); n } n } n chmax(mx, s - ret); n if (mx * 2 <= s) n return -v; n else n return ret; n } n signed main() { n cin.tie(0); n ios::sync_with_stdio(0); n cout << fixed << setprecision(20); n ll n; n cin >> n; n vi sz(n); n for (ll i = ll(1); i < ll(n); i++) { n vi s{0}; n vi tmp(n - 1); n iota(tmp.begin(), tmp.end(), 1); n sz[i] = ask(s, tmp, i); n } n vi idx(n - 1); n iota(idx.begin(), idx.end(), 1); n sort(idx.begin(), idx.end(), [&](ll i, ll j) { return sz[i] > sz[j]; }); n vc ans; n for (auto i : idx) { n memset(rem, 0, sizeof(rem)); n ll cur = 0; n while (1) { n cur = -findc(cur, -1, tsize(cur, -1)); n vi vs; n for (auto to : t[cur]) n if (!rem[to]) vs.push_back(to); n ll lw = 0, up = vs.size() + 1; n while (up - lw > 1) { n const ll m = (lw + up) / 2; n vi s(vs.begin(), vs.begin() + m); n if (ask(s, {i}, cur) < m) n up = m; n else n lw = m; n } n if (lw == (ll)vs.size()) break; n rem[cur] = true; n cur = vs[lw]; n } n t[cur].push_back(i); n t[i].push_back(cur); n ans.emplace_back(cur, i); n } n answer(ans); n } n "} +{"func_code_string": "#include n using namespace std; n const double eps = 1e-10; n struct point { n double x, y; n }; n struct segment { n double a, b, c; n }; n point operator+(point a, point b) { return (point){a.x + b.x, a.y + b.y}; } n point operator-(point a, point b) { return (point){a.x - b.x, a.y - b.y}; } n double operator*(point a, point b) { return a.x * b.x + a.y * b.y; } n double operator/(point a, point b) { return a.x * b.y - a.y * b.x; } n point operator*(point a, double b) { return (point){a.x * b, a.y * b}; } n point operator/(point a, double b) { return (point){a.x / b, a.y / b}; } n int T; n point I, J, K, L; n segment midline(point A, double a, double b) { n segment line; n line.a = b; n line.b = -a; n line.c = -(A.x * line.a + A.y * line.b); n return line; n } n point getpoint(segment A, segment B) { n point C; n C.x = (-A.c * B.b + B.c * A.b) / (A.a * B.b - B.a * A.b); n C.y = (-A.a * B.c + B.a * A.c) / (A.a * B.b - B.a * A.b); n return C; n } n point mirror(point A, point B) { n point C; n C = A + (B - A) * 2; n return C; n } n int zero1(double x) { return x > eps; } n int zero0(double x) { return x < -eps; } n int solve(point A, point B, point C) { n point D, E, F, G, H; n point IJ, JK, KL, LI; n segment lineAC, lineBC, lineD, lineE, lineHG; n bool ans; n ans = false; n lineAC = (segment){A.y - C.y, C.x - A.x, A / C}; n lineBC = (segment){B.y - C.y, C.x - B.x, B / C}; n D = (A + C) / 2; n E = (B + C) / 2; n lineD = midline(D, lineAC.a, lineAC.b); n lineE = midline(E, lineBC.a, lineBC.b); n F = getpoint(lineD, lineE); n G = mirror(E, C); n H = mirror(F, C); n lineHG = (segment){H.y - G.y, G.x - H.x, H / G}; n I = getpoint(lineHG, lineD); n J = mirror(I, C); n K = mirror(J, B); n L = mirror(I, A); n IJ = J - I; n JK = K - J; n KL = L - K; n LI = I - L; n if (zero1(IJ / JK) && zero1(JK / KL) && zero1(KL / LI) && zero1(LI / IJ)) n ans = true; n if (zero0(IJ / JK) && zero0(JK / KL) && zero0(KL / LI) && zero0(LI / IJ)) n ans = true; n return ans; n } n void print() { n printf( YES n%.9lf %.9lf %.9lf %.9lf %.9lf %.9lf %.9lf %.9lf n , I.x, I.y, n J.x, J.y, K.x, K.y, L.x, L.y); n } n int main() { n point A, B, C; n scanf( %d , &T); n while (T--) { n scanf( %lf%lf%lf%lf%lf%lf , &A.x, &A.y, &B.x, &B.y, &C.x, &C.y); n if (solve(A, B, C)) n print(); n else if (solve(A, C, B)) n print(); n else if (solve(B, C, A)) n print(); n else n printf( NO n ); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n; n int a[111]; n int memo[111][1 << 17]; n pair, int> child[111][1 << 17]; n int bt[66]; n class MathFunction { n private: n long long sieve_size; n bitset<1010> bs; n vector primes; n n public: n int primeid[1010]; n bool isPrime(long long N) { n if (N <= sieve_size) return bs[N]; n for (int i = 0; i < (int)primes.size(); i++) n if (N % primes[i] == 0) return false; n return true; n } n void sieve(long long upperbound) { n sieve_size = upperbound + 1; n bs.set(); n bs[0] = bs[1] = 0; n for (long long i = 2; i < sieve_size; i++) { n if (bs[i]) { n for (long long j = i * i; j < sieve_size; j += i) bs[j] = 0; n primeid[(int)i] = primes.size(); n primes.push_back((int)i); n } n } n } n vector primeFactors(long long N) { n vector factors; n long long idx = 0, pf = primes[idx]; n while (N != 1 && (pf * pf <= N)) { n while (N % pf == 0) { n N /= pf; n factors.push_back(pf); n } n pf = primes[++idx]; n } n if (N != 1) factors.push_back(N); n return factors; n } n }; n MathFunction mat; n int dp(int pos, int bitmask) { n if (pos == n) return 0; n if (memo[pos][bitmask] >= 0) return memo[pos][bitmask]; n int q = abs(1 - a[pos]) + dp(pos + 1, bitmask); n child[pos][bitmask] = n pair, int>(pair(pos + 1, bitmask), 1); n for (int i = 2; i < a[pos] + a[pos]; i++) { n if ((bitmask & bt[i]) == 0) { n int d = abs(i - a[pos]) + dp(pos + 1, bitmask | bt[i]); n if (d < q) { n q = d; n child[pos][bitmask] = pair, int>( n pair(pos + 1, bitmask | bt[i]), i); n } n } n } n return memo[pos][bitmask] = q; n } n void printAns(int pos, int bitmask) { n if (pos == n) return; n pair nx = child[pos][bitmask].first; n int val = child[pos][bitmask].second; n printf( %d , val); n printAns(nx.first, nx.second); n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n; i++) { n scanf( %d , &a[i]); n } n mat.sieve(100); n bt[1] = 0; n for (int i = 2; i <= 61; i++) { n vector v = mat.primeFactors(i); n int b = 0; n for (int j = 0; j < v.size(); j++) { n if (mat.primeid[v[j]] <= 15) b |= (1 << mat.primeid[v[j]]); n } n bt[i] = b; n } n memset(memo, -1, sizeof memo); n dp(0, 0); n printAns(0, 0); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n using namespace std; n const long long mod2 = 998244353; n long long fpow(long long x, long long y) { n x = x % 1000000007; n long long sum = 1; n while (y) { n if (y & 1) sum = sum * x; n sum %= 1000000007; n y = y >> 1; n x = x * x; n x %= 1000000007; n } n return sum; n } n long long inv(long long a, long long m = 1000000007) { n long long c = m; n long long y = 0, x = 1; n if (m == 1) return 0; n while (a > 1) { n long long q = a / m; n long long t = m; n m = a % m, a = t; n t = y; n y = x - q * y; n x = t; n } n if (x < 0) x += c; n return x; n } n long long gcd(long long a, long long b) { n if (!a) return b; n return gcd(b % a, a); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n cout.tie(0); n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); n long long n; n cin >> n; n vector a(n); n for (int i = 0; i < n; i++) cin >> a[i]; n long long res = 1; n for (int i = 0; i < 10; i++) { n long long ele = a[rng() % n]; n vector div, cnt; n for (long long j = 1; j * j <= ele; j++) { n if ((ele % j) == 0) { n if (j * j == ele) { n div.push_back(j); n cnt.push_back(0); n } else { n div.push_back(j); n cnt.push_back(0); n div.push_back(ele / j); n cnt.push_back(0); n } n } n } n sort(div.begin(), div.end()); n for (int j = 0; j < n; j++) { n long long g = gcd(ele, a[j]); n cnt[lower_bound(div.begin(), div.end(), g) - div.begin()]++; n } n for (int j = 0; j < div.size(); j++) { n for (int k = j + 1; k < div.size(); k++) { n if (div[k] % div[j] == 0) cnt[j] += cnt[k]; n } n if (2 * cnt[j] >= n) res = max(res, div[j]); n } n } n cout << res << n ; n } n "} +{"func_code_string": "#include n #define int long long n #define mod 1000000007 n #define inv 500000004 n n using namespace std; n n int ksm(int a, int b) { n int ans = 1, base = a % mod; n while (b) { n if (b & 1) ans = (ans * base) % mod; n base = (base * base) % mod; n b /= 2; n } n return ans % mod; n } n n struct Edge{ n int to; n int next; n }; n n Edge edge[405]; n int head[205], cnt = 0; n n void add(int u, int v) { n cnt++; n edge[cnt].to = v; n edge[cnt].next = head[u]; n head[u] = cnt; n } n n int n, fa[205][25], f[205][205], dep[205]; n n void dfs(int u, int fath) { n for (int i = head[u]; i; i = edge[i].next) { n int v = edge[i].to; n if (v == fath) continue; n dep[v] = dep[u] + 1; n fa[v][0] = u; n for (int j = 1; j <= 22; j++) { n fa[v][j] = fa[fa[v][j - 1]][j - 1]; n } n dfs(v, u); n } n } n n int lca(int x, int y) { n if (dep[x] < dep[y]) swap(x, y); n for (int i = 22; i >= 0; i--) { n if (dep[fa[x][i]] >= dep[y]) { n x = fa[x][i]; n } n } n if (x == y) return x; n for (int i = 22; i >= 0; i--) { n if (fa[x][i] != fa[y][i]) { n x = fa[x][i]; y = fa[y][i]; n } n } n return fa[x][0]; n } n n signed main() { n cin >> n; n for (int i = 1; i < n; i++) { n int u, v; n cin >> u >> v; n add(u, v); add(v, u); n } n for (int i = 1; i <= n; i++) f[0][i] = 1; n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= n; j++) { n f[i][j] = ((f[i - 1][j] + f[i][j - 1]) % mod * inv % mod) % mod; n } n } n int ans = 0; n for (int rt = 1; rt <= n; rt++) { n memset(dep, 0, sizeof dep); n memset(fa, 0, sizeof fa); n dep[rt] = 1; n dfs(rt, 0); n for (int i = 1; i <= n; i++) { n for (int j = 1; j <= i - 1; j++) { n int LCA = lca(i, j); n ans = (ans % mod + f[dep[i]-dep[LCA]][dep[j]-dep[LCA]] % mod) % mod; n } n } n } n cout << (ans % mod * ksm(n, mod - 2) % mod) % mod; n return 0; n } n n "} +{"func_code_string": "#include n using namespace std; n template n inline bool umin(T1& x, const T2& y) { n return x > y ? x = y, true : false; n } n template n inline bool umax(T1& x, const T2& y) { n return x < y ? x = y, true : false; n } n const int N = (int)5e2 + 5; n const int INF = (int)1e9 + 17; n const long long LLINF = (long long)1e18 + 17; n const int mod = 998244353; n inline void add(int& x, int y) { x = (x + y >= mod ? x + y - mod : x + y); } n inline int mul(int x, int y) { return 1ll * x * y % mod; } n int n, m; n int cnt[N]; n int nxt[N][N]; n int prv[N][N]; n int32_t main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr), cout.tie(nullptr); n cin >> n >> m; n prv[0][0] = 1; n for (int total = (0); total < (n); ++total) { n for (int maxEqual = (0); maxEqual < (total + 1); ++maxEqual) { n for (int equal = (0); equal < (total + 1); ++equal) { n if (prv[maxEqual][equal] == 0) continue; n add(nxt[max(maxEqual, equal + 1)][equal + 1], prv[maxEqual][equal]); n add(nxt[max(maxEqual, 1)][1], prv[maxEqual][equal]); n } n } n memcpy(prv, nxt, sizeof nxt); n memset(nxt, 0, sizeof nxt); n } n for (int maxEqual = (0); maxEqual < (n + 1); ++maxEqual) { n for (int equal = (0); equal < (maxEqual + 1); ++equal) { n add(cnt[maxEqual], prv[maxEqual][equal]); n } n } n int answer = 0; n for (int a = (0); a < (n + 1); ++a) n for (int b = (0); b < (n + 1); ++b) { n if (a * b >= m) continue; n add(answer, mul(cnt[a], cnt[b])); n } n if (answer % 2 == 0) n answer /= 2; n else n answer = (answer + mod) / 2; n cout << answer << endl; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxn = 100010; n const long long INF = (long long)1 << 60; n long long x[maxn], y[maxn], n; n inline long long sqr(long long x) { return x * x; } n long long p[maxn], cnt; n long long ans; n bool cmpy(int a, int b) { return y[a] < y[b]; } n void solve(int l, int r) { n if (l == r) return; n int m = (l + r) >> 1; n solve(l, m); n solve(m + 1, r); n cnt = 0; n for (int i = l; i <= r; i++) { n if (sqr(x[m] - x[i]) >= ans) continue; n p[cnt++] = i; n } n sort(p, p + cnt, cmpy); n for (int i = 0; i < cnt; i++) { n for (int j = i + 1; j < cnt && sqr(y[p[j]] - y[p[i]]) < ans; j++) n ans = min(ans, sqr(y[p[j]] - y[p[i]]) + sqr(x[p[j]] - x[p[i]])); n } n } n int main() { n scanf( %lld , &n); n y[0] = 0; n for (int i = 1; i <= n; i++) scanf( %lld , &y[i]), x[i] = i, y[i] += y[i - 1]; n ans = INF; n solve(1, n); n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int maxsize = 100005; n const int inf = 1061109567; n vector edge[maxsize]; n vector > base[maxsize]; n int nnext[maxsize]; n int n; n int deepth[maxsize]; n int siz[maxsize]; n int last = 0; n int ans[10 * maxsize]; n int cnt = 0; n void dfs1(int u) { n if (edge[u].size() == 0) { n deepth[u] = 1; n return; n } n int maxi = 0; n for (auto v : edge[u]) { n siz[v] = siz[u] + 1; n dfs1(v); n maxi = max(deepth[v], maxi); n base[u].push_back({deepth[v], v}); n } n deepth[u] = maxi + 1; n sort(base[u].begin(), base[u].end()); n return; n } n void dfs2(int u) { n for (auto v : base[u]) { n nnext[last] = v.second; n last = v.second; n printf( %d , v.second); n dfs2(v.second); n } n return; n } n int main() { n scanf( %d , &n); n for (int i = 0; i < n - 1; i++) { n int u; n scanf( %d , &u); n edge[u].push_back(i + 1); n } n dfs1(0); n printf( 0 ); n dfs2(0); n puts( ); n int gg = 0; n while (nnext[gg]) { n int r = siz[gg] - siz[nnext[gg]] + 1; n for (int i = 0; i < r; i++) ans[cnt++] = nnext[gg]; n gg = nnext[gg]; n } n printf( %d n , cnt); n for (int i = 0; i < cnt; i++) printf( %d , ans[i]); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, cnt = 0, i; n char str[10], o[5]; n scanf( %d , &n); n scanf( %s , o); n for (i = 0; i < n; i++) { n scanf( %s , str); n if (str[5] == o[0] && str[6] == o[1] && str[7] == o[2]) cnt++; n if (str[0] == o[0] && str[1] == o[1] && str[2] == o[2]) cnt++; n } n if (cnt % 2) n printf( contest n ); n else n printf( home n ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void input(vector& v, long n) { n for (long long i = 0; i < n; i++) { n long long in; n cin >> in; n v.push_back(in); n } n } n void output(vector v) { n for (long long i = 0; i < v.size(); i++) cout << v[i] << ; n } n long long max_of_three(long long a, long long b, long long c) { n if (a >= b && a >= c) n return a; n else if (b >= a && b >= c) n return b; n else n return c; n } n long long max_of_4(long long a, long long b, long long c, long long d) { n if (a >= b && a >= c && a >= d) n return a; n else if (b >= a && b >= c && b >= d) n return b; n else if (c >= a && c >= d && c >= b) n return c; n else n return d; n } n map frequency(vector v) { n map m; n for (long long i = 0; i < v.size(); i++) { n if (m.find(v[i]) != m.end()) n m[v[i]]++; n else { n m.insert({v[i], 1}); n } n } n return m; n } n long long max_occuring_int(std::map m) { n long long max_x = 0; n long long i = 0, n = m.size(); n std::map::iterator it = m.begin(); n for (i = 0; i < n; i++) { n if (it->second > max_x) max_x = it->second; n it++; n } n return max_x; n } n vector give_unique_in_vector(vector v) { n sort((v).begin(), (v).end()); n auto it = unique((v).begin(), (v).end()); n v.resize(std::distance(v.begin(), it)); n vector x = v; n return x; n } n bool isVowel(char c) { n return (c == a | c == e || c == i || c == o || c == u || c == y || n c == A || c == E || c == I || c == O || c == U || c == Y ); n } n string removeWord(string str, string word) { n if (str.find(word) != string::npos) { n size_t p = -1; n string tempWord = word + ; n while ((p = str.find(word)) != string::npos) n str.replace(p, tempWord.length(), ); n tempWord = + word; n while ((p = str.find(word)) != string::npos) n str.replace(p, tempWord.length(), ); n } n return str; n } n long long calc(long long i, long long j, long long n) { n return (i + 1 - 1) * n + j + 1; n } n bool compare_descending(long long a, long long b) { return a > b; } n void solve() { n long long n, k; n cin >> n >> k; n vector v; n input(v, n); n long long max_change_of_min = *min_element((v).begin(), (v).end()) + k; n long long price = max_change_of_min; n for (long long i = 0; i < (long long)(n); ++i) { n long long low = v[i] - k; n long long high = v[i] + k; n if (low <= 0) low = 1; n if (price >= low && price <= high) { n } else { n cout << -1 n ; n return; n } n } n cout << price << endl; n ; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n long long test; n cin >> test; n while (test--) solve(); n return 0; n } n "} +{"func_code_string": "#include n #pragma GCC optimize(2) n using namespace std; n const int maxn = 100001, inf = 2147483647; n const long long mod = 1 ? 998244353 : 1000000007, linf = 9223372036854775807; n const double pi = acos(-1); n inline long long mi(long long a, long long b, long long mm = mod) { n a %= mm; n long long u = 1; n while (b) { n if (b & 1) u = u * a % mm; n a = a * a % mm, b >>= 1; n } n return u; n } n inline long long gcd(long long a, long long b) { n long long c = a % b; n while (c) a = b, b = c, c = a % b; n return b; n } n inline void mem(int* a, int p = 0, int len = maxn) { n for (int i = 0; i < len; i++) a[i] = p; n } n struct p { n } e; n int t, n, a[maxn], b[maxn], x, m; n signed main() { n ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); n cin >> t; n while (t--) { n x = 0; n b[0] = 10000, b[1] = 0; n cin >> n >> m; n for (int i = 0; i < n; i++) n for (int j = 0; j < m; j++) n cin >> a[0], x += abs(a[0]), b[0] = min(b[0], abs(a[0])), n b[1] += a[0] < 0; n cout << x - 2 * b[0] * (b[1] % 2) << endl; n } n } n "} +{"func_code_string": "#include n using namespace std; n int N; n int A[5005]; n int DP[5005][5005]; n void Read() { n scanf( %d , &N); n for (int i = 1; i <= N; i++) scanf( %d , &A[i]); n } n void precalcDP() { n for (int i = 1; i <= N; i++) { n for (int j = i; j <= N; j++) DP[i][j - i] = A[j]; n for (int k = 0; (1 << k) <= N; k++) n for (int j = 0; j < N; j++) n if ((j & (1 << k)) != 0) DP[i][j] ^= DP[i][j ^ (1 << k)]; n } n for (int j = 1; j <= N; j++) { n for (int i = 1; j + i <= N; i++) n DP[i][j] = max(DP[i][j], max(DP[i][j - 1], DP[i + 1][j - 1])); n } n } n void Query(int a, int b) { n int dist = b - a; n printf( %d n , DP[a][dist]); n } n int main() { n Read(); n precalcDP(); n int Q; n scanf( %d , &Q); n for (int i = 1; i <= Q; i++) { n int x, y; n scanf( %d%d , &x, &y); n Query(x, y); n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int n, m, i, j, k, t, s, x, y, h[100005], hh[100005], d, l; n int main() { n cin >> n; n for (i = 0; i < n; i++) scanf( %d , h + i); n m = h[n - 1]; n for (i = n - 2; i >= 0; i--) { n if (h[i] <= m) n hh[i] = m - h[i] + 1; n else n m = h[i]; n } n for (i = 0; i < n; i++) printf( %d , hh[i]); n } n "} +{"func_code_string": "#include n using namespace std; n template n std::istream& operator>>(std::istream& i, pair& p) { n i >> p.first >> p.second; n return i; n } n template n std::istream& operator>>(std::istream& i, vector& t) { n for (auto& v : t) { n i >> v; n } n return i; n } n template n std::ostream& operator<<(std::ostream& o, const pair& p) { n o << p.first << << p.second; n return o; n } n template n std::ostream& operator<<(std::ostream& o, const vector& t) { n if (t.empty()) o << n ; n for (size_t i = 0; i < t.size(); ++i) { n o << t[i] << n [i == t.size() - 1]; n } n return o; n } n template n using minheap = priority_queue, greater>; n template n using maxheap = priority_queue, less>; n template n bool in(T a, T b, T c) { n return a <= b && b < c; n } n unsigned int logceil(int first) { n return 8 * sizeof(int) - __builtin_clz(first); n } n namespace std { n template n struct hash> { n hash t; n hash u; n size_t operator()(const pair& p) const { n return t(p.first) ^ (u(p.second) << 7); n } n }; n } // namespace std n template n T bsh(T l, T h, const F& f) { n T r = -1, m; n while (l <= h) { n m = (l + h) / 2; n if (f(m)) { n l = m + 1; n r = m; n } else { n h = m - 1; n } n } n return r; n } n template n double bshd(double l, double h, const F& f, double p = 1e-9) { n unsigned int r = 3 + (unsigned int)log2((h - l) / p); n while (r--) { n double m = (l + h) / 2; n if (f(m)) { n l = m; n } else { n h = m; n } n } n return (l + h) / 2; n } n template n T bsl(T l, T h, const F& f) { n T r = -1, m; n while (l <= h) { n m = (l + h) / 2; n if (f(m)) { n h = m - 1; n r = m; n } else { n l = m + 1; n } n } n return r; n } n template n double bsld(double l, double h, const F& f, double p = 1e-9) { n unsigned int r = 3 + (unsigned int)log2((h - l) / p); n while (r--) { n double m = (l + h) / 2; n if (f(m)) { n h = m; n } else { n l = m; n } n } n return (l + h) / 2; n } n template n T gcd(T a, T b) { n if (a < b) swap(a, b); n return b ? gcd(b, a % b) : a; n } n template n class vector2 : public vector> { n public: n vector2() {} n vector2(size_t a, size_t b, T t = T()) n : vector>(a, vector(b, t)) {} n }; n template n class vector3 : public vector> { n public: n vector3() {} n vector3(size_t a, size_t b, size_t c, T t = T()) n : vector>(a, vector2(b, c, t)) {} n }; n template n class vector4 : public vector> { n public: n vector4() {} n vector4(size_t a, size_t b, size_t c, size_t d, T t = T()) n : vector>(a, vector3(b, c, d, t)) {} n }; n template n class vector5 : public vector> { n public: n vector5() {} n vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T()) n : vector>(a, vector4(b, c, d, e, t)) {} n }; n template n struct NoOp { n void setup(unsigned int) {} n void op(F& p, F n, unsigned int, unsigned int) { p = n; } n void down(F&, F&, F&, unsigned int, unsigned int) {} n }; n template n struct Lazy { n void setup(unsigned int s) { n this->s = s; n L = new F[s](); n } n void down(F& u, F& l, F& r, unsigned int i, unsigned int s) { n op(l, L[i], i << 1, s >> 1); n op(r, L[i], i << 1 | 1, s >> 1); n L[i] = 0; n } n void op(F& p, F n, unsigned int i, unsigned int s) { n p = sop(p, pop(n, s)); n if (i < this->s) this->L[i] = sop(this->L[i], n); n } n SetOp sop; n PowerOp pop; n F* L; n unsigned int s; n }; n template > n struct SegTree { n void setup(unsigned int s, F def) { n n = 1 << logceil(s); n T = vector(2 * n, def); n for (unsigned int i = n - 1; i > 0; i--) n T[i] = cop(T[i << 1], T[i << 1 | 1]); n mop.setup(2 * n); n } n void setup(vector& data, F def = F()) { n n = 1 << logceil(data.size()); n T = vector(2 * n, def); n copy(data.begin(), data.end(), T.begin() + n); n for (unsigned int i = n - 1; i > 0; i--) n T[i] = cop(T[i << 1], T[i << 1 | 1]); n mop.setup(2 * n); n } n inline void put(unsigned int first, F n) { put(first, first, n); } n inline void put(unsigned int from, unsigned int to, F v) { n put2(from, to + 1, v, 1, n); n } n inline F get(unsigned int first) { return get(first, first); } n inline F get(unsigned int from, unsigned int to) { n return get2(from, to + 1, 1, n); n } n void put2(unsigned int from, unsigned int to, F v, unsigned int i, n unsigned int s) { n if (from == 0 && to == s) { n mop.op(T[i], v, i, s); n return; n } n mop.down(T[i], T[i << 1], T[i << 1 | 1], i, s); n s >>= 1; n i <<= 1; n if (to <= s) { n put2(from, to, v, i, s); n } else if (from >= s) { n put2(from - s, to - s, v, i | 1, s); n } else { n put2(from, s, v, i, s); n put2(0, to - s, v, i | 1, s); n } n T[i >> 1] = cop(T[i], T[i | 1]); n } n F get2(unsigned int from, unsigned int to, unsigned int i, unsigned int s) { n while (true) { n if (from == 0 && to == s) return T[i]; n mop.down(T[i], T[i << 1], T[i << 1 | 1], i, s); n s >>= 1; n i <<= 1; n if (to > s) { n to -= s; n if (from >= s) { n from -= s; n i |= 1; n } else n return cop(get2(from, s, i, s), get2(0, to, i | 1, s)); n } n } n } n unsigned int n; n vector T; n CombineOp cop; n ModifyOp mop; n }; n template n struct AddOp { n F operator()(F a, F b) { return a + b; } n }; n template n struct MinOp { n F operator()(F a, F b) { return std::min(a, b); } n }; n template n struct MaxOp { n F operator()(F a, F b) { return std::max(a, b); } n }; n template n struct MultiplyOp { n F operator()(F a, F b) { return a * b; } n }; n template n struct MultOp { n F operator()(F a, unsigned int b) { return a * b; } n }; n template n struct IdempOp { n F operator()(F a, unsigned int b) { return a; } n }; n template n struct InverseOp { n F operator()(F a, F b) { return b ? b - a : a; } n }; n template n using AddSumTree = SegTree, Lazy, MultOp>>; n template n using AddMaxTree = SegTree, Lazy, IdempOp>>; n template n using AddMinTree = SegTree, Lazy, IdempOp>>; n template n using AssignMinTree = SegTree, Lazy, IdempOp>>; n template n using AssignMaxTree = SegTree, Lazy, IdempOp>>; n template n using XorTree = SegTree, Lazy, MultOp>>; n template n using SetMinTree = SegTree>; n template n using SetMaxTree = SegTree>; n template n using SetMulTree = SegTree>; n class developinggame { n public: n void solve(istream& cin, ostream& cout) { n int N; n cin >> N; n vector>> P(N); n cin >> P; n vector> In(3e5 + 1), Out(3e5 + 1); n for (int i = 0; i < N; ++i) { n In[P[i].first].push_back(i); n Out[P[i].second.first].push_back(i); n } n AddMaxTree A; n A.setup(3e5 + 1, 0); n std::pair best{-1, 0}; n for (int i = 1; i <= 3e5; ++i) { n for (int j : In[i]) A.put(P[j].second.first, P[j].second.second, 1); n int g = A.get(0, 3e5); n best = max(best, {g, i}); n for (int j : Out[i]) A.put(P[j].second.first, P[j].second.second, -1); n } n int l = best.second; n vector X(3e5 + 2, 0); n for (auto& p : P) { n if (p.first <= l && p.second.first >= l) { n X[p.second.first]++; n X[p.second.second + 1]--; n } n } n std::pair ans{-1, 0}; n for (int i = 1; i <= 3e5; ++i) { n X[i] += X[i - 1]; n ans = max(ans, {X[i], i}); n } n int first = ans.second; n vector Ans; n for (int i = 0; i < N; ++i) { n auto& p = P[i]; n if (p.first <= l && p.second.first >= l && p.second.first <= first && n p.second.second >= first) { n Ans.push_back(i + 1); n } n } n cout << best.first << n << Ans; n } n }; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(nullptr); n cout.tie(nullptr); n developinggame solver; n std::istream& in(std::cin); n std::ostream& out(std::cout); n solver.solve(in, out); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int h, r, spheres = 0; n cin >> r >> h; n spheres = (h / r) * 2; n if (h % r < r / 2.) n spheres += 1; n else { n spheres += 2; n if (h % r > 1.732 * r / 2.) spheres += 1; n } n cout << spheres; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int n, x = 0, y = 0; n string a, b; n cin >> a >> b; n if (a.size() > b.size()) { n n = a.size(); n } else { n n = b.size(); n } n for (int i = 0; i < n; i++) { n if (b[x] == a[y]) { n x++; n y++; n } else { n x++; n } n if (b[x] == 0 || a[y] == 0) { n cout << (y + 1); n break; n } n } n } n "} +{"func_code_string": "#include n long long x, n, d1, d2, now; n int main() { n scanf( %lld %lld , &n, &x); n d1 = x; n d2 = x; n long long l, r, ans = 0l; n for (int i = 1; i <= n; i++) { n scanf( %lld %lld , &l, &r); n if (l <= d1 && r >= d2) continue; n if (r < d1) { n ans += (d1 - r); n d2 = d1; n d1 = r; n } else if (l > d2) { n ans += (l - d2); n d1 = d2; n d2 = l; n } else { n d1 = (d1 < l) ? l : d1; n d2 = (d2 > r) ? r : d2; n } n } n printf( %lld n , ans); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long inf = 1e10; n void solve() { n long long n, m, k; n cin >> n >> m >> k; n long long moves = (n + m - 2) + (n * m) - 1; n for (long long i = 0; i < m + n; i++) { n cin >> k; n } n cout << moves << n ; n for (long long i = 0; i < n - 1; i++) { n cout << U ; n } n for (long long i = 0; i < m - 1; i++) { n cout << L ; n } n string r(m - 1, R ); n string l(m - 1, L ); n for (long long i = 0; i < n; i++) { n if (i % 2) { n cout << l; n } else n cout << r; n if (i != n - 1) cout << D ; n } n cout << n ; n } n int32_t main() { n std::ios::sync_with_stdio(false); n std::cin.tie(nullptr); n long long t = 1; n while (t--) solve(); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int X, Y; n int n; n int cnt; n bool used[1000][1000]; n bool edge[1000][1000][4]; n const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1}; n vector ans; n void dfs(int x, int y) { n if (x < 0 || x >= X || y < 0 || y >= Y || used[x][y]) return; n used[x][y] = true; n cnt++; n for (int i = 0; i < 4; i++) { n if (!edge[x][y][i]) { n dfs(x + DX[i], y + DY[i]); n } n } n } n int main() { n scanf( %d%d%d , &X, &Y, &n); n for (int i = 1; i <= n; i++) { n int x1, y1, x2, y2; n scanf( %d%d%d%d , &x1, &y1, &x2, &y2); n if (x1 == x2) { n for (int j = y1; j < y2; j++) { n edge[x1 - 1][j][0] = true; n edge[x1][j][2] = true; n } n } else if (y1 == y2) { n for (int j = x1; j < x2; j++) { n edge[j][y1 - 1][1] = true; n edge[j][y1][3] = true; n } n } n } n for (int i = 0; i < X; i++) n for (int j = 0; j < Y; j++) n if (!used[i][j]) { n cnt = 0; n dfs(i, j); n ans.push_back(cnt); n } n sort(ans.begin(), ans.end()); n for (int i = 0; i < ans.size(); i++) printf( %d , ans[i]); n puts( ); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 1010; n char s[100]; n bool ops[256]; n int relabel[N * 6]; n int va[N * 6][2]; n int typ[N * 6]; n bool vis[N * 6], beres[N * 6]; n string detail[N * 6]; n map ex; n map, int>, int> rel; n vector ans; n char usea; n int usev; n string nxtvar() { n while (true) { n string cur = string() + usea + to_string(usev); n if (!ex.count(cur)) { n ex.insert(make_pair(cur, 0)); n return cur; n } n if (++usev == 1000) { n usev = 0; n ++usea; n } n } n } n int strcnt; n int gid(const string& str) { n auto it = ex.find(str); n if (it != ex.end()) return it->second; n ex.insert(make_pair(str, ++strcnt)); n detail[strcnt] = str; n return strcnt; n } n int nid(const string& str) { n detail[++strcnt] = str; n return ex[str] = strcnt; n } n void dfs(int u) { n if (vis[u]) return; n vis[u] = true; n if (typ[u] == 0) { n relabel[u] = u; n return; n } n if (typ[u] == -1) { n if (beres[u]) { n if (typ[va[u][0]]) { n beres[va[u][0]] = true; n } else { n if (detail[va[u][0]] != res ) ans.push_back( res= + detail[va[u][0]]); n return; n } n } n dfs(va[u][0]); n relabel[u] = relabel[va[u][0]]; n return; n } n dfs(va[u][0]); n dfs(va[u][1]); n pair, int> spec( n make_pair(relabel[va[u][0]], relabel[va[u][1]]), typ[u]); n relabel[u] = u; n if (!rel.count(spec)) { n rel.insert(make_pair(spec, u)); n detail[u] = nxtvar(); n ans.push_back((beres[u] ? string( res ) : detail[u]) + = + n detail[relabel[va[u][0]]] + char(typ[u]) + n detail[relabel[va[u][1]]]); n } else n relabel[u] = rel[spec]; n } n int main() { n usea = a ; n usev = 0; n ops[ $ ] = true; n ops[ ^ ] = true; n ops[ # ] = true; n ops[ & ] = true; n int t; n scanf( %d , &t); n while (t--) { n scanf( %s , s); n char *p1 = s, *p2; n while (*p1 != = ) ++p1; n string a(s, p1); n p2 = p1; n while (!ops[*p2] && *p2) ++p2; n if (ops[*p2]) { n string b(p1 + 1, p2), c(p2 + 1); n int bi = gid(b), ci = gid(c); n int ai = nid(a); n typ[ai] = *p2; n va[ai][0] = bi; n va[ai][1] = ci; n } else { n string b(p1 + 1); n int bi = gid(b); n int ai = nid(a); n typ[ai] = -1; n va[ai][0] = bi; n } n } n int resi = gid( res ); n beres[resi] = true; n dfs(resi); n printf( %lu n , ans.size()); n for (auto str : ans) puts(str.c_str()); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n void read(vector &v) { n for (int i = 0; i < v.size(); i++) cin >> v[i]; n } n void print(vector v) { n for (int i = 0; i < v.size(); i++) cout << v[i] << ; n } n long long n, m, a, b, temp, x, y; n string str; n set strings; n unordered_map> mp; n bool check(int l, int r) { n for (auto s : strings) { n if (r - l + 1 < s.size()) continue; n auto it = lower_bound(mp[s].begin(), mp[s].end(), l); n if (it == mp[s].end()) continue; n int val = *it; n if (val <= (r - s.size() + 1)) return 0; n } n return 1; n } n int start; n int solve() { n int l = 0; n int r = 0; n int ans = 0; n for (int l = 0; l < str.size(); l++) { n while (r < l) r++; n if (!check(l, r)) { n if (r - l > ans) { n ans = r - l; n start = l; n } n continue; n } n while (r < str.size()) { n if (check(l, r)) n r++; n else n break; n } n if (r - l > ans) { n ans = r - l; n start = l; n } n } n return ans; n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n cin >> str; n cin >> n; n for (int i = 0; i < n; i++) { n string s; n cin >> s; n strings.insert(s); n } n for (auto s : strings) { n string temp; n if (s.size() > str.size()) continue; n for (int i = 0; i <= str.length() - s.length(); i++) { n temp = str.substr(i, s.length()); n if (temp == s) mp[s].push_back(i); n } n } n long long ans = solve(); n cout << ans << << start; n } n "} +{"func_code_string": "#include n using namespace std; n long long x, y; n int n; n pair a[200001]; n vector numbers; n map matchs; n long long matchsReverse[400001]; n int increase[400001]; n int decrease[400001]; n long long answer[400001]; n int main() { n cin >> n; n for (int i = 0; i < n; i++) { n cin >> x >> y; n a[i] = make_pair(x, y); n numbers.push_back(x); n numbers.push_back(y); n } n sort(numbers.begin(), numbers.end()); n int last = -1, num = 0; n for (int i = 0; i < numbers.size(); i++) { n if (last != numbers[i]) { n num++; n matchs[numbers[i]] = num; n matchsReverse[num] = numbers[i]; n last = numbers[i]; n } n } n for (int i = 0; i < n; i++) { n a[i] = make_pair(matchs[a[i].first], matchs[a[i].second]); n increase[a[i].first]++; n decrease[a[i].second]++; n } n long long cnt = 0; n for (int i = 1; i <= 400000; i++) { n answer[cnt] += matchsReverse[i] - 1 - matchsReverse[i - 1]; n answer[cnt + increase[i]]++; n cnt += increase[i]; n cnt -= decrease[i]; n } n for (int i = 1; i <= n; i++) cout << answer[i] << ; n } n "} +{"func_code_string": "#include n using namespace std; n int pos[200000 + 10], b[200000 + 10]; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n int n; n cin >> n; n for (int i = 1; i <= n; i++) { n int x; n cin >> x; n if (x) { n pos[x] = 0; n } n } n for (int i = 1; i <= n; i++) { n cin >> b[i]; n if (b[i]) { n pos[b[i]] = i; n } n } n int start = 1; n int end = b[n]; n bool flag = true; n for (int i = n - 1, j = end - 1; j > 0; j--, i--) { n if (b[i] != j) { n flag = false; n } n } n if (flag) { n start = end + 1; n } n if (start != 1) { n for (int i = start; i <= n; i++) { n if (pos[i] > i - start) { n start = 1; n break; n } n } n } n int ans = n - start + 1; n ans += pos[start]; n int mx = 0; n for (int i = start + 1; i <= n; i++) { n int t = pos[i] - pos[start]; n mx = max(mx, t - i + start); n } n cout << ans + mx << n ; n } n "} +{"func_code_string": "#include n using namespace std; n const double PI = 3.141592653589793238460; n using namespace std; n const int N = 200200; n vector g[N]; n int w[N], vis[N], done[N]; n int can_back[N]; n int n, m, s; n long long maximum = 0; n void dfs(int u, int par) { n vis[u] = 1; n for (auto v : g[u]) { n if (v == par) continue; n if (vis[v]) n can_back[v] = 1; n else n dfs(v, u); n if (can_back[v] == 1) can_back[u] = 1; n } n } n void findmax(int u, long long sum) { n done[u] = 1; n if (g[u].size() == 1 and u != s) { n sum += w[u]; n maximum = max(maximum, sum); n return; n } n if (can_back[u] == 0) sum += w[u]; n for (auto v : g[u]) { n if (!done[v]) findmax(v, sum); n } n } n int main() { n ios_base::sync_with_stdio(false); n cin.tie(0); n cout.tie(0); n cin >> n >> m; n for (int i = 1; i <= n; i++) { n cin >> w[i]; n } n for (int i = 1; i <= m; i++) { n int u, v; n cin >> u >> v; n g[u].push_back(v); n g[v].push_back(u); n } n cin >> s; n can_back[s] = 1; n dfs(s, 0); n long long ans = 0; n for (int i = 1; i <= n; i++) { n if (can_back[i] == 1) ans += w[i]; n } n findmax(s, 0); n ans += maximum; n cout << ans; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n int N; n cin >> N; n vector adjL(N, -1); n for (int n = 0; n < N; n++) { n cin >> adjL[n]; n adjL[n]--; n } n bool c = false; n for (int i = 0; i < N; i++) { n int node = i; n for (int x = 0; x < 3; x++) { n if (adjL[node] != -1) { n node = adjL[node]; n } n } n if (node == i) { n cout << YES ; n c = true; n break; n } n } n if (!c) cout << NO ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const int N = 2e6 + 5; n int n, ri[N]; n char s[N]; n struct node { n int ch[26], par, val; n } t[N]; n int sz = 1, root = 1, last = 1; n void extend(int c) { n int p = last, np = ++sz; n t[np].val = t[p].val + 1; n ri[np]++; n for (; p && !t[p].ch[c]; p = t[p].par) t[p].ch[c] = np; n if (!p) n t[np].par = root; n else { n int q = t[p].ch[c]; n if (t[q].val == t[p].val + 1) n t[np].par = q; n else { n int nq = ++sz; n t[nq] = t[q]; n t[nq].val = t[p].val + 1; n t[q].par = t[np].par = nq; n for (; p && t[p].ch[c] == q; p = t[p].par) t[p].ch[c] = nq; n } n } n last = np; n } n int vis[N]; n void walk(int id) { n int u = root, len = n + n - 1, ans = 0, nowLen = 0; n for (int i = 1; i <= len; i++) { n int c = s[i] - a ; n if (t[u].ch[c]) n u = t[u].ch[c], nowLen++; n else { n while (u && !t[u].ch[c]) u = t[u].par; n if (!u) n u = root, nowLen = 0; n else n nowLen = t[u].val + 1, u = t[u].ch[c]; n } n if (vis[u] != id && nowLen >= n) vis[u] = id, ans += ri[u]; n if (n != 1) n while (t[t[u].par].val + 1 >= n) u = t[u].par, nowLen = t[u].val; n } n printf( %d n , ans); n } n int c[N], a[N]; n void RadixSort() { n for (int i = 1; i <= sz; i++) c[t[i].val]++; n for (int i = 1; i <= n; i++) c[i] += c[i - 1]; n for (int i = sz; i >= 1; i--) a[c[t[i].val]--] = i; n } n void solve() { n RadixSort(); n int u; n for (int i = sz; i >= 1; i--) u = a[i], ri[t[u].par] += ri[u]; n int m; n scanf( %d , &m); n for (int i = 1; i <= m; i++) { n scanf( %s , s + 1); n n = strlen(s + 1); n for (int i = 1; i < n; i++) s[i + n] = s[i]; n walk(i); n } n } n int main() { n scanf( %s , s + 1); n n = strlen(s + 1); n for (int i = 1; i <= n; i++) extend(s[i] - a ); n solve(); n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n int64_t n, m; n cin >> n >> m; n if (n <= m) { n cout << n << endl; n } else { n n -= m; n int64_t l = 0, r = 2e9; n while (l < r) { n int64_t m = (l + r) / 2; n int64_t val = m * (m + 1) / 2; n if (val >= n) { n r = m; n } else { n l = m + 1; n } n } n cout << l + m << endl; n } n return 0; n } n "} +{"func_code_string": "#define _USE_MATH_DEFINES n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n #include n n n typedef long long ll; n typedef long double ld; n typedef unsigned long long ull; n n #pragma warning(disable : 4996) n #pragma comment(linker, /STACK:16777216 ) n #define pb push_back n #define en n n #define forn(i,n) for(int i = 0;i n #define pll pair n #define szof(x) int(x.size()) n #define sqr(x) ((x)*(x)) n #define debug(x) cerr<<#x<< = <= 0; i = (i & (i + 1)) - 1) { n res += t[i]; n } n return res; n } n n //возвращает prefix [i1, i2] n ll prefix(int i1, int i2, ll* t) { n return prefix(i2, t) - (i1 == 0 ? 0 : prefix(i1 - 1, t)); n } n n n const int SEGTREE_SIZE = 2e5 + 10; n const ll NO_OPERATION = 1e18 + 5; n n struct segtree { n n struct node { n ll set; n ll min; n ll max; n }; n n vector t; n int size; n n const node NEUTRAL_ELEM = { NO_OPERATION, LINF, -LINF }; n const node ZERO = { NO_OPERATION , 0, 0 }; n n n void modify_op(ll& a, ll b, ll len) { n if (b == NO_OPERATION) n return; n if (a == NO_OPERATION) { n a = b * len; n } n else { n a += b * len; n } n } n n n node sum_op(node &a, node &b) { n node res; n res.min = min(a.min, b.min); n res.max = max(a.max, b.max); n res.set = NO_OPERATION; n n return res; n } n n n void push(int v, int tl, int tr) { n if (t[v].set == NO_OPERATION || tr - tl == 1) { n return; n } n int tm = (tr + tl) / 2; n modify_op(t[v * 2 + 1].set, t[v].set, 1); n modify_op(t[v * 2 + 1].min, t[v].set, 1); n modify_op(t[v * 2 + 1].max, t[v].set, 1); n n modify_op(t[v * 2 + 2].set, t[v].set, 1); n modify_op(t[v * 2 + 2].min, t[v].set, 1); n modify_op(t[v * 2 + 2].max, t[v].set, 1); n n t[v].set = NO_OPERATION; n } n n n void init(int n) { n size = 1; n while (size < n) { n size *= 2; n } n t.assign(2 * size, ZERO); n } n n segtree(int n = SEGTREE_SIZE) { n init(n); n } n n segtree(vector& a) { n init(a.size()); n build(a); n } n n n void build(vector& a, int v, int tl, int tr) { n if (tr - tl == 1) { n if (tl < a.size()) n t[v] = { NO_OPERATION, a[tl].second, a[tl].first }; n return; n } n int tm = (tr + tl) / 2; n build(a, v * 2 + 1, tl, tm); n build(a, v * 2 + 2, tm, tr); n t[v] = sum_op(t[v * 2 + 1], t[v * 2 + 2]); n } n n void build(vector& a) { n build(a, 0, 0, size); n } n n void modify(int v, int tl, int tr, int l, int r, ll val) { n push(v, tl, tr); n if (tr <= l || tl >= r) { n return; n } n n if (l <= tl && tr <= r) { n modify_op(t[v].set, val, 1); n modify_op(t[v].min, val, 1); n modify_op(t[v].max, val, 1); n return; n } n n int tm = (tl + tr) / 2; n n modify(v * 2 + 1, tl, tm, l, r, val); n modify(v * 2 + 2, tm, tr, l, r, val); n n t[v] = sum_op(t[v * 2 + 1], t[v * 2 + 2]); n } n n void modify(int l, int r, ll val) { n modify(0, 0, size, l, r, val); n } n n node get(int v, int tl, int tr, int l, int r) { n push(v, tl, tr); n if (tr <= l || tl >= r) { n return NEUTRAL_ELEM; n } n n if (l <= tl && tr <= r) { n return t[v]; n } n n int tm = (tl + tr) / 2; n n auto g1 = get(v * 2 + 1, tl, tm, l, r); n auto g2 = get(v * 2 + 2, tm, tr, l, r); n n return sum_op(g1, g2); n } n n node get(int l, int r) { n if (l >= r) { n return ZERO; n } n n return get(0, 0, size, l, r); n } n }; n n n n n void solve() { n int n, m; n cin >> n >> m; n n vector k(n + 1); n vector left(n + 1); n vector right(n + 1); n n for(int i = 1; i <= n; i++){ n cin >> k[i]; n cin >> left[i].first >> left[i].second; n cin >> right[i].first >> right[i].second; n } n n for (int i = 0; i <= n; i++) { n if (left[i].first <= k[i] && k[i] <= left[i].second) { n inc(i, 1, l); n } n if (right[i].first <= k[i] && k[i] <= right[i].second) { n inc(i, 1, r); n } n } n n vector dpl(n + 1), dpr(n + 1); n vector pl(n + 1), pr(n + 1); n n int last_l = INF, last_r = INF; n n if (left[n].first <= k[n] && k[n] <= left[n].second) { n dpl[n] = 1; n last_l = n; n pl[n] = n + 1; n } n if (right[n].first <= k[n] && k[n] <= right[n].second) { n dpr[n] = 1; n last_r = n; n pr[n] = n + 1; n } n n auto st_left = segtree(left); n auto st_right = segtree(right); n n for (int i = n - 1; i >= 0; i--) { n int temp_l = last_l, temp_r = last_r; n n if (last_r != INF) n { n bool ok = (prefix(i + 1, last_r, r) == last_r - (i + 1) + 1); n n auto res = st_left.get(i, last_r + 1); n n ok &= res.max <= k[i]; n ok &= res.min >= k[i]; n n if (ok) { n dpl[i] = 1; n pl[i] = last_r; n temp_l = i; n } n } n n if (last_l != INF) n { n bool ok = (prefix(i + 1, last_l, l) == last_l - (i + 1) + 1); n n auto res = st_right.get(i, last_l + 1); n n ok &= res.max <= k[i]; n ok &= res.min >= k[i]; n n if (ok) { n dpr[i] = 1; n pr[i] = last_l; n temp_r = i; n } n } n last_l = temp_l, last_r = temp_r; n } n n if (dpl[0]) { n cout << YES << en; n n bool first = true; n n int cur = 0; n bool is_left = true; n while (cur != n + 1) { n if (!first) { n cout << (is_left == 0) << ; n } n n first = 0; n n int nt; n if (is_left) { n nt = pl[cur]; n } n else { n nt = pr[cur]; n } n n is_left ^= 1; n n for (int i = cur + 1; i < nt; i++) { n cout << (is_left == 0) << ; n } n cur = nt; n } n n n return; n } n n if (dpr[0]) { n cout << YES << en; n n bool first = 1; n int cur = 0; n bool is_left = false; n while (cur != n + 1) { n if (!first) { n cout << (is_left == 0) << ; n } n n first = 0; n n int nt; n if (is_left) { n nt = pl[cur]; n } n else { n nt = pr[cur]; n } n n is_left ^= 1; n n for (int i = cur + 1; i < nt; i++) { n cout << (is_left == 0) << ; n } n cur = nt; n } n n return; n } n n cout << NO << en; n } n n n int main() { n srand(time(0)); n ios::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n n n #ifdef _DEBUG n freopen( input.txt , r , stdin); n //freopen( output.txt , w , stdout); n #endif n n n int tst = 1; n //cin >> tst; n n while (tst--) n solve(); n }"} +{"func_code_string": "#include n using namespace std; n const int MAXN = 1e5 + 3; n const int INF = 1e9; n const int MOD = 1e9 + 7; n int n; n int a[MAXN]; n long long seg[12][4 * MAXN]; n void add(int j, int l, int r, long long val, int b = 0, int e = n, int k = 0) { n if (l <= b && e <= r) { n seg[j][k] += val; n return; n } n if (r <= b || e <= l) return; n int mid = (b + e) / 2; n add(j, l, r, val, b, mid, k * 2 + 1); n add(j, l, r, val, mid, e, k * 2 + 2); n } n long long get(int j, int i, int b = 0, int e = n, int k = 0) { n if (i < b || i >= e) return 0; n if (b + 1 == e) return seg[j][k]; n int mid = (b + e) / 2; n return seg[j][k] + get(j, i, b, mid, k * 2 + 1) + n get(j, i, mid, e, k * 2 + 2); n } n int main() { n cin >> n; n int k; n cin >> k; n for (int i = 0; i < n; i++) { n int x; n cin >> x; n x--; n a[x] = i; n } n for (int i = 0; i < n; i++) { n if (a[i] == 0) { n add(1, a[i], n, 1); n } else { n for (int j = 2; j <= k + 1; j++) { n long long x = get(j - 1, a[i] - 1); n add(j, a[i], n, x); n } n add(1, a[i], n, 1); n } n } n cout << get(k + 1, n - 1); n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n const long long INF = 1LL << 60; n int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } n int lcm(int a, int b) { return a * b / gcd(a, b); } n const int N = 2e5 + 5; n int v[N], in[N]; n vector e[N]; n bool cmp(int a, int b) { return in[a] < in[b]; } n void solve() { n int n; n cin >> n; n for (auto &li : e) li.clear(); n for (int i = (0); i < (n - 1); ++i) { n int x, y; n cin >> x >> y; n x--, y--; n e[x].push_back(y); n e[y].push_back(x); n } n vector ch, gen; n for (int i = (0); i < (n); ++i) { n v[i] = 0; n int z; n cin >> z; n in[--z] = i; n ch.push_back(z); n } n for (int i = (0); i < (n); ++i) sort((e[i]).begin(), (e[i]).end(), cmp); n queue q; n q.push(0); n v[0] = 1; n while (!q.empty()) { n int t = q.front(); n q.pop(); n gen.push_back(t); n for (auto to : e[t]) { n if (v[to]) continue; n v[to] = 1; n q.push(to); n } n } n for (int i = (0); i < (n); ++i) n if (gen[i] != ch[i]) { n puts( No ); n return; n } n puts( Yes ); n } n int main() { n ios_base::sync_with_stdio(0); n cin.tie(0); n solve(); n return 0; n } n "} +{"func_code_string": "#include n int cnt[111], ans, b, d, pr[111], v[111]; n int main() { n scanf( %d%d , &b, &d); n int k = b; n for (int i = 2; k > 1; i++) { n if (k % i) continue; n while (k % i == 0) cnt[i]++, k /= i; n } n bool flag = true; n k = d; n for (int i = 2; k > 1; i++) { n if (k % i) continue; n int x = 1; n while (k % i == 0) pr[i]++, k /= i, x *= i; n v[x] = -i; n if (cnt[i] == 0) { n flag = false; n continue; n } n int p = (pr[i] - 1) / cnt[i] + 1; n if (p > ans) ans = p; n } n if (flag) n printf( 2-type n%d n , ans); n else { n if (b % d == 1) n printf( 3-type n ); n else if ((b + 1) % d == 0) n printf( 11-type n ); n else { n flag = true; n for (int i = 2; i <= d; i++) { n if (v[i] >= 0 || cnt[-v[i]] || b % i == 1 || (b + 1) % i == 0) continue; n flag = false; n break; n } n if (flag) n printf( 6-type n ); n else n printf( 7-type n ); n } n } n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n string s; n cin >> s; n bool res = false; n for (int i = 0; i < s.size() - 1; ++i) { n if (s[i] == A && s[i + 1] == B ) { n for (int j = i + 2; j < s.size() - 1; ++j) { n if (s[j] == B && s[j + 1] == A ) { n cout << YES n ; n return 0; n } n } n break; n } n } n for (int i = 0; i < s.size() - 1; ++i) { n if (s[i] == B && s[i + 1] == A ) { n for (int j = i + 2; j < s.size() - 1; ++j) { n if (s[j] == A && s[j + 1] == B ) { n cout << YES n ; n return 0; n } n } n break; n } n } n cout << NO n ; n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int N, M; n string grid[1000]; n vector>> startAdj; n vector visited; n vector merged; n vector>> adj; n vector value; n vector greaterCount; n void flood(int start, int pos) { n if (visited[pos]) return; n visited[pos] = true; n merged[pos] = start; n for (int i = 0; i < startAdj[pos].size(); i++) { n if (startAdj[pos][i].second != = ) { n adj[start].push_back(startAdj[pos][i]); n } n } n for (int i = 0; i < startAdj[pos].size(); i++) { n if (startAdj[pos][i].second == = ) { n flood(start, startAdj[pos][i].first); n } n } n } n int main() { n ios_base::sync_with_stdio(false); n cin >> N >> M; n for (int i = 0; i < N; i++) cin >> grid[i]; n startAdj.assign(N + M + 1, vector>()); n for (int i = 0; i < N; i++) n for (int j = 0; j < M; j++) n startAdj[i + 1].push_back({j + 1 + N, grid[i][j]}); n for (int j = 0; j < M; j++) { n for (int i = 0; i < N; i++) { n char c = grid[i][j]; n if (c == > ) n c = < ; n else if (c == < ) n c = > ; n startAdj[j + 1 + N].push_back({i + 1, c}); n } n } n visited.assign(N + M + 1, false); n merged.assign(N + M + 1, 0); n adj.assign(N + M + 1, vector>()); n value.assign(N + M + 1, 0); n greaterCount.assign(N + M + 1, 0); n for (int i = 1; i <= N + M; i++) { n if (!visited[i]) { n flood(i, i); n } n } n bool works = true; n for (int i = 1; i <= N + M; i++) { n for (int j = 0; j < adj[i].size(); j++) { n if (adj[i][j].second == > ) greaterCount[i]++; n if (merged[adj[i][j].first] == i) works = false; n } n } n if (works) { n vector curr; n for (int i = 1; i <= N + M; i++) n if (merged[i] == i && greaterCount[i] == 0) curr.push_back(i); n vector next; n int v = 1; n while (curr.size() != 0) { n for (int i = 0; i < curr.size(); i++) { n value[curr[i]] = v; n for (int j = 0; j < adj[curr[i]].size(); j++) { n if (adj[curr[i]][j].second == < ) { n greaterCount[merged[adj[curr[i]][j].first]]--; n if (greaterCount[merged[adj[curr[i]][j].first]] == 0) { n next.push_back(merged[adj[curr[i]][j].first]); n } n } n } n } n curr = next; n next.clear(); n v++; n } n for (int i = 1; i <= N + M; i++) { n if (!value[i] && merged[i] == i) works = false; n } n } n if (works) { n cout << Yes n ; n for (int i = 0; i < N; i++) { n if (i) cout << ; n cout << value[merged[i + 1]]; n } n cout << n ; n for (int i = 0; i < M; i++) { n if (i) cout << ; n cout << value[merged[i + 1 + N]]; n } n cout << n ; n } else { n cout << No n ; n } n return 0; n } n "} +{"func_code_string": "#include n using namespace std; n int main() { n ios_base::sync_with_stdio(false); n cin.tie(NULL); n cout.tie(NULL); n ; n long long n, k; n cin >> n >> k; n vector arr(n); n for (long long i = 0; i < n; i++) cin >> arr[i]; n long long c = 0; n for (long long i = 1; i < n; i++) { n if (arr[i] + arr[i - 1] < k) { n c += k - arr[i] - arr[i - 1]; n arr[i] = k - arr[i - 1]; n } n } n cout << c << n ; n for (auto i : arr) cout << i << ; n ; n cout << n ; n return 0; n } n "}