diff --git "a/cpp_dataset/train/train.jsonl" "b/cpp_dataset/train/train.jsonl" --- "a/cpp_dataset/train/train.jsonl" +++ "b/cpp_dataset/train/train.jsonl" @@ -49,7 +49,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 using namespace std;\n const int md = 1e9 + 7;\n int n;\n char s[111];\n int f[111][3333];\n int main() {\n int t;\n f[0][0] = 1;\n for (int i = 1; i <= 100; ++i) {\n for (int j = 0; j <= 3000; ++j) {\n for (int c = 0; c <= min(j, 25); ++c) {\n f[i][j] += f[i - 1][j - c];\n f[i][j] %= md;\n }\n }\n }\n scanf( %d , &t);\n while (t--) {\n scanf( %s , s);\n int sum = 0;\n for (int i = 0; i < strlen(s); ++i) sum += s[i] - 'a';\n printf( %d\n , (f[strlen(s)][sum] + md - 1) % md);\n }\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 "} @@ -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 "} @@ -1049,7 +1049,7 @@ {"func_code_string": "#include \n using namespace std;\n template \n bool smax(T &x, L y) {\n return x < y ? (x = y, 1) : 0;\n }\n template \n bool smin(T &x, L y) {\n return y < x ? (x = y, 1) : 0;\n }\n const int maxn = 5e5 + 17;\n list a;\n list::iterator per[maxn];\n int n;\n int main() {\n ios::sync_with_stdio(0), cin.tie(0);\n cin >> n;\n for (int i = 0, x; i < n; i++) cin >> x, a.push_back(x), per[i] = --a.end();\n sort(per, per + n,\n [](list::iterator &i, list::iterator &j) { return *i < *j; });\n long long ans = 0, dam = 0;\n for_each(per, per + max(0, n - 2), [&](list::iterator &i) {\n if (i == a.begin() || i == --a.end()) {\n ans += (a.size() - 2) * (*i - dam);\n dam = *i;\n } else {\n auto prv = i, nxt = i;\n prv--, nxt++;\n ans += min(*prv, *nxt) - dam;\n }\n a.erase(i);\n });\n cout << ans << '\n';\n return 0;\n }\n "} {"func_code_string": "#include \n int main() {\n int t;\n scanf( %d , &t);\n while (t--) {\n int n;\n scanf( %d , &n);\n std::vector a(n);\n for (int i = 0; i < n; i++) {\n scanf( %d , &a[i]);\n }\n int minadd = 0;\n int cur = a[0];\n for (int i = 1; i < n; i++) {\n if (cur > a[i]) {\n minadd = std::max(minadd, cur - a[i]);\n }\n cur = std::max(cur, a[i]);\n }\n int nBits = 0;\n while (minadd) {\n nBits++;\n minadd >>= 1;\n }\n printf( %d\n , nBits);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct Ans {\n long long maxm, maxp, lmr, rml;\n Ans() { maxm = maxp = lmr = rml = -(1ll << 60); }\n } node[100010 << 2];\n void Union(Ans &o, Ans a, Ans b) {\n o.maxm = max(a.maxm, b.maxm);\n o.maxp = max(a.maxp, b.maxp);\n o.lmr = max(max(a.lmr, b.lmr), a.maxp + b.maxm);\n o.rml = max(max(a.rml, b.rml), a.maxm + b.maxp);\n }\n long long h[100010], d[100010], n;\n void build(int o, int l, int r) {\n if (l == r) {\n node[o].maxm = 2 * h[l] - (long long)d[l];\n node[o].maxp = 2 * h[l] + (long long)d[l];\n node[o].rml = -(1ll << 60);\n node[o].lmr = -(1ll << 60);\n return;\n }\n build((o << 1), l, ((l + r) >> 1));\n build((o << 1 | 1), ((l + r) >> 1) + 1, r);\n Union(node[o], node[(o << 1)], node[(o << 1 | 1)]);\n }\n Ans query(int L, int R, int o = 1, int l = 1, int r = n) {\n Ans ret;\n if (L > R) return ret;\n if (L <= l && r <= R) return node[o];\n if (R <= ((l + r) >> 1)) return query(L, R, (o << 1), l, ((l + r) >> 1));\n if (L > ((l + r) >> 1))\n return query(L, R, (o << 1 | 1), ((l + r) >> 1) + 1, r);\n Union(ret, query(L, R, (o << 1), l, ((l + r) >> 1)),\n query(L, R, (o << 1 | 1), ((l + r) >> 1) + 1, r));\n return ret;\n }\n int Q;\n Ans ansl, ansr;\n int main() {\n scanf( %d%d , &n, &Q);\n for (int i = 1; i <= n; i++) {\n cin >> d[i + 1];\n d[i + 1] += d[i];\n }\n for (int i = 1; i <= n; i++) cin >> h[i];\n build(1, 1, n);\n while (Q--) {\n int l, r;\n scanf( %d %d , &l, &r);\n if (l <= r) {\n ansl = query(r + 1, n);\n ansr = query(1, l - 1);\n cout << max(max(ansr.rml, ansl.rml), ansr.maxp + d[n + 1] + ansl.maxm)\n << endl;\n } else {\n cout << query(r + 1, l - 1).rml << endl;\n }\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int n, m, tot;\n long long ans;\n int main(int argc, char **argv) {\n scanf( %d%d , &n, &m);\n ++n;\n for (int i = m + 1; (i << 1) <= n && i < n - m; ++i)\n for (int j = m + 1; j < n - m; ++j) {\n tot = (-i * i * 2 + i * j + i * n * 2 - j * n - 1) / (i + j);\n ans += max(min(tot, n - m - 1) - m, 0) * ((i << 1) == n ? 1 : 2);\n }\n printf( %I64d\n , ans * 3);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int n, m, tot;\n long long ans;\n int main(int argc, char **argv) {\n scanf( %d%d , &n, &m);\n ++n;\n for (int i = m + 1; (i << 1) <= n && i < n - m; ++i)\n for (int j = m + 1; j < n - m; ++j) {\n tot = (-i * i * 2 + i * j + i * n * 2 - j * n - 1) / (i + j);\n ans += max(min(tot, n - m - 1) - m, 0) * ((i << 1) == n ? 1 : 2);\n }\n printf( extra\n , ans * 3);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int A, B, C, N;\n int main() {\n scanf( %d%d%d%d , &A, &B, &C, &N);\n if (A < C || B < C || A + B >= N + C)\n puts( -1 );\n else\n printf( %d\n , N - (A + B - C));\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n struct modulo {\n int w;\n operator int() const { return w; }\n modulo() {}\n modulo(int w) {\n this->w = w;\n fix();\n }\n template \n modulo(type w) {\n this->w = w % mod;\n fix();\n }\n void inline fix() {\n if (w >= mod || w < -mod) w %= mod;\n if (w < 0) w += mod;\n }\n inline modulo operator-() const { return mod - w; }\n inline modulo &operator+=(const modulo &b) {\n if ((w += b.w) >= mod) w -= mod;\n return *this;\n }\n inline modulo &operator-=(const modulo &b) {\n if ((w -= b.w) < 0) w += mod;\n return *this;\n }\n inline modulo &operator*=(const modulo &b) {\n w = (unsigned long long)w * b.w % mod;\n return *this;\n }\n inline modulo &operator/=(const modulo &b) { return *this *= inv(b); }\n friend modulo operator+(const modulo &a, const modulo &b) {\n return modulo(a) += b;\n }\n template \n friend modulo operator+(const modulo &a, const type &b) {\n return modulo(a) += b;\n }\n template \n friend modulo operator+(const type &a, const modulo &b) {\n return modulo(a) += b;\n }\n friend modulo operator-(const modulo &a, const modulo &b) {\n return modulo(a) -= b;\n }\n template \n friend modulo operator-(const modulo &a, const type &b) {\n return modulo(a) -= b;\n }\n template \n friend modulo operator-(const type &a, const modulo &b) {\n return modulo(a) -= b;\n }\n friend modulo operator*(const modulo &a, const modulo &b) {\n return modulo(a) *= b;\n }\n template \n friend modulo operator*(const modulo &a, const type &b) {\n return modulo(a) *= b;\n }\n template \n friend modulo operator*(const type &a, const modulo &b) {\n return modulo(a) *= b;\n }\n friend modulo operator/(const modulo &a, const modulo &b) {\n return modulo(a) /= b;\n }\n template \n friend modulo operator/(const modulo &a, const type &b) {\n return modulo(a) /= b;\n }\n template \n friend modulo operator/(const type &a, const modulo &b) {\n return modulo(a) /= b;\n }\n friend inline modulo inv(const modulo &w) {\n int a = w, m = mod, u = 0, v = 1, t;\n for (; a != 0; t = m / a, m -= t * a, swap(a, m), u -= t * v, swap(u, v))\n ;\n return u;\n }\n friend inline modulo pow(const modulo &w, int p) {\n if (!w) return 0;\n modulo a = w, r = 1;\n for (; p > 0; a *= a, p >>= 1)\n if (p & 1) r *= a;\n return r;\n }\n };\n const int mod = 998244353;\n const int nsz = 5e3;\n int n;\n modulo f[2][nsz + 5], g[nsz + 5], S[nsz + 5][nsz + 5], ans[nsz + 5];\n modulo inline C(int n, int m) { return f[0][n] * f[1][m] * f[1][n - m]; }\n void inline init() {\n f[0][0] = 1;\n for (int i = 1; i <= n; ++i) f[0][i] = f[0][i - 1] * i;\n f[1][n] = 1 / f[0][n];\n for (int i = n; i >= 1; --i) f[1][i - 1] = f[1][i] * i;\n S[0][0] = 1;\n for (int i = 1; i <= n; ++i) {\n for (int j = 1; j <= i; ++j) S[i][j] = S[i - 1][j] * j + S[i - 1][j - 1];\n }\n for (int i = 0; i <= n; ++i) {\n for (int len = i + 1; len <= n; ++len)\n g[i] += f[0][len - i] * f[1][len] * S[len][len - i];\n }\n }\n void inline solve() {\n for (int k = 0; k < n; ++k) {\n for (int i = k; i <= n; ++i) {\n modulo res = g[i] * C(i, k) * f[0][n];\n ans[k + 1] += (i - k) & 1 ? -res : res;\n }\n }\n }\n int main() {\n scanf( %d , &n);\n init();\n solve();\n for (int k = 1; k <= n; ++k) printf( %d%c , ans[k].w, \n [k < n]);\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, m;\n vector prices[1010];\n int allp[1010];\n int all;\n int margin_price;\n int above_cnt[1010], margin_cnt[1010], cnt[1010];\n double f[1010][1010], g[1010][1010];\n double comb[1010][1010];\n int main() {\n comb[1][0] = comb[1][1] = 1;\n for (int i = 2; i <= 1000; i++) {\n comb[i][0] = comb[i][i] = 1;\n for (int j = 1; j < i; j++)\n comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1];\n }\n scanf( %d%d , &n, &m);\n for (int i = 1; i <= m; i++) {\n int k;\n scanf( %d , &k);\n while (k--) {\n int v;\n scanf( %d , &v);\n prices[i].push_back(v);\n allp[++all] = v;\n }\n }\n sort(allp + 1, allp + all + 1);\n reverse(allp + 1, allp + all + 1);\n margin_price = allp[n];\n int need_margin = 0;\n for (int i = 1; i <= n; i++)\n if (allp[i] == margin_price) need_margin++;\n for (int i = 1; i <= m; i++) {\n for (int p : prices[i]) {\n if (p > margin_price)\n above_cnt[i]++;\n else if (p == margin_price)\n margin_cnt[i]++;\n cnt[i]++;\n }\n }\n f[0][0] = 1;\n g[0][0] = 1;\n for (int i = 1; i <= m; i++) {\n for (int j = 0; j <= need_margin; j++) {\n if (margin_cnt[i] == 0) {\n f[i][j] += f[i - 1][j] / comb[cnt[i]][above_cnt[i]];\n g[i][j] += g[i - 1][j];\n } else if (margin_cnt[i] == 1) {\n f[i][j] += f[i - 1][j] / comb[cnt[i]][above_cnt[i]];\n g[i][j] += g[i - 1][j];\n f[i][j + 1] += f[i - 1][j] / comb[cnt[i]][above_cnt[i] + 1];\n g[i][j + 1] += g[i - 1][j];\n } else {\n assert(false);\n }\n }\n }\n printf( %.15f\n , f[m][need_margin] / g[m][need_margin]);\n return 0;\n }\n "} @@ -1057,7 +1057,7 @@ {"func_code_string": "#include \n int a[1000000], b[1000000], n, k, f[1000000], c[1000000], i, j;\n int max(int a, int b) {\n if (a > b) return a;\n return b;\n }\n int main() {\n scanf( %d%d , &n, &k);\n for (i = 1; i <= n; i++) scanf( %d , &a[i]);\n for (i = 1; i <= n; i++) {\n scanf( %d , &b[i]);\n b[i] = b[i] * k;\n c[i] = a[i] - b[i];\n }\n for (i = 0; i <= 20000; i++) f[i] = -0x37373737;\n f[10000] = 0;\n for (i = 1; i <= n; i++) {\n if (c[i] > 0)\n for (j = 20000; j >= c[i]; j--) f[j] = max(f[j - c[i]] + a[i], f[j]);\n else\n for (j = 0; j <= 20000 + c[i]; j++) f[j] = max(f[j - c[i]] + a[i], f[j]);\n }\n if (f[10000])\n printf( %d , f[10000]);\n else\n printf( -1 );\n }\n "} {"func_code_string": "#include \n using namespace std;\n void input() {\n int n;\n cin >> n;\n vector v;\n int i = 1;\n int k = n - 1;\n while (k--) {\n cout << ? << i << << i + 1 << \n ;\n fflush(stdout);\n int x;\n cin >> x;\n v.push_back(x);\n i++;\n }\n cout << ? << 1 << << 3 << \n ;\n fflush(stdout);\n int x;\n cin >> x;\n int a[n + 1];\n a[1] = x - v[1];\n for (int i = 2; i <= n; i++) {\n a[i] = v[i - 2] - a[i - 1];\n }\n cout << ! ;\n for (int i = 1; i <= n; i++) {\n cout << a[i] << ;\n }\n cout << \n ;\n }\n int main() {\n input();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int an[101][21][21], n, k, md = 1e9 + 7, t[21][21];\n vector tr[101];\n void go(int v = 1, int p = 0) {\n an[v][0][1] = an[v][1][0] = 1;\n for (int i = 0; i < (int)(tr[v].size()); ++i) {\n int u = tr[v][i];\n if (u == p) continue;\n go(u, v);\n for (int i = 0; i < (int)(21); ++i)\n for (int j = 0; j < (int)(21); ++j)\n for (int w = 0; w < (int)(21); ++w)\n for (int z = 0; z < (int)(21); ++z) {\n int a = i;\n if (w && (w + 1 < a || !a)) a = w + 1;\n if (a > 20) a = 0;\n int b = 0;\n if (!i && z)\n b = z + 1;\n else if (i && z && k - i + 1 < z)\n b = z + 1;\n if (!w)\n b = max(b, j);\n else if (j && k - w + 1 < j)\n b = max(b, j);\n if (b > 20) continue;\n t[a][b] = ((long long)an[v][i][j] * an[u][w][z] + t[a][b]) % md;\n }\n for (int i = 0; i < (int)(21); ++i)\n for (int j = 0; j < (int)(21); ++j) an[v][i][j] = t[i][j], t[i][j] = 0;\n }\n }\n int main() {\n scanf( %d%d , &n, &k);\n for (int i = 1; i < (int)(n); ++i) {\n int a, b;\n scanf( %d%d , &a, &b);\n tr[a].push_back(b);\n tr[b].push_back(a);\n }\n go();\n int a = 0;\n for (int i = 0; i < (int)(21); ++i)\n if ((a += an[1][i][0]) >= md) a -= md;\n printf( %d\n , a);\n }\n "} -{"func_code_string": "#include \n using namespace std;\n long long dp[100010];\n int a[310], in[310];\n long long tmp[310];\n struct edge {\n int to;\n int next;\n } e[310];\n int box[100010], cnt;\n long long T;\n void init() {\n memset(box, -1, sizeof(box));\n memset(in, 0, sizeof(in));\n memset(dp, 0, sizeof(dp));\n cnt = 0;\n }\n void add(int from, int to) {\n e[cnt].to = to;\n e[cnt].next = box[from];\n box[from] = cnt++;\n }\n long long dfs(int now) {\n tmp[now] = a[now];\n int t, v;\n for (t = box[now]; t + 1; t = e[t].next) {\n v = e[t].to;\n long long tt = dfs(v);\n tmp[now] += tt;\n }\n T -= tmp[now];\n return tmp[now];\n }\n bool iscircle(int n) {\n int qu[310], tmp[310];\n int i, sum = 0, top = 0;\n for (i = 1; i <= n; i++) {\n tmp[i] = in[i];\n if (tmp[i] == 0) qu[top++] = i;\n }\n for (i = 0; i < top; i++) {\n int now = qu[i], t, v;\n for (t = box[now]; t + 1; t = e[t].next) {\n v = e[t].to;\n tmp[v]--;\n if (!tmp[v]) qu[top++] = v;\n }\n }\n if (top < n) return true;\n return false;\n }\n int main() {\n int n, q, i, aa, b, j;\n scanf( %d%d%I64d , &n, &q, &T);\n for (i = 1; i <= n; i++) scanf( %d , &a[i]);\n init();\n for (i = 1; i <= q; i++) {\n scanf( %d%d , &aa, &b);\n in[aa]++;\n add(b, aa);\n }\n bool tru = iscircle(n);\n for (i = 1; i <= n; i++) {\n if (!in[i]) {\n dfs(i);\n T += tmp[i];\n }\n }\n if (tru || T < 0)\n printf( 0\n );\n else {\n dp[0] = 1;\n for (i = 1; i <= n; i++) {\n for (j = tmp[i]; j <= T; j++)\n dp[j] = (dp[j] + dp[j - tmp[i]]) % 1000000007;\n }\n printf( %I64d\n , dp[T]);\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long dp[100010];\n int a[310], in[310];\n long long tmp[310];\n struct edge {\n int to;\n int next;\n } e[310];\n int box[100010], cnt;\n long long T;\n void init() {\n memset(box, -1, sizeof(box));\n memset(in, 0, sizeof(in));\n memset(dp, 0, sizeof(dp));\n cnt = 0;\n }\n void add(int from, int to) {\n e[cnt].to = to;\n e[cnt].next = box[from];\n box[from] = cnt++;\n }\n long long dfs(int now) {\n tmp[now] = a[now];\n int t, v;\n for (t = box[now]; t + 1; t = e[t].next) {\n v = e[t].to;\n long long tt = dfs(v);\n tmp[now] += tt;\n }\n T -= tmp[now];\n return tmp[now];\n }\n bool iscircle(int n) {\n int qu[310], tmp[310];\n int i, sum = 0, top = 0;\n for (i = 1; i <= n; i++) {\n tmp[i] = in[i];\n if (tmp[i] == 0) qu[top++] = i;\n }\n for (i = 0; i < top; i++) {\n int now = qu[i], t, v;\n for (t = box[now]; t + 1; t = e[t].next) {\n v = e[t].to;\n tmp[v]--;\n if (!tmp[v]) qu[top++] = v;\n }\n }\n if (top < n) return true;\n return false;\n }\n int main() {\n int n, q, i, aa, b, j;\n scanf( %d%dextra , &n, &q, &T);\n for (i = 1; i <= n; i++) scanf( %d , &a[i]);\n init();\n for (i = 1; i <= q; i++) {\n scanf( %d%d , &aa, &b);\n in[aa]++;\n add(b, aa);\n }\n bool tru = iscircle(n);\n for (i = 1; i <= n; i++) {\n if (!in[i]) {\n dfs(i);\n T += tmp[i];\n }\n }\n if (tru || T < 0)\n printf( 0\n );\n else {\n dp[0] = 1;\n for (i = 1; i <= n; i++) {\n for (j = tmp[i]; j <= T; j++)\n dp[j] = (dp[j] + dp[j - tmp[i]]) % 1000000007;\n }\n printf( extra\n , dp[T]);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int m[26];\n int main() {\n float a, c, d, b;\n cin >> a >> b >> c >> d;\n float sa = max((3 * a) / 10.0, a - (a / 250.0) * c);\n float sb = max((3 * b) / 10.0, b - (b / 250.0) * d);\n if (sa > sb)\n cout << Misha ;\n else if (sb > sa)\n cout << Vasya ;\n else\n cout << Tie ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 3e5 + 5;\n int n, m;\n int first[maxn], second[maxn];\n void solve() {\n cin >> n >> m;\n for (int i = 1; i <= m; ++i) cin >> first[i] >> second[i];\n int a, b;\n a = first[1];\n b = -1;\n for (int i = 1; i <= m; ++i) {\n if (first[i] != a && second[i] != a) {\n if (first[i] != b && second[i] != b) {\n if (b == -1)\n b = first[i];\n else\n break;\n }\n }\n if (i == m) {\n puts( YES );\n return;\n }\n }\n a = -1;\n b = second[1];\n for (int i = 1; i <= m; ++i) {\n if (first[i] != b && second[i] != b) {\n if (first[i] != a && second[i] != a) {\n if (a == -1)\n a = first[i];\n else\n break;\n }\n }\n if (i == m) {\n puts( YES );\n return;\n }\n }\n a = -1;\n b = second[1];\n for (int i = 1; i <= m; ++i) {\n if (first[i] != b && second[i] != b) {\n if (first[i] != a && second[i] != a) {\n if (a == -1)\n a = second[i];\n else\n break;\n }\n }\n if (i == m) {\n puts( YES );\n return;\n }\n }\n a = first[1];\n b = -1;\n for (int i = 1; i <= m; ++i) {\n if (first[i] != a && second[i] != a) {\n if (first[i] != b && second[i] != b) {\n if (b == -1)\n b = second[i];\n else\n break;\n }\n }\n if (i == m) {\n puts( YES );\n return;\n }\n }\n puts( NO );\n }\n int main() { solve(); }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int x, y;\n cin >> x >> y;\n if (((x < y) ? x : y) % 2)\n cout << Akshat ;\n else\n cout << Malvika ;\n return 0;\n }\n "} @@ -1067,7 +1067,7 @@ {"func_code_string": "#include \n using namespace std;\n template \n void maxE(T& a, const T& b) {\n a = max(a, b);\n }\n template \n void minE(T& a, const T& b) {\n a = min(a, b);\n }\n template \n ostream& operator<<(ostream& out, const vector& t_) {\n out << [ ;\n for (auto i : t_) out << i << , ;\n out << ] ;\n return out;\n }\n template \n ostream& operator<<(ostream& out, const pair& rhs) {\n out << ( << rhs.first << , << rhs.second << ) ;\n return out;\n }\n int gcd(int a, int b) {\n while (a && b) a > b ? a %= b : b %= a;\n return a + b;\n }\n map t;\n void proc(int l, int c) {\n if (0)\n cout << proc \n << l \n << << l << \n << c \n << << c << << endl;\n if (t.find(l) == t.end()) {\n t[l] = c;\n if (0) cout << init0 << endl;\n } else if (t[l] > c) {\n if (0) cout << relax1 << endl;\n t[l] = c;\n }\n vector > tmp;\n for (auto i : t) tmp.push_back(i);\n for (auto i : tmp) {\n int g = gcd(i.first, l);\n if (t.find(g) == t.end() || t[g] > i.second + c) {\n if (0)\n cout << relax2 \n << i \n << << i << \n << g \n << << g << \n << l \n << << l << \n << c \n << << c << \n << i.nd + c \n << << i.second + c << << endl;\n t[g] = i.second + c;\n }\n }\n }\n int main() {\n int n;\n assert(scanf( %d , &n) == 1);\n int l[n];\n for (int i = 0; i < int(n); ++i) assert(scanf( %d , l + i) == 1);\n int c[n];\n for (int i = 0; i < int(n); ++i) assert(scanf( %d , c + i) == 1);\n for (int i = 0; i < int(n); ++i) proc(l[i], c[i]);\n if (t.find(1) == t.end())\n printf( -1\n );\n else\n printf( %d\n , t[1]);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long read() {\n char x = getchar();\n long long ans = 0;\n while (!isdigit(x)) x = getchar();\n while (isdigit(x)) ans = ans * 10 + x - '0', x = getchar();\n return ans;\n }\n long long in[250005], now, n, vis[250005], dp[250005][2];\n vector > E[250005];\n void add_edge(long long u, long long v, long long w) {\n E[u].push_back(make_pair(v, w));\n }\n bool cmp(pair x, pair y) {\n return in[x.first] > in[y.first];\n }\n struct node {\n long long siz, sum;\n priority_queue q1, q2;\n void pop(long long x) {\n q2.push(x);\n siz--;\n sum -= x;\n }\n void push(long long x) {\n q1.push(x);\n siz++;\n sum += x;\n }\n void init() {\n while (!q1.empty() && !q2.empty() && q1.top() == q2.top())\n q1.pop(), q2.pop();\n }\n void pop() {\n init();\n siz--;\n sum -= q1.top();\n q1.pop();\n }\n long long top() {\n init();\n return q1.top();\n }\n } P[250005];\n void erase(long long u) {\n for (long long i = 0; i < E[u].size(); i++) {\n long long v = E[u][i].first, w = E[u][i].second;\n if (in[v] <= now) break;\n P[v].push(w);\n }\n }\n void dfs(long long u, long long pre) {\n vis[u] = now;\n long long tot = 0;\n long long num = in[u] - now;\n while (P[u].siz > num) P[u].pop();\n for (long long i = 0; i < E[u].size(); i++) {\n long long v = E[u][i].first, w = E[u][i].second;\n if (in[v] <= now) break;\n if (v == pre) continue;\n dfs(v, u);\n }\n vector tmp1, tmp2;\n for (long long i = 0; i < E[u].size(); i++) {\n long long v = E[u][i].first, w = E[u][i].second;\n if (v == pre) continue;\n if (in[v] <= now) break;\n long long tmp = dp[v][1] + w - dp[v][0];\n if (tmp <= 0) {\n num--, tot += dp[v][1] + w;\n continue;\n }\n tot += dp[v][0];\n P[u].push(tmp), tmp2.push_back(tmp);\n }\n while (P[u].siz && P[u].siz > num) {\n tmp1.push_back(P[u].top());\n P[u].pop();\n }\n dp[u][0] = tot + P[u].sum;\n while (P[u].siz && P[u].siz > num - 1) {\n tmp1.push_back(P[u].top());\n P[u].pop();\n }\n dp[u][1] = tot + P[u].sum;\n for (long long i = 0; i < tmp1.size(); i++) P[u].push(tmp1[i]);\n for (long long i = 0; i < tmp2.size(); i++) P[u].pop(tmp2[i]);\n }\n signed main() {\n cin >> n;\n long long tot = 0;\n for (long long i = 1; i < n; i++) {\n long long u = read(), v = read(), w = read();\n add_edge(u, v, w);\n add_edge(v, u, w);\n tot += w;\n }\n cout << tot << ' ';\n for (long long i = 1; i <= n; i++) in[i] = E[i].size();\n for (long long i = 1; i <= n; i++) sort(E[i].begin(), E[i].end(), cmp);\n vector > V;\n for (long long i = 1; i <= n; i++) V.push_back(make_pair(in[i], i));\n sort(V.begin(), V.end());\n long long pos = 0;\n for (now = 1; now < n; now++) {\n while (pos < V.size() && V[pos].first == now) erase(V[pos].second), pos++;\n tot = 0;\n for (long long j = pos; j < V.size(); j++) {\n if (vis[V[j].second] == now) continue;\n dfs(V[j].second, 0);\n tot += dp[V[j].second][0];\n }\n cout << tot << ' ';\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long n, a[1024], b[1024], c[1024], t[4], dd, d, have[1024];\n int main() {\n cin >> n;\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n }\n bool flag = 0;\n for (int i = 0; i < n; i++) {\n cin >> b[i];\n if (b[i] != a[i]) {\n c[d] = i;\n d++;\n } else {\n have[a[i]]++;\n have[b[i]]++;\n }\n }\n dd = 0;\n for (int i = 1; i <= n; i++) {\n if (have[i] == 0) {\n t[dd] = i;\n dd++;\n }\n }\n if (d == 1) {\n a[c[0]] = t[0];\n } else {\n int br = 0, br1 = 0;\n for (int i = 0; i < 2; i++) {\n if (a[c[i]] != t[i]) br++;\n if (b[c[i]] != t[i]) br1++;\n }\n if (br == 1 && br1 == 1) {\n a[c[0]] = t[0];\n a[c[1]] = t[1];\n } else {\n a[c[0]] = t[1];\n a[c[1]] = t[0];\n }\n }\n for (int i = 0; i < n - 1; i++) {\n cout << a[i] << ;\n }\n cout << a[n - 1] << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int maxn = 100005;\n int n, s;\n long long a[maxn], b[maxn], c[maxn];\n vector p[2];\n bool cmp1(int i, int j) { return b[i] - c[i] > b[j] - c[j]; }\n bool cmp2(int i, int j) { return c[i] - b[i] > c[j] - b[j]; }\n int main() {\n scanf( %d%d , &n, &s);\n long long tot = 0, A = 0, B = 0, v1 = 0, v2 = 0;\n p[0].clear();\n p[1].clear();\n for (int i = 0; i < n; i++) {\n scanf( %I64d%I64d%I64d , a + i, b + i, c + i);\n tot += a[i];\n if (b[i] > c[i]) {\n p[0].push_back(i);\n A += a[i] * b[i];\n v1 += a[i];\n } else {\n p[1].push_back(i);\n B += a[i] * c[i];\n v2 += a[i];\n }\n }\n sort(p[0].begin(), p[0].end(), cmp1);\n sort(p[1].begin(), p[1].end(), cmp2);\n long long ans = 0;\n long long c1 = v1 / s + (v1 % s ? 1 : 0);\n long long c2 = v2 / s + (v2 % s ? 1 : 0);\n tot = tot / s + (tot % s ? 1 : 0);\n if (c1 + c2 > tot) {\n long long tmp = A + B;\n long long now = v1 % s;\n for (int i = p[0].size() - 1; i >= 0; i--) {\n now -= a[p[0][i]];\n long long cnt = a[p[0][i]];\n if (now < 0) cnt = a[p[0][i]] + now;\n tmp += (c[p[0][i]] - b[p[0][i]]) * cnt;\n if (now <= 0) break;\n }\n ans = max(ans, tmp);\n tmp = A + B;\n now = v2 % s;\n for (int i = p[1].size() - 1; i >= 0; i--) {\n now -= a[p[1][i]];\n long long cnt = a[p[1][i]];\n if (now < 0) cnt = a[p[1][i]] + now;\n tmp += (b[p[1][i]] - c[p[1][i]]) * cnt;\n if (now <= 0) break;\n }\n ans = max(ans, tmp);\n } else\n ans = A + B;\n printf( %I64d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int maxn = 100005;\n int n, s;\n long long a[maxn], b[maxn], c[maxn];\n vector p[2];\n bool cmp1(int i, int j) { return b[i] - c[i] > b[j] - c[j]; }\n bool cmp2(int i, int j) { return c[i] - b[i] > c[j] - b[j]; }\n int main() {\n scanf( %d%d , &n, &s);\n long long tot = 0, A = 0, B = 0, v1 = 0, v2 = 0;\n p[0].clear();\n p[1].clear();\n for (int i = 0; i < n; i++) {\n scanf( extraextraextra , a + i, b + i, c + i);\n tot += a[i];\n if (b[i] > c[i]) {\n p[0].push_back(i);\n A += a[i] * b[i];\n v1 += a[i];\n } else {\n p[1].push_back(i);\n B += a[i] * c[i];\n v2 += a[i];\n }\n }\n sort(p[0].begin(), p[0].end(), cmp1);\n sort(p[1].begin(), p[1].end(), cmp2);\n long long ans = 0;\n long long c1 = v1 / s + (v1 % s ? 1 : 0);\n long long c2 = v2 / s + (v2 % s ? 1 : 0);\n tot = tot / s + (tot % s ? 1 : 0);\n if (c1 + c2 > tot) {\n long long tmp = A + B;\n long long now = v1 % s;\n for (int i = p[0].size() - 1; i >= 0; i--) {\n now -= a[p[0][i]];\n long long cnt = a[p[0][i]];\n if (now < 0) cnt = a[p[0][i]] + now;\n tmp += (c[p[0][i]] - b[p[0][i]]) * cnt;\n if (now <= 0) break;\n }\n ans = max(ans, tmp);\n tmp = A + B;\n now = v2 % s;\n for (int i = p[1].size() - 1; i >= 0; i--) {\n now -= a[p[1][i]];\n long long cnt = a[p[1][i]];\n if (now < 0) cnt = a[p[1][i]] + now;\n tmp += (b[p[1][i]] - c[p[1][i]]) * cnt;\n if (now <= 0) break;\n }\n ans = max(ans, tmp);\n } else\n ans = A + B;\n printf( extra\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const double PI = 2.0 * acos(0.0);\n const int INF = 1000 * 1000 * 1000;\n const int maxn = 1100;\n int W, H, N, M, cnt, tot;\n char g[maxn][maxn];\n int upp[maxn][maxn], lf[maxn][maxn];\n bool can;\n void play(int x, int y) {\n if (x == N || y == M) return;\n bool r, d;\n if (y + 1 < M && upp[x][y + 1] >= H)\n r = true;\n else\n r = false;\n if (x + 1 < N && lf[x + 1][y] >= W)\n d = true;\n else\n d = false;\n if (r && d)\n can = false;\n else if (r) {\n cnt += H;\n play(x, y + 1);\n } else if (d) {\n cnt += W;\n play(x + 1, y);\n }\n }\n int solve(int maxVal, int coefh, int coefw, int sx, int sy) {\n for (int len = 1; len <= maxVal; len++) {\n W += (coefw);\n H += (coefh);\n bool all = true;\n for (int k = 0; k < H && all; k++)\n for (int t = 0; t < W && all; t++) {\n if (g[k + sx][t + sy] != 'X') all = false;\n }\n if (!all) continue;\n can = true;\n cnt = H * W;\n play(sx + H - 1, sy + W - 1);\n if (can && cnt == tot) return H * W;\n }\n return -1;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n int i, j, k;\n cin >> N >> M;\n int sx = -1, sy;\n tot = 0;\n W = H = 0;\n for (int i = 0; i < N; i++)\n for (int j = 0; j < M; j++) {\n cin >> g[i][j];\n if (g[i][j] == 'X') tot++;\n if (g[i][j] == 'X' && sx == -1) {\n sx = i, sy = j;\n }\n }\n memset(upp, 0, sizeof upp);\n memset(lf, 0, sizeof lf);\n for (int i = 0; i < M; i++) upp[0][i] = (g[0][i] == 'X' ? 1 : 0);\n for (int i = 0; i < N; i++) lf[i][0] = (g[i][0] == 'X' ? 1 : 0);\n for (int i = 0; i < N; i++)\n for (int j = 0; j < M; j++) {\n if (i != 0 && g[i][j] == 'X') upp[i][j] = upp[i - 1][j] + 1;\n if (j != 0 && g[i][j] == 'X') lf[i][j] = lf[i][j - 1] + 1;\n }\n int w = 0, h = 0;\n for (int i = sy; i < M && g[sx][i] == 'X'; i++) w++;\n for (int i = sx; i < N && g[i][sy] == 'X'; i++) h++;\n int coefh = 0, coefw = 0;\n int ans;\n W = w, H = 0;\n ans = solve(h, 1, 0, sx, sy);\n W = 0, H = h;\n int ans2 = solve(w, 0, 1, sx, sy);\n if (ans == -1 || (ans2 != -1 && ans2 < ans)) ans = ans2;\n cout << ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int k;\n int l;\n cin >> k >> l;\n int u[k];\n int y[l];\n for (int i = 0; i < k; i++) {\n cin >> u[i];\n }\n for (int i = 0; i < l; i++) {\n cin >> y[i];\n }\n long long int h = 0;\n long long int v = 0;\n int f = 0;\n int g = 0;\n int p = 0;\n while (p != k || g != l) {\n if (v == h && v == 0) {\n v += y[g];\n h += u[p];\n g++;\n p++;\n } else if (v > h) {\n h += u[p];\n p++;\n } else if (v < h) {\n v += y[g];\n g++;\n } else {\n f++;\n h = 0;\n v = 0;\n }\n }\n cout << f + 1;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long n, m, k, x = 1;\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n cin >> n >> k;\n m = k * (5 + (n - 1) * 6);\n cout << m << endl;\n while (n--) {\n cout << x * k << << (x + 1) * k << << (x + 2) * k << \n << (x + 4) * k << endl;\n x += 6;\n }\n return 0;\n }\n "} @@ -1077,12 +1077,12 @@ {"func_code_string": "#include \n using namespace std;\n char s[10];\n int n;\n int notzero[12], cnt[12], ten[10], ans;\n int main() {\n ten[0] = 1;\n for (int i = 1; i < 8; ++i) ten[i] = 10 * ten[i - 1];\n scanf( %d , &n);\n for (int i = 1; i <= n; ++i) {\n scanf( %s , s);\n int len = strlen(s);\n notzero[s[0] - 'a'] = 1;\n for (int j = 0; j < len; ++j) cnt[s[j] - 'a'] += ten[len - j - 1];\n }\n int zero = -1;\n for (int i = 0; i < 10; ++i) {\n if (notzero[i] == 0) {\n if (zero == -1 || cnt[i] > cnt[zero]) zero = i;\n }\n }\n vector v;\n for (int i = 0; i < 10; ++i) {\n if (zero != i) v.push_back(cnt[i]);\n }\n sort(v.begin(), v.end());\n for (int i = 0; i < 9; ++i) {\n ans += (9 - i) * v[i];\n }\n printf( %d\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n bool a[4];\n int main() {\n int n;\n string s;\n int cz = 0;\n int c1 = 0;\n int c0 = 0;\n cin >> s;\n for (int i = 0; i < s.length(); ++i)\n if (s[i] == '0')\n ++c0;\n else if (s[i] == '1')\n ++c1;\n else if (s[i] == '?')\n ++cz;\n n = s.length();\n if (c0 + cz > c1) a[0] = true;\n if (c1 + cz > c0 + 1) a[3] = true;\n if (s.length() % 2 == 0) {\n int p = s.length() / 2;\n if (abs(c0 - p) + abs(c1 - p) <= cz) {\n if (s[n - 1] == '1' || s[n - 1] == '?' && c1 < p) a[1] = true;\n if (s[n - 1] == '0' || s[n - 1] == '?' && c0 < p) a[2] = true;\n }\n } else {\n int p = s.length() / 2;\n if (abs(c0 - p) + abs(c1 - (p + 1)) <= cz) {\n if (s[n - 1] == '1' || s[n - 1] == '?' && c1 < p + 1) a[1] = true;\n if (s[n - 1] == '0' || s[n - 1] == '?' && c0 < p) a[2] = true;\n }\n }\n if (a[0]) cout << 00 << endl;\n if (a[1]) cout << 01 << endl;\n if (a[2]) cout << 10 << endl;\n if (a[3]) cout << 11 << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long n, k;\n cin >> n >> k;\n long long v[n + 10];\n for (long long i = 0; i < n; i++) {\n cin >> v[i];\n }\n sort(v, v + n);\n k--;\n long long div = k / n;\n long long cnt = 0;\n long long val = v[div];\n for (long long i = 0; i < n; i++) {\n if (v[i] == val) cnt++;\n if (v[i] < val) k = k - n;\n }\n long long amt = cnt;\n long long now = k / amt;\n cout << val << << v[now] << endl;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n struct atom {\n long long f, w, where;\n void scan() { scanf( %I64d%I64d , &f, &w); }\n } x[310000];\n priority_queue A, B;\n int compare(atom k1, atom k2) {\n return k1.f > k2.f || (k1.f == k2.f && k1.where < k2.where);\n }\n int n, pre, ans, where;\n long long rem;\n void insert(long long k1) {\n if (!B.empty()) {\n long long k2 = B.top();\n if (k2 > k1) {\n A.push(-k2);\n B.pop();\n B.push(k1);\n rem += k2 - k1;\n return;\n }\n }\n A.push(-k1);\n pre++;\n }\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) x[i].scan(), x[i].where = i;\n n++;\n x[n] = (atom){0, 0, n};\n sort(x + 1, x + n + 1, compare);\n pre = 0, ans = 0, where = 0;\n long long rem = 0;\n for (int i = 1; i <= n; i++)\n if (x[i].where == 1) where = i;\n ans = where;\n pre = where;\n for (int i = 1; i < where; i++) A.push(-(x[i].w - x[i].f + 1));\n for (int i = where + 1; i <= n; i++) {\n rem += x[i - 1].f - x[i].f;\n if (i - 1 != where) insert(x[i - 1].w - x[i - 1].f + 1);\n while (!A.empty()) {\n long long k1 = -A.top();\n if (k1 <= rem) {\n rem -= k1;\n pre--;\n A.pop();\n } else\n break;\n }\n ans = min(ans, pre);\n }\n printf( %d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n struct atom {\n long long f, w, where;\n void scan() { scanf( extraextra , &f, &w); }\n } x[310000];\n priority_queue A, B;\n int compare(atom k1, atom k2) {\n return k1.f > k2.f || (k1.f == k2.f && k1.where < k2.where);\n }\n int n, pre, ans, where;\n long long rem;\n void insert(long long k1) {\n if (!B.empty()) {\n long long k2 = B.top();\n if (k2 > k1) {\n A.push(-k2);\n B.pop();\n B.push(k1);\n rem += k2 - k1;\n return;\n }\n }\n A.push(-k1);\n pre++;\n }\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) x[i].scan(), x[i].where = i;\n n++;\n x[n] = (atom){0, 0, n};\n sort(x + 1, x + n + 1, compare);\n pre = 0, ans = 0, where = 0;\n long long rem = 0;\n for (int i = 1; i <= n; i++)\n if (x[i].where == 1) where = i;\n ans = where;\n pre = where;\n for (int i = 1; i < where; i++) A.push(-(x[i].w - x[i].f + 1));\n for (int i = where + 1; i <= n; i++) {\n rem += x[i - 1].f - x[i].f;\n if (i - 1 != where) insert(x[i - 1].w - x[i - 1].f + 1);\n while (!A.empty()) {\n long long k1 = -A.top();\n if (k1 <= rem) {\n rem -= k1;\n pre--;\n A.pop();\n } else\n break;\n }\n ans = min(ans, pre);\n }\n printf( %d\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, m, x, y, z;\n string str[5][200];\n int blcks[5], whites[5];\n int ara[] = {0, 1, 2, 3};\n int main() {\n cin >> n;\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < n; j++) cin >> str[i][j];\n int tmp = 0;\n for (int j = 0; j < n; j++) {\n for (int k = 0; k < n; k++) {\n if ((j + k) % 2 == 0) {\n if (str[i][j][k] == '0')\n blcks[i]++;\n else\n whites[i]++;\n } else {\n if (str[i][j][k] == '1')\n blcks[i]++;\n else\n whites[i]++;\n }\n }\n }\n }\n int ans = 100000000;\n do {\n int tmp1 = whites[ara[0]] + blcks[ara[1]] + whites[ara[2]] + blcks[ara[3]];\n int tmp2 = whites[ara[1]] + blcks[ara[0]] + whites[ara[3]] + blcks[ara[2]];\n ans = min(ans, tmp1);\n ans = min(ans, tmp2);\n } while (next_permutation(ara, ara + 4));\n cout << ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct SegTree {\n int sz;\n vector dat;\n SegTree(int _sz = 1) {\n sz = 1;\n while (sz < _sz) sz <<= 1;\n dat.resize(sz << 1);\n }\n void upd(int pos, int val) {\n pos += sz - 1;\n dat[pos] = val;\n while (pos > 1) {\n pos >>= 1;\n dat[pos] = max(dat[pos << 1], dat[pos << 1 | 1]);\n }\n }\n int qry(int id, int l, int r, int ql, int qr) {\n if (qr < l || r < ql) return 0;\n if (ql <= l && r <= qr) return dat[id];\n return max(qry(id << 1, l, l + r >> 1, ql, qr),\n qry(id << 1 | 1, (l + r >> 1) + 1, r, ql, qr));\n }\n int qry(int l, int r) { return qry(1, 1, sz, l, r); }\n } segx, segy;\n int n, m, V;\n set> tph, thp;\n void plant(int p, int h) {\n vector> v;\n for (auto it = thp.begin(); it != thp.end() && it->first < h; it++) {\n v.emplace_back(it->second, it->first);\n }\n thp.emplace(h, p);\n tph.emplace(p, h);\n v.emplace_back(p, h);\n reverse(v.begin(), v.end());\n for (auto p : v) {\n segx.upd(p.first, 0);\n }\n for (auto p : v) {\n int lis = segx.qry(p.first + 1, n) + 1;\n segx.upd(p.first, lis);\n segy.upd(p.second, lis);\n }\n }\n void cutdown(int id) {\n vector> v;\n for (auto it = tph.begin(); id--; it++) {\n if (id)\n v.emplace_back(it->first, it->second);\n else {\n thp.erase(make_pair(it->second, it->first));\n segx.upd(it->first, 0);\n segy.upd(it->second, 0);\n tph.erase(it);\n }\n }\n reverse(v.begin(), v.end());\n for (auto p : v) {\n segy.upd(p.second, 0);\n }\n for (auto p : v) {\n int lis = segy.qry(p.second + 1, V) + 1;\n segx.upd(p.first, lis);\n segy.upd(p.second, lis);\n }\n }\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n cin >> n >> m;\n segx = SegTree(n);\n segy = SegTree(V = m + 10);\n while (m--) {\n int typ, x, y;\n cin >> typ >> x;\n if (typ == 1) {\n cin >> y;\n plant(x, y + m);\n } else {\n cutdown(x);\n }\n cout << segx.qry(1, n) << '\n';\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(false);\n int n, k;\n cin >> n >> k;\n string s;\n cin >> s;\n string res = ;\n for (int i = 0; i < n; i++) {\n if ((s[i] - 'a') >= ('z' - s[i])) {\n if ((s[i] - 'a') <= k) {\n k -= (s[i] - 'a');\n res += 'a';\n } else {\n res += (char)(s[i] - k);\n k = 0;\n }\n } else {\n if (('z' - s[i]) <= k) {\n k -= ('z' - s[i]);\n res += 'z';\n } else {\n res += (char)(s[i] + k);\n k = 0;\n }\n }\n }\n if (k != 0) {\n cout << -1;\n } else {\n cout << res;\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n int parent[300005], maxLen[300005];\n int findRoot(int u) {\n int root = u;\n while (parent[root] != root) {\n root = parent[root];\n }\n while (parent[u] != root) {\n int y = parent[u];\n parent[u] = root;\n u = y;\n }\n return root;\n }\n void unionNum(int u, int v) {\n int ru = findRoot(u), rv = findRoot(v);\n if (ru == rv) return;\n if (maxLen[ru] > maxLen[rv]) {\n parent[rv] = ru;\n maxLen[ru] = max(maxLen[ru], maxLen[ru] / 2 + maxLen[rv] / 2 +\n maxLen[ru] % 2 + maxLen[rv] % 2 + 1);\n } else {\n swap(ru, rv);\n parent[rv] = ru;\n maxLen[ru] = max(maxLen[ru], maxLen[ru] / 2 + maxLen[rv] / 2 +\n maxLen[ru] % 2 + maxLen[rv] % 2 + 1);\n }\n }\n int visited[300005] = {0};\n bool nVis(int &i, int n) {\n while (i <= n && visited[i] == 1) i++;\n if (i <= n) return true;\n return false;\n }\n void dfs(int node, vector child[]) {\n map v1, v2, d1, d2;\n stack myStack;\n myStack.push(node);\n v1[node] = 1;\n d1[node] = 0;\n visited[node] = 1;\n while (!myStack.empty()) {\n int y = myStack.top();\n myStack.pop();\n for (size_t i = 0; i < child[y].size(); i++) {\n if (v1[child[y][i]] == 0) {\n v1[child[y][i]] = 1;\n d1[child[y][i]] = d1[y] + 1;\n myStack.push(child[y][i]);\n visited[child[y][i]] = 1;\n }\n }\n }\n for (map::iterator it = d1.begin(); it != d1.end(); it++) {\n if (d1[node] < it->second) {\n node = it->first;\n }\n }\n myStack.push(node);\n d2[node] = 0;\n v2[node] = 1;\n while (!myStack.empty()) {\n int y = myStack.top();\n myStack.pop();\n parent[y] = node;\n for (size_t i = 0; i < child[y].size(); i++) {\n if (v2[child[y][i]] == 0) {\n v2[child[y][i]] = 1;\n d2[child[y][i]] = d2[y] + 1;\n maxLen[node] = max(maxLen[node], d2[child[y][i]]);\n myStack.push(child[y][i]);\n }\n }\n }\n }\n int main() {\n int n, m, q, a, b;\n scanf( %d%d%d , &n, &m, &q);\n for (int i = 0; i <= n; i++) {\n parent[i] = i;\n maxLen[i] = 0;\n }\n vector child[n + 1];\n for (int i = 0; i < m; i++) {\n scanf( %d%d , &a, &b);\n child[a].push_back(b);\n child[b].push_back(a);\n }\n int i = 1;\n while (nVis(i, n)) {\n dfs(i, child);\n }\n while (q--) {\n int type;\n scanf( %d , &type);\n if (type == 1) {\n scanf( %d , &a);\n printf( %d\n , maxLen[findRoot(a)]);\n } else {\n scanf( %d%d , &a, &b);\n unionNum(a, b);\n }\n }\n }\n "} -{"func_code_string": "#include \n int n, m;\n struct Matrix {\n long long a[2][2];\n } mt[205];\n Matrix mult(Matrix x, Matrix y) {\n Matrix c;\n for (int i = 0; i < 2; i++)\n for (int j = 0; j < 2; j++) c.a[i][j] = 0;\n for (int i = 0; i < 2; i++)\n for (int j = 0; j < 2; j++)\n for (int k = 0; k < 2; k++)\n c.a[i][j] = ((long long)c.a[i][j] + (long long)x.a[i][k] * y.a[k][j]) %\n 1000000007;\n return c;\n }\n void init(long long lim) {\n mt[0].a[0][0] = 0;\n mt[0].a[0][1] = 1;\n mt[0].a[1][0] = 1;\n mt[0].a[1][1] = 1;\n long long t = 2;\n for (int i = 1; t <= lim; i++, t <<= 1) {\n mt[i] = mult(mt[i - 1], mt[i - 1]);\n }\n }\n Matrix calc(long long b) {\n Matrix res;\n res.a[0][0] = 1;\n res.a[0][1] = 0;\n res.a[1][0] = 0;\n res.a[1][1] = 1;\n for (int i = 0; b; i++) {\n if (b & 1) res = mult(res, mt[i]);\n b >>= 1;\n }\n return res;\n }\n long long a1[800005], a2[800005], sum[800005];\n Matrix prev[800005];\n void update(int p) {\n a1[p] =\n (a1[p << 1] * prev[p << 1].a[0][0] + a2[p << 1] * prev[p << 1].a[0][1] +\n a1[(p << 1) + 1] * prev[(p << 1) + 1].a[0][0] +\n a2[(p << 1) + 1] * prev[(p << 1) + 1].a[0][1]) %\n 1000000007;\n a2[p] =\n (a1[p << 1] * prev[p << 1].a[1][0] + a2[p << 1] * prev[p << 1].a[1][1] +\n a1[(p << 1) + 1] * prev[(p << 1) + 1].a[1][0] +\n a2[(p << 1) + 1] * prev[(p << 1) + 1].a[1][1]) %\n 1000000007;\n }\n void pushdown(int p) {\n prev[p << 1] = mult(prev[p << 1], prev[p]);\n prev[(p << 1) + 1] = mult(prev[(p << 1) + 1], prev[p]);\n prev[p].a[0][0] = 1;\n prev[p].a[0][1] = 0;\n prev[p].a[1][0] = 0;\n prev[p].a[1][1] = 1;\n update(p);\n }\n void merge(int p, int l, int r, int gl, int gr, Matrix val) {\n if (l == gl && r == gr) {\n if (l == r) {\n prev[p] = mult(prev[p], val);\n } else {\n prev[p] = mult(prev[p], val);\n pushdown(p);\n }\n return;\n }\n pushdown(p);\n int mid = (l + r) >> 1;\n if (gr <= mid)\n merge(p << 1, l, mid, gl, gr, val);\n else if (gl > mid)\n merge((p << 1) + 1, mid + 1, r, gl, gr, val);\n else\n merge(p << 1, l, mid, gl, mid, val),\n merge((p << 1) + 1, mid + 1, r, mid + 1, gr, val);\n update(p);\n }\n long long query(int p, int l, int r, int gl, int gr) {\n if (l != r) {\n pushdown(p);\n }\n if (l == gl && r == gr) {\n return (a1[p] * prev[p].a[0][0] + a2[p] * prev[p].a[0][1]) % 1000000007;\n }\n int mid = (l + r) >> 1;\n if (gr <= mid)\n return query(p << 1, l, mid, gl, gr);\n else if (gl > mid)\n return query((p << 1) + 1, mid + 1, r, gl, gr);\n else\n return (query(p << 1, l, mid, gl, mid) +\n query((p << 1) + 1, mid + 1, r, mid + 1, gr)) %\n 1000000007;\n update(p);\n }\n int it[800005];\n void build(int p, int l, int r) {\n prev[p].a[0][0] = 1;\n prev[p].a[0][1] = 0;\n prev[p].a[1][0] = 0;\n prev[p].a[1][1] = 1;\n if (l == r) {\n if (it[l] == 1)\n a1[p] = a2[p] = 1;\n else {\n Matrix r = calc(it[l] - 1);\n a1[p] = (r.a[0][0] + r.a[0][1]) % 1000000007;\n a2[p] = (r.a[1][0] + r.a[1][1]) % 1000000007;\n }\n return;\n }\n int mid = (l + r) >> 1;\n build(p << 1, l, mid);\n build((p << 1) + 1, mid + 1, r);\n update(p);\n }\n int main() {\n scanf( %d%d , &n, &m);\n init(10000000000000000ll);\n for (int i = 1; i <= n; i++) scanf( %d , &it[i]);\n build(1, 1, n);\n for (int i = 1; i <= m; i++) {\n int tp;\n scanf( %d , &tp);\n if (tp == 1) {\n int l, r, x;\n scanf( %d%d%d , &l, &r, &x);\n merge(1, 1, n, l, r, calc(x));\n } else {\n int l, r;\n scanf( %d%d , &l, &r);\n printf( %I64d\n , query(1, 1, n, l, r) % 1000000007);\n }\n }\n }\n "} +{"func_code_string": "#include \n int n, m;\n struct Matrix {\n long long a[2][2];\n } mt[205];\n Matrix mult(Matrix x, Matrix y) {\n Matrix c;\n for (int i = 0; i < 2; i++)\n for (int j = 0; j < 2; j++) c.a[i][j] = 0;\n for (int i = 0; i < 2; i++)\n for (int j = 0; j < 2; j++)\n for (int k = 0; k < 2; k++)\n c.a[i][j] = ((long long)c.a[i][j] + (long long)x.a[i][k] * y.a[k][j]) %\n 1000000007;\n return c;\n }\n void init(long long lim) {\n mt[0].a[0][0] = 0;\n mt[0].a[0][1] = 1;\n mt[0].a[1][0] = 1;\n mt[0].a[1][1] = 1;\n long long t = 2;\n for (int i = 1; t <= lim; i++, t <<= 1) {\n mt[i] = mult(mt[i - 1], mt[i - 1]);\n }\n }\n Matrix calc(long long b) {\n Matrix res;\n res.a[0][0] = 1;\n res.a[0][1] = 0;\n res.a[1][0] = 0;\n res.a[1][1] = 1;\n for (int i = 0; b; i++) {\n if (b & 1) res = mult(res, mt[i]);\n b >>= 1;\n }\n return res;\n }\n long long a1[800005], a2[800005], sum[800005];\n Matrix prev[800005];\n void update(int p) {\n a1[p] =\n (a1[p << 1] * prev[p << 1].a[0][0] + a2[p << 1] * prev[p << 1].a[0][1] +\n a1[(p << 1) + 1] * prev[(p << 1) + 1].a[0][0] +\n a2[(p << 1) + 1] * prev[(p << 1) + 1].a[0][1]) %\n 1000000007;\n a2[p] =\n (a1[p << 1] * prev[p << 1].a[1][0] + a2[p << 1] * prev[p << 1].a[1][1] +\n a1[(p << 1) + 1] * prev[(p << 1) + 1].a[1][0] +\n a2[(p << 1) + 1] * prev[(p << 1) + 1].a[1][1]) %\n 1000000007;\n }\n void pushdown(int p) {\n prev[p << 1] = mult(prev[p << 1], prev[p]);\n prev[(p << 1) + 1] = mult(prev[(p << 1) + 1], prev[p]);\n prev[p].a[0][0] = 1;\n prev[p].a[0][1] = 0;\n prev[p].a[1][0] = 0;\n prev[p].a[1][1] = 1;\n update(p);\n }\n void merge(int p, int l, int r, int gl, int gr, Matrix val) {\n if (l == gl && r == gr) {\n if (l == r) {\n prev[p] = mult(prev[p], val);\n } else {\n prev[p] = mult(prev[p], val);\n pushdown(p);\n }\n return;\n }\n pushdown(p);\n int mid = (l + r) >> 1;\n if (gr <= mid)\n merge(p << 1, l, mid, gl, gr, val);\n else if (gl > mid)\n merge((p << 1) + 1, mid + 1, r, gl, gr, val);\n else\n merge(p << 1, l, mid, gl, mid, val),\n merge((p << 1) + 1, mid + 1, r, mid + 1, gr, val);\n update(p);\n }\n long long query(int p, int l, int r, int gl, int gr) {\n if (l != r) {\n pushdown(p);\n }\n if (l == gl && r == gr) {\n return (a1[p] * prev[p].a[0][0] + a2[p] * prev[p].a[0][1]) % 1000000007;\n }\n int mid = (l + r) >> 1;\n if (gr <= mid)\n return query(p << 1, l, mid, gl, gr);\n else if (gl > mid)\n return query((p << 1) + 1, mid + 1, r, gl, gr);\n else\n return (query(p << 1, l, mid, gl, mid) +\n query((p << 1) + 1, mid + 1, r, mid + 1, gr)) %\n 1000000007;\n update(p);\n }\n int it[800005];\n void build(int p, int l, int r) {\n prev[p].a[0][0] = 1;\n prev[p].a[0][1] = 0;\n prev[p].a[1][0] = 0;\n prev[p].a[1][1] = 1;\n if (l == r) {\n if (it[l] == 1)\n a1[p] = a2[p] = 1;\n else {\n Matrix r = calc(it[l] - 1);\n a1[p] = (r.a[0][0] + r.a[0][1]) % 1000000007;\n a2[p] = (r.a[1][0] + r.a[1][1]) % 1000000007;\n }\n return;\n }\n int mid = (l + r) >> 1;\n build(p << 1, l, mid);\n build((p << 1) + 1, mid + 1, r);\n update(p);\n }\n int main() {\n scanf( %d%d , &n, &m);\n init(10000000000000000ll);\n for (int i = 1; i <= n; i++) scanf( %d , &it[i]);\n build(1, 1, n);\n for (int i = 1; i <= m; i++) {\n int tp;\n scanf( %d , &tp);\n if (tp == 1) {\n int l, r, x;\n scanf( %d%d%d , &l, &r, &x);\n merge(1, 1, n, l, r, calc(x));\n } else {\n int l, r;\n scanf( %d%d , &l, &r);\n printf( extra\n , query(1, 1, n, l, r) % 1000000007);\n }\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n int sum[1000005];\n int main() {\n int n, x;\n cin >> n;\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < n; ++j) {\n scanf( %d , &x);\n if (i == j) sum[i] = x;\n }\n int all = 0;\n for (int i = 0; i < n; ++i) all += sum[i];\n int q, tipo;\n cin >> q;\n while (q--) {\n scanf( %d , &tipo);\n if (tipo == 3) {\n printf( %d , all % 2);\n } else {\n scanf( %d , &x);\n x--;\n if (sum[x] == 0) {\n sum[x] = 1;\n ++all;\n } else {\n sum[x] = 0;\n --all;\n }\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n long long int t;\n cin >> t;\n while (t--) {\n long long int n, s = 0;\n cin >> n;\n long long int* arr = new long long int[n];\n for (long long int i = 0; i < n; i++) {\n cin >> arr[i];\n s += arr[i];\n }\n if (s == 0)\n cout << NO \n << \n ;\n else if (s > 0) {\n cout << YES \n << \n ;\n sort(arr, arr + n, greater());\n for (long long int i = 0; i < n; i++) cout << arr[i] << ;\n cout << \n ;\n } else {\n cout << YES \n << \n ;\n sort(arr, arr + n);\n for (long long int i = 0; i < n; i++) cout << arr[i] << ;\n cout << \n ;\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 20, S = (1 << 16) + 10, V = 2048;\n bitset dp[S];\n int a[N], id[N];\n priority_queue > q;\n int main() {\n int n, k, v = 0;\n scanf( %d%d , &n, &k);\n for (int i = 1; i <= n; ++i) scanf( %d , &a[i]), v += a[i];\n dp[0][0] = 1;\n int u = (1 << n) - 1;\n for (int s = 0; s <= u; ++s) {\n for (int i = v / k; i >= 1; --i)\n if (dp[s][i * k]) dp[s][i] = 1;\n for (int i = 1; i <= n; ++i)\n if (!(s >> i - 1 & 1)) dp[s | (1 << i - 1)] |= dp[s] << a[i];\n }\n puts(dp[u][1] ? YES : NO );\n if (!dp[u][1]) return 0;\n int c = 1e9;\n for (int s = u, j = 1; s;)\n for (int t = j, ok = 0; !ok; t *= k, c -= !ok)\n for (int i = 1; i <= n; ++i) {\n if (t < a[i]) continue;\n if ((s >> i - 1 & 1) && dp[s ^ (1 << i - 1)][t - a[i]]) {\n id[i] = c, s ^= 1 << i - 1, j = t - a[i], ok = 1;\n break;\n }\n }\n for (int i = 1; i <= n; ++i) q.push(make_pair(-(id[i] - c), a[i]));\n while (q.size() > 1) {\n pair x = q.top();\n q.pop();\n pair y = q.top();\n q.pop();\n printf( %d %d\n , x.second, y.second);\n int v = x.second + y.second, u = 0;\n while (v % k == 0) v /= k, ++u;\n q.push(make_pair(-(-x.first + u), v));\n }\n return 0;\n }\n "} @@ -1143,7 +1143,7 @@ {"func_code_string": "#include \n template \n inline void SWAP(T &a, T &b) {\n T tmp = a;\n a = b;\n b = tmp;\n }\n template \n inline T ABS(const T &val) {\n return val < 0 ? -val : val;\n }\n template \n inline T MAX(const T &a, const T &b) {\n return a > b ? a : b;\n }\n template \n inline T MIN(const T &a, const T &b) {\n return a < b ? a : b;\n }\n template \n inline T SQR(const T &a) {\n return a * a;\n }\n const int INTinf = 2147483647;\n const int nINTinf = 0 - 2147483648;\n using namespace std;\n int n;\n char A[5005][5005];\n bool was[5005];\n bool bad[5005];\n int CY[5005];\n int kon = 0;\n int POS = 0;\n bool FF = false;\n bool G = false;\n void rec(const int &x) {\n if (bad[x]) return;\n if (was[x]) {\n POS = x;\n FF = true;\n } else {\n was[x] = true;\n for (int i = 0; i != n; i++) {\n if (A[x][i]) {\n rec(i);\n if (FF) {\n if (!G) {\n CY[kon++] = x;\n if (POS == x) G = true;\n }\n return;\n }\n }\n }\n bad[x] = true;\n }\n }\n int main() {\n scanf( %d , &n);\n for (int i = 0; i != n; i++) {\n scanf( %s , A[i]);\n for (int j = 0; j != n; j++) {\n A[i][j] -= '0';\n }\n }\n for (int i = 0; i != n; i++) {\n if (!bad[i]) rec(i);\n if (FF) break;\n }\n if (FF) {\n reverse(CY, CY + kon);\n int ST = CY[0];\n for (int i = 2; i != kon; i++) {\n if (A[CY[i]][ST]) {\n cout << ST + 1 << ' ' << CY[i - 1] + 1 << ' ' << CY[i] + 1 << endl;\n return 0;\n }\n }\n } else {\n cout << -1 << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long N = 1e3 + 7;\n long long dp[N][N][11][2], n, m, k;\n string s, t;\n int32_t main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n cin >> n >> m >> k >> s >> t;\n for (long long l = 1; l <= k; l++) {\n for (long long i = 1; i <= n; i++) {\n for (long long j = 1; j <= m; j++) {\n if (s[i - 1] == t[j - 1])\n dp[i][j][l][0] =\n 1 + max(dp[i - 1][j - 1][l - 1][1], dp[i - 1][j - 1][l][0]);\n dp[i][j][l][1] =\n max(dp[i][j][l][0], max(dp[i - 1][j][l][1], dp[i][j - 1][l][1]));\n }\n }\n }\n cout << dp[n][m][k][1];\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n long long t;\n cin >> t;\n while (t--) {\n long long p, f;\n cin >> p >> f;\n long long cnt1, cnt2;\n cin >> cnt1 >> cnt2;\n long long s, w;\n cin >> s >> w;\n if (s > w) {\n swap(s, w);\n swap(cnt1, cnt2);\n }\n long long ans = 0;\n for (long long i = 0; i <= min(cnt1, p / s); i++) {\n long long cnt = i;\n long long tmpp = p - i * s;\n cnt += (min(cnt2, tmpp / w));\n long long tmpw = cnt2 - min(cnt2, tmpp / w), tmps = cnt1 - i;\n cnt += min(tmps, f / s);\n long long tmpf = f - min(tmps, f / s) * s;\n cnt += min(tmpw, tmpf / w);\n ans = max(ans, cnt);\n }\n cout << ans << endl;\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n inline void in(int &n) {\n n = 0;\n int ch = getchar();\n int sign = 1;\n while (ch < '0' || ch > '9') {\n if (ch == '-') sign = -1;\n ch = getchar();\n }\n while (ch >= '0' && ch <= '9') {\n n = (n << 3) + (n << 1) + ch - '0', ch = getchar();\n }\n n = n * sign;\n }\n pair a[100005];\n long long int Fsum[100005], Rsum[100005];\n long long int solve(long long int val, int low, int up) {\n int n = up;\n while (low < up) {\n int mid = low + (up - low) / 2;\n if (a[mid].first >= val) {\n low = mid + 1;\n } else {\n up = mid;\n }\n }\n long long int ans = val * (n - low + 1) - Rsum[low];\n return ans;\n }\n int res[100005];\n int main() {\n int n;\n long long int A;\n int Cf, Cm;\n in(n);\n cin >> A;\n in(Cf);\n in(Cm);\n long long int m;\n cin >> m;\n for (int i = 1; i <= n; i++) {\n in(a[i].first);\n a[i].second = i;\n }\n sort(a + 1, a + 1 + n);\n reverse(a + 1, a + 1 + n);\n Fsum[0] = 0;\n for (int i = 1; i <= n; i++) {\n Fsum[i] = Fsum[i - 1] + a[i].first;\n }\n Rsum[n + 1] = 0;\n for (int i = n; i >= 1; i--) {\n Rsum[i] = Rsum[i + 1] + a[i].first;\n }\n long long int ans = 0;\n int X, Y;\n if (A * n - Fsum[n] <= m) {\n ans = n * Cf + A * Cm;\n X = n;\n Y = A;\n }\n for (int i = 1; i <= n; i++) {\n int low = a[n].first;\n int up = A;\n while (low < up) {\n int mid = low + (up - low + 1) / 2;\n long long int total = A * (i - 1) - Fsum[i - 1] + solve(mid, i, n);\n if (total <= m) {\n low = mid;\n } else {\n up = mid - 1;\n }\n }\n long long int total = A * (i - 1) - Fsum[i - 1] + solve(low, i, n);\n if (total <= m) {\n long long int p = low;\n p *= Cm;\n long long int curr = (i - 1) * Cf + p;\n if (curr >= ans) {\n ans = curr;\n X = i - 1;\n Y = low;\n }\n }\n }\n for (int i = 1; i <= n; i++) {\n if (i <= X) {\n res[a[i].second] = A;\n } else {\n res[a[i].second] = max(a[i].first, Y);\n }\n }\n printf( %I64d\n , ans);\n for (int i = 1; i <= n; i++) {\n printf( %d , res[i]);\n }\n printf( \n );\n }\n "} +{"func_code_string": "#include \n using namespace std;\n inline void in(int &n) {\n n = 0;\n int ch = getchar();\n int sign = 1;\n while (ch < '0' || ch > '9') {\n if (ch == '-') sign = -1;\n ch = getchar();\n }\n while (ch >= '0' && ch <= '9') {\n n = (n << 3) + (n << 1) + ch - '0', ch = getchar();\n }\n n = n * sign;\n }\n pair a[100005];\n long long int Fsum[100005], Rsum[100005];\n long long int solve(long long int val, int low, int up) {\n int n = up;\n while (low < up) {\n int mid = low + (up - low) / 2;\n if (a[mid].first >= val) {\n low = mid + 1;\n } else {\n up = mid;\n }\n }\n long long int ans = val * (n - low + 1) - Rsum[low];\n return ans;\n }\n int res[100005];\n int main() {\n int n;\n long long int A;\n int Cf, Cm;\n in(n);\n cin >> A;\n in(Cf);\n in(Cm);\n long long int m;\n cin >> m;\n for (int i = 1; i <= n; i++) {\n in(a[i].first);\n a[i].second = i;\n }\n sort(a + 1, a + 1 + n);\n reverse(a + 1, a + 1 + n);\n Fsum[0] = 0;\n for (int i = 1; i <= n; i++) {\n Fsum[i] = Fsum[i - 1] + a[i].first;\n }\n Rsum[n + 1] = 0;\n for (int i = n; i >= 1; i--) {\n Rsum[i] = Rsum[i + 1] + a[i].first;\n }\n long long int ans = 0;\n int X, Y;\n if (A * n - Fsum[n] <= m) {\n ans = n * Cf + A * Cm;\n X = n;\n Y = A;\n }\n for (int i = 1; i <= n; i++) {\n int low = a[n].first;\n int up = A;\n while (low < up) {\n int mid = low + (up - low + 1) / 2;\n long long int total = A * (i - 1) - Fsum[i - 1] + solve(mid, i, n);\n if (total <= m) {\n low = mid;\n } else {\n up = mid - 1;\n }\n }\n long long int total = A * (i - 1) - Fsum[i - 1] + solve(low, i, n);\n if (total <= m) {\n long long int p = low;\n p *= Cm;\n long long int curr = (i - 1) * Cf + p;\n if (curr >= ans) {\n ans = curr;\n X = i - 1;\n Y = low;\n }\n }\n }\n for (int i = 1; i <= n; i++) {\n if (i <= X) {\n res[a[i].second] = A;\n } else {\n res[a[i].second] = max(a[i].first, Y);\n }\n }\n printf( extra\n , ans);\n for (int i = 1; i <= n; i++) {\n printf( %d , res[i]);\n }\n printf( \n );\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n inline void chkmin(T1 &x, T2 y) {\n if (x > y) x = y;\n }\n template \n inline void chkmax(T1 &x, T2 y) {\n if (x < y) x = y;\n }\n inline int readChar();\n template \n inline T readInt();\n template \n inline void writeInt(T x, char end = 0);\n inline void writeChar(int x);\n inline void writeWord(const char *s);\n static const int buf_size = 4096;\n inline int getChar() {\n static char buf[buf_size];\n static int len = 0, pos = 0;\n if (pos == len) {\n pos = 0, len = fread(buf, 1, buf_size, stdin);\n }\n if (pos == len) {\n return -1;\n }\n return buf[pos++];\n }\n inline int readChar() {\n int c = getChar();\n while (c <= 32) {\n c = getChar();\n }\n return c;\n }\n template \n inline T readInt() {\n int s = 1, c = readChar();\n T x = 0;\n if (c == '-') s = -1, c = getChar();\n while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();\n return s == 1 ? x : -x;\n }\n static int write_pos = 0;\n static char write_buf[buf_size];\n inline void writeChar(int x) {\n if (write_pos == buf_size)\n fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;\n write_buf[write_pos++] = x;\n }\n template \n inline void writeInt(T x, char end) {\n if (x < 0) writeChar('-'), x = -x;\n char s[24];\n int n = 0;\n while (x || !n) s[n++] = '0' + x % 10, x /= 10;\n while (n--) writeChar(s[n]);\n if (end) writeChar(end);\n }\n inline void writeWord(const char *s) {\n while (*s) writeChar(*s++);\n }\n struct Flusher {\n ~Flusher() {\n if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;\n }\n } flusher;\n const string FILENAME = input ;\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int n;\n cin >> n;\n if (n & 1) {\n cout << (n / 2 + 1) * (n / 2 + 1) << endl;\n } else {\n cout << (n / 2 + 1) * (n / 2) << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int read(int &x) { return scanf( %d , &x); }\n int read(long long &x) { return scanf( %lld , &x); }\n int read(double &x) { return scanf( %lf , &x); }\n int read(int &x, int &y) { return scanf( %d%d , &x, &y); }\n int read(long long &x, long long &y) { return scanf( %lld%lld , &x, &y); }\n int read(double &x, double &y) { return scanf( %lf%lf , &x, &y); }\n int read(int &x, int &y, int &z) { return scanf( %d%d%d , &x, &y, &z); }\n int read(long long &x, long long &y, long long &z) {\n return scanf( %lld%lld%lld , &x, &y, &z);\n }\n int read(double &x, double &y, double &z) {\n return scanf( %lf%lf%lf , &x, &y, &z);\n }\n long long qpow(long long a, long long b, long long mod) {\n if (a == 0) return 0;\n long long ans = 1;\n a %= mod;\n while (b) {\n if (b & 1) ans = ans * a % mod;\n a = a * a % mod;\n b >>= 1;\n }\n return ans % mod;\n }\n long long inv(long long x, long long mod) { return qpow(x, mod - 2, mod); }\n int dir[4][2] = {0, 1, 0, -1, 1, 0, -1, 0};\n int mon[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\n const int INF = 0x3f3f3f3f;\n const int mod = 1e9 + 7;\n const int N = 5e5 + 5;\n struct DSU {\n int f[N];\n void init(int n) {\n for (int i = 0; i <= n; i++) f[i] = i;\n }\n int fa(int x) { return f[x] == x ? x : f[x] = fa(f[x]); }\n void join(int x, int y) {\n x = fa(x);\n y = fa(y);\n if (x != y) f[x] = y;\n }\n };\n struct CombMath {\n long long C[2005][2005];\n void init(int n) {\n for (int i = 0; i <= n; i++) C[i][0] = 1;\n for (int i = 1; i <= n; i++)\n for (int j = 1; j <= n; j++)\n C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;\n }\n };\n struct _2sat {\n vector G[N << 1];\n int dfn[N << 1], low[N << 1], stk[N << 1], color[N << 1];\n int t, tp, scc;\n bool vis[N << 1];\n void init(int n) {\n for (int i = 0; i <= 2 * n; i++) G[i].clear();\n for (int i = 0; i <= n * 2; i++) dfn[i] = low[i] = color[i] = vis[i] = 0;\n t = tp = scc = 0;\n }\n void add(int x, int xv, int y, int yv) {\n x = x * 2 + xv;\n y = y * 2 + yv;\n G[x ^ 1].push_back(y);\n G[y ^ 1].push_back(x);\n }\n void addmaodun(int x, int xv, int y, int yv) {\n x = x * 2 + (xv ^ 1);\n y = y * 2 + (yv ^ 1);\n G[x ^ 1].push_back(y);\n G[y ^ 1].push_back(x);\n }\n void tarjan(int x) {\n dfn[x] = low[x] = ++t;\n stk[++tp] = x;\n vis[x] = 1;\n for (auto v : G[x]) {\n if (!dfn[v]) {\n tarjan(v);\n low[x] = min(low[x], low[v]);\n } else if (vis[v])\n low[x] = min(low[x], dfn[v]);\n }\n if (low[x] == dfn[x]) {\n color[x] = ++scc;\n vis[x] = 0;\n while (stk[tp] != x) {\n color[stk[tp]] = scc;\n vis[stk[tp--]] = 0;\n }\n tp--;\n }\n }\n void work(int n) {\n for (int i = 0; i < 2 * n; i++)\n if (!dfn[i]) tarjan(i);\n for (int i = 0; i < n; i++)\n if (color[i * 2] == color[i * 2 + 1]) {\n puts( -1 );\n return;\n }\n vector row, col;\n for (int i = 0; i < n / 2; i++) {\n if (color[i * 2] < color[i * 2 + 1]) {\n continue;\n } else {\n row.push_back(i);\n }\n }\n for (int i = n / 2; i < n; i++) {\n if (color[i * 2] < color[i * 2 + 1]) {\n continue;\n } else {\n col.push_back(i - n / 2);\n }\n }\n int sz = row.size() + col.size();\n printf( %d\n , sz);\n for (auto it : row) printf( row %d\n , it);\n for (auto it : col) printf( col %d\n , it);\n }\n } twosat;\n char s[N];\n int a[2005];\n int g[2005][2005];\n signed main() {\n int n;\n read(n);\n getchar();\n for (int k = 1; k <= 2; k++) {\n for (int i = 1; i <= n; i++) {\n gets(s + 1);\n for (int j = 1; j <= n; j++) {\n g[i][j] ^= (s[j] - '0');\n }\n }\n }\n twosat.init(2 * n);\n gets(s + 1);\n for (int i = 1; i <= n; i++) a[i] = s[i] - '0';\n bool ok = 1;\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= n; j++) {\n int n1 = a[i], n2 = a[j];\n int ii = i - 1, jj = j + n - 1;\n if (g[i][j] == 1) {\n if (n1 == 1 and n2 == 1) {\n twosat.G[ii * 2].push_back(jj * 2 + 1);\n twosat.G[jj * 2].push_back(ii * 2 + 1);\n twosat.G[ii * 2 + 1].push_back(jj * 2);\n twosat.G[jj * 2 + 1].push_back(ii * 2);\n } else if (n2 == 1) {\n twosat.G[ii * 2].push_back(ii * 2 + 1);\n } else if (n1 == 1) {\n twosat.G[jj * 2].push_back(jj * 2 + 1);\n } else {\n ok = 0;\n }\n } else {\n if (n1 == 1 and n2 == 1) {\n twosat.G[ii * 2].push_back(jj * 2);\n twosat.G[ii * 2 + 1].push_back(jj * 2 + 1);\n twosat.G[jj * 2].push_back(ii * 2);\n twosat.G[jj * 2 + 1].push_back(ii * 2 + 1);\n } else if (n2 == 1) {\n twosat.G[ii * 2 + 1].push_back(ii * 2);\n } else if (n1 == 1) {\n twosat.G[jj * 2 + 1].push_back(jj * 2);\n } else {\n continue;\n }\n }\n }\n }\n if (!ok)\n puts( -1 );\n else {\n twosat.work(n * 2);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n FILE *in;\n FILE *out;\n int n, m, k;\n char a[64][64];\n int blocks[64][64];\n int cell[64 * 64][2];\n int dyn[64 * 64][4][2];\n int dir[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};\n void fill(int row, int col, int color) {\n blocks[row][col] = color;\n for (int i = 0; i < 4; i++) {\n int nrow = row + dir[i][0];\n if (nrow < 0 || nrow >= n) continue;\n int ncol = col + dir[i][1];\n if (ncol < 0 || ncol >= m) continue;\n if (a[row][col] == a[nrow][ncol] && blocks[nrow][ncol] == -1)\n fill(nrow, ncol, color);\n }\n }\n void getBlocks() {\n int nextColor = 0;\n memset(blocks, -1, sizeof(blocks));\n for (int i = 0; i < n; i++) {\n for (int c = 0; c < m; c++) {\n if (a[i][c] != '0' && blocks[i][c] == -1) {\n fill(i, c, nextColor);\n cell[nextColor][0] = i;\n cell[nextColor][1] = c;\n nextColor++;\n }\n }\n }\n }\n int main(void) {\n in = stdin;\n out = stdout;\n fscanf(in, %d %d , &n, &k);\n for (int i = 0; i < n; i++) fscanf(in, %s , a[i]);\n m = (int)strlen(a[0]);\n getBlocks();\n memset(dyn, -1, sizeof(dyn));\n int rem = k, cur = 0;\n int bp = 0, dp = 1, cp = 0;\n int foundCycle = 0;\n while (rem) {\n rem--;\n cur++;\n if (!foundCycle && dyn[bp][dp][cp] != -1) {\n foundCycle = 1;\n rem %= (cur - dyn[bp][dp][cp]);\n }\n dyn[bp][dp][cp] = cur;\n int row = cell[bp][0], col = cell[bp][1];\n while (1) {\n int nrow = row + dir[dp][0];\n if (nrow < 0 || nrow >= n) break;\n int ncol = col + dir[dp][1];\n if (ncol < 0 || ncol >= m) break;\n if (a[nrow][ncol] != a[row][col]) break;\n row = nrow;\n col = ncol;\n }\n int dd = (cp ? ((dp + 1) % 4) : ((dp + 3) % 4));\n while (1) {\n int nrow = row + dir[dd][0];\n if (nrow < 0 || nrow >= n) break;\n int ncol = col + dir[dd][1];\n if (ncol < 0 || ncol >= m) break;\n if (a[nrow][ncol] != a[row][col]) break;\n row = nrow;\n col = ncol;\n }\n int nrow = row + dir[dp][0];\n int ncol = col + dir[dp][1];\n if (nrow >= 0 && nrow < n && ncol >= 0 && ncol < m &&\n a[nrow][ncol] != '0') {\n bp = blocks[nrow][ncol];\n continue;\n }\n if (cp == 0)\n cp = 1;\n else {\n cp = 0;\n dp = (dp + 1) % 4;\n }\n }\n fprintf(out, %c\n , a[cell[bp][0]][cell[bp][1]]);\n return 0;\n }\n "} @@ -1158,7 +1158,7 @@ {"func_code_string": "#include \n using namespace std;\n const int N = 100007;\n int n, k;\n int s[N];\n int main() {\n scanf( %d %d , &n, &k);\n for (int i = 0; i < n; i++) scanf( %d , s + i);\n if (k >= n) {\n printf( %d\n , s[n - 1]);\n return 0;\n }\n int maxi = 0;\n while (n < 2 * k) {\n maxi = max(s[--n], maxi);\n k--;\n }\n for (int i = 0; i < k; i++) {\n maxi = max(s[i] + s[n - i - 1], maxi);\n }\n printf( %d\n , maxi);\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n scanf( %d , &n);\n printf( %d\n , n / 2 - (n % 2 ? 0 : 1));\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n string s, s1;\n int main() {\n cin >> s;\n cin >> s1;\n reverse(s.begin(), s.end());\n reverse(s1.begin(), s1.end());\n while (!s.empty() && s[s.size() - 1] == '0') s.pop_back();\n while (!s1.empty() && s1[s1.size() - 1] == '0') s1.pop_back();\n if (s.size() > s1.size())\n cout << '>';\n else if (s1.size() > s.size())\n cout << '<';\n else {\n int z = 0;\n for (int i = s.size() - 1; i >= 0 && z == 0; i--)\n if (s[i] > s1[i])\n z = 1;\n else if (s1[i] > s[i])\n z = 2;\n if (z == 1)\n cout << '>';\n else if (z == 2)\n cout << '<';\n else\n cout << '=';\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int N = 105, mod = 1e9 + 7;\n int dp[N][N * N];\n bool done[N][N * N];\n int fact[N], inv[N];\n int arr1[N];\n int arr2[N];\n int n, k;\n long long m;\n inline int add(int a, int b) {\n int res = a + b;\n if (res >= mod) res -= mod;\n return res;\n }\n inline int mult(int a, int b) {\n long long res = a * 1LL * b;\n return res % mod;\n }\n int powmod(int a, long long b) {\n int res = 1;\n while (b) {\n if (b & 1) {\n res = mult(res, a);\n }\n a = mult(a, a);\n b >>= 1;\n }\n return res;\n }\n int ncr(int n, int r) {\n int res = fact[n];\n res = mult(res, inv[r]);\n res = mult(res, inv[n - r]);\n return res;\n }\n int solve(int pos, int cnt) {\n if (cnt < 0) return 0;\n if (pos == n + 1) return (cnt == 0);\n if (done[pos][cnt]) return dp[pos][cnt];\n if ((n + 1 - pos) * n < cnt) return 0;\n long long p = m / n;\n bool b = (pos <= m % n);\n if (b) {\n for (int i = 0; i <= n; i++) {\n dp[pos][cnt] = add(mult(solve(pos + 1, cnt - i), arr2[i]), dp[pos][cnt]);\n }\n } else {\n for (int i = 0; i <= n; i++) {\n dp[pos][cnt] = add(mult(solve(pos + 1, cnt - i), arr1[i]), dp[pos][cnt]);\n }\n }\n done[pos][cnt] = true;\n return dp[pos][cnt];\n }\n int main() {\n scanf( %d %I64d %d , &n, &m, &k);\n fact[0] = 1, inv[0] = 1;\n long long p = m / n;\n for (int i = 1; i < N; i++) {\n fact[i] = mult(fact[i - 1], i);\n inv[i] = powmod(fact[i], mod - 2);\n }\n for (int i = 0; i <= n; i++) {\n arr1[i] = powmod(ncr(n, i), p);\n arr2[i] = powmod(ncr(n, i), p + 1);\n }\n memset(dp, 0, sizeof(dp));\n int ans = solve(1, k);\n printf( %d\n , ans);\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int N = 105, mod = 1e9 + 7;\n int dp[N][N * N];\n bool done[N][N * N];\n int fact[N], inv[N];\n int arr1[N];\n int arr2[N];\n int n, k;\n long long m;\n inline int add(int a, int b) {\n int res = a + b;\n if (res >= mod) res -= mod;\n return res;\n }\n inline int mult(int a, int b) {\n long long res = a * 1LL * b;\n return res % mod;\n }\n int powmod(int a, long long b) {\n int res = 1;\n while (b) {\n if (b & 1) {\n res = mult(res, a);\n }\n a = mult(a, a);\n b >>= 1;\n }\n return res;\n }\n int ncr(int n, int r) {\n int res = fact[n];\n res = mult(res, inv[r]);\n res = mult(res, inv[n - r]);\n return res;\n }\n int solve(int pos, int cnt) {\n if (cnt < 0) return 0;\n if (pos == n + 1) return (cnt == 0);\n if (done[pos][cnt]) return dp[pos][cnt];\n if ((n + 1 - pos) * n < cnt) return 0;\n long long p = m / n;\n bool b = (pos <= m % n);\n if (b) {\n for (int i = 0; i <= n; i++) {\n dp[pos][cnt] = add(mult(solve(pos + 1, cnt - i), arr2[i]), dp[pos][cnt]);\n }\n } else {\n for (int i = 0; i <= n; i++) {\n dp[pos][cnt] = add(mult(solve(pos + 1, cnt - i), arr1[i]), dp[pos][cnt]);\n }\n }\n done[pos][cnt] = true;\n return dp[pos][cnt];\n }\n int main() {\n scanf( %d extra %d , &n, &m, &k);\n fact[0] = 1, inv[0] = 1;\n long long p = m / n;\n for (int i = 1; i < N; i++) {\n fact[i] = mult(fact[i - 1], i);\n inv[i] = powmod(fact[i], mod - 2);\n }\n for (int i = 0; i <= n; i++) {\n arr1[i] = powmod(ncr(n, i), p);\n arr2[i] = powmod(ncr(n, i), p + 1);\n }\n memset(dp, 0, sizeof(dp));\n int ans = solve(1, k);\n printf( %d\n , ans);\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, m;\n int a[11], b[11];\n scanf( %d %d , &n, &m);\n for (int i = 0; i < n; i++) {\n scanf( %d , a + i);\n }\n for (int i = 0; i < m; i++) {\n scanf( %d , b + i);\n }\n sort(a, a + n);\n sort(b, b + m);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (a[i] == b[j]) {\n printf( %d\n , a[i]);\n return 0;\n }\n }\n }\n if (a[0] > b[0])\n printf( %d%d\n , b[0], a[0]);\n else\n printf( %d%d\n , a[0], b[0]);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int in() {\n int a;\n scanf( %d , &a);\n return a;\n }\n double din() {\n double a;\n scanf( %lf , &a);\n return a;\n }\n int gcd(int a, int b) {\n while (b) {\n a %= b;\n swap(a, b);\n }\n return a;\n }\n int lcm(int a, int b) { return a / gcd(a, b) * b; }\n const double eps = 1e-6;\n int logbin(int a) {\n a--;\n int res = 1;\n while (a) a >>= 1, res <<= 1;\n return res;\n }\n int binpow(int a, int n) {\n int res = 1;\n while (n) {\n if (n & 1) res *= a;\n a *= a;\n n >>= 1;\n }\n return res;\n }\n vector > g;\n vector u;\n vector p;\n void dfs(int v) {\n u[v] = 1;\n for (int i = 0; i < g[v].size(); ++i) {\n int to = g[v][i];\n if (!u[to]) {\n p[to] = v;\n dfs(to);\n } else {\n if (u[to] == 1) {\n int vv = v;\n while (p[vv] != to) {\n u[vv] = 3;\n vv = p[vv];\n }\n }\n }\n }\n if (u[v] == 1) u[v] = 2;\n }\n int main() {\n int n = in();\n int m = in(), k = in();\n vector > > > g(\n n, vector > >());\n for (int i = 0; i < n; ++i) {\n string s;\n cin >> s;\n for (int j = 0; j < m; ++j) {\n int u = in(), e = in(), h = in();\n g[i].push_back(make_pair(u, make_pair(e, h)));\n }\n }\n long long res = 0;\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (i == j) continue;\n vector > > s, t;\n s = g[i];\n t = g[j];\n vector c;\n long long r = 0;\n for (int y = 0; y < m; ++y) {\n int nn = s[y].second.second;\n for (int h = 0; h < nn; ++h) {\n int buf = t[y].second.first - s[y].first;\n if (buf > 0)\n c.push_back(buf);\n else\n break;\n }\n }\n sort((c).rbegin(), (c).rend());\n for (int i = 0; i < min((int)c.size(), k); ++i) {\n r += c[i];\n }\n res = max(res, r);\n }\n }\n cout << res;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n bool sortinrev(const pair &a,\n const pair &b) {\n return (a.first > b.first);\n }\n void solve() {\n long long n;\n cin >> n;\n long long a[n];\n map mp;\n for (long long i = 0; i < n; i++) {\n cin >> a[i];\n mp[a[i]] = i;\n }\n long long p = 1;\n long long end = n;\n while (end != 0) {\n long long k = mp[p];\n for (long long i = k; i < end; i++) {\n if (a[i] != p) {\n cout << No \n << \n ;\n return;\n }\n p++;\n }\n end = k;\n }\n cout << Yes \n << \n ;\n }\n signed main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n long long t = 1;\n cin >> t;\n while (t--) {\n solve();\n }\n }\n "} @@ -1228,7 +1228,7 @@ {"func_code_string": "#include \n using namespace std;\n int MinDist(int n, int k, const string& s) {\n int first_cow_pos = 0;\n while (first_cow_pos < n && s[first_cow_pos] == '1') {\n ++first_cow_pos;\n }\n int last_cow_pos = first_cow_pos;\n int rooms = 1;\n while (rooms < k + 1) {\n ++last_cow_pos;\n if (s[last_cow_pos] == '0') {\n ++rooms;\n }\n }\n int farmer_pos = first_cow_pos;\n int delta = last_cow_pos - first_cow_pos;\n for (int i = first_cow_pos + 1; i <= last_cow_pos; ++i) {\n if (s[i] == '0' && i - first_cow_pos < delta && last_cow_pos - i < delta) {\n delta = max(i - first_cow_pos, last_cow_pos - i);\n farmer_pos = i;\n }\n }\n --rooms;\n for (++first_cow_pos; first_cow_pos < n; ++first_cow_pos) {\n if (s[first_cow_pos] == '1') {\n continue;\n }\n while (rooms < k + 1 && last_cow_pos < n) {\n ++last_cow_pos;\n if (last_cow_pos == n) {\n break;\n }\n if (s[last_cow_pos] == '0') {\n ++rooms;\n }\n }\n if (last_cow_pos == n) {\n break;\n }\n int npos = max(farmer_pos, first_cow_pos);\n int cur_delta = max(farmer_pos - first_cow_pos, last_cow_pos - farmer_pos);\n while (npos < last_cow_pos) {\n ++npos;\n if (s[npos] == '1') {\n continue;\n }\n if (npos - first_cow_pos < cur_delta && last_cow_pos - npos < cur_delta) {\n cur_delta = max(npos - first_cow_pos, last_cow_pos - npos);\n farmer_pos = npos;\n } else if (npos - first_cow_pos >= cur_delta) {\n break;\n }\n }\n delta = min(delta, cur_delta);\n --rooms;\n }\n return delta;\n }\n int MinDistSlow(int n, int k, const string& s) {\n int result = n;\n for (int fcp = 0; fcp < n; ++fcp) {\n if (s[fcp] == '1') {\n continue;\n }\n int lcp = fcp;\n int rooms = 1;\n while (rooms < k + 1 && lcp < n) {\n ++lcp;\n if (lcp == n) {\n break;\n }\n if (s[lcp] == '0') {\n ++rooms;\n }\n }\n if (lcp == n) {\n break;\n }\n for (int fp = fcp; fp <= lcp; ++fp) {\n if (s[fp] == '1') {\n continue;\n }\n int delta = max(fp - fcp, lcp - fp);\n if (delta < result) {\n result = delta;\n }\n }\n }\n return result;\n }\n int main() {\n int n, k;\n cin >> n >> k;\n string s;\n char buffer[1000000];\n scanf( %s , buffer);\n s = buffer;\n int delta = MinDist(n, k, s);\n cout << delta << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int inf = 1e9;\n const long long INF = 1e18;\n long long n, sum, ans;\n long long a[200010];\n struct BIT {\n long long tree[600010];\n BIT() { memset(tree, 0, sizeof(tree)); }\n void update(long long i, long long x) {\n while (i <= 600000) {\n tree[i] += x;\n i += i & -i;\n }\n }\n long long sum(long long i) {\n long long ret = 0;\n while (i) {\n ret += tree[i];\n i -= i & -i;\n }\n return ret;\n }\n } t1, t2;\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n ;\n cin >> n;\n for (long long i = 1; i <= n; i++) {\n cin >> a[i];\n ans += (i - 1) * a[i] - t1.sum(a[i]);\n long long x = sum;\n for (long long j = a[i]; j <= 300000; j += a[i]) {\n t1.update(j, a[i]);\n x -= (j / a[i]) * a[i] * (t2.sum(j + a[i] - 1) - t2.sum(j - 1));\n }\n ans += x;\n sum += a[i];\n t2.update(a[i], 1);\n cout << ans << ;\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct city_t : array, 4> {\n int n, k, m, p;\n city_t() { cin >> n >> k, m = n / 2, p = n - 2; }\n void hotel(int i, int j) {\n if (!(*this)[i][j] && k > 0) (*this)[i][j] = true, k--;\n }\n void solve() {\n if (k % 2) hotel(1, m);\n for (int i = 1; i < 3 && k > 0; i++)\n for (int u = 1, v = p; v > u && k > 0; u++, v--) hotel(i, u), hotel(i, v);\n hotel(1, m), hotel(2, m);\n }\n void write() {\n cout << YES ;\n for (int i = 0; i < 4; i++) {\n cout << '\n';\n for (int j = 0; j < n; j++)\n if ((*this)[i][j])\n cout << '#';\n else\n cout << '.';\n }\n }\n };\n int main() {\n ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);\n city_t city;\n city.solve(), city.write();\n }\n "} -{"func_code_string": "#include \n using namespace std;\n template \n inline void smin(T &a, T b) {\n if (a > b) a = b;\n }\n template \n inline void smax(T &a, T b) {\n if (a < b) a = b;\n }\n int V, E, src, tar;\n int head[60000], work[60000], dis[60000];\n int to[2000000], cap[2000000], nxt[2000000];\n int q[60000], qf, qb;\n void init(int n) {\n memset(head, -1, sizeof(int) * n);\n V = n;\n E = 0;\n }\n void add_edge(int u, int v, int c) {\n to[E] = v;\n cap[E] = c;\n nxt[E] = head[u];\n head[u] = E++;\n to[E] = u;\n cap[E] = 0;\n nxt[E] = head[v];\n head[v] = E++;\n }\n bool bfs() {\n memset(dis, -1, sizeof(dis));\n qf = qb = 0;\n q[qb++] = src;\n dis[src] = 0;\n while (qf < qb && dis[tar] == -1) {\n int u = q[qf++];\n for (int i = head[u]; i >= 0; i = nxt[i]) {\n int v = to[i];\n if (dis[v] == -1 && cap[i] > 0) {\n dis[v] = dis[u] + 1;\n q[qb++] = v;\n }\n }\n }\n return dis[tar] >= 0;\n }\n int dfs(int u, int &bot) {\n int v, bot1, delta;\n if (u == tar) return bot;\n for (int &i = work[u]; i >= 0; i = nxt[i]) {\n v = to[i];\n if (dis[v] != dis[u] + 1 || cap[i] == 0) continue;\n bot1 = min(bot, cap[i]);\n if (delta = dfs(v, bot1)) {\n cap[i] -= delta;\n cap[i ^ 1] += delta;\n bot = bot1;\n return delta;\n }\n }\n return 0;\n }\n int dinic() {\n int ans = 0, delta, bot;\n while (bfs()) {\n memcpy(work, head, sizeof(int) * V);\n delta = 0x3f3f3f3f;\n while (delta = dfs(src, bot = 0x3f3f3f3f)) ans += delta;\n }\n return ans;\n }\n int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};\n int n, m, dst[33][33][33][33];\n char grid[33][33];\n int c[2], x[2][33 * 33], y[2][33 * 33], t[2][33 * 33];\n bool can(long long mid) {\n int A = c[0], nm = n * m;\n src = A * 2 + 2 * nm, tar = src + 1;\n init(tar + 10);\n for (int i = (0); i < (A); i++) add_edge(src, i, 1);\n for (int i = (0); i < (A); i++) add_edge(A + 2 * nm + i, tar, 1);\n for (int i = (0); i < (nm); i++) add_edge(A + i, A + nm + i, 1);\n for (int r = (0); r < (2); r++)\n for (int k = (0); k < (A); k++)\n for (int i = (0); i < (n); i++)\n for (int j = (0); j < (m); j++) {\n if (grid[i][j] == '#') continue;\n int xx = x[r][k], yy = y[r][k], tt = t[r][k];\n if (dst[xx][yy][i][j] < 1000 &&\n (long long)dst[xx][yy][i][j] * tt <= mid) {\n if (!r)\n add_edge(k, A + i * m + j, 1);\n else\n add_edge(A + nm + i * m + j, k + A + 2 * nm, 1);\n }\n }\n return dinic() == A;\n }\n int main() {\n ;\n scanf( %d%d%d%d , &n, &m, &c[0], &c[1]);\n for (int i = (0); i < (n); i++) scanf( %s , grid[i]);\n int u, v, w;\n scanf( %d%d%d , &u, &v, &w);\n u--;\n v--;\n for (int i = (0); i < (2); i++)\n for (int j = (0); j < (c[i]); j++) {\n scanf( %d%d%d , &x[i][j], &y[i][j], &t[i][j]);\n x[i][j]--;\n y[i][j]--;\n }\n if (c[0] < c[1]) {\n x[0][c[0]] = u;\n y[0][c[0]] = v;\n t[0][c[0]++] = w;\n } else {\n x[1][c[1]] = u;\n y[1][c[1]] = v;\n t[1][c[1]++] = w;\n }\n if (c[0] != c[1]) {\n puts( -1 );\n return 0;\n }\n memset(dst, 0x3f, sizeof(dst));\n for (int i = (0); i < (n); i++)\n for (int j = (0); j < (m); j++) {\n if (grid[i][j] == '#') continue;\n qb = qf = 0;\n q[qb++] = i;\n q[qb++] = j;\n dst[i][j][i][j] = 0;\n while (qb > qf) {\n u = q[qf++];\n v = q[qf++];\n for (int k = (0); k < (4); k++) {\n int uu = u + dx[k], vv = v + dy[k];\n if ((uu < 0 || vv < 0 || uu >= n || vv >= m)) continue;\n if (grid[uu][vv] == '#') continue;\n if (dst[i][j][uu][vv] > dst[i][j][u][v] + 1) {\n dst[i][j][uu][vv] = dst[i][j][u][v] + 1;\n q[qb++] = uu;\n q[qb++] = vv;\n }\n }\n }\n }\n long long st = -1, ed = (1LL << 40), mid;\n while (st + 1 < ed) {\n mid = (st + ed) >> 1;\n if (can(mid))\n ed = mid;\n else\n st = mid;\n }\n if (ed == (1LL << 40))\n puts( -1 );\n else\n printf( %I64d\n , ed);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n template \n inline void smin(T &a, T b) {\n if (a > b) a = b;\n }\n template \n inline void smax(T &a, T b) {\n if (a < b) a = b;\n }\n int V, E, src, tar;\n int head[60000], work[60000], dis[60000];\n int to[2000000], cap[2000000], nxt[2000000];\n int q[60000], qf, qb;\n void init(int n) {\n memset(head, -1, sizeof(int) * n);\n V = n;\n E = 0;\n }\n void add_edge(int u, int v, int c) {\n to[E] = v;\n cap[E] = c;\n nxt[E] = head[u];\n head[u] = E++;\n to[E] = u;\n cap[E] = 0;\n nxt[E] = head[v];\n head[v] = E++;\n }\n bool bfs() {\n memset(dis, -1, sizeof(dis));\n qf = qb = 0;\n q[qb++] = src;\n dis[src] = 0;\n while (qf < qb && dis[tar] == -1) {\n int u = q[qf++];\n for (int i = head[u]; i >= 0; i = nxt[i]) {\n int v = to[i];\n if (dis[v] == -1 && cap[i] > 0) {\n dis[v] = dis[u] + 1;\n q[qb++] = v;\n }\n }\n }\n return dis[tar] >= 0;\n }\n int dfs(int u, int &bot) {\n int v, bot1, delta;\n if (u == tar) return bot;\n for (int &i = work[u]; i >= 0; i = nxt[i]) {\n v = to[i];\n if (dis[v] != dis[u] + 1 || cap[i] == 0) continue;\n bot1 = min(bot, cap[i]);\n if (delta = dfs(v, bot1)) {\n cap[i] -= delta;\n cap[i ^ 1] += delta;\n bot = bot1;\n return delta;\n }\n }\n return 0;\n }\n int dinic() {\n int ans = 0, delta, bot;\n while (bfs()) {\n memcpy(work, head, sizeof(int) * V);\n delta = 0x3f3f3f3f;\n while (delta = dfs(src, bot = 0x3f3f3f3f)) ans += delta;\n }\n return ans;\n }\n int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};\n int n, m, dst[33][33][33][33];\n char grid[33][33];\n int c[2], x[2][33 * 33], y[2][33 * 33], t[2][33 * 33];\n bool can(long long mid) {\n int A = c[0], nm = n * m;\n src = A * 2 + 2 * nm, tar = src + 1;\n init(tar + 10);\n for (int i = (0); i < (A); i++) add_edge(src, i, 1);\n for (int i = (0); i < (A); i++) add_edge(A + 2 * nm + i, tar, 1);\n for (int i = (0); i < (nm); i++) add_edge(A + i, A + nm + i, 1);\n for (int r = (0); r < (2); r++)\n for (int k = (0); k < (A); k++)\n for (int i = (0); i < (n); i++)\n for (int j = (0); j < (m); j++) {\n if (grid[i][j] == '#') continue;\n int xx = x[r][k], yy = y[r][k], tt = t[r][k];\n if (dst[xx][yy][i][j] < 1000 &&\n (long long)dst[xx][yy][i][j] * tt <= mid) {\n if (!r)\n add_edge(k, A + i * m + j, 1);\n else\n add_edge(A + nm + i * m + j, k + A + 2 * nm, 1);\n }\n }\n return dinic() == A;\n }\n int main() {\n ;\n scanf( %d%d%d%d , &n, &m, &c[0], &c[1]);\n for (int i = (0); i < (n); i++) scanf( %s , grid[i]);\n int u, v, w;\n scanf( %d%d%d , &u, &v, &w);\n u--;\n v--;\n for (int i = (0); i < (2); i++)\n for (int j = (0); j < (c[i]); j++) {\n scanf( %d%d%d , &x[i][j], &y[i][j], &t[i][j]);\n x[i][j]--;\n y[i][j]--;\n }\n if (c[0] < c[1]) {\n x[0][c[0]] = u;\n y[0][c[0]] = v;\n t[0][c[0]++] = w;\n } else {\n x[1][c[1]] = u;\n y[1][c[1]] = v;\n t[1][c[1]++] = w;\n }\n if (c[0] != c[1]) {\n puts( -1 );\n return 0;\n }\n memset(dst, 0x3f, sizeof(dst));\n for (int i = (0); i < (n); i++)\n for (int j = (0); j < (m); j++) {\n if (grid[i][j] == '#') continue;\n qb = qf = 0;\n q[qb++] = i;\n q[qb++] = j;\n dst[i][j][i][j] = 0;\n while (qb > qf) {\n u = q[qf++];\n v = q[qf++];\n for (int k = (0); k < (4); k++) {\n int uu = u + dx[k], vv = v + dy[k];\n if ((uu < 0 || vv < 0 || uu >= n || vv >= m)) continue;\n if (grid[uu][vv] == '#') continue;\n if (dst[i][j][uu][vv] > dst[i][j][u][v] + 1) {\n dst[i][j][uu][vv] = dst[i][j][u][v] + 1;\n q[qb++] = uu;\n q[qb++] = vv;\n }\n }\n }\n }\n long long st = -1, ed = (1LL << 40), mid;\n while (st + 1 < ed) {\n mid = (st + ed) >> 1;\n if (can(mid))\n ed = mid;\n else\n st = mid;\n }\n if (ed == (1LL << 40))\n puts( -1 );\n else\n printf( extra\n , ed);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long n, m, k, x, y, z;\n int main() {\n cin >> n >> k >> m;\n if (m <= k)\n cout << m << endl;\n else if (m <= n)\n cout << k << endl;\n else {\n long long tmp = n + k;\n cout << tmp - m << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n vector E[3010];\n int mark[3010];\n int c, f;\n bool find(int i, int p) {\n if (mark[i] == 1) {\n c = i;\n f = 1;\n return true;\n }\n mark[i] = 1;\n for (vector::iterator to = E[i].begin(); to < E[i].end(); to++) {\n if (*to != p && find(*to, i)) {\n if (f) mark[i] = 2;\n if (i == c) f = 0;\n return true;\n }\n }\n return false;\n }\n int ans[3010];\n void bfs(int i) {\n queue v;\n v.push(i);\n while (!v.empty()) {\n int to = v.front();\n v.pop();\n for (vector::iterator at = E[to].begin(); at < E[to].end(); at++) {\n if (ans[*at] > ans[to] + 1) {\n ans[*at] = ans[to] + 1;\n v.push(*at);\n }\n }\n }\n }\n int main() {\n int n;\n scanf( %d , &n);\n for (int i = 0; i < n; i++) {\n int a, b;\n scanf( %d%d , &a, &b);\n a--;\n b--;\n E[a].push_back(b);\n E[b].push_back(a);\n }\n find(0, -1);\n for (int i = 0; i < 3010; i++) ans[i] = 10000000;\n for (int i = 0; i < n; i++)\n if (mark[i] == 2) {\n ans[i] = 0;\n bfs(i);\n }\n for (int i = 0; i < n; i++) printf( %d , ans[i]);\n return 0;\n }\n "} {"func_code_string": "#include \n #pragma GCC optimize( Ofast )\n #pragma GCC optimize( unroll-loops )\n int main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n int n, k;\n std::cin >> n >> k;\n int64_t s1 = 0;\n int s2 = 0;\n for (int i = 0; i < k; ++i) {\n int a, b;\n std::cin >> a >> b;\n s1 += b;\n s2 = (s2 + 1ll * a * b) % n;\n }\n if (s1 > n) {\n std::cout << -1 << \n ;\n } else if (s1 < n) {\n std::cout << 1 << \n ;\n } else if (1ll * n * (n - 1) / 2 % n == s2) {\n std::cout << 1 << \n ;\n } else {\n std::cout << -1 << \n ;\n }\n return 0;\n }\n "} @@ -1269,9 +1269,9 @@ {"func_code_string": "#include \n using namespace std;\n const int maxn = 1e3 + 5;\n const int maxm = 1 << 13;\n int n;\n long long k;\n pair dp[maxn][maxm];\n int pre[maxn][maxm];\n long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }\n vector v;\n void get_div(long long k) {\n for (long long i = 1; i * i <= k; i++) {\n if (k % i == 0) {\n long long j = k / i;\n v.push_back(i);\n if (i != j) v.push_back(j);\n }\n }\n sort(v.begin(), v.end());\n }\n long long a[maxn], c[maxn];\n int main() {\n scanf( %d%lld , &n, &k);\n get_div(k);\n for (int i = 1; i <= n; i++) {\n scanf( %lld , &a[i]);\n c[i] = gcd(a[i], k);\n }\n if (k == 1) {\n printf( 1\n );\n int p = 1;\n long long minn = a[1];\n for (int i = 2; i <= n; i++) {\n if (a[i] < minn) minn = a[i], p = i;\n }\n printf( %d\n , p);\n return 0;\n }\n int m = v.size();\n for (int i = 0; i <= n; i++)\n for (int j = 0; j < m; j++) dp[i][j] = make_pair((int)1e9, (long long)1e16);\n dp[0][0] = make_pair(0, 0);\n for (int i = 1; i <= n; i++)\n for (int j = 0; j < m; j++) {\n if (dp[i][j] > dp[i - 1][j]) {\n dp[i][j] = dp[i - 1][j];\n pre[i][j] = j;\n }\n int t =\n lower_bound(v.begin(), v.end(), v[j] / gcd(v[j], c[i])) - v.begin();\n if (dp[i][j] >\n make_pair(dp[i - 1][t].first + 1, dp[i - 1][t].second + a[i])) {\n dp[i][j] =\n make_pair(dp[i - 1][t].first + 1, dp[i - 1][t].second + a[i]);\n pre[i][j] = t;\n }\n }\n if (dp[n][m - 1].first > n)\n printf( -1\n );\n else {\n printf( %d\n , dp[n][m - 1].first);\n int k = m - 1;\n bool first = true;\n for (int i = n; i >= 1; i--) {\n if (pre[i][k] != k) {\n if (first) {\n printf( %d , i);\n first = false;\n } else\n printf( %d , i);\n }\n k = pre[i][k];\n }\n }\n printf( \n );\n return 0;\n }\n "} {"func_code_string": "#include \n int dp[1000];\n int mm[200][200];\n int main() {\n int i, j, n, m, t;\n dp[3] = 3;\n for (i = 4; i < 1000; ++i) dp[i] = dp[i - 1] + i - 1;\n while (scanf( %d , &n) != EOF) {\n for (i = 3; i < 1000; ++i) {\n if (dp[i] > n) break;\n }\n m = i - 1;\n printf( %d\n , m);\n t = 1;\n for (i = 1; i < m; ++i) {\n for (j = i; j < m; ++j) mm[i][j] = mm[j + 1][i] = t++;\n }\n for (i = 1; i <= m; ++i) {\n for (j = 1; j < m; ++j) printf( %d , mm[i][j]);\n printf( \n );\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include\n #include\n #define int long long\n #include\n #define rep(i,a,b) for(int i=a;i v[N];\n int siz[N];\n int lvl[N];\n \n int forefather[N];\n \n int tim = 0, st[N], et[N];\n \n void dfs(int z,int p = -1,int ff = 0){\n if(p == -1) lvl[z] = 0;\n else lvl[z] = lvl[p] + 1;\n \n if(lvl[z] == 1) ff = z;\n forefather[z] = ff;\n \n st[z] = tim++;\n \n siz[z] = 1;\n for(int x:v[z]){\n if(x == p) continue;\n dfs(x,z,ff);\n siz[z] += siz[x];\n }\n et[z] = tim;\n }\n \n // x is ancestor of y\n bool ancestor(int x,int y){\n if(st[y] > st[x] && et[y] <= et[x]){\n return true;\n }\n return false;\n }\n \n int calc(int x,int y){\n if(y == 0) swap(x,y);\n if(x == 0){\n return siz[y] * (siz[0] - siz[forefather[y]]);\n }\n return siz[x] * siz[y];\n }\n \n void solve(){\n tim = 0;\n int n;\n cin >> n;\n rep(i,0,n){\n v[i].clear();\n siz[i] = 0;\n lvl[i] = 0;\n forefather[i] = 0;\n }\n rep(i,1,n){\n int x,y;\n cin >> x >> y;\n v[x].pb(y);\n v[y].pb(x);\n }\n \n dfs(0);\n \n int paths = n * (n - 1) / 2;\n int donthavezero = 0;\n rep(i,1,n){\n if(lvl[i] != 1) continue;\n donthavezero += siz[i] * (siz[i] - 1) / 2;\n }\n cout << donthavezero << ;\n paths -= donthavezero;\n \n int a = 0, b = 0;\n \n rep(i,1,n){\n if(paths == 0){\n cout << 0 << ;\n continue;\n }\n if(a == 0) swap(a,b);\n if(ancestor(i,a) || ancestor(i,b)){\n cout << 0 << ;\n continue;\n }\n if(ancestor(a,i)){\n a = i;\n int wont_work = calc(a,b);\n cout << paths - wont_work << ;\n paths = wont_work;\n }\n else if(ancestor(b,i)){\n if(forefather[i] == forefather[a]){\n cout << paths << ;\n paths = 0;\n continue;\n }\n b = i;\n int wont_work = calc(a,b);\n cout << paths - wont_work << ;\n paths = wont_work;\n }\n else{\n cout << paths << ;\n paths = 0;\n }\n }\n \n cout << paths;\n \n cout << \n ;\n }\n signed main(){\n ios_base::sync_with_stdio(false);\n cin.tie(0);cout.tie(0);\n \n int t=1;\n cin>>t;\n while(t--) solve();\n return 0;\n }"} -{"func_code_string": "#include \n using namespace std;\n long long ans = -((long long)1 << 62);\n int n, u, r;\n int a[105];\n int b[105];\n int k[105];\n int p[105];\n void process(int m, int op) {\n if (((u - m) & 1) == 0) {\n long long an = 0;\n for (int i = 1; i <= n; i++) an += a[i] * k[i];\n ans = max(an, ans);\n }\n if (m == u) {\n return;\n }\n if (op == 0) {\n for (int i = 1; i <= n; i++) a[i] ^= b[i];\n process(m + 1, 1);\n for (int i = 1; i <= n; i++) a[i] ^= b[i];\n }\n vector a1;\n a1.push_back(1);\n for (int i = 1; i <= n; i++) a1.push_back(a[i]);\n for (int i = 1; i <= n; i++) a[i] = a1[p[i]] + r;\n process(m + 1, 0);\n for (int i = 1; i <= n; i++) a[i] = a1[i];\n }\n int main() {\n scanf( %d %d %d , &n, &u, &r);\n for (int i = 1; i <= n; i++) scanf( %d , &a[i]);\n for (int i = 1; i <= n; i++) scanf( %d , &b[i]);\n for (int i = 1; i <= n; i++) scanf( %d , &k[i]);\n for (int i = 1; i <= n; i++) scanf( %d , &p[i]);\n process(0, 0);\n printf( %I64d , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long ans = -((long long)1 << 62);\n int n, u, r;\n int a[105];\n int b[105];\n int k[105];\n int p[105];\n void process(int m, int op) {\n if (((u - m) & 1) == 0) {\n long long an = 0;\n for (int i = 1; i <= n; i++) an += a[i] * k[i];\n ans = max(an, ans);\n }\n if (m == u) {\n return;\n }\n if (op == 0) {\n for (int i = 1; i <= n; i++) a[i] ^= b[i];\n process(m + 1, 1);\n for (int i = 1; i <= n; i++) a[i] ^= b[i];\n }\n vector a1;\n a1.push_back(1);\n for (int i = 1; i <= n; i++) a1.push_back(a[i]);\n for (int i = 1; i <= n; i++) a[i] = a1[p[i]] + r;\n process(m + 1, 0);\n for (int i = 1; i <= n; i++) a[i] = a1[i];\n }\n int main() {\n scanf( %d %d %d , &n, &u, &r);\n for (int i = 1; i <= n; i++) scanf( %d , &a[i]);\n for (int i = 1; i <= n; i++) scanf( %d , &b[i]);\n for (int i = 1; i <= n; i++) scanf( %d , &k[i]);\n for (int i = 1; i <= n; i++) scanf( %d , &p[i]);\n process(0, 0);\n printf( extra , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n int m;\n int k;\n vector > A;\n cin >> n >> m >> k;\n for (int i = 0; i < n; i++) {\n vector X;\n for (int j = 0; j < m; j++) {\n int l;\n cin >> l;\n X.push_back(l);\n }\n A.push_back(X);\n }\n int totalSum = 0;\n int changes = 0;\n for (int j = 0; j < m; j++) {\n int maxSum = 0;\n vector maxI;\n maxI.push_back(0);\n for (int i = 0; i < n; i++) {\n if (A[i][j] == 1) {\n int sum = 0;\n for (int z = i; z < min(i + k, n); z++) {\n sum += A[z][j];\n }\n if (sum > maxSum) {\n maxSum = sum;\n for (int elem = 0; elem < maxI.size(); elem++) {\n maxI[elem] = i;\n }\n } else if (sum == maxSum) {\n maxI.push_back(i);\n }\n }\n }\n int minimumChanges = 10000000;\n for (auto elem : maxI) {\n int toChange = 0;\n for (int i = 0; i < elem; i++) {\n if (A[i][j] == 1) {\n toChange++;\n }\n }\n if (toChange < minimumChanges) {\n minimumChanges = toChange;\n }\n }\n changes += minimumChanges;\n totalSum += maxSum;\n }\n cout << totalSum << << changes;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int maxh = 200 * 1000 + 5;\n struct item {\n int pos, hash;\n item(int pos, int hash) : pos(pos), hash(hash) {}\n };\n bool operator<(item a, item b) { return a.pos < b.pos; }\n int n, m, h;\n set S[maxh];\n map M;\n int pos[maxh];\n int Len[maxh];\n int Base[maxh];\n bool used[maxh];\n long long add(int x, int hash) {\n int base = Base[hash];\n set::iterator it = S[base].lower_bound(item(pos[hash], hash));\n if (it == S[base].end()) {\n it = S[base].begin();\n }\n int nhash = it->hash;\n M[x] = nhash;\n S[base].erase(it);\n long long res = pos[nhash] - pos[hash];\n if (res < 0) {\n res += Len[base];\n }\n return res;\n }\n void del(int x) {\n int base = Base[M[x]];\n S[base].insert(item(pos[M[x]], M[x]));\n }\n int main() {\n scanf( %d%d%d , &h, &m, &n);\n for (int i = 0; i < h; ++i) {\n if (used[i]) {\n continue;\n }\n for (int j = i, p = 0; !used[j]; j += m, j %= h, ++p) {\n S[i].insert(item(p, j));\n pos[j] = p;\n Base[j] = i;\n used[j] = 1;\n }\n Len[i] = (int)S[i].size();\n }\n long long res = 0;\n for (int i = 0; i < n; ++i) {\n char op;\n int id;\n scanf( \n%c %d , &op, &id);\n if (op == '+') {\n int hash;\n scanf( %d , &hash);\n res += add(id, hash);\n } else {\n del(id);\n }\n }\n printf( %I64d\n , res);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int maxh = 200 * 1000 + 5;\n struct item {\n int pos, hash;\n item(int pos, int hash) : pos(pos), hash(hash) {}\n };\n bool operator<(item a, item b) { return a.pos < b.pos; }\n int n, m, h;\n set S[maxh];\n map M;\n int pos[maxh];\n int Len[maxh];\n int Base[maxh];\n bool used[maxh];\n long long add(int x, int hash) {\n int base = Base[hash];\n set::iterator it = S[base].lower_bound(item(pos[hash], hash));\n if (it == S[base].end()) {\n it = S[base].begin();\n }\n int nhash = it->hash;\n M[x] = nhash;\n S[base].erase(it);\n long long res = pos[nhash] - pos[hash];\n if (res < 0) {\n res += Len[base];\n }\n return res;\n }\n void del(int x) {\n int base = Base[M[x]];\n S[base].insert(item(pos[M[x]], M[x]));\n }\n int main() {\n scanf( %d%d%d , &h, &m, &n);\n for (int i = 0; i < h; ++i) {\n if (used[i]) {\n continue;\n }\n for (int j = i, p = 0; !used[j]; j += m, j %= h, ++p) {\n S[i].insert(item(p, j));\n pos[j] = p;\n Base[j] = i;\n used[j] = 1;\n }\n Len[i] = (int)S[i].size();\n }\n long long res = 0;\n for (int i = 0; i < n; ++i) {\n char op;\n int id;\n scanf( \n%c %d , &op, &id);\n if (op == '+') {\n int hash;\n scanf( %d , &hash);\n res += add(id, hash);\n } else {\n del(id);\n }\n }\n printf( extra\n , res);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long const MAXN = 5e1 + 8;\n long long const INF = 3e3 + 8;\n long long const delta = 1000000007;\n long long a[MAXN];\n long long dp[MAXN][MAXN][INF];\n double calc(long long t, long long n, long long b) {\n double ans = t;\n for (long long i = b + 1; i <= n; i++) ans /= (double)i;\n for (long long i = 1; i <= n - b; i++) ans *= (double)i;\n return ans;\n }\n int main() {\n std::ios::sync_with_stdio(0);\n ;\n cin.tie(0);\n cout.tie(0);\n long long n;\n cin >> n;\n for (long long i = 1; i <= n; i++) cin >> a[i];\n long long p;\n cin >> p;\n cout.precision(10);\n cout << fixed;\n double ans = 0;\n dp[0][0][0] = 1;\n for (long long i = 1; i <= n; i++) {\n for (long long j = 0; j <= n; j++) {\n for (long long k = 0; k < INF; k++) {\n dp[i][j][k] = dp[i - 1][j][k];\n if (j && k >= a[i]) dp[i][j][k] += dp[i - 1][j - 1][k - a[i]];\n }\n }\n }\n for (long long i = 1; i <= p; i++) {\n for (long long j = 1; j <= n; j++) ans += calc(dp[n][j][i], n, j);\n }\n cout << ans;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 5005;\n const int K = 100005;\n int n, m, k;\n int t, p;\n int l[N], c[N], x[K];\n int main() {\n scanf( %d%d%d , &n, &m, &k);\n x[0] = 0;\n for (int i = 1; i <= k; ++i) {\n scanf( %d%d%d , &t, &p, &x[i]);\n if (t == 1)\n l[--p] = i;\n else\n c[--p] = i;\n }\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) printf( %d , x[max(l[i], c[j])]);\n printf( \n );\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int N, K;\n long double ans, s;\n int R[1000010], data[100010];\n int v[1000010], c[1000010];\n int STv[20][1000010], STc[20][1000010];\n int calcv(int l, int r) {\n int delta = r - l + 1;\n int t = log(delta) / log(2);\n return max(STv[t][l], STv[t][r - (1 << t) + 1]);\n }\n int calcc(int l, int r) {\n int delta = r - l + 1;\n int t = log(delta) / log(2);\n return min(STc[t][l], STc[t][r - (1 << t) + 1]);\n }\n int main() {\n scanf( %d%d , &N, &K);\n for (int i = 1; i <= N; i++) scanf( %d , &v[i]), v[i] *= 100;\n for (int i = 1; i <= N; i++) scanf( %d , &c[i]);\n for (int i = 1; i <= N; i++) STv[0][i] = v[i], STc[0][i] = c[i];\n for (int step = 1; step <= 19; step++)\n for (int i = 1; i <= N; i++) {\n STv[step][i] = STv[step - 1][i];\n STc[step][i] = STc[step - 1][i];\n int x = i + (1 << (step - 1));\n if (x <= N) {\n STv[step][i] = max(STv[step][i], STv[step - 1][x]);\n STc[step][i] = min(STc[step][i], STc[step - 1][x]);\n }\n }\n R[0] = 1;\n for (int l = 1; l <= N; l++) {\n R[l] = R[l - 1];\n for (int r = max(R[l - 1], l); r <= N; r++)\n if (calcv(l, r) <= calcc(l, r))\n R[l] = r;\n else\n break;\n }\n for (int l = 1; l <= N; l++) {\n if (R[l] < N && min(calcv(l, R[l]), calcc(l, R[l])) <\n min(calcv(l, R[l] + 1), calcc(l, R[l] + 1)))\n R[l]++;\n data[l] = min(calcv(l, R[l]), calcc(l, R[l]));\n }\n sort(data + 1, data + N + 1);\n s = double(K) / (N - K + 1);\n for (int l = 1; l + K - 1 <= N; l++) {\n s = s / (N - l + 1) * (N - K - l + 2);\n ans = ans + data[l] * s;\n }\n printf( %.15lf , double(ans));\n }\n "} @@ -1305,7 +1305,7 @@ {"func_code_string": "#include \n using namespace std;\n const long long N = 200000 + 10;\n const long long INF = 2e9 + 10;\n long long dic[N], idx[N];\n int main() {\n long long n, k, ii;\n scanf( %lld%lld , &n, &k);\n for (long long i = 0; i <= n; ++i) scanf( %lld , idx + i), dic[i] = idx[i];\n for (long long i = 1; i <= n + 1; ++i)\n dic[i] += dic[i - 1] / 2, dic[i - 1] %= 2;\n for (long long i = 0; i <= n + 1; ++i) {\n if (dic[i]) {\n ii = i;\n break;\n }\n }\n long long x = 0, ans = 0;\n for (long long i = n + 1; i >= 0; --i) {\n x = x * 2 + dic[i];\n if (abs(x) > INF) break;\n if (i > ii || i == n + 1 || (i == n && x == idx[i])) continue;\n if (abs(x - idx[i]) <= k) ++ans;\n }\n printf( %lld\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n bool sortmahstyle(const pair &a, const pair &b) {\n if (a.first < b.first) return true;\n return false;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n long long int n, m;\n cin >> n >> m;\n long long int hash[n + 1], col[4];\n memset(hash, 0, sizeof(hash));\n while (m--) {\n memset(col, 0, sizeof(col));\n long long int inp[3];\n for (long long int i = 0; i < 3; i++) {\n cin >> inp[i];\n col[hash[inp[i]]] = 1;\n }\n for (long long int i = 0; i < 3; i++) {\n long long int x = inp[i];\n if (hash[x] == 0) {\n for (long long int j = 1; j < 4; j++) {\n if (col[j] == 0) {\n hash[x] = j;\n col[hash[x]] = 1;\n break;\n }\n }\n } else {\n col[hash[x]] = 1;\n }\n }\n }\n for (long long int i = 1; i < n + 1; i++) cout << hash[i] << ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int32_t main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int n;\n cin >> n;\n vector a(n), b(n);\n set s;\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n s.insert(a[i]);\n }\n for (int i = 0; i < n; i++) {\n cin >> b[i];\n s.insert(b[i]);\n }\n long long int count = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n long long int temp = a[i] ^ b[j];\n if (s.find(temp) != s.end()) count++;\n }\n }\n if (count % 2 != 0)\n cout << Koyomi << endl;\n else\n cout << Karen << endl;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n long long a[100010];\n int main() {\n long long n, pos;\n while (cin >> n >> pos) {\n for (long long i = 0; i < n; i++) scanf( %I64d , &a[i]);\n sort(a, a + n);\n long long res1 = 0, res2, res;\n if (pos < a[0])\n res1 = a[n - 2] - pos;\n else if (a[0] <= pos && pos <= a[n - 2])\n res1 = min((pos - a[0]) * 2 + a[n - 2] - pos,\n (a[n - 2] - pos) * 2 + pos - a[0]);\n else if (pos > a[n - 2])\n res1 = pos - a[0];\n if (pos < a[1])\n res2 = a[n - 1] - pos;\n else if (a[1] <= pos && pos <= a[n - 1])\n res2 = min((pos - a[1]) * 2 + a[n - 1] - pos,\n (a[n - 1] - pos) * 2 + pos - a[1]);\n else if (pos > a[n - 1])\n res2 = pos - a[1];\n res = min(res1, res2);\n if (n == 1) res = 0;\n printf( %I64d\n , res);\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long a[100010];\n int main() {\n long long n, pos;\n while (cin >> n >> pos) {\n for (long long i = 0; i < n; i++) scanf( extra , &a[i]);\n sort(a, a + n);\n long long res1 = 0, res2, res;\n if (pos < a[0])\n res1 = a[n - 2] - pos;\n else if (a[0] <= pos && pos <= a[n - 2])\n res1 = min((pos - a[0]) * 2 + a[n - 2] - pos,\n (a[n - 2] - pos) * 2 + pos - a[0]);\n else if (pos > a[n - 2])\n res1 = pos - a[0];\n if (pos < a[1])\n res2 = a[n - 1] - pos;\n else if (a[1] <= pos && pos <= a[n - 1])\n res2 = min((pos - a[1]) * 2 + a[n - 1] - pos,\n (a[n - 1] - pos) * 2 + pos - a[1]);\n else if (pos > a[n - 1])\n res2 = pos - a[1];\n res = min(res1, res2);\n if (n == 1) res = 0;\n printf( extra\n , res);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 100010;\n const int M = 310;\n int n, m, s, e0, E;\n pair dp[N][M];\n int a[N];\n vector elAtB[N];\n inline int findj(int j0, int val) {\n if (j0 >= m) return -1;\n vector &v = elAtB[val];\n if (v.size() == 0) return -1;\n vector::iterator it = lower_bound(v.begin(), v.end(), j0);\n if (it == v.end())\n return -1;\n else\n return *it;\n }\n int main() {\n cin >> n >> m >> s >> e0;\n E = s / e0;\n int ost = s - E * e0;\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n }\n for (int j = 0; j < m; j++) {\n int x;\n cin >> x;\n elAtB[x].push_back(j);\n }\n int ans = 0;\n for (int i = 0; i <= n; i++) {\n for (int e = 0; e <= E; e++) {\n dp[i][e] = make_pair(0, 0);\n }\n }\n for (int i = 0; i < n; i++) {\n for (int e = 1; e <= E; e++) {\n int dol = dp[i][e].first;\n int j0 = dp[i][e].second;\n int dolnxt = dp[i + 1][e].first;\n if (dol > dolnxt) {\n dp[i + 1][e] = make_pair(dol, j0);\n }\n int j = findj(j0, a[i]);\n if (j == -1)\n continue;\n else {\n }\n dolnxt = dp[i + 1][e - 1].first;\n int jnxt = dp[i + 1][e - 1].second;\n if (((dol + 1 > dolnxt) || (dol + 1 == dolnxt && j < jnxt)) &&\n ((i + 1 + j + 1) <= (e - 1) * e0 + ost)) {\n dp[i + 1][e - 1] = make_pair(dol + 1, j + 1);\n ans = max(ans, dol + 1);\n }\n }\n }\n cout << ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n int main() {\n int i, j, k, n;\n scanf( %d , &n);\n k = sqrt(n);\n for (i = k; i >= 1; i--) {\n if (n % i == 0) {\n j = i;\n break;\n }\n }\n printf( %d %d , j, (n / j));\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long maxn = 100005;\n long long n, d, b;\n long long a[maxn];\n bool f(long long x) {\n long long l = 1 + x;\n long long r = n - x;\n deque> dq;\n for (long long i = 1; i <= n; i++)\n if (a[i] != 0) dq.push_front({i, a[i]});\n long long t = 1 + x;\n while (l <= r) {\n long long left = b;\n while (left > 0) {\n if (dq.empty()) return false;\n pair p = dq.back();\n dq.pop_back();\n long long amt = min(p.second, left);\n if (p.first - l > t * d) return false;\n p.second -= amt;\n left -= amt;\n if (p.second > 0) dq.push_back(p);\n }\n l++;\n if (l <= r) {\n long long right = b;\n while (right > 0) {\n if (dq.empty()) return false;\n pair p = dq.front();\n dq.pop_front();\n long long amt = min(p.second, right);\n if (r - p.first > t * d) return false;\n p.second -= amt;\n right -= amt;\n if (p.second > 0) dq.push_front(p);\n }\n r--;\n }\n t++;\n }\n return true;\n }\n signed main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cin >> n >> d >> b;\n for (long long i = 1; i <= n; i++) cin >> a[i];\n long long l = 0;\n long long r = n;\n while (r - l > 3) {\n long long mid = (r - l) / 2 + l;\n if (f(mid))\n r = mid;\n else\n l = mid;\n }\n for (long long i = l; i <= r; i++) {\n if (f(i)) {\n cout << i << '\n';\n break;\n }\n }\n }\n "} @@ -1373,9 +1373,9 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n int t;\n cin >> t;\n while (t--) {\n int r, g, b, w;\n cin >> r >> g >> b >> w;\n int count = 0;\n if (r % 2) count++;\n if (g % 2) count++;\n if (b % 2) count++;\n int m = min(r, min(g, b));\n bool flag;\n if (count == 0)\n flag = true;\n else if (count == 1) {\n if (w % 2 == 0)\n flag = true;\n else\n flag = false;\n } else if (count == 2) {\n if (w % 2 == 0)\n flag = false;\n else if (m > 0)\n flag = true;\n else\n flag = false;\n } else {\n flag = true;\n }\n if (flag)\n cout << Yes\n ;\n else\n cout << No\n ;\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 55;\n int n, k, dp[N][N];\n long long a[N], sum[N], dq;\n int main() {\n scanf( %d%d , &n, &k);\n for (int i = 1; i <= n; i++) scanf( %lld , &a[i]);\n for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];\n for (int i = 60; i >= 0; i--) {\n dq |= (long long)1 << i;\n dp[0][0] = 1;\n for (int j = 1; j <= n; j++)\n for (int l = 1; l <= k; l++) {\n dp[j][l] = 0;\n for (int o = j - 1; o >= 0; o--)\n if (((sum[j] - sum[o]) & dq) == dq) dp[j][l] |= dp[o][l - 1];\n }\n if (!dp[n][k]) dq ^= (long long)1 << i;\n }\n printf( %lld , dq);\n }\n "} {"func_code_string": "#include \n using namespace std;\n void solve() {\n int n;\n cin >> n;\n vector> a(5, vector(n));\n for (int i = 0; i < n; i++) {\n string s;\n cin >> s;\n vector aa(5);\n for (int j = 0; j < s.size(); j++) {\n aa[s[j] - 'a']++;\n }\n for (int j = 0; j < 5; j++) {\n a[j][i] = 2 * aa[j] - s.size();\n }\n }\n int ans = 0;\n for (int i = 0; i < 5; i++) {\n sort(a[i].begin(), a[i].end(), greater());\n long long sum = 0;\n int j = 0;\n for (; j < n; j++) {\n sum += a[i][j];\n if (sum <= 0) {\n break;\n }\n }\n ans = max(j, ans);\n }\n cout << ans << '\n';\n }\n int main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n int t;\n cin >> t;\n while (t--) {\n solve();\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const long long MOD = 1e9 + 7;\n long long n, n2 = 1, a[5010], dat[20010], ans = 0;\n vector v, vv[5010];\n map mp;\n void build(long long k, long long lb, long long ub) {\n if (lb == ub) return;\n build(k * 2 + 1, lb, (lb + ub) / 2);\n build(k * 2 + 2, (lb + ub) / 2 + 1, ub);\n dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);\n }\n long long query(long long k, long long lb, long long ub, long long tlb,\n long long tub) {\n if (ub < tlb || tub < lb) return 2e9;\n if (tlb <= lb && ub <= tub) return dat[k];\n return min(query(k * 2 + 1, lb, (lb + ub) / 2, tlb, tub),\n query(k * 2 + 2, (lb + ub) / 2 + 1, ub, tlb, tub));\n }\n long long dfs(long long lb, long long ub, long long lst) {\n if (lb > ub) return 0;\n long long ret = ub - lb + 1, mn = query(0, 0, n2 - 1, lb, ub), res = mn - lst;\n long long num = mp[mn],\n pos = lower_bound(vv[num].begin(), vv[num].end(), lb) -\n vv[num].begin(),\n pos2 = lower_bound(vv[num].begin(), vv[num].end(), ub + 1) -\n vv[num].begin() - 1;\n for (long long i = pos; i < pos2; i++)\n res += dfs(vv[num][i] + 1, vv[num][i + 1] - 1, mn);\n res += dfs(lb, vv[num][pos] - 1, mn) + dfs(vv[num][pos2] + 1, ub, mn);\n ret = min(ret, res);\n return ret;\n }\n int main() {\n cin >> n;\n for (int i = 0; i < n; i++) {\n scanf( %I64d , &a[i]);\n v.push_back(a[i]);\n }\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n for (int i = 0; i < v.size(); i++) mp[v[i]] = i;\n for (int i = 0; i < n; i++) vv[mp[a[i]]].push_back(i);\n while (n2 < n) n2 *= 2;\n for (int i = 0; i < 20005; i++) dat[i] = 1e18;\n for (int i = 0; i < n; i++) dat[i + n2 - 1] = a[i];\n build(0, 0, n2 - 1);\n cout << dfs(0, n - 1, 0) << endl;\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const long long MOD = 1e9 + 7;\n long long n, n2 = 1, a[5010], dat[20010], ans = 0;\n vector v, vv[5010];\n map mp;\n void build(long long k, long long lb, long long ub) {\n if (lb == ub) return;\n build(k * 2 + 1, lb, (lb + ub) / 2);\n build(k * 2 + 2, (lb + ub) / 2 + 1, ub);\n dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);\n }\n long long query(long long k, long long lb, long long ub, long long tlb,\n long long tub) {\n if (ub < tlb || tub < lb) return 2e9;\n if (tlb <= lb && ub <= tub) return dat[k];\n return min(query(k * 2 + 1, lb, (lb + ub) / 2, tlb, tub),\n query(k * 2 + 2, (lb + ub) / 2 + 1, ub, tlb, tub));\n }\n long long dfs(long long lb, long long ub, long long lst) {\n if (lb > ub) return 0;\n long long ret = ub - lb + 1, mn = query(0, 0, n2 - 1, lb, ub), res = mn - lst;\n long long num = mp[mn],\n pos = lower_bound(vv[num].begin(), vv[num].end(), lb) -\n vv[num].begin(),\n pos2 = lower_bound(vv[num].begin(), vv[num].end(), ub + 1) -\n vv[num].begin() - 1;\n for (long long i = pos; i < pos2; i++)\n res += dfs(vv[num][i] + 1, vv[num][i + 1] - 1, mn);\n res += dfs(lb, vv[num][pos] - 1, mn) + dfs(vv[num][pos2] + 1, ub, mn);\n ret = min(ret, res);\n return ret;\n }\n int main() {\n cin >> n;\n for (int i = 0; i < n; i++) {\n scanf( extra , &a[i]);\n v.push_back(a[i]);\n }\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n for (int i = 0; i < v.size(); i++) mp[v[i]] = i;\n for (int i = 0; i < n; i++) vv[mp[a[i]]].push_back(i);\n while (n2 < n) n2 *= 2;\n for (int i = 0; i < 20005; i++) dat[i] = 1e18;\n for (int i = 0; i < n; i++) dat[i + n2 - 1] = a[i];\n build(0, 0, n2 - 1);\n cout << dfs(0, n - 1, 0) << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n \n typedef long long ll;\n typedef pair pii;\n #define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)\n #define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)\n #define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)\n template void umin(T& x, const U& y){ x = min(x, (T)y);}\n template void umax(T& x, const U& y){ x = max(x, (T)y);}\n template void init(vector &v, U x, size_t n) { v=vector(n, (T)x); }\n template void init(vector &v, U x, size_t n, W... m) { v=vector(n); for(auto& a : v) init(a, x, m...); }\n \n const int m = 2e5;\n const ll MOD = 1e9+7;\n int dp[10][m+1];\n int main(int argc, char** argv) {\n ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << setprecision(15);\n if (argc == 2 && atoi(argv[1]) == 123456789) freopen( d:\\code\\cpp\\contests\\stdin , r , stdin);\n int T = 1;\n cin >> T;\n \n FOR(x, 10) dp[x][0] = 1;\n FOR1(i, m){\n FOR(x, 9){\n dp[x][i] = dp[x+1][i-1];\n }\n dp[9][i] = (dp[1][i-1] + dp[0][i-1]) % MOD;\n }\n \n FOR1(t, T){\n int n, m;\n cin >> n >> m;\n ll sol = 0;\n while(n){\n int d = n%10;\n sol += dp[d][m];\n n /= 10;\n }\n sol %= MOD;\n cout << sol << endl;\n }\n if (argc == 2 && atoi(argv[1]) == 123456789) cout << clock()*1.0/CLOCKS_PER_SEC << sec\n ;\n return 0;\n }\n \n "} -{"func_code_string": "#include \n using namespace std;\n long long f[110][2][2];\n int ans[110];\n int n;\n long long k;\n long long calc(long long x, long long a, long long b) {\n if (f[x][a][b] != -1) return f[x][a][b];\n f[x][a][b] = 0;\n int y = n - x + 1;\n if (x > y) return f[x][a][b] = 1;\n for (int i = 0; i < 2; i++)\n if (ans[x] == -1 || ans[x] == i)\n for (int j = 0; j < 2; j++)\n if (ans[y] == -1 || ans[y] == j)\n if (i == j || x < y)\n if (a || i <= j)\n if (b || i + j <= 1)\n f[x][a][b] += calc(x + 1, a || (i < j), b || ((i + j) <= 0));\n return f[x][a][b];\n }\n int main() {\n scanf( %d %I64d , &n, &k);\n k++;\n memset(f, -1, sizeof(f));\n memset(ans, -1, sizeof(ans));\n if (calc(1, 0, 0) < k) return puts( -1 ), 0;\n for (int i = 1; i <= n; i++) {\n memset(f, -1, sizeof(f));\n ans[i] = 0;\n if (calc(1, 0, 0) < k) {\n k -= calc(1, 0, 0);\n ans[i] = 1;\n }\n }\n for (int i = 1; i <= n; i++) printf( %d , ans[i]);\n puts( );\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long f[110][2][2];\n int ans[110];\n int n;\n long long k;\n long long calc(long long x, long long a, long long b) {\n if (f[x][a][b] != -1) return f[x][a][b];\n f[x][a][b] = 0;\n int y = n - x + 1;\n if (x > y) return f[x][a][b] = 1;\n for (int i = 0; i < 2; i++)\n if (ans[x] == -1 || ans[x] == i)\n for (int j = 0; j < 2; j++)\n if (ans[y] == -1 || ans[y] == j)\n if (i == j || x < y)\n if (a || i <= j)\n if (b || i + j <= 1)\n f[x][a][b] += calc(x + 1, a || (i < j), b || ((i + j) <= 0));\n return f[x][a][b];\n }\n int main() {\n scanf( %d extra , &n, &k);\n k++;\n memset(f, -1, sizeof(f));\n memset(ans, -1, sizeof(ans));\n if (calc(1, 0, 0) < k) return puts( -1 ), 0;\n for (int i = 1; i <= n; i++) {\n memset(f, -1, sizeof(f));\n ans[i] = 0;\n if (calc(1, 0, 0) < k) {\n k -= calc(1, 0, 0);\n ans[i] = 1;\n }\n }\n for (int i = 1; i <= n; i++) printf( %d , ans[i]);\n puts( );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n inline int init() {\n int now = 0, ju = 1;\n char c;\n bool flag = false;\n while (1) {\n c = getchar();\n if (c == '-')\n ju = -1;\n else if (c >= '0' && c <= '9') {\n now = now * 10 + c - '0';\n flag = true;\n } else if (flag)\n return now * ju;\n }\n }\n inline long long llinit() {\n long long now = 0, ju = 1;\n char c;\n bool flag = false;\n while (1) {\n c = getchar();\n if (c == '-')\n ju = -1;\n else if (c >= '0' && c <= '9') {\n now = now * 10 + c - '0';\n flag = true;\n } else if (flag)\n return now * ju;\n }\n }\n char str[200005];\n long long mod;\n long long fastpow(long long base, long long power) {\n long long ret = 1;\n for (; power; power >>= 1) {\n if (power & 1) {\n ret = (ret * base) % mod;\n }\n base = (base * base) % mod;\n }\n return ret;\n }\n int main() {\n long long ans = 0x7fffffffffffll, nowans = 0;\n scanf( %s , str + 1);\n mod = llinit();\n int n = strlen(str + 1);\n for (int i = 1; i <= n; i++) {\n nowans *= 10;\n nowans %= mod;\n nowans += (str[i] - '0');\n nowans %= mod;\n }\n ans = min(ans, nowans);\n for (int i = 1; i <= n - 1; i++) {\n nowans -= (1LL * (str[i] - '0') * fastpow(10, n - 1));\n while (nowans < 0) nowans += mod;\n nowans %= mod;\n nowans *= 10;\n nowans %= mod;\n nowans += (str[i] - '0');\n nowans %= mod;\n if (str[i + 1] != '0') {\n ans = min(ans, nowans);\n }\n }\n printf( %lld\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long MAXN = +100500;\n const long long INF = 1e9;\n bool ans[MAXN];\n long long get(long long x) {\n long long l = 0, r = INF;\n while (l + 1 < r) {\n long long m = (l + r) / 2;\n if (m * (m + 1) / 2 <= x) {\n l = m;\n } else {\n r = m;\n }\n }\n return l;\n }\n signed main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n long long a, b;\n cin >> a >> b;\n long long cnt = 0;\n long long up = get(a + b);\n for (long long i = up; i > 0; --i) {\n if (a >= i) {\n a -= i;\n ans[i] = 1;\n cnt++;\n }\n }\n cout << cnt << \n ;\n for (long long i = 1; i <= up; ++i) {\n if (ans[i]) {\n cout << i << ;\n }\n }\n cout << \n << up - cnt << \n ;\n for (long long i = 1; i <= up; ++i) {\n if (!ans[i]) {\n cout << i << ;\n }\n }\n cout << \n ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MAX = 2e5;\n int arr[MAX];\n int main() {\n int T;\n cin >> T;\n while (T--) {\n int n;\n cin >> n;\n for (int i = 0; i < n; i++) {\n int c;\n cin >> c;\n arr[c - 1] = i;\n }\n int l = arr[0], r = arr[0];\n for (int i = 0; i < n; i++) {\n if (arr[i] < l)\n l = arr[i];\n else if (arr[i] > r)\n r = arr[i];\n if (i == r - l)\n cout << 1;\n else\n cout << 0;\n }\n cout << '\n';\n }\n }\n "} @@ -1423,7 +1423,7 @@ {"func_code_string": "#include \n using namespace std;\n template \n void __f(const char* name, Arg1&& arg1) {\n cerr << name << : << arg1 << std::endl;\n }\n template \n void __f(const char* names, Arg1&& arg1, Args&&... args) {\n const char* comma = strchr(names + 1, ',');\n cerr.write(names, comma - names) << : << arg1 << | ;\n __f(comma + 1, args...);\n }\n bool isprime(int n) {\n for (int i = 2; i * i <= n; i++)\n if (n % i == 0) return false;\n return true;\n }\n int main() {\n int n;\n scanf( %d , &n);\n int ans = 0;\n if (n <= 3)\n ans = 1;\n else if (n % 2 == 0)\n ans = 2;\n else if (isprime(n))\n ans = 1;\n else if (isprime(n - 2))\n ans = 2;\n else\n ans = 3;\n printf( %d\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, x[500005];\n char c[500005];\n int a[20];\n int q, w, e;\n int main() {\n cin.tie(0);\n cout.tie(0);\n ios_base::sync_with_stdio(false);\n cin >> n;\n for (int i = 0; i < 10; i++) a[i] = 2;\n for (int i = 0; i < n; i++) {\n cin >> c[i] >> x[i];\n }\n for (int i = 0; i < 10; i++) {\n int k = (1 << i);\n for (int j = 0; j < n; j++) {\n if (c[j] == '|') {\n if (x[j] & k) {\n a[i] = 1;\n }\n } else if (c[j] == '&') {\n if (!(x[j] & k)) {\n a[i] = 0;\n }\n } else {\n if (x[j] & k) {\n if (a[i] == 0)\n a[i] = 1;\n else if (a[i] == 1)\n a[i] = 0;\n else if (a[i] == 2)\n a[i] = 3;\n else\n a[i] = 2;\n }\n }\n }\n }\n for (int i = 0; i < 10; i++) {\n if (a[i] != 0) q += (1 << i);\n if (a[i] == 3) w += (1 << i);\n if (a[i] == 1) e += (1 << i);\n }\n cout << 3\n ;\n cout << & << q << \n ;\n cout << ^ << w << \n ;\n cout << | << e << \n ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n bool prime[100001];\n bool ispoweroftwo(long long int x) { return x && !(x & (x - 1)); }\n long long int xorcal(long long int n) {\n if (n % 4 == 0) return n;\n if (n % 4 == 1) return 1;\n if (n % 4 == 2) return n + 1;\n if (n % 4 == 3) return 0;\n }\n void sieve(long long int n) {\n memset(prime, true, sizeof(prime));\n prime[0] = false;\n prime[1] = false;\n for (long long int i = 2; i * i <= n; i++) {\n if (prime[i] == true) {\n for (long long int j = i * i; j <= n; j += i) {\n prime[j] = false;\n }\n }\n }\n }\n bool isprime(long long int n) {\n if (n <= 1) return false;\n if (n <= 3) return true;\n if (n % 2 == 0 or n % 3 == 0) return false;\n for (long long int i = 5; i * i <= n; i += 6) {\n if (n % i == 0 or n % (i + 2) == 0) return false;\n }\n return true;\n }\n long long int modinverse(long long int a, long long int m) {\n long long int m0 = m;\n long long int y = 0, x = 1;\n if (m == 1) return 0;\n while (a > 1) {\n long long int q = a / m;\n long long int t = m;\n m = a % m;\n a = t;\n t = y;\n y = x - q * y;\n x = t;\n }\n if (x < 0) x += m0;\n return x;\n }\n long long int gcd(long long int a, long long int b) {\n if (a == 0) {\n return b;\n }\n return (b % a, a);\n }\n long long int power(long long int A, long long int B) {\n if (A == 0) return 0;\n if (B == 0) return 1;\n long long int y;\n if (B % 2 == 0) {\n y = power(A, B / 2);\n y = (y * y) % 1000000007;\n } else {\n y = A % 1000000007;\n y = (y * power(A, B - 1) % 1000000007) % 1000000007;\n }\n return (long long int)((y + 1000000007) % 1000000007);\n }\n int main() {\n ios_base::sync_with_stdio(false);\n long long int n;\n cin >> n;\n string s;\n cin >> s;\n char f[10];\n for (long long int i = 1; i < 10; i++) {\n cin >> f[i];\n }\n long long int fl = 0;\n for (long long int i = 0; i < n; i++) {\n if (s[i] < f[s[i] - '0']) {\n s[i] = f[s[i] - '0'];\n fl = 1;\n } else if (fl == 1 and s[i] > f[s[i] - '0']) {\n break;\n }\n }\n cout << s << '\n';\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int N = 100010;\n int n, m, pnt[N], vis[N];\n long long vsum[N], esum[N], vcnt[N];\n pair, pair > edge[N];\n vector edge2[N];\n int find(int x) {\n if (x != pnt[x]) pnt[x] = find(pnt[x]);\n return pnt[x];\n }\n void dfs(int u, int root) {\n vis[u] = root;\n vsum[u] = vcnt[u];\n for (int i = 0; i < (int)(edge2[u]).size(); ++i) {\n int v = edge2[u][i];\n if (vis[v]) continue;\n dfs(v, root);\n vsum[u] += vsum[v];\n }\n }\n void solve() {\n int u, v, w;\n m = n - 1;\n memset(esum, 0, sizeof(esum));\n for (int i = 0; i < n; ++i) {\n vcnt[i] = 1;\n pnt[i] = i;\n }\n for (int i = 0; i < m; ++i) {\n scanf( %d%d%d , &u, &v, &w);\n edge[i] = make_pair(make_pair(w, i), make_pair(u - 1, v - 1));\n }\n sort(edge, edge + m);\n for (int i = 0; i < m; ++i) {\n int j = i + 1;\n for (; j < m; ++j)\n if (edge[i].first.first != edge[j].first.first) break;\n set s;\n for (int k = i; k < j; ++k) {\n s.insert(find(edge[k].second.first));\n s.insert(find(edge[k].second.second));\n }\n vector vt((s).begin(), (s).end());\n for (int k = 0; k < (int)(vt).size(); ++k) {\n vsum[vt[k]] = vis[vt[k]] = 0;\n edge2[vt[k]] = vector();\n }\n for (int k = i; k < j; ++k) {\n int p = find(edge[k].second.first);\n int q = find(edge[k].second.second);\n edge2[p].push_back(q);\n edge2[q].push_back(p);\n }\n for (int k = 0; k < (int)(vt).size(); ++k) {\n if (vis[vt[k]]) continue;\n dfs(vt[k], vt[k] + 1);\n }\n for (int k = i; k < j; ++k) {\n int p = find(edge[k].second.first);\n int q = find(edge[k].second.second);\n long long c = min(vsum[p], vsum[q]);\n esum[edge[k].first.second] = 2 * c * (vsum[vis[p] - 1] - c);\n }\n for (int k = i; k < j; ++k) {\n int p = find(edge[k].second.first);\n int q = find(edge[k].second.second);\n pnt[p] = q;\n vcnt[q] += vcnt[p];\n }\n i = j - 1;\n }\n long long ans = 0;\n int ct = 0;\n for (int i = 0; i < m; ++i) {\n if (ans < esum[i]) {\n ans = esum[i];\n ct = 1;\n } else if (ans == esum[i]) {\n ct++;\n }\n }\n printf(\n %I64d \n %d\n ,\n ans, ct);\n bool first = true;\n for (int i = 0; i < m; ++i) {\n if (esum[i] != ans) continue;\n if (!first)\n printf( );\n else\n first = false;\n printf( %d , i + 1);\n }\n puts( );\n }\n int main() {\n while (scanf( %d , &n) != EOF) {\n solve();\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int N = 100010;\n int n, m, pnt[N], vis[N];\n long long vsum[N], esum[N], vcnt[N];\n pair, pair > edge[N];\n vector edge2[N];\n int find(int x) {\n if (x != pnt[x]) pnt[x] = find(pnt[x]);\n return pnt[x];\n }\n void dfs(int u, int root) {\n vis[u] = root;\n vsum[u] = vcnt[u];\n for (int i = 0; i < (int)(edge2[u]).size(); ++i) {\n int v = edge2[u][i];\n if (vis[v]) continue;\n dfs(v, root);\n vsum[u] += vsum[v];\n }\n }\n void solve() {\n int u, v, w;\n m = n - 1;\n memset(esum, 0, sizeof(esum));\n for (int i = 0; i < n; ++i) {\n vcnt[i] = 1;\n pnt[i] = i;\n }\n for (int i = 0; i < m; ++i) {\n scanf( %d%d%d , &u, &v, &w);\n edge[i] = make_pair(make_pair(w, i), make_pair(u - 1, v - 1));\n }\n sort(edge, edge + m);\n for (int i = 0; i < m; ++i) {\n int j = i + 1;\n for (; j < m; ++j)\n if (edge[i].first.first != edge[j].first.first) break;\n set s;\n for (int k = i; k < j; ++k) {\n s.insert(find(edge[k].second.first));\n s.insert(find(edge[k].second.second));\n }\n vector vt((s).begin(), (s).end());\n for (int k = 0; k < (int)(vt).size(); ++k) {\n vsum[vt[k]] = vis[vt[k]] = 0;\n edge2[vt[k]] = vector();\n }\n for (int k = i; k < j; ++k) {\n int p = find(edge[k].second.first);\n int q = find(edge[k].second.second);\n edge2[p].push_back(q);\n edge2[q].push_back(p);\n }\n for (int k = 0; k < (int)(vt).size(); ++k) {\n if (vis[vt[k]]) continue;\n dfs(vt[k], vt[k] + 1);\n }\n for (int k = i; k < j; ++k) {\n int p = find(edge[k].second.first);\n int q = find(edge[k].second.second);\n long long c = min(vsum[p], vsum[q]);\n esum[edge[k].first.second] = 2 * c * (vsum[vis[p] - 1] - c);\n }\n for (int k = i; k < j; ++k) {\n int p = find(edge[k].second.first);\n int q = find(edge[k].second.second);\n pnt[p] = q;\n vcnt[q] += vcnt[p];\n }\n i = j - 1;\n }\n long long ans = 0;\n int ct = 0;\n for (int i = 0; i < m; ++i) {\n if (ans < esum[i]) {\n ans = esum[i];\n ct = 1;\n } else if (ans == esum[i]) {\n ct++;\n }\n }\n printf(\n extra \n %d\n ,\n ans, ct);\n bool first = true;\n for (int i = 0; i < m; ++i) {\n if (esum[i] != ans) continue;\n if (!first)\n printf( );\n else\n first = false;\n printf( %d , i + 1);\n }\n puts( );\n }\n int main() {\n while (scanf( %d , &n) != EOF) {\n solve();\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n bool v[60], h[60];\n int a, b, n;\n while (cin >> n) {\n memset(v, false, sizeof(v));\n memset(h, false, sizeof(h));\n for (int i = 1; i <= n * n; i++) {\n cin >> a >> b;\n if (i == 1) {\n cout << 1;\n h[a] = true;\n v[b] = true;\n } else if (h[a] == false && v[b] == false) {\n h[a] = true;\n v[b] = true;\n cout << << i;\n }\n }\n cout << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n ostream &operator<<(ostream &os, pair &m) {\n os << '[' << m.first << << m.second << ']';\n return os;\n }\n int n;\n vector v;\n bool func(int k) {\n int x = k - 1, y = n - 1;\n for (int i = x; i >= 0; --i) {\n if (2 * v[x] > v[y]) return false;\n x--, y--;\n }\n return true;\n }\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(0), cout.tie(0);\n cin >> n;\n v.resize(n);\n for (int i = 0; i < n; ++i) cin >> v[i];\n sort(begin(v), end(v));\n int lo = 0, hi = n / 2, ans = 0;\n while (lo <= hi) {\n int mid = (lo + hi) / 2;\n if (func(mid)) {\n ans = mid;\n lo = mid + 1;\n } else\n hi = mid - 1;\n }\n cout << n - ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, m, k;\n vector v[1000010];\n vector vv;\n bool visit[1000010] = {0};\n int t, tt;\n int res = 0;\n void dfs(int x) {\n visit[x] = 1;\n t++;\n for (int i = 0; i < v[x].size(); i++) {\n int xi = v[x][i];\n if (!visit[xi]) dfs(xi);\n }\n }\n int main() {\n scanf( %d%d%d , &n, &m, &k);\n for (int i = 0; i < m; i++) {\n int x, y;\n scanf( %d%d , &x, &y);\n x--, y--;\n v[x].push_back(y);\n v[y].push_back(x);\n }\n for (int i = 0; i < n; i++) {\n if (!visit[i]) {\n t = 0;\n dfs(i);\n vv.push_back(min(t, k));\n }\n }\n if (k == 1) {\n cout << max(0, (int)(vv.size() - 2));\n return 0;\n }\n sort(vv.begin(), vv.end());\n reverse(vv.begin(), vv.end());\n tt = vv[0];\n for (int i = 1; i < vv.size(); i++) {\n if (tt)\n tt += vv[i] - 2;\n else {\n tt++;\n res++;\n }\n }\n cout << res;\n return 0;\n }\n "} @@ -1487,7 +1487,7 @@ {"func_code_string": "#include \n using namespace std;\n const int N = 200005;\n const int inf = 1e9 + 7;\n int main() {\n int n;\n scanf( %d , &n);\n while (n--) {\n int x;\n scanf( %d , &x);\n if (x <= 3 || x == 5 || x == 7 || x == 11)\n puts( -1 );\n else {\n int ans = 0, tg = x & 3;\n if (!tg) ans = max(ans, x / 4);\n if (tg == 2) ans = max(ans, 1 + (x - 6) / 4);\n if (tg == 1) ans = max(ans, 1 + (x - 9) / 4);\n if (tg == 3) ans = max(ans, 2 + (x - 15) / 4);\n printf( %d\n , ans);\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int Maxn = ((int)1e5) + 100;\n int arr[Maxn], n;\n map num, numL, numR;\n long long Solve(int a[]) {\n int l = 0, r = n - 1;\n while (a[l] == a[r] && l < r) ++l, --r;\n if (l >= r) return n * 1ll * (n + 1) / 2;\n for (int(i) = (l); (i) <= (r); ++(i)) num[a[i]] += 1;\n int odds = 0, key = -1;\n for (auto it = num.begin(); it != num.end(); ++it)\n if ((it->second) & 1) odds += 1, key = it->first;\n if (odds > 1) return 0;\n int oks = 0, l2 = l - 1;\n while (oks < num.size()) {\n numL[a[++l2]] += 1;\n int _a = numL[a[l2]] << 1;\n int _b = _a - 2, _c = num[a[l2]];\n if (_a >= _c && _b < _c) ++oks;\n }\n oks = 0;\n int r2 = r + 1;\n while (oks < num.size()) {\n numR[a[--r2]] += 1;\n int _a = numR[a[r2]] << 1;\n int _b = _a - 2, _c = num[a[r2]];\n if (_a >= _c && _b < _c) ++oks;\n }\n int mid = (r + l) >> 1;\n if (l2 <= mid && (!(n & 1) || a[mid] == key)) {\n int g, h;\n if (n & 1)\n g = mid - 1, h = mid + 1;\n else\n g = mid, h = mid + 1;\n while (a[g] == a[h]) --g, ++h;\n l2 = g, r2 = h;\n }\n long long sum = 0;\n sum += (l + 1) * 1ll * (n - l2);\n sum += (n - r) * 1ll * (r2 + 1);\n sum -= (l + 1) * 1ll * (n - r);\n return sum;\n }\n int main() {\n iostream::sync_with_stdio(false);\n cin >> n;\n for (int(i) = (0); (i) <= (n - 1); ++(i)) cin >> arr[i];\n cout << Solve(arr) << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int inf = 1e9;\n const long long INF = 1e18;\n const int M = 1e9 + 7;\n const int maxn = 1e6;\n int b[maxn], c[maxn];\n signed main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n cout.setf(ios::fixed);\n cout.precision(10);\n int m, k, n, s;\n cin >> m >> k >> n >> s;\n vector a(m);\n for (int i = 0; i < m; ++i) {\n cin >> a[i];\n }\n for (int i = 0; i < s; ++i) {\n int x;\n cin >> x;\n ++b[x];\n }\n int res = inf;\n int l = 0, r = 0, cnt = 0;\n int L = 0, R = 0;\n while (r < m) {\n while (r < m && cnt < s) {\n if (c[a[r]] < b[a[r]]) {\n ++cnt;\n }\n ++c[a[r]];\n ++r;\n }\n while (l < m && cnt == s) {\n int tl = l / k, tr = (r - 1) / k;\n int tot;\n if (tl == tr) {\n tot = 0;\n } else {\n tot = r - tl * k - k;\n }\n if (tot < res) {\n L = l;\n R = r - 1;\n res = tot;\n }\n c[a[l]]--;\n if (c[a[l]] < b[a[l]]) {\n --cnt;\n }\n ++l;\n }\n }\n if ((m - res) / k < n) {\n cout << -1 << endl;\n } else {\n cout << res << endl;\n for (int i = R; i >= L - L % k; --i) {\n if (res == 0) break;\n if (!b[a[i]]) {\n cout << i + 1 << ' ';\n --res;\n } else {\n --b[a[i]];\n }\n }\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int maxn = 100007;\n const int maxv = 100000;\n long long fac[maxn], fac2[maxn];\n map, int> save;\n int cnt;\n long long mypow(int base, int n) {\n if (n == 0) return 1;\n long long t = mypow(base, n / 2);\n t = (t * t) % 1000000007;\n if (n & 1)\n return (t * base) % 1000000007;\n else\n return t;\n }\n long long C(int n, int k) {\n long long res = fac[n] * fac2[k] % 1000000007;\n res = res * fac2[n - k] % 1000000007;\n return res;\n }\n long long solve(int f, int n) {\n if (f == 1) return (n == 1);\n if (f == n) return 1;\n if (f > n) return 0;\n if (save.count(pair(f, n))) return save[pair(f, n)];\n long long res = 0;\n for (int i = 2; i * i <= n; i++)\n if (n % i == 0) {\n int x = i;\n res = (res + solve(f, n / x)) % 1000000007;\n if (i * i == n) continue;\n x = n / i;\n res = (res + solve(f, n / x)) % 1000000007;\n }\n save[pair(f, n)] =\n (C(n - 1, f - 1) - res + 1000000007) % 1000000007;\n return save[pair(f, n)];\n }\n int main() {\n fac[0] = 1;\n for (int i = 1, _c = maxv; i <= _c; i++) fac[i] = fac[i - 1] * i % 1000000007;\n for (int v = 0, _c = maxv; v <= _c; v++)\n fac2[v] = mypow(fac[v], 1000000007 - 2);\n int q, f, n;\n scanf( %d , &q);\n for (int i = 0, _a = (q); i < _a; ++i) {\n scanf( %d%d , &n, &f);\n printf( %I64d\n , solve(f, n));\n }\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int maxn = 100007;\n const int maxv = 100000;\n long long fac[maxn], fac2[maxn];\n map, int> save;\n int cnt;\n long long mypow(int base, int n) {\n if (n == 0) return 1;\n long long t = mypow(base, n / 2);\n t = (t * t) % 1000000007;\n if (n & 1)\n return (t * base) % 1000000007;\n else\n return t;\n }\n long long C(int n, int k) {\n long long res = fac[n] * fac2[k] % 1000000007;\n res = res * fac2[n - k] % 1000000007;\n return res;\n }\n long long solve(int f, int n) {\n if (f == 1) return (n == 1);\n if (f == n) return 1;\n if (f > n) return 0;\n if (save.count(pair(f, n))) return save[pair(f, n)];\n long long res = 0;\n for (int i = 2; i * i <= n; i++)\n if (n % i == 0) {\n int x = i;\n res = (res + solve(f, n / x)) % 1000000007;\n if (i * i == n) continue;\n x = n / i;\n res = (res + solve(f, n / x)) % 1000000007;\n }\n save[pair(f, n)] =\n (C(n - 1, f - 1) - res + 1000000007) % 1000000007;\n return save[pair(f, n)];\n }\n int main() {\n fac[0] = 1;\n for (int i = 1, _c = maxv; i <= _c; i++) fac[i] = fac[i - 1] * i % 1000000007;\n for (int v = 0, _c = maxv; v <= _c; v++)\n fac2[v] = mypow(fac[v], 1000000007 - 2);\n int q, f, n;\n scanf( %d , &q);\n for (int i = 0, _a = (q); i < _a; ++i) {\n scanf( %d%d , &n, &f);\n printf( extra\n , solve(f, n));\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, m, i, j, s1 = 1, s2 = 1, d = 0;\n cin >> n >> m;\n if (n == 1 && m == 1) {\n cout << 0 << endl;\n cout << 1 << << 1 << endl;\n cout << 1 << << 1 << endl;\n exit(0);\n }\n if (n == 1 && m == 2) {\n cout << 0 << endl;\n cout << 1 << << 1 << endl;\n cout << 1 << << 2 << endl;\n cout << 1 << << 1 << endl;\n exit(0);\n }\n if (n == 2 && m == 1) {\n cout << 0 << endl;\n cout << 1 << << 1 << endl;\n cout << 2 << << 1 << endl;\n cout << 1 << << 1 << endl;\n exit(0);\n }\n if (n == 1) {\n cout << 1 << endl;\n cout << n << << m << << 1 << << 1 << endl;\n for (i = 1; i <= m; i++) {\n cout << 1 << << i << endl;\n }\n cout << 1 << << 1;\n exit(0);\n }\n if (m == 1) {\n cout << 1 << endl;\n cout << n << << m << << 1 << << 1 << endl;\n for (i = 1; i <= n; i++) {\n cout << i << << 1 << endl;\n }\n cout << 1 << << 1;\n exit(0);\n }\n if (n % 2 != 0 && m % 2 != 0) {\n cout << 1 << endl;\n cout << n << << m << << 1 << << 1 << endl;\n for (i = 1; i <= n; i++) {\n if (d == 0) {\n for (j = 1; j <= m; j++) {\n cout << i << << j << endl;\n }\n d = 1;\n } else {\n for (j = m; j >= 1; j--) {\n cout << i << << j << endl;\n }\n d = 0;\n }\n }\n cout << 1 << << 1;\n } else {\n cout << 0 << endl;\n cout << 1 << << 1 << endl;\n if (n % 2 == 0) {\n s2++;\n for (i = 1; i <= n; i++) {\n if (d == 0) {\n for (j = 2; j <= m; j++) {\n cout << i << << j << endl;\n }\n d = 1;\n } else {\n for (j = m; j >= 2; j--) {\n cout << i << << j << endl;\n }\n d = 0;\n }\n }\n for (i = n; i >= 1; i--) {\n cout << i << << 1 << endl;\n }\n } else {\n s2++;\n for (i = 1; i <= m; i++) {\n if (d == 0) {\n for (j = 2; j <= n; j++) {\n cout << j << << i << endl;\n }\n d = 1;\n } else {\n for (j = n; j >= 2; j--) {\n cout << j << << i << endl;\n }\n d = 0;\n }\n }\n for (i = m; i >= 1; i--) {\n cout << 1 << << i << endl;\n }\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n char T[1 << 21];\n int n, m, ar[21][21];\n int U[21], V[21], P[21], way[21], minv[21];\n int hungarian(int n, int m, int ar[21][21]) {\n memset(way, 0, sizeof(way)), memset(U, 0, sizeof(U)), memset(V, 0, sizeof(V)),\n memset(P, 0, sizeof(P));\n int i, j, i0, i1, j0, j1, x, y, cur, delta, used, lim = (1 << (m + 1)) - 1;\n for (i = 1; i <= n; i++) {\n used = 0;\n P[0] = i, j0 = 0;\n for (j = 0; j <= m; j++) minv[j] = (1 << 27);\n do {\n used |= (1 << j0);\n i0 = P[j0], j1 = 0, delta = (1 << 27), x = (used | 1) ^ lim;\n while (x) {\n y = (-x & x);\n j = T[y];\n x ^= y;\n cur = ar[i0][j] - U[i0] - V[j];\n if (cur < minv[j]) {\n minv[j] = cur;\n way[j] = j0;\n }\n if (minv[j] < delta) {\n delta = minv[j];\n j1 = j;\n }\n }\n for (j = 0; j <= m; j++) {\n if (used & (1 << j)) {\n U[P[j]] += delta;\n V[j] -= delta;\n } else\n minv[j] -= delta;\n }\n j0 = j1;\n } while (P[j0] != 0);\n do {\n j1 = way[j0];\n P[j0] = P[j1];\n j0 = j1;\n } while (j0 != 0);\n }\n return -V[0];\n }\n int fri[21][21], sat[21][21];\n int main() {\n int i, j, k, x, res, lim, mask;\n for (i = 0; i < 21; i++) T[1 << i] = i;\n while (scanf( %d , &n) != EOF) {\n for (i = 0; i < n; i++) {\n for (j = 0; j < n; j++) {\n scanf( %d , &fri[i][j]);\n }\n }\n for (i = 0; i < n; i++) {\n for (j = 0; j < n; j++) {\n scanf( %d , &sat[i][j]);\n }\n }\n res = 0, lim = 1 << n;\n for (mask = 0; mask < lim; mask++) {\n if (__builtin_popcount(mask) == (n >> 1)) {\n for (i = 0; i < n; i++) {\n for (j = 0; j < n; j++) {\n if (mask & (1 << i))\n ar[i + 1][j + 1] = -fri[i][j];\n else\n ar[i + 1][j + 1] = -sat[i][j];\n }\n }\n x = -hungarian(n, n, ar);\n if (x > res) res = x;\n }\n }\n printf( %d\n , res);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n int n, m;\n int map[1010][1010];\n int strpnt[1001000][2];\n int q[1001000][2];\n int qs, qe;\n int stn;\n int ans;\n int gcd(int x, int y) {\n if (y == 0) return x;\n return gcd(y, x % y);\n }\n int main() {\n int i, j, k, l, t;\n scanf( %d%d , &n, &m);\n for (i = 0; i < n; i++) {\n for (j = 0; j < m; j++) {\n scanf( %d , &map[i + 1][j + 1]);\n }\n }\n n += 2;\n m += 2;\n k = 0;\n for (i = 0; i < n; i++) {\n for (j = 0; j < m; j++) {\n if (map[i + 1][j + 1] == 1) {\n t = 0;\n t += map[i][j + 1];\n t += map[i + 1][j];\n t += map[i + 1][j + 2];\n t += map[i + 2][j + 1];\n if (t == 1 || t == 3) {\n k++;\n }\n if (t == 0) {\n printf( -1 );\n return 0;\n }\n }\n }\n }\n if (k != 0 && k != 2) {\n printf( -1 );\n return 0;\n }\n for (i = 0; i < n; i++) {\n for (j = 0; j < m; j++) {\n if (map[i + 1][j + 1] == 1) {\n t = 0;\n t += map[i][j + 1];\n t += map[i + 1][j];\n t += map[i + 1][j + 2];\n t += map[i + 2][j + 1];\n if (t != 2 || (!(((map[i][j + 1] == 1 && map[i + 2][j + 1] == 1) ||\n (map[i + 1][j] == 1 && map[i + 1][j + 2] == 1))))) {\n strpnt[stn][0] = i;\n strpnt[stn][1] = j;\n stn++;\n }\n }\n }\n }\n if (stn < 2) {\n printf( -1 );\n return 0;\n }\n for (i = 1; i < stn; i++) {\n strpnt[i][0] -= strpnt[0][0];\n if (strpnt[i][0] < 0) strpnt[i][0] = -strpnt[i][0];\n strpnt[i][1] -= strpnt[0][1];\n if (strpnt[i][1] < 0) strpnt[i][1] = -strpnt[i][1];\n ans = gcd(strpnt[i][0], ans);\n ans = gcd(strpnt[i][1], ans);\n }\n if (ans < 2) {\n printf( -1 );\n return 0;\n }\n t = 0;\n for (i = 0; i < n; i++) {\n for (j = 0; j < m; j++) {\n if (map[i][j] == 1) {\n t = 1;\n break;\n }\n }\n if (t == 1) break;\n }\n qe = 1;\n q[0][0] = i;\n q[0][1] = j;\n map[i][j] = 0;\n for (qs = 0; qs < qe; qs++) {\n if (map[q[qs][0] + 1][q[qs][1]] == 1) {\n map[q[qs][0] + 1][q[qs][1]] = 0;\n q[qe][0] = q[qs][0] + 1;\n q[qe][1] = q[qs][1];\n qe++;\n }\n if (map[q[qs][0] - 1][q[qs][1]] == 1) {\n map[q[qs][0] - 1][q[qs][1]] = 0;\n q[qe][0] = q[qs][0] - 1;\n q[qe][1] = q[qs][1];\n qe++;\n }\n if (map[q[qs][0]][q[qs][1] + 1] == 1) {\n map[q[qs][0]][q[qs][1] + 1] = 0;\n q[qe][0] = q[qs][0];\n q[qe][1] = q[qs][1] + 1;\n qe++;\n }\n if (map[q[qs][0]][q[qs][1] - 1] == 1) {\n map[q[qs][0]][q[qs][1] - 1] = 0;\n q[qe][0] = q[qs][0];\n q[qe][1] = q[qs][1] - 1;\n qe++;\n }\n }\n for (i = 0; i < n; i++) {\n for (j = 0; j < m; j++) {\n if (map[i][j] == 1) {\n printf( -1 );\n return 0;\n }\n }\n }\n for (i = 2; i <= ans; i++) {\n if (ans % i == 0) printf( %d , i);\n }\n return 0;\n }\n "} @@ -1508,7 +1508,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n int t;\n cin >> t;\n while (t--) {\n int n;\n cin >> n;\n long long int a[n];\n unordered_map mp;\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n mp[a[i]]++;\n }\n if (mp.size() == 1)\n cout << NO << endl;\n else {\n cout << YES << endl;\n int f = -1, s = -1;\n for (int i = 1; i < n; i++) {\n if (a[i] != a[0]) {\n f = i;\n break;\n }\n }\n for (int i = 1; i < n; i++) {\n if (a[i] != a[f])\n cout << i + 1 << << f + 1 << endl;\n else\n cout << 1 << << i + 1 << endl;\n }\n }\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long MAX = 2e5 + 10;\n int n;\n string s, xx = RGB ;\n int getID(char c) {\n if (c == 'R')\n return 1;\n else if (c == 'G')\n return 2;\n return 3;\n }\n int last[4];\n int dp[MAX][4][4][4];\n int mn = 1e9;\n vector v, ans;\n int tokyoGhoul(int cur, int cnt) {\n if (cur == n) {\n if (cnt < mn) {\n mn = cnt;\n ans = v;\n }\n return cnt;\n }\n int &ret = dp[cur][last[0]][last[1]][last[2]];\n if (~ret) return ret;\n ret = 1e18;\n for (int i = 0; i < xx.size(); i++) {\n int id = getID(xx[i]);\n int prev = last[id];\n char ch = xx[i];\n if (prev == -1 || (cur - prev) != 1) {\n v.push_back(ch);\n last[id] = cur;\n if (xx[i] != s[cur])\n ret = min(ret, tokyoGhoul(cur + 1, cnt + 1));\n else\n ret = min(ret, tokyoGhoul(cur + 1, cnt));\n last[id] = prev;\n v.pop_back();\n }\n }\n return ret;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cin >> n >> s;\n vector vv;\n int cnt = 0, cnt2 = 0;\n string s1 = , s2 = ;\n for (int j = 0; j < 3; j++) {\n cnt = 0, s1 = ;\n s1 += xx[j];\n if (s[0] != s1[0]) cnt++;\n for (int i = 1; i < n; i++) {\n if (s[i] == s1[i - 1]) {\n cnt++;\n bool f = 1;\n for (int j = 0; j < xx.size(); j++) {\n if (s1[i - 1] != xx[j] && (i + 1 == n || s[i + 1] != xx[j])) {\n s1 += xx[j];\n f = 0;\n break;\n }\n }\n if (f)\n for (int j = 0; j < xx.size(); j++) {\n if (s[i - 1] != xx[j]) {\n s1 += xx[j];\n break;\n }\n }\n } else\n s1 += s[i];\n }\n if (cnt < mn) {\n mn = cnt;\n s2 = s1;\n }\n }\n cout << mn << endl;\n for (auto i : s2) cout << i;\n cout << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n T min(T a, T b, T c) {\n return min(a, min(b, c));\n }\n template \n T max(T a, T b, T c) {\n return max(a, max(b, c));\n }\n int r, c, k, n, a[15][15];\n int main() {\n scanf( %d%d%d%d , &r, &c, &n, &k);\n for (int i = (1); i <= (n); ++i) {\n int x, y;\n scanf( %d%d , &x, &y);\n a[x][y] = 1;\n }\n int ans = 0;\n for (int x1 = (1); x1 <= (r); ++x1) {\n for (int y1 = (1); y1 <= (c); ++y1) {\n for (int x2 = (x1); x2 <= (r); ++x2) {\n for (int y2 = (y1); y2 <= (c); ++y2) {\n int sum = 0;\n for (int x = (x1); x <= (x2); ++x) {\n for (int y = (y1); y <= (y2); ++y) sum += a[x][y];\n }\n if (sum >= k) ++ans;\n }\n }\n }\n }\n cout << ans;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int maxn = 5010, inf = 0x7fffffff;\n bool has[maxn][maxn], flag = 0;\n int sum[maxn][maxn], n, m, l[10], r[10], req;\n long long ans;\n void init() {\n for (int i = 1; i <= n; i++)\n for (int j = 1; j <= m; j++)\n sum[i][j] =\n sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (has[i][j] == 1);\n }\n int calculate(int x1, int y1, int x2, int y2) {\n return sum[x2][y2] - sum[x1][y2] - sum[x2][y1] + sum[x1][y1];\n }\n void work(int up, int down, int left, int right, bool dir) {\n if (left == right || up == down) return;\n if (left + 1 == right && up + 1 == down) {\n ans += calculate(up, left, down, right) == req;\n return;\n }\n if (dir == 0) {\n int mid = (left + right) >> 1;\n work(up, down, left, mid, dir ^ 1);\n work(up, down, mid, right, dir ^ 1);\n for (int i = up; i < down; i++) {\n l[0] = r[0] = mid;\n for (int k = 1; k <= req + 1; k++) l[k] = left, r[k] = right;\n for (int j = i + 1; j <= down; j++) {\n for (int k = 1; k <= req + 1; k++)\n while (calculate(i, l[k], j, mid) >= k) l[k]++;\n for (int k = 1; k <= req + 1; k++)\n while (calculate(i, mid, j, r[k]) >= k) r[k]--;\n for (int k = 0; k <= req; k++)\n ans += (l[k] - l[k + 1]) * (r[req - k + 1] - r[req - k]);\n }\n }\n } else {\n int mid = (up + down) >> 1;\n work(up, mid, left, right, dir ^ 1);\n work(mid, down, left, right, dir ^ 1);\n for (int i = left; i < right; i++) {\n l[0] = r[0] = mid;\n for (int k = 1; k <= req + 1; k++) l[k] = up, r[k] = down;\n for (int j = i + 1; j <= right; j++) {\n for (int k = 1; k <= req + 1; k++)\n while (calculate(l[k], i, mid, j) >= k) l[k]++;\n for (int k = 1; k <= req + 1; k++)\n while (calculate(mid, i, r[k], j) >= k) r[k]--;\n for (int k = 0; k <= req; k++)\n ans += (l[k] - l[k + 1]) * (r[req - k + 1] - r[req - k]);\n }\n }\n }\n }\n int main() {\n while (scanf( %d%d%d , &n, &m, &req) == 3) {\n memset(has, 0, sizeof(has));\n ans = 0;\n for (int i = 1; i <= n; i++)\n for (int j = 1; j <= m; j++) scanf( %1d , &has[i][j]);\n init();\n work(0, n, 0, m, n < m);\n printf( %I64d\n , ans);\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int maxn = 5010, inf = 0x7fffffff;\n bool has[maxn][maxn], flag = 0;\n int sum[maxn][maxn], n, m, l[10], r[10], req;\n long long ans;\n void init() {\n for (int i = 1; i <= n; i++)\n for (int j = 1; j <= m; j++)\n sum[i][j] =\n sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (has[i][j] == 1);\n }\n int calculate(int x1, int y1, int x2, int y2) {\n return sum[x2][y2] - sum[x1][y2] - sum[x2][y1] + sum[x1][y1];\n }\n void work(int up, int down, int left, int right, bool dir) {\n if (left == right || up == down) return;\n if (left + 1 == right && up + 1 == down) {\n ans += calculate(up, left, down, right) == req;\n return;\n }\n if (dir == 0) {\n int mid = (left + right) >> 1;\n work(up, down, left, mid, dir ^ 1);\n work(up, down, mid, right, dir ^ 1);\n for (int i = up; i < down; i++) {\n l[0] = r[0] = mid;\n for (int k = 1; k <= req + 1; k++) l[k] = left, r[k] = right;\n for (int j = i + 1; j <= down; j++) {\n for (int k = 1; k <= req + 1; k++)\n while (calculate(i, l[k], j, mid) >= k) l[k]++;\n for (int k = 1; k <= req + 1; k++)\n while (calculate(i, mid, j, r[k]) >= k) r[k]--;\n for (int k = 0; k <= req; k++)\n ans += (l[k] - l[k + 1]) * (r[req - k + 1] - r[req - k]);\n }\n }\n } else {\n int mid = (up + down) >> 1;\n work(up, mid, left, right, dir ^ 1);\n work(mid, down, left, right, dir ^ 1);\n for (int i = left; i < right; i++) {\n l[0] = r[0] = mid;\n for (int k = 1; k <= req + 1; k++) l[k] = up, r[k] = down;\n for (int j = i + 1; j <= right; j++) {\n for (int k = 1; k <= req + 1; k++)\n while (calculate(l[k], i, mid, j) >= k) l[k]++;\n for (int k = 1; k <= req + 1; k++)\n while (calculate(mid, i, r[k], j) >= k) r[k]--;\n for (int k = 0; k <= req; k++)\n ans += (l[k] - l[k + 1]) * (r[req - k + 1] - r[req - k]);\n }\n }\n }\n }\n int main() {\n while (scanf( %d%d%d , &n, &m, &req) == 3) {\n memset(has, 0, sizeof(has));\n ans = 0;\n for (int i = 1; i <= n; i++)\n for (int j = 1; j <= m; j++) scanf( %1d , &has[i][j]);\n init();\n work(0, n, 0, m, n < m);\n printf( extra\n , ans);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int a, b, ta, tb;\n cin >> a >> ta >> b >> tb;\n int t, m;\n char c;\n cin >> t >> c >> m;\n m += 60 * t;\n int cur = 5 * 60;\n int res = 0;\n while (cur < 24 * 60) {\n if (min(cur + tb, m + ta) > max(cur, m)) ++res;\n cur += b;\n }\n cout << res;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long mod = 100000007;\n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n long long powmod(long long a, long long b) {\n long long res = 1;\n a %= mod;\n assert(b >= 0);\n for (; b; b >>= 1) {\n if (b & 1) res = res * a % mod;\n a = a * a % mod;\n }\n return res;\n }\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int t;\n cin >> t;\n while (t--) {\n int n;\n cin >> n;\n vector nums(n);\n for (int i = 0; i < n; i++) cin >> nums[i];\n double all = 0;\n sort(nums.rbegin(), nums.rend());\n for (int i = 1; i < n; i++) all += nums[i];\n all = 1.0 * all / (n - 1) + nums[0];\n printf( %.8lf\n , all);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n string res = ;\n cin >> n;\n int arr[2004] = {0};\n for (int i = 0; i < n; ++i) {\n cin >> arr[i];\n }\n int now_rejt = 0;\n int mesto = 1;\n for (int i = 0; i < n; ++i) {\n now_rejt = arr[i];\n mesto = 1;\n for (int j = 0; j < n; ++j) {\n if (now_rejt < arr[j]) {\n ++mesto;\n }\n }\n stringstream ss;\n ss << mesto;\n string strmesto;\n ss >> strmesto;\n res = res + + strmesto;\n }\n res.erase(0, 1);\n cout << res << endl;\n return 0;\n }\n "} @@ -1527,7 +1527,7 @@ {"func_code_string": "#include \n using namespace std;\n long long a, b, p, q, ay, by, tx, g, l, ty, x, y, n = 15, d, m, tot, last, lst2;\n map wow;\n long long shob[104];\n vector all;\n char c;\n int setbit(int n, int pos) { return n | (1 << (pos)); }\n int isbit(int n, int pos) { return n & (1 << (pos)); }\n int how(int a, long long &x) {\n int ret = 0, boom = 1, wow = 0;\n while (a > 0) {\n ret++;\n int md = a % 7;\n wow = boom * md + wow;\n boom *= 10;\n a /= 7;\n }\n x = wow;\n return ret;\n }\n int Bboom(int n, int len, int mask, int A) {\n if (len > b) {\n return 0;\n }\n int now = n, ans = 0;\n for (int i = 0; i < 7; i++) {\n if (isbit(mask, i) == 0) {\n now = n * 10 + i;\n if (len == b && now <= y) {\n ans++;\n } else if (len < b && now <= y && isbit(mask, i) == 0) {\n ans += Bboom(now, len + 1, setbit(mask, i), A);\n }\n }\n }\n return ans;\n }\n int Aboom(int n, int len, int mask) {\n if (len > a) {\n return 0;\n }\n int now = n, ans = 0;\n for (int i = 0; i < 7; i++) {\n if (isbit(mask, i) == 0) {\n now = n * 10 + i;\n if (len == a && now <= x) {\n ans += Bboom(0, 1, setbit(mask, i), now);\n } else if (len < a && now <= x) {\n ans += Aboom(now, len + 1, setbit(mask, i));\n }\n }\n }\n return ans;\n }\n int main() {\n cin >> n >> m;\n n--;\n m--;\n a = max(how(n, x), 1);\n b = max(how(m, y), 1);\n if (a + b > 7) {\n cout << 0 << endl;\n } else {\n n = a + b;\n p = x;\n q = y;\n cout << Aboom(0, 1, 0);\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long mod = (long long)1e9 + 7;\n const long long inf = (long long)1e16;\n const long double eps = 1e-12;\n const long long N = (int)1e5 + 5;\n const long long LOGN = 19;\n const long double PI = 3.14159265358979323846;\n inline long long mul(long long a, long long b, long long m = mod) {\n return (long long)(a * b) % m;\n }\n inline long long add(long long a, long long b, long long m = mod) {\n a += b;\n if (a >= m) a -= m;\n if (a < 0) a += m;\n return a;\n }\n inline long long power(long long a, long long b, long long m = mod) {\n if (b == 0) return 1;\n if (b == 1) return (a % m);\n long long x = power(a, b / 2, m);\n x = mul(x, x, m);\n if (b % 2) x = mul(x, a, m);\n return x;\n }\n bool check(string& k) {\n int l = 0, r = k.size() - 1;\n while (l < r) {\n if (k[l] != k[r]) {\n return false;\n }\n l++;\n r--;\n }\n return true;\n }\n bool poss(string& k) {\n map mp;\n int num = 0;\n for (int i = 0; i < k.length(); i++) {\n if (mp.find(k[i]) == mp.end()) {\n mp[k[i]]++;\n num++;\n }\n }\n if (num == 1) return false;\n return true;\n }\n int rec(string& s) {\n int n = s.length();\n if (!poss(s)) return -1;\n if (!check(s)) return 0;\n string k;\n for (int i = 0; i < n / 2; i++) {\n k += s[i];\n }\n bool ok = check(k);\n if (!ok) {\n if (n & 1) return 2;\n return 1;\n }\n int ret = rec(k);\n if (ret == -2) {\n if (n & 1) return 2;\n return 1;\n }\n if (ret == -1) {\n if (n & 1) return -2;\n return -1;\n }\n return ret;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n if (0) {\n freopen( C:\\Users\\Dishant\\Desktop\\Collection-DEV c++\\input.txt , r ,\n stdin);\n freopen( C:\\Users\\Dishant\\Desktop\\Collection-DEV c++\\output.txt , w ,\n stdout);\n }\n string s;\n cin >> s;\n int n = s.length();\n int ans = rec(s);\n if (ans <= -1) {\n cout << Impossible ;\n } else\n cout << ans;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long n, k;\n cin >> n >> k;\n if (n / k % 2)\n printf( YES\n );\n else\n printf( NO\n );\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int maxx(int fd, int sd) { return (fd > sd) ? fd : sd; }\n int minn(int fd, int sd) { return (fd < sd) ? fd : sd; }\n long long nod(long long a, long long b) {\n if (a < b) {\n return nod(b, a);\n }\n if (b == 0) {\n return a;\n }\n return nod(b, a % b);\n }\n long long nok(long a, long b) {\n long long result = (long long)a * (long long)b;\n result = result / nod(a, b);\n return result;\n }\n int main() {\n long long n, k;\n long long overallNOK = 1LL;\n scanf( %I64d %I64d , &n, &k);\n for (int i = 0; i < n; ++i) {\n long long c;\n scanf( %I64d , &c);\n overallNOK = nok(nod(k, c), overallNOK);\n }\n printf( %s , (overallNOK % k == 0) ? Yes : No );\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int maxx(int fd, int sd) { return (fd > sd) ? fd : sd; }\n int minn(int fd, int sd) { return (fd < sd) ? fd : sd; }\n long long nod(long long a, long long b) {\n if (a < b) {\n return nod(b, a);\n }\n if (b == 0) {\n return a;\n }\n return nod(b, a % b);\n }\n long long nok(long a, long b) {\n long long result = (long long)a * (long long)b;\n result = result / nod(a, b);\n return result;\n }\n int main() {\n long long n, k;\n long long overallNOK = 1LL;\n scanf( extra extra , &n, &k);\n for (int i = 0; i < n; ++i) {\n long long c;\n scanf( extra , &c);\n overallNOK = nok(nod(k, c), overallNOK);\n }\n printf( %s , (overallNOK % k == 0) ? Yes : No );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long mod = 1000000007;\n long long powmod(long long a, long long b) {\n long long res = 1;\n a %= mod;\n assert(b >= 0);\n for (; b; b >>= 1) {\n if (b & 1) res = res * a % mod;\n a = a * a % mod;\n }\n return res;\n }\n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n const int maxx = 10005;\n const int INF = 0x3f3f3f3f;\n int n, m, k;\n int vis[maxx];\n int ans = 0, cnt = 0, pos = 0;\n int l = 0, r = 0;\n string a, b;\n string s1, s2;\n int main() {\n scanf( %d%d , &n, &m);\n cin >> a >> b;\n if (n > m + 1) {\n printf( NO\n );\n return 0;\n }\n int fk = 0;\n int tag = 0;\n for (int i = 0; i < n; i++) {\n if (a[i] == '*') {\n tag = 1;\n continue;\n }\n if (tag == 0)\n s1.push_back(a[i]);\n else\n s2.push_back(a[i]);\n }\n if (tag) {\n fk = 0;\n for (int i = 0; i < ((int)(s1).size()); i++) {\n if (b[i] != s1[i]) fk = 1;\n }\n for (int i = ((int)(s2).size()) - 1; i >= 0; i--) {\n if (b[m - ((int)(s2).size()) + i] != s2[i]) {\n fk = 1;\n }\n }\n } else {\n if (n != m)\n fk = 1;\n else {\n for (int i = 0; i < n; i++) {\n if (a[i] != b[i]) {\n fk = 1;\n break;\n }\n }\n }\n }\n if (a == * ) fk = 0;\n if (fk)\n printf( NO\n );\n else\n printf( YES\n );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct edge {\n int b;\n bool x;\n edge *next;\n } E[100010], *rt[100010];\n int o = 0;\n int mi = 100000000;\n int N;\n void addedge(int a, int b) {\n edge *p = &E[o++];\n p->b = b;\n p->x = false;\n p->next = rt[a];\n rt[a] = p;\n p = &E[o++];\n p->b = a;\n p->x = true;\n p->next = rt[b];\n rt[b] = p;\n }\n int S[10010];\n bool jud[10010];\n void init() {\n for (int i = 1; i <= N; i++) {\n jud[i] = false;\n S[i] = 0;\n }\n }\n void pdfs(int n) {\n jud[n] = true;\n for (edge *p = rt[n]; p != NULL; p = p->next) {\n int b = p->b;\n if (!jud[b]) {\n pdfs(b);\n S[n] += S[b];\n if (p->x) S[n]++;\n }\n }\n }\n void dfs(int n, int s0, int s1) {\n jud[n] = true;\n int b, s, t0, t1;\n for (edge *p = rt[n]; p != NULL; p = p->next) {\n b = p->b;\n if (!jud[b]) {\n s = S[n];\n mi = min(mi, s + s0);\n t0 = s + s0 - S[b];\n if (p->x)\n s = S[n] - 1;\n else\n s = S[n] + 1;\n mi = min(mi, s + s1);\n t1 = s + s1 - S[b];\n s = S[n] - (p->x == true);\n mi = min(mi, s + s0);\n t1 = min(t1, s + s0 - S[b]);\n dfs(b, t0, t1);\n }\n }\n }\n int main() {\n o = 0;\n int i, j, k;\n int a, b, s;\n scanf( %d , &N);\n if (N == 1) {\n printf( 0\n );\n return 0;\n }\n for (i = 0; i <= N; i++) {\n rt[i] = NULL;\n }\n for (i = 1; i < N; i++) {\n scanf( %d%d , &a, &b);\n addedge(a, b);\n }\n for (i = 1; i <= N; i++) {\n init();\n pdfs(i);\n for (j = 0; j <= N; j++) jud[j] = false;\n dfs(i, 0, 0);\n }\n printf( %d\n , mi);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n long long h[100000], ans[100000];\n cin >> n;\n for (int i = 0; i < n; i++) cin >> h[i];\n ans[n - 1] = 0;\n for (int i = n - 2; i >= 0; i--) {\n if (h[i] <= h[i + 1])\n ans[i] = h[i + 1] - h[i] + 1;\n else\n ans[i] = 0;\n h[i] = max(h[i], h[i + 1]);\n }\n for (int i = 0; i < n; i++) cout << ans[i] << ;\n }\n "} @@ -1574,7 +1574,7 @@ {"func_code_string": "#include \n using namespace std;\n struct node {\n int a;\n int id;\n bool operator<(const node &b) const {\n if (a != b.a)\n return a < b.a;\n else\n return id > b.id;\n }\n };\n struct node que[305];\n bool vis[305];\n int main() {\n int t, n, m;\n scanf( %d , &t);\n while (t--) {\n memset(vis, 0, sizeof(vis));\n scanf( %d%d , &n, &m);\n for (int i = 1; i <= m; i++) {\n scanf( %d , &que[i].a);\n que[i].id = i;\n }\n sort(que + 1, que + m + 1);\n long long ans = 0;\n for (int i = 1; i <= m; i++) {\n for (int j = 1; j < que[i].id; j++) ans += vis[j];\n vis[que[i].id] = 1;\n }\n printf( %lld\n , ans);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, k;\n cin >> n >> k;\n int ara[2 * n + 1], count = 0;\n for (int i = 0; i <= 2 * n; i++) {\n cin >> ara[i];\n }\n for (int i = 0; count < k; i++) {\n if (ara[i] + 1 < ara[i + 1] && ara[i + 1] - 1 > ara[i + 2]) {\n ara[i + 1]--;\n count++;\n }\n }\n for (int i = 0; i < 2 * n; i++) {\n cout << ara[i] << ;\n }\n cout << ara[2 * n] << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n cin >> n;\n string s;\n cin >> s;\n set ss;\n for (char c : s) ss.insert(c);\n if (ss.size() < n)\n cout << NO << endl;\n else {\n cout << YES << endl;\n int vis[30];\n memset(vis, 0, sizeof vis);\n string res = ;\n for (char c : s) {\n if (n == 1)\n res += c;\n else {\n if (res.size() > 0 and !vis[c - 'a']) {\n n--;\n vis[c - 'a'] = 1;\n cout << res << endl;\n res = string(1, c);\n } else {\n vis[c - 'a'] = 1;\n res += c;\n }\n }\n }\n cout << res << endl;\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n long long stk[300001][3], top = 1, n, m, best = 1, nownum, K, B;\n long long eval(long long x) {\n return (K + stk[x][0]) * stk[x][2] + B + stk[x][1];\n }\n double intersect(long long x, long long y) {\n return (double)(stk[x][0] - stk[y][0]) / (stk[y][1] - stk[x][1]);\n }\n bool comp(long long x) {\n return eval(top) * (stk[top][2] - stk[top - 1][2]) >=\n (eval(top - 1) - eval(top)) * (x - stk[top][2]);\n }\n signed main() {\n scanf( %I64d%I64d , &nownum, &m);\n --nownum;\n for (long long i = 1, opt, k, b, s; i <= m; i++) {\n scanf( %I64d , &opt);\n if (opt == 1) {\n scanf( %I64d , &k);\n top = 1;\n K = B = 0;\n stk[top][0] = 0;\n stk[top][1] = 0;\n stk[top][2] = 0;\n nownum += k;\n } else if (opt == 2) {\n scanf( %I64d , &k);\n if (eval(top) == 0) {\n nownum += k;\n goto loop;\n }\n while (top > 1 && comp(nownum + 1)) --top;\n ++top;\n stk[top][0] = -K;\n stk[top][1] = -B;\n stk[top][2] = nownum + 1;\n nownum += k;\n } else {\n scanf( %I64d%I64d , &b, &s);\n K += s;\n B += b;\n while (top > 1 && eval(top - 1) <= eval(top)) --top;\n }\n loop:\n printf( %I64d %I64d\n , stk[top][2] + 1, eval(top));\n }\n }\n "} +{"func_code_string": "#include \n long long stk[300001][3], top = 1, n, m, best = 1, nownum, K, B;\n long long eval(long long x) {\n return (K + stk[x][0]) * stk[x][2] + B + stk[x][1];\n }\n double intersect(long long x, long long y) {\n return (double)(stk[x][0] - stk[y][0]) / (stk[y][1] - stk[x][1]);\n }\n bool comp(long long x) {\n return eval(top) * (stk[top][2] - stk[top - 1][2]) >=\n (eval(top - 1) - eval(top)) * (x - stk[top][2]);\n }\n signed main() {\n scanf( extraextra , &nownum, &m);\n --nownum;\n for (long long i = 1, opt, k, b, s; i <= m; i++) {\n scanf( extra , &opt);\n if (opt == 1) {\n scanf( extra , &k);\n top = 1;\n K = B = 0;\n stk[top][0] = 0;\n stk[top][1] = 0;\n stk[top][2] = 0;\n nownum += k;\n } else if (opt == 2) {\n scanf( extra , &k);\n if (eval(top) == 0) {\n nownum += k;\n goto loop;\n }\n while (top > 1 && comp(nownum + 1)) --top;\n ++top;\n stk[top][0] = -K;\n stk[top][1] = -B;\n stk[top][2] = nownum + 1;\n nownum += k;\n } else {\n scanf( extraextra , &b, &s);\n K += s;\n B += b;\n while (top > 1 && eval(top - 1) <= eval(top)) --top;\n }\n loop:\n printf( extra extra\n , stk[top][2] + 1, eval(top));\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n int to[55][35][35][4][3];\n int dx[] = {0, 1, 0, -1};\n int dy[] = {1, 0, -1, 0};\n int Sign(int x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }\n int main() {\n int n, b;\n cin >> n >> b;\n ++b;\n for (int i = 0; i < b; ++i) {\n for (int j = 0; j < b; ++j) {\n for (int d = 0; d < 4; ++d) {\n int nx = i + dx[d], ny = j + dy[d];\n to[0][i][j][d][0] = nx;\n to[0][i][j][d][1] = ny;\n to[0][i][j][d][2] = d;\n }\n }\n }\n for (int i = 0; i < n; ++i) {\n int x0, y0, x1, y1;\n cin >> x0 >> y0 >> x1 >> y1;\n int dx = Sign(x1 - x0), dy = Sign(y1 - y0);\n int dd = 0;\n for (int j = 0; j < 4; ++j) {\n if (dx == ::dx[j] && dy == ::dy[j]) {\n dd = j;\n break;\n }\n }\n while (x0 != x1 || y0 != y1) {\n for (int j = 0; j < 4; ++j) {\n to[0][x0][y0][j][0] = x0 + dx;\n to[0][x0][y0][j][1] = y0 + dy;\n to[0][x0][y0][j][2] = dd;\n }\n x0 += dx;\n y0 += dy;\n }\n for (int j = 0; j < 4; ++j) {\n to[0][x0][y0][j][0] = x0 + dx;\n to[0][x0][y0][j][1] = y0 + dy;\n to[0][x0][y0][j][2] = dd;\n }\n }\n for (int i = 1; i < 55; ++i) {\n for (int x = 0; x < b; ++x) {\n for (int y = 0; y < b; ++y) {\n for (int j = 0; j < 4; ++j) {\n int nx = to[i - 1][x][y][j][0], ny = to[i - 1][x][y][j][1],\n dd = to[i - 1][x][y][j][2];\n if (nx < 0 || nx >= b || ny < 0 || ny >= b) {\n to[i][x][y][j][0] = nx;\n to[i][x][y][j][1] = ny;\n to[i][x][y][j][2] = -1;\n } else {\n to[i][x][y][j][0] = to[i - 1][nx][ny][dd][0];\n to[i][x][y][j][1] = to[i - 1][nx][ny][dd][1];\n to[i][x][y][j][2] = to[i - 1][nx][ny][dd][2];\n }\n }\n }\n }\n }\n int q;\n cin >> q;\n for (int i = 0; i < q; ++i) {\n int x, y;\n char d;\n long long t;\n cin >> x >> y >> d >> t;\n int dir = 0;\n if (d == 'L') {\n dir = 3;\n } else if (d == 'R') {\n dir = 1;\n } else if (d == 'D') {\n dir = 2;\n } else {\n dir = 0;\n }\n for (int j = 0; t; ++j, t >>= 1) {\n if (t & 1) {\n int nx = to[j][x][y][dir][0];\n int ny = to[j][x][y][dir][1];\n dir = to[j][x][y][dir][2];\n x = nx;\n y = ny;\n }\n if (x < 0 || x >= b || y < 0 || y >= b) {\n break;\n }\n }\n x = max(0, min(x, b - 1));\n y = max(0, min(y, b - 1));\n cout << x << << y << '\n';\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, k, p, x;\n cin >> n >> k >> p;\n int impair(k - p);\n vector pai, imp;\n for (int i = 0; i < n; ++i) {\n cin >> x;\n if (x & 1)\n imp.push_back(x);\n else\n pai.push_back(x);\n }\n int avpair(pai.size()), avimpair(imp.size());\n avimpair -= impair;\n if (avimpair < 0 || (avpair + (avimpair >> 1)) < p || (avimpair & 1)) {\n cout << NO ;\n return 0;\n }\n cout << YES\n ;\n vector > res;\n res.resize(k);\n int iimp(0), ipai(0);\n for (int i = 0; i < impair; ++i) res[i].push_back(imp[iimp++]);\n for (int i = impair; i < k; ++i)\n if (ipai < pai.size())\n res[i].push_back(pai[ipai++]);\n else {\n res[i].push_back(imp[iimp++]);\n res[i].push_back(imp[iimp++]);\n }\n while (ipai < pai.size()) res[0].push_back(pai[ipai++]);\n while (iimp < imp.size()) res[0].push_back(imp[iimp++]);\n for (int i = 0; i < k; ++i) {\n cout << res[i].size() << ;\n for (int j = 0; j < res[i].size(); ++j) cout << res[i][j] << ;\n cout << \n ;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int x;\n cin >> x;\n cout << 25;\n }\n "} @@ -1689,7 +1689,7 @@ {"func_code_string": "#include \n using namespace std;\n const int maxN = 200005;\n const int inf = 214748364;\n int n, m, g[21][1 << 20], f[maxN], v[maxN], s[maxN];\n int cost(int a, int b) {\n for (int i = m; i >= 0; --i) {\n if ((a & ((1 << i) - 1)) == (b >> (m - i))) return m - i;\n }\n }\n void init() {\n char c[25];\n scanf( %d , &n);\n for (int i = 1; i <= n; ++i) {\n scanf( %s , c + 1);\n m = strlen(c + 1);\n for (int j = 1; j <= m; ++j) v[i] = (v[i] << 1) + c[j] - 48;\n }\n s[1] = m;\n for (int i = 2; i <= n; ++i) s[i] = s[i - 1] + cost(v[i - 1], v[i]);\n }\n void work() {\n int ans = inf;\n for (int i = 0; i <= m; ++i)\n for (int j = 0; j <= (1 << m) - 1; ++j) g[i][j] = inf;\n g[0][0] = 0;\n f[1] = m;\n for (int i = 2; i <= n; ++i) {\n f[i] = inf;\n for (int j = 0; j <= m; ++j) {\n int tmp = s[i - 1] + g[j][v[i] >> (m - j)] + m - j;\n f[i] = ((f[i]) < (tmp) ? (f[i]) : (tmp));\n }\n for (int j = 0; j <= m; ++j)\n g[j][v[i - 1] & ((1 << j) - 1)] =\n ((g[j][v[i - 1] & ((1 << j) - 1)]) < (f[i] - s[i])\n ? (g[j][v[i - 1] & ((1 << j) - 1)])\n : (f[i] - s[i]));\n }\n for (int i = 1; i <= n; ++i)\n ans = ((ans) < (f[i] + s[n] - s[i]) ? (ans) : (f[i] + s[n] - s[i]));\n printf( %d\n , ans);\n }\n int main() {\n init();\n work();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n inline void Input_Output() {}\n const double eps = 0.000001;\n const long double pi = acos(-1);\n const int maxn = 1e7 + 9;\n const int mod = 1e9 + 7;\n const long long MOD = 1e18 + 9;\n const long long INF = 1e18 + 123;\n const int inf = 2e9 + 11;\n const int mxn = 1e6 + 9;\n const int N = 6e5 + 123;\n const int K = 80;\n const int pri = 997;\n const int Magic = 2101;\n const int dx[] = {-1, 0, 1, 0};\n const int dy[] = {0, -1, 0, 1};\n int n, m, k, x;\n vector state;\n int ids[(1 << 8)];\n struct Mat {\n long long d[K][K];\n Mat(long long val = INF) {\n for (int i = 0; i < K; ++i)\n for (int j = 0; j < K; ++j) d[i][j] = INF;\n for (int i = 0; i < K; ++i) d[i][i] = val;\n }\n Mat operator+(Mat &b) {\n Mat res;\n for (int i = 0; i < K; ++i)\n for (int j = 0; j < K; ++j)\n for (int k = 0; k < K; ++k)\n res.d[i][j] = min(res.d[i][j], d[i][k] + b.d[k][j]);\n return res;\n }\n void print() {\n for (int i = 0; i < K; ++i) {\n for (int j = 0; j < K; ++j) {\n if (d[i][j] == INF) {\n cout << bd ;\n continue;\n }\n cout << d[i][j] << ' ';\n }\n cout << '\n';\n }\n }\n };\n Mat make_matrix(vector &c) {\n assert((int)(c.size()) == k);\n Mat res;\n for (int id = 0; id < (int)(state.size()); ++id) {\n int msk = state[id];\n if (msk % 2 == 0) {\n int nmsk = msk / 2;\n res.d[id][ids[nmsk]] = 0;\n continue;\n }\n for (int i = 0; i < k; ++i) {\n int nmsk = (msk >> 1);\n if (nmsk & (1 << i)) {\n continue;\n }\n nmsk |= (1 << i);\n res.d[id][ids[nmsk]] = min(res.d[id][ids[nmsk]], c[i]);\n }\n }\n return res;\n }\n int main() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cin >> x >> k >> n >> m;\n for (int msk = 0; msk < (1 << k); ++msk) {\n ids[msk] = -1;\n if (__builtin_popcount(msk) != x) {\n continue;\n }\n ids[msk] = (int)(state.size());\n state.push_back(msk);\n }\n vector c(k);\n for (auto &e : c) cin >> e;\n vector pos = {0, n - x};\n vector > spec(m);\n for (auto &it : spec) {\n cin >> it.first >> it.second;\n it.first--;\n for (int i = 0; i <= k; ++i) {\n int s = it.first - i;\n s = max(s, 0);\n s = min(s, n - x);\n pos.push_back(s);\n }\n }\n sort(pos.begin(), pos.end());\n pos.resize(unique(pos.begin(), pos.end()) - pos.begin());\n vector Pw;\n Pw.push_back(make_matrix(c));\n int bit = 0;\n while ((1 << bit) <= n) {\n ++bit;\n Pw.push_back(Pw.back() + Pw.back());\n }\n Mat cur = 0;\n for (int it = 0; it + 1 < (int)(pos.size()); ++it) {\n int l = pos[it], r = pos[it + 1];\n vector nc = c;\n for (auto s : spec) {\n if (s.first > l && s.first <= l + k) {\n nc[s.first - l - 1] += s.second;\n }\n }\n if (nc != c) {\n Mat cn = make_matrix(nc);\n cur = cur + cn;\n } else {\n int dif = r - l;\n for (int i = 0; i < (int)(Pw.size()); ++i) {\n if (dif & (1 << i)) {\n cur = cur + Pw[i];\n }\n }\n }\n }\n int fin = (1 << x) - 1;\n fin = ids[fin];\n assert(fin != -1);\n cout << cur.d[fin][fin] << '\n';\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n bool vis[2][100005];\n char c[2][100005];\n int main() {\n queue > > q;\n bool flag = 0;\n int n, k;\n cin >> n >> k;\n scanf( %s%s , c[0], c[1]);\n q.push(make_pair(0, make_pair(0, 0)));\n while (!q.empty()) {\n int x = q.front().first, y = q.front().second.first,\n de = q.front().second.second;\n q.pop();\n if (y >= n) {\n flag = 1;\n break;\n }\n if (vis[x][y] || de > y) continue;\n vis[x][y] = 1;\n if (y - 1 >= 0 && c[x][y - 1] != 'X' && y - 1 >= de + 1 && !vis[x][y - 1]) {\n q.push(make_pair(x, make_pair(y - 1, de + 1)));\n }\n if (y + 1 >= n || (c[x][y + 1] != 'X' && !vis[x][y + 1])) {\n q.push(make_pair(x, make_pair(y + 1, de + 1)));\n }\n if (y + k >= n || (c[x ^ 1][y + k] != 'X' && !vis[x ^ 1][y + k])) {\n q.push(make_pair(x ^ 1, make_pair(y + k, de + 1)));\n }\n }\n if (flag)\n cout << YES ;\n else\n cout << NO ;\n }\n "} -{"func_code_string": "#include \n int n, k, ans;\n long long s[200005], a[200005], b[200005];\n void neg() {\n for (int i = 0; i <= n; i++) {\n a[i] = -a[i];\n b[i] = -b[i];\n }\n }\n void trans() {\n b[n]--;\n b[0] += 2;\n for (int i = 1; i < n; i++) b[i]++;\n for (int i = 0; i < n; i++) {\n b[i + 1] += b[i] / 2;\n b[i] %= 2;\n }\n }\n void print(long long x[]) {\n for (int i = 0; i <= n; i++) printf( %I64d , x[i]);\n printf( \n );\n }\n int main() {\n scanf( %d %d , &n, &k);\n for (int i = 0; i <= n; i++) scanf( %I64d , &a[i]);\n for (int i = 0; i < n; i++) {\n b[i] += a[i];\n b[i + 1] += b[i] / 2;\n b[i] %= 2;\n if (b[i] < 0) {\n b[i + 1]--;\n b[i] += 2;\n }\n }\n b[n] += a[n];\n if (b[n] < 0) neg();\n trans();\n for (int i = n; i >= 0; i--) {\n if (s[i + 1] == 10ll * k + 1)\n s[i] = 10ll * k + 1;\n else\n s[i] = s[i + 1] * 2 + b[i];\n if (s[i] > 10ll * k) s[i] = 10ll * k + 1;\n }\n for (int i = 0; i <= n; i++) {\n if (i == n && llabs(s[i] - a[i]) <= k && s[i] != a[i]) ans++;\n if (i != n && llabs(s[i] - a[i]) <= k) ans++;\n if (b[i]) break;\n }\n printf( %d\n , ans);\n scanf( \n );\n return 0;\n }\n "} +{"func_code_string": "#include \n int n, k, ans;\n long long s[200005], a[200005], b[200005];\n void neg() {\n for (int i = 0; i <= n; i++) {\n a[i] = -a[i];\n b[i] = -b[i];\n }\n }\n void trans() {\n b[n]--;\n b[0] += 2;\n for (int i = 1; i < n; i++) b[i]++;\n for (int i = 0; i < n; i++) {\n b[i + 1] += b[i] / 2;\n b[i] %= 2;\n }\n }\n void print(long long x[]) {\n for (int i = 0; i <= n; i++) printf( extra , x[i]);\n printf( \n );\n }\n int main() {\n scanf( %d %d , &n, &k);\n for (int i = 0; i <= n; i++) scanf( extra , &a[i]);\n for (int i = 0; i < n; i++) {\n b[i] += a[i];\n b[i + 1] += b[i] / 2;\n b[i] %= 2;\n if (b[i] < 0) {\n b[i + 1]--;\n b[i] += 2;\n }\n }\n b[n] += a[n];\n if (b[n] < 0) neg();\n trans();\n for (int i = n; i >= 0; i--) {\n if (s[i + 1] == 10ll * k + 1)\n s[i] = 10ll * k + 1;\n else\n s[i] = s[i + 1] * 2 + b[i];\n if (s[i] > 10ll * k) s[i] = 10ll * k + 1;\n }\n for (int i = 0; i <= n; i++) {\n if (i == n && llabs(s[i] - a[i]) <= k && s[i] != a[i]) ans++;\n if (i != n && llabs(s[i] - a[i]) <= k) ans++;\n if (b[i]) break;\n }\n printf( %d\n , ans);\n scanf( \n );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n ;\n long long int n, k, sum = 0;\n cin >> n >> k;\n long long int a[n];\n for (long long int i = 0; i < n; i++) cin >> a[i];\n string s;\n cin >> s;\n vector v;\n v.push_back(a[0]);\n for (long long int i = 1; s[i]; i++) {\n if (s[i] == s[i - 1])\n v.push_back(a[i]);\n else {\n sort(v.rbegin(), v.rend());\n for (long long int i = 0; i < k && i < v.size(); i++) {\n sum += v[i];\n }\n v.clear();\n v.push_back(a[i]);\n }\n }\n sort(v.rbegin(), v.rend());\n for (long long int i = 0; i < k && i < v.size(); i++) sum += v[i];\n cout << sum;\n }\n "} {"func_code_string": "#include\n using namespace std;\n int a[10];\n int main() {\n int T;scanf( %d ,&T);\n while(T--) {\n int sum = 0;\n for(int i = 1;i <= 3;i++) {\n scanf( %d ,&a[i]);\n sum += a[i];\n }\n if(sum % 9 == 0) {\n if(a[1] >= sum / 9 && a[2] >= sum / 9 && a[3] >= sum / 9) {\n printf( YES\n );\n } else {\n printf( NO\n );\n }\n } else {\n printf( NO\n );\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n using ll = long long int;\n using ld = long double;\n using vi = vector;\n using vll = vector;\n using vd = vector;\n using vvi = vector;\n int ctoi(char c) { return c - '0'; }\n int slen(string s) { return s.length(); }\n int vsize(vi a) { return (int)a.size(); }\n int in() {\n int x;\n cin >> x;\n return x;\n }\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N;\n cin >> N;\n vi d(N);\n for (auto& x : d) cin >> x;\n int mn = abs(d[N - 1] - d[0]);\n int a = N - 1, b = 0;\n for (int i = 1; i < N; i++) {\n if (abs(d[i] - d[i - 1]) < mn) {\n mn = abs(d[i] - d[i - 1]);\n a = i;\n b = i - 1;\n }\n }\n cout << a + 1 << << b + 1 << endl;\n return 0;\n }\n "} @@ -1702,7 +1702,7 @@ {"func_code_string": "#include \n using namespace std;\n const int N = 1002, M = 10002;\n pair dp[N][M];\n map di;\n bool vis[N][M];\n int nxt[N][M];\n long long a[N], b[N], k;\n int T[M][N];\n int n;\n long long gcd(long long a, long long b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n }\n int main() {\n scanf( %d %lld , &n, &k);\n for (int i = 0; i < n; ++i) {\n scanf( %lld , b + i);\n a[i] = gcd(b[i], k);\n }\n if (k == 1) return printf( %d\n%ld\n , 1, min_element(b, b + n) - b + 1), 0;\n vector divisor;\n for (long long i = 1; i * i <= k; ++i)\n if (k % i == 0) {\n divisor.push_back(i);\n divisor.push_back(k / i);\n }\n sort(divisor.begin(), divisor.end());\n divisor.resize(unique(divisor.begin(), divisor.end()) - divisor.begin());\n int m = divisor.size();\n for (int i = 0; i < m; ++i) di[divisor[i]] = i;\n for (int i = 0; i < m; ++i)\n for (int j = 0; j < n; ++j)\n T[i][j] = di[divisor[i] / gcd(divisor[i], a[j])];\n nxt[n][0] = -1;\n dp[n][0] = {0, 0};\n for (int i = 1; i < m; ++i) dp[n][i] = {n + 1, 0};\n for (int i = 0; i < m; ++i)\n for (int j = n - 1; j >= 0; --j) {\n pair ans1 = dp[j + 1][i];\n pair ans2 = dp[j + 1][T[i][j]];\n ans2.first += 1;\n ans2.second += b[j];\n if (ans1 <= ans2) {\n nxt[j][i] = nxt[j + 1][i];\n dp[j][i] = ans1;\n } else {\n nxt[j][i] = j;\n dp[j][i] = ans2;\n }\n }\n pair ans = dp[0][m - 1];\n if (ans.first > n) return puts( -1 ), 0;\n printf( %d\n , ans.first);\n int pos = 0;\n int nx = m - 1;\n while (pos != -1) {\n if (nxt[pos][nx] != pos)\n pos = nxt[pos][nx];\n else {\n nx = T[nx][pos];\n printf( %d , pos + 1);\n pos += 1;\n }\n }\n puts( );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(0);\n int n;\n cin >> n;\n int a[100005];\n for (int i = 0; i < n; i++) cin >> a[i];\n sort(a, a + n);\n if (n == 1) {\n cout << -1 << endl;\n return 0;\n }\n bool flag = true;\n for (int i = 1; i < n; i++) flag = flag && (a[0] == a[i]);\n if (flag) {\n cout << 1 << endl;\n cout << a[0] << endl;\n return 0;\n }\n if (n == 2) {\n if ((a[0] + a[1]) % 2 == 0)\n cout << 3 << endl;\n else\n cout << 2 << endl;\n cout << 2 * a[0] - a[1] << ;\n if ((a[0] + a[1]) % 2 == 0) cout << (a[1] + a[0]) / 2 << ;\n cout << 2 * a[1] - a[0] << ;\n return 0;\n }\n flag = true;\n for (int i = 2; i < n; i++) flag = flag && (a[1] - a[0] == a[i] - a[i - 1]);\n if (flag) {\n cout << 2 << endl;\n cout << 2 * a[0] - a[1] << ;\n cout << 2 * a[n - 1] - a[n - 2] << endl;\n return 0;\n }\n vector diff;\n set di;\n for (int i = 1; i < n; i++) {\n diff.push_back(a[i] - a[i - 1]);\n di.insert(a[i] - a[i - 1]);\n }\n if (di.size() != 2) {\n cout << 0 << endl;\n return 0;\n }\n sort(diff.begin(), diff.end());\n int chan = diff[n - 2];\n if (chan != 2 * diff[0]) {\n cout << 0 << endl;\n return 0;\n }\n for (int i = n - 3; i >= 0; i--) {\n if (diff[i] == chan || diff[i] != diff[0]) {\n cout << 0 << endl;\n return 0;\n }\n }\n for (int i = 1; i < n; i++) {\n if (a[i] - a[i - 1] == chan) {\n if ((a[i] + a[i - 1]) % 2 == 0) {\n cout << 1 << endl;\n cout << (a[i] + a[i - 1]) / 2 << endl;\n return 0;\n } else {\n cout << 0 << endl;\n return 0;\n }\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n vector fib(46, -1);\n int adv_fib(int n) {\n if (n == 0 || n == 1) {\n return 1;\n } else if (fib[n] == -1) {\n return fib[n] = adv_fib(n - 1) + adv_fib(n - 2);\n } else {\n return fib[n];\n }\n }\n int main() {\n int n, curr = 1;\n cin >> n;\n for (int i = 1; i <= n; i++) {\n if (adv_fib(curr) == i) {\n cout << 'O';\n curr++;\n } else {\n cout << 'o';\n }\n }\n }\n "} -{"func_code_string": "#include \n using namespace std;\n long long i, j, k, l, m, n, t, a[211111], b[211111], c[111111], d, s;\n string p[111111], q[111111];\n int main() {\n cin >> n;\n for (i = 1; i <= n; i++) scanf( %I64d , &a[i]);\n for (i = 1; i <= n; i++) scanf( %I64d , &b[i]);\n i = 1;\n j = 1;\n while (i <= n) {\n while (a[i] != b[j] && j <= n) j++;\n if (j <= n)\n i++;\n else\n break;\n }\n if (i > n) {\n cout << 0;\n return 0;\n }\n cout << n - i + 1;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long i, j, k, l, m, n, t, a[211111], b[211111], c[111111], d, s;\n string p[111111], q[111111];\n int main() {\n cin >> n;\n for (i = 1; i <= n; i++) scanf( extra , &a[i]);\n for (i = 1; i <= n; i++) scanf( extra , &b[i]);\n i = 1;\n j = 1;\n while (i <= n) {\n while (a[i] != b[j] && j <= n) j++;\n if (j <= n)\n i++;\n else\n break;\n }\n if (i > n) {\n cout << 0;\n return 0;\n }\n cout << n - i + 1;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n cin >> n;\n vector v(n);\n for (auto &x : v) cin >> x;\n int mine = *min_element(v.begin(), v.end());\n vector temp;\n for (int i = 0; i < n; i++) {\n if (v[i] == mine) temp.push_back(i);\n }\n for (int i = 0; i < temp.size() - 1; i++) temp[i] = temp[i + 1] - temp[i];\n cout << *min_element(temp.begin(), temp.end() - 1) << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 1e5 + 50;\n int n, a[maxn], ans, maxx = 0;\n int main() {\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> a[i];\n maxx = max(maxx, a[i]);\n }\n cout << maxx;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int INF = 1e9 + 7;\n const long long INFL = 1e18 + 123;\n const double PI = atan2(0, -1);\n mt19937 tw(960172);\n long long rnd(long long x, long long y) {\n static uniform_int_distribution d;\n return d(tw) % (y - x + 1) + x;\n }\n const int MAXV = 1e6 + 5;\n int real_dist[289][289];\n string encoded =\n B:5GiO9T[SJLjS9XhW9T;XhSJLKLYO:PJD8TKLJP9PJX:KjS9XKSJTKS[GiOiSYOEOKP:XJ] \n hSJTHX]OiSkS;@hSZKYO:P:O9PJX:OkSKWJDWKWOHKi;VSJX]SlOkSKT;KjS9XKSJTKS; \n LWOYOkKYBiOkS7TKSHKjK9PiJ[OiSkSlJYO:P:S9XlJ9G7GHCGKH2S>FKXO9HjSWKYO:KZO9P: \n KjS7TWGiOiSEO9ThSXOiSk?WKYO:DjS9D9HFKHKYGXB8TiOkS;KjSISJHHKjK9P4KjGWGiOi? \n XOiSk?iK9DkS5G7GHCGKdFjSJH9LiK9T9@WKYO:DjS9D9P7GXGiKW7EKiK9O9DICWKWOH; \n 7HHKjK9 \n WK6GFKHKDGHKjKDKWOfKY>6?FC5CG:VKjSVOGKWOYO4GWGiOUKYOUO8?FGFK7GRBGKW? \n XOUC5G7GHC3OFCWKWO3GFKHKTGiO3Ge>eBU>5CU6B:5CFGiFW?6GFK4KFGHK4GW?X? \n gBGCW7EGX?WCFCWKG>6GFKXFWGXFi:5C5GgBSBXCGKWO4GWGUKjB5G7GH34Gh> \n gBGCGBFCWKGB7GXJW7e>eBU>5;eFWKjF8C7GXGH>6GFKXFWGXFH?eBgB7?F65C7GDGXFU>6? \n FCU>iB5G7GX>gBGCGFFK8>F:D:U6T>5?D2S>fBF;6Ge>gBG>hBFCG>6GDGe: \n 5C5GSBFG4GfB5G73e>gBG76GF7F;S>U>g:U:EG5C7GH>6GVFW;U>6?FCC>6;e:5C5;fB5G7;5? \n F77GB:D:U6T>U>6GW;F?5?FGF7e>gBG;6GF;FCD:f:5?e:R>5?FBF7V6e>eBU>D;U>6?F?e: \n 5C5;gBG7e:f:U6B:5Gg:36T:fBd>F:e:574;fB53e>FBF:S>U>V:fBF>V:U>6?C:e:5Ce> \n gBeB36T6e:S>eBV>5?F7e>g:6GT6e>eBU2e>C:S>U>U:U>6?U>eB4?F:f:U6B:5?5?6GeBf> \n eBgBD:e:5Cf>gBfBU6e>e>D:E6T>e:fBe6B:D:U6gBU6e>eBg:S>U>f:5CD:5C5?D: \n 5GHCU6B6S:E:e2C:S>T>S:U>C:e:f:36T6e>e:f6e:T6e>T2C:S>f:e:f:U6e>e:36g>g:f> \n eBD:e:f>g:S>U>U>C:T:36T64?U6e>4?D:f>e:5C5?D:5GgB5CV:f>U>6?g6T:S>5?f:5?U> \n eBgBU64;B6D:U:f:D:f:U6BC5?eBgBECU>6?6;S>f23G7Gg:5GiK7?D236S:D:S:36e:E: \n T6T2C:U:U6e>e:g>e>D:f:S>U>S:36TBf:SBU>eBgBU6DC5?e>U>g6T:3?fBU>6?g:V2C>U6e> \n eF6?eBgFg:5CD:5G7Gg:5GHCgB6?eBg:5C5Ce>D:fF6?eFg:gBGC7?eFE:D23?UBf:5C5? \n DJ7GgBGC7K7?FGFGU>6CSFXGHC5GiOHCU636D:C6D6B6S:S2C:S:S6T>D:S:36e:D: \n D6T636T6E6B6S:U6T:D:U>U6e:SBU>D:T6e:B6D>T>T6e:S:3;S6D:S:36g:D:U6U6B:V6eBg: \n 5?e>FCf:f>D:U:S>U>E:C2S:g:D:U:d:5?e>D:h636C>D:D>e>D:U67?f:5?e>g:S>U>h:f:F: \n GC5GgBFGYGg:36B6T:S6D6B6U>S:D:46S>T:D:T6TBf:f:S>T6T>e6D6B64?T6e:e:f>e>D:7? \n g:f>e>E:T6g>f>e>U>UB46d:D:T6DCf:f>4?D:5;S>6C5CU>6K7C5Cg:5?U>5?6;U:S:ECf:5? \n UB5CgBg:E?S636g:e:U>f:f:SG6C5CgBFCU>6?F?e>57DG7G7?FG6PHCU6D2S>D6D:D62? \n U6T6e6B:D6f:D:e>7?T>E6e>T6TBD:D6B>T6BBUBf:fBg:UG6?U>U>4;S:d:TBg>e>6?h6B:f: \n D:eBf:S:UFg:UFU:6?6G7?6?YGg>6CT>6?U>5GU>U:SBf:SFg:7C5CGC5KV6T6d:DB5?U> \n 5CUFgBU>5?gJ7?gBFKg>eFTFFGXGFGgRYGg:C636D2S:S6D>T6D6B>C2d:S>e:D:4?D:T2d:D: \n T6V:S6D6g:D:U6gBf:f>eFg>T>T6e>S63BU:f:f>e>D?C2U>e:D:7?U>f:g:S>h:5G6? \n 6C5CVGg:f>E:g>e>U>V>T6T:7?U>g:3?6C5CU>8;D:TBU:UB5?U>f:HC6?6C5C7?eBgB8?g>W> \n HGFG7GGC;PHCU:T6c:S>U6e:g>e:C:V:3BU>eBf:DFg:f>SBU:f>D?U6e:DCU:5?eB7Cf: \n fBHCg>g:eBV>D67?4?5Cg>eJV:3?eBf:TGg>6CECU>6;SFHG6?6GGOHC5C5;ECfB6?E?g:e> \n UGg>FCUBFG7C5?gGf:S>7?4?5G6?U>fKGCFG7CUGgBGCF?eBV?gKHGFGXKWGg:C:S>e2T>S6T: \n E6E:e:E:U>3?B6S:S>D:e>R>C:S>U:S6T:f:U>f6e:S:36T6e:e>S:U>F6T>T>5736T6e:E: \n U6B6S:S>D:T>U:S6e>U>e>D:U6T>g:U>57e:T6e>e:B6D:f>T>e:e:D:U6T6BBD:S:T> \n e6T6T6B:DB5;D:U6e>D2S:SBD:f>CBg:5?e>6SYGg:D:D:46T:S6B>C636C>T6e>T>D:D:5; \n 36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2S>C2C>D:e:e:S>D?T6U>D:D:h:U:U6F:S:h:3? \n 6?FCf:UCU6T:46U:S>D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5?eBW>e>D:8?e> \n W6FGFK7C5GkK7?D6C2S6B:D:C:U:S636E6B>D:U:U6eBU6T:B>T6T:3;D:C:3?T6e63?5?eBU> \n 7?U:U:S:E:C2g:e>e>U>UFE6c:U:U6DCf:f>4;D:D?TBFC5GgB5K7?e>f64?U>f:5;U:S:DCf: \n 5;DB5CgBg:UCT6D6g:e6g>g:5?TG6C5CgBF?U>f:UCfBE;DK7GHC7GGTYGg:T6S>D2U:U:3? \n T6T63;C:E25?U>e:7?D:E2e>T6TFU:U:SBD:SBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5? \n U>eFU>e:DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e:4;SBDCgB5? \n eJg>gBf:5K6?U>5O7C5KfJWGHCWG7K7?D2C6T>S:56S6T:e6T>e6S:U>E6B6D:f:U>E:U:D:e: \n 46S6T>U:U>T>D:T6T6BBfBU>f:f:S:U>fBT6T>e>e6S:D6B6D:g:D:e:U:S:f:U>f:f:S>EC5? \n 6CT>f>e>gBE:T6T>g>U>f>e:f>e>D:V2C:S>T>T:S:D:D27?f:f>e>g:S>U>V6T>566C5CU>6? \n YGg:S6D:U:T6B:T6U>C:U>T6e6T:D6B6TBf:e:T6T6D:e6B:T6T6S6e:f:D:e>D:7?g:e>e: \n E6e:T:f>T6T>UBT6D:D6B6e:D2C:3?D:3?e>U>5CU>UJ7CfBg:T>U>e>6;S:S6e:T64?UBf: \n fBg:E?36T:D6e:U:S:f:3?e:S:U>DCU>e>F?T6473?6G7?6?eK7?D:B:S6C:C2S6T646S6T6D: \n e:S6D6B6U:S:C:D6B:D>C2C6T>D:T:S>e:D:T64?e:S:D:U2C:d:e:D:T6T6V6D:S6D6BBU:S: \n D>D2SBD:5?U>f:f>7?U>f:S>T6e>e>S636TBU:S>T6U>f:f:SFU6B6d:S:d:U:S:UFg>U>f: \n fBU6e>eFU>TBTF6?6C5CgRYGg:C6T6T:U:36e>e6T6e>S:d>U6e:D62?U>U:f:C:f:V:36e>g: \n S>U6eBf:D:eFgBU>U:5?S:SBf:U:f>T6D?S:U6e:D67?T>f:g:S>E23G6?U>5CVG6?6?U>g: \n eBg>V>D6e>7?T>g:e>6Cf:U>8;D2SBU6U:5?U:S:HCg>6Cf:7?eBg>V6e>W>HG6?6GGCYGg: \n 36B6T6S6T6B:U:S6D:46S>T>D:f:DBU6T:S>T6e:d6T6B:4?T647e:5Cf:D:7?U:U:S>E:S6g: \n f>eBU>TB46d>D:f:DCf:5?D;U>5;S>FG6?U>5K7?e>f64?U>g:5;U:S>DCf:5;DB5GgBf:E?S: \n 36g:47U>6?U:SG6C5GgBU?gBg:E?eB67DKHG6?6G7PHCU6C6e:B:T6D2d6C6B:d6C:U:e:S:S: \n V6B6D:D:C:3BT6D2SBD:C>BBU>U>f:D?T6S636e636d:S:U:U6e:h6C>e:S:SFU>T> \n DBS6TFU6gBgB6?U>8?D:T:B>T6e:SBT6T6DBU:S>C2g>g:5?eJV:T62;S>2?e>e>UJg>g>g: \n 5Ge:f:SJg:fFDBGCGG6?6WkK7?T6B:E:S6e:3BT:C:T>36T6dBU6T>E?D:e:S:U:S6V6T636U: \n 36F:7?e>6?fJg>T:T6TBD6T>T:5?U>eBE?36e>T6T>g>D:e:W>e:8?DC5CGC6?fGg:f>E:f>e: \n U>h:e:D:g>D:V:CCgB5GgB8;S:C>T6FBf:fBg:7?g:fB5?iB5?U>ICU>i:7GWKGG6?7?D6e:5? \n F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:5CE:U>fBFB5C6>F6S:S>U>D:6;fB5GR>5?3CG:S> \n U>g:dBU6T:f:U>e>5CE:U>VB57T6B:D:S>T>5CG>V:U>6?F6T>eBV>5?F>g6B:D:U6e6e:f>3? \n 6>C6T6e>e:G:T>U>V6D:f:f>eBV:e>D:U6T>fK7?T:S>e6S>T6T6T2D:S:T:U>4?S6B:S>E6S: \n S>36C:D>T6T6e>U>U:S>D:D:f:3;S:B6D:U6D:T>e6D6D2S:V:U:S6B:SBD:D:U>B6SBT:U>U> \n g:D:h:D:e6S:C2S:S>C2C6T>D:T:S6U:U6e:SFU:S:d>e:d:S:S>UF5;U:U6eBS6T6BFU6TB3> \n 6?FCf:5WkK7?U>U>E:e>e:SB4:D:3Bf:5?eBU>U>F?C6c:e:U6T6h>e:S>h:U6F:7?6? \n FCfJV6R:S6SBT6DBD:5?e>eBUCf:gBU>U>8?g:f:W>D:8?DCGCWG6?gGU6D6E6U>T>D:h>e:S: \n h:U:F:CC5C5Gg>I?U>DFU>FFgBgB7?I?FC5C5GiBU>U>IC5Ci:WKWOHGFKYGg:C2S6D6S636C: \n D:B6D:D:S:U6D6D2S>T6T6S:C2C:d636C:e:S:T6e:e:S>D:g:U6T:S:46S6U:U:S:D:DBD: \n S6D6D23?T6T:d6363;S>5?eBU>eFg>e>U6e:D:e:f6D6B64?T6e:D>e>U>U6D?C2C6U6T6U: \n U6e:CCf>e>U>5;D:T6D?T>473GgB7?gB6PHCU:S6e:S6D6T6d:D2S:e:S>T6e:D:S6g:C:T6S: \n C2CBD6T6S>36C>SBf:U>D:ECf:D:D:d6B:T6S>U:S:U6h:S:e:D:SBD:S63BT63FU:6?gBU>g> \n HCU:f>C:f:D:eBD:D6B>D6BBT6g>e>g:eJV6S:d6B>3?U>e:SFU:U>T6eFf:D:eJg>eFTFFC7? \n FCgRYGg:D:D:46T:S6B>C636C>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C: \n C2S>C2C>D:e:T:S:D?T6U>D:D:h:U:T6F:S6h:3?6?6?f:UCU6T:46U:S:D:V:S6C6g:D:E62? \n f>e>U>8?D:3BD:5BU>U>U>8?5?f>e>W>e:D:8?e>W6FGFG6C5C;PHCU:T6d6S>U6D:V:T6B:V: \n CBU>e:f:DFU6T>S>D:T:C?U6D:D?D:47cB5Cf:f>8?U:U6S>V:36g:d:f>U:SJV:3?e:f:TCU> \n f>D;S>4;SFFG6?6C5O7?e>e64?T>f:D?U6T:DCU:5;C>6Cg>e>gGf:S6h:375?6?U>fG6?6Cg> \n T?eBf:D?e>T?DKHGFG7G6PHCU6C6B:36T6D:e:C:C2d636U6e:f:S:g:S646U:S>DBT6D:DBU: \n S>DB5CU>f:ECU6e:D:f6D62?T>U>g:U:h63>e:f:SFg>eBUBU6eFU>FGgB6?6GHCU>T>SBf:5? \n eBe:D:UFg>eBT6gB7?g>eJV:S64?T>4?6?e>UJ7CgB7?gFg:5CfJgBgFeJHCGGFGHWkK7?T:D: \n E6d>e:SB4:D:3BT64;dBU>U>E?C6c6d:U6T6h>e:S:h:U6F:7?6?6?fJV6R:S6SBT6DBD:5?e> \n e>UCT6gBU>U>8?g:f:W>D:8?DCGCGC6?gGU6D6E6U>T>D:h>e:S:h:U:F:CC5C5Cg>I?U>DFU> \n FFgBgBg>I?FC5C5CiBU>U>IC5Ci:WKWKGGFG7?D2S:e>F>57T>e>SBe>gBR>5767D:e:5;e> \n 675;e:fBE6T>e>V>5?F>F2C:S>D:U>6;fB5CS>5?4CW:S:U>g:R>E6D:e:f:e:fBU:U>UB57T: \n S:36TBfB5CW>g>U>5?V6T>e>g>5?V>g:S:U>U6e6S:U>e>F>36S6e:3?V:S:U>g:D:e:f>e> \n V6e>U>U6e>eK7?D236S:D:S636d:E:T6T2C:U:T6T:S:g>e>D:U:S:U>S636SBU:S>T>e>U> \n U6DC5?e>U>f6T:3?f>U>f:f:V2C>T6T:SFg>e>UBT6TBD:5CgBg:fBHCgB6?eBf:fB5Ce:D: \n eFg>eBf:gB6?6?eFE:C23?T>e:f>e>DJ7CgB6?6Gf:f>eFU>fBSFGCGC5C7SYGg:S6B: \n U6S6T63Bf:S:S>36T6d>T6T>DCU:f6S>U:S:V6T636U636V:g>e>g:eJ7Cf:f:UBD:D>T:6?U> \n 5?D?36e>T6T>g:D:T6h>T6h:4C5C7?5CfK7?5CV:5Cf:fBh:f:D:g:D:h>DCgBFCfB8;S:C> \n D6VBf:fBU:7?f:f>e>8Cf:fB8?U>W:7GWG6G7?kK7?D6C2S6B:D:C6U:S636E6B>D:U: \n T6TBU6T:B>T6T:3;D:C63?T6e63?f>e>U>7?U:U:S:E:C2g:e>e>U>UFE6c:U:T6DCf:f>4;D: \n D?TB6C5CgB5K7?e>f64?U>f:5;U:S:DCf:5;DB5CgBg:UCT6T6g:e6g>f:f>TG6C5CgBF?U>f: \n UCf>E;DG7GGC7GFTYGg:T:3>D:f:S:4?U>D64;D2g:U>f>T67?e>E:g:e>UFf:S:TFg:eBD> \n 6Cg>e>VG6?5?T>5;U6CCUBfB6?U>8;DBU>f>TJ7?5CgFU:fBD:GG7C5C7GYGgBgBeFg>6CfF5? \n T>fJ7?5GU:6GGCgB5Oh>D:DCUBeB6Cf:fNHG6GGCgJg>6CfFU>fJfJXG7GWGHK7?D:U>eBd> \n U6e>U:4;eB57U>6>E:T6T>f:f>F>E:U>e>T6e>U>S:U>eBD6B6T6eBfBV:5?g:T>g6fBT6D:e> \n e6U>B:T6T>D6D:e:U>e:5?V:S:f:S:CC5?5Ge>e>e:fBE6e:U>T:U>fBf:D:e>D:V:S>f6T>e: \n C2C:D:U>D2C:S>g:S6T>g:U>U:U>5CU>U6;PHCU>D:5?D>e>T67?U>U:V6e>BBg>e>gJ7?eBD> \n 6?U>E?e>T647T6C?ECgBFCfBYGgB5Cf:h:f:F:DG6?6GgJV6eBg>e>F;f:D:TCg> \n TCfF7GWG6G7SYGgBF?4G7C5CWC5Cf:E;f:TCgJGCGK7ChGU>U:F:D?7C5C7?U?4Cf: \n fBgG7C5ChG6?V?UGXOHGXGFTYGg:T6S>D2U:U:3?T6T63;C:E25?U>e:7?D:E2e>T6TFU:U: \n SBD:SBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5?U>eFU>e:DFf:DJg>GC7GgB7CYGg:fBD> \n 6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e>4;SBDCgB5?eJg>gBf:fJ6?U>5O7C5KfJWGHCWG7K7?D: \n E:U>R:E:S>e6d6T>e6e:EB56D:D:T6T>5:E6D:f:D:S:e>e:f>S>D:C2C:T>T>E:e:57S:U: \n fBC2S:S:e6e:36C:D:U6T:f:D:S>f:U>T6T:S:4?e:fBS>T:S>U>46S6e>U:U>T>T6T:S: \n 36V6D:T:U>S:T636S6gBT6T:S:U6B:D:V6e>U6g>e>U>f:YGg:S:e>D>57T6eBTBe>eBT>U: \n 67B:f:D>e>675;D:5Cf6T6eBg>U>V>D:U:C2C:g>6;f:5GT>U>5CU6S>U:SBT>U6B:f:4?D: \n 5Cf:S>V:S>g>T6T>fFgB5CU>g>T>6?f6T6eB6?U>g>e:e>U:S6D?S:S>f>T>S>T636CCg:e>U: \n 3?D:f:e6B:47DCg>e>6CUGg:36C:e6T>B6D:U6E:e:E6T>e>D2S:S:U:e>S>D:S>U:B6D:f>T> \n e>e:S>U:C23?e>S:U>V6T>e>5;D:U6T:E6T:D2S:SBU:S>UBS6e>U>eBg>T6T>7?U>5;e>T6e> \n e>S6D:fBU>e>e:U>g:U:SB46S6e:e>T6e>T63Fg>U>g:UFe:f:SBD:f>BBGCg>e>6OHCU6T: \n eBC:E6e:S:R6D:U:T:U>E:36T>f6C:D:E2S6T6E6S:S>U:U:D:U6T6T:CBD:46S6e:S6T:U> \n S6S6B:5;T:D:36D:V6D6e:56D:V>e:f:f>T6D?T6T>C:D6B:D:U6B6S:U6T:D:d:e:S>U:h6C: \n D>T>D>D:U>T6h>e:e:S>F:U:36h:S:F25C5Cg>e>kK7?e:D:U:U6B:U6E>D:f>T6e6T:U6B: \n UBT:e:U6S:D:e6B:T6T6S6e:5?D:e>T:h:f6T>e:U6e>T:U>T6D:UBT6D:D6B:f:D2C:37D:C? \n eBU>5Cf>TJg>e>V:T:D:e:5;C:T6e:T6e:UBf:U>g:E?36T:D6e:U:S>g:3?e:S:U>D;U> \n T6TCU6D;3?6G7Cg>4PHCU>S:e:T>D6e:e:E:e:f:T>e>e:D2S>g>e>T>T:S:SBD6T:D>T>e> \n eBf:S>g:EC5?e>U>f6T>e>5?U>D:f:h:T:e:D2SBf:S:SBT6TFU>6?eB7?g>HCgB6?e>f:f: \n 5CT:D:DBf>eBf:gBU>6?eJV6S:e:e>4?U6eBUFgBU>U>gFf:f:eJg>DFUFgBWGFCgNHCU646D: \n C6D6B:S:S2C:S:S6T>D:S:36e:D:D6T636T6E6B6S:U6T:D:U>U6e:SBU>D:T6e:B6D>T>T6e: \n S:3;S6D:S:36g:D:U6U6B:V6eBg:5?e>FCf:f>D:U:S>U>E:C2S:g:D:U:d:5?e>D:h:36C>D: \n D>e>D:f:7?f:5?e>g:S>U>h:f:g:GC5GgBFCkK7?e6e:T:e:D6T>U>S:T>U>T>g:T>U6BBf:f: \n e>T6T>4;D6T>5?T>f:e>6?D:U>7?g:f>e>E:T:g>f>e>U6TFU>e:T>U6BCf:f>4?D:4;SBGCU> \n gBFK7C5Cg:5?U>5?4;U:S:ECf:5?UB5Cg:f:UCU6S:g:e:fBg:S>UG6C5Cg:ECU>5?D?eBE? \n UK7?FCGKGTYGg:T>D>f:U6B:5?V6D:5;T6f:D:U>D27CU>f:T6T6eFU6B:eBD6T>D:5?g:S> \n VGFCU>e>4;S6e:T>e>e>D:8;T>D:U>DFU:e:DBU6D>36FC7?eBGCYG7?gBU>U>U>gFU:S:SBU: \n SBU:5C5CU>5Oh:364;C>T>gBU6eJg>fBf:UFg:U>fBD:fFeJWGgBWK7CU6S>gB7G4ChB5CF7E? \n 6GF;FChJW>fBgB7:6GWBh>gBGCdB5CFGDCGG3GT:f:5C57dFhBFCW75C7;GKe:5C5GF:FCU> \n fBgB3?6CGCcB5GCCG6T6e>e:U64CGK4GfB5G7GR>5?FG3C7G3GV6e>eBU>D>gB6;7G3;T>U>6? \n eJe>5C5GS>eBgB4?FGd>T6B:D:S:HCU:e:5?F:5;U>U>C>e:f>eB5;77T6e:5;R:f65;S:e>T: \n U>U>VB5CE:U6B:S>T:E6f6T>eBS>e>3?66C:D:f>eBU6T6e:f>e>eBU6T:f>f:S:S>U6BBD:e> \n 6:E6D:f:U6D:T>U>e>E:U:C:36T64;e:f:4?F:D2S6e:4;G:D:U>g2C6T64;T>f:S>U>g:D: \n 5PHCf>e>e:S>f:U6e6S:S:d>U>5?e:S>eBV2S6T>D:36DBf:U6eBU>U>SBU>U>6?D?C6C2C6e: \n D:e>e:U6T6e>h>U>e:S>eFU>D:UBS6BFU6gBgB7?U>8;36S:S:S6S6BBT6D2SBD:D>B6g:f:5? \n TJg>e:3?e>3?e>eBgJ6?g:f:5Ge:S:SJg:fFDBGCWG6?FSYGg:D:D:46T:S6B>C636C>T6e>T> \n D:D:5;36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2C>C2C>D:e:e:S>D?T6U>D:D:h:U:U6F: \n C:h:3?6?FCf:UCU6T:46U:S:D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5?eBW>T> \n D:8?e>W6FGFK7C5G;PHCf:U:f6D>T>D:V6D6T6g:e>D>g:e:UFU6B>D:e:D:C?T>D:5; \n S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJg:e>g:e:E?e:S:C;U:SCUF6GFC5C5O7?D:e6R>U: \n S:E?T>T64;S63;DF6?gBU>gGU:U6V6477?5?g:UCeBU>U>U?g>e:fGg>V?DGHK7G7GFTYGg>e> \n e>S:f:U64;R:S62?U>g:5?e>e>h6C2U:U>D:DFf:U6eFU>DBSFgBgBg>UCD2T6D63;D:3;S>g: \n f:f:8?UB5?e>eJgBU>UFe:SJg:7G7G7CgBI?D:C>C>e:T:SFf:U6TFU>TBS67?6?6?fN7?e:C? \n eBCC5C5C5OhB7?6?6K5?e>eN7?6KUFXGXGGCGK7?D6D:U>R:E:S:e6d6T>e6e:EB56C:D:U6T> \n 5:E6D:e:D:S:e>e:f>S>D6D2S6S>T>E:e:f6S:U:fBC2C:S>e6e:36C:D:U6T:f:D:S:f:U: \n U6e:S64?e:fBS>T:S:U>46S6T>U:U>T>T6T:S:36V6D:T:U>S:C:36D6gBT6T:S>E6B6D:V6T> \n E65?eBU>e>kK7?D6C2S6B:D:C:U:S636E6B>D:U:U6eBU6T:B>T6T:3;D:C:3?T6e63?5?eBU> \n 7?U:U:S:E:C2g:e>e>U>UFE6c:U:U6DCf:f>4;D:D?TBFC5GgB5K7?e>f64?U>f:5;U:S:DCf: \n 5;DB5CgBg:UCT6D6g:e6g>g:5?TG6C5CgBF?U>f:UCfBE;DK7GHC7GGTYGg:T6S>D2U:U:3? \n T6T63;C:E25?U>e:7?D:E2e>T6TFU:U:SBD:CBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5? \n U>eFU>T:DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e:4;SBDCgB5? \n eJg>g>f:5K6?U>5O7C5KfJWGHCWG7OHCU:U>eBS>T6e>T:d:S>f:U>F>D:D6T>e:T:E>46T:S: \n U6e>T>T6T:T>U:S6D2SBU>E6e:U:D:f6T>T636S:3;U>C:D6T>E2C6T6E:T6g>f>e:U6e:DCf: \n eBT:S:S6T>E2S:D:D6D:U>e:D:e:C:h:S>U:D:T>T6D:36V>S6D6B:V:C2C:h:D:V6gB5?eBf: \n YGg:e6e:E6e:D:D:4:S6T:T>e:g6D2S6T>C6T6e6B6S:d:D:D:f>e>T6e:S:S:S6V6T2C:S>D: \n S:e:E:C636SBT>T6D2S64;S:S>e2C64;T>e>e>T:SFU:S:E6T636T6e636C:e:S:T6D>T:D: \n T6D?T6T6f:U6U6T6T6D?V>T:D:47D:C2C?D:47cBgBg>U>5PHCU:S>T:T>T6S:f6E:D:f:U:5? \n D:S:S6V:e>T>D2S>UBT6S:fBU:f>D:U>U:S:D?e>S:S>g6T6e>U:S:T636h:U>D:S:SFU6T> \n UB36e>C6gBg>e>U>8?U>U:e>D6e>TBT6B:fBU6e>D:e>f:D:eJV:C:4?T>T>e>T6TJ6?e>f: \n DFD:U:CBD:DFDBGCgB6?gNHCU636D:C6D6B6S:S2C:S:S6T>D:S:36e:C:D6T636T6E6B6S: \n U6T:D:U>U6T:SBU:D:S6e:B6D>T>T6e:S63;S6D:S:36g:D:U6U6B:V6eBg:f>e>FCU6T>D:U: \n S>D:E:C2S:g:D:E:d:5?e:D:h636C>D:D>e>D:T67?f:5?e:g:S>U:h:f:F:GC5CgBFCkK7? \n T6T:U6T:D:D:E6C6T6U:e>U:U6T6TB46D:T:S6B:3;D:D:5;S:e64?e>e>T:h6C636C:E6S:U: \n U>D:D:TFU:e:U6T6D?e:S:37D2C?DB5C5Cf>eJV6B6T6T6D6D23;D:364;S6d2CBU>U>f: \n TCT6T6V6e6g:f:f:TCfBU>U>E;U6T6TCU>E;3G7G7CgBFTYGg>T6e>T6D:f:3;D2S>e:S>T65? \n D:T6h6D:T6S>D2SBD6T:S>36CBSFg:f>D:UCT:D6T:d6B:T6S>g:S:U6h:S:e:D:SBD:S63Fe: \n 3Jg:7?6CU>g>I?D:e>D:e:D:SBD:D6B>D6BBS67?e>g:fJV6S:e6B>3?U>e:SFU:U>T6eJ5?D: \n eN7?eJUFFG7?FCgVkK7?U>T>E:e:e:SBT:C:TBU:f>eBU:S>D?D:e:T:U:36h:e:S6V6T:F:7? \n U>g:fJg>T:T6TBD6T>T>5?U6e>TCU:fBU:S>h:U>D6W>T68?DCgB7?6?gGg:f>E:f>e:S>h:e: \n D2g:D:V:CCg:5CfBI?T>DBD:FFg>eBU>8?5?g:eBiBf:S>ICf:i:GCWGFGFCkK7?T6T6T2S:D: \n 36E6C2C6U:S>U:U6T6eBD2C:S:S6S62;D:364;S:d23?e>eBU:h:D6D6B:E6B6U6T>T>D:UFU: \n d:U6T6D?e:e:37D:D?DB5C5Gg>eJg:S:T2d:D:U64;D:C:3?T6e63BfBU>g:UCU6D2V6e2g:f: \n 5?UCfBfBU>F;U>U6TCU>E;3G7GHCgB7?D2S>fBF;6Ge>gBF>hBFCG>6GDGe: \n fB5GSBFG4GfB5C73e>gBF76GF7F;S:U>g:U:EG5C7GG>6GVFW;U>5?FCC>6;e:fB5;fB5C775? \n 677GB6D:U6T>U>6GW;F?5?6GF7e>gBF;6GF;FCD:e:5?e:R>5?FBF7V6T>eBU>D;U>5?F;e: \n fB5;gBF7e:T6T6B:DJ7?D2C6T>S:56S6T:e6T>e6S:U>E6B6D:f:U>E:U:D:e:46S6T>U:U>T> \n D:T6T6BBfBU>f:f:S:U>fBT6T>e>e6S:D6B6D:g:D:e:U:S:f:U>f:f:S:EC5?6CT>f>e>gBE: \n T6T>g>U>f>e:f>e>D:V2C:S>T>T:S:D:D27?f:f>e>V:S:U>V6T>566C5CU>5?YGg:S6D:U: \n T6B:T6U>C:U>T6e6T:D6B6TBf:e:T6T6D:e6B:T6T6S6e:f:D:e:C:7?g:e>e:E6e:T:f>T6T> \n UBT6D:D6B6e:C2C:3;D:3?e>U>5?T>UJ7CfBg:T>U>e>6;S:S6e:T64?UBf:fBU:E?36T:D6e: \n U:S:U63?T:S:D:D?U:S:E?T6473?6Gg>6?eK7?D:B:S6C:C2S6T646S6T6D:e:S6C6B6U:S:C: \n D6B6D>C2C6T>D:T:S>T:D:T64?e:S:D:T2C:d:e:D:T6T6V6D:S6C6BBU:S:D>C2CBD:f>U>f: \n U>7?U>f:S>T6T>e>S636SBU:S>T6U>f:f:SFU6B6d:S:d:T:S:TFg>U>f:fBT6T:SFU:TBDB6? \n 6C5?gRYGg:C6T6T:U:36T>e6T6e>S:d>U6T:D62?U>U:f:C:e:V:36T>g:S>U6e>f:D:eFgBU> \n U:f>S:SBf:U:f>T6D?S:U6T:D67?T>f:V6S:E23C6?U>5?VG6?6?U>g:e>g>V>D6T>7?T>g:e> \n 6Cf:U>8;D2SBU6U:f>U:S:HCg>6Cf:h:e>U:V6T:W:GG6?6GFCYGg:36B6T6S6D6B6U:S6D: \n 46S>T:D:T6DBU6T:S>T6T:d6D6B64?T6e6e:f>e:D:7?U:U:S:E:S6g:f>e>U>TB46d:D: \n T6DCf:f>4;D:5;S>6C5?U>5K7?e>f64?U>f:5;U:S:DCf:5;DB5CgBf:E?S636g:e6U>f:U: \n SG6C5CgBE?U>g:E?e>57DG7G6?6G6PHCU6C6e:B:T6D2d6C6B:d6C:U:e:S:S:V6B6D:D:C: \n 3BT6D2SBD:C>BBU>U>f:D?T6S636d636d:S:U:U6e:h6C>e:S:SFU>T>DBS6SFU6gBgB6?U>8? \n D:T:B>T6T:SBT6T6DBU:S>C2g>g:5?eJV:T62;S>2?e>e>UJg>g>g:5Ge:e:SJg:fFDBGCGG6? \n 6WkK7?T6B:E:S6e:3BT:C:T>36T6dBU6T>D?D:e:S:U:S6V6T636U636F:7?e>g:fJg>T: \n T6TBD6T>T:5?U>e>D?36e>T6T>g:D:T6W>T68?DC5C7?6?fGg:f>E:f>e:U>h:e:D:g:D:V: \n CCgB5CfB8;S:C>D6FBf:fBU:7?f:f>e>iBf:U>ICU>i:7GWGFG6?;PHCU:D6e:S>T>T6g>T:D: \n V6S>T>g>D:fFg:f>S>f:U6D?T>T62?T64;DCg:5CfBHCg>f>e>V:T6g>5C5?eBgJV6d>g>D: \n ECf:f:D?U>TCfF7?FG6G6OHC5C6;5CgBU>F?f>e:CCf:E?UFFC5G7?gGU:U:g:4;7CU>6? \n UG6C5CfBVCgBU>gG6?T?UGFKHGHGFCU6eB5?F;6CU>6CE>h>FCWB5G3Ce>U>5CTB6G4CeB5? \n 67U>6C53fB57F;T6T>U>g:EGfB7GF>5GFBF;U>e>6?TB57e>U>57T>e>g:5?g:7GC2C:D:U:g> \n 6CW;6;5?gBF;T>gB57fB5;FCD:S:f:e>d:5C6>57V:D:e>e:37D:e:5?e:U>5?gB5;f:S:f:S: \n 3RYGg:U>eBU>T6e>TBf:S>f>U>V6e>T6T>DCU:f>T>U:S:V6e>T>56T:V>g>e>g:eJ7Cf:f: \n UBD:f>S>6?U>5?D?U>e>T6T>F:D6B6h>T67?5C5C7?5CfK7?5CV:5Cf:fBh:f:D:F:D:h> \n DCgBFCfB8;S>U>B:VBf:fBU:W6f:D:e>8Cf:fB8?U>W:7GWG6G7?kK7?e6T:U6D:C:D:U:36T: \n U6e:D:U:S6DBU6S:D6T6363;C:D6e6B:d64?U>e:S>7?U:S:S6E2S:D6e>T6T>DFU6T:U:S64; \n S6D62;D6B?TBgB5?eBfJ7?T>f6S>U:S:5;S:C2d:C23;DBf:fBU:UCU6T6E2d6g>e:U6D?T>e: \n D:D?U:S:UCf:E?DC7GgB7CETYGg:T6T>T:U:S:3?U6D:5;S:U:U>U>T67?T>U:e:T6TFU:S: \n SBD2SBD>6?g>T>VG6?U>T>4;S6e:DBf>e>U:8;S>U>U>TFU6e:DFU:DBD6GC7CfB7CYGg>gBT> \n g>U>fFU>T:SBU6SFU:6C5Cg>5Oh:D:4;3BeBgBf:eJg>eBf:DJg>U>fFU:SJfJWG7CWG7SYGg: \n S6B:U6S6T63BU:S:S>36T6d>T6T>DCU6e6S>U:S:V6T636U:36V:g>e>g>eJ7?e:f:DBD:D>D: \n 6?U>5?D?36e>T6T>g>D:e:h>e:h:4C5C7C5CfK7?e>V65Cf:fBh:f:D:g:D:h>DCgBFCfB8;S: \n C>T6VBf:fBf:7?g:fBf:8C5?gB8?U>W:7GWG7G7?;PHCU:D:f6T>T>D6V6D6T6V6e>S>g:e: \n UFU6B>D:e:D:C?T>D64;S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJV6e>g:e:E?e:S:C;U: \n SCUF6GFC5C5O7?D:e6R>U:S:E?T>U:4;S:3;DF6?gBU>gGU>U6V:477?5?g:UCeBU>U>U?g>e: \n fGg>V?DGHK7G7GFCU6eBeB57fBe:5?6:V>5?F>gBDCS>e>e>C>5CdBT>eBg6e:f>67gB6357D: \n D:e>U64Ce>gB7:fBEBF7D:f:f>D>g:S:e>e:U>fBg6e:5;gBS636S:D:U:fBF75;e:5C57S:U> \n 6;fB575?36T6T:S>T>e>EB53E6S:S:U>D7T:f:f:S6e>e>U>6;U>T6T>e:DRYGg:E:U>46T: \n S6B>C636D>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C:C2S>C2C>D:e:T:S:D? \n T6U>D:D:h:U:T6F:S6h:3?6?6?f:UCU6T:46U:S:D:V:S:C6g:D:E62?f>e>U>8?U:3BD:5BU> \n U>U>8?5?f>e>W>e:D:8?e>W6FGFG6C5C;PHCU:T6e6S>U6D:V:T6B:V:CBU>e:f:DFU6T>S>D: \n T:C?U6D:D?D:47cB5Cf:f>8?U:U6S>V:36g:d:f>U:SJV:3?e:f:TCU>f>D;S>4;SFFG6? \n 6C5O7?e>e64?T>f:D?U6T:DCU:5;C>6Cg>e>gGf:T6h:375?6?U>fG6?6Cg>T?eBf:D?e:T? \n DKHGFG7GVGg:S>fBg:6Ge>eBG>hBgBG>6?DGD:5Cf:TBFG4Gf:5G7;e>eBG;6?F7g2S>U:S:f: \n EG5C5GH>6?VF7;S>6?U>E>6;D:5Cf>f:5G7;U>F7U>e:D6B6T>g>6G7;F?U>FG6;e>eBG?6?F; \n gBC:f:D:eBT>U>VBg666e>T6TBE;S>6?U>D:5Cf:D:f>eBf:D:e>UFg:36T:fBd>F:e:574; \n fB53e>FBF:S>U>U6fBF>V:U>6?C:e:5Ce>gBeB36T6T:S>TBV>5?F7e>g:6GS6e>e>U2e>C:S> \n U>U:U>6?U>eB4?F:f:D6B64?e>6GdBT>eBgBD:e:5Cf>gBeBU6e:S:D:E6T>e:fBe6B:D: \n T6gBT6e>e>F:S>U>f:5CD:5Cf:D:e>HCU6e>fBW:5;eBU>C>e:5?d>576;U6e>6;R:f65;S>e> \n T:T>U>V>5?E:U6B:e>T:E6f6T>eBS>e>3?66D:D:f>d>E6T6e:f:e:eBU6e:f>g:S:S:D6BBD: \n e>6:E6D:f:U6D:T>U>e>E:U:D:36e:4;T:f:e>V:D2S6e:4;F:C:U>g2S6T64;U>f:S>U>f:D: \n eK7?eBf:5;5?D:5?T:g:5CF>eBc>S>D:5?E>fB4?S>f:f:D:f>e6T>e:5?D2S>D:5;4CT>gBU> \n eBF>57T:S:f:E>e2S:D:5;C:S:U>e:UBgBU6T>U:D6h:f>F7f:e:U>5?D:f>e:T>e:5?U:S6e: \n eBT6e>E:e:U636e:S>e:36S6eBS6D:eFU>eBU>e>6?f:DNHCU>V>fBd>V:eBf:4;fB5;f>FBF: \n U:S>g:fBF>V:U>U>U:e>f:e>gBeBU:36e:fBfBV>5?6;e>g:6GT6T6eB5;f>C:T:S>U:U>U>U> \n e>6?g>D:5?e:DC5?6GeBf>e>eBE:e:f:f>gBfBf:U6e>D:h:T>f:fBe>T6B:U:gBU6T6eBV:S: \n S>h:f:g:g:5GgBf:HCU6e6e:5:e6D:U>C>S:U>S>e6g2S6T6e:S:f2e6S6e>T6D:T>U>e>E: \n U6T6B:U:U:f6T>eBC:e:e>F6B:D:U>S>D2C6T6e:S:e>T6D:f>e:f:S>D:eBU>e>F:U:D:f: \n U2C:S>f:e:U:U:S>D:D23;S6T:e:E:T:D2S:3?V:S>D:f:36T64;S>f:3CU>g:fBfK7? \n eBeBf6fBe:e>V:V>f>V>g>DCC:e>D:U>5CdBT:e>g>e:e>6?g>6;f:e>D2S>5?5Ce>fBV:f> \n fB6;D:e:S>V>g:C:e>DBU:fBg>T:f>U>5CU6e:fB7?gB6;5?f:fBU>S:T>5Cf>5?f>U>f:S: \n SFU>T>fBf:U>f:36TFF?U>f:SBU6T>DBD:fBTF7?eB5C7SYGg:f>g:4CU>D:5?E?e:5?f> \n TBE2S>g:3?6?VBE:S>eBV:D:fBf:e>e:S>e:36eF6Gh:U>g>U>e:f>D:D:U6D?f>D2S:f:V6S: \n f:U6e:T6eB5?D:5CUGFC5?5?e:f:5?V6D:U>U:T>f:U>U>U6T>8;T6e>U:e6e>U6B:hBT:U: \n S6g:S6T:E2S:F:7Gg:5G7?YGg:S:e>U>U6T:e>fBD:f>T:f6U:C:e:UB4?e6U2S:D:f6S:e:U: \n S>e:U:D:U6B:h>7;S>f:T6e>S:U:D2S>DBT:E6C:S:f6B:S:37T:d>e>U>f:S>UJgBU>V>D:f: \n S>g6B:T6T6S6e:U>U6T>D:E?C:T>T6T:T>T6D23;E:U636D;U6B64;S6474?6CU>6?TGg:36C: \n e6T>B6D:U:E:e:E6T>e>D2S:S>U>e>S>S:S:U:B6D:f>T>e>e:S:U>D23?5?T>U>U6T>T>5?D: \n S:f:E6T:D2S:SBD:S>UBT6T>U>e>gBU6e>7?g>6;e:f:U>5?C:D:e>T>eBf:U>e>g:SB46S6e: \n e>T6e>e:3Ff:U>T6eFf:D:eBD:e>BBFC7?eBgNHCU6T:fBT>F:e:e>d:U>f:e>gBV:C:U>6;T> \n U>V6T:f:E:e:eBg>g>U>U:f:f:3FU>E:e:5?e:f>gBe:T:S>5;e>U:C:U>h:U:5?F:T>g>f>6? \n 6?D:UCf:fBT>U:S>U>V:S:e>g:f>U>4?f>eBU6h6T>TBfBU>T>gBU68C5?f>eBW>f:D:h:e> \n F6FGFGg:5CU6S>FCWGiFWC7GGK4KFGHKEKWCY?6CGCW7EGX?WCFCWKWB7GGKiJWKXFi> \n 5C5G7GRBXCGKWO4GWGUKjB5G7GH7EK7?6CGCWFFGWKGB7GXJW;e>eBgB57dFWKjF8C7GXGH> \n 6GFKXFWGXFH?eBgB7?F:FCGGUGXFf>6?FGFBjB6G7G8>gBGCGFFKHBF:D:f:U>ECU:eB5GF; \n 5G5?6?F:gB5CVB7GUGe>eB5GC>5C4GU>fBg:5?6?F;7G775;D:U>g>U24Ce>gBG>gBVFF7T:f: \n 5CTB7?e>eB5;gBgB77e>5;6C36D:U:D:E6fBF75;e:5C57e:f>67gB635?C6T6e>e> \n eB5CUFF7U:S>eBf>U;f:5?F;S:e>e>f>6;U6T6e>D2SNHCf>U>gBT>g>e>e:S:U>U>5?gFV>D: \n U>g6S>T>V6T6e:f>e>eB5?6?T>U6e:5?UB4:D:S:e:e:f:gBS6B:S>4?5?U>D:U>g:f:5?E:D: \n g>e:f:5CU6D?C6T>S>36C:D:U:S:S>f:f:D:e:S:S>U6h>U>U>gBT>D:U>g>hFe:S>eBF:36D: \n h:S>V65C5Gg>eB;PHC6?6?g:fBgBU>V6f:U66C5Cg>g:5?FGE:D>f>e:S>DCgBU>FC5?4; \n EC5C5G7?8;B:D:36g>e:g:fBU>U>6K6C5?g:5?VC5?eBE;U6TCUFFGFK7C5Oh6C2d:e:U6T6D? \n U>D:E?e:37DFgBgB7?fG6?g:7?6;7?6?FGgG6GgBgBW?g:f:fGgBV?DKHKYG7GHTYGg>e>e>S: \n f:U64;R:S62?U>g:5?e>eBh6C2U:U>D:DFf:U6eFU>DBSFgBgB7?UCD2T6D64;D:3;S>g:f:5? \n 8?UB5?e>eJgBU>UFe:SJg:7G7GHCgBI?D:C>C>e:e:SFf:U6TFU>TBS67?6?FCfNh>e:C? \n eBCC5C5GgNhB7?6?FK5?e>eN7?6KUFXGiKGCWOHCU:D:U>C:U:S:S:R6D:T:e:UBE:36D:f6C: \n D:E2C6T6U:S:S>f:f:D:U6T6e:DBD:46S6T:S6T:U>S6S6B:3;e:D:36D:V6T6e:56C:V:e:f: \n 5?T6D?T6T>C:D6B6D:E6B6S:U6T:D:d:e:S>D:h:D:D>U>D>D:D:U:hBe:e:S>F:C:36h:S: \n F25C5Gg>eBkK7?f:U>V:U>T>U:E:D:f:f:5;U:U6e:UBD:S:U6S:C:4?T>U:f:S:d:5?T>e:S: \n h:T6B:T6U6e>T6T>T6D:3Ff:U:U6e:5;S6B:37T6C?UBfB5?e>eJg:C:U:C:D6B64;C: \n D6e6B6d6TBf:U>D:UCU:f:U6e:g:e:U6D?U>D:D:D;U:S6TCU:E;3C7GgBgB5PHCf>e>e:S>f: \n U6e6S:S:d>U>5?e:S>e>V2S6T>D:36DBf:U6eBU>U>SBU>U>U>D?C6C2C6e:D:e>e:U6T6T6h> \n U>e:S>eFU>D:UBS6BFU6gBgBg>U>8;36S:S:S6C6BBT6D2SBD:D>B6g:f:f:TJg>e:3?e>3?e> \n e>eJ6?g:f:fFe:S:SJg:fFDBGCGC6?6WkK7?U>U:E:f>T:SBT:D6TBf:4Cf:U>U>D?C:e:f: \n S6T6h>T:S>h:e:F65?6?U>fJV:T:36eBT6SBU:U>e>T6TCf:g:U>U>8?e:f:W6D:V6BCGCgB6? \n gGU6T6E:U6T:D6h>D:S:h:S:F2dB5Cf:f>I?U:DFU:F>gBg>e>ICgB5Cf:i:U>U:h:S:i: \n WKGCGGFCkK7?T6T6T2S:D:36E6C2C6U:S>U:U6T6eBD2C:S:S6S62;D:364;S:d23?e>e>U:h: \n C6D6B:E6B6U6T>T>D:TFU:d:U6T6D?e:e:37D:D?DB5C5Cg>eJg:S6T2d:D:U64;D:C:3? \n T6e63BfBU>f:UCT6D2V6e2g:f:f>TCfBfBU>E;U>U6TCU>E;3G7GGCgBGTYGg>e>e>S:f:U64; \n S:S:3?U>g:5?e>e>h6C6U:U>D:DFf:U6eFU>DBSFgBgBg>UC46T6D23;D:4;S>g:f:f:8?UB5? \n e>eJgBU>UFe:SJg:7G7G7CgBI?C6B>C>e:S:SFf:U6TFU>DBS67?6?6?fNh>e:C? \n eBCC5C5CfNhB7?6?6K5?e>eN7?6KUFXGXGGCG[;PHCg>eBV:d:5?TFU:S>UBU:f:3Gg:f> \n TCD2d:S>g:S:h:e:S>V6D2W>HC5Cg:5Oh6T6e:3BD6T>36FCU>f:SCU:fBU:U>h: \n U6T6iBU6ICUGFG7?FC6LV:C:E2eBU6T>h:e:D:V6D6W>TGgB6?eBI?T>DBD:FFg>gBU>8;5?e> \n e>9Gg:f>ZGgB9?HKXGFKGC7?D6e:5?F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:fBE:U> \n fBFB5C6>F6S:S>T>D:6;fB5CR>5?3CG:S:U>g:dBU6T:f:U>e>5CE:U>UB57S6B:C:S>T>5CG> \n V:U>5?F6T>e>V>5?F>g6B6D:U6e6e:f>3?6>C6T6e:e:G:T>U>V6D:e:f>e>V:T>D:U6D:eK7? \n D6B:S6C:C2C6T646S6T6D:e:S6S6B:U:S:C:D6B6D>C2C6T>D:T:S>T>D:U64?e:S:D:T2C:d: \n e:D:T6T6V6D:S6S6BBU:S:D>C2CBD:fBU>g:U>7?U>f:S>T6T>e>S636SBU:S>T6U>f:f: \n SFE6B6d:S:d:e:S>DFg>U>f:fBT6T:SFU:UBCB7?FC5?6SYGg:D:S>D:S6S:C>T6B:T>D:U:S> \n T6D:3?D6T:C:D6B6V6S:C:E2C6E:g>e:U6eFg>T6T6D>36T:C:f:D:e:C?D:T>T6D:V6D6C2V: \n C2h:4C5?g:5?UGg:e>E6e>T6T>V6T636U636V:3?U>5?T>8;C:D>36EBf:U>D:h:e:T:S>h> \n T6T>8?U>W:7GFC5G6?kK7?T6T6T2S:D:36E6C2C6U:S>U:U6T6TBD2C:S:S6C62;D:364;S: \n d23?e>e>T:h:D6D6B6E6B6U6T>T:D:TFU:d:U6T6D?e:T:37D6C?DB5C5Cf>eJg:S:T2d:D: \n T64;D:C63?T6e63Bf>U>f:UCU6D2V6e2g:f:f:UCfBf>U>E;U:T6TCU>E;3G7G7CgBFTYGg:T: \n C>C:f:S64;T:364;D6g:U>e>T6h:S:E:U6T:DFf:S6TFU6TB3>gBg>e>UCf:e:C:4;D23?D>e> \n f:D:8;DBU>e>TJg:f>UFD:TBD67G7C5CgBICU>U>SBU:f>TFf:S:TFg:eBD65C6?U>5Oh>D:C? \n DBdB5Cf:fN7C5C6?UJU>f>TFU:UJUFXG7GGC7SYGg:C636D2S:S6S>D6D6B>C2d:S>T>D:4?D: \n S2d:D:T6V:S6S6g:D:E6g>g:f>eFg:S>T6T>S63BU:f:f>e:D?C2U>T>D:7?U>f:V:S:h:4C7? \n 6C5?VGg:U:E:g>e>U>V>T6T:7?U>V:3?6C5?U>8;D:CBU:EBfBU>f:HC6?6C5?h>e>U>8?5?W: \n WGFG7GFGHCU:5?gBW>g>eBg>SBU>6C4?F7g:f:e>g:d>5;g6e>U>U>eBg>F>e>E>V:C:e:S>U: \n 6;eB5?d:5Cc>F:T6T>U>4?F:f:e>V:S:e>T:f>eB6;D:S6B:SBU>fBG>E:U>e>V:S>f:E:e:U> \n g:C2C:D:5;U>6?d:E>T6S:U6e666C:D:f6T:S:5?f:f>e:U>D:U:CTYGg>e:5?e:U:f:4?T6e> \n 4?eBE:5?U>e:7?D:f:e>T6TFU:f:eBC:DBeF6?gBU>VGg:U>U:3;S>f2SBg>e>g:8?e>5?U> \n eFT>T6DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBS:CFf:7C5C7?5Oh:e>47SBDCgB5?eJE> \n g>e:UJ6?U>5O7C5KfJWGHCWG7WkK7?U>T>E:d:e:SBD:C:DBU:f:dBU:U>D?D2d:S:U:S6h:e: \n S>V6D2F:7?5?g:fJg:S6T63BD6T>365?U>e:SCU:fBU:U>h:U6T6W>T68?DCFC7?6?gGg:S: \n E2e>T6T>h:e:D:V6D6V:CCgB5?eBICU>DBD:FFg>gBU>8;5?e>e>iBf:U>ICfBi: \n GKWGFGFCLTYGg>U:4;DBf:U:h:U:S:h:TBDB5?5?UJg:SBD>U>U>TCf:U:E?D:C;3G6G6? \n 5CICU>e:T6h:D:V62?6?g>TNh:4C5?5?UCU>e>T?e>D?TJGKGCFGFSHCU>4;dBf>e>UCf:f:E? \n D:D?TBGC7CfB7Lg>e:h:C;FCFCg>gG5?gBg>eC5C5?UCf:fCUKYKGKHKWGg:eBeB57eBe:f: \n E6U>e>U>gBDCS:S>e>4:e>dBD:T>U:e:f:5;gBg6e:36D:T>e6d>S:U>F:U>EB53C6T6T>U>g: \n S:S>e>U>U>g:S:e>f>D:D:D:36V6T>53e6S6e>e:S6T:f:U>f6e:D6C2C:SBU>e>TB57T6B:S: \n TBD7T6e:f>B6S:SBT:f>D:f:f:U6TNHCU:U>g>d>V>T>5;4;f:5;5?UFF6T>U>e6fBF>V:S>6? \n U>T>5C5?5Ce:S6T6D:eBTBV>U>F;e>e:6?36e>T64;5?D6T>U>g:e>6?U6eBT:e:f:D:T6D?e> \n 6?dBT6eBg>E:D:5Cf>eBe:E:T:C2C:h:U:f>g>e6D:D:S:hFD:e>e:F2S>U:E6S:V:5Cf:f>e: \n HCU6S6e:5:e6D:T>C>S:U>S>e6g2C6T6e:S:f2e6S6e>T6D:T>U>e>E:U6T6B:D:U6f6T>eBC: \n e:e>F6B:D:T>S>D2C6T6e:S:e>T6D:f>e:f:S:D:eBU:e>F:U6D:f:U2C:S>f:e:U:U:S>D: \n C23;S6T:e:E:D:D2S:3?V:S>D:f:36T64;S>f63CU>f:fBfK7?T>e>57e>T:f:U6T:e>T>fB4? \n S:S>e>E6e:d>C:D:U>T:f:5?U>f:e>D:D:D:4;R:S6T:U:T>U>57D2S6e:V>f:S:S>eBD:T>U> \n S:SBf:U>U>U:D:h6C:e6e6B6S:S>C6T6e>T>T:S:U6T6T:CFU:e>e>e:e:S:S:SF5; \n U6T6eBS6B:SFU6eBD>6?6?f:fRYGg>g>eBe>T6eBU>e:S>g:U>F>T>U6e>4;e:E>46e:S>U6e> \n U>T6T:U>g:S:D2SFE>U6e>U:D:f6T>e:36e:3;U>C:T6T>E2C6T6F:T6h>5?e>U6e:TCT:eBe: \n C:T6T>E2S:D:D6D:U>4?D:e:S:h:S>f:D:T>T6D:36V>S6D6B:W>D2C:8?D:h:gB6?eBf:kK7? \n 5;f>V:f>T>U>E>T:f>f>5;g:U6D:fBT:f:f6S:T64?T>U>e>e>f:5?T6e:S:h:f6T>e>U:e>e> \n V>T6B:UFf>U:U6D:5;S:e:47T:D?fBf:5?e>eJg>e>V:U:D:D:5;C:T:d:e:f:UBf:S>U:UCU: \n f:f:f:g:D:U6D?V>e:C:E;U:36TCU:C;3C5GgBgBfK7?T>S>e6S>T6T6T2D:S:T:U>4?S6B:S> \n E6S:S>36C:D>T6T6e>U>U:S>D:D:U:3;S:B6D:U6D:T>e6D6D2S:V:U:S6B:SBD:D:U>B6SBT: \n U>U>g:D:h:D:e6S:C2S:S>C2C6T>D:T:S6U:U6e:SFU:S:d>e:d:S:S>TF5;U: \n U6eBS6T6BFU6TB3>6?FCf:5SYGg>V>g>T>g>T>e>d:U:f>5?fFV:D:U64;T>U>V6S:f:g>T> \n eB6?5?U:f:f:S>UFU>E:T:f>e:e>g>T:e:36D?5?U:D:U6h:e:5?F6T>V:4?6?eBf:UCf:f>T> \n U:S:U6V:C:e>g:e>U:e>5?D:U>8?U:UBg>U>U>U6e>8Gf>5?D:W:e>D2h:e:W6FGgB7C5C; \n PHCf:5?e>f>U6eBVBT:S>g>U>g:S:f:DFf>e>f:36T>E?U6e>6?T>e:S>fBU6e>8?6;S6e:V: \n D:f:T6e:U6BJg>f:S:f:D?D:S>47B:e6CB6Gg:5CfN7CU>e>T:S:S>D?D2S:5;C:e:S:5?g:S> \n gGf:S>g:e:e>6?D:UCg:U>U:C;S>T63;S:C;DGHC5G7C5PHCU:S>e:T:T6T:f:E6T:f:T>e:T: \n U:S:g>D:T:S6S6TBT6T:e>D:D>T>f:U>D:EC4?36T:d6S:T:S>T:S:D2h:T:T:S:SBD: \n 36DBD6CBT:6?gBU>g>H?U6e:D6T:36eBD6C:S>36CBS:f>e>U6eJV:S:e:S>e>e>e:SFf: \n U6T6TFU:D:TFU>TFTFFC7?FCg>D2S>6CGKEGiBFCG;VCGKW;FGiJiB5C7GH> \n GKiF8C7GWGdBFCGKDGHKDKU>5?FC574K8GWGX;FGH?XO5?6GFK7:FGfB5C7G3C7GWG3GFGTGH: \n e:5?e>V:EGXOEK6GFGHKdBFCGKDGHKDKh:fB5GgBC>6GF;GKD?e>gB7?eJ5? \n 6GFKdB5C7GCCGKcBC:S>D:f:7?D2S:e>F>57T>e>SBe>gBR>5767D:e:5;e>675;e:fBE6T>e> \n V>5?F>F2C:S>D:U>6;fB5CS>5?4CW:S:U>g:R>E6D:e:f:e:fBU>U>UB57T:S:36TBfB5CW>g> \n U>5?V6T>e>g>5?VBg:S:U>U6e6S:U>e>F>36S6e:3?V:S:U>g:D:e>g>e>V6e>U>U6T>eK7? \n D236S:D:S636d:E:T6T2C:U:T6T:S:g>e>D:U:S:U>S636SBU:S>T>e>U>U6DC5?e>U>f6T:3? \n f>U>f:f:V2C>T6T:SFg>e>UBT6TBD:5CgBg:fBHCgB6?eBf:fB5Ce:D:eFg>eBf:gB6?6?eFE: \n C23?T>e:f>e>DJ7CgB6?6Gf:f>eFU>fBSFGCGC5C7SYGg:S6B:U6S6T63Bf:S:S>36T6d>T6T> \n DCU:f6S>U:S:V6T636U636V:g>e>g:eJ7Cf:f:UBD:D>T:6?U>5?D?36e>T6T>g:D:T6h>T6h: \n 4C5C7?5CfK7?5CV:5Cf:fBh:f:D:g:D:h>DCgBFCfB8;S:C>D6VBf:fBU:7?f:f>e>8Cf:fB8? \n U>W:7GWG6G7?kK7?D6C2S6B:D:C6U:S636E6B>D:U:T6TBU6T:B>T6T:3;D:C63?T6e63?f>e> \n U>7?U:U:S:E:C2g:e>e>U>UFE6c:U:T6DCf:f>4;D:D?TB6C5CgB5K7?e>f64?U>f:5;U:S: \n DCf:5;DB5CgBg:UCT6T6g:e6g>f:f>TG6C5CgBF?U>f:UCf>E;DG7GGC7GVGg:S>e:57f>D:f> \n T:V:5?F>eBc>S:D:e>U>fBd>S>e:f:D:f>e6T>e:5;C2C:D:5?5CT>gBU:eBE>5;D:S:f:E> \n e2S:D:e:C:S:U>e:U>gBT6T>D6T67?g>F;f:f:U>5?C:U>e:T>e>5?U:S:f:SBT6e>E:e: \n U636S:S>e636S6eBT6D:eBU>e>T>e>g:e>DJ7?D:E:U>R:E:S>e6d6T>e6e:EB56D:D:T6T>5: \n E6D:e:D:S:e>e:f>S>D6C2C6T>T>E:e:f6S:U:fBC2C:S:e6e:36C:D:U6T:f:D:S:f:U:T6T: \n S64?e:fBS>T:S:U>46S6T>U:U>T>T6T:S:36V6D:T:U>S:D636C6gBT6T:S:E6B6D:V6T>U6f> \n e>U>e:YGg:S:e>D>57T6e>TBe>eBT>U:67B:e:D>e>675;D:fBf6T6e>g>U>V>D:T:C2C:g>6; \n f:5CT>U>5CU6S:U:SBT>U6B:e:4?D:fBf:S>U:S>f>T6T>eFgB5CU>g>T>5?f6T6e>6?U>g>e: \n e>U:S6D?S:S>f>T>S:T636CCg:e>U:3;C:e:e6B6474Cg>e>gBUGg:36C:e6T>B6D:T6E:e: \n E6T>e>C2C:S:U:e>S>D:S:U:B6D:e>T>e:e:S:D:C23?e>S:U>U6T>e>5;D:T6T:E6T:C2C: \n SBU:S:U>S6T>U>e>U>T6T>7?U>5;e>T6T>e>S6D:eBU>e>e:U>f:U:SB46S6e:e:T6T:S63Fg> \n U>f:UBT6e:SBD:e>BB6?g>e>gNHCU6T:eBC:E6e:S:R6D:U:T:U>E:36T>f6C:D:E2S6T6E6S: \n S>U:U:D:U6T6T:CBD:46S6T:S6T:U>S6S6B:3;T:D:36D:V6D6e:56D:V>e:f:f>T6D?T6T>C: \n D6B6D:U6B6S:U6T:D:d:e:S>T:h6C:D>T>D>D:U>T6h>e:e:S>F:D:36h:S:F25C5Cg>e>kK7? \n e:D:U:U6B:U6E>D:f>T6e6T:U6B:UBT:e:U6S:D:e6B:T6T6S6e:5?D:e:S:h:f6T>e:U6e>T: \n U>T6D:UBT6D:D6B:f:C2C:37D:C?eBU>5?e>TJg>e>V:T:D:e:5;C:T6e:T6e:UBf:U>U:E? \n 36T:D6e:U:S:U63?T:S:D:D;U:S6TCU6D;3?6GgBg>4PHCU>S:e:T>D6e:e:E:e:f:T>e>e: \n D2S>g>e>T>T:S:SBD6T:D>T>e>eBf:S>U:EC5?e>U>f6T>e>5?U>D:f:h:T:e:D2SBU:S: \n SBT6TFU>6?eBg>g>HCgB6?e>f:f:5CT:D:DBf>eBf:gBU>6?eJV6S:e:e>4?U6e>TFg>U>U: \n fFf:U6eJg>DFUFgBGCFCgNHCU646D:C6D6B:S:S2C:S:S6T>D:C:36e:D:D6T636S6E6B6S: \n U6T:D:U:U6e:SBU>D:T6T:B6D>T>T6T:S:3;S6D:C:36g:D:T6E6B6V6e>g:5?e:ECf:f>D:U: \n S:U>E:C2C:g:D:U:d:f>e>D:h:36C>D:D>T>D:U:7?f:f>e>V:S:D:h:e:V6FC5GgB5CkK7? \n e6e:T:e:D6T>U>S:T>U>T>g:T:U6BBf:f:e>T6T>4;D6T>5?T>f:e>5?D:U>7?g:f>e>E:T:g> \n f>e>U6TFU>e:T:U6BCf:f>4;D:4;SBFCU>gB5K7C5Cg:5?U>5?4;U:S:ECf:5?UB5Cg:f: \n UCU6S:g:e:f>g:S>UG6C5Cg:E?U>f:C?e>E?DK7?FC7G7?D:5GFCW? \n GGgBGGVB8CWGiFFKDG5CgBFGdFGKEG5GFCG;gBGGF76GF;W?f:fBgBW:VK6GHKWBFKWFW? \n gB5CGCdFF;5CgBF3fB5C77FC7;HKT6T>U>g>U>GGi?G?FC7GW7fB7GF76GF;WGU>e>6?5;4? \n FGGBF;h>U>5C57D;U>5?F;5?gBF;7GF767B6T6e:DNHCU>gB5GeBf:5Cf>4?eB6;gBG:U>U: \n fB5?f>VBE:f>e>f:5CfBD:f>fBU:S:U6eFgBV:5?g>U>6;eBf:D:e>4;gBS>U:fB56T:S:V>f: \n 6Cg>e>g:e>TG6?5Gf>e>e:fBV6e>U>E:U>gB5?U>5?T>h>eBg:S>f>T6T>D:F:T636S:h>T6T> \n 7?U>g:gBFCfBg:YGg:5;f>F:U:T>U>D>D:f>e:57U6T6e:U>T:e6U2S:D:e:S>U:U:S>T:f:D: \n S6B:g:f6S>e:T6e>S:U:C2C:DBe:E6T6S:f6B:S:d6T:3?f>U>e:S>TFg>T>V:D:D:S:f6B: \n T6T6S6e:U>T6T>D6D?D:f:T6T:f:T6D23;E:T6363;D6B6D?T64;3?gBU>g>4PHCU>e:f:f>D: \n e>e:V:U>g>e>e>D:D:e:g>fBe>S6e:fBD:e>e>T6e>U:f:U:C:EC5CT>eBf:e:U>U>T:S:D:h> \n e:D:D:eBD2S:UBD:U>T:6?g>T>g>HCg>g>f:U:U>fBD:S>e>T6eBU>f>e>U:eJV6T>f:D>U>U> \n T6SFf:S>T63FU:D:TBD6BFTFFCg>FCgNHCU6D:S>T:D2S:D>e6S>e:D:E:T:C2C:4?T:U:D:D: \n S:E2S:D:D6D:U>U:S:U:SFg>U6e:U>C:U:T>f:D:e:3;D:S:C2C:U:36S6V:S6g:f>e>g>e> \n TGg:eBU:e>T6T>V6T6D:U6D:V>4?U>5?T>h6B:T:C:U>T6T>T6g:U6T>T6h>e:U>h:D: \n F6gBFCgBg:kK7?e:U>V:f:S>U:E:T:f:f:5;e:U6S:fBD:S:U6S:S>4;S>U:f6e:d:5?T>e:S: \n h:T6B:T6U6e>T6T>T6D:3Ff:U:U6S:5;S6B:47T6D?UBfB5?e>eJg:C:U:C:D6B64?D:D6e6B: \n d6TBf:U>D:UCD:f:E6e:g:e>g:D?T>D:U>D;f:U6TCU:E;3C7GgBgBETYGgBf:5?f:D:5?4; \n U6eBf>eBD:5?D:f:h:U>f:T>U6eBD:f>e>B:TBeFg:fBU>UCf>D:f>4;S>f6e>g>e:U6h>e:f: \n D:eBS:C2CFe:DJg>7?6GgBg>ICU:5?U:f:D:eFU:U:SBC:SBe:7C5?g:5KV6e>f2SB4?U>5? \n TFD>U:S:fJ5?U>eN7?eJUFFGHCGCgVkK7?V>fBU>e:e>eBf:S>fBU>g:eBf:S>DCU:f>T>U:C: \n h:e>T:F6e:V>7CU>g:5K7Cf:f:UBD:f>T>6?U:5?TCU>fBf:S>W:U:36h>T68?EGgB7?FCgK7? \n 5CV:5Cf:eBh:f:D6V:D:h>DCg>FCfBI?T>UBC:VF6?eBU>i:5?U6eB8Cf:eBICg:8? \n HCWGFKGCkK7?e6T:U6D:C:D:U:36T:U6e:D:U:S6DBU6S:D6T6363;C:D6e6B:d64?U>e:S>7? \n U:S:S6E2S:D6e>T6T>DFU6T:U:S64;S6D62;D6B?TBgB5?eBfJ7?T>f6S>U:S:5;S:C2d:C23; \n DBf:fBU:UCU6T6E2d6g>e:U6D?T>e:D:E?U:S:UCf:E?DC7GgB7C5?D:5G5GF;6G5?FCG> \n hBFCWB7GUGeB5C5CRBFG4GfB5G775?6CG;7GG7F;U>U>5CF6EG5C7GH>6GVFW;U>6?6CSB7?e> \n 5C57gB6G735?F77GD:D:e>U>D:6GW;F?5?FGF3e>gBG76GF7FCD:f:f>e:dB5CVFF7V:e>e>g: \n U;f>6?67e:5C5;gBG;g:C2C:T6TNHCU>V>gBC:U>e:S:R6D:U:e:UBE:36T>f6C:D:E2S6T6U: \n S:S>f:f:D:U6T6T6DBD:46S6e:S6T:U>S6C6B64?e:D:36D:V6T6e:56D:V>e:f:f:U6D?T6T> \n C:D6B:D:U6B6S:U6T:D:d:T:S:T:7?D:D>U>D>D:U>D:hBe>T:S:F:T636h:S:F25C5C5?e> \n kK7?e6e:U:e:D:U>E>S:S>U>T>g:S6T6TBT:f:e:36e>4;D6T>5?T>f:S>e>T6T:h:f6T6eBE: \n D:f>T6T:D6BFU>e:S6T6D?D:e>47B:f6DB5Cf:f>eJg>e>T:f:C:f:4;D2S>5?D:f:S:f>U:S: \n UCU6S:g:e:e:f:U:UCg:f>U:C;S>T63;T6C;3G7C5CgBfK7?D:B:S6C:C2S6T646S6T6D:e: \n S6D6B6U6S:C:D6B:D>C2C6T>D:T:S>e:D:T64?T:S6D:U2C:d:e:D:T6D6V6D:S6D6BBU:S:D> \n D2SBD:5?U>f:f>7?D:e:S>T6T:S>S636TBU:S>S6U>f:U:SFU6B6d:S:d:U:S:UFg>U>f: \n UBU6e>TFU>TBTF6?6C5CgRYGg:E:U>T:T:S>e>C6S>D>T:f>T>D:D:4;B:S:T6D2S:V:S:S> \n V6e:U>g:f:f:TFE6C6B:S>C6T>T>e:S:S:C?T:U>D:D:h:U6T6F:36h:3?6?6?f:UCD2C:D:D: \n D636V:T6B:V6D6564?e>e>T:8?D:DBD:EBU>U>U>8?5?e>e>W>D:U>8?e>h:FGFG6C5C;PHC5; \n U>g:D:S>U:V:36e:U6e:D>g:S:DFE:S:D6e:364;C:U6e6B:37DCU>f:S>8;T:C:T6E2S: \n D6eBU6T>DFU6T:U:S64;S6D6B;U6RCUFgB6?eBfNh:S:f:S:U:S64;S:C2d:C237DFg:fBU> \n UCU6T:E2d6g>e:U6D?T>e:D:T?g:S:fGg:UCECGGgB7CECU6eB6G7?GK5C5GXB8G7GXBGCUKU> \n FG6?dFWKEK6?FKH75C5GX;GCW;77eBg>e>V:VKFGFKYBGChJH?eBGCgBTBG?U>FG6;6? \n FKH7gBW3gBS>U:S:fBU>GKH?WCgBWKG75C5GX;GCW;7GS>6?U>5?dBgBWF7;G:5Cf:f>U? \n eBGCg:U>FG67U>6;5?T636S:UVkK7?T:f:f>g>D:5C4;f:5Ce>4Cg:U>U:C?fBg>g:S>6?h>D: \n 5C7?eBg:5?6?U>fJgBV>U>FCe>eB6?U>f>T6TCe>g:U>U:8?e>6?W6eB66DCGCgB6?gG6?6? \n fBg:eBg>h>D:5C7?eBg:fB6Cf:fBI?U6eFg:g>gBg>e>IGgB6Cf:i:5?U:G:U:i: \n WKGCGGFCkK7?D6S:S:e:D2S>U>S:S>E:D>f:S>T63BU:f:e>D6e>4;D2S>5?D:f:S>g>T6T>7? \n f:U6eBE:D:g>e:e>U:SFE:e:S>T6CCU:f>4?D:f6BB7Cf:fB6K7?e>e:5?T>f:4;U6S>ECU:5; \n S>5Cg>e:UCT6B:g:d:eBf:D:TG6?5Cg>DCU>6?5;S>E;UG7C5CGGFTYGg:T:U>S>f:S64;T:S> \n 4;T:g>U>e>T6h6S:U>U6D:DFf:S6eFU6TBS>gBg>e>UCT:T6B:5;D64?T>e:f:D:8;TBU>e> \n TJg:U>UFD:SBD27G7C5CgBI?D:D>S>D:T:CFf:T6TFU6TB365?6?U>fNh>D:C?DBdB5Cf: \n fN7C5?6?UJU>e>eFU6eJUFXG7GGC7CU6B:f>6G4CW>5?F7E?6GF75CWFW>eBgBF:6GWBh> \n gBGCR>5?FG3C7G3GD:f:f>e:dFhBFCW75C7;GKe:5C5CF65CT>eBgBe>gBGCeB5GCC76T6T:S: \n f:4CGK4GfB5G7GS>5?FG4C7G3GV6e>e>U>4:fB576G3;S>U>f:UFe:5C5CU>eBgB4?FGS>e> \n T636S:7?D:5C6Gi>F?5GgBTB5?FC4CF;G?g:5CG7d>6;F?eB5CE>fBgBGBFCV>g:S>5Cf>4:6; \n fB5GdB5CDCG:U>U>6;4CV:f:5?V>5?5GF:5?VB77B:e>T:S>C>5CG>V:U>6?V:U>fBFB5C6> \n g6D:D:f>f6f>6?3CG>T6e:5?f:W>T>gBW6e:f:f>gBV>D:f>T636SGg:5G6?F?FCU>FCU>7? \n FGWB5G3CeBU>FCTB6GECeB6?67U>6C53fB57F;U6eBU>g6EGfB7GVB5GGBF;f>e>6?TB57e>U> \n F7T>e>g:5?g>7GD2S>D:U:V:6CW;6;5?gBF;U>6C57fB57FCT:S:f:5?d:5C6>57V:D:5?e: \n 37D:e:5?e:U>5CgB5?g:S>g:T63J7?eBhB6G4Ch>5G67E?6GF;6CWFW>g>eBW:6GWBh>gBgBe> \n 5C6?3C7G3Ge:D:5?6?eFhBFCG75C7;GKe:f:5Gg:6CT>f>eBe>gBgBeB5CECW:36e:f:5? \n 5CGK4GfB5C5GT>5?6?4C7G4GV6T6eBU>V>fB676G3;T:S>g>UFe:f:5GU>e>eB6?6?5?U6eBf> \n T67?D:5;5?F>5;U>gBRBe>gBdB5;77e:f:57d>675;e:5CE:U>fBFB5C6>F:S:S>f>D:6; \n fB5GR>5?3CG:S>U>g:dBU6T:f:U>e>5CE:U>VB57T6B:U:S>T>5CG>V:U>6?F6T>eBV>5?F> \n g6B:D:U6e:e:f>3?6>C6T6e>e:G:T>U>V6D:f:f>eBV>e>D:5?U>TGg:5G5G6;6G5?5CG> \n hB6CWB7CUGT>5CU>TBFG4Gf>5C7;5?5CG;7CG767T>U6eBg:EG5C6GG>6CVFG;T>5?eBUB7?T> \n 5CU>g>6G7;f>6;gBe>D2S>U>g>6GG;F?f>6Gg:e>fBF?6CF;6CD:e:S>eBfBfBVF67F:e>D: \n fBU;e>6?e>T:fBU>U>6?fBg:S>6?gNHCU>6C7?EGgBU>F;VC5?F;6CfFV6eB7?e>GChFV> \n eB5Gf>U>6G4?5C3?B:5?D:5C5K8?gB7;gB576CD:U>g:5;6CT6e>6?f:e>6?e:5?d:U>e:36e> \n ECFGFCECe:5?FCf:U>gBe>fB4?F:D:U6eBh>f:5;g>33S:f:S>VFC:e>e:U6e:f>T6e>U> \n gBU6eB6?HCU6e>5CVBg:f>5CeFU>6Cd>6;g:T>5?g>5C5;g6e>U>V:e>5?F>eBU>F6T>e:S> \n VBG?eB6?d:5Cc>F:T6eBU>d>F:T>e>V:S>e>e:f>TB5;D:U6B:fFfFgBWBE:f>eBW:S>f:E:e: \n U>g:D2S>D:5;T>fBe:E>C:S:U6e666D:D:57T:S:f>e:f:f:5?D:5CECU6B:T>57fBS:U>F:V> \n 5?6:fB3CS6e>eBT>5CdBT>e>g6S:U>6;fB5;57B:D:U6e:5Ce>gBF:fBEBF;D:e:5?4:f6S6e> \n e>T>eBg>f:f:gBS:U>D2S>g>gBF;5;f:fB5;S:U>5;fB5?6?D:S:f:S>C:e:U>5;E2S:S> \n DB47D:f:5CT6T>5?U>5;S>5?g:S>6K7?D:f>6GeBW>5?5;4?gB675CWFW>T>gBh6fBVBh:f>6? \n T>5?5G5C7CeBD6e:5?DBTBV>5?F;5?6;7GS:e>eBg65CT>T>gBg>g>FCU>fB5CV:f:f:36D?e> \n 6GdBT>eBgBU>e>5C5?6CeBf:T:S>U6V:fBf>6Gf:C:U>g:hFe:eB5GF:T>U>g>5CU: \n 5C5CU6eBHCU:5?6CW:5?fBU>C>e:5?eB5;7;U6e>F;R:f65;S>e>T:U>U>VB5CE:U6B:eBf: \n E6f6T>eBS>e>3?66D:D:f>eBU6T6e:f>e>eBU6e:f>g:S:S>U6BBD:e>6:E6D:f:U6D:T>U>e> \n E:U:D:36e>4?e:f:5?V:D2S6e>5;G:D:U>g2S6T64;U>f:S>U>6?D:fK7?5G6?F?5CU>6?U:g> \n 5GVB5G3Ce>T>FCE>5C4CT>g>g>U>6?5;fB5;5?D6eBU>5;4Ce>gBV>fBVBF7e:e:f>VB57e>T> \n 5?T>e>g>e>fB6CU:U>f>D2h:fBF75;e:fB5?T:f>5?fB5;5?f:T6T>gFf:5CU>5?f:C:e>eB5; \n D:e:5CS:T>eFf>5CU>5?6Cg:S:C:5GHKYOVKIKWKi? \n hGXOiCiKIS9GGKHKYBXO9KIGHKjKEKWKiOgKjOUO6CGCWKW7EOIKiK9@ \n WKYCjSFCWKWOXBiK7GGKHKUGXKjKDKWOfKj>6?FGFC7:VKjSVOGKWOYO4GWGiOUKYOUO8? \n FGFK7GdFHKXCYOUC6G7GXGDSFGWKWO3GFKHKTGiODGe>eBgB5Cg:T> \n FCWGiBWC7G7GeFFCGGEKWCY?6?FCW74CG?WC5CFGVB7G7GiJWKWBh>eB5G6CC>G? \n 6GFK4GFGUGX>fBgBG;EK7?6?FCWFFGFKG>6CWFG;S>eBf>e:RBFGXBh>gBGCG>gB6GWFFGGB7; \n T>U>6?V:FCGCUGXBf:5?FCVBjBgB7GH:f>6?VB6GGB56D:U:D:UGg>fB5GF;5G5?6?V: \n fB5CfB7GUGe>eB5GD:5?4GU>U>g>5?6?F?7G7;5?D:U>g>f6d>e:f>V>gBVFF7T6e:5?fB7?e> \n eB5?gBgB7;e>e>6?D:U>g>D:V2T>575;S:e>e:e:f:5;gBg6e>D2S6e:TBfB5CfFF;f:S> \n eBfBU;f:5?F?S:S>eBf:5?U:f:5CU6eRYG6CgBgBU>6C5?e>T>U>UB6?6GgBU>gB7;S>e>g: \n U6e:6C5?eB6?6?U>g:5?FCgFE6T:S:S>f:f>gBe:S>eBEC6?gBU>gB7?g:5?V>D:7?4?6?FGg: \n UC46D:T>D:36D:g>e:S>g:f:E:4?e>eBg:8CgBUBgBUBU>gB7C8G5?eB5GW>D:U>8? \n eBW6FGFK7C5GkK7?f:f:U6e>U>D:E6T6T6f>e>g:U6e:5C46D:e:S6B:3?U>D:5?e>e64?e> \n eBf:h6C636C:U:S:f:U>D:D:UFf>e:U6e:E?e:S>47D2C?DB5C5Gg>eJV6B6T6T6D6D23;D: \n 364;S:d2CBU>U>g:TCf:U6g:f6g:f:5?UCgBU>U>F;U6T6TCU>E;3G7GHCgBGTYG6C5?5?e:g> \n g:5;e:e>4CfBf:5?eB5?h6D:f:T>D:UFg>g:5CU>DBeFg>gBU>UCD:D6T63?T>f:S>g:e: \n U68Cf>5?eB5GU>D:UFe:SJg:7C7GgBgBI?D2S>D:e:D:SFU:U6eBD:3BS:7?5?g:fN7?5?4? \n eBDCfB5?eJg>g:f:fJ5?T>eN7?5KUFWGHCGC7WkK7CgBgBU>5C5?eBD>U>DB6?6CfBU>gBF?S: \n d>f:U6e:7C5?eB7?g:V>7?6?6?gJV2S:S6BBf:UBU>5?e>e>TC6?gBU>gB8?g:5?W>D:8? \n DCGCGC6?gGE636U:U>D:D:h>e:S>h:U6F:CC5C5Cf>ICgBUFgBVFgBgBgBICFC5C5CiBU>U> \n IC5Ci:WKWKGGFGLTYG6?6?5;fBg>U>h6f:T67CfFgB5?6?gJV:DBfBU>e>TCg>U>VCf>D; \n 4GFG6?6CI?C>U6D:h>T:h:4?gBg>eN7CEC5?6?gGgB5CU?e:E?DJWKGCGGFS8;T62;4?e:f: \n TCg:U>UCU>D;SB7G7C5C6L6?f:8?E;FCGCgB6LFC7G7CfC5?6?UCU>fCUOYKWKHKWGg:T> \n eB57eBe:f:E6U>e>U>gBDCS:S>eB4:e>dBD:T>U:e:f:5;gBg6e:36D:U:e6d>S:U>E:U> \n EB53C6T6e:U>g:S:S>e>U>U>g:S:e>f>D:D:U:36V6T>53e6S6T>e:S6T:f:U>f6e: \n D6D2S6SBT>e>TB57T6B:S>TBD7T6e:5?B6T:SBT:f>D:f:5?T6eRYGg:D:D:46T:S6B>C636C> \n T6e>T>D:D:5;36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2C>C2C>D:e:e:S>D?T6U>D:D:h: \n U:U6F:C:h:3?6?FCf:UCU6T:46U:S:D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5? \n eBW>T>D:8?e>W6FGFK7C5G;PHCf:U:f6D>T>D:V6D6T6g:e>D>g:e:UFU6B>D:e:D:C?T>D:5; \n S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJg:e>g:e:E?e:S:C;U:SCUF6GFC5C5O7?D:e6R>U: \n S:E?T>T64;S63;DF6?gBU>gGU:U6V6477?5?g:UCeBU>U>U?g>e:fGg>V?DGHK7G7GgK7?fB5? \n F;5?U>6?U:f:5CfB5G4?e>T>5?E:U>4?S>U:f>U>6?5;U>U:5?D:U>D:5;d>D:f>T>eBF> \n e6T6S:U6gB5;e>T>5?D:D:U>e>TB6?U:U>D:D:h:T:57U2S:D:e>D:f:e:D:T:e>U:S6D2SFf: \n 5CU>e:f:S>e:SB47D2S6eBS:C:eFf:eBU>5?g:f:UNHCf>V>gBT>g>e>e:S:U>U>5?gFV>D:U> \n f6S>T>V6T6e:f>e>eB5?6?T>U6e:f:UB4:D:S:e:e:f:gBS6B:S:4?5?U>D:U>g:f:5?E:D:g> \n e:f:f:U6D?C6T>S>36C:D:U:S:S>f:f:D:e:S:S:S67?U>U>gBT>D:U>U>hFe:S>e>F:36D:h: \n S>V65C5C5?e>kK7?f:5?U:5?U:U>E>e:e>fBf>7;T6e:UBT:f:5;C:e>4?U:U>6CfBf:T>e>e: \n f:h6f6T6eBU>T>5?U6D:D:SFfBf:T6e:E?T>eB57S:f:DB5Cf:f>eJV:e>T:U6B:f:4;D6T>5? \n T>f:S:U>U:S:TCf:e:6?f:e:f:U>UCh:U>U>D;S6T64;36D;3G7C5CgBfK7?T:S>e6S> \n T6T6T2D:S:T:U>4?S6B:S>E6S:S>36C:D>T6T6e>U>U:S>D:D:f:3;S:B6D:U6D:T>e6D6D2S: \n V:U:S6B:SBD:D:U>B6TBT:U>U>f:D:h:C:e6S:C2S:S>C2C6T>D:T:S6U:U6T:SFU:S:d>e:d: \n S:S>UF5;U:U6eBS6T6BFU6TB3>6?6Cf:5SYGg>U>fBT>f>e>e>S:T>U>f>gBU>D:U>5;S:T> \n U6T6e:g>e>eBg:f:U>g:f:f:UFE6D6S:S>T:f>U>e:S:S:C?f>U>D:U>h:U6e:F:D:h>4?6?6? \n f:UC46D:T:D:36D:V:S:S>V6T:E:4?e>e>T:8?U>UBU>UBU>U>U>8C5?e>e>W>D:D:8?e> \n W6FGFG6C5C;PHC6?U>g>U>eBg:V>D:5?f:5;U>g:e>UFU:S:U6e>D:5?T>U:f:S:3;ECU>f:S> \n 8;e6B:U6U6e>T6eBU6T:3Ff:U:U6e:5;S6B:C;U6SCUFgB6?eBfNh6D:U:C:U6B:5;C: \n T6e6B637TFg:f>D:UCU:f:U6e:g:e:U6D?U>D:D:T?g:S:eGg:U?DCGGgB7CETYG6C5?5?e>g> \n g:5;e:e>4CfB5?5?e:5?h6T:f>T>D:SFg>g:UBU>UBeFg>eBU>UCT:D6T:4?T>f>e>g:D: \n U68Cf>5?e:5GU>D:TFe:SJg:7C5GgBgBI?D:e>T:e:D2SFU:U6DBD:TBS:7?U>g:fN7?5?4? \n eBDCf:5?eJ6?g:U:fJ5?T6eN7?UJUF7GHCGC7SYGg>U>U>D:f>e:S>C:D:D>f:fBU>D:U>6;B: \n S:U6D2S6g>e:S>g:f:E:g:f:5?UFE6C6B6S>T6T>U>e:S:S>D?f:U>D:U>h:U6e:F:36h:3?6? \n FCf:UCD2C:D:D:C:36V:S6B:V6T6563?e>eBU:8?U>DBU>EBU>U>g>8C5?e>eBW>D:D:8?e> \n W6FGFK7C5G;PHC6?6?f:5Cg>U>V:f:e:6CfB7?f:5?eFE:U>5?T:S>DCg>U>FCfB5;4C5CU>6? \n 8;T:D6T>g>T>6?f>U>U6eJ6C5?f:5?TCf>eBE;T6D?DFFGgB7C5Oh:S:e:f:T:U6B?U:D:E?T> \n 47SBgBg:5?fG6?f:7?5;6?6?eBgG7CgBg:U?f:f:SCU>U?DKHCWG7G7?D6eB5GF;6G5?6CG> \n hBFCWB7GUGe>5C5GRBFG4GfB5C775?6CG;7GG7F;T>U>g>F6EG5C7GG>6GVFW;U>5?FCSB7?e> \n 5C57gB6G735?677GS:D:U:U>D:6GW;F?5?6GF3e>gBF76GF7FCD:e:5?e:dB5CVFF7V:e>eBf: \n U;f>6?F7e:fB5;gBF7f6D2S6S:UJ7?D6D:U>R:E:S:e6d6T>e6e:EB56S:D:U6T>5:E6D:e:D: \n S:e>e:f>S>D6D2S6S>T>E:e:f6S:U:fBC2C:S>e6e:36S:D:U6T>f:T:S:f:U:U6e:S64?e: \n fBS>T:S:U>46S6T>U:U>e>T6T:S:36V6D:T:U>S:C:36D6gBT6T:S>E6B6T>V6T>E:5?eBU>e> \n YGg:e:U>F:U:S>U:D>D:f>e:57U6T6S:U>T:e6U2S:D:e:S>U:U:S:T:f:D:S6B:g:f6S>e: \n T6e>S:U:C2C:DBe:E6T6S:f6B6T:d6T:3?f>U>e:S>TFg>T>V:D:D:S:f6B:T6T6S6e:U>T6T> \n D6D?D:f:T6T:U:S6D23;E:C6364;D6B6D?T64;3?gBU>g>eK7?T>S>e6S>T6T6T2D:S:T:U>4? \n S6B:S:E6S:S>36C:D>T6T6e>U>U:S>D:D:D:3;S:B6D:T6D:T>e6D6C2C6V:U:S6B:SBD:D:U> \n B6TBT:U>U>U:D:h:D:e6S:C2C:S>C2C6T>D:T:S6U:T6T:SFU:S:d>e:d:S:S:SF5;U: \n T6TBS6C6BFU6TB3>6?6?f:fRYGg:D:U:T:U:C:e>d6T6e>e:eBU6D:D:3;T>U:U6B:e:V:C:e> \n g:e>U6e:f:D:TFU>E:D:f>S:S>f:D:T:C2C?e:U6D:D:h:S:f:F2S:E64?6?U>f:UCf:f:T> \n U6S:U:V:36T>g:S>U6T>f>T6T>8;D6TBU:U:U>U:S:8CU>f>T6W6T:D6V6S6W6FG6?6C5?YGg: \n C2S6D6S636S:D:B6D:D:S:U6D6D2S>D6T6S:C2C:d636S:e:S:U:e:e:S:D:g:T6D:S:46S6U: \n U:S:D:CBD:S6D6D23?T6T:d6363;S>5?e>U>eFg:S:U6e:D:T6e6D6B64?T6e6D>e>U>T6D? \n C2C:U6T:U:U6T:CCf>e>U>4;D:T6D?T>473GgB6?gB6PHCU:S:e:S:T6T6e6C6S:d:T>f:e:S: \n S:V2S6T:D:36DBT6T6eBD:T>SBU>U>U:D?C6C2C6e6C:e:e:U6T6T:h:T>e:S:SFU>D: \n DBS6BFU6gBgBg>U>8;36S:S:S6S6BBT6D2SBD:C>B6g:f:f>TJV:S:3;S>3?e>e>TJg>g:f: \n fFe:S:SJg:fFDBGCGC6?6WkK7?U:S>U:S6e>DBT6B:U>D:U:dBU6T:C?S6T:C:U6B:V6S:D: \n E2C:F:7?e>U6eJV:T6S:D>36T:C:5?D:e:C?D:T>T6D:V6D6C2W>D28?DC5Cg:5?fGU6T>U6T> \n T6D:V6T636U636F:CCU>5?e>8;C:T>36EBf:U>D:h:e:T:S>iBU6T>ICU>i:7GGC5G6?;PHCf: \n U:f6T>T>D:V:D6T:g:e>U>g:D:UFU6T>T:e:D2C?T>D:3;S:47DCf:5?e>8?U:T:S:V6S:U: \n fBf:S>UJg:e>g:D:E?e:T6C;U:SCUF6?FC5C5O7?e>f6e>U>D:E?T>T62?T64;DF6?eBg>gGU: \n U6V6477?U>g:UCfBf>T>V?g>D:fGg>T?DGFK7G7GFCU:5GFCW?FCgBGCV>7? \n FGhFFKDC5CfBFCSB6GECeB6?6;gBGCF7gB6;F?U:fBU>V6EGfB7GVB5GGBF;f>e>6?eFF; \n 5CfBF7U>fBg65Cg:GGD6T>D:U>U:6CW;6;5?gBF7U>6C53fB57FCT:S:f:5?4?FGFB5;g>T>5? \n e:D7T:f:5;e>U>5?6C5;g:S6D2S6DRYGg>gB5GeBf:5Cf>e>eBg>gBW:U>U:fB5?e:UBE:f:e> \n g:5CfBE:f:fBg>e:U6eFg>U6e>U>U>6;S>f:D:e:C?gBT>U:fBF6T6S:V>U:7C5C5?g:5?UGg: \n eBf:e>T6T>V6e>T>56T:V>5?U>5?T>8?eBg>S>fBf:U>D:W:e:D:S6h>T6T>8?U>h:7GFC5G6? \n kK7?5;f>V:U>T>U>E:D:f:f:5;U:U6e:UBD:S:U6S:C:4?T>U:f:S:d:5?T>e:S:h:T6B: \n T6U6e>T6T>T6D:3Ff:U:U6e:5;S6B:37T6C?UBfB5?e>eJg:C:U:C:D6B64;C:D6e6B6d6TBf: \n U>D:UCU:f:U6e:g:f:U6D?U>D:D:D;U:S6TCU:E;3C7GgBgBETYGg>e:f>e:U:e:4;U6T>5?e> \n f:U>T>e:h:T>f:T6T6TFU:e:eBD6TBT>g>g>T>UCf>D:S>4;S:f:D>e>e:D68?e>U>T>eFU6D: \n DFD:DBT67C7CfBgBICU:U>T:U:D:TFU:S:SBD2SBD:5C5?U:5Oh:T>4;CBeBfBf:eJg>e:f: \n DJU>U>TFU:SJUFWG7CGC7SYGg:D:S>D:S6S:C>T6B:T>D:U:S>T6D:3?D6T:C:D6B6V6S:C: \n E2C:E:g>e:U6eFg:T6T6D>36T:C:f:D:e:C?D:T>T6D:V6D:C2V:C2h:4C5?g:5?UGg:S>E6e> \n T6T>V6T636U636V:3?U>5?T>8;C:D>36EBf:U>D:h:e:U:S:h>T6T>8?U>W:7GFC5G6?;PHCf: \n U>g:U>T>U:V:D:f:g:5?T>g:e:UFE:S>U:e:C:D?T>U:5;S:3;ECfB5?e>8;S:C:D6V6e> \n E6eBU:U>DJg:f>g:e:E?e:S:C;U6SCUF6GFC5C5Oh:36e:S:U:S6D?T>D64;S627TFg>gBU> \n fGU:f:V64;7?5?g:UCeBU>U>U?g:e:fGg>V?DGHK7G7GFCU:5G5GF;5G5?6?F:gB5CVB7GUGe> \n eB5CC>5C4GU>fBg:5?6?F;7G775;D:U>fBU24Ce>gBG>gBVFF7T:f:fBTB7?e>eB5;gBgB77e> \n 5;6C36D:T>D:E6fBF75;e:5C57e:f>67gB635?C6T6T>e>eB5CUFF7U:S>e>f>U;f:5?6;S:e> \n e>f>6;U6T6T6D2SRYGg>V>gBD:f>e:S>C:D:D>f:fBU>D:U>5;B:S:U6D2S6g>e:S>g:f:E:g: \n f:f:UFE6C6B6S>T6T>U>e:S:S:CCf:U>D:U>h:U6e:F:36h:3?6?6?g:UCD2C:D:D:C636g: \n S6B:V6T6563?e>e>e:HCU>DBU>EBU>gBU>8C5?e>e>W>D:D:8?e>W6FGFGFC5C;PHCf:f:f6e> \n U:D:V:T6S:g>TBg>e:f:UFE6T>e>D:S:C?U:D:E?T>47dB5Cf:f>8;T:D2S>V:C:g:e:U>U: \n SJg>4?e:f:UCU>e>D;S64;3FFG6?6C5Oh:S:d6e:S:T6C?U6D:D?D:47B>gBg>e>fGg:T6h: \n 475?6?g>gG6?gBg>T?e:f:D?D:T?DKHGFG7G6PHCU:S:S:B:T6D2d6C6B6d:D:f:e:S:S: \n V6B6D:D:C63BT6D2SBD:D>BBU>U>U:D?D6S636e636d:S:U:T6T:h:D>e:S:SFU>T: \n DBS6DFU6gBgBg>U>8?D:S:B>T6T:SBT6D6CBU:S>C2g>f:f>eJg:S62;S>2?e>e>eJg>g>f: \n fFe:U:SJg:fFDBGCGC6?6K7?T>gB7C4ChBfBF7E?6?F;FCgJW:fBgBU:6GWBh> \n eBGCeBfBFGDCFG3?S:f:U>5?dFhBgBW75C5;GCD:5Cf:f:FCU:fBgB5?5CGCe:5Gd>U6T6D:e: \n 5;4CGC4Gf:5G7CT>U>FG4C5G3?66e>T6T>V>g>6;7C37T>U>e>gJT>5C5?U6eBg>T:e>f>e> \n T6T:S67?D6e:5?F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:5CE:U>fBFB5C6>F6T:S>U>D:6; \n fB5GR>5?3CG:S>U>f:dBU6T:f:U>e>5CE:U>VB57T6B:D:e>D>5CG>V:U>6?F6T>eBV>5?F> \n g6B:D:T6e6e:f>3?6>C:T6e>e:G:e>U>V:D:f:f>eBV:e>D:T6T>TGg:eB5CF;5Cf>6?F:f> \n 5CUB6GDCe>eB5CD:5?4CT>U>g:f>6?F;gB675;D:U>U>f6d>e:f>F>fBFBF7T6e:5?UB6;e> \n eB5?U>fBg:e>e>6?D:D:D:D:V2T>575;S:e>e:T:f:5;fBf6e>D2S6e:TBe>5CUB57U:S>e> \n eBD7T:f:5?S:S>eBf:5?U:f:f:T6TNHCfB7C5G5Cf:5Gg:5?eB7;gBGBU>g:5Cf:5?VBE:5? \n eBe:5CgBd:f>eBf:S>U6eBTBg:5Cg6U>63fBS>D:5?e:gBS>f:fBT6T:f:U>f:6Cg:S:D2S:D? \n d>5G4?S>f:fBT6e>U>S:U>eBf:36e:S>V>eB67U>d:T6T>D:EBB6T:S>F:T6T>h>U>6?U>f:S> \n T6YGg>F?6CW>6?fBgBTBf>6C5CF;7;f:U>6?d>6;6;e>f:f>fBgBUB5CV>g:S6e>e>V:6; \n fB5Ce>5C3CG:T:S>gB5CV:f:U>g>e>5?f:f>5C6?T6e:S:SFU>5CG>V:U>U>g:T>f>T>5?V>g> \n T6B:U:E?f>6?4?V>U6D:f:5;G:T>T>67T>D:E?f>4?e>eBU>U>TGg:eBeB57eBe:f:E6U>e>U> \n gBDCS:S>eB4:e>dBD:T>U:e:f:5;gBg6e:36D:U>e6d>S:U>F:U>EB53C6T6e>U>g:S:S>e>U> \n U>g:S:e>f>D:D:U:36V6T>53e6S6e>e:S6T:f:U>f6e:D6D2S:SBU>e>TB57T6B:S>TBD7T6e: \n 5?B6T:SBT:f>D:f:5?U6eNHCfBhB7CeBhBfB5;4?g>6?FCgJW:U>g:f6fBVBh:e>6? \n fBfB5GECFCe>T6e:S>gBTBV>f>6;5?5;7CC:e>D:5?FCU:U>g:6?5?FCU:fBf>f:f:S>U6D?e> \n 6CdBT:e>g:U>T>5C5?5Ce>U:e:36T>7?g>g>7Ce:D:U6e>hJT>eBU>F6e>U6V:f>g:5CU>6?e> \n kK7?5?FCUB6?g:5GfFf>eB5Cg>7;S>6?UB4C5;6;D:fB6?f:5ChBfBU>D:e>T6eBh>G?e:5?f> \n U>4?E2S:f:SF5Cg:S>5?5?T>eBf:S>U:T>fBU6e>TJgBgBUBE:S>eB5;T6e>g>T>U>e6e:U6B: \n UCf>eB5?U>S:f:D:E?W6D:U>47B:e:e6S:4;5C7?eBg>eK7?T>eB57f>e:f>V:V:f>V>fB4?S: \n f>e>U>U>d>S:e:f>T:f>5;U>U:f:e:D:D:5?5CD:f>T:e>E>e:C:S:U6V>f:S:T>e>D:D:U>T: \n T>f>f:U>D:f>7;g:57U2S:D:5?C:T>e:D:T>e>T:S:D2SFU:e>f>e:U:S:S:SB47D2S6eBD6C: \n eBT:eBeB5?g:5CgJ7?D6D:U>R:E:S:e6d6T>e6e:EB56S:D:U6T>5:E6D:f:D:S:e>e:f>S>D: \n D2S:S>T>E:e:f6S:U:fBC2S:S>e6e:36S:D:U6T:f:T:S>f:U>U6e:S>6?e:fBS>S:S:U> \n 46S6e>U:U>e>T6T:S:36V6D:T:U>S:S:36T6gBT6S:S>U6B:U>V6e>E:6?eBU>FCYGg:e:5?F> \n 5;U>fBT>e>g>eB5;77T:f:5?T>g65;e:eBf:U>fBgB5CV>g:e:S>U6g6f:U>fBT>5?5CW:C:U> \n gBeBU6T:f:5?e>5Cf:U:5Cf>5?eBU6eFV:e>V>V6T:f:f6T>T>6?5?f:f>T>U>U6B?e:f>5?V> \n U:U6e>DCh>T>U>6;D6e:E?T>6;4GgB7?eBW6B: \n 5GGKiCXOFGHKiFIKiKjFXOgOFCGKWO4KiOVOGKWKY;FGHKi?XOi?iC5C7GHCG> \n hOWKYOjFXO8O9D7GWGiKdFXCFCGKW;GKWKY;WGX?YOe>gB7?6GSBXO9DiGWGXOi;FGHKi?XOi? \n iKgBFCWGF34GWGiJi?8?6GFK77gC7GWGi;FCGKW;HKi7F;e:5?eBgBU6B:f>6G4CW>5?67E? \n 6GF75CWFW>e>gBG:6GWBh>gBFCR>5?6G3C7G4GD:e:5?e:eFhBFCG75C7;GKf:fB5GF65CT>e> \n gBe>gBFC3C5CCC76S:f:S>f:5CGK4G5C5C7GS>5?6G4C7GDGV6T>5CU>4:fB576G4;S:U>g: \n UFf:fB5Ge>e>6G4?6GS>T:S:36T6HCU6B6S:E:e2S:S:T>S>U>C:e:f636S:f>e:57e:T6T> \n U2S:S:f:f:U>U6T:S:36g>g:f>e>D:f:fBV:S:U>U>C:T636S:5?T6T>f>U>f>e:f>e>D: \n eFgB5CV:f>U>5?g6T:S:5?f:fBg>e>U>U64;B:D:U>U>D:T6T6BCf>e>U>5;D:e>6;S: \n f23CgBg:fBfK7?D:S6e:T:36T:d:E6e:U:S>S:T636S:g>T>T:S:S6T>36T:S:S:S>f>T6T> \n D6DC5?T>U>e6S>T:f>U:S:f:V:S6T636S>D6B6TBT6TBU>f:fBU:f:HCg>6?T:f:U>5CD:D:S> \n T:SBf:g>e>g:eFE2S:T6T>f:D:e:CBU:D:T6TFf:D:eFU:SBCB5C7?5CUNHCU646D:C6D6B:T: \n S2C:S:S6T>D:C636d:D:D6T636S6E6B6T:U6T>T:U:T6T:SBU>D:T6T:B6D>T>T6T:S:3;S6D: \n C636g:D:T6E6B6V6e>f:f>e:ECf:f>D:U:S:U>E:C2C:g:D:U:d:f>e>D:h:36S>D:T>T:D:T: \n 7?f:f>e>V:S:D:h:T:V66C5CgB5?kK7?D6S:S:e:D2S:U>S:S>E:D>f:S:T63Bf:f:e>D6T>4; \n D2S:5?D:f:T>f>T6T>7?g:f:e>E:D:g>e:e>U:SFE:e:S:T6CCU:f>4;C:e6BB6Cf: \n fB5K7C5Cf:5?T>5?5;U6S:ECU:5?T>5Cg>e:UCT6B:g:d:e>f:D:TG6?5Cg>D?T>f:4;S:D; \n DG7C5C7GgK7?D236T:C:S636d:D:S6T2S:U>T6T:S6g:S:D:U:S:D>S636SBU:S>S>e>U> \n T6DCf:e:D:e6D:3?e>U>f:U:V2S>T6T:SFg>e>UBT6TBD:5CgBf:fBHCU>f>SBf:f>eBe:D: \n TFg>eBT6gB6?g>eFE:C23?T>d:f>e:DJ7CgB6?gFf:f>eFU>fBSFGC7C5C7SYGg:C6S>46T: \n S6B>C636D>C6e:T>D:D:4;36S6T6D6D2V:S6B:V6D656g:f:f>TFU:C:C2C>C2C>D:e:e:S>D? \n C6U>D:D:h:U:U6F:C:h:3?6?6Cf:UCU6T:46U:S:D:V:S:S6g:D:E62?5?eBU>8;T:3BD:5BU> \n U>f:8?5?5?eBW>T>D:8?e>W6FGFG7C5C7?D:5?gBWB6?eB6?dFfB7G4?F76;f>e>6;4CF;6;5? \n gBF>eB6?6>5?FBW:D:e>eBU>G?5GFCd>FC3CW>e:fBg:4?F:f>e>F:e:fBU>gBUFF736S:T> \n UBfB6GXBV>gB5CW:eB5?F>5?VB7;S6T>f:f6U>6Cc>FBT:S:f:U6V:S:U>g>U>e>gB5?V>U6T> \n D6T62PHCU>e:5?e:D:f:4?U6e>f>eBD:f:D:e:7?T>f:e>T6TBD:f:e>B:TBeBf:fBU:UG6?U> \n U>4;S>f6eBg>e>g:h>e:f:D:eBS:C2CFf:DFg>6?6Gg>6?YGg>6CT>6?U>5GU>U:SBS:SFf: \n 7C5C7?5KV6e>e2SB4?U>5?TFD>U:S:UJ6?U>5Kg>eFTFFGHCFGgRYGg:E:T>D:S6S:S>T6B:T> \n D:U:S>T6D:3?D6T:C:D6B6V6S:C:E2S:E:g>e:U6eFg>T6T6D>36T:C:f:D:e:C?D:T>T6D: \n V6D6C2V:C2h:4C5?g:5?UGg:e>E6e>T6T>V6T636U636V:3?U>5?T>8?D:D>36EBf:U>D:h:e: \n T:S:h>T6T>8?U>h:7GFC5G6?;PHCU:D:e:T>T6T6g>D:S>V6T>T>e>e:DFg:e>T:U:D:D? \n T6T64;364;dBgBf:eBHCg>e:e:V6D:U:3?f:f>TJV6e>e>e:D?D:T:C?T:3;CF7G6? \n 5G6OHCfB5;eBf>e>E?e:T64?D6D?TB6?6Cf>gGU:S:V62;5C5?U:UCf:f>U:SCf>e>E?T6T? \n UGHG6GHGFCU6eBeB57fBe:5?6:V>5?F>gBDCS>e>e>C>5CdBT>e>g6e:f>67gB6357T:D:T> \n U64Ce>gB6:fBEBF7D:e:f>D>g:S:e>e:U>fBg6e:f:gBC636C:U>U:fBF75;e:fB57S:U>5; \n fB575?36S6T:S>T>e>EB53E6T:S:T>D7T>f:f:T6T>e>U>5;U:T6T:T6DRYGg:E:U>46T:S6B> \n C636D>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C:C2C>C2C>D:e:T:S:D?T6U> \n D:D:h:U:T6F:C6h:3?6?6?f:UCU6T:46U:S:D:V:S:C6g:D:E62?f>e>U>8?U:3BD:5BU>U>U> \n 8?5?f>e>W>T:D:8?e>W6FGFG6C5CHCU6e>5CUBF;f:5CdF5C5GdBg:G;S>5?U:4CG;F?U>6GV: \n f:5CWBgBGB56T>T6T>U>G?6?FGdBgBDGV6e>g>e>dBV:S>5?f>U>6GV>eBF>e:T:C2C: \n eBfBFGVBh>eBFCV:f:5ChBgBWB57S:U:S:5;e>eB4CEBB:e:D:4?W6e>g>e:T>5?U:S:f:f>U: \n S:U>DCU6B:T>57fBS:U>E:V>5?6:fB3CT6T>e>D>5CdBT>e>g6S:U>5;fB5757B6T>T6e:4Ce> \n gBF:fBUBF7D:e:f>4:f6T6T>e>e>e>g:e:f:gBS:D:C2C:g:fBF75;e:fB5;S:U>5?fB5;5?D: \n T6T:S>C:e:U>57E2C:e:DB5;D:e>g>S:f>e>U>5;S>f:U:S:UJ7?D:f>5GT>V:5?e6d:U>g6f> \n FBV>D:fBV2T>E>V6e:f:T:e>eBe>g>S>D2S:f>T>C>E:e:f6e:f6gBB:S:S>e6f>C:D:U>U:U: \n 5?D:U>fBU6T6T:C23;S:fBR>C:S:U>D:S:e>e:f>S>T:S6B:S:V:T>U:fBT:36D:U:VBS6S> \n eB56T>D:V>e>U6e>e>U:S:YGg:5?U>V>g:S>g:TBU>6Cd:53f6e:S>g>d>5;g6e>U>U:S>f:E: \n e:U>g:36e>e>V:6;eB5?e:5Cd>F:T6T>g>d:56T:S>V6T6T>e:U>4C5?D:e:S:CFU>fBG>U:U> \n e>g:S>f:U:f:U>g>T6D:U:5;D:f>S:U>D6B:f:e:E6B6T>57D:e:E?e:5?e:fBU>U:dK7?eBe> \n 57fBT:5?U:V>5?V>fB3CS>U6eBU>5CdBT>e>e>T:f>U:fB5;5?T6B:U>6?5Ce>gBV:fBUBF;D: \n D:5?V>f6S:U6e>T>e>e>f:fBgBf:S>U:U:7?gBF;5?f:f:5?S:U>U>fB5?6?U>D:f:SFU:e>U> \n 5;f:D2S>TB5;D:D:5CT6T:5GU>UBfBU>6?5?UJ7?D:E:U>R:E:S>e6d6T>e6e:EB56T>D:U6T> \n 5:E6D:e:D:S:e>e:f>S>D6D2S6e>T>E:e:f6S:U:fBC2C:S>e6e:36S:D:U6T>f:T:S:f:U: \n U6e:S64?e:fBS>T:S:U>46S6T>U:U>e>T6T:S:36V6D:T:U>S:D:36D6gBT6T:S>E6B6T>V6T> \n U:5?eBU>e>YGg:5;5?E>5;U:fBTBe>fBeBf:77S>g:S>e>675;T:fBf:U:fBgBfBV>U:e: \n 36eBg>6;f>5CT>f>5CV:S:U6eBeBU6S>f:3?T>6Cf>U>f>e>5?D:U>eFgB5CV>g>U>5?e6T:e> \n 6?f>gBg>e>U6T6D?e:e>5?U>e:U6B:DCh>e>U64;D:e>4;S:5;5Gg:5?gB6PHCU>fBU:6?e:S> \n g>h:U>g>f:4?36eBU6gBgB4?S6e:5CT:S>5?U:f:U6e:U6B:ECFGU>eBf>e:U>f:S:S>D:h>f: \n 36T>UBD6e>U>T:U:D:5?g:S>g>HC7?g>g:U>U>gBD:S>e>T:e>f>e>e>D:eJV:D:f>T:E:f> \n D2SF5;T:T6DBD6D:e>36SBSFFCU>FCgNHCU6T:f>e>D:U:f>5;S>f:T>E>T6S:f>4;g:E>46T: \n S>E6T:U>T6e:U>T:S:D2SFfFV6e>U:D:f6T>T:36e:3;T>C6S6T>E2S:T6F:U6f:f>e>U6e> \n TC5?eBe:S>U6eBE2S:D:D6D:U>e>D:e:S>h6S:e:D:T:T:D:36V>S:C6B:W:D2C:V6D:F:gB6? \n eBg:HCU6B6S:E:e2S:S:T>S>U>C:e:f636S:f>e:57e6T6T>U2S:S:f:e:U>U6T:S:36g>g:e> \n e>D:f:e>V:S6T>U>C:T636S:5;S6T>e:U>e>e:f>e>D:fFgBfBV:U>U>e>g6S:S:f:e:f>g>e: \n U>U64;B:D:U:U>D:T6T6B?U>T:D:5?D:S:5;S:f23CgBg:5Cf:S> \n FKWGiCXK7GXKhFIGiK9KWOUKFG7GWK4KXOVKFKWGX?7GXKW;GKW?iC6?6G7GH> \n hOGKYOiFWOiJiC7GFGXG4KW?FG7GW76GFGH;WGH?YOf:fBgB7CTBXK9DXCWGHKi;6GHKW;GKW? \n iKgB5CGCF7ECWKXFW?8CgBFGF3U?gBFCW7FC7GW;HKW;G;S:f:5?UJ7?eB7GFK5G6?FG6; \n EC5GG?7GX>gBg>6Gg:6ChFV>6C5C4?FG6GS>6C4Gf:e>g:5CfFh>FC7;gBG75Ge>U>5Cf> \n 7GeBg>6GD:f>e>fB6?EGW:S:U6e:EC5CFK4CeB5?6Gf:5CgBT>gB5Gg:D:e>eBVB5G77eB4?U: \n fBU>5>S:D:e>V>f:fB6CgB5?U>5?T>U6;PHC5?gB7?g>eBg>7?U>6?6?F?eBg>e>gJ7?eBg>6? \n U>E?eBg>67e>D?FCgBFCfBYGgB5Cf:h:5CF:EG6?6GgJ6?gBg>e>F;f:D:TCg> \n TG6G7GWG6G7SYGgBF?4G7C5CWC5Cf:E;f:TCgJGCGK7ChGU>6?F:E?7C5C7?U?2Cf: \n fBfG7C5ChG6?V?UGXOHGXGVGg:5G5CF;5?f>6?F:g:5CVB5G4?e>eB5?D>fB4?S>f:f:U>6? \n 57U>g65;D:U>D:f:4CT>gBE>eB6>57T:S:f:UB57e>T>5;D:U>U:e>U>6CT6D:36D:g:f> \n F7f6e:U>5;D:f>e6T>e:5?D6B6T6eBf:5CU>e6U:C:e:S>33S:T6T>S:D:eBf>e>U>e:U6e: \n UNHCU>gB5C4Cg:fBg:E?5?F;gBFBV:f:fBf:6CWBV>eB5Cf:fBgBe>eB4?S:S:U:5CfFh>gB7; \n fB576?D:U>f:5;gBS:f:fBU:S>5?f:5?e>f>e:D6e:DC5CFC4Ce:5?6CU:U>gBe>eB5?V:D: \n T6T>h>e>6;f:47T6T>T>VB36T>T6V6e:f>U:D:g>gBf:eBf:HCU6e:U>F>f:S>f:TBT>gBd: \n 53f6T:S:f>e>57f6e:U>U:S>f:E:e:U>V636S:U>g:6;eB5?T:5?d>V:S6T>U>d:56T:S: \n U6T6T>e>U>eB5;D:e:D:DFg>fBW>E:U>e>g6S>e:U:e:f>g>T6T>D64;D:f>S:U>D6B6T:e: \n U6B6T>4;D:e>6?e:f:e:fBf:f:dK7?eB5?F;5CU>6?U:f>5CUB5GdBe>T>5CE:U>4?T>U>g>U> \n 6?5;eBU:5?D6T>U>5;d>D:f>T>eBF>e6T6e:U6VB57e>T>5?S>D:f>e>eB6?U:U>D:D:h:T: \n 57U2S:D:e>D:f:e:D:U:e>f:T6D2SFf:5CU:e>f:C:e:SBe:D2S:fBS:S>eFf:5CU>5?g:f: \n URYGgB7C5G5Cf:5Gg>5?eB7;gBG:U>g:5C5;5?VBE:5?eBf:5CgBD:f>fBg:S>U6eFUBg:5Cg> \n U>6;eBe>D:5?4;gBS>f:fB56T:S:V>f:7C6?e>g:f:TCf>5G4?S>f:fBV6e>U>E:U>fB5?U>e: \n S>h>eB6;S>f>T6T>D:F:T636S:W>T6T>8?U>7?gBFC5Cf:kK7?F?6CW>g>fBgBUBU>6C5?F;f: \n f:U>gBf>5;g6e>U:5?eBg>f:eBf>6?U6e:S>7?6;eB5?f:5Ce>g>T6S>UF5?V:f:T>67S>U64; \n f>DC6Cg:5?eBfJ7CfBh>U>U>T>6;S>f:e:e:5?gBf:eBU:UCU>6?U:f>g>D:U6D;U>T6B:E?U: \n C:UCf:D?DC5GgB7CfK7?eBe>57e:T:f:U6U6e>U>eBd:S:S>e:U:T>d:B:T6T>D:f:e:D:U:e> \n T6D:364?e>C:U>T:S>E:e:D6B6T6V>e6S:C:e>36T:D>S:DBf>f:U>D:U:7?U:5;T6T6D:e> \n 36T:S:C:S>e:U:S:U6SFU6e>T:S:e>T:S6BBe6T:C2SBT636SFU:SBDB5?g:5? \n URYGgBhB6CeBf>fB5?4?e>6?gBVBU:U>g:5?f>VBE:e>e>g:fBfBf:e>f>f>e:S6eFgBV:f>g> \n U>5;f>f:D:D:D?gBT:U:f:V6S>f:V:f:g>5C5?e:5?UG6?5Cf>e>e:f:V6T>U>U:T>g>5?U>U> \n T>8?e>g>U:f>g>U6D:hBT>U:36h>T6T6h:D:h:7GgB5G6?;PHC5?gBfB6?e:5?gFf>eB6?g>g: \n S>e>UF6C5?6;D:fBF?e:5?6?D:f>T>gBU6eBHCG?e:5?g>U>U>e:f:f:SJ6?g:S>e>E;36eB5; \n S>e:TB7Gg:5G6OHGgB5Cf>e>eBE?T6e>67D:5?e>6?6?e>gGU>eBV:d>eB5?D:U?U6e:U6B?T: \n S:4;C2C;TGHC5GHGg:S>FKFKW?GKFCWGXB8GWGiFHKgK5GFGFGdFWKEK6GFKH;FCGGX?HKX;W? \n gBgBFG7:VKFGHKYBGKhJi?gBGCGGdFHC5CFGF;7GGKH7FCW;HKU>U>5CgBC>GKi? \n WCFCWKW75C7GX;GKW;WGU>6?6C5;4GFGhJW;h>5C5C77g?6CGCG35?FGF77GX;7?T6T>f:fJ7? \n eBhB7GT>gB5?e6d:U>g:5?gFV>D:fBV2T>E>V6e:f:T>e>eB4?6?S>D2S:f:U>C>E:e:57e: \n f6gBB:S:S:f:5?D:D:U>f:f:5?D:U>fBU6T6T6D23;S:fBR>C:S>U>D:S:e>e:f>S>T:C6B6T: \n g:U>U>gBT:36D:T>VFS:S>e>56T:D:V>e>U6e>e>e:S>YGg:5;5?F>5;U>gBTBe>eBeBf:77e: \n f:f>d>675;D:5Cf:U:fBgBfBV>D:S:S:f>V:6;f:5GT>U>4CE2S>U:SBeBU6S:f:5?T>5Cf:S> \n V:U>e>T6T:SFU>5CE>V:S>6?f6T6eBg>U>V>e6T:D6B6D?e:e>5?U>T6T6D:D?W6T>U>47B:f: \n e6e:4?eBg>e>U>TGg:S>S>e2T>S6e:E6E:e:E:U>3?B:U:S:D:e>R>C:S>U:S6T:f:U>f6e: \n S636S:f:d>S:U>F6T>T>5736T6T:E:U6B6T:S>D:e>U:T6e>U>e:D:T6T:g:T>57e:S6e>e: \n B6D:f>T>e:e:D:T6D6BBD:S:T>e6T:D6B6DB5;D:T6T>D2S>eBD:f>eBf:f>e>UNHCU>V>gBd> \n U>eB5;T:eBU:f>VBE:U>U>f6S>D>E:U6e>U:e>eBf:5?eBU6T6T6eB4:D:S>e:T:f:fBS6B:e> \n 4;f>D:D:U>V6e:f:U>D:6?e:f:f:T6D?C6T>T>36D:D:E6S:S>U:U:D:f:S>e:C6h:T>U>U>T> \n U:D:D:hBe:S:S:V:36T>h:S>g:5C5Cf>e>kK7?F?gBW>U>eBg>U>D:5?e:57U:f:e>UBT> \n e6U2S>D:f:S>g:U:S>e:5?D:T6B:h6f:S>f:T6e>S:U>D2S>DBe:E6e:S:f6B:U:37e:C?gBU> \n f:S>TJV:T>V>D6T:S:f6B:T6T6S6e:UBU6T>D:D?D:f>T6T:f>T6D23;E:T636C;U6B6TCU6D? \n 4?6CU>g>4PHC5G5CF;e>f>g:f6U:eBf>fB4?e:S:5?V:e>e>C:U:SBU:f:U>U>g>eBU:S>D:D? \n e>S:U>f:T>U>5;U:36T:h>f:e:S6eBD:U>TBS>UF5?g>eBU>U>8?U>5;e:T6T6eBD6T:D>T>e> \n e:g>D:f:fJg:e>e>e>4?e:e:SF5;f>D6TFe>D2SJg:DFDBgB7?6?gNHCU>V>gBC:U>e:S:R6D: \n U:e:UBE:36T>f6C:D:E2S6T6U:S:S>f:f:D:U6T6T6DBD:46S6e:S6T:U>S6C6B64?e:D:36D: \n V6T6e:56T:V>e:f:f:U6D?T6T>C:D6B:D:U6B6S:U6T:D:d:T:S:T:7?D:D>U>D>D:U>D:hBe> \n T:S:F:T636h:S:F25C5C5?e>kK7?F?FCV:5?g>U>E>e:e>fBf>7;T6e>eBT:f:5;C:e>4?U:U> \n 6CfBf:e>e>D:e:h:f6T:e>U>T>5?U:T:D2SFgBf:T6e:C?T>eB57S>5;fB5CU>5?eJg>e>U:f: \n D:e:3?D6T>5?T>f:T>f>U6e>UGg:e:6?f:f:5?e:UCh>g>U6D;e>T6B?U:D;3G7?6GgB6?D: \n 5GGKHCXOFGFKjFIKHKjFXGgOgBWKGC4KiOVOGCWOY;FGFKj?XGi?H;5G7C5CG> \n hOWKWOkFXG8OYC5GXG7GdFXCgBWKG;GCWOY;7Gi77GeBg>e>6GTBXOYCiG7GiOX;FGFKj?XGi? \n HKeBGCgBF;4G7GiJH?X>FG6?6;gC5GXG77gBWKG3gBG7F;f:D:e>gRYGg:f>6?4CW>U>F?E?6? \n F?5CfFW6eBg>4;6GWBh>eBGCV>U>FG6C5G5?e:f:D:eFfFhBgBW?5C5?GCD:5Cf:E?5CU6eBg> \n 7?eBGCg:5GE:5?6?U>f:UC5CGC4Gf:5G7CV>U>FG6C5G5?V>f>T6T>8;f:5C6?5;U>U:S:8GU> \n 5Cf:W6eBg>66e>W>FG6?6C5?YGg:S:e>D>57T6eBTBe>eBT>U:67B:f:D>e>675;D: \n 5Cf6T6eBg>U>V>D:U:C2C:g:6;f:5GT>U>5CU6S>U:SBT>U6B:f:4?D:5Cf:T>V:S>g>T6T> \n fFg>5CU>g:S>6?f6T6eB6?U>g>e:e>U:S6D?S:S>f>T>S>T636CCg:e>U:3?D:f:f6B:57DCg> \n e>6C5PHCU>f>g:eBT>e:f6U>eBf>f>5CD:S>f:V:e>eBD:U>UBT:e:5Cf:f>e:U>U:S:D?d>S: \n S>g:U:fBf:S6T6T>h>f>D:S>eFU6T>gBS>e>U6gBg>e>U>8;T>U:e:36e>TBT6S:fBU:f>D:e: \n f:U:TJV:T>4?U>T>e>T6TJ6?e:f:DFe:S:SBD2SFDBGCgB6?gVkK7?g>eBfBU6eBUB4?e>6?U> \n U>f:U6eBE?f>VBE:e>e>V6T>U>U:S>g:5?e>U6eJVBV:U>g>U>5;f:U>D:e:D?U>T6T6e>V6B: \n e:W6e:V>DC5Cg:5?fGf>5?f>T6e:f>V6T>U>U:S>g:fBU>f:e>8;S:f>T6f:f:U:C:h>D:U: \n C2i:U6T:h:36i:7GGC5G6?;PHC5;f>g>5?T>g>VBe>eBg>f>6?e:D:fFf>6?5;D:f:E?T:f>4? \n U>6?eBf:f:e>8?6;f:5CV>U>5Cf:f:S:SJg>f>e:D:E?D:f:E;S>5;fF6?6?5C5O7C5Cf>g>T> \n U>E?T6e>4?U>6?e>6?e>e>gGU:e>g>4?5?U>U:UCg:5?T:S?e>D:D?U6R?DGFG6G7Gg: \n 36eB6GW?GK5C7GXB8GWGXBGKUK5?FGFGdFWKEK6GFKH75C7GX;GKW;W?eBgB6?F: \n VKFGHKYBGKhJi?gBGCGGRBG?5?FGF76GFKH;FCW;HKS>U>f:fBD>GKi?WCFCWKW75C7GX;GKW; \n WGU>6?6C57dBFCWFW;h:5C5Cg:U?gBGCG;5?FGF77GX357e>U:S:fJ7?D2C6T>S:56T6e:d6T> \n e6S:U>U6B:f>e:T>E:U6D:f:46T6e>U>U>U>D:f:D6BBU>E:e:5;S:U>fBT6e:S:e6S:T6B:U> \n g:D:5?F:eBf:U>6?U:S:ECU:fBT>U:S>U>E:S6e>g:U>U>e:5?e:D:V2S:S>e>U:S>U:C27?f: \n 5?e:W>e>D:V6e>56FG6?U>5CYGg:S:T>F6e6S>D:4:S6e:T:e:f6D2S:f>C6T6e6B:S:d6C:D: \n f:e:T6e:S:S:D6V6T2C:S>D:S:e:E:C:36TBT:T6D2S64;S6S>e2S:5;U>e>e>U:SFU6S: \n E6T636T6e:36C:e:S:T6D>T>D:f:D?C6T6U:U6U6e:U:C?U>T>D:47e:D2C?D:47cBgB6?U>5? \n D:5GGGiCFK6GHCh>7GFKhFGKUKFC5GWKTBFGEKgB7G7;6CGCW;GKG?FCU> \n 6G7CF6EG5C7GXB7GhJW;5?6?FGdFG?5C5GF76G6GH;5GF?WGD:fBg>U>4:6GW;F?5?FGF75? \n 6CG;7GG7FCe:f:5C6;4CFGVFW;g>eB5G6;U?g>FCW?eB5C5;FCG7g2S>g>T6TFg:5GHGFKFK7? \n FK7?VGFKX?7GXFhB7?FKW>GG8KhBGGFG4?FG7G3C7GDK5?eB7?F;4K8CWGH?7GX;GK5CgBFGF> \n 7GeB6?FKc>gBFC3GFCTGi:S>g:5?f6EGWOEG5GFCGK4?FG7G3C7GDKh>U>5C5GTB5GG76GD?f: \n 5GgBSFe:fB5GeB5?6GEC7GDC36eBf>T67?eBWCGGiFWC6GHG4KFGHKEGW?X?FCgBW7EGX? \n WCFCGCWB6GGGVFWGXFiBf:5GFGTBXCGKWK4GWGUKjB5C5GH;EGh>6CgBGBFCGCGB7GWJW? \n U6eB5C5?eFWKjF8C7G7GH>6GFGVFWGXFH?e>eB7?g:6CGGDGXFf>U>FCV>iB5C5GX> \n gBgBhFFGgFV6B:5Cg>4?D:5G5GF;6G5?FCG>hBFCWB7GUGeB5C5GRBFG4GfB5G775?6CG; \n 7GG7F;U>U>6CF6EG5C7GH>6GVFW;U>6?FCSB7?e>5C57gB6G735?F77Ge>D:5?U>D:6GW;F?5? \n FGF3e>gBG76GF7FCD:f:5?e:dB5CVFF7V:e>eBg:U;f>6?F7e:5C5;gBG?g>D2S>6?gFg: \n 5G8GHGEG8G6GW;VCGGW?WG7Oi>6G7?F>GKiF8C6GWG4G6GWKUGWKDGe>6?eBG;4K8GGGX;FGG? \n XKf>6GgBW>WGg>6G7?DCFGXG3CFGCCW>g:S>6?g:EGXKEK6CFGHCdB6CGKDGGKDGW:fBU> \n gBUB7CG?HGD;fBg:5C5OfBFGgBe>5C7?4?FG5Cg:36eBFCHCU>FGWG6KHC7?FKEO7GFKEG7CH? \n eBWGg:VKWCH?gB7GXB6?FGiF6GWFF:5Gg:5GfFjGFCWGEC7GDGh:5?FC5?EGh> \n eBFGVBfBFGFB5G6B57eBU6eB6C5KHK7KhB5GFKWB5?FCGB6CWFF7e:5?eB7;6C5GDCVFS>5CU> \n g>X:fBgBU>eB5CF>eBV>gBU6B:5GFCU6eB6GG?GC5C6GWB8?FGWBFGECf>6GFCeF7GECeB6? \n F7fB6GF;gB7?F;e>gBU>g>VKgBGGVB5GGBF;f>eB7?TBF;f>gBF7U>gBg:5Cg67GS:5?D: \n 5CVBGCW?7;5CgBW7U>6C53fB57FCT:S>g:5?d>6CGB5;V:U>5?e:D7e:f:5?e>U>5;gB5;5?5? \n D2S>6CU6B:f>6G4CW>5?F7E?6GF75CWFW>eBgBG:6GWBh>gBFCR>5?FG3C7G4GD:f:5?e: \n eFhBFCG75C7;GKf:fB5GF65CT>eBgBe>gBGC4C5CCC76e>g:S>g:5CGK4G5C5C7GS>5? \n 6G3C7GDGV6T>5CU>4:fB576G4;S>U>g:UFe:5C5Gf>e>6G4?6GS>eBg:36eB7?D:5CFGiBW? \n 6G6GeFFCGG4GW?X?g>FCW;4CG?WC5CFGF>6G6GXFWGhBh:eB5Gg:E>G?6GFK4GFGUGX>fBgBG; \n 4Gh>g>FChBFCFKW>6CWFG7S>5CU6eBTBFGXBh>gBGCW>gB6GWFFGGB7;T>U>6?e65C7CDGXBU: \n 5?FC5?iBfB7Gi:f>6?gB6GW>U>6CU6B:ECU:5GFGW?5G6C7?V:gB5GgB7GUG5?eBFKC>5C4GU> \n gBg:5?6?F;7G7;5?D:fB7CU24Ce>gBG>gBVFF7e:f:5CUB7?e>eB5;gBgB77eB5;FC36T>6?D: \n E6fBF75;e:5C5;e:f>67gB635?S6T6eBgBeB5CUFF7U:S>eB6?U;f:5?F;S>e>e>5?6;U6e>6? \n D2SJ7?5GHGFK6G7?FG6?EC6GH?7GXFhBg>FKW:6GhFh>FCFC4?FG6G3C7G4Gf:eB7?6? \n dFhBFCG;6CG;GKeBfB5Cg>7GeBg>6Ge>gBFCeB6CEGW6S>6Cg:3;4CGK4GfB5C7Gf> \n 5C6G4C7G3GV>T>e>FCVB5G776G4?U:fBgBUFf:fB5GU>f>gB6C6G5?T>FGg:36HC5GiGgB7G7? \n eB7?5KgBFG4?F76;5?eB7;EGF?7;fBgBG>eB6?6>5?FBV>D:5?eBUBXC5CGC4?6G3CW:f:5Cf: \n 4?F:f>eBG:e:fBU>fBUB6;36e>5CUBfF7GhFV>5C5GW>e>6?F>5?VB67T6e>eBh6U>6Cc>FBT: \n S>g:U6V:S:U>g>T>e>g>f>gBU6eB6CU62 ;\n map inds = {\n {0ull, 0}, {1ull, 1}, {2ull, 173}, {3ull, 223},\n {4ull, 247}, {5ull, 259}, {6ull, 268}, {7ull, 274},\n {8ull, 277}, {9ull, 278}, {10ull, 279}, {11ull, 280},\n {12ull, 281}, {13ull, 282}, {14ull, 283}, {15ull, 284},\n {16ull, 285}, {17ull, 286}, {18ull, 287}, {19ull, 288},\n {24ull, 2}, {25ull, 96}, {26ull, 128}, {27ull, 142},\n {28ull, 151}, {29ull, 157}, {30ull, 161}, {31ull, 162},\n {32ull, 163}, {33ull, 164}, {34ull, 165}, {35ull, 166},\n {36ull, 167}, {37ull, 168}, {38ull, 169}, {39ull, 170},\n {40ull, 171}, {41ull, 172}, {48ull, 174}, {49ull, 193},\n {50ull, 202}, {51ull, 208}, {52ull, 212}, {53ull, 213},\n {54ull, 214}, {55ull, 215}, {56ull, 216}, {57ull, 217},\n {58ull, 218}, {59ull, 219}, {60ull, 220}, {61ull, 221},\n {62ull, 222}, {72ull, 224}, {73ull, 231}, {74ull, 235},\n {75ull, 237}, {76ull, 238}, {77ull, 239}, {78ull, 240},\n {79ull, 241}, {80ull, 242}, {81ull, 243}, {82ull, 244},\n {83ull, 245}, {84ull, 246}, {96ull, 248}, {97ull, 250},\n {98ull, 251}, {99ull, 252}, {100ull, 253}, {101ull, 254},\n {102ull, 255}, {103ull, 256}, {104ull, 257}, {105ull, 258},\n {120ull, 260}, {121ull, 261}, {122ull, 262}, {123ull, 263},\n {124ull, 264}, {125ull, 265}, {126ull, 266}, {127ull, 267},\n {144ull, 269}, {145ull, 270}, {146ull, 271}, {147ull, 272},\n {148ull, 273}, {168ull, 275}, {169ull, 276}, {553ull, 3},\n {554ull, 50}, {555ull, 67}, {556ull, 76}, {557ull, 82},\n {558ull, 85}, {559ull, 86}, {560ull, 87}, {561ull, 88},\n {562ull, 89}, {563ull, 90}, {564ull, 91}, {565ull, 92},\n {566ull, 93}, {567ull, 94}, {568ull, 95}, {577ull, 97},\n {578ull, 108}, {579ull, 114}, {580ull, 118}, {581ull, 119},\n {582ull, 120}, {583ull, 121}, {584ull, 122}, {585ull, 123},\n {586ull, 124}, {587ull, 125}, {588ull, 126}, {589ull, 127},\n {601ull, 129}, {602ull, 133}, {603ull, 134}, {604ull, 135},\n {605ull, 136}, {606ull, 137}, {607ull, 138}, {608ull, 139},\n {609ull, 140}, {610ull, 141}, {625ull, 143}, {626ull, 144},\n {627ull, 145}, {628ull, 146}, {629ull, 147}, {630ull, 148},\n {631ull, 149}, {632ull, 150}, {649ull, 152}, {650ull, 153},\n {651ull, 154}, {652ull, 155}, {653ull, 156}, {673ull, 158},\n {674ull, 159}, {675ull, 160}, {1106ull, 175}, {1107ull, 181},\n {1108ull, 184}, {1109ull, 185}, {1110ull, 186}, {1111ull, 187},\n {1112ull, 188}, {1113ull, 189}, {1114ull, 190}, {1115ull, 191},\n {1116ull, 192}, {1130ull, 194}, {1131ull, 195}, {1132ull, 196},\n {1133ull, 197}, {1134ull, 198}, {1135ull, 199}, {1136ull, 200},\n {1137ull, 201}, {1154ull, 203}, {1155ull, 204}, {1156ull, 205},\n {1157ull, 206}, {1158ull, 207}, {1178ull, 209}, {1179ull, 210},\n {1180ull, 211}, {1659ull, 225}, {1660ull, 226}, {1661ull, 227},\n {1662ull, 228}, {1663ull, 229}, {1664ull, 230}, {1683ull, 232},\n {1684ull, 233}, {1685ull, 234}, {1707ull, 236}, {2212ull, 249},\n {12720ull, 4}, {12721ull, 24}, {12722ull, 33}, {12723ull, 38},\n {12724ull, 41}, {12725ull, 42}, {12726ull, 43}, {12727ull, 44},\n {12728ull, 45}, {12729ull, 46}, {12730ull, 47}, {12731ull, 48},\n {12732ull, 49}, {12744ull, 51}, {12745ull, 56}, {12746ull, 59},\n {12747ull, 60}, {12748ull, 61}, {12749ull, 62}, {12750ull, 63},\n {12751ull, 64}, {12752ull, 65}, {12753ull, 66}, {12768ull, 68},\n {12769ull, 69}, {12770ull, 70}, {12771ull, 71}, {12772ull, 72},\n {12773ull, 73}, {12774ull, 74}, {12775ull, 75}, {12792ull, 77},\n {12793ull, 78}, {12794ull, 79}, {12795ull, 80}, {12796ull, 81},\n {12816ull, 83}, {12817ull, 84}, {13273ull, 98}, {13274ull, 101},\n {13275ull, 102}, {13276ull, 103}, {13277ull, 104}, {13278ull, 105},\n {13279ull, 106}, {13280ull, 107}, {13297ull, 109}, {13298ull, 110},\n {13299ull, 111}, {13300ull, 112}, {13301ull, 113}, {13321ull, 115},\n {13322ull, 116}, {13323ull, 117}, {13826ull, 130}, {13827ull, 131},\n {13828ull, 132}, {25440ull, 176}, {25441ull, 177}, {25442ull, 178},\n {25443ull, 179}, {25444ull, 180}, {25464ull, 182}, {25465ull, 183},\n {292561ull, 5}, {292562ull, 13}, {292563ull, 17}, {292564ull, 18},\n {292565ull, 19}, {292566ull, 20}, {292567ull, 21}, {292568ull, 22},\n {292569ull, 23}, {292585ull, 25}, {292586ull, 27}, {292587ull, 28},\n {292588ull, 29}, {292589ull, 30}, {292590ull, 31}, {292591ull, 32},\n {292609ull, 34}, {292610ull, 35}, {292611ull, 36}, {292612ull, 37},\n {292633ull, 39}, {292634ull, 40}, {293114ull, 52}, {293115ull, 53},\n {293116ull, 54}, {293117ull, 55}, {293138ull, 57}, {293139ull, 58},\n {305281ull, 99}, {305282ull, 100}, {6728904ull, 6}, {6728905ull, 8},\n {6728906ull, 9}, {6728907ull, 10}, {6728908ull, 11}, {6728909ull, 12},\n {6728928ull, 14}, {6728929ull, 15}, {6728930ull, 16}, {6729457ull, 26},\n {154764793ull, 7}};\n void solve() {\n vector bits;\n for (char c : encoded) {\n int cur = c;\n if (c > '\\') {\n --cur;\n }\n cur -= 50;\n for (int j = 0; j < 6; ++j) {\n bits.push_back(cur & (1 << j));\n }\n }\n int c = 0;\n for (int i = 0; i < 289; ++i) {\n for (int j = 0; j < 289; ++j) {\n for (int k = 0; k < 4; ++k) {\n real_dist[i][j] |= bits[c++] << k;\n }\n }\n }\n vector sieve(MAXV);\n for (int i = 2; i < MAXV; ++i) {\n if (!sieve[i]) {\n sieve[i] = i;\n for (long long j = (long long)i * i; j < MAXV; j += i) {\n sieve[j] = i;\n }\n }\n }\n function get_ind = [&](int a) {\n vector pows;\n map cnt;\n int tmp = a;\n while (tmp > 1) {\n int div = sieve[tmp];\n cnt[div]++;\n tmp /= div;\n }\n for (pair p : cnt) {\n pows.push_back(p.second);\n }\n sort(pows.begin(), pows.end());\n unsigned long long h = 0;\n for (int num : pows) {\n h = h * 23 + num;\n }\n return inds[h];\n };\n int t;\n cin >> t;\n for (int i = 0; i < t; ++i) {\n int a, b;\n cin >> a >> b;\n int ind1 = get_ind(a);\n int ind2 = get_ind(b);\n cout << real_dist[ind1][ind2] << \n ;\n }\n }\n int main() {\n cerr << fixed << setprecision(15);\n cout << fixed << setprecision(15);\n ios::sync_with_stdio(false);\n int tests = 1;\n for (int it = 1; it <= tests; ++it) {\n solve();\n }\n return 0;\n }\n "} @@ -1716,7 +1716,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n int a[101], dif[100], i, unique[101], c = 0;\n int min = 0, n, dif1, dif2;\n cin >> n;\n for (i = 0; i < n; i++) {\n cin >> a[i];\n }\n sort(a, a + n);\n unique[c] = a[0];\n c++;\n for (i = 1; i < n; i++) {\n if (a[i] != a[i - 1]) {\n unique[c] = a[i];\n c++;\n }\n }\n if (c >= 4) {\n cout << -1;\n } else if (c == 1) {\n cout << 0 << endl;\n } else if (c == 2) {\n if ((unique[1] - unique[0]) % 2) {\n cout << unique[1] - unique[0];\n } else {\n cout << (unique[1] - unique[0]) / 2;\n }\n } else {\n if (unique[2] - unique[1] == unique[1] - unique[0]) {\n cout << unique[2] - unique[1];\n } else {\n cout << -1 << endl;\n }\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long n;\n int k;\n long long a[100050];\n int main() {\n cin >> n >> k;\n for (int i = 1; i <= k; i++) cin >> a[i];\n long long A = 1, B = 0, C = 0;\n for (int i = 1; i <= k; i++) {\n if (n - n % a[i] > C) {\n A = 1ll * i, B = n / a[i];\n C = n - n % a[i];\n }\n }\n cout << A << << B;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, q, A[100005 * 3], B[100005 * 3], ans[100005];\n int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }\n vector > G[100005];\n vector E[100005];\n pair SL(pair a) {\n int t = gcd(abs(a.first), abs(a.second));\n a.first /= t, a.second /= t;\n return a;\n }\n int tr[100005];\n void upd(int u, int v) {\n for (; u <= n; u += u & -u) tr[u] += v;\n }\n int qry(int u) {\n int r = 0;\n for (; u; u -= u & -u) r += tr[u];\n return r;\n }\n map, int> mAp;\n int main() {\n scanf( %d , &n);\n for (int i = (1), LIM = (n); i <= LIM; i++) {\n int K;\n scanf( %d , &K);\n for (int j = (0), LIM = (K - 1); j <= LIM; j++) {\n scanf( %d%d , &A[j], &B[j]);\n if (j) G[i].push_back(SL(make_pair(A[j] - A[j - 1], B[j] - B[j - 1])));\n }\n G[i].push_back(SL(make_pair(A[0] - A[K - 1], B[0] - B[K - 1])));\n }\n scanf( %d , &q);\n for (int i = (1), LIM = (q); i <= LIM; i++) {\n scanf( %d%d , &A[i], &B[i]);\n E[B[i]].push_back(i);\n }\n for (int i = (1), LIM = (n); i <= LIM; i++) {\n for (auto u : G[i]) {\n int t = mAp[u];\n upd(t + 1, 1), upd(i + 1, -1);\n mAp[u] = i;\n }\n for (int u : E[i]) ans[u] = qry(A[u]);\n }\n for (int i = (1), LIM = (q); i <= LIM; i++) printf( %d\n , ans[i]);\n }\n "} -{"func_code_string": "#include \n using namespace std;\n inline int inp() { return 0; }\n inline int inp(bool& A) {\n if (cin >> A) return 1;\n return -1;\n }\n inline int inp(char& A) { return scanf( %c , &A); }\n inline int inp(int& A) { return scanf( %d , &A); }\n inline int inp(float& A) {\n if (cin >> A) return 1;\n return -1;\n }\n inline int inp(long long& A) { return scanf( %I64d , &A); }\n inline int inp(double& A) { return scanf( %lf , &A); }\n inline int inp(char* A) { return scanf( %s , A); }\n inline int inp(string& A) {\n if (cin >> A) return 1;\n return -1;\n }\n template \n inline int inp(Front& A, Queue&... B) {\n return inp(A) + inp(B...);\n }\n inline int oup() { return 0; }\n inline int oup(bool A) {\n if (cout << A) return 1;\n return -1;\n }\n inline int oup(char A) { return printf( %c , A); }\n inline int oup(int A) { return printf( %d , A); }\n inline int oup(float A) {\n if (cout << A) return 1;\n return -1;\n }\n inline int oup(long long A) { return printf( %I64d , A); }\n inline int oup(double A) { return printf( %lf , A); }\n inline int oup(char* A) { return printf(A); }\n inline int oup(const char* A) { return printf( %s , A); }\n inline int oup(string& A) {\n if (cout << A) return 1;\n return -1;\n }\n template \n inline int oup(Front A, Queue... B) {\n return oup(A) + oup(B...);\n }\n template \n inline void remax(T& A, T B) {\n if (A < B) A = B;\n }\n template \n inline void remin(T& A, T B) {\n if (A > B) A = B;\n }\n string ToString(long long num) {\n string ret;\n do {\n ret += ((num % 10) + '0');\n num /= 10;\n } while (num);\n reverse(ret.begin(), ret.end());\n return ret;\n }\n long long ToNumber(string s) {\n long long r = 0, p = 1;\n for (int i = s.size() - 1; i >= 0; --i) r += (s[i] - '0') * p, p *= 10;\n return r;\n }\n long long Gcd(long long a, long long b) {\n while (a %= b ^= a ^= b ^= a)\n ;\n return b;\n }\n long long Power(long long base, long long power) {\n long long ret = 1;\n while (power) {\n if (power & 1) ret *= base;\n power >>= 1;\n base *= base;\n }\n return ret;\n }\n long long PowerMod(long long base, long long power, long long mod) {\n if (!power) return 1;\n if (power & 1) return (base * PowerMod(base, power - 1, mod)) % mod;\n return PowerMod((base * base) % mod, power >> 1, mod);\n }\n int Log(long long num, long long base) {\n int ret = 0;\n while (num) {\n ++ret;\n num /= base;\n }\n return ret;\n }\n int Count(long long mask) {\n int ret = 0;\n while (mask) {\n if (mask & 1) ++ret;\n mask >>= 1;\n }\n return ret;\n }\n inline void run() {\n in:;\n int n, m, k;\n if (inp(n, m, k) != 3) return;\n vector a(m), b(m), c(m);\n long long ans = 0;\n for (int i = 0; i < m; ++i) inp(a[i], b[i], c[i]);\n while (k--) {\n int tmp;\n inp(tmp);\n for (int i = 0; i < m; ++i)\n if (tmp >= a[i] && tmp <= b[i]) ans += (long long)c[i] + tmp - a[i];\n }\n oup(ans, '\n');\n goto in;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr), cout.tie(nullptr);\n run();\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n inline int inp() { return 0; }\n inline int inp(bool& A) {\n if (cin >> A) return 1;\n return -1;\n }\n inline int inp(char& A) { return scanf( %c , &A); }\n inline int inp(int& A) { return scanf( %d , &A); }\n inline int inp(float& A) {\n if (cin >> A) return 1;\n return -1;\n }\n inline int inp(long long& A) { return scanf( extra , &A); }\n inline int inp(double& A) { return scanf( %lf , &A); }\n inline int inp(char* A) { return scanf( %s , A); }\n inline int inp(string& A) {\n if (cin >> A) return 1;\n return -1;\n }\n template \n inline int inp(Front& A, Queue&... B) {\n return inp(A) + inp(B...);\n }\n inline int oup() { return 0; }\n inline int oup(bool A) {\n if (cout << A) return 1;\n return -1;\n }\n inline int oup(char A) { return printf( %c , A); }\n inline int oup(int A) { return printf( %d , A); }\n inline int oup(float A) {\n if (cout << A) return 1;\n return -1;\n }\n inline int oup(long long A) { return printf( extra , A); }\n inline int oup(double A) { return printf( %lf , A); }\n inline int oup(char* A) { return printf(A); }\n inline int oup(const char* A) { return printf( %s , A); }\n inline int oup(string& A) {\n if (cout << A) return 1;\n return -1;\n }\n template \n inline int oup(Front A, Queue... B) {\n return oup(A) + oup(B...);\n }\n template \n inline void remax(T& A, T B) {\n if (A < B) A = B;\n }\n template \n inline void remin(T& A, T B) {\n if (A > B) A = B;\n }\n string ToString(long long num) {\n string ret;\n do {\n ret += ((num % 10) + '0');\n num /= 10;\n } while (num);\n reverse(ret.begin(), ret.end());\n return ret;\n }\n long long ToNumber(string s) {\n long long r = 0, p = 1;\n for (int i = s.size() - 1; i >= 0; --i) r += (s[i] - '0') * p, p *= 10;\n return r;\n }\n long long Gcd(long long a, long long b) {\n while (a %= b ^= a ^= b ^= a)\n ;\n return b;\n }\n long long Power(long long base, long long power) {\n long long ret = 1;\n while (power) {\n if (power & 1) ret *= base;\n power >>= 1;\n base *= base;\n }\n return ret;\n }\n long long PowerMod(long long base, long long power, long long mod) {\n if (!power) return 1;\n if (power & 1) return (base * PowerMod(base, power - 1, mod)) % mod;\n return PowerMod((base * base) % mod, power >> 1, mod);\n }\n int Log(long long num, long long base) {\n int ret = 0;\n while (num) {\n ++ret;\n num /= base;\n }\n return ret;\n }\n int Count(long long mask) {\n int ret = 0;\n while (mask) {\n if (mask & 1) ++ret;\n mask >>= 1;\n }\n return ret;\n }\n inline void run() {\n in:;\n int n, m, k;\n if (inp(n, m, k) != 3) return;\n vector a(m), b(m), c(m);\n long long ans = 0;\n for (int i = 0; i < m; ++i) inp(a[i], b[i], c[i]);\n while (k--) {\n int tmp;\n inp(tmp);\n for (int i = 0; i < m; ++i)\n if (tmp >= a[i] && tmp <= b[i]) ans += (long long)c[i] + tmp - a[i];\n }\n oup(ans, '\n');\n goto in;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr), cout.tie(nullptr);\n run();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n string s, ss;\n int idx;\n int main() {\n cin >> s;\n for (int i = 0; i < s.length(); i++) {\n if (s[i] == '.') {\n idx = i;\n break;\n }\n }\n if (s[idx - 1] != '9') {\n if (s[idx + 1] < '5') {\n ss = s.substr(0, idx);\n } else {\n ss = s.substr(0, idx);\n ss[ss.length() - 1]++;\n }\n } else if (s[idx - 1] == '9') {\n cout << GOTO Vasilisa. ;\n }\n cout << ss;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, i, k, x;\n string s;\n int main() {\n cin >> n >> k >> s;\n for (i = 0; i < n; i++) {\n if (s[i] == '#')\n x++;\n else\n x = 0;\n if (x == k) {\n cout << NO ;\n return 0;\n }\n }\n cout << YES ;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct Node {\n int u;\n map child;\n };\n vector grafo;\n int win[100005], lose[100005];\n void addTrie(int u, string &s) {\n for (char c : s) {\n if (grafo[u].child.count(c) == 0) {\n Node novo;\n novo.u = grafo.size();\n grafo[u].child[c] = grafo.size();\n grafo.push_back(novo);\n }\n u = grafo[grafo[u].child[c]].u;\n }\n }\n void solve(int u) {\n if (grafo[u].child.size() == 0) {\n win[u] = 0;\n lose[u] = 1;\n }\n for (pair par : grafo[u].child) {\n int v = par.second;\n solve(v);\n win[u] = (win[u] || !win[v]);\n lose[u] = (lose[u] || !lose[v]);\n }\n }\n int main() {\n ios::sync_with_stdio(false);\n Node root;\n root.u = 0;\n grafo.push_back(root);\n int n, k;\n cin >> n >> k;\n for (int i = 0; i < n; i++) {\n string s;\n cin >> s;\n addTrie(0, s);\n }\n solve(0);\n int w = win[0], l = lose[0];\n if (w == 0)\n cout << Second << endl;\n else if (w == 1 && l == 1)\n cout << First << endl;\n else if (w == 1 && l == 0 && k % 2 != 0)\n cout << First << endl;\n else\n cout << Second << endl;\n return 0;\n }\n "} @@ -1744,7 +1744,7 @@ {"func_code_string": "#include \n #include \n #include \n #define ff first\n #define ss second\n #define pb push_back\n #define mp make_pair\n #define ba back\n #define ppb pop_back\n #define eb emplace_back\n #define eps 1e-6\n #define vec vector\n #define sz(x) (int((x.size())))\n #define all(x) (x).begin(),(x).end()\n #define FAST ios_base :: sync_with_stdio (false); cin.tie (NULL)\n #define ll long long\n #define loop(i,s,n) for(int i=s;i>n;\n ll a[n];\n ll sum=0;\n loop(i,0,n){\n cin>>a[i];\n sum+=a[i];\n }\n sort(a,a+n);\n ll mx=a[n-1],mn=a[0];\n ll z=(n-1)-sum%(n-1);\n if(z==(n-1)){\n z=0;\n }\n sum+=z;\n if(mx<=sum/(n-1)){\n cout<>t;\n while(t--){\n solve(); \n }\n }"} {"func_code_string": "#include \n using namespace std;\n int read() {\n int x;\n scanf( %d , &x);\n return x;\n }\n const int N = 1123456;\n int a[N];\n vector v[N];\n int c[N];\n priority_queue q[N];\n void dfs(int x, int t) {\n c[x] = t;\n q[t].push(a[x]);\n for (int i = 0; i < v[x].size(); i++) {\n int to = v[x][i];\n if (!c[to]) {\n dfs(to, t);\n }\n }\n }\n int main() {\n int n, m, i, j, x, y;\n n = read();\n m = read();\n for (i = 1; i <= n; i++) {\n a[i] = read();\n }\n for (i = 1; i <= m; i++) {\n x = read();\n y = read();\n v[x].push_back(y);\n v[y].push_back(x);\n }\n int cnt = 1;\n for (i = 1; i <= n; i++) {\n if (!c[i]) {\n dfs(i, cnt++);\n }\n }\n for (i = 1; i <= n; i++) {\n printf( %d , q[c[i]].top());\n q[c[i]].pop();\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n stack > a;\n int main() {\n int n, m = 0, i = 1;\n cin >> n;\n while (n--) {\n int b, c;\n char d, e, f[40];\n scanf( );\n scanf( %c , &d);\n scanf( %d%c%d , &b, &e, &c);\n gets(f);\n b %= 12;\n if (f[1] == 'p') b += 12;\n if (m) {\n if ((b < a.top().first) || (b == a.top().first && c < a.top().second))\n ;\n else\n m--;\n if (b == a.top().first && c == a.top().second)\n i++;\n else\n i = 1;\n }\n if (i > 10) {\n m++;\n i -= 10;\n }\n a.push({b, c});\n m++;\n }\n cout << m << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const long long maxn = 100010;\n const long long inf = 1e9 + 7;\n long long n, a[maxn];\n long long minv = inf;\n long long sum[3];\n int main() {\n scanf( %I64d , &n);\n for (long long i = 1; i <= n; i++) {\n scanf( %I64d , &a[i]);\n minv = min(minv, a[i]);\n }\n for (long long i = 1; i <= n; i++) a[i] -= minv;\n for (long long i = 1; i <= n; i++) sum[a[i]]++;\n sort(a + 1, a + n + 1);\n if (a[n] < 2) {\n printf( %I64d\n , n);\n for (long long i = 1; i <= n; i++) printf( %I64d , a[i] + minv);\n return 0;\n } else {\n long long temp = min(sum[0], sum[2]);\n long long temp2 = sum[1] >> 1;\n if (temp > temp2) {\n sum[1] += (temp << 1);\n sum[0] -= temp;\n sum[2] -= temp;\n } else {\n temp = temp2;\n sum[1] -= (temp << 1);\n sum[0] += temp;\n sum[2] += temp;\n }\n printf( %I64d\n , n - (temp << 1));\n for (long long i = 0; i < 3; i++)\n for (long long j = 1; j <= sum[i]; j++) printf( %I64d , i + minv);\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const long long maxn = 100010;\n const long long inf = 1e9 + 7;\n long long n, a[maxn];\n long long minv = inf;\n long long sum[3];\n int main() {\n scanf( extra , &n);\n for (long long i = 1; i <= n; i++) {\n scanf( extra , &a[i]);\n minv = min(minv, a[i]);\n }\n for (long long i = 1; i <= n; i++) a[i] -= minv;\n for (long long i = 1; i <= n; i++) sum[a[i]]++;\n sort(a + 1, a + n + 1);\n if (a[n] < 2) {\n printf( extra\n , n);\n for (long long i = 1; i <= n; i++) printf( extra , a[i] + minv);\n return 0;\n } else {\n long long temp = min(sum[0], sum[2]);\n long long temp2 = sum[1] >> 1;\n if (temp > temp2) {\n sum[1] += (temp << 1);\n sum[0] -= temp;\n sum[2] -= temp;\n } else {\n temp = temp2;\n sum[1] -= (temp << 1);\n sum[0] += temp;\n sum[2] += temp;\n }\n printf( extra\n , n - (temp << 1));\n for (long long i = 0; i < 3; i++)\n for (long long j = 1; j <= sum[i]; j++) printf( extra , i + minv);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n inline long long gcd(long long a, long long b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n inline long long lcm(long long a, long long b) { return a * b / gcd(a, b); }\n long long n, k, x, type(1), amt, box;\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cin >> n >> k;\n for (int i = 1; i <= k; i++) {\n cin >> x;\n if (x * (n / x) > amt) {\n amt = x * (n / x);\n box = n / x;\n type = i;\n }\n }\n cout << type << << box << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n void debug_out() { cerr << endl; }\n void clock_out() {\n cerr << \nTime Elapsed : << 1.0 * clock() / CLOCKS_PER_SEC << s\n ;\n }\n void fileio() {\n freopen( /home/dwai/Desktop/cp/input.txt , r , stdin);\n freopen( /home/dwai/Desktop/cp/output.txt , w , stdout);\n freopen( /home/dwai/Desktop/cp/debug.txt , w , stderr);\n }\n void ofileio() {\n freopen( input.txt , r , stdin);\n freopen( output.txt , w , stdout);\n }\n template \n void debug_out(Head H, Tail... T) {\n cerr << << H;\n debug_out(T...);\n }\n int IT_MAX = 1 << 20;\n const long long MOD = 1000000007;\n const int INF = 0x3f3f3f3f;\n const long long LL_INF = 0x3f3f3f3f3f3f3f3f;\n const double PI = acos(-1);\n const double ERR = 1e-10;\n int main() {\n 42;\n ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n srand(time(NULL));\n long long n, m;\n cin >> n >> m;\n long long a[n], b[m];\n long long i;\n long long mn = 0, mx = 0;\n for (i = 0; i < n; i++) {\n cin >> a[i];\n if (i == 0) {\n mx = a[i];\n mn = a[i];\n } else\n mx = max(mx, a[i]);\n mn = min(mn, a[i]);\n }\n long long ans = mn * 2;\n for (i = 0; i < n; i++) {\n if (a[i] > ans) ans = a[i];\n }\n for (i = 0; i < m; i++) {\n cin >> b[i];\n if (b[i] <= ans) return cout << -1, 0;\n }\n cout << ans;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int N, K;\n int T[200005];\n vector danger;\n vector > v;\n bool cf(pair x, pair y) {\n return x.second * y.first > y.second * x.first;\n }\n int main() {\n scanf( %d %d , &N, &K);\n for (int i = 0; i < N; i++) {\n scanf( %d , &T[i]);\n if (T[i] < 0) {\n danger.push_back(i);\n }\n }\n if (danger.size() > K)\n puts( -1 );\n else {\n int change = danger.size() * 2;\n K -= danger.size();\n for (int i = 0; i < (int)danger.size(); i++) {\n if (i == danger.size() - 1)\n v.push_back(make_pair(N - danger[i] - 1, 1));\n else\n v.push_back(make_pair(danger[i + 1] - danger[i] - 1, 2));\n }\n sort(v.begin(), v.end(), cf);\n int idx = 0;\n while (idx < v.size()) {\n if (K - v[idx].first >= 0) {\n K -= v[idx].first;\n change -= v[idx].second;\n }\n idx++;\n }\n printf( %d\n , change);\n }\n return 0;\n }\n "} @@ -1759,7 +1759,7 @@ {"func_code_string": "#include \n #pragma comment(linker, /STACK:167772160000 )\n using namespace std;\n long long dp[5100][5100];\n long long x[5100];\n int a[5100], b[5100], c[5100], d[5100];\n int main() {\n int leftminright = 0;\n int n, s, e;\n cin >> n >> s >> e;\n s--;\n e--;\n for (int i = 0; i < n; i++) cin >> x[i];\n for (int i = 0; i < n; i++) cin >> a[i];\n for (int i = 0; i < n; i++) cin >> b[i];\n for (int i = 0; i < n; i++) cin >> c[i];\n for (int i = 0; i < n; i++) cin >> d[i];\n x[n] = 0;\n for (int i = 0; i < n + 2; i++)\n for (int j = 0; j < n + 2; j++) dp[i][j] = 1E18;\n dp[0][0] = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (i != 0) {\n if (j == 0 && leftminright != 1) continue;\n }\n if (i == s) {\n leftminright--;\n long long now = dp[i][j];\n now += d[i];\n dp[i + 1][j + 1] =\n min(dp[i + 1][j + 1],\n now + (x[i + 1] - x[i]) * ((j + 1) * 2 + leftminright));\n now -= d[i];\n now += c[i];\n if (j + leftminright + 1 > 0)\n dp[i + 1][j] = min(dp[i + 1][j],\n now + (x[i + 1] - x[i]) * (j * 2 + leftminright));\n leftminright++;\n continue;\n }\n if (i == e) {\n leftminright++;\n long long now = dp[i][j];\n now += b[i];\n dp[i + 1][j] =\n min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright));\n now -= b[i];\n now += a[i];\n if (j == 0) {\n leftminright--;\n continue;\n }\n dp[i + 1][j - 1] =\n min(dp[i + 1][j - 1],\n now + (x[i + 1] - x[i]) * (2 * (j - 1) + leftminright));\n leftminright--;\n continue;\n }\n long long now = dp[i][j];\n now += b[i];\n now += d[i];\n dp[i + 1][j + 1] =\n min(dp[i + 1][j + 1],\n now + (x[i + 1] - x[i]) * ((j + 1) * 2 + leftminright));\n now -= d[i];\n now += c[i];\n if (j + leftminright > 0)\n dp[i + 1][j] =\n min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright));\n now -= b[i];\n now += a[i];\n now -= c[i];\n now += d[i];\n if (j > 0)\n dp[i + 1][j] =\n min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright));\n now -= d[i];\n now += c[i];\n if (j > 0 && j + leftminright > 0)\n dp[i + 1][j - 1] =\n min(dp[i + 1][j - 1],\n now + (x[i + 1] - x[i]) * ((j - 1) * 2 + leftminright));\n }\n if (i == s) leftminright--;\n if (i == e) leftminright++;\n }\n cout << dp[n][0];\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const double PI = acos(-1.0);\n const double EPS = 1e-8;\n const long long INF = 0x3f3f3f3f3f3f3f3f;\n inline long long readll() {\n long long x(0), op(1);\n char ch = getchar();\n while (ch < '0' || ch > '9') {\n if (ch == '-') op = -1;\n ch = getchar();\n }\n while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();\n return x * op;\n }\n const int sz = 2e5 + 9;\n long long a[sz], n;\n long long solve(long long a, long long b) {\n if (a == 0 || a == b) return 0;\n int l = 1, r = n;\n if (b) {\n if (b < a)\n l = b + 1;\n else\n r = b - 1;\n }\n return (a - l + 1) * (r - a + 1);\n }\n int main() {\n n = readll();\n for (int i = 1; i < n + 1; ++i) a[i] = readll();\n a[0] = a[n + 1] = 0;\n long long ans = 0;\n for (int i = 0; i < n + 1; ++i) {\n ans += solve(a[i], a[i + 1]);\n ans += solve(a[i + 1], a[i]);\n }\n cout << ans / 2 << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int max_n = 200222, inf = 1000111222;\n int n, m, a[max_n];\n bool check(int cnt) {\n long long sum = 0;\n int last = 1;\n for (int i = 0; i < n; ++i) {\n if (i % cnt == 0) --last;\n if (a[i] + last < 0) break;\n sum += (a[i] + last);\n }\n return sum >= m;\n }\n int main() {\n scanf( %d%d , &n, &m);\n for (int i = 0; i < n; ++i) scanf( %d , &a[i]);\n sort(a, a + n);\n reverse(a, a + n);\n int l = 0, r = n + 1;\n while (r - l > 1) {\n int mid = (l + r) / 2;\n if (check(mid))\n r = mid;\n else\n l = mid;\n }\n if (r > n)\n puts( -1 );\n else\n printf( %d\n , r);\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n long long t[4 * 100100], dp[100100], a[100100], b[100100];\n long long K = 1, n, m;\n void build() {\n while (K < m + 2) K <<= 1;\n }\n long long query(long long l, long long r) {\n long long ans = 0;\n for (l += K - 1, r += K + 1; l ^ r ^ 1; l >>= 1, r >>= 1) {\n if (~l ^ 1) ans = ((ans) >= (t[l + 1]) ? (ans) : (t[l + 1]));\n if (r ^ 1) ans = ((ans) >= (t[r - 1]) ? (ans) : (t[r - 1]));\n }\n return ans;\n }\n void update(long long id, long long v) {\n for (t[id += K] = v, id >>= 1; id >= 1; id >>= 1)\n t[id] = max(t[id << 1 | 1], t[id << 1]);\n }\n long long get_id(long long x) {\n long long l = 1, r = m, mid;\n while (l < r) {\n mid = (l + r + 1) >> 1;\n if (b[mid] > x)\n r = mid - 1;\n else\n l = mid;\n }\n return l;\n }\n void unique() {\n m = 1;\n for (long long i = 2; i <= n; i++)\n if (b[i] != b[m]) b[++m] = b[i];\n }\n void input() {\n scanf( %I64d , &n);\n for (long long i = 1, r, h; i <= n; i++) {\n scanf( %I64d%I64d , &r, &h);\n a[i] = b[i] = r * r * h;\n }\n return;\n }\n void init() {\n sort(b + 1, b + n + 1);\n unique();\n build();\n return;\n }\n void work() {\n for (long long i = 1; i <= n; i++) {\n long long id = get_id(a[i]);\n dp[i] = query(1, id - 1) + a[i];\n update(id, dp[i]);\n }\n return;\n }\n void output() {\n printf( %.15lf , query(1, m) * M_PI);\n return;\n }\n int main() {\n input();\n init();\n work();\n output();\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long t[4 * 100100], dp[100100], a[100100], b[100100];\n long long K = 1, n, m;\n void build() {\n while (K < m + 2) K <<= 1;\n }\n long long query(long long l, long long r) {\n long long ans = 0;\n for (l += K - 1, r += K + 1; l ^ r ^ 1; l >>= 1, r >>= 1) {\n if (~l ^ 1) ans = ((ans) >= (t[l + 1]) ? (ans) : (t[l + 1]));\n if (r ^ 1) ans = ((ans) >= (t[r - 1]) ? (ans) : (t[r - 1]));\n }\n return ans;\n }\n void update(long long id, long long v) {\n for (t[id += K] = v, id >>= 1; id >= 1; id >>= 1)\n t[id] = max(t[id << 1 | 1], t[id << 1]);\n }\n long long get_id(long long x) {\n long long l = 1, r = m, mid;\n while (l < r) {\n mid = (l + r + 1) >> 1;\n if (b[mid] > x)\n r = mid - 1;\n else\n l = mid;\n }\n return l;\n }\n void unique() {\n m = 1;\n for (long long i = 2; i <= n; i++)\n if (b[i] != b[m]) b[++m] = b[i];\n }\n void input() {\n scanf( extra , &n);\n for (long long i = 1, r, h; i <= n; i++) {\n scanf( extraextra , &r, &h);\n a[i] = b[i] = r * r * h;\n }\n return;\n }\n void init() {\n sort(b + 1, b + n + 1);\n unique();\n build();\n return;\n }\n void work() {\n for (long long i = 1; i <= n; i++) {\n long long id = get_id(a[i]);\n dp[i] = query(1, id - 1) + a[i];\n update(id, dp[i]);\n }\n return;\n }\n void output() {\n printf( %.15lf , query(1, m) * M_PI);\n return;\n }\n int main() {\n input();\n init();\n work();\n output();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, k, c[100005], visit[100005], tp = 0;\n vector a[100005], ans;\n bool ok[100005];\n void dfs(int u) {\n visit[u] = tp;\n for (int i = 0; i < a[u].size(); i++) {\n int v = a[u][i];\n if (ok[v]) continue;\n if (visit[v] == tp) {\n cout << -1;\n exit(0);\n } else\n dfs(v);\n }\n ans.push_back(u);\n ok[u] = 1;\n }\n int main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cin >> n >> k;\n for (int i = 1; i <= k; i++) cin >> c[i];\n for (int i = 1; i <= n; i++) {\n int t;\n cin >> t;\n while (t--) {\n int u;\n cin >> u;\n a[i].push_back(u);\n }\n }\n for (int i = 1; i <= k; i++) {\n if (!visit[c[i]]) {\n tp++;\n dfs(c[i]);\n }\n }\n cout << ans.size() << '\n';\n for (int i = 0; i < ans.size(); i++) cout << ans[i] << ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long int n;\n cin >> n;\n long long int sum = n * (n - 1) / 2;\n if (n == 0) {\n cout << 0;\n return 0;\n }\n if ((n % 2 == 0 && n % 4 != 0) || (n % 2 == 1 && n % 4 != 3))\n cout << 1;\n else\n cout << 0;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n ostream &operator<<(ostream &os, const pair &p) {\n return os << ( << p.first << , << p.second << ) ;\n }\n template \n ostream &operator<<(ostream &os, const vector &v) {\n os << { ;\n typename vector::const_iterator it;\n for (it = v.begin(); it != v.end(); it++) {\n if (it != v.begin()) os << , ;\n os << *it;\n }\n return os << } ;\n }\n template \n ostream &operator<<(ostream &os, const set &v) {\n os << [ ;\n typename set::const_iterator it;\n for (it = v.begin(); it != v.end(); it++) {\n if (it != v.begin()) os << , ;\n os << *it;\n }\n return os << ] ;\n }\n template \n ostream &operator<<(ostream &os, const map &v) {\n os << [ ;\n typename map::const_iterator it;\n for (it = v.begin(); it != v.end(); it++) {\n if (it != v.begin()) os << , ;\n os << it->first << = << it->second;\n }\n return os << ] ;\n }\n int n, m;\n string hor, ver;\n int give_dir(char ch) {\n if (ch == '>' || ch == 'v')\n return 1;\n else\n return -1;\n }\n bool valid(int x, int y) {\n if (x < 0 || y < 0 || x >= n || y >= m) return false;\n return true;\n }\n void dfs(int x, int y, vector > &visited) {\n visited[x][y] = true;\n int nx, ny;\n nx = x + give_dir(ver[y]);\n ny = y + give_dir(hor[x]);\n if (valid(nx, y) && !visited[nx][y]) dfs(nx, y, visited);\n if (valid(x, ny) && !visited[x][ny]) dfs(x, ny, visited);\n }\n int main() {\n cin >> n >> m;\n cin >> hor >> ver;\n for (int k = 0; k < (n); k++) {\n for (int l = 0; l < (m); l++) {\n vector > visited(n, vector(m, false));\n dfs(k, l, visited);\n for (int i = 0; i < (n); i++) {\n for (int j = 0; j < (m); j++) {\n if (!visited[i][j]) {\n cout << NO << endl;\n return 0;\n }\n }\n }\n }\n }\n cout << YES << endl;\n return 0;\n }\n "} @@ -1799,8 +1799,8 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n ;\n long long n, k, i;\n cin >> n >> k;\n vector > v;\n long long a[n], b[n];\n long long x, y;\n for (i = 0; i < n; i++) cin >> a[i];\n for (i = 0; i < n; i++) cin >> b[i];\n for (i = 0; i < n; i++) {\n x = a[i] - b[i];\n v.push_back(make_pair(x, i));\n }\n sort(v.begin(), v.end());\n i = 0;\n y = 0;\n while (i < n) {\n if (i < k || v[i].first <= 0)\n y = y + a[v[i].second];\n else if (i >= k && v[i].first > 0)\n break;\n ++i;\n }\n while (i < n) {\n y = y + b[v[i].second];\n ++i;\n }\n cout << y;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long s, x;\n cin >> s >> x;\n long long ans = __builtin_popcountll(x);\n ans = 1LL << ans;\n if (s == x) ans -= 2;\n for (int i = 0; i < 60; i++) {\n if (x & (1LL << i)) s -= 1LL << i;\n }\n for (int i = 0; i < 60; i++) {\n int j = i + 1;\n if ((s & (1LL << j)) && !(x & (1LL << i))) s -= 1LL << j;\n }\n if (s != 0)\n puts( 0 );\n else\n cout << ans << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, tmp;\n bool ok = 1;\n int ar[5];\n memset(ar, 0, sizeof(ar));\n scanf( %d , &n);\n for (int i = 0; i < n; ++i) {\n scanf( %d , &tmp);\n tmp /= 25;\n if (!ok) continue;\n if (tmp == 1) {\n ar[1]++;\n } else if (tmp == 2) {\n if (ar[1] > 0) {\n ar[1]--;\n ar[2]++;\n } else\n ok = 0;\n } else if (tmp == 4) {\n if (ar[1] > 0 && ar[2] > 0) {\n ar[1]--;\n ar[2]--;\n ar[4]++;\n } else if (ar[1] > 2) {\n ar[1] -= 3;\n ar[4]++;\n } else\n ok = 0;\n }\n }\n if (ok)\n cout << YES << endl;\n else\n cout << NO << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n struct Que {\n int a, b, w;\n } Q[300010];\n bool operator<(Que a, Que b) { return a.b < b.b; }\n int n, i, m, Lim, j;\n long long ans[301000], w[301000], s[301000];\n int main() {\n scanf( %d , &n);\n for (i = 0; i < n; i++) scanf( %I64d , &w[i]);\n scanf( %d , &m);\n for (i = 0; i < m; i++) scanf( %d%d , &Q[i].a, &Q[i].b), Q[i].a--, Q[i].w = i;\n sort(Q, Q + m);\n Lim = (int)sqrt(n);\n for (i = 0; i < m; i++) {\n if (Q[i].b > Lim) {\n long long tmp = 0;\n for (j = Q[i].a; j < n; j += Q[i].b) tmp += w[j];\n ans[Q[i].w] = tmp;\n } else {\n memset(s, 0, sizeof(s));\n for (j = n - 1; j >= 0; j--) s[j] = w[j] + s[j + Q[i].b];\n j = i;\n do {\n ans[Q[j].w] = s[Q[j].a];\n j++;\n } while (Q[j].b == Q[j - 1].b);\n i = j - 1;\n }\n }\n for (i = 0; i < m; i++) printf( %I64d\n , ans[i]);\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const long long maxn = 1000000 + 5;\n const long long DIFF = 2000;\n const long long mod = 1000000000 + 7;\n long long dp[DIFF + 5][DIFF + 5];\n char s[maxn];\n int main() {\n dp[0][0] = 1;\n for (int i = 1; i <= DIFF; dp[i][0] = dp[i - 1][1], i++)\n for (int j = 1; j <= i; j++)\n dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j + 1]) % mod;\n long long n, m;\n scanf( %I64d%I64d%s , &n, &m, s);\n long long len = strlen(s), diff = 0, Min = 0, ans = 0;\n for (long long i = 0; i < len; i++) {\n diff += (s[i] == '(' ? 1 : -1);\n Min = min(Min, diff);\n }\n for (long long i = 0; i <= n - m; i++)\n for (long long j = 0; j <= i; j++)\n if (j + Min >= 0 && j + diff >= 0 && j + diff <= n - m)\n ans = (ans + (dp[i][j] * dp[n - m - i][j + diff]) % mod) % mod;\n printf( %I64d\n , ans);\n }\n "} +{"func_code_string": "#include \n using namespace std;\n struct Que {\n int a, b, w;\n } Q[300010];\n bool operator<(Que a, Que b) { return a.b < b.b; }\n int n, i, m, Lim, j;\n long long ans[301000], w[301000], s[301000];\n int main() {\n scanf( %d , &n);\n for (i = 0; i < n; i++) scanf( extra , &w[i]);\n scanf( %d , &m);\n for (i = 0; i < m; i++) scanf( %d%d , &Q[i].a, &Q[i].b), Q[i].a--, Q[i].w = i;\n sort(Q, Q + m);\n Lim = (int)sqrt(n);\n for (i = 0; i < m; i++) {\n if (Q[i].b > Lim) {\n long long tmp = 0;\n for (j = Q[i].a; j < n; j += Q[i].b) tmp += w[j];\n ans[Q[i].w] = tmp;\n } else {\n memset(s, 0, sizeof(s));\n for (j = n - 1; j >= 0; j--) s[j] = w[j] + s[j + Q[i].b];\n j = i;\n do {\n ans[Q[j].w] = s[Q[j].a];\n j++;\n } while (Q[j].b == Q[j - 1].b);\n i = j - 1;\n }\n }\n for (i = 0; i < m; i++) printf( extra\n , ans[i]);\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const long long maxn = 1000000 + 5;\n const long long DIFF = 2000;\n const long long mod = 1000000000 + 7;\n long long dp[DIFF + 5][DIFF + 5];\n char s[maxn];\n int main() {\n dp[0][0] = 1;\n for (int i = 1; i <= DIFF; dp[i][0] = dp[i - 1][1], i++)\n for (int j = 1; j <= i; j++)\n dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j + 1]) % mod;\n long long n, m;\n scanf( extraextra%s , &n, &m, s);\n long long len = strlen(s), diff = 0, Min = 0, ans = 0;\n for (long long i = 0; i < len; i++) {\n diff += (s[i] == '(' ? 1 : -1);\n Min = min(Min, diff);\n }\n for (long long i = 0; i <= n - m; i++)\n for (long long j = 0; j <= i; j++)\n if (j + Min >= 0 && j + diff >= 0 && j + diff <= n - m)\n ans = (ans + (dp[i][j] * dp[n - m - i][j + diff]) % mod) % mod;\n printf( extra\n , ans);\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int x, y, a, b, i, c = 0, j = 0;\n cin >> x >> y;\n a = 240 - y;\n for (i = 1; c <= a; i++) {\n c = c + (5 * i);\n j++;\n }\n if (j - 1 <= x) {\n cout << j - 1 << endl;\n } else {\n cout << x << endl;\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long mx = (1 << 22);\n long long f[mx], ans[mx];\n int32_t main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n ;\n long long n;\n cin >> n;\n long long a[n];\n for (long long i = 0; i < n; i++) cin >> a[i];\n memset(ans, -1, sizeof(ans));\n for (long long i = 0; i < n; i++) {\n f[a[i]]++;\n ans[a[i]] = a[i];\n }\n for (long long j = 0; j < 22; j++)\n for (long long i = 0; i < mx; i++)\n if (i & (1 << j)) {\n f[i] += f[i ^ (1 << j)];\n if (f[i ^ (1 << j)]) ans[i] = ans[i ^ (1 << j)];\n }\n for (long long i = 0; i < n; i++) {\n long long p = (mx - 1) & (~a[i]);\n cout << ans[p] << ;\n }\n cout << '\n';\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int mod = 1e9 + 7;\n struct node {\n int x, y, c;\n } s[2005], tmp[2005];\n int n, k, l, cx, cy;\n int lx[2005], ly[2005], bk[2005];\n multiset t[2005];\n namespace Tree {\n int mn[8005], mx[8005], sum[8005], lzy[8005];\n inline void pushtag(int p, int l, int r, int val) {\n mx[p] = mn[p] = lzy[p] = val;\n sum[p] = 1ll * (ly[r + 1] - ly[l]) * val % mod;\n }\n inline void down(int p, int l, int mid, int r) {\n pushtag(p << 1, l, mid, lzy[p]);\n pushtag(p << 1 | 1, mid + 1, r, lzy[p]);\n lzy[p] = -1;\n }\n void insert(int p, int id, int val, int l, int r) {\n if (l == r)\n return mx[p] = mn[p] = val,\n sum[p] = 1ll * (ly[id + 1] - ly[id]) * val % mod, void();\n const int mid = l + r >> 1;\n if (id <= mid)\n insert(p << 1, id, val, l, mid);\n else\n insert(p << 1 | 1, id, val, mid + 1, r);\n mn[p] = min(mn[p << 1], mn[p << 1 | 1]);\n mx[p] = max(mx[p << 1], mx[p << 1 | 1]);\n sum[p] = (sum[p << 1] + sum[p << 1 | 1]) % mod;\n }\n void qmin(int p, int val, int l, int r, int L, int R) {\n if (L >= l && R <= r) {\n if (mx[p] <= val)\n return;\n else if (mn[p] >= val)\n pushtag(p, L, R, val);\n else {\n const int mid = L + R >> 1;\n if (~lzy[p]) down(p, L, mid, R);\n qmin(p << 1, val, l, r, L, mid);\n qmin(p << 1 | 1, val, l, r, mid + 1, R);\n mn[p] = min(mn[p << 1], mn[p << 1 | 1]);\n mx[p] = max(mx[p << 1], mx[p << 1 | 1]);\n sum[p] = (sum[p << 1] + sum[p << 1 | 1]) % mod;\n }\n return;\n }\n const int mid = L + R >> 1;\n if (~lzy[p]) down(p, L, mid, R);\n if (l <= mid) qmin(p << 1, val, l, r, L, mid);\n if (r > mid) qmin(p << 1 | 1, val, l, r, mid + 1, R);\n mn[p] = min(mn[p << 1], mn[p << 1 | 1]);\n mx[p] = max(mx[p << 1], mx[p << 1 | 1]);\n sum[p] = (sum[p << 1] + sum[p << 1 | 1]) % mod;\n }\n } // namespace Tree\n int main() {\n scanf( %d%d%d , &n, &k, &l);\n lx[++cx] = 0;\n ly[++cy] = 0;\n lx[++cx] = l + 1;\n ly[++cy] = l + 1;\n int ans = 0;\n for (int i = 1; i <= n; ++i)\n scanf( %d%d%d , &s[i].x, &s[i].y, &s[i].c), lx[++cx] = ++s[i].x,\n ly[++cy] = ++s[i].y;\n sort(lx + 1, lx + cx + 1);\n cx = unique(lx + 1, lx + cx + 1) - lx - 1;\n sort(ly + 1, ly + cy + 1);\n cy = unique(ly + 1, ly + cy + 1) - ly - 1;\n for (int i = 1; i <= n; ++i)\n s[i].x = lower_bound(lx + 1, lx + cx + 1, s[i].x) - lx,\n s[i].y = lower_bound(ly + 1, ly + cy + 1, s[i].y) - ly, tmp[i] = s[i];\n sort(s + 1, s + n + 1,\n [](const node &a, const node &b) { return a.x < b.x; });\n sort(tmp + 1, tmp + n + 1,\n [](const node &a, const node &b) { return a.y < b.y; });\n for (int u = 1; u < cx; ++u) {\n memset(bk, 0, sizeof(bk));\n memset(Tree::lzy, -1, sizeof(Tree::lzy));\n for (int i = 1, j = 1, p = 1, cnt = 0; i < cy; ++i) {\n while (j <= n && tmp[j].y <= i) {\n if (tmp[j].x <= u)\n ++j;\n else {\n if (!bk[tmp[j].c]) ++cnt;\n ++bk[tmp[j++].c];\n }\n }\n while (cnt == k) {\n if (tmp[p].x <= u)\n ++p;\n else {\n --bk[tmp[p].c];\n if (!bk[tmp[p++].c]) --cnt;\n }\n }\n Tree::insert(1, i, ly[tmp[p - 1].y], 1, cy - 1);\n }\n for (int i = 1; i <= k; ++i) t[i].clear();\n for (int i = 1; i <= n; ++i)\n if (s[i].x > u) t[s[i].c].insert(s[i].y);\n for (int d = cx - 1, i = n; d > u; --d) {\n (ans += 1ll * (lx[d + 1] - lx[d]) * (lx[u + 1] - lx[u]) % mod *\n Tree::sum[1] % mod) %= mod;\n while (i && s[i].x >= d) {\n auto it = t[s[i].c].find(s[i].y);\n int pre = it == t[s[i].c].begin() ? 0 : *prev(it);\n int nxt = next(it) == t[s[i].c].end() ? cy : *next(it);\n t[s[i].c].erase(it);\n if (s[i].y < nxt) Tree::qmin(1, ly[pre], s[i].y, nxt - 1, 1, cy - 1);\n --i;\n }\n }\n }\n return printf( %d\n , ans), 0;\n }\n "} @@ -1829,7 +1829,7 @@ {"func_code_string": "#include \n using namespace std;\n template \n void CIN(T &a) {\n cin >> a;\n }\n template \n void CIN(T &a, T &b) {\n cin >> a >> b;\n }\n template \n void CIN(T &a, T &b, T &c) {\n cin >> a >> b >> c;\n }\n template \n void CIN(T &a, T &b, T &c, T &d) {\n cin >> a >> b >> c >> d;\n }\n template \n void PI(T a) {\n cout << a << endl;\n }\n template \n void PI(T a, T b) {\n cout << a << << b << endl;\n }\n template \n void PIS(T a) {\n cout << a << ;\n }\n template \n T abs(T a) {\n return a < 0 ? -a : a;\n }\n const int N = 10000010;\n long long n, x, y, dx, dy, t;\n int b[6][6] = {{2, 1, 1, 0, 1, 0}, {1, 2, 0, 1, 1, 0}, {1, 1, 1, 0, 1, 0},\n {1, 1, 0, 1, 1, 0}, {0, 0, 0, 0, 1, 1}, {0, 0, 0, 0, 0, 1}};\n struct matrix {\n long long a[6][6];\n matrix() { memset(a, 0, sizeof(a)); }\n void init() {\n int i, j;\n for (i = 0; i < (int)(6); ++i)\n for (j = 0; j < (int)(6); ++j) a[i][j] = b[i][j];\n }\n void unit() {\n memset(a, 0, sizeof(a));\n int i;\n for (i = 0; i < (int)(6); ++i) a[i][i] = 1;\n }\n matrix operator*(const matrix &b) const {\n matrix ret;\n int i, j, k;\n for (i = 0; i < (int)(6); ++i)\n for (j = 0; j < (int)(6); ++j)\n for (k = 0; k < (int)(6); ++k) {\n ret.a[i][j] += a[i][k] * b.a[k][j];\n ret.a[i][j] %= n;\n }\n return ret;\n }\n matrix Pow(long long k) {\n matrix ret, p = *this;\n ret.unit();\n while (k) {\n if (k & 1) ret = ret * p;\n k >>= 1;\n p = p * p;\n }\n return ret;\n }\n } mx;\n int main() {\n CIN(n);\n CIN(x, y, dx, dy);\n CIN(t);\n mx.init();\n mx = mx.Pow(t);\n long long ex = mx.a[0][0] * x + mx.a[0][1] * y + mx.a[0][2] * dx +\n mx.a[0][3] * dy + mx.a[0][5];\n long long ey = mx.a[1][0] * x + mx.a[1][1] * y + mx.a[1][2] * dx +\n mx.a[1][3] * dy + mx.a[1][5];\n ex %= n;\n if (ex <= 0) ex += n;\n ey %= n;\n if (ey <= 0) ey += n;\n PI(ex, ey);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int a, b, c;\n cin >> a >> b >> c;\n int max = 0;\n int n[100];\n n[0] = a * b + c, n[1] = a * b * c, n[2] = a + b * c, n[3] = a + b + c,\n n[4] = a * (b + c), n[5] = (a + b) * c;\n for (int i = 0; i < 6; i++) {\n if (n[i] > max) max = n[i];\n }\n cout << max << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n \n typedef long long Int;\n typedef pair PII;\n typedef vector VInt;\n \n #define FOR(i, a, b) for(i = (a); i < (b); ++i)\n #define RFOR(i, a, b) for(i = (a) - 1; i >= (b); --i)\n #define EACH(it, a) for(auto it = (a).begin(); it != (a).end(); ++it)\n #define CLEAR(a, b) memset(a, b, sizeof(a))\n #define SIZE(a) int((a).size())\n #define ALL(a) (a).begin(),(a).end()\n #define MP make_pair\n \n int f(VInt p, VInt s)\n {\n int n = SIZE(p);\n int left = 0, right = n - 1;\n int res = 0;\n VInt used(n, 0);\n while(left < right)\n {\n int cnt = 0;\n int flips = 0;\n int l = left;\n int r = right + 1;\n while(l >= left || r <= right)\n {\n if(l >= left)\n {\n int a = left;\n ++left;\n if(used[a] == 0)\n {\n int b = p[a];\n used[a] = used[b] = 1;\n ++cnt;\n flips += s[a];\n if(b > r) return -1;\n r = b;\n if(l >= r) return -1;\n }\n }\n if(r <= right)\n {\n int a = right;\n --right;\n if(used[a] == 0)\n {\n int b = p[a];\n used[a] = used[b] = 1;\n ++cnt;\n flips += s[a];\n if(b < l) return -1;\n l = b;\n if(l >= r) return -1;\n }\n }\n }\n res += min(flips, cnt - flips);\n }\n return res;\n }\n \n void SolveTest(int test)\n {\n int n;\n cin >> n;\n int i, j;\n VInt p(n + n);\n VInt s(n + n);\n FOR(i, 0, n)\n {\n int a, b;\n cin >> a >> b;\n --a;\n --b;\n p[a] = b;\n p[b] = a;\n s[a] = 0;\n s[b] = 1;\n }\n \n cout << f(p, s) << endl;\n }\n \n int main()\n {\n int T, t;\n T = 1;\n //cin >> T;\n FOR(t, 0, T) SolveTest(t);\n return 0;\n };"} -{"func_code_string": "#include \n using namespace std;\n const int N = 55;\n const int MOD = 1e9 + 7;\n struct Node {\n int op, x, y, d;\n Node() {}\n Node(int _op, int _x, int _y, int _d) { op = _op, x = _x, y = _y, d = _d; }\n bool operator<(const Node &cur) const { return d > cur.d; }\n };\n priority_queue que;\n int dist[2][N][N], n, m, nx, ny;\n long long ans[2][N][N], C[N][N];\n void init() {\n int i, j;\n memset(C, 0, sizeof(C));\n for (i = 0; i < N; i++) {\n C[i][0] = 1;\n for (j = 1; j <= i; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;\n }\n }\n int main() {\n int i, j, tmp;\n init();\n while (scanf( %d%d , &n, &m) != EOF) {\n for (i = 1, nx = ny = 0; i <= n; i++) {\n scanf( %d , &tmp);\n if (tmp == 50)\n nx++;\n else\n ny++;\n }\n memset(dist, 0x3f, sizeof(dist));\n memset(ans, 0, sizeof(ans));\n while (!que.empty()) que.pop();\n dist[1][0][0] = 0;\n ans[1][0][0] = 1;\n que.push(Node(1, 0, 0, 0));\n while (!que.empty()) {\n Node cur = que.top();\n que.pop();\n if (cur.d > dist[cur.op][cur.x][cur.y]) continue;\n for (i = 0; i <= nx; i++)\n for (j = 0; j <= ny; j++) {\n if (i + j == 0 || 50 * i + 100 * j > m) continue;\n if (cur.op == 0 && cur.x >= i && cur.y >= j) {\n if (dist[1][cur.x - i][cur.y - j] >= cur.d + 1) {\n if (dist[1][cur.x - i][cur.y - j] > cur.d + 1) {\n ans[1][cur.x - i][cur.y - j] = 0;\n dist[1][cur.x - i][cur.y - j] = cur.d + 1;\n que.push(Node(1, cur.x - i, cur.y - j, cur.d + 1));\n }\n ans[1][cur.x - i][cur.y - j] +=\n ans[0][cur.x][cur.y] * C[cur.x][i] % MOD * C[cur.y][j] % MOD;\n ans[1][cur.x - i][cur.y - j] %= MOD;\n }\n }\n if (cur.op == 1 && cur.x + i <= nx && cur.y + j <= ny) {\n if (dist[0][cur.x + i][cur.y + j] >= cur.d + 1) {\n if (dist[0][cur.x + i][cur.y + j] > cur.d + 1) {\n ans[0][cur.x + i][cur.y + j] = 0;\n dist[0][cur.x + i][cur.y + j] = cur.d + 1;\n que.push(Node(0, cur.x + i, cur.y + j, cur.d + 1));\n }\n ans[0][cur.x + i][cur.y + j] += ans[1][cur.x][cur.y] *\n C[nx - cur.x][i] % MOD *\n C[ny - cur.y][j] % MOD;\n ans[0][cur.x + i][cur.y + j] %= MOD;\n }\n }\n }\n }\n if (dist[0][nx][ny] == 0x3f3f3f3f) {\n printf( -1\n0\n );\n } else {\n printf( %d\n%I64d\n , dist[0][nx][ny], ans[0][nx][ny]);\n }\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int N = 55;\n const int MOD = 1e9 + 7;\n struct Node {\n int op, x, y, d;\n Node() {}\n Node(int _op, int _x, int _y, int _d) { op = _op, x = _x, y = _y, d = _d; }\n bool operator<(const Node &cur) const { return d > cur.d; }\n };\n priority_queue que;\n int dist[2][N][N], n, m, nx, ny;\n long long ans[2][N][N], C[N][N];\n void init() {\n int i, j;\n memset(C, 0, sizeof(C));\n for (i = 0; i < N; i++) {\n C[i][0] = 1;\n for (j = 1; j <= i; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;\n }\n }\n int main() {\n int i, j, tmp;\n init();\n while (scanf( %d%d , &n, &m) != EOF) {\n for (i = 1, nx = ny = 0; i <= n; i++) {\n scanf( %d , &tmp);\n if (tmp == 50)\n nx++;\n else\n ny++;\n }\n memset(dist, 0x3f, sizeof(dist));\n memset(ans, 0, sizeof(ans));\n while (!que.empty()) que.pop();\n dist[1][0][0] = 0;\n ans[1][0][0] = 1;\n que.push(Node(1, 0, 0, 0));\n while (!que.empty()) {\n Node cur = que.top();\n que.pop();\n if (cur.d > dist[cur.op][cur.x][cur.y]) continue;\n for (i = 0; i <= nx; i++)\n for (j = 0; j <= ny; j++) {\n if (i + j == 0 || 50 * i + 100 * j > m) continue;\n if (cur.op == 0 && cur.x >= i && cur.y >= j) {\n if (dist[1][cur.x - i][cur.y - j] >= cur.d + 1) {\n if (dist[1][cur.x - i][cur.y - j] > cur.d + 1) {\n ans[1][cur.x - i][cur.y - j] = 0;\n dist[1][cur.x - i][cur.y - j] = cur.d + 1;\n que.push(Node(1, cur.x - i, cur.y - j, cur.d + 1));\n }\n ans[1][cur.x - i][cur.y - j] +=\n ans[0][cur.x][cur.y] * C[cur.x][i] % MOD * C[cur.y][j] % MOD;\n ans[1][cur.x - i][cur.y - j] %= MOD;\n }\n }\n if (cur.op == 1 && cur.x + i <= nx && cur.y + j <= ny) {\n if (dist[0][cur.x + i][cur.y + j] >= cur.d + 1) {\n if (dist[0][cur.x + i][cur.y + j] > cur.d + 1) {\n ans[0][cur.x + i][cur.y + j] = 0;\n dist[0][cur.x + i][cur.y + j] = cur.d + 1;\n que.push(Node(0, cur.x + i, cur.y + j, cur.d + 1));\n }\n ans[0][cur.x + i][cur.y + j] += ans[1][cur.x][cur.y] *\n C[nx - cur.x][i] % MOD *\n C[ny - cur.y][j] % MOD;\n ans[0][cur.x + i][cur.y + j] %= MOD;\n }\n }\n }\n }\n if (dist[0][nx][ny] == 0x3f3f3f3f) {\n printf( -1\n0\n );\n } else {\n printf( %d\nextra\n , dist[0][nx][ny], ans[0][nx][ny]);\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n bool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n }\n template \n bool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n }\n template \n ostream &operator<<(ostream &os, const vector &t) {\n os << [ ;\n for (__typeof((t).begin()) it = (t).begin(); it != (t).end(); it++) {\n if (it != t.begin()) os << , ;\n os << *it;\n }\n os << ] ;\n return os;\n }\n template \n ostream &operator<<(ostream &os, const set &t) {\n os << { ;\n for (__typeof((t).begin()) it = (t).begin(); it != (t).end(); it++) {\n if (it != t.begin()) os << , ;\n os << *it;\n }\n os << } ;\n return os;\n }\n template \n ostream &operator<<(ostream &os, const pair &t) {\n return os << ( << t.first << , << t.second << ) ;\n }\n template \n pair operator+(const pair &s, const pair &t) {\n return pair(s.first + t.first, s.second + t.second);\n }\n template \n pair operator-(const pair &s, const pair &t) {\n return pair(s.first - t.first, s.second - t.second);\n }\n namespace geom {\n enum { TRUE = 1, FALSE = 0, BORDER = -1 };\n const long double INF = 1e8;\n long double EPS = 1e-6;\n const long double PI = 3.1415926535897932384626;\n inline int sig(const long double &x) {\n return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1);\n }\n inline int less(const long double &x, const long double &y) {\n return sig(x - y) ? x < y : BORDER;\n }\n inline long double norm(const complex &p) {\n return p.real() * p.real() + p.imag() * p.imag();\n }\n inline long double inp(const complex &a,\n const complex &b) {\n return (conj(a) * b).real();\n }\n inline long double outp(const complex &a,\n const complex &b) {\n return (conj(a) * b).imag();\n }\n inline complex unit(const complex &p) {\n return p / abs(p);\n }\n inline complex proj(const complex &s,\n const complex &t) {\n return t * inp(s, t) / norm(t);\n }\n inline int ccw(const complex &s, const complex &t,\n const complex &p, int adv = 0) {\n int res = sig(outp(t - s, p - s));\n if (res || !adv) return res;\n if (sig(inp(t - s, p - s)) < 0) return -2;\n if (sig(inp(s - t, p - t)) < 0) return 2;\n return 0;\n }\n } // namespace geom\n using namespace geom;\n int f = 0;\n namespace std {\n bool operator<(const complex &a, const complex &b) {\n return sig(a.real() - b.real()) ? a.real() < b.real()\n : a.imag() + EPS < b.imag();\n }\n bool operator==(const complex &a, const complex &b) {\n return abs(a - b) < EPS;\n }\n istream &operator>>(istream &is, complex &p) {\n long double x, y;\n is >> x >> y;\n p = complex(x, y);\n return is;\n }\n } // namespace std\n int n, m;\n complex p, q, v, w;\n long double vmax, ct;\n long double dist(complex v, complex wind,\n long double t) {\n if (abs(v) > EPS) v = unit(v);\n long double l = 0, r = 1e10;\n for (int _ = 0; _ < (int)(100); _++) {\n long double mid = (l + r) / 2;\n long double vx = v.real() * mid;\n long double vy = v.imag() * mid;\n if ((vx * vx + vy * vy) <= vmax * vmax)\n l = mid;\n else\n r = mid;\n }\n return abs(v * l) * t;\n }\n int check(long double t) {\n complex s =\n q + v * min(t, ct) + w * max(t - ct, 0);\n complex vec = p - s;\n return dist(vec, v, min(t, ct)) +\n dist(vec, w, max(t - ct, 0)) >=\n abs(vec);\n }\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cin >> q >> p;\n cin >> vmax >> ct;\n cin >> v >> w;\n long double l = 0, r = 1e10;\n for (int _ = 0; _ < (int)(100); _++) {\n long double mid = (l + r) / 2;\n if (check(mid))\n r = mid;\n else\n l = mid;\n }\n printf( %.20f\n , (double)l);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n;\n long long a[305], Lcm;\n long long sol(long long x) {\n long long cnt = 0;\n for (long long i = 2; i * i <= x; i++) {\n if (x % i == 0) {\n cnt += 2;\n if (i * i == x) cnt--;\n }\n }\n return cnt;\n }\n int main() {\n int T;\n cin >> T;\n while (T--) {\n int ok = 1;\n scanf( %d , &n);\n for (int i = 0; i < n; i++) scanf( %lld , &a[i]);\n sort(a, a + n);\n if (n == 1)\n Lcm = a[0] * a[0];\n else\n Lcm = a[0] * a[n - 1];\n for (int i = 1; i < (n + 1) / 2; i++) {\n if (a[i] * a[n - 1 - i] != Lcm) {\n ok = 0;\n break;\n }\n }\n if (ok && sol(Lcm) == n)\n printf( %lld\n , Lcm);\n else\n puts( -1 );\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n char ch[100001];\n int per[100001];\n bool is[100001];\n bool vis[100001];\n bool mem[100001];\n bool have[100001];\n vector V;\n int main() {\n int i, j;\n int a, b;\n int n, m;\n cin >> n >> m;\n for (i = 0; i < m; i++) {\n cin >> ch[i] >> per[i];\n have[per[i]] = true;\n }\n V.clear();\n memset(is, true, sizeof is);\n for (i = 0; i < m; i++) {\n if (ch[i] == '+') {\n if (!vis[per[i]] && i) is[per[i]] = false;\n if (V.size()) {\n is[per[i]] = false;\n } else {\n for (j = i - 1; j >= 0; j--) {\n if (per[i] != per[j]) is[per[j]] = false;\n if (mem[j]) break;\n }\n mem[i - 1] = true;\n }\n V.push_back(per[i]);\n } else {\n if (!vis[per[i]]) {\n for (j = i - 1; j >= 0; j--) {\n is[per[j]] = false;\n if (mem[j]) break;\n }\n mem[i - 1] = true;\n if (V.size()) is[per[i]] = false;\n } else if (V.size() == 1) {\n if (V[0] == per[i])\n V.clear();\n else {\n int num = per[i];\n V.erase(std::remove(V.begin(), V.end(), num), V.end());\n is[num] = false;\n }\n } else if (V.size()) {\n int num = per[i];\n V.erase(std::remove(V.begin(), V.end(), num), V.end());\n is[num] = false;\n }\n }\n if (!vis[per[i]]) vis[per[i]] = true;\n }\n vector res;\n res.clear();\n for (i = 1; i <= n; i++) {\n if (!have[i]) {\n res.push_back(i);\n } else {\n if (is[i]) res.push_back(i);\n }\n }\n int sz = res.size();\n cout << sz << endl;\n for (i = 0; i < sz; i++) cout << res[i] << ;\n return 0;\n }\n "} @@ -1851,7 +1851,7 @@ {"func_code_string": "#include \n using namespace std;\n struct group {\n int sz;\n vector worst, best;\n group(vector& a)\n : sz(1), worst(a.begin(), a.end()), best(a.begin(), a.end()) {}\n bool operator<(const group& a) const {\n for (int i = 0; i < best.size(); i++)\n if (best[i] >= a.worst[i]) return false;\n return true;\n }\n struct group& operator+=(const group& a) {\n sz += a.sz;\n for (int i = 0; i < best.size(); i++) {\n best[i] = max(best[i], a.best[i]);\n worst[i] = min(worst[i], a.worst[i]);\n }\n return *this;\n }\n };\n set positions;\n int main() {\n int n, k;\n scanf( %d %d , &n, &k);\n while (n--) {\n vector skills(k, 0);\n for (int i = 0; i < k; i++) scanf( %d , &skills[i]);\n group player = group(skills);\n auto f = positions.lower_bound(player), l = positions.upper_bound(player);\n while (f != l) {\n player += *f;\n f = positions.erase(f);\n }\n positions.insert(f, player);\n printf( %d\n , positions.rbegin()->sz);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MAXN = 1e5 + 10, STAN = (1 << 30) - 1;\n struct QJ {\n int l, r, q;\n } q[MAXN];\n int n, m;\n struct Seg {\n int water[MAXN * 4], sh[MAXN * 4];\n bool fir[MAXN * 4];\n Seg() {\n memset(water, 0, sizeof(water));\n memset(fir, 0, sizeof(fir));\n }\n int _st, _ed, _x, _t;\n void _insert(int num, int l, int r) {\n if (_st <= l && r <= _ed) {\n water[num] |= _x;\n return;\n }\n int mid = (l + r) >> 1;\n if (_st <= mid) _insert(num << 1, l, mid);\n if (_ed >= mid + 1) _insert(num << 1 | 1, mid + 1, r);\n }\n int _swim(int num, int l, int r, int now) {\n int x;\n now |= water[num];\n if (l == r) {\n if (!fir[num]) {\n sh[num] = now;\n fir[num] = true;\n } else\n sh[num] &= now;\n return now;\n }\n int mid = (l + r) >> 1;\n if (_t <= mid)\n now = _swim(num << 1, l, mid, now);\n else\n now = _swim(num << 1 | 1, mid + 1, r, now);\n if (!fir[num]) {\n sh[num] = now;\n fir[num] = true;\n } else\n sh[num] &= now;\n return now;\n }\n int _check(int num, int l, int r) {\n if (l == r) return sh[num];\n if (_st <= l && r <= _ed) return sh[num];\n int mid = (l + r) >> 1;\n int ans = STAN;\n if (_st <= mid) ans &= _check(num << 1, l, mid);\n if (_ed >= mid + 1) ans &= _check(num << 1 | 1, mid + 1, r);\n return ans;\n }\n inline void Insert(int l, int r, int q) {\n _st = l, _ed = r, _x = q;\n _insert(1, 1, n);\n }\n inline int Swim(int t) {\n _t = t;\n return _swim(1, 1, n, 0);\n }\n inline bool Check(int l, int r, int q) {\n _st = l;\n _ed = r;\n return _check(1, 1, n) == q;\n }\n } T;\n int a[MAXN];\n int main() {\n scanf( %d%d , &n, &m);\n for (int i = 1; i <= m; i++) {\n scanf( %d%d%d , &q[i].l, &q[i].r, &q[i].q);\n T.Insert(q[i].l, q[i].r, q[i].q);\n }\n for (int i = 1; i <= n; i++) a[i] = T.Swim(i);\n for (int i = 1; i <= m; i++)\n if (!T.Check(q[i].l, q[i].r, q[i].q)) {\n printf( NO\n );\n return 0;\n }\n printf( YES\n );\n for (int i = 1; i <= n; i++) printf( %d , a[i]);\n printf( \n );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n pair a[5003];\n vector color[5003];\n int ans[5003];\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n int n, k, i, j;\n cin >> n >> k;\n for (i = 0; i < n; i++) {\n cin >> a[i].first;\n a[i].second = i;\n }\n sort(a, a + n);\n for (i = 0; i < n; i++) {\n color[i % k].push_back(a[i].first);\n ans[a[i].second] = (i % k);\n }\n for (i = 0; i < k; i++) {\n for (j = 1; j < color[i].size(); j++) {\n if (color[i][j] == color[i][j - 1]) {\n cout << NO ;\n return 0;\n }\n }\n }\n cout << YES\n ;\n for (i = 0; i < n; i++) {\n cout << (ans[i] + 1) << ;\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n void enable_comma() {}\n string tostring(char c) {\n string s = ;\n s += c;\n return s;\n }\n string tostring(string s) { return \ + s + \ ; }\n string tostring(const char *c) { return tostring((string)c); }\n string tostring(long long x) {\n if (x < 0) return - + tostring(-x);\n if (x > 9)\n return tostring(x / 10) + tostring(char('0' + x % 10));\n else\n return tostring(char('0' + x));\n }\n string tostring(int x) { return tostring((long long)x); }\n string tostring(unsigned long long x) {\n if (x > 9)\n return tostring((long long)(x / 10)) + tostring(char('0' + x % 10));\n else\n return tostring(char('0' + x));\n }\n string tostring(unsigned x) { return tostring((long long)x); }\n string tostring(double x) {\n static char res[114];\n sprintf(res, %lf , x);\n string s = tostring(res);\n return s.substr(1, (int)s.size() - 2);\n }\n string tostring(long double x) { return tostring((double)x); }\n template \n string tostring(pair p) {\n return ( + tostring(p.first) + , + tostring(p.second) + ) ;\n }\n template \n string tostring(T v) {\n string res = ;\n for (auto p : v) res += (res.size() ? , : { ) + tostring(p);\n return res.size() ? res + } : {} ;\n }\n template \n string tostring(A *a, int L, int R) {\n return tostring(vector(a + L, a + R + 1));\n };\n template \n string tostring(A a, int L, int R) {\n return tostring(a.data(), L, R);\n }\n string tostrings() { return ; }\n template \n string tostrings(Head H, Tail... T) {\n return tostring(H) + + tostrings(T...);\n }\n long long read() {\n long long x = 0, f = 0;\n char ch = getchar();\n while (!isdigit(ch)) f = ch == '-', ch = getchar();\n while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();\n return f ? -x : x;\n }\n template \n void ckmax(T &x, const T y) {\n if (x < y) x = y;\n }\n template \n void ckmin(T &x, const T y) {\n if (x > y) x = y;\n }\n const int N = 100005;\n struct op {\n int tp;\n long long a, b;\n };\n vector res;\n int a[60];\n set S;\n long long gao(int tp, long long a, long long b) {\n (!(S.count(a) && S.count(b)) ? cout << Assertion failed! << endl\n << function: << __FUNCTION__ << endl\n << line: << 149 << endl\n << expression: \n << S.count(a) && S.count(b) << endl,\n exit(3), 0 : 1);\n res.push_back({tp, a, b});\n long long res = tp ? a ^ b : a + b;\n S.insert(res);\n (!(0 <= res && res <= 5000000000000000000LL)\n ? cout << Assertion failed! << endl\n << function: << __FUNCTION__ << endl\n << line: << 153 << endl\n << expression: \n << 0 <= res && res <= 5000000000000000000LL << endl,\n exit(3), 0 : 1);\n return res;\n }\n int Log(long long x) {\n int ans = 0;\n while (x > 1) {\n ans++;\n x >>= 1;\n }\n return ans;\n }\n int main() {\n long long x = read();\n srand(time(NULL));\n S.clear();\n res.clear();\n S.insert(x);\n while (x > 1) {\n vector v = {x};\n while (1) {\n int p = (int)v.size() - 1;\n while (p > 0 && rand() % 5 != 0) p--;\n long long a = v.back(), b = gao(0, a, a), c = gao(0, v[p], b);\n if (Log(b) != Log(c)) {\n v.push_back(c);\n continue;\n } else {\n long long t = b ^ c;\n for (int i = ((int)v.size() - 1); i >= (0); i--) {\n if (Log(t) == Log(v[i] * 2)) t ^= v[i] * 2;\n if (Log(t) == Log(v[i])) t ^= v[i];\n }\n if (~t & 1) {\n v.push_back(c);\n continue;\n }\n t = gao(1, b, c);\n for (int i = ((int)v.size() - 1); i >= (0); i--) {\n if (Log(t) == Log(v[i] * 2)) t = gao(1, t, v[i] * 2);\n if (Log(t) == Log(v[i])) t = gao(1, t, v[i]);\n }\n (!(Log(t) < Log(x)) ? cout << Assertion failed! << endl\n << function: << __FUNCTION__ << endl\n << line: << 198 << endl\n << expression: \n << Log(t) < Log(x) << endl,\n exit(3), 0 : 1);\n x = t;\n break;\n }\n }\n }\n printf( %d\n , (int)res.size());\n for (auto v : res) printf( %I64d %c %I64d\n , v.a, +^ [v.tp], v.b);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n void enable_comma() {}\n string tostring(char c) {\n string s = ;\n s += c;\n return s;\n }\n string tostring(string s) { return \ + s + \ ; }\n string tostring(const char *c) { return tostring((string)c); }\n string tostring(long long x) {\n if (x < 0) return - + tostring(-x);\n if (x > 9)\n return tostring(x / 10) + tostring(char('0' + x % 10));\n else\n return tostring(char('0' + x));\n }\n string tostring(int x) { return tostring((long long)x); }\n string tostring(unsigned long long x) {\n if (x > 9)\n return tostring((long long)(x / 10)) + tostring(char('0' + x % 10));\n else\n return tostring(char('0' + x));\n }\n string tostring(unsigned x) { return tostring((long long)x); }\n string tostring(double x) {\n static char res[114];\n sprintf(res, %lf , x);\n string s = tostring(res);\n return s.substr(1, (int)s.size() - 2);\n }\n string tostring(long double x) { return tostring((double)x); }\n template \n string tostring(pair p) {\n return ( + tostring(p.first) + , + tostring(p.second) + ) ;\n }\n template \n string tostring(T v) {\n string res = ;\n for (auto p : v) res += (res.size() ? , : { ) + tostring(p);\n return res.size() ? res + } : {} ;\n }\n template \n string tostring(A *a, int L, int R) {\n return tostring(vector(a + L, a + R + 1));\n };\n template \n string tostring(A a, int L, int R) {\n return tostring(a.data(), L, R);\n }\n string tostrings() { return ; }\n template \n string tostrings(Head H, Tail... T) {\n return tostring(H) + + tostrings(T...);\n }\n long long read() {\n long long x = 0, f = 0;\n char ch = getchar();\n while (!isdigit(ch)) f = ch == '-', ch = getchar();\n while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();\n return f ? -x : x;\n }\n template \n void ckmax(T &x, const T y) {\n if (x < y) x = y;\n }\n template \n void ckmin(T &x, const T y) {\n if (x > y) x = y;\n }\n const int N = 100005;\n struct op {\n int tp;\n long long a, b;\n };\n vector res;\n int a[60];\n set S;\n long long gao(int tp, long long a, long long b) {\n (!(S.count(a) && S.count(b)) ? cout << Assertion failed! << endl\n << function: << __FUNCTION__ << endl\n << line: << 149 << endl\n << expression: \n << S.count(a) && S.count(b) << endl,\n exit(3), 0 : 1);\n res.push_back({tp, a, b});\n long long res = tp ? a ^ b : a + b;\n S.insert(res);\n (!(0 <= res && res <= 5000000000000000000LL)\n ? cout << Assertion failed! << endl\n << function: << __FUNCTION__ << endl\n << line: << 153 << endl\n << expression: \n << 0 <= res && res <= 5000000000000000000LL << endl,\n exit(3), 0 : 1);\n return res;\n }\n int Log(long long x) {\n int ans = 0;\n while (x > 1) {\n ans++;\n x >>= 1;\n }\n return ans;\n }\n int main() {\n long long x = read();\n srand(time(NULL));\n S.clear();\n res.clear();\n S.insert(x);\n while (x > 1) {\n vector v = {x};\n while (1) {\n int p = (int)v.size() - 1;\n while (p > 0 && rand() % 5 != 0) p--;\n long long a = v.back(), b = gao(0, a, a), c = gao(0, v[p], b);\n if (Log(b) != Log(c)) {\n v.push_back(c);\n continue;\n } else {\n long long t = b ^ c;\n for (int i = ((int)v.size() - 1); i >= (0); i--) {\n if (Log(t) == Log(v[i] * 2)) t ^= v[i] * 2;\n if (Log(t) == Log(v[i])) t ^= v[i];\n }\n if (~t & 1) {\n v.push_back(c);\n continue;\n }\n t = gao(1, b, c);\n for (int i = ((int)v.size() - 1); i >= (0); i--) {\n if (Log(t) == Log(v[i] * 2)) t = gao(1, t, v[i] * 2);\n if (Log(t) == Log(v[i])) t = gao(1, t, v[i]);\n }\n (!(Log(t) < Log(x)) ? cout << Assertion failed! << endl\n << function: << __FUNCTION__ << endl\n << line: << 198 << endl\n << expression: \n << Log(t) < Log(x) << endl,\n exit(3), 0 : 1);\n x = t;\n break;\n }\n }\n }\n printf( %d\n , (int)res.size());\n for (auto v : res) printf( extra %c extra\n , v.a, +^ [v.tp], v.b);\n return 0;\n }\n "} {"func_code_string": "#include \n #pragma GCC target( avx2 )\n #pragma GCC optimization( O3 )\n #pragma GCC optimization( unroll-loops )\n using namespace std;\n const long long N = 1e5 + 10;\n const long double Pie = acos(-1);\n signed main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n long long t;\n cin >> t;\n while (t--) {\n long long n;\n cin >> n;\n long long arr[n];\n for (long long i = 0; i < n; i++) cin >> arr[i];\n for (long long i = 0; i < n; i++) {\n if (i % 2 == 0) {\n if (arr[i] >= 0)\n cout << arr[i] << ;\n else\n cout << -1 * arr[i] << ;\n } else if (i % 2 == 1) {\n if (arr[i] <= 0)\n cout << arr[i] << ;\n else\n cout << -1 * arr[i] << ;\n }\n }\n cout << \n ;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int mod = 1e9 + 7;\n const int maxn = 200005;\n vector g[maxn];\n int dis[maxn];\n int pa[maxn];\n set> st;\n void dfs(int now, int pre = 0) {\n if (dis[now] > 2) {\n st.insert({dis[now], now});\n }\n for (auto &i : g[now]) {\n if (i ^ pre) {\n pa[i] = now;\n dis[i] = dis[now] + 1;\n dfs(i, now);\n }\n }\n }\n void go() {\n int n;\n cin >> n;\n for (int i = 0; i < n - 1; i++) {\n int x, y;\n cin >> x >> y;\n g[x].push_back(y);\n g[y].push_back(x);\n }\n dfs(1);\n int ans = 0;\n while (st.size()) {\n auto x = *(--st.end());\n int v = pa[x.second];\n st.erase({dis[v], v});\n for (auto &i : g[v]) {\n st.erase({dis[i], i});\n }\n ans++;\n }\n cout << ans << '\n';\n }\n int main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n int c = 0;\n int t;\n if (!c) {\n t = 1;\n } else {\n cin >> t;\n }\n while (t--) {\n go();\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long int newarr[1005];\n long long int dp[1005][1005];\n long long int n, k;\n long long int solution(long long int index, long long int m) {\n if (m < 0) m += k;\n if (index >= n && m != 0)\n return 0;\n else if (m == 0)\n return 1;\n else if (dp[index][m] != -1)\n return dp[index][m];\n else {\n long long int x = solution(index + 1, m);\n long long int y = solution(index + 1, m - newarr[index]);\n if (x > 0) x = 1;\n if (y > 0) y = 1;\n if (m >= newarr[index]) {\n dp[index + 1][m - newarr[index]] = y;\n }\n dp[index + 1][m] = x;\n return x + y;\n }\n }\n int32_t main() {\n memset(dp, -1, sizeof(dp));\n cin >> n;\n cin >> k;\n long long int arr[n];\n long long int ctr = 0;\n for (long long int i = 0; i < n; i++) {\n cin >> arr[i];\n }\n if (n > k) {\n cout << YES\n ;\n } else {\n for (long long int i = 0; i < n; i++) {\n newarr[i] = arr[i] % k;\n if (newarr[i] == 0) ctr++;\n }\n long long int x = solution(0, k);\n if (x > 0 || ctr > 0)\n cout << YES\n ;\n else\n cout << NO ;\n }\n }\n "} @@ -1890,7 +1890,7 @@ {"func_code_string": "#include \n using namespace std;\n const int max_n = 2005;\n string str[max_n];\n int dp[max_n][max_n][4];\n inline void solve() {\n register int n, m, i, j, k;\n long long ans = 0;\n cin >> n >> m;\n for (i = 0; i < n; ++i) cin >> str[i];\n for (i = 0; i < n; ++i) {\n dp[i][0][0] = 1;\n for (j = 1; j < m; ++j) {\n if (str[i][j] == str[i][j - 1])\n dp[i][j][0] = dp[i][j - 1][0] + 1;\n else\n dp[i][j][0] = 1;\n }\n }\n for (i = 0; i < n; ++i) {\n dp[i][m - 1][1] = 1;\n for (j = m - 2; j >= 0; --j) {\n if (str[i][j] == str[i][j + 1])\n dp[i][j][1] = dp[i][j + 1][1] + 1;\n else\n dp[i][j][1] = 1;\n }\n }\n for (j = 0; j < m; ++j) dp[0][j][2] = 1;\n for (i = 1; i < n; ++i) {\n for (j = 0; j < m; ++j) {\n if (str[i][j] == str[i - 1][j])\n dp[i][j][2] = min(dp[i][j][0], min(dp[i][j][1], dp[i - 1][j][2] + 1));\n else\n dp[i][j][2] = 1;\n }\n }\n for (j = 0; j < m; ++j) dp[n - 1][j][3] = 1;\n for (i = n - 2; i >= 0; --i) {\n for (j = 0; j < m; ++j) {\n if (str[i][j] == str[i + 1][j])\n dp[i][j][3] = min(dp[i][j][2], dp[i + 1][j][3] + 1);\n else\n dp[i][j][3] = 1;\n ans += dp[i][j][3];\n }\n }\n ans += m;\n cout << ans << endl;\n }\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n solve();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int a[111111], b[111111];\n vector id[111111];\n int main() {\n int N, M;\n cin >> N >> M;\n for (int i = 1; i <= N; i++) id[i].clear();\n for (int i = 0; i < M; i++) scanf( %d , a + i);\n long long tot = 0;\n for (int i = 1; i < M; i++) {\n if (a[i] == a[i - 1]) continue;\n id[a[i]].push_back(a[i - 1]);\n id[a[i - 1]].push_back(a[i]);\n tot += abs(a[i] - a[i - 1]);\n }\n long long d = 0;\n for (int i = 1; i <= N; i++) {\n sort(id[i].begin(), id[i].end());\n long long s = 0;\n int k = id[i].size() / 2;\n for (int j = 0; j < id[i].size(); j++)\n s += abs(id[i][j] - id[i][k]) - abs(id[i][j] - i);\n if (d > s) d = s;\n }\n cout << tot + d << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long N = 1e5 + 5;\n vector tim(N), pos(N), cur(N);\n \n int main() {\n long long T, n, act, start, des, dir, ans, startTime;\n cin>>T;\n for(long long t = 1; t <= T; ++t) {\n tim[0] = pos[0] = start = des = act = ans = startTime = 0;\n cin>>n;\n for(long long i = 1; i <= n; ++i) {\n cin>>tim[i]>>pos[i];\n if(tim[i] >= act) {\n cur[i] = des;\n startTime = tim[i];\n act = tim[i] + abs(des - pos[i]);\n start = des;\n des = pos[i];\n } else {\n dir = (start <= des) ? 1 : -1;\n cur[i] = start + dir * (tim[i] - startTime);\n }\n }\n cur[n+1] = des;\n for(long long i = 1; i <= n; ++i) {\n if(min(cur[i],cur[i+1]) <= pos[i] && pos[i] <= max(cur[i],cur[i+1])) {\n ans += 1;\n }\n }\n cout<\n using namespace std;\n int max_can;\n pair red, blue;\n int main() {\n scanf( %d%d%d%d%d , &max_can, &red.first, &blue.first, &red.second,\n &blue.second);\n long long ans = 0;\n int sq = (int)sqrt(max_can);\n if (red.second >= sq) {\n for (int cnt = 0;; ++cnt) {\n if (red.second * cnt > max_can) break;\n int can = max_can - red.second * cnt;\n ans = max(ans,\n cnt * 1ll * red.first + (can / blue.second) * 1ll * blue.first);\n }\n printf( %I64d\n , ans);\n return 0;\n } else if (blue.second >= sq) {\n for (int cnt = 0;; ++cnt) {\n if (blue.second * cnt > max_can) break;\n int can = max_can - blue.second * cnt;\n ans = max(ans,\n cnt * 1ll * blue.first + (can / red.second) * 1ll * red.first);\n }\n printf( %I64d\n , ans);\n return 0;\n } else {\n if (red.first * 1ll * blue.second < blue.first * 1ll * red.second)\n swap(red, blue);\n for (int cnt = 0; cnt <= sq; ++cnt) {\n int weight = blue.second * cnt;\n if (weight > max_can) break;\n int can = max_can - weight;\n ans = max(ans,\n blue.first * 1ll * cnt + (can / red.second) * 1ll * red.first);\n }\n printf( %I64d\n , ans);\n return 0;\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int max_can;\n pair red, blue;\n int main() {\n scanf( %d%d%d%d%d , &max_can, &red.first, &blue.first, &red.second,\n &blue.second);\n long long ans = 0;\n int sq = (int)sqrt(max_can);\n if (red.second >= sq) {\n for (int cnt = 0;; ++cnt) {\n if (red.second * cnt > max_can) break;\n int can = max_can - red.second * cnt;\n ans = max(ans,\n cnt * 1ll * red.first + (can / blue.second) * 1ll * blue.first);\n }\n printf( extra\n , ans);\n return 0;\n } else if (blue.second >= sq) {\n for (int cnt = 0;; ++cnt) {\n if (blue.second * cnt > max_can) break;\n int can = max_can - blue.second * cnt;\n ans = max(ans,\n cnt * 1ll * blue.first + (can / red.second) * 1ll * red.first);\n }\n printf( extra\n , ans);\n return 0;\n } else {\n if (red.first * 1ll * blue.second < blue.first * 1ll * red.second)\n swap(red, blue);\n for (int cnt = 0; cnt <= sq; ++cnt) {\n int weight = blue.second * cnt;\n if (weight > max_can) break;\n int can = max_can - weight;\n ans = max(ans,\n blue.first * 1ll * cnt + (can / red.second) * 1ll * red.first);\n }\n printf( extra\n , ans);\n return 0;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n inline long long read() {\n long long x = 0, f = 0;\n char ch = getchar();\n while (!isdigit(ch)) f |= (ch == '-'), ch = getchar();\n while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();\n return f ? -x : x;\n }\n inline void write(long long x) {\n if (x < 0) x = -x, putchar('-');\n if (x >= 10) write(x / 10);\n putchar(x % 10 + '0');\n }\n long long n, a[200005], tot[200005], tong[105], mx, mxat, now;\n signed main() {\n n = read();\n for (register long long i = 1; i <= n; i++) {\n a[i] = read();\n now = a[i];\n while (now && now % 2 == 0) {\n tot[i]++;\n now /= 2;\n }\n tong[tot[i]]++;\n if (tong[tot[i]] > mx) mx = tong[tot[i]], mxat = tot[i];\n }\n write(n - mx);\n puts( );\n for (register long long i = 1; i <= n; i++)\n if (tot[i] != mxat) write(a[i]), putchar(' ');\n return 0;\n }\n "} {"func_code_string": "#include \n int main() {\n int loop, cnt = 1, max = 1;\n scanf( %d , &loop);\n int arr[loop];\n for (int i = 0; i < loop; i++) scanf( %d , &arr[i]);\n for (int i = 1; i < loop; i++) {\n if (arr[i - 1] >= arr[i]) {\n cnt = 1;\n }\n if (arr[i - 1] < arr[i]) {\n cnt++;\n }\n if (max < cnt) max = cnt;\n }\n printf( %d , max);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n multiset ms;\n const int MAXN = 1000000;\n int pos[MAXN], a[MAXN], b[MAXN], st[MAXN];\n int n, i, j, k, ans;\n int main() {\n scanf( %d , &n);\n for (i = 1; i <= n; ++i) {\n scanf( %d , &a[i]);\n pos[a[i]] = i;\n }\n for (j = 1; j <= n; ++j) {\n scanf( %d , &b[j]);\n int diff = j - pos[b[j]];\n st[j] = diff;\n ms.insert(diff);\n }\n for (i = 0; i < n; ++i) {\n ans = n;\n multiset::iterator it = ms.lower_bound(i);\n if (it != ms.end()) ans = min(ans, abs(*(it)-i));\n if (it != ms.begin()) ans = min(ans, abs(*(--it) - i));\n cout << ans << endl;\n ms.erase(ms.find(st[i + 1]));\n int num = b[i + 1];\n ms.insert((i + n + 1) - pos[num]);\n }\n }\n "} @@ -1927,7 +1927,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n long long n;\n while (cin >> n) {\n vector vec;\n for (long long i = 2; i * i <= n; i++) {\n while (n % i == 0) {\n vec.push_back(i);\n n /= i;\n }\n }\n if (n > 1) {\n vec.push_back(n);\n }\n if (vec.size() < 2) {\n printf( 1\n0\n );\n } else if (vec.size() == 2) {\n printf( 2\n );\n } else {\n printf( 1\n%lld\n , vec[0] * vec[1]);\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, m, num, cnt;\n int dat[1009][1009], ans[1000009];\n bool vis[1009][1009];\n int dx[4] = {-1, 0, 1, 0};\n int dy[4] = {0, 1, 0, -1};\n int wall[4] = {8, 4, 2, 1};\n void dfs(int x, int y) {\n if (vis[x][y] || x < 0 || x > n || y < 0 || y > m) return;\n vis[x][y] = 1;\n num++;\n for (int i = 0; i < 4; i++) {\n if ((dat[x][y] & wall[i]) ||\n (dat[x + dx[i]][y + dy[i]] & wall[(i + 2) % 4]))\n continue;\n dfs(x + dx[i], y + dy[i]);\n }\n }\n int main() {\n cin >> n >> m;\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= m; j++) {\n cin >> dat[i][j];\n }\n }\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= m; j++) {\n if (!vis[i][j]) {\n num = 0;\n dfs(i, j);\n ans[++cnt] = num;\n }\n }\n }\n sort(ans + 1, ans + 1 + cnt);\n for (int i = cnt; i > 0; i--) cout << ans[i] << ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long n, m, ind, sum = 0;\n cin >> n;\n long long mas[n];\n for (long long i = 0; i < n; i++) {\n cin >> mas[i];\n sum += mas[i];\n }\n cin >> m;\n long long arr[m];\n sort(mas, mas + n);\n for (long long i = 0; i < m; i++) {\n cin >> arr[i];\n cout << sum - mas[n - arr[i]] << endl;\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int n, nxt[200010], a[200010], sz[200010][31];\n long long ans = 0;\n map mp;\n inline char gc() {\n static char *S, *T, buf[1 << 16];\n if (T == S) {\n T = (S = buf) + fread(buf, 1, 1 << 16, stdin);\n if (T == S) return EOF;\n }\n return *S++;\n }\n inline int read() {\n int x = 0, f = 1;\n char ch = gc();\n while (ch < '0' || ch > '9') {\n if (ch == '-') f = -1;\n ch = gc();\n }\n while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = gc();\n return x * f;\n }\n inline int check(int l, int r) {\n int res = 0;\n for (int i = 0; i <= 30; ++i) res |= ((sz[r][i] - sz[l - 1][i]) > 0) << i;\n return res;\n }\n int main() {\n n = read();\n for (int i = 1; i <= n; ++i) {\n a[i] = read(), nxt[i] = mp[a[i]], mp[a[i]] = i;\n for (int j = 0; j <= 30; ++j) {\n sz[i][j] = sz[i - 1][j];\n if (a[i] & (1 << j)) sz[i][j]++;\n }\n }\n for (int i = 1; i <= n; ++i) {\n int l = max(nxt[i] + 1, 1), r = i, nowl = i;\n while (l <= r) {\n int mid = l + r >> 1;\n if (check(mid, i) == a[i])\n nowl = mid, r = mid - 1;\n else\n l = mid + 1;\n }\n l = i, r = n;\n int nowr = i;\n while (l <= r) {\n int mid = l + r >> 1;\n if (check(i, mid) == a[i])\n nowr = mid, l = mid + 1;\n else\n r = mid - 1;\n }\n ans += 1ll * (i - nowl + 1) * (nowr - i + 1);\n }\n printf( %I64d\n , 1ll * n * (n + 1) / 2 - ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int n, nxt[200010], a[200010], sz[200010][31];\n long long ans = 0;\n map mp;\n inline char gc() {\n static char *S, *T, buf[1 << 16];\n if (T == S) {\n T = (S = buf) + fread(buf, 1, 1 << 16, stdin);\n if (T == S) return EOF;\n }\n return *S++;\n }\n inline int read() {\n int x = 0, f = 1;\n char ch = gc();\n while (ch < '0' || ch > '9') {\n if (ch == '-') f = -1;\n ch = gc();\n }\n while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = gc();\n return x * f;\n }\n inline int check(int l, int r) {\n int res = 0;\n for (int i = 0; i <= 30; ++i) res |= ((sz[r][i] - sz[l - 1][i]) > 0) << i;\n return res;\n }\n int main() {\n n = read();\n for (int i = 1; i <= n; ++i) {\n a[i] = read(), nxt[i] = mp[a[i]], mp[a[i]] = i;\n for (int j = 0; j <= 30; ++j) {\n sz[i][j] = sz[i - 1][j];\n if (a[i] & (1 << j)) sz[i][j]++;\n }\n }\n for (int i = 1; i <= n; ++i) {\n int l = max(nxt[i] + 1, 1), r = i, nowl = i;\n while (l <= r) {\n int mid = l + r >> 1;\n if (check(mid, i) == a[i])\n nowl = mid, r = mid - 1;\n else\n l = mid + 1;\n }\n l = i, r = n;\n int nowr = i;\n while (l <= r) {\n int mid = l + r >> 1;\n if (check(i, mid) == a[i])\n nowr = mid, l = mid + 1;\n else\n r = mid - 1;\n }\n ans += 1ll * (i - nowl + 1) * (nowr - i + 1);\n }\n printf( extra\n , 1ll * n * (n + 1) / 2 - ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long n, t, twoc, onec, opt, old;\n int main() {\n cin >> n;\n cin >> t;\n if (t == 1)\n onec++;\n else\n twoc++;\n old = t;\n for (int i = 1; i < n; i++) {\n cin >> t;\n if (t == 1) {\n if (old == 2)\n onec = 1;\n else\n onec++;\n } else {\n if (old == 1)\n twoc = 1;\n else\n twoc++;\n }\n opt = max(opt, min(onec, twoc));\n old = t;\n }\n cout << opt * 2;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int ar[1000001];\n int main() {\n int n, k;\n cin >> n >> k;\n if (k == n) {\n cout << -1 << endl;\n return 0;\n }\n if (k == n - 1) {\n for (int i = 0; i < n; i++) cout << i + 1 << ;\n cout << endl;\n return 0;\n }\n for (int i = 2; i <= k + 1; i++) ar[i] = i;\n ar[1] = k + 2;\n ar[n] = 1;\n for (int i = k + 2; i < n; i++) ar[i] = i + 1;\n for (int i = 1; i <= n; i++) cout << ar[i] << ;\n cout << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int pow(int a, int b, int c) {\n int ret = 1;\n for (; b; b >>= 1, a = 1LL * a * a % c)\n if (b & 1) ret = 1LL * ret * a % c;\n return ret;\n }\n const int N = 2e3 + 10, M = 4.05e6 + 10;\n int h[N], g[N], p[M], n1[M], ee, low[N], dfn[N], dfntot, vis[N], n, m, st[N],\n top, id[N], tot, sz[N], ans, dp[N], ok[N];\n pair e[M];\n void ae(int *A, int x, int y) {\n p[ee] = y;\n n1[ee] = A[x];\n A[x] = ee++;\n }\n void tarjan(int u, int fa) {\n vis[u] = 1;\n low[u] = dfn[u] = ++dfntot;\n st[++top] = u;\n for (int i = h[u]; ~i; i = n1[i])\n if (p[i] != fa) {\n if (!vis[p[i]])\n tarjan(p[i], u), low[u] = min(low[u], low[p[i]]);\n else\n low[u] = min(low[u], dfn[p[i]]);\n if (low[p[i]] > dfn[u]) {\n ++tot;\n while (st[top] != p[i]) id[st[top--]] = tot, sz[tot]++;\n id[st[top--]] = tot;\n sz[tot]++;\n }\n }\n }\n void dfs(int u, int fa) {\n dp[u] = sz[u];\n for (int i = g[u]; ~i; i = n1[i])\n if (p[i] != fa) {\n dfs(p[i], u);\n dp[u] += dp[p[i]];\n }\n }\n int main() {\n scanf( %d%d , &n, &m);\n memset(h, -1, sizeof(h));\n memset(g, -1, sizeof(g));\n int x, y;\n for (int i = 1; i <= m; i++) scanf( %d%d , &x, &y), ae(h, x, y), ae(h, y, x);\n for (int i = 1; i <= n; i++)\n if (!vis[i]) tarjan(i, 0);\n ++tot;\n while (top) id[st[top--]] = tot, sz[tot]++;\n for (int i = 1; i <= n; i++)\n for (int j = h[i]; ~j; j = n1[j])\n if (id[i] != id[p[j]]) ae(g, id[i], id[p[j]]);\n for (int i = 1; i <= tot; i++) ans += sz[i] * (sz[i] - 1);\n int ret = 0;\n for (int i = 1; i <= tot; i++) {\n int tmp = 0;\n dfs(i, 0);\n for (int j = 1; j <= tot; j++) tmp += (dp[j] - sz[j]) * sz[j];\n for (int j = 0; j <= n; j++) ok[j] = 0;\n ok[0] = 1;\n for (int k = g[i]; ~k; k = n1[k])\n for (int j = n; j >= dp[p[k]]; j--) ok[j] |= ok[j - dp[p[k]]];\n int mx = 0;\n for (int j = 0; j <= n; j++)\n if (ok[j]) mx = max(mx, j * (n - sz[i] - j));\n ret = max(ret, tmp + mx);\n }\n printf( %d\n , n + ans + ret);\n return 0;\n }\n "} @@ -1942,7 +1942,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n;\n cin >> n;\n map mp;\n map::iterator it;\n for (int i = 0; i < n; ++i) {\n string x, y;\n cin >> x >> y;\n it = mp.begin();\n bool found = false;\n for (; it != mp.end(); ++it) {\n if (it->second == x) {\n it->second = y;\n found = true;\n }\n }\n if (!found) mp[x] = y;\n }\n cout << mp.size() << endl;\n it = mp.begin();\n for (; it != mp.end(); it++) cout << it->first << << it->second << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n pair h[100010], h1[100010];\n long long cnt[100010], pre[100010], sum[100010];\n int num[100010], mx[100010], n, tt, t1;\n inline int rd() {\n int x = 0;\n char ch = getchar();\n for (; ch < '0' || ch > '9'; ch = getchar())\n ;\n for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';\n return x;\n }\n inline int gcd(int x, int y) { return (!y) ? x : gcd(y, x % y); }\n inline long long calc(long long l, long long r) {\n return (l + r) * (r - l + 1) / 2;\n }\n inline long long anol_gcd(long long n, long long a, long long b, long long c) {\n if (n < 0) return 0;\n if (!a) return (b / c) * (n + 1);\n if (a >= c || b >= c)\n return (a / c) * n * (n + 1) / 2 + (b / c) * (n + 1) +\n anol_gcd(n, a % c, b % c, c);\n long long hh = (a * n + b) / c;\n return n * hh - anol_gcd(hh - 1, c, c - b - 1, a);\n }\n inline long long gao(int x, int y, long long mid) {\n if (!cnt[x] || !cnt[y]) return 0;\n mid -= pre[y - 1] - pre[x];\n if (mid < 0) return 0;\n long long mn = (mid - cnt[y] * y) / x;\n mn = max(mn, 0LL);\n if (mn >= cnt[x]) return cnt[x] * cnt[y];\n long long res = mn * cnt[y];\n mn++;\n long long mx = mid / x;\n mx = min(mx, cnt[x]);\n if (mn <= mx) res += anol_gcd(mx - mn, x, mid - mx * x, y);\n return res;\n }\n inline long long check(long long mid) {\n long long res = 0;\n int now = 1;\n for (int i = 1; i <= 100000; i++) {\n now = max(now, i);\n long long hh = min(mid / i, cnt[i]);\n if (cnt[i]) res += calc(cnt[i] - hh + 1, cnt[i]);\n while (now + 1 <= 100000 && pre[now + 1] - pre[i - 1] <= mid) now++;\n res += (sum[now] - sum[i]) * cnt[i];\n mx[i] = now;\n }\n for (int i = 1; i <= 100000; i++)\n for (int j = mx[i] + 1; j <= min(mx[i + 1] + 1, 100000); j++)\n res += gao(i, j, mid);\n return res;\n }\n int main() {\n n = rd();\n for (int i = 1; i <= n; i++) num[i] = rd();\n cnt[num[1]]++;\n h[tt = 1] = pair(1, num[1]);\n for (int i = 2; i <= n; i++) {\n t1 = tt;\n for (int j = 1; j <= t1; j++)\n h1[j] = h[j], h1[j].second = gcd(h1[j].second, num[i]);\n h1[++t1] = pair(1, num[i]);\n tt = 0;\n for (int j = 1; j <= t1;) {\n int k = j, now = 0;\n for (; k <= t1 && h1[k].second == h1[j].second; k++) now += h1[k].first;\n h[++tt] = pair(now, h1[j].second);\n j = k;\n }\n for (int j = 1; j <= tt; j++) cnt[h[j].second] += h[j].first;\n }\n for (int i = 1; i <= 100000; i++)\n pre[i] = pre[i - 1] + cnt[i] * i, sum[i] = sum[i - 1] + cnt[i];\n long long all = (long long)n * (n + 1) / 2;\n all = all * (all + 1) / 2;\n all = (all + 1) / 2;\n long long l = 0, r = (long long)n * (n + 1) / 2 * 100000;\n while (l < r) {\n long long mid = (l + r) >> 1;\n if (check(mid) >= all)\n r = mid;\n else\n l = mid + 1;\n }\n printf( %lld\n , l);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int w[505], p[1005], t[5001], was[105];\n int main() {\n int a, b, c, d, f = 0, n, m, x, y, i, j;\n memset(was, 0, sizeof was);\n memset(t, 0, sizeof t);\n scanf( %d %d , &n, &m);\n for (a = 1; a <= n; a++) scanf( %d , &w[a]);\n for (a = 1; a <= m; a++) scanf( %d , &p[a]);\n t[1] = p[1];\n d = 2;\n for (a = 2; a <= m; a++) {\n y = 0;\n for (i = 1; i < d; i++) {\n if (t[i] == p[a]) {\n for (b = i; b > 1; b--) {\n t[b] = t[b - 1];\n f += w[t[b]];\n }\n t[1] = p[a];\n y = 1;\n break;\n }\n }\n if (y == 0) {\n for (b = d; b > 1; b--) {\n t[b] = t[b - 1];\n f += w[t[b]];\n }\n t[1] = p[a];\n d++;\n }\n }\n printf( %d\n , f);\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int n;\n const int maxn = 4001;\n long long dp[maxn], c[maxn][maxn], s[maxn][maxn], sum[maxn];\n long long pow(int k) {\n if (k == 0) return 1LL;\n if (k == 1) return 2LL;\n long long ans = pow(k >> 1);\n ans *= ans;\n if (k % 2) ans *= 2LL;\n return (ans % 1000000007);\n }\n void pre() {\n c[0][0] = c[1][0] = c[1][1] = 1LL;\n s[1][0] = 0;\n s[1][1] = 1LL;\n for (int i = 2; i <= n; i++) {\n c[i][0] = 1LL;\n s[i][0] = 0;\n for (int j = 1; j <= i; j++) {\n c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000007;\n s[i][j] = (j * s[i - 1][j] + s[i - 1][j - 1]) % 1000000007;\n }\n }\n for (int i = 1; i <= n; i++)\n for (int j = 0; j <= i; j++) sum[i] = (sum[i] + s[i][j]) % 1000000007;\n }\n int main() {\n cin >> n;\n pre();\n dp[1] = 1;\n dp[2] = 3;\n for (int i = 3; i <= n; i++) {\n dp[i] = 1;\n for (int j = 1; j <= n - 1; j++)\n dp[i] = (dp[i] + (dp[j] + sum[j]) * c[i - 1][j]) % 1000000007;\n }\n if (dp[n] < 0) dp[n] += 1000000007;\n printf( %I64d\n , dp[n]);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int n;\n const int maxn = 4001;\n long long dp[maxn], c[maxn][maxn], s[maxn][maxn], sum[maxn];\n long long pow(int k) {\n if (k == 0) return 1LL;\n if (k == 1) return 2LL;\n long long ans = pow(k >> 1);\n ans *= ans;\n if (k % 2) ans *= 2LL;\n return (ans % 1000000007);\n }\n void pre() {\n c[0][0] = c[1][0] = c[1][1] = 1LL;\n s[1][0] = 0;\n s[1][1] = 1LL;\n for (int i = 2; i <= n; i++) {\n c[i][0] = 1LL;\n s[i][0] = 0;\n for (int j = 1; j <= i; j++) {\n c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000007;\n s[i][j] = (j * s[i - 1][j] + s[i - 1][j - 1]) % 1000000007;\n }\n }\n for (int i = 1; i <= n; i++)\n for (int j = 0; j <= i; j++) sum[i] = (sum[i] + s[i][j]) % 1000000007;\n }\n int main() {\n cin >> n;\n pre();\n dp[1] = 1;\n dp[2] = 3;\n for (int i = 3; i <= n; i++) {\n dp[i] = 1;\n for (int j = 1; j <= n - 1; j++)\n dp[i] = (dp[i] + (dp[j] + sum[j]) * c[i - 1][j]) % 1000000007;\n }\n if (dp[n] < 0) dp[n] += 1000000007;\n printf( extra\n , dp[n]);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, k, a[101], m;\n int main() {\n m = 101;\n cin >> n >> k;\n for (int i = 1; i <= n; i++) {\n cin >> a[i];\n if (k % a[i] == 0) m = min(m, k / a[i]);\n }\n cout << m;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int cnt[50];\n int main() {\n int n, k;\n cin >> n >> k;\n int aa;\n for (int i = 0; i < n; i++) {\n int tmp = 0;\n for (int j = k - 1; j >= 0; j--) {\n scanf( %d , &aa);\n tmp += (aa << j);\n }\n cnt[tmp]++;\n }\n if (cnt[0]) {\n cout << YES ;\n return 0;\n }\n int tot = (1 << k) - 1;\n for (int i = 1; i <= tot; i++) {\n if (cnt[i]) {\n for (int j = 1; j <= tot; j++) {\n if (cnt[j] && (i & j) == 0) {\n cout << YES ;\n return 0;\n }\n }\n }\n }\n cout << NO ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n inline void read(int &x) {\n x = 0;\n int f = 1;\n char c = getchar();\n while (c > '9' || c < '0') {\n if (c == '-') f = -1;\n c = getchar();\n }\n while (c >= '0' && c <= '9')\n x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();\n x *= f;\n }\n const int maxn = 100100;\n struct node {\n int v, nxt;\n } e[maxn];\n int head[maxn], tot;\n inline void add(int x, int y) {\n tot++;\n e[tot].v = y;\n e[tot].nxt = head[x];\n head[x] = tot;\n }\n struct AA {\n int s, num;\n };\n map h;\n vector ask[maxn];\n set hip[maxn];\n int n, q, s, t, cnt, name[maxn], dep[maxn], son[maxn], size[maxn], ans[maxn];\n bool vis[maxn];\n char ch[30];\n inline void dfs1(int x, int fa) {\n size[x] = 1;\n dep[x] = dep[fa] + 1;\n for (int i = head[x]; i; i = e[i].nxt) {\n int v = e[i].v;\n if (v == fa) continue;\n dfs1(v, x);\n size[x] += size[v];\n if (son[x] == 0 || size[v] > size[son[x]]) son[x] = v;\n }\n }\n inline void calc(int x, int fa) {\n hip[dep[x]].insert(name[x]);\n for (int i = head[x]; i; i = e[i].nxt) {\n int v = e[i].v;\n if (v == fa || vis[v]) continue;\n calc(v, x);\n }\n }\n inline void dfs2(int x, int fa, int keep) {\n for (int i = head[x]; i; i = e[i].nxt) {\n int v = e[i].v;\n if (v == fa || v == son[x]) continue;\n dfs2(v, x, 0);\n }\n if (son[x]) dfs2(son[x], x, 1), vis[son[x]] = true;\n calc(x, fa);\n vis[son[x]] = false;\n for (int i = 0; i < ask[x].size(); i++) {\n if (dep[x] + ask[x][i].s <= n)\n ans[ask[x][i].num] = hip[dep[x] + ask[x][i].s].size();\n }\n if (!keep) {\n for (int i = dep[x]; !hip[i].empty(); i++) {\n hip[i].clear();\n }\n }\n }\n int main() {\n read(n);\n for (int i = 1; i <= n; i++) {\n scanf( %s , ch);\n if (h.find(ch) == h.end()) h[ch] = ++cnt;\n name[i] = h[ch];\n read(s), add(s, i);\n }\n read(q);\n AA tmp;\n for (int i = 1; i <= q; i++) {\n read(s), read(t);\n tmp.s = t;\n tmp.num = i;\n ask[s].push_back(tmp);\n }\n dep[0] = -1;\n dfs1(0, 0);\n dfs2(0, 0, 1);\n for (int i = 1; i <= q; i++) printf( %d\n , ans[i]);\n return 0;\n }\n "} @@ -1966,8 +1966,8 @@ {"func_code_string": "#include \n const int dx[] = {1, 0, -1, 0};\n const int dy[] = {0, 1, 0, -1};\n using namespace std;\n const int MAXN = 55;\n int n;\n int a[2][MAXN];\n int asum[2][MAXN];\n int b[MAXN];\n int main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> n;\n for (int j = 0; j < 2; j++)\n for (int i = 0; i < n - 1; i++) cin >> a[j][i];\n for (int i = 0; i < n; i++) cin >> b[i];\n for (int i = 1; i < n; i++) asum[0][i] = asum[0][i - 1] + a[0][i - 1];\n for (int i = n - 2; i >= 0; i--) asum[1][i] = asum[1][i + 1] + a[1][i];\n vector length;\n for (int i = 0; i < n; i++) length.push_back(asum[0][i] + asum[1][i] + b[i]);\n sort(length.begin(), length.end());\n cout << length[0] + length[1] << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 100010;\n int num[N], tot;\n int main() {\n int n, a1 = 2, a2 = 1, ans = 1;\n cin >> n;\n while (a1 - a2 <= n) {\n if (n % (a1 - a2) == 0) ans = a1 - a2;\n a1 *= 4;\n a2 *= 2;\n }\n cout << ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int k;\n int values[107];\n int n = 0;\n int ans[107][107];\n int cmb[107];\n int main() {\n int i, j, base;\n cin >> k;\n for (i = 3; i <= 100; i++) values[i] = i * (i - 1) * (i - 2) / 6;\n for (i = 2; i <= 100; i++) cmb[i] = i * (i - 1) / 2;\n i = 3;\n while (values[i] < k) i++;\n if (values[i] > k) i--;\n k -= values[i];\n n = i;\n for (i = 1; i <= n; i++)\n for (j = 1; j <= n; j++)\n if (i != j) ans[i][j] = 1;\n while (k) {\n for (i = 2; cmb[i] < k; i++)\n ;\n if (cmb[i] > k) i--;\n k -= cmb[i];\n n++;\n for (j = 1; j <= i; j++) ans[n][j] = ans[j][n] = 1;\n }\n cout << n << '\n';\n for (i = 1; i <= n; i++) {\n for (j = 1; j <= n; j++) cout << ans[i][j];\n cout << '\n';\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int mx = 200, my = 200, tim = 50, mo = 1000000007;\n const int d[8][2] = {1, 2, -1, 2, 1, -2, -1, -2, 2, 1, -2, 1, -2, -1, 2, -1};\n int x, y, n, bfs[mx * my * 4][2], a[mx * 2][my * 2], i, l, r, xx, yy,\n cnt[tim + 10];\n long long K;\n int main() {\n scanf( %I64d%d , &K, &n);\n for (i = 1; i <= n; ++i) scanf( %d%d , &x, &y), a[x + mx][y + my] = -1;\n a[mx][my] = 1;\n bfs[l = r = 1][0] = mx;\n bfs[1][1] = my;\n while (l <= r) {\n x = bfs[l][0];\n y = bfs[l++][1];\n if (a[x][y] == K + 1 || a[x][y] == tim + 1) break;\n for (i = 0; i < 8; ++i) {\n xx = x + d[i][0];\n yy = y + d[i][1];\n if (!a[xx][yy]) {\n a[xx][yy] = a[x][y] + 1;\n cnt[a[xx][yy]]++;\n bfs[++r][0] = xx;\n bfs[r][1] = yy;\n }\n }\n }\n if (K <= tim || cnt[tim + 1] == 0)\n printf( %d\n , r);\n else {\n long long p = K - tim, u = p, v = p + 1;\n if (u % 2 == 0)\n u /= 2;\n else\n v /= 2;\n printf( %d\n ,\n (u % mo * (v % mo) % mo * 28 % mo + p % mo * cnt[tim + 1] % mo + r) %\n mo);\n }\n }\n "} -{"func_code_string": "#include \n using namespace std;\n struct treenode {\n long long a, b, c;\n treenode(long long a, long long b, long long c) : a(a), b(b), c(c) {}\n };\n int n, mm, s[111111], m[111111], r[111111], zero[111111], *add;\n vector tree1[4 * 111111], tree2[4 * 111111], *tree;\n set > seg;\n void mergetrees(vector &v1, vector &v2,\n vector &res) {\n for (int i = 0, j = 0;;) {\n if (v1[i].a > v2[j].a)\n res.push_back(treenode(v1[i].a,\n v1[i].b + v2[j].b + v2[j].c * (v1[i].a - v2[j].a),\n v2[j].c + v1[i].c));\n else\n res.push_back(treenode(v2[j].a,\n v2[j].b + v1[i].b + v1[i].c * (v2[j].a - v1[i].a),\n v1[i].c + v2[j].c));\n if (v1[i].a == 2000000000) break;\n if (v1[i + 1].a > v2[j + 1].a)\n j++;\n else if (v1[i + 1].a < v2[j + 1].a)\n i++;\n else\n i++, j++;\n }\n }\n void build(int node, int vl, int vr) {\n if (vl == vr) {\n tree[node].push_back(treenode(0, add[vl], r[vl]));\n if (r[vl])\n tree[node].push_back(treenode((m[vl] - add[vl]) / r[vl] + 1, m[vl], 0));\n tree[node].push_back(treenode(2000000000, r[vl] ? m[vl] : add[vl], 0));\n } else {\n build(node * 2, vl, (vl + vr) / 2);\n build(node * 2 + 1, (vl + vr) / 2 + 1, vr);\n mergetrees(tree[node * 2], tree[node * 2 + 1], tree[node]);\n }\n }\n long long getsum(int t, int node, int vl, int vr, int l, int r) {\n if (l > vr || r < vl)\n return 0;\n else if (vl >= l && vr <= r) {\n vector &v = tree[node];\n int l = 0, r = (int)v.size() - 1;\n while (l != r) {\n if (v[(l + r) / 2 + 1].a > t)\n r = (l + r) / 2;\n else\n l = (l + r) / 2 + 1;\n }\n return tree[node][l].b + tree[node][l].c * (t - tree[node][l].a);\n } else {\n return getsum(t, node * 2, vl, (vl + vr) / 2, l, r) +\n getsum(t, node * 2 + 1, (vl + vr) / 2 + 1, vr, l, r);\n }\n }\n inline long long getdif(int tnow, int tprev, int l, int r) {\n if (tprev == -1)\n tree = tree2;\n else\n tree = tree1;\n return getsum((tprev == -1) ? tnow : tnow - tprev, 1, 0, n - 1, l - 1, r - 1);\n }\n int main() {\n cin >> n;\n for (int i = 0; i < n; i++) scanf( %d%d%d , &s[i], &m[i], &r[i]);\n cin >> mm;\n tree = tree1;\n add = zero;\n build(1, 0, n - 1);\n tree = tree2;\n add = s;\n build(1, 0, n - 1);\n seg.insert(make_pair(1, -1));\n seg.insert(make_pair(n + 1, -1));\n for (int i = 0; i < mm; i++) {\n int tt, ll, rr;\n scanf( %d%d%d , &tt, &ll, &rr);\n auto j = seg.upper_bound(make_pair(ll, 2000000000));\n j--;\n long long ans = 0;\n bool flag = true;\n for (; j->first <= rr;) {\n auto next = j;\n next++;\n ans += getdif(tt, j->second, max(j->first, ll), min(next->first - 1, rr));\n int l1 = j->first, t1 = j->second;\n seg.erase(j);\n if (l1 < ll) seg.insert(make_pair(l1, t1));\n if (flag) seg.insert(make_pair(ll, tt)), flag = false;\n if (next->first - 1 > rr) seg.insert(make_pair(rr + 1, t1));\n j = next;\n }\n printf( %I64d\n , ans);\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int mx = 200, my = 200, tim = 50, mo = 1000000007;\n const int d[8][2] = {1, 2, -1, 2, 1, -2, -1, -2, 2, 1, -2, 1, -2, -1, 2, -1};\n int x, y, n, bfs[mx * my * 4][2], a[mx * 2][my * 2], i, l, r, xx, yy,\n cnt[tim + 10];\n long long K;\n int main() {\n scanf( extra%d , &K, &n);\n for (i = 1; i <= n; ++i) scanf( %d%d , &x, &y), a[x + mx][y + my] = -1;\n a[mx][my] = 1;\n bfs[l = r = 1][0] = mx;\n bfs[1][1] = my;\n while (l <= r) {\n x = bfs[l][0];\n y = bfs[l++][1];\n if (a[x][y] == K + 1 || a[x][y] == tim + 1) break;\n for (i = 0; i < 8; ++i) {\n xx = x + d[i][0];\n yy = y + d[i][1];\n if (!a[xx][yy]) {\n a[xx][yy] = a[x][y] + 1;\n cnt[a[xx][yy]]++;\n bfs[++r][0] = xx;\n bfs[r][1] = yy;\n }\n }\n }\n if (K <= tim || cnt[tim + 1] == 0)\n printf( %d\n , r);\n else {\n long long p = K - tim, u = p, v = p + 1;\n if (u % 2 == 0)\n u /= 2;\n else\n v /= 2;\n printf( %d\n ,\n (u % mo * (v % mo) % mo * 28 % mo + p % mo * cnt[tim + 1] % mo + r) %\n mo);\n }\n }\n "} +{"func_code_string": "#include \n using namespace std;\n struct treenode {\n long long a, b, c;\n treenode(long long a, long long b, long long c) : a(a), b(b), c(c) {}\n };\n int n, mm, s[111111], m[111111], r[111111], zero[111111], *add;\n vector tree1[4 * 111111], tree2[4 * 111111], *tree;\n set > seg;\n void mergetrees(vector &v1, vector &v2,\n vector &res) {\n for (int i = 0, j = 0;;) {\n if (v1[i].a > v2[j].a)\n res.push_back(treenode(v1[i].a,\n v1[i].b + v2[j].b + v2[j].c * (v1[i].a - v2[j].a),\n v2[j].c + v1[i].c));\n else\n res.push_back(treenode(v2[j].a,\n v2[j].b + v1[i].b + v1[i].c * (v2[j].a - v1[i].a),\n v1[i].c + v2[j].c));\n if (v1[i].a == 2000000000) break;\n if (v1[i + 1].a > v2[j + 1].a)\n j++;\n else if (v1[i + 1].a < v2[j + 1].a)\n i++;\n else\n i++, j++;\n }\n }\n void build(int node, int vl, int vr) {\n if (vl == vr) {\n tree[node].push_back(treenode(0, add[vl], r[vl]));\n if (r[vl])\n tree[node].push_back(treenode((m[vl] - add[vl]) / r[vl] + 1, m[vl], 0));\n tree[node].push_back(treenode(2000000000, r[vl] ? m[vl] : add[vl], 0));\n } else {\n build(node * 2, vl, (vl + vr) / 2);\n build(node * 2 + 1, (vl + vr) / 2 + 1, vr);\n mergetrees(tree[node * 2], tree[node * 2 + 1], tree[node]);\n }\n }\n long long getsum(int t, int node, int vl, int vr, int l, int r) {\n if (l > vr || r < vl)\n return 0;\n else if (vl >= l && vr <= r) {\n vector &v = tree[node];\n int l = 0, r = (int)v.size() - 1;\n while (l != r) {\n if (v[(l + r) / 2 + 1].a > t)\n r = (l + r) / 2;\n else\n l = (l + r) / 2 + 1;\n }\n return tree[node][l].b + tree[node][l].c * (t - tree[node][l].a);\n } else {\n return getsum(t, node * 2, vl, (vl + vr) / 2, l, r) +\n getsum(t, node * 2 + 1, (vl + vr) / 2 + 1, vr, l, r);\n }\n }\n inline long long getdif(int tnow, int tprev, int l, int r) {\n if (tprev == -1)\n tree = tree2;\n else\n tree = tree1;\n return getsum((tprev == -1) ? tnow : tnow - tprev, 1, 0, n - 1, l - 1, r - 1);\n }\n int main() {\n cin >> n;\n for (int i = 0; i < n; i++) scanf( %d%d%d , &s[i], &m[i], &r[i]);\n cin >> mm;\n tree = tree1;\n add = zero;\n build(1, 0, n - 1);\n tree = tree2;\n add = s;\n build(1, 0, n - 1);\n seg.insert(make_pair(1, -1));\n seg.insert(make_pair(n + 1, -1));\n for (int i = 0; i < mm; i++) {\n int tt, ll, rr;\n scanf( %d%d%d , &tt, &ll, &rr);\n auto j = seg.upper_bound(make_pair(ll, 2000000000));\n j--;\n long long ans = 0;\n bool flag = true;\n for (; j->first <= rr;) {\n auto next = j;\n next++;\n ans += getdif(tt, j->second, max(j->first, ll), min(next->first - 1, rr));\n int l1 = j->first, t1 = j->second;\n seg.erase(j);\n if (l1 < ll) seg.insert(make_pair(l1, t1));\n if (flag) seg.insert(make_pair(ll, tt)), flag = false;\n if (next->first - 1 > rr) seg.insert(make_pair(rr + 1, t1));\n j = next;\n }\n printf( extra\n , ans);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n using ll = long long;\n using ld = long double;\n using ii = pair;\n using vi = vector;\n using vb = vector;\n using vvi = vector;\n using vii = vector;\n using vvii = vector;\n constexpr int INF = 2000000000;\n constexpr ll LLINF = 9000000000000000000;\n struct ConvexHullSet {\n struct Line {\n ld a, b;\n mutable ld x;\n bool type;\n bool operator<(const Line &rhs) const {\n return type || rhs.type ? x < rhs.x : a < rhs.a;\n }\n ld intersect(const Line &rhs) const {\n return ld(b - rhs.b) / ld(rhs.a - a);\n }\n };\n set lines;\n static constexpr ld MAX = std::numeric_limits::max();\n ld query(ld x) {\n auto it = lines.lower_bound(Line{0.0, 0.0, x, true});\n return (it != lines.end() ? it->a * x + it->b : -1e300);\n }\n void adjust(set::iterator it) {\n if (it != lines.end())\n it->x = next(it) != lines.end() ? it->intersect(*next(it)) : MAX;\n if (it != lines.begin())\n prev(it)->x = it != lines.end() ? it->intersect(*prev(it)) : MAX;\n }\n void insert(ld a, ld b) {\n Line ln = Line{a, b, 0.0, false};\n auto it1 = lines.lower_bound(ln);\n if (it1 != lines.end() && it1->a == a) {\n if (it1->b >= b) return;\n it1 = lines.erase(it1);\n adjust(it1);\n }\n ln.x = it1 != lines.end() ? ln.intersect(*it1) : MAX;\n while (it1 != lines.end() && ln.x >= it1->x) {\n it1 = lines.erase(it1);\n ln.x = it1 != lines.end() ? it1->intersect(ln) : MAX;\n adjust(it1);\n }\n while (it1 != lines.begin()) {\n --it1;\n ld nx = it1->intersect(ln);\n if (nx >= it1->x) return;\n if (it1 != lines.begin() && prev(it1)->x >= nx) {\n it1 = lines.erase(it1);\n adjust(it1);\n } else\n break;\n }\n it1 = lines.insert(ln).first;\n adjust(it1);\n }\n };\n constexpr int L = 0, R = 1000000;\n vector solve(vii &pairs, int s) {\n vector d(R - L + 1, 1e300);\n sort(pairs.begin(), pairs.end());\n ConvexHullSet chs;\n for (int i = 0, p = L; p <= R; ++p) {\n while (i < (int)pairs.size() && pairs[i].first == p) {\n int x = pairs[i].first, v = pairs[i].second;\n ld a = 1.0 / ld(s - v) - ld(v) / (ld(s - v) * ld(s + v));\n ld b = -ld(x) / ld(s - v) + ld(x) / ld(s + v) +\n ld(v) * ld(x) / (ld(s - v) * ld(s + v));\n chs.insert(-a, -b);\n ++i;\n }\n d[p] = -chs.query(p);\n }\n return d;\n }\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n int n, s;\n cin >> n >> s;\n vi x(n, 0), v(n, 0), t(n, 0);\n ld lr = 1e300, rr = 1e300;\n int minl = R + 1, maxr = L - 1;\n for (int i = 0; i < n; ++i) {\n cin >> x[i] >> v[i] >> t[i];\n if (t[i] == 1) {\n lr = min(lr, ld(x[i]) / ld(v[i]));\n if (x[i] < minl) minl = x[i];\n } else {\n rr = min(rr, ld(R - x[i]) / ld(v[i]));\n if (x[i] > maxr) maxr = x[i];\n }\n }\n cerr << lr = << lr << , rr = << rr << endl;\n vector lp, rp;\n {\n vii pairs[2];\n for (int i = 0; i < n; ++i) pairs[t[i] - 1].push_back({x[i], v[i]});\n for (ii &pr : pairs[1]) pr.first = R - pr.first;\n lp = solve(pairs[0], s);\n rp = solve(pairs[1], s);\n reverse(rp.begin(), rp.end());\n }\n ld ans = max(lr, rr);\n for (int p = L; p <= R; ++p)\n ans = min(ans, max(min(lr, lp[p]), min(rr, rp[p])));\n printf( %.10lf\n , double(ans));\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(0), cin.tie(0);\n int n, m;\n cin >> n >> m;\n vector> adj(n);\n for (int i = 0, u, v; i < m; ++i) {\n cin >> u >> v;\n --u, --v;\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n set go;\n queue q;\n for (int i = 0; i < n; ++i) go.insert(i);\n int ans = 0;\n for (int x = 0; x < n; ++x)\n if (go.find(x) != go.end()) {\n ++ans;\n go.erase(x);\n q.push(x);\n while (!q.empty()) {\n int u = q.front();\n q.pop();\n vector add;\n for (auto v : adj[u])\n if (go.find(v) != go.end()) {\n go.erase(v);\n add.push_back(v);\n }\n for (auto v : go) q.push(v);\n go.clear();\n for (auto v : add) go.insert(v);\n }\n }\n cout << ans - 1 << \n ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct edge {\n int v, w;\n edge* next;\n };\n const int N = 100010;\n int n, p, ordcnt;\n bool vis[N], cut[N];\n int ord[N], sum[N], mex[N], q[N], dep[N], digit[N], rdigit[N], rprod[N],\n prod[N];\n edge* g[N];\n void add_edge(int u, int v, int w);\n void calc_order(int u);\n void calc_sum(int u);\n void dfs(int u);\n long long calc(int u);\n int rev(int a);\n void ex_gcd(int a, int b, int& x, int& y);\n int main() {\n long long ans = 0;\n scanf( %d%d , &n, &p);\n for (int rep = 1; rep < n; ++rep) {\n int u, v, w;\n scanf( %d%d%d , &u, &v, &w);\n add_edge(u, v, w);\n add_edge(v, u, w);\n }\n prod[0] = 1;\n rprod[0] = 1;\n rprod[1] = rev(10);\n for (int i = 1; i <= n; ++i) prod[i] = 10LL * prod[i - 1] % p;\n for (int i = 2; i <= n; ++i)\n rprod[i] = (long long)rprod[1] * rprod[i - 1] % p;\n calc_order(0);\n memset(cut, 0, sizeof(cut));\n for (int i = 0; i < n; ++i) {\n int u = ord[i];\n dep[u] = 0;\n digit[u] = 0;\n rdigit[u] = 0;\n dfs(u);\n ans += calc(u);\n cut[u] = true;\n for (edge* p = g[u]; p; p = p->next)\n if (!cut[p->v]) ans -= calc(p->v);\n ans -= 1;\n ;\n }\n printf( %lld\n , ans);\n return 0;\n }\n int rev(int a) {\n int x, y;\n ex_gcd(a, p, x, y);\n if (x < 0) x += p;\n return x;\n }\n void ex_gcd(int a, int b, int& x, int& y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return;\n }\n ex_gcd(b, a % b, y, x);\n y -= a / b * x;\n }\n long long calc(int u) {\n int ql = 0, qr = 1;\n long long ret = 0;\n map mp;\n q[0] = u;\n while (ql < qr) {\n int v = q[ql++];\n vis[v] = true;\n map::iterator it = mp.find(rdigit[v]);\n if (it != mp.end())\n ++it->second;\n else\n mp.insert(make_pair(rdigit[v], 1));\n for (edge* p = g[v]; p; p = p->next)\n if (!vis[p->v] && !cut[p->v]) q[qr++] = p->v;\n }\n for (int i = 0; i < qr; ++i) vis[q[i]] = false;\n for (int i = 0; i < qr; ++i) {\n int key = (long long)-digit[q[i]] * rprod[dep[q[i]]] % p;\n if (key < 0) key += p;\n map::iterator it = mp.find(key);\n if (it != mp.end()) {\n ;\n ret += it->second;\n }\n }\n return ret;\n }\n void dfs(int u) {\n vis[u] = true;\n for (edge* p = g[u]; p; p = p->next)\n if (!vis[p->v] && !cut[p->v]) {\n dep[p->v] = dep[u] + 1;\n rdigit[p->v] = ((long long)prod[dep[u]] * p->w + rdigit[u]) % ::p;\n digit[p->v] = (digit[u] * 10LL + p->w) % ::p;\n dfs(p->v);\n }\n vis[u] = false;\n }\n void calc_order(int u) {\n calc_sum(u);\n int s = sum[u], ql = 0, qr = 1;\n q[0] = u;\n while (ql < qr) {\n int v = q[ql++];\n vis[v] = true;\n mex[v] = max(mex[v], s - sum[v]);\n if (mex[v] < mex[u]) u = v;\n for (edge* p = g[v]; p; p = p->next)\n if (!vis[p->v] && !cut[p->v]) q[qr++] = p->v;\n }\n for (int i = 0; i < qr; ++i) vis[q[i]] = false;\n ord[ordcnt++] = u;\n cut[u] = true;\n for (edge* p = g[u]; p; p = p->next)\n if (!cut[p->v]) calc_order(p->v);\n }\n void calc_sum(int u) {\n vis[u] = true;\n mex[u] = 0;\n sum[u] = 1;\n for (edge* p = g[u]; p; p = p->next)\n if (!vis[p->v] && !cut[p->v]) {\n calc_sum(p->v);\n sum[u] += sum[p->v];\n mex[u] = max(mex[u], sum[p->v]);\n }\n vis[u] = false;\n }\n void add_edge(int u, int v, int w) {\n static edge pool[N * 2];\n static edge* p = pool;\n ++p;\n p->v = v;\n p->w = w;\n p->next = g[u];\n g[u] = p;\n }\n "} @@ -1975,7 +1975,7 @@ {"func_code_string": "#include \n using namespace std;\n int time_to_minute(int h, int m) { return h * 60 + m; }\n void minute_to_time(int t, int& h, int& m) {\n h = t / 60;\n m = t % 60;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n int h, m, a;\n cin >> h;\n cin.ignore(1);\n cin >> m >> a;\n minute_to_time((time_to_minute(h, m) + a) % (24 * 60), h, m);\n cout << (h < 10 ? 0 : ) << h << : << (m < 10 ? 0 : ) << m;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 100010;\n int n, BIT[N];\n void update(int idx, int val) {\n while (idx <= n) {\n BIT[idx] = max(val, BIT[idx]);\n idx += idx & -idx;\n }\n }\n int get(int idx) {\n int ret = 0;\n while (idx > 0) {\n ret = max(BIT[idx], ret);\n idx -= idx & -idx;\n }\n return ret;\n }\n int main() {\n scanf( %d , &n);\n int ans = 0;\n for (int i = 0, x; i < n; ++i) {\n scanf( %d , &x);\n update(x, get(x) + 1);\n }\n printf( %d\n , get(n));\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int iinf = 1e9 + 7;\n const long long linf = 1ll << 60;\n const double dinf = 1e60;\n template \n inline void scf(T &x) {\n bool f = 0;\n x = 0;\n char c = getchar();\n while ((c < '0' || c > '9') && c != '-') c = getchar();\n if (c == '-') {\n f = 1;\n c = getchar();\n }\n while (c >= '0' && c <= '9') {\n x = x * 10 + c - '0';\n c = getchar();\n }\n if (f) x = -x;\n return;\n }\n template \n void scf(T1 &x, T2 &y) {\n scf(x);\n return scf(y);\n }\n template \n void scf(T1 &x, T2 &y, T3 &z) {\n scf(x);\n scf(y);\n return scf(z);\n }\n template \n void scf(T1 &x, T2 &y, T3 &z, T4 &w) {\n scf(x);\n scf(y);\n scf(z);\n return scf(w);\n }\n inline char mygetchar() {\n char c = getchar();\n while (c == ' ' || c == '\n') c = getchar();\n return c;\n }\n template \n void chkmax(T &x, const T &y) {\n if (y > x) x = y;\n return;\n }\n template \n void chkmin(T &x, const T &y) {\n if (y < x) x = y;\n return;\n }\n const int N = 510;\n const int M = 110;\n int n, m, k;\n double A[N][N + N];\n double w[M][M], p[N][N];\n bool f[N];\n vector trap;\n double beg[N];\n void calc_w() {\n for (int i = (1); i <= (n); ++i) {\n A[i][i] = 1.0;\n if (!f[i])\n for (int j = (1); j <= (n); ++j)\n if (i != j) A[i][j] = -p[i][j];\n A[i][i + n] = 1.0;\n }\n for (int row = 1, col = 1; row <= n; ++row) {\n int pivot = row;\n for (int i = (row + 1); i <= (n); ++i)\n if (fabs(A[i][col]) > fabs(A[pivot][col])) pivot = i;\n if (fabs(A[pivot][col]) <= 1e-6) continue;\n swap(A[pivot], A[row]);\n double foo = A[row][col];\n for (int i = (1); i <= (n + n); ++i) A[row][i] /= foo;\n for (int i = (1); i <= (n); ++i)\n if (i != row) {\n foo = A[i][col];\n for (int j = (1); j <= (n + n); ++j) A[i][j] -= foo * A[row][j];\n }\n ++col;\n }\n for (int i = 0; i < (m); ++i)\n for (int j = 0; j < (m); ++j) {\n int u = trap[i], v = trap[j];\n for (int k = (1); k <= (n); ++k) w[i][j] += p[u][k] * A[k][v + n];\n }\n for (int i = 0; i < (m); ++i) beg[i] = A[1][trap[i] + n];\n return;\n }\n void TZL() {\n static int g[N][N], deg[N];\n memset((g), (0), sizeof((g)));\n memset((deg), (0), sizeof((deg)));\n scf(n, m, k);\n for (int i = (1); i <= (n); ++i) {\n scf(f[i]);\n if (f[i]) trap.push_back(i);\n }\n for (int i = 0; i < (m); ++i) {\n int u, v;\n scf(u, v);\n g[u][v]++;\n g[v][u]++;\n deg[u]++;\n deg[v]++;\n }\n m = (int)trap.size();\n for (int i = (1); i <= (n); ++i)\n for (int j = (1); j <= (n); ++j) p[i][j] = (1.0 * g[i][j]) / (1.0 * deg[i]);\n return calc_w();\n }\n struct mat {\n double num[M][M];\n mat() { memset((num), (0), sizeof((num))); }\n mat(int x) {\n memset((num), (0), sizeof((num)));\n for (int i = 0; i < (M); ++i) num[i][i] = x;\n }\n mat(double a[][M]) {\n for (int i = 0; i < (M); ++i)\n for (int j = 0; j < (M); ++j) num[i][j] = a[i][j];\n }\n double &operator()(int i, int j) { return num[i][j]; }\n double operator()(int i, int j) const { return num[i][j]; }\n friend mat operator*(const mat &a, const mat &b) {\n mat c;\n for (int i = 0; i < (M); ++i)\n for (int j = 0; j < (M); ++j)\n for (int k = 0; k < (M); ++k) c(i, j) += a(i, k) * b(k, j);\n return c;\n }\n } g;\n mat kiss_me(mat a, int n) {\n mat ret = mat(1);\n while (n) {\n if (n & 1) ret = ret * a;\n a = a * a;\n n >>= 1;\n }\n return ret;\n }\n void RANK1() {\n g = mat(w);\n g = kiss_me(g, k - 2);\n double ans = 0.0;\n for (int i = 0; i < (m); ++i) ans += beg[i] * g(i, m - 1);\n printf( %.12f\n , ans);\n return;\n }\n int main() {\n TZL();\n RANK1();\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int n, m;\n long long dis[100010];\n vector mom[100010];\n vector > vertex[100010];\n set q;\n void readin() {\n scanf( %d%d , &n, &m);\n int u, v, c;\n for (int i = 0; i < m; ++i) {\n scanf( %d%d%d , &u, &v, &c);\n vertex[u].push_back(make_pair(v, c));\n vertex[v].push_back(make_pair(u, c));\n }\n int cnt;\n for (int i = 1; i <= n; ++i) {\n scanf( %d , &cnt);\n while (cnt--) {\n scanf( %d , &v);\n mom[i].push_back(v);\n }\n }\n }\n void spfa() {\n int u, v, c, nt, sz;\n vector::iterator low;\n memset(dis, -1, sizeof(dis));\n while (!q.empty()) q.clear();\n q.insert(1);\n dis[1] = 0;\n while (!q.empty()) {\n u = *q.begin();\n q.erase(u);\n if (u == n) continue;\n nt = dis[u];\n low = lower_bound(mom[u].begin(), mom[u].end(), nt);\n for (; low != mom[u].end(); low++) {\n if (*low == nt)\n nt++;\n else if (*low > nt)\n break;\n }\n sz = vertex[u].size();\n for (int i = 0; i < sz; ++i) {\n v = vertex[u][i].first;\n c = vertex[u][i].second;\n if (dis[v] == -1 || dis[v] > nt + c) {\n dis[v] = nt + c;\n q.insert(v);\n }\n }\n }\n }\n int main() {\n readin();\n spfa();\n printf( %I64d , dis[n]);\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int n, m;\n long long dis[100010];\n vector mom[100010];\n vector > vertex[100010];\n set q;\n void readin() {\n scanf( %d%d , &n, &m);\n int u, v, c;\n for (int i = 0; i < m; ++i) {\n scanf( %d%d%d , &u, &v, &c);\n vertex[u].push_back(make_pair(v, c));\n vertex[v].push_back(make_pair(u, c));\n }\n int cnt;\n for (int i = 1; i <= n; ++i) {\n scanf( %d , &cnt);\n while (cnt--) {\n scanf( %d , &v);\n mom[i].push_back(v);\n }\n }\n }\n void spfa() {\n int u, v, c, nt, sz;\n vector::iterator low;\n memset(dis, -1, sizeof(dis));\n while (!q.empty()) q.clear();\n q.insert(1);\n dis[1] = 0;\n while (!q.empty()) {\n u = *q.begin();\n q.erase(u);\n if (u == n) continue;\n nt = dis[u];\n low = lower_bound(mom[u].begin(), mom[u].end(), nt);\n for (; low != mom[u].end(); low++) {\n if (*low == nt)\n nt++;\n else if (*low > nt)\n break;\n }\n sz = vertex[u].size();\n for (int i = 0; i < sz; ++i) {\n v = vertex[u][i].first;\n c = vertex[u][i].second;\n if (dis[v] == -1 || dis[v] > nt + c) {\n dis[v] = nt + c;\n q.insert(v);\n }\n }\n }\n }\n int main() {\n readin();\n spfa();\n printf( extra , dis[n]);\n }\n "} {"func_code_string": "#include \n using namespace std;\n static const int INF = 500000000;\n template \n void debug(T a, T b) {\n for (; a != b; ++a) cerr << *a << ' ';\n cerr << endl;\n }\n int n;\n pair, int> es[5005];\n vector > g[5005];\n int size[5005];\n int cut[5005];\n int prep(int v, int p) {\n size[v] = 1;\n for (int i = 0; i < g[v].size(); ++i) {\n int to = g[v][i].first;\n if (to == p || cut[to]) continue;\n size[v] += prep(to, v);\n }\n return size[v];\n }\n int type;\n int cost[2], root[2], all[2];\n void dfs(int v, int p) {\n int maxi = 0;\n for (int i = 0; i < g[v].size(); ++i) {\n int to = g[v][i].first;\n if (to == p || cut[to]) continue;\n maxi = max(maxi, size[to]);\n dfs(to, v);\n }\n if (max(maxi, all[type] - size[v]) < cost[type]) {\n cost[type] = max(maxi, all[type] - size[v]);\n root[type] = v;\n }\n }\n long long int tot;\n int dfs2(int v, int p) {\n size[v] = 1;\n for (int i = 0; i < g[v].size(); ++i) {\n int to = g[v][i].first;\n if (to == p || cut[to]) continue;\n size[v] += dfs2(to, v);\n tot += size[to] * (all[type] - size[to]) * (long long int)g[v][i].second;\n tot += size[to] * (long long int)all[type ^ 1] * g[v][i].second;\n }\n return size[v];\n }\n int main() {\n scanf( %d , &n);\n for (int i = 0; i < n - 1; ++i) {\n int a, b, c;\n scanf( %d%d%d , &a, &b, &c);\n --a;\n --b;\n g[a].push_back(make_pair(b, c));\n g[b].push_back(make_pair(a, c));\n es[i] = make_pair(make_pair(a, b), c);\n }\n long long int ans = 1e18;\n for (int i = 0; i < n - 1; ++i) {\n int a = es[i].first.first, b = es[i].first.second;\n tot = 0;\n cost[0] = cost[1] = INF;\n type = 0;\n cut[b] = 1;\n all[0] = prep(a, b);\n all[1] = n - all[0];\n dfs(a, b);\n dfs2(root[0], -1);\n type = 1;\n cut[b] = 0;\n cut[a] = 1;\n all[1] = prep(b, a);\n dfs(b, a);\n dfs2(root[1], -1);\n cut[a] = 0;\n tot += all[0] * all[1] * (long long int)es[i].second;\n ans = min(ans, tot);\n }\n cout << ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n int t;\n cin >> t;\n while (t--) {\n vector> st, re;\n int a, b;\n int n;\n cin >> n;\n for (int i = 0; i < n; i++) {\n cin >> a >> b;\n st.emplace_back(a, b);\n re.emplace_back(b, a);\n }\n sort(st.begin(), st.end());\n sort(re.begin(), re.end());\n cout << max(st[n - 1].first - re[0].first, 0) << \n ;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long inf = 1000000007;\n long long a[1100][1100];\n long long b[1100][1100];\n long long A(int n, int k);\n long long B(int n, int k);\n long long A(int n, int k) {\n if (a[n][k] != -1) {\n return a[n][k];\n }\n if (n < k) {\n return a[n][k] = 0;\n }\n if (n == 1) {\n return a[n][k] = (k == 0);\n }\n if (n == 2) {\n return a[n][k] = (k != 1);\n }\n long long ret = A(n - 1, k);\n ret += A(n - 1, k + 1) * (k + 1) - B(n - 1, k + 1) + B(n - 1, k) -\n B(n - 1, k + 1) + B(n - 1, k);\n ret += A(n - 1, k) * (n - 1 - k);\n ret -= A(n - 1, k) - A(n - 2, k) - B(n - 1, k);\n if (k > 0) {\n ret += A(n - 1, k - 1) - A(n - 2, k - 1) - B(n - 1, k - 1);\n }\n ret -= A(n - 1, k) - A(n - 2, k) - B(n - 1, k);\n if (k > 0) {\n ret += A(n - 1, k - 1) - A(n - 2, k - 1) - B(n - 1, k - 1);\n }\n ret -= A(n - 2, k);\n if (k > 1) {\n ret += A(n - 2, k - 2);\n }\n return a[n][k] = (ret % inf + inf) % inf;\n }\n long long B(int n, int k) {\n if (b[n][k] != -1) {\n return b[n][k];\n }\n if (n < k) {\n return (b[n][k] = 0);\n }\n if (n == 1) {\n return b[n][k] = 0;\n }\n if (n == 2) {\n return b[n][k] = (k == 2);\n }\n if (k == 0) {\n return b[n][k] = 0;\n }\n if (k == 1) {\n return b[n][k] =\n ((A(n - 1, 0) - A(n - 2, 0) + B(n - 1, 1)) % inf + inf) % inf;\n }\n return b[n][k] = (A(n - 2, k - 2) + B(n - 1, k) + A(n - 1, k - 1) -\n B(n - 1, k - 1) - A(n - 2, k - 1)) %\n inf;\n }\n int main() {\n memset(a, -1, sizeof(a));\n memset(b, -1, sizeof(b));\n int n, k;\n cin >> n >> k;\n cout << A(n, k) << endl;\n return 0;\n }\n "} @@ -2089,7 +2089,7 @@ {"func_code_string": "#include \n using namespace std;\n const int maxn = 1100;\n int n;\n char s[maxn + 10];\n int data[maxn + 10];\n int dp[maxn + 10][2];\n int main() {\n cin >> n;\n getchar();\n gets(s);\n int i;\n for (i = 0; s[i]; i++) data[i] = s[i] - '0';\n if (i == 1)\n printf( 0\n );\n else {\n int ans1 = 0, ans2 = 0;\n for (int j = 0; j < i; j++) {\n if ((j & 1) != data[j]) ans1++;\n }\n for (int j = 0; j < i; j++) {\n if ((j & 1) == data[j]) ans2++;\n }\n printf( %d\n , min(ans1, ans2));\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 200005;\n const int D = 30;\n struct node {\n int a, b;\n };\n vector road[N], h[N];\n vector q[N];\n int n, m, t, fa[N][D + 1], w[N][D + 1], head[N], sum[N], ans[N], g[N];\n int cnt, tot, dep[N], id[N], size[N], c[N];\n int lowbit(int x) { return x & -x; }\n void update(int x) {\n for (int i = x; i <= n; i += lowbit(i)) {\n c[i] += 1;\n }\n }\n int check(int x) {\n int tmp = 0;\n for (int i = x; i >= 1; i -= lowbit(i)) {\n tmp += c[i];\n }\n return tmp;\n }\n struct edge {\n int to, nxt;\n } e[N * 2];\n void add(int u, int v) {\n cnt++;\n e[cnt].nxt = head[u];\n e[cnt].to = v;\n head[u] = cnt;\n }\n void dfs1(int u, int deep) {\n dep[u] = deep;\n id[u] = ++tot;\n size[u] = 1;\n for (int i = head[u]; i; i = e[i].nxt) {\n int v = e[i].to;\n if (v == fa[u][0]) continue;\n dfs1(v, deep + 1);\n size[u] += size[v];\n }\n }\n void dfs2(int u) {\n g[u] = u;\n for (int i = 0; i < h[u].size(); i++) {\n if (dep[h[u][i]] < dep[g[u]]) g[u] = h[u][i];\n }\n for (int i = head[u]; i; i = e[i].nxt) {\n int v = e[i].to;\n if (v == fa[u][0]) continue;\n dfs2(v);\n if (dep[g[v]] < dep[g[u]]) g[u] = g[v];\n }\n w[u][0] = g[u];\n }\n int lca(int x, int y) {\n if (dep[x] < dep[y]) swap(x, y);\n for (int i = D; i >= 0; i--) {\n if (dep[fa[x][i]] >= dep[y]) x = fa[x][i];\n }\n if (x == y) return x;\n for (int i = D; i >= 0; i--) {\n if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i];\n }\n return fa[x][0];\n }\n node work(int x, int LCA) {\n if (x == LCA) return (node){x, 0};\n int tmp = 0;\n for (int i = D; i >= 0; i--)\n if (dep[w[x][i]] > dep[LCA]) x = w[x][i], tmp += (1 << i);\n if (w[x][0] == x) return (node){x, -1};\n return (node){x, tmp};\n }\n int main() {\n scanf( %d , &n);\n for (int i = 2; i <= n; i++) {\n scanf( %d , &fa[i][0]);\n add(fa[i][0], i);\n add(i, fa[i][0]);\n }\n dfs1(1, 1);\n for (int i = 1; i <= D; i++)\n for (int j = 1; j <= n; j++) {\n fa[j][i] = fa[fa[j][i - 1]][i - 1];\n }\n scanf( %d , &m);\n for (int i = 1; i <= m; i++) {\n int x, y;\n scanf( %d%d , &x, &y);\n int c = lca(x, y);\n if (id[x] > id[y]) swap(x, y);\n road[id[x]].push_back(id[y]);\n if (dep[c] < dep[x]) h[x].push_back(c);\n if (dep[c] < dep[y]) h[y].push_back(c);\n }\n dfs2(1);\n for (int i = 1; i <= n; i++) {\n }\n for (int i = 1; i <= D; i++)\n for (int j = 1; j <= n; j++) {\n w[j][i] = w[w[j][i - 1]][i - 1];\n }\n scanf( %d , &t);\n for (int i = 1; i <= t; i++) {\n int x, y;\n scanf( %d%d , &x, &y);\n int c = lca(x, y);\n node A = work(x, c);\n node B = work(y, c);\n if (A.b == -1 || B.b == -1) {\n ans[i] = -1;\n continue;\n }\n if (x == c || y == c) {\n ans[i] = A.b + B.b + 1;\n continue;\n }\n ans[i] = A.b + B.b + 2;\n x = A.a;\n y = B.a;\n if (id[x] > id[y]) swap(x, y);\n q[id[x] - 1].push_back((node){y, -i});\n q[id[x] + size[x] - 1].push_back((node){y, i});\n }\n for (int i = 1; i <= n; i++) {\n for (int j = 0; j < road[i].size(); j++) update(road[i][j]);\n for (int j = 0; j < q[i].size(); j++) {\n int num = (q[i][j].b > 0 ? 1 : -1);\n int x = q[i][j].a;\n int y = q[i][j].b * num;\n sum[y] += num * (check(id[x] + size[x] - 1) - check(id[x] - 1));\n }\n }\n for (int i = 1; i <= t; i++) {\n printf( %d\n , ans[i] - (sum[i] > 0));\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct prog {\n int i;\n int cmp;\n } a[100005];\n int ans[100005];\n bool cmp(prog a, prog b) {\n if (a.cmp == b.cmp)\n return a.i < b.i;\n else\n return a.cmp < b.cmp;\n }\n int main() {\n int n, m;\n while (cin >> n >> m) {\n priority_queue q;\n int i, j;\n for (i = 0; i < m; i++) {\n a[i].i = i + 1;\n a[i].cmp = (int)fabs((m + 1) / 2.0 - i - 1);\n }\n sort(a, a + m, cmp);\n for (i = 0; i < n; i++) {\n int k = i % m;\n cout << a[k].i << endl;\n }\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int maxN = 3e5 + 11, maxlg = 2e1;\n typedef int i_N[maxN];\n typedef long long l_N[maxN];\n int N, M, Q, par[maxN][maxlg], umax[maxN][maxlg], umin[maxN][maxlg];\n vector adj[maxN], pos[maxN];\n vector > query[maxN];\n pair edge[maxN];\n i_N P, depth, mark, F;\n l_N cnt, sum, mus, ans;\n int lg(int x) {\n for (int i = maxlg; i; i--)\n if ((1 << i) <= x) return i;\n return (1 - 1);\n }\n int get_root(int u) {\n if (P[u] < (1 - 1)) return u;\n return P[u] = get_root(P[u]);\n }\n void join(int u, int v) {\n if (P[u] > P[v]) swap(P[u], P[v]);\n P[u] += P[v];\n P[v] = u;\n }\n void dfs(int u) {\n for (int i = 1, x = lg(depth[u]); i <= x; i++) {\n par[u][i] = par[par[u][i - 1]][i - 1];\n umax[u][i] = max(umax[u][i - 1], umax[par[u][i - 1]][i - 1]);\n umin[u][i] = min(umin[u][i - 1], umin[par[u][i - 1]][i - 1]);\n }\n for (int i = (1 - 1); i < (int)adj[u].size(); i++) {\n int v = adj[u][i];\n if (par[v][(1 - 1)]) continue;\n par[v][(1 - 1)] = u;\n umax[v][(1 - 1)] = max(u, v);\n umin[v][(1 - 1)] = min(u, v);\n depth[v] = depth[u] + 1;\n dfs(v);\n }\n }\n void get(int u, int v, int& x, int& y) {\n if (depth[u] < depth[v]) swap(u, v);\n for (int i = lg(depth[u]); i >= (1 - 1); i--)\n if (depth[u] - (1 << i) >= depth[v]) {\n x = min(x, umin[u][i]);\n y = max(y, umax[u][i]);\n u = par[u][i];\n }\n for (int i = lg(depth[u]); i >= (1 - 1); i--)\n if (par[u][i] != par[v][i]) {\n x = min(x, min(umin[u][i], umin[v][i]));\n y = max(y, max(umax[u][i], umax[v][i]));\n u = par[u][i];\n v = par[v][i];\n }\n if (u != v) {\n x = min(x, min(umin[u][(1 - 1)], umin[v][(1 - 1)]));\n y = max(y, max(umax[u][(1 - 1)], umax[v][(1 - 1)]));\n }\n }\n void update(long long* bit, int x, int v) {\n for (int i = x; i <= N; i |= i + 1) bit[i] += v;\n }\n long long get_bit(long long* bit, int x) {\n long long res = (1 - 1);\n for (int i = x; i >= 1; i = (i & (i + 1)) - 1) res += bit[i];\n return res;\n }\n long long get_bit(long long* bit, int l, int r) {\n return get_bit(bit, r) - get_bit(bit, l - 1);\n }\n int main() {\n scanf( %d %d\n , &N, &M);\n for (int i = 1; i <= M; i++) {\n int u, v;\n scanf( %d %d\n , &u, &v);\n edge[i] = pair(u, v);\n }\n memset(P, -1, sizeof(P));\n for (int i = 1; i <= M; i++) {\n int u = edge[i].first, v = edge[i].second;\n int r1 = get_root(u), r2 = get_root(v);\n if (r1 != r2) {\n mark[i] = 1;\n join(r1, r2);\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n }\n for (int u = 1; u <= N; u++)\n if (!par[u][(1 - 1)]) {\n par[u][(1 - 1)] = -1;\n dfs(u);\n }\n for (int i = 1; i <= M; i++)\n if (!mark[i]) {\n int u = edge[i].first, v = edge[i].second;\n int x = 1e9, y = (1 - 1);\n get(u, v, x, y);\n F[x] = y;\n }\n F[N + 1] = N + 1;\n for (int i = N; i >= 1; i--) {\n if (F[i] == (1 - 1))\n F[i] = F[i + 1];\n else\n F[i] = min(F[i], F[i + 1]);\n pos[F[i]].push_back(i);\n }\n scanf( %d\n , &Q);\n for (int i = 1; i <= Q; i++) {\n int l, r;\n scanf( %d %d\n , &l, &r);\n query[r].push_back(pair(l, i));\n }\n for (int i = 1; i <= N; i++) {\n update(cnt, i, 1);\n update(sum, i, i - 1);\n for (int j = (1 - 1); j < (int)pos[i].size(); j++) {\n int p = pos[i][j];\n update(cnt, p, -1);\n update(sum, p, 1 - p);\n update(mus, p, i - p);\n }\n for (int j = (1 - 1); j < (int)query[i].size(); j++) {\n int r = i, l = query[i][j].first, id = query[i][j].second;\n long long C = get_bit(cnt, l, r);\n long long S = get_bit(sum, l, r);\n long long T = get_bit(mus, l, r);\n ans[id] += C * i - S + T;\n }\n }\n for (int i = 1; i <= Q; i++) printf( %I64d\n , ans[i]);\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int maxN = 3e5 + 11, maxlg = 2e1;\n typedef int i_N[maxN];\n typedef long long l_N[maxN];\n int N, M, Q, par[maxN][maxlg], umax[maxN][maxlg], umin[maxN][maxlg];\n vector adj[maxN], pos[maxN];\n vector > query[maxN];\n pair edge[maxN];\n i_N P, depth, mark, F;\n l_N cnt, sum, mus, ans;\n int lg(int x) {\n for (int i = maxlg; i; i--)\n if ((1 << i) <= x) return i;\n return (1 - 1);\n }\n int get_root(int u) {\n if (P[u] < (1 - 1)) return u;\n return P[u] = get_root(P[u]);\n }\n void join(int u, int v) {\n if (P[u] > P[v]) swap(P[u], P[v]);\n P[u] += P[v];\n P[v] = u;\n }\n void dfs(int u) {\n for (int i = 1, x = lg(depth[u]); i <= x; i++) {\n par[u][i] = par[par[u][i - 1]][i - 1];\n umax[u][i] = max(umax[u][i - 1], umax[par[u][i - 1]][i - 1]);\n umin[u][i] = min(umin[u][i - 1], umin[par[u][i - 1]][i - 1]);\n }\n for (int i = (1 - 1); i < (int)adj[u].size(); i++) {\n int v = adj[u][i];\n if (par[v][(1 - 1)]) continue;\n par[v][(1 - 1)] = u;\n umax[v][(1 - 1)] = max(u, v);\n umin[v][(1 - 1)] = min(u, v);\n depth[v] = depth[u] + 1;\n dfs(v);\n }\n }\n void get(int u, int v, int& x, int& y) {\n if (depth[u] < depth[v]) swap(u, v);\n for (int i = lg(depth[u]); i >= (1 - 1); i--)\n if (depth[u] - (1 << i) >= depth[v]) {\n x = min(x, umin[u][i]);\n y = max(y, umax[u][i]);\n u = par[u][i];\n }\n for (int i = lg(depth[u]); i >= (1 - 1); i--)\n if (par[u][i] != par[v][i]) {\n x = min(x, min(umin[u][i], umin[v][i]));\n y = max(y, max(umax[u][i], umax[v][i]));\n u = par[u][i];\n v = par[v][i];\n }\n if (u != v) {\n x = min(x, min(umin[u][(1 - 1)], umin[v][(1 - 1)]));\n y = max(y, max(umax[u][(1 - 1)], umax[v][(1 - 1)]));\n }\n }\n void update(long long* bit, int x, int v) {\n for (int i = x; i <= N; i |= i + 1) bit[i] += v;\n }\n long long get_bit(long long* bit, int x) {\n long long res = (1 - 1);\n for (int i = x; i >= 1; i = (i & (i + 1)) - 1) res += bit[i];\n return res;\n }\n long long get_bit(long long* bit, int l, int r) {\n return get_bit(bit, r) - get_bit(bit, l - 1);\n }\n int main() {\n scanf( %d %d\n , &N, &M);\n for (int i = 1; i <= M; i++) {\n int u, v;\n scanf( %d %d\n , &u, &v);\n edge[i] = pair(u, v);\n }\n memset(P, -1, sizeof(P));\n for (int i = 1; i <= M; i++) {\n int u = edge[i].first, v = edge[i].second;\n int r1 = get_root(u), r2 = get_root(v);\n if (r1 != r2) {\n mark[i] = 1;\n join(r1, r2);\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n }\n for (int u = 1; u <= N; u++)\n if (!par[u][(1 - 1)]) {\n par[u][(1 - 1)] = -1;\n dfs(u);\n }\n for (int i = 1; i <= M; i++)\n if (!mark[i]) {\n int u = edge[i].first, v = edge[i].second;\n int x = 1e9, y = (1 - 1);\n get(u, v, x, y);\n F[x] = y;\n }\n F[N + 1] = N + 1;\n for (int i = N; i >= 1; i--) {\n if (F[i] == (1 - 1))\n F[i] = F[i + 1];\n else\n F[i] = min(F[i], F[i + 1]);\n pos[F[i]].push_back(i);\n }\n scanf( %d\n , &Q);\n for (int i = 1; i <= Q; i++) {\n int l, r;\n scanf( %d %d\n , &l, &r);\n query[r].push_back(pair(l, i));\n }\n for (int i = 1; i <= N; i++) {\n update(cnt, i, 1);\n update(sum, i, i - 1);\n for (int j = (1 - 1); j < (int)pos[i].size(); j++) {\n int p = pos[i][j];\n update(cnt, p, -1);\n update(sum, p, 1 - p);\n update(mus, p, i - p);\n }\n for (int j = (1 - 1); j < (int)query[i].size(); j++) {\n int r = i, l = query[i][j].first, id = query[i][j].second;\n long long C = get_bit(cnt, l, r);\n long long S = get_bit(sum, l, r);\n long long T = get_bit(mus, l, r);\n ans[id] += C * i - S + T;\n }\n }\n for (int i = 1; i <= Q; i++) printf( extra\n , ans[i]);\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n bool smax(T& x, L y) {\n return x < y ? (x = y, 1) : 0;\n }\n template \n bool smin(T& x, L y) {\n return x > y ? (x = y, 1) : 0;\n }\n const int maxn = 16;\n int n, a[maxn], b[maxn][maxn], ex, x[maxn];\n bool mark[maxn];\n vector > all;\n vector todo;\n int fond(int x) {\n for (int i = 0; i < n * n; i++)\n if (!mark[i] && a[i] == x) return i;\n return -1;\n }\n void back(int s = 0) {\n if (s == n) {\n for (int i = 0, sum = 0; i < n; i++, sum = 0) {\n for (int j = 0; j < n; j++) sum += b[j][i];\n if (sum != ex) return;\n }\n {\n int sum = 0;\n for (int i = 0; i < n; i++) sum += b[i][i];\n if (sum != ex) return;\n }\n {\n int sum = 0;\n for (int i = 0; i < n; i++) sum += b[i][n - i - 1];\n if (sum != ex) return;\n }\n for (int i = 0; i < n; i++, cout << '\n')\n for (int j = 0; j < n; j++) cout << b[i][j] << ' ';\n exit(0);\n }\n if (s == n - 1) {\n fill(b[n - 1], b[n - 1] + n, ex);\n for (int i = 0; i < n - 1; i++)\n for (int j = 0; j < n; j++) b[n - 1][j] -= b[i][j];\n int i = 0;\n for (int tmp; i < n; i++)\n if (~(tmp = fond(b[n - 1][i])))\n mark[tmp] = 1, todo.push_back(tmp);\n else\n break;\n if (i == n) back(n);\n for (auto x : todo) mark[x] = 0;\n todo.clear();\n }\n for (auto v : all) {\n bool reval = 1;\n for (auto x : v)\n if (mark[x]) {\n reval = 0;\n break;\n }\n if (!reval) continue;\n do {\n for (int i = 0; i < n; i++) b[s][i] = a[v[i]], mark[v[i]] = 1;\n back(s + 1);\n for (int i = 0; i < n; i++) mark[v[i]] = 0;\n } while (next_permutation(v.begin(), v.end()));\n }\n }\n void tof(int idx) {\n if (idx == 4 && x[0] + x[1] + x[2] + x[3] != ex) return;\n if (idx == 8 && x[4] + x[5] + x[6] + x[7] != ex) return;\n if (idx == 12 && x[8] + x[9] + x[10] + x[11] != ex) return;\n if (idx == 16 && x[12] + x[13] + x[14] + x[15] != ex) return;\n if (idx == 13 && x[0] + x[4] + x[8] + x[12] != ex) return;\n if (idx == 14 && x[1] + x[5] + x[9] + x[13] != ex) return;\n if (idx == 15 && x[2] + x[6] + x[10] + x[14] != ex) return;\n if (idx == 16 && x[3] + x[7] + x[11] + x[15] != ex) return;\n if (idx == 13 && x[3] + x[6] + x[9] + x[12] != ex) return;\n if (idx == 16 && x[0] + x[5] + x[10] + x[15] != ex) return;\n if (idx == 16) {\n for (int i = 0; i < n; i++, cout << '\n')\n for (int j = 0; j < n; j++) cout << x[i * 4 + j] << ' ';\n exit(0);\n }\n for (int i = 0; !(i >> 4); ++i)\n if (!mark[i]) {\n x[idx] = a[i], mark[i] = 1;\n tof(idx + 1);\n mark[i] = 0;\n }\n }\n int main() {\n srand(time(0));\n ios::sync_with_stdio(0), cin.tie();\n cin >> n;\n for (int i = 0; i < n * n; i++) cin >> a[i], ex += a[i];\n random_shuffle(a, a + n * n);\n ex /= n;\n cout << ex << '\n';\n if (n < 4) {\n for (int i = 0; i < 1 << n * n; i++)\n if (__builtin_popcount(i) == n) {\n int sum = 0;\n for (int j = 0; j < n * n; j++) sum += (i >> j & 1) * a[j];\n if (sum == ex) {\n all.push_back({});\n for (int j = 0; j < n * n; j++)\n if (i >> j & 1) all.back().push_back(j);\n sort(all.back().begin(), all.back().end());\n }\n }\n return back(), 0;\n }\n tof(0);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n set, pair > > s;\n vector ed[2][300000];\n int n, m, k;\n int a[300000], b[300000];\n long long ans[300000];\n bool add(int x, int y, int dx, int dy) {\n pair, pair > g =\n make_pair(make_pair(x, y), make_pair(dx, dy));\n if (s.find(g) != s.end()) return false;\n s.insert(g);\n return true;\n }\n void go(int x, int y, int dx, int dy, long long t) {\n int tt = 1;\n int d = x - y + m;\n if (dx - dy != 0) {\n tt = 0;\n d = x + y;\n }\n bool f = add(x, y, dx, dy);\n if (!f) return;\n for (int j = 0; j < ed[tt][d].size(); j++) {\n int kx = a[ed[tt][d][j]];\n int ky = b[ed[tt][d][j]];\n kx = kx - x;\n ky = ky - y;\n kx = kx / dx;\n ky = ky / dy;\n int g = ed[tt][d][j];\n if (ans[g] != -1) continue;\n ans[g] = t + min(kx, ky);\n }\n if (dx == 1 && dy == 1) {\n int v = min(n - x, m - y);\n x += v;\n y += v;\n if (x == n && y == m) return;\n if (y == m)\n go(x, y, 1, -1, t + v);\n else\n go(x, y, -1, 1, t + v);\n }\n if (dx == -1 && dy == -1) {\n int v = min(x, y);\n x -= v;\n y -= v;\n if (x == 0 && y == 0) return;\n if (y == 0)\n go(x, y, -1, 1, t + v);\n else\n go(x, y, 1, -1, t + v);\n }\n if (dx == 1 && dy == -1) {\n int v = min(n - x, y);\n x += v;\n y -= v;\n if (x == n && y == 0) return;\n if (y == 0)\n go(x, y, 1, 1, t + v);\n else\n go(x, y, -1, -1, t + v);\n }\n if (dx == -1 && dy == 1) {\n int v = min(x, m - y);\n x -= v;\n y += v;\n if (x == 0 && y == m) return;\n if (x == 0)\n go(x, y, 1, 1, t + v);\n else\n go(x, y, -1, -1, t + v);\n }\n }\n int main() {\n ios_base::sync_with_stdio(0);\n cin >> n >> m >> k;\n for (int i = 1; i <= k; i++) ans[i] = -1;\n for (int i = 1; i <= k; i++) {\n cin >> a[i] >> b[i];\n ed[0][a[i] + b[i]].push_back(i);\n ed[1][a[i] - b[i] + m].push_back(i);\n }\n go(0, 0, 1, 1, 0);\n for (int i = 1; i <= k; i++) cout << ans[i] << \n ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n inline long long read() {\n char ch = getchar();\n long long x = 0, f = 1;\n while (ch < '0' || ch > '9') f = ch == '-' ? -1 : 1, ch = getchar();\n while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();\n return x * f;\n }\n int main(int argc, char *argv[]) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n long long base = (1LL << 7) - 1;\n long long res = 0, cur;\n printf( ? );\n for (long long i = (1); i <= (100); i += (1)) printf( %lld , i);\n putchar('\n');\n fflush(stdout);\n cur = read();\n res += (cur >> 7) << 7;\n printf( ? );\n for (long long i = (1); i <= (100); i += (1)) printf( %lld , i << 7);\n putchar('\n');\n fflush(stdout);\n cur = read();\n res += cur & base;\n printf( ! %lld\n , res);\n fflush(stdout);\n return 0;\n }\n "} @@ -2154,12 +2154,12 @@ {"func_code_string": "#include \n using namespace std;\n char A[2005][2005], B[2005][2005];\n int last_valid;\n pair lb[26], ub[26];\n bool ans;\n void _clear(int n, int m) {\n for (int i = 0; i < 26; ++i) {\n lb[i] = make_pair(INT_MAX, INT_MAX);\n ub[i] = make_pair(INT_MIN, INT_MIN);\n }\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n B[i][j] = '.';\n }\n }\n ans = true;\n last_valid = -1;\n }\n void _populate(int n, int m) {\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n if (A[i][j] == '.') continue;\n char c = A[i][j] - 'a';\n lb[c].first = min(lb[c].first, i);\n lb[c].second = min(lb[c].second, j);\n ub[c].first = max(ub[c].first, i);\n ub[c].second = max(ub[c].second, j);\n }\n }\n }\n void _regenerate() {\n for (int i = 0; i < 26; ++i) {\n if (lb[i].first != INT_MAX) {\n last_valid = i;\n if (lb[i].first == ub[i].first) {\n int x = lb[i].first;\n for (int j = lb[i].second; j <= ub[i].second; ++j) B[x][j] = i + 'a';\n } else if (lb[i].second == ub[i].second) {\n int x = lb[i].second;\n for (int j = lb[i].first; j <= ub[i].first; ++j) B[j][x] = i + 'a';\n } else\n ans = false;\n }\n }\n }\n void _compare(int n, int m) {\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n if (A[i][j] != B[i][j]) ans = false;\n }\n }\n }\n void _print() {\n if (!ans) {\n cout << NO << endl;\n return;\n }\n cout << YES << endl;\n cout << last_valid + 1 << endl;\n for (int i = 0; i <= last_valid; ++i) {\n if (lb[i].first != INT_MAX) {\n cout << lb[i].first + 1 << << lb[i].second + 1 << \n << ub[i].first + 1 << << ub[i].second + 1 << endl;\n } else {\n int x = last_valid;\n cout << lb[x].first + 1 << << lb[x].second + 1 << \n << ub[x].first + 1 << << ub[x].second + 1 << endl;\n }\n }\n }\n void _debug(int n, int m) {\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) cout << A[i][j] << ;\n cout << endl;\n }\n cout << endl;\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) cout << B[i][j] << ;\n cout << endl;\n }\n cout << endl;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cout.tie(0);\n cin.tie(0);\n int t, n, m, i, j, k, x, y, z, a, b, c;\n cin >> t;\n while (t--) {\n cin >> n >> m;\n for (i = 0; i < n; ++i) cin >> A[i];\n _clear(n, m);\n _populate(n, m);\n _regenerate();\n _compare(n, m);\n _print();\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n;\n string s;\n long long dp[200011];\n const long long Mod = 1e9 + 7;\n long long f[200011][3];\n long long power(long long x, long long n) {\n if (n < 0) return 0;\n if (n == 0) return 1;\n if (n % 2 == 0) return power(x * x % Mod, n / 2);\n return x * power(x * x % Mod, n / 2) % Mod;\n }\n int main() {\n cin >> n;\n cin >> s;\n s = '.' + s;\n int c = 0;\n for (int i = n; i >= 1; i--) {\n if (s[i] == '?') c++;\n }\n long long cnt1 = 0;\n long long cnt2 = 0;\n for (int i = 1; i <= n; i++) {\n if (s[i] == 'b') {\n f[i][0] += cnt1;\n f[i][1] += cnt2;\n }\n if (s[i] == '?') {\n f[i][1] += cnt1;\n f[i][2] += cnt2;\n }\n if (s[i] == 'a') {\n cnt1++;\n }\n if (s[i] == '?') cnt2++;\n }\n for (int i = 1; i <= n; i++) {\n for (int j = 0; j <= 2; j++) (f[i][j] += f[i - 1][j]) %= Mod;\n }\n long long ans = 0;\n for (int i = 1; i <= n; i++) {\n if (s[i] == 'c') {\n ans += f[i - 1][0] * power(3, c);\n ans %= Mod;\n ans += f[i - 1][1] * power(3, c - 1);\n ans %= Mod;\n ans += f[i - 1][2] * power(3, c - 2);\n ans %= Mod;\n }\n if (s[i] == '?') {\n ans += f[i - 1][0] * power(3, c - 1);\n ans %= Mod;\n ans += f[i - 1][1] * power(3, c - 2);\n ans %= Mod;\n ans += f[i - 1][2] * power(3, c - 3);\n ans %= Mod;\n }\n }\n cout << ans;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, x[1042], y[1042];\n double eps = 0.00000001;\n int dist2(int x1, int y1, int x2, int y2) {\n return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);\n }\n double dist(double x1, double y1, double x2, double y2) {\n return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n }\n int cross(int a, int b, int c) {\n return (x[a] - x[b]) * (y[c] - y[b]) - (x[c] - x[b]) * (y[a] - y[b]);\n }\n bool acute(int a, int b, int c) {\n if (cross(a, b, c) == 0) {\n return 0;\n }\n int dAB = dist2(x[a], y[a], x[b], y[b]);\n int dBC = dist2(x[b], y[b], x[c], y[c]);\n int dAC = dist2(x[a], y[a], x[c], y[c]);\n if (dAB >= dBC + dAC) {\n return 0;\n }\n if (dAC >= dBC + dAB) {\n return 0;\n }\n if (dBC >= dAC + dAB) {\n return 0;\n }\n return 1;\n }\n bool r(int a, int b, int c) {\n int dAB = dist2(x[a], y[a], x[b], y[b]);\n int dBC = dist2(x[b], y[b], x[c], y[c]);\n int dAC = dist2(x[a], y[a], x[c], y[c]);\n if (dAB == dBC + dAC) {\n return 1;\n }\n if (dAC == dBC + dAB) {\n return 1;\n }\n if (dBC == dAC + dAB) {\n return 1;\n }\n return 0;\n }\n bool covered(double cx, double cy, double t) {\n for (int i = 0; i < n; i++) {\n if (dist(cx, cy, x[i], y[i]) < t) {\n return 1;\n }\n }\n return 0;\n }\n pair getCirC(int a, int b, int c) {\n int dx1 = x[a] - x[b], dx2 = x[b] - x[c], dx3 = x[c] - x[a];\n int dy1 = y[a] - y[b], dy2 = y[b] - y[c], dy3 = y[c] - y[a];\n double xc1 = (x[a] + x[b]) / 2., xc2 = (x[b] + x[c]) / 2.,\n xc3 = (x[c] + x[a]) / 2.;\n double yc1 = (y[a] + y[b]) / 2., yc2 = (y[b] + y[c]) / 2.,\n yc3 = (y[c] + y[a]) / 2.;\n if (dy1 == 0) {\n swap(dx1, dx3);\n swap(dy1, dy3);\n swap(xc1, xc3);\n swap(yc1, yc3);\n }\n if (dy2 == 0) {\n swap(dx2, dx3);\n swap(dy2, dy3);\n swap(xc2, xc3);\n swap(yc2, yc3);\n }\n double n1 = -1. * dx1 / (double)dy1, n2 = -1. * dx2 / (double)dy2;\n double x = (yc2 - yc1 + n1 * xc1 - n2 * xc2) / (n1 - n2);\n double y = n1 * (x - xc1) + yc1;\n return make_pair(x, y);\n }\n int main() {\n cin >> n;\n for (int i = 0; i < n; i++) {\n cin >> x[i] >> y[i];\n }\n double ans = -1;\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n for (int k = j + 1; k < n; k++) {\n if (acute(i, j, k)) {\n pair crr = getCirC(i, j, k);\n double px = crr.first, py = crr.second;\n double d = dist(px, py, x[i], y[i]);\n if (!covered(px, py, d - eps)) {\n ans = max(ans, d);\n }\n }\n }\n }\n }\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n vector ids;\n ids.clear();\n for (int k = 0; k < n; k++) {\n if (k == i || k == j) {\n continue;\n }\n if (dist2(x[i], y[i], x[k], y[k]) != dist2(x[j], y[j], x[k], y[k])) {\n continue;\n }\n if (!r(i, j, k)) {\n continue;\n }\n ids.push_back(k);\n }\n if (ids.size() < 2) {\n continue;\n }\n int k = ids[0];\n int cc = ids[1];\n double px = (x[i] + x[j] + x[k] + x[cc]) / 4.;\n double py = (y[i] + y[j] + y[k] + y[cc]) / 4.;\n double d = dist(x[i], y[i], px, py);\n if (!covered(px, py, d - eps)) {\n ans = max(ans, d);\n }\n }\n }\n cout << ans << \n ;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n vector vec[100010];\n long long a[100010];\n long long s;\n int n;\n long long dfs(int f, int u, long long val) {\n int sz = vec[u].size(), v;\n long long ret = 0, mv = ((long long)1e18), tmp;\n if (sz == 1 && vec[u][0] == f)\n return (a[u] = ((val) < (a[u]) ? (val) : (a[u])));\n if (u != 1)\n val = val / (sz - 1) * (sz - 1) / (sz - 1);\n else\n val = val / sz * sz / sz;\n for (int i = 0; i < sz; i++) {\n v = vec[u][i];\n if (v == f) continue;\n tmp = dfs(u, v, val);\n mv = ((mv) < (tmp) ? (mv) : (tmp));\n }\n while (true) {\n tmp = mv;\n for (int i = 0; i < sz; i++) {\n v = vec[u][i];\n if (v == f) continue;\n if (a[v] > tmp) tmp = ((dfs(u, v, mv)) < (tmp) ? (dfs(u, v, mv)) : (tmp));\n }\n if (tmp == mv)\n break;\n else\n mv = tmp;\n }\n for (int i = 0; i < sz; i++)\n if (vec[u][i] != f) ret += a[vec[u][i]];\n return a[u] = ret;\n }\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) scanf( %I64d , a + i), s += a[i];\n for (int i = 1; i < n; i++) {\n int u, v;\n scanf( %d%d , &u, &v);\n vec[u].push_back(v);\n vec[v].push_back(u);\n }\n long long ret = dfs(0, 1, ((long long)1e18));\n cout << s - ret << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int dx[] = {0, 0, 1, -1};\n int dy[] = {1, -1, 0, 0};\n template \n inline void smin(T &a, T b) {\n if (a > b) a = b;\n }\n template \n inline void smax(T &a, T b) {\n if (a < b) a = b;\n }\n int qf, qb, q[11111111];\n long long res[555], a[555][555], dst[555][555];\n int r[555], first[555];\n int main() {\n int N, ii, i, j, nn, u, st;\n scanf( %d , &N);\n for (i = 0; i < N; i++)\n for (j = 0; j < N; j++) scanf( %I64d , &dst[i][j]);\n for (i = 0; i < N; i++) {\n scanf( %d , r + i);\n r[i]--;\n }\n nn = 0;\n for (ii = N - 1; ii >= 0; ii--) {\n st = r[ii];\n for (i = 0; i < nn; i++) {\n for (j = 0; j < nn; j++) {\n smin(dst[st][first[j]], dst[st][first[i]] + dst[first[i]][first[j]]);\n smin(dst[first[j]][st], dst[first[j]][first[i]] + dst[first[i]][st]);\n }\n }\n for (i = 0; i < nn; i++)\n for (j = 0; j < nn; j++)\n smin(dst[first[i]][first[j]], dst[first[i]][st] + dst[st][first[j]]);\n first[nn++] = st;\n res[ii] = 0;\n for (i = 0; i < nn; i++)\n for (j = 0; j < nn; j++) res[ii] += dst[first[i]][first[j]];\n }\n for (i = 0; i < N; i++) {\n if (i) printf( );\n printf( %I64d , res[i]);\n }\n puts( );\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n vector vec[100010];\n long long a[100010];\n long long s;\n int n;\n long long dfs(int f, int u, long long val) {\n int sz = vec[u].size(), v;\n long long ret = 0, mv = ((long long)1e18), tmp;\n if (sz == 1 && vec[u][0] == f)\n return (a[u] = ((val) < (a[u]) ? (val) : (a[u])));\n if (u != 1)\n val = val / (sz - 1) * (sz - 1) / (sz - 1);\n else\n val = val / sz * sz / sz;\n for (int i = 0; i < sz; i++) {\n v = vec[u][i];\n if (v == f) continue;\n tmp = dfs(u, v, val);\n mv = ((mv) < (tmp) ? (mv) : (tmp));\n }\n while (true) {\n tmp = mv;\n for (int i = 0; i < sz; i++) {\n v = vec[u][i];\n if (v == f) continue;\n if (a[v] > tmp) tmp = ((dfs(u, v, mv)) < (tmp) ? (dfs(u, v, mv)) : (tmp));\n }\n if (tmp == mv)\n break;\n else\n mv = tmp;\n }\n for (int i = 0; i < sz; i++)\n if (vec[u][i] != f) ret += a[vec[u][i]];\n return a[u] = ret;\n }\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) scanf( extra , a + i), s += a[i];\n for (int i = 1; i < n; i++) {\n int u, v;\n scanf( %d%d , &u, &v);\n vec[u].push_back(v);\n vec[v].push_back(u);\n }\n long long ret = dfs(0, 1, ((long long)1e18));\n cout << s - ret << endl;\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int dx[] = {0, 0, 1, -1};\n int dy[] = {1, -1, 0, 0};\n template \n inline void smin(T &a, T b) {\n if (a > b) a = b;\n }\n template \n inline void smax(T &a, T b) {\n if (a < b) a = b;\n }\n int qf, qb, q[11111111];\n long long res[555], a[555][555], dst[555][555];\n int r[555], first[555];\n int main() {\n int N, ii, i, j, nn, u, st;\n scanf( %d , &N);\n for (i = 0; i < N; i++)\n for (j = 0; j < N; j++) scanf( extra , &dst[i][j]);\n for (i = 0; i < N; i++) {\n scanf( %d , r + i);\n r[i]--;\n }\n nn = 0;\n for (ii = N - 1; ii >= 0; ii--) {\n st = r[ii];\n for (i = 0; i < nn; i++) {\n for (j = 0; j < nn; j++) {\n smin(dst[st][first[j]], dst[st][first[i]] + dst[first[i]][first[j]]);\n smin(dst[first[j]][st], dst[first[j]][first[i]] + dst[first[i]][st]);\n }\n }\n for (i = 0; i < nn; i++)\n for (j = 0; j < nn; j++)\n smin(dst[first[i]][first[j]], dst[first[i]][st] + dst[st][first[j]]);\n first[nn++] = st;\n res[ii] = 0;\n for (i = 0; i < nn; i++)\n for (j = 0; j < nn; j++) res[ii] += dst[first[i]][first[j]];\n }\n for (i = 0; i < N; i++) {\n if (i) printf( );\n printf( extra , res[i]);\n }\n puts( );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 400005;\n int n, q, K, m, i, j, k, h[N], t[N], num, fa[N], s[N], id[N], size[N], son[N],\n tp[N], dep[N], head[N], adj[N * 2], nxt[N * 2], p[N], cnt, stk[N], top,\n g[N], Head[N], Adj[N * 2], Nxt[N * 2], l, f[N];\n void dfs(int x, int dad) {\n size[x] = 1;\n for (int y = head[x]; y; y = nxt[y])\n if (adj[y] != dad) {\n dep[adj[y]] = dep[x] + 1;\n fa[adj[y]] = x;\n dfs(adj[y], x);\n size[x] += size[adj[y]];\n if (!son[x] || size[adj[y]] > size[son[x]]) son[x] = adj[y];\n }\n }\n void Dfs(int x, int dad) {\n id[x] = ++i;\n if (son[x]) {\n tp[son[x]] = tp[x];\n Dfs(son[x], x);\n }\n for (int y = head[x]; y; y = nxt[y])\n if (adj[y] != dad && adj[y] != son[x]) {\n tp[adj[y]] = adj[y];\n Dfs(adj[y], x);\n }\n }\n int lca(int a, int b) {\n while (tp[a] != tp[b]) {\n if (dep[tp[a]] < dep[tp[b]]) swap(a, b);\n a = fa[tp[a]];\n }\n return dep[a] < dep[b] ? a : b;\n }\n int dis(int a, int b) { return dep[a] + dep[b] - 2 * dep[lca(a, b)]; }\n bool cmp(int a, int b) { return id[a] < id[b]; }\n void addedge(int u, int v) {\n Adj[++l] = v;\n Nxt[l] = Head[u];\n Head[u] = l;\n Adj[++l] = u;\n Nxt[l] = Head[v];\n Head[v] = l;\n }\n void dzx(int x, int dad) {\n if (s[x])\n f[x] = x;\n else\n f[x] = 0;\n for (int y = Head[x], a, b; y; y = Nxt[y])\n if (Adj[y] != dad) {\n dzx(Adj[y], x);\n if (f[Adj[y]] && (!f[x] ||\n 1ll * (a = dis(f[Adj[y]], x) - 1) / s[f[Adj[y]]] <\n 1ll * (b = dis(f[x], x) - 1) / s[f[x]] ||\n 1ll * (a = dis(f[Adj[y]], x) - 1) / s[f[Adj[y]]] ==\n 1ll * (b = dis(f[x], x) - 1) / s[f[x]] &&\n h[f[Adj[y]]] < h[f[x]]))\n f[x] = f[Adj[y]];\n }\n if (s[x]) f[x] = x;\n }\n void phh(int x, int dad, int u) {\n int a, b;\n if (u) {\n if (u && (!f[x] ||\n 1ll * (a = dis(u, x) - 1) / s[u] <\n 1ll * (b = dis(f[x], x) - 1) / s[f[x]] ||\n 1ll * (a = dis(u, x) - 1) / s[u] ==\n 1ll * (b = dis(f[x], x) - 1) / s[f[x]] &&\n h[u] < h[f[x]]))\n f[x] = u;\n }\n if (s[x]) f[x] = x;\n for (int y = Head[x]; y; y = Nxt[y])\n if (Adj[y] != dad) phh(Adj[y], x, f[x]);\n Head[x] = 0;\n }\n int main() {\n scanf( %d , &n);\n for (i = 1; i < n; ++i) {\n scanf( %d%d , &j, &k);\n adj[i * 2 - 1] = k;\n nxt[i * 2 - 1] = head[j];\n head[j] = i * 2 - 1;\n adj[i * 2] = j;\n nxt[i * 2] = head[k];\n head[k] = i * 2;\n }\n dfs(1, -1);\n tp[1] = 1;\n i = 0;\n Dfs(1, -1);\n scanf( %d , &q);\n while (q--) {\n if (n == 10) {\n for (i = 1; i <= n; ++i) Head[i] = h[i] = s[i] = g[i] = t[i] = p[i] = 0;\n }\n scanf( %d%d , &K, &m);\n num = 0;\n for (i = 1; i <= K; ++i) {\n scanf( %d%d , &j, &k);\n s[j] = k;\n h[j] = i;\n t[++num] = j;\n }\n for (i = 1; i <= m; ++i) {\n scanf( %d , &j);\n g[i] = t[++num] = j;\n }\n t[++num] = 1;\n sort(t + 1, t + 1 + num, cmp);\n cnt = 0;\n for (i = 1; i <= num; i = j) {\n for (j = i; j <= num && t[i] == t[j]; ++j)\n ;\n p[++cnt] = t[i];\n }\n if (cnt == 1) {\n puts( 1 );\n continue;\n }\n l = 0;\n stk[1] = p[1], stk[2] = p[2];\n top = 2;\n for (i = 3; i <= cnt; ++i) {\n while (top > 1 && dep[lca(stk[top], p[i])] <= dep[stk[top - 1]]) {\n addedge(stk[top - 1], stk[top]);\n --top;\n }\n if ((j = lca(p[i], stk[top])) == stk[top])\n stk[++top] = p[i];\n else {\n addedge(j, stk[top]);\n stk[top] = j;\n stk[++top] = p[i];\n }\n }\n while (top > 1) {\n addedge(stk[top - 1], stk[top]);\n --top;\n }\n dzx(1, -1);\n phh(1, -1, 0);\n for (i = 1; i <= m; ++i) printf( %d , h[f[g[i]]]);\n puts( );\n for (i = 1; i <= cnt; ++i) s[p[i]] = 0;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int BIG = 1000000;\n int n, k;\n cin >> n >> k;\n string s;\n int a[2][n + 2 * k];\n int x[2][n + 2 * k];\n for (int i = 0; i < 2; i++) {\n cin >> s;\n for (int j = k; j < n + k; j++) {\n if (s[j - k] == '-')\n a[i][j] = 0;\n else\n a[i][j] = 1;\n }\n }\n for (int i = 0; i < 2; i++)\n for (int j = 0; j < k; j++) {\n a[i][j] = 1;\n }\n for (int i = 0; i < 2; i++)\n for (int j = n + k; j < n + 2 * k; j++) {\n a[i][j] = 0;\n }\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < n + 2 * k; j++) {\n x[i][j] = BIG;\n }\n }\n x[0][k] = 0;\n vector v[2][n + 1];\n v[0][0].push_back(k);\n for (int T = 1; T <= n; T++) {\n for (int i = 0; i < 2; i++) {\n for (int J = 0; J < v[(i) % 2][T - 1].size(); J++) {\n int j = v[(i) % 2][T - 1][J];\n if (x[i][j - 1] == BIG && (j - 1 - k) >= T) {\n x[i][j - 1] = (a[i][j - 1] == 1) ? BIG : T;\n if (!(a[i][j - 1] == 1)) v[(i) % 2][T].push_back(j - 1);\n }\n if (x[i][j + 1] == BIG) {\n x[i][j + 1] = (a[i][j + 1] == 1) ? BIG : T;\n if (!(a[i][j + 1] == 1)) v[(i) % 2][T].push_back(j + 1);\n }\n if (x[(i + 1) % 2][j + k] == BIG) {\n x[(i + 1) % 2][j + k] = (a[(i + 1) % 2][j + k] == 1) ? BIG : T;\n if (!(a[(i + 1) % 2][j + k] == 1)) v[(i + 1) % 2][T].push_back(j + k);\n }\n }\n }\n }\n for (int i = 0; i < 2; i++)\n for (int j = n + k; j < n + 2 * k; j++) {\n if (x[i][j] <= n) {\n cout << YES ;\n return 0;\n }\n }\n cout << NO ;\n }\n "} {"func_code_string": "#include\n #define pairs pair\n #define loop(i,a,n) for(int i=a;i siz;\n /*ll indes(ll i,ll right){\n ll val=siz[i];\n ll left=0;\n ll ans=-1;\n while(left<=right){\n ll mid=(left+right)/2;\n if(2*siz[mid]<=val){\n ans=mid;\n left=mid+1;\n }\n else\n {\n right=mid-1;\n }\n \n }\n return ans; \n }*/\n map mp;\n \n void solve(){\n ll n,k;\n cin>>n>>k;\n vector vec(n);\n vector range(n);\n loop(i,0,n){\n cin>>vec[i];\n }\n range[0].fi=vec[0];\n range[0].se=vec[0];\n range[n-1].fi=vec[n-1];\n range[n-1].se=vec[n-1];\n for(ll i=1;i=d||b+k<=c){\n cout<< NO ;\n return;\n }\n \n }\n cout<< YES ;\n return;\n }\n int main(){\n int test=1;\n cin>>test;\n while(test--){\n solve();\n cout<\n using namespace std;\n const int Mod = 1e9 + 7;\n int main() {\n long long N, M, ans = 0, Last = 0;\n scanf( %I64d%I64d , &N, &M);\n long long Min = min(N, M);\n for (long long i = 1, j; i <= Min; i = j + 1) {\n j = min(N / (N / i), M);\n long long tmp;\n if (j & 1LL)\n tmp = ((j + 1) / 2 % Mod) * (j % Mod) % Mod;\n else\n tmp = (j / 2 % Mod) * ((j + 1) % Mod) % Mod;\n ans =\n (ans + (N / i) % Mod * (((tmp - Last) % Mod + Mod) % Mod) % Mod) % Mod;\n Last = tmp;\n }\n ans = (((N % Mod) * (M % Mod) - ans) % Mod + Mod) % Mod;\n printf( %I64d , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int Mod = 1e9 + 7;\n int main() {\n long long N, M, ans = 0, Last = 0;\n scanf( extraextra , &N, &M);\n long long Min = min(N, M);\n for (long long i = 1, j; i <= Min; i = j + 1) {\n j = min(N / (N / i), M);\n long long tmp;\n if (j & 1LL)\n tmp = ((j + 1) / 2 % Mod) * (j % Mod) % Mod;\n else\n tmp = (j / 2 % Mod) * ((j + 1) % Mod) % Mod;\n ans =\n (ans + (N / i) % Mod * (((tmp - Last) % Mod + Mod) % Mod) % Mod) % Mod;\n Last = tmp;\n }\n ans = (((N % Mod) * (M % Mod) - ans) % Mod + Mod) % Mod;\n printf( extra , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 2E5 + 10, mod = 1E9 + 7, M = 1E6 + 10, lim = 1E6;\n int n, m, a[N], s[N], ans[N];\n struct node {\n int l, r, num;\n } p[N];\n vector f[M];\n int pos[M];\n inline int cmp(node x, node y) { return x.r < y.r; }\n struct sgtree {\n int l, r, sum;\n } t[N << 2];\n inline int ksm(int x, int y) {\n return y == 1\n ? x\n : 1ll * ksm(1ll * x * x % mod, y >> 1) * ((y & 1) ? x : 1) % mod;\n }\n inline void pl(int l = 1, int r = n, int x = 1) {\n t[x] = (sgtree){l, r, 1};\n if (l == r) return;\n int mid = l + r >> 1;\n pl(l, mid, x << 1);\n pl(mid + 1, r, x << 1 | 1);\n }\n inline void modify(int l, int r, int v, int x = 1) {\n if (l == t[x].l && r == t[x].r) {\n t[x].sum = 1ll * t[x].sum * v % mod;\n return;\n }\n int mid = t[x].l + t[x].r >> 1;\n if (r <= mid)\n modify(l, r, v, x << 1);\n else if (l > mid)\n modify(l, r, v, x << 1 | 1);\n else\n modify(l, mid, v, x << 1), modify(mid + 1, r, v, x << 1 | 1);\n }\n inline void insert(int v, int x) {\n for (int i = 0; i < f[v].size(); i++) {\n modify(pos[f[v][i]] + 1, x,\n 1ll * ksm(f[v][i], mod - 2) * (f[v][i] - 1) % mod);\n pos[f[v][i]] = x;\n }\n }\n inline int query(int l, int x = 1) {\n if (t[x].l == t[x].r) return t[x].sum;\n int mid = t[x].l + t[x].r >> 1;\n return 1ll * t[x].sum * (l <= mid ? query(l, x << 1) : query(l, x << 1 | 1)) %\n mod;\n }\n inline int sol(int l, int r) {\n return 1ll * s[r] * ksm(s[l - 1], mod - 2) % mod * query(l) % mod;\n }\n int main() {\n scanf( %d , &n);\n s[0] = 1;\n for (int i = 1; i <= n; i++) {\n scanf( %d , &a[i]);\n s[i] = 1ll * s[i - 1] * a[i] % mod;\n }\n scanf( %d , &m);\n pl();\n for (int i = 1; i <= m; i++) {\n scanf( %d%d , &p[i].l, &p[i].r);\n p[i].num = i;\n }\n sort(p + 1, p + 1 + m, cmp);\n int now = 1;\n for (int i = 2; i <= lim; i++)\n if (!f[i].size())\n for (int j = 1; i * j <= lim; j++) f[i * j].push_back(i);\n for (int i = 1; i <= n; i++) {\n insert(a[i], i);\n while (now <= m && p[now].r == i) {\n ans[p[now].num] = sol(p[now].l, p[now].r);\n now++;\n }\n }\n for (int i = 1; i <= m; i++) printf( %d\n , ans[i]);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long fact[1000010];\n long long m = 1e9 + 7;\n long long me(long long a, long long b, long long m) {\n long long ans = 1;\n while (b > 0) {\n if (b % 2 == 1) {\n ans = (ans % m * a % m) % m;\n }\n a = (a * a) % m;\n b /= 2;\n }\n return ans % m;\n }\n bool check(long long x, long long a, long long b) {\n while (x > 0) {\n int dg = x % 10;\n if (dg != a && dg != b) return false;\n x /= 10;\n }\n return true;\n }\n long long ncr(long long n, long long r) {\n long long fn = fact[n];\n long long tf = fact[r] * fact[n - r];\n tf = tf % m;\n tf = me(tf, m - 2, m);\n fn = (tf % m * fn % m) % m;\n return fn % m;\n }\n int main() {\n fact[0] = 1;\n for (long long i = 1; i <= 1000001; i++) {\n fact[i] = (fact[i - 1] * i) % m;\n }\n int n, a, b;\n cin >> a >> b >> n;\n if (a == b) {\n if (check(n * a, a, b)) {\n cout << 1\n ;\n } else\n cout << 0\n ;\n return 0;\n }\n long long ans = 0;\n for (long long i = 0; i <= n; i++) {\n long long tmp = i * a + (n - i) * b;\n if (check(tmp, a, b)) {\n ans += ncr(n, i);\n ans %= m;\n }\n }\n cout << ans << \n ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n while (cin >> n) {\n string s;\n cin >> s;\n string res = ;\n for (int i = 0; i < n; i++) {\n if (s[i] <= '1')\n continue;\n else {\n if (s[i] == '4')\n res += '3', res += '2', res += '2';\n else {\n if (s[i] == '6')\n res += '5', res += '3';\n else {\n if (s[i] == '8')\n res += '7', res += '2', res += '2', res += '2';\n else {\n if (s[i] == '9')\n res += '3', res += '3', res += '2', res += '7';\n else\n res += s[i];\n }\n }\n }\n }\n }\n sort(res.begin(), res.end());\n reverse(res.begin(), res.end());\n cout << res << endl;\n }\n }\n "} @@ -2192,7 +2192,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n string a, b;\n int k = 0, l = 0, n;\n cin >> a >> b;\n n = a.size();\n for (int i = 0; i < n; i++) {\n if (a[i] == '4' && b[i] == '7') {\n k++;\n } else if (a[i] == '7' && b[i] == '4') {\n l++;\n }\n }\n int p = max(k, l);\n cout << p << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n #pragma GCC optimize( O3 )\n #pragma GCC target( sse4 )\n using namespace std;\n template \n T gcd(T a, T b) {\n return ((b == 0) ? a : gcd(b, a % b));\n }\n void solve() {\n int n, k;\n long long x;\n cin >> n >> k >> x;\n string s;\n cin >> s;\n x--;\n int cnt = 0;\n vector nm;\n for (int i = n - 1; i >= 0; i--) {\n if (s[i] == '*')\n cnt++;\n else {\n if (cnt) nm.push_back(cnt);\n cnt = 0;\n }\n }\n if (cnt) nm.push_back(cnt);\n int uwu = 0;\n vector d;\n while (x > 0) {\n int cr = (nm[uwu++] * k) + 1;\n d.push_back(x % cr);\n x /= cr;\n }\n int ind = 0, lst = -1;\n string ans = ;\n for (int i = n - 1; i >= 0; i--) {\n if (s[i] == 'a')\n ans += 'a', lst = 1;\n else {\n if (!lst) continue;\n if (ind == (int)(d.size())) continue;\n for (int j = 0; j < (int)(d[ind]); j++) ans += 'b';\n ind++;\n lst = 0;\n }\n }\n reverse(ans.begin(), ans.end());\n cout << ans << '\n';\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n int t;\n cin >> t;\n while (t--) solve();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int tt;\n cin >> tt;\n while (tt--) {\n long long n, s, t;\n cin >> n >> s >> t;\n cout << max(n - s + 1, n - t + 1) << '\n';\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n long long f[105], g[105][2], q[105], t, n;\n int main() {\n f[1] = 1;\n f[2] = 2;\n for (int i = 3; i <= 86; ++i) f[i] = f[i - 1] + f[i - 2];\n int cases;\n for (scanf( %d , &cases); cases--;) {\n scanf( %I64d , &n);\n t = 0;\n for (int i = 86; i; --i)\n if (f[i] <= n) q[++t] = i, n -= f[i];\n g[t][0] = 1;\n g[t][1] = (q[t] - 1) >> 1;\n for (int i = t - 1; i; --i) {\n g[i][0] = g[i + 1][0] + g[i + 1][1];\n int l = q[i] - q[i + 1] - 1;\n g[i][1] = (l >> 1) * g[i + 1][0] + ((l + 1) >> 1) * g[i + 1][1];\n }\n printf( %I64d\n , g[1][0] + g[1][1]);\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long f[105], g[105][2], q[105], t, n;\n int main() {\n f[1] = 1;\n f[2] = 2;\n for (int i = 3; i <= 86; ++i) f[i] = f[i - 1] + f[i - 2];\n int cases;\n for (scanf( %d , &cases); cases--;) {\n scanf( extra , &n);\n t = 0;\n for (int i = 86; i; --i)\n if (f[i] <= n) q[++t] = i, n -= f[i];\n g[t][0] = 1;\n g[t][1] = (q[t] - 1) >> 1;\n for (int i = t - 1; i; --i) {\n g[i][0] = g[i + 1][0] + g[i + 1][1];\n int l = q[i] - q[i + 1] - 1;\n g[i][1] = (l >> 1) * g[i + 1][0] + ((l + 1) >> 1) * g[i + 1][1];\n }\n printf( extra\n , g[1][0] + g[1][1]);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n namespace runzhe2000 {\n const int INF = 1 << 29;\n int ft[100005], gt[100005], f[100005][10], g[100005][10], timer = 1, c[10],\n sta[100005], top;\n char s[100005];\n bool insta[100005];\n struct node {\n int l, r, v;\n } no[100005];\n void del(int x) {\n no[no[x].l].r = no[x].r;\n no[no[x].r].l = no[x].l;\n }\n void main() {\n int n, q;\n scanf( %d%d%s , &n, &q, s + 1);\n for (int i = 1, v; i <= n; i++) {\n if (s[i] >= '0' && s[i] <= '9')\n v = s[i] - '0';\n else\n v = s[i] == '<' ? 11 : 10;\n no[i] = (node){i - 1, i + 1, v};\n }\n memset(ft, 63, sizeof(ft));\n memset(gt, 63, sizeof(gt));\n ++timer;\n ++n;\n no[n] = (node){n - 1, n + 1, 10};\n for (int l = 1; l <= n; l++)\n if (ft[l] > INF) {\n for (int cur = l, next, pos = 10; l <= cur && cur <= n;\n cur = next, ++timer) {\n if (timer < ft[cur]) {\n ft[cur] = timer;\n for (int i = 0; i < 10; i++) f[cur][i] = c[i];\n }\n if (no[cur].v < 10) {\n c[no[cur].v--]++;\n if (no[cur].v < 0) del(cur);\n } else {\n pos = no[cur].v;\n }\n next = pos == 11 ? no[cur].l : no[cur].r;\n if (no[cur].v > 9 && no[next].v > 9) del(cur);\n if (!insta[cur]) sta[++top] = cur, insta[cur] = 1;\n if (pos == 11) {\n for (; no[cur].l < sta[top] && sta[top] <= cur && top; --top) {\n gt[sta[top]] = ++timer;\n for (int i = 0; i < 10; i++) g[sta[top]][i] = c[i];\n }\n }\n }\n }\n for (; q--;) {\n int l, r;\n scanf( %d%d , &l, &r);\n if (ft[r + 1] < gt[l]) {\n for (int i = 0; i < 10; i++)\n printf( %d%c , f[r + 1][i] - f[l][i], i == 9 ? '\n' : ' ');\n } else {\n for (int i = 0; i < 10; i++)\n printf( %d%c , g[l][i] - f[l][i], i == 9 ? '\n' : ' ');\n }\n }\n }\n } // namespace runzhe2000\n int main() { runzhe2000::main(); }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n string s;\n cin >> s;\n int r = 0, b = 0, y = 0, g = 0;\n int len = s.size();\n for (int i = 0; i < len; i++) {\n if (s[i] == 'B')\n b = i % 4;\n else if (s[i] == 'G')\n g = i % 4;\n else if (s[i] == 'R')\n r = i % 4;\n else if (s[i] == 'Y')\n y = i % 4;\n }\n int w = 0, x = 0, yy = 0, z = 0, pos;\n for (int i = 0; i < len; i++) {\n if (s[i] == '!') {\n pos = i % 4;\n if (pos == r)\n w++;\n else if (pos == b)\n x++;\n else if (pos == y)\n yy++;\n else if (pos == g)\n z++;\n }\n }\n cout << w << << x << << yy << << z << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n int main() {\n unsigned short x;\n std::cin >> x;\n (x > 1) ? std::cout << x << << x : std::cout << -1;\n }\n "} @@ -2264,7 +2264,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n int nump;\n int arr[7];\n scanf( %d , &nump);\n scanf( %d , &arr[0]);\n for (int i = 1; i < 7; i++) {\n scanf( %d , &arr[i]);\n arr[i] += arr[i - 1];\n }\n int tmp = (nump / arr[6]), idx = 0;\n if (tmp && arr[6] * tmp >= nump)\n tmp = (tmp - 1) * arr[6];\n else\n tmp *= arr[6];\n while (tmp + arr[idx] < nump) idx++;\n printf( %d\n , idx + 1);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n string s, s1, s2;\n getline(cin, s);\n getline(cin, s1);\n getline(cin, s2);\n int substr = s.find(s1), substr1;\n int forward = 0, backward = 0;\n if (substr != -1) {\n substr1 = s.find(s2, substr + s1.length());\n if (substr1 != -1) forward = 1;\n }\n string inverted;\n for (substr = 0; substr <= s.length() - 1; substr++)\n inverted = s[substr] + inverted;\n substr = inverted.find(s1);\n if (substr != -1) {\n substr1 = inverted.find(s2, substr + s1.length());\n if (substr1 != -1) backward = 1;\n }\n if (forward == 1 && backward == 0) cout << forward << endl;\n if (forward == 0 && backward == 1) cout << backward << endl;\n if (forward == 1 && backward == 1) cout << both << endl;\n if (forward == 0 && backward == 0) cout << fantasy << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int Maxn = 50005;\n char str[Maxn];\n int hs[26];\n int main() {\n scanf( %s , str);\n int len = strlen(str), cCnt = 0;\n int xNum = 0, sta = 0;\n bool ok = false;\n int i;\n for (i = 0; i < len; i++) {\n if (i - sta >= 26 && cCnt + xNum == 26) {\n ok = true;\n for (int j = sta; j < sta + 26; j++) {\n if (str[j] == '?') {\n for (int k = 0; k < 26; k++) {\n if (hs[k] == 0) {\n hs[k] = 1;\n str[j] = 'A' + k;\n break;\n }\n }\n }\n }\n break;\n }\n if (str[i] == '?')\n xNum++;\n else {\n if (hs[str[i] - 'A'] == 0) {\n hs[str[i] - 'A'] = 1;\n cCnt++;\n } else {\n hs[str[i] - 'A']++;\n cCnt++;\n for (int j = sta; j < i; j++) {\n if (str[j] == str[i]) {\n hs[str[j] - 'A']--;\n cCnt--;\n sta = j + 1;\n break;\n } else {\n if (str[j] == '?')\n xNum--;\n else {\n hs[str[j] - 'A']--;\n cCnt--;\n }\n }\n }\n }\n }\n }\n if (!ok && i - sta >= 26 && cCnt + xNum == 26) {\n ok = true;\n for (int j = sta; j < sta + 26; j++) {\n if (str[j] == '?') {\n for (int k = 0; k < 26; k++) {\n if (hs[k] == 0) {\n hs[k] = 1;\n str[j] = 'A' + k;\n break;\n }\n }\n }\n }\n }\n if (ok) {\n for (int i = 0; i < len; i++) {\n if (str[i] == '?') str[i] = 'A';\n }\n printf( %s\n , str);\n } else {\n puts( -1 );\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int maxn = 1e5 + 30;\n int n, a[maxn];\n long long k, res;\n bool check(long long x) {\n long long sum = 0;\n for (int i = 0; i < n; ++i) {\n sum += min((long long)a[i], x);\n if (sum > k) return false;\n }\n return true;\n }\n int main() {\n scanf( %d%I64d , &n, &k);\n long long sum = 0;\n for (int i = 0; i < n; ++i) {\n scanf( %d , &a[i]);\n sum += a[i];\n }\n if (k > sum) {\n printf( -1\n );\n return 0;\n }\n long long l = 0, r = sum;\n while (l <= r) {\n long long m = l + (r - l) / 2;\n if (check(m))\n l = m + 1;\n else\n r = m - 1;\n }\n sum = 0;\n for (int i = 0; i < n; ++i) sum += min((long long)a[i], r);\n res = k - sum;\n int st = 0, flag = 1;\n for (int i = 0; i < n; ++i) {\n a[i] -= min((long long)a[i], r);\n if (a[i]) {\n if (res == 0 && flag) {\n flag = 0;\n st = i;\n } else if (res > 0) {\n --res;\n --a[i];\n }\n }\n }\n for (int i = st; i < n; ++i)\n if (a[i]) printf( %d , i + 1);\n for (int i = 0; i < st; ++i)\n if (a[i]) printf( %d , i + 1);\n puts( );\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int maxn = 1e5 + 30;\n int n, a[maxn];\n long long k, res;\n bool check(long long x) {\n long long sum = 0;\n for (int i = 0; i < n; ++i) {\n sum += min((long long)a[i], x);\n if (sum > k) return false;\n }\n return true;\n }\n int main() {\n scanf( %dextra , &n, &k);\n long long sum = 0;\n for (int i = 0; i < n; ++i) {\n scanf( %d , &a[i]);\n sum += a[i];\n }\n if (k > sum) {\n printf( -1\n );\n return 0;\n }\n long long l = 0, r = sum;\n while (l <= r) {\n long long m = l + (r - l) / 2;\n if (check(m))\n l = m + 1;\n else\n r = m - 1;\n }\n sum = 0;\n for (int i = 0; i < n; ++i) sum += min((long long)a[i], r);\n res = k - sum;\n int st = 0, flag = 1;\n for (int i = 0; i < n; ++i) {\n a[i] -= min((long long)a[i], r);\n if (a[i]) {\n if (res == 0 && flag) {\n flag = 0;\n st = i;\n } else if (res > 0) {\n --res;\n --a[i];\n }\n }\n }\n for (int i = st; i < n; ++i)\n if (a[i]) printf( %d , i + 1);\n for (int i = 0; i < st; ++i)\n if (a[i]) printf( %d , i + 1);\n puts( );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int x[3], y[3], r[3];\n double ansx, ansy;\n bool bisecting_normal(double x1, double y1, double x2, double y2, double &a,\n double &b, double &c) {\n double xm = (x1 + x2) * 0.5;\n double ym = (y1 + y2) * 0.5;\n double xl = x2 - x1;\n double yl = y2 - y1;\n if (fabs(xl) < 1.0e-10 && fabs(yl) < 1.0e-10) return false;\n a = xl;\n b = yl;\n c = -xl * xm - yl * ym;\n return true;\n }\n bool dividing_locus(double x1, double y1, double r1, double x2, double y2,\n double r2, double &xa, double &ya, double &ra) {\n double a, b, c;\n if (fabs(r1 - r2) < 1.0e-10) return false;\n a = -r1 * r1;\n b = r2 * r2;\n c = a + b;\n a /= c;\n b /= c;\n xa = x1 * b + x2 * a;\n ya = y1 * b + y2 * a;\n ra = fabs(r1 * r2 / c) * sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));\n return true;\n }\n bool line2line() {\n double a, b, c, d, e, f, g;\n bisecting_normal(x[0], y[0], x[1], y[1], a, b, c);\n bisecting_normal(x[0], y[0], x[2], y[2], d, e, f);\n g = a * e - b * d;\n if (fabs(g) < 1.0e-10) return false;\n ansx = (b * f - e * c) / g;\n ansy = (d * c - a * f) / g;\n return true;\n }\n bool line2circle(int z) {\n int z1, z2;\n double a, b, c, d, e, s, t, u, n, xm, ym, xa1, xa2, ya1, ya2, d1, d2;\n z1 = (z + 1) % 3;\n z2 = (z + 2) % 3;\n bisecting_normal(x[z1], y[z1], x[z2], y[z2], a, b, c);\n dividing_locus(x[z], y[z], r[z], x[z1], y[z1], r[z1], s, t, u);\n n = sqrt(a * a + b * b);\n d = (a * s + b * t + c) / n;\n if (d > u) return false;\n xm = s - d * a / n;\n ym = t - d * b / n;\n e = sqrt(u * u - d * d);\n xa1 = xm + e * b / n;\n ya1 = ym - e * a / n;\n xa2 = xm - e * b / n;\n ya2 = ym + e * a / n;\n d1 = (xa1 - x[z]) * (xa1 - x[z]) + (ya1 - y[z]) * (ya1 - y[z]);\n d2 = (xa2 - x[z]) * (xa2 - x[z]) + (ya2 - y[z]) * (ya2 - y[z]);\n if (d1 < d2) {\n ansx = xa1;\n ansy = ya1;\n } else {\n ansx = xa2;\n ansy = ya2;\n }\n return true;\n }\n bool circle2circle() {\n double a, b, c, d, f, e, s1, t1, u1, s2, t2, u2, xm, ym, xv, yv, xa1, xa2,\n ya1, ya2, d1, d2;\n dividing_locus(x[0], y[0], r[0], x[1], y[1], r[1], s1, t1, u1);\n dividing_locus(x[0], y[0], r[0], x[2], y[2], r[2], s2, t2, u2);\n xv = t2 - t1;\n yv = s1 - s2;\n d = xv * xv + yv * yv;\n if ((u1 + u2) * (u1 + u2) < d || (u1 - u2) * (u1 - u2) > d) return false;\n a = d + u1 * u1 - u2 * u2;\n b = d - u1 * u1 + u2 * u2;\n c = a + b;\n a /= c;\n b /= c;\n xm = s1 * b + s2 * a;\n ym = t1 * b + t2 * a;\n d = sqrt(d);\n xv /= d;\n yv /= d;\n f = (d * d + u1 * u1 - u2 * u2) / (2. * d);\n e = fabs(sqrt(u1 * u1 - f * f));\n xa1 = xm + e * xv;\n ya1 = ym + e * yv;\n xa2 = xm - e * xv;\n ya2 = ym - e * yv;\n d1 = (xa1 - x[0]) * (xa1 - x[0]) + (ya1 - y[0]) * (ya1 - y[0]);\n d2 = (xa2 - x[0]) * (xa2 - x[0]) + (ya2 - y[0]) * (ya2 - y[0]);\n if (d1 < d2) {\n ansx = xa1;\n ansy = ya1;\n } else {\n ansx = xa2;\n ansy = ya2;\n }\n return true;\n }\n int main() {\n bool exists;\n for (int i = 0; i < 3; i++) {\n cin >> x[i] >> y[i] >> r[i];\n }\n if (r[0] == r[1]) {\n if (r[0] == r[2]) {\n exists = line2line();\n } else {\n exists = line2circle(2);\n }\n } else {\n if (r[0] == r[2]) {\n exists = line2circle(1);\n } else {\n exists = circle2circle();\n }\n }\n if (exists) {\n cout << fixed << setprecision(5) << ansx << << ansy << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long inf = 2000000002;\n pair p[100005];\n long long minl[100005], maxl[100005], minr[100005], maxr[100005];\n int main() {\n int i, j, n, a, b;\n while (~scanf( %d , &n)) {\n for (i = 0; i < n; i++) {\n scanf( %d%d , &a, &b);\n p[i] = make_pair(a - b, a + b);\n }\n sort(p, p + n);\n minl[0] = maxl[0] = p[0].second;\n for (i = 1; i < n; i++)\n minl[i] = min(minl[i - 1], p[i].second),\n maxl[i] = max(maxl[i - 1], p[i].second);\n minr[n - 1] = maxr[n - 1] = p[n - 1].second;\n for (i = n - 2; i >= 0; i--)\n minr[i] = min(minr[i + 1], p[i].second),\n maxr[i] = max(maxr[i + 1], p[i].second);\n long long l = 0, r = 4 * inf;\n while (l < r) {\n long long s = (l + r) / 2;\n bool can = 0;\n j = 0;\n for (i = 0; i < n; i++) {\n while (j < n - 1 && p[j + 1].first - p[i].first <= s) j++;\n if (i == 0 && j == n - 1) {\n can = true;\n break;\n }\n long long miny = inf, maxy = -inf;\n if (i > 0) miny = min(minl[i - 1], miny), maxy = max(maxl[i - 1], maxy);\n if (j < n - 1)\n miny = min(miny, minr[j + 1]), maxy = max(maxr[j + 1], maxy);\n if (maxy - miny <= s) can = true;\n if (can) break;\n }\n if (can)\n r = s;\n else\n l = s + 1;\n }\n double t = l * 0.5;\n printf( %.8lf\n , t);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n int map[2001][2001] = {0};\n int ans[2001] = {0};\n int n, m, k;\n char ss[2001];\n void show() {\n int i, j;\n for (i = 0; i < n; i++) {\n for (j = 0; j < m; j++) {\n printf( %d , map[i][j]);\n }\n printf( \n );\n }\n }\n int main() {\n int i, j, k;\n scanf( %d %d %d , &n, &m, &k);\n for (i = 0; i < n; i++) {\n scanf( %s , ss);\n for (j = 0; j < m; j++) {\n if (ss[j] == '.') {\n map[i][j] = 0;\n } else if (ss[j] == 'L') {\n map[i][j] = 1;\n } else if (ss[j] == 'R') {\n map[i][j] = 2;\n } else if (ss[j] == 'U') {\n map[i][j] = 4;\n } else {\n map[i][j] = 8;\n }\n }\n }\n for (i = 0; i < n; i++) {\n for (j = 0; j < m; j++) {\n if (map[i][j] == 1) {\n if (i <= j) ans[j - i]++;\n } else if (map[i][j] == 2) {\n if (i < m - j) ans[i + j]++;\n } else if (map[i][j] == 4) {\n if (!(i & 1)) ans[j]++;\n } else if (map[i][j] == 8) {\n }\n }\n }\n printf( %d , ans[0]);\n for (i = 1; i < m; i++) {\n printf( %d , ans[i]);\n }\n printf( \n );\n return 0;\n }\n "} @@ -2320,7 +2320,7 @@ {"func_code_string": "#include \n using namespace std;\n using namespace std;\n const long long N = 4e7 + 5, N_ = 4e6 + 5;\n int cnt = 0, prime[N_];\n bitset vis;\n void pre() {\n for (int i = 2; i < N; ++i) {\n if (!vis[i]) prime[cnt++] = i;\n for (int j = 0; i * prime[j] < N; ++j) {\n vis[i * prime[j]] = 1;\n if (i % prime[j] == 0) break;\n }\n }\n }\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int n, m;\n cin >> n;\n if (n == 2) {\n cout << 1 1 << endl;\n return 0;\n }\n if (n == 3) {\n cout << 1 1 2 << endl;\n return 0;\n }\n if (n == 4) {\n cout << 1 1 2 1 << endl;\n return 0;\n }\n if (n == 5) {\n cout << 1 2 1 1 1 << endl;\n return 0;\n }\n if (n == 6) {\n cout << 1 2 1 1 1 1 << endl;\n return 0;\n }\n pre();\n m = n * (n + 1) / 2;\n bool sign = 0;\n vector res(n + 1, 0);\n int flag = 0;\n if (m & 1) {\n if (!vis[m - 2]) {\n ++res[2];\n res.erase(res.begin());\n for (auto i : res) cout << i + 1 << ;\n cout << endl;\n return 0;\n }\n m -= 3;\n flag = 3;\n res[3] = 2;\n }\n for (auto i : prime) {\n int t = m - i;\n if (!i || t < 0) break;\n if (!vis[t]) {\n for (int i = n; t && i > flag; --i) {\n if (i == flag) continue;\n if (i <= t) {\n t -= i;\n ++res[i];\n }\n }\n if (t) {\n res = vector(n + 1, 0);\n res[flag] = 2;\n } else {\n sign = 1;\n break;\n }\n }\n }\n if (!sign) {\n cout << -1 << endl;\n return 0;\n }\n res.erase(res.begin());\n for (auto i : res) cout << i + 1 << ;\n cout << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long n, m;\n inline long long read() {\n long long x = 0, f = 1;\n char ch = getchar();\n while (ch < '0' || ch > '9') {\n if (ch == '-') f = -1;\n ch = getchar();\n }\n while (ch >= '0' && ch <= '9') {\n x = (x << 3) + (x << 1) + ch - '0';\n ch = getchar();\n }\n return x * f;\n }\n long long qpow(long long a, long long b) {\n long long ans = 1;\n while (b) {\n if (b & 1) ans = 1ll * ans * a % 1000000007;\n a = 1ll * a * a % 1000000007;\n b >>= 1;\n }\n return ans % 1000000007;\n }\n signed main() {\n cin >> n >> m;\n long long c = n - m + 1;\n c *= 2;\n n++;\n n *= 2;\n m--;\n long long tot = qpow(n, m);\n long long amo = (c * tot) % 1000000007;\n amo %= 1000000007;\n cout << amo;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, k;\n int pr(int i) { return (i - 1 + n) % n; }\n int nx(int i) { return (i + 1) % n; }\n int get(int i, int j) {\n if (i > j) swap(i, j);\n return min(j - i, n - j + i);\n }\n char no(char el) {\n if (el == 'B')\n return 'W';\n else\n return 'B';\n }\n int gg(string s) {\n int b = 1;\n for (char i : s) {\n if (i != 'B') b = 0;\n }\n int w = 1;\n for (char i : s) {\n if (i != 'W') w = 0;\n }\n return max(w, b);\n }\n signed main() {\n string s;\n cin >> n >> k >> s;\n if (gg(s)) {\n cout << s;\n return 0;\n }\n vector used(n, 0);\n int l = 0, r = 0, op = 1e6;\n bool ch = false;\n while (l < n && op > 0) {\n --op;\n if (used[l]) {\n ++l;\n } else if (s[l] == s[pr(l)]) {\n ch = true;\n while (s[l] == s[nx(l)]) used[l] = 1, l = nx(l);\n r = nx(l);\n while (s[r] != s[nx(r)]) used[r] = 1, r = nx(r);\n int cr = r;\n while (s[nx(cr)] == s[cr]) used[cr] = 1, cr = nx(cr);\n char last = s[l];\n for (int i = nx(l); i != r; i = nx(i)) {\n if (get(l, i) > k && get(r, i) > k)\n s[i] = no(last), last = no(last);\n else if (get(l, i) < get(r, i))\n s[i] = s[l], last = s[l];\n else if (get(l, i) >= get(r, i))\n s[i] = s[r], last = s[r];\n }\n ++l;\n } else {\n ++l;\n }\n }\n if (!ch) {\n if (k % 2 == 0)\n cout << s;\n else\n for (char i : s) cout << no(i);\n return 0;\n }\n cout << s;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n vector g[100100];\n int aa[100100];\n long long dfs(int u, int fa) {\n vector tmp;\n for (int i = 0; i < g[u].size(); i++) {\n int v = g[u][i];\n if (v != fa && aa[v] - 1 >= 0) {\n aa[v] -= 1;\n tmp.push_back(dfs(v, u));\n }\n }\n sort(tmp.begin(), tmp.end());\n int cc = tmp.size();\n long long ans = 0;\n for (int i = aa[u]; i >= 1; i--) {\n if (cc > 0) {\n ans += tmp[--cc] + 2;\n aa[u]--;\n } else {\n break;\n }\n }\n for (int i = 0; i < g[u].size(); i++) {\n int v = g[u][i];\n if (v != fa) {\n int tmp = min(aa[u], aa[v]);\n ans += tmp * 2;\n aa[u] -= tmp;\n aa[v] -= tmp;\n }\n }\n return ans;\n }\n int main() {\n int n;\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) {\n scanf( %d , &aa[i]);\n }\n for (int i = 0; i < n - 1; i++) {\n int u, v;\n scanf( %d%d , &u, &v);\n g[u].push_back(v);\n g[v].push_back(u);\n }\n int s;\n scanf( %d , &s);\n printf( %I64d\n , dfs(s, -1));\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n vector g[100100];\n int aa[100100];\n long long dfs(int u, int fa) {\n vector tmp;\n for (int i = 0; i < g[u].size(); i++) {\n int v = g[u][i];\n if (v != fa && aa[v] - 1 >= 0) {\n aa[v] -= 1;\n tmp.push_back(dfs(v, u));\n }\n }\n sort(tmp.begin(), tmp.end());\n int cc = tmp.size();\n long long ans = 0;\n for (int i = aa[u]; i >= 1; i--) {\n if (cc > 0) {\n ans += tmp[--cc] + 2;\n aa[u]--;\n } else {\n break;\n }\n }\n for (int i = 0; i < g[u].size(); i++) {\n int v = g[u][i];\n if (v != fa) {\n int tmp = min(aa[u], aa[v]);\n ans += tmp * 2;\n aa[u] -= tmp;\n aa[v] -= tmp;\n }\n }\n return ans;\n }\n int main() {\n int n;\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) {\n scanf( %d , &aa[i]);\n }\n for (int i = 0; i < n - 1; i++) {\n int u, v;\n scanf( %d%d , &u, &v);\n g[u].push_back(v);\n g[v].push_back(u);\n }\n int s;\n scanf( %d , &s);\n printf( extra\n , dfs(s, -1));\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n string s;\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n ;\n long long int TESTS, k, a, n, b, c, d, m, x, i, y, z;\n cin >> TESTS;\n while (TESTS--) {\n cin >> n;\n cin >> s;\n long long int ans = n;\n for (long long int i = 0; i <= n - 1; i++) {\n if (s[i] == '1') {\n a = max(i + 1, n - i);\n ans = max(ans, 2 * a);\n }\n }\n cout << ans << \n ;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n cin >> n;\n if (n == 1)\n cout << -1;\n else\n cout << (n % 2 == 0 ? n : n - 1) << 2 ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int limit = 10000;\n int query(vector &v) {\n int n = (int)v.size();\n cout << n << ' ';\n for (int i = 0; i < n; i++) {\n cout << v[i] << (i == n - 1 ? '\n' : ' ');\n }\n int k;\n cin >> k;\n if (k == -1) {\n exit(0);\n } else if (k == -2) {\n assert(false);\n }\n return k;\n }\n int main() {\n vector> dp(6, vector(10010));\n for (int q = 1; q <= 5; q++) {\n for (long long p = 1; p <= limit; p++) {\n if (q == 5 && p == 2) {\n break;\n }\n long long x = p;\n for (int i = 0; i < p; i++) {\n x += dp[q - 1][min(10000LL, x)];\n x++;\n }\n x += dp[q - 1][min(10000LL, x)];\n dp[q][p] = x - p;\n }\n }\n long long lb = 1, ub = 10004205361450474LL;\n for (int q = 5; q >= 1; q--) {\n vector hoge;\n long long x = lb;\n for (int i = 0; i < min(10000LL, lb); i++) {\n x += dp[q - 1][min((long long)10000, x)];\n hoge.push_back(x);\n x++;\n }\n x += dp[q - 1][min(10000LL, x)];\n int k = query(hoge);\n if (k == 0) {\n ub = hoge[0] - 1;\n } else if (k == (int)hoge.size()) {\n lb = hoge.back() + 1;\n } else {\n lb = hoge[k - 1] + 1;\n ub = hoge[k] - 1;\n }\n }\n return 0;\n }\n "} @@ -2365,7 +2365,7 @@ {"func_code_string": "#include \n using namespace std;\n long long dp[200005][2];\n bool vst[200005][2];\n long long A[200005], n;\n long long go(long long v, bool b) {\n if (vst[v][b]) return dp[v][b];\n vst[v][b] = true;\n long long val = 0;\n if (!b) {\n if ((v - A[v]) > 1)\n val = go(v - A[v], b ^ 1);\n else if ((v - A[v]) == 1)\n val = -1;\n } else {\n if ((v + A[v]) <= n) val = go(v + A[v], b ^ 1);\n }\n if (val != -1)\n dp[v][b] = A[v] + val;\n else\n dp[v][b] = -1;\n return dp[v][b];\n }\n int main() {\n long long i;\n cin >> n;\n for (i = (2); i <= (n); i++) {\n cin >> A[i];\n }\n memset((vst), (0), sizeof(vst));\n long long j;\n memset((dp), (-1), sizeof(dp));\n for (i = (2); i <= (n); i++) {\n go(i, 0);\n if (dp[i][0] != -1)\n cout << dp[i][0] + i - 1 << endl;\n else\n cout << -1 << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const double eps = 1e-10;\n const double Pi = 3.1415926535897932;\n const int dir[4][2] = {-1, 0, 0, -1, 1, 0, 0, 1};\n const int maxn = 1e4 + 5;\n struct EDGE {\n int a, b;\n int A, B;\n } edge[maxn];\n int n, m;\n int last[maxn];\n vector G[maxn], tree[maxn];\n int d[maxn];\n int A[maxn], B[maxn];\n bool vis[maxn];\n vector ans;\n int in[maxn];\n void dfs_tree(int a, int fa) {\n vis[a] = true;\n for (int i = 0; i < G[a].size(); i++) {\n int p = G[a][i];\n if (p == last[a]) continue;\n int b = edge[p].a ^ edge[p].b ^ a;\n if (!vis[b]) {\n tree[a].push_back(p);\n in[p] = true;\n d[b] = d[a] + 1;\n last[b] = p;\n dfs_tree(b, a);\n } else if (d[a] > d[b]) {\n if (d[a] - d[b] + 1 & 1) {\n ans.push_back(p);\n B[a]++;\n B[b]--;\n } else {\n A[a]++;\n A[b]--;\n }\n }\n }\n }\n void dfs(int a) {\n vis[a] = true;\n for (int i = 0; i < tree[a].size(); i++) {\n int p = tree[a][i];\n int b = edge[p].a ^ edge[p].b ^ a;\n if (!vis[b]) dfs(b);\n A[a] += A[b];\n B[a] += B[b];\n }\n edge[last[a]].A = A[a];\n edge[last[a]].B = B[a];\n }\n int main() {\n scanf( %d%d , &n, &m);\n for (int i = 1; i <= m; i++) {\n int a, b;\n scanf( %d%d , &a, &b);\n edge[i] = EDGE{a, b};\n G[a].push_back(i);\n G[b].push_back(i);\n }\n for (int i = 1; i <= n; i++) {\n if (!vis[i]) dfs_tree(i, -1);\n }\n memset(vis, false, sizeof(vis));\n for (int i = 1; i <= n; i++) {\n if (!vis[i]) dfs(i);\n }\n if (ans.size() == 0) {\n for (int i = 1; i <= m; i++) ans.push_back(i);\n } else if (ans.size() == 1) {\n for (int i = 1; i <= m; i++)\n if (in[i]) {\n if (edge[i].A == 0 && edge[i].B) ans.push_back(i);\n }\n } else {\n int t = ans.size();\n ans.clear();\n for (int i = 1; i <= m; i++)\n if (in[i]) {\n if (edge[i].B) {\n if (edge[i].B == t && edge[i].A == 0) ans.push_back(i);\n }\n }\n }\n sort(ans.begin(), ans.end());\n printf( %d\n , ans.size());\n for (int i = 0; i < ans.size(); i++)\n printf( %d , ans[i]), putchar(i == ans.size() - 1 ? '\n' : ' ');\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n pair a[200];\n int n;\n int main() {\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> a[i].second;\n long long tmp = a[i].second;\n while (tmp % 3 == 0) {\n a[i].first--;\n tmp /= 3;\n }\n }\n sort(a + 1, a + n + 1);\n for (int i = 1; i <= n; i++) cout << a[i].second << ;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int main() {\n long long arr[3];\n scanf( %I64d%I64d%I64d , &arr[0], &arr[1], &arr[2]);\n sort(arr, arr + 3);\n if (arr[0] == arr[1] && arr[1] == arr[2])\n printf( 0\n );\n else if (arr[2] == arr[1] && arr[1] > arr[0]) {\n printf( %I64d\n , arr[2] - arr[0] - 1);\n } else if (arr[2] > arr[1] && arr[1] == arr[0]) {\n printf( %I64d\n , (arr[2] - arr[1] - 1) + (arr[2] - arr[0] - 1));\n } else if (arr[2] > arr[1] && arr[1] > arr[0]) {\n printf( %I64d\n , (arr[2] - arr[1] - 1) + (arr[2] - arr[0] - 1));\n }\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int main() {\n long long arr[3];\n scanf( extraextraextra , &arr[0], &arr[1], &arr[2]);\n sort(arr, arr + 3);\n if (arr[0] == arr[1] && arr[1] == arr[2])\n printf( 0\n );\n else if (arr[2] == arr[1] && arr[1] > arr[0]) {\n printf( extra\n , arr[2] - arr[0] - 1);\n } else if (arr[2] > arr[1] && arr[1] == arr[0]) {\n printf( extra\n , (arr[2] - arr[1] - 1) + (arr[2] - arr[0] - 1));\n } else if (arr[2] > arr[1] && arr[1] > arr[0]) {\n printf( extra\n , (arr[2] - arr[1] - 1) + (arr[2] - arr[0] - 1));\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long const modul = 1;\n long long mod_sum(long long x, long long y) { return (x + y) % modul; }\n long long mod_sub(long long x, long long y) {\n if (x > y) {\n return (x - y) % modul;\n } else {\n return (modul + x - y) % modul;\n }\n }\n long long mod_mpl(long long x, long long y) { return (x * y) % modul; }\n void set_precise(int n) {\n cout << fixed;\n cout << setprecision(n);\n }\n int const N = 200000;\n class Tree {\n private:\n long long tree[N * 4];\n int start;\n int size;\n void rebuild(int id) {\n if (id < 1) {\n return;\n }\n tree[id] = tree[id * 2] + tree[id * 2 + 1];\n rebuild(id / 2);\n };\n long long count_sum(int cur, int left, int right, int cur_l, int cur_r) {\n int mid = (cur_l + cur_r) / 2;\n if ((left == cur_l) && (right == cur_r)) {\n return tree[cur];\n }\n if (right <= mid) {\n return count_sum(cur * 2, left, right, cur_l, mid);\n } else if (left >= mid + 1) {\n return count_sum(cur * 2 + 1, left, right, mid + 1, cur_r);\n } else {\n return count_sum(cur * 2, left, mid, cur_l, mid) +\n count_sum(cur * 2 + 1, mid + 1, right, mid + 1, cur_r);\n }\n };\n \n public:\n Tree() {\n size = 0;\n start = 0;\n };\n void initialize(int n) {\n int cur = 1;\n int sum = 0;\n while (cur < n) {\n sum += cur;\n cur *= 2;\n }\n start = sum + 1;\n size = cur;\n for (int i = 1; i < start + cur; ++i) {\n tree[i] = 0;\n }\n }\n Tree(int n) {\n int cur = 1;\n int sum = 0;\n while (cur < n) {\n sum += cur;\n cur *= 2;\n }\n start = sum + 1;\n size = cur;\n for (int i = 1; i < start + cur; ++i) {\n tree[i] = 0;\n }\n };\n void update(int pos, long long q, long long no_more) {\n long long cur = tree[start + pos];\n cur += q;\n if (cur > no_more) {\n cur = no_more;\n }\n tree[start + pos] = cur;\n rebuild((start + pos) / 2);\n };\n long long get_sum(int left, int right) {\n if (left > right) {\n return 0;\n }\n return count_sum(1, left, right, 0, size - 1);\n }\n };\n Tree max_a;\n Tree max_b;\n int main() {\n int n, k;\n long long a, b;\n int q;\n cin >> n >> k >> a >> b >> q;\n max_a.initialize(n);\n max_b.initialize(n);\n for (int i = 0; i < q; ++i) {\n int type;\n cin >> type;\n if (type == 1) {\n int day;\n long long x;\n cin >> day >> x;\n --day;\n max_a.update(day, x, a);\n max_b.update(day, x, b);\n } else {\n int p;\n cin >> p;\n --p;\n long long ans = 0;\n ans += max_b.get_sum(0, p - 1);\n ans += max_a.get_sum(p + k, n - 1);\n cout << ans << endl;\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n void sove() {}\n int main() {\n int n;\n cin >> n;\n int nums[n];\n for (int i = 0; i < n; ++i) {\n cin >> nums[i];\n }\n for (int i = 0; i < n / 2; i += 2) {\n int temp = nums[i];\n nums[i] = nums[n - i - 1];\n nums[n - i - 1] = temp;\n }\n for (int num : nums) {\n cout << num << ' ';\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 3e5 + 10;\n vector e[maxn];\n int dp[maxn], root[maxn], d[maxn], sz[maxn];\n pair dfs(int v, int st, int par) {\n if (root[v] == -1) sz[st]++;\n root[v] = st;\n pair p = make_pair(0, -1);\n for (int i = 0; i < e[v].size(); i++)\n if (e[v][i] != par) p = max(p, dfs(e[v][i], st, v));\n if (par != -1) p.first++;\n if (p.second == -1) p.second = v;\n return p;\n }\n int get_root(int v) { return root[v] == v ? v : root[v] = get_root(root[v]); }\n void merge(int v, int u) {\n v = get_root(v);\n u = get_root(u);\n if (sz[v] > sz[u]) swap(v, u);\n if (v == u) return;\n root[v] = u;\n sz[u] += sz[v];\n d[u] = max((d[v] + 1) / 2 + (d[u] + 1) / 2 + 1, max(d[v], d[u]));\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n int n, m, q;\n cin >> n >> m >> q;\n memset(root, -1, sizeof root);\n for (int i = 0; i < m; i++) {\n int u, v;\n cin >> v >> u;\n v--;\n u--;\n e[v].push_back(u);\n e[u].push_back(v);\n }\n for (int i = 0; i < n; i++)\n if (root[i] == -1) d[i] = dfs(dfs(i, i, -1).second, i, -1).first;\n for (int i = 0; i < q; i++) {\n int t;\n cin >> t;\n if (t == 1) {\n int x;\n cin >> x;\n x--;\n cout << d[get_root(x)] << '\n';\n } else {\n int x, y;\n cin >> x >> y;\n x--;\n y--;\n merge(x, y);\n }\n }\n return 0;\n }\n "} @@ -2379,7 +2379,7 @@ {"func_code_string": "#include \n int main() {\n int n, m;\n scanf( %d%d , &n, &m);\n int num = n + m;\n int a = m / 2, aa = m % 2, aaa = a + aa;\n if (n == m) {\n for (int i = 0; i < n; i++) {\n printf( 01 );\n }\n } else if (n < m) {\n if (aaa <= n + 1) {\n a = m - (n + 1);\n m -= a;\n for (int i = 0; n; i++) {\n if (a) {\n printf( 11 );\n a--;\n } else if (m) {\n printf( 1 );\n m--;\n }\n if (n) {\n printf( 0 );\n n--;\n }\n }\n if (a)\n printf( 11 );\n else if (m)\n printf( 1 );\n } else\n printf( -1 );\n } else if (n > m) {\n if (n <= m + 1) {\n for (int i = 0; i < m; i++) {\n printf( 01 );\n }\n printf( 0 );\n } else\n printf( -1 );\n }\n printf( \n );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long k, d, t;\n int main() {\n scanf( %lld%lld%lld , &k, &d, &t);\n t *= 2;\n long long round = ceil((double)k / d) * d;\n long long num = k * 2 + (round - k);\n long long cnt = t / num;\n long long left = t - cnt * num;\n double ans = 0.0;\n if (left <= k * 2) {\n ans = cnt * round + left / 2;\n if (left % 2) ans += 0.5;\n } else\n ans = cnt * round + k + (left - k * 2);\n printf( %.1lf\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n cin >> n;\n int ans = 0, last = 0, current = 0;\n while (n > 0) {\n ans++;\n current = last + ans;\n last = current;\n n -= current;\n if (n < 0) {\n ans--;\n }\n }\n cout << ans;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int head, tail, n, q[100100];\n long long f[100100], a[100100], b[100010];\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) scanf( %I64d , &a[i]);\n for (int i = 1; i <= n; i++) scanf( %I64d , &b[i]);\n f[1] = 0;\n head = tail = 1;\n q[head] = 1;\n for (int i = 2; i <= n; i++) {\n while (head < tail) {\n if ((1.0 * f[q[head]] + 1.0 * a[i] * b[q[head]]) >\n (1.0 * f[q[head + 1]] + 1.0 * a[i] * b[q[head + 1]]))\n head++;\n else\n break;\n }\n f[i] = f[q[head]] + b[q[head]] * a[i];\n while (head < tail) {\n if (1.0 * (f[q[tail]] - f[q[tail - 1]]) * (b[q[tail]] - b[i]) >\n 1.0 * (f[i] - f[q[tail]]) * (b[q[tail - 1]] - b[q[tail]]))\n tail--;\n else\n break;\n }\n q[++tail] = i;\n }\n printf( %I64d , f[n]);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int head, tail, n, q[100100];\n long long f[100100], a[100100], b[100010];\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; i++) scanf( extra , &a[i]);\n for (int i = 1; i <= n; i++) scanf( extra , &b[i]);\n f[1] = 0;\n head = tail = 1;\n q[head] = 1;\n for (int i = 2; i <= n; i++) {\n while (head < tail) {\n if ((1.0 * f[q[head]] + 1.0 * a[i] * b[q[head]]) >\n (1.0 * f[q[head + 1]] + 1.0 * a[i] * b[q[head + 1]]))\n head++;\n else\n break;\n }\n f[i] = f[q[head]] + b[q[head]] * a[i];\n while (head < tail) {\n if (1.0 * (f[q[tail]] - f[q[tail - 1]]) * (b[q[tail]] - b[i]) >\n 1.0 * (f[i] - f[q[tail]]) * (b[q[tail - 1]] - b[q[tail]]))\n tail--;\n else\n break;\n }\n q[++tail] = i;\n }\n printf( extra , f[n]);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MOD = 998244353;\n const int N = 5005;\n void update(int &a, int b) {\n a += b;\n a %= MOD;\n }\n int add(int a, int b) { return (a + b) % MOD; }\n int multiply(int a, int b) { return (a * 1LL * b) % MOD; }\n int quick_power(int a, int n) {\n int res = 1;\n for (; n > 0; n >>= 1) {\n if (n & 1) res = multiply(res, a);\n a = multiply(a, a);\n }\n return res;\n }\n int get_inv(int a) { return quick_power(a, MOD - 2); }\n int n, a;\n int cnt[N], sum[N][N], dp[N][N];\n int main() {\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> a;\n cnt[a]++;\n }\n for (int i = 0; i <= n; i++) {\n sum[0][i] = 1;\n }\n int answer = 0;\n for (int i = 1; i <= n; i++) {\n int inv = get_inv(n - i + 1);\n for (int j = 1; j <= n; j++) {\n if (cnt[j]) {\n dp[i][j] = multiply(multiply(sum[i - 1][j - 1], cnt[j]), inv);\n update(answer, multiply(multiply(dp[i - 1][j], cnt[j] - 1), inv));\n }\n sum[i][j] = add(sum[i][j - 1], dp[i][j]);\n }\n }\n cout << answer << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n long double n, h;\n cin >> n >> h;\n cout << setprecision(20);\n for (long double i = 0; i < n - 1; i++) {\n cout << h * sqrt((i + 1) / n) << ' ';\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n const double pi = acos(-1);\n const long long N = 1e5 + 5, M = 1e9 + 7;\n char ulta[500];\n set ache;\n int main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n ulta['U'] = 'D';\n ulta['D'] = 'U';\n ulta['R'] = 'L';\n ulta['L'] = 'R';\n string s;\n long long n, i, j, k, ans = 2;\n cin >> n >> s;\n for (auto ch : s) {\n auto x = ache.find(ulta[ch]);\n if (x != ache.end()) {\n ans++;\n ache.clear();\n }\n ache.insert(ch);\n }\n cout << ans - 1 << endl;\n }\n "} @@ -2392,7 +2392,7 @@ {"func_code_string": "#include \n using namespace std;\n int num;\n int likes[7][7];\n map heroes;\n int getNum(string s) {\n if (!heroes.count(s)) heroes[s] = num++;\n return heroes[s];\n }\n int getMaxSymp(int n1, int n2) {\n vector p, groups(7, 0);\n for (int i = 0; i < 7; i++) {\n p.push_back(i);\n if (i >= n1) groups[i] = i < n1 + n2 ? 1 : 2;\n }\n int res = 0;\n do {\n int r = 0;\n for (int i = 0; i < 7; i++)\n for (int j = 0; j < 7; j++)\n if (groups[i] == groups[j]) r += likes[p[i]][p[j]];\n res = max(r, res);\n } while (next_permutation(p.begin(), p.end()));\n return res;\n }\n int main() {\n int i, j, k, n, a, b, c, res = 2000000000, symp = 0;\n cin >> n;\n for (i = 0; i < n; i++) {\n string s1, s2, s3;\n cin >> s1 >> s3 >> s2;\n likes[getNum(s1)][getNum(s2)] = 1;\n }\n cin >> a >> b >> c;\n for (i = 1; i < 7; i++)\n for (j = 1; j + i < 7; j++) {\n k = 7 - i - j;\n int d = max(a / i, max(b / j, c / k)) - min(a / i, min(b / j, c / k));\n if (d < res)\n res = d, symp = getMaxSymp(i, j);\n else if (res == d)\n symp = max(symp, getMaxSymp(i, j));\n }\n cout << res << << symp << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long MOD = 998244353;\n long long inv[5050 + 10], fac[5050 + 10], ifac[5050 + 10];\n void setComb() {\n inv[0] = 1;\n inv[1] = 1;\n fac[1] = 1;\n ifac[1] = 1;\n fac[0] = 1;\n ifac[0] = 1;\n for (int i = 2; i < 5050; i++) {\n inv[i] = (-MOD / i) * inv[MOD % i] % MOD;\n fac[i] = fac[i - 1] * i % MOD;\n ifac[i] = ifac[i - 1] * inv[i] % MOD;\n inv[i] = (inv[i] + MOD) % MOD;\n fac[i] = (fac[i] + MOD) % MOD;\n ifac[i] = (ifac[i] + MOD) % MOD;\n }\n return;\n }\n long long comb(long long n, long long k) {\n if (n < k || n < 0 || k < 0)\n return 0;\n else\n return ((fac[n] * ifac[k] % MOD * ifac[n - k] % MOD + MOD) % MOD);\n }\n long long hcomb(long long n, long long r) {\n if (n == 0 && r == 0)\n return 1;\n else if (n < 0 || r < 0)\n return 0;\n else\n return comb(n + r - 1, r - 1);\n }\n int N;\n vector A;\n long long dp[5050][5050];\n long long cnt[5050];\n void add(long long &a, long long b) { a = (a + b) % MOD; }\n void mul(long long &a, long long b) { a = a * b % MOD; }\n int main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> N;\n A.resize(N);\n for (int i = 0; i < (N); ++i) cin >> A[i];\n sort(A.begin(), A.end());\n for (int i = 0; i < (N); ++i) cnt[A[i]]++;\n setComb();\n dp[0][0] = 1;\n for (int i = 0; i < N; i++) {\n long long sum = 0;\n for (int j = 0; j <= 5000; j++) {\n long long res = sum;\n mul(res, cnt[j]);\n mul(res, inv[N - i]);\n add(dp[i + 1][j], res);\n sum += dp[i][j];\n }\n }\n long long ans = 0;\n for (int i = 1; i < N; i++) {\n for (int j = 0; j <= 5000; j++) {\n long long res = dp[i][j];\n mul(res, cnt[j] - 1);\n mul(res, inv[N - i]);\n add(ans, res);\n }\n }\n cout << ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n vector v;\n vector::iterator it;\n int n, q, x, count1 = 0, x1;\n cin >> q;\n while (q--) {\n cin >> n;\n while (n--) {\n cin >> x;\n v.push_back(x);\n }\n it = v.end() - 1;\n x1 = *it;\n for (it = v.end() - 2; it >= v.begin(); it--) {\n if (*it > x1)\n count1++;\n else\n x1 = *it;\n }\n cout << count1 << endl;\n count1 = 0;\n v.clear();\n }\n }\n "} -{"func_code_string": "#include \n long long ans;\n int F[50000001], n, m, N;\n char str[10001];\n void dfs(int x, int bit, int key) {\n if (x > 3) {\n if (bit) F[bit] += key;\n return;\n }\n dfs(x + 1, bit, key);\n int v = str[x] - 'a';\n dfs(x + 1, bit | (1 << v), -key);\n }\n int main() {\n scanf( %d , &m);\n for (int i = 1; i <= m; i++) {\n scanf( %s , str + 1);\n dfs(1, 0, -1);\n }\n n = 24;\n N = 1 << n;\n int res = 0;\n for (int i = 0; i < N; i++) res += F[i];\n for (int i = 1; i < N; i <<= 1)\n for (int j = 0; j < N; j++)\n if (i & j) {\n F[j] += F[j - i];\n }\n for (int i = 0; i < N; i++) ans ^= (long long)F[i] * F[i];\n printf( %I64d\n , ans);\n }\n "} +{"func_code_string": "#include \n long long ans;\n int F[50000001], n, m, N;\n char str[10001];\n void dfs(int x, int bit, int key) {\n if (x > 3) {\n if (bit) F[bit] += key;\n return;\n }\n dfs(x + 1, bit, key);\n int v = str[x] - 'a';\n dfs(x + 1, bit | (1 << v), -key);\n }\n int main() {\n scanf( %d , &m);\n for (int i = 1; i <= m; i++) {\n scanf( %s , str + 1);\n dfs(1, 0, -1);\n }\n n = 24;\n N = 1 << n;\n int res = 0;\n for (int i = 0; i < N; i++) res += F[i];\n for (int i = 1; i < N; i <<= 1)\n for (int j = 0; j < N; j++)\n if (i & j) {\n F[j] += F[j - i];\n }\n for (int i = 0; i < N; i++) ans ^= (long long)F[i] * F[i];\n printf( extra\n , ans);\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MAXN = 10, MAXM = 100;\n int A[MAXN][MAXM], B[MAXN][MAXM], C[MAXN][MAXM];\n int order[MAXM];\n int ib, is;\n bool cmp(int a, int b) { return B[is][a] - A[ib][a] > B[is][b] - A[ib][b]; }\n int main() {\n int n, m, k, ans = 0, tmp;\n int cur_hold, nx, p;\n int i, j, id;\n scanf( %d%d%d , &n, &m, &k);\n for (i = 0; i < n; ++i) {\n scanf( %*s );\n for (j = 0; j < m; ++j) scanf( %d%d%d , A[i] + j, B[i] + j, C[i] + j);\n }\n for (ib = 0; ib < n; ++ib)\n for (is = 0; is < n; ++is)\n if (ib != is) {\n for (j = 0; j < m; ++j) order[j] = j;\n sort(order, order + m, cmp);\n for (tmp = cur_hold = j = 0; j < m; ++j) {\n id = order[j];\n if ((p = B[is][id] - A[ib][id]) > 0) {\n nx = min(C[ib][id], k - cur_hold);\n tmp += p * nx;\n cur_hold += nx;\n } else\n break;\n }\n if (ans < tmp) ans = tmp;\n }\n printf( %d\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n void init() {}\n void _print(long long int t) { cerr << t; }\n void _print(int t) { cerr << t; }\n void _print(string t) { cerr << t; }\n void _print(char t) { cerr << t; }\n void _print(long double t) { cerr << t; }\n void _print(double t) { cerr << t; }\n void _print(unsigned long long int t) { cerr << t; }\n template \n void _print(pair p);\n template \n void _print(vector v);\n template \n void _print(set v);\n template \n void _print(map v);\n template \n void _print(multiset v);\n template \n void _print(pair p) {\n cerr << { ;\n _print(p.first);\n cerr << , ;\n _print(p.second);\n cerr << } ;\n }\n template \n void _print(vector v) {\n cerr << [ ;\n for (T i : v) {\n _print(i);\n cerr << ;\n }\n cerr << ] ;\n }\n template \n void _print(set v) {\n cerr << [ ;\n for (T i : v) {\n _print(i);\n cerr << ;\n }\n cerr << ] ;\n }\n template \n void _print(multiset v) {\n cerr << [ ;\n for (T i : v) {\n _print(i);\n cerr << ;\n }\n cerr << ] ;\n }\n template \n void _print(map v) {\n cerr << [ ;\n for (auto i : v) {\n _print(i);\n cerr << ;\n }\n cerr << ] ;\n }\n long long int round_up(long long int a, long long int b) {\n return (a + b - 1) / b;\n }\n long long int gcd(long long int a, long long int b) {\n if (b > a) {\n return gcd(b, a);\n }\n if (b == 0) {\n return a;\n }\n return gcd(b, a % b);\n }\n long long int expo(long long int a, long long int b, long long int mod) {\n long long int res = 1;\n while (b > 0) {\n if (b & 1) res = (res * a) % mod;\n a = (a * a) % mod;\n b = b >> 1;\n }\n return res;\n }\n void extendgcd(long long int a, long long int b, long long int *v) {\n if (b == 0) {\n v[0] = 1;\n v[1] = 0;\n v[2] = a;\n return;\n }\n extendgcd(b, a % b, v);\n long long int x = v[1];\n v[1] = v[0] - v[1] * (a / b);\n v[0] = x;\n return;\n }\n long long int mminv(long long int a, long long int b) {\n long long int arr[3];\n extendgcd(a, b, arr);\n return arr[0];\n }\n long long int mminvprime(long long int a, long long int b) {\n return expo(a, b - 2, b);\n }\n bool revsort(long long int a, long long int b) { return a > b; }\n void swap(int &x, int &y) {\n int temp = x;\n x = y;\n y = temp;\n }\n long long int combination(long long int n, long long int r, long long int m,\n long long int *fact, long long int *ifact) {\n long long int val1 = fact[n];\n long long int val2 = ifact[n - r];\n long long int val3 = ifact[r];\n return (((val1 * val2) % m) * val3) % m;\n }\n void google(int t) { cout << Case # << t << : ; }\n vector sieve(int n) {\n int *arr = new int[n + 1]();\n vector vect;\n for (int i = 2; i <= n; i++)\n if (arr[i] == 0) {\n vect.push_back(i);\n for (int j = 2 * i; j <= n; j += i) arr[j] = 1;\n }\n return vect;\n }\n long long int mod_add(long long int a, long long int b, long long int m) {\n a = a % m;\n b = b % m;\n return (((a + b) % m) + m) % m;\n }\n long long int mod_mul(long long int a, long long int b, long long int m) {\n a = a % m;\n b = b % m;\n return (((a * b) % m) + m) % m;\n }\n long long int mod_sub(long long int a, long long int b, long long int m) {\n a = a % m;\n b = b % m;\n return (((a - b) % m) + m) % m;\n }\n long long int mod_div(long long int a, long long int b, long long int m) {\n a = a % m;\n b = b % m;\n return (mod_mul(a, mminvprime(b, m), m) + m) % m;\n }\n void solve() {\n int t;\n cin >> t;\n while (t--) {\n int n;\n cin >> n;\n long long int sum = 0;\n long long int ans = 0;\n int arr[n];\n for (int i = 0; i < n; i++) {\n cin >> arr[i];\n sum += arr[i];\n if (sum < 0) {\n ans -= sum;\n sum = 0;\n }\n }\n cout << sum << \n ;\n }\n }\n int main() {\n init();\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n solve();\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long int b[100005], p[100005];\n int n, m, a;\n bool check(int x) {\n int temp_a = a;\n for (__typeof((x)) i = (0); i < (x); i += 1) {\n int t = x - 1;\n if (p[i] > b[t - i]) {\n if (temp_a < p[i] - b[t - i]) {\n return false;\n } else {\n temp_a -= p[i] - b[t - i];\n }\n }\n }\n return true;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n cin >> n >> m >> a;\n for (__typeof((n)) i = (0); i < (n); i += 1) {\n cin >> b[i];\n }\n for (__typeof((m)) i = (0); i < (m); i += 1) {\n cin >> p[i];\n }\n sort(b, b + n, greater());\n sort(p, p + m);\n int l = 0, h = ((n) < (m) ? (n) : (m)), ans = 0;\n while (l < h) {\n int mid = (l + h + 1) / 2;\n if (check(mid) == true) {\n l = mid;\n } else {\n h = mid - 1;\n }\n ans = l;\n }\n int ans2 = 0;\n for (__typeof((ans)) i = (0); i < (ans); i += 1) {\n ans2 += p[i];\n }\n ans2 -= a;\n if (ans2 < 0) {\n ans2 = 0;\n }\n cout << ans << << ans2;\n }\n "} @@ -2460,7 +2460,7 @@ {"func_code_string": "#include \n using namespace std;\n const int MAXK = 26;\n const long long MOD = 1e9 + 7;\n int last[MAXK], ord[MAXK];\n long long sum, dp[MAXK];\n void add(int c) {\n sum = (sum - dp[c] + MOD) % MOD;\n dp[c] = (dp[c] + sum + 1) % MOD;\n sum = (sum + dp[c]) % MOD;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n int N, K;\n string S;\n cin >> N >> K >> S;\n memset((last), (-1), sizeof(last));\n sum = 0;\n for (int _n((int)S.size()), i(0); i < _n; i++) {\n int c = S[i] - 'a';\n last[c] = i;\n add(c);\n }\n iota(ord, ord + K, 0);\n sort(ord, ord + K, [](int a, int b) { return last[a] < last[b]; });\n for (int _n(N), i(0); i < _n; i++) {\n int c = ord[i % K];\n add(c);\n }\n cout << (sum + 1) % MOD << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n #pragma GCC optimize( Ofast )\n const int INF = 1e9 + 7;\n const long long INF2 = 1e15;\n void solve(void) {}\n int main(void) {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n long long n, l, r, ql, qr;\n cin >> n >> l >> r >> ql >> qr;\n vector v(n);\n for (int i = 0; i < n; i++) cin >> v[i];\n long long total = 0;\n vector left(n + 1), right(n + 1);\n for (long long i = 0; i < n; i++) {\n total += v[i] * l;\n left[i + 1] = total;\n }\n total = 0;\n for (long long i = n - 1; i >= 0; i--) {\n total += v[i] * r;\n right[i] = total;\n }\n long long ans = INF, current;\n for (long long i = 0; i <= n; i++) {\n long long a = i, b = n - i, change;\n current = INF;\n change = min(a, b);\n a -= change;\n b -= change;\n if (a) {\n a--;\n current = min(current, a * ql);\n } else if (b) {\n current = min(current, b * qr);\n } else {\n current = 0;\n }\n a = i, b = n - i;\n change = min(a, b);\n a -= change;\n b -= change;\n if (b) {\n b--;\n current = min(current, b * qr);\n } else if (a) {\n current = min(current, a * ql);\n } else {\n current = 0;\n }\n long long temp = 0;\n a = i, b = n - i;\n if (b) {\n b--;\n temp += qr * b;\n }\n if (a) {\n a--;\n temp += ql * a;\n }\n current = min(current, temp);\n ans = min(ans, current + left[i] + right[i]);\n }\n cout << ans << '\n';\n }\n "} {"func_code_string": "#include \n using namespace std;\n using namespace std;\n int main() {\n int n, k, q;\n cin >> n >> k >> q;\n vector vec(n + 1);\n vector pq;\n map ar, ans, rev;\n for (int i = 1; i <= n; i++) cin >> vec[i], ar[i] = vec[i], rev[vec[i]] = i;\n while (q--) {\n int a, b;\n cin >> a >> b;\n if (a == 1) {\n pq.push_back(ar[b]);\n ans[b] = 1;\n if (pq.size() > k) {\n sort(pq.begin(), pq.end());\n long long dd = rev[pq[0]];\n ans[dd] = 0;\n pq.erase(pq.begin());\n }\n } else {\n if (ans[b]) {\n cout << YES\n ;\n } else\n cout << NO\n ;\n }\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n inline int lowbit(int x) { return x & -x; }\n inline int ABS(int x) { return x < 0 ? -x : x; }\n inline long long ABS(long long x) { return x < 0 ? -x : x; }\n inline void MAX(int &a, int b) {\n if (b > a) a = b;\n }\n inline void MAX(long long &a, long long b) {\n if (b > a) a = b;\n }\n inline void MIN(int &a, int b) {\n if (b < a) a = b;\n }\n inline void MIN(long long &a, long long b) {\n if (b < a) a = b;\n }\n inline void SUM(int &a, int b) { a = (a + b) % 1000000007; }\n int fast(int x, int v) {\n int ans = 1;\n for (; v; v >>= 1, x = (long long)x * x % 1000000007)\n if (v & 1) ans = (long long)ans * x % 1000000007;\n return ans;\n }\n long long fast(long long x, long long v) {\n long long ans = 1;\n for (; v; v >>= 1, x = x * x % 1000000007)\n if (v & 1) ans = ans * x % 1000000007;\n return ans;\n }\n inline long long sqr(int x) { return x * x; }\n int n, a[300005], l, r, sum;\n long long pre[300005], ans;\n map s;\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; ++i) {\n scanf( %d , a + i);\n pre[i] = pre[i - 1] + (a[i] < 0 ? 0 : a[i]);\n if (!s[a[i]]) s[a[i]] = i;\n }\n ans = -0x7f7f7f7f;\n for (int i = n; i >= 1; --i)\n if (s[a[i]] && s[a[i]] != i && pre[i - 1] - pre[s[a[i]]] + a[i] * 2 > ans) {\n ans = pre[i - 1] - pre[s[a[i]]] + a[i] * 2;\n l = s[a[i]];\n r = i;\n }\n for (int i = l + 1; i <= r - 1; ++i)\n if (a[i] < 0) ++sum;\n printf( %I64d %d\n , ans, sum + l - 1 + n - r);\n for (int i = 1; i <= l - 1; ++i) printf( %d , i);\n for (int i = l + 1; i <= r - 1; ++i)\n if (a[i] < 0) printf( %d , i);\n for (int i = r + 1; i <= n; ++i) printf( %d , i);\n }\n "} +{"func_code_string": "#include \n using namespace std;\n inline int lowbit(int x) { return x & -x; }\n inline int ABS(int x) { return x < 0 ? -x : x; }\n inline long long ABS(long long x) { return x < 0 ? -x : x; }\n inline void MAX(int &a, int b) {\n if (b > a) a = b;\n }\n inline void MAX(long long &a, long long b) {\n if (b > a) a = b;\n }\n inline void MIN(int &a, int b) {\n if (b < a) a = b;\n }\n inline void MIN(long long &a, long long b) {\n if (b < a) a = b;\n }\n inline void SUM(int &a, int b) { a = (a + b) % 1000000007; }\n int fast(int x, int v) {\n int ans = 1;\n for (; v; v >>= 1, x = (long long)x * x % 1000000007)\n if (v & 1) ans = (long long)ans * x % 1000000007;\n return ans;\n }\n long long fast(long long x, long long v) {\n long long ans = 1;\n for (; v; v >>= 1, x = x * x % 1000000007)\n if (v & 1) ans = ans * x % 1000000007;\n return ans;\n }\n inline long long sqr(int x) { return x * x; }\n int n, a[300005], l, r, sum;\n long long pre[300005], ans;\n map s;\n int main() {\n scanf( %d , &n);\n for (int i = 1; i <= n; ++i) {\n scanf( %d , a + i);\n pre[i] = pre[i - 1] + (a[i] < 0 ? 0 : a[i]);\n if (!s[a[i]]) s[a[i]] = i;\n }\n ans = -0x7f7f7f7f;\n for (int i = n; i >= 1; --i)\n if (s[a[i]] && s[a[i]] != i && pre[i - 1] - pre[s[a[i]]] + a[i] * 2 > ans) {\n ans = pre[i - 1] - pre[s[a[i]]] + a[i] * 2;\n l = s[a[i]];\n r = i;\n }\n for (int i = l + 1; i <= r - 1; ++i)\n if (a[i] < 0) ++sum;\n printf( extra %d\n , ans, sum + l - 1 + n - r);\n for (int i = 1; i <= l - 1; ++i) printf( %d , i);\n for (int i = l + 1; i <= r - 1; ++i)\n if (a[i] < 0) printf( %d , i);\n for (int i = r + 1; i <= n; ++i) printf( %d , i);\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long INF = 9223372036854775807;\n const long long MOD = 1000000007;\n const long double PI = acos(-1);\n inline long long power(long long a, long long b, long long z = MOD) {\n long long res = 1;\n a = (a % z);\n while (b) {\n if (b & 1) res = (res * a) % z;\n a = (a * a) % z;\n b = b >> 1;\n }\n return res;\n }\n inline long long inverse(long long a, long long z = MOD) {\n return power(a, z - 2, z);\n }\n long long extend(long long a, long long b, long long &x, long long &y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n long long x1, y1;\n long long g = extend(b, a % b, x1, y1);\n x = y1;\n y = x1 - (a / b) * y1;\n return g;\n }\n inline long long mat_power(long long a, long long b, long long c, long long d,\n long long n, long long z = MOD) {\n long long a0 = 1, b0 = 0, c0 = 0, d0 = 1;\n while (n) {\n if (n & 1) {\n long long a1 = a0, b1 = b0, c1 = c0, d1 = d0;\n a0 = (a1 * a + b1 * c) % z;\n b0 = (a1 * b + b1 * d) % z;\n c0 = (c1 * a + d1 * c) % z;\n d0 = (c1 * b + d1 * d) % z;\n }\n long long a1 = a, b1 = b, c1 = c, d1 = d;\n a = (a1 * a1 + b1 * c1) % z;\n b = (a1 * b1 + b1 * d1) % z;\n c = (c1 * a1 + d1 * c1) % z;\n d = (c1 * b1 + d1 * d1) % z;\n n = n >> 1;\n }\n return c0;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n, m;\n cin >> n >> m;\n int aray[n][m], arr[n][m];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) cin >> aray[i][j];\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) cin >> arr[i][j];\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (aray[i][j] > arr[i][j]) swap(aray[i][j], arr[i][j]);\n }\n }\n for (int i = 0; i < n; i++) {\n for (int j = 1; j < m; j++) {\n if (aray[i][j] <= aray[i][j - 1] || arr[i][j] <= arr[i][j - 1]) {\n cout << Impossible\n ;\n return 0;\n }\n }\n }\n for (int j = 0; j < m; j++) {\n for (int i = 1; i < n; i++) {\n if (aray[i][j] <= aray[i - 1][j] || arr[i][j] <= arr[i - 1][j]) {\n cout << Impossible\n ;\n return 0;\n }\n }\n }\n cout << Possible\n ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n map mp;\n mp['q'] = 9;\n mp['k'] = 0;\n mp['r'] = 5;\n mp['b'] = 3;\n mp['n'] = 3;\n mp['p'] = 1;\n int white = 0, black = 0;\n for (int i = 0; i < 8; i++) {\n for (int j = 0; j < 8; j++) {\n char x;\n cin >> x;\n if (x >= 'A' && x <= 'Z') white += mp[x + 32];\n if (x >= 'a' && x <= 'z') black += mp[x];\n }\n }\n if (white > black)\n cout << White << endl;\n else if (white == black)\n cout << Draw << endl;\n else\n cout << Black << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MAXN = 20;\n long long int dp[MAXN][MAXN];\n long long int tav[MAXN];\n long long int n;\n string s;\n long long int dtoc(char x) { return x - '0'; }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n tav[0] = 1;\n for (int i = 1; i < MAXN; i++) {\n tav[i] = 10 * tav[i - 1];\n }\n cin >> n;\n cin >> s;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= n; j++) {\n if (i) {\n dp[i][j] = dp[i - 1][j] + dtoc(s[2 * n - i - j]) * tav[i - 1];\n }\n if (j) {\n dp[i][j] =\n max(dp[i][j], dp[i][j - 1] + dtoc(s[2 * n - i - j]) * tav[j - 1]);\n }\n }\n }\n int i = n;\n int j = n;\n while (i > 0 || j > 0) {\n if (i && dp[i - 1][j] + dtoc(s[2 * n - i - j]) * tav[i - 1] == dp[i][j]) {\n i--;\n cout << 'H';\n } else {\n j--;\n cout << 'M';\n }\n }\n }\n "} @@ -2514,7 +2514,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n cin >> n;\n int a, b;\n if (n == 2) {\n cout << 2 << endl;\n } else\n cout << 1 << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 2e5 + 10;\n unsigned long long preLef[N], preRig[N], sum[N], a[N];\n map f, g;\n int n, m;\n unsigned long long Rand() {\n return (unsigned long long)rand() * rand() * rand() +\n (unsigned long long)rand() * rand() * rand();\n }\n int main() {\n srand(time(0));\n scanf( %d%d , &n, &m);\n for (int i = 0, l, r; i < n; ++i) {\n scanf( %d%d , &l, &r);\n unsigned long long t = Rand();\n a[l] ^= t;\n a[r + 1] ^= t;\n preLef[l] ^= t;\n preRig[r] ^= t;\n }\n for (int i = 1; i <= m + 1; ++i) {\n a[i] ^= a[i - 1];\n sum[i] = sum[i - 1] ^ a[i];\n preLef[i] ^= preLef[i - 1];\n preRig[i] ^= preRig[i - 1];\n }\n g[0] = 0;\n f[0] = 1;\n unsigned long long ans = 0;\n for (int i = 1; i <= m; ++i) {\n unsigned long long t = sum[i] ^ preLef[i];\n ans += f[t] * i - g[t];\n t = sum[i] ^ preRig[i];\n g[t] += i;\n ++f[t];\n }\n for (int i = 1, lf = 0; i <= m; ++i)\n if (!a[i])\n ans -= (unsigned long long)(i - lf + 1) * (i - lf) / 2;\n else\n lf = i;\n cout << ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 1e4 + 5;\n int n, a[N];\n int main() {\n ios ::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n if (fopen( main.in , r )) freopen( main.in , r , stdin);\n cin >> n;\n for (int i = 1; i <= n; i++) cin >> a[i];\n int cnt = 0;\n for (int i = 2; i < n; i++)\n if (a[i - 1] == 1 && a[i + 1] == 1 && a[i] == 0) a[i + 1] = 0, cnt++;\n cout << cnt;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n char s[10];\n int main() {\n int n, i, len;\n long long wi = 1, he = 1;\n scanf( %d , &n);\n for (i = 1; i <= n; i++) {\n scanf( %s , s);\n len = strlen(s);\n if (len == 4) {\n wi++;\n he++;\n } else if (!strcmp(s, UL ) || !strcmp(s, DR ))\n wi++;\n else if (!strcmp(s, UR ) || !strcmp(s, DL ))\n he++;\n }\n printf( %I64d\n , wi * he);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n char s[10];\n int main() {\n int n, i, len;\n long long wi = 1, he = 1;\n scanf( %d , &n);\n for (i = 1; i <= n; i++) {\n scanf( %s , s);\n len = strlen(s);\n if (len == 4) {\n wi++;\n he++;\n } else if (!strcmp(s, UL ) || !strcmp(s, DR ))\n wi++;\n else if (!strcmp(s, UR ) || !strcmp(s, DL ))\n he++;\n }\n printf( extra\n , wi * he);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n string rotate(string s, int off, int* a) {\n string new_s(s);\n for (int i = 0; i < 4; i++) new_s[a[(i + off) % 4] - 1] = s[a[i] - 1];\n return new_s;\n }\n string rotate1(string s, int off) {\n int a[] = {1, 3, 5, 6};\n return rotate(s, off, a);\n }\n string rotate2(string s, int off) {\n int a[] = {2, 6, 4, 3};\n return rotate(s, off, a);\n }\n int main() {\n string s;\n cin >> s;\n sort(s.begin(), s.end());\n map m;\n int ans = 0;\n do {\n bool flg = true;\n map mm;\n for (int i = 0; i < 4; i++) {\n string b = rotate1(s, i);\n for (int j = 0; j < 4; j++) {\n string bb = rotate2(b, j);\n if (mm.find(bb) == mm.end())\n if (m.find(bb) != m.end()) flg = false;\n mm[bb] = m[bb] = 1;\n }\n }\n if (flg) ans++;\n } while (next_permutation(s.begin(), s.end()));\n cout << ans;\n return 0;\n }\n "} {"func_code_string": "\n // Problem: A. Searching Local Minimum\n // Contest: Codeforces - Codeforces Round #700 (Div. 1)\n // URL: https://codeforces.com/contest/1479/problem/A\n // Memory Limit: 512 MB\n // Time Limit: 2000 ms\n // Powered by CP Editor (https://github.com/cpeditor/cpeditor)\n \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #include \n #pragma GCC optimize ( -O3 )\n \n using namespace std;\n \n #define watch(x) cout << (#x) << = << (x) << endl\n #define PI double(2 * acos(0.0))\n #define LL long long\n #define MOD 1000000007\n #define all(x) (x).begin(), (x).end()\n #define INF 1e15\n int query(int a, int n){\n if(a == 0 || a == n + 1){\n return 1e7;\n }\n cout << ? << a << endl;\n int p;\n cin >> p;\n return p;\n }\n int helper(int a, int n){\n int left = a - 1;\n int right = a + 1;\n int mid = a;\n int p = query(left, n);\n int q = query(mid, n);\n int r = query(right, n);\n if(p > q && q < r){\n return 0;\n }\n if(p < q){\n return 2;\n }\n else{\n return 1;\n }\n }\n int main() {\n int n;\n cin >> n;\n int start = 1;\n int end = n;\n int ans = -1;\n while(start <= end){\n int mid = (start + end) / 2;\n int p = helper(mid, n);\n if(p == 0){\n ans = mid;\n break;\n }\n if(p == 1){\n start = mid + 1;\n }else{\n end = mid - 1;\n }\n }\n cout << ! << ans << endl;\n }\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n "} {"func_code_string": "#include \n using namespace std;\n const int INF = INT_MAX;\n const long long INFL = LLONG_MAX;\n const long double pi = acos(-1);\n class SumSegTree {\n private:\n vector sum, lazy;\n int N;\n void check_index(int i) {\n if (i < 0 || N <= i) {\n throw index out of bound ;\n }\n }\n \n public:\n SumSegTree(int N) {\n this->N = 1;\n while (this->N < N) this->N <<= 1;\n this->sum.resize(this->N << 1);\n this->lazy.resize(this->N << 1);\n }\n long long get_sum(int l, int r) {\n check_index(l);\n check_index(r);\n return get_sum(l, r, 0, N - 1, 1);\n }\n void add(int l, int r, int val) {\n check_index(l);\n check_index(r);\n add(l, r, val, 0, N - 1, 1);\n }\n void delegate(int a, int b, int n) {\n sum[n] += (b - a + 1) * lazy[n];\n if (a < b) {\n lazy[n * 2] += lazy[n];\n lazy[n * 2 + 1] += lazy[n];\n }\n lazy[n] = 0;\n }\n long long get_sum(int l, int r, int a, int b, int n) {\n if (b < l || r < a) return 0;\n if (lazy[n] != 0) delegate(a, b, n);\n if (l <= a && b <= r) return sum[n];\n int m = (a + b) / 2;\n return get_sum(l, r, a, m, n * 2) + get_sum(l, r, m + 1, b, n * 2 + 1);\n }\n void add(int l, int r, long long val, int a, int b, int n) {\n if (b < l || r < a) return;\n if (l <= a && b <= r) {\n if (a == b)\n sum[n] += val;\n else\n lazy[n] += val;\n } else {\n int m = (a + b) / 2;\n if (lazy[n] != 0) delegate(a, b, n);\n sum[n] += (min(b, r) - max(a, l) + 1) * val;\n add(l, r, val, a, m, n * 2);\n add(l, r, val, m + 1, b, n * 2 + 1);\n }\n }\n };\n int N, M;\n vector adj[300100];\n vector > query[300100];\n SumSegTree segt(300005);\n long long ans[300100];\n void dfs(int u, int prev, int h) {\n for (int(i) = 0; (i) < (int((query[u]).size())); (i)++) {\n int dist = query[u][i].first;\n long long value = query[u][i].second;\n segt.add(h, min(N, h + dist), value);\n }\n ans[u] = segt.get_sum(h, h);\n for (int(i) = 0; (i) < (int((adj[u]).size())); (i)++) {\n int v = adj[u][i];\n if (v == prev) continue;\n dfs(v, u, h + 1);\n }\n for (int(i) = 0; (i) < (int((query[u]).size())); (i)++) {\n int dist = query[u][i].first;\n long long value = query[u][i].second;\n segt.add(h, min(N, h + dist), -value);\n }\n }\n int main() {\n ios_base::sync_with_stdio(0);\n cout.precision(15);\n cout << fixed;\n cout.tie(0);\n cin.tie(0);\n cin >> N;\n for (int(i) = 1; (i) <= (N - 1); (i)++) {\n int a, b;\n cin >> a >> b;\n adj[a].push_back(b);\n adj[b].push_back(a);\n }\n cin >> M;\n for (int(i) = 1; (i) <= (M); (i)++) {\n int v, d;\n long long x;\n cin >> v >> d >> x;\n query[v].push_back(make_pair(d, x));\n }\n dfs(1, 0, 0);\n for (int(i) = 1; (i) <= (N); (i)++)\n cout << ans[i] << (i + 1 <= N ? ' ' : '\n');\n }\n "} @@ -2522,9 +2522,9 @@ {"func_code_string": "#include \n using namespace std;\n int main(void) {\n int n;\n char str[102][102];\n scanf( %d , &n);\n bool row, col;\n row = col = false;\n for (int i = 0; i < n; i++) {\n scanf( %s , str[i]);\n bool bolong = false;\n for (int j = 0; j < n; j++) {\n if (str[i][j] == '.') {\n bolong = true;\n }\n }\n if (!bolong) {\n row = true;\n }\n }\n if (!row) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (str[i][j] == '.') {\n printf( %d %d\n , i + 1, j + 1);\n break;\n }\n }\n }\n return 0;\n }\n for (int i = 0; i < n; i++) {\n bool bolong = false;\n for (int j = 0; j < n; j++) {\n if (str[j][i] == '.') bolong = true;\n }\n if (!bolong) col = true;\n }\n if (!col) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (str[j][i] == '.') {\n printf( %d %d\n , j + 1, i + 1);\n break;\n }\n }\n }\n } else\n printf( -1 );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n mt19937_64 rng(\n (unsigned)chrono::system_clock::now().time_since_epoch().count());\n const long double error = 1e-7;\n const long double PI = acosl(-1);\n const int nmax = 2e5 + 10;\n int master[nmax];\n int sz[nmax];\n void init(int u) {\n master[u] = u;\n sz[u] = 1;\n return;\n }\n int fnd(int u) {\n if (master[u] == u) return u;\n return master[u] = fnd(master[u]);\n }\n bool unite(int u, int v) {\n u = fnd(u);\n v = fnd(v);\n if (u == v) return false;\n if (sz[u] < sz[v]) swap(u, v);\n sz[u] += sz[v];\n master[v] = u;\n return true;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n ;\n int n, m;\n cin >> n >> m;\n vector A(n + 1), B(m + 1);\n for (int i = 1; i <= n; i++) {\n cin >> A[i];\n }\n for (int i = 1; i <= m; i++) {\n cin >> B[i];\n }\n vector>> edges;\n long long int totcost = 0;\n for (int i = 1; i <= n; i++) {\n int k;\n cin >> k;\n for (int j = 0; j < k; j++) {\n int x;\n cin >> x;\n edges.emplace_back(A[i] + B[x], make_pair(i, n + x));\n totcost += A[i] + B[x];\n }\n }\n for (int i = 1; i <= n + m; i++) init(i);\n sort(edges.begin(), edges.end());\n reverse(edges.begin(), edges.end());\n long long int ans = 0;\n for (auto e : edges) {\n if (unite(e.second.first, e.second.second)) ans += e.first;\n }\n ans = totcost - ans;\n cout << ans << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int L[100010];\n int P[100010][20];\n vector pp[100010][20];\n int T[100010];\n vector tt[100010];\n int arr[100010];\n vector graph[100010];\n vector fnc(vector &a, vector &b) {\n vector ans;\n int aa = a.size(), bb = b.size(), i, j, shajib = 0;\n for (i = 0, j = 0; i + j < aa + bb && shajib < 10;) {\n if (i == aa) {\n ans.push_back(b[j]);\n j++;\n shajib++;\n } else if (j == bb) {\n ans.push_back(a[i]);\n i++;\n shajib++;\n } else {\n if (a[i] == b[j]) {\n i++;\n } else if (a[i] > b[j]) {\n ans.push_back(b[j]);\n j++;\n shajib++;\n } else {\n ans.push_back(a[i]);\n i++;\n shajib++;\n }\n }\n }\n return ans;\n }\n void dfs(int src, int par) {\n if (src == -1)\n L[par] = 1;\n else\n L[par] = L[src] + 1;\n T[par] = src;\n int len = graph[par].size();\n for (int i = 0; i < (int)graph[par].size(); i++) {\n int v = graph[par][i];\n if (v != src) {\n dfs(par, v);\n }\n }\n }\n vector query(int n, int p, int q) {\n int log = 1, i, j, temp;\n if (L[p] < L[q]) {\n temp = q;\n q = p;\n p = temp;\n }\n log = log2(n);\n vector os;\n os = fnc(os, tt[p]);\n for (j = log; j >= 0; j--) {\n if (L[p] - (1 << j) >= L[q]) {\n os = fnc(os, pp[p][j]);\n p = P[p][j];\n }\n }\n if (p == q) return os;\n os = fnc(os, tt[q]);\n for (j = log; j >= 0; j--) {\n if (P[p][j] != -1 && P[p][j] != P[q][j]) {\n os = fnc(os, pp[p][j]);\n os = fnc(os, pp[q][j]);\n p = P[p][j], q = P[q][j];\n }\n }\n os = fnc(os, pp[p][0]);\n return os;\n }\n void lca(int n) {\n memset(P, -1, sizeof(P));\n int i, j;\n for (i = 1; i <= n; i++) {\n P[i][0] = T[i];\n if (T[i] != -1) pp[i][0] = fnc(pp[i][0], tt[T[i]]);\n }\n for (j = 1; (1 << j) < n; j++) {\n for (i = 1; i <= n; i++) {\n if (P[i][j - 1] != -1) {\n P[i][j] = P[P[i][j - 1]][j - 1];\n pp[i][j] = fnc(pp[i][j], pp[P[i][j - 1]][j - 1]);\n pp[i][j] = fnc(pp[i][j], pp[i][j - 1]);\n }\n }\n }\n }\n int main() {\n int i, j, n, m, t, a, b, k, c;\n scanf( %d%d%d , &n, &m, &k);\n for (i = 0; i < n - 1; i++) {\n scanf( %d%d , &a, &b);\n graph[a].push_back(b);\n graph[b].push_back(a);\n }\n for (i = 1; i <= m; i++) {\n scanf( %d , &a);\n tt[a].push_back(i);\n }\n for (i = 1; i <= n; i++) {\n sort(tt[i].begin(), tt[i].end());\n a = tt[i].size();\n while (a > 10) {\n tt[i].pop_back();\n a--;\n }\n }\n dfs(-1, 1);\n lca(n);\n vector os;\n for (i = 1; i <= k; i++) {\n scanf( %d%d%d , &a, &b, &c);\n os = query(n, a, b);\n c = min(c, (int)os.size());\n a = 0;\n printf( %d , c);\n for (auto it = os.begin(); a < c && it != os.end(); a++, it++) {\n printf( %d , (*it));\n }\n printf( \n );\n }\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int n, m, i, j, k, lst, a[22], b[1 << 18], o[1 << 18];\n long long f[1 << 18][18], g[1 << 18];\n char s[22][22];\n void rec(int sum, int x, int mask) {\n if (sum == 0) {\n for (i = 0; i < (1 << n); i++)\n if (b[i] > lst)\n for (j = 0; j < n; j++) f[i][j] = 0;\n for (i = 0; i < (1 << n) - 1; i++)\n if (b[i] >= lst)\n for (j = 0; j < n; j++)\n if (f[i][j]) {\n int prv = (1 << n) - 1 - i;\n if ((mask >> (n - b[i] - 1)) & 1) {\n for (int x = (prv & (prv - 1)); prv > 0; x &= (x - 1)) {\n k = o[prv ^ x];\n if (s[j][k] == '1') f[i ^ (1 << k)][k] += f[i][j];\n prv = x;\n }\n } else\n for (int x = (prv & (prv - 1)); prv > 0; x &= (x - 1)) {\n k = o[prv ^ x];\n f[i ^ (1 << k)][k] += f[i][j];\n prv = x;\n }\n }\n for (j = 0; j < n; j++) g[mask] += f[i][j];\n return;\n }\n for (; x > 0; x--) {\n rec(sum - x, min(sum - x, x), (mask << x) + (1 << (x - 1)) - 1);\n lst = n - (sum - x + 1);\n }\n }\n int main() {\n scanf( %d , &n);\n for (i = 0; i < n; i++) {\n scanf( %s , s[i]);\n f[1 << i][i] = 1;\n o[1 << i] = i;\n }\n lst = 1;\n for (i = 0; i < (1 << n); i++) b[i] = b[i / 2] + (i & 1);\n rec(n, n, 0);\n for (i = 0; i < (1 << (n - 1)); i++) {\n for (m = 0, j = -1; j < n - 1; j = k) {\n for (k = j + 1; k < n - 1 && ((i >> k) & 1); k++)\n ;\n a[m++] = k - j;\n }\n sort(a, a + m);\n reverse(a, a + m);\n for (k = j = 0; j < m; j++) k = (k << a[j]) + (1 << (a[j] - 1)) - 1;\n g[i] = g[k];\n }\n for (j = n - 1; j >= 0; j--)\n for (i = (1 << (n - 1)) - 1; i > 0; i--)\n if ((i >> j) & 1) g[i ^ (1 << j)] -= g[i];\n for (i = 0; i < (1 << (n - 1)); i++) printf( %I64d , g[i]);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int n, m, i, j, k, lst, a[22], b[1 << 18], o[1 << 18];\n long long f[1 << 18][18], g[1 << 18];\n char s[22][22];\n void rec(int sum, int x, int mask) {\n if (sum == 0) {\n for (i = 0; i < (1 << n); i++)\n if (b[i] > lst)\n for (j = 0; j < n; j++) f[i][j] = 0;\n for (i = 0; i < (1 << n) - 1; i++)\n if (b[i] >= lst)\n for (j = 0; j < n; j++)\n if (f[i][j]) {\n int prv = (1 << n) - 1 - i;\n if ((mask >> (n - b[i] - 1)) & 1) {\n for (int x = (prv & (prv - 1)); prv > 0; x &= (x - 1)) {\n k = o[prv ^ x];\n if (s[j][k] == '1') f[i ^ (1 << k)][k] += f[i][j];\n prv = x;\n }\n } else\n for (int x = (prv & (prv - 1)); prv > 0; x &= (x - 1)) {\n k = o[prv ^ x];\n f[i ^ (1 << k)][k] += f[i][j];\n prv = x;\n }\n }\n for (j = 0; j < n; j++) g[mask] += f[i][j];\n return;\n }\n for (; x > 0; x--) {\n rec(sum - x, min(sum - x, x), (mask << x) + (1 << (x - 1)) - 1);\n lst = n - (sum - x + 1);\n }\n }\n int main() {\n scanf( %d , &n);\n for (i = 0; i < n; i++) {\n scanf( %s , s[i]);\n f[1 << i][i] = 1;\n o[1 << i] = i;\n }\n lst = 1;\n for (i = 0; i < (1 << n); i++) b[i] = b[i / 2] + (i & 1);\n rec(n, n, 0);\n for (i = 0; i < (1 << (n - 1)); i++) {\n for (m = 0, j = -1; j < n - 1; j = k) {\n for (k = j + 1; k < n - 1 && ((i >> k) & 1); k++)\n ;\n a[m++] = k - j;\n }\n sort(a, a + m);\n reverse(a, a + m);\n for (k = j = 0; j < m; j++) k = (k << a[j]) + (1 << (a[j] - 1)) - 1;\n g[i] = g[k];\n }\n for (j = n - 1; j >= 0; j--)\n for (i = (1 << (n - 1)) - 1; i > 0; i--)\n if ((i >> j) & 1) g[i ^ (1 << j)] -= g[i];\n for (i = 0; i < (1 << (n - 1)); i++) printf( extra , g[i]);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, m;\n int a[107];\n map f;\n vector> b;\n bool cmp(pair u, pair v) { return u.first > v.first; }\n int main() {\n cin >> n >> m;\n for (int i = 1; i <= n; i++) cin >> a[i];\n for (int i = 1; i <= m; i++) {\n string s;\n cin >> s;\n if (f[s] == 0)\n f[s] = 1;\n else\n f[s]++;\n }\n sort(a + 1, a + n + 1);\n for (map::iterator it = f.begin(); it != f.end(); ++it) {\n b.push_back(make_pair(it->second, it->first));\n }\n sort(b.begin(), b.end(), cmp);\n long long minP = 0, maxP = 0;\n for (int i = 0; i < b.size(); i++) {\n minP += b[i].first * a[i + 1];\n maxP += b[i].first * a[n - i];\n }\n cout << minP << << maxP << endl;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n struct node {\n long long cos, rlev;\n bool operator<(const node &a) const { return cos < a.cos; }\n } f[300005];\n int main() {\n int n, k;\n while (scanf( %d%d , &n, &k) != EOF) {\n for (int i = 1; i <= n; i++) {\n scanf( %I64d , &f[i].cos);\n f[i].rlev = i;\n }\n priority_queue p;\n long long ans = 0;\n for (int i = 1; i <= k; i++) p.push(f[i]);\n for (int i = k + 1; i <= k + n; i++) {\n if (i <= n) p.push(f[i]);\n node now = p.top();\n p.pop();\n if (i >= now.rlev) {\n ans += (i - now.rlev) * now.cos;\n f[now.rlev].rlev = i;\n }\n }\n printf( %I64d\n , ans);\n for (int i = 1; i < n; i++) {\n printf( %I64d , f[i].rlev);\n }\n printf( %I64d\n , f[n].rlev);\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n struct node {\n long long cos, rlev;\n bool operator<(const node &a) const { return cos < a.cos; }\n } f[300005];\n int main() {\n int n, k;\n while (scanf( %d%d , &n, &k) != EOF) {\n for (int i = 1; i <= n; i++) {\n scanf( extra , &f[i].cos);\n f[i].rlev = i;\n }\n priority_queue p;\n long long ans = 0;\n for (int i = 1; i <= k; i++) p.push(f[i]);\n for (int i = k + 1; i <= k + n; i++) {\n if (i <= n) p.push(f[i]);\n node now = p.top();\n p.pop();\n if (i >= now.rlev) {\n ans += (i - now.rlev) * now.cos;\n f[now.rlev].rlev = i;\n }\n }\n printf( extra\n , ans);\n for (int i = 1; i < n; i++) {\n printf( extra , f[i].rlev);\n }\n printf( extra\n , f[n].rlev);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long mul(long long a, long long b, long long p = 1000000007) {\n return ((a % p) * (b % p)) % p;\n }\n long long add(long long a, long long b, long long p = 1000000007) {\n return (a % p + b % p) % p;\n }\n void input(long long a[], long long sz) {\n for (long long i = 0; i < sz; i++) cin >> a[i];\n }\n void print(long long a[], long long sz) {\n for (long long i = 0; i < sz; i++) {\n if (i == sz - 1)\n cout << a[i] << \n ;\n else\n cout << a[i] << ;\n }\n }\n long long maxr(long long a[], long long sz) {\n long long ma;\n for (long long i = 0; i < sz; i++) {\n if (i == 0)\n ma = a[i];\n else if (a[i] > ma)\n ma = a[i];\n }\n return ma;\n }\n long long minr(long long a[], long long sz) {\n long long mi;\n for (long long i = 0; i < sz; i++) {\n if (i == 0)\n mi = a[i];\n else if (a[i] < mi)\n mi = a[i];\n }\n return mi;\n }\n long long isprm(long long n) {\n if (n <= 1) return 0;\n if (n <= 3) return 1;\n if (n % 2 == 0 || n % 3 == 0) return 0;\n for (int i = 5; i * i <= n; i = i + 6)\n if (n % i == 0 || n % (i + 2) == 0) return 0;\n return 1;\n }\n long long power(long long x, long long y, long long p = 1000000007) {\n long long res = 1;\n x = x % p;\n while (y > 0) {\n if (y & 1) res = (res * x) % p;\n y = y >> 1;\n x = (x * x) % p;\n }\n return res;\n }\n long long modInverse(long long n, long long p = 1000000007) {\n return power(n, p - 2, p);\n }\n long long ncrMod(long long n, long long r, long long p = 1000000007) {\n if (r == 0) return 1;\n long long fac[n + 1];\n fac[0] = 1;\n for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p;\n return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %\n p;\n }\n bool comp(const pair &a, const pair &b) {\n if (a.first == b.first) {\n return (a.second > b.second);\n }\n return (a.first < b.first);\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n ;\n int t;\n cin >> t;\n while (t--) {\n long long n, k;\n cin >> n >> k;\n long long q = n / k;\n long long r = n % k;\n if ((r % 2 == 1 && k % 2 == 0) || (r % 2 == 1 && q == 1) || q == 0)\n cout << NO\n ;\n else {\n cout << YES\n ;\n if (r % 2 == 0) {\n cout << q + r << ;\n for (long long i = 0; i < k - 1; i++) cout << q << ;\n cout << \n ;\n } else {\n cout << q + r << ;\n for (long long i = 0; i < k - 1; i++) {\n if (i % 2 == 0)\n cout << q - 1 << ;\n else\n cout << q + 1 << ;\n }\n cout << \n ;\n }\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 5e5 + 20;\n struct edge {\n int v, l, r;\n edge() {}\n edge(int a, int b, int c) {\n v = a;\n l = b;\n r = c;\n }\n };\n struct nd {\n int no, lim, to;\n nd() {}\n nd(int a, int b, int c) {\n no = a;\n lim = b;\n to = c;\n }\n };\n bool operator<(const nd& a, const nd& b) {\n if (a.no != b.no) {\n return a.no > b.no;\n }\n if (a.lim != b.lim) {\n return a.lim > b.lim;\n }\n return a.to < b.to;\n }\n bool operator<(const edge& a, const edge& b) {\n if (a.l != b.l) {\n return a.l < b.l;\n }\n return a.r < b.r;\n }\n vector G[2 * maxn];\n int now[2 * maxn];\n int main() {\n int n, m, u, v, l, r;\n scanf( %d%d , &n, &m);\n for (int i = 0; i < m; i++) {\n scanf( %d%d%d%d , &u, &v, &l, &r);\n if (l & 1) {\n if (r & 1) {\n G[u].push_back(edge(v + n, l + 1, r - 1));\n G[v].push_back(edge(u + n, l + 1, r - 1));\n G[u + n].push_back(edge(v, l, r - 2));\n G[v + n].push_back(edge(u, l, r - 2));\n } else {\n if (l + 1 < r) {\n G[u].push_back(edge(v + n, l + 1, r - 2));\n G[v].push_back(edge(u + n, l + 1, r - 2));\n }\n G[u + n].push_back(edge(v, l, r - 1));\n G[v + n].push_back(edge(u, l, r - 1));\n }\n } else {\n if (r & 1) {\n G[u].push_back(edge(v + n, l, r - 1));\n G[v].push_back(edge(u + n, l, r - 1));\n if (l + 1 < r) {\n G[u + n].push_back(edge(v, l + 1, r - 2));\n G[v + n].push_back(edge(u, l + 1, r - 2));\n }\n } else {\n G[u].push_back(edge(v + n, l, r - 2));\n G[v].push_back(edge(u + n, l, r - 2));\n G[u + n].push_back(edge(v, l + 1, r - 1));\n G[v + n].push_back(edge(u, l + 1, r - 1));\n }\n }\n }\n for (int i = 1; i <= n + n; i++) {\n sort(G[i].begin(), G[i].end());\n }\n priority_queue Q;\n Q.push(nd(0, 0, 1));\n int ans = 0x3f3f3f3f;\n nd t;\n while (!Q.empty()) {\n t = Q.top();\n int u = t.to, no = t.no, lim = t.lim;\n Q.pop();\n if (u == n || u == n * 2) {\n ans = min(ans, no);\n }\n for (int& i = now[u]; i < G[u].size(); i++) {\n if (lim < G[u][i].l) {\n break;\n }\n if (no <= G[u][i].r) {\n Q.push(nd(max(no + 1, G[u][i].l + 1), G[u][i].r + 1, G[u][i].v));\n }\n }\n }\n if (ans == 0x3f3f3f3f) {\n printf( -1\n );\n } else {\n printf( %d\n , ans);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 1000008;\n int n, m, k, d, i, j, e;\n int tmp[N], pos[N], p[N], c[N];\n char s[N];\n int main() {\n scanf( %s %d , s, &m);\n n = strlen(s);\n while (m--) {\n scanf( %d%d , &k, &d);\n for (i = 0; i < n; i++) {\n c[i] = (i + 1) % n;\n pos[i] = p[i] = i;\n }\n int t = 0;\n for (i = 0; i < d; i++)\n for (j = i; j < k; t++, j += d) p[t] = j;\n for (i = 0; i < n; ++i) {\n c[i] = p[c[i]];\n }\n for (e = n - k + 1; e; e >>= 1) {\n for (i = 0; i < n; ++i) tmp[i] = c[i];\n if (e & 1)\n for (i = 0; i < n; ++i) pos[i] = c[pos[i]];\n for (i = 0; i < n; ++i) c[i] = tmp[c[i]];\n }\n for (i = 0; i < n; ++i) tmp[(i + n - k + 1) % n] = s[pos[i]];\n for (i = 0; i < n; ++i) putchar(s[i] = (char)tmp[i]);\n putchar('\n');\n }\n }\n "} @@ -2540,7 +2540,7 @@ {"func_code_string": "#include \n using namespace std;\n const int MAXN = int(5e4) + 100;\n const int MOD = int(360);\n const int oo = INT_MAX;\n const long double PI = acos(-1.0);\n const long double EPS = 1e-9;\n struct pt {\n long double x, y;\n pt() {}\n pt(long double x, long double y) : x(x), y(y) {}\n };\n inline long double x(pt P) { return P.x; }\n inline long double y(pt P) { return P.y; }\n istream& operator>>(istream& in, pt& p) {\n long double x, y;\n in >> x >> y;\n p = pt(x, y);\n return in;\n }\n ostream& operator<<(ostream& out, const pt& p) {\n out << ( << double(p.x) << , << double(p.y) << ) ;\n return out;\n }\n pt operator+(const pt& A, const pt& B) { return pt(x(A) + x(B), y(A) + y(B)); }\n pt operator-(const pt& A, const pt& B) { return pt(x(A) - x(B), y(A) - y(B)); }\n pt operator*(const pt& A, const pt& B) {\n return pt(x(A) * x(B) - y(A) * y(B), x(A) * y(B) + y(A) * x(B));\n }\n pt operator*(const pt& A, const long double& B) {\n return pt(x(A) * B, y(A) * B);\n }\n pt operator*(const long double& B, const pt& A) {\n return pt(x(A) * B, y(A) * B);\n }\n pt operator/(const pt& A, const long double& B) {\n return pt(x(A) / B, y(A) / B);\n }\n inline long double norm(pt A) { return x(A) * x(A) + y(A) * y(A); }\n inline long double abs(pt A) { return sqrt(norm(A)); }\n inline long double cross(pt A, pt B) { return x(A) * y(B) - y(A) * x(B); }\n inline long double dot(pt A, pt B) { return x(A) * x(B) + y(A) * y(B); }\n inline bool same(long double a, long double b) {\n return a + EPS > b && b + EPS > a;\n }\n inline bool samePt(pt A, pt B) { return same(x(A), x(B)) && same(y(A), y(B)); }\n inline long double dist(pt A, pt B) { return abs(B - A); }\n inline pt rotcw(pt p) { return p * pt(0, -1); }\n inline bool segContains(pt X, pt A, pt B) {\n if (samePt(X, A) || samePt(X, B)) return 1;\n if (!same(0, cross(A - X, B - X))) return 0;\n return (dot(A - X, B - X) < EPS);\n }\n pt linesIntersection(pt A, pt B, pt C, pt D) {\n long double x = cross(C, D - C) - cross(A, D - C);\n x /= cross(B - A, D - C);\n return A + x * (B - A);\n }\n double signedArea(const vector& P) {\n double result = 0.0;\n for (int i = 0; i < (int)P.size() - 1; i++) result += cross(P[i], P[i + 1]);\n return result / 2.0;\n }\n vector reorganize(vector& P) {\n int n = int(P.size());\n vector R(n);\n if (P.size() == 1) {\n R[0] = P[0];\n return R;\n }\n if (signedArea(P) > EPS) {\n reverse(P.begin(), P.end());\n }\n int s = 0;\n for (int i = 1; i < n; ++i) {\n if (x(P[s]) > x(P[i]) || (x(P[s]) == x(P[i]) && y(P[s]) > y(P[i]))) {\n s = i;\n }\n }\n R[0] = P[s];\n for (int i = (s + 1) % n, j = 1; i != s; i = (i + 1) % n, ++j) {\n if (samePt(P[i], P[(i - 1 + n) % n])) {\n j--;\n continue;\n }\n R[j] = P[i];\n }\n R[n - 1] = R[0];\n return R;\n }\n vector convexPolygonSum(vector& P, vector& Q) {\n P = reorganize(P);\n Q = reorganize(Q);\n int n = int(P.size()), m = int(Q.size());\n vector R(n + m - 1);\n R[0] = (P[0] + Q[0]);\n int i = 1, j = 1, k = 1;\n for (; i < n && j < m; ++k) {\n if (cross(P[i] - P[i - 1], Q[j] - Q[j - 1]) < -EPS) {\n R[k] = R[k - 1] + (P[i] - P[i - 1]);\n ++i;\n } else {\n R[k] = R[k - 1] + (Q[j] - Q[j - 1]);\n ++j;\n }\n }\n while (i < n) {\n R[k] = R[k - 1] + (P[i] - P[i - 1]);\n ++i;\n ++k;\n }\n while (j < m) {\n R[k] = R[k - 1] + (Q[j] - Q[j - 1]);\n ++j;\n ++k;\n }\n vector T;\n T.push_back(R[0]);\n for (int i = 1; i + 1 < int(R.size()); ++i) {\n if (same(cross(R[i] - R[i - 1], R[i + 1] - R[i - 1]), 0.0)) continue;\n T.push_back(R[i]);\n }\n T.push_back(T[0]);\n return T;\n }\n int inConvexPolygon(pt X, long double mnx, long double mxx, vector& P) {\n if (x(X) < mnx || x(X) > mxx) return -1;\n int lo = 1, hi = int(P.size()) - 1, mi;\n while (lo <= hi) {\n mi = (lo + hi) / 2;\n if (cross(P[mi] - P[0], X - P[0]) < -EPS) {\n lo = mi + 1;\n } else {\n hi = mi - 1;\n }\n }\n lo = hi;\n if (hi == -1) return -1;\n long double c = cross(X - P[lo], X - P[lo + 1]);\n if (same(c, 0.0)) return (segContains(X, P[lo], P[lo + 1]) ? 0 : -1);\n if (c > EPS) return -1;\n return 1;\n }\n int l, n, m, q;\n int main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n while (cin >> l) {\n vector P1(l + 1);\n for (int i = 0; i < l; ++i) {\n cin >> P1[i];\n }\n cin >> n;\n vector P2(n + 1);\n for (int i = 0; i < n; ++i) {\n cin >> P2[i];\n }\n cin >> m;\n vector P3(m + 1);\n for (int i = 0; i < m; ++i) {\n cin >> P3[i];\n }\n P1[l] = P1[0];\n P2[n] = P2[0];\n P3[m] = P3[0];\n vector P = convexPolygonSum(P2, P3);\n P = convexPolygonSum(P1, P);\n long double mnx = x(P[0]);\n long double mxx = -oo;\n for (int i = 0; i < int(P.size()); ++i) {\n mxx = max(mxx, x(P[i]));\n }\n cin >> q;\n for (int i = 0; i < q; ++i) {\n pt cur;\n cin >> cur;\n cur = 3.0 * cur;\n if (inConvexPolygon(cur, mnx, mxx, P) >= 0) {\n cout << YES\n ;\n } else {\n cout << NO\n ;\n }\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, k = 0;\n string home;\n cin >> n;\n cin >> home;\n for (int i = 0; i < n; i++) {\n string now;\n cin >> now;\n now = now.substr(5, 3);\n if (now == home) k++;\n }\n if (k == n - k)\n cout << home ;\n else\n cout << contest ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n using min_heap = priority_queue, greater>;\n struct RangeIncrement {\n vector tree, lazy;\n RangeIncrement(int n) : tree(n << 2), lazy(n << 2) {}\n void refresh(int i, int l, int r) {\n if (lazy[i] != 0) {\n tree[i] += lazy[i] * (r - l + 1);\n if (l < r) {\n int lc = i << 1, rc = (i << 1) + 1;\n lazy[lc] += lazy[i];\n lazy[rc] += lazy[i];\n }\n lazy[i] = 0;\n }\n }\n void update(int i, int l, int r, int ul, int ur, long long x) {\n refresh(i, l, r);\n if (r < ul || l > ur) {\n return;\n } else if (ul <= l && r <= ur) {\n lazy[i] += x;\n refresh(i, l, r);\n } else {\n int m = l + r >> 1;\n int lc = i << 1, rc = (i << 1) + 1;\n update(lc, l, m, ul, ur, x);\n update(rc, m + 1, r, ul, ur, x);\n tree[i] = tree[lc] + tree[rc];\n }\n }\n long long query(int i, int l, int r, int ql, int qr) {\n refresh(i, l, r);\n if (r < ql || l > qr) {\n return 0;\n } else if (ql <= l && r <= qr) {\n return tree[i];\n } else {\n int m = l + r >> 1;\n int lc = i << 1, rc = (i << 1) + 1;\n return query(lc, l, m, ql, qr) + query(rc, m + 1, r, ql, qr);\n }\n }\n };\n template \n struct DisjointRanges {\n struct Range {\n int l, r;\n T x;\n Range(int l, const pair& p) : l(l), r(p.first), x(p.second) {}\n };\n map> s;\n vector update(int l, int r, T x) {\n vector bye;\n auto last = s.upper_bound(r);\n if (last != s.begin()) {\n auto it = prev(last);\n if (it->second.first > r) {\n last = s.emplace_hint(last, r + 1, it->second);\n it->second.first = r;\n }\n }\n auto first = s.lower_bound(l);\n if (first != s.begin()) {\n auto it = prev(first);\n if (it->second.first >= l) {\n bye.emplace_back(l, it->second);\n it->second.first = l - 1;\n }\n }\n while (first != last) {\n bye.emplace_back(first->first, first->second);\n first = s.erase(first);\n }\n s.emplace_hint(last, l, make_pair(r, x));\n return bye;\n }\n };\n int main() {\n int n, m;\n scanf( %d %d , &n, &m);\n RangeIncrement ri(n);\n DisjointRanges dr;\n for (int i = 1; i <= n; i++) {\n dr.update(i, i, i);\n }\n while (m--) {\n int o, l, r, x;\n scanf( %d %d %d , &o, &l, &r);\n switch (o) {\n case 1: {\n scanf( %d , &x);\n auto v = dr.update(l, r, x);\n for (auto it : v) {\n ri.update(1, 1, n, it.l, it.r, abs(x - it.x));\n }\n break;\n }\n case 2: {\n printf( %lld\n , ri.query(1, 1, n, l, r));\n break;\n }\n }\n }\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int cnt[100100];\n int R[100100];\n int n;\n long long power(long long a, long long b) {\n long long res = 1;\n while (b) {\n if (b & 1) res = (res * a) % 1000000007;\n a = (a * a) % 1000000007;\n b >>= 1;\n }\n return res;\n }\n int main() {\n memset(cnt, 0, sizeof(cnt));\n scanf( %d , &n);\n int maxA = 0;\n for (int i = 1; i <= n; i++) {\n int tmp;\n scanf( %d , &tmp);\n cnt[tmp]++;\n maxA = max(maxA, tmp);\n }\n for (int i = maxA; i >= 1; i--) cnt[i] += cnt[i + 1];\n long long ans = 0;\n for (int i = 1; i <= maxA; i++) {\n int tot = 0;\n for (int j = 1; j * j <= i; j++) {\n if (i % j == 0) {\n R[tot++] = j;\n if (j * j != i) {\n R[tot++] = i / j;\n }\n }\n }\n sort(R, R + tot);\n long long tmp =\n (power(tot, cnt[R[tot - 1]]) -\n power(tot - 1, cnt[R[tot - 1]]) % 1000000007 + 1000000007) %\n 1000000007;\n for (int j = 0; j < tot - 1; j++)\n tmp = (tmp * power(j + 1, cnt[R[j]] - cnt[R[j + 1]])) % 1000000007;\n ans = (ans + tmp) % 1000000007;\n }\n printf( %I64d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int cnt[100100];\n int R[100100];\n int n;\n long long power(long long a, long long b) {\n long long res = 1;\n while (b) {\n if (b & 1) res = (res * a) % 1000000007;\n a = (a * a) % 1000000007;\n b >>= 1;\n }\n return res;\n }\n int main() {\n memset(cnt, 0, sizeof(cnt));\n scanf( %d , &n);\n int maxA = 0;\n for (int i = 1; i <= n; i++) {\n int tmp;\n scanf( %d , &tmp);\n cnt[tmp]++;\n maxA = max(maxA, tmp);\n }\n for (int i = maxA; i >= 1; i--) cnt[i] += cnt[i + 1];\n long long ans = 0;\n for (int i = 1; i <= maxA; i++) {\n int tot = 0;\n for (int j = 1; j * j <= i; j++) {\n if (i % j == 0) {\n R[tot++] = j;\n if (j * j != i) {\n R[tot++] = i / j;\n }\n }\n }\n sort(R, R + tot);\n long long tmp =\n (power(tot, cnt[R[tot - 1]]) -\n power(tot - 1, cnt[R[tot - 1]]) % 1000000007 + 1000000007) %\n 1000000007;\n for (int j = 0; j < tot - 1; j++)\n tmp = (tmp * power(j + 1, cnt[R[j]] - cnt[R[j + 1]])) % 1000000007;\n ans = (ans + tmp) % 1000000007;\n }\n printf( extra\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 500100;\n const int maxp = 40;\n int n, q;\n double d[maxn][maxp];\n int p[maxn];\n void upd(int v, int k, double x) {\n while (v && k < maxp) {\n double a = d[v][k];\n d[v][k] *= x;\n x = (d[v][k] + 1) / (a + 1);\n v = p[v];\n k++;\n }\n }\n int main() {\n ios_base::sync_with_stdio(0);\n for (int i = 0; i < maxn; i++)\n for (int j = 0; j < maxp; j++) d[i][j] = 1;\n cin >> q;\n n = 1;\n for (int i = 0; i < q; i++) {\n int qtype, v;\n cin >> qtype >> v;\n if (qtype == 1) {\n p[++n] = v;\n upd(n, 0, 0);\n } else {\n double ans = 0;\n for (int j = 1; j < maxp; j++) ans += (1 - d[v][j]);\n cout << fixed << setprecision(10) << ans << '\n';\n }\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n using ll = long long;\n const ll INF = 1e14 + 7;\n using vi = vector;\n using pii = pair;\n using pli = pair;\n int ask(int i, int j) {\n cout << ? << i << << j << endl;\n int ans;\n cin >> ans;\n return ans;\n }\n int main() {\n int n;\n cin >> n;\n vi ans(n + 4), curr(n + 4);\n curr[0] = ask(1, n);\n curr[1] = ask(2, n);\n ans[1] = curr[0] - curr[1];\n for (int i = 2; i <= n - 1; i++) {\n curr[i] = ask(i - 1, i);\n ans[i] = curr[i] - ans[i - 1];\n }\n ans[n] = curr[0];\n for (int i = 1; i < n; i++) {\n ans[n] -= ans[i];\n }\n cout << ! ;\n for (int i = 1; i <= n; i++) {\n cout << << ans[i];\n }\n cout << endl;\n fflush(stdout);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int a[200005];\n int b[200005];\n bool f[200005];\n int main() {\n int q, n;\n cin >> q;\n while (q--) {\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> a[i];\n b[i] = 1;\n f[i] = 0;\n }\n for (int i = 1; i <= n; i++) {\n int j = i;\n if (f[i] == 1) continue;\n f[i] = 1;\n int ctr = 1;\n while (a[j] != i) {\n ctr++;\n f[j] = 1;\n j = a[j];\n }\n j = i;\n while (a[j] != i) {\n b[j] = ctr;\n j = a[j];\n }\n }\n for (int i = 1; i <= n; i++) cout << b[i] << ;\n cout << \n ;\n }\n }\n "} @@ -2551,11 +2551,11 @@ {"func_code_string": "#include \n using namespace std;\n char str[1000005 + 1];\n int main() {\n int ans = 0, i;\n stack S;\n scanf( %s , str);\n for (i = 0; str[i] != '\0'; ++i) {\n if (str[i] == '(') S.push(i);\n if (str[i] == ')' && !S.empty()) {\n S.pop();\n ans += 2;\n }\n }\n printf( %d\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n void solve() {\n int y, b, r;\n cin >> y >> b >> r;\n while (1) {\n if (r - 1 <= b && r - 2 <= y) {\n break;\n }\n --r;\n }\n cout << 3 * r - 3;\n }\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n solve();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n string n;\n cin >> n;\n long long even = 0;\n long long odd = 0;\n long long len = n.length();\n long long aeven = 0;\n long long aodd = 0;\n long long beven = 0;\n long long bodd = 0;\n for (int i = 0; i < len; i++) {\n if (n[i] == 'a') {\n if (i % 2 == 1) {\n aodd++;\n odd += aodd;\n even += aeven;\n } else {\n aeven++;\n odd += aeven;\n even += aodd;\n }\n } else {\n if (i % 2 == 1) {\n bodd++;\n odd += bodd;\n even += beven;\n } else {\n beven++;\n odd += beven;\n even += bodd;\n }\n }\n }\n cout << even << << odd << endl;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int const N = 100000;\n long long a[N + 1];\n long long f[N * 3];\n inline int lc(int root) { return root << 1; }\n inline int rc(int root) { return (root << 1) | 1; }\n void build(int root, int l, int r) {\n f[root] = -1;\n if (l == r) {\n f[root] = a[l];\n return;\n }\n int mid = (l + r) >> 1;\n build(lc(root), l, mid);\n build(rc(root), mid + 1, r);\n if (f[lc(root)] == f[rc(root)]) {\n f[root] = f[lc(root)];\n }\n }\n void update(int root, int l, int r, int fi, int la, long long val) {\n if (fi == l && la == r) {\n f[root] = val;\n return;\n }\n int mid = (l + r) >> 1;\n f[root] = -1;\n if (fi > mid) {\n update(rc(root), mid + 1, r, fi, la, val);\n } else if (la <= mid) {\n update(lc(root), l, mid, fi, la, val);\n } else {\n update(lc(root), l, mid, fi, mid, val);\n update(rc(root), mid + 1, r, mid + 1, la, val);\n }\n if (f[lc(root)] == f[rc(root)]) {\n f[root] = f[lc(root)];\n }\n }\n long long query(int root, int l, int r, int fi, int la) {\n if (f[root] != -1) {\n return f[root];\n }\n int mid = (l + r) >> 1;\n if (fi > mid) {\n return query(rc(root), mid + 1, r, fi, la);\n } else if (la <= mid) {\n return query(lc(root), l, mid, fi, la);\n } else {\n return max(query(lc(root), l, mid, fi, mid),\n query(rc(root), mid + 1, r, mid + 1, la));\n }\n }\n void work() {\n int n;\n int m;\n long long w, h;\n long long res;\n scanf( %d , &n);\n for (int i = 1; i <= n; ++i) {\n scanf( %I64d , &a[i]);\n }\n build(1, 1, n);\n scanf( %d , &m);\n while (m--) {\n scanf( %I64d%I64d , &w, &h);\n res = query(1, 1, n, 1, w);\n printf( %I64d\n , res);\n update(1, 1, n, 1, w, res + h);\n }\n }\n int main() {\n work();\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int const N = 100000;\n long long a[N + 1];\n long long f[N * 3];\n inline int lc(int root) { return root << 1; }\n inline int rc(int root) { return (root << 1) | 1; }\n void build(int root, int l, int r) {\n f[root] = -1;\n if (l == r) {\n f[root] = a[l];\n return;\n }\n int mid = (l + r) >> 1;\n build(lc(root), l, mid);\n build(rc(root), mid + 1, r);\n if (f[lc(root)] == f[rc(root)]) {\n f[root] = f[lc(root)];\n }\n }\n void update(int root, int l, int r, int fi, int la, long long val) {\n if (fi == l && la == r) {\n f[root] = val;\n return;\n }\n int mid = (l + r) >> 1;\n f[root] = -1;\n if (fi > mid) {\n update(rc(root), mid + 1, r, fi, la, val);\n } else if (la <= mid) {\n update(lc(root), l, mid, fi, la, val);\n } else {\n update(lc(root), l, mid, fi, mid, val);\n update(rc(root), mid + 1, r, mid + 1, la, val);\n }\n if (f[lc(root)] == f[rc(root)]) {\n f[root] = f[lc(root)];\n }\n }\n long long query(int root, int l, int r, int fi, int la) {\n if (f[root] != -1) {\n return f[root];\n }\n int mid = (l + r) >> 1;\n if (fi > mid) {\n return query(rc(root), mid + 1, r, fi, la);\n } else if (la <= mid) {\n return query(lc(root), l, mid, fi, la);\n } else {\n return max(query(lc(root), l, mid, fi, mid),\n query(rc(root), mid + 1, r, mid + 1, la));\n }\n }\n void work() {\n int n;\n int m;\n long long w, h;\n long long res;\n scanf( %d , &n);\n for (int i = 1; i <= n; ++i) {\n scanf( extra , &a[i]);\n }\n build(1, 1, n);\n scanf( %d , &m);\n while (m--) {\n scanf( extraextra , &w, &h);\n res = query(1, 1, n, 1, w);\n printf( extra\n , res);\n update(1, 1, n, 1, w, res + h);\n }\n }\n int main() {\n work();\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n map mp;\n int main() {\n long long int b, q, l, m, t;\n scanf( %lld%lld%lld%lld , &b, &q, &l, &m);\n for (int i = 0; i < m; i++) {\n scanf( %lld , &t);\n mp[t] = 1;\n }\n if (b < -l || b > l) {\n printf( 0\n );\n return 0;\n }\n if (b == 0) {\n if (mp[0])\n printf( 0\n );\n else\n printf( inf\n );\n return 0;\n } else if (q == 0) {\n if (mp[b] && mp[0])\n printf( 0\n );\n else if (!mp[b] && mp[0])\n printf( 1\n );\n else\n printf( inf\n );\n return 0;\n } else if (q == 1) {\n if (mp[b])\n printf( 0\n );\n else\n printf( inf\n );\n return 0;\n } else if (q == -1) {\n if (mp[b] && mp[-b])\n printf( 0\n );\n else\n printf( inf\n );\n return 0;\n } else {\n long long int cont = 0;\n while (b <= l && b >= -l) {\n if (!mp[b]) cont++;\n b *= q;\n }\n printf( %lld\n , cont);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(0);\n string a, c;\n int b, d, p;\n int pos[110];\n p = 0;\n cin >> b >> d;\n cin >> a;\n cin >> c;\n int t = 0, la, lc;\n la = a.length();\n lc = c.length();\n int k = 0;\n for (int i = 0; i < lc; i++) {\n k = 0;\n for (int j = 0; j < la; j++)\n if (a[j] == c[(i + k) % lc]) k++;\n pos[i] = k;\n }\n int sum = 0;\n int j = 0;\n for (int i = 0; i < b; i++) {\n sum += pos[j];\n j = (j + pos[j]) % lc;\n }\n sum /= lc;\n p = sum / d;\n cout << p << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, m, a, b;\n set > s;\n set sc;\n vector ans;\n int main() {\n cin >> n >> m;\n for (int i = 1; i <= m; ++i) {\n cin >> a >> b;\n s.insert(make_pair(min(a, b), max(a, b)));\n }\n for (int i = 1; i <= n; ++i) {\n sc.insert(i);\n }\n for (int i = 1; i <= n; ++i) {\n if (sc.find(i) != sc.end()) {\n int cur = 0;\n queue q;\n q.push(i);\n sc.erase(i);\n while (!q.empty()) {\n cur++;\n int v = q.front();\n q.pop();\n set::iterator it;\n set c = sc;\n for (it = c.begin(); it != c.end(); it++) {\n int to = *it;\n if (s.find(make_pair(min(v, to), max(v, to))) == s.end()) {\n q.push(to);\n sc.erase(to);\n }\n }\n }\n ans.push_back(cur);\n }\n }\n sort(ans.begin(), ans.end());\n cout << (int)ans.size() << endl;\n for (int i = 0; i < (int)ans.size(); ++i) {\n cout << ans[i] << ' ';\n }\n cout << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n #pragma comment(linker, /STACK:10000000 )\n using namespace std;\n template \n inline T abs(T a) {\n return ((a < 0) ? -a : a);\n }\n template \n inline T sqr(T a) {\n return a * a;\n }\n const int INF = (int)1E9 + 7;\n const long double EPS = 1E-9;\n const long double PI = 3.1415926535897932384626433832795;\n const int NMAX = 200 * 1000;\n int a[NMAX], sza;\n int t[NMAX * 4], cnt[NMAX * 4];\n long long sum[NMAX * 4][5];\n char buf[300];\n void upd(int pos, int idx, int lf, int rg) {\n if (lf == rg) {\n t[idx] ^= 1;\n memset(sum[idx], 0, sizeof sum[idx]);\n sum[idx][0] = t[idx] * 1LL * a[pos];\n cnt[idx] = t[idx];\n return;\n }\n int mid = (lf + rg) >> 1;\n if (pos <= mid)\n upd(pos, 2 * idx + 1, lf, mid);\n else\n upd(pos, 2 * idx + 2, mid + 1, rg);\n cnt[idx] = cnt[2 * idx + 1] + cnt[2 * idx + 2];\n for (int i = 0; i < int(5); ++i) {\n long long& ans = sum[idx][i];\n int f = (cnt[2 * idx + 1]) % 5;\n f = (i - f + 5) % 5;\n ans = sum[2 * idx + 1][i] + sum[2 * idx + 2][f];\n }\n }\n void change(int val) {\n int pos = lower_bound(a, a + sza, val) - a;\n upd(pos, 0, 0, sza - 1);\n }\n inline long long getSum() { return sum[0][2]; }\n int main() {\n int n;\n scanf( %d , &n);\n gets(buf);\n vector > q;\n for (int i = 0; i < int(n); ++i) {\n gets(buf);\n if (buf[0] == 'a') {\n int val;\n sscanf(buf, add %d , &val);\n q.push_back(make_pair(1, val));\n a[sza++] = val;\n }\n if (buf[0] == 'd') {\n int val;\n sscanf(buf, del %d , &val);\n q.push_back(make_pair(-1, val));\n a[sza++] = val;\n }\n if (buf[0] == 's') {\n q.push_back(make_pair(-1, -1));\n }\n }\n sort(a, a + sza);\n sza = unique(a, a + sza) - a;\n for (int i = 0; i < int(n); ++i) {\n if (q[i] == pair(-1, -1)) {\n printf( %I64d\n , getSum());\n continue;\n }\n if (q[i].first == 1) {\n change(q[i].second);\n } else {\n change(q[i].second);\n }\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n #pragma comment(linker, /STACK:10000000 )\n using namespace std;\n template \n inline T abs(T a) {\n return ((a < 0) ? -a : a);\n }\n template \n inline T sqr(T a) {\n return a * a;\n }\n const int INF = (int)1E9 + 7;\n const long double EPS = 1E-9;\n const long double PI = 3.1415926535897932384626433832795;\n const int NMAX = 200 * 1000;\n int a[NMAX], sza;\n int t[NMAX * 4], cnt[NMAX * 4];\n long long sum[NMAX * 4][5];\n char buf[300];\n void upd(int pos, int idx, int lf, int rg) {\n if (lf == rg) {\n t[idx] ^= 1;\n memset(sum[idx], 0, sizeof sum[idx]);\n sum[idx][0] = t[idx] * 1LL * a[pos];\n cnt[idx] = t[idx];\n return;\n }\n int mid = (lf + rg) >> 1;\n if (pos <= mid)\n upd(pos, 2 * idx + 1, lf, mid);\n else\n upd(pos, 2 * idx + 2, mid + 1, rg);\n cnt[idx] = cnt[2 * idx + 1] + cnt[2 * idx + 2];\n for (int i = 0; i < int(5); ++i) {\n long long& ans = sum[idx][i];\n int f = (cnt[2 * idx + 1]) % 5;\n f = (i - f + 5) % 5;\n ans = sum[2 * idx + 1][i] + sum[2 * idx + 2][f];\n }\n }\n void change(int val) {\n int pos = lower_bound(a, a + sza, val) - a;\n upd(pos, 0, 0, sza - 1);\n }\n inline long long getSum() { return sum[0][2]; }\n int main() {\n int n;\n scanf( %d , &n);\n gets(buf);\n vector > q;\n for (int i = 0; i < int(n); ++i) {\n gets(buf);\n if (buf[0] == 'a') {\n int val;\n sscanf(buf, add %d , &val);\n q.push_back(make_pair(1, val));\n a[sza++] = val;\n }\n if (buf[0] == 'd') {\n int val;\n sscanf(buf, del %d , &val);\n q.push_back(make_pair(-1, val));\n a[sza++] = val;\n }\n if (buf[0] == 's') {\n q.push_back(make_pair(-1, -1));\n }\n }\n sort(a, a + sza);\n sza = unique(a, a + sza) - a;\n for (int i = 0; i < int(n); ++i) {\n if (q[i] == pair(-1, -1)) {\n printf( extra\n , getSum());\n continue;\n }\n if (q[i].first == 1) {\n change(q[i].second);\n } else {\n change(q[i].second);\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int a[100001];\n int getBound(int start, int dir, int size, int k) {\n int cnt = 0;\n bool seen[100001];\n fill(seen, seen + 100001, false);\n for (int i = start; i <= size && i > 0; i += dir) {\n if (!seen[a[i]]) cnt++, seen[a[i]] = true;\n if (cnt == k) return i;\n }\n return -1;\n }\n int main() {\n int n, k;\n cin >> n >> k;\n for (int i = 1; i <= n; i++) cin >> a[i];\n int right = getBound(1, 1, n, k);\n if (right == -1)\n cout << -1 << << -1 << endl;\n else {\n int left = getBound(right, -1, n, k);\n cout << left << << right << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long MAX = 10e5;\n vector graph[MAX];\n queue q;\n bool visit[MAX];\n long long a[MAX];\n long long s[MAX];\n long long parent[MAX];\n int main() {\n memset(visit, false, sizeof(visit));\n long long nodes;\n cin >> nodes;\n for (auto i = 2; i <= nodes; ++i) {\n long long tmp;\n cin >> tmp;\n parent[i] = tmp;\n graph[i].push_back(tmp);\n graph[tmp].push_back(i);\n }\n for (auto i = 1; i <= nodes; ++i) {\n cin >> s[i];\n }\n a[1] = s[1];\n q.push(1);\n visit[1] = true;\n while (!q.empty()) {\n long long n = q.front();\n q.pop();\n if (n != 1) {\n if (s[n] == -1) {\n s[n] = s[parent[n]];\n if (graph[n].size() > 1) {\n long long mini = 10e9;\n for (auto v : graph[n]) {\n if (v == parent[n]) continue;\n mini = min(mini, s[v]);\n }\n if (mini < s[n]) {\n cout << -1;\n return 0;\n } else {\n a[n] = mini - s[n];\n s[n] = mini;\n }\n } else {\n a[n] = 0;\n s[n] = s[parent[n]];\n }\n } else {\n a[n] = s[n] - s[parent[n]];\n }\n }\n for (auto p : graph[n]) {\n if (visit[p]) continue;\n q.push(p);\n visit[p] = true;\n }\n }\n long long ans = 0;\n for (auto i = 1; i <= nodes; i++) {\n ans += a[i];\n }\n cout << ans;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n void solve() {\n string s;\n cin >> s;\n string ans = ;\n int cnt(0);\n for (int i = 0; i < s.size(); i++) {\n if (s[i] == '0' && cnt == 0) {\n cnt++;\n } else\n ans += s[i];\n }\n if (cnt == 0) {\n for (int i = 0; i < ans.size() - 1; i++) cout << ans[i];\n } else\n cout << ans;\n }\n int main() {\n long long t;\n t = 1;\n while (t--) solve();\n return 0;\n }\n "} @@ -2675,7 +2675,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n int x, y, z;\n cin >> x >> y >> z;\n int total = x - y;\n if (total < 0) {\n if (total + z < 0) {\n cout << - ;\n } else {\n cout << ? ;\n }\n }\n if (total > 0) {\n if (total - z > 0) {\n cout << + ;\n } else {\n cout << ? ;\n }\n }\n if (total == 0) {\n if (total + z == 0) {\n cout << 0 ;\n } else {\n cout << ? ;\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n;\n int main() {\n cin >> n;\n if (n == 1)\n cout << -1 ;\n else\n cout << n << << n + 1 << << n * n + n;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n #pragma comment(linker, /STACK:100000000 )\n int n;\n double l;\n pair mas[1010];\n int lst[1010];\n double dp[1010];\n bool check(double r) {\n for (int i = 0; i <= n; i++) lst[i] = -1;\n for (int i = 1; i <= n; i++) dp[i] = -1e15;\n for (int i = 0; i < n; i++) {\n if (lst[i] == -1 && i != 0) continue;\n for (int j = i + 1; j <= n; j++) {\n double p = sqrt(abs(l - (double)(mas[j].first - mas[i].first)));\n if (dp[j] < dp[i] + (double)mas[j].second * r - p) {\n lst[j] = i;\n dp[j] = dp[i] + (double)mas[j].second * r - p;\n }\n }\n }\n if (lst[n] != -1 && dp[n] > -1e-9)\n return true;\n else\n return false;\n }\n int main() {\n scanf( %d %lf , &n, &l);\n for (int i = 1; i <= n; i++) scanf( %d %d , &mas[i].first, &mas[i].second);\n double l = 0, r = 1e9;\n for (int i = 0; i < 100; i++) {\n double av = (l + r) / 2.0;\n if (check(av))\n r = av;\n else\n l = av;\n }\n check(l);\n vector ans;\n int cur = n;\n while (cur != 0) {\n ans.push_back(cur);\n cur = lst[cur];\n }\n for (int i = (int)(ans).size() - 1; i >= 0; i--) printf( %d , ans[i]);\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const int m = 31;\n const int maxn = 31;\n long long n, k;\n long long f[maxn + 5], g[maxn + 5];\n void init() {\n f[1] = g[1] = 1;\n for (int i = 2; i <= m; i++) {\n f[i] = (1LL << i * 2 - 2) + f[i - 1];\n g[i] = (1LL << i) - 1 + g[i - 1];\n }\n }\n int main() {\n init();\n long long T;\n cin >> T;\n while (T--) {\n cin >> n >> k;\n if (n > m) {\n printf( YES %I64d\n , n - 1);\n continue;\n }\n int flg = -1;\n for (int i = 0; i <= n; i++) {\n if (k >= g[i] &&\n k <= f[i] + f[n - i] * ((1ll << i) - 1) * ((1ll << i) - 1)) {\n flg = i;\n break;\n }\n }\n if (~flg)\n printf( YES %I64d\n , n - flg);\n else\n printf( NO\n );\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const int m = 31;\n const int maxn = 31;\n long long n, k;\n long long f[maxn + 5], g[maxn + 5];\n void init() {\n f[1] = g[1] = 1;\n for (int i = 2; i <= m; i++) {\n f[i] = (1LL << i * 2 - 2) + f[i - 1];\n g[i] = (1LL << i) - 1 + g[i - 1];\n }\n }\n int main() {\n init();\n long long T;\n cin >> T;\n while (T--) {\n cin >> n >> k;\n if (n > m) {\n printf( YES extra\n , n - 1);\n continue;\n }\n int flg = -1;\n for (int i = 0; i <= n; i++) {\n if (k >= g[i] &&\n k <= f[i] + f[n - i] * ((1ll << i) - 1) * ((1ll << i) - 1)) {\n flg = i;\n break;\n }\n }\n if (~flg)\n printf( YES extra\n , n - flg);\n else\n printf( NO\n );\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n string s;\n int n, m;\n cin >> n >> m;\n cin >> s;\n for (int i = 0; i < m; i++) {\n int l, r;\n char c1, c2;\n scanf( %d %d %c %c , &l, &r, &c1, &c2);\n for (int j = l - 1; j < r; j++) {\n if (s[j] == c1) {\n s[j] = c2;\n }\n }\n }\n cout << s << endl;\n cin >> n;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n scanf( %d , &n);\n if (n == 1) {\n printf( a\na\nb\nb\n );\n } else if (n == 2) {\n printf( aa\nbb\ncc\ndd\n );\n } else if (n == 3) {\n printf( aab\n );\n printf( ccb\n );\n printf( baa\n );\n printf( bcc\n );\n } else {\n char a[4][105];\n int i, j;\n if (n % 2 == 0) {\n a[0][0] = 'a';\n a[0][1] = 'a';\n a[1][0] = 'b';\n a[2][0] = 'b';\n a[3][0] = 'a';\n a[3][1] = 'a';\n a[0][n - 2] = a[0][n - 1] = 'y';\n a[1][n - 1] = a[2][n - 1] = 'z';\n a[3][n - 2] = a[3][n - 1] = 'y';\n for (i = 1;; i += 2) {\n a[1][i] = a[1][i + 1] = 'g' + ((i / 2) % 2) * 2;\n a[2][i] = a[2][i + 1] = 'h' + ((i / 2) % 2) * 2;\n if (i + 1 == n - 2) break;\n a[0][i + 1] = a[0][i + 2] = 'm' + ((i / 2) % 2) * 2;\n a[3][i + 1] = a[3][i + 2] = 'n' + ((i / 2) % 2) * 2;\n }\n } else {\n a[0][0] = a[1][0] = 'a';\n a[2][0] = a[2][1] = 'b';\n a[3][0] = a[3][1] = 'c';\n a[0][n - 1] = a[0][n - 2] = 'z';\n a[1][n - 1] = a[1][n - 2] = 'y';\n a[2][n - 1] = a[3][n - 1] = 'x';\n for (i = 1; i < n - 2; i++) a[0][i] = 'g' + (((i - 1) / 2) % 2);\n for (i = 1; i < n - 2; i++) a[1][i] = 'i' + (((i - 1) / 2) % 2);\n for (i = 2; i < n - 1; i++) a[2][i] = 'k' + (((i) / 2) % 2);\n for (i = 2; i < n - 1; i++) a[3][i] = 'n' + (((i) / 2) % 2);\n }\n a[0][n] = a[1][n] = a[2][n] = a[3][n] = '\0';\n printf( %s\n%s\n%s\n%s\n , a[0], a[1], a[2], a[3]);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long h, n;\n cin >> h >> n;\n long long l = 1, r = (1LL << h), ret = 0, cur = 0, dir = 0;\n while (cur < h) {\n long long size = (1LL << (h - cur)), mid = (l + r) / 2;\n if (dir == 0) {\n if (n <= mid)\n ++ret, r = mid, dir = 1;\n else\n ret += size, l = mid + 1;\n } else {\n if (n <= mid)\n ret += size, r = mid;\n else\n ++ret, l = mid + 1, dir = 0;\n }\n ++cur;\n }\n cout << ret << endl;\n }\n "} @@ -2708,7 +2708,7 @@ {"func_code_string": "#include \n using namespace std;\n const int N = 1e6 + 5;\n int par[N], ran[N];\n struct DSU {\n DSU() {\n for (int i = 1; i < N; ++i) par[i] = i, ran[i] = 1;\n }\n int find(int x) { return par[x] == x ? x : par[x] = find(par[x]); }\n bool unite(int a, int b) {\n a = find(a), b = find(b);\n if (a == b) return false;\n ran[a] += ran[a] == ran[b];\n if (ran[a] < ran[b]) swap(a, b);\n par[b] = a;\n return true;\n }\n };\n int a[N];\n int n, q;\n vector primes;\n int spf[N];\n void sieve() {\n for (int i = 2; i < N; ++i) {\n if (spf[i] == 0) spf[i] = i, primes.push_back(i);\n int sz = primes.size();\n for (int j = 0; j < sz && i * primes[j] < N && primes[j] <= spf[i]; ++j) {\n spf[i * primes[j]] = primes[j];\n }\n }\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n sieve();\n cin >> n >> q;\n DSU ds;\n for (int i = 1; i <= n; ++i) {\n cin >> a[i];\n }\n for (int i = 1; i <= n; ++i) {\n int x = a[i];\n while (x > 1) {\n ds.unite(spf[a[i]], spf[x]);\n x /= spf[x];\n }\n }\n set> pary;\n for (int i = 1; i <= n; ++i) {\n int x = a[i];\n vector v;\n while (x > 1) {\n v.push_back(spf[x]);\n x /= spf[x];\n }\n x = a[i] + 1;\n while (x > 1) {\n v.push_back(spf[x]);\n x /= spf[x];\n }\n v.resize(unique(v.begin(), v.end()) - v.begin());\n for (auto &j : v) {\n j = ds.find(j);\n }\n for (auto j : v) {\n for (auto k : v) {\n if (j < k) pary.insert({j, k});\n }\n }\n }\n while (q--) {\n int x, y;\n cin >> x >> y;\n x = spf[a[x]], y = spf[a[y]];\n if (ds.find(x) == ds.find(y))\n cout << 0 << endl;\n else {\n x = ds.find(x);\n y = ds.find(y);\n if (x > y) swap(x, y);\n if (pary.count({x, y}))\n cout << 1 << endl;\n else\n cout << 2 << endl;\n }\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n T extgcd(T a, T b, T& x, T& y) {\n for (T u = y = 1, v = x = 0; a;) {\n T q = b / a;\n swap(x -= q * u, u);\n swap(y -= q * v, v);\n swap(b -= q * a, a);\n }\n return b;\n }\n template \n T mod_inv(T a, T m) {\n T x, y;\n extgcd(a, m, x, y);\n return (m + x % m) % m;\n }\n long long mod_pow(long long a, long long n, long long mod) {\n long long ret = 1;\n long long p = a % mod;\n while (n) {\n if (n & 1) ret = ret * p % mod;\n p = p * p % mod;\n n >>= 1;\n }\n return ret;\n }\n template \n class NTT {\n public:\n long long get_mod() const { return mod; }\n void _ntt(vector& a, long long sign) {\n const long long n = ((long long)(a).size());\n const long long g = primitive_root;\n long long h = (long long)mod_pow(g, (mod - 1) / n, mod);\n if (sign == -1) h = (long long)mod_inv(h, mod);\n long long i = 0;\n for (long long j = 1; j < n - 1; ++j) {\n for (long long k = n >> 1; k > (i ^= k); k >>= 1)\n ;\n if (j < i) swap(a[i], a[j]);\n }\n for (long long m = 1; m < n; m *= 2) {\n const long long m2 = 2 * m;\n const long long base = mod_pow(h, n / m2, mod);\n long long w = 1;\n for (long long x = 0; x < (m); x++) {\n for (long long s = x; s < n; s += m2) {\n long long u = a[s];\n long long d = a[s + m] * w % mod;\n a[s] = u + d;\n if (a[s] >= mod) a[s] -= mod;\n a[s + m] = u - d;\n if (a[s + m] < 0) a[s + m] += mod;\n }\n w = w * base % mod;\n }\n }\n for (auto& x : a)\n if (x < 0) x += mod;\n }\n void ntt(vector& input) { _ntt(input, 1); }\n void intt(vector& input) {\n _ntt(input, -1);\n const long long n_inv = mod_inv(((long long)(input).size()), mod);\n for (auto& x : input) x = x * n_inv % mod;\n }\n vector convolution(const vector& a,\n const vector& b) {\n long long ntt_size = 1;\n while (ntt_size < ((long long)(a).size()) + ((long long)(b).size()))\n ntt_size *= 2;\n vector _a = a, _b = b;\n _a.resize(ntt_size);\n _b.resize(ntt_size);\n ntt(_a);\n ntt(_b);\n for (long long i = 0; i < (ntt_size); i++) {\n (_a[i] *= _b[i]) %= mod;\n }\n intt(_a);\n return _a;\n }\n vector powup(const vector& a, long long exponent) {\n long long ntt_size = 1;\n while (ntt_size < (((long long)(a).size()) * exponent)) ntt_size *= 2;\n vector _a = a;\n _a.resize(ntt_size);\n ntt(_a);\n for (long long i = 0; i < (ntt_size); i++) {\n _a[i] = mod_pow(_a[i], exponent, mod);\n }\n intt(_a);\n return _a;\n }\n };\n vector mul(vector a, vector b, long long mod) {\n for (auto& x : a) x %= mod;\n for (auto& x : b) x %= mod;\n NTT<167772161, 3> ntt1;\n NTT<469762049, 3> ntt2;\n NTT<1224736769, 3> ntt3;\n auto x = ntt1.convolution(a, b);\n auto y = ntt2.convolution(a, b);\n auto z = ntt3.convolution(a, b);\n const long long m1 = ntt1.get_mod(), m2 = ntt2.get_mod(), m3 = ntt3.get_mod();\n const long long m1_inv_m2 = mod_inv(m1, m2);\n const long long m12_inv_m3 = mod_inv(m1 * m2, m3);\n const long long m12_mod = m1 * m2 % mod;\n vector ret(((long long)(x).size()));\n for (long long i = 0; i < (((long long)(x).size())); i++) {\n long long v1 = (y[i] - x[i]) * m1_inv_m2 % m2;\n if (v1 < 0) v1 += m2;\n long long v2 = (z[i] - (x[i] + m1 * v1) % m3) * m12_inv_m3 % m3;\n if (v2 < 0) v2 += m3;\n long long constants3 = (x[i] + m1 * v1 + m12_mod * v2) % mod;\n if (constants3 < 0) constants3 += mod;\n ret[i] = constants3;\n }\n return ret;\n }\n vector exppoly(vector base, long long e, long long mod) {\n vector ans = {1};\n while (e > 0) {\n if (e % 2 == 1) {\n ans = mul(ans, base, mod);\n e--;\n } else {\n base = mul(base, base, mod);\n e /= 2;\n }\n }\n return ans;\n }\n const long long MOD = 1000000007LL;\n int main() {\n ios_base::sync_with_stdio(false);\n long long a, b, k, t;\n cin >> a >> b >> k >> t;\n vector v;\n for (long long x = 0; x < 2 * k + 1; x++) v.push_back(1);\n vector got = exppoly(v, t, MOD);\n long long len = got.size();\n vector suf = got;\n for (long long x = len - 2; x >= 0; x--) suf[x] = (suf[x] + suf[x + 1]) % MOD;\n long long ans = 0;\n for (long long x = 0; x < len; x++) {\n long long me = b + x;\n long long youneed = max(0LL, me + 1 - a);\n if (youneed >= len) continue;\n ans += (got[x] * suf[youneed]);\n ans %= MOD;\n }\n cout << ans << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int INF = 0x3f3f3f3f;\n bool dp[505][505];\n int c[505];\n int N, K, a[505], b[505];\n long long s1, s2;\n int main() {\n ios::sync_with_stdio(false);\n cin >> N >> K;\n for (int i = 1; i <= N; ++i) cin >> a[i] >> b[i], s1 += a[i], s2 += b[i];\n dp[0][0] = 1;\n for (int i = 0; i < N; ++i) {\n for (int j = 0; j < K; ++j) c[j] = 0, dp[i + 1][j] = dp[i][j];\n if (a[i + 1] + b[i + 1] >= K)\n for (int j = 0; j < K; ++j) {\n if (!dp[i][j]) continue;\n int l, r;\n l = max(1, K - b[i + 1]);\n r = min(K - 1, a[i + 1]);\n if (l <= r) {\n int St, Ed;\n St = j + l;\n Ed = j + r;\n St %= K;\n Ed %= K;\n c[St]++;\n if (Ed >= St) {\n c[Ed + 1]--;\n } else {\n c[0]++;\n c[Ed + 1]--;\n }\n }\n }\n for (int j = 0; j < K; ++j) {\n if (j) c[j] += c[j - 1];\n dp[i + 1][j] |= c[j];\n }\n }\n long long res = 0;\n for (int j = 0; j < K; ++j) {\n if (!dp[N][j]) continue;\n long long l1, l2;\n l1 = s1, l2 = s2;\n l1 -= j;\n l2 -= (K - j) % K;\n long long cur = bool(j) + (l1 / K) + (l2 / K);\n res = max(res, cur);\n }\n cout << res << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int main() {\n char ch;\n int n, cnt = 0;\n long long x, a;\n scanf( %d%I64d , &n, &x);\n for (int i = 0; i < n; i++) {\n while (isspace(ch = getchar()))\n ;\n scanf( %I64d , &a);\n if (ch == '+')\n x += a;\n else {\n if (x < a)\n cnt++;\n else\n x -= a;\n }\n }\n cout << x << ' ' << cnt << endl;\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int main() {\n char ch;\n int n, cnt = 0;\n long long x, a;\n scanf( %dextra , &n, &x);\n for (int i = 0; i < n; i++) {\n while (isspace(ch = getchar()))\n ;\n scanf( extra , &a);\n if (ch == '+')\n x += a;\n else {\n if (x < a)\n cnt++;\n else\n x -= a;\n }\n }\n cout << x << ' ' << cnt << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int n, a[100009];\n int main() {\n cin >> n;\n if (n == 1)\n cout << 1;\n else if ((n / 2) % 2 == 1)\n cout << -1;\n else {\n for (int i = 1; i <= (n / 2 / 2); i++) {\n a[i * 2 - 1] = i * 2;\n a[i * 2] = n - (i - 1) * 2;\n a[n - i * 2 + 1] = i * 2 - 1;\n a[n - (i - 1) * 2] = n - (i - 1) * 2 - 1;\n if (n % 2 == 1) a[n / 2 + 1] = n / 2 + 1;\n }\n for (int i = 1; i <= n; i++) cout << a[i] << ;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 200005;\n int cnt[N];\n int n, k;\n int cut[N];\n vector > arr;\n struct Sub {\n bool operator()(pair > a, pair > b) {\n if (a.first != b.first)\n return a.first < b.first;\n else\n return (cnt[a.second.second] / (a.second.first + 1)) <\n (cnt[b.second.second] / (b.second.first + 1));\n }\n };\n bool ForSort(pair a, pair b) { return a.first > b.first; }\n int main() {\n scanf( %d%d , &n, &k);\n int tx;\n for (int i = 1; i <= n; i++) scanf( %d , &tx), cnt[tx]++;\n for (int i = 1; i <= 200000; i++)\n if (cnt[i] > 0) arr.push_back({cnt[i], i});\n sort(arr.begin(), arr.end(), ForSort);\n priority_queue >,\n vector > >, Sub>\n pq;\n int len = 1, ex = arr[0].first;\n cut[arr[0].second] = 1;\n cout << arr[0].second << ;\n pq.push(pair >(arr[0].first,\n pair(1, arr[0].second)));\n int i = 1;\n pair > u =\n pair >(2, pair(10, 1));\n pair > v =\n pair >(2, pair(4, 2));\n while (len < k) {\n pair > u = pq.top();\n if (i >= arr.size()) {\n if (cut[u.second.second] + 1 <= cnt[u.second.second]) {\n len++;\n cut[u.second.second] = u.second.first + 1;\n pq.pop();\n cout << u.second.second << ;\n pq.push(pair >(\n cnt[u.second.second] / (u.second.first + 1),\n pair(u.second.first + 1, u.second.second)));\n } else\n pq.pop();\n } else {\n if (u.second.first + 1 <= cnt[u.second.second] &&\n cnt[u.second.second] / (u.second.first + 1) > arr[i].first) {\n cut[u.second.second] = u.second.first + 1;\n cout << u.second.second << ;\n len++;\n pq.pop();\n pq.push(pair >(\n cnt[u.second.second] / (u.second.first + 1),\n pair(u.second.first + 1, u.second.second)));\n } else {\n ex = min(ex, arr[i].first);\n cut[arr[i].second] = 1;\n cout << arr[i].second << ;\n len++;\n pq.push(pair >(arr[i].first,\n pair(1, arr[i].second)));\n i++;\n }\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 300010;\n long long n, a[N], t;\n map vis;\n int solve() {\n scanf( %lld , &t);\n while (t--) {\n scanf( %lld , &n);\n vis.clear();\n bool imp = 0;\n for (int i = 1; i <= n; i++) {\n scanf( %lld , &a[i]);\n long long nw = (i + a[i]) % n;\n if (nw < 0) nw += n;\n if (vis[nw]) {\n imp = 1;\n }\n vis[nw] = 1;\n }\n if (imp)\n printf( NO\n );\n else\n printf( YES\n );\n }\n return 0;\n }\n int main() { return solve(); }\n "} @@ -2719,7 +2719,7 @@ {"func_code_string": "#include \n using namespace std;\n int gcd(int a, int b);\n bool prime(int n);\n long long sumdigit(long long n);\n bool ispowerof2(int n);\n long long onesinbinary(long long n);\n long long power(long long a, long long b);\n bool cmp(pair x, pair y) { return x.second < y.second; }\n bool cmp(int x, int y) { return x > y; }\n int main() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n long long t;\n cin >> t;\n while (t--) {\n int n;\n cin >> n;\n char arr[2][n];\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < n; j++) {\n cin >> arr[i][j];\n }\n }\n int ans = 0;\n vector v;\n for (int i = 0; i < n; i++) {\n if (arr[0][i] == '0' && arr[1][i] == '0')\n ans++;\n else if (arr[0][i] == '0' || arr[1][i] == '0')\n ans += 2;\n else {\n v.push_back(i);\n }\n }\n int x = v.size();\n for (int i = 0; i < x; i++) {\n if (v[i] < n - 1 && v[i] > 0) {\n if (arr[0][v[i] - 1] == '0' && arr[1][v[i] - 1] == '0') {\n ans++;\n } else if (arr[0][v[i] + 1] == '0' && arr[1][v[i] + 1] == '0') {\n ans++;\n arr[0][v[i] + 1] = '1', arr[1][v[i] + 1] = '1';\n }\n } else if (v[i] == n - 1) {\n if (arr[0][v[i] - 1] == '0' && arr[1][v[i] - 1] == '0') {\n ans++;\n }\n } else if (v[i] == 0) {\n if (arr[0][v[i] + 1] == '0' && arr[1][v[i] + 1] == '0') {\n ans++;\n arr[0][v[i] + 1] = '1', arr[1][v[i] + 1] = '1';\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n }\n long long onesinbinary(long long n) {\n long long cnt = 0;\n while (n) {\n n = n & (n - 1);\n cnt++;\n }\n return cnt;\n }\n int gcd(int a, int b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n }\n bool prime(int n) {\n for (int i = 2; i * i <= n; i++)\n if (n % i == 0) return false;\n return true;\n }\n long long sumdigit(long long n) {\n int c = 0;\n while (n > 0) {\n c += n % 10;\n n /= 10;\n }\n return c;\n }\n bool ispowerof2(int n) {\n if (n == 0) return false;\n return (!(n & ((n) & (n - 1))));\n }\n long long power(long long a, long long b) {\n if (b == 0) return 1;\n long long res = 1;\n while (b) {\n if (b % 2 == 1) res = (res * a) % 1000000007;\n a = (a * a) % 1000000007;\n b /= 2;\n }\n return res;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long int p, c = 0;\n cin >> p;\n long long int x = p;\n long long int n = std::numeric_limits::digits - 1;\n std::string s;\n s.reserve(n + 1);\n do s.push_back(((x >> n) & 1) + '0');\n while (--n > -1);\n for (auto x : s)\n if (x == '1') c++;\n cout << c;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct Str {\n int l;\n char *s;\n } str[50010 << 2];\n int tot;\n char s[3100000];\n int k;\n int n, l[50010], r[50010];\n char ans[3100000];\n int cut(int pos) {\n for (int i = 0; i < tot; i++)\n if (pos == 0) {\n tot++;\n for (int k = tot - 1; k > i; k--) str[k] = str[k - 1];\n return i;\n } else if (str[i].l <= pos)\n pos -= str[i].l;\n else {\n tot += 2;\n for (int k = tot - 1; k > i + 1; k--) str[k] = str[k - 2];\n str[i + 2].l = str[i].l - pos;\n str[i + 2].s = str[i].s + pos;\n str[i].l = pos;\n return i + 1;\n }\n return tot++;\n }\n void getans(int h, int t) {\n int l = 0;\n for (int i = 0; t >= 0 && i < tot; i++)\n if (str[i].l <= h) {\n h -= str[i].l;\n t -= str[i].l;\n } else {\n for (int k = max(0, h); k < str[i].l && k <= t; k++)\n ans[l++] = str[i].s[k];\n int tmp = min(str[i].l, t);\n h -= tmp;\n t -= tmp;\n }\n }\n void deal(int d, int len) {\n if (d < 0) {\n Str tmp;\n tmp.l = len;\n tmp.s = s + 1;\n str[tot++] = tmp;\n return;\n }\n if (r[d] >= len) {\n deal(d - 1, len);\n return;\n }\n int c = r[d] - l[d] + 1;\n if (r[d] + c >= len) {\n deal(d - 1, r[d]);\n Str tmp;\n tmp.l = len - r[d];\n tmp.s = new char[len - r[d]];\n int c_2 = c / 2;\n int D = (tmp.l >= c_2) ? c : (tmp.l * 2);\n getans(l[d], l[d] + D - 1);\n for (int i = 0; i < tmp.l; i++)\n if (i < c_2)\n tmp.s[i] = ans[i * 2 + 1];\n else\n tmp.s[i] = ans[(i - c_2) << 1];\n str[tot++] = tmp;\n } else {\n deal(d - 1, len - c);\n int pos = cut(r[d] + 1);\n Str tmp;\n tmp.l = c;\n tmp.s = new char[c];\n int c_2 = c / 2;\n getans(l[d], r[d]);\n for (int i = 0; i < c; i++)\n if (i < c_2)\n tmp.s[i] = ans[i * 2 + 1];\n else\n tmp.s[i] = ans[(i - c_2) << 1];\n str[pos] = tmp;\n }\n }\n int main() {\n scanf( %s , s + 1);\n scanf( %d , &k);\n scanf( %d , &n);\n for (int i = 0; i < n; i++) scanf( %d%d , &l[i], &r[i]);\n tot = 1;\n str[0].l = 1;\n str[0].s = new char[1];\n str[0].s[0] = ' ';\n deal(n - 1, k);\n getans(0, k);\n ans[k + 1] = 0;\n printf( %s\n , ans + 1);\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n long long L[100005], R[100005], odd[100005], s[100005], dp[100005], ans = 0;\n int n;\n int main() {\n scanf( %d , &n);\n for (int i = 1; i < n; i++) scanf( %I64d , &s[i]);\n L[0] = 0;\n for (int i = 1; i < n; i++) {\n if (s[i] == 1)\n L[i] = 0;\n else\n L[i] = L[i - 1] + s[i] / 2 * 2;\n }\n R[n - 1] = 0;\n for (int i = n - 2; i >= 0; i--) {\n if (s[i + 1] == 1)\n R[i] = 0;\n else\n R[i] = R[i + 1] + s[i + 1] / 2 * 2;\n }\n dp[0] = 0;\n for (int i = 1; i < n; i++) {\n dp[i] = max(dp[i - 1] + (s[i] - 1) / 2 * 2 + 1, L[i]);\n }\n for (int i = 0; i < n; i++) {\n ans = max(ans, dp[i] + R[i]);\n }\n printf( %I64d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long L[100005], R[100005], odd[100005], s[100005], dp[100005], ans = 0;\n int n;\n int main() {\n scanf( %d , &n);\n for (int i = 1; i < n; i++) scanf( extra , &s[i]);\n L[0] = 0;\n for (int i = 1; i < n; i++) {\n if (s[i] == 1)\n L[i] = 0;\n else\n L[i] = L[i - 1] + s[i] / 2 * 2;\n }\n R[n - 1] = 0;\n for (int i = n - 2; i >= 0; i--) {\n if (s[i + 1] == 1)\n R[i] = 0;\n else\n R[i] = R[i + 1] + s[i + 1] / 2 * 2;\n }\n dp[0] = 0;\n for (int i = 1; i < n; i++) {\n dp[i] = max(dp[i - 1] + (s[i] - 1) / 2 * 2 + 1, L[i]);\n }\n for (int i = 0; i < n; i++) {\n ans = max(ans, dp[i] + R[i]);\n }\n printf( extra\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n long long n;\n while (cin >> n) {\n long long i = 5, cnt = 1, x, ans = 0, y, z = 5, m;\n if (n < 5 || n == 5) {\n if (n == 1)\n cout << Sheldon << endl;\n else if (n == 2)\n cout << Leonard << endl;\n else if (n == 3)\n cout << Penny << endl;\n else if (n == 4)\n cout << Rajesh << endl;\n else if (n == 5)\n cout << Howard << endl;\n continue;\n }\n while (i < n || i == n) {\n x = i;\n if (i == n) {\n x = 0;\n break;\n } else {\n z += z;\n i += z;\n }\n cnt = cnt * 2;\n }\n if (x == 0)\n cout << Howard << endl;\n else {\n y = n - x;\n if (y < 1) y *= -1;\n ans = y / cnt;\n ans++;\n if (y % cnt == 0) ans--;\n if (ans == 1)\n cout << Sheldon << endl;\n else if (ans == 2)\n cout << Leonard << endl;\n else if (ans == 3)\n cout << Penny << endl;\n else if (ans == 4)\n cout << Rajesh << endl;\n else if (ans == 5)\n cout << Howard << endl;\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int modd = 998244353;\n const int maxn = 2000 + 10;\n int n, k;\n long long dp[maxn][maxn][4];\n void solve() {\n dp[1][1][0] = dp[1][1][3] = 1;\n dp[1][2][1] = dp[1][2][2] = 1;\n for (int i = 2; i <= n; i++) {\n dp[i][1][0] = dp[i][1][3] = 1;\n dp[i][1][1] = dp[i][1][2] = 0;\n for (int j = 2; j <= k; j++) {\n dp[i][j][0] = (dp[i - 1][j][0] % modd + dp[i - 1][j][1] % modd +\n dp[i - 1][j][2] % modd + dp[i - 1][j - 1][3] % modd) %\n modd;\n dp[i][j][1] = (dp[i - 1][j - 1][0] % modd + dp[i - 1][j][1] % modd +\n dp[i - 1][j - 2][2] % modd + dp[i - 1][j - 1][3] % modd) %\n modd;\n dp[i][j][2] = (dp[i - 1][j - 1][0] % modd + dp[i - 1][j - 2][1] % modd +\n dp[i - 1][j][2] % modd + dp[i - 1][j - 1][3] % modd) %\n modd;\n dp[i][j][3] = (dp[i - 1][j - 1][0] % modd + dp[i - 1][j][1] % modd +\n dp[i - 1][j][2] % modd + dp[i - 1][j][3] % modd) %\n modd;\n }\n }\n }\n int main() {\n cin >> n >> k;\n solve();\n cout << (dp[n][k][0] % modd + dp[n][k][1] % modd + dp[n][k][2] % modd +\n dp[n][k][3] % modd) %\n modd\n << endl;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 300010;\n int ans[N], vis[N];\n vector G[N], s[N], tmp;\n void dfs(int u, int fa) {\n int sz = s[u].size();\n for (int i = 1; i <= sz; i++) vis[i] = 0;\n for (int j : s[u]) {\n if (ans[j] && ans[j] <= sz) vis[ans[j]] = 1;\n }\n for (int j = 1; j <= sz; j++) {\n if (!vis[j]) tmp.push_back(j);\n }\n int cur = 0;\n for (int j : s[u]) {\n if (!ans[j]) ans[j] = tmp[cur++];\n }\n tmp.clear();\n for (int v : G[u]) {\n if (v == fa) continue;\n dfs(v, u);\n }\n }\n int main() {\n int n, m;\n scanf( %d%d , &n, &m);\n for (int i = 1; i <= n; i++) {\n int cnt;\n scanf( %d , &cnt);\n for (int j = 1; j <= cnt; j++) {\n int x;\n scanf( %d , &x);\n s[i].push_back(x);\n }\n }\n for (int i = 1; i <= n - 1; i++) {\n int u, v;\n scanf( %d%d , &u, &v);\n G[u].push_back(v);\n G[v].push_back(u);\n }\n dfs(1, 0);\n int mx = 0;\n for (int i = 1; i <= m; i++) {\n if (!ans[i]) ans[i] = 1;\n mx = max(mx, ans[i]);\n }\n printf( %d\n , mx);\n for (int i = 1; i <= m; i++) printf( %d , ans[i]);\n printf( \n );\n return 0;\n }\n "} @@ -2772,7 +2772,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, i, j, k;\n double maxm, sum, r;\n cin >> n;\n double A[n];\n for (i = 0; i < n; i++) cin >> A[i];\n sort(A, A + n);\n maxm = A[n - 1];\n for (i = n - 1; i >= 0; i--) {\n sum = 0;\n for (j = n - 1; j >= i; j--) {\n r = A[j];\n for (k = n - 1; k >= i; k--) {\n if (k != j) r = r * (double(1.0) - A[k]);\n }\n sum += r;\n }\n if (sum > maxm) maxm = sum;\n }\n cout << setprecision(10) << maxm << endl;\n }\n "} {"func_code_string": "#include \n void fre() {\n freopen( c://test//input.in , r , stdin);\n freopen( c://test//output.out , w , stdout);\n }\n template \n inline void gmax(T &a, T b) {\n if (b > a) a = b;\n }\n template \n inline void gmin(T &a, T b) {\n if (b < a) a = b;\n }\n using namespace std;\n const int N = 1e5 + 10, M = 0, Z = 1e9 + 7, maxint = 2147483647,\n ms31 = 522133279, ms63 = 1061109567, ms127 = 2139062143;\n const double eps = 1e-8, PI = acos(-1.0);\n int n, m;\n int x, y;\n int ind[N], s[N], num, top;\n vector a[N], b[N];\n bool e[N];\n void dfs(int x) {\n e[x] = 1;\n num++;\n if (ind[x] == 0) s[++top] = x;\n for (int i = a[x].size() - 1; i >= 0; i--) {\n int y = a[x][i];\n if (!e[y]) dfs(y);\n }\n }\n int main() {\n while (~scanf( %d%d , &n, &m)) {\n memset(ind, 0, sizeof(ind));\n for (int i = 1; i <= n; i++) a[i].clear(), b[i].clear();\n for (int i = 1; i <= m; i++) {\n scanf( %d%d , &x, &y);\n ind[y]++;\n a[x].push_back(y);\n a[y].push_back(x);\n b[x].push_back(y);\n }\n int ans = 0;\n memset(e, 0, sizeof(e));\n for (int i = 1; i <= n; i++)\n if (!e[i]) {\n num = top = 0;\n dfs(i);\n int sum = top;\n while (top) {\n int x = s[top--];\n for (int j = b[x].size() - 1; j >= 0; j--) {\n int y = b[x][j];\n ind[y]--;\n if (ind[y] == 0) {\n s[++top] = y;\n sum++;\n }\n }\n }\n if (sum == num)\n ans += (num - 1);\n else\n ans += num;\n }\n printf( %d\n , ans);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int t;\n cin >> t;\n while (t--) {\n int a, b, c;\n cin >> a >> b >> c;\n if (a > b) swap(a, b);\n int mx = (b - a) * 2;\n if (a > mx || b > mx || c > mx)\n cout << -1\n ;\n else {\n if (c > mx / 2)\n cout << c - mx / 2 << \n ;\n else\n cout << c + mx / 2 << \n ;\n }\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int n, a[50100];\n long long m, ans;\n struct node {\n int s, cnt[30];\n node *ch[2];\n node();\n } * tp, *nul, *root[50100];\n int getint() {\n char ch;\n while (!isdigit(ch = getchar()))\n ;\n int x = ch - '0';\n for (; isdigit(ch = getchar()); x = x * 10 + ch - '0')\n ;\n return x;\n }\n node::node() { ch[0] = tp, tp = this; }\n node *newnode(node *x) {\n if (!tp) new node[50000];\n node *t = tp;\n tp = t->ch[0], *t = *x;\n return t;\n }\n void insert(node *&x, node *y, int w) {\n node *ret = newnode(y);\n ++(x = ret)->s;\n for (int i = 29; i >= 0; --i) {\n for (int j = 0; j <= i; ++j) x->cnt[j] += (w >> j) & 1;\n int t = (w >> i) & 1;\n x->ch[t] = newnode(y = y->ch[t]), ++(x = x->ch[t])->s;\n }\n x = ret;\n }\n int main() {\n scanf( %d%I64d , &n, &m);\n nul = new node, tp = 0;\n memset(nul, 0, sizeof(node));\n root[1] = nul->ch[0] = nul->ch[1] = nul;\n for (int i = 1; i <= n; ++i) insert(root[i + 1], root[i], a[i] = getint());\n for (int i = 29; i >= 0; --i) {\n long long sum = 0;\n for (int j = 2; j <= n; ++j) sum += root[j]->ch[1 ^ ((a[j] >> i) & 1)]->s;\n if (sum < m) {\n m -= sum, ans += (1LL << i) * sum;\n for (int j = 2; j <= n; ++j) {\n node *x = root[j]->ch[1 ^ ((a[j] >> i) & 1)];\n for (int k = 0; k <= i - 1; ++k)\n ans +=\n (1LL << k) * (((a[j] >> k) & 1) ? x->s - x->cnt[k] : x->cnt[k]);\n root[j] = root[j]->ch[(a[j] >> i) & 1];\n }\n } else {\n ans += (1LL << i) * m;\n for (int j = 2; j <= n; ++j) root[j] = root[j]->ch[1 ^ ((a[j] >> i) & 1)];\n }\n }\n printf( %d\n , ans % 1000000007);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int n, a[50100];\n long long m, ans;\n struct node {\n int s, cnt[30];\n node *ch[2];\n node();\n } * tp, *nul, *root[50100];\n int getint() {\n char ch;\n while (!isdigit(ch = getchar()))\n ;\n int x = ch - '0';\n for (; isdigit(ch = getchar()); x = x * 10 + ch - '0')\n ;\n return x;\n }\n node::node() { ch[0] = tp, tp = this; }\n node *newnode(node *x) {\n if (!tp) new node[50000];\n node *t = tp;\n tp = t->ch[0], *t = *x;\n return t;\n }\n void insert(node *&x, node *y, int w) {\n node *ret = newnode(y);\n ++(x = ret)->s;\n for (int i = 29; i >= 0; --i) {\n for (int j = 0; j <= i; ++j) x->cnt[j] += (w >> j) & 1;\n int t = (w >> i) & 1;\n x->ch[t] = newnode(y = y->ch[t]), ++(x = x->ch[t])->s;\n }\n x = ret;\n }\n int main() {\n scanf( %dextra , &n, &m);\n nul = new node, tp = 0;\n memset(nul, 0, sizeof(node));\n root[1] = nul->ch[0] = nul->ch[1] = nul;\n for (int i = 1; i <= n; ++i) insert(root[i + 1], root[i], a[i] = getint());\n for (int i = 29; i >= 0; --i) {\n long long sum = 0;\n for (int j = 2; j <= n; ++j) sum += root[j]->ch[1 ^ ((a[j] >> i) & 1)]->s;\n if (sum < m) {\n m -= sum, ans += (1LL << i) * sum;\n for (int j = 2; j <= n; ++j) {\n node *x = root[j]->ch[1 ^ ((a[j] >> i) & 1)];\n for (int k = 0; k <= i - 1; ++k)\n ans +=\n (1LL << k) * (((a[j] >> k) & 1) ? x->s - x->cnt[k] : x->cnt[k]);\n root[j] = root[j]->ch[(a[j] >> i) & 1];\n }\n } else {\n ans += (1LL << i) * m;\n for (int j = 2; j <= n; ++j) root[j] = root[j]->ch[1 ^ ((a[j] >> i) & 1)];\n }\n }\n printf( %d\n , ans % 1000000007);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int a[200001];\n void op(int i) {\n int res = a[i] ^ a[i + 1] ^ a[i + 2];\n a[i] = a[i + 1] = a[i + 2] = res;\n }\n vector push_left(int i) {\n vector v;\n while (i - 2 >= 1 && a[i] == 0 && a[i - 1] == 1 && a[i - 2] == 1) {\n op(i - 2);\n v.push_back(i - 2);\n i -= 2;\n }\n return v;\n }\n vector push_right(int i, int n) {\n vector v;\n while (i + 2 <= n && a[i] == 0 && a[i + 1] == 1 && a[i + 2] == 1) {\n op(i);\n v.push_back(i);\n i += 2;\n }\n return v;\n }\n int main() {\n int i, t;\n for (scanf( %d , &t); t--;) {\n int n;\n vector v, ans;\n int cum = 0;\n for (scanf( %d , &n), i = 1; i <= n; ++i) {\n scanf( %d , a + i);\n cum += a[i];\n }\n if (cum == 0) {\n printf( YES\n0\n );\n continue;\n } else if ((cum & 1) || cum == n) {\n printf( NO\n );\n continue;\n }\n int cur = 1;\n if (a[1]) {\n cum = a[1];\n cur = 2;\n while (cur <= n && a[cur]) cum += a[cur], ++cur;\n if (cum & 1) {\n --cur;\n bool y = 1;\n while (cur <= n && a[cur]) {\n if (cur + 2 <= n) {\n if (a[cur] + a[cur + 1] + a[cur + 2] == 3) {\n cur += 2;\n } else if (a[cur + 1] + a[cur + 2] == 0) {\n ans.push_back(cur);\n op(cur);\n cur += 2;\n } else if (a[cur + 1] == 0 && a[cur + 2] == 1) {\n ans.push_back(cur);\n op(cur);\n auto push_vec = push_left(cur);\n ans.insert(ans.end(), push_vec.begin(), push_vec.end());\n cur += 3;\n break;\n } else {\n auto push_vec = push_left(cur + 2);\n ans.insert(ans.end(), push_vec.begin(), push_vec.end());\n cur += 3;\n break;\n }\n } else {\n y = 0;\n break;\n }\n }\n if (y == 0) {\n printf( NO\n );\n continue;\n }\n } else {\n ans = push_left(cur);\n }\n }\n cur = 1;\n while (cur + 2 <= n) {\n if (a[cur] == 0 && a[cur + 1] + a[cur + 2] == 2) {\n op(cur);\n ans.push_back(cur);\n cur += 2;\n } else if (a[cur]) {\n int st = cur - 1;\n while (1) {\n if (cur + 2 <= n && a[cur + 1] + a[cur + 2] == 2)\n cur += 2;\n else if (cur + 2 <= n && a[cur + 1] + a[cur + 2] == 0) {\n op(cur);\n ans.push_back(cur);\n cur += 2;\n } else if (cur + 2 <= n && a[cur + 1] == 0 && a[cur + 2] == 1) {\n op(cur);\n ans.push_back(cur);\n break;\n } else {\n break;\n }\n }\n auto push_vec = push_right(st, n);\n ans.insert(ans.end(), push_vec.begin(), push_vec.end());\n } else\n ++cur;\n }\n cum = 0;\n for (i = 1; i <= n; ++i) cum += a[i];\n if (cum == 0) {\n printf( YES\n%d\n , ans.size());\n for (auto x : ans) printf( %d , x);\n puts( );\n } else\n printf( NO\n );\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n inline void read(T& x) {\n x = 0;\n char s = (char)getchar();\n bool f = false;\n while (!(s >= '0' && s <= '9')) {\n if (s == '-') f = true;\n s = (char)getchar();\n }\n while (s >= '0' && s <= '9') {\n x = (x << 1) + (x << 3) + s - '0';\n s = (char)getchar();\n }\n if (f) x = (~x) + 1;\n }\n const long long N = 2e6 + 5, mod = 998244353, MAX = 2e6;\n long long power[N], fac[N], inv[N];\n inline long long quickpow(long long a, long long b, long long p = mod) {\n long long res = 1;\n while (b) {\n if (b & 1) res = res * a % p;\n a = a * a % p;\n b >>= 1;\n }\n return res;\n }\n inline long long C(long long n, long long m) {\n if (n < m) return 0;\n return fac[n] * inv[m] % mod * inv[n - m] % mod;\n }\n long long n;\n long long ans[N];\n void init() {\n long long limit = 2e5;\n long long x = 810;\n ans[1] = 10;\n ans[2] = 180;\n for (register long long i = 3; i <= limit; ++i) {\n ans[i] = ans[i - 1] * 10 + x;\n x *= 10;\n ans[i] %= mod, x %= mod;\n }\n }\n signed main() {\n init();\n long long n;\n cin >> n;\n for (register long long i = n; i >= 1; --i) cout << ans[i] << ;\n cout << '\n';\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int kN = 100 + 1;\n const int kA = 256;\n bool dp[kN][kN][kA];\n bool used[kN][kN][kA];\n vector > g[kN];\n bool Dp(int u, int v, int mark) {\n if (!used[u][v][mark]) {\n used[u][v][mark] = true;\n dp[u][v][mark] = false;\n for (const auto& edge : g[u]) {\n if (edge.second < mark) {\n continue;\n }\n dp[u][v][mark] = dp[u][v][mark] || !Dp(v, edge.first, edge.second);\n }\n }\n return dp[u][v][mark];\n }\n void Solve() {\n int n, m;\n cin >> n >> m;\n for (int i = 0; i < m; ++i) {\n int u, v;\n char ch;\n cin >> u >> v >> ch;\n g[u - 1].emplace_back(v - 1, int(ch));\n }\n for (int u = 0; u < n; ++u) {\n for (int v = 0; v < n; ++v) {\n cout << (Dp(u, v, 0) ? 'A' : 'B');\n }\n cout << '\n';\n }\n }\n int main() {\n std::ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int tests_count = 1;\n for (int test_index = 0; test_index < tests_count; ++test_index) {\n Solve();\n }\n return 0;\n }\n "} @@ -2847,7 +2847,7 @@ {"func_code_string": "#include \n using namespace std;\n const int MN = 51;\n char a[MN][MN], b[MN][MN];\n const char L = 'L', R = 'R', U = 'U', D = 'D';\n vector > sol, sol2;\n int n, m;\n void show() {\n ;\n for (int i = 0; i < n; ++i)\n ;\n ;\n ;\n for (int i = 0; i < n; ++i)\n ;\n ;\n }\n bool move(char arr[MN][MN], int i, int j) {\n ;\n if (arr[i][j] == U && arr[i][j + 1] == U && arr[i + 1][j] == D &&\n arr[i + 1][j + 1] == D) {\n ;\n arr[i][j] = arr[i + 1][j] = L;\n arr[i][j + 1] = arr[i + 1][j + 1] = R;\n } else if (arr[i][j] == L && arr[i + 1][j] == L && arr[i][j + 1] == R &&\n arr[i + 1][j + 1] == R) {\n ;\n arr[i][j] = arr[i][j + 1] = U;\n arr[i + 1][j] = arr[i + 1][j + 1] = D;\n } else {\n ;\n return false;\n }\n sol.emplace_back(i, j);\n return true;\n ;\n show();\n }\n void push(char arr[MN][MN], int i, int k, bool ver) {\n char aim = ver ? U : L;\n ;\n show();\n assert(arr[i][k] == L || arr[i][k] == U);\n if (arr[i][k] != aim) {\n if (!move(arr, i, k)) {\n push(arr, i + ver, k + !ver, !ver);\n move(arr, i, k);\n }\n }\n }\n int main() {\n scanf( %d%d , &n, &m);\n for (int i = 0; i < n; ++i) scanf( %s , a[i]);\n for (int i = 0; i < n; ++i) scanf( %s , b[i]);\n if (n % 2) {\n ;\n for (int k = 0; k < m; k += 2)\n for (int i = 0; i < n; ++i) push(a, i, k, false);\n swap(sol, sol2);\n ;\n for (int k = 0; k < m; k += 2)\n for (int i = 0; i < n; i++) push(b, i, k, false);\n } else {\n ;\n for (int i = 0; i < n; i += 2)\n for (int k = 0; k < m; k++) push(a, i, k, true);\n swap(sol, sol2);\n ;\n for (int i = 0; i < n; i += 2)\n for (int k = 0; k < m; k++) push(b, i, k, true);\n }\n printf( %d\n , (int)(sol.size() + sol2.size()));\n reverse(sol.begin(), sol.end());\n for (auto x : sol2) printf( %d %d\n , x.first + 1, x.second + 1);\n for (auto x : sol) printf( %d %d\n , x.first + 1, x.second + 1);\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n int t;\n cin >> t;\n while (t-- > 0) {\n int l, r;\n cin >> l >> r;\n cout << l << << 2 * l << \n ;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n char ans[4][128];\n int main() {\n int i, j, n;\n while (scanf( %d , &n) != EOF) {\n memset(ans, 0, sizeof(ans));\n if (n % 2 == 1) {\n j = 0;\n ans[0][0] = 'a' + j;\n ans[1][0] = 'a' + j;\n j = (j + 1) % 26;\n for (i = 0; i < n; i += 2) {\n ans[0][i + 1] = ans[0][i + 2] = 'a' + j;\n j = (j + 1) % 26;\n ans[1][i + 1] = ans[1][i + 2] = 'a' + j;\n j = (j + 1) % 26;\n ans[2][i + 1] = ans[2][i] = 'a' + j;\n j = (j + 1) % 26;\n ans[3][i + 1] = ans[3][i] = 'a' + j;\n j = (j + 1) % 26;\n }\n ans[2][n - 1] = 'a' + j;\n ans[3][n - 1] = 'a' + j;\n ans[0][n] = ans[1][n] = ans[2][n] = ans[3][n] = '\0';\n } else {\n j = 0;\n ans[1][0] = 'a' + j;\n ans[2][0] = 'a' + j;\n j = (j + 1) % 26;\n for (i = 0; i < n; i += 2) {\n ans[1][i + 1] = ans[1][i + 2] = 'a' + j;\n j = (j + 1) % 26;\n ans[2][i + 1] = ans[2][i + 2] = 'a' + j;\n j = (j + 1) % 26;\n ans[0][i + 1] = ans[0][i] = 'a' + j;\n j = (j + 1) % 26;\n ans[3][i + 1] = ans[3][i] = 'a' + j;\n j = (j + 1) % 26;\n }\n ans[1][n - 1] = 'a' + j;\n ans[2][n - 1] = 'a' + j;\n ans[0][n] = ans[1][n] = ans[2][n] = ans[3][n] = '\0';\n }\n puts(ans[0]);\n puts(ans[1]);\n puts(ans[2]);\n puts(ans[3]);\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int n, Mod, p[100010], a[200010], nxt[200010], w[200010], tot, root,\n size[100010], son[100010], cnt;\n bool vis[100010];\n long long ans, mul[100010];\n struct record {\n int dep, step;\n record(int D = 0, int S = 0) {\n dep = D;\n step = S;\n }\n } pre[100010], suf[100010];\n int comp(record a, record b) { return a.dep < b.dep; }\n void add(int x, int y, int val) {\n tot++;\n a[tot] = y;\n nxt[tot] = p[x];\n w[tot] = val;\n p[x] = tot;\n }\n void getroot(int u, int fa, int N) {\n size[u] = 1;\n son[u] = 0;\n for (int i = p[u]; i != 0; i = nxt[i])\n if (a[i] != fa && vis[a[i]] == false) {\n getroot(a[i], u, N);\n size[u] += size[a[i]];\n son[u] = max(son[u], size[a[i]]);\n }\n son[u] = max(son[u], N - size[u]);\n if (son[u] < son[root]) root = u;\n }\n void getdeep(int u, int fa, long long pred, int step, long long sufd) {\n pre[++cnt] = record(pred, step);\n suf[cnt] = record(sufd, step);\n for (int i = p[u]; i != 0; i = nxt[i])\n if (a[i] != fa && vis[a[i]] == false)\n getdeep(a[i], u, (pred * 10 + w[i]) % Mod, step + 1,\n (sufd + w[i] * mul[step] % Mod) % Mod);\n }\n int findL(int l, int r, int x, record *v) {\n int mid;\n while (l != r) {\n mid = (l + r) >> 1;\n if (v[mid].dep >= x)\n r = mid;\n else\n l = mid + 1;\n }\n if (v[l].dep != x) return 1000000000;\n return l;\n }\n int findR(int l, int r, int x, record *v) {\n int mid, ans = 0;\n while (l <= r) {\n mid = (l + r) >> 1;\n if (v[mid].dep <= x) {\n ans = max(ans, mid);\n l = mid + 1;\n } else\n r = mid - 1;\n }\n if (v[ans].dep != x) return 0;\n return ans;\n }\n long long getnum(int l, int r, int now, record *v) {\n int L, R;\n if (l > r) return 0;\n L = findL(l, r, now, v);\n R = findR(l, r, now, v);\n if (L <= R) return R - L + 1;\n return 0;\n }\n void exgcd(int a, int b, long long &x, long long &y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return;\n }\n long long t;\n exgcd(b, a % b, x, y);\n t = x;\n x = y;\n y = t - (a / b) * y;\n }\n int getinv(long long A, long long B) {\n long long x, y;\n exgcd(A, Mod, x, y);\n x = (x % Mod + Mod) % Mod;\n x = (x * B) % Mod;\n return x;\n }\n long long calc(int u, int pre0, int s0, int suf0) {\n long long sum = 0;\n cnt = 0;\n getdeep(u, 0, pre0, s0, suf0);\n sort(pre + 1, pre + cnt + 1, comp);\n sort(suf + 1, suf + cnt + 1, comp);\n for (int i = 1; i <= cnt; i++) {\n int now = getinv(mul[pre[i].step], Mod - pre[i].dep);\n sum += getnum(1, cnt, now, suf);\n if (now == 0) --sum;\n }\n return sum;\n }\n void work(int u) {\n ans += calc(u, 0, 0, 0);\n vis[u] = true;\n for (int i = p[u]; i != 0; i = nxt[i])\n if (vis[a[i]] == false) {\n ans -= calc(a[i], w[i] % Mod, 1, w[i] % Mod);\n root = 0;\n getroot(a[i], 0, size[a[i]]);\n work(root);\n }\n }\n int main() {\n scanf( %d%d , &n, &Mod);\n for (int i = 1; i < n; i++) {\n int x, y, v;\n scanf( %d%d%d , &x, &y, &v);\n ++x;\n ++y;\n add(x, y, v);\n add(y, x, v);\n }\n son[0] = 1000000000;\n root = 0;\n mul[0] = 1;\n for (int i = 1; i <= n; i++) mul[i] = mul[i - 1] * 10 % Mod;\n getroot(1, 0, n);\n work(root);\n printf( %I64d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int n, Mod, p[100010], a[200010], nxt[200010], w[200010], tot, root,\n size[100010], son[100010], cnt;\n bool vis[100010];\n long long ans, mul[100010];\n struct record {\n int dep, step;\n record(int D = 0, int S = 0) {\n dep = D;\n step = S;\n }\n } pre[100010], suf[100010];\n int comp(record a, record b) { return a.dep < b.dep; }\n void add(int x, int y, int val) {\n tot++;\n a[tot] = y;\n nxt[tot] = p[x];\n w[tot] = val;\n p[x] = tot;\n }\n void getroot(int u, int fa, int N) {\n size[u] = 1;\n son[u] = 0;\n for (int i = p[u]; i != 0; i = nxt[i])\n if (a[i] != fa && vis[a[i]] == false) {\n getroot(a[i], u, N);\n size[u] += size[a[i]];\n son[u] = max(son[u], size[a[i]]);\n }\n son[u] = max(son[u], N - size[u]);\n if (son[u] < son[root]) root = u;\n }\n void getdeep(int u, int fa, long long pred, int step, long long sufd) {\n pre[++cnt] = record(pred, step);\n suf[cnt] = record(sufd, step);\n for (int i = p[u]; i != 0; i = nxt[i])\n if (a[i] != fa && vis[a[i]] == false)\n getdeep(a[i], u, (pred * 10 + w[i]) % Mod, step + 1,\n (sufd + w[i] * mul[step] % Mod) % Mod);\n }\n int findL(int l, int r, int x, record *v) {\n int mid;\n while (l != r) {\n mid = (l + r) >> 1;\n if (v[mid].dep >= x)\n r = mid;\n else\n l = mid + 1;\n }\n if (v[l].dep != x) return 1000000000;\n return l;\n }\n int findR(int l, int r, int x, record *v) {\n int mid, ans = 0;\n while (l <= r) {\n mid = (l + r) >> 1;\n if (v[mid].dep <= x) {\n ans = max(ans, mid);\n l = mid + 1;\n } else\n r = mid - 1;\n }\n if (v[ans].dep != x) return 0;\n return ans;\n }\n long long getnum(int l, int r, int now, record *v) {\n int L, R;\n if (l > r) return 0;\n L = findL(l, r, now, v);\n R = findR(l, r, now, v);\n if (L <= R) return R - L + 1;\n return 0;\n }\n void exgcd(int a, int b, long long &x, long long &y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return;\n }\n long long t;\n exgcd(b, a % b, x, y);\n t = x;\n x = y;\n y = t - (a / b) * y;\n }\n int getinv(long long A, long long B) {\n long long x, y;\n exgcd(A, Mod, x, y);\n x = (x % Mod + Mod) % Mod;\n x = (x * B) % Mod;\n return x;\n }\n long long calc(int u, int pre0, int s0, int suf0) {\n long long sum = 0;\n cnt = 0;\n getdeep(u, 0, pre0, s0, suf0);\n sort(pre + 1, pre + cnt + 1, comp);\n sort(suf + 1, suf + cnt + 1, comp);\n for (int i = 1; i <= cnt; i++) {\n int now = getinv(mul[pre[i].step], Mod - pre[i].dep);\n sum += getnum(1, cnt, now, suf);\n if (now == 0) --sum;\n }\n return sum;\n }\n void work(int u) {\n ans += calc(u, 0, 0, 0);\n vis[u] = true;\n for (int i = p[u]; i != 0; i = nxt[i])\n if (vis[a[i]] == false) {\n ans -= calc(a[i], w[i] % Mod, 1, w[i] % Mod);\n root = 0;\n getroot(a[i], 0, size[a[i]]);\n work(root);\n }\n }\n int main() {\n scanf( %d%d , &n, &Mod);\n for (int i = 1; i < n; i++) {\n int x, y, v;\n scanf( %d%d%d , &x, &y, &v);\n ++x;\n ++y;\n add(x, y, v);\n add(y, x, v);\n }\n son[0] = 1000000000;\n root = 0;\n mul[0] = 1;\n for (int i = 1; i <= n; i++) mul[i] = mul[i - 1] * 10 % Mod;\n getroot(1, 0, n);\n work(root);\n printf( extra\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n inline T gcd(T a, T b) {\n return b ? gcd(b, a % b) : a;\n }\n template \n inline T LCM(T a, T b) {\n if (a < 0) return LCM(-a, b);\n if (b < 0) return LCM(a, -b);\n return a * (b / gcd(a, b));\n }\n vector arr;\n const int N = 50005;\n int memo[5001];\n int save[N];\n int visit[N];\n int find(int pos, int &xr) {\n for (int i = 0; i < N; i++) visit[i] = 0;\n vector toAdd;\n int end = pos;\n visit[arr[pos]] = 1;\n for (int i = 0; i < pos; i++) {\n visit[arr[i]] = 2;\n }\n if (visit[arr[pos]] == 2) {\n return -1;\n }\n bool cant = false;\n for (int i = pos; i < arr.size(); i++) {\n if (visit[arr[i]] == 2) {\n cant = true;\n }\n if (visit[arr[i]] == 1) {\n if (cant) return -1;\n for (int j = 0; j < toAdd.size(); j++) {\n visit[toAdd[j]] = 1;\n }\n toAdd.clear();\n end = i;\n } else {\n toAdd.push_back(arr[i]);\n }\n }\n xr = 0;\n for (int i = 0; i < N; i++) {\n if (visit[i] == 1) {\n xr = xr ^ i;\n }\n }\n return end;\n }\n int solve(int from) {\n int txr = 0;\n int ret = 0;\n if (from >= arr.size()) return 0;\n if (memo[from] != -1) {\n return memo[from];\n }\n int end = find(from, txr);\n if (end != -1) {\n ret = max(txr + solve(end + 1), solve(from + 1));\n } else {\n ret = solve(from + 1);\n }\n memo[from] = ret;\n return ret;\n }\n int main() {\n int n, i, temp, j;\n for (i = (int)0; i < (int)5001; ++i) {\n memo[i] = -1;\n }\n scanf( %d , &n);\n for (i = (int)0; i < (int)n; ++i) {\n scanf( %d , &temp);\n arr.push_back(temp);\n }\n int xx;\n cout << solve(0);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int a, b, c, d;\n void solve() {\n double m = max((3.0) * a / (10.0), (double)(a - a * c / 250));\n double v = max((3.0) * b / (10.0), (double)(b - b * d / 250));\n if (m > v) cout << Misha << endl;\n if (m == v) cout << Tie << endl;\n if (m < v) cout << Vasya << endl;\n }\n int main() {\n while (cin >> a >> b >> c >> d) {\n solve();\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n string op;\n bool check(int l, int r) {\n char c;\n cout << ? << l << << r << endl;\n cin >> c;\n return c == 'x';\n }\n int main() {\n while (cin >> op) {\n if (op == end ) {\n return 0;\n }\n int l = 1, r = 2;\n while (1) {\n if (check(l, r)) break;\n l <<= 1, r <<= 1;\n }\n while (l + 1 < r) {\n int mid = (l + r) >> 1;\n if (check(l - 1, mid))\n r = mid;\n else\n l = mid + 1;\n }\n if (l == 1 && r == 2) {\n if (check(2, 3))\n cout << ! 1 << endl;\n else\n cout << ! 2 << endl;\n } else {\n if (l == r)\n cout << ! << l << endl;\n else {\n if (check(l, l + 1))\n cout << ! << l + 1 << endl;\n else\n cout << ! << l << endl;\n }\n }\n }\n }\n "} @@ -2862,7 +2862,7 @@ {"func_code_string": "#include \n using namespace std;\n int main() {\n long long num, tmp, sum, mx, l, r, mid;\n cin >> num;\n mx = sum = 0;\n for (int i = 0; i < num; i++) {\n cin >> tmp;\n sum += tmp;\n mx = max(mx, tmp);\n }\n l = mx;\n r = sum;\n while (l < r) {\n mid = (l + r) / 2;\n if (mid * num - sum >= mid)\n r = mid;\n else\n l = mid + 1;\n }\n cout << l;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 505;\n const int maxm = 1e4 + 5;\n struct node {\n int pre[maxn];\n void init() {\n for (int i = 0; i < maxn; ++i) {\n pre[i] = i;\n }\n }\n int Find(int x) {\n if (x != pre[x]) pre[x] = Find(pre[x]);\n return pre[x];\n }\n void v(int x, int y) {\n int fx = Find(x), fy = Find(y);\n if (fx != fy) pre[fy] = fx;\n }\n };\n struct node q[maxm], h[maxm];\n int u[maxm], v[maxm];\n int n, m;\n int solve(node a, node b) {\n int ans = 0;\n for (int i = 1; i <= n; ++i) {\n a.v(i, b.Find(i));\n }\n for (int i = 1; i <= n; ++i) {\n if (a.Find(i) == i) ans++;\n }\n return ans;\n }\n int main() {\n scanf( %d%d , &n, &m);\n for (int i = 1; i <= m; ++i) scanf( %d%d , &u[i], &v[i]);\n q[0].init();\n h[m + 1].init();\n for (int i = 1; i <= m; ++i) {\n q[i] = q[i - 1];\n q[i].v(u[i], v[i]);\n }\n for (int i = m; i >= 1; --i) {\n h[i] = h[i + 1];\n h[i].v(u[i], v[i]);\n }\n int tt;\n scanf( %d , &tt);\n while (tt--) {\n int x, y;\n scanf( %d%d , &x, &y);\n printf( %d\n , solve(q[x - 1], h[y + 1]));\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n cin >> n;\n vector v, t;\n v.push_back(0), t.push_back(0);\n long long int sum = 0, tt = 1, x = 0;\n double result = 0;\n long long int ix, a, b;\n for (int i = 0; i < n; ++i) {\n cin >> ix;\n if (ix == 1) {\n cin >> a >> b;\n t[a - 1] += b;\n sum += a * b;\n } else if (ix == 2) {\n cin >> a;\n v.push_back(a), t.push_back(0);\n sum += a;\n ++tt;\n } else {\n t[t.size() - 2] += t.back();\n sum -= (v.back() + t.back());\n --tt;\n v.pop_back(), t.pop_back();\n }\n result = (double)sum / (double)tt;\n cout << fixed << setprecision(6) << result << '\n';\n }\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const long long N = 1e9 + 5;\n long long n, k;\n bool valid(long long x) {\n long long maxi = (x)*k - ((x - 1) * ((x + 2) / 2.0));\n if (maxi >= n)\n return true;\n else\n return false;\n }\n long long binary() {\n long long lo = 0, mid, hi = k;\n while (hi - lo > 0) {\n mid = (hi + lo) / 2;\n if (valid(mid))\n hi = mid;\n else\n lo = mid + 1;\n }\n if (hi == lo)\n return lo;\n else\n return -1;\n }\n int main() {\n scanf( %I64d %I64d , &n, &k);\n long long ans = binary();\n long long maxi = k;\n maxi += (ans - 1) * k - ((ans - 1) * ((ans + 2) / 2));\n if (ans & 1 && ans != 1) maxi--;\n if (maxi >= n)\n printf( %I64d , ans);\n else\n printf( -1 );\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const long long N = 1e9 + 5;\n long long n, k;\n bool valid(long long x) {\n long long maxi = (x)*k - ((x - 1) * ((x + 2) / 2.0));\n if (maxi >= n)\n return true;\n else\n return false;\n }\n long long binary() {\n long long lo = 0, mid, hi = k;\n while (hi - lo > 0) {\n mid = (hi + lo) / 2;\n if (valid(mid))\n hi = mid;\n else\n lo = mid + 1;\n }\n if (hi == lo)\n return lo;\n else\n return -1;\n }\n int main() {\n scanf( extra extra , &n, &k);\n long long ans = binary();\n long long maxi = k;\n maxi += (ans - 1) * k - ((ans - 1) * ((ans + 2) / 2));\n if (ans & 1 && ans != 1) maxi--;\n if (maxi >= n)\n printf( extra , ans);\n else\n printf( -1 );\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int cnt[3600];\n int main() {\n int n;\n cin >> n;\n for (int i = 0; i < n; i++) {\n int h, m;\n scanf( \n%d:%d , &h, &m);\n cnt[h * 60 + m]++;\n }\n int ans = 0;\n for (int i = 0; i < 1440; i++) {\n if (cnt[i] == 0) {\n int cur = 1, j = (i + 1) % 1440;\n while (j != i && cnt[j] == 0) {\n j = (j + 1) % 1440;\n cur++;\n }\n ans = max(ans, cur);\n }\n }\n cout << (ans / 60) / 10 << (ans / 60) % 10 << : << (ans % 60) / 10\n << ans % 10;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long N = 1e6 + 10;\n int a[N], b[N];\n int main() {\n int n;\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> a[i];\n }\n vector ans;\n for (int i = 1; i <= n; i++) {\n b[i] = a[i] - a[i - 1];\n }\n for (int i = 1; i <= n; i++) {\n int flag = 0;\n for (int j = 1; i + j <= n; j++) {\n if (b[j] != b[i + j]) {\n flag++;\n break;\n }\n }\n if (!flag) {\n ans.push_back(i);\n }\n }\n cout << ans.size() << endl;\n for (auto i : ans) cout << i << ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 1e5 + 6;\n bool flag = true;\n vector v[N];\n int a[N], p[N], h[N], g[N];\n void dfs(int u, int temp = -1) {\n a[u] = p[u];\n int sum = 0;\n for (auto x : v[u]) {\n if (x == temp) continue;\n dfs(x, u);\n sum += g[x];\n a[u] += a[x];\n }\n if ((a[u] + h[u]) % 2 != 0) flag = false;\n g[u] = (a[u] + h[u]) / 2;\n if (g[u] >= 0 and g[u] <= a[u]) {\n } else\n flag = false;\n if (sum > g[u]) flag = false;\n }\n int main() {\n long long int t;\n cin >> t;\n while (t--) {\n int n, m;\n cin >> n >> m;\n for (int i = 0; i < n; i++) cin >> p[i];\n ;\n for (int i = 0; i < n; i++) cin >> h[i];\n ;\n for (int i = 0; i < n - 1; i++) {\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n v[a].push_back(b);\n v[b].push_back(a);\n }\n dfs(0);\n cout << (flag ? YES : NO ) << endl;\n flag = true;\n for (int i = 0; i < n; i++) v[i].clear();\n }\n }\n "} @@ -2902,12 +2902,12 @@ {"func_code_string": "#include \n using namespace std;\n const long long int delta = 1e9 + 5;\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n ;\n int x;\n int d;\n cin >> x >> d;\n vector ans;\n long long int cur = 1;\n for (int i = 31; i >= 0; i--) {\n long long int cnt = (1LL << i);\n while (x >= cnt) {\n x -= cnt;\n for (int j = 0; j < i; j++) {\n ans.push_back(cur);\n }\n cur += d;\n ans.push_back(cur);\n cur += d;\n }\n }\n cout << ans.size() << '\n';\n for (auto a : ans) cout << a << ;\n cout << endl;\n ;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n string str;\n cin >> str;\n int n = str.length();\n map mp;\n for (int i = 0; i < n; i++) {\n mp[str[i]]++;\n }\n if (mp.size() % 2 == 1)\n cout << IGNORE HIM! ;\n else\n cout << CHAT WITH HER! ;\n cout << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long MOD = 998244353LL, INV2 = (MOD + 1) / 2;\n const int MAXN = 500;\n long long DP[MAXN + 1][MAXN + 1];\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n int N, K;\n cin >> N >> K;\n for (int k = 1; k <= min(N, K); ++k) {\n DP[k][0] = 2;\n for (int n = 1; n <= N; ++n) {\n for (int m = n - 1; m >= 0 && n - m <= k; --m) DP[k][n] += DP[k][m];\n DP[k][n] %= MOD;\n }\n }\n long long ans = 0;\n for (int k = 1; k <= N && k < K; ++k) {\n long long aux = (DP[k][N] + MOD - DP[k - 1][N]) *\n DP[min((K + k - 1) / k - 1, N)][N] % MOD;\n aux = aux * INV2 % MOD;\n ans += aux;\n ans %= MOD;\n }\n cout << ans << '\n';\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n long long cubes[100001], x;\n long long my_pow(long long x) { return x * x * x; }\n pair best;\n void rec(long long m, long long steps, long long subtracted) {\n if (m == 0) {\n best = max(best, make_pair(steps, subtracted));\n return;\n }\n long long x = 1;\n while (my_pow(x + 1) <= m) ++x;\n rec(m - my_pow(x), steps + 1, subtracted + my_pow(x));\n if (x - 1 >= 0)\n rec(my_pow(x) - 1 - my_pow(x - 1), steps + 1, subtracted + my_pow(x - 1));\n }\n int main() {\n long long m;\n scanf( %I64d , &m);\n rec(m, 0, 0);\n printf( %I64d %I64d , best.first, best.second);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long cubes[100001], x;\n long long my_pow(long long x) { return x * x * x; }\n pair best;\n void rec(long long m, long long steps, long long subtracted) {\n if (m == 0) {\n best = max(best, make_pair(steps, subtracted));\n return;\n }\n long long x = 1;\n while (my_pow(x + 1) <= m) ++x;\n rec(m - my_pow(x), steps + 1, subtracted + my_pow(x));\n if (x - 1 >= 0)\n rec(my_pow(x) - 1 - my_pow(x - 1), steps + 1, subtracted + my_pow(x - 1));\n }\n int main() {\n long long m;\n scanf( extra , &m);\n rec(m, 0, 0);\n printf( extra extra , best.first, best.second);\n return 0;\n }\n "} {"func_code_string": "#include \n #pragma GCC optimize( Ofast )\n using namespace std;\n const long long infl = 0x3f3f3f3f3f3f3f3fLL;\n const long long infi = 0x3f3f3f3f;\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\n const long long mod = 1e9 + 7;\n const long long N = 1e6 + 5;\n void solve() {\n long long m;\n cin >> m;\n cout << (m / 4 + 1) % mod * ((m / 2 - m / 4 + 1) % mod + mod) % mod << '\n';\n }\n signed main() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n long long t = 1;\n cin >> t;\n while (t--) solve();\n return 0;\n }\n long long powm(long long a, long long b) {\n long long res = 1;\n while (b) {\n if (b & 1) res = (res * a) % mod;\n a = (a * a) % mod;\n b >>= 1;\n }\n return res;\n }\n long long divide(long long a, long long b) {\n return (a % mod) * powm(b, mod - 2) % mod;\n }\n long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }\n "} {"func_code_string": "#include \n using namespace std;\n int ABS(int a) {\n if (a < 0) return (-a);\n return a;\n }\n void input() {}\n int n, table;\n int a[55];\n double dp[55][55][55][55];\n int aim;\n double f(int idx, int sum, int k, int cnt) {\n if (idx == n) {\n if (sum != aim || cnt == 0) return 0;\n return (k * cnt * 1.0) / ((double)(n)-k);\n }\n double &res = dp[idx][sum][k][cnt];\n if (res > -0.5) return res;\n double invK = (k + 1.0) / (idx + 1.0);\n double invNK = (idx - k + 1.0) / (idx + 1.0);\n res = 0.0;\n if (sum + a[idx] <= aim) {\n res += invK * f(idx + 1, sum + a[idx], k + 1, cnt);\n }\n if (aim + a[idx] > table) cnt++;\n res += invNK * f(idx + 1, sum, k, cnt);\n return res;\n }\n int main() {\n input();\n cin >> n;\n int sum = 0;\n for (int i = (0); i < (n); ++i) {\n cin >> a[i];\n sum += a[i];\n }\n cin >> table;\n if (sum <= table) {\n printf( %d\n , n);\n return 0;\n }\n double ans = 0.0;\n for (int i = (1); i < (table + 1); ++i) {\n for (int I = (0); I < (55); ++I)\n for (int j = (0); j < (55); ++j)\n for (int k = (0); k < (55); ++k)\n for (int l = (0); l < (55); ++l) dp[I][j][k][l] = -1.0;\n aim = i;\n ans += f(0, 0, 0, 0);\n }\n printf( %.12lf\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int MAXN = 100010;\n const int MAXK = 20;\n int times[MAXN];\n int dp[MAXN][MAXK];\n int subtree[MAXN];\n int marc[MAXN];\n int prof[MAXN];\n vector graph[MAXN];\n vector> arcs;\n void init_dfs(int u) {\n marc[u] = 1;\n for (int v : graph[u]) {\n if (marc[v]) continue;\n dp[v][0] = u;\n for (int i = 1; i < MAXK; ++i) dp[v][i] = dp[dp[v][i - 1]][i - 1];\n prof[v] = prof[u] + 1;\n init_dfs(v);\n }\n }\n inline int lca(int a, int b) {\n if (prof[a] > prof[b]) swap(a, b);\n int d = prof[b] - prof[a];\n for (int i = 0; i < MAXK; ++i)\n if (d & (1 << i)) b = dp[b][i];\n if (a == b) return a;\n for (int i = MAXK - 1; i >= 0; --i)\n if (dp[a][i] != dp[b][i]) {\n a = dp[a][i];\n b = dp[b][i];\n }\n return dp[a][0];\n }\n inline void add_path(int u, int v) {\n ++times[u];\n --times[v];\n }\n inline void add_arc(int u, int v) {\n graph[u].push_back(v);\n graph[v].push_back(u);\n arcs.push_back({u, v});\n }\n void final_dfs(int u) {\n marc[u] = 2;\n subtree[u] = times[u];\n for (int v : graph[u]) {\n if (marc[v] == 2) continue;\n final_dfs(v);\n subtree[u] += subtree[v];\n }\n }\n int main() {\n int n;\n scanf( %d , &n);\n for (int i = 0; i < n - 1; ++i) {\n int u, v;\n scanf( %d%d , &u, &v);\n add_arc(u, v);\n }\n init_dfs(1);\n int k;\n scanf( %d , &k);\n for (int i = 0; i < k; ++i) {\n int u, v;\n scanf( %d%d , &u, &v);\n int w = lca(u, v);\n add_path(u, w);\n add_path(v, w);\n }\n final_dfs(1);\n for (auto [u, v] : arcs) {\n if (prof[u] < prof[v]) swap(u, v);\n printf( %d , subtree[u]);\n }\n printf( \n );\n }\n "} {"func_code_string": "#include \n using namespace std;\n vector> v[4];\n double x[3], y[3], r[3];\n void add_point(int p, double x, double y) {\n for (int t = 0; t < v[p].size(); t++)\n if (fabs(x - v[p][t].first) < 1e-7 && fabs(y - v[p][t].second) < 1e-7)\n return;\n v[p].push_back(make_pair(x, y));\n }\n int main() {\n int n, ans = 0;\n cin >> n;\n for (int i = 0; i < n; i++) cin >> x[i] >> y[i] >> r[i];\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n double a = 2 * (x[j] - x[i]), b = 2 * (y[j] - y[i]),\n c = (a * a + b * b) / 4 + r[i] * r[i] - r[j] * r[j];\n double d = a * a + b * b, x0 = a * c / d + x[i], y0 = b * c / d + y[i],\n md = r[i] * r[i] * d - c * c;\n if (i == j || md < 0) continue;\n b *= sqrt(md) / d, a *= sqrt(md) / d;\n for (int k = 0, p[3] = {3, i, j}; k < 3; k++)\n add_point(p[k], x0 + b, y0 - a), add_point(p[k], x0 - b, y0 + a);\n }\n ans += v[i].size() ? v[i].size() : 1;\n }\n cout << ans + 2 - (v[3].size() ? v[3].size() : 1) << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n const long long Mod = 1000000007;\n long long fp(long long a, long long k) {\n long long res = 1;\n while (k) {\n if (k & 1) res = res * a % Mod;\n a = a * a % Mod;\n k >>= 1;\n }\n return res;\n }\n int main() {\n long long n, m;\n scanf( %I64d%I64d , &n, &m);\n long long res = (m == 1 ? n + 1\n : ((m * fp(2 * m - 1, n) - fp(m, n)) % Mod + Mod) *\n fp(m - 1, Mod - 2) % Mod);\n printf( %I64d , res);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n const long long Mod = 1000000007;\n long long fp(long long a, long long k) {\n long long res = 1;\n while (k) {\n if (k & 1) res = res * a % Mod;\n a = a * a % Mod;\n k >>= 1;\n }\n return res;\n }\n int main() {\n long long n, m;\n scanf( extraextra , &n, &m);\n long long res = (m == 1 ? n + 1\n : ((m * fp(2 * m - 1, n) - fp(m, n)) % Mod + Mod) *\n fp(m - 1, Mod - 2) % Mod);\n printf( extra , res);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long inf = 1e9 + 7;\n void solve() {\n long long n, m;\n cin >> n >> m;\n if (m == 1) {\n long long a = n * (n - 1) / 2;\n cout << a << << a << endl;\n } else {\n long long aux = n - (m - 1);\n long long maxi = aux * (aux - 1) / 2;\n long long mini = 0;\n aux = n / m;\n long long left = n - m * aux;\n if (left != 0) {\n mini = (aux + 1) * aux / 2 * left + (m - left) * (aux * (aux - 1)) / 2;\n } else {\n mini = (aux * (aux - 1)) / 2 * m;\n }\n cout << mini << << maxi << endl;\n }\n }\n int main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n int t = 1;\n while (t--) {\n solve();\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int N = 25;\n long long n, ans[N];\n pair arr[N];\n int main() {\n ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cin >> n;\n for (int i = 0; i < n; i++) cin >> arr[i].first, arr[i].second = i;\n sort(arr, arr + n);\n for (int i = 0; i < n; i++) ans[arr[(i + 1) % n].second] = arr[i].first;\n for (int i = 0; i < n; i++) cout << ans[i] << ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long int gcd(long long int a, long long int b) {\n return b == 0 ? a : gcd(b, a % b);\n }\n inline long long int lbt(long long int x) { return x & -x; }\n inline void fail() {\n cout << -1 << endl;\n exit(0);\n }\n int main() {\n long long int a, b, c, d, e, f, h, x(0);\n cin >> a >> b >> c >> d;\n e = a * b;\n f = c * d;\n h = gcd(e, f);\n e /= h, f /= h;\n if (e == 1) {\n while (c % 3 == 0 && f != lbt(f)) ++x, c /= 3, c <<= 1, f /= 3, f <<= 1;\n while (d % 3 == 0 && f != lbt(f)) ++x, d /= 3, d <<= 1, f /= 3, f <<= 1;\n ;\n } else if (f == 1) {\n while (a % 3 == 0 && e != lbt(e)) ++x, a /= 3, a <<= 1, e /= 3, e <<= 1;\n while (b % 3 == 0 && e != lbt(e)) ++x, b /= 3, b <<= 1, e /= 3, e <<= 1;\n ;\n } else if (e == lbt(e)) {\n h = f;\n while (h % 3 == 0) h /= 3;\n if (h != 1) fail();\n ;\n while (c % 3 == 0 && f != lbt(f)) ++x, c /= 3, c <<= 1, f /= 3, f <<= 1;\n while (d % 3 == 0 && f != lbt(f)) ++x, d /= 3, d <<= 1, f /= 3, f <<= 1;\n ;\n } else if (f == lbt(f)) {\n h = e;\n while (h % 3 == 0) h /= 3;\n if (h != 1) fail();\n ;\n while (a % 3 == 0 && e != lbt(e)) ++x, a /= 3, a <<= 1, e /= 3, e <<= 1;\n while (b % 3 == 0 && e != lbt(e)) ++x, b /= 3, b <<= 1, e /= 3, e <<= 1;\n ;\n } else\n fail();\n while ((~c & 1) && e < f) ++x, c >>= 1, f >>= 1;\n while ((~d & 1) && e < f) ++x, d >>= 1, f >>= 1;\n ;\n while ((~a & 1) && f < e) ++x, a >>= 1, e >>= 1;\n while ((~b & 1) && f < e) ++x, b >>= 1, e >>= 1;\n ;\n FINAL:\n cout << x << endl << a << << b << endl << c << << d << endl;\n }\n "} @@ -2927,7 +2927,7 @@ {"func_code_string": "#include \n using namespace std;\n const int maxn = 1e5 * 4;\n inline int get() {\n int x;\n cin >> x;\n return x;\n }\n inline long long getlong() {\n long long x;\n cin >> x;\n return x;\n }\n inline string getString() {\n string s;\n cin >> s;\n return s;\n }\n template \n inline vector getvector(int len) {\n vector a(len);\n for (auto &it : a) cin >> it;\n return a;\n }\n inline vector getvector(int len) {\n vector a(len);\n for (auto &it : a) cin >> it;\n return a;\n }\n inline vector> getvector_andPairCnt(int len) {\n vector> a(len);\n int i = 1;\n for (auto &it : a) {\n it.second = i;\n i++;\n cin >> it.first;\n }\n return a;\n }\n double power_log(double power, double val) { return log(val) / log(power); }\n template \n T sqr(T x) {\n return x * x;\n }\n template \n ostream &operator<<(ostream &os, const vector &v) {\n for (auto it : v) os << it << ;\n os << \n ;\n return os;\n }\n template \n inline vector> getvector_andBiPair(int len) {\n vector> a(len);\n for (auto &it : a) {\n cin >> it.first >> it.second;\n }\n return a;\n }\n template \n inline set vector_to_set(const vector &vec) {\n set s;\n for (auto &it : vec) s.insert(it);\n return s;\n }\n int main() {\n auto n = getlong(), k = getlong();\n int t = get();\n if (t <= k) {\n cout << t;\n } else {\n if (t >= n) {\n cout << (n + k) - t;\n } else {\n cout << k;\n }\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n void split(string &s, vector &v, string &sep) {\n int current, previous = 0;\n current = s.find_first_of(sep);\n while (current != string::npos) {\n v.push_back(s.substr(previous, current - previous));\n previous = current + 1;\n current = s.find_first_of(sep, previous);\n }\n v.push_back(s.substr(previous, current - previous));\n }\n int main() {\n int n, flag = 0;\n cin >> n;\n for (int i = 0; i < n; i++) {\n int temp;\n cin >> temp;\n if (temp) {\n flag = 1;\n }\n }\n if (flag) {\n cout << HARD ;\n cout << endl;\n } else {\n cout << EASY ;\n cout << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int has[205][205];\n int vis[205][205];\n vector > q;\n int gcd(int x, int y) {\n if (x < y) swap(x, y);\n while (y) {\n int t = x % y;\n x = y;\n y = t;\n }\n return x;\n }\n int main() {\n int n;\n scanf( %d , &n);\n for (int i = 0; i < n; i++) {\n int x, y;\n scanf( %d%d , &x, &y);\n q.push_back(make_pair(y + 100, x + 100));\n has[x + 100][y + 100] = 1;\n }\n sort(q.begin(), q.end());\n if (n < 3) {\n printf( 0\n );\n return 0;\n }\n long long ans1 = 0;\n int hehe = 0;\n int L = q.size();\n for (int i = 1; i <= 200; i++) {\n for (int j = 1; j <= 200; j++) {\n if (gcd(i, j) != 1) continue;\n memset(vis, 0, sizeof(vis));\n for (int k = 0; k < L; k++) {\n int yy = q[k].first;\n int xx = q[k].second;\n if (vis[xx][yy]) continue;\n int res = 0;\n while (xx <= 200 && yy <= 200) {\n vis[xx][yy] = 1;\n res += has[xx][yy];\n xx += i;\n yy += j;\n }\n if (res > 2) ans1 += (long long)res * (res - 1) * (res - 2) / 6;\n }\n memset(vis, 0, sizeof(vis));\n for (int k = 0; k < L; k++) {\n int yy = q[k].first;\n int xx = q[k].second;\n if (vis[xx][yy]) continue;\n int res = 0;\n while (xx >= 0 && yy <= 200) {\n vis[xx][yy] = 1;\n res += has[xx][yy];\n xx -= i;\n yy += j;\n }\n if (res > 2) ans1 += (long long)res * (res - 1) * (res - 2) / 6;\n }\n }\n }\n for (int i = 0; i <= 200; i++) {\n int xx = i;\n int yy = 0;\n int res = 0;\n while (xx <= 200 && yy <= 200) {\n res += has[xx][yy];\n yy += 1;\n }\n if (res >= 3) {\n ans1 += (long long)res * (res - 1) * (res - 2) / 6;\n }\n }\n for (int i = 0; i <= 200; i++) {\n int xx = 0;\n int yy = i;\n int res = 0;\n while (xx <= 200 && yy <= 200) {\n res += has[xx][yy];\n xx += 1;\n }\n if (res >= 3) {\n ans1 += (long long)res * (res - 1) * (res - 2) / 6;\n }\n }\n long long ans = (long long)n * (n - 1) * (n - 2) / 6 - ans1;\n cout << ans << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n int main() {\n long long N;\n scanf( %I64d , &N);\n int l = 1, r = 20000000, ans = 0;\n while (l <= r) {\n int mid = (l + r) >> 1;\n if ((long long)mid * (mid + 1) < N * 2)\n ans = mid, l = mid + 1;\n else\n r = mid - 1;\n }\n printf( %I64d , N - (long long)ans * (ans + 1) / 2);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n int main() {\n long long N;\n scanf( extra , &N);\n int l = 1, r = 20000000, ans = 0;\n while (l <= r) {\n int mid = (l + r) >> 1;\n if ((long long)mid * (mid + 1) < N * 2)\n ans = mid, l = mid + 1;\n else\n r = mid - 1;\n }\n printf( extra , N - (long long)ans * (ans + 1) / 2);\n return 0;\n }\n "} {"func_code_string": "#include \n #pragma comment(linker, /STACK:96777216 )\n using namespace std;\n const double NOT_FOUND = -1000000000;\n const double EPS = 0.00000001;\n const double PI = acos(-1.0);\n struct point {\n double x, y;\n };\n point make_point(double a, double b) {\n point c;\n c.x = a;\n c.y = b;\n return c;\n }\n struct line {\n double A, B, C;\n };\n line make_line(double a, double b, double c) {\n line p;\n p.A = a;\n p.B = b;\n p.C = c;\n return p;\n }\n struct circle {\n double R;\n point center;\n vector intersects;\n };\n circle make_circle(point c, double r) {\n circle C;\n C.R = r;\n C.center = c;\n return C;\n }\n int main() {\n int N, K;\n cin >> N >> K;\n if (K > N) {\n cout << -1;\n return 0;\n }\n if (K == 1 && N > 1) {\n cout << -1;\n return 0;\n }\n if (K == N) {\n char p = 'a';\n for (int i = 0; i < N; i++) {\n cout << p;\n p++;\n }\n return 0;\n }\n string S;\n for (char c = 'a' + K - 1; c > 'b'; c--) {\n S += c;\n N--;\n }\n if (N % 2) {\n S += a ;\n N--;\n }\n for (int i = 0; i < N; i += 2) S += ba ;\n for (int i = (int)S.length() - 1; i >= 0; i--) cout << S[i];\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int prim[10] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};\n int n;\n long long ans;\n void DFS(int a, int b, long long temp) {\n if (temp < ans && a == n) ans = temp;\n if (a >= n) return;\n for (int i = 1; i <= 64; i++) {\n if (ans / prim[b] < temp) break;\n temp *= prim[b];\n DFS(a * (i + 1), (b + 1), temp);\n }\n }\n int main() {\n while (scanf( %d , &n) != EOF) {\n ans = LONG_LONG_MAX;\n DFS(1, 0, 1);\n printf( %lld\n , ans);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int ABS(int a) {\n if (a < 0) return (-a);\n return a;\n }\n void input() {}\n int a[100005];\n int seg[100005];\n int nxt[100005];\n int hop[100005];\n void readInt(int &n) {\n n = 0;\n char ch = getchar();\n while (!isdigit(ch)) ch = getchar();\n while (isdigit(ch)) {\n n = n * 10 + ch - 48;\n ch = getchar();\n }\n }\n int main() {\n input();\n int n, q;\n readInt(n);\n readInt(q);\n int sq = sqrt(n);\n int c = 0, cnt = 0;\n for (int i = (0); i < (n); ++i) {\n readInt(a[i]);\n seg[i] = cnt;\n c++;\n if (c == sq) c = 0, cnt++;\n }\n for (int i = (n - 1); i >= (0); --i) {\n int to = i + a[i];\n hop[i] = 1;\n if (to >= n)\n nxt[i] = -1;\n else if (seg[to] != seg[i])\n nxt[i] = to;\n else {\n nxt[i] = nxt[to];\n hop[i] += hop[to];\n }\n }\n while (q--) {\n int type;\n readInt(type);\n if (type == 0) {\n int x, y;\n readInt(x);\n readInt(y);\n x--;\n int i = x;\n a[x] = y;\n while (i >= 0) {\n if (seg[i] != seg[x]) break;\n int to = i + a[i];\n hop[i] = 1;\n if (to >= n)\n nxt[i] = -1;\n else if (seg[to] != seg[i])\n nxt[i] = to;\n else {\n nxt[i] = nxt[to];\n hop[i] += hop[to];\n }\n i--;\n }\n } else {\n int x;\n readInt(x);\n x--;\n int ans = 0;\n int last = x;\n while (x != -1) {\n ans += hop[x];\n last = x;\n x = nxt[x];\n }\n while (last + a[last] < n) last = last + a[last];\n printf( %d %d\n , last + 1, ans);\n }\n }\n return 0;\n }\n "} @@ -2938,9 +2938,9 @@ {"func_code_string": "#include \n using namespace std;\n signed main() {\n ios_base::sync_with_stdio(false);\n cin.tie();\n cout.tie();\n long long t;\n cin >> t;\n while (t--) {\n long long n;\n cin >> n;\n string a;\n cin >> a;\n string last = a;\n for (long long i = 0; i <= n; ++i) {\n string s;\n s = a;\n for (long long k = 1; k < n; ++k) {\n if (a[k - 1] == 'A') {\n s[k] = 'A';\n }\n }\n a = s;\n if (a == last) {\n cout << i << \n ;\n break;\n }\n last = a;\n }\n }\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n string s;\n cin >> s;\n int n = s.length();\n vector P(n, 0);\n int C = 0;\n int R = 0;\n for (int i = 1; i < n - 1; i++) {\n int mirror = 2 * C - i;\n if (R > i) {\n P[i] = min(R - i, P[mirror]);\n } else {\n P[i] = 0;\n }\n while ((i + 1 + P[i] < n) && (i - 1 - P[i] >= 0) &&\n (s[i + 1 + P[i]] == s[i - 1 - P[i]])) {\n P[i]++;\n }\n if (i + P[i] > R) {\n C = i;\n R = i + P[i];\n }\n }\n string rev(s);\n reverse(rev.begin(), rev.end());\n vector T(n, 0);\n T[0] = -1;\n int pos = 2;\n int cnd = 0;\n while (pos < n) {\n if (rev[pos - 1] == rev[cnd]) {\n cnd++;\n T[pos] = cnd;\n pos++;\n } else if (cnd > 0) {\n cnd = T[cnd];\n } else {\n T[pos] = 0;\n pos++;\n }\n }\n int m = 0;\n int revI = 0;\n vector found(n + 1, -1);\n found[0] = 0;\n while (revI < n && m + revI < n) {\n if (rev[revI] == s[m + revI]) {\n if (found[revI + 1] == -1) {\n found[revI + 1] = m;\n }\n revI++;\n } else {\n m = m + revI - T[revI];\n if (T[revI] > -1) {\n revI = T[revI];\n } else {\n revI = 0;\n }\n }\n }\n vector fend(n + 1, -1);\n int fendMax = 0;\n for (int i = 0; i <= n; i++) {\n if (found[i] != -1) {\n fend[i] = found[i] + i;\n fendMax = i;\n }\n }\n int best = 0;\n int bestMidSt = 0;\n int bestMidL = 0;\n int bestLeftSt = 0;\n int bestSideL = 0;\n for (int i = 0; i < n; i++) {\n int midStart = i - P[i];\n int midEnd = i + P[i];\n int lLow = 0;\n int lHigh = min(n - midEnd, fendMax + 1);\n int lCur = (lLow + lHigh) / 2;\n while (lHigh - lLow > 1) {\n if (fend[lCur] <= midStart) {\n lLow = lCur;\n } else {\n lHigh = lCur;\n }\n lCur = (lLow + lHigh) / 2;\n }\n int curBest = 2 * P[i] + 1 + 2 * lCur;\n if (curBest > best) {\n best = curBest;\n bestMidSt = midStart;\n bestMidL = 2 * P[i] + 1;\n bestLeftSt = found[lCur];\n bestSideL = lCur;\n }\n }\n if (bestSideL == 0) {\n cout << 1 << endl;\n cout << (bestMidSt + 1) << << bestMidL << endl;\n } else {\n cout << 3 << endl;\n cout << (bestLeftSt + 1) << << bestSideL << endl;\n cout << (bestMidSt + 1) << << bestMidL << endl;\n cout << (n - bestSideL + 1) << << bestSideL << endl;\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n bool ck(int x) {\n int t[50], l = 0;\n while (x) t[l++] = x & 1, x >>= 1;\n if (l & 1) {\n int lim = l - 1 >> 1;\n for (int i = 0; i < lim; i++)\n if (t[i]) return 0;\n for (int i = lim; i < l; i++)\n if (!t[i]) return 0;\n } else\n return 0;\n return 1;\n }\n int main() {\n int n;\n cin >> n;\n for (int i = n; i >= 1; i--) {\n if (n % i == 0 && ck(i)) {\n printf( %d\n , i);\n return 0;\n }\n }\n }\n "} -{"func_code_string": "#include \n const int N = 2010;\n std::set> set;\n long long a[N][N], dis[N];\n bool vis[N];\n int n;\n int main() {\n scanf( %d , &n);\n memset(dis, 0x7f, sizeof(dis));\n long long mine = LLONG_MAX;\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n scanf( %I64d , &a[i][j]);\n mine = std::min(mine, a[j][i] = a[i][j]);\n }\n }\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (i == j) {\n continue;\n }\n a[i][j] -= mine;\n dis[i] = std::min(dis[i], 2 * a[i][j]);\n }\n }\n for (int i = 0; i < n; ++i) {\n set.insert({dis[i], i});\n }\n for (int i = 0; i < n; ++i) {\n std::pair p = *(set.begin());\n set.erase(set.begin());\n vis[p.second] = true;\n for (int j = 0; j < n; ++j) {\n if (!vis[j] && p.second != j) {\n set.erase({dis[j], j});\n dis[j] = std::min(dis[p.second] + a[p.second][j], dis[j]);\n set.insert({dis[j], j});\n }\n }\n }\n for (int i = 0; i < n; ++i) {\n printf( %I64d\n , dis[i] + (n - 1) * mine);\n }\n return 0;\n }\n "} +{"func_code_string": "#include \n const int N = 2010;\n std::set> set;\n long long a[N][N], dis[N];\n bool vis[N];\n int n;\n int main() {\n scanf( %d , &n);\n memset(dis, 0x7f, sizeof(dis));\n long long mine = LLONG_MAX;\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n scanf( extra , &a[i][j]);\n mine = std::min(mine, a[j][i] = a[i][j]);\n }\n }\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (i == j) {\n continue;\n }\n a[i][j] -= mine;\n dis[i] = std::min(dis[i], 2 * a[i][j]);\n }\n }\n for (int i = 0; i < n; ++i) {\n set.insert({dis[i], i});\n }\n for (int i = 0; i < n; ++i) {\n std::pair p = *(set.begin());\n set.erase(set.begin());\n vis[p.second] = true;\n for (int j = 0; j < n; ++j) {\n if (!vis[j] && p.second != j) {\n set.erase({dis[j], j});\n dis[j] = std::min(dis[p.second] + a[p.second][j], dis[j]);\n set.insert({dis[j], j});\n }\n }\n }\n for (int i = 0; i < n; ++i) {\n printf( extra\n , dis[i] + (n - 1) * mine);\n }\n return 0;\n }\n "} {"func_code_string": "#include \n #pragma GCC optimize( O3 )\n #pragma GCC target( avx2 )\n using namespace std;\n void solve() {\n int q;\n cin >> q;\n unordered_map map;\n while (q--) {\n string a, b;\n cin >> a >> b;\n if (map.find(a) != map.end()) {\n string s = map[a];\n map.erase(a);\n map[b] = s;\n continue;\n }\n map[b] = a;\n }\n cout << map.size() << \n ;\n for (auto i : map) {\n cout << i.second << << i.first << \n ;\n }\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n int t;\n t = 1;\n while (t--) {\n solve();\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n template \n struct Heap {\n Value p[100100];\n int pos[100100];\n vector hp;\n void init() { hp.clear(); }\n void swapPos(int i, int a) {\n int temp;\n temp = pos[hp[a]];\n pos[hp[a]] = pos[hp[i]];\n pos[hp[i]] = temp;\n swap(hp[i], hp[a]);\n }\n void up(int a) {\n int i;\n while (1) {\n i = a;\n if (a + a + 1 < hp.size() && p[hp[i]] > p[hp[a + a + 1]]) {\n i = a + a + 1;\n }\n if (a + a + 2 < hp.size() && p[hp[i]] > p[hp[a + a + 2]]) {\n i = a + a + 2;\n }\n if (i == a) break;\n swapPos(i, a);\n a = i;\n }\n }\n void down(int a) {\n int i, temp;\n while (1) {\n i = a;\n if (a && p[hp[i]] < p[hp[(a - 1) / 2]]) {\n i = (a - 1) / 2;\n }\n if (i == a) break;\n swapPos(i, a);\n a = i;\n }\n }\n void update(Key k, Value v) {\n p[k] = v;\n up(pos[k]);\n down(pos[k]);\n }\n void push_heap(Key k, Value v) {\n hp.push_back(k);\n p[k] = v;\n down(pos[k] = hp.size() - 1);\n }\n Value top() { return p[hp[0]]; }\n void pop(Key& k, Value& v) {\n k = hp[0];\n v = p[hp[0]];\n swapPos(0, hp.size() - 1);\n hp.pop_back();\n up(0);\n }\n int size() { return hp.size(); }\n };\n Heap hp;\n template \n struct Graph {\n static const int gmaxn = 101000;\n static const int gmaxm = 101000;\n int ind[gmaxn];\n int last[gmaxm * 2], e[gmaxm * 2], gt;\n T w[gmaxm * 2];\n bool bi;\n int n, m;\n void init() {\n gt = 0;\n memset(ind, 0, sizeof(ind));\n }\n void addE1(int a, int b, T& c) {\n gt++;\n last[gt] = ind[a];\n ind[a] = gt;\n e[gt] = b;\n w[gt] = c;\n }\n void addE2(int a, int b, T& c) {\n addE1(a, b, c);\n addE1(b, a, c);\n }\n void addE(int a, int b, T& c) {\n if (bi)\n addE2(a, b, c);\n else\n addE1(a, b, c);\n }\n Graph(bool bidirectional = true) { bi = bidirectional; }\n void next(int& a) { a = last[a]; }\n void dijkstra(vector& S);\n };\n int from[100100];\n long long int dis[100100];\n template \n void Graph::dijkstra(vector& S) {\n memset(dis, -1, sizeof(dis));\n int i, now, j;\n long long int nowdis;\n for (i = 0; i < S.size(); i++) {\n dis[from[S[i]] = S[i]] = 0;\n hp.push_heap(S[i], 0);\n }\n while (hp.size()) {\n hp.pop(now, nowdis);\n for (i = ind[now]; i; next(i)) {\n j = e[i];\n if (dis[j] < 0) {\n dis[j] = nowdis + w[i];\n from[j] = from[now];\n hp.push_heap(j, dis[j]);\n } else if (dis[j] > nowdis + w[i]) {\n dis[j] = nowdis + w[i];\n from[j] = from[now];\n hp.update(j, dis[j]);\n }\n }\n }\n }\n Graph g;\n bool k[100100];\n vector s;\n int fa[100100];\n int findfa(int a) {\n if (a == fa[a]) return a;\n return fa[a] = findfa(fa[a]);\n }\n bool merge(int a, int b) {\n a = findfa(a);\n b = findfa(b);\n if (a == b) return 0;\n if (rand() & 1) swap(a, b);\n fa[a] = b;\n return 1;\n }\n vector > > eg;\n int main() {\n scanf( %d %d , &g.n, &g.m);\n int i, j, a, b, cc;\n long long int c;\n for (i = 0; i < g.m; i++) {\n scanf( %d %d %d , &a, &b, &cc);\n c = cc;\n g.addE(a, b, c);\n }\n scanf( %d , &i);\n while (i--) {\n scanf( %d , &j);\n k[j] = 1;\n s.push_back(j);\n }\n g.dijkstra(s);\n for (i = 1; i <= g.n; i++) {\n fa[i] = i;\n for (j = g.ind[i]; j; g.next(j)) {\n if (from[i] != from[g.e[j]]) {\n eg.push_back(make_pair(dis[i] + dis[g.e[j]] + g.w[j],\n make_pair(from[i], from[g.e[j]])));\n }\n }\n }\n sort(eg.begin(), eg.end());\n long long int ans = 0;\n if (!k[1]) ans += dis[1];\n for (i = 0; i < eg.size(); i++) {\n if (merge(eg[i].second.first, eg[i].second.second)) {\n ans += eg[i].first;\n }\n }\n printf( %I64d\n , ans);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n template \n struct Heap {\n Value p[100100];\n int pos[100100];\n vector hp;\n void init() { hp.clear(); }\n void swapPos(int i, int a) {\n int temp;\n temp = pos[hp[a]];\n pos[hp[a]] = pos[hp[i]];\n pos[hp[i]] = temp;\n swap(hp[i], hp[a]);\n }\n void up(int a) {\n int i;\n while (1) {\n i = a;\n if (a + a + 1 < hp.size() && p[hp[i]] > p[hp[a + a + 1]]) {\n i = a + a + 1;\n }\n if (a + a + 2 < hp.size() && p[hp[i]] > p[hp[a + a + 2]]) {\n i = a + a + 2;\n }\n if (i == a) break;\n swapPos(i, a);\n a = i;\n }\n }\n void down(int a) {\n int i, temp;\n while (1) {\n i = a;\n if (a && p[hp[i]] < p[hp[(a - 1) / 2]]) {\n i = (a - 1) / 2;\n }\n if (i == a) break;\n swapPos(i, a);\n a = i;\n }\n }\n void update(Key k, Value v) {\n p[k] = v;\n up(pos[k]);\n down(pos[k]);\n }\n void push_heap(Key k, Value v) {\n hp.push_back(k);\n p[k] = v;\n down(pos[k] = hp.size() - 1);\n }\n Value top() { return p[hp[0]]; }\n void pop(Key& k, Value& v) {\n k = hp[0];\n v = p[hp[0]];\n swapPos(0, hp.size() - 1);\n hp.pop_back();\n up(0);\n }\n int size() { return hp.size(); }\n };\n Heap hp;\n template \n struct Graph {\n static const int gmaxn = 101000;\n static const int gmaxm = 101000;\n int ind[gmaxn];\n int last[gmaxm * 2], e[gmaxm * 2], gt;\n T w[gmaxm * 2];\n bool bi;\n int n, m;\n void init() {\n gt = 0;\n memset(ind, 0, sizeof(ind));\n }\n void addE1(int a, int b, T& c) {\n gt++;\n last[gt] = ind[a];\n ind[a] = gt;\n e[gt] = b;\n w[gt] = c;\n }\n void addE2(int a, int b, T& c) {\n addE1(a, b, c);\n addE1(b, a, c);\n }\n void addE(int a, int b, T& c) {\n if (bi)\n addE2(a, b, c);\n else\n addE1(a, b, c);\n }\n Graph(bool bidirectional = true) { bi = bidirectional; }\n void next(int& a) { a = last[a]; }\n void dijkstra(vector& S);\n };\n int from[100100];\n long long int dis[100100];\n template \n void Graph::dijkstra(vector& S) {\n memset(dis, -1, sizeof(dis));\n int i, now, j;\n long long int nowdis;\n for (i = 0; i < S.size(); i++) {\n dis[from[S[i]] = S[i]] = 0;\n hp.push_heap(S[i], 0);\n }\n while (hp.size()) {\n hp.pop(now, nowdis);\n for (i = ind[now]; i; next(i)) {\n j = e[i];\n if (dis[j] < 0) {\n dis[j] = nowdis + w[i];\n from[j] = from[now];\n hp.push_heap(j, dis[j]);\n } else if (dis[j] > nowdis + w[i]) {\n dis[j] = nowdis + w[i];\n from[j] = from[now];\n hp.update(j, dis[j]);\n }\n }\n }\n }\n Graph g;\n bool k[100100];\n vector s;\n int fa[100100];\n int findfa(int a) {\n if (a == fa[a]) return a;\n return fa[a] = findfa(fa[a]);\n }\n bool merge(int a, int b) {\n a = findfa(a);\n b = findfa(b);\n if (a == b) return 0;\n if (rand() & 1) swap(a, b);\n fa[a] = b;\n return 1;\n }\n vector > > eg;\n int main() {\n scanf( %d %d , &g.n, &g.m);\n int i, j, a, b, cc;\n long long int c;\n for (i = 0; i < g.m; i++) {\n scanf( %d %d %d , &a, &b, &cc);\n c = cc;\n g.addE(a, b, c);\n }\n scanf( %d , &i);\n while (i--) {\n scanf( %d , &j);\n k[j] = 1;\n s.push_back(j);\n }\n g.dijkstra(s);\n for (i = 1; i <= g.n; i++) {\n fa[i] = i;\n for (j = g.ind[i]; j; g.next(j)) {\n if (from[i] != from[g.e[j]]) {\n eg.push_back(make_pair(dis[i] + dis[g.e[j]] + g.w[j],\n make_pair(from[i], from[g.e[j]])));\n }\n }\n }\n sort(eg.begin(), eg.end());\n long long int ans = 0;\n if (!k[1]) ans += dis[1];\n for (i = 0; i < eg.size(); i++) {\n if (merge(eg[i].second.first, eg[i].second.second)) {\n ans += eg[i].first;\n }\n }\n printf( extra\n , ans);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const int inf = INT_MAX;\n const int mod = 1e9 + 7;\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int t;\n cin >> t;\n while (t--) {\n int n;\n cin >> n;\n int arr[2][n];\n int sum[2][n];\n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < n; j++) {\n cin >> arr[i][j];\n if (j == 0)\n sum[i][j] = arr[i][j];\n else\n sum[i][j] = sum[i][j - 1] + arr[i][j];\n }\n }\n int move1 = sum[0][n - 1];\n int move2 = sum[1][n - 1];\n int ans = min(move1 - arr[0][0], move2 - arr[1][n - 1]);\n for (int i = 1; i < n; i++) {\n int temp1 = move1 - sum[0][i];\n int temp2 = sum[1][i - 1];\n ans = min(ans, max(temp1, temp2));\n }\n cout << ans << endl;\n }\n }\n "} {"func_code_string": "#include \n #pragma comment(linker, /STACK:167772160 )\n using namespace std;\n int main() {\n int n;\n cin >> n;\n pair x[1111];\n for (int i = 0; i < n; ++i) cin >> x[i].first >> x[i].second;\n long long p = 0, maxx = -1;\n int j = 0;\n for (int i = 0; i < x[n - 1].first; i++) {\n if (p != 0) --p;\n if (i == x[j].first - 1) {\n p += x[j].second;\n ++j;\n }\n if (p > maxx) maxx = p;\n }\n cout << x[n - 1].first + p << << maxx << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n long long int n, k, a, b;\n vector arr;\n long long int rec(long long int l, long long int r) {\n long long int i = lower_bound(arr.begin(), arr.end(), l) - arr.begin();\n long long int j = upper_bound(arr.begin(), arr.end(), r) - arr.begin();\n long long int x = j - i;\n long long int val;\n if (x == 0) {\n val = a;\n } else {\n val = b * x * (r - l + 1);\n }\n if (l == r || x == 0) {\n return val;\n }\n long long int mid = (l + r) / 2;\n return min(val, rec(l, mid) + rec(mid + 1, r));\n }\n int main() {\n cin >> n >> k >> a >> b;\n for (int i = 0; i < k; i++) {\n int x;\n cin >> x;\n arr.push_back(x);\n }\n sort(arr.begin(), arr.end());\n long long int start = 1;\n long long int end = pow(2, n);\n cout << rec(start, end) << endl;\n }\n "} @@ -2959,7 +2959,7 @@ {"func_code_string": "#include \n using namespace std;\n const int inf = (int)1e9 + 7;\n int up(int n) {\n int r = 1;\n while (r < n) r <<= 1;\n return r;\n }\n class segtree {\n vector arr;\n vector laz;\n void inv(int l, int r, int cl, int cr, int v) {\n if (r <= cl || cr <= l) return;\n push(v);\n if (l <= cl && cr <= r) {\n laz[v] = !laz[v];\n return;\n }\n int ct = (cl + cr) / 2;\n inv(l, r, cl, ct, 2 * v);\n inv(l, r, ct, cr, 2 * v + 1);\n upd(v);\n }\n int cnt(int l, int r, int cl, int cr, int v) {\n if (r <= cl || cr <= l) return 0;\n push(v);\n if (l <= cl && cr <= r) return arr[v];\n int ct = (cl + cr) / 2;\n ct = cnt(l, r, cl, ct, 2 * v) + cnt(l, r, ct, cr, 2 * v + 1);\n upd(v);\n return ct;\n }\n void push(int v) {\n if (laz[v]) {\n laz[v] = false;\n arr[v] = arr.size() / up(v + 1) - arr[v];\n if (v < (int)arr.size() / 2) {\n laz[2 * v] = !laz[2 * v];\n laz[2 * v + 1] = !laz[2 * v + 1];\n }\n }\n }\n void upd(int v) {\n if (v < (int)arr.size() / 2) {\n push(2 * v);\n push(2 * v + 1);\n arr[v] = arr[2 * v] + arr[2 * v + 1];\n }\n }\n \n public:\n segtree(int n) : arr(2 * up(n)), laz(2 * up(n)) {}\n void inv(int l, int r) { inv(l, r, 0, arr.size() / 2, 1); }\n int cnt(int l, int r) { return cnt(l, r, 0, arr.size() / 2, 1); }\n };\n void dfs(const vector> &gr, int v, vector &in,\n vector &out, int &cnt) {\n in[v] = cnt++;\n for (auto it : gr[v]) dfs(gr, it, in, out, cnt);\n out[v] = ++cnt;\n }\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n;\n cin >> n;\n vector> gr(n);\n for (int i = 1; i < n; i++) {\n int p;\n cin >> p;\n p--;\n gr[p].push_back(i);\n }\n vector in(n), out(n);\n n = 0;\n dfs(gr, 0, in, out, n);\n segtree st(n);\n n /= 2;\n for (int i = 0; i < n; i++) {\n int t;\n cin >> t;\n if (t == 1) {\n st.inv(in[i], in[i] + 1);\n st.inv(out[i] - 1, out[i]);\n }\n }\n int q;\n cin >> q;\n for (int i = 0; i < q; i++) {\n string s;\n int t;\n cin >> s >> t;\n t--;\n if (s == get ) {\n cout << st.cnt(in[t], out[t]) / 2 << endl;\n } else {\n assert(s == pow );\n st.inv(in[t], out[t]);\n }\n }\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n;\n cin >> n;\n string s;\n cin >> s;\n int p1 = 0, q1 = 0, r1 = 0, s1 = 0;\n int ans = 1;\n int a = 0, b = 0, c = 0, d = 0;\n vector v;\n int sum = 0;\n for (int j = 0; j < s.length(); j++) {\n if (s[j] == 'R') {\n if ((q1 > 0)) {\n ans++;\n v.push_back(j);\n q1 = 0;\n r1 = 0;\n s1 = 0;\n }\n p1++;\n }\n if (s[j] == 'L') {\n if ((p1 > 0)) {\n ans++;\n v.push_back(j);\n p1 = 0;\n r1 = 0;\n s1 = 0;\n }\n q1++;\n }\n if (s[j] == 'U') {\n if (s1 > 0) {\n ans++;\n v.push_back(j);\n q1 = 0;\n p1 = 0;\n s1 = 0;\n }\n r1++;\n }\n if (s[j] == 'D') {\n if ((r1 > 0)) {\n ans++;\n v.push_back(j);\n q1 = 0;\n r1 = 0;\n p1 = 0;\n }\n s1++;\n }\n }\n cout << ans;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int t;\n cin >> t;\n while (t--) {\n int n;\n cin >> n;\n long long int a[n], sum = 0, fg = 0, cnt = 0, ind = 1, ans = 0;\n for (int i = 0; i < n; i++) cin >> a[i];\n for (int i = 0; i < n; i++) {\n if (a[i] <= ind) {\n ind++;\n continue;\n }\n ans = ans + a[i] - ind;\n ind = a[i] + 1;\n }\n cout << ans;\n cout << '\n';\n }\n return 0;\n }\n "} -{"func_code_string": "#include \n using namespace std;\n long long s1[2100][2100], sum[2100][2100], cnt[2100][2100], cnt1[2100][2100];\n int main() {\n int n, m, i, j;\n long long res;\n scanf( %d%d , &n, &m);\n for (i = 2; i <= m; i++) {\n for (j = 1; j <= n; j++) {\n cnt[i][j] = sum[i][j - 1] + 1;\n cnt[i][j] %= 1000000007;\n s1[i][j] = s1[i - 1][j] + cnt[i][j];\n s1[i][j] %= 1000000007;\n sum[i][j] = sum[i - 1][j] + s1[i][j];\n sum[i][j] %= 1000000007;\n cnt1[i][j] = cnt[i][j] - cnt[i][j - 1];\n if (cnt1[i][j] < 0) cnt1[i][j] += 1000000007;\n }\n }\n res = 0;\n for (i = 2; i <= m; i++)\n for (j = 1; j <= n; j++) {\n res += ((cnt[i][j] * cnt1[i][n - j + 1]) % 1000000007) * (m - i + 1);\n res %= 1000000007;\n }\n printf( %I64d\n , res);\n return 0;\n }\n "} +{"func_code_string": "#include \n using namespace std;\n long long s1[2100][2100], sum[2100][2100], cnt[2100][2100], cnt1[2100][2100];\n int main() {\n int n, m, i, j;\n long long res;\n scanf( %d%d , &n, &m);\n for (i = 2; i <= m; i++) {\n for (j = 1; j <= n; j++) {\n cnt[i][j] = sum[i][j - 1] + 1;\n cnt[i][j] %= 1000000007;\n s1[i][j] = s1[i - 1][j] + cnt[i][j];\n s1[i][j] %= 1000000007;\n sum[i][j] = sum[i - 1][j] + s1[i][j];\n sum[i][j] %= 1000000007;\n cnt1[i][j] = cnt[i][j] - cnt[i][j - 1];\n if (cnt1[i][j] < 0) cnt1[i][j] += 1000000007;\n }\n }\n res = 0;\n for (i = 2; i <= m; i++)\n for (j = 1; j <= n; j++) {\n res += ((cnt[i][j] * cnt1[i][n - j + 1]) % 1000000007) * (m - i + 1);\n res %= 1000000007;\n }\n printf( extra\n , res);\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n string s;\n cin >> s;\n s = '*' + s;\n int add = 0;\n int n = (s.length()) - 1;\n for (int i = 1; i + i <= n; i++) {\n if (s[i] != s[s.size() - i]) {\n add++;\n }\n }\n if (add <= 1 && (n & 1) || add == 1)\n cout << YES\n ;\n else\n cout << NO\n ;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n int n, a, i, j, arr[300] = {0}, p = 0, k = 0, c, d;\n cin >> n >> a;\n for (i = 1; i < n + 1; i++) {\n cin >> arr[i];\n }\n arr[0] = 1, arr[n + 1] = 1;\n j = min(a, n - a + 1);\n for (i = j; i < n + 1; i++) {\n c = a + k;\n d = a - k;\n if (d < 1) d = 0;\n if (c > n) c = n + 1;\n if (arr[d] == arr[c] and arr[c]) {\n if (c != d and c <= n and d > 0)\n p += 2;\n else\n p++;\n }\n k++;\n }\n cout << p << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n struct node {\n int x, y;\n } arr[104];\n vector graph[105];\n int visited[105] = {0};\n void dfs(int i) {\n visited[i] = 1;\n int j = 0;\n while (j < graph[i].size()) {\n if (visited[graph[i][j]] == 0) {\n dfs(graph[i][j]);\n }\n j++;\n }\n }\n int main() {\n int n;\n scanf( %d , &n);\n int x, y;\n for (int i = 0; i < n; i++) {\n scanf( %d%d , &x, &y);\n arr[i].x = x;\n arr[i].y = y;\n }\n int hash[102] = {0};\n int ct = 0;\n for (int i = 0; i < n; i++) {\n int flag = 0;\n for (int j = 0; j < n; j++) {\n if (i == j) continue;\n if (arr[j].x == arr[i].x || arr[j].y == arr[i].y) {\n graph[i].push_back(j);\n graph[j].push_back(i);\n flag = 1;\n }\n }\n if (flag == 0) visited[i] = 1;\n }\n for (int i = 0; i < n; i++) {\n if (visited[i] == 0) {\n dfs(i);\n ct++;\n }\n }\n int c = 0;\n for (int i = 0; i < n; i++) {\n if (!graph[i].size()) c++;\n }\n printf( %d\n , c - 1 + ct);\n return 0;\n }\n "} @@ -2993,7 +2993,7 @@ {"func_code_string": "#include \n using namespace std;\n const int N = 4e4 + 5;\n int pr[N], ps = 0;\n bool np[N];\n bool check(int n) {\n if (n == 1 || n == 0) return false;\n for (int i = 0; pr[i] * pr[i] <= n; ++i)\n if (n % pr[i] == 0) return false;\n return true;\n }\n int main() {\n for (int i = 2; i < N; ++i)\n if (!np[i]) {\n pr[ps++] = i;\n for (int j = i + i; j < N; j += i) np[j] = 1;\n }\n int n;\n cin >> n;\n if (check(n)) {\n cout << 1\n << n << endl;\n return 0;\n }\n for (int i = 0; i < ps && pr[i] <= n; ++i) {\n if (check(n - pr[i])) {\n cout << 2\n << pr[i] << << n - pr[i] << endl;\n return 0;\n }\n if (pr[i] % 2 == 1 && check((n - pr[i]) / 2)) {\n cout << 3\n \n << pr[i] << << (n - pr[i]) / 2 << << (n - pr[i]) / 2 << endl;\n return 0;\n }\n }\n cout << lol nope\n ;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n const long long mk = 100005;\n long long n;\n vector g[mk];\n long long find(long long A) {\n if (A == 0) return 0;\n long long tmp = A & 3;\n long long R = (find(A / 4) << 2);\n if (tmp == 0) return R;\n if (tmp == 1) return (R | 2);\n if (tmp == 2) return (R | 3);\n if (tmp == 3) return (R | 1);\n }\n void init() {\n long long test;\n cin >> test;\n for (long long i = 1; i <= test; i++) {\n long long n;\n cin >> n;\n long long root = 1;\n while (root * 4 <= n) root *= 4;\n n -= (root - 1);\n long long A = (root | ((n - 1) / 3));\n long long B = find(A);\n long long C = A ^ B;\n if (n % 3 == 1) cout << A;\n if (n % 3 == 2) cout << B;\n if (n % 3 == 0) cout << C;\n cout << \n ;\n }\n }\n signed main() { init(); }\n "} {"func_code_string": "#include \n using namespace std;\n const int maxn = 1e4 + 5;\n pair p[maxn];\n set > s;\n void solve(int l, int r) {\n if (r - l < 2) return;\n int mid = (l + r) / 2;\n solve(l, mid), solve(mid, r);\n for (int i = l; i < r; i++) s.insert(make_pair(p[mid].first, p[i].second));\n }\n int main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int n;\n cin >> n;\n for (int i = 0; i < n; i++)\n cin >> p[i].first >> p[i].second,\n s.insert(make_pair(p[i].first, p[i].second));\n sort(p, p + n);\n solve(0, n);\n cout << s.size() << endl;\n for (pair now : s) cout << now.first << << now.second << endl;\n return 0;\n }\n "} -{"func_code_string": "#include \n int main() {\n int n;\n long long int s;\n scanf( %d , &n);\n s = 6 * n * (n - 1) + 1;\n printf( %I64d , s);\n return 0;\n }\n "} +{"func_code_string": "#include \n int main() {\n int n;\n long long int s;\n scanf( %d , &n);\n s = 6 * n * (n - 1) + 1;\n printf( extra , s);\n return 0;\n }\n "} {"func_code_string": "#include \n template \n inline bool contains(const C& container, const E& element) {\n return container.find(element) != container.end();\n }\n template \n inline void checkmin(T& a, T b) {\n if (b < a) a = b;\n }\n template \n inline void checkmax(T& a, T b) {\n if (b > a) a = b;\n }\n using namespace std;\n class UnionFind {\n public:\n UnionFind(int elements) : _subsets(elements), _setCount(elements) {\n for (int i = 0; i < elements; ++i) {\n _subsets[i].parent = i;\n _subsets[i].rank = 0;\n }\n }\n int Find(int i) {\n if (_subsets[i].parent != i) _subsets[i].parent = Find(_subsets[i].parent);\n return _subsets[i].parent;\n }\n void Union(int x, int y) {\n int xroot = Find(x);\n int yroot = Find(y);\n if (xroot == yroot) return;\n --_setCount;\n if (_subsets[xroot].rank < _subsets[yroot].rank)\n _subsets[xroot].parent = yroot;\n else if (_subsets[xroot].rank > _subsets[yroot].rank)\n _subsets[yroot].parent = xroot;\n else {\n _subsets[yroot].parent = xroot;\n _subsets[xroot].rank++;\n }\n }\n struct subset {\n int parent;\n int rank;\n };\n void Trace() {\n for (int i = (0), _b = ((_subsets.size()) - 1); i <= _b; i++)\n cout << i << : << Find(i) << | ;\n cout << endl;\n }\n vector _subsets;\n int _setCount;\n };\n struct SetInfo {\n set _yc;\n set _xc;\n };\n int main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n cout << std::setprecision(15);\n cout << std::fixed;\n long long xs, ys, q;\n cin >> xs >> ys >> q;\n UnionFind uf(xs + ys);\n vector > p(q);\n for (int i = (0), _b = ((q)-1); i <= _b; i++) {\n int x, y;\n cin >> p[i].first >> p[i].second;\n --p[i].first;\n --p[i].second;\n uf.Union(p[i].first, xs + p[i].second);\n }\n map ss;\n for (int i = (0), _b = ((q)-1); i <= _b; i++) {\n int id = uf.Find(p[i].first);\n SetInfo& setInfo = ss[id];\n setInfo._xc.insert(p[i].first);\n setInfo._yc.insert(p[i].second);\n }\n long long got = 0;\n long long totX = 0, totY = 0;\n for (auto& p : ss) {\n totX += (long long)p.second._xc.size();\n totY += (long long)p.second._yc.size();\n }\n long long remX = xs - totX;\n long long remY = ys - totY;\n long long res = remX + remY - 1 + ss.size();\n cout << res;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n template \n T sqr(T x) {\n return x * x;\n }\n template \n T abs(T x) {\n return x < 0 ? -x : x;\n }\n template \n T gcd(T a, T b) {\n return b ? gcd(b, a % b) : a;\n }\n template \n bool chmin(T& x, const T& y) {\n if (x > y) {\n x = y;\n return true;\n }\n return false;\n }\n template \n bool chmax(T& x, const T& y) {\n if (x < y) {\n x = y;\n return true;\n }\n return false;\n }\n string to_bin(int x) {\n string ret;\n while (x) {\n ret = ret + (char)((x % 2) + '0');\n x /= 2;\n }\n return ret;\n }\n int main(int, char**) {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int t;\n cin >> t;\n while (t--) {\n long long n;\n cin >> n;\n long long m = (n - 1) / 3;\n int k = 0;\n long long p = 1;\n while (m >= p) {\n m -= p;\n k += 1;\n p *= 4;\n }\n vector a;\n for (int i = 0; i < k; ++i) {\n a.push_back(m % 4);\n m /= 4;\n }\n long long A, B;\n A = 1LL << (2 * k);\n B = 1LL << (2 * k + 1);\n vector b = {0, 2, 3, 1};\n for (int i = 0; i < k; ++i) {\n A ^= a[i] << (2 * i);\n B ^= b[a[i]] << (2 * i);\n }\n long long C = A ^ B;\n long long ans;\n if (n % 3 == 1) {\n ans = A;\n } else if (n % 3 == 2) {\n ans = B;\n } else {\n ans = C;\n }\n cout << ans << \n ;\n }\n cerr << Time execute: << clock() / (double)CLOCKS_PER_SEC << sec \n << endl;\n return 0;\n }\n "} {"func_code_string": "#include \n using namespace std;\n int main() {\n double n, m, a, b;\n cin >> n >> m >> a >> b;\n double s = n / m;\n long long int s1 = floor(s) * m;\n long long int s2 = ceil(s) * m;\n long long int a1 = (n - s1) * b;\n long long int a2 = (s2 - n) * a;\n cout << (min(a1, a2));\n }\n "}