diff --git "a/cpp_dataset/validation/validation.jsonl" "b/cpp_dataset/validation/validation.jsonl" --- "a/cpp_dataset/validation/validation.jsonl" +++ "b/cpp_dataset/validation/validation.jsonl" @@ -50,7 +50,7 @@ {"func_code_string": "#include \n using namespace std;\n long long unsigned int countDivisors(long long unsigned int n) {\n long long unsigned int cnt = 0;\n for (long long unsigned int i = 1; i <= sqrt(n); i++) {\n if (n % i == 0) {\n if (n / i == i)\n ++cnt;\n else\n cnt += 2;\n }\n }\n return cnt;\n }\n int Search(string pat, string txt) {\n int n = txt.size();\n int m = pat.size();\n for (int i = 0; i <= n - m; i++) {\n int j;\n for (j = 0; j < m; j++) {\n if (txt[i + j] != pat[j]) {\n break;\n }\n }\n if (j == m) {\n return i;\n }\n }\n return -1;\n }\n int findFirst(const std::vector &array, int key, int low,\n int high) {\n int ans = -1;\n while (low <= high) {\n int mid = low + (high - low) / 2;\n if (key == array[mid]) {\n ans = mid;\n high = mid - 1;\n } else if (key > array[mid])\n low = mid + 1;\n else\n high = mid - 1;\n }\n return ans;\n }\n int findLast(const std::vector &array, int key, int low,\n int high) {\n int ans = -1;\n while (low <= high) {\n int mid = low + (high - low) / 2;\n if (key == array[mid]) {\n ans = mid;\n low = mid + 1;\n } else if (key > array[mid])\n low = mid + 1;\n else\n high = mid - 1;\n }\n return ans;\n }\n int d, x, y;\n void extendedEuclid(int a, int b) {\n if (b == 0) {\n d = 1;\n x = 1;\n y = 0;\n } else {\n extendedEuclid(b, a % b);\n int temp = x;\n x = y;\n y = temp - (a / b) * y;\n }\n }\n int main() {\n std::ios::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n ;\n int t;\n t = 1;\n for (int tc = 0; tc < t; tc++) {\n int n;\n cin >> n;\n vector arr(n), brr(n, 0), v;\n for (int i1 = 0; i1 < n; i1++) cin >> arr[i1];\n int pos = 0;\n for (int i = 0; i < n; i++) {\n int indx = n - arr[i];\n brr[indx] = 1;\n while (brr[pos] == 1 && pos < n) {\n cout << (n - pos) << ;\n pos++;\n }\n cout << endl;\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long mp[1005][1005];\n long long n, a, b;\n void output() {\n for (long long i = 1; i <= n; i++) {\n for (long long j = 1; j <= n; j++) {\n if (i == j)\n printf( 0 );\n else\n printf( %lld , a < b ? !mp[i][j] : mp[i][j]);\n }\n printf( \n );\n }\n }\n int main() {\n scanf( %lld%lld%lld , &n, &a, &b);\n long long root = 2;\n if ((a != 1 && b != 1)) {\n printf( NO\n );\n return 0;\n }\n if (n == 2 && a == 1 && b == 1) {\n printf( NO\n );\n return 0;\n }\n if (n == 3 && a == 1 && b == 1) {\n printf( NO\n );\n return 0;\n }\n printf( YES\n );\n if (a == 1 && b == 1)\n for (long long i = 1; i < n; i++) mp[i][i + 1] = mp[i + 1][i] = true;\n else\n for (long long i = 0; i < n - max(a, b); i++, root++)\n mp[1][root] = mp[root][1] = true;\n output();\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long power(long long a, long long b) {\n long long ans = 1;\n while (b > 0) {\n if (b % 2 != 0) {\n ans = (ans * a) % 1000000007;\n }\n a = ((a % 1000000007) * (a % 1000000007)) % 1000000007;\n b >>= 1;\n }\n return ans;\n }\n void sieve(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]) {\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]) cout << p << ;\n }\n }\n int main() {\n std::ios::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n ;\n int t = 1;\n cin >> t;\n while (t--) {\n int n, k;\n cin >> n >> k;\n vector> v;\n for (int i = 0; i < k; i++) {\n int c;\n cin >> c;\n vector temp;\n for (int j = 0; j < c; j++) {\n int z;\n cin >> z;\n temp.push_back(z);\n }\n v.push_back(temp);\n }\n int l = 1, h = n;\n int ma;\n cout << ? \n << << n << ;\n for (int i = 1; i <= n; i++) cout << i << ;\n cout << endl;\n cin >> ma;\n for (int i = 0; i < 10; i++) {\n int mid = (h + l) / 2;\n int temp;\n cout << ? \n << << mid - l + 1 << ;\n for (int kha = l; kha <= mid; kha++) cout << kha << ;\n cout << endl;\n cin >> temp;\n if (temp == ma)\n h = mid;\n else\n l = mid;\n }\n int ind = h;\n bool flag = false;\n vector ans;\n for (int i = 0; i < v.size(); i++) {\n sort(v[i].begin(), v[i].end());\n for (int j = 0; j < v[i].size(); j++) {\n if (v[i][j] == ind) {\n flag = true;\n cout << ? \n << ;\n vector loa;\n for (int lo = 1; lo <= n; lo++) {\n if (binary_search(v[i].begin(), v[i].end(), lo) == false) {\n loa.push_back(lo);\n }\n }\n cout << loa.size() << ;\n for (auto lo : loa) cout << lo << ;\n cout << endl;\n int kha;\n cin >> kha;\n ans.push_back(kha);\n }\n }\n if (flag == false) {\n ans.push_back(ma);\n } else {\n flag = false;\n }\n }\n cout << ! \n << ;\n for (auto i : ans) cout << i << ;\n cout << endl;\n string sa;\n cin >> sa;\n if (sa == Correct ) {\n continue;\n } else {\n return 0;\n }\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const long long INF = 1e18;\n const int maxn = 2e6 + 10;\n int a[maxn], cnt[maxn];\n long long sum[maxn];\n int main(void) {\n int n, x, y;\n scanf( %d %d %d , &n, &x, &y);\n int z = x / y;\n for (int i = 1; i <= n; i++)\n scanf( %d , a + i), cnt[a[i]]++, sum[a[i]] += a[i];\n for (int i = 1; i <= 2000000; i++) cnt[i] += cnt[i - 1], sum[i] += sum[i - 1];\n long long ans = INF;\n for (int i = 2; i <= 1000000; i++) {\n long long tmp = 0;\n int zz = min(z, i - 1);\n for (int j = 1; (j - 1) * i < 1000000; j++) {\n if (i - zz - 2 >= 0)\n tmp += (long long)(cnt[j * i - zz - 1] - cnt[j * i - i]) * x;\n if (zz)\n tmp += ((long long)i * j * (cnt[j * i - 1] - cnt[j * i - zz - 1]) -\n (sum[j * i - 1] - sum[j * i - zz - 1])) *\n y;\n }\n ans = min(ans, tmp);\n }\n printf( %I64d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const long long INF = 1e18;\n const int maxn = 2e6 + 10;\n int a[maxn], cnt[maxn];\n long long sum[maxn];\n int main(void) {\n int n, x, y;\n scanf( %d %d %d , &n, &x, &y);\n int z = x / y;\n for (int i = 1; i <= n; i++)\n scanf( %d , a + i), cnt[a[i]]++, sum[a[i]] += a[i];\n for (int i = 1; i <= 2000000; i++) cnt[i] += cnt[i - 1], sum[i] += sum[i - 1];\n long long ans = INF;\n for (int i = 2; i <= 1000000; i++) {\n long long tmp = 0;\n int zz = min(z, i - 1);\n for (int j = 1; (j - 1) * i < 1000000; j++) {\n if (i - zz - 2 >= 0)\n tmp += (long long)(cnt[j * i - zz - 1] - cnt[j * i - i]) * x;\n if (zz)\n tmp += ((long long)i * j * (cnt[j * i - 1] - cnt[j * i - zz - 1]) -\n (sum[j * i - 1] - sum[j * i - zz - 1])) *\n y;\n }\n ans = min(ans, tmp);\n }\n printf( extra\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n #pragma GCC optimize ( O3 )\n #pragma GCC target ( sse4 )\n \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 template using pq = priority_queue;\n template using pqg = priority_queue, greater>;\n \n #define FOR(i, a, b) for (int i=a; i<(b); i++)\n #define F0R(i, a) for (int i=0; i<(a); i++)\n #define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)\n #define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)\n #define trav(a,x) for (auto& a : x)\n #define uid(a, b) uniform_int_distribution(a, b)(rng)\n \n #define sz(x) (int)(x).size()\n #define mp make_pair\n #define pb push_back\n #define f first\n #define s second\n #define lb lower_bound\n #define ub upper_bound\n #define all(x) x.begin(), x.end()\n #define ins insert\n \n template bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }\n template bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }\n \n mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\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 \n template\n void __print(const pair &x) {cerr << '{'; __print(x.first); cerr << , ; __print(x.second); cerr << '}';}\n template\n void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? , : ), __print(i); cerr << } ;}\n void _print() {cerr << ]\n ;}\n template \n void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << , ; _print(v...);}\n #ifdef DEBUG\n #define dbg(x...) cerr << \e[91m <<__func__<< : <<__LINE__<< [ << #x << ] = [ ; _print(x); cerr << \e[39m << endl;\n #else\n #define dbg(x...)\n #endif\n \n \n const int MOD = 1000000007;\n const char nl = '\n';\n const int MX = 200001; \n \n int dist[MX];\n int A[MX];\n set rem;\n pqg q;\n \n void add(int p, int pre, bool ty) {\n auto it1 = rem.lb({p, -1});\n if (it1 != rem.end()) {\n int v = it1->s;\n int d = max(pre, abs(A[v]-p));\n if (ty) {\n d = pre + abs(A[v]-p);\n }\n if (d < dist[v]) {\n dist[v] = d;\n q.push({d, v});\n }\n }\n if (it1 != rem.begin()) {\n it1--;\n int v = it1->s;\n int d = max(pre, abs(A[v]-p));\n if (ty) {\n d = pre + abs(A[v]-p);\n }\n if (d < dist[v]) {\n dist[v] = d;\n q.push({d, v});\n }\n }\n }\n \n void push(int p, int K) {\n while (rem.lb({p, -1}) != rem.end() && rem.lb({p, -1})->f <= p+K) {\n int x = rem.lb({p, -1})->s;\n rem.erase({A[x], x});\n q.push({K, x});\n dist[x] = K;\n }\n auto it = rem.lb({p, -1});\n while (it != rem.begin()) {\n it--;\n if (it->f < p-K) break;\n int x = it->s;\n rem.erase({A[x], x});\n q.push({K, x});\n dist[x] = K;\n it = rem.lb({p, -1});\n }\n }\n \n \n void solve() {\n int N, Q; cin >> N >> Q;\n F0R(i, N) dist[i] = 100000000;\n int S; cin >> S; S--;\n int D; cin >> D;\n F0R(i, N) {\n cin >> A[i];\n if (i != S) rem.ins({A[i], i});\n }\n dist[S] = 0;\n add(A[S]+D, 0, true);\n add(A[S]-D, 0, true);\n bool vis[MX]; F0R(i, N) vis[i] = false;\n while (!q.empty()) {\n int v = q.top().s;\n int d = q.top().f;\n q.pop();\n if (vis[v]) continue;\n vis[v] = true;\n //dbg(v, d);\n rem.erase({A[v], v});\n add(A[v], d, true);\n push(A[v]+D, d);\n push(A[v]-D, d);\n add(A[v]+D, 0, true);\n add(A[v]-D, 0, true);\n }\n /*F0R(i, N) {\n cout << dist[i] << ;\n }\n cout << nl;*/\n \n while(Q--) {\n int X, V; cin >> X >> V; X--;\n cout << (dist[X]<=V? Yes : No ) << nl;\n }\n }\n \n int main() {\n cin.tie(0)->sync_with_stdio(0); \n cin.exceptions(cin.failbit);\n \n int T = 1;\n // cin >> T;\n while(T--) {\n solve();\n }\n \n return 0;\n }\n \n \n "} {"func_code_string": "#include \n using namespace std;\n long long k, b, n, t;\n int main() {\n ios_base ::sync_with_stdio(0);\n cin.tie(0);\n cin >> k >> b >> n >> t;\n long long num = 1;\n long long step = n;\n while (t >= num) {\n num = num * k + b;\n step--;\n }\n if (step < 0) {\n cout << 0;\n return 0;\n }\n cout << step + 1;\n return 0;\n }\n "} {"func_code_string": "#include \n const long double pi = 3.14159265359;\n const long long N = 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 n, m, arr[200005];\n cin >> n >> m;\n long long cntne = 0, cntpo = 0;\n for (int i = 0; i < n; i++) {\n cin >> arr[i];\n if (arr[i] == -1)\n cntne++;\n else\n cntpo++;\n }\n vector v;\n for (int i = 0; i < m; i++) {\n long long l, r;\n cin >> l >> r;\n r++;\n long long ans = abs(l - r);\n if ((ans % 2 == 0) && (cntne >= ans / 2) && (cntpo >= ans / 2))\n v.push_back(1);\n else\n v.push_back(0);\n }\n for (int i = 0; i < ((long long)((v).size())); i++) cout << v[i] << endl;\n return 0;\n }\n "} @@ -107,7 +107,7 @@ {"func_code_string": "#include \n using namespace std;\n bool vis[305][305];\n string s[305];\n int len[305][305];\n int d[305];\n int hs[305][305];\n int n;\n const int mod = 9e8 + 7;\n int qpow(int x, int y) {\n long long ret = 1;\n long long now = x;\n while (y) {\n if (y & 1) ret = ret * now % mod;\n now = now * now % mod;\n y >>= 1;\n }\n return ret;\n }\n void init() {\n memset(vis, false, sizeof(vis));\n for (int i = 1; i <= n; i++) {\n d[i] = 0;\n len[i][0] = s[i].size();\n for (int j = 0; j < s[i].size(); j++) {\n d[i] = (d[i] * 233LL + s[i][j] - 'a' + 1) % mod;\n }\n }\n for (int i = 1; i <= n; i++) {\n hs[i][0] = d[i];\n for (int j = 1; j + i <= n; j++) {\n len[i][j] = len[i + j][0] + len[i][j - 1];\n hs[i][j] = (1LL * hs[i][j - 1] * 2333LL + d[i + j]) % mod;\n }\n }\n }\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) cin >> s[i];\n init();\n int ans = 0;\n for (int i = 1; i <= n; i++) {\n int ls = 0;\n for (int j = 0; i + j <= n; j++) {\n ls += len[i + j][0];\n int nx = i + j + 1;\n int cnt = 1;\n while (nx + j <= n) {\n if (hs[i][j] == hs[nx][j] && len[i][j] == len[nx][j]) {\n cnt++;\n nx += j + 1;\n } else {\n nx++;\n }\n }\n if (cnt > 1) ans = max(ans, (ls - 1) * cnt);\n }\n }\n ans = n - 1 - ans;\n for (int i = 1; i <= n; i++) ans += len[i][0];\n cout << ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n vector v[100005];\n int p[100005];\n int h[100005];\n int happy[100005];\n int sad[100005];\n bool vis[100005];\n bool ok;\n void init(int n) {\n for (int i = 1; i < n + 1; i++) {\n v[i].clear();\n vis[i] = false;\n }\n ok = true;\n }\n void dfs(int node) {\n vis[node] = true;\n long long int happyChild = 0;\n long long int sadChild = p[node];\n for (int child : v[node]) {\n if (vis[child]) continue;\n dfs(child);\n happyChild += happy[child];\n sadChild += sad[child];\n }\n long long int gg = (long long int)h[node] - (happyChild - sadChild);\n if (gg >= 0 && gg % 2 == 0 && gg / 2 <= sadChild) {\n long long int x = gg / 2;\n happy[node] = x + happyChild;\n sad[node] = sadChild - x;\n } else {\n ok = false;\n return;\n }\n }\n int main() {\n int t, n, m, a, b;\n scanf( %d , &t);\n while (t--) {\n scanf( %d %d , &n, &m);\n init(n);\n for (int i = 1; i < n + 1; i++) scanf( %d , &p[i]);\n for (int i = 1; i < n + 1; i++) scanf( %d , &h[i]);\n for (int i = 0; i < n - 1; i++) {\n scanf( %d %d , &a, &b);\n v[a].push_back(b);\n v[b].push_back(a);\n }\n dfs(1);\n if (ok)\n puts( YES );\n else\n puts( NO );\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long j, k, a, b, s, ss, l, m, n, t, d;\n long long e, i, c[221];\n vector p[111], q[111], r, v;\n char w;\n map y, z;\n long long too(long long i, long long j) {\n long long l = 0, d = 0;\n for (k = 0; k < q[i].size(); k++) {\n l += q[i][k];\n r.push_back(l);\n }\n l = 0;\n for (k = 0; k < q[j].size(); k++) {\n l += q[j][k];\n r.push_back(l);\n }\n l = r.size();\n sort(r.begin(), r.end());\n for (k = 0; k < l; k++) c[k] = 0;\n for (k = 0; k < l; k++) {\n long long x, a = 0, b = 0, e = 0;\n x = r[k];\n while (x > q[i][e] && e < q[i].size()) {\n a += p[i][e] * q[i][e];\n x -= q[i][e];\n e++;\n }\n if (e < q[i].size()) a += p[i][e] * x;\n x = r[k];\n e = 0;\n while (x > q[j][e] && e < q[j].size()) {\n b += p[j][e] * q[j][e];\n x -= q[j][e];\n e++;\n }\n if (e < q[j].size()) b += p[j][e] * x;\n if (a > b) c[k] = 1;\n if (a < b) c[k] = 2;\n }\n e = 0;\n while (c[e] == 0) e++;\n for (k = e + 1; k < l; k++) {\n if (c[k] == 0) c[k] = c[k - 1];\n }\n for (k = e + 1; k < l; k++)\n if (c[k] != c[k - 1]) d++;\n return d;\n }\n int main() {\n cin >> n >> s;\n for (i = 0; i < n; i++) {\n cin >> k;\n for (j = 0; j < k; j++) {\n cin >> a >> b;\n p[i].push_back(a);\n q[i].push_back(b);\n }\n }\n for (i = 0; i < n; i++) {\n for (j = i + 1; j < n; j++) {\n ss += too(i, j);\n r = v;\n }\n }\n cout << ss;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int N = int(1e6) + 50;\n char S[N], T[N];\n int slen, tlen, lef[N], rig[N], cnt[255][255];\n inline int getID(char c) {\n if (c == 'R') return 0;\n if (c == 'G') return 1;\n if (c == 'B') return 2;\n throw;\n }\n int main() {\n scanf( %s , S + 1);\n slen = strlen(S + 1);\n scanf( %s , T + 1);\n tlen = strlen(T + 1);\n int l = 1, r = 1;\n while (l <= slen && r <= tlen) {\n lef[l] = r;\n r += S[l] == T[r];\n ++l;\n }\n slen = min(slen, l - 1);\n l = r = 1;\n while (l <= slen && r <= tlen) {\n rig[l] = r;\n l += S[l] == T[r];\n ++r;\n }\n tlen = min(tlen, r - 1);\n for (int i = l + bool(rig[l]); i <= slen; ++i) {\n rig[i] = tlen;\n }\n long long res = 0;\n for (int i = 1; i <= slen; ++i) {\n for (int j = max(1, lef[i - 1]); j < lef[i]; ++j) --cnt[T[j]][T[j - 1]];\n for (int j = 1 + rig[i - 1]; j <= rig[i]; ++j) ++cnt[T[j]][T[j - 1]];\n res += rig[i] - lef[i] + 1;\n if (S[i - 1] != S[i]) res -= cnt[S[i - 1]][S[i]];\n }\n printf( %I64d\n , res);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int N = int(1e6) + 50;\n char S[N], T[N];\n int slen, tlen, lef[N], rig[N], cnt[255][255];\n inline int getID(char c) {\n if (c == 'R') return 0;\n if (c == 'G') return 1;\n if (c == 'B') return 2;\n throw;\n }\n int main() {\n scanf( %s , S + 1);\n slen = strlen(S + 1);\n scanf( %s , T + 1);\n tlen = strlen(T + 1);\n int l = 1, r = 1;\n while (l <= slen && r <= tlen) {\n lef[l] = r;\n r += S[l] == T[r];\n ++l;\n }\n slen = min(slen, l - 1);\n l = r = 1;\n while (l <= slen && r <= tlen) {\n rig[l] = r;\n l += S[l] == T[r];\n ++r;\n }\n tlen = min(tlen, r - 1);\n for (int i = l + bool(rig[l]); i <= slen; ++i) {\n rig[i] = tlen;\n }\n long long res = 0;\n for (int i = 1; i <= slen; ++i) {\n for (int j = max(1, lef[i - 1]); j < lef[i]; ++j) --cnt[T[j]][T[j - 1]];\n for (int j = 1 + rig[i - 1]; j <= rig[i]; ++j) ++cnt[T[j]][T[j - 1]];\n res += rig[i] - lef[i] + 1;\n if (S[i - 1] != S[i]) res -= cnt[S[i - 1]][S[i]];\n }\n printf( extra\n , res);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, m, k;\n long long ans;\n int main() {\n cin >> n >> m >> k;\n if (k > n + m - 2) {\n cout << -1 << endl;\n return 0;\n }\n if (n >= m) swap(n, m);\n if (k <= m - 1) {\n ans = (long long)(m / (k + 1)) * n;\n } else {\n ans = (long long)(n / (k - m + 2));\n }\n if (k <= n - 1) {\n ans = max(ans, (long long)(n / (k + 1)) * m);\n } else {\n ans = max(ans, (long long)(m / (k - n + 2)));\n }\n cout << ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MAXN = 110;\n int n, m, k;\n int h[MAXN];\n void load() {\n scanf( %d%d%d , &n, &m, &k);\n for (int i = 0; i < n; i++) scanf( %d , h + i);\n }\n bool solve() {\n long long sum = m;\n int ind = 0;\n while (ind < n - 1) {\n if (h[ind] >= h[ind + 1] - k) {\n int nxt = max(h[ind + 1] - k, 0);\n sum += h[ind] - nxt;\n } else {\n if (sum + h[ind] < h[ind + 1] - k) return false;\n sum -= h[ind + 1] - k - h[ind];\n }\n ind++;\n }\n return true;\n }\n int main() {\n int t;\n scanf( %d , &t);\n while (t--) {\n load();\n if (solve())\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 const int MAXN = 3e5 + 10;\n int n, k;\n int a[MAXN], f[MAXN];\n int bsL(int l, int r, int val) {\n int pos = -1;\n while (l <= r) {\n int mid = (l + r) >> 1;\n if (a[mid] >= val) {\n pos = mid;\n r = mid - 1;\n } else\n l = mid + 1;\n }\n return pos;\n }\n bool check(int x) {\n f[1] = 1;\n for (int i = 1, l = 1; i <= n; i++) {\n while (a[i] - a[l] > x) l++;\n f[i + 1] = (i >= k && f[i - k + 1] - f[l - 1] > 0);\n f[i + 1] += f[i];\n }\n return f[n + 1] - f[n] > 0;\n }\n int bs(int l, int r) {\n int pos = 0;\n while (l <= r) {\n int mid = (l + r) >> 1;\n if (check(mid)) {\n pos = mid;\n r = mid - 1;\n } else\n l = mid + 1;\n }\n return pos;\n }\n int main() {\n ios_base::sync_with_stdio(0);\n cin >> n >> k;\n for (int i = 1; i <= n; i++) cin >> a[i];\n sort(a + 1, a + 1 + n);\n cout << bs(0, 1e9);\n return 0;\n }\n "} @@ -149,7 +149,7 @@ {"func_code_string": "#include \n using namespace std;\n const int MAXN = 100010;\n const int MAXM = 20010;\n const int MAXNODE = 16 * MAXN;\n const int LOGMAXN = 50;\n const int INF = 0x3f3f3f3f;\n const double eps = 1e-9;\n int N, M;\n int b[MAXM], z[MAXM], x[3 * (MAXN + MAXM)];\n struct Tree {\n int x, h;\n double l, r;\n } a[MAXN];\n struct SegmentTree {\n double mul[MAXNODE];\n void build(int o, int L, int R) {\n mul[o] = 1;\n if (L >= R) return;\n int mid = L + (R - L) / 2;\n build(o << 1, L, mid);\n build(o << 1 | 1, mid + 1, R);\n }\n void pushdown(int o) {\n mul[o << 1] *= mul[o];\n mul[o << 1 | 1] *= mul[o];\n mul[o] = 1;\n }\n void update(int o, int L, int R, int ql, int qr, double p) {\n if (ql <= L && qr >= R) {\n mul[o] *= p;\n return;\n }\n pushdown(o);\n int mid = L + (R - L) / 2;\n if (ql <= mid) update(o << 1, L, mid, ql, qr, p);\n if (qr > mid) update(o << 1 | 1, mid + 1, R, ql, qr, p);\n }\n double query(int o, int L, int R, int pos) {\n if (L >= R) return mul[o];\n pushdown(o);\n int mid = L + (R - L) / 2;\n double ans;\n if (pos <= mid)\n ans = query(o << 1, L, mid, pos);\n else\n ans = query(o << 1 | 1, mid + 1, R, pos);\n return ans;\n }\n } tree;\n int main() {\n while (scanf( %d%d , &N, &M) != EOF) {\n int k = 0;\n for (int i = 0; i < N; i++) {\n scanf( %d%d%lf%lf , &a[i].x, &a[i].h, &a[i].l, &a[i].r);\n a[i].l /= 100;\n a[i].r /= 100;\n x[k++] = a[i].x;\n x[k++] = a[i].x - a[i].h;\n x[k++] = a[i].x + a[i].h;\n }\n for (int i = 0; i < M; i++) {\n scanf( %d%d , &b[i], &z[i]);\n x[k++] = b[i];\n }\n sort(x, x + k);\n k = unique(x, x + k) - x;\n tree.build(1, 1, k);\n for (int i = 0; i < N; i++) {\n int qm = lower_bound(x, x + k, a[i].x) - x + 1;\n int ql = lower_bound(x, x + k, a[i].x - a[i].h) - x + 1,\n qr = lower_bound(x, x + k, a[i].x + a[i].h) - x + 1;\n tree.update(1, 1, k, ql, qm - 1, (1 - a[i].l));\n tree.update(1, 1, k, qm + 1, qr, (1 - a[i].r));\n }\n double ans = 0;\n for (int i = 0; i < M; i++) {\n int pos = lower_bound(x, x + k, b[i]) - x + 1;\n ans += z[i] * tree.query(1, 1, k, pos);\n }\n printf( %.10lf\n , ans);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n const int N = 502;\n void sw(float* x) {\n float tmp = *x;\n *x = *(x + 2);\n *(x + 2) = *(x + 1);\n *(x + 1) = tmp;\n }\n int main() {\n int _t;\n scanf( %d , &_t);\n while (_t--) {\n static float arr[N];\n static int anss[N * N];\n static int tm[N];\n memset(tm, 0, sizeof(tm));\n int n;\n scanf( %d , &n);\n int f2 = -1;\n for (int i = 1; i <= n; i++) {\n int a;\n scanf( %d , &a);\n tm[a]++;\n if (tm[a] == 2) f2 = a;\n arr[i] = a + 0.0001 * tm[a];\n }\n int nx = 0;\n for (int i = 1; i < n; i++)\n for (int j = i + 1; j <= n; j++)\n if (arr[i] > arr[j]) nx++;\n if (nx & 1) {\n if (f2 != -1) {\n int f21 = -1, f22 = -1;\n for (int i = 1; i <= n; i++)\n if (((int)arr[i]) == f2) {\n if (f21 == -1)\n f21 = i;\n else if (f22 == -1)\n f22 = i;\n else\n break;\n }\n std::swap(arr[f21], arr[f22]);\n nx++;\n } else {\n printf( -1\n );\n continue;\n }\n }\n int ans = 0;\n while (nx) {\n for (int i = 1; i <= n - 2; i++) {\n if (arr[i] < arr[i + 2] && arr[i + 2] < arr[i + 1] ||\n arr[i] > arr[i + 2] && arr[i + 2] > arr[i + 1]) {\n sw(arr + i);\n anss[++ans] = i;\n }\n if (arr[i] < arr[i + 1] && arr[i] > arr[i + 2] ||\n arr[i] > arr[i + 1] && arr[i + 1] > arr[i + 2]) {\n sw(arr + i);\n nx -= 2;\n anss[++ans] = i;\n }\n }\n }\n printf( %d\n , ans);\n for (int i = 1; i <= ans; i++) printf( %d , anss[i]);\n printf( \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 string test;\n cin >> test;\n for (int i = 0; i < m; i++) {\n int l, r;\n char c1, c2;\n cin >> l >> r >> c1 >> c2;\n l -= 1;\n r -= 1;\n for (; l <= r; l++) {\n if (test[l] == c1) {\n test[l] = c2;\n }\n }\n }\n cout << test << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int maxn = 1e5 + 100;\n const long long mod = 1e9 + 7;\n char s[maxn];\n int num[55];\n long long dp[maxn];\n long long tmp[maxn];\n long long quesnum[55][55];\n long long ques[55][55];\n long long inv[maxn], fac[maxn], invf[maxn];\n void init(int hf) {\n inv[1] = 1;\n for (int i = 2; i < maxn; i++)\n inv[i] = ((mod - mod / i) * inv[mod % i]) % mod;\n fac[0] = 1;\n for (int i = 1; i < maxn; i++) fac[i] = (fac[i - 1] * (long long)i) % mod;\n invf[0] = 1;\n for (int i = 1; i < maxn; i++) invf[i] = (invf[i - 1] * inv[i]) % mod;\n memset(dp, 0, sizeof(dp));\n memset(ques, -1, sizeof(ques));\n dp[0] = 1;\n for (int i = 0; i < 55; i++) {\n if (!num[i]) continue;\n for (int j = hf; j >= num[i]; j--) {\n dp[j] = (dp[j] + dp[j - num[i]]) % mod;\n }\n }\n for (int i = 0; i < 52; i++) {\n for (int j = i; j < 52; j++) {\n for (int k = 0; k <= hf; k++) tmp[k] = dp[k];\n for (int k = num[i]; k <= hf; k++)\n tmp[k] = (tmp[k] - tmp[k - num[i]] + mod) % mod;\n if (i != j)\n for (int k = num[j]; k <= hf; k++)\n tmp[k] = (tmp[k] - tmp[k - num[j]] + mod) % mod;\n quesnum[i][j] = quesnum[j][i] = tmp[hf];\n }\n }\n }\n int main() {\n scanf( %s , s);\n memset(num, 0, sizeof(num));\n int len = strlen(s);\n int hf = len / 2;\n for (int i = 0; i < len; i++) {\n if (s[i] >= 'a' && s[i] <= 'z')\n num[s[i] - 'a']++;\n else\n num[s[i] - 'A' + 26]++;\n }\n init(hf);\n int q;\n scanf( %d , &q);\n int x, y;\n while (q--) {\n scanf( %d%d , &x, &y);\n x--;\n y--;\n int idx, idy;\n if (s[x] >= 'a' && s[x] <= 'z')\n idx = s[x] - 'a';\n else\n idx = s[x] - 'A' + 26;\n if (s[y] >= 'a' && s[y] <= 'z')\n idy = s[y] - 'a';\n else\n idy = s[y] - 'A' + 26;\n if (ques[idx][idy] != -1) {\n printf( %I64d\n , ques[idx][idy]);\n continue;\n }\n long long ans;\n if (idx == idy) {\n if (num[idx] > hf) {\n printf( 0\n );\n ques[idx][idx] = 0;\n continue;\n }\n long long cc =\n ((fac[hf] * invf[num[idx]]) % mod * invf[hf - num[idx]]) % mod;\n ans = ((cc * fac[hf - num[idx]]) % mod * fac[hf]) % mod;\n } else {\n if (num[idx] + num[idy] > hf) {\n ques[idx][idy] = ques[idy][idx] = 0;\n printf( 0\n );\n continue;\n }\n int numx = num[idx], numy = num[idy];\n int num_hfx = hf - numx;\n long long cc1 = ((fac[hf] * invf[numx]) % mod * invf[hf - numx]) % mod;\n long long cc2 =\n ((fac[num_hfx] * invf[numy]) % mod * invf[num_hfx - numy]) % mod;\n ans = (((cc1 * cc2) % mod * fac[hf]) % mod * fac[hf - numx - numy]) % mod;\n }\n for (int i = 0; i < 55; i++) {\n if (i == idx || i == idy) continue;\n ans = (ans * invf[num[i]]) % mod;\n }\n ans = (ans * quesnum[idx][idy]) % mod;\n ans = (ans * 2) % mod;\n ques[idx][idy] = ques[idy][idx] = ans;\n printf( %I64d\n , ans);\n }\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int maxn = 1e5 + 100;\n const long long mod = 1e9 + 7;\n char s[maxn];\n int num[55];\n long long dp[maxn];\n long long tmp[maxn];\n long long quesnum[55][55];\n long long ques[55][55];\n long long inv[maxn], fac[maxn], invf[maxn];\n void init(int hf) {\n inv[1] = 1;\n for (int i = 2; i < maxn; i++)\n inv[i] = ((mod - mod / i) * inv[mod % i]) % mod;\n fac[0] = 1;\n for (int i = 1; i < maxn; i++) fac[i] = (fac[i - 1] * (long long)i) % mod;\n invf[0] = 1;\n for (int i = 1; i < maxn; i++) invf[i] = (invf[i - 1] * inv[i]) % mod;\n memset(dp, 0, sizeof(dp));\n memset(ques, -1, sizeof(ques));\n dp[0] = 1;\n for (int i = 0; i < 55; i++) {\n if (!num[i]) continue;\n for (int j = hf; j >= num[i]; j--) {\n dp[j] = (dp[j] + dp[j - num[i]]) % mod;\n }\n }\n for (int i = 0; i < 52; i++) {\n for (int j = i; j < 52; j++) {\n for (int k = 0; k <= hf; k++) tmp[k] = dp[k];\n for (int k = num[i]; k <= hf; k++)\n tmp[k] = (tmp[k] - tmp[k - num[i]] + mod) % mod;\n if (i != j)\n for (int k = num[j]; k <= hf; k++)\n tmp[k] = (tmp[k] - tmp[k - num[j]] + mod) % mod;\n quesnum[i][j] = quesnum[j][i] = tmp[hf];\n }\n }\n }\n int main() {\n scanf( %s , s);\n memset(num, 0, sizeof(num));\n int len = strlen(s);\n int hf = len / 2;\n for (int i = 0; i < len; i++) {\n if (s[i] >= 'a' && s[i] <= 'z')\n num[s[i] - 'a']++;\n else\n num[s[i] - 'A' + 26]++;\n }\n init(hf);\n int q;\n scanf( %d , &q);\n int x, y;\n while (q--) {\n scanf( %d%d , &x, &y);\n x--;\n y--;\n int idx, idy;\n if (s[x] >= 'a' && s[x] <= 'z')\n idx = s[x] - 'a';\n else\n idx = s[x] - 'A' + 26;\n if (s[y] >= 'a' && s[y] <= 'z')\n idy = s[y] - 'a';\n else\n idy = s[y] - 'A' + 26;\n if (ques[idx][idy] != -1) {\n printf( extra\n , ques[idx][idy]);\n continue;\n }\n long long ans;\n if (idx == idy) {\n if (num[idx] > hf) {\n printf( 0\n );\n ques[idx][idx] = 0;\n continue;\n }\n long long cc =\n ((fac[hf] * invf[num[idx]]) % mod * invf[hf - num[idx]]) % mod;\n ans = ((cc * fac[hf - num[idx]]) % mod * fac[hf]) % mod;\n } else {\n if (num[idx] + num[idy] > hf) {\n ques[idx][idy] = ques[idy][idx] = 0;\n printf( 0\n );\n continue;\n }\n int numx = num[idx], numy = num[idy];\n int num_hfx = hf - numx;\n long long cc1 = ((fac[hf] * invf[numx]) % mod * invf[hf - numx]) % mod;\n long long cc2 =\n ((fac[num_hfx] * invf[numy]) % mod * invf[num_hfx - numy]) % mod;\n ans = (((cc1 * cc2) % mod * fac[hf]) % mod * fac[hf - numx - numy]) % mod;\n }\n for (int i = 0; i < 55; i++) {\n if (i == idx || i == idy) continue;\n ans = (ans * invf[num[i]]) % mod;\n }\n ans = (ans * quesnum[idx][idy]) % mod;\n ans = (ans * 2) % mod;\n ques[idx][idy] = ques[idy][idx] = ans;\n printf( extra\n , ans);\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MAXN = 500000 + 10;\n int a[MAXN];\n int n, m, ans, tp, tot;\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; ++i) scanf( %d , a + i);\n ans = n;\n sort(a + 1, a + 1 + n);\n for (int i = n / 2; i >= 1; --i)\n if (a[ans] >= a[i] * 2) --ans;\n printf( %d\n , ans);\n }\n "} {"func_code_string": "#include \n using namespace std;\n char a[500001 + 10], b[500001 + 10], s[(500001 << 1) + 10];\n int n, m;\n struct BIT {\n long long c[500001 << 1];\n long long query(int x) {\n if (x <= 0) return 0;\n long long ans = 0;\n for (int i = x; i; i -= (i & -i)) ans += c[i];\n return ans;\n }\n void add(int x, long long p) {\n if (x <= 0) x = 1;\n for (int i = x; i <= 1000000; i += (i & -i)) c[i] += p;\n }\n } b1, b2;\n int za[500001 * 3], zb[500001 * 3];\n char mod[500001 * 3];\n void zfunc(char *s, int n, int *z) {\n int l = 0, r = 0;\n z[1] = n;\n int pt;\n for (int i = 2; i <= n; ++i) {\n if (r < i) {\n for (pt = i; pt <= n && s[pt] == s[pt - i + 1]; ++pt)\n ;\n --pt;\n z[i] = pt - i + 1;\n if (z[i]) l = i, r = pt;\n } else {\n int b = r - i + 1, i_ = i - l + 1;\n if (z[i_] < b)\n z[i] = z[i_];\n else {\n for (pt = r + 1; pt <= n && s[pt] == s[pt - i + 1]; ++pt)\n ;\n --pt;\n z[i] = pt - i + 1;\n l = i, r = pt;\n }\n }\n }\n }\n int main() {\n scanf( %d%d , &n, &m);\n scanf( %s%s%s , a + 1, b + 1, s + 1);\n memcpy(mod + 1, s + 1, m - 1);\n mod[m] = '$';\n memcpy(mod + m + 1, a + 1, n);\n zfunc(mod, n + m, za);\n for (int i = 1; i <= n; ++i) za[i] = za[i + m];\n reverse(s + 1, s + 1 + m);\n reverse(b + 1, b + 1 + n);\n memcpy(mod + 1, s + 1, m - 1);\n mod[m] = '$';\n memcpy(mod + m + 1, b + 1, n);\n zfunc(mod, n + m, zb);\n for (int i = 1; i <= n; ++i) zb[i] = zb[i + m];\n reverse(zb + 1, zb + 1 + n);\n int cur = 1;\n long long ans = 0;\n for (int i = 1; i <= n; ++i) {\n while (cur <= min(i + m - 2, n))\n b1.add(m - 1 - zb[cur], 1), b2.add(m - 1 - zb[cur], zb[cur]), ++cur;\n ans += 1ll * b1.query(za[i]) * (za[i] - m + 1) + b2.query(za[i]);\n b1.add(m - 1 - zb[i], -1), b2.add(m - 1 - zb[i], -zb[i]);\n }\n printf( %lld\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long int dec(string s, int n) {\n long long int r = 0, p = 0, l = s.size() - 1, tmp;\n while (l >= 0) {\n if (isalpha(s[l]))\n tmp = s[l] - 55;\n else\n tmp = s[l] - 48;\n int prod = 1;\n for (int k = 0; k < p; k++) prod *= n;\n r += prod * tmp;\n p++;\n l--;\n }\n return r;\n }\n int main() {\n string s, a, b;\n int mx = 0;\n cin >> s;\n int i = 0;\n while (s[i] != ':') {\n a.push_back(s[i]);\n if (mx < s[i]) mx = s[i];\n i++;\n }\n i++;\n while (s[i] != '\0') {\n b.push_back(s[i]);\n if (mx < s[i]) mx = s[i];\n i++;\n }\n int bg;\n bg = mx < 65 ? mx - 48 : mx - 55;\n int beg = max(2, bg + 1);\n if (dec(a, beg) >= 24 || dec(b, beg) >= 60) {\n cout << 0 << endl;\n return 0;\n }\n if (dec(a, 100) < 24 && dec(b, 100) < 60) {\n cout << -1 << endl;\n return 0;\n }\n for (i = beg;; i++) {\n if (dec(a, i) < 24 && dec(b, i) < 60) {\n cout << i << ;\n } else\n break;\n }\n return 0;\n }\n "} @@ -158,7 +158,7 @@ {"func_code_string": "#include \n using namespace std;\n struct pen {\n int color;\n int diameter;\n };\n int n, m, u, v;\n pen marker[100000], cap[100000];\n struct match {\n vector marker;\n vector cap;\n };\n match singleMatch[1000 + 1];\n match doubleMatch[1000 + 1][1000 + 1];\n int main(int argc, char *argv[]) {\n u = 0, v = 0;\n cin >> n >> m;\n for (int i = 0; i < n; i++) {\n int color, diameter;\n cin >> color >> diameter;\n marker[i].color = color;\n marker[i].diameter = diameter;\n singleMatch[diameter].marker.push_back(marker[i]);\n doubleMatch[diameter][color].marker.push_back(marker[i]);\n }\n for (int i = 0; i < m; i++) {\n int color, diameter;\n cin >> color >> diameter;\n cap[i].color = color;\n cap[i].diameter = diameter;\n singleMatch[diameter].cap.push_back(marker[i]);\n doubleMatch[diameter][color].cap.push_back(cap[i]);\n }\n for (int i = 1; i < 1000 + 1; i++) {\n vector tempM = singleMatch[i].marker;\n vector tempC = singleMatch[i].cap;\n int temp1 = (int)tempM.size();\n int temp2 = (int)tempC.size();\n if (temp1 > 0 && temp2 > 0) u += min(temp1, temp2);\n }\n for (int i = 1; i < 1000 + 1; i++)\n for (int j = 1; j < 1000 + 1; j++) {\n vector tempM = doubleMatch[i][j].marker;\n vector tempC = doubleMatch[i][j].cap;\n int temp1 = (int)tempM.size();\n int temp2 = (int)tempC.size();\n if (temp1 > 0 && temp2 > 0) v += min(temp1, temp2);\n }\n cout << u << << v << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int inf = 109;\n const int mod = 1000000007;\n long long cnt[inf];\n long long dp[inf];\n long long temp[inf][inf];\n long long sol[inf][inf];\n long long bs[inf][inf];\n int main() {\n int n, x, a;\n scanf( %d%d , &n, &x);\n for (int i = 0; i < n; ++i) {\n scanf( %d , &a);\n cnt[a]++;\n }\n dp[0] = 1;\n int all = 0;\n for (int i = 1; i <= 100; ++i) {\n for (int j = 1; j <= i; ++j) dp[i] = (dp[i] + dp[i - j] * cnt[j]) % mod;\n all = (all + dp[i]) % mod;\n }\n dp[0] = all;\n for (int i = 1; i <= 50; ++i) swap(dp[i], dp[101 - i]);\n for (int i = 1; i <= 100; ++i) sol[i][i] = 1, bs[0][i] = bs[1][i] = cnt[i];\n sol[0][0] = bs[0][0] = 1;\n for (int i = 2; i <= 100; ++i) bs[i][i - 1] = 1;\n if (x <= 100) {\n int ad = 0;\n for (int i = 100; i > 0 && x > 0; --i, --x) ad = (ad + dp[i]) % mod;\n printf( %d\n , ad + 1);\n return 0;\n }\n x -= 100;\n while (x) {\n if (x & 1) {\n for (int i = 0; i <= 100; ++i)\n for (int j = 0; j <= 100; ++j) {\n temp[i][j] = 0;\n for (int u = 0; u <= 100; ++u)\n temp[i][j] = (temp[i][j] + sol[i][u] * bs[u][j]) % mod;\n }\n for (int i = 0; i <= 100; ++i)\n for (int j = 0; j <= 100; ++j) sol[i][j] = temp[i][j];\n }\n x = x >> 1;\n for (int i = 0; i <= 100; ++i)\n for (int j = 0; j <= 100; ++j) {\n temp[i][j] = 0;\n for (int u = 0; u <= 100; ++u)\n temp[i][j] = (temp[i][j] + bs[i][u] * bs[u][j]) % mod;\n }\n for (int i = 0; i <= 100; ++i)\n for (int j = 0; j <= 100; ++j) bs[i][j] = temp[i][j];\n }\n int ans = 0;\n for (int i = 0; i <= 100; ++i) ans = (ans + sol[0][i] * dp[i]) % mod;\n printf( %d\n , (ans + 1) % mod);\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long INF = 1e9 + 7;\n const int N = 4e5 + 10;\n const int M = 22;\n class SegmentTree {\n public:\n int ql, qr, qx;\n int xorv[N];\n int sumv[N];\n void init() {\n memset((xorv), (0), sizeof(xorv));\n memset((sumv), (0), sizeof(sumv));\n }\n void set(int ql, int qr, int qx) {\n this->ql = ql;\n this->qr = qr;\n this->qx = qx;\n }\n void pushdown(int o, int len) {\n if (xorv[o]) {\n xorv[o << 1] ^= 1;\n xorv[o << 1 | 1] ^= 1;\n sumv[o << 1] = (len - len / 2) - sumv[o << 1];\n sumv[o << 1 | 1] = len / 2 - sumv[o << 1 | 1];\n xorv[o] = 0;\n }\n }\n void maintain(int o) { sumv[o] = sumv[o << 1] + sumv[o << 1 | 1]; }\n int query(int l, int r, int o = 1) {\n if (ql <= l && qr >= r) {\n return sumv[o];\n }\n int mid = (l + r) >> 1;\n pushdown(o, r - l + 1);\n int ans = 0;\n if (ql <= mid) ans += query(l, mid, o << 1);\n if (qr > mid) ans += query(mid + 1, r, o << 1 | 1);\n return ans;\n }\n void update(int l, int r, int o = 1) {\n if (ql <= l && qr >= r) {\n xorv[o] ^= 1;\n sumv[o] = r - l + 1 - sumv[o];\n return;\n }\n int mid = (l + r) >> 1;\n pushdown(o, r - l + 1);\n if (ql <= mid) update(l, mid, o << 1);\n if (qr > mid) update(mid + 1, r, o << 1 | 1);\n maintain(o);\n }\n } st[M];\n int main() {\n for (int i = 0; i < M; i++) st[i].init();\n int n;\n cin >> n;\n for (int i = 1; i <= n; i++) {\n int x;\n cin >> x;\n for (int j = 0; j < M; j++) {\n if (x >> j & 1) st[j].set(i, i, 1), st[j].update(1, n);\n }\n }\n int q;\n cin >> q;\n while (q--) {\n int op;\n cin >> op;\n if (op == 1) {\n int l, r;\n cin >> l >> r;\n long long ans = 0;\n for (int i = 0; i < M; i++) {\n st[i].set(l, r, 0);\n ans += (1LL << i) * st[i].query(1, n);\n }\n cout << ans << '\n';\n } else {\n int l, r, x;\n cin >> l >> r >> x;\n for (int i = 0; i < M; i++) {\n if (x >> i & 1) st[i].set(l, r, 1), st[i].update(1, n);\n }\n }\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n struct data {\n int s, m, r, t;\n int operator<(const data &b) const { return t < b.t; }\n void get() {\n scanf( %d , &s);\n scanf( %d , &m);\n scanf( %d , &r);\n t = r ? (m / r + (m % r > 0)) : 2e9;\n }\n int calc(int o) { return min(1ll * m, s + 1ll * r * o); }\n } a[20][100005];\n int T[100005 << 2];\n long long R[20][100005], sum[20][100005], ans;\n int n, Q, t, ql, qr;\n void Build(int x, int l, int r, int d) {\n T[x] = -2;\n if (l == r) {\n a[d][l].get();\n R[d][l] = R[d][l - 1] + a[d][l].r;\n sum[d][l] = sum[d][l - 1] + a[d][l].m;\n return;\n }\n int mid = (l + r) >> 1;\n Build(x << 1, l, mid, d + 1);\n Build(x << 1 | 1, mid + 1, r, d + 1);\n for (int i = l; i <= r; i++) a[d][i] = a[d + 1][i];\n sort(a[d] + l, a[d] + r + 1);\n for (int i = l; i <= r; i++) R[d][i] = R[d][i - 1] + a[d][i].r;\n for (int i = l; i <= r; i++) sum[d][i] = sum[d][i - 1] + a[d][i].m;\n }\n void Find(int x, int l, int r, int d) {\n if (ql <= l && r <= qr && T[x] != -1) {\n if (T[x] == -2) {\n for (int i = l; i <= r; i++) ans += a[d][i].calc(t);\n T[x] = t;\n return;\n }\n data tmp = (data){0, 0, 0, t - T[x]};\n int id = upper_bound(a[d] + l, a[d] + r + 1, tmp) - a[d];\n ans += 1ll * (R[d][r] - R[d][id - 1]) * (t - T[x]) + sum[d][id - 1] -\n sum[d][l - 1];\n T[x] = t;\n return;\n }\n if (T[x] >= 0) T[x << 1] = T[x << 1 | 1] = T[x];\n int mid = (l + r) >> 1;\n if (ql <= mid) Find(x << 1, l, mid, d + 1);\n if (qr > mid) Find(x << 1 | 1, mid + 1, r, d + 1);\n T[x] = (T[x << 1] == T[x << 1 | 1]) ? T[x << 1] : -1;\n }\n int main() {\n scanf( %d , &n);\n Build(1, 1, n, 0);\n scanf( %d , &Q);\n while (Q--) {\n scanf( %d , &t);\n scanf( %d , &ql);\n scanf( %d , &qr);\n ans = 0;\n Find(1, 1, n, 0);\n printf( %I64d\n , ans);\n }\n }\n "} +{"func_code_string": "#include \n using namespace std;\n struct data {\n int s, m, r, t;\n int operator<(const data &b) const { return t < b.t; }\n void get() {\n scanf( %d , &s);\n scanf( %d , &m);\n scanf( %d , &r);\n t = r ? (m / r + (m % r > 0)) : 2e9;\n }\n int calc(int o) { return min(1ll * m, s + 1ll * r * o); }\n } a[20][100005];\n int T[100005 << 2];\n long long R[20][100005], sum[20][100005], ans;\n int n, Q, t, ql, qr;\n void Build(int x, int l, int r, int d) {\n T[x] = -2;\n if (l == r) {\n a[d][l].get();\n R[d][l] = R[d][l - 1] + a[d][l].r;\n sum[d][l] = sum[d][l - 1] + a[d][l].m;\n return;\n }\n int mid = (l + r) >> 1;\n Build(x << 1, l, mid, d + 1);\n Build(x << 1 | 1, mid + 1, r, d + 1);\n for (int i = l; i <= r; i++) a[d][i] = a[d + 1][i];\n sort(a[d] + l, a[d] + r + 1);\n for (int i = l; i <= r; i++) R[d][i] = R[d][i - 1] + a[d][i].r;\n for (int i = l; i <= r; i++) sum[d][i] = sum[d][i - 1] + a[d][i].m;\n }\n void Find(int x, int l, int r, int d) {\n if (ql <= l && r <= qr && T[x] != -1) {\n if (T[x] == -2) {\n for (int i = l; i <= r; i++) ans += a[d][i].calc(t);\n T[x] = t;\n return;\n }\n data tmp = (data){0, 0, 0, t - T[x]};\n int id = upper_bound(a[d] + l, a[d] + r + 1, tmp) - a[d];\n ans += 1ll * (R[d][r] - R[d][id - 1]) * (t - T[x]) + sum[d][id - 1] -\n sum[d][l - 1];\n T[x] = t;\n return;\n }\n if (T[x] >= 0) T[x << 1] = T[x << 1 | 1] = T[x];\n int mid = (l + r) >> 1;\n if (ql <= mid) Find(x << 1, l, mid, d + 1);\n if (qr > mid) Find(x << 1 | 1, mid + 1, r, d + 1);\n T[x] = (T[x << 1] == T[x << 1 | 1]) ? T[x << 1] : -1;\n }\n int main() {\n scanf( %d , &n);\n Build(1, 1, n, 0);\n scanf( %d , &Q);\n while (Q--) {\n scanf( %d , &t);\n scanf( %d , &ql);\n scanf( %d , &qr);\n ans = 0;\n Find(1, 1, n, 0);\n printf( extra\n , ans);\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct Edge {\n int v;\n Edge *link;\n } edge[400010 * 2], *adj[200010], *tree[200010 * 2];\n int totE, con, root, currT, top, top1;\n int totCut, totBi;\n int dep[200010], deps[200010], num[200010], dfn[200010], lowlink[200010],\n cut[200010], bi[200010], color[200010];\n int temp[200010], st1[200010], st2[200010], st3[200010], st4[200010],\n f[200010 * 2];\n int used[200010 * 2], odd[200010 * 2];\n int fa[200010][20];\n int LOG[200010];\n void addEdge(int u, int v) {\n Edge *p = &edge[totE++];\n p->v = v;\n p->link = adj[u];\n adj[u] = p;\n }\n void addTree(int u, int v) {\n Edge *p = &edge[totE++];\n p->v = v;\n p->link = tree[u];\n tree[u] = p;\n }\n void dfs(int u, int pre) {\n dep[u] = dep[pre] + 1;\n dfn[u] = lowlink[u] = ++currT;\n num[u] = con;\n Edge *p = adj[u];\n int cnt = 0;\n bool flag = false;\n while (p) {\n if (!dfn[p->v]) {\n ++cnt;\n dfs(p->v, u);\n lowlink[u] = min(lowlink[u], lowlink[p->v]);\n if (lowlink[p->v] >= dfn[u]) flag = true;\n } else if (p->v != pre)\n lowlink[u] = min(lowlink[u], dfn[p->v]);\n p = p->link;\n }\n if (flag && (u != root || cnt > 1)) cut[u] = ++totCut;\n }\n bool dfs2(int u) {\n Edge *p = adj[u];\n while (p) {\n if (bi[p->v] == totBi) {\n if (color[p->v] == -1) {\n color[p->v] = !color[u];\n if (!dfs2(p->v)) return false;\n } else if (color[p->v] == color[u])\n return false;\n }\n p = p->link;\n }\n return true;\n }\n void solve() {\n ++totBi;\n int cnt = 0;\n for (int i = 0; i < top1; ++i) {\n int u = st3[i], v = st4[i];\n bi[u] = totBi;\n bi[v] = totBi;\n color[u] = color[v] = -1;\n if (cut[u]) temp[cnt++] = cut[u];\n if (cut[v]) temp[cnt++] = cut[v];\n }\n sort(temp, temp + cnt);\n for (int i = 0; i < cnt; ++i)\n if (i == 0 || temp[i] != temp[i - 1]) {\n addTree(temp[i], totCut + totBi);\n addTree(totCut + totBi, temp[i]);\n }\n color[st3[0]] = 0;\n odd[totBi] = !dfs2(st3[0]);\n }\n void dfs1(int u, int pre) {\n dfn[u] = lowlink[u] = ++currT;\n Edge *p = adj[u];\n while (p) {\n if (!dfn[p->v]) {\n st1[top] = u;\n st2[top++] = p->v;\n dfs1(p->v, u);\n lowlink[u] = min(lowlink[u], lowlink[p->v]);\n if (lowlink[p->v] >= dfn[u]) {\n top1 = 0;\n while (true) {\n --top;\n st3[top1] = st1[top];\n st4[top1++] = st2[top];\n if (st1[top] == u && st2[top] == p->v) break;\n }\n solve();\n }\n } else {\n if (dfn[u] > dfn[p->v] && p->v != pre) {\n st1[top] = u;\n st2[top++] = p->v;\n }\n if (p->v != pre) lowlink[u] = min(lowlink[u], dfn[p->v]);\n }\n p = p->link;\n }\n }\n void dfs3(int u, int pre) {\n deps[u] = deps[pre] + 1;\n used[u] = true;\n fa[u][0] = pre;\n if (u <= totCut)\n f[u] = 0;\n else\n f[u] = odd[u - totCut];\n f[u] += f[pre];\n Edge *p = tree[u];\n while (p) {\n if (!used[p->v]) dfs3(p->v, u);\n p = p->link;\n }\n }\n int LCA(int u, int v) {\n if (deps[u] < deps[v]) swap(u, v);\n int diff = deps[u] - deps[v];\n for (int i = 0; diff; ++i, diff >>= 1)\n if (diff & 1) u = fa[u][i];\n if (u == v) return u;\n int t = 19;\n for (int i = t; i >= 0; --i) {\n if (fa[u][i] != fa[v][i]) {\n u = fa[u][i];\n v = fa[v][i];\n }\n }\n return fa[u][0];\n }\n int main() {\n LOG[1] = 0;\n for (int i = 2; i < 200010; ++i) LOG[i] = (LOG[i] >> 1) + 1;\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 addEdge(u, v);\n addEdge(v, u);\n }\n dep[0] = -1;\n for (int i = 1; i <= n; ++i)\n if (!dfn[i]) {\n root = i;\n dfs(i, 0);\n ++con;\n }\n currT = 0;\n memset(dfn, 0, sizeof(dfn));\n for (int i = 1; i <= n; ++i)\n if (!dfn[i]) dfs1(i, 0);\n for (int i = 1; i <= totCut + totBi; ++i)\n if (!used[i]) dfs3(i, 0);\n for (int l = 1; (1 << l) <= totCut + totBi; ++l)\n for (int i = 1; i <= totCut + totBi; ++i)\n if (fa[i][l - 1] != 0) fa[i][l] = fa[fa[i][l - 1]][l - 1];\n int q;\n scanf( %d , &q);\n for (int i = 0; i < q; ++i) {\n int u, v;\n scanf( %d%d , &u, &v);\n if (u == v || num[u] != num[v])\n puts( No );\n else {\n int x, y;\n if (cut[u])\n x = cut[u];\n else\n x = totCut + bi[u];\n if (cut[v])\n y = cut[v];\n else\n y = totCut + bi[v];\n int lca = LCA(x, y);\n int sum = f[x] + f[y] - 2 * f[fa[lca][0]];\n if (sum > 0)\n puts( Yes );\n else if ((dep[u] + dep[v]) % 2 == 0)\n puts( No );\n else\n puts( Yes );\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n template \n inline void read(T &x) {\n x = 0;\n char c = getchar();\n while (!isdigit(c)) c = getchar();\n while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar();\n }\n using namespace std;\n int t;\n int pri[4001000], pcnt;\n bool depri[35001000];\n inline void init() {\n depri[1] = true;\n const int up = 3.5e7;\n for (int i = 2; i <= up; ++i) {\n if (!depri[i]) pri[++pcnt] = i;\n for (int j = 1; j <= pcnt && i * pri[j] <= up; ++j) {\n depri[i * pri[j]] = true;\n if (i % pri[j] == 0) break;\n }\n }\n }\n struct TC {\n int id;\n long long n, k;\n inline bool operator<(const TC &a) const { return k < a.k; }\n } tc[10100];\n bool ans[10100];\n long long p[100];\n int ptot;\n inline void Div(long long x) {\n ptot = 0;\n for (int i = 1; 1ll * pri[i] * pri[i] <= x; ++i) {\n if (x % pri[i] == 0) {\n p[++ptot] = pri[i];\n while (x % pri[i] == 0) x /= pri[i];\n }\n }\n if (x != 1) p[++ptot] = x;\n }\n struct node {\n int cur;\n long long val;\n inline bool operator<(const node &a) const { return val > a.val; }\n };\n priority_queue q;\n long long dis[100100];\n bool vis[100100];\n inline void Update(long long k) {\n Div(k);\n if (ptot <= 2) return;\n memset(dis, 0x3f, sizeof(dis));\n memset(vis, 0, sizeof(vis));\n dis[0] = 0;\n q.push((node){0, 0});\n while (!q.empty()) {\n int cur = (q.top()).cur;\n q.pop();\n if (vis[cur]) continue;\n vis[cur] = true;\n for (int i = 2; i <= ptot; ++i) {\n int to = (cur + p[i]) % p[1];\n long long val = (cur + p[i]) / p[1];\n if (dis[to] <= dis[cur] + val) continue;\n dis[to] = dis[cur] + val;\n q.push((node){to, dis[to]});\n }\n }\n }\n inline long long quickmul(long long x, long long k, long long P) {\n x = (x % P + P) % P;\n k = (k % P + P) % P;\n long long res = 0;\n while (k) {\n if (k & 1) res = (res + x) % P;\n x = (x + x) % P;\n k >>= 1;\n }\n return res;\n }\n long long exgcd(long long a, long long b, long long &x, long long &y) {\n if (!b) {\n x = 1;\n y = 0;\n return a;\n }\n long long g = exgcd(b, a % b, x, y);\n long long tmp = x;\n x = y;\n y = tmp - a / b * y;\n return g;\n }\n inline bool get_ans(long long n) {\n if (!ptot) return false;\n if (ptot == 1) return n % p[1] == 0;\n if (ptot == 2) {\n long long x = 0, y = 1;\n exgcd(p[1], p[2], x, y);\n x = quickmul(x, n, p[2]);\n if (1.0 * x * p[1] > 2e18) return false;\n return n >= x * p[1];\n }\n if (1.0 * dis[n % p[1]] * p[1] > 2e18) return false;\n return dis[n % p[1]] * p[1] + n % p[1] <= n;\n }\n signed main() {\n init();\n read(t);\n for (int i = 1; i <= t; ++i) {\n read(tc[i].n), read(tc[i].k);\n tc[i].id = i;\n }\n sort(tc + 1, tc + 1 + t);\n for (int i = 1; i <= t; ++i) {\n if (tc[i].k != tc[i - 1].k) Update(tc[i].k);\n ans[tc[i].id] = get_ans(tc[i].n);\n }\n for (int i = 1; i <= t; ++i) puts(ans[i] ? YES : NO );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long MOD = 1e9 + 7;\n std::vector factorial;\n void precompute_factorial(int ma) {\n factorial.push_back(1);\n for (int i = 1; i <= ma; i++)\n factorial.push_back((factorial.back() * i) % MOD);\n }\n long long power(long long base, int e) {\n long long result = 1;\n while (e) {\n if (e & 1) result = (result * base) % MOD;\n base = (base * base) % MOD;\n e >>= 1;\n }\n return result;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n, k;\n cin >> n >> k;\n precompute_factorial(n + 1);\n vector inv_factorial(n + 1, 1);\n for (int i = 2; i < n + 1; i++)\n inv_factorial[i] = power(factorial[i], MOD - 2);\n vector inv(n + 2);\n for (int i = 1; i < n + 2; i++) inv[i] = power(i, MOD - 2);\n if (k == 0) {\n cout << ((factorial[n] - factorial[n - 1] + MOD) % MOD) << endl;\n return 0;\n }\n vector dp2(n + 1, 1);\n vector xxx(n + 1, 1);\n long long sum = 0;\n for (int i = 1; i < n + 1; i++) {\n sum = (sum + xxx[i - 1]) % MOD;\n if (i - 1 - k >= 0) {\n sum = (sum + MOD - xxx[i - 1 - k]) % MOD;\n }\n dp2[i] = (sum * factorial[i - 1]) % MOD;\n xxx[i] = (dp2[i] * inv_factorial[i]) % MOD;\n }\n vector dp(n + 1, 0);\n long long last = 0;\n long long total = 0;\n for (int i = k + 2; i <= n; i++) {\n long long y = i - k - 2;\n long long tt = dp2[y];\n tt = (tt + MOD) % MOD;\n tt = (tt * inv_factorial[y]) % MOD;\n tt = (tt * inv[i - 1]) % MOD;\n last += tt;\n last %= MOD;\n total += last;\n total %= MOD;\n dp[i] = (factorial[i - 1] * total) % MOD;\n }\n cout << dp.back() << endl;\n }\n "} @@ -266,7 +266,7 @@ {"func_code_string": "#include \n using namespace std;\n void checkDefine();\n string x;\n string y;\n string z;\n int main() {\n cin >> x >> y;\n long long int n = x.size();\n for (int i = (0), _b = (n - 1); i <= _b; i++) {\n if (x[i] < y[i]) {\n cout << -1;\n return 0;\n }\n }\n cout << y;\n return 0;\n }\n void checkDefine() {\n long long int n, a[200005];\n map m;\n cin >> n;\n for (int i = (0), _b = (n - 1); i <= _b; i++) {\n cin >> a[i];\n m[a[i]]++;\n }\n string s;\n cin >> s;\n {\n cout << s \n << = ;\n cout << (s) << endl;\n };\n {\n cout << a \n << = ;\n for (int _ = 0, _a = (n); _ < _a; _++) cout << a[_] << ' ';\n cout << endl;\n };\n {\n cout << \ ------------\ \n << = ;\n cout << ( ------------ ) << endl;\n };\n for (__typeof(m.begin()) it = m.begin(); it != m.end(); ++it) {\n cout << it->first << << it->second << endl;\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n ostream &operator<<(ostream &os, map P) {\n for (auto const &vv : P) os << ( << vv.first << , << vv.second << ) ;\n return os;\n }\n template \n ostream &operator<<(ostream &os, set V) {\n os << [ ;\n for (auto const &vv : V) os << vv << , ;\n os << ] ;\n return os;\n }\n template \n ostream &operator<<(ostream &os, vector V) {\n os << [ ;\n for (auto const &vv : V) os << vv << , ;\n os << ] ;\n return os;\n }\n template \n ostream &operator<<(ostream &os, pair P) {\n os << ( << P.first << , << P.second << ) ;\n return os;\n }\n inline int fstoi(const string &str) {\n auto it = str.begin();\n bool neg = 0;\n int num = 0;\n if (*it == '-')\n neg = 1;\n else\n num = *it - '0';\n ++it;\n while (it < str.end()) num = num * 10 + (*it++ - '0');\n if (neg) num *= -1;\n return num;\n }\n inline void getch(char &x) {\n while (x = getchar_unlocked(), x < 33) {\n ;\n }\n }\n inline void getstr(string &str) {\n str.clear();\n char cur;\n while (cur = getchar_unlocked(), cur < 33) {\n ;\n }\n while (cur > 32) {\n str += cur;\n cur = getchar_unlocked();\n }\n }\n template \n inline bool sc(T &num) {\n bool neg = 0;\n int c;\n num = 0;\n while (c = getchar_unlocked(), c < 33) {\n if (c == EOF) return false;\n }\n if (c == '-') {\n neg = 1;\n c = getchar_unlocked();\n }\n for (; c > 47; c = getchar_unlocked()) num = num * 10 + c - 48;\n if (neg) num *= -1;\n return true;\n }\n template \n inline void sc(T &num, Args &...args) {\n bool neg = 0;\n int c;\n num = 0;\n while (c = getchar_unlocked(), c < 33) {\n ;\n }\n if (c == '-') {\n neg = 1;\n c = getchar_unlocked();\n }\n for (; c > 47; c = getchar_unlocked()) num = num * 10 + c - 48;\n if (neg) num *= -1;\n sc(args...);\n }\n int getsum(int a, int b) {\n int oor, oand;\n cout << and << a << ' ' << b << endl;\n cin >> oand;\n cout << or << a << ' ' << b << endl;\n cin >> oor;\n return oor + oand;\n }\n int main() {\n int n, k;\n cin >> n >> k;\n int cr;\n int x, y, z;\n x = getsum(1, 2);\n y = getsum(1, 3);\n z = getsum(2, 3);\n int a[n + 1];\n a[3] = (y + z - x) / 2;\n a[2] = (-y + z + x) / 2;\n a[1] = (y - z + x) / 2;\n for (auto i = (4); i <= (n); ++i) {\n int wh = getsum(1, i);\n a[i] = wh - a[1];\n }\n sort(a + 1, a + n + 1);\n cout << finish << a[k] << endl;\n cout << a[k] << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int INF = 0x3f3f3f3f;\n const long long LINF = 0x3f3f3f3f3f3f3f3fll;\n const long double pi = acos(-1);\n const int MOD = 1e9 + 7;\n const int N = 2e5 + 100;\n int tr_min[4 * N][1 << 5];\n int tr_max[4 * N][1 << 5];\n vector cara[N];\n int n, k;\n void build(int node, int b, int e) {\n if (b == e) {\n for (int cord = 0; cord < (1 << k); cord++) {\n long long x = 0;\n for (int i = 0; i < k; i++) {\n if (cord & (1 << i))\n x += cara[b][i];\n else\n x -= cara[b][i];\n }\n tr_max[node][cord] = tr_min[node][cord] = x;\n }\n } else {\n int mid = (b + e) / 2;\n build(2 * node, b, mid);\n build(2 * node + 1, mid + 1, e);\n for (int i = 0; i < (1 << k); i++) {\n tr_max[node][i] = max(tr_max[2 * node][i], tr_max[2 * node + 1][i]);\n tr_min[node][i] = min(tr_min[2 * node][i], tr_min[2 * node + 1][i]);\n }\n }\n }\n void update(int node, int b, int e, int i, vector &cara) {\n if (e < i or b > i) return;\n if (b == e and b == i) {\n for (int cord = 0; cord < (1 << k); cord++) {\n long long x = 0;\n for (int i = 0; i < k; i++) {\n if (cord & (1 << i))\n x += cara[i];\n else\n x -= cara[i];\n }\n tr_max[node][cord] = tr_min[node][cord] = x;\n }\n return;\n }\n int mid = (b + e) / 2;\n update(2 * node, b, mid, i, cara);\n update(2 * node + 1, mid + 1, e, i, cara);\n for (int i = 0; i < (1 << k); i++) {\n tr_max[node][i] = max(tr_max[2 * node][i], tr_max[2 * node + 1][i]);\n tr_min[node][i] = min(tr_min[2 * node][i], tr_min[2 * node + 1][i]);\n }\n }\n int query(int node, int b, int e, int i, int j, int cord) {\n if (e < i or b > j) return -INF;\n if (i <= b and j >= e) {\n return tr_max[node][cord];\n }\n int mid = (b + e) / 2;\n return max(query(2 * node, b, mid, i, j, cord),\n query(2 * node + 1, mid + 1, e, i, j, cord));\n }\n int query2(int node, int b, int e, int i, int j, int cord) {\n if (e < i or b > j) return INF;\n if (i <= b and j >= e) {\n return tr_min[node][cord];\n }\n int mid = (b + e) / 2;\n return min(query2(2 * node, b, mid, i, j, cord),\n query2(2 * node + 1, mid + 1, e, i, j, cord));\n }\n int proc(int cord, int l, int r) {\n int maxi = query(1, 1, n, l, r, cord);\n int mini = query2(1, 1, n, l, r, cord);\n return abs(mini - maxi);\n }\n int main() {\n scanf( %d %d , &n, &k);\n for (int i = 1; i <= n; i++) {\n for (int j = 0; j < k; j++) {\n int x;\n scanf( %d , &x);\n cara[i].push_back(x);\n }\n }\n int q;\n build(1, 1, n);\n scanf( %d , &q);\n while (q--) {\n int op;\n scanf( %d , &op);\n if (op == 1) {\n int idx;\n scanf( %d , &idx);\n vector val;\n for (int j = 0; j < k; j++) {\n int x;\n scanf( %d , &x);\n val.push_back(x);\n }\n update(1, 1, n, idx, val);\n } else {\n int l, r;\n scanf( %d %d , &l, &r);\n int resp = 0;\n for (int i = 0; i < (1 << k); i++) resp = max(proc(i, l, r), resp);\n printf( %d\n , resp);\n }\n }\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int MAXN = 100010;\n bool operator<(pair lhs, pair rhs) {\n return (lhs.first != rhs.first) ? (lhs.first < rhs.first)\n : (lhs.second < rhs.second);\n }\n set > inqUp, inqDown, pendUp, pendDown;\n int N, M, prsis, rci;\n long long T, Ans[MAXN];\n struct User {\n int id, ar, f, t;\n };\n bool cmp_Useraraz(User lhs, User rhs) { return lhs.ar < rhs.ar; }\n User u[MAXN], ru[MAXN];\n int Where;\n void Unload() {\n while ((inqUp.size()) && (inqUp.begin()->first == Where)) {\n Ans[inqUp.begin()->second] = T;\n inqUp.erase(inqUp.begin());\n rci++;\n }\n while (((inqDown.size()) && (--inqDown.end())->first == Where)) {\n Ans[(--inqDown.end())->second] = T;\n inqDown.erase(--inqDown.end());\n rci++;\n }\n }\n void Request() {\n while ((prsis != N) && (u[prsis + 1].ar == T)) {\n prsis++;\n if (u[prsis].f >= Where)\n pendUp.insert(make_pair(u[prsis].f, u[prsis].id));\n else\n pendDown.insert(make_pair(u[prsis].f, u[prsis].id));\n }\n }\n void Load(int id) {\n if (ru[id].t >= Where)\n inqUp.insert(make_pair(ru[id].t, id));\n else\n inqDown.insert(make_pair(ru[id].t, id));\n }\n void Load() {\n while ((pendUp.size()) && (pendUp.begin()->first == Where)) {\n Load(pendUp.begin()->second);\n pendUp.erase(pendUp.begin());\n }\n while ((pendDown.size()) && ((--pendDown.end())->first == Where)) {\n Load((--pendDown.end())->second);\n pendDown.erase(--pendDown.end());\n }\n }\n int main() {\n scanf( %d%d , &N, &M);\n int i;\n for (i = 1; i <= N; i++) {\n scanf( %d%d%d , &u[i].ar, &u[i].f, &u[i].t);\n u[i].id = i;\n ru[i] = u[i];\n }\n sort(u + 1, u + N + 1, cmp_Useraraz);\n inqUp.clear();\n inqDown.clear();\n pendUp.clear();\n pendDown.clear();\n Where = 1;\n T = 0;\n prsis = rci = 0;\n while (rci < N) {\n Unload();\n Request();\n Load();\n int pUp = inqUp.size() + pendUp.size();\n int pDown = inqDown.size() + pendDown.size();\n int Action = (pUp + pDown) ? ((pUp >= pDown) ? 1 : -1) : 0;\n int timePass = (prsis == N) ? M : (u[prsis + 1].ar - T);\n if (Action == 1) {\n if (pendUp.size())\n timePass = min(timePass, pendUp.begin()->first - Where);\n if (inqUp.size()) timePass = min(timePass, inqUp.begin()->first - Where);\n }\n if (Action == -1) {\n if (pendDown.size())\n timePass = min(timePass, Where - (--pendDown.end())->first);\n if (inqDown.size())\n timePass = min(timePass, Where - (--inqDown.end())->first);\n }\n T += timePass;\n Where += timePass * Action;\n }\n for (i = 1; i <= N; i++) printf( %I64d\n , Ans[i]);\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int MAXN = 100010;\n bool operator<(pair lhs, pair rhs) {\n return (lhs.first != rhs.first) ? (lhs.first < rhs.first)\n : (lhs.second < rhs.second);\n }\n set > inqUp, inqDown, pendUp, pendDown;\n int N, M, prsis, rci;\n long long T, Ans[MAXN];\n struct User {\n int id, ar, f, t;\n };\n bool cmp_Useraraz(User lhs, User rhs) { return lhs.ar < rhs.ar; }\n User u[MAXN], ru[MAXN];\n int Where;\n void Unload() {\n while ((inqUp.size()) && (inqUp.begin()->first == Where)) {\n Ans[inqUp.begin()->second] = T;\n inqUp.erase(inqUp.begin());\n rci++;\n }\n while (((inqDown.size()) && (--inqDown.end())->first == Where)) {\n Ans[(--inqDown.end())->second] = T;\n inqDown.erase(--inqDown.end());\n rci++;\n }\n }\n void Request() {\n while ((prsis != N) && (u[prsis + 1].ar == T)) {\n prsis++;\n if (u[prsis].f >= Where)\n pendUp.insert(make_pair(u[prsis].f, u[prsis].id));\n else\n pendDown.insert(make_pair(u[prsis].f, u[prsis].id));\n }\n }\n void Load(int id) {\n if (ru[id].t >= Where)\n inqUp.insert(make_pair(ru[id].t, id));\n else\n inqDown.insert(make_pair(ru[id].t, id));\n }\n void Load() {\n while ((pendUp.size()) && (pendUp.begin()->first == Where)) {\n Load(pendUp.begin()->second);\n pendUp.erase(pendUp.begin());\n }\n while ((pendDown.size()) && ((--pendDown.end())->first == Where)) {\n Load((--pendDown.end())->second);\n pendDown.erase(--pendDown.end());\n }\n }\n int main() {\n scanf( %d%d , &N, &M);\n int i;\n for (i = 1; i <= N; i++) {\n scanf( %d%d%d , &u[i].ar, &u[i].f, &u[i].t);\n u[i].id = i;\n ru[i] = u[i];\n }\n sort(u + 1, u + N + 1, cmp_Useraraz);\n inqUp.clear();\n inqDown.clear();\n pendUp.clear();\n pendDown.clear();\n Where = 1;\n T = 0;\n prsis = rci = 0;\n while (rci < N) {\n Unload();\n Request();\n Load();\n int pUp = inqUp.size() + pendUp.size();\n int pDown = inqDown.size() + pendDown.size();\n int Action = (pUp + pDown) ? ((pUp >= pDown) ? 1 : -1) : 0;\n int timePass = (prsis == N) ? M : (u[prsis + 1].ar - T);\n if (Action == 1) {\n if (pendUp.size())\n timePass = min(timePass, pendUp.begin()->first - Where);\n if (inqUp.size()) timePass = min(timePass, inqUp.begin()->first - Where);\n }\n if (Action == -1) {\n if (pendDown.size())\n timePass = min(timePass, Where - (--pendDown.end())->first);\n if (inqDown.size())\n timePass = min(timePass, Where - (--inqDown.end())->first);\n }\n T += timePass;\n Where += timePass * Action;\n }\n for (i = 1; i <= N; i++) printf( extra\n , Ans[i]);\n }\n "} {"func_code_string": "#include \n using namespace std;\n map mp;\n string check(string s) {\n for (int i = 0; i <= s.size() / 2; i++)\n if (s[i] != mp[s[s.size() - 1 - i]]) return NIE ;\n return TAK ;\n }\n int main() {\n mp['A'] = 'A';\n mp['b'] = 'd';\n mp['d'] = 'b';\n mp['H'] = 'H';\n mp['I'] = 'I';\n mp['M'] = 'M';\n mp['O'] = 'O';\n mp['o'] = 'o';\n mp['p'] = 'q';\n mp['q'] = 'p';\n mp['T'] = 'T';\n mp['U'] = 'U';\n mp['V'] = 'V';\n mp['v'] = 'v';\n mp['W'] = 'W';\n mp['w'] = 'w';\n mp['X'] = 'X';\n mp['x'] = 'x';\n mp['Y'] = 'Y';\n string s;\n cin >> s;\n cout << check(s) << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int a[3][3], b[3][3];\n for (int i = 0; i < 3; i++) {\n for (int j = 0; j < 3; j++) {\n cin >> a[i][j];\n a[i][j] %= 2;\n b[i][j] = 0;\n }\n }\n pair f[] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {0, 0}};\n for (int i = 0; i < 3; i++) {\n for (int j = 0; j < 3; j++) {\n for (auto m : f) {\n if (i + m.first < 3 && i + m.first > -1) {\n if (j + m.second < 3 && j + m.second > -1) {\n if (a[i + m.first][j + m.second] % 2) {\n b[i][j]++;\n b[i][j] %= 2;\n }\n }\n }\n }\n }\n }\n for (int i = 0; i < 3; i++) {\n for (int j = 0; j < 3; j++) {\n cout << (b[i][j] ^ 1);\n }\n cout << '\n';\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 200000;\n const long long mod = 1e9 + 7;\n long long fac[maxn + 5], inv[maxn + 5];\n long long f[2005];\n struct node {\n long long x, y;\n } data[2005];\n long long qmod(long long a, long long b) {\n long long ans = 1;\n a = a % mod;\n while (b) {\n if (b & 1) {\n ans = (ans * a) % mod;\n }\n b = b / 2;\n a = (a * a) % mod;\n }\n return ans;\n }\n void init() {\n fac[0] = 1;\n for (long long i = 1; i <= maxn; i++) {\n fac[i] = (fac[i - 1] * i) % mod;\n }\n }\n long long com(long long n, long long m) {\n if (n < m)\n return 0;\n else if (n == m)\n return 1;\n else\n return (fac[n] * qmod(fac[m] * fac[n - m], mod - 2)) % mod;\n }\n long long Lucas(long long n, long long m) {\n if (m == 0)\n return 1;\n else\n return (com(n % mod, m % mod) * Lucas(n / mod, m / mod)) % mod;\n }\n bool cmp(node a, node b) {\n if (a.x < b.x)\n return true;\n else if (a.x == b.x) {\n if (a.y < b.y)\n return true;\n else\n return false;\n } else\n return false;\n }\n int main(int argc, char const *argv[]) {\n long long h, w, n;\n init();\n scanf( %lld %lld %lld , &h, &w, &n);\n for (int i = 1; i <= n; i++) {\n scanf( %lld %lld , &data[i].x, &data[i].y);\n }\n sort(data + 1, data + 1 + n, cmp);\n memset(f, 0, sizeof(f));\n n++;\n data[n].x = h;\n data[n].y = w;\n for (int i = 1; i <= n; i++) {\n long long dx, dy;\n dx = data[i].x - 1;\n dy = data[i].y - 1;\n f[i] = Lucas(dx + dy, dx);\n for (int j = 1; j < i; j++) {\n if (data[i].x >= data[j].x && data[i].y >= data[j].y) {\n dx = data[i].x - data[j].x;\n dy = data[i].y - data[j].y;\n f[i] = f[i] - (f[j] * Lucas(dx + dy, dx)) % mod;\n f[i] = (f[i] + mod) % mod;\n }\n }\n }\n cout << (f[n] + mod) % mod << endl;\n return 0;\n }\n "} @@ -283,7 +283,7 @@ {"func_code_string": "#include \n using namespace std;\n int n, pd[4][10100], x, y, gox[4] = {1, 0, -1, 0}, goy[4] = {0, 1, 0, -1},\n w[16], dp[10100][8], mo = 1000000007;\n char getin() {\n char ch = getchar();\n while (ch != '.' && ch != 'X' && ch != 'O') ch = getchar();\n return ch;\n }\n int check(int k1, int k2, int k3) {\n for (int i = 0; i < 3; i++) {\n if (pd[i + 1][k1]) {\n if (k2 & (1 << i)) return 0;\n }\n if (pd[i + 1][k1 - 1]) {\n if (k3 & (1 << i))\n return 0;\n else\n k3 += (1 << i);\n }\n }\n int a[3] = {0};\n for (int i = 0; i < 3; i++)\n if ((k3 & (1 << i)) == 0) a[i]--;\n for (int i = 0; i < 3; i++)\n if (k2 & (1 << i)) a[i]++;\n for (int i = 0; i < 3; i++)\n if (a[i] < 0) return 0;\n for (int i = 0; i < 2; i++)\n if (a[i] && a[i + 1] == 0)\n return 0;\n else if (a[i])\n a[i + 1] = 0;\n if (a[2]) return 0;\n return 1;\n }\n int solve(int k) {\n memset(dp, 0x00, sizeof dp);\n dp[0][7] = 1;\n for (int i = 1; i <= n; i++)\n for (int j = 0; j < 8; j++)\n for (int k = 0; k < 8; k++)\n if (check(i, j, k)) dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mo;\n int k1 = 0;\n for (int i = 0; i < 3; i++)\n if (pd[i + 1][n]) k1 += (1 << i);\n return dp[n][7 ^ k1];\n }\n int dfs(int k1, int k2) {\n if (k1 == 4) return w[k2] * solve(k2);\n int flag = 0;\n for (int i = 1; i <= 2; i++) {\n int k3 = x + gox[k1] * i, k4 = y + goy[k1] * i;\n if (k3 <= 0 || k3 > 3 || k4 <= 0 || k4 > n || pd[k3][k4]) {\n flag = 1;\n break;\n }\n }\n int ans = 0;\n if (flag == 0) {\n for (int i = 1; i <= 2; i++) {\n int k3 = x + gox[k1] * i, k4 = y + goy[k1] * i;\n pd[k3][k4] = 1;\n }\n ans += dfs(k1 + 1, k2 + (1 << k1));\n for (int i = 1; i <= 2; i++) {\n int k3 = x + gox[k1] * i, k4 = y + goy[k1] * i;\n pd[k3][k4] = 0;\n }\n }\n ans = (ans + dfs(k1 + 1, k2)) % mo;\n return ans;\n }\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= 3; i++)\n for (int j = 1; j <= n; j++) {\n char ch = getin();\n if (ch == 'X')\n pd[i][j] = 1;\n else if (ch == 'O') {\n pd[i][j] = 2;\n x = i;\n y = j;\n }\n }\n for (int i = 1; i < 16; i++) {\n w[i] = 1;\n for (int j = (i - 1) & i; j; j = (j - 1) & i) w[i] = w[i] - w[j];\n }\n cout << (dfs(0, 0) + mo) % mo << endl;\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 set > s;\n vector > > ans;\n bool rec(vector& a) {\n if (a.size() == 1) {\n return a[0] == 24;\n }\n if (s.find(a) != s.end()) {\n return false;\n }\n s.insert(a);\n for (size_t i = 0; i < a.size(); ++i) {\n for (size_t j = i + 1; j < a.size(); ++j) {\n vector b = a;\n int x = a[i], y = a[j];\n b.erase(b.begin() + j);\n b.erase(b.begin() + i);\n b.push_back(x + y);\n ans.push_back(make_pair('+', make_pair(x, y)));\n if (rec(b)) {\n return true;\n }\n b.pop_back();\n ans.pop_back();\n b.push_back(y - x);\n ans.push_back(make_pair('-', make_pair(y, x)));\n if (rec(b)) {\n return true;\n }\n b.pop_back();\n ans.pop_back();\n b.push_back(x - y);\n ans.push_back(make_pair('-', make_pair(x, y)));\n if (rec(b)) {\n return true;\n }\n b.pop_back();\n ans.pop_back();\n b.push_back(x * y);\n ans.push_back(make_pair('*', make_pair(x, y)));\n if (rec(b)) {\n return true;\n }\n b.pop_back();\n ans.pop_back();\n }\n }\n return false;\n }\n int main(int, char**) {\n ios_base::sync_with_stdio(false);\n int n;\n cin >> n;\n if (n < 4) {\n cout << NO << endl;\n return 0;\n }\n cout << YES << endl;\n vector a;\n for (int i = 1; i <= n % 2 + 4; ++i) {\n a.push_back(i);\n }\n rec(a);\n for (int i = n % 2 + 4; i < n; i += 2) {\n ans.push_back(make_pair('-', make_pair(i + 2, i + 1)));\n ans.push_back(make_pair('*', make_pair(24, 1)));\n }\n for (size_t i = 0; i < ans.size(); ++i) {\n int x = ans[i].second.first;\n int y = ans[i].second.second;\n int r = -1;\n switch (ans[i].first) {\n case '-':\n r = x - y;\n break;\n case '+':\n r = x + y;\n break;\n case '*':\n r = x * y;\n break;\n }\n cout << x << << ans[i].first << << y << = << r << endl;\n }\n fprintf(stderr, Time execute: %.3lf sec\n ,\n clock() / (double)CLOCKS_PER_SEC);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n void fast();\n int main() {\n fast();\n int k, d;\n cin >> k >> d;\n string ans = ;\n if ((d > (pow(10, k) - 1)) || (d == 0 && k != 1)) {\n cout << No solution ;\n return 0;\n }\n for (int i = 0; i < k; i++) {\n if (d > 9) {\n ans += 9 ;\n d -= 9;\n } else {\n stringstream t;\n t << d;\n ans += t.str();\n d = 0;\n }\n }\n cout << ans;\n return 0;\n }\n void fast() {\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 const int INF = 1029384756;\n const double PI = acos(-1);\n const double EPS = 0.0000000304;\n long long A, B, C;\n int main() {\n scanf( %I64d%I64d%I64d , &A, &B, &C);\n if ((A % 2) == (B % 2) && (B % 2) == (C % 2)) {\n printf( %I64d , A + B + C - max(A, max(B, C)) - min(A, min(B, C)));\n } else if (A % 2 == B % 2) {\n printf( %I64d , max(A, B));\n } else if (A % 2 == C % 2) {\n printf( %I64d , max(A, C));\n } else {\n printf( %I64d , max(B, C));\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int INF = 1029384756;\n const double PI = acos(-1);\n const double EPS = 0.0000000304;\n long long A, B, C;\n int main() {\n scanf( extraextraextra , &A, &B, &C);\n if ((A % 2) == (B % 2) && (B % 2) == (C % 2)) {\n printf( extra , A + B + C - max(A, max(B, C)) - min(A, min(B, C)));\n } else if (A % 2 == B % 2) {\n printf( extra , max(A, B));\n } else if (A % 2 == C % 2) {\n printf( extra , max(A, C));\n } else {\n printf( extra , max(B, C));\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n vector v;\n int main() {\n long long int n, m, a, b, sum = 0, i, j, k;\n cin >> n >> k;\n long long int s[n], x[n];\n for (i = 0; i < n; i++) {\n cin >> a >> b;\n sum += min(a, b);\n v.push_back(min(2 * a, b) - min(a, b));\n }\n sort(v.begin(), v.end());\n for (i = 0; i < n && i < k; i++) sum += v[n - i - 1];\n cout << sum << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int inf = 0x3f3f3f3f;\n const double eps = 1e-6;\n template \n ostream& operator<<(ostream& os, const pair& p) {\n return os << p.first << ',' << p.second;\n }\n template \n struct point {\n T x, y;\n point(T xx = 0, T yy = 0) : x(xx), y(yy) {}\n T len2() const { return x * x + y * y; }\n double len() const { return sqrt(double(len2())); }\n bool operator==(const point& p) const { return x == p.x && y == p.y; }\n };\n template \n point operator+(const point& a, const point& b) {\n return point(a.x + b.x, a.y + b.y);\n }\n template \n point operator-(const point& a, const point& b) {\n return point(a.x - b.x, a.y - b.y);\n }\n template \n T scal(const point& a, const point& b) {\n return a.x * b.x + a.y * b.y;\n }\n template \n T vect(const point& a, const point& b) {\n return a.x * b.y - a.y * b.x;\n }\n template \n ostream& operator<<(ostream& os, const point& p) {\n return os << '(' << p.x << ',' << p.y << ')';\n }\n const int maxn = 100100;\n pair > a[maxn], b[maxn];\n int below[maxn], direct[maxn], belowsecond[maxn];\n long long d[maxn][2];\n int main() {\n int n;\n cin >> n;\n for (int i = 0; i < n; i++) {\n scanf( %d%d , &a[i].second.first, &a[i].first);\n a[i].second.second = i;\n }\n int m;\n cin >> m;\n for (int i = 0; i < m; i++) {\n scanf( %d%d , &b[i].second.first, &b[i].first);\n b[i].second.second = i;\n }\n sort(a, a + n);\n sort(b, b + m);\n memset(direct, -1, sizeof(direct));\n memset(below, -1, sizeof(below));\n memset(belowsecond, -1, sizeof(belowsecond));\n for (int i = 0; i < n; i++) {\n pair >* d1 =\n lower_bound(b, b + m,\n pair >(\n a[i].first, pair(a[i].second.first, 0)));\n pair >* d2 =\n lower_bound(b, b + m,\n pair >(\n a[i].first - 1, pair(a[i].second.first, 0)));\n if (d1 != b + m && d1->first == a[i].first &&\n d1->second.first >= a[i].second.first) {\n direct[i] = d1->second.second;\n }\n if (d2 != b + m && d2->first + 1 == a[i].first &&\n d2->second.first >= a[i].second.first) {\n below[i] = d2->second.second;\n d2++;\n if (d2 != b + m && d2->first + 1 == a[i].first &&\n d2->second.first >= a[i].second.first) {\n belowsecond[i] = d2->second.second;\n }\n }\n }\n long long mx = 0;\n for (int i = 0; i < n; i++) {\n if (direct[i] >= 0) {\n long long q = max(d[i][0], d[i][1]);\n d[i + 1][1] = max(d[i + 1][1], a[i].second.first + q);\n }\n if (below[i] >= 0) {\n d[i + 1][0] = max(d[i + 1][0], d[i][0] + a[i].second.first);\n if (i > 0 && direct[i - 1] != below[i]) {\n d[i + 1][0] = max(d[i + 1][0], d[i][1] + a[i].second.first);\n }\n if (i > 0 && direct[i - 1] == below[i] && belowsecond[i] >= 0) {\n d[i + 1][0] = max(d[i + 1][0], d[i][1] + a[i].second.first);\n }\n }\n d[i + 1][0] = max(d[i + 1][0], max(d[i][0], d[i][1]));\n mx = max(mx, max(d[i + 1][0], d[i + 1][1]));\n }\n cout << mx << endl;\n int cur = n;\n int t = 0;\n if (d[cur][t] != mx) t++;\n assert(d[cur][t] == mx);\n vector > res;\n set guyused;\n for (; cur > 0; cur--) {\n if (res.size()) {\n guyused.insert(res.back().second);\n }\n if (d[cur - 1][0] == d[cur][t]) {\n t = 0;\n continue;\n }\n if (d[cur - 1][1] == d[cur][t]) {\n t = 1;\n continue;\n }\n int p = a[cur - 1].second.first;\n if (!guyused.count(direct[cur - 1])) {\n if (p + d[cur - 1][1] == mx && direct[cur - 1] >= 0) {\n res.push_back(\n pair(a[cur - 1].second.second, direct[cur - 1]));\n mx -= p;\n t = 1;\n continue;\n }\n if (p + d[cur - 1][0] == mx && direct[cur - 1] >= 0) {\n res.push_back(\n pair(a[cur - 1].second.second, direct[cur - 1]));\n mx -= p;\n t = 0;\n continue;\n }\n }\n assert(below[cur - 1] >= 0);\n if (!guyused.count(below[cur - 1])) {\n if (d[cur - 1][0] + p == mx) {\n res.push_back(pair(a[cur - 1].second.second, below[cur - 1]));\n mx -= p;\n t = 0;\n continue;\n }\n if (cur - 2 < 0 ||\n (direct[cur - 2] != below[cur - 1] && d[cur - 1][1] + p == mx)) {\n res.push_back(pair(a[cur - 1].second.second, below[cur - 1]));\n mx -= p;\n t = 1;\n continue;\n }\n }\n assert(!guyused.count(belowsecond[cur - 1]));\n if (cur - 2 >= 0 && direct[cur - 2] == below[cur - 1] &&\n belowsecond[cur - 1] >= 0 && d[cur - 1][1] + p == mx) {\n res.push_back(\n pair(a[cur - 1].second.second, belowsecond[cur - 1]));\n mx -= p;\n t = 1;\n continue;\n }\n assert(0);\n }\n printf( %d\n , res.size());\n for (int i = 0; i < res.size(); i++) {\n printf( %d %d\n , res[i].second + 1, res[i].first + 1);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n inline int read() {\n int x = 0, neg = 1;\n char c = getchar();\n while (!isdigit(c)) {\n if (c == '-') neg = -1;\n c = getchar();\n }\n while (isdigit(c)) x = x * 10 + c - '0', c = getchar();\n return x * neg;\n }\n inline int qpow(int x, int e, int _MOD) {\n int ans = 1;\n while (e) {\n if (e & 1) ans = ans * x % _MOD;\n x = x * x % _MOD;\n e >>= 1;\n }\n return ans;\n }\n int n = read(), s = read(), a[200005], b[200005], c[200005], d[200005], num = 0;\n vector g[200005], cyc[200005];\n int k = 0;\n inline void dfs(int x) {\n while (!g[x].empty()) {\n int y = g[x].back();\n g[x].pop_back();\n dfs(a[y]);\n cyc[k].push_back(y);\n }\n }\n signed main() {\n for (int i = 1; i <= n; i++) a[i] = read(), c[i] = a[i];\n sort(c + 1, c + n + 1);\n for (int i = 1; i <= n; i++)\n if (c[i] != c[i - 1]) d[++num] = c[i];\n for (int i = 1; i <= n; i++)\n a[i] = lower_bound(d + 1, d + num + 1, a[i]) - d, b[i] = a[i];\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 g[b[i]].push_back(i);\n }\n }\n if (!cnt) return puts( 0 ), 0;\n if (cnt > s) return puts( -1 ), 0;\n for (int i = 1; i <= num; i++) {\n if (!g[i].empty()) {\n k++;\n dfs(i);\n }\n }\n for (int i = 1; i <= k; i++) reverse(cyc[i].begin(), cyc[i].end());\n if (k == 1) {\n cout << 1 << endl << cyc[1].size() << endl;\n for (__typeof(cyc[1].begin()) it = cyc[1].begin(); it != cyc[1].end(); it++)\n cout << *it << ;\n return 0;\n }\n if (cnt <= s - k) {\n cout << 2 << endl;\n cout << cnt << endl;\n for (int i = 1; i <= k; i++) {\n for (__typeof(cyc[i].begin()) it = cyc[i].begin(); it != cyc[i].end();\n it++)\n cout << *it << ;\n }\n puts( );\n cout << k << endl;\n for (int i = k; i >= 1; i--) cout << cyc[i][0] << ;\n puts( );\n return 0;\n } else {\n int t = cnt - (s - k);\n if (t == k)\n cout << t << endl;\n else if (t == k - 1)\n cout << t + 1 << endl;\n else\n cout << t + 2 << endl;\n for (int i = 1; i <= t; i++) {\n cout << cyc[i].size() << endl;\n for (__typeof(cyc[i].begin()) it = cyc[i].begin(); it != cyc[i].end();\n it++)\n cout << *it << ;\n puts( );\n }\n int sum = 0;\n if (t != k) {\n for (int i = t + 1; i <= k; i++) sum += cyc[i].size();\n cout << sum << endl;\n for (int i = t + 1; i <= k; i++)\n for (__typeof(cyc[i].begin()) it = cyc[i].begin(); it != cyc[i].end();\n it++)\n cout << *it << ;\n if (t != k - 1) {\n puts( );\n cout << k - t << endl;\n for (int i = k; i >= t + 1; i--) cout << cyc[i][0] << ;\n }\n }\n }\n return 0;\n }\n "} @@ -327,7 +327,7 @@ {"func_code_string": "#include \n using namespace std;\n long long int n, c;\n vector a, b;\n long long int pos(long long int l) {\n long long int d1 = 0;\n for (long long int i = 0; i < n; i++) {\n long long int x = (a[i] * l) / b[i];\n x++;\n d1 += x;\n }\n return d1;\n }\n pair fun(long long int l, long long int r) {\n while (r - l > 2) {\n long long int md1 = l + (r - l) / 3;\n long long int md2 = r - (r - l) / 3;\n long long int d1 = 0, d2 = 0;\n d1 = pos(md1);\n d2 = pos(md2);\n if (d2 < c)\n l = md2;\n else if (d1 > c)\n r = md1;\n else if (d1 == c && d2 == c) {\n pair p1 = fun(l, md1);\n pair p2 = fun(md2, r);\n pair p = make_pair(p1.first, p2.second);\n return p;\n } else if (d2 == c) {\n pair p1 = fun(md1, md2);\n pair p2 = fun(md2, r);\n pair p = make_pair(p1.first, p2.second);\n return p;\n } else if (d1 == c) {\n pair p1 = fun(l, md1);\n pair p2 = fun(md1, md2);\n pair p = make_pair(p1.first, p2.second);\n return p;\n } else {\n l = md1;\n r = md2;\n }\n }\n if (r - l > 2)\n return {l, r};\n else {\n long long int in = 0;\n for (long long int i = l; i <= r; i++) {\n if (pos(i) == c) {\n l = i;\n in++;\n break;\n }\n }\n for (long long int i = r; i >= l; i--) {\n if (pos(i) == c) {\n r = i;\n break;\n }\n }\n if (in > 0)\n return {l, r};\n else\n return {-1, -1};\n }\n }\n int32_t main() {\n cin >> n >> c;\n a.resize(n);\n b.resize(n);\n long long int l = 0;\n for (long long int i = 0; i < n; i++) {\n cin >> a[i] >> b[i];\n if (a[i] == 0) continue;\n long long int x = b[i] / a[i];\n if (b[i] % a[i] != 0) x++;\n l = max(x, l);\n }\n l = 1;\n long long int r = 1e9 + 1;\n pair ans = fun(l, r);\n l = ans.first;\n r = ans.second;\n if (l == -1)\n cout << 0;\n else\n cout << r - l + 1;\n return 0;\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 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 void mini(int& a, int b) { a = min(a, b); }\n void maxi(int& a, int b) { a = max(a, b); }\n int main() {\n int n;\n scanf( %d , &n);\n vector x(n), y(n);\n int big_x = INT_MIN;\n int small_x = INT_MAX;\n int big_y = INT_MIN;\n int small_y = INT_MAX;\n for (int i = 0; i < n; ++i) {\n scanf( %d%d , &x[i], &y[i]);\n mini(small_x, x[i]);\n mini(small_y, y[i]);\n maxi(big_x, x[i]);\n maxi(big_y, y[i]);\n }\n int best = 0;\n for (int i = 0; i < n; ++i) {\n maxi(best, big_x - x[i] + big_y - y[i]);\n maxi(best, x[i] - small_x + big_y - y[i]);\n maxi(best, x[i] - small_x + y[i] - small_y);\n maxi(best, big_x - x[i] + y[i] - small_y);\n }\n printf( %d , 2 * best);\n for (int i = 4; i <= n; ++i) {\n printf( %d , 2 * (big_x - small_x + big_y - small_y));\n }\n puts( );\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 long long fre[1000000];\n int32_t main() {\n fastio();\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 sort(a, a + n);\n for (long long i = 0; i < n; i++) {\n for (long long j = i + 1; j < n; j++) {\n fre[a[i] + a[j]]++;\n }\n }\n long long ans = 0;\n for (long long i = 0; i < 1000000; i++) {\n ans = max(ans, fre[i]);\n }\n cout << ans;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int main() {\n long long A, B;\n int N;\n long long l, r, t, tt, M;\n cin >> A >> B >> N;\n for (int i = 0; i < N; i++) {\n scanf( %I64d%I64d%I64d , &l, &t, &M);\n long long st = l, ed = l + 1000000;\n long long H = A + (l - 1) * B;\n long long D = B, C = t / B;\n if (t < H) {\n puts( -1 );\n continue;\n }\n while (ed - st > 1) {\n long long md = (st + ed) >> 1;\n long long E = A + (md - 1) * B;\n long long L = md - l + 1;\n long long tot = (H + E) * L / 2;\n long long tt = max(E, (tot - 1 + M) / M);\n if (t >= tt)\n st = md;\n else\n ed = md;\n }\n long long E = A + (ed - 1) * B;\n long long L = ed - l + 1;\n long long tot = (H + E) * L / 2;\n long long tt = max(E, (tot - 1 + M) / M);\n if (t >= tt) st++;\n cout << st << endl;\n }\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int main() {\n long long A, B;\n int N;\n long long l, r, t, tt, M;\n cin >> A >> B >> N;\n for (int i = 0; i < N; i++) {\n scanf( extraextraextra , &l, &t, &M);\n long long st = l, ed = l + 1000000;\n long long H = A + (l - 1) * B;\n long long D = B, C = t / B;\n if (t < H) {\n puts( -1 );\n continue;\n }\n while (ed - st > 1) {\n long long md = (st + ed) >> 1;\n long long E = A + (md - 1) * B;\n long long L = md - l + 1;\n long long tot = (H + E) * L / 2;\n long long tt = max(E, (tot - 1 + M) / M);\n if (t >= tt)\n st = md;\n else\n ed = md;\n }\n long long E = A + (ed - 1) * B;\n long long L = ed - l + 1;\n long long tot = (H + E) * L / 2;\n long long tt = max(E, (tot - 1 + M) / M);\n if (t >= tt) st++;\n cout << st << endl;\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MAXN = 1010;\n long long t, n, arr[MAXN], h, sub[MAXN], cnt, add[MAXN];\n long long find(int x) {\n long long l = 0, r = cnt;\n while (l < r) {\n long long mid = (l + r) >> 1;\n if (sub[mid] >= x)\n r = mid;\n else\n l = mid + 1;\n }\n if (sub[l] < x) return cnt + 1;\n return l;\n }\n bool check(long long x) {\n long long res = n;\n int idx = lower_bound(sub + 1, sub + cnt + 1, x - 1) - sub;\n res += add[idx - 1] + (x - 1) * (n - idx + 1);\n if (res >= h) return true;\n return false;\n }\n int main() {\n scanf( %d , &t);\n while (t--) {\n cnt = 0;\n memset(sub, 0, sizeof(sub));\n memset(add, 0, sizeof(add));\n scanf( %d%lld , &n, &h);\n for (int i = 1; i <= n; ++i) {\n scanf( %d , &arr[i]);\n if (i > 1) sub[++cnt] = arr[i] - arr[i - 1] - 1;\n }\n sub[++cnt] = 1e18;\n sort(sub + 1, sub + cnt + 1);\n for (int i = 1; i <= cnt; ++i) add[i] = add[i - 1] + sub[i];\n long long l = 1, r = h;\n while (l < r) {\n long long mid = (l + r) >> 1;\n if (check(mid))\n r = mid;\n else\n l = mid + 1;\n }\n printf( %lld\n , l);\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n int a[102][102][102] = {};\n int main() {\n string s;\n int n, m, k;\n cin >> n >> m >> k;\n for (int i = 1; i < n + 1; ++i) {\n for (int j = 1; j < m + 1; ++j) {\n cin >> s;\n for (int t = 1; t < k + 1; ++t) a[i][j][t] = s[t - 1] - '0';\n }\n }\n int ans = 0;\n for (int i = 1; i < n + 1; ++i)\n for (int j = 1; j < m + 1; ++j)\n for (int t = 1; t < k + 1; ++t)\n if (a[i][j][t] &&\n ((a[i][j][t - 1] &&\n (a[i][j][t + 1] || (a[i][j + 1][t] && !a[i][j + 1][t - 1]) ||\n (a[i + 1][j][t] && !a[i + 1][j][t - 1]))) ||\n (a[i][j - 1][t] &&\n (a[i][j + 1][t] || (a[i][j][t + 1] && !a[i][j - 1][t + 1]) ||\n (a[i + 1][j][t] && !a[i + 1][j - 1][t]))) ||\n (a[i - 1][j][t] &&\n (a[i + 1][j][t] || (a[i][j][t + 1] && !a[i - 1][j][t + 1]) ||\n (a[i][j + 1][t] && !a[i - 1][j + 1][t])))))\n ++ans;\n cout << ans;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long dp[100050][205];\n int redpac[100050][4];\n int e[100050];\n bool cmp(int x, int y) { return redpac[x][0] < redpac[y][0]; }\n int main() {\n int n, m, k, cur = 0;\n long long ans = -1;\n priority_queue > > availablepackets;\n scanf( %d%d%d , &n, &m, &k);\n for (int i = 0; i < k; i++) {\n scanf( %d%d%d%d , &redpac[i][0], &redpac[i][1], &redpac[i][2],\n &redpac[i][3]);\n e[i] = i;\n }\n sort(e, e + k, cmp);\n memset(dp, -1, sizeof(dp));\n dp[1][0] = 0;\n for (int i = 1; i <= n; i++) {\n if (availablepackets.size() > 0) {\n while (availablepackets.top().second.second < i) {\n availablepackets.pop();\n if (availablepackets.size() == 0) break;\n }\n }\n while (cur < k && redpac[e[cur]][0] <= i) {\n availablepackets.push(make_pair(\n redpac[e[cur]][3], make_pair(redpac[e[cur]][2], redpac[e[cur]][1])));\n cur++;\n }\n for (int j = 0; j < m + 1; j++) {\n if (dp[i][j] == -1) continue;\n if (j < m && (dp[i + 1][j + 1] > dp[i][j] || dp[i + 1][j + 1] == -1)) {\n dp[i + 1][j + 1] = dp[i][j];\n }\n if (availablepackets.size() > 0) {\n if (dp[availablepackets.top().second.first + 1][j] >\n dp[i][j] + availablepackets.top().first ||\n dp[availablepackets.top().second.first + 1][j] == -1) {\n dp[availablepackets.top().second.first + 1][j] =\n dp[i][j] + availablepackets.top().first;\n }\n } else {\n if (dp[i + 1][j] == -1 || dp[i + 1][j] > dp[i][j]) {\n dp[i + 1][j] = dp[i][j];\n }\n }\n }\n }\n for (int i = 0; i < m + 1; i++) {\n if (dp[n + 1][i] != -1 && (ans > dp[n + 1][i] || ans == -1)) {\n ans = dp[n + 1][i];\n }\n }\n printf( %lld , ans);\n }\n "} @@ -335,7 +335,7 @@ {"func_code_string": "#include \n using namespace std;\n vector r;\n vector l;\n int n, ans, a[550000];\n int main() {\n cin >> n;\n for (int i = 1; i <= n; i++) cin >> a[i];\n a[0] = a[1];\n a[n + 1] = a[n];\n for (int i = 1; i <= n; i++) {\n if (a[i] == a[i + 1] && a[i] != a[i - 1]) r.push_back(i);\n if (a[i] != a[i + 1] && a[i] == a[i - 1]) l.push_back(i);\n }\n for (int i = 0; i < l.size(); i++) ans = max(ans, r[i] - l[i]);\n cout << ans / 2 << endl;\n for (int i = 0; i < l.size(); i++)\n if (a[l[i]] == a[r[i]])\n for (int j = l[i]; j <= r[i]; j++) a[j] = a[l[i]];\n else {\n for (int j = l[i]; j <= (r[i] + l[i]) / 2; j++) a[j] = a[l[i]];\n for (int j = (r[i] + l[i]) / 2 + 1; j <= r[i]; j++) a[j] = a[r[i]];\n }\n for (int i = 1; i <= n; i++) cout << a[i] << ;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, s;\n int max = 0;\n int counter = 0;\n cin >> n >> s;\n for (int i = 0; i < n; i++) {\n int a;\n cin >> a;\n counter += a;\n if (a > max) {\n max = a;\n }\n }\n if (counter - max > s) {\n cout << NO ;\n return 0;\n } else {\n cout << YES ;\n return 0;\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n int max(int a, int b, int c, int d) {\n if (a >= b && a >= c && a >= d) return a;\n if (b >= a && b >= c && b >= d) return b;\n if (c >= a && c >= b && c >= d) return c;\n if (d >= a && d >= c && d >= b) return d;\n return d;\n }\n int main() {\n int x1, x2, x3, x4;\n cin >> x1 >> x2 >> x3 >> x4;\n int mx = max(x1, x2, x3, x4);\n if (mx == x1) {\n cout << mx - x2 << << mx - x3 << << mx - x4;\n } else {\n if (mx == x2) {\n cout << mx - x1 << << mx - x3 << << mx - x4;\n } else {\n if (mx == x3) {\n cout << mx - x2 << << mx - x1 << << mx - x4;\n } else {\n if (mx == x4) {\n cout << mx - x2 << << mx - x3 << << mx - x1;\n }\n }\n }\n }\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int t, n, m, cur;\n int nxt[200200][26], link[200200], dp[200200], cnt[200200], ord[200200],\n occur[200200];\n char s[200200];\n void extend(int c) {\n int x = cur, y = cur = ++m;\n dp[y] = dp[x] + 1;\n occur[y] = 1;\n while (x && !nxt[x][c]) nxt[x][c] = y, x = link[x];\n if (!x)\n link[y] = 1;\n else {\n int z = nxt[x][c];\n if (dp[z] == dp[x] + 1)\n link[y] = z;\n else {\n int u = ++m;\n memcpy(nxt[u], nxt[z], sizeof nxt[u]);\n link[u] = link[z], link[z] = link[y] = u;\n dp[u] = dp[x] + 1;\n while (x && nxt[x][c] == z) nxt[x][c] = u, x = link[x];\n }\n }\n }\n void build(char *s) {\n memset(nxt, 0, sizeof nxt), memset(link, 0, sizeof link),\n memset(dp, 0, sizeof dp);\n n = strlen(s), m = 0;\n cur = ++m;\n for (int i = 0; i < n; i++) extend(s[i] - 'a');\n memset(cnt, 0, sizeof cnt);\n for (int i = 1; i <= m; i++) cnt[dp[i]]++;\n for (int i = 1; i <= n; i++) cnt[i] += cnt[i - 1];\n for (int i = m; i >= 1; i--) ord[cnt[dp[i]]--] = i;\n }\n int main() {\n scanf( %d , &t);\n while (t--) {\n scanf( %s , s);\n memset(occur, 0, sizeof occur);\n build(s);\n for (int i = m; i >= 1; i--) occur[link[ord[i]]] += occur[ord[i]];\n long long ans = 0;\n for (int i = 1; i <= m; i++)\n ans += 1ll * occur[i] * occur[i] * (dp[i] - dp[link[i]]);\n printf( %I64d\n , ans);\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int t, n, m, cur;\n int nxt[200200][26], link[200200], dp[200200], cnt[200200], ord[200200],\n occur[200200];\n char s[200200];\n void extend(int c) {\n int x = cur, y = cur = ++m;\n dp[y] = dp[x] + 1;\n occur[y] = 1;\n while (x && !nxt[x][c]) nxt[x][c] = y, x = link[x];\n if (!x)\n link[y] = 1;\n else {\n int z = nxt[x][c];\n if (dp[z] == dp[x] + 1)\n link[y] = z;\n else {\n int u = ++m;\n memcpy(nxt[u], nxt[z], sizeof nxt[u]);\n link[u] = link[z], link[z] = link[y] = u;\n dp[u] = dp[x] + 1;\n while (x && nxt[x][c] == z) nxt[x][c] = u, x = link[x];\n }\n }\n }\n void build(char *s) {\n memset(nxt, 0, sizeof nxt), memset(link, 0, sizeof link),\n memset(dp, 0, sizeof dp);\n n = strlen(s), m = 0;\n cur = ++m;\n for (int i = 0; i < n; i++) extend(s[i] - 'a');\n memset(cnt, 0, sizeof cnt);\n for (int i = 1; i <= m; i++) cnt[dp[i]]++;\n for (int i = 1; i <= n; i++) cnt[i] += cnt[i - 1];\n for (int i = m; i >= 1; i--) ord[cnt[dp[i]]--] = i;\n }\n int main() {\n scanf( %d , &t);\n while (t--) {\n scanf( %s , s);\n memset(occur, 0, sizeof occur);\n build(s);\n for (int i = m; i >= 1; i--) occur[link[ord[i]]] += occur[ord[i]];\n long long ans = 0;\n for (int i = 1; i <= m; i++)\n ans += 1ll * occur[i] * occur[i] * (dp[i] - dp[link[i]]);\n printf( extra\n , ans);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxN = 1e4;\n long long F[maxN + 1];\n void fact() {\n F[0] = F[1] = 1;\n for (int i = 2; i <= maxN; i++) F[i] = (1LL * F[i - 1] * i) % 998244353;\n }\n long long power(long long a, long long b) {\n long long res = 1;\n while (b) {\n if (b & 1) {\n res = (1LL * res * a) % 998244353, b--;\n } else {\n a = (1LL * a * a) % 998244353, b >>= 1;\n }\n }\n return res;\n }\n long long C(long long n, long long r) {\n if (r > n) return 0;\n long long res = F[n];\n res = (1LL * res * power(F[r], 998244353 - 2)) % 998244353;\n res = (1LL * res * power(F[n - r], 998244353 - 2)) % 998244353;\n return res;\n }\n void solve() {\n long long n, k;\n cin >> n >> k;\n string second;\n cin >> second;\n if (!k) {\n cout << 1\n ;\n return;\n }\n long long ans = 1, l = 0, r = 0, cnt = 0;\n while (r < n) {\n if (second[r] == '1') {\n if (cnt == k) {\n (ans += (C(r - l, k) - 1 + 998244353) % 998244353) %= 998244353;\n while (l < n && second[l] != '1') l++;\n l++, cnt--;\n ans = (ans - C(r - l, k - 1) + 1 + 998244353) % 998244353;\n }\n cnt++;\n }\n r++;\n }\n if (cnt == k) (ans += (C(r - l, k) - 1 + 998244353) % 998244353) %= 998244353;\n cout << ans << '\n';\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0), cout.tie(0), fact();\n solve();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n vector v[250001];\n int a, ans[250001], n, i, q, kol;\n bool pole[250001];\n void dfs(int nom) {\n int i;\n kol++;\n pole[nom] = true;\n for (i = 0; i < v[nom].size(); i++)\n if (!pole[v[nom][i]]) dfs(v[nom][i]);\n ans[nom] = kol;\n }\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cin >> q;\n while (q--) {\n cin >> n;\n for (i = 1; i <= n; i++) {\n v[i].clear();\n pole[i] = false;\n }\n for (i = 1; i <= n; i++) {\n cin >> a;\n v[i].push_back(a);\n }\n for (i = 1; i <= n; i++)\n if (!pole[i]) {\n kol = 0;\n dfs(i);\n }\n for (i = 1; i <= n - 1; i++) cout << ans[i] << ;\n cout << ans[n] << '\n';\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int inf = 1e9 + 7;\n const long long INF = 1e18L + 7;\n template \n ostream &operator<<(ostream &p, pair x) {\n return p << < << x.first << , << x.second << > ;\n }\n template \n auto operator<<(ostream &p, n y) ->\n typename enable_if::value,\n decltype(y.begin(), p)>::type {\n int o = 0;\n p << { ;\n for (auto c : y) {\n if (o++) p << , ;\n p << c;\n }\n return p << } ;\n }\n void dor() { cerr << '\n'; }\n template \n void dor(n p, second... y) {\n cerr << p << ;\n dor(y...);\n }\n template \n void mini(n &p, second y) {\n if (p > y) p = y;\n }\n template \n void maxi(n &p, second y) {\n if (p < y) p = y;\n }\n const int mod = 998244353;\n const int N = 507;\n int n, m;\n int tab[N];\n int dp[N][N][3];\n int vis[N][N][3];\n int pie[N];\n int dru[N];\n void solve(int a, int b, int t) {\n if (vis[a][b][t]) return;\n vis[a][b][t] = 1;\n if (a > b) {\n if (t == 2)\n dp[a][b][t] = 1;\n else\n dp[a][b][t] = 0;\n return;\n }\n int col = inf;\n int ind = -1;\n if (t == 2) {\n for (int i = a; i <= b; ++i) {\n if (col > tab[i]) {\n col = tab[i];\n ind = i;\n }\n }\n solve(a, ind, 1);\n solve(ind, b, 0);\n dp[a][b][t] = (long long)dp[a][ind][1] * dp[ind][b][0] % mod;\n } else if (t == 0) {\n for (int i = a; i <= b; ++i) {\n solve(a + 1, i, 2);\n solve(i + 1, b, 2);\n dp[a][b][t] += (long long)dp[a + 1][i][2] * dp[i + 1][b][2] % mod;\n if (dp[a][b][t] >= mod) dp[a][b][t] -= mod;\n }\n } else if (t == 1) {\n for (int i = a; i <= b; ++i) {\n solve(a, i - 1, 2);\n solve(i, b - 1, 2);\n dp[a][b][t] += (long long)dp[a][i - 1][2] * dp[i][b - 1][2] % mod;\n if (dp[a][b][t] >= mod) dp[a][b][t] -= mod;\n }\n }\n }\n int32_t main() {\n ios_base::sync_with_stdio(0);\n cin.tie(NULL);\n cin >> n >> m;\n for (int i = 1; i <= n; ++i) {\n cin >> tab[i];\n }\n solve(1, n, 2);\n cout << dp[1][n][2] << '\n';\n }\n "} @@ -390,7 +390,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n int a[4];\n for (int i = 0; i < 4; i++) cin >> a[i];\n int sumtotal = a[0] + a[1] + a[2] + a[3];\n if (sumtotal % 2 != 0) {\n cout << NO ;\n return 0;\n }\n for (int i = 0; i < 4; i++) {\n if (a[i] == sumtotal - a[i]) {\n cout << YES ;\n return 0;\n } else\n for (int j = 0; j < 4; j++) {\n if (i != j)\n if ((a[i] + a[j]) == (sumtotal - a[i] - a[j])) {\n cout << YES ;\n return 0;\n }\n }\n }\n cout << NO ;\n }\n "} {"func_code_string": "#include \n using namespace std;\n vector> ans[52];\n int main() {\n int n, w, m;\n cin >> n >> w >> m;\n double s = (n * w) / (m * 1.0), c = w, b = 1, k = 0;\n for (int i = 0; i < m; i++) {\n double ne = s;\n while (1) {\n if (ne + 10e-7 > c) {\n ans[i].push_back(make_pair(b, c));\n ne -= c;\n c = w;\n b++;\n if (++k > 2) {\n cout << NO ;\n return 0;\n }\n k = 0;\n if (abs(ne) < 10e-7) break;\n } else {\n ans[i].push_back(make_pair(b, ne));\n c -= ne;\n k++;\n break;\n }\n }\n }\n cout << YES\n ;\n for (int i = 0; i < m; i++) {\n for (auto it : ans[i])\n cout << fixed << setprecision(0) << it.first << << setprecision(6)\n << it.second << ;\n cout << \n ;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n void quickly_quickly_kro() {\n long long n;\n cin >> n;\n vector v(n);\n for (long long i = 0; i < n; i++) cin >> v[i];\n ;\n map M, N, I;\n for (long long i = 0; i < n; i++) {\n if (v[i] != 0)\n M[v[i]]++;\n else\n I[i]++;\n }\n for (long long i = 1; i < n + 1; i++) {\n if (M[i] == 0) {\n N[i]++;\n }\n }\n for (auto k : I) {\n if ((N.find(k.first + 1) != N.end())) {\n auto it = N.find(k.first + 1);\n if (it != N.begin())\n it--;\n else\n it++;\n v[k.first] = it->first;\n N.erase(it);\n }\n }\n for (long long i = 0; i < n; i++) {\n if (v[i] == 0) {\n auto it = N.begin();\n pair p = *it;\n v[i] = p.first;\n N.erase(it);\n }\n }\n for (long long i = 0; i < n; i++) cout << v[i] << ;\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 }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n struct HashMap {\n vector > g[1000007];\n void ins(int x, int y) {\n int id = ((long long)x * 1000000007 + y) % 1000007;\n g[id].push_back(make_pair(x, y));\n }\n bool get(int x, int y) {\n int id = ((long long)x * 1000000007 + y) % 1000007;\n for (int i = 0; i < g[id].size(); i++)\n if (g[id][i].first == x && g[id][i].second == y) return true;\n return false;\n }\n };\n int n;\n HashMap mp;\n vector row[100011];\n vector rateB;\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) {\n int x, y;\n scanf( %d%d , &x, &y);\n row[y].push_back(x);\n mp.ins(x, y);\n }\n int di = (int)sqrt(n);\n long long int ans = 0;\n for (int a = 0; a <= 100000; a++) {\n if (row[a].size() != 0) {\n sort(row[a].begin(), row[a].end());\n if (row[a].size() <= di) {\n for (int i = 0; i < row[a].size(); i++) {\n for (int j = i + 1; j < row[a].size(); j++) {\n int x1 = row[a][i];\n int x2 = row[a][j];\n int dis = x2 - x1;\n if (mp.get(x1, a + dis) && mp.get(x2, a + dis)) ans++;\n if (a - dis >= 0 && row[a - dis].size() > di &&\n (mp.get(x1, a - dis) && mp.get(x2, a - dis)))\n ans++;\n }\n }\n } else\n rateB.push_back(a);\n }\n }\n for (int i = 0; i < rateB.size(); i++) {\n for (int j = i + 1; j < rateB.size(); j++) {\n int a = rateB[i];\n int b = rateB[j];\n int u = 0, p = 0;\n int dis = b - a;\n while (u < row[a].size() && p < row[b].size()) {\n if (row[a][u] < row[b][p])\n u++;\n else if (row[a][u] > row[b][p])\n p++;\n else {\n int x1 = row[a][u];\n if (mp.get(x1 + dis, a) && mp.get(x1 + dis, b)) ans++;\n u++;\n p++;\n }\n }\n }\n }\n printf( %I64d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n struct HashMap {\n vector > g[1000007];\n void ins(int x, int y) {\n int id = ((long long)x * 1000000007 + y) % 1000007;\n g[id].push_back(make_pair(x, y));\n }\n bool get(int x, int y) {\n int id = ((long long)x * 1000000007 + y) % 1000007;\n for (int i = 0; i < g[id].size(); i++)\n if (g[id][i].first == x && g[id][i].second == y) return true;\n return false;\n }\n };\n int n;\n HashMap mp;\n vector row[100011];\n vector rateB;\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) {\n int x, y;\n scanf( %d%d , &x, &y);\n row[y].push_back(x);\n mp.ins(x, y);\n }\n int di = (int)sqrt(n);\n long long int ans = 0;\n for (int a = 0; a <= 100000; a++) {\n if (row[a].size() != 0) {\n sort(row[a].begin(), row[a].end());\n if (row[a].size() <= di) {\n for (int i = 0; i < row[a].size(); i++) {\n for (int j = i + 1; j < row[a].size(); j++) {\n int x1 = row[a][i];\n int x2 = row[a][j];\n int dis = x2 - x1;\n if (mp.get(x1, a + dis) && mp.get(x2, a + dis)) ans++;\n if (a - dis >= 0 && row[a - dis].size() > di &&\n (mp.get(x1, a - dis) && mp.get(x2, a - dis)))\n ans++;\n }\n }\n } else\n rateB.push_back(a);\n }\n }\n for (int i = 0; i < rateB.size(); i++) {\n for (int j = i + 1; j < rateB.size(); j++) {\n int a = rateB[i];\n int b = rateB[j];\n int u = 0, p = 0;\n int dis = b - a;\n while (u < row[a].size() && p < row[b].size()) {\n if (row[a][u] < row[b][p])\n u++;\n else if (row[a][u] > row[b][p])\n p++;\n else {\n int x1 = row[a][u];\n if (mp.get(x1 + dis, a) && mp.get(x1 + dis, b)) ans++;\n u++;\n p++;\n }\n }\n }\n }\n printf( extra\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int inf = (int)1.01e9;\n const double eps = 1e-9;\n const int maxn = (int)2e5 + 10;\n set S;\n int main() {\n int n, k, a;\n scanf( %d%d%d , &n, &k, &a);\n int cur = (n + 1) / (a + 1);\n assert(cur >= k);\n int m;\n scanf( %d , &m);\n for (int i = 0; (i) < (m); ++i) {\n int x;\n scanf( %d , &x);\n set::iterator it = S.lower_bound(x);\n int left = 0;\n int right = n + 1;\n if (it != S.end()) {\n right = *it;\n }\n if (it != S.begin()) {\n --it;\n left = *it;\n }\n cur -= (right - left) / (a + 1);\n cur += (x - left) / (a + 1);\n cur += (right - x) / (a + 1);\n if (cur < k) {\n printf( %d\n , i + 1);\n return 0;\n }\n S.insert(x);\n }\n printf( -1\n );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n bool has[200009];\n int left[200009];\n int main() {\n int Q;\n cin >> Q;\n for (int q = 0; q < Q; q++) {\n int N;\n cin >> N;\n vector v;\n for (int i = 0; i < N; i++) {\n int a;\n cin >> a;\n v.push_back(a);\n }\n sort(v.begin(), v.end());\n reverse(v.begin(), v.end());\n int res = v[0];\n vector w;\n vector t;\n for (int i = 1; i < v.size(); i++)\n if (v[i] != v[i - 1]) {\n if (v[0] % v[i] != 0)\n w.push_back(v[i]);\n else\n t.push_back(v[i]);\n }\n if (w.size() > 0) {\n res += w[0];\n for (int i = 1; i < w.size(); i++)\n if (w[0] % w[i] != 0) {\n res += w[i];\n break;\n }\n }\n if (t.size() >= 3 && t[0] + t[1] + t[2] > res) {\n if (t[0] % t[1] != 0 && t[1] % t[2] != 0 && t[0] % t[2] != 0)\n res = t[0] + t[1] + t[2];\n }\n if (t.size() >= 4 && t[0] + t[1] + t[3] > res) {\n if (t[0] % t[1] != 0 && t[1] % t[3] != 0 && t[0] % t[3] != 0)\n res = t[0] + t[1] + t[3];\n }\n cout << res << \n ;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct Segment {\n int l, r, x, ls, rs, fa;\n } seg[2000100];\n int n, k, p[100100], cnt, pnt, b[2000100], w, ans[100100], res;\n int Dfs(int &id, int l, int r) {\n id = ++cnt;\n seg[id].l = l, seg[id].r = r;\n seg[id].x = 1;\n if (r - l == 1) return 1;\n int mid = (l + r) >> 1;\n seg[id].x += Dfs(seg[id].ls, l, mid);\n seg[id].x += Dfs(seg[id].rs, mid, r);\n return seg[id].x;\n }\n void Vis(int x) {\n if (!x) return;\n b[x] = 1;\n Vis(seg[x].ls);\n Vis(seg[x].rs);\n }\n bool cmp(int x, int y) { return seg[x].l < seg[y].l; }\n void Solve(int x) {\n if (!x) return;\n if (b[x]) {\n for (int i = seg[x].l; i < seg[x].r; i++) ans[i] = res++;\n return;\n }\n Solve(seg[x].rs);\n Solve(seg[x].ls);\n }\n int main() {\n scanf( %d%d , &n, &k);\n Dfs(w, 0, n);\n k = seg[1].x - k;\n for (int i = 1; i <= cnt; i++)\n if (!b[i]) {\n if (k >= seg[i].x - 1 && seg[i].x > 1) {\n k -= seg[i].x - 1;\n p[++pnt] = i;\n Vis(i);\n if (!k) break;\n }\n }\n if (k)\n printf( -1 );\n else {\n res = 1;\n Solve(1);\n for (int i = n - 1; i >= 0; i--) ans[i] = ans[i] ? ans[i] : res++;\n for (int i = 0; i < n; i++) printf( %d , ans[i]);\n }\n return 0;\n }\n "} @@ -438,7 +438,7 @@ {"func_code_string": "#include \n using namespace std;\n const int inf = 1 << 30;\n const int N = 100100;\n char a[N], b[N];\n int n, m, k, p[27];\n int Par(int i) { return p[i] = (i == p[i]) ? i : Par(p[i]); }\n bool same(int i, int j) { return Par(i) == Par(j); }\n int comp[27];\n void mrg(int i, int j) {\n if (same(i, j)) return;\n i = Par(i);\n j = Par(j);\n p[i] = p[j];\n comp[i] += comp[j];\n }\n vector > v;\n int main() {\n scanf( %d , &n);\n scanf( %s , a);\n scanf( %s , b);\n for (int i = 0; i < 26; i++) {\n p[i] = i;\n comp[i] = 1;\n }\n for (int i = 0; i < n; i++) {\n if (same(b[i] - 'a', a[i] - 'a')) continue;\n mrg(b[i] - 'a', a[i] - 'a');\n v.push_back({a[i], b[i]});\n }\n printf( %d\n , v.size());\n for (auto x : v) printf( %c %c\n , x.first, x.second);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n double pi = acos(-1);\n struct point {\n int x, y;\n } p[2005];\n vector v;\n int main() {\n int n;\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) scanf( %d%d , &p[i].x, &p[i].y);\n long long ans = 0;\n for (int i = 1; i <= n; i++) {\n v.clear();\n for (int j = 1; j <= n; j++)\n if (j != i) v.push_back(atan2(p[j].y - p[i].y, p[j].x - p[i].x));\n sort(v.begin(), v.end());\n int k = 0;\n int now = 0;\n for (int j = 0; j < v.size(); j++) {\n while (v[k] + now * pi < v[j] + pi) {\n k++;\n if (k >= v.size()) k = 0, now += 2;\n }\n int w = (j - k >= 0 ? j - k : k - j - 1);\n ans += 1ll * w * (w - 1) / 2 * (n - w - 2) * (n - w - 3) / 2;\n }\n }\n printf( %lld\n , ans / 2);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 1e6 + 6, MAX = 2e5 + 5, OO = 1000000009;\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 int a, b, aa, bb, ans;\n void Check(int p) {\n while (a % p == 0) {\n a /= p;\n aa++;\n }\n while (b % p == 0) {\n b /= p;\n bb++;\n }\n ans += abs(aa - bb);\n aa = bb = 0;\n }\n int main() {\n scanf( %d %d , &a, &b);\n Check(2);\n Check(3);\n Check(5);\n return printf( %d , a == b ? ans : -1), 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int MOD = 1000 * 1000 * 1000 + 7;\n const int INF = 2000 * 1000 * 1000;\n const double EPS = 1e-9;\n const double pi = acos(-1.0);\n const int maxn = 100010;\n inline long long sqr(int n) { return n * 1ll * n; }\n struct Point {\n int x, y;\n Point() {}\n inline bool operator<(const Point& p) const { return y < p.y; }\n inline long long dist_to(const Point& p) const {\n return sqr(x - p.x) + sqr(y - p.y);\n }\n };\n Point a[maxn];\n int n, x, sum;\n long long minans = INF * 1ll * INF;\n inline void update(const Point& p1, const Point& p2) {\n minans = min(minans, p1.dist_to(p2));\n }\n inline void go(int l, int r) {\n if (r - l <= 3) {\n for (int i = l; i <= r; i++)\n for (int j = i + 1; j <= r; j++) update(a[i], a[j]);\n sort(a + l, a + r + 1);\n return;\n }\n int mid = (l + r) >> 1;\n int midx = a[mid].x;\n int buf_size = 0;\n go(l, mid - 1);\n go(mid, r);\n static Point buf[maxn];\n merge(a + l, a + mid, a + mid, a + r + 1, buf);\n copy(buf, buf + (r - l + 1), a + l);\n for (int i = l; i <= r; i++) {\n if (sqr(abs(a[i].x - midx)) < minans) {\n for (int j = buf_size - 1; j >= 0 && sqr(a[i].y - buf[j].y) < minans; j--)\n update(a[i], buf[j]);\n buf[buf_size++] = a[i];\n }\n }\n }\n int main() {\n scanf( %d , &n);\n for (int i = 0; i < n; i++) {\n scanf( %d , &x);\n sum += x;\n a[i].x = i + 1;\n a[i].y = sum;\n }\n go(0, n - 1);\n printf( %I64d , minans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int MOD = 1000 * 1000 * 1000 + 7;\n const int INF = 2000 * 1000 * 1000;\n const double EPS = 1e-9;\n const double pi = acos(-1.0);\n const int maxn = 100010;\n inline long long sqr(int n) { return n * 1ll * n; }\n struct Point {\n int x, y;\n Point() {}\n inline bool operator<(const Point& p) const { return y < p.y; }\n inline long long dist_to(const Point& p) const {\n return sqr(x - p.x) + sqr(y - p.y);\n }\n };\n Point a[maxn];\n int n, x, sum;\n long long minans = INF * 1ll * INF;\n inline void update(const Point& p1, const Point& p2) {\n minans = min(minans, p1.dist_to(p2));\n }\n inline void go(int l, int r) {\n if (r - l <= 3) {\n for (int i = l; i <= r; i++)\n for (int j = i + 1; j <= r; j++) update(a[i], a[j]);\n sort(a + l, a + r + 1);\n return;\n }\n int mid = (l + r) >> 1;\n int midx = a[mid].x;\n int buf_size = 0;\n go(l, mid - 1);\n go(mid, r);\n static Point buf[maxn];\n merge(a + l, a + mid, a + mid, a + r + 1, buf);\n copy(buf, buf + (r - l + 1), a + l);\n for (int i = l; i <= r; i++) {\n if (sqr(abs(a[i].x - midx)) < minans) {\n for (int j = buf_size - 1; j >= 0 && sqr(a[i].y - buf[j].y) < minans; j--)\n update(a[i], buf[j]);\n buf[buf_size++] = a[i];\n }\n }\n }\n int main() {\n scanf( %d , &n);\n for (int i = 0; i < n; i++) {\n scanf( %d , &x);\n sum += x;\n a[i].x = i + 1;\n a[i].y = sum;\n }\n go(0, n - 1);\n printf( extra , minans);\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;\n cin >> n >> m;\n vector col(m);\n for (long long i = 0; i < m; i++) {\n cin >> col[i];\n }\n vector suf(m, 0);\n suf[m - 1] = 0;\n for (long long i = m - 2; i >= 0; i--) {\n suf[i] = suf[i + 1] + col[i + 1];\n }\n vector ans;\n for (long long i = 0, cur = 0, r = 0; i < m; i++) {\n ans.push_back(cur);\n r = cur + col[i];\n if (r > n) {\n cout << -1 << endl;\n return 0;\n }\n cur++;\n if (suf[i] < n - r) {\n cout << -1 << endl;\n return 0;\n } else if (suf[i] < n - cur) {\n long long pos = n - suf[i];\n for (long long j = i + 1; j < m; j++) {\n ans.push_back(pos);\n pos += col[j];\n }\n break;\n }\n }\n for (long long i = 0; i < m; i++) {\n cout << ans[i] + 1 << ;\n }\n cout << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long MOD = 1e9 + 7;\n const int iinf = 1 << 29;\n const long long llinf = 1ll << 60;\n const double PI = 3.14159265;\n mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\n long long mrand(long long B) { return (unsigned long long)rng() % B; }\n long long cross(pair p1, pair p2) {\n return p1.first * p2.second - p2.first * p1.second;\n }\n bool online(pair a, pair b,\n pair c) {\n pair p1{b.first - a.first, b.second - a.second};\n pair p2{c.first - a.first, c.second - a.second};\n return cross(p1, p2) == 0;\n }\n void z_func(vector &z, vector &s, int n) {\n int L = 0, R = 0;\n for (int i = 1; i < n; i++) {\n if (i > R) {\n L = R = i;\n while (R < n && s[R - L] == s[R]) R++;\n z[i] = R - L;\n R--;\n } else {\n int k = i - L;\n if (z[k] < R - i + 1)\n z[i] = z[k];\n else {\n L = i;\n while (R < n && s[R - L] == s[R]) R++;\n z[i] = R - L;\n R--;\n }\n }\n }\n }\n const int MXN = 400;\n long long ans;\n int n, m;\n int v[MXN][MXN], up[MXN][MXN], down[MXN][MXN], leftt[MXN][MXN],\n rightt[MXN][MXN], ul[MXN][MXN], ur[MXN][MXN], lol[MXN][MXN], lr[MXN][MXN];\n void populate() {\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n if (!v[i][j]) continue;\n if (i && v[i - 1][j]) up[i][j] = 1 + up[i - 1][j];\n if (j && v[i][j - 1]) leftt[i][j] = 1 + leftt[i][j - 1];\n if (i && j && v[i - 1][j - 1]) ul[i][j] = 1 + ul[i - 1][j - 1];\n if (i && j != m - 1 && v[i - 1][j + 1]) ur[i][j] = 1 + ur[i - 1][j + 1];\n }\n }\n for (int i = n - 1; i >= 0; --i) {\n for (int j = m - 1; j >= 0; --j) {\n if (!v[i][j]) continue;\n if (i != n - 1 && v[i + 1][j]) down[i][j] = 1 + down[i + 1][j];\n if (j != m - 1 && v[i][j + 1]) rightt[i][j] = 1 + rightt[i][j + 1];\n if (i != n - 1 && j != m - 1 && v[i + 1][j + 1])\n lr[i][j] = 1 + lr[i + 1][j + 1];\n if (i != n - 1 && j && v[i + 1][j - 1]) lol[i][j] = 1 + lol[i + 1][j - 1];\n }\n }\n }\n void do_lower_leftt(int x, int y) {\n for (int i = x + 1, j = y - 1; i < n && j >= 0 && v[i][j]; ++i, --j) {\n ans += down[x][y] >= 2 * (i - x) && lr[i][j] >= i - x;\n ans += down[x][y] >= i - x && rightt[i][j] >= y - j;\n ans += lr[x][y] >= i - x && rightt[i][j] >= 2 * (y - j);\n }\n }\n void do_down(int x, int y) {\n for (int i = x + 1; i < n && v[i][y]; ++i) {\n ans += lr[x][y] >= i - x && rightt[i][y] >= i - x;\n ans += rightt[x][y] >= i - x && ur[i][y] >= i - x;\n ans +=\n (i - x) % 2 == 0 && lr[x][y] >= (i - x) / 2 && ur[i][y] >= (i - x) / 2;\n }\n }\n void do_lower_rightt(int x, int y) {\n for (int i = x + 1, j = y + 1; i < n && j < m && v[i][j]; ++i, ++j) {\n ans += rightt[x][y] >= j - y && up[i][j] >= i - x;\n ans += rightt[x][y] >= 2 * (j - y) && ur[i][j] >= i - x;\n }\n }\n void work() {\n cin >> 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 while (c != '0' && c != '1') cin >> c;\n v[i][j] = c == '0' ? 1 : 0;\n }\n populate();\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n if (!v[i][j]) continue;\n do_lower_leftt(i, j);\n do_down(i, j);\n do_lower_rightt(i, j);\n }\n }\n cout << ans << endl;\n }\n int main() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n work();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long int n, i, x, sum = 0;\n long long int c[100009];\n scanf( %lld %lld , &n, &x);\n for (i = 0; i < n; i++) {\n scanf( %lld , &c[i]);\n }\n sort(c, c + n);\n for (i = 0; i < n; i++) {\n sum = sum + c[i] * x;\n x--;\n if (x == 0) x++;\n }\n printf( %lld\n , sum);\n }\n "} @@ -492,10 +492,10 @@ {"func_code_string": "#include \n using namespace std;\n void fastio() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n }\n long long power(long long a, long long b) {\n if (b == 0) {\n return 1;\n } else {\n if (b % 2 == 0) {\n return (a * power((a * a) % 1000000007, b / 2)) % 1000000007;\n } else {\n return power((a * a) % 1000000007, b / 2);\n }\n }\n }\n int main() {\n fastio();\n long long l, r;\n cin >> l >> r;\n long long even1 = 0, odd1 = 0;\n long long p = 0;\n l--;\n while (l > 0) {\n long long t = min((long long)pow(2LL, p), l);\n if (p % 2 == 0) {\n odd1 += t;\n odd1 %= 1000000007;\n } else {\n even1 += t;\n even1 %= 1000000007;\n }\n p++;\n l -= t;\n }\n long long even2 = 0, odd2 = 0;\n p = 0;\n while (r > 0) {\n long long t = min((long long)pow(2LL, p), r);\n if (p % 2 == 0) {\n odd2 += t;\n odd2 %= 1000000007;\n } else {\n even2 += t;\n even2 %= 1000000007;\n }\n p++;\n r -= t;\n }\n long long sum1 = (even1 * (even1 + 1)) % 1000000007;\n sum1 = (sum1 + (odd1 * odd1) % 1000000007) % 1000000007;\n long long sum2 = (even2 * (even2 + 1)) % 1000000007;\n sum2 = (sum2 + (odd2 * odd2) % 1000000007) % 1000000007;\n cout << (sum2 - sum1 + 1000000007) % 1000000007;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int inf = 0x3f3f3f3f;\n struct node {\n double x, y;\n } po[1010];\n double dis(node a, node b) {\n return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));\n }\n node mark;\n double cha(node a, node b, node c) {\n return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y);\n }\n double get(node a, node b, node c) {\n return abs(cha(a, b, c)) / dis(a, b) / 2.0;\n }\n int main() {\n int n;\n cin >> n;\n double ans = 1e9;\n for (int i = (0); i < (n); ++i) cin >> po[i].x >> po[i].y;\n for (int i = (0); i < (n); ++i) {\n ans = min(ans, get(po[(i - 1 + n) % n], po[(i + 1) % n], po[i]));\n }\n cout << fixed << setprecision(10) << ans << '\n';\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long n, x, c, cnt;\n vector v1, v2;\n int main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n cin >> n;\n while (n--) {\n cin >> x;\n if (x > 0)\n v1.push_back(x), c += x;\n else\n v2.push_back(abs(x)), cnt += abs(x);\n }\n if (c > cnt) {\n cout << first\n ;\n return 0;\n }\n if (cnt > c) {\n cout << second\n ;\n return 0;\n }\n bool a = 0;\n for (int i = 0; i < min(v1.size(), v2.size()); i++) {\n if (v1[i] > v2[i]) {\n cout << first\n ;\n return 0;\n } else if (v1[i] < v2[i]) {\n cout << second\n ;\n return 0;\n }\n }\n if (x < 0)\n cout << second << endl;\n else\n cout << first << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n long long n, t, ans;\n short i, j, k;\n char cnt, l;\n long long C[43][43];\n int main() {\n scanf( %I64d %I64d , &n, &t);\n for (i = 0; (1ll << i) < t; ++i)\n ;\n if ((1ll << i) ^ t) {\n puts( 0 );\n return 0;\n }\n k = i + 1;\n for (i = 0; i < 43; ++i) C[0][i] = 1ll;\n for (i = 1; i < 43; ++i)\n for (j = 1; j <= i; ++j) C[j][i] = C[j - 1][i - 1] + C[j][i - 1];\n ++n;\n for (cnt = i = 0; (1ll << i) <= n; ++i)\n if ((1ll << i) & n) ++cnt;\n for (l = i = 0; (1ll << i) <= n; ++i)\n if (n & (1ll << i)) {\n ++l;\n if (k - cnt + l >= 0) ans += C[k - cnt + l][i];\n }\n if (cnt == k) ++ans;\n if (k == 1) --ans;\n printf( %I64d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n long long n, t, ans;\n short i, j, k;\n char cnt, l;\n long long C[43][43];\n int main() {\n scanf( extra extra , &n, &t);\n for (i = 0; (1ll << i) < t; ++i)\n ;\n if ((1ll << i) ^ t) {\n puts( 0 );\n return 0;\n }\n k = i + 1;\n for (i = 0; i < 43; ++i) C[0][i] = 1ll;\n for (i = 1; i < 43; ++i)\n for (j = 1; j <= i; ++j) C[j][i] = C[j - 1][i - 1] + C[j][i - 1];\n ++n;\n for (cnt = i = 0; (1ll << i) <= n; ++i)\n if ((1ll << i) & n) ++cnt;\n for (l = i = 0; (1ll << i) <= n; ++i)\n if (n & (1ll << i)) {\n ++l;\n if (k - cnt + l >= 0) ans += C[k - cnt + l][i];\n }\n if (cnt == k) ++ans;\n if (k == 1) --ans;\n printf( extra\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MAX_N = 1001;\n int dp2[MAX_N][MAX_N], dp5[MAX_N][MAX_N];\n int n;\n string findPath(int (*p)[MAX_N]) {\n int i = n - 1, j = n - 1;\n string path = ;\n while (i != 0 && j != 0) {\n if (p[i - 1][j] > p[i][j - 1]) {\n path.insert(0, R );\n j--;\n } else {\n path.insert(0, D );\n i--;\n }\n }\n if (i == 0) {\n while (j != 0) {\n path.insert(0, R );\n j--;\n }\n } else {\n while (i != 0) {\n path.insert(0, D );\n i--;\n }\n }\n return path;\n }\n int main() {\n std::ios::sync_with_stdio(false);\n cin >> n;\n int temp1, temp2, zeroI = -1;\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++) {\n cin >> temp1;\n if (!temp1) {\n zeroI = i;\n continue;\n }\n temp2 = temp1;\n while (!(temp1 & 1)) {\n dp2[i][j]++;\n temp1 >>= 1;\n }\n while (!(temp2 % 5)) {\n dp5[i][j]++;\n temp2 /= 5;\n }\n }\n for (int i = 1; i < n; i++) {\n dp2[i][0] += dp2[i - 1][0];\n dp5[i][0] += dp5[i - 1][0];\n dp2[0][i] += dp2[0][i - 1];\n dp5[0][i] += dp5[0][i - 1];\n }\n for (int i = 1; i < n; i++) {\n for (int j = 1; j < n; j++) {\n dp2[i][j] += min(dp2[i - 1][j], dp2[i][j - 1]);\n dp5[i][j] += min(dp5[i - 1][j], dp5[i][j - 1]);\n }\n }\n int(*p)[MAX_N] = (dp2[n - 1][n - 1] < dp5[n - 1][n - 1]) ? dp2 : dp5;\n if ((~zeroI) && p[n - 1][n - 1] > 1) {\n cout << 1 << endl;\n for (int i = 0; i < zeroI; i++) cout << D << flush;\n for (int j = 1; j < n; j++) cout << R << flush;\n for (int i = zeroI + 1; i < n; i++) cout << D << flush;\n return 0;\n } else {\n cout << p[n - 1][n - 1] << endl;\n cout << findPath(p) << flush;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int B, n, m;\n int li[500008], ri[500008], mx[500008], tag[500008];\n short g[480][100008];\n int bel[500008], de[500008], ai[500008], pa[500008];\n short size[500008];\n int find(int x) {\n if (pa[x] == x) return x;\n return pa[x] = find(pa[x]);\n }\n void link(int x, int y) {\n if (x == y) return;\n if (size[x] > size[y]) swap(x, y);\n pa[x] = y;\n size[y] += size[x];\n }\n int tot;\n int lst[500008], stamp[500008];\n void makeup(int id) {\n ++tot;\n mx[id] = 0;\n for (int i = li[id]; i <= ri[id]; i++) pa[i] = i, size[i] = 1;\n for (int i = li[id]; i <= ri[id]; i++) {\n int x = ai[i];\n mx[id] = max(mx[id], x);\n if (stamp[x] != tot)\n stamp[x] = tot, g[id][x] = lst[x] = i - li[id];\n else\n link(i, g[id][x] + li[id]), g[id][x] = find(g[id][x] + li[id]) - li[id];\n }\n }\n void pushdown(int id) {\n for (int i = li[id]; i <= ri[id]; i++) g[id][ai[i]] = -1;\n for (int i = li[id]; i <= ri[id]; i++) {\n g[id][ai[i] + de[i]] = -1;\n if (find(i) == i) ai[i] = ai[i] + de[i] - tag[id];\n de[i] = 0;\n }\n for (int i = li[id]; i <= ri[id]; i++) ai[i] = ai[find(i)];\n tag[id] = 0;\n }\n void refresh(int id) {\n while (-1 == g[id][mx[id]]) mx[id]--;\n }\n int cnt = 0;\n void subtract(int id, int x) {\n if (mx[id] - tag[id] <= x) return;\n if (mx[id] - tag[id] > x * 2 + 1 and 1) {\n for (int i = tag[id] + 1; i <= x + tag[id]; i++)\n if (g[id][i] != -1) {\n int j = i + x;\n de[g[id][i] + li[id]] += x;\n if (g[id][j] != -1)\n link(g[id][i] + li[id], g[id][j] + li[id]),\n g[id][j] = find(g[id][j] + li[id]) - li[id];\n else\n g[id][j] = g[id][i];\n g[id][i] = -1;\n }\n tag[id] += x;\n } else {\n for (int i = x + 1 + tag[id]; i <= mx[id]; i++)\n if (g[id][i] != -1) {\n int j = i - x;\n de[g[id][i] + li[id]] -= x;\n if (g[id][j] != -1)\n link(g[id][j] + li[id], g[id][i] + li[id]),\n g[id][j] = find(g[id][j] + li[id]) - li[id];\n else\n g[id][j] = g[id][i];\n g[id][i] = -1;\n }\n refresh(id);\n }\n }\n int ask(int id, int x) {\n if (x + tag[id] > 100001) return 0;\n if (g[id][x + tag[id]] == -1) return 0;\n g[id][x + tag[id]] = find(g[id][x + tag[id]] + li[id]) - li[id];\n return size[g[id][x + tag[id]] + li[id]];\n }\n signed main() {\n memset(g, -1, sizeof g);\n scanf( %d%d , &n, &m);\n for (int i = 1; i <= n; i++) scanf( %d , &ai[i]);\n B = sqrt(n);\n B = max(B, n / 475);\n memset(li, 0x3f, sizeof li);\n for (int i = 1; i <= n; i++) {\n bel[i] = i / B;\n li[bel[i]] = min(li[bel[i]], i);\n ri[bel[i]] = i;\n }\n for (int i = 0; i <= n / B; i++) makeup(i);\n while (m--) {\n int op, l, r, x;\n scanf( %d%d%d%d , &op, &l, &r, &x);\n if (op == 1) {\n if (bel[l] == bel[r]) {\n pushdown(bel[l]);\n for (int i = l; i <= r; i++)\n if (ai[i] > x) ai[i] -= x;\n makeup(bel[l]);\n } else {\n pushdown(bel[l]);\n for (int i = l; i <= ri[bel[l]]; i++)\n if (ai[i] > x) ai[i] -= x;\n pushdown(bel[r]);\n for (int i = li[bel[r]]; i <= r; i++)\n if (ai[i] > x) ai[i] -= x;\n makeup(bel[l]);\n makeup(bel[r]);\n for (int i = bel[l] + 1; i < bel[r]; i++) subtract(i, x);\n }\n } else {\n int ans = 0;\n if (bel[l] == bel[r]) {\n pushdown(bel[l]);\n for (int i = l; i <= r; i++)\n if (ai[i] == x) ans++;\n makeup(bel[l]);\n printf( %d\n , ans);\n } else {\n pushdown(bel[l]);\n for (int i = l; i <= ri[bel[l]]; i++) ans += (ai[i] == x);\n pushdown(bel[r]);\n for (int i = li[bel[r]]; i <= r; i++) ans += (ai[i] == x);\n makeup(bel[l]);\n makeup(bel[r]);\n for (int i = bel[l] + 1; i < bel[r]; i++) ans += ask(i, x);\n printf( %d\n , ans);\n }\n }\n ++cnt;\n if (cnt < -7) {\n for (int i = 0; i <= n / B; i++) pushdown(i);\n for (int i = 1; i <= n; i++) cout << ai[i] << ;\n cout << g[2][30] << :\n\n ;\n for (int i = 0; i <= n / B; i++) makeup(i);\n }\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int N = 100010;\n long long a[N];\n int n;\n bool check(long long x) {\n long long sum = 0;\n for (int i = 2; i <= n; ++i) {\n if (x - a[i] < 0) return false;\n sum += x - a[i];\n }\n return (sum >= a[1]);\n }\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; ++i) scanf( %I64d , &a[i]);\n sort(a + 1, a + n + 1);\n long long l = 0, r = (long long)1e14 + 1;\n while (l + 1 < r) {\n long long mid = (l + r) / 2;\n if (check(mid))\n r = mid;\n else\n l = mid;\n }\n if (check(l))\n printf( %I64d , l);\n else\n printf( %I64d , r);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int N = 100010;\n long long a[N];\n int n;\n bool check(long long x) {\n long long sum = 0;\n for (int i = 2; i <= n; ++i) {\n if (x - a[i] < 0) return false;\n sum += x - a[i];\n }\n return (sum >= a[1]);\n }\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; ++i) scanf( extra , &a[i]);\n sort(a + 1, a + n + 1);\n long long l = 0, r = (long long)1e14 + 1;\n while (l + 1 < r) {\n long long mid = (l + r) / 2;\n if (check(mid))\n r = mid;\n else\n l = mid;\n }\n if (check(l))\n printf( extra , l);\n else\n printf( extra , r);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n bool isPowerOfTwo(int n) {\n if (n == 0) return false;\n return (ceil(log2(n)) == floor(log2(n)));\n }\n void asquare() {\n long long n, c = 0, ans = LONG_LONG_MAX;\n cin >> n;\n string sn;\n if (isPowerOfTwo(n) == true)\n cout << 0\n ;\n else {\n long long j = 0, k = 0, nn = 1;\n string s = to_string(n);\n for (int i = 0; i <= 60; i++) {\n nn = (long long)pow(2, i);\n sn = to_string(nn);\n c = 0, j = 0, k = 0;\n bool bb;\n while (j != s.length() && k != sn.length()) {\n if (s[j] == sn[k]) {\n j++;\n k++;\n bb = true;\n } else {\n j++;\n c++;\n bb = false;\n }\n }\n if (bb = true) {\n if (j == s.length()) {\n k--;\n c += sn.length() - k - 1;\n } else if (k == sn.length()) {\n j--;\n c += s.length() - j - 1;\n }\n } else {\n k--;\n c += sn.length() - k - 1;\n }\n if (c == 1) {\n ans = 1;\n break;\n } else\n ans = min(ans, c);\n }\n cout << ans << \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;\n cin >> t;\n while (t--) {\n asquare();\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 x, y;\n cin >> x >> y;\n int ans = 0;\n int d = max(abs(x), abs(y));\n if (d == 0) {\n cout << 0 << \n ;\n return 0;\n } else\n ans = (d - 1) * 4;\n if (x == d && y != -1 * (d - 1) && y != -1 * (d)) ans++;\n if (y == d && x != d) ans += 2;\n if (x == -1 * d && y != d) ans += 3;\n if (y == -1 * d && x != -1 * d) ans += 4;\n cout << ans << \n ;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct Aho {\n Aho *son[26];\n Aho *fail;\n int cntstr, faildp;\n Aho() {\n for (int i = 0; i < 26; ++i) son[i] = NULL;\n fail = NULL;\n cntstr = 0;\n faildp = -1;\n }\n };\n void insert(Aho *x, int i, const string &str) {\n if (i < str.size()) {\n if (x->son[str[i] - 'a'] == NULL) {\n x->son[str[i] - 'a'] = new Aho();\n }\n insert(x->son[str[i] - 'a'], i + 1, str);\n } else {\n x->cntstr++;\n }\n }\n void calcFailEdges(Aho *root) {\n deque q;\n root->fail = root;\n q.push_back(root);\n while (!q.empty()) {\n Aho *x = q.front();\n q.pop_front();\n for (int i = 0; i < 26; ++i) {\n if (x->son[i] != NULL) {\n q.push_back(x->son[i]);\n Aho *pnt = x->fail;\n if (x == root)\n x->son[i]->fail = root;\n else {\n while (pnt != root && pnt->son[i] == NULL) {\n pnt = pnt->fail;\n }\n if (pnt->son[i] != NULL)\n x->son[i]->fail = pnt->son[i];\n else\n x->son[i]->fail = root;\n }\n }\n }\n }\n }\n int getDp(Aho *t) {\n if (t->faildp == -1) {\n t->faildp = t->cntstr;\n t->faildp += getDp(t->fail);\n }\n return t->faildp;\n }\n const int MAX_N = 200000;\n Aho *state[1 + MAX_N];\n Aho *advance(Aho *t, char ch) {\n while (t->fail != t && t->son[ch - 'a'] == NULL) t = t->fail;\n if (t->son[ch - 'a'] == NULL) return t;\n return t->son[ch - 'a'];\n }\n Aho *state1[MAX_N], *state2[MAX_N];\n void doStuff(int n, Aho **state, const string &str, const vector &vec) {\n Aho *T = new Aho();\n for (int i = 0; i < n; ++i) insert(T, 0, vec[i]);\n T->faildp = T->cntstr;\n calcFailEdges(T);\n Aho *pnt = T;\n for (int i = 1; i <= str.size(); ++i) {\n pnt = advance(pnt, str[i - 1]);\n state[i] = pnt;\n }\n }\n int main() {\n int n;\n string str;\n cin >> str >> n;\n vector vec;\n for (int i = 0; i < n; ++i) {\n string p;\n cin >> p;\n vec.push_back(p);\n }\n doStuff(n, state1, str, vec);\n for (int i = 0; i < n; ++i) reverse(vec[i].begin(), vec[i].end());\n reverse(str.begin(), str.end());\n doStuff(n, state2, str, vec);\n long long rez = 0LL;\n for (int i = 1; i < str.size(); ++i)\n rez = (long long)getDp(state1[i]) * getDp(state2[str.size() - i]) + rez;\n printf( %lld , rez);\n return 0;\n }\n "} @@ -537,7 +537,7 @@ {"func_code_string": "#include \n using namespace std;\n int r, g, j, f[200001], sc, kq, mod = round(1e9) + 7;\n long long i, h;\n int main() {\n cin >> r >> g;\n f[0] = 1;\n for (i = 1; i * (i + 1) / 2 <= r + g; i++) {\n for (j = r; j >= 0; j--) {\n if (j >= i) f[j] = (f[j] + f[j - i]) % mod;\n }\n }\n h = i - 1;\n for (i = 0; i <= r; i++)\n if (h * (h + 1) / 2 - i <= g) kq = (kq + f[i]) % mod;\n cout << kq;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 1e5 + 7;\n vector > s;\n int co[maxn], deg[maxn];\n int main() {\n int n;\n cin >> n;\n for (int i = 0; i < n - 1; i++) {\n pair q;\n cin >> q.first >> q.second;\n s.push_back(q);\n }\n for (int i = 1; i <= n; i++) {\n cin >> co[i];\n }\n int x = 0;\n for (auto i : s) {\n if (co[i.first] != co[i.second]) {\n deg[i.first]++;\n deg[i.second]++;\n x++;\n }\n }\n int flag = 0;\n for (int i = 1; i <= n; i++) {\n if (deg[i] == x) {\n flag = i;\n }\n }\n if (flag) {\n printf( YES\n%d\n , flag);\n } else {\n printf( NO\n );\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n void solve() {\n long long n, k, kol = 0;\n cin >> n >> k;\n string s;\n cin >> s;\n vector a(n);\n for (long long i = 0; i < n; i++) {\n a[i] = s[i] - '0';\n }\n for (long long i = 0; i < n - 1 && k; i++) {\n if (a[i] == 4 && a[i + 1] == 7) {\n if (i % 2 == 0) {\n a[i + 1] = 4;\n k--;\n } else {\n if (i > 0 && a[i - 1] == 4) {\n if (k % 2 == 1) {\n a[i] = 7;\n }\n break;\n }\n a[i] = a[i + 1] = 7;\n k--;\n }\n }\n }\n for (long long i = 0; i < n; i++) {\n cout << a[i];\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 while (t--) {\n solve();\n }\n }\n "} -{"func_code_string": "#include \n #pragma warning(disable : 4996)\n using namespace std;\n int n, l;\n long long a[300000][3];\n long long b[300000][3];\n long long t[300000][2];\n vector c[3000000];\n vector > g;\n long long p[3000000];\n long long dab[3000000][2];\n void sayno() {\n printf( NO );\n exit(0);\n }\n void calc() {\n int i, j, k;\n long long d = -1;\n for (i = 0; i < l; i++) {\n if (c[i].size() >= 2) {\n d = (t[c[i][1]][1] - t[c[i][0]][1]) /\n ((t[c[i][1]][0] - t[c[i][0]][0]) / l);\n break;\n }\n }\n if (d == -1) {\n int past = 0;\n g.clear();\n for (i = 1; i <= l; i++) {\n if (!c[i % l].size()) continue;\n int x = c[past][0], y = c[i % l][0];\n if (t[x][0] < t[y][0]) {\n long long u = (t[y][0] - t[x][0]) / l;\n long long v = t[y][1] - t[x][1];\n long long w = (t[y][0] - t[x][0]) % l;\n if (u != 0)\n g.push_back(pair((v - w + u - 1) / u, v / u));\n } else {\n long long u = (t[x][0] - t[y][0]) / l + 1;\n long long v = t[x][1] - t[y][1];\n long long w = t[y][0] + u * l - t[x][0];\n if (u != 0)\n g.push_back(pair((v + u - 1) / u, (v + w) / u));\n }\n past = i;\n }\n sort(g.begin(), g.end());\n for (auto e : g) {\n if (e.second < g.back().first) sayno();\n }\n d = g.back().first;\n }\n memset(p, -1, sizeof(p));\n for (i = 0; i < n; i++) {\n long long u = t[i][1] - d * (t[i][0] / l);\n long long v = t[i][0] % l;\n if (p[v] == -1)\n p[v] = u;\n else if (p[v] != u)\n sayno();\n }\n p[l] = d;\n int past = 0;\n for (i = 1; i <= l; i++) {\n if (p[i] == -1) continue;\n if (p[i] - p[past] < 0 || p[i] - p[past] > i - past) sayno();\n for (j = 0; j < p[i] - p[past]; j++) {\n dab[past + j][1] = 1;\n }\n for (j = p[i] - p[past]; j < i - past; j++) {\n dab[past + j][1] = -1;\n }\n past = i;\n }\n }\n int main() {\n int i, j, k;\n cin >> n >> l;\n for (i = 0; i <= n; i++) {\n if (i != 0) scanf( %I64d%I64d%I64d , &a[i][0], &a[i][1], &a[i][2]);\n b[i][0] = a[i][0], b[i][1] = a[i][1] + a[i][2], b[i][2] = a[i][1] - a[i][2];\n if ((b[i][1] + b[i][0]) % 2 == 1 || (b[i][2] + b[i][0]) % 2 == 1) sayno();\n b[i][1] = (b[i][1] + b[i][0]) / 2, b[i][2] = (b[i][2] + b[i][0]) / 2;\n c[b[i][0] % l].push_back(i);\n }\n n++;\n for (i = 0; i < n; i++) t[i][0] = b[i][0], t[i][1] = b[i][1];\n calc();\n for (i = 0; i < l; i++) dab[i][0] = dab[i][1];\n for (i = 0; i < n; i++) t[i][0] = b[i][0], t[i][1] = b[i][2];\n calc();\n for (i = 0; i < l; i++) {\n if (dab[i][0] == -1 & dab[i][1] == -1)\n printf( L );\n else if (dab[i][0] == 1 && dab[i][1] == 1)\n printf( R );\n else if (dab[i][0] == -1 && dab[i][1] == 1)\n printf( D );\n else\n printf( U );\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n #pragma warning(disable : 4996)\n using namespace std;\n int n, l;\n long long a[300000][3];\n long long b[300000][3];\n long long t[300000][2];\n vector c[3000000];\n vector > g;\n long long p[3000000];\n long long dab[3000000][2];\n void sayno() {\n printf( NO );\n exit(0);\n }\n void calc() {\n int i, j, k;\n long long d = -1;\n for (i = 0; i < l; i++) {\n if (c[i].size() >= 2) {\n d = (t[c[i][1]][1] - t[c[i][0]][1]) /\n ((t[c[i][1]][0] - t[c[i][0]][0]) / l);\n break;\n }\n }\n if (d == -1) {\n int past = 0;\n g.clear();\n for (i = 1; i <= l; i++) {\n if (!c[i % l].size()) continue;\n int x = c[past][0], y = c[i % l][0];\n if (t[x][0] < t[y][0]) {\n long long u = (t[y][0] - t[x][0]) / l;\n long long v = t[y][1] - t[x][1];\n long long w = (t[y][0] - t[x][0]) % l;\n if (u != 0)\n g.push_back(pair((v - w + u - 1) / u, v / u));\n } else {\n long long u = (t[x][0] - t[y][0]) / l + 1;\n long long v = t[x][1] - t[y][1];\n long long w = t[y][0] + u * l - t[x][0];\n if (u != 0)\n g.push_back(pair((v + u - 1) / u, (v + w) / u));\n }\n past = i;\n }\n sort(g.begin(), g.end());\n for (auto e : g) {\n if (e.second < g.back().first) sayno();\n }\n d = g.back().first;\n }\n memset(p, -1, sizeof(p));\n for (i = 0; i < n; i++) {\n long long u = t[i][1] - d * (t[i][0] / l);\n long long v = t[i][0] % l;\n if (p[v] == -1)\n p[v] = u;\n else if (p[v] != u)\n sayno();\n }\n p[l] = d;\n int past = 0;\n for (i = 1; i <= l; i++) {\n if (p[i] == -1) continue;\n if (p[i] - p[past] < 0 || p[i] - p[past] > i - past) sayno();\n for (j = 0; j < p[i] - p[past]; j++) {\n dab[past + j][1] = 1;\n }\n for (j = p[i] - p[past]; j < i - past; j++) {\n dab[past + j][1] = -1;\n }\n past = i;\n }\n }\n int main() {\n int i, j, k;\n cin >> n >> l;\n for (i = 0; i <= n; i++) {\n if (i != 0) scanf( extraextraextra , &a[i][0], &a[i][1], &a[i][2]);\n b[i][0] = a[i][0], b[i][1] = a[i][1] + a[i][2], b[i][2] = a[i][1] - a[i][2];\n if ((b[i][1] + b[i][0]) % 2 == 1 || (b[i][2] + b[i][0]) % 2 == 1) sayno();\n b[i][1] = (b[i][1] + b[i][0]) / 2, b[i][2] = (b[i][2] + b[i][0]) / 2;\n c[b[i][0] % l].push_back(i);\n }\n n++;\n for (i = 0; i < n; i++) t[i][0] = b[i][0], t[i][1] = b[i][1];\n calc();\n for (i = 0; i < l; i++) dab[i][0] = dab[i][1];\n for (i = 0; i < n; i++) t[i][0] = b[i][0], t[i][1] = b[i][2];\n calc();\n for (i = 0; i < l; i++) {\n if (dab[i][0] == -1 & dab[i][1] == -1)\n printf( L );\n else if (dab[i][0] == 1 && dab[i][1] == 1)\n printf( R );\n else if (dab[i][0] == -1 && dab[i][1] == 1)\n printf( D );\n else\n printf( U );\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n vector > matmul(vector > &a,\n vector > &b) {\n int i, j, k, n = a.size();\n vector > ans(n, vector(n));\n for (i = 0; i < n; i++)\n for (j = 0; j < n; j++) {\n long long temp = 0;\n for (k = 0; k < n; k++)\n temp = (temp + a[i][k] * b[k][j]) % (1000000007LL);\n ans[i][j] = temp;\n }\n return ans;\n }\n vector > matpwr(vector > &a, long long p) {\n int n = a.size();\n vector > ans(n, vector(n));\n for (int i = 0; i < n; i++) ans[i][i] = 1;\n while (p) {\n if (p & 1) ans = matmul(ans, a);\n a = matmul(a, a);\n p >>= 1;\n }\n return ans;\n }\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 long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }\n long long invMod(long long n, long long mod = (1000000007LL)) {\n return pwr(n, mod - 2);\n }\n int n, arr[2000003];\n int main() {\n ios_base::sync_with_stdio(0);\n cin >> n;\n for (int i = 1; i <= n; i++) arr[i] = i;\n int start = 1;\n for (int iter = 2; iter <= n; iter++) {\n int last = arr[start];\n for (int j = start + iter; j < start + n; j += iter) {\n int temp = last;\n last = arr[j];\n arr[j] = temp;\n }\n arr[start + n] = last;\n start++;\n }\n for (int i = start; i < start + n; i++) cout << arr[i] << ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, a[110], b[110], sum = 0;\n pair dp[110][11000], q = {-1, -1};\n pair Rec(int i, int W) {\n if (i == n) {\n if (W >= sum)\n return {0, 0};\n else\n return {1e9, 1e9};\n }\n if (dp[i][W] != q) return dp[i][W];\n pair Res1 = {1e9, 1e9}, Res2 = {1e9, 1e9};\n Res1 = {0 + Rec(i + 1, W).first, a[i] + Rec(i + 1, W).second};\n Res2 = {1 + Rec(i + 1, W + b[i]).first, 0 + Rec(i + 1, W + b[i]).second};\n return dp[i][W] = min(Res1, Res2);\n }\n int main() {\n memset(dp, -1, sizeof(dp));\n cin >> n;\n for (int i = 0; i < n; i++) cin >> a[i], sum += a[i];\n for (int i = 0; i < n; i++) cin >> b[i];\n cout << Rec(0, 0).first << << Rec(0, 0).second;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n char s[200005];\n int n;\n int mem[200005][27];\n int dirr[200005][27];\n bool vis[200005][27];\n char other(char c, char d) {\n if ('a' != c && 'a' != d) return 'a';\n if ('b' != c && 'b' != d) return 'b';\n return 'c';\n }\n int solve(int ind, int lst) {\n if (ind >= n) return 0;\n if (vis[ind][lst]) return mem[ind][lst];\n vis[ind][lst] = 1;\n int ans1 = -1, ans2 = -1, ans = -1, dir = -1;\n if (s[ind] - 'a' != lst) ans1 = solve(ind + 1, s[ind] - 'a');\n ans2 = 1 + solve(ind + 1, other(s[ind + 1], lst + 'a') - 'a');\n if (ans1 == -1 || ans2 <= ans1)\n dir = 1, ans = ans2;\n else\n dir = 0, ans = ans1;\n dirr[ind][lst] = dir;\n return mem[ind][lst] = ans;\n }\n int main() {\n ios::sync_with_stdio(false);\n scanf( %s , s);\n n = strlen(s);\n solve(0, 26);\n int lst = 26;\n for (int i = 0; i < n; i++)\n if (dirr[i][lst] == 0)\n lst = s[i] - 'a';\n else\n s[i] = lst = other(s[i + 1], lst + 'a'), lst -= 'a';\n puts(s);\n return 0;\n }\n "} @@ -572,11 +572,11 @@ {"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 mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n const double EPS = 1e-9;\n const double PI = acos(-1.);\n const long long LL_INF = 1e17 + 16;\n const int INF = 1e9 + 10;\n const long long MOD = 1e9 + 7;\n const int MAXN = 20;\n set goods;\n long long f[MAXN];\n void gen() {\n for (int i = (1); i <= (int)(10); i++) {\n for (int j = (0); j < (int)(1 << i); j++) {\n long long v = 0;\n long long st10 = 1;\n for (int k = (0); k < (int)(i); k++) {\n if (j & (1 << k)) {\n v += 7 * st10;\n } else {\n v += 4 * st10;\n }\n st10 *= 10;\n }\n goods.insert(v);\n }\n }\n }\n int per[MAXN];\n int used[MAXN];\n void solve() {\n gen();\n long long n, k;\n cin >> n >> k;\n f[0] = 1;\n int m;\n for (m = 1;; m++) {\n f[m] = f[m - 1] * m;\n if (f[m] >= k) {\n break;\n }\n }\n if (m > n) {\n printf( -1\n );\n return;\n }\n int ans = 0;\n int offset = n - m;\n for (__typeof((goods).begin()) it = (goods).begin(); it != (goods).end();\n it++) {\n if ((*it) <= offset) {\n ans++;\n }\n }\n k--;\n int top = 1;\n for (int i = m; i >= 1; i--) {\n int v = k / f[i - 1] + 1;\n int cnt = 0;\n for (int j = (1); j <= (int)(m); j++) {\n if (!used[j]) {\n cnt++;\n if (cnt == v) {\n per[top++] = j;\n used[j] = 1;\n break;\n }\n }\n }\n k %= f[i - 1];\n }\n for (int i = (1); i <= (int)(m); i++) {\n if (goods.count(i + offset) && goods.count(per[i] + offset)) {\n ans++;\n }\n }\n cout << ans << endl;\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 void dfs(set &temp, list adj[], vector &v, int s, int &t1,\n int &t2, vector b, vector w) {\n v[s] = true;\n list::iterator it;\n for (it = adj[s].begin(); it != adj[s].end(); it++) {\n if (!v[*it]) {\n temp.insert(*it);\n t1 += b[*it];\n t2 += w[*it];\n dfs(temp, adj, v, *it, t1, t2, b, w);\n }\n }\n }\n list adj[1001];\n int main() {\n int n, m, weight;\n cin >> n >> m >> weight;\n vector b(n + 1);\n vector w(n + 1);\n for (int i = 1; i <= n; i++) cin >> w[i];\n for (int i = 1; i <= n; i++) cin >> b[i];\n for (int i = 0; i < m; i++) {\n int a, b;\n cin >> a >> b;\n adj[a].push_back(b);\n adj[b].push_back(a);\n }\n vector v(n + 1, false);\n vector > arr;\n vector tw;\n vector tb;\n for (int i = 1; i <= n; i++) {\n if (!v[i]) {\n set temp;\n temp.insert(i);\n int t1 = b[i], t2 = w[i];\n dfs(temp, adj, v, i, t1, t2, b, w);\n arr.push_back(temp);\n tb.push_back(t1);\n tw.push_back(t2);\n }\n }\n vector > dp(arr.size() + 1, vector(weight + 1, 0));\n for (int i = 1; i <= arr.size(); i++) {\n for (int j = 1; j <= weight; j++) {\n int max = 0;\n if (dp[i - 1][j] > max) max = dp[i - 1][j];\n if (j - tw[i - 1] >= 0)\n if (dp[i - 1][j - tw[i - 1]] + tb[i - 1] > max)\n max = dp[i - 1][j - tw[i - 1]] + tb[i - 1];\n set::iterator it;\n for (it = arr[i - 1].begin(); it != arr[i - 1].end(); it++) {\n if (j - w[*it] >= 0)\n if (dp[i - 1][j - w[*it]] + b[*it] > max)\n max = dp[i - 1][j - w[*it]] + b[*it];\n }\n dp[i][j] = max;\n }\n }\n int max = 0;\n for (int i = 0; i <= weight; i++)\n if (dp[arr.size()][i] > max) max = dp[arr.size()][i];\n cout << max;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long n, m, ans, x, i, j, s;\n double a[100], b[100];\n map > mp;\n map >::iterator it, it2;\n long long num(long long x) {\n s = 0;\n while (x) {\n s++;\n x -= x & -x;\n }\n return s;\n }\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 mp[(a[i] + b[j]) / 2.0].first |= (1LL << i);\n mp[(a[i] + b[j]) / 2.0].second |= (1LL << j);\n }\n for (it = mp.begin(); it != mp.end(); it++)\n for (it2 = it; it2 != mp.end(); it2++) {\n x = num((*it).second.first | (*it2).second.first) +\n num((*it).second.second | (*it2).second.second);\n if (x > ans) ans = x;\n }\n cout << ans;\n return 0;\n }\n "} -{"func_code_string": "#include \n int main() {\n long long n, k;\n scanf( %I64d , &n);\n while (n % 3 == 0) n /= 3;\n printf( %I64d , 1 + n / 3);\n getchar();\n getchar();\n }\n "} +{"func_code_string": "#include \n int main() {\n long long n, k;\n scanf( extra , &n);\n while (n % 3 == 0) n /= 3;\n printf( extra , 1 + n / 3);\n getchar();\n getchar();\n }\n "} {"func_code_string": "#include \n using namespace std;\n constexpr long long INF = numeric_limits::max() / 4;\n constexpr long long n_max = 2e5 + 10;\n template \n string to_string(pair p);\n string to_string(const string &s) { return ' ' + s + ' '; }\n string to_string(const char c) { return to_string((string)&c); }\n string to_string(bool b) { return (b ? true : false ); }\n template \n string to_string(bitset v) {\n string res = ;\n for (size_t i = 0; i < N; i++) res += static_cast('0' + v[i]);\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) res += , ;\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 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 bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n }\n template \n bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n }\n signed main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n long long t;\n cin >> t;\n for (long long _ = 0; _ < (long long)(t); _++) {\n long long n;\n cin >> n;\n vector a(n);\n for (long long i = 0; i < (long long)(n); i++) cin >> a[i];\n vector dp(n + 1);\n for (long long i = 1; i < (long long)(n) + 1; i++) {\n dp[i]++;\n for (long long j = i * 2; j <= n; j += i) {\n if (a[j - 1] > a[i - 1]) chmax(dp[j], dp[i]);\n }\n }\n long long ans = 0;\n for (long long i = 0; i < (long long)(n + 1); i++) chmax(ans, dp[i]);\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(0);\n cout.tie(0);\n int test = 1;\n cin >> test;\n while (test--) {\n long long int n, m;\n cin >> n >> m;\n long long int sum1 = 0, sum2 = 0;\n long long int a[n], b[n], mina[n], mi = 0;\n for (int i = 0; i < n; i++) {\n cin >> a[i] >> b[i];\n sum1 += a[i];\n sum2 += b[i];\n mina[i] = max(0LL, m - b[i]);\n mi += mina[i];\n a[i] = min(a[i], m);\n }\n long long int ans = sum1 - sum2 + (n * m);\n long long int x = ans - 2LL * mi;\n for (int i = 0; i < n; i++) {\n if (x <= 0) break;\n long long int temp = min(2LL * (a[i] - mina[i]), x);\n temp /= 2;\n mina[i] += temp;\n x -= 2LL * temp;\n }\n cout << abs(x) << \n ;\n for (int i = 0; i < n; i++) cout << mina[i] << << m - mina[i] << \n ;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n #pragma warning(disable : 4996)\n using namespace std;\n bool compare(int a, int b) { return a > b; }\n int main() {\n int t, p, f, cnts, cntw, s, w;\n scanf( %d , &t);\n while (t--) {\n scanf( %d%d , &p, &f);\n scanf( %d%d , &cnts, &cntw);\n scanf( %d%d , &s, &w);\n if (s > w) {\n int temp = s;\n s = w;\n w = temp;\n temp = cnts;\n cnts = cntw;\n cntw = temp;\n }\n int mx = min(cnts, p / s);\n int ans = 0;\n for (int s1 = 0; s1 <= mx; s1++) {\n int w1 = min(cntw, (p - s1 * s) / w);\n int s2 = min(cnts - s1, f / s);\n int w2 = min(cntw - w1, (f - s2 * s) / w);\n ans = max(ans, s1 + s2 + w1 + w2);\n }\n printf( %d\n , ans);\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int maxn = 1e3 + 10;\n long long n, k;\n int main() {\n scanf( %I64d%I64d , &n, &k);\n long long x;\n x = sqrt(9 + 8 * (n + k)) - 3;\n x /= 2;\n printf( %I64d\n , n - x);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int maxn = 1e3 + 10;\n long long n, k;\n int main() {\n scanf( extraextra , &n, &k);\n long long x;\n x = sqrt(9 + 8 * (n + k)) - 3;\n x /= 2;\n printf( extra\n , n - x);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long MOD = 998244353;\n const int N = 3e3;\n long long dmod(long long x) { return x % MOD; }\n int n, k;\n int h[N + 5];\n long long memo[N + 5][2 * N + 5];\n long long dp(int idx, int gap) {\n if (idx > n) {\n if (gap > 0) return 1;\n return 0;\n }\n long long &ret = memo[idx][gap + N];\n if (ret != -1) return ret;\n ret = 0ll;\n if (h[idx] == h[idx % n + 1]) {\n ret = dmod((long long)k * dp(idx + 1, gap));\n } else {\n ret = dp(idx + 1, gap + 1);\n ret = dmod(ret + dp(idx + 1, gap - 1));\n ret = dmod(ret + dmod((long long)(k - 2) * dp(idx + 1, gap)));\n }\n return ret;\n }\n int main() {\n memset(memo, -1, sizeof(memo));\n scanf( %d%d , &n, &k);\n for (int i = 1; i <= n; i++) {\n scanf( %d , &h[i]);\n }\n printf( %lld\n , dp(1, 0));\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, x, m = 0, sum = 0;\n cin >> n >> x;\n int *arr = new int[n];\n for (long long i = 0; i < n; i++) cin >> arr[i], sum += arr[i];\n if (sum > 0)\n while (sum > 0) {\n sum -= x;\n m++;\n }\n else\n while (sum < 0) {\n sum += x;\n m++;\n }\n cout << m;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int brute(int s, int x) {\n int ans = 0;\n for (int i = 1; i <= s; ++i)\n for (int j = 1; j <= s; ++j)\n if (i + j == s && (i ^ j) == x) ++ans;\n return ans;\n }\n long long ways0(long long s, long long x) {\n if (s == x) return 2;\n return 0;\n }\n long long solve(long long s, long long x) {\n long long dp[60][2] = {};\n if (s % 2 != x % 2) {\n return 0;\n }\n if (x & (1LL << 0)) {\n dp[0][0] = 2;\n } else {\n dp[0][0] = 1;\n dp[0][1] = 1;\n }\n for (int i = 1; i < 60; ++i) {\n if (x & (1LL << i)) {\n if (s & (1LL << i)) {\n dp[i][0] += 2 * dp[i - 1][0];\n } else {\n dp[i][1] += 2 * dp[i - 1][1];\n }\n } else {\n if (s & (1LL << i)) {\n dp[i][0] += dp[i - 1][1];\n dp[i][1] += dp[i - 1][1];\n } else {\n dp[i][0] += dp[i - 1][0];\n dp[i][1] += dp[i - 1][0];\n }\n }\n }\n return dp[59][0] - ways0(s, x);\n }\n int main() {\n long long s, x;\n cin >> s >> x;\n cout << solve(s, x) << '\n';\n }\n "} @@ -637,7 +637,7 @@ {"func_code_string": "#include \n #pragma GCC optimize( O2 )\n using namespace std;\n const int maxn = 1e5 + 10, lg = 18;\n int n, m, q, cid[maxn], csize = 0, H[maxn], low[maxn], ok[maxn], par[maxn][lg],\n comp[maxn], c1;\n bool dp[maxn][lg];\n vector G[maxn];\n bool mark[maxn];\n void dfs1(int a, int p) {\n par[a][0] = p;\n for (int i = 1; i < lg; i++) {\n par[a][i] = par[par[a][i - 1]][i - 1];\n }\n low[a] = H[a];\n mark[a] = 1;\n for (int b : G[a]) {\n if (!mark[b]) {\n H[b] = H[a] + 1;\n comp[b] = comp[a];\n dfs1(b, a);\n low[a] = min(low[a], low[b]);\n } else if (b != p) {\n low[a] = min(low[a], H[b]);\n }\n }\n }\n void dfs2(int a) {\n mark[a] = 1;\n for (int b : G[a]) {\n if (!mark[b]) {\n if (low[b] >= H[a]) {\n cid[b] = csize++;\n } else {\n cid[b] = cid[a];\n }\n dfs2(b);\n } else if (H[a] > H[b]) {\n int dis = H[a] - H[b];\n if ((dis & 1) == 0) {\n ok[cid[a]] = 1;\n }\n }\n }\n }\n void dfs3(int a) {\n mark[a] = 1;\n dp[a][0] = (ok[cid[a]]);\n for (int b : G[a]) {\n if (!mark[b]) {\n dfs3(b);\n }\n }\n }\n bool lca(int a, int b) {\n bool ans = 0;\n if (H[a] > H[b]) swap(a, b);\n for (int i = lg - 1; i >= 0; i--) {\n if (H[par[b][i]] >= H[a]) {\n ans |= dp[b][i];\n b = par[b][i];\n }\n }\n if (a == b) {\n return ans;\n }\n for (int i = lg - 1; i >= 0; i--) {\n if (par[b][i] != par[a][i]) {\n ans |= dp[a][i];\n ans |= dp[b][i];\n a = par[a][i];\n b = par[b][i];\n }\n }\n ans |= dp[a][0];\n ans |= dp[b][0];\n return ans;\n }\n int32_t main() {\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 G[a].push_back(b);\n G[b].push_back(a);\n }\n for (int i = 0; i < n; i++) {\n if (!mark[i]) {\n comp[i] = c1++;\n dfs1(i, i);\n }\n }\n fill(mark, mark + n, 0);\n for (int i = 0; i < n; i++) {\n if (!mark[i]) {\n cid[i] = csize++;\n dfs2(i);\n }\n }\n fill(mark, mark + n, 0);\n for (int i = 0; i < n; i++) {\n if (!mark[i]) {\n dfs3(i);\n }\n }\n for (int j = 0; j < lg - 1; j++) {\n for (int i = 0; i < n; i++) {\n dp[i][j + 1] = dp[i][j] | dp[par[i][j]][j];\n }\n }\n scanf( %d , &q);\n while (q--) {\n int a, b;\n scanf( %d%d , &a, &b);\n a--, b--;\n if (H[a] > H[b]) swap(a, b);\n if (a == b || comp[a] != comp[b]) {\n printf( No\n );\n continue;\n }\n if ((H[b] - H[a]) & 1) {\n printf( Yes\n );\n continue;\n }\n bool ans = lca(a, b);\n printf(ans ? Yes\n : No\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];\n int count[5005] = {0};\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n count[a[i]]++;\n }\n int c[n];\n int d = 1;\n for (int i = 1; i <= 5000; i++) {\n if (count[i] > k) {\n cout << NO \n << \n ;\n return 0;\n }\n }\n cout << YES \n << \n ;\n if (k == 1) {\n for (int i = 0; i < n; i++) {\n cout << 1 \n << ;\n }\n } else {\n for (int i = 1; i <= 5000; i++) {\n for (int j = 0; j < n; j++) {\n if (a[j] == i) {\n c[j] = d;\n d++;\n }\n if (d > k) d = d % k;\n }\n }\n for (int i = 0; i < n; i++) {\n cout << c[i] << ;\n }\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int INF = 1e9 + 10;\n const long long int LINF = 1LL * INF * INF;\n const int MAXN = 2e5 + 10;\n const int MAXM = 5e3 + 10;\n priority_queue pq;\n vector > graph;\n queue que;\n pair A[20];\n long long int dp[20][(1 << 20)];\n long long int sum[(1 << 20)];\n long long int solve(int here, int cur, int n) {\n if (dp[here][cur] != -1) return dp[here][cur];\n long long int res = 0;\n for (int i = 0; i < n; i++) {\n if (i == here) continue;\n if ((1 << i) & cur) {\n if (A[i].second == A[here].second) continue;\n res += solve(i, cur ^ (1 << here), n);\n res %= 1000000007;\n }\n }\n return dp[here][cur] = res;\n }\n int main() {\n int n, m, k, a, b, x, y;\n int cnt = 0;\n int mx = 0;\n int mn = INF;\n int cur = 0, idx = -1;\n int T;\n cin >> n >> T;\n for (int i = 0; i < n; i++) cin >> A[i].first >> A[i].second;\n for (int i = 0; i < n; i++)\n for (int j = 0; j < (1 << n); j++) dp[i][j] = -1;\n for (int i = 0; i < n; i++) dp[i][(1 << i)] = 1;\n for (int i = 0; i < n; i++)\n for (int j = 0; j < (1 << n); j++) solve(i, j, n);\n for (int i = 0; i < (1 << n); i++)\n for (int j = 0; j < n; j++)\n if ((1 << j) & i) sum[i] += (long long int)A[j].first;\n long long int res = 0;\n for (int i = 0; i < (1 << n); i++) {\n if (sum[i] != T) continue;\n for (int j = 0; j < n; j++)\n if ((1 << j) & i) {\n res += (long long int)dp[j][i];\n res %= 1000000007;\n }\n }\n cout << res;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int q[1000005];\n long long i, j, t, tot, C, cnt;\n long long loc[10005], op[10005];\n long long n, m, k, H, x, y, ans, tmp;\n long long a[100005], w[100005], e[25], dis[10005], heap[10005];\n bool used[100005], f[10005];\n map A;\n map::iterator it;\n void Spfa(long long s) {\n long long i, head, tail, x, v;\n for (i = 1; i <= k; i++) {\n dis[i] = 1999999999999999999LL;\n f[i] = false;\n }\n dis[s + 1] = 1;\n f[s + 1] = true;\n q[1] = s + 1;\n head = 1;\n tail = 2;\n while (head != tail) {\n x = q[head];\n f[x] = false;\n for (i = 1; i <= tot; i++)\n if (dis[x] + e[i] < dis[(dis[x] + e[i]) % k + 1]) {\n v = (dis[x] + e[i]) % k + 1;\n dis[v] = dis[x] + e[i];\n if (!f[v]) {\n q[tail] = v;\n f[v] = true;\n tail++;\n }\n }\n head++;\n }\n }\n int main() {\n scanf( %I64d%I64d%I64d%I64d , &H, &n, &m, &k);\n for (i = 1; i <= n; i++) scanf( %I64d%I64d , &a[i], &w[i]);\n tot = 0;\n memset(used, false, sizeof used);\n x = 1 % k;\n for (i = 1; i <= n; i++) {\n if (a[i] % k == x) {\n used[i] = true;\n it = A.find(w[i]);\n if (it == A.end())\n A.insert(make_pair(w[i], 1));\n else\n A[w[i]]++;\n }\n }\n for (t = 1; t <= m; t++) {\n scanf( %I64d , &C);\n if (C == 1) {\n scanf( %I64d , &x);\n e[++tot] = x;\n Spfa(1 % k);\n for (i = 1; i <= n; i++)\n if (dis[a[i] % k + 1] <= a[i]) {\n if (!used[i]) {\n used[i] = true;\n it = A.find(w[i]);\n if (it == A.end())\n A.insert(make_pair(w[i], 1));\n else\n A[w[i]]++;\n }\n }\n } else if (C == 2) {\n scanf( %I64d%I64d , &x, &y);\n if (used[x]) {\n it = A.find(w[x]);\n tmp = it->second;\n if (tmp == 1)\n A.erase(w[x]);\n else\n A[w[x]]--;\n w[x] -= y;\n it = A.find(w[x]);\n if (it != A.end())\n A[w[x]]++;\n else\n A.insert(make_pair(w[x], 1));\n } else\n w[x] -= y;\n } else {\n if (A.size() == 0) {\n printf( 0\n );\n continue;\n }\n it = A.end();\n it--;\n ans = it->first;\n printf( %I64d\n , ans);\n tmp = it->second;\n if (tmp == 1)\n A.erase(ans);\n else\n A[ans]--;\n }\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int q[1000005];\n long long i, j, t, tot, C, cnt;\n long long loc[10005], op[10005];\n long long n, m, k, H, x, y, ans, tmp;\n long long a[100005], w[100005], e[25], dis[10005], heap[10005];\n bool used[100005], f[10005];\n map A;\n map::iterator it;\n void Spfa(long long s) {\n long long i, head, tail, x, v;\n for (i = 1; i <= k; i++) {\n dis[i] = 1999999999999999999LL;\n f[i] = false;\n }\n dis[s + 1] = 1;\n f[s + 1] = true;\n q[1] = s + 1;\n head = 1;\n tail = 2;\n while (head != tail) {\n x = q[head];\n f[x] = false;\n for (i = 1; i <= tot; i++)\n if (dis[x] + e[i] < dis[(dis[x] + e[i]) % k + 1]) {\n v = (dis[x] + e[i]) % k + 1;\n dis[v] = dis[x] + e[i];\n if (!f[v]) {\n q[tail] = v;\n f[v] = true;\n tail++;\n }\n }\n head++;\n }\n }\n int main() {\n scanf( extraextraextraextra , &H, &n, &m, &k);\n for (i = 1; i <= n; i++) scanf( extraextra , &a[i], &w[i]);\n tot = 0;\n memset(used, false, sizeof used);\n x = 1 % k;\n for (i = 1; i <= n; i++) {\n if (a[i] % k == x) {\n used[i] = true;\n it = A.find(w[i]);\n if (it == A.end())\n A.insert(make_pair(w[i], 1));\n else\n A[w[i]]++;\n }\n }\n for (t = 1; t <= m; t++) {\n scanf( extra , &C);\n if (C == 1) {\n scanf( extra , &x);\n e[++tot] = x;\n Spfa(1 % k);\n for (i = 1; i <= n; i++)\n if (dis[a[i] % k + 1] <= a[i]) {\n if (!used[i]) {\n used[i] = true;\n it = A.find(w[i]);\n if (it == A.end())\n A.insert(make_pair(w[i], 1));\n else\n A[w[i]]++;\n }\n }\n } else if (C == 2) {\n scanf( extraextra , &x, &y);\n if (used[x]) {\n it = A.find(w[x]);\n tmp = it->second;\n if (tmp == 1)\n A.erase(w[x]);\n else\n A[w[x]]--;\n w[x] -= y;\n it = A.find(w[x]);\n if (it != A.end())\n A[w[x]]++;\n else\n A.insert(make_pair(w[x], 1));\n } else\n w[x] -= y;\n } else {\n if (A.size() == 0) {\n printf( 0\n );\n continue;\n }\n it = A.end();\n it--;\n ans = it->first;\n printf( extra\n , ans);\n tmp = it->second;\n if (tmp == 1)\n A.erase(ans);\n else\n A[ans]--;\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 int r = min(a / 3, min(b / 2, c / 2));\n a -= 3 * r;\n b -= 2 * r;\n c -= 2 * r;\n int ans = 7 * r;\n int cnt1 = 0;\n for (int i = 0; i < 14; i++) {\n int a1 = a, b1 = b, c1 = c, cnt = 0;\n for (int j = i; j < 14; j++) {\n if (j == 0 || j == 3 || j == 6 || j == 7 || j == 10 || j == 13) a1--;\n if (j == 1 || j == 5 || j == 8 || j == 12) b1--;\n if (j == 2 || j == 4 || j == 9 || j == 11) c1--;\n if (a1 < 0 || b1 < 0 || c1 < 0) {\n cnt1 = max(cnt1, cnt);\n break;\n }\n cnt++;\n }\n }\n cout << ans + cnt1;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long arr[100000], arr1[100000], n, x, z, co = 0, co1 = 0, k, m,\n fin = 1000000;\n map left;\n map right;\n cin >> n;\n if (n % 2 == 0)\n k = n / 2;\n else\n k = (n / 2) + 1;\n for (int i = 0; i < n; i++) {\n cin >> x >> z;\n if (x == z) {\n if (left[x] == 0) {\n arr[co++] = x;\n left[x]++;\n } else\n left[x]++;\n } else {\n if (left[x] == 0) {\n arr[co++] = x;\n left[x]++;\n } else\n left[x]++;\n if (right[z] == 0) {\n arr1[co1++] = z;\n right[z]++;\n } else\n right[z]++;\n }\n }\n for (int i = 0; i < co; i++) {\n m = 1000001;\n if ((left[arr[i]] + right[arr[i]]) >= k) {\n m = k - left[arr[i]];\n if (m < 0) {\n cout << 0 ;\n exit(0);\n }\n }\n if (m < fin) {\n fin = m;\n }\n }\n if (fin == 1000000) {\n for (int i = 0; i < co1; i++) {\n if (right[arr1[i]] >= k) {\n cout << k;\n exit(0);\n }\n }\n }\n if (fin == 1000000)\n cout << -1 ;\n else\n cout << fin;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N6 = 1e6 + 6;\n using namespace std;\n long long n, m, x, y, sum1, sum2, ans1, ans2;\n int main() {\n cin >> n >> x >> y;\n if (n > y) {\n cout << -1;\n return 0;\n }\n sum1 = y - n + 1;\n sum1 *= sum1;\n sum1 += (n - 1);\n if (sum1 >= x) {\n for (int i = 1; i < n; ++i) {\n cout << 1 << ' ';\n }\n cout << y - n + 1;\n } else\n cout << -1;\n return 0;\n }\n "} @@ -680,15 +680,15 @@ {"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 f = 1;\n int s = 0;\n vector A;\n for (int i = 0; i < n; i++) {\n int a;\n cin >> a;\n A.push_back(a);\n }\n if (A.size() == 1) {\n cout << First << endl;\n continue;\n }\n if (n == 2) {\n if (A[0] != 1) {\n cout << First << endl;\n continue;\n } else {\n cout << Second << endl;\n continue;\n }\n }\n for (int i = 0; i < n - 2; i++) {\n if (A[i] != 1 && A[i + 1] != 1) {\n if (f == 1) {\n f = 1;\n s = 0;\n } else {\n s = 1;\n f = 0;\n }\n } else if (A[i] != 1 && A[i + 1] == 1) {\n int count = 0;\n int j = i + 1;\n while (A[j] == 1 && j <= n - 2) {\n count++;\n j++;\n }\n if (count % 2 == 1) {\n if (f == 1) {\n s = 1;\n f = 0;\n } else {\n f = 1;\n s = 0;\n }\n } else {\n if (f == 1) {\n f = 1;\n s = 0;\n } else {\n s = 1;\n f = 0;\n }\n }\n } else if (A[i] == 1) {\n if (f == 1) {\n s = 1;\n f = 0;\n } else {\n f = 1;\n s = 0;\n }\n }\n }\n if (A[n - 2] != 1 && f == 1) {\n cout << First << endl;\n continue;\n } else if (A[n - 2] == 1 && f == 1) {\n cout << Second << endl;\n continue;\n } else if (A[n - 2] != 1 && s == 1) {\n cout << Second << endl;\n continue;\n } else if (A[n - 2] == 1 && s == 1) {\n cout << First << endl;\n continue;\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 500100;\n multiset > intervals;\n long long n, k;\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cin >> n >> k;\n for (int i = 0; i < k; i++) intervals.insert(make_pair(0, i));\n long long s, d;\n for (int i = 0; i < n; i++) {\n cin >> s >> d;\n auto x = intervals.begin();\n long long stx = (*x).first;\n long long idx = (*x).second;\n if (stx < s) stx = s;\n stx += d;\n cout << stx << \n ;\n intervals.erase(x);\n intervals.insert(make_pair(stx, idx));\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct node {\n int x, y;\n };\n vector q;\n int n, m, sum[2020][2020];\n char g[2020][2020];\n void init() {\n for (int i = 0; i < (n); i++)\n for (int j = 0; j < (m); j++)\n if (g[i][j] == 'w') q.push_back((node){i, j});\n for (int i = 0; i < (n); i++)\n for (int j = 0; j < (m); j++)\n if (g[i][j] == 'w') sum[i][j] = 1;\n for (int i = 0; i < (n); i++)\n for (int j = 0; j < (m); j++)\n if (j - 1 >= 0) sum[i][j] = sum[i][j - 1] + sum[i][j];\n for (int i = 0; i < (m); i++)\n for (int j = 0; j < (n); j++)\n if (j - 1 >= 0) sum[j][i] = sum[j - 1][i] + sum[j][i];\n }\n bool cmpx(node a, node b) { return a.x < b.x; }\n bool cmpy(node a, node b) { return a.y < b.y; }\n int getlen() {\n int res = -1;\n sort(q.begin(), q.end(), cmpx);\n res = max(res, abs(q[0].x - q[q.size() - 1].x) + 1);\n sort(q.begin(), q.end(), cmpy);\n res = max(res, abs(q[0].y - q[q.size() - 1].y) + 1);\n return res;\n }\n int getarea(int x1, int y1, int x2, int y2) {\n if (x1 > x2 || y1 > y2) return 0;\n int res = sum[x2][y2];\n if (x1 - 1 >= 0) res -= sum[x1 - 1][y2];\n if (y1 - 1 >= 0) res -= sum[x2][y1 - 1];\n if (x1 - 1 >= 0 && y1 - 1 >= 0) res += sum[x1 - 1][y1 - 1];\n return res;\n }\n bool check(int x, int y, int len) {\n int x2 = x - len + 1;\n int y2 = y - len + 1;\n int in = getarea(x2 + 1, y2 + 1, x - 1, y - 1);\n int out = getarea(0, 0, n - 1, m - 1) - getarea(x2, y2, x, y);\n if (in || out)\n return false;\n else\n return true;\n }\n void filling(int x, int y, int x2, int y2) {\n for (int i = x; i <= x2; i++)\n for (int j = y; j <= y2; j++)\n if (i == x || i == x2 || j == y || j == y2)\n g[i][j] = (g[i][j] == '.') ? '+' : 'w';\n }\n int main() {\n scanf( %d%d , &n, &m);\n for (int i = 0; i < (n); i++) scanf( %s , g[i]);\n init();\n int len = getlen();\n bool flg = 0;\n for (int i = 0; i < (n); i++)\n for (int j = 0; j < (m); j++)\n if (i + 1 >= len && j + 1 >= len) {\n if (flg) break;\n if (check(i, j, len)) {\n flg = true;\n filling(i - len + 1, j - len + 1, i, j);\n break;\n }\n }\n if (flg)\n for (int i = 0; i < (n); i++) printf( %s\n , g[i]);\n else\n printf( -1\n );\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n template \n void maximize(T &x, U y) {\n if (x < y) x = y;\n }\n template \n void minimize(T &x, U y) {\n if (x > y) x = y;\n }\n template \n T Abs(T x) {\n return (x < (T)0 ? -x : x);\n }\n template \n T safe_sqrt(T x) {\n return sqrt(max((T)0, x));\n }\n template \n T addmod(T x, U k, V mod) {\n return ((x + k) % mod + mod) % mod;\n }\n template \n T submod(T x, U k, V mod) {\n return ((x - k) % mod + mod) % mod;\n }\n template \n T mulmod(T x, U k, V mod) {\n return (int64_t)x * k % mod;\n }\n namespace task {\n int64_t dp[11][100][1200];\n int b;\n int64_t l, r;\n vector digits;\n vector trans(int64_t x, int b) {\n vector vec;\n while (x > 0) vec.push_back(x % b), x /= b;\n return vec;\n }\n int64_t calc(int base, int idx, int mask, bool flag) {\n if (idx == -1) return (mask == 0);\n if (~dp[base][idx][mask] and flag) return dp[base][idx][mask];\n int64_t ret = 0;\n int k = flag ? b - 1 : digits[idx];\n for (int i = 0; i <= k; ++i)\n ret += calc(base, idx - 1, mask ^ ((1LL) << (i)), flag | (i < k));\n if (flag) dp[base][idx][mask] = ret;\n return ret;\n }\n int64_t f(int64_t x) {\n if (!x) return 0ll;\n digits.clear();\n digits = trans(x, b);\n int64_t ret = 0;\n for (int i = 0; i < ((digits).size()); ++i) {\n int up = (i == ((digits).size()) - 1 ? digits[i] : b - 1);\n for (int j = 1; j <= up; ++j)\n ret +=\n calc(b, i - 1, ((1LL) << (j)), (i < ((digits).size()) - 1 or j < up));\n }\n return ret;\n }\n void solve() {\n int q;\n scanf( %d , &q);\n memset(dp, -1ll, sizeof(dp));\n while (q--) {\n scanf( %d%I64d%I64d , &b, &l, &r);\n int64_t x = f(r);\n int64_t y = f(l - 1);\n int64_t ans = f(r) - f(l - 1);\n printf( %I64d\n , ans);\n }\n }\n } // namespace task\n int main(void) { task::solve(); }\n "} +{"func_code_string": "#include \n using namespace std;\n template \n void maximize(T &x, U y) {\n if (x < y) x = y;\n }\n template \n void minimize(T &x, U y) {\n if (x > y) x = y;\n }\n template \n T Abs(T x) {\n return (x < (T)0 ? -x : x);\n }\n template \n T safe_sqrt(T x) {\n return sqrt(max((T)0, x));\n }\n template \n T addmod(T x, U k, V mod) {\n return ((x + k) % mod + mod) % mod;\n }\n template \n T submod(T x, U k, V mod) {\n return ((x - k) % mod + mod) % mod;\n }\n template \n T mulmod(T x, U k, V mod) {\n return (int64_t)x * k % mod;\n }\n namespace task {\n int64_t dp[11][100][1200];\n int b;\n int64_t l, r;\n vector digits;\n vector trans(int64_t x, int b) {\n vector vec;\n while (x > 0) vec.push_back(x % b), x /= b;\n return vec;\n }\n int64_t calc(int base, int idx, int mask, bool flag) {\n if (idx == -1) return (mask == 0);\n if (~dp[base][idx][mask] and flag) return dp[base][idx][mask];\n int64_t ret = 0;\n int k = flag ? b - 1 : digits[idx];\n for (int i = 0; i <= k; ++i)\n ret += calc(base, idx - 1, mask ^ ((1LL) << (i)), flag | (i < k));\n if (flag) dp[base][idx][mask] = ret;\n return ret;\n }\n int64_t f(int64_t x) {\n if (!x) return 0ll;\n digits.clear();\n digits = trans(x, b);\n int64_t ret = 0;\n for (int i = 0; i < ((digits).size()); ++i) {\n int up = (i == ((digits).size()) - 1 ? digits[i] : b - 1);\n for (int j = 1; j <= up; ++j)\n ret +=\n calc(b, i - 1, ((1LL) << (j)), (i < ((digits).size()) - 1 or j < up));\n }\n return ret;\n }\n void solve() {\n int q;\n scanf( %d , &q);\n memset(dp, -1ll, sizeof(dp));\n while (q--) {\n scanf( %dextraextra , &b, &l, &r);\n int64_t x = f(r);\n int64_t y = f(l - 1);\n int64_t ans = f(r) - f(l - 1);\n printf( extra\n , ans);\n }\n }\n } // namespace task\n int main(void) { task::solve(); }\n "} {"func_code_string": "#include \n using namespace std;\n int n, a[1050];\n int main() {\n cin >> n;\n for (int i = 0; i < n; i++) cin >> a[i];\n int tens = a[0];\n set answer;\n for (int rem = 0; rem < 10000000; rem++) {\n double fuel = tens * 10 + static_cast(rem) / 1000000;\n double addend = fuel;\n bool isValid = true;\n for (int i = 0; isValid and i < n; i++) {\n fuel -= (a[i] - (i == 0 ? 0 : a[i - 1])) * 10;\n if (fuel < 0 or fuel >= 10 - 1e-6) {\n isValid = false;\n }\n fuel += addend;\n }\n if (isValid) {\n answer.insert(static_cast(fuel) / 10 + a[n - 1]);\n }\n }\n if (answer.size() > 1)\n cout << not unique << endl;\n else\n cout << unique << endl << *answer.begin() << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MAXN = (int)2e5 + 10;\n vector > a, b;\n vector L;\n int n, m, q[MAXN], id[MAXN], Tohka[MAXN], l[MAXN], r[MAXN], t[MAXN], fa[MAXN],\n T[MAXN];\n bool cmp(int first, int second) { return q[first] < q[second]; }\n bool cmp1(int first, int second) { return t[first] < t[second]; }\n int Getp(int a) { return lower_bound(L.begin(), L.end(), a) - L.begin(); }\n int getf(int first) {\n if (fa[first] == first) return first;\n fa[first] = getf(fa[first]);\n return fa[first];\n }\n int main() {\n scanf( %d%d , &n, &m);\n for (int i = 1; i <= m; ++i) {\n scanf( %d%d%d , &l[i], &r[i], &t[i]);\n L.push_back(l[i]), L.push_back(r[i]);\n id[i] = i;\n }\n sort(L.begin(), L.end());\n L.erase(unique(L.begin(), L.end()), L.end());\n for (int i = 0; i < ((int)(L).size()); ++i) fa[i] = i;\n sort(id + 1, id + m + 1, cmp1);\n memset(T, -1, sizeof(T));\n for (int i = 1; i <= m; ++i) {\n int tl = Getp(l[id[i]]), tr = Getp(r[id[i]]), tT = t[id[i]];\n for (tl = getf(tl); tl < tr; T[tl] = tT, fa[tl] = tl + 1, tl = getf(tl))\n ;\n }\n for (int i = 0; i + 1 < ((int)(L).size()); ++i) {\n int l = L[i], r = L[i + 1], t = T[i];\n if (T[i] == -1) continue;\n a.push_back(make_pair(t - r, 1)), a.push_back(make_pair(t - l, -1));\n b.push_back(make_pair(t - r, -(t - r))),\n b.push_back(make_pair(t - l, (t - r)));\n b.push_back(make_pair(t - l, (r - l)));\n }\n sort(a.begin(), a.end());\n sort(b.begin(), b.end());\n for (int i = 1; i <= n; ++i) scanf( %d , &q[i]), id[i] = i;\n sort(id + 1, id + n + 1, cmp);\n long long s1 = 0, s2 = 0;\n for (int i = 1, p1 = 0, p2 = 0; i <= n; ++i) {\n for (; p1 < ((int)(a).size()) && a[p1].first <= q[id[i]];\n s1 += a[p1].second, ++p1)\n ;\n for (; p2 < ((int)(b).size()) && b[p2].first <= q[id[i]];\n s2 += b[p2].second, ++p2)\n ;\n Tohka[id[i]] = s1 * q[id[i]] + s2;\n }\n for (int i = 1; i <= n; ++i) printf( %d\n , Tohka[i]);\n fclose(stdin);\n fclose(stdout);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, m, q;\n scanf( %d %d %d , &n, &m, &q);\n int log_n = 0;\n while (1 << log_n <= n) {\n ++log_n;\n }\n int jump_small = pow(n, 1.0 / 3), jump_large = pow(n, 2.0 / 3);\n vector> rmq_min(log_n, vector(n)),\n rmq_max(log_n, vector(n));\n vector a(n), next(n), jump(n), times(n), now_min(n), now_max(n);\n priority_queue> heap;\n for (int i = 0; i < n; ++i) {\n scanf( %d , &a[i]);\n rmq_min[0][i] = rmq_max[0][i] = a[i];\n next[i] = i + 1;\n jump[i] = min(i + jump_small, n);\n times[i] = jump[i] - i;\n }\n for (int i = 0; i < n - 1; ++i) {\n now_min[i] = min(a[i], a[i + 1]);\n now_max[i] = max(a[i], a[i + 1]);\n heap.push(make_pair(now_min[i] - now_max[i], i));\n }\n for (int i = 1; i < log_n; ++i) {\n for (int j = 0; j + (1 << i) <= n; ++j) {\n rmq_min[i][j] = min(rmq_min[i - 1][j], rmq_min[i - 1][j + (1 << i - 1)]);\n rmq_max[i][j] = max(rmq_max[i - 1][j], rmq_max[i - 1][j + (1 << i - 1)]);\n }\n }\n vector last(n);\n vector visit(n);\n auto update = [&](int x, int limit) {\n while (next[x] < n && next[x] - x <= jump_large &&\n now_max[x] - now_min[x] <= limit) {\n ++next[x];\n if (next[x] < n) {\n now_max[x] = max(now_max[x], a[next[x]]);\n now_min[x] = min(now_min[x], a[next[x]]);\n }\n }\n if (next[x] < n && next[x] - x <= jump_small) {\n heap.push(make_pair(now_min[x] - now_max[x], x));\n }\n vector stack;\n jump[x] = x;\n times[x] = 0;\n stack.push_back(jump[x]);\n while (jump[x] < n && next[jump[x]] - x <= jump_small) {\n jump[x] = next[jump[x]];\n ++times[x];\n stack.push_back(jump[x]);\n }\n last[x] = stack.size();\n visit[x] = true;\n for (int i = x - 1; i >= x - jump_small && ~i; --i) {\n if (next[i] < n && visit[next[i]]) {\n while (stack.back() - i > jump_small) {\n stack.pop_back();\n }\n jump[i] = stack.back();\n times[i] = times[next[i]] + 1 + stack.size() - last[next[i]];\n last[i] = stack.size();\n visit[i] = true;\n }\n }\n for (int i = x; i >= x - jump_small && ~i; --i) {\n visit[i] = false;\n }\n };\n auto query = [&](int limit) {\n while (!heap.empty() && -heap.top().first <= limit) {\n int x = heap.top().second;\n heap.pop();\n update(x, limit);\n }\n int answer = -1, x = 0;\n while (x < n) {\n int dist = next[x] - x;\n if (dist <= jump_small) {\n answer += times[x];\n x = jump[x];\n } else {\n while (next[x] < n && next[x] - x <= jump_large &&\n now_max[x] - now_min[x] <= limit) {\n ++next[x];\n if (next[x] < n) {\n now_max[x] = max(now_max[x], a[next[x]]);\n now_min[x] = min(now_min[x], a[next[x]]);\n }\n }\n dist = next[x] - x;\n if (dist <= jump_large) {\n ++answer;\n x = next[x];\n } else {\n ++answer;\n int current_min = a[x], current_max = a[x];\n for (int i = log_n - 1; ~i; --i) {\n if (x + (1 << i) <= n) {\n int next_min = min(current_min, rmq_min[i][x]);\n int next_max = max(current_max, rmq_max[i][x]);\n if (next_max - next_min <= limit) {\n current_min = next_min;\n current_max = next_max;\n x += 1 << i;\n }\n }\n }\n }\n }\n }\n return answer;\n };\n vector> queries(q);\n vector answer(q);\n for (int i = 0; i < q; ++i) {\n scanf( %d , &queries[i].first);\n queries[i].first = m - queries[i].first;\n queries[i].second = i;\n }\n sort(queries.begin(), queries.end());\n for (auto p : queries) {\n answer[p.second] = query(p.first);\n }\n for (int i = 0; i < q; ++i) {\n printf( %d\n , answer[i]);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long int n, i;\n cin >> n;\n long long int a[n];\n for (i = 0; i < n; i++) {\n cin >> a[i];\n }\n if (n == 1) {\n cout << a[0];\n return 0;\n }\n sort(a, a + n);\n long long int sum = 0;\n if (a[0] >= 0) {\n sum = -1 * a[0];\n for (i = 1; i < n; i++) {\n sum += a[i];\n }\n } else if (a[n - 1] < 0) {\n sum = a[n - 1];\n for (i = 0; i < n - 1; i++) {\n sum -= a[i];\n }\n } else {\n for (i = 0; i < n; i++) {\n if (a[i] < 0) {\n sum -= a[i];\n } else {\n sum += a[i];\n }\n }\n }\n cout << sum << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int N = 1e6 + 6;\n const long long M = 1e9 + 7;\n const double eps = 1e-7;\n int a[N];\n int Int() {\n int x;\n scanf( %d , &x);\n return x;\n }\n long long Lnt() {\n long long x;\n scanf( %I64d , &x);\n return x;\n }\n long long Bigmod(long long A, long long B, long long C) {\n if (B == 0LL) return 1LL;\n long long x = Bigmod(A, B / 2LL, C);\n x = (x * x) % C;\n if (B % 2 == 1) x = (x * A) % C;\n return x;\n }\n struct mar {\n int i, j, c, d;\n } cr[N];\n bool cmp(mar a, mar b) {\n if (a.i == b.i) return a.j < b.j;\n return a.i < b.i;\n }\n bool Cmp(int a, int b) { return a > b; }\n void print(int n) { printf( %d\n , n); }\n void Print(long long n) { printf( %I64d\n , n); }\n void debug(int n) { printf( %d , n); }\n int main() {\n int x1 = Int(), x2 = Int(), x3 = Int(), x4 = Int(), x5 = Int(), x6 = Int();\n int c = x3 + x5;\n int d = max(x4, x6);\n if (x1 > x2) swap(x1, x2);\n if ((x1 >= c && x2 >= d) or (x2 >= c && x1 >= d)) return puts( YES ), 0;\n c = x3 + x6;\n d = max(x4, x5);\n if ((x1 >= c && x2 >= d) or (x1 >= d and x2 >= c)) return puts( YES ), 0;\n c = x4 + x5;\n d = max(x3, x6);\n if ((x1 >= c && x2 >= d) or (x1 >= d and x2 >= c)) return puts( YES ), 0;\n c = x4 + x6;\n d = max(x3, x5);\n if ((x1 >= c && x2 >= d) or (x1 >= d and x2 >= c)) return puts( YES ), 0;\n return puts( NO );\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int N = 1e6 + 6;\n const long long M = 1e9 + 7;\n const double eps = 1e-7;\n int a[N];\n int Int() {\n int x;\n scanf( %d , &x);\n return x;\n }\n long long Lnt() {\n long long x;\n scanf( extra , &x);\n return x;\n }\n long long Bigmod(long long A, long long B, long long C) {\n if (B == 0LL) return 1LL;\n long long x = Bigmod(A, B / 2LL, C);\n x = (x * x) % C;\n if (B % 2 == 1) x = (x * A) % C;\n return x;\n }\n struct mar {\n int i, j, c, d;\n } cr[N];\n bool cmp(mar a, mar b) {\n if (a.i == b.i) return a.j < b.j;\n return a.i < b.i;\n }\n bool Cmp(int a, int b) { return a > b; }\n void print(int n) { printf( %d\n , n); }\n void Print(long long n) { printf( extra\n , n); }\n void debug(int n) { printf( %d , n); }\n int main() {\n int x1 = Int(), x2 = Int(), x3 = Int(), x4 = Int(), x5 = Int(), x6 = Int();\n int c = x3 + x5;\n int d = max(x4, x6);\n if (x1 > x2) swap(x1, x2);\n if ((x1 >= c && x2 >= d) or (x2 >= c && x1 >= d)) return puts( YES ), 0;\n c = x3 + x6;\n d = max(x4, x5);\n if ((x1 >= c && x2 >= d) or (x1 >= d and x2 >= c)) return puts( YES ), 0;\n c = x4 + x5;\n d = max(x3, x6);\n if ((x1 >= c && x2 >= d) or (x1 >= d and x2 >= c)) return puts( YES ), 0;\n c = x4 + x6;\n d = max(x3, x5);\n if ((x1 >= c && x2 >= d) or (x1 >= d and x2 >= c)) return puts( YES ), 0;\n return puts( NO );\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long int a[2005];\n long long int cnt[2005];\n long long int b[2005];\n long long int vis[2005];\n vector v;\n vector vv;\n vector ans;\n long long int prime[2005];\n bool pr[2005];\n set st;\n priority_queue bob;\n priority_queue ali;\n priority_queue bth;\n queue q;\n map mp;\n long long int taken[105];\n map::iterator it;\n map > ck;\n string ss, tt;\n long long int pos[205];\n long long int afs[205];\n long long int pre[2005];\n long long int aa[2005];\n long long int cs[27];\n long long int ct[27];\n long long int power(long long int k, long long int i) {\n long long int res = 1;\n for (long long int j = 1; j <= i; j++) {\n res = res * k;\n }\n return res;\n }\n int main() {\n long long int n, i, j, k, t, m;\n cin >> t;\n long long int minis;\n long long int res;\n long long int x, y;\n long long int pp;\n string fg;\n long long int l, r;\n long long int h;\n long long int p, q;\n string tt;\n while (t--) {\n v.clear();\n cin >> n;\n cin >> ss >> tt;\n string fg;\n long long int kk = n;\n res = 0;\n for (i = n - 1; i >= 0; i--) {\n if (ss[i] == tt[i]) {\n kk--;\n continue;\n } else {\n if (ss[0] == tt[i]) {\n res = res + 1;\n v.push_back(1);\n if (ss[0] == '0')\n ss[0] = '1';\n else\n ss[0] = '0';\n }\n fg.clear();\n for (j = 0; j <= i; j++) {\n if (ss[j] == '0')\n fg.push_back('1');\n else\n fg.push_back('0');\n }\n reverse(fg.begin(), fg.end());\n res = res + 1;\n v.push_back(kk);\n for (j = 0; j <= i; j++) {\n ss[j] = fg[j];\n }\n }\n kk--;\n }\n cout << res << ;\n for (i = 0; i < v.size(); i++) cout << v[i] << ;\n cout << '\n';\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 = (int)int(s.size());\n int num = (s[n - 1] - '0') + 10 * (s[n - 2] - '0');\n if (num % 4 == 0)\n cout << 4;\n else\n cout << 0;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n void dfs(long long a, long long b, char A, char B) {\n if (a == 1 && b == 1) return;\n if (a < b) swap(a, b), swap(A, B);\n printf( %I64d%c , (a - 1) / b, A);\n dfs(a - (a - 1) / b * b, b, 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 long long a, b;\n cin >> a >> b;\n if (gcd(a, b) != 1) {\n puts( Impossible );\n return 0;\n }\n dfs(a, b, 'A', 'B');\n puts( );\n }\n "} +{"func_code_string": "#include \n using namespace std;\n void dfs(long long a, long long b, char A, char B) {\n if (a == 1 && b == 1) return;\n if (a < b) swap(a, b), swap(A, B);\n printf( extra%c , (a - 1) / b, A);\n dfs(a - (a - 1) / b * b, b, 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 long long a, b;\n cin >> a >> b;\n if (gcd(a, b) != 1) {\n puts( Impossible );\n return 0;\n }\n dfs(a, b, 'A', 'B');\n puts( );\n }\n "} {"func_code_string": "#include \n using namespace std;\n int q, ans;\n char s[300010];\n set len, hs[300010];\n int p[300010], v[300010];\n int main() {\n int i, l, op;\n for (i = 1, p[0] = 1; i <= 300000; ++i)\n p[i] = 1LL * p[i - 1] * 27 % 1000000007;\n scanf( %d , &q);\n while (q--) {\n scanf( %d%s , &op, s + 1);\n l = strlen(s + 1);\n for (i = 1, v[0] = 0; i <= l; ++i)\n v[i] = (1LL * v[i - 1] * 27 + s[i] - 'a' + 1) % 1000000007;\n if (op == 1) {\n len.insert(l);\n hs[l].insert(v[l]);\n } else if (op == 2)\n hs[l].erase(v[l]);\n else {\n ans = 0;\n for (auto it = len.begin(); it != len.end(); it++)\n for (i = *it; i <= l; i++)\n ans += (hs[*it].find((v[i] - 1LL * v[i - *it] * p[*it] % 1000000007 +\n 1000000007) %\n 1000000007) != hs[*it].end());\n printf( %d\n , ans);\n fflush(stdout);\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct node;\n typedef node *Node;\n const int inf = 1000000;\n bool fl = 0;\n struct node {\n Node left, right, link, parent;\n int size, prior, sum, number;\n set all;\n pair mmin;\n node(int number) : number(number) {\n left = right = link = parent = NULL;\n prior = rand() + (rand() << 16);\n update();\n }\n int key() {\n int ans = 1;\n if (left) ans += left->size;\n return ans;\n }\n void update() {\n size = 1;\n sum = all.size();\n if (sum == 0)\n mmin = make_pair(inf, inf);\n else\n mmin = make_pair(*all.begin(), number);\n if (left) {\n size += left->size;\n sum += left->sum;\n mmin = min(mmin, left->mmin);\n left->parent = this;\n }\n if (right) {\n size += right->size;\n sum += right->sum;\n mmin = min(mmin, right->mmin);\n right->parent = this;\n }\n }\n };\n void upd_min(Node t) {\n while (t) {\n t->update();\n t = t->parent;\n }\n }\n void add_ppl(Node &t, int ppl) {\n t->all.insert(ppl);\n t->sum++;\n upd_min(t);\n }\n void del_ppl(Node &t, int ppl) {\n t->all.erase(ppl);\n t->sum--;\n upd_min(t);\n }\n Node merge(Node l, Node r) {\n if (!l) return r;\n if (!r) return l;\n if (l->prior > r->prior) {\n l->right = merge(l->right, r);\n l->update();\n return l;\n } else {\n r->left = merge(l, r->left);\n r->update();\n return r;\n }\n }\n void split(Node t, int key, Node &l, Node &r) {\n if (!t) return void(l = r = NULL);\n if (t->key() <= key) {\n split(t->right, key - t->key(), t->right, r);\n l = t;\n } else {\n split(t->left, key, l, t->left);\n r = t;\n }\n t->update();\n t->parent = NULL;\n }\n int get_pos(Node t) {\n vector vc;\n Node v = t;\n while (v->parent) {\n if (v->parent->left == v)\n vc.push_back(0);\n else\n vc.push_back(1);\n v = v->parent;\n }\n reverse(vc.begin(), vc.end());\n int pos = 0;\n for (int i = 0; i < vc.size(); ++i) {\n if (vc[i] == 0)\n v = v->left;\n else\n pos += v->key(), v = v->right;\n }\n pos += v->key();\n return pos;\n }\n Node get_root(Node t) {\n Node ans = NULL;\n while (t) {\n ans = t;\n t = t->parent;\n }\n return ans;\n }\n Node leftmost(Node t) {\n Node ans = NULL;\n while (t) {\n ans = t;\n t = t->left;\n }\n return ans;\n }\n Node rightmost(Node t) {\n Node ans = NULL;\n while (t) {\n ans = t;\n t = t->right;\n }\n return ans;\n }\n void set_link(Node t, Node v) {\n if (!t) return;\n t->link = v;\n }\n void cut_out(Node t) {\n int pos = get_pos(t);\n Node l, r;\n split(get_root(t), pos, l, r);\n set_link(leftmost(r), t);\n }\n void cut_out1(Node t) {\n int pos = get_pos(t);\n Node l, r;\n split(get_root(t), pos - 1, l, r);\n set_link(leftmost(r), rightmost(l));\n }\n void expose(Node v) {\n cut_out(v);\n v = leftmost(get_root(v));\n while (v->link) {\n cut_out(v->link);\n merge(get_root(v->link), get_root(v));\n set_link(v, NULL);\n v = leftmost(get_root(v));\n }\n }\n void link(Node u, Node v) {\n set_link(u, v);\n expose(u);\n }\n void cut(Node u, Node v) {\n expose(v);\n set_link(u, NULL);\n }\n Node lca(Node v, Node u, bool &one_tree) {\n expose(u);\n if (get_root(u) == get_root(v)) {\n one_tree = 1;\n return v;\n }\n expose(v);\n expose(u);\n return leftmost(get_root(v))->link;\n }\n vector nodes;\n const int maxn = 100000;\n vector > add;\n vector g[maxn + 1];\n vector deep;\n void dfs(int v, int p = -1) {\n for (int i = 0; i < g[v].size(); ++i) {\n int tv = g[v][i];\n if (tv == p) continue;\n deep[tv] = deep[v] + 1;\n dfs(tv, v);\n }\n }\n void print_(Node v) {\n if (!v) return;\n print_(v->left);\n cout << \t << v->number << << (v->link ? v->link->number : -1) << endl;\n print_(v->right);\n }\n void print(Node v) { print_(get_root(v)); }\n void print_all(int n) {\n for (int i = 1; i <= n; ++i) {\n cout << i << :\n ;\n print(nodes[i]);\n cout << endl;\n }\n }\n void do_the_thing(Node v, int x) {\n Node t = get_root(v);\n int k = min(x, t->sum);\n cout << k << ;\n vector > add_after;\n for (int i = 0; i < k; ++i) {\n pair cmin = t->mmin;\n cout << cmin.first << ;\n del_ppl(nodes[cmin.second], cmin.first);\n add_after.push_back(cmin);\n }\n cout << endl;\n for (int i = 0; i < add_after.size(); ++i) {\n pair ct = add_after[i];\n add_ppl(nodes[ct.second], ct.first);\n }\n }\n int main() {\n srand(time(NULL));\n ios_base::sync_with_stdio(0);\n int n, m, q;\n cin >> n >> m >> q;\n nodes.resize(n + 1);\n deep.assign(n + 1, 0);\n for (int i = 1; i <= n; ++i) nodes[i] = new node(i);\n for (int i = 0; i < n - 1; ++i) {\n int a, b;\n cin >> a >> b;\n add.push_back(make_pair(a, b));\n g[a].push_back(b);\n g[b].push_back(a);\n }\n dfs(1);\n for (int i = 0; i < add.size(); ++i) {\n int a = add[i].first;\n int b = add[i].second;\n if (deep[a] < deep[b]) swap(a, b);\n link(nodes[a], nodes[b]);\n }\n for (int i = 1; i <= m; ++i) {\n int city;\n cin >> city;\n add_ppl(nodes[city], i);\n }\n for (int i = 0; i < q; ++i) {\n int v, u, x;\n cin >> v >> u >> x;\n bool one_tree = 0;\n Node t = lca(nodes[v], nodes[u], one_tree);\n if (one_tree) {\n cut_out1(nodes[v]);\n do_the_thing(nodes[v], x);\n } else {\n int split_key = get_root(nodes[v])->size;\n cut_out1(t);\n merge(get_root(nodes[v]), get_root(t));\n do_the_thing(nodes[v], x);\n Node l, r;\n split(get_root(nodes[v]), split_key, l, r);\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n #pragma comment(linker, /STACK:100000000000000 )\n using namespace std;\n const long long int INF = 2e18;\n int nex[20000][35];\n int at[35];\n int main() {\n string f, s;\n cin >> f >> s;\n memset(nex, -1, sizeof nex);\n memset(at, -1, sizeof at);\n for (int i = 0; i < f.size(); i++) {\n int he = f[i] - 'a';\n if (at[he] == -1) {\n at[he] = i;\n }\n }\n for (int i = f.size() - 1; i >= 0; i--) {\n for (int j = 0; j < 35; j++) {\n nex[i][j] = at[j];\n }\n at[f[i] - 'a'] = i;\n }\n int now = (f[0] == s[0] ? 0 : nex[0][s[0] - 'a']);\n int cur = 0;\n int cnt = 1;\n while (cur < s.size()) {\n if (now == -1) {\n cout << -1;\n return 0;\n }\n cur++;\n if (cur == s.size()) break;\n int gogo = nex[now][s[cur] - 'a'];\n if (gogo == -1) {\n cout << -1;\n return 0;\n }\n if (gogo <= now) {\n cnt++;\n }\n now = gogo;\n }\n cout << cnt;\n }\n "} @@ -740,10 +740,10 @@ {"func_code_string": "#include \n using namespace std;\n const int maxn = 3079;\n int r, c, n, k;\n vector nx(maxn, -1), pv(maxn, -1), kth(maxn, -1);\n vector > my(maxn);\n class point {\n public:\n int x, y;\n };\n bool cmp(point& a, point& b) { return (a.y == b.y ? a.x < b.x : a.y < b.y); }\n vector v(maxn);\n long long sum(int i) { return (v[i].y - v[pv[i]].y) * (c + 1 - v[kth[i]].y); }\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cin >> r >> c >> n >> k;\n long long ans = 0;\n int m = n + k + 1;\n for (int i = 1; i <= n; i++) cin >> v[i].x >> v[i].y;\n v[0] = {r + 1, 0};\n for (int i = n + 1; i < m; i++) v[i] = {r + 1, c + 1};\n sort(v.begin(), v.begin() + m, cmp);\n for (int i = n + 1; i < m; i++)\n kth[i] = m - 1, pv[i] = i - 1, nx[i] = min(m - 1, i + 1);\n for (int i = m - 1; i >= 0; i--) my[v[i].x].push_back(i);\n for (int x1 = 1; x1 <= r; x1++) {\n int p = 0;\n for (int i = 1; i <= n; i++) {\n if (v[i].x < x1) continue;\n nx[p] = i, pv[i] = p;\n p = i;\n }\n nx[p] = n + 1, pv[n + 1] = p;\n kth[p] = (k == 1 ? p : pv[m - 1]);\n for (int i = p; i >= 0; i = pv[i]) kth[i] = pv[kth[nx[i]]];\n long long cur = 0;\n for (int i = nx[0]; i <= n; i = nx[i]) cur += sum(i);\n for (int x2 = r; x2 >= x1; x2--) {\n ans += cur;\n for (int i : my[x2]) {\n cur -= sum(i);\n for (int j = pv[i], cnt = 0; cnt < k - 1 && j; cnt++, j = pv[j]) {\n cur -= sum(j);\n if (j < i) kth[j] = nx[kth[j]];\n cur += sum(j);\n }\n cur -= sum(nx[i]);\n nx[pv[i]] = nx[i], pv[nx[i]] = pv[i];\n cur += sum(nx[i]);\n }\n }\n }\n cout << ans << \n ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 5e5 + 233;\n const int INF = numeric_limits::max();\n void read(int &x) {\n x = 0;\n char ch = getchar();\n int f = 1;\n while (!isdigit(ch)) (ch == '-' ? f = -1 : 0), ch = getchar();\n while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();\n x *= f;\n }\n int f[N][105], g[105];\n int n, K, p, a[N], nw, s[N];\n int x, sum, st[N], tp;\n signed main() {\n memset(g, 0x7f, sizeof(g));\n memset(f, 0x7f, sizeof(f));\n read(n);\n read(K);\n read(p);\n if (p * K > n) {\n for (int i = 1; i <= n; ++i) {\n read(x);\n x %= p;\n a[i] = x;\n sum = (sum + a[i]) % p;\n f[i][1] = sum;\n g[1] = sum;\n for (int j = min(K, i); j >= 2; --j)\n if (i == j) {\n f[i][j] = f[i - 1][j - 1] + x;\n g[j] = x;\n } else {\n int l = f[i - 1][j - 1] + x;\n int r = f[i - 1][j] + x;\n if (g[j] + x >= p) r -= p;\n if (l < r)\n f[i][j] = l, g[j] = x;\n else if (l > r)\n f[i][j] = r, g[j] = (g[j] + x) % p;\n else\n f[i][j] = l, g[j] = max(x, (g[j] + x) % p);\n }\n }\n return printf( %d , f[n][K]), 0;\n }\n for (int i = 1; i <= n; ++i)\n read(a[i]), a[i] %= p, sum += a[i], s[i] = (s[i - 1] + a[i]) % p;\n for (int i = 1; i <= n - 1; ++i) {\n int pos = upper_bound(st + 1, st + 1 + tp, s[i]) - st;\n if (pos > tp) ++tp;\n st[pos] = s[i];\n }\n int pos = upper_bound(st + 1, st + 1 + tp, s[n]) - st;\n if (pos >= K)\n printf( %d , s[n]);\n else\n printf( %d , s[n] + p);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, k;\n int y;\n vector > p[3];\n int dp[111][111][3];\n bool check(int x, int t, int y) {\n for (int i = 0; i < p[y].size(); i++) {\n if (x >= p[y][i].first - 2 * t && x <= p[y][i].second - 2 * t) return false;\n }\n return true;\n }\n int go(int x, int t, int y) {\n if (x == n - 1) return true;\n int& res = dp[x][t][y];\n if (res != -1) return res;\n res = 0;\n for (int i = 0; i < p[y].size(); i++) {\n if (x >= p[y][i].first - 2 * t && x <= p[y][i].second - 2 * t ||\n x + 1 >= p[y][i].first - 2 * t && x + 1 <= p[y][i].second - 2 * t)\n return res = false;\n }\n if (check(x + 1, t, y)) res |= go(x + 1, t + 1, y);\n if (check(x + 1, t, min(2, y + 1))) res |= go(x + 1, t + 1, min(2, y + 1));\n if (check(x + 1, t, max(y - 1, 0))) res |= go(x + 1, t + 1, max(y - 1, 0));\n return res;\n }\n void R(string s, int v) {\n int i = 0;\n if (s[0] == 's') {\n y = v;\n s[0] = '.';\n }\n while (i < s.size()) {\n if (s[i] != '.') {\n int l = i;\n int r = l;\n while (i < s.size() && s[i] == s[l]) i++;\n r = i - 1;\n i--;\n p[v].push_back(make_pair(l, r));\n if (i == s.size() - 1) return;\n }\n i++;\n }\n }\n int main() {\n int t;\n cin >> t;\n for (int i = 0; i < t; i++) {\n p[0].clear();\n p[1].clear();\n p[2].clear();\n memset(dp, -1, sizeof(dp));\n cin >> n >> k;\n string s1, s2, s3;\n cin >> s1 >> s2 >> s3;\n R(s1, 0);\n R(s2, 1);\n R(s3, 2);\n if (go(0, 0, y))\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 namespace IO {\n const int sz = 1 << 15;\n char inbuf[sz], outbuf[sz];\n char *pinbuf = inbuf + sz;\n char *poutbuf = outbuf;\n inline char _getchar() {\n if (pinbuf == inbuf + sz) fread(inbuf, 1, sz, stdin), pinbuf = inbuf;\n return *(pinbuf++);\n }\n inline void _putchar(char x) {\n if (poutbuf == outbuf + sz) fwrite(outbuf, 1, sz, stdout), poutbuf = outbuf;\n *(poutbuf++) = x;\n }\n inline void flush() {\n if (poutbuf != outbuf)\n fwrite(outbuf, 1, poutbuf - outbuf, stdout), poutbuf = outbuf;\n }\n } // namespace IO\n inline int read() {\n int x = 0, p = 1;\n char c = IO::_getchar();\n while (c < '0' || c > '9') {\n if (c == '-') p = -1;\n c = IO::_getchar();\n }\n while (c >= '0' && c <= '9') x = x * 10 + c - 48, c = IO::_getchar();\n return x * p;\n }\n namespace Mymath {\n long long qp(long long x, long long p, long long mod) {\n long long ans = 1;\n while (p) {\n if (p & 1) ans = ans * x % mod;\n x = x * x % mod;\n p >>= 1;\n }\n return ans;\n }\n long long inv(long long x, long long mod) { return qp(x, mod - 2, mod); }\n long long C(long long N, long long K, long long fact[], long long mod) {\n return fact[N] * inv(fact[K], mod) % mod * inv(fact[N - K], mod) % mod;\n }\n template \n Tp gcd(Tp A, Tp B) {\n if (B == 0) return A;\n return gcd(B, A % B);\n }\n template \n Tp lcm(Tp A, Tp B) {\n return A * B / gcd(A, B);\n }\n }; // namespace Mymath\n const int Maxn = 705;\n const long long mod = 1e9 + 7;\n int dp[Maxn][3][Maxn][11];\n int tot[11][Maxn];\n char c[Maxn];\n int n;\n void Add(int &x, int y) {\n x += y;\n if (x >= mod) x -= mod;\n }\n int main() {\n scanf( %s , c);\n n = strlen(c);\n for (int i = 0; i <= 9; i++) dp[0][1][0][i] = 1;\n for (int i = 0; i < n; i++) {\n int curv = c[i] - '0';\n for (int j = 0; j <= i; j++) {\n for (int k = 0; k <= 9; k++) {\n if (i)\n for (int l = 0; l < 3; l++) Add(tot[k][j], dp[i][l][j][k]);\n Add(dp[i + 1][1][j + (curv >= k)][k], dp[i][1][j][k]);\n for (int l = 0; l <= 9; l++) {\n if (!i && !l) continue;\n if (l == curv) continue;\n Add(dp[i + 1][(l < curv) ? 0 : 2][j + (l >= k)][k], dp[i][1][j][k]);\n }\n for (int l = 0; l <= 9; l++) {\n if (!i && !l) continue;\n Add(dp[i + 1][0][j + (l >= k)][k], dp[i][0][j][k]);\n Add(dp[i + 1][2][j + (l >= k)][k], dp[i][2][j][k]);\n }\n }\n }\n }\n for (int j = 0; j <= n; j++) {\n for (int k = 0; k <= 9; k++) {\n for (int l = 0; l < 2; l++) Add(tot[k][j], dp[n][l][j][k]);\n }\n }\n for (int i = 0; i <= 9; i++) {\n for (int j = n; j >= 0; j--) {\n Add(tot[i][j], tot[i][j + 1]);\n }\n }\n long long ans = 0;\n int w = 1;\n for (int i = 0; i < n; i++) {\n for (int j = 1; j <= 9; j++) {\n int cnt = tot[j][i + 1] - tot[j + 1][i + 1];\n if (cnt < 0) cnt += mod;\n ans += 1ll * cnt * w % mod * j;\n ans %= mod;\n }\n w = 1ll * w * 10 % mod;\n }\n printf( %I64d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n namespace IO {\n const int sz = 1 << 15;\n char inbuf[sz], outbuf[sz];\n char *pinbuf = inbuf + sz;\n char *poutbuf = outbuf;\n inline char _getchar() {\n if (pinbuf == inbuf + sz) fread(inbuf, 1, sz, stdin), pinbuf = inbuf;\n return *(pinbuf++);\n }\n inline void _putchar(char x) {\n if (poutbuf == outbuf + sz) fwrite(outbuf, 1, sz, stdout), poutbuf = outbuf;\n *(poutbuf++) = x;\n }\n inline void flush() {\n if (poutbuf != outbuf)\n fwrite(outbuf, 1, poutbuf - outbuf, stdout), poutbuf = outbuf;\n }\n } // namespace IO\n inline int read() {\n int x = 0, p = 1;\n char c = IO::_getchar();\n while (c < '0' || c > '9') {\n if (c == '-') p = -1;\n c = IO::_getchar();\n }\n while (c >= '0' && c <= '9') x = x * 10 + c - 48, c = IO::_getchar();\n return x * p;\n }\n namespace Mymath {\n long long qp(long long x, long long p, long long mod) {\n long long ans = 1;\n while (p) {\n if (p & 1) ans = ans * x % mod;\n x = x * x % mod;\n p >>= 1;\n }\n return ans;\n }\n long long inv(long long x, long long mod) { return qp(x, mod - 2, mod); }\n long long C(long long N, long long K, long long fact[], long long mod) {\n return fact[N] * inv(fact[K], mod) % mod * inv(fact[N - K], mod) % mod;\n }\n template \n Tp gcd(Tp A, Tp B) {\n if (B == 0) return A;\n return gcd(B, A % B);\n }\n template \n Tp lcm(Tp A, Tp B) {\n return A * B / gcd(A, B);\n }\n }; // namespace Mymath\n const int Maxn = 705;\n const long long mod = 1e9 + 7;\n int dp[Maxn][3][Maxn][11];\n int tot[11][Maxn];\n char c[Maxn];\n int n;\n void Add(int &x, int y) {\n x += y;\n if (x >= mod) x -= mod;\n }\n int main() {\n scanf( %s , c);\n n = strlen(c);\n for (int i = 0; i <= 9; i++) dp[0][1][0][i] = 1;\n for (int i = 0; i < n; i++) {\n int curv = c[i] - '0';\n for (int j = 0; j <= i; j++) {\n for (int k = 0; k <= 9; k++) {\n if (i)\n for (int l = 0; l < 3; l++) Add(tot[k][j], dp[i][l][j][k]);\n Add(dp[i + 1][1][j + (curv >= k)][k], dp[i][1][j][k]);\n for (int l = 0; l <= 9; l++) {\n if (!i && !l) continue;\n if (l == curv) continue;\n Add(dp[i + 1][(l < curv) ? 0 : 2][j + (l >= k)][k], dp[i][1][j][k]);\n }\n for (int l = 0; l <= 9; l++) {\n if (!i && !l) continue;\n Add(dp[i + 1][0][j + (l >= k)][k], dp[i][0][j][k]);\n Add(dp[i + 1][2][j + (l >= k)][k], dp[i][2][j][k]);\n }\n }\n }\n }\n for (int j = 0; j <= n; j++) {\n for (int k = 0; k <= 9; k++) {\n for (int l = 0; l < 2; l++) Add(tot[k][j], dp[n][l][j][k]);\n }\n }\n for (int i = 0; i <= 9; i++) {\n for (int j = n; j >= 0; j--) {\n Add(tot[i][j], tot[i][j + 1]);\n }\n }\n long long ans = 0;\n int w = 1;\n for (int i = 0; i < n; i++) {\n for (int j = 1; j <= 9; j++) {\n int cnt = tot[j][i + 1] - tot[j + 1][i + 1];\n if (cnt < 0) cnt += mod;\n ans += 1ll * cnt * w % mod * j;\n ans %= mod;\n }\n w = 1ll * w * 10 % mod;\n }\n printf( extra\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n std::ostream &operator<<(std::ostream &out, vector &v) {\n for (typename vector::size_type i = 0; i < v.size(); ++i)\n out << v[i] << ;\n out << \n ;\n return out;\n }\n template \n std::ostream &operator<<(std::ostream &out, vector > &v) {\n for (size_t i = 0; i < v.size(); ++i) {\n for (size_t j = 0; j < v[i].size(); ++j) {\n out << v[i][j] << ;\n }\n out << \n ;\n }\n return out;\n }\n int main() {\n std::ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n long long n, k;\n cin >> n >> k;\n vector divisors;\n for (long long i = 1; i * i <= n; ++i) {\n if (n % i == 0) {\n divisors.push_back(i);\n if (n / i != i) {\n divisors.push_back(n / i);\n }\n }\n }\n if (k > divisors.size()) {\n cout << -1\n ;\n return 0;\n }\n sort(divisors.begin(), divisors.end());\n cout << divisors[k - 1] << \n ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 100000;\n struct node {\n int n;\n int i;\n node(int n, int i) : n(n), i(i) {}\n node() {}\n bool operator<(const node& n1) const { return n < n1.n; }\n bool is_happy() const {\n int a = n;\n while (a) {\n if (a % 10 != 7 && a % 10 != 4) return false;\n a /= 10;\n }\n return true;\n }\n };\n node nodes[maxn];\n int rev[maxn];\n inline void sw(int i, int j, vector >& ans) {\n ans.push_back(pair(nodes[i].i, nodes[j].i));\n swap(nodes[i].i, nodes[j].i);\n rev[nodes[i].i] = i;\n rev[nodes[j].i] = j;\n }\n int main() {\n int n;\n scanf( %d , &n);\n bool sorted = true;\n int x = -1, prev;\n for (int i = 0; i < n; i++) {\n prev = x;\n scanf( %d , &x);\n if (prev > x) sorted = false;\n nodes[i] = node(x, i);\n }\n if (sorted) {\n printf( 0\n );\n return 0;\n }\n sort(nodes, nodes + n);\n for (int i = 0; i < n; i++) {\n rev[nodes[i].i] = i;\n }\n int happy = -1;\n for (int i = 0; i < n; i++) {\n if (nodes[i].is_happy()) {\n happy = i;\n break;\n }\n }\n if (happy == -1) {\n printf( -1\n );\n return 0;\n }\n vector > ans;\n for (int i = 0; i < n; i++)\n if (i != happy && nodes[i].i != i) {\n if (rev[i] != happy) sw(rev[i], happy, ans);\n sw(happy, i, ans);\n }\n printf( %d\n , ans.size());\n for (int i = 0; i < ans.size(); i++) {\n printf( %d %d\n , ans[i].first + 1, ans[i].second + 1);\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int Mod = 1e9 + 7;\n int qpow(long long a, long long b) {\n long long c = 1;\n while (b) {\n if (b & 1) c = c * a % Mod;\n if (b >>= 1) a = a * a % Mod;\n }\n return c;\n }\n int n;\n long long a;\n int p, q;\n int main() {\n scanf( %d , &n);\n bool minus = 1;\n q = 2;\n for (int i = 1; i <= n; i++) {\n scanf( %I64d , &a);\n if (!(a & 1)) minus = 0;\n q = qpow(q, a);\n }\n q = q * 500000004ll % Mod;\n if (minus) {\n p = q - 1;\n if (p < 0) p += Mod;\n } else\n p = q + 1;\n p = p * 333333336ll % Mod;\n printf( %d/%d\n , p, q);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int Mod = 1e9 + 7;\n int qpow(long long a, long long b) {\n long long c = 1;\n while (b) {\n if (b & 1) c = c * a % Mod;\n if (b >>= 1) a = a * a % Mod;\n }\n return c;\n }\n int n;\n long long a;\n int p, q;\n int main() {\n scanf( %d , &n);\n bool minus = 1;\n q = 2;\n for (int i = 1; i <= n; i++) {\n scanf( extra , &a);\n if (!(a & 1)) minus = 0;\n q = qpow(q, a);\n }\n q = q * 500000004ll % Mod;\n if (minus) {\n p = q - 1;\n if (p < 0) p += Mod;\n } else\n p = q + 1;\n p = p * 333333336ll % Mod;\n printf( %d/%d\n , p, q);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long int dx[4] = {-1, 0, 0, +1};\n long long int dy[4] = {0, -1, +1, 0};\n const long long int LINF = 1e18;\n const long long int INF = 1e9;\n const long long int mod = 1e9 + 7;\n long long int power(long long int a, long long int b, long long int m) {\n if (b == 0) return 1;\n if (b == 1) return a % m;\n long long int t = power(a, b / 2, m);\n t = (t * t) % m;\n if (b & 1) t = (t * a) % m;\n return t;\n }\n long long int modInverse(long long int a, long long int m) {\n return power(a, m - 2, m);\n }\n int 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 long long int n, ans = 0, i, j;\n string ip;\n cin >> ip;\n long long int sz = ip.size();\n if (ip[0] == '?') {\n if (sz >= 2 && ip[1] == 'a')\n ip[0] = 'b';\n else\n ip[0] = 'a';\n }\n for (long long int i = 1; i <= -1 + ip.size(); i++) {\n if (ip[i] == '?') {\n if (ip[i - 1] == 'a') {\n if ((i + 1) < sz && ip[i + 1] == 'b')\n ip[i] = 'c';\n else\n ip[i] = 'b';\n } else if (ip[i - 1] == 'b') {\n if ((i + 1) < sz && ip[i + 1] == 'a')\n ip[i] = 'c';\n else\n ip[i] = 'a';\n } else if (ip[i - 1] == 'c') {\n if ((i + 1) < sz && ip[i + 1] == 'a')\n ip[i] = 'b';\n else\n ip[i] = 'a';\n } else\n ip[i] = 'a';\n }\n }\n bool poss = true;\n for (long long int i = 1; i <= sz - 1; i++) {\n if (ip[i] == ip[i - 1]) {\n cout << -1 << endl;\n poss = false;\n break;\n }\n }\n if (poss) cout << ip << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, a[105], b[105], c[105], tot, ans;\n char s[105];\n int main() {\n scanf( %d , &n);\n scanf( %s , s + 1);\n for (int i = 1; i <= n; i++) {\n scanf( %d%d , &a[i], &b[i]);\n c[i] = s[i] - '0';\n if (c[i] == 1) tot++;\n }\n ans = tot;\n for (int i = 1; i <= 125; i++) {\n for (int j = 1; j <= n; j++) {\n if (i < b[j]) continue;\n int k = i - b[j];\n if (k % a[j] != 0) continue;\n tot -= c[j];\n c[j] ^= 1;\n tot += c[j];\n }\n ans = max(ans, tot);\n }\n printf( %d\n , ans);\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int INF = 0x7fffffff;\n const int oo = 0x3f3f3f3f;\n template \n inline void rd(T &x) {\n x = 0;\n int f = 1;\n char CH = getchar();\n while (!isdigit(CH)) {\n if (CH == '-') f = 0;\n CH = getchar();\n }\n while (isdigit(CH)) {\n x = ((x + (x << 2)) << 1) + (CH - 48);\n CH = getchar();\n }\n x = (f == 1) ? x : -x;\n return;\n }\n const int MXN = 2e6;\n int a[MXN], n;\n inline void solve() {\n long long fuck;\n rd(fuck);\n if (fuck > 36) {\n cout << -1;\n return;\n }\n if (fuck == 1)\n cout << 6;\n else if (fuck == 2)\n cout << 8;\n else if (fuck > 2) {\n while (fuck > 2) fuck -= 2, cout << 8;\n if (fuck == 1) cout << 0;\n if (fuck == 2) cout << 8;\n }\n }\n int main() { solve(); }\n "} @@ -759,7 +759,7 @@ {"func_code_string": "#include \n using namespace std;\n int A[100005], D[100005], n, m, w, L[100005];\n bool go(int h) {\n fill(L, L + n, 0);\n for (int i = 0; i < n; ++i) D[i] = max(h - A[i], 0);\n int pow = 0, cap = m, d;\n for (int i = 0; i < n; ++i) {\n pow -= L[i];\n d = max(D[i] - pow, 0);\n if (d > cap) return false;\n pow += d;\n cap -= d;\n if (i + w < n) L[i + w] += d;\n }\n return true;\n }\n int main() {\n std::ios::sync_with_stdio(false);\n int mini = 2e9;\n cin >> n >> m >> w;\n for (int i = 0; i < n; ++i) {\n cin >> A[i];\n mini = min(mini, A[i]);\n }\n int lo = mini, hi = mini + m + 1, mid;\n while (hi - lo > 1) {\n mid = (hi + lo) >> 1;\n if (go(mid))\n lo = mid;\n else\n hi = mid;\n }\n cout << lo << endl;\n }\n "} {"func_code_string": "#include \n int main(void) {\n int t, n, d;\n scanf( %d , &t);\n while (t--) {\n scanf( %d %d , &n, &d);\n int i = 0;\n int flag = 1;\n while (i < n) {\n int te = d / (i + 1);\n te = te * (i + 1) == d ? te : te + 1;\n if (i + te <= n) {\n printf( YES\n );\n flag = 0;\n break;\n }\n i++;\n }\n if (flag) printf( NO\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 cout.tie(0);\n int n, m1 = 0, m2 = 0;\n cin >> n;\n vector > m(n, vector(n));\n vector a(n);\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++) cin >> m[i][j];\n for (int i = 1; i < n - 1; i++)\n a[i] = sqrt(m[i][i + 1] * m[i - 1][i] / m[i - 1][i + 1]);\n a[0] = m[0][1] / a[1];\n a[n - 1] = m[0][n - 1] / a[0];\n for (int i = 0; i < n; i++) cout << a[i] << ' ';\n return 0;\n }\n "} -{"func_code_string": "#include \n const long long maxm = 1e5 + 100;\n long long n, m;\n struct node {\n long long col[maxm * 4], tag[maxm * 4], sum[maxm * 4], siz[maxm * 4];\n inline void pushup(long long o) {\n sum[o] = sum[(o << 1)] + sum[(o << 1) | 1];\n col[o] = col[(o << 1)] == col[(o << 1) | 1] ? col[(o << 1)] : 0;\n }\n inline void pushdown(long long o) {\n if (tag[o]) {\n tag[(o << 1)] += tag[o];\n tag[(o << 1) | 1] += tag[o];\n sum[(o << 1)] += siz[(o << 1)] * tag[o];\n sum[(o << 1) | 1] += siz[(o << 1) | 1] * tag[o];\n col[(o << 1)] = col[(o << 1) | 1] = col[o];\n tag[o] = 0;\n }\n }\n void build(long long o, long long l, long long r) {\n siz[o] = (r - l + 1);\n if (l >= r) {\n col[o] = l;\n return;\n }\n long long mid = (l + r) >> 1;\n build((o << 1), l, mid), build((o << 1) | 1, mid + 1, r);\n pushup(o);\n }\n void cover(long long o, long long l, long long r, long long ql, long long qr,\n long long c) {\n if (ql > r || qr < l) return;\n if ((ql <= l) && (r <= qr) && col[o]) {\n tag[o] += abs(col[o] - c);\n sum[o] += abs(col[o] - c) * siz[o];\n col[o] = c;\n return;\n }\n pushdown(o);\n long long mid = (l + r) >> 1;\n cover((o << 1), l, mid, ql, qr, c),\n cover((o << 1) | 1, mid + 1, r, ql, qr, c);\n pushup(o);\n }\n long long ask(long long o, long long l, long long r, long long ql,\n long long qr) {\n if (ql > r || qr < l) return 0;\n if ((ql <= l) && (r <= qr)) return sum[o];\n pushdown(o);\n long long mid = (l + r) >> 1;\n return ask((o << 1), l, mid, ql, qr) +\n ask((o << 1) | 1, mid + 1, r, ql, qr);\n }\n } st;\n signed main() {\n scanf( %I64d%I64d , &n, &m);\n st.build(1, 1, n);\n for (long long i = 1; i <= m; i++) {\n long long opt, l, r, x;\n scanf( %I64d%I64d%I64d , &opt, &l, &r);\n if (opt == 1)\n scanf( %I64d , &x), st.cover(1, 1, n, l, r, x);\n else\n printf( %I64d\n , st.ask(1, 1, n, l, r));\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n const long long maxm = 1e5 + 100;\n long long n, m;\n struct node {\n long long col[maxm * 4], tag[maxm * 4], sum[maxm * 4], siz[maxm * 4];\n inline void pushup(long long o) {\n sum[o] = sum[(o << 1)] + sum[(o << 1) | 1];\n col[o] = col[(o << 1)] == col[(o << 1) | 1] ? col[(o << 1)] : 0;\n }\n inline void pushdown(long long o) {\n if (tag[o]) {\n tag[(o << 1)] += tag[o];\n tag[(o << 1) | 1] += tag[o];\n sum[(o << 1)] += siz[(o << 1)] * tag[o];\n sum[(o << 1) | 1] += siz[(o << 1) | 1] * tag[o];\n col[(o << 1)] = col[(o << 1) | 1] = col[o];\n tag[o] = 0;\n }\n }\n void build(long long o, long long l, long long r) {\n siz[o] = (r - l + 1);\n if (l >= r) {\n col[o] = l;\n return;\n }\n long long mid = (l + r) >> 1;\n build((o << 1), l, mid), build((o << 1) | 1, mid + 1, r);\n pushup(o);\n }\n void cover(long long o, long long l, long long r, long long ql, long long qr,\n long long c) {\n if (ql > r || qr < l) return;\n if ((ql <= l) && (r <= qr) && col[o]) {\n tag[o] += abs(col[o] - c);\n sum[o] += abs(col[o] - c) * siz[o];\n col[o] = c;\n return;\n }\n pushdown(o);\n long long mid = (l + r) >> 1;\n cover((o << 1), l, mid, ql, qr, c),\n cover((o << 1) | 1, mid + 1, r, ql, qr, c);\n pushup(o);\n }\n long long ask(long long o, long long l, long long r, long long ql,\n long long qr) {\n if (ql > r || qr < l) return 0;\n if ((ql <= l) && (r <= qr)) return sum[o];\n pushdown(o);\n long long mid = (l + r) >> 1;\n return ask((o << 1), l, mid, ql, qr) +\n ask((o << 1) | 1, mid + 1, r, ql, qr);\n }\n } st;\n signed main() {\n scanf( extraextra , &n, &m);\n st.build(1, 1, n);\n for (long long i = 1; i <= m; i++) {\n long long opt, l, r, x;\n scanf( extraextraextra , &opt, &l, &r);\n if (opt == 1)\n scanf( extra , &x), st.cover(1, 1, n, l, r, x);\n else\n printf( extra\n , st.ask(1, 1, n, l, r));\n }\n return 0;\n }\n "} {"func_code_string": "#include \n template \n void ZZ(const char* name, Arg1&& arg1) {\n std::cout << name << = << arg1 << std::endl;\n }\n template \n void ZZ(const char* names, Arg1&& arg1, Args&&... args) {\n const char* comma = strchr(names + 1, ',');\n std::cout.write(names, comma - names) << = << arg1;\n ZZ(comma, args...);\n }\n using namespace std;\n long long int to_ll(string& s) {\n long long int i, ret = 0, p = 1;\n for (i = (long long int)s.length() - 1; i >= 0; i--)\n ret += (s[i] - '0') * p, p *= 10LL;\n return ret;\n }\n long long int gcd(long long int x, long long int y) {\n if (y == 0) return x;\n return gcd(y, x % y);\n }\n long long int pwr(long long int base, long long int expo, long long int m) {\n if (base == 0) return 0LL;\n if (expo == 0) return (1LL % m);\n if ((expo & 1) == 0) {\n long long int temp = pwr(base, expo >> 1, m);\n return (temp * temp) % m;\n }\n return ((base % m) * pwr(base, expo - 1, m)) % 1000000007;\n }\n vector adj[200009];\n long long int dp_down[200009][5], dp_up[200009][5], sz_down[200009][5],\n sz_up[200009][5], p[200009], dp[200009][5], dp_sz[200009][5];\n bool v_dp_down[200009][5], v_dp_up[200009][5], v_sz_down[200009][5],\n v_sz_up[200009][5];\n long long int n, k;\n void dfs(long long int node, long long int parent) {\n long long int i;\n p[node] = parent;\n for (i = 0; i < adj[node].size(); i++) {\n long long int nxt = adj[node][i];\n if (nxt == parent) continue;\n dfs(nxt, node);\n }\n }\n void dfs_sz_down(long long int node, long long int parent, long long int m) {\n long long int i;\n if (v_sz_down[node][m] == 1) return;\n v_sz_down[node][m] = 1;\n for (i = 0; i < adj[node].size(); i++) {\n long long int nxt = adj[node][i];\n long long int nxt_m = ((m - 1) % k + k) % k;\n if (nxt == parent) continue;\n dfs_sz_down(nxt, node, nxt_m);\n sz_down[node][m] += sz_down[nxt][nxt_m];\n dp_sz[node][nxt_m] += sz_down[nxt][nxt_m];\n }\n if (m == 0) sz_down[node][m]++;\n }\n void dfs_sz_up(long long int node, long long int parent, long long int m) {\n if (v_sz_up[node][m] == 1) return;\n v_sz_up[node][m] = 1;\n if (m == 0) sz_up[node][m]++;\n if (parent == -1) return;\n long long int nxt_m = ((m - 1) % k + k) % k, i;\n dfs_sz_up(parent, p[parent], nxt_m);\n sz_up[node][m] += sz_up[parent][nxt_m];\n sz_up[node][m] += dp_sz[parent][((m - 2) % k + k) % k];\n sz_up[node][m] -= sz_down[node][((m - 2) % k + k) % k];\n }\n void dfs_up(long long int node, long long int parent, long long int m) {\n if (v_dp_up[node][m] == 1) return;\n v_dp_up[node][m] = 1;\n if (parent == -1) return;\n long long int nxt_m = ((m - 1) % k + k) % k, i;\n dfs_up(parent, p[parent], nxt_m);\n dp_up[node][m] += sz_up[parent][nxt_m] + dp_up[parent][nxt_m];\n dp_up[node][m] += dp[parent][((m - 2) % k + k) % k];\n dp_up[node][m] -= (2 * sz_down[node][((m - 2) % k + k) % k] +\n dp_down[node][((m - 2) % k + k) % k]);\n }\n void dfs_down(long long int node, long long int parent, long long int m) {\n if (v_dp_down[node][m] == 1) return;\n v_dp_down[node][m] = 1;\n long long int i;\n for (i = 0; i < adj[node].size(); i++) {\n long long int nxt = adj[node][i];\n long long int nxt_m = ((m - 1) % k + k) % k;\n if (nxt == parent) continue;\n dfs_down(nxt, node, nxt_m);\n dp_down[node][m] += sz_down[nxt][nxt_m] + dp_down[nxt][nxt_m];\n dp[node][nxt_m] += (2 * sz_down[nxt][nxt_m] + dp_down[nxt][nxt_m]);\n }\n }\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n ;\n long long int i, j, x, y, ans = 0;\n cin >> n >> k;\n for (i = 0; i < n - 1; i++) {\n cin >> x >> y;\n adj[x].push_back(y);\n adj[y].push_back(x);\n }\n dfs(1, -1);\n for (i = 1; i <= n; i++)\n for (j = 0; j < k; j++) dfs_sz_down(i, p[i], j);\n for (i = 1; i <= n; i++)\n for (j = 0; j < k; j++) dfs_sz_up(i, p[i], j);\n for (i = 1; i <= n; i++)\n for (j = 0; j < k; j++) dfs_down(i, p[i], j);\n for (i = 1; i <= n; i++)\n for (j = 0; j < k; j++) dfs_up(i, p[i], j);\n for (j = 0; j < k; j++) {\n for (i = 1; i <= n; i++) {\n long long int total = dp_up[i][j] + dp_down[i][j];\n long long int total_sz = sz_down[i][j] + sz_up[i][j];\n if (j == 0) total_sz--;\n long long int val = ((total - total_sz * j) / k);\n if (j != 0) val += total_sz;\n ans += val;\n }\n }\n cout << ans / 2 << \n ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 1e6 + 4;\n int n, m, a, b, ay[N], by[N], l[N], linkY[N << 1];\n void read() {\n cin >> n >> m >> a >> b;\n for (int i = 1; i <= n; ++i) {\n cin >> ay[i];\n }\n for (int i = 1; i <= m; ++i) {\n cin >> by[i];\n }\n for (int i = 1; i <= m; ++i) {\n cin >> l[i];\n }\n }\n long double dist = 1e18;\n int ida, idb, idTmp;\n long double sqr(long double x) { return x * x; }\n long double euc(long double xa, long double ya, long double xb,\n long double yb) {\n return sqrt(sqr(xa - xb) + sqr(ya - yb));\n }\n long double f(int ni, int mi) {\n return euc(0, 0, a, ay[ni]) + euc(a, ay[ni], b, by[mi]);\n }\n long double ternarySearch(int num) {\n int l = 1, r = n;\n while (l + 2 < r) {\n int dm = (r - l) / 3;\n int m1 = l + dm;\n int m2 = r - dm;\n long double d1 = f(m1, num);\n long double d2 = f(m2, num);\n if (fabs(d1 - d2) < 1e-9) {\n l = m1;\n r = m2;\n } else if (d1 < d2) {\n r = m2;\n } else {\n l = m1;\n }\n }\n idTmp = l;\n for (int i = l + 1; i <= r; ++i) {\n if (f(i, num) < f(idTmp, num)) {\n idTmp = i;\n }\n }\n return f(idTmp, num);\n }\n void calc() {\n for (int i = 1; i <= m; ++i) {\n long double distTmp = ternarySearch(i) + l[i];\n if (distTmp < dist) {\n dist = distTmp;\n ida = idTmp;\n idb = i;\n }\n }\n }\n void sovle() {\n read();\n calc();\n cout << ida << << idb;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cout.tie(0);\n cin.tie(0);\n sovle();\n return 0;\n }\n "} {"func_code_string": "#include \n #pragma GCC optimize( Ofast,unroll-loops )\n #pragma GCC target( avx,avx2,sse,sse2 )\n using namespace std;\n using vi = vector;\n mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());\n long long powmod(long long a, long long b, long long mod) {\n if (b == 0 || a == 1) {\n if (mod == 1)\n return 0;\n else\n return 1;\n }\n if (b % 2 == 0) {\n long long k = powmod(a, b / 2, mod);\n return (k * k) % mod;\n } else {\n long long k = powmod(a, b / 2, mod);\n return ((k * k) % mod * a) % mod;\n }\n }\n long long gcd(long long a, long long b) {\n if (a == 0) return b;\n if (b == 0) return a;\n if (a > b)\n return gcd(a % b, b);\n else\n return gcd(b % a, a);\n }\n long long prime(long long p) {\n if (p == 1) return 0;\n for (long long i = 2; i * i <= p; i++) {\n if (p % i == 0 && i < p) return i;\n }\n return 1;\n }\n long long inv(long long a, long long mod) { return powmod(a, mod - 2, mod); }\n long long random_modul() {\n uniform_int_distribution u1(1e9, 2e9);\n long long pepega = u1(rnd);\n while (prime(pepega) != 1) pepega = u1(rnd);\n return pepega;\n }\n template \n void ifmax(T1& max, T1 kek) {\n if (kek > max) max = kek;\n return;\n }\n template \n void ifmin(T1& min, T1 kek) {\n if (kek < min) min = kek;\n return;\n }\n template \n istream& operator>>(std::istream& in, pair& a) {\n in >> a.first >> a.second;\n return in;\n }\n template \n istream& operator>>(std::istream& in, vector& a) {\n for (long long i = 0; i < a.size(); i++) in >> a[i];\n return in;\n }\n template \n ostream& operator<<(std::ostream& out, vector& b) {\n for (long long i = 0; i < b.size(); i++) out << b[i];\n return out;\n }\n template \n void sort(vector& m) {\n sort(m.begin(), m.end());\n }\n template \n void reverse(vector& m) {\n reverse(m.begin(), m.end());\n }\n long long mod = 1000000007;\n long long fac[200005];\n long long inv_fac[200005];\n long long co(long long a, long long b) {\n long long ans = 1;\n ans *= fac[b];\n ans *= inv_fac[b - a];\n ans %= mod;\n ans *= inv_fac[a];\n return ans % mod;\n }\n void solve() {\n string a, b;\n cin >> a >> b;\n long long s1 = a.size();\n long long s2 = b.size();\n string ans;\n for (long long i = 1; i <= s1; i++) {\n for (long long j = 1; j <= s2; j++) {\n string cur = ;\n for (long long k = 0; k < i; k++) cur += a[k];\n for (long long k = 0; k < j; k++) cur += b[k];\n if (i == 1 && i == j)\n ans = cur;\n else\n ans = min(ans, cur);\n }\n }\n cout << ans;\n return;\n }\n signed main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n cout << fixed << setprecision(10);\n long long multitest = 0;\n long long tututu;\n tututu = 1;\n long long combinatorics = 0;\n if (combinatorics) {\n fac[1] = 1;\n fac[0] = 1;\n for (long long i = 2; i < 200005; i++) {\n fac[i] = fac[i - 1] * i;\n fac[i] %= mod;\n }\n for (long long i = 0; i < 200005; i++) {\n inv_fac[i] = inv(fac[i], mod);\n }\n }\n if (multitest) cin >> tututu;\n for (long long qwerty = 0; qwerty < tututu; qwerty++) solve();\n return 0;\n }\n "} @@ -777,14 +777,14 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, x, y;\n cin >> n;\n int mx = 0;\n for (int i = 0; i < n; i++) {\n cin >> x >> y;\n mx = max(mx, (x + y));\n }\n cout << mx << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n scanf( %d , &n);\n int arr[n];\n int unos = 0;\n for (int i = 0; i < n; i++) {\n scanf( %d , &arr[i]);\n if (arr[i]) unos++;\n }\n int fin = 0;\n for (int i = 0; i < n; i++) {\n int total = unos;\n for (int j = i; j < n; j++) {\n if (arr[j])\n total--;\n else\n total++;\n fin = max(fin, total);\n }\n }\n printf( %d , fin);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n unsigned int n, i, f, p, s, rez;\n int main() {\n cin >> n;\n f = 1;\n for (i = 1; i <= n; i++) f = ((unsigned long long)f * i) % 998244353;\n f = ((unsigned long long)f * n) % 998244353;\n p = 1;\n s = 0;\n for (i = n; i >= 2; i--) {\n p = ((unsigned long long)p * i) % 998244353;\n s = (s + p) % 998244353;\n }\n rez = (f - s + 998244353) % 998244353;\n cout << rez;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n long long calc_2(int s) {\n if (s < 0) return 0;\n return 1LL * (s + 1) * (s + 2) / 2;\n }\n long long calc_3(int s) {\n if (s < 0) return 0;\n long long ans = 0;\n for (int i = 0; i <= s; i++) ans += calc_2(s - i);\n return ans;\n }\n int val[5];\n int main() {\n int a, b, c, L;\n scanf( %d%d%d%d , &a, &b, &c, &L);\n val[1] = a - b - c, val[2] = b - a - c, val[3] = c - a - b;\n long long ans = calc_3(L);\n for (int i = 1; i <= 3; i++) {\n for (int z = 0; z <= L; z++) {\n int ed = min(L - z, val[i] + z);\n ans -= calc_2(ed);\n }\n }\n printf( %I64d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long calc_2(int s) {\n if (s < 0) return 0;\n return 1LL * (s + 1) * (s + 2) / 2;\n }\n long long calc_3(int s) {\n if (s < 0) return 0;\n long long ans = 0;\n for (int i = 0; i <= s; i++) ans += calc_2(s - i);\n return ans;\n }\n int val[5];\n int main() {\n int a, b, c, L;\n scanf( %d%d%d%d , &a, &b, &c, &L);\n val[1] = a - b - c, val[2] = b - a - c, val[3] = c - a - b;\n long long ans = calc_3(L);\n for (int i = 1; i <= 3; i++) {\n for (int z = 0; z <= L; z++) {\n int ed = min(L - z, val[i] + z);\n ans -= calc_2(ed);\n }\n }\n printf( extra\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int nmax = 26;\n int cost[nmax][3];\n const int l = 0, m = 1, w = 2;\n map, pair > myMap;\n pair global;\n bool ok = 0;\n void firstHalf(int a, int b, int c, string s) {\n if (myMap.count({a - b, b - c}) == 0 || myMap[{a - b, b - c}].second < a) {\n myMap[{a - b, b - c}] = {s, a};\n }\n }\n void findMatch(int a, int b, int c, string s) {\n if (myMap.count({b - a, c - b}) != 0) {\n int ans = myMap[{b - a, c - b}].second + a;\n string fin = myMap[{b - a, c - b}].first + s;\n if (ans > global.second) {\n ok = 1;\n global = {fin, ans};\n }\n }\n }\n void solve(int i, const int stop, void (*op)(int, int, int, string), int a,\n int b, int c, string s) {\n if (i == stop + 1) {\n op(a, b, c, s);\n return;\n }\n solve(i + 1, stop, op, a + cost[i][l], b + cost[i][m], c, s + LM\n );\n solve(i + 1, stop, op, a + cost[i][l], b, c + cost[i][w], s + LW\n );\n solve(i + 1, stop, op, a, b + cost[i][m], c + cost[i][w], s + MW\n );\n }\n int main() {\n int n;\n cin >> n;\n for (int i = 1; i <= n; ++i) cin >> cost[i][l] >> cost[i][m] >> cost[i][w];\n global.second = -26 * 10e7;\n string pl;\n solve(1, n / 2, &firstHalf, 0, 0, 0, pl);\n solve(n / 2 + 1, n, &findMatch, 0, 0, 0, pl);\n if (ok)\n cout << global.first;\n else\n cout << Impossible ;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int a[10];\n int main() {\n int ans = 0;\n for (int i = 0; i < 6; i++) scanf( %d , &a[i]);\n if (a[2] == a[4]) {\n swap(a[0], a[3]);\n swap(a[1], a[2]);\n swap(a[4], a[5]);\n }\n for (int i = a[0] + a[0] - 1 + 2, j = 0; j < max(a[1], a[5]); i += 2, j++) {\n if (j == min(a[1], a[5]))\n i--;\n else if (j > min(a[1], a[5]))\n i -= 2;\n ans += i;\n }\n for (int i = a[3] + a[3] - 1 + 2, j = 0; j < min(a[2], a[4]); i += 2, j++) {\n ans += i;\n }\n printf( %d\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(NULL);\n cout.tie(NULL);\n int t;\n cin >> t;\n for (int i = 0; i < t; i++) {\n int n;\n cin >> n;\n long long mn = 1e9, mx = -1e9;\n long long a[n];\n for (int j = 0; j < n; j++) {\n cin >> a[j];\n mn = min(a[j], mn);\n mx = max(a[j], mx);\n }\n long long x = mn * mx;\n int ans = 1;\n set s;\n for (int j = 2; j <= sqrt(x); j++) {\n if (x % j == 0) {\n s.insert(j);\n s.insert(x / j);\n }\n }\n int cnt = 0;\n for (int j = 0; j < n; j++) {\n if (x % a[j] == 0) {\n cnt++;\n } else {\n cnt = -1;\n break;\n }\n }\n if (cnt != s.size()) {\n cout << -1 << endl;\n } else\n cout << x << endl;\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n class IntTree {\n public:\n IntTree(int size) : nodes_(4 * size + 10, 0), size_(size) {}\n void Set(int pos, char ch) { Set(0, 1, size_, pos, ch); }\n int Count(int left, int right) {\n int mask = Mask(0, 1, size_, left, right);\n return CountBits(mask);\n }\n \n private:\n static int Left(int node) { return 2 * node + 1; }\n static int Right(int node) { return 2 * node + 2; }\n static int CountBits(int num);\n void Set(int node, int left, int right, int pos, char ch);\n int Mask(int node, int left, int right, int x, int y);\n vector nodes_;\n int size_;\n };\n int IntTree::CountBits(int num) {\n int count = 0;\n while (num > 0) {\n count += 1;\n num -= (num & -num);\n }\n return count;\n }\n void IntTree::Set(int node, int left, int right, int pos, char ch) {\n if (left == right) {\n nodes_[node] = (1 << (ch - 'a'));\n return;\n }\n int mid = left + (right - left) / 2;\n if (pos <= mid) {\n Set(Left(node), left, mid, pos, ch);\n } else {\n Set(Right(node), mid + 1, right, pos, ch);\n }\n nodes_[node] = (nodes_[Left(node)] | nodes_[Right(node)]);\n }\n int IntTree::Mask(int node, int left, int right, int x, int y) {\n if (x <= left && right <= y) {\n return nodes_[node];\n }\n int mask = 0;\n int mid = left + (right - left) / 2;\n if (x <= mid) {\n mask |= Mask(Left(node), left, mid, x, y);\n }\n if (mid < y) {\n mask |= Mask(Right(node), mid + 1, right, x, y);\n }\n return mask;\n }\n int main() {\n string str;\n getline(cin, str);\n IntTree tree(str.size());\n for (size_t i = 0; i < str.size(); i += 1) {\n tree.Set(i + 1, str[i]);\n }\n int queries;\n cin >> queries;\n for (int i = 0; i < queries; i += 1) {\n int type, x, y;\n char ch;\n cin >> type;\n if (type == 1) {\n cin >> x >> ch;\n tree.Set(x, ch);\n } else {\n cin >> x >> y;\n cout << tree.Count(x, y) << \n ;\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n using LL = long long;\n constexpr int N = 155;\n int in[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 = 1; i <= n; i++) {\n for (int j = 1; j <= n; j++) {\n cin >> in[i][j];\n }\n }\n vector ans(N);\n for (int v = 1; v < n; v++) {\n for (int i = 1; i <= n; i++) {\n bool f1 = false;\n bool f2 = true;\n for (int j = 1; j <= n; j++) {\n if (in[i][j] == v)\n f1 = true;\n else {\n if (in[i][j] != -1 and in[i][j] != 0) f2 = false;\n }\n }\n if (f1 && f2) {\n ans[i] = v;\n for (int j = 1; j <= n; j++) in[i][j] = in[j][i] = -1;\n break;\n }\n }\n }\n for (int i = 1; i <= n; i++) cout << (ans[i] == 0 ? n : ans[i]) << ' ';\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int inf = 1e5 + 9;\n int n;\n int mp[9];\n bool done[109];\n vector > > v[109];\n void dfs(int node) {\n done[node] = 1;\n for (int i = 0; i < v[node].size(); i++) {\n int u = v[node][i].first;\n int e = v[node][i].second.first;\n int f = v[node][i].second.second;\n if (done[u]) continue;\n mp[f] += e, dfs(u);\n }\n }\n int main() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0), cin >> n;\n for (int i = 0; i < n; i++) {\n int a, b, c;\n cin >> a >> b >> c;\n a--;\n b--;\n v[a].push_back({b, {c, 1}});\n v[b].push_back({a, {c, 0}});\n }\n dfs(0);\n mp[1 - v[0][1].second.second] += v[0][1].second.first;\n cout << min(mp[1], mp[0]) << endl;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int N = 200000 + 10;\n const long long INF = 1e18;\n int n, q;\n struct Edge {\n int u, v;\n long long w;\n Edge(int _u = 0, int _v = 0, long long _w = 0) : u(_u), v(_v), w(_w) {}\n };\n vector E;\n int E_size;\n vector G[N];\n int ptr[2 * N];\n void adjListInit(int l, int r) {\n E.clear();\n E_size = 0;\n for (int i = l; i <= r; i++) G[i].clear();\n }\n void addEdge(int u, int v, long long w, int i) {\n E.push_back(Edge(u, v, w));\n E_size++;\n ptr[i] = E_size - 1;\n G[u].push_back(E_size - 1);\n }\n vector Eback;\n int Gback[N];\n int Eback_size;\n long long dist[N];\n int in[N], out[N];\n int peg[N];\n int dfs_clock;\n inline void dfsInit() {\n dist[1] = 0;\n dfs_clock = 0;\n }\n void dfs(int u, int pre) {\n in[u] = ++dfs_clock;\n peg[in[u]] = u;\n for (int i = 0; i < G[u].size(); i++) {\n Edge e = E[G[u][i]];\n int v = e.v;\n if (v == pre) continue;\n dist[v] = dist[u] + e.w;\n dfs(v, u);\n }\n out[u] = dfs_clock;\n }\n struct Node {\n int l, r;\n long long val, lazy;\n void update(long long x) { val += x, lazy += x; }\n } node[N << 2];\n inline void pushdown(int rt) {\n if (node[rt].lazy) {\n node[rt << 1].update(node[rt].lazy);\n node[rt << 1 | 1].update(node[rt].lazy);\n node[rt].lazy = 0;\n }\n }\n inline void pushup(int rt) {\n node[rt].val = min(node[rt << 1].val, node[rt << 1 | 1].val);\n }\n void build(int root, int l, int r) {\n node[root].l = l;\n node[root].r = r;\n node[root].val = 0;\n node[root].lazy = 0;\n if (l == r) {\n int p = peg[l];\n node[root].val = dist[p] + Eback[Gback[p]].w;\n } else {\n int mid = l + (r - l) / 2;\n build(root * 2, l, mid);\n build(root * 2 + 1, mid + 1, r);\n pushup(root);\n }\n }\n void update(int root, int st, int ed, int val) {\n if (st > node[root].r || ed < node[root].l) return;\n if (st <= node[root].l && node[root].r <= ed)\n node[root].update(val);\n else {\n pushdown(root);\n update(root * 2, st, ed, val);\n update(root * 2 + 1, st, ed, val);\n pushup(root);\n }\n }\n long long query(int root, int st, int ed) {\n if (ed < node[root].l || node[root].r < st) return INF;\n if (st <= node[root].l && node[root].r <= ed)\n return node[root].val;\n else {\n pushdown(root);\n long long lson = query(root * 2, st, ed);\n long long rson = query(root * 2 + 1, st, ed);\n pushup(root);\n return min(lson, rson);\n }\n }\n int main() {\n cin >> n >> q;\n adjListInit(1, n);\n for (int i = 1; i <= n - 1; i++) {\n int a, b;\n long long c;\n scanf( %d%d%I64d , &a, &b, &c);\n addEdge(a, b, c, i);\n }\n dfsInit();\n dfs(1, -1);\n Eback.clear();\n Eback_size = 0;\n for (int i = n, a, b, c; i <= 2 * n - 2; i++) {\n scanf( %d%d%d , &a, &b, &c);\n Eback.push_back(Edge(a, b, c));\n Eback_size++;\n ptr[i] = Eback_size - 1;\n Gback[a] = Eback_size - 1;\n }\n Eback.push_back(Edge(1, 1, 0));\n Eback_size++;\n Gback[1] = Eback_size - 1;\n build(1, 1, n);\n for (int i = 1, type; i <= q; i++) {\n scanf( %d , &type);\n if (type == 1) {\n int id;\n long long w;\n scanf( %d%I64d , &id, &w);\n if (id < n) {\n Edge &e = E[ptr[id]];\n update(1, in[e.v], out[e.v], w - e.w);\n e.w = w;\n } else {\n Edge &e = Eback[ptr[id]];\n update(1, in[e.u], in[e.u], w - e.w);\n e.w = w;\n }\n }\n if (type == 2) {\n int u, v;\n scanf( %d%d , &u, &v);\n if (in[u] <= in[v] && in[v] <= out[u]) {\n long long du = query(1, in[u], in[u]) - Eback[Gback[u]].w;\n long long dv = query(1, in[v], in[v]) - Eback[Gback[v]].w;\n printf( %I64d\n , dv - du);\n } else {\n long long ans = query(1, in[u], out[u]);\n long long du = query(1, in[u], in[u]) - Eback[Gback[u]].w;\n long long dv = query(1, in[v], in[v]) - Eback[Gback[v]].w;\n ans -= du;\n ans += dv;\n printf( %I64d\n , ans);\n }\n }\n }\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int N = 200000 + 10;\n const long long INF = 1e18;\n int n, q;\n struct Edge {\n int u, v;\n long long w;\n Edge(int _u = 0, int _v = 0, long long _w = 0) : u(_u), v(_v), w(_w) {}\n };\n vector E;\n int E_size;\n vector G[N];\n int ptr[2 * N];\n void adjListInit(int l, int r) {\n E.clear();\n E_size = 0;\n for (int i = l; i <= r; i++) G[i].clear();\n }\n void addEdge(int u, int v, long long w, int i) {\n E.push_back(Edge(u, v, w));\n E_size++;\n ptr[i] = E_size - 1;\n G[u].push_back(E_size - 1);\n }\n vector Eback;\n int Gback[N];\n int Eback_size;\n long long dist[N];\n int in[N], out[N];\n int peg[N];\n int dfs_clock;\n inline void dfsInit() {\n dist[1] = 0;\n dfs_clock = 0;\n }\n void dfs(int u, int pre) {\n in[u] = ++dfs_clock;\n peg[in[u]] = u;\n for (int i = 0; i < G[u].size(); i++) {\n Edge e = E[G[u][i]];\n int v = e.v;\n if (v == pre) continue;\n dist[v] = dist[u] + e.w;\n dfs(v, u);\n }\n out[u] = dfs_clock;\n }\n struct Node {\n int l, r;\n long long val, lazy;\n void update(long long x) { val += x, lazy += x; }\n } node[N << 2];\n inline void pushdown(int rt) {\n if (node[rt].lazy) {\n node[rt << 1].update(node[rt].lazy);\n node[rt << 1 | 1].update(node[rt].lazy);\n node[rt].lazy = 0;\n }\n }\n inline void pushup(int rt) {\n node[rt].val = min(node[rt << 1].val, node[rt << 1 | 1].val);\n }\n void build(int root, int l, int r) {\n node[root].l = l;\n node[root].r = r;\n node[root].val = 0;\n node[root].lazy = 0;\n if (l == r) {\n int p = peg[l];\n node[root].val = dist[p] + Eback[Gback[p]].w;\n } else {\n int mid = l + (r - l) / 2;\n build(root * 2, l, mid);\n build(root * 2 + 1, mid + 1, r);\n pushup(root);\n }\n }\n void update(int root, int st, int ed, int val) {\n if (st > node[root].r || ed < node[root].l) return;\n if (st <= node[root].l && node[root].r <= ed)\n node[root].update(val);\n else {\n pushdown(root);\n update(root * 2, st, ed, val);\n update(root * 2 + 1, st, ed, val);\n pushup(root);\n }\n }\n long long query(int root, int st, int ed) {\n if (ed < node[root].l || node[root].r < st) return INF;\n if (st <= node[root].l && node[root].r <= ed)\n return node[root].val;\n else {\n pushdown(root);\n long long lson = query(root * 2, st, ed);\n long long rson = query(root * 2 + 1, st, ed);\n pushup(root);\n return min(lson, rson);\n }\n }\n int main() {\n cin >> n >> q;\n adjListInit(1, n);\n for (int i = 1; i <= n - 1; i++) {\n int a, b;\n long long c;\n scanf( %d%dextra , &a, &b, &c);\n addEdge(a, b, c, i);\n }\n dfsInit();\n dfs(1, -1);\n Eback.clear();\n Eback_size = 0;\n for (int i = n, a, b, c; i <= 2 * n - 2; i++) {\n scanf( %d%d%d , &a, &b, &c);\n Eback.push_back(Edge(a, b, c));\n Eback_size++;\n ptr[i] = Eback_size - 1;\n Gback[a] = Eback_size - 1;\n }\n Eback.push_back(Edge(1, 1, 0));\n Eback_size++;\n Gback[1] = Eback_size - 1;\n build(1, 1, n);\n for (int i = 1, type; i <= q; i++) {\n scanf( %d , &type);\n if (type == 1) {\n int id;\n long long w;\n scanf( %dextra , &id, &w);\n if (id < n) {\n Edge &e = E[ptr[id]];\n update(1, in[e.v], out[e.v], w - e.w);\n e.w = w;\n } else {\n Edge &e = Eback[ptr[id]];\n update(1, in[e.u], in[e.u], w - e.w);\n e.w = w;\n }\n }\n if (type == 2) {\n int u, v;\n scanf( %d%d , &u, &v);\n if (in[u] <= in[v] && in[v] <= out[u]) {\n long long du = query(1, in[u], in[u]) - Eback[Gback[u]].w;\n long long dv = query(1, in[v], in[v]) - Eback[Gback[v]].w;\n printf( extra\n , dv - du);\n } else {\n long long ans = query(1, in[u], out[u]);\n long long du = query(1, in[u], in[u]) - Eback[Gback[u]].w;\n long long dv = query(1, in[v], in[v]) - Eback[Gback[v]].w;\n ans -= du;\n ans += dv;\n printf( extra\n , ans);\n }\n }\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n vector a[100004];\n int p[100004];\n int v[100004];\n long long int c[100004];\n struct sajal {\n long long int add, sub, d;\n };\n sajal d[100004];\n int main() {\n long n;\n cin >> n;\n long x, y;\n for (long i = 1; i < n; i++) {\n cin >> x >> y;\n a[x].push_back(y);\n a[y].push_back(x);\n }\n queue q;\n q.push(1);\n p[1] = 1;\n while (!q.empty()) {\n long f = q.front();\n q.pop();\n v[f] = 1;\n for (long i = 0; i < a[f].size(); i++) {\n if (v[a[f][i]] == 0) {\n v[a[f][i]] = 1;\n q.push(a[f][i]);\n p[a[f][i]] = f;\n }\n }\n }\n for (long i = 1; i <= n; i++) {\n cin >> c[i];\n d[i].add = 0;\n d[i].sub = 0;\n d[i].d = a[i].size();\n if (a[i].size() == 1 && i != 1) {\n q.push(i);\n }\n }\n long long int add = 0;\n long long int sub = 0;\n long cur = 1;\n while (!q.empty()) {\n long f = q.front();\n q.pop();\n long long int e = d[f].add - d[f].sub;\n long long int h = -c[f] - e;\n long long int w = p[f];\n if (h >= 0) {\n d[f].add = d[f].add + h;\n } else {\n h = -h;\n d[f].sub = h + d[f].sub;\n }\n if (d[f].sub > sub) sub = d[f].sub;\n if (d[f].add > add) add = d[f].add;\n if (d[w].sub < d[f].sub) d[w].sub = d[f].sub;\n if (d[w].add < d[f].add) d[w].add = d[f].add;\n d[w].d--;\n if (d[w].d == 1 && w != 1) {\n q.push(w);\n }\n }\n c[1] = c[1] + d[1].add - d[1].sub;\n c[1] = -c[1];\n if (c[1] >= 0) {\n d[1].add = d[1].add + c[1];\n } else {\n c[1] = -c[1];\n d[1].sub = d[1].sub + c[1];\n }\n if (add < d[1].add) add = d[1].add;\n if (sub < d[1].sub) sub = d[1].sub;\n cout << add + sub << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, m, l, r, x;\n string s;\n int main() {\n cin >> n >> m;\n r = 0;\n l = n + 1;\n for (int i = 0; i < m; ++i) {\n cin >> s;\n cin >> s;\n cin >> s;\n if (s == left ) {\n cin >> s >> x;\n l = min(l, x);\n } else {\n cin >> s >> x;\n r = max(r, x);\n }\n }\n if (l - r - 1 <= 0)\n cout << -1 << endl;\n else\n cout << l - r - 1 << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n cin >> n;\n string intial, code;\n cin >> intial >> code;\n int res = 0;\n for (int i = 0; i < n; i++) {\n int a = (((intial[i] - '0') - (code[i] - '0')) + 10) % 10;\n int b = (((code[i] - '0') - (intial[i] - '0')) + 10) % 10;\n res += min(a, b);\n }\n cout << res;\n return 0;\n }\n "} @@ -810,7 +810,7 @@ {"func_code_string": "#include \n using namespace std;\n const int N = 100010;\n int n, ans[N], an;\n struct edge {\n int to, nx, id, dl;\n } ee[N];\n int eq[N], en = 1;\n void dfs(int d) {\n for (int j = eq[d], k; k = ee[j].to, j; j = ee[j].nx)\n if (!ee[j].dl) {\n ee[j].dl = 1;\n dfs(k);\n ans[--an] = ee[j].id;\n }\n }\n int main() {\n scanf( %d , &n);\n if (n & 1) {\n printf( -1\n );\n return 0;\n }\n for (int x = 0, t1, t2; x < n; x++) {\n t1 = (x * 2 + 0) % n;\n t2 = (x * 2 + 1) % n;\n ee[++en] = (edge){((t1) / 2 + 1), eq[((x) / 2 + 1)], x, 0},\n eq[((x) / 2 + 1)] = en;\n }\n an = n;\n dfs(1);\n for (int s = 0; s < n; s++)\n if (ans[s] == 0) {\n for (int i = 0; i < n; i++) printf( %d , ans[(s + i) % n]);\n printf( 0\n );\n return 0;\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n void _print(long long 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 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 template \n void _print(unordered_map v) {\n cerr << [ ;\n for (auto i : v) {\n _print(i);\n cerr << ;\n }\n cerr << ] ;\n }\n template \n void _print(list v) {\n cerr << [ ;\n for (T i : v) {\n _print(i);\n cerr << ;\n }\n cerr << ] ;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n int tc = 0, T;\n cin >> T;\n while (++tc <= T) {\n int N;\n cin >> N;\n cout << (int)sqrt(N) + (int)cbrt(N) - (int)sqrt((int)cbrt(N)) << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MOD = 1e9 + 7;\n const double pi = acos(-1);\n const double EPS = 1e-9;\n long long binpowmod(long long a, long long b) {\n a %= MOD;\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 % MOD;\n }\n long long gcd(long long a, long long b) {\n if (!b) return a;\n return gcd(b, a % b);\n }\n const int N = 1 << 18;\n const int E = N * 2;\n bool good(long long n) {\n long long t = n;\n int sumofdigits = 0;\n while (n) {\n sumofdigits += n % 10;\n n /= 10;\n }\n return (gcd(t, sumofdigits) > 1);\n }\n int n, m, ans;\n vector > a;\n bool good(int i, int j) {\n for (int k = 0; k < m; ++k) {\n if (a[i][k] != a[j][k]) return false;\n }\n return true;\n }\n void solveit(int l = 0, int r = n - 1, int c = 1) {\n int len = r - l + 1;\n if (len % 2) return;\n int i = l, j = r;\n while (i < j) {\n if (!good(i, j)) return;\n i++;\n j--;\n }\n ans = min(ans, n / (1 << c));\n int mid = (l + r) / 2;\n solveit(l, mid, c + 1);\n solveit(mid + 1, r, c + 1);\n }\n void solve() {\n cin >> n >> m;\n ans = n;\n a.assign(n, vector(m));\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < m; ++j) cin >> a[i][j];\n solveit();\n cout << 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 n, k;\n scanf( %d%d , &n, &k);\n long long ans1 = 1, ans2 = 1;\n for (int i = 1; i <= k - 1; i++) ans1 = ans1 * k % 1000000007;\n for (int i = 1; i <= n - k; i++) ans2 = ans2 * (n - k) % 1000000007;\n printf( %I64d\n , ans1 * ans2 % 1000000007);\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 long long ans1 = 1, ans2 = 1;\n for (int i = 1; i <= k - 1; i++) ans1 = ans1 * k % 1000000007;\n for (int i = 1; i <= n - k; i++) ans2 = ans2 * (n - k) % 1000000007;\n printf( extra\n , ans1 * ans2 % 1000000007);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 25, mod = 1e9 + 7;\n int a[N][N], used[N][N], cur, first, n, m, k;\n long long ans;\n int count(int x) {\n int ans = 0;\n for (; x; x -= x & -x) ans++;\n return ans;\n }\n void dfs(int x, int y) {\n if (x == n) {\n int p = count(cur & ~first), q = count(((1 << k) - 1) & ~first);\n long long curans = 1;\n while (p--) {\n curans = (curans * q) % mod;\n q--;\n }\n ans = (ans + curans) % mod;\n return;\n }\n int nx = x, ny = y + 1;\n if (ny == m) {\n nx++;\n ny = 0;\n }\n if (a[x][y]) {\n dfs(nx, ny);\n return;\n } else {\n bool flag = true;\n int can = (1 << k) - 1;\n can &= ~used[x][y];\n for (int i = 0; (1 << i) <= can; i++) {\n if (!((can >> i) & 1)) continue;\n bool preused[N][N], preusedcur;\n preusedcur = true;\n memset(preused, false, sizeof(preused));\n if (!((cur >> i) & 1)) {\n if (flag)\n flag = false;\n else\n continue;\n preusedcur = false;\n }\n cur |= 1 << i;\n for (int px = x; px < n; px++)\n for (int py = y; py < m; py++) {\n if ((used[px][py] >> i) & 1)\n preused[px][py] = true;\n else\n used[px][py] |= 1 << i;\n }\n dfs(nx, ny);\n if (!preusedcur) cur &= ~(1 << i);\n for (int px = x; px < n; px++)\n for (int py = y; py < m; py++) {\n if (!preused[px][py]) used[px][py] &= ~(1 << i);\n }\n }\n }\n }\n int main() {\n scanf( %d%d%d , &n, &m, &k);\n if (n + m - 1 > k) {\n printf( 0\n );\n return 0;\n }\n for (int i = 0; i < n; i++)\n for (int j = 0; j < m; j++) {\n scanf( %d , &a[i][j]);\n if (a[i][j]) {\n first |= 1 << a[i][j] - 1;\n if ((used[i][j] >> a[i][j] - 1) & 1) {\n printf( 0\n );\n return 0;\n }\n for (int r = 0; r < n; r++)\n for (int c = 0; c < m; c++) {\n if (r <= i && c <= j || r >= i && c >= j)\n used[r][c] |= 1 << a[i][j] - 1;\n }\n }\n }\n cur = first;\n dfs(0, 0);\n printf( %d\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int p1, p2, p3, p4, a, b;\n cin >> p1 >> p2 >> p3 >> p4 >> a >> b;\n int m = min(min(min(p1, p2), p3), p4);\n cout << max(0, min(b + 1, m) - a) << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n const int inf = (1 << 30) - 1;\n const double eps = 1e-9;\n using namespace std;\n int a[111111], n, k, mx = 0, aa;\n long long s[111111];\n int main() {\n scanf( %d%d , &n, &k);\n for (int i = 1; i <= n; i++) scanf( %d , &a[i]);\n sort(a + 1, a + n + 1);\n for (int i = 1; i <= n; i++) s[i] = s[i - 1] + a[i];\n for (int i = 1; i <= n; i++) {\n int l = 1, r = i;\n while (r > l) {\n int m = (l + r) / 2;\n long long ss = s[i] - s[m - 1];\n if (1ll * a[i] * (i - m + 1) - ss > k)\n l = m + 1;\n else\n r = m;\n }\n if (i - r + 1 > mx) {\n mx = i - r + 1;\n aa = a[i];\n }\n }\n cout << (mx) << ;\n cout << (aa) << endl;\n return 0;\n }\n "} @@ -849,7 +849,7 @@ {"func_code_string": "#include \n using namespace std;\n const long long maxn = 2e5 + 7;\n struct Node {\n long long x, y;\n } node[maxn];\n bool cmp(Node a, Node b) { return a.x < b.x; }\n long long n, k;\n long long len[maxn];\n int32_t main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n ;\n int t;\n cin >> t;\n while (t--) {\n cin >> n >> k;\n for (int i = 0; i < n; i++) cin >> node[i].x;\n for (int i = 0; i < n; i++) cin >> node[i].y;\n sort(node, node + n, cmp);\n long long tarl, tarr;\n for (tarr = tarl = 0; tarr < n; tarr++) {\n while (node[tarl].x < node[tarr].x - k) tarl++;\n len[tarr] = tarr - tarl + 1;\n }\n long long ans = 0, Max = 0;\n for (tarr = tarl = 0; tarr < n; tarr++) {\n while (node[tarl].x < node[tarr].x - k) {\n Max = max(Max, len[tarl]);\n tarl++;\n }\n ans = max(Max + len[tarr], ans);\n }\n cout << ans << endl;\n for (int i = 0; i < n; i++) len[i] = 0;\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n #pragma GCC target( avx2 )\n #pragma GCC optimization( unroll-loops )\n #pragma GCC optimize( O2 )\n constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};\n constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};\n constexpr long long INF = 1999999999999999997;\n constexpr int inf = INT_MAX;\n constexpr int MAXSIZE = int(1e6) + 5;\n constexpr auto PI = 3.14159265358979323846L;\n constexpr auto oo = numeric_limits::max() / 2 - 2;\n constexpr auto eps = 1e-6;\n constexpr auto mod = 1000000007;\n constexpr auto MOD = 1000000007;\n constexpr auto MOD9 = 1000000009;\n constexpr auto maxn = 100006;\n template \n int SIZE(const T (&t)[N]) {\n return N;\n }\n template \n int SIZE(const T &t) {\n return t.size();\n }\n string to_string(string s, int x1 = 0, int x2 = 1e9) {\n return ' ' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : ) + ' ';\n }\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 string({c}); }\n template \n string to_string(bitset &b, int x1 = 0, int x2 = 1e9) {\n string t = ;\n for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);\n __iii__ <= __jjj__; ++__iii__) {\n t += b[__iii__] + '0';\n }\n return ' ' + t + ' ';\n }\n template \n string to_string(A(&v), int x1 = 0, int x2 = 1e9, C... coords);\n int l_v_l_v_l = 0, t_a_b_s = 0;\n template \n string to_string(pair &p) {\n l_v_l_v_l++;\n string res = ( + to_string(p.first) + , + to_string(p.second) + ) ;\n l_v_l_v_l--;\n return res;\n }\n template \n string to_string(A(&v), int x1, int x2, C... coords) {\n int rnk = rank::value;\n string tab(t_a_b_s, ' ');\n string res = ;\n bool first = true;\n if (l_v_l_v_l == 0) res += '\n';\n res += tab + [ ;\n x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));\n auto l = begin(v);\n advance(l, x1);\n auto r = l;\n advance(r, (x2 - x1) + (x2 < SIZE(v)));\n for (auto e = l; e != r; e = next(e)) {\n if (!first) {\n res += , ;\n }\n first = false;\n l_v_l_v_l++;\n if (e != l) {\n if (rnk > 1) {\n res += '\n';\n t_a_b_s = l_v_l_v_l;\n };\n } else {\n t_a_b_s = 0;\n }\n res += to_string(*e, coords...);\n l_v_l_v_l--;\n }\n res += ] ;\n if (l_v_l_v_l == 0) res += '\n';\n return res;\n }\n void dbgs() { ; }\n template \n void dbgs(Heads H, Tails... T) {\n cout << to_string(H) << | ;\n dbgs(T...);\n }\n int main() {\n int n, d;\n cin >> n >> d;\n int m;\n cin >> m;\n while (m--) {\n int x, y;\n cin >> x >> y;\n if (x + y - d >= 0 && y + x - 2 * n + d <= 0 && y - x - d <= 0 &&\n x - y - d <= 0)\n cout << YES \n << \n ;\n else {\n cout << NO \n << \n ;\n }\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int mxN = 2e5 + 10;\n vector a[mxN];\n int main() {\n int n, k;\n cin >> n >> k;\n for (int i = 0; i < n; i++) {\n int cnt = 0, x;\n cin >> x;\n while (true) {\n a[x].push_back(cnt);\n if (!x) break;\n x >>= 1;\n cnt++;\n }\n }\n int ans = 1e9;\n for (int i = 0; i < mxN; i++) {\n if (a[i].size() >= k) {\n sort(a[i].begin(), a[i].end());\n int cnt = 0;\n for (int j = 0; j < k; j++) cnt += a[i][j];\n ans = min(ans, cnt);\n }\n }\n cout << ans << endl;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const long long inf = 1LL << 28;\n const long long mod = 1LL;\n vector adj[30];\n long long b_search(int val, int indx) {\n int lo, hi, mid;\n long long ans = 1e12;\n lo = 0;\n hi = (int)adj[indx].size() - 1;\n while (lo <= hi) {\n mid = (lo + hi) / 2;\n if (adj[indx][mid] == val) return 0;\n if (adj[indx][mid] < val)\n lo = mid + 1;\n else\n hi = mid - 1;\n ans = min(ans, (long long)abs(val - adj[indx][mid]));\n }\n return ans;\n }\n int main() {\n int n, k, i, j;\n long long l;\n string s, c;\n while (scanf( %d %d , &n, &k) == 2) {\n for (i = 0; i < 26; i++) adj[i].clear();\n cin >> s;\n for (i = 0; i < s.length(); i++) {\n adj[s[i] - 'a'].push_back(i);\n }\n while (n--) {\n l = 0;\n cin >> c;\n for (i = 0; i < c.length(); i++) {\n if ((int)adj[c[i] - 'a'].size() == 0)\n l += (int)c.size();\n else\n l += b_search(i, c[i] - 'a');\n }\n printf( %I64d\n , l);\n }\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const long long inf = 1LL << 28;\n const long long mod = 1LL;\n vector adj[30];\n long long b_search(int val, int indx) {\n int lo, hi, mid;\n long long ans = 1e12;\n lo = 0;\n hi = (int)adj[indx].size() - 1;\n while (lo <= hi) {\n mid = (lo + hi) / 2;\n if (adj[indx][mid] == val) return 0;\n if (adj[indx][mid] < val)\n lo = mid + 1;\n else\n hi = mid - 1;\n ans = min(ans, (long long)abs(val - adj[indx][mid]));\n }\n return ans;\n }\n int main() {\n int n, k, i, j;\n long long l;\n string s, c;\n while (scanf( %d %d , &n, &k) == 2) {\n for (i = 0; i < 26; i++) adj[i].clear();\n cin >> s;\n for (i = 0; i < s.length(); i++) {\n adj[s[i] - 'a'].push_back(i);\n }\n while (n--) {\n l = 0;\n cin >> c;\n for (i = 0; i < c.length(); i++) {\n if ((int)adj[c[i] - 'a'].size() == 0)\n l += (int)c.size();\n else\n l += b_search(i, c[i] - 'a');\n }\n printf( extra\n , l);\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 dp[200009][2], a, par[200009];\n priority_queue bg;\n priority_queue, greater > sm;\n void upd(long long type, long long x) {\n if (!type)\n sm.push(x);\n else\n bg.push(x);\n }\n long long tap(long long type) {\n if (!type) return sm.top();\n return bg.top();\n }\n int main() {\n memset(dp, -1, sizeof dp);\n scanf( %lld , &a);\n for (long long i = 1; i <= a; i++) {\n long long x;\n scanf( %lld , &x);\n par[i] = par[i - 1] + x;\n }\n long long ans = -100000000924052357;\n upd(0, -par[a]);\n upd(1, par[a]);\n for (long long i = a; i >= 3; i--) {\n dp[i][0] = tap(1);\n dp[i][1] = tap(0);\n upd(0, dp[i][0] - par[i - 1]);\n upd(1, dp[i][1] + par[i - 1]);\n umax(ans, dp[i][1] + par[i - 1]);\n }\n printf( %lld\n , max(ans, par[a]));\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long SZ = 1e5 + 4;\n const double EPS = 1e-7;\n const long long mod = 1e9 + 7;\n const long long hashpow = 2;\n const long long inf = 2e9;\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 long long n;\n void read() {\n cin >> n;\n --n;\n }\n void solve() {\n long long x = 1;\n long long m = n % 3;\n n /= 3;\n long long cnt = 0;\n while (n >= x) {\n n -= x;\n x *= 4;\n ++cnt;\n }\n long long a = 1;\n long long b = 2;\n long long c = 3;\n vector y;\n while (n) {\n y.push_back(n % 4);\n n /= 4;\n }\n while (y.size() < cnt) {\n y.push_back(0);\n }\n for (long long i = (long long)(y.size()) - 1; i >= 0; --i) {\n a *= 4;\n b *= 4;\n c *= 4;\n if (y[i] == 1) {\n a += 1;\n b += 2;\n c += 3;\n } else if (y[i] == 2) {\n a += 2;\n b += 3;\n c += 1;\n } else if (y[i] == 3) {\n a += 3;\n b += 1;\n c += 2;\n }\n }\n if (m == 0) {\n cout << a << \n ;\n } else if (m == 1) {\n cout << b << \n ;\n } else {\n cout << c << \n ;\n }\n }\n signed main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n long long t;\n cin >> t;\n for (long long i = 0; i < t; ++i) {\n read();\n solve();\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct segTree {\n long long* data;\n int n;\n segTree(int n) : n(n) { data = new long long[n * 2](); }\n void add(int i, long long v) {\n for (i += n; i; i >>= 1) data[i] += v;\n }\n int find(long long v) {\n int i = 1;\n while (i < n) {\n i *= 2;\n if (v >= data[i]) v -= data[i++];\n }\n return i - n;\n }\n long long sum(int i) {\n long long r = data[i + n];\n for (i += n; i > 1; i >>= 1) {\n if (i & 1) r += data[i - 1];\n }\n return r;\n }\n };\n segTree count_tree(1 << 17), sum_tree(1 << 17);\n long long x[100000], t[100000];\n vector> child[100000];\n map ti_map;\n int ti_list[100000];\n long long dp[100000], dp2[100000];\n void dfs(int p, long long T) {\n if (T <= 0) return;\n count_tree.add(ti_map[t[p]], x[p]);\n sum_tree.add(ti_map[t[p]], x[p] * t[p]);\n int i = sum_tree.find(T);\n dp[p] = count_tree.sum(i - 1);\n assert(sum_tree.sum(i - 1) <= T);\n assert(i >= 1e5 + 10 || sum_tree.sum(i) > T);\n if (i < 1e5 + 10) dp[p] += (T - sum_tree.sum(i - 1)) / ti_list[i];\n vector child_vals;\n for (auto e : child[p]) {\n dfs(e.first, T - e.second * 2);\n child_vals.push_back(dp2[e.first]);\n }\n sort(child_vals.rbegin(), child_vals.rend());\n dp2[p] = dp[p];\n if (child_vals.size() >= 2) dp2[p] = max(dp2[p], child_vals[1]);\n if (p == 0) dp2[p] = max(dp2[p], child_vals[0]);\n count_tree.add(ti_map[t[p]], -x[p]);\n sum_tree.add(ti_map[t[p]], -x[p] * t[p]);\n }\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n long long n, T;\n cin >> n >> T;\n for (int i = 0; i < n; i++) cin >> x[i];\n for (int i = 0; i < n; i++) {\n cin >> t[i];\n ti_map[t[i]];\n }\n int c = 1;\n for (auto& p : ti_map) {\n ti_list[c] = p.first;\n p.second = c++;\n }\n for (int i = 1; i < n; i++) {\n long long p, l;\n cin >> p >> l;\n child[p - 1].push_back({i, l});\n }\n dfs(0, T);\n cout << dp2[0] << endl;\n }\n "} @@ -888,8 +888,8 @@ {"func_code_string": "#include \n using namespace std;\n int n, m, k, i, dis = 10000000, temp, a[1000];\n int main() {\n cin >> n >> m >> k;\n for (i = 0; i < n; ++i) cin >> a[i];\n for (i = 0; i < n; ++i) {\n if (a[i] != 0 && a[i] <= k) {\n if (m <= i)\n temp = (i - m + 1) * 10;\n else\n temp = (m - i - 1) * 10;\n if (dis > temp) dis = temp;\n }\n }\n cout << dis;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long k, m = 9, x;\n long long r = 1, n, j, d = 0;\n cin >> k;\n while (k - m * r > 0) {\n k -= m * r;\n ++r;\n m = m * 10;\n }\n n = (k - 1) / r;\n j = (k - 1) % r;\n x = pow(10, r - 1) + n;\n for (long i = 0; i < r - j - 1; ++i) x /= 10;\n d = x % 10;\n cout << d << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, count1 = 0, count2 = 0, sum = 0;\n scanf( %d , &n);\n vector > v1;\n vector > v2;\n for (int i = 0; i < n; i++) {\n int x, a;\n scanf( %d %d , &x, &a);\n if (x < 0) {\n v1.push_back(make_pair(x, a));\n count1++;\n } else {\n v2.push_back(make_pair(x, a));\n count2++;\n }\n }\n sort(v1.begin(), v1.end());\n reverse(v1.begin(), v1.end());\n sort(v2.begin(), v2.end());\n vector >::iterator it1 = v1.begin();\n vector >::iterator it2 = v2.begin();\n vector >::iterator it3 = v1.end();\n vector >::iterator it4 = v2.end();\n if (count1 > count2) {\n while (it1 != v1.end()) {\n sum += it1->second;\n it1++;\n if (it2 != v2.end()) {\n sum += it2->second;\n it2++;\n } else\n break;\n }\n } else if (count1 < count2) {\n while (it2 != v2.end()) {\n sum += it2->second;\n it2++;\n if (it1 != v1.end()) {\n sum += it1->second;\n it1++;\n } else\n break;\n }\n } else if (count1 == count2) {\n if ((it3->second) > (it4->second)) {\n while (it1 != v1.end()) {\n sum += it1->second;\n it1++;\n sum += it2->second;\n it2++;\n }\n } else {\n while (it2 != v2.end()) {\n sum += it2->second;\n it2++;\n sum += it1->second;\n it1++;\n }\n }\n }\n printf( %d\n , sum);\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 while (c < '0' || c > '9') {\n if (c == '-') f = -1;\n c = getchar();\n }\n while (c >= '0' && c <= '9') {\n x = (x << 3) + (x << 1) + c - '0';\n c = getchar();\n }\n return x * f;\n }\n const int MAX_N = 1e3 + 10;\n int H[MAX_N][MAX_N], CM[MAX_N][MAX_N], TM[MAX_N][MAX_N], N, M, A, B, SUM = 0;\n long long S[MAX_N][MAX_N];\n bool vis[MAX_N][MAX_N];\n vector > > V, Ans;\n struct MY_QUEUE {\n deque > Q;\n inline void reset() { Q.clear(); }\n inline void push(int val, int mark) {\n pair now = make_pair(val, mark);\n while (Q.size() && Q.back().first > val) Q.pop_back();\n Q.push_back(make_pair(val, mark));\n }\n inline void pop(int mark) {\n if (Q.front().second == mark) Q.pop_front();\n }\n inline int get() { return Q.front().first; }\n };\n inline bool check_X(int x) { return x >= 0 && x < N; }\n inline bool check_Y(int y) { return y >= 0 && y < M; }\n signed main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n N = read();\n M = read();\n A = read();\n B = read();\n for (int i = 0; i < N; i++)\n for (int j = 0; j < M; j++) H[i][j] = read();\n for (int i = 0; i < M; i++) {\n MY_QUEUE QUEUE;\n for (int j = 0; j < N; j++) {\n QUEUE.push(H[j][i], j);\n if (j >= A) QUEUE.pop(j - A);\n if (j >= A - 1) CM[j - A + 1][i] = QUEUE.get();\n }\n }\n for (int i = 0; i < N; i++) {\n MY_QUEUE QUEUE;\n for (int j = 0; j < M; j++) {\n QUEUE.push(CM[i][j], j);\n if (j >= B) QUEUE.pop(j - B);\n if (j >= B - 1) TM[i][j - B + 1] = QUEUE.get();\n }\n }\n for (int i = 1; i <= N; i++)\n for (int j = 1; j <= M; j++)\n S[i][j] = (long long)S[i][j] + S[i][j - 1] + H[i - 1][j - 1];\n for (int i = 1; i <= M; i++)\n for (int j = 1; j <= N; j++) S[j][i] = (long long)S[j][i] + S[j - 1][i];\n for (int i = 0; i <= N - A; i++)\n for (int j = 0; j <= M - B; j++) {\n long long sum = (long long)S[i + A][j + B] - S[i + A][j] - S[i][j + B] +\n S[i][j],\n dec = (long long)TM[i][j] * A * B;\n V.push_back(make_pair(sum - dec, make_pair(i, j)));\n }\n sort(V.begin(), V.end());\n for (int i = 0; i < V.size(); i++) {\n long long val = V[i].first;\n int X = V[i].second.first, Y = V[i].second.second;\n if (vis[X][Y]) continue;\n SUM++;\n Ans.push_back(make_pair(val, make_pair(X + 1, Y + 1)));\n for (int i = X - A + 1; i <= X + A - 1; i++)\n for (int j = Y - B + 1; j <= Y + B - 1; j++)\n if (check_X(i) && check_Y(j)) vis[i][j] = 1;\n }\n printf( %d\n , SUM);\n for (int i = 0; i < Ans.size(); i++)\n printf( %d %d %I64d\n , Ans[i].second.first, Ans[i].second.second,\n Ans[i].first);\n return 0;\n }\n "} -{"func_code_string": "#include \n #pragma comment(linker, /STACK:1024000000,1024000000 )\n using namespace std;\n const int maxm = 100005 * 2;\n const int maxn = 100005;\n const int mod = 1000000007;\n struct Edge {\n int v, next;\n } E[maxm];\n struct sw {\n int v, next;\n } EE[maxm];\n int head[maxn], ind;\n int headd[maxn], indd;\n int dfs[maxn], low[maxn], clo;\n int bri, cou, S[maxn], hi;\n int n, m;\n int f[maxn], have[maxn];\n void add(int u, int v) {\n E[ind].v = v, E[ind].next = head[u], head[u] = ind++;\n E[ind].v = u, E[ind].next = head[v], head[v] = ind++;\n }\n void add1(int u, int v) {\n EE[indd].v = v, EE[indd].next = headd[u], headd[u] = indd++;\n EE[indd].v = u, EE[indd].next = headd[v], headd[v] = indd++;\n }\n void init() {\n memset(head, -1, sizeof(head));\n memset(headd, -1, sizeof(headd));\n memset(dfs, -1, sizeof(dfs));\n memset(low, -1, sizeof(low));\n clo = ind = indd = 0;\n }\n vector vvv[maxn];\n void tarjan(int u, int id) {\n dfs[u] = low[u] = clo++;\n S[hi++] = u;\n for (int i = head[u]; ~i; i = E[i].next) {\n if (i == (id ^ 1)) continue;\n int v = E[i].v;\n if (dfs[v] == -1) {\n tarjan(v, i);\n low[u] = min(low[u], low[v]);\n if (dfs[u] < low[v]) {\n bri++;\n vvv[u].push_back(v);\n }\n } else\n low[u] = min(low[u], dfs[v]);\n }\n if (dfs[u] == low[u]) {\n int v;\n do {\n v = S[--hi];\n f[v] = u;\n for (int j = 0; j < vvv[v].size(); j++) {\n int pa = f[vvv[v][j]];\n add1(u, pa);\n }\n have[u]++;\n } while (u != v);\n }\n }\n void work() {\n hi = 0;\n for (int i = 1; i <= n; i++)\n if (dfs[i] == -1) {\n tarjan(i, -1);\n }\n }\n int ff[maxn][18], lev;\n int dep[maxn];\n long long dis[maxn];\n int LCA(int x, int y) {\n if (dep[x] > dep[y]) x = x ^ y, y = x ^ y, x = x ^ y;\n for (int i = lev; i >= 0; i--)\n if (dep[y] - dep[x] >> i & 1) y = ff[y][i];\n if (x == y) return x;\n for (int i = lev; i >= 0; i--)\n if (ff[x][i] != ff[y][i]) x = ff[x][i], y = ff[y][i];\n return ff[x][0];\n }\n void done(int u, int p) {\n dep[u] = dep[p] + 1;\n if (have[u] > 1)\n dis[u] = dis[p] * 2 % mod;\n else\n dis[u] = dis[p];\n ff[u][0] = p;\n int v;\n for (int i = headd[u]; ~i; i = EE[i].next) {\n v = EE[i].v;\n if (v != p) {\n done(v, u);\n }\n }\n }\n void initLca() {\n dis[0] = 1;\n done(1, 0);\n lev = 1;\n for (; (1 << lev) <= n; lev++)\n for (int i = 0; i <= n; i++)\n if (f[i] == i) ff[i][lev] = ff[ff[i][lev - 1]][lev - 1];\n lev--;\n }\n long long extend_gcd(long long a, long long b, long long &x, long long &y) {\n if (b == 0) {\n x = 1, y = 0;\n return a;\n }\n long long gcd = extend_gcd(b, a % b, x, y);\n long long t = x;\n x = y;\n y = t - a / b * x;\n return gcd;\n }\n long long Get_Inverse(long long num) {\n long long x, y;\n extend_gcd(num, 1000000007, x, y);\n return (x % 1000000007 + 1000000007) % 1000000007;\n }\n int main(void) {\n while (~scanf( %d%d , &n, &m)) {\n init();\n while (m--) {\n int u, v;\n scanf( %d%d , &u, &v);\n add(u, v);\n }\n work();\n initLca();\n int k, a, b, fa, fb, pa;\n scanf( %d , &k);\n for (int i = 0; i < k; i++) {\n scanf( %d%d , &a, &b);\n fa = f[a];\n fb = f[b];\n long long ans = dis[fa] * dis[fb] % mod;\n pa = LCA(fa, fb);\n int need = (have[pa] > 1 ? 2 : 1);\n ans = ans * Get_Inverse(dis[pa]) % mod;\n ans = ans * (Get_Inverse(dis[pa] * Get_Inverse(need) % mod)) % mod;\n printf( %I64d\n , ans);\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 while (c < '0' || c > '9') {\n if (c == '-') f = -1;\n c = getchar();\n }\n while (c >= '0' && c <= '9') {\n x = (x << 3) + (x << 1) + c - '0';\n c = getchar();\n }\n return x * f;\n }\n const int MAX_N = 1e3 + 10;\n int H[MAX_N][MAX_N], CM[MAX_N][MAX_N], TM[MAX_N][MAX_N], N, M, A, B, SUM = 0;\n long long S[MAX_N][MAX_N];\n bool vis[MAX_N][MAX_N];\n vector > > V, Ans;\n struct MY_QUEUE {\n deque > Q;\n inline void reset() { Q.clear(); }\n inline void push(int val, int mark) {\n pair now = make_pair(val, mark);\n while (Q.size() && Q.back().first > val) Q.pop_back();\n Q.push_back(make_pair(val, mark));\n }\n inline void pop(int mark) {\n if (Q.front().second == mark) Q.pop_front();\n }\n inline int get() { return Q.front().first; }\n };\n inline bool check_X(int x) { return x >= 0 && x < N; }\n inline bool check_Y(int y) { return y >= 0 && y < M; }\n signed main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n N = read();\n M = read();\n A = read();\n B = read();\n for (int i = 0; i < N; i++)\n for (int j = 0; j < M; j++) H[i][j] = read();\n for (int i = 0; i < M; i++) {\n MY_QUEUE QUEUE;\n for (int j = 0; j < N; j++) {\n QUEUE.push(H[j][i], j);\n if (j >= A) QUEUE.pop(j - A);\n if (j >= A - 1) CM[j - A + 1][i] = QUEUE.get();\n }\n }\n for (int i = 0; i < N; i++) {\n MY_QUEUE QUEUE;\n for (int j = 0; j < M; j++) {\n QUEUE.push(CM[i][j], j);\n if (j >= B) QUEUE.pop(j - B);\n if (j >= B - 1) TM[i][j - B + 1] = QUEUE.get();\n }\n }\n for (int i = 1; i <= N; i++)\n for (int j = 1; j <= M; j++)\n S[i][j] = (long long)S[i][j] + S[i][j - 1] + H[i - 1][j - 1];\n for (int i = 1; i <= M; i++)\n for (int j = 1; j <= N; j++) S[j][i] = (long long)S[j][i] + S[j - 1][i];\n for (int i = 0; i <= N - A; i++)\n for (int j = 0; j <= M - B; j++) {\n long long sum = (long long)S[i + A][j + B] - S[i + A][j] - S[i][j + B] +\n S[i][j],\n dec = (long long)TM[i][j] * A * B;\n V.push_back(make_pair(sum - dec, make_pair(i, j)));\n }\n sort(V.begin(), V.end());\n for (int i = 0; i < V.size(); i++) {\n long long val = V[i].first;\n int X = V[i].second.first, Y = V[i].second.second;\n if (vis[X][Y]) continue;\n SUM++;\n Ans.push_back(make_pair(val, make_pair(X + 1, Y + 1)));\n for (int i = X - A + 1; i <= X + A - 1; i++)\n for (int j = Y - B + 1; j <= Y + B - 1; j++)\n if (check_X(i) && check_Y(j)) vis[i][j] = 1;\n }\n printf( %d\n , SUM);\n for (int i = 0; i < Ans.size(); i++)\n printf( %d %d extra\n , Ans[i].second.first, Ans[i].second.second,\n Ans[i].first);\n return 0;\n }\n "} +{"func_code_string": "#include \n #pragma comment(linker, /STACK:1024000000,1024000000 )\n using namespace std;\n const int maxm = 100005 * 2;\n const int maxn = 100005;\n const int mod = 1000000007;\n struct Edge {\n int v, next;\n } E[maxm];\n struct sw {\n int v, next;\n } EE[maxm];\n int head[maxn], ind;\n int headd[maxn], indd;\n int dfs[maxn], low[maxn], clo;\n int bri, cou, S[maxn], hi;\n int n, m;\n int f[maxn], have[maxn];\n void add(int u, int v) {\n E[ind].v = v, E[ind].next = head[u], head[u] = ind++;\n E[ind].v = u, E[ind].next = head[v], head[v] = ind++;\n }\n void add1(int u, int v) {\n EE[indd].v = v, EE[indd].next = headd[u], headd[u] = indd++;\n EE[indd].v = u, EE[indd].next = headd[v], headd[v] = indd++;\n }\n void init() {\n memset(head, -1, sizeof(head));\n memset(headd, -1, sizeof(headd));\n memset(dfs, -1, sizeof(dfs));\n memset(low, -1, sizeof(low));\n clo = ind = indd = 0;\n }\n vector vvv[maxn];\n void tarjan(int u, int id) {\n dfs[u] = low[u] = clo++;\n S[hi++] = u;\n for (int i = head[u]; ~i; i = E[i].next) {\n if (i == (id ^ 1)) continue;\n int v = E[i].v;\n if (dfs[v] == -1) {\n tarjan(v, i);\n low[u] = min(low[u], low[v]);\n if (dfs[u] < low[v]) {\n bri++;\n vvv[u].push_back(v);\n }\n } else\n low[u] = min(low[u], dfs[v]);\n }\n if (dfs[u] == low[u]) {\n int v;\n do {\n v = S[--hi];\n f[v] = u;\n for (int j = 0; j < vvv[v].size(); j++) {\n int pa = f[vvv[v][j]];\n add1(u, pa);\n }\n have[u]++;\n } while (u != v);\n }\n }\n void work() {\n hi = 0;\n for (int i = 1; i <= n; i++)\n if (dfs[i] == -1) {\n tarjan(i, -1);\n }\n }\n int ff[maxn][18], lev;\n int dep[maxn];\n long long dis[maxn];\n int LCA(int x, int y) {\n if (dep[x] > dep[y]) x = x ^ y, y = x ^ y, x = x ^ y;\n for (int i = lev; i >= 0; i--)\n if (dep[y] - dep[x] >> i & 1) y = ff[y][i];\n if (x == y) return x;\n for (int i = lev; i >= 0; i--)\n if (ff[x][i] != ff[y][i]) x = ff[x][i], y = ff[y][i];\n return ff[x][0];\n }\n void done(int u, int p) {\n dep[u] = dep[p] + 1;\n if (have[u] > 1)\n dis[u] = dis[p] * 2 % mod;\n else\n dis[u] = dis[p];\n ff[u][0] = p;\n int v;\n for (int i = headd[u]; ~i; i = EE[i].next) {\n v = EE[i].v;\n if (v != p) {\n done(v, u);\n }\n }\n }\n void initLca() {\n dis[0] = 1;\n done(1, 0);\n lev = 1;\n for (; (1 << lev) <= n; lev++)\n for (int i = 0; i <= n; i++)\n if (f[i] == i) ff[i][lev] = ff[ff[i][lev - 1]][lev - 1];\n lev--;\n }\n long long extend_gcd(long long a, long long b, long long &x, long long &y) {\n if (b == 0) {\n x = 1, y = 0;\n return a;\n }\n long long gcd = extend_gcd(b, a % b, x, y);\n long long t = x;\n x = y;\n y = t - a / b * x;\n return gcd;\n }\n long long Get_Inverse(long long num) {\n long long x, y;\n extend_gcd(num, 1000000007, x, y);\n return (x % 1000000007 + 1000000007) % 1000000007;\n }\n int main(void) {\n while (~scanf( %d%d , &n, &m)) {\n init();\n while (m--) {\n int u, v;\n scanf( %d%d , &u, &v);\n add(u, v);\n }\n work();\n initLca();\n int k, a, b, fa, fb, pa;\n scanf( %d , &k);\n for (int i = 0; i < k; i++) {\n scanf( %d%d , &a, &b);\n fa = f[a];\n fb = f[b];\n long long ans = dis[fa] * dis[fb] % mod;\n pa = LCA(fa, fb);\n int need = (have[pa] > 1 ? 2 : 1);\n ans = ans * Get_Inverse(dis[pa]) % mod;\n ans = ans * (Get_Inverse(dis[pa] * Get_Inverse(need) % mod)) % mod;\n printf( extra\n , ans);\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int x, a, b, i, j, k, siz, cnt = 0, p, q, s, t, z, h, po;\n string str;\n cin >> str;\n cin >> x;\n siz = str.size();\n for (i = 0; i < siz; i++) {\n if (str[i] != '*' && str[i] != '?') cnt++;\n }\n p = siz - cnt;\n q = cnt - p;\n if (x < q)\n cout << Impossible << endl;\n else if (x >= q && x <= cnt) {\n s = 0;\n t = cnt - x;\n for (i = 0; i < siz; i++) {\n if (s < t && (str[i + 1] == '?' || str[i + 1] == '*')) {\n s++;\n } else {\n if (str[i] >= 'a' && str[i] <= 'z') cout << str[i];\n }\n }\n } else {\n z = x - cnt;\n h = 0;\n for (i = 0; i < siz; i++) {\n if (str[i] == '*') {\n h++;\n po = i;\n break;\n }\n }\n if (h == 0)\n cout << Impossible << endl;\n else {\n for (i = 0; i < siz; i++) {\n if (i == po) {\n for (j = 1; j <= z; j++) {\n cout << str[i - 1];\n }\n } else {\n if (str[i] >= 'a' && str[i] <= 'z') {\n cout << str[i];\n }\n }\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,abm,mmx,tune=native )\n using namespace std;\n long long gcd(long long i, long long j) {\n if (j == 0)\n return i;\n else\n return gcd(j, i % j);\n }\n template \n inline T getint() {\n T val = 0;\n char c;\n bool neg = false;\n while ((c = getchar()) && !(c >= '0' && c <= '9')) {\n neg |= c == '-';\n }\n do {\n val = (val * 10) + c - '0';\n } while ((c = getchar()) && (c >= '0' && c <= '9'));\n return val * (neg ? -1 : 1);\n }\n const long long INF = 1e9 + 100;\n const int mod = 1000000007;\n const long double eps = 1e-10, pi = acosl(-1);\n const long long maxN = 300010, maxT = 10010, A = 179, mid = 150;\n mt19937 mt_rand(time(0));\n long long bp(long long et, long long b) {\n b %= mod - 1;\n long long res = 1;\n for (int i = 30; i >= 0; --i) {\n res = (res * res) % mod;\n if ((b & (1 << i)) != 0) res = (res * et) % mod;\n }\n return res;\n }\n void panic() {\n cout << -1\n ;\n exit(0);\n }\n const int byben_size = 23;\n vector merge(const vector& a, const vector& b,\n bool want_mx = true) {\n int s1 = a.size(), s2 = b.size();\n int sz = min(s1 + s2, byben_size);\n vector r(sz);\n if (!want_mx) {\n int y1 = 0, y2 = 0;\n int y = 0;\n while (y < sz && y1 < s1 && y2 < s2) {\n if (a[y1] < b[y2])\n r[y++] = a[y1++];\n else\n r[y++] = b[y2++];\n }\n while (y < sz && y1 < s1) r[y++] = a[y1++];\n while (y < sz && y2 < s2) r[y++] = b[y2++];\n } else {\n int y1 = s1 - 1, y2 = s2 - 1;\n int y = sz - 1;\n while (y >= 0 && y1 >= 0 && y2 >= 0) {\n if (a[y1] > b[y2])\n r[y--] = a[y1--];\n else\n r[y--] = b[y2--];\n }\n while (y >= 0 && y1 >= 0) r[y--] = a[y1--];\n while (y >= 0 && y2 >= 0) r[y--] = b[y2--];\n }\n return r;\n }\n vector t[1 << 18];\n int sz = 1 << 17;\n int a[maxN];\n vector l1[maxN], r1[maxN];\n inline void add(int l, int r, int id, bool want_mx) {\n for (l += sz, r += sz; l <= r; l >>= 1, r >>= 1) {\n if (l & 1) {\n int v = l++;\n t[v].push_back(id);\n int szz = t[v].size();\n int rr = szz;\n --szz;\n while (szz > 0 && t[v][szz] < t[v][szz - 1]) {\n swap(t[v][szz], t[v][szz - 1]);\n --szz;\n }\n if (rr > byben_size) {\n if (want_mx)\n t[v].erase(t[v].begin());\n else\n t[v].pop_back();\n }\n }\n if (~r & 1) {\n int v = r--;\n t[v].push_back(id);\n int szz = t[v].size();\n int rr = szz;\n --szz;\n while (szz > 0 && t[v][szz] < t[v][szz - 1]) {\n swap(t[v][szz], t[v][szz - 1]);\n --szz;\n }\n if (rr > byben_size) {\n if (want_mx)\n t[v].erase(t[v].begin());\n else\n t[v].pop_back();\n }\n }\n }\n }\n vector get(int v, bool want_mx) {\n vector r;\n v |= sz;\n for (v = v | sz; v; v >>= 1) {\n r = merge(t[v], r, want_mx);\n }\n return r;\n }\n long double pw[maxT];\n void solve() {\n pw[0] = 1;\n for (int i = 1; i < maxT; ++i) pw[i] = pw[i - 1] * 2;\n int n = getint();\n for (int i = 1; i <= n; ++i) {\n a[i] = getint();\n }\n add(0, sz - 1, 0, 1);\n for (int i = 1; i <= n; ++i) {\n add(0, a[i], i, 1);\n l1[i] = get(a[i], 1);\n }\n for (int i = 0; i < 2 * sz; ++i) t[i].clear();\n add(0, sz - 1, n + 1, 0);\n for (int i = n; i > 0; --i) {\n add(0, a[i], i, 0);\n r1[i] = merge({i}, get(a[i] + 1, 0), 0);\n }\n long double ans = 0;\n for (int i = 1; i <= n; ++i) {\n for (int j = 1; j < l1[i].size(); ++j) {\n for (int k = 0; k + 1 < r1[i].size(); ++k) {\n long long cnt =\n (long long)(l1[i][j] - l1[i][j - 1]) * (r1[i][k + 1] - r1[i][k]);\n int pww = k + l1[i].size() - j;\n if (pww > byben_size) break;\n ans += (long double)cnt / pw[pww] * a[i];\n }\n }\n }\n cout << fixed << ans / n / n << \n ;\n }\n int32_t main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n cout.precision(20);\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 max_n = 303333, inf = 1000111222;\n int n, x, y;\n pair a[max_n];\n void wa() {\n printf( No\n );\n exit(0);\n }\n int main() {\n scanf( %d%d%d , &n, &x, &y);\n for (int i = 0; i < n; ++i) {\n scanf( %d , &a[i].first);\n a[i].second = i + 1;\n }\n sort(a, a + n);\n int last = -1;\n for (int i = n - 1; i >= 0; --i) {\n if (1LL * a[i].first * (n - i) >= y) {\n last = i;\n break;\n }\n }\n if (last == -1) {\n wa();\n }\n for (int i = 0; i < n; ++i) {\n int need = (x + a[i].first - 1) / a[i].first;\n if (i + need <= last) {\n printf( Yes\n );\n printf( %d %d\n , need, n - last);\n for (int j = i; j < i + need; ++j) {\n printf( %d , a[j].second);\n }\n printf( \n );\n for (int j = last; j < n; ++j) {\n printf( %d , a[j].second);\n }\n printf( \n );\n return 0;\n }\n }\n swap(x, y);\n last = -1;\n for (int i = n - 1; i >= 0; --i) {\n if (1LL * a[i].first * (n - i) >= y) {\n last = i;\n break;\n }\n }\n if (last == -1) {\n wa();\n }\n for (int i = 0; i < n; ++i) {\n int need = (x + a[i].first - 1) / a[i].first;\n if (i + need <= last) {\n printf( Yes\n );\n printf( %d %d\n , n - last, need);\n for (int j = last; j < n; ++j) {\n printf( %d , a[j].second);\n }\n printf( \n );\n for (int j = i; j < i + need; ++j) {\n printf( %d , a[j].second);\n }\n printf( \n );\n return 0;\n }\n }\n wa();\n return 0;\n }\n "} @@ -904,7 +904,7 @@ {"func_code_string": "#include \n using namespace std;\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 int arr[2000];\n int n, b, ans;\n scanf( %d%d , &n, &b);\n for (int i = 0; i < n;) scanf( %d , arr + i++);\n ans = b;\n for (int i = 0; i < n; ++i)\n for (int j = i + 1; j < n; ++j)\n remax(ans, arr[j] * (b / arr[i]) + b % arr[i]);\n printf( %d\n , ans);\n }\n int main() {\n run();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long exgcd(long long a, long long b, long long &x, long long &y) {\n if (b == 0) {\n x = 1, y = 0;\n return a;\n }\n long long g = exgcd(b, a % b, x, y);\n long long t;\n t = x, x = y, y = t - (a / b) * y;\n return g;\n }\n int main() {\n long long a, b, c, x, y;\n cin >> a >> b >> c;\n long long t = exgcd(a, b, x, y);\n if (c % t == 0)\n printf( %lld %lld\n , -x * c / t, -y * c / t);\n else\n printf( -1\n );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MOD = 1e9 + 7;\n const int N = 1010;\n int dp[N][N][2];\n int bits[N];\n int t, k;\n long long dfs(int len, int pos, int num, bool mark) {\n int maxx;\n long long sum;\n if (!len) {\n if (num == 1) {\n return true;\n } else {\n return false;\n }\n }\n if (!mark && dp[len][pos][num] != -1) {\n return dp[len][pos][num];\n }\n if (mark) {\n maxx = bits[len];\n } else {\n maxx = 9;\n }\n sum = 0;\n for (int i = 0; i <= maxx; i++) {\n if (i == 4 || i == 7) {\n sum +=\n dfs(len - 1, len, (pos && pos - len <= k) | num, mark && i == maxx);\n } else {\n sum += dfs(len - 1, pos, num, mark && i == maxx);\n }\n }\n sum %= MOD;\n if (!mark) {\n dp[len][pos][num] = sum;\n }\n return sum;\n }\n long long f(string s) {\n int len;\n len = 0;\n for (int i = s.size() - 1; i >= 0; i--) {\n len++;\n bits[len] = s[i] - '0';\n }\n return dfs(len, 0, 0, 1);\n }\n bool check(string &s) {\n int p;\n p = 0;\n for (int i = 1; i <= s.size(); i++) {\n if (s[i - 1] == '4' || s[i - 1] == '7') {\n if (!p || i - p > k) {\n p = i;\n } else if (i - p <= k) {\n return true;\n }\n }\n }\n return false;\n }\n int main() {\n string l, r;\n long long ans;\n while (scanf( %d%d , &t, &k) == 2) {\n memset(dp, -1, sizeof(dp));\n for (int i = 0; i < t; i++) {\n cin >> l >> r;\n ans = f(r) - f(l) + (check(l) ? 1 : 0);\n printf( %lld\n , (ans % MOD + MOD) % MOD);\n }\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int vis[200005][3], n;\n long long dp[200005][3], a[200005];\n long long dfs(int x, int s) {\n if (dp[x][s]) return dp[x][s];\n if (vis[x][s]) return -1;\n vis[x][s] = 1;\n int k;\n if (s)\n k = x + a[x];\n else\n k = x - a[x];\n if (k <= 0 || k > n)\n dp[x][s] += a[x];\n else {\n dp[x][s] = dfs(k, s ^ 1);\n if (dp[x][s] != -1) dp[x][s] += a[x];\n }\n return dp[x][s];\n }\n int main() {\n while (scanf( %d , &n) != EOF) {\n memset(vis, 0, sizeof(vis));\n memset(dp, 0, sizeof(dp));\n for (int i = 2; i <= n; i++) scanf( %I64d , &a[i]);\n for (int i = 2; i <= n; i++) dfs(i, 0);\n for (int i = 1; i < n; i++) {\n if (dp[i + 1][0] == -1)\n printf( -1\n );\n else\n printf( %I64d\n , i + dp[i + 1][0]);\n }\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int vis[200005][3], n;\n long long dp[200005][3], a[200005];\n long long dfs(int x, int s) {\n if (dp[x][s]) return dp[x][s];\n if (vis[x][s]) return -1;\n vis[x][s] = 1;\n int k;\n if (s)\n k = x + a[x];\n else\n k = x - a[x];\n if (k <= 0 || k > n)\n dp[x][s] += a[x];\n else {\n dp[x][s] = dfs(k, s ^ 1);\n if (dp[x][s] != -1) dp[x][s] += a[x];\n }\n return dp[x][s];\n }\n int main() {\n while (scanf( %d , &n) != EOF) {\n memset(vis, 0, sizeof(vis));\n memset(dp, 0, sizeof(dp));\n for (int i = 2; i <= n; i++) scanf( extra , &a[i]);\n for (int i = 2; i <= n; i++) dfs(i, 0);\n for (int i = 1; i < n; i++) {\n if (dp[i + 1][0] == -1)\n printf( -1\n );\n else\n printf( extra\n , i + dp[i + 1][0]);\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n double PI = acos(-1.0);\n long long mod = 998244353;\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 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 prod(long long a, long long b) {\n long long res = 0;\n a %= mod;\n while (b) {\n if (b & 1ll) res = (res + a) % mod;\n a = (2ll * a) % mod;\n b >>= 1ll;\n }\n return res;\n }\n long long power(long long a, long long b) {\n long long res = 1ll;\n while (b > 0) {\n if (b % 2ll) res = (res * a) % mod;\n a = (a * a) % mod;\n b /= 2ll;\n }\n return res;\n }\n long long binaryExponentiation(long long a, long long b) {\n long long result = 1ll;\n while (b > 0) {\n if (b % 2 == 1) result = (result * a) % mod;\n a = (a * a) % mod;\n b /= 2ll;\n }\n return result;\n }\n long long ModularInverse(long long a) {\n return binaryExponentiation(a, mod - 2);\n }\n long long n, m;\n void solve() {\n cin >> n;\n vector a(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 if (a[i] >= 0) {\n a[i] = -a[i] - 1;\n }\n }\n long long x = INT_MAX, p = 0;\n for (long long i = 0; i < n; i++) {\n if (a[i] < x) {\n x = a[i];\n p = i;\n }\n }\n if (n % 2) {\n a[p] = -a[p] - 1;\n }\n for (auto &e : a) {\n cout << e << ;\n }\n cout << \n ;\n }\n signed main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n long long t = 1;\n while (t--) {\n solve();\n }\n }\n "} {"func_code_string": "#include \n #define inp_out_work ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);\n #define testCase int T; cin>>T; while(T--)\n #define debug(P) cout<<#P<<' '<>n;\n string s;\n cin>>s;\n \n bool poss = true;\n \n int t = 0;\n \n for(char x : s) {\n if(x == 'T')++t;\n }\n \n if(2*(n-t) != t) {\n poss = false;\n }\n \n t = 0;\n \n for(int i = 0; i < n; ++i) {\n if(s[i] == 'T') ++t;\n else {\n --t;\n if(t < 0) {\n poss = false;\n break;\n }\n }\n }\n \n t = 0;\n \n for(int i = n-1; i >= 0; --i) {\n if(s[i] == 'T') ++t;\n else {\n --t;\n if(t < 0) {\n poss = false;\n break;\n }\n }\n }\n \n if(poss) {\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 int n;\n cin >> n;\n if (n % 2 == 0)\n cout << (n * n) / 2 << endl;\n else\n cout << (n / 2) * (n / 2) + (n / 2 + 1) * (n / 2 + 1) << endl;\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= n; j++)\n if ((i + j) % 2 == 0)\n cout << C ;\n else\n cout << . ;\n cout << endl;\n }\n }\n "} @@ -953,7 +953,7 @@ {"func_code_string": "#include \n using namespace std;\n template \n inline T S(T a) {\n return a * a;\n }\n template \n inline string tostring(T a) {\n ostringstream os( );\n os << a;\n return os.str();\n }\n template \n inline long long tolong(T a) {\n long long res;\n istringstream os(a);\n os >> res;\n return res;\n }\n template \n inline T gcd(T a, T b) {\n if (b == 0)\n return a;\n else\n return gcd(b, a % b);\n }\n template \n inline T bigmod(T a, T b, T m) {\n if (b == 0)\n return 1;\n else if (b % 2 == 0)\n return S(bigmod(a, b / 2, m)) % m;\n else\n return (a % m * bigmod(a, b - 1, m)) % m;\n }\n const int inf = (int)1e9 + 5;\n const long long linf = (long long)1e16 + 5;\n const long long modd = (long long)1e9 + 7;\n const int mod = 10000007;\n void pr(int f) {\n if (f == 1)\n cout << YES\n ;\n else\n cout << NO\n ;\n }\n bool isprime(long long n) {\n if (n < 2) return 0;\n if (n == 2)\n return 1;\n else {\n for (int i = 2; i * i <= n; i++)\n if (n % i == 0) return 0;\n }\n return 1;\n }\n map mp;\n multiset::iterator it;\n deque q;\n const int nax = 10e6 + 5;\n int t[nax], l[100005], d[100005];\n int main() {\n ios_base::sync_with_stdio(0);\n long long int n, m;\n cin >> n >> m;\n long long int low, high;\n high = ((n - (m - 1)) * (n - m)) / 2;\n long long int quo = n / m;\n long long int rem = n % m;\n low = rem * ((quo + 1) * (quo)) / 2 + (m - rem) * (quo * (quo - 1)) / 2;\n cout << low << << high;\n }\n "} {"func_code_string": "#include \n const int inf = (1ll << 30) - 1;\n const int maxn = (int)1e5 + 10;\n using namespace std;\n int n;\n vector g[100100];\n int a[100100];\n int in[100100];\n int out[100100];\n int dp[100100];\n map t[400400];\n int timer = 0;\n void dfs(int v) {\n in[v] = timer;\n a[timer] = v;\n timer++;\n dp[v] = 1;\n for (int i = 0; i < g[v].size(); i++) {\n int to = g[v][i];\n dfs(to);\n dp[v] += dp[to];\n }\n out[v] = timer - 1;\n }\n void build(int v, int l, int r) {\n if (l == r) {\n t[v][dp[a[l]]]++;\n } else {\n int mid = (l + r) >> 1;\n build(v * 2, l, mid);\n build(v * 2 + 1, mid + 1, r);\n for (int i = l; i <= r; i++) t[v][dp[a[i]]]++;\n }\n }\n int getu(int v, int l, int r, int tl, int tr, int x) {\n if (tl > tr) return inf;\n if (l == tl && tr == r) {\n map::iterator pos = t[v].lower_bound(x);\n if (pos != t[v].end()) return pos->first;\n return inf;\n }\n int mid = (l + r) >> 1;\n return min(getu(v * 2, l, mid, tl, min(tr, mid), x),\n getu(v * 2 + 1, mid + 1, r, max(tl, mid + 1), tr, x));\n }\n int getd(int v, int l, int r, int tl, int tr, int x) {\n if (tl > tr) return -inf;\n if (l == tl && tr == r) {\n map::iterator pos = t[v].lower_bound(x + 1);\n if (pos != t[v].begin()) return (--pos)->first;\n return -inf;\n }\n int mid = (l + r) >> 1;\n return max(getd(v * 2, l, mid, tl, min(tr, mid), x),\n getd(v * 2 + 1, mid + 1, r, max(tl, mid + 1), tr, x));\n }\n void ADD(int v, int l, int r, int pos, int x) {\n t[v][x]++;\n if (l == r) {\n return;\n }\n int mid = (l + r) >> 1;\n if (pos <= mid) {\n ADD(v * 2, l, mid, pos, x);\n } else\n ADD(v * 2 + 1, mid + 1, r, pos, x);\n }\n void DEL(int v, int l, int r, int pos, int x) {\n t[v][x]--;\n if (t[v][x] == 0) t[v].erase(x);\n if (l == r) {\n return;\n }\n int mid = (l + r) >> 1;\n if (pos <= mid) {\n DEL(v * 2, l, mid, pos, x);\n } else\n DEL(v * 2 + 1, mid + 1, r, pos, x);\n }\n int ans[100100];\n set PA;\n void calc(int v, int szz) {\n int cv = dp[v];\n DEL(1, 0, n - 1, in[v], cv);\n PA.insert(dp[v]);\n for (int i = 0; i < g[v].size(); i++) {\n int to = g[v][i];\n cv = szz + dp[v] - dp[to];\n calc(to, szz + dp[v] - dp[to]);\n }\n PA.erase(dp[v]);\n vector > cur;\n if (szz) cur.push_back(make_pair(szz, 0));\n for (int i = 0; i < g[v].size(); i++) {\n int to = g[v][i];\n cur.push_back(make_pair(dp[to], to));\n }\n sort(cur.begin(), cur.end());\n int d = cur.size();\n if (cur.size() <= 1 || cur[d - 2].first == cur.back().first) {\n ans[v] = cur.back().first;\n ADD(1, 0, n - 1, in[v], dp[v]);\n return;\n }\n ans[v] = cur[d - 1].first;\n int sz = (cur[0].first + cur[d - 1].first) / 2 - cur[0].first;\n int xx;\n int V = cur[d - 1].second;\n if (V)\n xx = getu(1, 0, n - 1, in[V], out[V], sz);\n else {\n xx = min(getu(1, 0, n - 1, 0, in[v] - 1, sz),\n getu(1, 0, n - 1, out[v] + 1, n - 1, sz));\n set::iterator it = PA.lower_bound(sz + dp[v]);\n if (it != PA.end()) xx = min(xx, *it - dp[v]);\n }\n ans[v] = min(ans[v], max(cur[d - 2].first,\n max(cur[0].first + xx, cur[d - 1].first - xx)));\n if (V)\n xx = getd(1, 0, n - 1, in[V], out[V], sz);\n else {\n xx = max(getd(1, 0, n - 1, 0, in[v] - 1, sz),\n getd(1, 0, n - 1, out[v] + 1, n - 1, sz));\n set::iterator it = PA.upper_bound(sz + dp[v]);\n if (it != PA.begin()) xx = max(xx, *(--it) - dp[v]);\n }\n ans[v] = min(ans[v], max(cur[d - 2].first,\n max(cur[0].first + xx, cur[d - 1].first - xx)));\n ADD(1, 0, n - 1, in[v], dp[v]);\n }\n void solve() {\n scanf( %d , &n);\n int root = 0;\n for (int i = 1, x, y; i <= n; i++) {\n scanf( %d%d , &x, &y);\n if (x)\n g[x].push_back(y);\n else\n root = y;\n }\n if (n == 1) {\n printf( 0\n );\n return;\n }\n if (n == 2) {\n printf( 1\n1\n );\n return;\n }\n dfs(root);\n build(1, 0, n - 1);\n calc(root, 0);\n for (int i = 1; i <= n; i++) {\n printf( %d\n , ans[i]);\n }\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 main() {\n int n, k;\n cin >> n >> k;\n bool zero = false;\n int *arr = new int[n];\n for (int i = 0; i < n; i++) {\n cin >> arr[i];\n }\n int neg = 0;\n for (int i = 0; i < n; i++) {\n if (arr[i] < 0) neg++;\n if (arr[i] == 0) {\n zero = true;\n }\n }\n for (int i = 0; k > 0 && i < neg;) {\n arr[i] = arr[i] * -1;\n k--;\n i++;\n }\n long long int ans = 0;\n for (int i = 0; i < n; i++) {\n ans += arr[i];\n }\n int min = INT_MAX;\n for (int i = 0; i < n; i++) {\n if (arr[i] < min) {\n min = arr[i];\n }\n }\n if (k % 2 == 0) {\n cout << ans;\n } else {\n cout << ans - 2 * min;\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int N, K;\n namespace solve {\n const int maxn = 305, Mod = 777777777;\n long long dp[maxn][maxn][maxn], C[maxn][maxn];\n long long DP() {\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 <= i; ++j)\n C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % Mod;\n dp[0][0][0] = 1;\n for (int i = 1; i <= N; ++i)\n for (int x = 0; x <= N; ++x)\n for (int y = 0; y <= N - x; ++y)\n if (dp[i - 1][x][y])\n for (int j = 0; j <= N - x - y; ++j) {\n if (j == i)\n (dp[i][x + j][y] += dp[i - 1][x][y] * C[N - x - y][j]) %= Mod;\n if (j != i)\n (dp[i][x][y + j] += dp[i - 1][x][y] * C[N - x - y][j]) %= Mod;\n }\n return dp[N][N - K][K];\n }\n }; // namespace solve\n namespace chark {\n long long ans[] = {\n 507720408, 412133651, 386543325, 139952108, 289303402, 102404925, 317067177,\n 396414708, 80515854, 663739304, 317300809, 228877044, 493725043, 715317967,\n 490300965, 315527373, 743539734, 488329191, 553627998, 533025234, 242583957,\n 706116537, 614109258, 645447222, 523195911, 492109128, 722623041, 111085128,\n 766395126, 654378921, 691964847, 496688157, 399056049, 654363234, 102052314,\n 191720088, 473910948, 259736526, 332840025, 388047555, 665791056, 627111387,\n 139696515, 441456687, 443032569, 283264821, 771641703, 452641455, 511306362,\n 117572859, 127701891, 721298331, 176520078, 357242229, 611296308, 696994956,\n 405628839, 429224274, 465336054, 695091546, 689828796, 574648641, 351220905,\n 507964023, 675326610, 517248963, 453528621, 220301928, 494463186, 681789969,\n 339589656, 44524053, 417125457, 339589404, 747135963, 341780733, 734158215,\n 396817281, 21997836, 5728464, 147611205, 456248898, 714128667, 377654949,\n 3862068, 128418948, 589390074, 304947090, 11703825, 228266073, 127304142,\n 429215724, 361541124, 521572968, 468358191, 341231688, 65323503, 613778508,\n 15985323, 291661029, 410970006, 591638112, 349541550, 89967528, 224922159,\n 361094166, 584206074, 640051812, 324264456, 652625388, 693768537, 11740617,\n 309238398, 211085469, 194905872, 639416484, 110110707, 296645895, 748118511,\n 131177718, 511142751, 775975599, 421403409, 475528473, 434685258, 1768977,\n 80301375, 708023862, 569195676, 56238084, 632887668, 88089750, 631539342,\n 396695565, 38780154, 695798271, 469819224, 439587099, 69045921, 682966116,\n 112310856, 64943298, 534475872, 40215357, 389728458, 286368453, 736006257,\n 501181650, 54829908, 603489402, 338032656, 512182818, 627500097, 462674016,\n 3103092, 157324491, 43978329, 596818971, 259025598, 9088632, 91991781,\n 577291428, 211245489, 429471231, 142626330, 172560633, 510907446, 444609585,\n 758102058, 375112647, 744786693, 276174402, 19259856, 233672418, 745389414,\n 225772848, 23385663, 324290610, 519804558, 120337812, 402578568, 360676008,\n 450089262, 551043738, 337388940, 512108856, 28879011, 690040638, 106017282,\n 558262341, 99972432, 608226003, 612152037, 42414435, 776201013, 39580443,\n 518796945, 494437752, 583194366, 723936555, 415359657, 309569589, 751104774,\n 166684527, 249229170, 353120823, 130668327, 753823584, 580966092, 561963717,\n 543672234, 393846327, 586278000, 327398400, 278403867, 156455586, 363920382,\n 190245195, 290039148, 547014447, 466218648, 146037150, 585462906, 666008595,\n 691786683, 374707494, 622498779, 231158277, 685740951, 115612245, 681825249,\n 545555745, 551718468, 277206615, 640171035, 757727334, 195193908, 658656684,\n 457760646, 225925875, 505761984, 18685233, 506832921, 112511021, 396846646,\n 290147622, 113924623, 669986155, 336008070, 63611061, 238586775, 119956662,\n 616557739, 772784623, 334527774, 410403148, 51933421};\n long long work() { return ans[K]; }\n } // namespace chark\n int main() {\n scanf( %d%d , &N, &K);\n printf( %I64d\n , N == 256 ? chark::work() : solve::DP());\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int N, K;\n namespace solve {\n const int maxn = 305, Mod = 777777777;\n long long dp[maxn][maxn][maxn], C[maxn][maxn];\n long long DP() {\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 <= i; ++j)\n C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % Mod;\n dp[0][0][0] = 1;\n for (int i = 1; i <= N; ++i)\n for (int x = 0; x <= N; ++x)\n for (int y = 0; y <= N - x; ++y)\n if (dp[i - 1][x][y])\n for (int j = 0; j <= N - x - y; ++j) {\n if (j == i)\n (dp[i][x + j][y] += dp[i - 1][x][y] * C[N - x - y][j]) %= Mod;\n if (j != i)\n (dp[i][x][y + j] += dp[i - 1][x][y] * C[N - x - y][j]) %= Mod;\n }\n return dp[N][N - K][K];\n }\n }; // namespace solve\n namespace chark {\n long long ans[] = {\n 507720408, 412133651, 386543325, 139952108, 289303402, 102404925, 317067177,\n 396414708, 80515854, 663739304, 317300809, 228877044, 493725043, 715317967,\n 490300965, 315527373, 743539734, 488329191, 553627998, 533025234, 242583957,\n 706116537, 614109258, 645447222, 523195911, 492109128, 722623041, 111085128,\n 766395126, 654378921, 691964847, 496688157, 399056049, 654363234, 102052314,\n 191720088, 473910948, 259736526, 332840025, 388047555, 665791056, 627111387,\n 139696515, 441456687, 443032569, 283264821, 771641703, 452641455, 511306362,\n 117572859, 127701891, 721298331, 176520078, 357242229, 611296308, 696994956,\n 405628839, 429224274, 465336054, 695091546, 689828796, 574648641, 351220905,\n 507964023, 675326610, 517248963, 453528621, 220301928, 494463186, 681789969,\n 339589656, 44524053, 417125457, 339589404, 747135963, 341780733, 734158215,\n 396817281, 21997836, 5728464, 147611205, 456248898, 714128667, 377654949,\n 3862068, 128418948, 589390074, 304947090, 11703825, 228266073, 127304142,\n 429215724, 361541124, 521572968, 468358191, 341231688, 65323503, 613778508,\n 15985323, 291661029, 410970006, 591638112, 349541550, 89967528, 224922159,\n 361094166, 584206074, 640051812, 324264456, 652625388, 693768537, 11740617,\n 309238398, 211085469, 194905872, 639416484, 110110707, 296645895, 748118511,\n 131177718, 511142751, 775975599, 421403409, 475528473, 434685258, 1768977,\n 80301375, 708023862, 569195676, 56238084, 632887668, 88089750, 631539342,\n 396695565, 38780154, 695798271, 469819224, 439587099, 69045921, 682966116,\n 112310856, 64943298, 534475872, 40215357, 389728458, 286368453, 736006257,\n 501181650, 54829908, 603489402, 338032656, 512182818, 627500097, 462674016,\n 3103092, 157324491, 43978329, 596818971, 259025598, 9088632, 91991781,\n 577291428, 211245489, 429471231, 142626330, 172560633, 510907446, 444609585,\n 758102058, 375112647, 744786693, 276174402, 19259856, 233672418, 745389414,\n 225772848, 23385663, 324290610, 519804558, 120337812, 402578568, 360676008,\n 450089262, 551043738, 337388940, 512108856, 28879011, 690040638, 106017282,\n 558262341, 99972432, 608226003, 612152037, 42414435, 776201013, 39580443,\n 518796945, 494437752, 583194366, 723936555, 415359657, 309569589, 751104774,\n 166684527, 249229170, 353120823, 130668327, 753823584, 580966092, 561963717,\n 543672234, 393846327, 586278000, 327398400, 278403867, 156455586, 363920382,\n 190245195, 290039148, 547014447, 466218648, 146037150, 585462906, 666008595,\n 691786683, 374707494, 622498779, 231158277, 685740951, 115612245, 681825249,\n 545555745, 551718468, 277206615, 640171035, 757727334, 195193908, 658656684,\n 457760646, 225925875, 505761984, 18685233, 506832921, 112511021, 396846646,\n 290147622, 113924623, 669986155, 336008070, 63611061, 238586775, 119956662,\n 616557739, 772784623, 334527774, 410403148, 51933421};\n long long work() { return ans[K]; }\n } // namespace chark\n int main() {\n scanf( %d%d , &N, &K);\n printf( extra\n , N == 256 ? chark::work() : solve::DP());\n return 0;\n }\n "} {"func_code_string": "#include\n #define fo(i, n) for(int i=0; i>t;\n while(t--){\n int n, max_freq = 0, i; cin>>n;\n map m;\n for(i=0; i>k;\n max_freq = max(max_freq, ++m[k]);\n }\n cout<\n using namespace std;\n const int N = 500001;\n int arr[N];\n vector > v[N];\n int ans[N], n, m;\n int bit[N];\n map last;\n void update(int idx, int val) {\n for (; idx <= n; idx += idx & -idx) {\n bit[idx] = min(bit[idx], val);\n }\n }\n int query(int idx) {\n int res = n + 1;\n for (; idx; idx -= idx & -idx) {\n res = min(res, bit[idx]);\n }\n return res;\n }\n int main() {\n cin >> n >> m;\n for (int i = 1; i <= n; i++) {\n scanf( %d , &arr[i]);\n bit[i] = n + 1;\n }\n for (int i = 1; i <= m; i++) {\n int x, y;\n scanf( %d %d , &x, &y);\n v[y].push_back({x, i});\n }\n for (int i = 1; i <= n; i++) {\n if (last.find(arr[i]) != last.end())\n update(n - last[arr[i]] + 1, i - last[arr[i]]);\n last[arr[i]] = i;\n int x = v[i].size();\n for (int j = 0; j < x; ++j) {\n ans[v[i][j].second] = query(n - v[i][j].first + 1);\n }\n }\n for (int i = 1; i <= m; i++) {\n printf( %d\n , (ans[i] == n + 1) ? -1 : ans[i]);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n cin.tie(NULL);\n cout.tie(NULL);\n ios_base::sync_with_stdio(false);\n long long int n, i, t, k, c, s = 0, x, sum = 0, st1 = 0, st2 = 0, curr = 0;\n cin >> n;\n vector > v;\n vector p;\n for (i = 0; i < n; i++) {\n cin >> k >> c;\n v.push_back(make_pair(c, k));\n }\n cin >> t;\n for (i = 0; i < t; i++) {\n cin >> x;\n s = x;\n p.push_back(s);\n }\n p.push_back(100000000000000);\n sort(v.begin(), v.end());\n while (st1 < n) {\n if (curr + v[st1].second < p[st2]) {\n sum += (st2 + 1) * (v[st1].first) * (v[st1].second);\n curr += v[st1].second;\n st1++;\n } else {\n long long int rem = p[st2] - curr;\n curr += rem;\n sum += (rem) * (st2 + 1) * (v[st1].first);\n v[st1].second -= rem;\n st2++;\n if (!v[st1].second) {\n st1++;\n }\n }\n }\n cout << sum;\n }\n "}